aboutsummaryrefslogtreecommitdiffstats
path: root/manual
diff options
context:
space:
mode:
authorJakub Jelinek <jakub@redhat.com>2007-07-31 13:33:18 +0000
committerJakub Jelinek <jakub@redhat.com>2007-07-31 13:33:18 +0000
commit32c075e1f01849e161724bbd400ba77244e482cc (patch)
tree5f083a3f352104f32bb6c902d57fa3f294bd8d4d /manual
parentd6220e9ee38c1c9285221b023346201ec5f511b3 (diff)
downloadtermbaud-32c075e1f01849e161724bbd400ba77244e482cc.tar.gz
termbaud-32c075e1f01849e161724bbd400ba77244e482cc.tar.xz
termbaud-32c075e1f01849e161724bbd400ba77244e482cc.zip
.
Diffstat (limited to 'manual')
-rw-r--r--manual/argp.texi2
-rw-r--r--manual/charset.texi6
-rw-r--r--manual/conf.texi5
-rw-r--r--manual/errno.texi4
-rw-r--r--manual/filesys.texi10
-rw-r--r--manual/lang.texi2
-rw-r--r--manual/maint.texi2
-rw-r--r--manual/memory.texi8
-rw-r--r--manual/message.texi4
-rw-r--r--manual/resource.texi10
-rw-r--r--manual/search.texi18
-rw-r--r--manual/signal.texi2
-rw-r--r--manual/startup.texi2
-rw-r--r--manual/stdio.texi4
-rw-r--r--manual/string.texi9
-rw-r--r--manual/sysinfo.texi2
-rw-r--r--manual/syslog.texi2
-rw-r--r--manual/time.texi8
18 files changed, 55 insertions, 45 deletions
diff --git a/manual/argp.texi b/manual/argp.texi
index b37232306ba..090d49f7a57 100644
--- a/manual/argp.texi
+++ b/manual/argp.texi
@@ -832,7 +832,7 @@ Don't exit on errors, although they may still result in error messages.
@item ARGP_LONG_ONLY
Use the gnu getopt `long-only' rules for parsing arguments. This allows
long-options to be recognized with only a single @samp{-}
-(i.e., @samp{-help}). This results in a less useful interface, and its
+(i.e. @samp{-help}). This results in a less useful interface, and its
use is discouraged as it conflicts with the way most GNU programs work
as well as the GNU coding standards.
diff --git a/manual/charset.texi b/manual/charset.texi
index 8b2c09ca79a..5063246d616 100644
--- a/manual/charset.texi
+++ b/manual/charset.texi
@@ -207,7 +207,7 @@ and transmittal. Because each single wide character consists of more
than one byte, they are effected by byte-ordering. Thus, machines with
different endianesses would see different values when accessing the same
data. This byte ordering concern also applies for communication protocols
-that are all byte-based and therefore require that the sender has to
+that are all byte-based and, thereforet require that the sender has to
decide about splitting the wide character in bytes. A last (but not least
important) point is that wide characters often require more storage space
than a customized byte-oriented character set.
@@ -737,7 +737,7 @@ the return value is @math{0}. If the next @var{n} bytes form a valid
multibyte character, the number of bytes belonging to this multibyte
character byte sequence is returned.
-If the first @var{n} bytes possibly form a valid multibyte
+If the the first @var{n} bytes possibly form a valid multibyte
character but the character is incomplete, the return value is
@code{(size_t) -2}. Otherwise the multibyte character sequence is invalid
and the return value is @code{(size_t) -1}.
@@ -2231,7 +2231,7 @@ ordering of the processor (or at least the running process) is not the
same as the one required for UCS-4. This is done for performance reasons
as one does not want to perform unnecessary byte-swapping operations if
one is not interested in actually seeing the result in UCS-4. To avoid
-trouble with endianness, the internal representation consistently is named
+trouble with endianess, the internal representation consistently is named
@code{INTERNAL} even on big-endian systems where the representations are
identical.
diff --git a/manual/conf.texi b/manual/conf.texi
index 605e305071d..ef00db6b7b7 100644
--- a/manual/conf.texi
+++ b/manual/conf.texi
@@ -1455,6 +1455,11 @@ Inquire about the value of @code{_POSIX_ASYNC_IO}.
Inquire about the value of @code{_POSIX_PRIO_IO}.
@comment unistd.h
+@comment POSIX.1g
+@item _PC_SOCK_MAXBUF
+Inquire about the value of @code{_POSIX_PIPE_BUF}.
+
+@comment unistd.h
@comment LFS
@item _PC_FILESIZEBITS
Inquire about the availability of large files on the filesystem.
diff --git a/manual/errno.texi b/manual/errno.texi
index dd9f861dc86..e230506427a 100644
--- a/manual/errno.texi
+++ b/manual/errno.texi
@@ -1434,7 +1434,7 @@ like those given to the @code{printf} family of functions. The
arguments required for the format can follow the @var{format} parameter.
Just like @code{perror}, @code{error} also can report an error code in
textual form. But unlike @code{perror} the error value is explicitly
-passed to the function in the @var{errnum} parameter. This eliminates
+passed to the function in the @var{errnum} parameter. This elimintates
the problem mentioned above that the error reporting function must be
called immediately after the function causing the error since otherwise
@code{errno} might have a different value.
@@ -1479,7 +1479,7 @@ in an input file (like a programming language source code file etc).
If the global variable @code{error_one_per_line} is set to a non-zero
value @code{error_at_line} will avoid printing consecutive messages for
-the same file and line. Repetition which are not directly following
+the same file anem line. Repetition which are not directly following
each other are not caught.
Just like @code{error} this function only returned if @var{status} is
diff --git a/manual/filesys.texi b/manual/filesys.texi
index 9719d419468..2436f22e884 100644
--- a/manual/filesys.texi
+++ b/manual/filesys.texi
@@ -131,7 +131,7 @@ this function is deprecated.
@comment GNU
@deftypefun {char *} get_current_dir_name (void)
@vindex PWD
-This @code{get_current_dir_name} function is basically equivalent to
+This @code{get_current_dir_name} function is bascially equivalent to
@w{@code{getcwd (NULL, 0)}}. The only difference is that the value of
the @code{PWD} variable is returned if this value is correct. This is a
subtle difference which is visible if the path described by the
@@ -917,7 +917,7 @@ function returns a value other than @math{0} this value is returned as
the return value of @code{ftw}.
When the sources are compiled with @code{_FILE_OFFSET_BITS == 64} on a
-32-bit system this function is in fact @code{ftw64}, i.e., the LFS
+32-bit system this function is in fact @code{ftw64}, i.e. the LFS
interface transparently replaces the old interface.
@end deftypefun
@@ -990,7 +990,7 @@ accordingly. If the return value of a callback invocation was non-zero
then that value is returned.
When the sources are compiled with @code{_FILE_OFFSET_BITS == 64} on a
-32-bit system this function is in fact @code{nftw64}, i.e., the LFS
+32-bit system this function is in fact @code{nftw64}, i.e. the LFS
interface transparently replaces the old interface.
@end deftypefun
@@ -1434,7 +1434,7 @@ the existing directory named @var{newname} is deleted first. The name
One useful feature of @code{rename} is that the meaning of @var{newname}
changes ``atomically'' from any previously existing file by that name to
-its new meaning (i.e., the file that was called @var{oldname}). There is
+its new meaning (i.e. the file that was called @var{oldname}). There is
no instant at which @var{newname} is non-existent ``in between'' the old
meaning and the new meaning. If there is a system crash during the
operation, it is possible for both names to still exist; but
@@ -3104,7 +3104,7 @@ terminates abnormally).
This function is reentrant.
When the sources are compiled with @code{_FILE_OFFSET_BITS == 64} on a
-32-bit system this function is in fact @code{tmpfile64}, i.e., the LFS
+32-bit system this function is in fact @code{tmpfile64}, i.e. the LFS
interface transparently replaces the old interface.
@end deftypefun
diff --git a/manual/lang.texi b/manual/lang.texi
index 82c5e962a04..96f6d9df553 100644
--- a/manual/lang.texi
+++ b/manual/lang.texi
@@ -1274,7 +1274,7 @@ type of a particular structure member.
@comment ISO
@deftypefn {Macro} size_t offsetof (@var{type}, @var{member})
This expands to a integer constant expression that is the offset of the
-structure member named @var{member} in the structure type @var{type}.
+structure member named @var{member} in a the structure type @var{type}.
For example, @code{offsetof (struct s, elem)} is the offset, in bytes,
of the member @code{elem} in a @code{struct s}.
diff --git a/manual/maint.texi b/manual/maint.texi
index 567db981a30..2b9221233a2 100644
--- a/manual/maint.texi
+++ b/manual/maint.texi
@@ -156,7 +156,7 @@ subdirectories under it intended to be new specific categories.
to look for a system-dependent version of a file that's not in
@file{generic}. This means that any system-dependent source file must
have an analogue in @file{generic}, even if the routines defined by that
-file are not implemented on other platforms. Second, the @file{generic}
+file are not implemented on other platforms. Second. the @file{generic}
version of a system-dependent file is used if the makefiles do not find
a version specific to the system you're compiling for.
diff --git a/manual/memory.texi b/manual/memory.texi
index cbe147b7120..91b9d84eb26 100644
--- a/manual/memory.texi
+++ b/manual/memory.texi
@@ -31,7 +31,7 @@ One of the most basic resources a process has available to it is memory.
There are a lot of different ways systems organize memory, but in a
typical one, each process has one linear virtual address space, with
addresses running from zero to some huge maximum. It need not be
-contiguous; i.e., not all of these addresses actually can be used to
+contiguous; i.e. not all of these addresses actually can be used to
store data.
The virtual memory is divided into pages (4 kilobytes is typical).
@@ -1065,7 +1065,7 @@ This is the total size of memory occupied by free (not in use) chunks.
@item int keepcost
This is the size of the top-most releasable chunk that normally
-borders the end of the heap (i.e., the high end of the virtual address
+borders the end of the heap (i.e. the high end of the virtual address
space's data segment).
@end table
@@ -2407,7 +2407,7 @@ of the data segment is.
@cindex paging
You can tell the system to associate a particular virtual memory page
-with a real page frame and keep it that way --- i.e., cause the page to
+with a real page frame and keep it that way --- i.e. cause the page to
be paged in if it isn't already and mark it so it will never be paged
out and consequently will never cause a page fault. This is called
@dfn{locking} a page.
@@ -2467,7 +2467,7 @@ A memory lock is associated with a virtual page, not a real frame. The
paging rule is: If a frame backs at least one locked page, don't page it
out.
-Memory locks do not stack. I.e., you can't lock a particular page twice
+Memory locks do not stack. I.e. you can't lock a particular page twice
so that it has to be unlocked twice before it is truly unlocked. It is
either locked or it isn't.
diff --git a/manual/message.texi b/manual/message.texi
index e772b2de1fd..1507a6d04af 100644
--- a/manual/message.texi
+++ b/manual/message.texi
@@ -1810,8 +1810,8 @@ help to understand the input better.
Other programs help to manage development cycle when new messages appear
in the source files or when a new translation of the messages appear.
-Here it should only be noted that using all the tools in GNU gettext it
-is possible to @emph{completely} automate the handling of message
+here it should only be noted that using all the tools in GNU gettext it
+is possible to @emph{completely} automize the handling of message
catalog. Beside marking the translatable string in the source code and
generating the translations the developers do not have anything to do
themselves.
diff --git a/manual/resource.texi b/manual/resource.texi
index aabd28976a7..df77408e684 100644
--- a/manual/resource.texi
+++ b/manual/resource.texi
@@ -584,7 +584,7 @@ to}, but doesn't @emph{need to} run occupies the CPU.
@cindex preemptive scheduling
When two processes are in contention to use the CPU at any instant, the
one with the higher absolute priority always gets it. This is true even if the
-process with the lower priority is already using the CPU (i.e., the
+process with the lower priority is already using the CPU (i.e. the
scheduling is preemptive). Of course, we're only talking about
processes that are running or ``ready to run,'' which means they are
ready to execute instructions right now. When a process blocks to wait
@@ -819,7 +819,7 @@ existing policy is not @code{SCHED_OTHER}.
@item
The calling process does not have @code{CAP_SYS_NICE} permission and its
-owner is not the target process' owner. I.e., the effective uid of the
+owner is not the target process' owner. I.e. the effective uid of the
calling process is neither the effective nor the real uid of process
@var{pid}.
@c We need a cross reference to the capabilities section, when written.
@@ -1185,7 +1185,7 @@ The value of @var{class} is not valid.
@item EPERM
The call would set the nice value of a process which is owned by a different
-user than the calling process (i.e., the target process' real or effective
+user than the calling process (i.e. the target process' real or effective
uid does not match the calling process' effective uid) and the calling
process does not have @code{CAP_SYS_NICE} permission.
@@ -1215,7 +1215,7 @@ a process group ID (pgid).
@comment sys/resource.h
@comment BSD
@item PRIO_USER
-All the processes owned by a particular user (i.e., whose real uid
+All the processes owned by a particular user (i.e. whose real uid
indicates the user). The argument @var{id} is a user ID (uid).
@end vtable
@@ -1272,7 +1272,7 @@ other process or thread is allowed to use.
@item
The access to certain resources (RAM, I/O ports) has different costs
from different CPUs. This is the case in NUMA (Non-Uniform Memory
-Architecture) machines. Preferably memory should be accessed locally
+Architecture) machines. Preferrably memory should be accessed locally
but this requirement is usually not visible to the scheduler.
Therefore forcing a process or thread to the CPUs which have local
access to the mostly used memory helps to significantly boost the
diff --git a/manual/search.texi b/manual/search.texi
index 0afd0aecd06..1ac2653f169 100644
--- a/manual/search.texi
+++ b/manual/search.texi
@@ -82,7 +82,7 @@ starting at @var{base} if it is found. If no matching element is
available @code{NULL} is returned.
The mean runtime of this function is @code{*@var{nmemb}}/2. This
-function should only be used if elements often get added to or deleted from
+function should only be used elements often get added to or deleted from
the array in which case it might not be useful to sort the array before
searching.
@end deftypefun
@@ -247,21 +247,21 @@ Couldn't find Janice.
@node Hash Search Function
@section The @code{hsearch} function.
-The functions mentioned so far in this chapter are for searching in a sorted
+The functions mentioned so far in this chapter are searching in a sorted
or unsorted array. There are other methods to organize information
which later should be searched. The costs of insert, delete and search
differ. One possible implementation is using hashing tables.
-The following functions are declared in the header file @file{search.h}.
+The following functions are declared in the the header file @file{search.h}.
@comment search.h
@comment SVID
@deftypefun int hcreate (size_t @var{nel})
The @code{hcreate} function creates a hashing table which can contain at
least @var{nel} elements. There is no possibility to grow this table so
-it is necessary to choose the value for @var{nel} wisely. The method
-used to implement this function might make it necessary to make the
+it is necessary to choose the value for @var{nel} wisely. The used
+methods to implement this function might make it necessary to make the
number of elements in the hashing table larger than the expected maximal
-number of elements. Hashing tables usually work inefficiently if they are
+number of elements. Hashing tables usually work inefficient if they are
filled 80% or more. The constant access time guaranteed by hashing can
only be achieved if few collisions exist. See Knuth's ``The Art of
Computer Programming, Part 3: Searching and Sorting'' for more
@@ -368,9 +368,9 @@ necessary for the @code{struct hsearch_data} object can be allocated
dynamically. It must be initialized with zero before calling this
function.
-The return value is non-zero if the operation was successful. If the
-return value is zero, something went wrong, which probably means the
-programs ran out of memory.
+The return value is non-zero if the operation were successful. if the
+return value is zero something went wrong which probably means the
+programs runs out of memory.
@end deftypefun
@comment search.h
diff --git a/manual/signal.texi b/manual/signal.texi
index dfaaa889506..cbf746639ac 100644
--- a/manual/signal.texi
+++ b/manual/signal.texi
@@ -2567,7 +2567,7 @@ The prototype for the @code{sigprocmask} function is in @file{signal.h}.
Note that you must not use @code{sigprocmask} in multi-threaded processes,
because each thread has its own signal mask and there is no single process
signal mask. According to POSIX, the behavior of @code{sigprocmask} in a
-multi-threaded process is ``unspecified''.
+multi-threaded process is ``unspeficied''.
Instead, use @code{pthread_sigmask}.
@ifset linuxthreads
@xref{Threads and Signal Handling}.
diff --git a/manual/startup.texi b/manual/startup.texi
index 79c79683f74..5ccb78b9585 100644
--- a/manual/startup.texi
+++ b/manual/startup.texi
@@ -830,7 +830,7 @@ mean that there was difficulty in opening the files.
Don't confuse a program's exit status with a process' termination status.
There are lots of ways a process can terminate besides having it's program
finish. In the event that the process termination @emph{is} caused by program
-termination (i.e., @code{exit}), though, the program's exit status becomes
+termination (i.e. @code{exit}), though, the program's exit status becomes
part of the process' termination status.
@node Cleanups on Exit
diff --git a/manual/stdio.texi b/manual/stdio.texi
index 30a6e6ebe07..977989d95ee 100644
--- a/manual/stdio.texi
+++ b/manual/stdio.texi
@@ -433,7 +433,7 @@ see @ref{Stream Buffering}.
@cindex multi-threaded application
Streams can be used in multi-threaded applications in the same way they
are used in single-threaded applications. But the programmer must be
-aware of the possible complications. It is important to know about
+aware of a the possible complications. It is important to know about
these also if the program one writes never use threads since the design
and implementation of many stream functions is heavily influenced by the
requirements added by multi-threaded programming.
@@ -1992,7 +1992,7 @@ the precision. The exponent always contains at least two digits. The
The @samp{%g} and @samp{%G} conversions print the argument in the style
of @samp{%e} or @samp{%E} (respectively) if the exponent would be less
than -4 or greater than or equal to the precision; otherwise they use
-the @samp{%f} style. A precision of @code{0}, is taken as 1.
+the @samp{%f} style. A precision of @code{0}, is taken as 1. is
Trailing zeros are removed from the fractional portion of the result and
a decimal-point character appears only if it is followed by a digit.
diff --git a/manual/string.texi b/manual/string.texi
index 2fe60395ebd..f582bad96d5 100644
--- a/manual/string.texi
+++ b/manual/string.texi
@@ -1187,8 +1187,8 @@ regards these characters as parts of the alphabet they do match.
@comment ISO
@deftypefun int strncmp (const char *@var{s1}, const char *@var{s2}, size_t @var{size})
This function is the similar to @code{strcmp}, except that no more than
-@var{size} characters are compared. In other words, if the two
-strings are the same in their first @var{size} characters, the
+@var{size} wide characters are compared. In other words, if the two
+strings are the same in their first @var{size} wide characters, the
return value is zero.
@end deftypefun
@@ -1966,6 +1966,11 @@ Note that ``character'' is here used in the sense of byte. In a string
using a multibyte character encoding (abstract) character consisting of
more than one byte are not treated as an entity. Each byte is treated
separately. The function is not locale-dependent.
+
+Note that ``character'' is here used in the sense of byte. In a string
+using a multibyte character encoding (abstract) character consisting of
+more than one byte are not treated as an entity. Each byte is treated
+separately. The function is not locale-dependent.
@end deftypefun
@comment wchar.h
diff --git a/manual/sysinfo.texi b/manual/sysinfo.texi
index 8f2dd451be8..0a448303590 100644
--- a/manual/sysinfo.texi
+++ b/manual/sysinfo.texi
@@ -872,7 +872,7 @@ shall be accessible while the filesystem is mounted.
@item MS_SYNCHRONOUS
This bit on specifies that all writes to the filesystem while it is
-mounted shall be synchronous; i.e., data shall be synced before each
+mounted shall be synchronous; i.e. data shall be synced before each
write completes rather than held in the buffer cache.
@item MS_MANDLOCK
diff --git a/manual/syslog.texi b/manual/syslog.texi
index 3d7def83f79..df4179e27aa 100644
--- a/manual/syslog.texi
+++ b/manual/syslog.texi
@@ -370,7 +370,7 @@ The message is only for debugging purposes.
Results are undefined if the priority code is anything else.
-If the process does not presently have a Syslog connection open (i.e.,
+If the process does not presently have a Syslog connection open (i.e.
it did not call @code{openlog}), @code{syslog} implicitly opens the
connection the same as @code{openlog} would, with the following defaults
for information that would otherwise be included in an @code{openlog}
diff --git a/manual/time.texi b/manual/time.texi
index a3e8438bcef..9b87d3eed06 100644
--- a/manual/time.texi
+++ b/manual/time.texi
@@ -193,7 +193,7 @@ total amount of time a process has actively used a CPU since some
arbitrary event. On the GNU system, that event is the creation of the
process. While arbitrary in general, the event is always the same event
for any particular process, so you can always measure how much time on
-the CPU a particular computation takes by examining the process' CPU
+the CPU a particular computation takes by examinining the process' CPU
time before and after the computation.
@cindex CPU time
@cindex clock ticks
@@ -447,7 +447,7 @@ current calendar time is not available, the value
@comment time.h
@comment SVID, XPG
@deftypefun int stime (time_t *@var{newtime})
-@code{stime} sets the system clock, i.e., it tells the system that the
+@code{stime} sets the system clock, i.e. it tells the system that the
current calendar time is @var{newtime}, where @code{newtime} is
interpreted as described in the above definition of @code{time_t}.
@@ -1470,7 +1470,7 @@ widely available.
@node Low-Level Time String Parsing
@subsubsection Interpret string according to given format
-The first function is rather low-level. It is nevertheless frequently
+he first function is rather low-level. It is nevertheless frequently
used in software since it is better known. Its interface and
implementation are heavily influenced by the @code{getdate} function,
which is defined and implemented in terms of calls to @code{strptime}.
@@ -1790,7 +1790,7 @@ process. If the input string contains more characters than required by
the format string the return value points right after the last consumed
input character. If the whole input string is consumed the return value
points to the @code{NULL} byte at the end of the string. If an error
-occurs, i.e., @code{strptime} fails to match all of the format string,
+occurs, i.e. @code{strptime} fails to match all of the format string,
the function returns @code{NULL}.
@end deftypefun