Update.

2001-05-21  Andreas Jaeger  <aj@suse.de>

	* locale/programs/ld-collate.c (handle_ellipsis): Fix message.
	Patch by Philipp Thomas <pthomas@suse.de>.

ChangeLog

@@ -1,3 +1,8 @@
+2001-05-21  Andreas Jaeger  <aj@suse.de>
+
+	* locale/programs/ld-collate.c (handle_ellipsis): Fix message.
+	Patch by Philipp Thomas <pthomas@suse.de>.
+
 2001-05-17  Bruce Mitchener  <bruce@cubik.org>
 
 	* manual/arpg.texi: Spelling, misc fixes.

locale/programs/ld-collate.c

@@ -1246,7 +1246,7 @@ order for `%.*s' already defined at %s:%Zu"),
 		  "LC_COLLATE");
       else if (endp == NULL)
 	lr_error (ldfile, _("\
-%s: symbolic range ellipsis must not be direct followed by `order_end'"),
+%s: symbolic range ellipsis must not be directly followed by `order_end'"),
 		  "LC_COLLATE");
       else
 	{

manual/argp.texi

@@ -810,7 +810,7 @@ Don't print error messages for unknown options to @code{stderr}; unless
 this flag is set, @code{ARGP_PARSE_ARGV0} is ignored, as @code{argv[0]}
 is used as the program name in the error messages.  This flag implies
 @code{ARGP_NO_EXIT} (on the assumption that silent exiting upon errors
-is bad behaviour).
+is bad behavior).
 
 @comment argp.h
 @comment GNU

manual/arith.texi

@@ -112,7 +112,7 @@ follow these examples: @code{INT32_MAX}, @code{UINT8_MAX},
 @code{INTMAX_MAX}, @code{INTMAX_MIN}.  Note that there are no macros for
 unsigned integer minima.  These are always zero.
 @cindex maximum possible integer
-@cindex mininum possible integer
+@cindex minimum possible integer
 
 There are similar macros for use with C's built in integer types which
 should come with your C compiler.  These are described in @ref{Data Type

manual/crypt.texi

@@ -9,7 +9,7 @@ authentication; for instance, a workstation which is not connected to a
 network probably does not need any user authentication, because to use
 the machine an intruder must have physical access.
 
-Sometimes, however, it is necessary to be sure that a user is authorised
+Sometimes, however, it is necessary to be sure that a user is authorized
 to use some service a machine provides---for instance, to log in as a
 particular user id (@pxref{Users and Groups}).  One traditional way of
 doing this is for each user to choose a secret @dfn{password}; then, the
@@ -45,7 +45,7 @@ to provide a definitive survey of the laws affecting cryptography.
 Instead, this section warns you of some of the known trouble spots; this
 may help you when you try to find out what the laws of your country are.
 
-Some countries require that you have a licence to use, posess, or import
+Some countries require that you have a licence to use, possess, or import
 cryptography.  These countries are believed to include Byelorussia,
 Burma, India, Indonesia, Israel, Kazakhstan, Pakistan, Russia, and Saudi
 Arabia.
@@ -203,13 +203,13 @@ header @file{crypt.h}.
 The Data Encryption Standard is described in the US Government Federal
 Information Processing Standards (FIPS) 46-3 published by the National
 Institute of Standards and Technology.  The DES has been very thoroughly
-analysed since it was developed in the late 1970s, and no new
+analyzed since it was developed in the late 1970s, and no new
 significant flaws have been found.
 
 However, the DES uses only a 56-bit key (plus 8 parity bits), and a
 machine has been built in 1998 which can search through all possible
 keys in about 6 days, which cost about US$200000; faster searches would
-be possible with more money.  This makes simple DES unsecure for most
+be possible with more money.  This makes simple DES insecure for most
 purposes, and NIST no longer permits new US government systems
 to use simple DES.
 
@@ -261,7 +261,7 @@ stored in a @code{char}, but there are no parity bits in @var{block}.
 These are reentrant versions of @code{setkey} and @code{encrypt}.  The
 only difference is the extra parameter, which stores the expanded
 version of @var{key}.  Before calling @code{setkey_r} the first time,
-@code{data->initialised} must be cleared to zero.
+@code{data->initialized} must be cleared to zero.
 @end deftypefun
 
 The @code{setkey_r} and @code{encrypt_r} functions are GNU extensions.

manual/debug.texi

@@ -46,9 +46,9 @@ and is at most @var{size}.
 The pointers placed in @var{buffer} are actually return addresses
 obtained by inspecting the stack, one return address per stack frame.
 
-Note that certain compiler optimisations may interfere with obtaining a
+Note that certain compiler optimizations may interfere with obtaining a
 valid backtrace.  Function inlining causes the inlined function to not
-have a stack frame; tail call optimisation replaces one stack frame with
+have a stack frame; tail call optimization replaces one stack frame with
 another; frame pointer elimination will stop @code{backtrace} from
 interpreting the stack contents correctly.
 @end deftypefun

manual/getopt.texi

@@ -88,7 +88,7 @@ is treated specially.  It permits arguments that are not options to be
 returned as if they were associated with option character @samp{\1}.
 
 @item
-POSIX demands the following behaviour: The first non-option stops option
+POSIX demands the following behavior: The first non-option stops option
 processing.  This mode is selected by either setting the environment
 variable @code{POSIXLY_CORRECT} or beginning the @var{options} argument
 string with a plus sign (@samp{+}).

manual/intro.texi

@@ -442,8 +442,8 @@ been redefined by the user.  Some library facilities, such as those for
 dealing with variadic arguments (@pxref{Variadic Functions})
 and non-local exits (@pxref{Non-Local Exits}), actually require a
 considerable amount of cooperation on the part of the C compiler, and
-implementationally it might be easier for the compiler to treat these as
-built-in parts of the language.
+with respect to the implementation, it might be easier for the compiler
+to treat these as built-in parts of the language.
 @end itemize
 
 In addition to the names documented in this manual, reserved names

manual/llio.texi

@@ -1402,7 +1402,74 @@ not support mapping at all.  Thus, programs using @code{mmap} should
 have a fallback method to use should it fail. @xref{Mmap,,,standards,GNU
 Coding Standards}.
 
-@c XXX madvise documentation missing
+@comment sys/mman.h
+@comment POSIX
+@deftypefun int madvise (void *@var{addr}, size_t @var{length}, int @var{advice})
+
+This function can be used to provide the system with @var{advice} about
+the intended usage patterns of the memory region starting at @var{addr}
+and extending @var{length} bytes.
+
+The valid BSD values for @var{advice} are:
+
+@table @code
+
+@item MADV_NORMAL
+The region should receive no further special treatment.
+
+@item MADV_RANDOM
+The region will be accessed via random page references. The kernel
+should page-in the minimal number of pages for each page fault.
+
+@item MADV_SEQUENTIAL
+The region will be accessed via sequential page references. This
+may cause the kernel to aggressively read-ahead, expecting further
+sequential references after any page fault within this region.
+
+@item MADV_WILLNEED
+The region will be needed.  The pages within this region may
+be pre-faulted in by the kernel.
+
+@item MADV_DONTNEED
+The region is no longer needed.  The kernel may free these pages,
+causing any changes to the pages to be lost, as well as swapped
+out pages to be discarded.
+
+@end table
+
+The POSIX names are slightly different, but with the same meanings:
+
+@table @code
+
+@item POSIX_MADV_NORMAL
+This corresponds with BSD's @code{MADV_NORMAL}.
+
+@item POSIX_MADV_RANDOM
+This corresponds with BSD's @code{MADV_RANDOM}.
+
+@item POSIX_MADV_SEQUENTIAL
+This corresponds with BSD's @code{MADV_SEQUENTIAL}.
+
+@item POSIX_MADV_WILLNEED
+This corresponds with BSD's @code{MADV_WILLNEED}.
+
+@item POSIX_MADV_DONTNEED
+This corresponds with BSD's @code{MADV_DONTNEED}.
+
+@end table
+
+@code{msync} returns @math{0} for success and @math{-1} for
+error.  Errors include:
+@table @code
+
+@item EINVAL
+An invalid region was given, or the @var{advice} was invalid.
+
+@item EFAULT
+There is no existing mapping in at least part of the given region.
+
+@end table
+@end deftypefun
 
 @node Waiting for I/O
 @section Waiting for Input or Output

manual/memory.texi

@@ -810,7 +810,7 @@ track down.
 
 There is one problem with @code{MALLOC_CHECK_}: in SUID or SGID binaries
 it could possibly be exploited since diverging from the normal programs
-behaviour it now writes something to the standard error desriptor.
+behavior it now writes something to the standard error descriptor.
 Therefore the use of @code{MALLOC_CHECK_} is disabled by default for
 SUID and SGID binaries.  It can be enabled again by the system
 administrator by adding a file @file{/etc/suid-debug} (the content is
@@ -971,7 +971,7 @@ my_malloc_hook (size_t size, const void *caller)
   __free_hook = old_free_hook;
   /* Call recursively */
   result = malloc (size);
-  /* Save underlaying hooks */
+  /* Save underlying hooks */
   old_malloc_hook = __malloc_hook;
   old_free_hook = __free_hook;
   /* @r{@code{printf} might call @code{malloc}, so protect it too.} */
@@ -990,7 +990,7 @@ my_free_hook (void *ptr, const void *caller)
   __free_hook = old_free_hook;
   /* Call recursively */
   free (ptr);
-  /* Save underlaying hooks */
+  /* Save underlying hooks */
   old_malloc_hook = __malloc_hook;
   old_free_hook = __free_hook;
   /* @r{@code{printf} might call @code{free}, so protect it too.} */
@@ -1166,7 +1166,7 @@ variable named @code{MALLOC_TRACE}.  This variable is supposed to
 contain a valid file name.  The user must have write access.  If the
 file already exists it is truncated.  If the environment variable is not
 set or it does not name a valid file which can be opened for writing
-nothing is done.  The behaviour of @code{malloc} etc. is not changed.
+nothing is done.  The behavior of @code{malloc} etc. is not changed.
 For obvious reasons this also happens if the application is installed
 with the SUID or SGID bit set.
 
@@ -1185,7 +1185,7 @@ systems.  The prototype can be found in @file{mcheck.h}.
 @comment GNU
 @deftypefun void muntrace (void)
 The @code{muntrace} function can be called after @code{mtrace} was used
-to enable tracing the @code{malloc} calls.  If no (succesful) call of
+to enable tracing the @code{malloc} calls.  If no (successful) call of
 @code{mtrace} was made @code{muntrace} does nothing.
 
 Otherwise it deinstalls the handlers for @code{malloc}, @code{realloc},
@@ -1200,7 +1200,7 @@ systems.  The prototype can be found in @file{mcheck.h}.
 @subsubsection Example program excerpts
 
 Even though the tracing functionality does not influence the runtime
-behaviour of the program it is not a good idea to call @code{mtrace} in
+behavior of the program it is not a good idea to call @code{mtrace} in
 all programs.  Just imagine that you debug a program using @code{mtrace}
 and all other programs used in the debugging session also trace their
 @code{malloc} calls.  The output file would be the same for all programs
@@ -2622,7 +2622,7 @@ executed this function and specified @code{MCL_CURRENT}, any system call
 by the process that requires space be added to its virtual address space
 fails with @code{errno} = @code{ENOMEM} if locking the additional space
 would cause the process to exceed its locked page limit.  In the case
-that the address space addition that can't be accomodated is stack
+that the address space addition that can't be accommodated is stack
 expansion, the stack expansion fails and the kernel sends a
 @code{SIGSEGV} signal to the process.
 

manual/nss.texi

@@ -487,7 +487,7 @@ the next three arguments are:
 pointer to buffer where the result is stored.  @code{STRUCT_TYPE} is
 normally a struct which corresponds to the database.
 @item char *buffer
-pointer to a buffer where the function can store additional adata for
+pointer to a buffer where the function can store additional data for
 the result etc.
 @item size_t buflen
 length of the buffer pointed to by @var{buffer}.
@@ -541,7 +541,7 @@ Modules using the old interface will still be usable.
 
 Developers of a new service will have to make sure that their module is
 created using the correct interface number.  This means the file itself
-must have the correct name and on ElF systems the @dfn{soname} (Shared
+must have the correct name and on ELF systems the @dfn{soname} (Shared
 Object Name) must also have this number.  Building a module from a bunch
 of object files on an ELF system using GNU CC could be done like this:
 
@@ -650,7 +650,7 @@ If there is additional data to return (say strings, where the
 @var{buffer} or length @var{buflen}.  There must not be any references
 to non-constant global data.
 
-The implementation of this function should honour the @var{stayopen}
+The implementation of this function should honor the @var{stayopen}
 flag set by the @code{set@var{DB}ent} function whenever this makes sense.
 
 Before the function returns the implementation should store the value of

manual/pattern.texi

@@ -112,19 +112,19 @@ separated list of patterns.
 
 @table @code
 @item ?(@var{pattern-list})
-The pattern matches if zero or one occurences of any of the patterns
+The pattern matches if zero or one occurrences of any of the patterns
 in the @var{pattern-list} allow matching the input string.
 
 @item *(@var{pattern-list})
-The pattern matches if zero or more occurences of any of the patterns
+The pattern matches if zero or more occurrences of any of the patterns
 in the @var{pattern-list} allow matching the input string.
 
 @item +(@var{pattern-list})
-The pattern matches if one or more occurences of any of the patterns
+The pattern matches if one or more occurrences of any of the patterns
 in the @var{pattern-list} allow matching the input string.
 
 @item @@(@var{pattern-list})
-The pattern matches if exactly one occurence of any of the patterns in
+The pattern matches if exactly one occurrence of any of the patterns in
 the @var{pattern-list} allows matching the input string.
 
 @item !(@var{pattern-list})
@@ -376,7 +376,7 @@ It was impossible to allocate memory to hold the result.
 In the event of an error, @code{glob} stores information in
 @code{*@var{vector-ptr}} about all the matches it has found so far.
 
-It is important to notive that the @code{glob} function will not fail if
+It is important to notice that the @code{glob} function will not fail if
 it encounters directories or files which cannot be handled without the
 LFS interfaces.  The implementation of @code{glob} is supposed to use
 these functions internally.  This at least is the assumptions made by
@@ -548,7 +548,7 @@ there is one).
 
 The string between the matching braces is separated into single
 expressions by splitting at @code{,} (comma) characters.  The commas
-themself are discarded.  Please note what we said above about recursive
+themselves are discarded.  Please note what we said above about recursive
 brace expressions.  The commas used to separate the subexpressions must
 be at the same level.  Commas in brace subexpressions are not matched.
 They are used during expansion of the brace expression of the deeper

manual/process.texi

@@ -66,12 +66,12 @@ status code can be interpreted.
 If the @var{command} argument is a null pointer, a return value of zero
 indicates that no command processor is available.
 
-This function is a cancelation point in multi-threaded programs.  This
+This function is a cancellation point in multi-threaded programs.  This
 is a problem if the thread allocates some resources (like memory, file
 descriptors, semaphores or whatever) at the time @code{system} is
 called.  If the thread gets canceled these resources stay allocated
 until the program ends.  To avoid this calls to @code{system} should be
-protected using cancelation handlers.
+protected using cancellation handlers.
 @c ref pthread_cleanup_push / pthread_cleanup_pop
 
 @pindex stdlib.h
@@ -492,12 +492,12 @@ processes as well as processes that have terminated.
 The status information from the child process is stored in the object
 that @var{status-ptr} points to, unless @var{status-ptr} is a null pointer.
 
-This function is a cancelation point in multi-threaded programs.  This
+This function is a cancellation point in multi-threaded programs.  This
 is a problem if the thread allocates some resources (like memory, file
 descriptors, semaphores or whatever) at the time @code{waitpid} is
 called.  If the thread gets canceled these resources stay allocated
 until the program ends.  To avoid this calls to @code{waitpid} should be
-protected using cancelation handlers.
+protected using cancellation handlers.
 @c ref pthread_cleanup_push / pthread_cleanup_pop
 
 The return value is normally the process ID of the child process whose
@@ -579,12 +579,12 @@ is exactly equivalent to:
 waitpid (-1, &status, 0)
 @end smallexample
 
-This function is a cancelation point in multi-threaded programs.  This
+This function is a cancellation point in multi-threaded programs.  This
 is a problem if the thread allocates some resources (like memory, file
 descriptors, semaphores or whatever) at the time @code{wait} is
 called.  If the thread gets canceled these resources stay allocated
 until the program ends.  To avoid this calls to @code{wait} should be
-protected using cancelation handlers.
+protected using cancellation handlers.
 @c ref pthread_cleanup_push / pthread_cleanup_pop
 @end deftypefun