2000-02-22  Ulrich Drepper  <drepper@redhat.com>

	* locales/mk_MK: New file.
	Contributed by Damjan Georgievski <gdamjan@freemail.org.mk>
	* SUPPORTED: Add mk_MK ISO-8859-1.
This commit is contained in:
Ulrich Drepper 2000-02-22 09:00:35 +00:00
parent 384cbe9b1e
commit 49c091e523
42 changed files with 3131 additions and 67 deletions

View file

@ -357,7 +357,7 @@ struct hol_cluster
const char *header;
/* Used to order clusters within the same group with the same parent,
according to the order in which they occured in the parent argp's child
according to the order in which they occurred in the parent argp's child
list. */
int index;
@ -1419,7 +1419,7 @@ argp_args_usage (const struct argp *argp, const struct argp_state *state,
following the `\v' character (nothing for strings without). Each separate
bit of documentation is separated a blank line, and if PRE_BLANK is true,
then the first is as well. If FIRST_ONLY is true, only the first
occurance is output. Returns true if anything was output. */
occurrence is output. Returns true if anything was output. */
static int
argp_doc (const struct argp *argp, const struct argp_state *state,
int post, int pre_blank, int first_only,

View file

@ -184,7 +184,7 @@ typedef error_t (*argp_parser_t) (int key, char *arg,
argp's, and perhaps a function to filter help output. When actually
parsing options, getopt is called with the union of all the argp
structures chained together through their CHILD pointers, with conflicts
being resolved in favor of the first occurance in the chain. */
being resolved in favor of the first occurrence in the chain. */
struct argp
{
/* An array of argp_option structures, terminated by an entry with both

View file

@ -59,7 +59,7 @@ _dl_new_object (char *realname, const char *libname, int type,
while (l->l_next)
l = l->l_next;
new->l_prev = l;
/* new->l_next = NULL; Would be necesary but we use calloc. */
/* new->l_next = NULL; Would be necessary but we use calloc. */
l->l_next = new;
/* Add the global scope. */

View file

@ -249,7 +249,7 @@ _dl_open (const char *file, int mode, const void *caller)
if (errstring)
{
/* Some error occured during loading. */
/* Some error occurred during loading. */
char *local_errstring;
/* Remove the object from memory. It may be in an inconsistent

View file

@ -1055,7 +1055,7 @@ typedef struct
#define EF_MIPS_ARCH_4 0x30000000 /* -mips4 code. */
#define EF_MIPS_ARCH_5 0x40000000 /* -mips5 code. */
/* The following are non-official names and should ot be used. */
/* The following are non-official names and should not be used. */
#define E_MIPS_ARCH_1 0x00000000 /* -mips1 code. */
#define E_MIPS_ARCH_2 0x10000000 /* -mips2 code. */

View file

@ -642,7 +642,7 @@ of this helper program; chances are you did not intend to run this program.\n\
_dl_rtld_map.l_prev = _dl_loaded;
/* We have two ways to specify objects to preload: via environment
variable and via the file /etc/ld.so.preload. The later can also
variable and via the file /etc/ld.so.preload. The latter can also
be used when security is enabled. */
preloads = NULL;
npreloads = 0;

View file

@ -56,7 +56,7 @@ __gconv_open (const char *toset, const char *fromset, __gconv_t *handle,
nsteps * sizeof (struct __gconv_step_data));
/* Call all initialization functions for the transformation
step implemenations. */
step implementations. */
for (cnt = 0; cnt < nsteps; ++cnt)
{
/* If this is the last step we must not allocate an

View file

@ -1,3 +1,9 @@
2000-02-22 Ulrich Drepper <drepper@redhat.com>
* locales/mk_MK: New file.
Contributed by Damjan Georgievski <gdamjan@freemail.org.mk>
* SUPPORTED: Add mk_MK ISO-8859-1.
2000-02-12 Ulrich Drepper <drepper@redhat.com>
* SUPPORTED: Add gl_ES.ISO-8859-1.

View file

@ -42,6 +42,7 @@ iw_IL ISO-8859-8
kl_GL ISO-8859-1
lt_LT ISO-8859-13
lv_LV ISO-8859-13
mk_MK ISO-8859-5
nl_BE ISO-8859-1
nl_NL ISO-8859-1
no_NO ISO-8859-1

3057
localedata/locales/mk_MK Normal file

File diff suppressed because it is too large Load diff

View file

@ -19,7 +19,7 @@
# 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
# The format of this file is pretty simple: Each line contains a test
# for strfmon. Fields are seperated by TABs. Lines that start with a
# for strfmon. Fields are separated by TABs. Lines that start with a
# '#' are comments and are ignored.
#
# Field Deskription

View file

@ -31,7 +31,7 @@ while read locale string result dummy; do
fi
done <<EOF
#& These are the tests for rpmatch in glibc. Each line contains one test,
#& comments start with #& in the first column. The fields are seperated
#& comments start with #& in the first column. The fields are separated
#& by paragraph signs and contain: the locale, the string, the expected
#& return value of rpmatch(3). If the test fails, test-rpmatch prints
#& all these informations

View file

@ -38,7 +38,7 @@ struct xtmp
time_t xt_time; /* Time entry was made. */
char xt_user[XT_NAMESIZE]; /* Username (not NUL terminated). */
char xt_host[XT_HOSTSIZE]; /* Hostname for remote login. */
long xt_addr; /* Internet adress of remote host. */
long xt_addr; /* Internet address of remote host. */
};
#define _HAVE_XT_TYPE 1

View file

@ -2260,7 +2260,7 @@ is provided mostly for compatibility with existing code; using
@code{strtod} is more robust.
@end deftypefun
The GNU C library also provides @samp{_l} versions of thse functions,
The GNU C library also provides @samp{_l} versions of these functions,
which take an additional argument, the locale to use in conversion.
@xref{Parsing of Integers}.

View file

@ -524,7 +524,7 @@ The code to emit the escape sequence to get back to the initial state is
interesting. The @code{wcsrtombs} function can be used to determine the
necessary output code (@pxref{Converting Strings}). Please note that on
GNU systems it is not necessary to perform this extra action for the
conversion from multibyte text ot wide character text since the wide
conversion from multibyte text to wide character text since the wide
character encoding is not stateful. But there is nothing mentioned in
any standard which prohibits making @code{wchar_t} using a stateful
encoding.
@ -703,7 +703,7 @@ bytes in the multibyte input string. This method yields to a
pessimistic guess about the size of the result and if many wide
character strings have to be constructed this way or the strings are
long, the extra memory required allocated because the input string
contains multibzte characters might be significant. It would be
contains multibyte characters might be significant. It would be
possible to resize the allocated memory block to the correct size before
returning it. A better solution might be to allocate just the right
amount of space for the result right away. Unfortunately there is no
@ -1633,15 +1633,15 @@ of the conversions from @var{fromset} to @var{toset}.
The GNU C library implementation of @code{iconv_open} has one
significant extension to other implementations. To ease the extension
of the set of available conversions the implementation allows to store
the necessary files with data and code in arbitrary many directories.
How this extensions have to be written will be explained below
of the set of available conversions the implementation allows storing
the necessary files with data and code in arbitrarily many directories.
How this extension has to be written will be explained below
(@pxref{glibc iconv Implementation}). Here it is only important to say
that all directories mentioned in the @code{GCONV_PATH} environment
variable are considered if they contain a file @file{gconv-modules}.
These directories need not necessarily be created by the system
administrator. In fact, this extension is introduced to help users
writing and using own, new conversions. Of course this does not work
writing and using their own, new conversions. Of course this does not work
for security reasons in SUID binaries; in this case only the system
directory is considered and this normally is
@file{@var{prefix}/lib/gconv}. The @code{GCONV_PATH} environment
@ -2048,7 +2048,7 @@ the GNU C library has none of the problems mentioned above. What
follows is a step-by-step analysis of the points raised above. The
evaluation is based on the current state of the development (as of
January 1999). The development of the @code{iconv} functions is not
complete, but basic funtionality has solidified.
complete, but basic functionality has solidified.
The GNU C library's @code{iconv} implementation uses shared loadable
modules to implement the conversions. A very small number of
@ -2187,7 +2187,7 @@ set.
Explaining why the above @file{gconv-modules} files allows the
@code{iconv} implementation to resolve the specific ISO-2022-JP to
EUC-JP conversion module instead of the conversion coming with the
library itself is straighforward. Since the later conversion takes two
library itself is straightforward. Since the latter conversion takes two
steps (from ISO-2022-JP to @w{ISO 10646} and then from @w{ISO 10646} to
EUC-JP) the cost is @math{1+1 = 2}. But the above @file{gconv-modules}
file specifies that the new conversion modules can perform this
@ -2230,7 +2230,7 @@ so that one can write new ones. This section describes the interface as
it is in use in January 1999. The interface will change in future a bit
but hopefully only in an upward compatible way.
The definitions necessary to write new modules are publically available
The definitions necessary to write new modules are publicly available
in the non-standard header @file{gconv.h}. The following text will
therefore describe the definitions from this header file. But first it
is necessary to get an overview.
@ -2411,13 +2411,13 @@ the GNU C library also use the @code{iconv} functionality which
increases the number of uses of the same functions even more.
For this reason the modules do not get loaded exclusively for one
conversion. Instead a module once loaded can be used by arbitrary many
conversion. Instead a module once loaded can be used by arbitrarily many
@code{iconv} or @code{mbsrtowcs} calls at the same time. The splitting
of the information between conversion function specific information and
conversion data makes this possible. The last section showed the two
data structure used to do this.
data structures used to do this.
This is of course also reflected in the interface and semantic of the
This is of course also reflected in the interface and semantics of the
functions the modules must provide. There are three functions which
must have the following names:

View file

@ -26,10 +26,10 @@ functions with names that smaller ones reserve to the user program. This
is not mere pedantry --- it has been a problem in practice. For instance,
some non-GNU programs define functions named @code{getline} that have
nothing to do with this library's @code{getline}. They would not be
compilable if all features were enabled indescriminantly.
compilable if all features were enabled indiscriminately.
This should not be used to verify that a program conforms to a limited
standard. It is insufficent for this purpose, as it will not protect you
standard. It is insufficient for this purpose, as it will not protect you
from including header files outside the standard, or relying on semantics
undefined within the standard.

View file

@ -30,7 +30,7 @@ const char *argp_program_bug_address =
static char doc[] =
"Argp example #2 -- a pretty minimal program using argp";
/* Our argpument parser. The @code{options}, @code{parser}, and
/* Our argument parser. The @code{options}, @code{parser}, and
@code{args_doc} fields are zero because we have neither options or
arguments; @code{doc} and @code{argp_program_bug_address} will be
used in the output for @samp{--help}, and the @samp{--version}

View file

@ -17,7 +17,7 @@
a special key specifying something else; the only
special keys we use here are ARGP_KEY_ARG, meaning
a non-option argument, and ARGP_KEY_END, meaning
that all argumens have been parsed
that all arguments have been parsed
ARG -- For an option KEY, the string value of its
argument, or NULL if it has none
STATE-- A pointer to a struct argp_state, containing

View file

@ -19,7 +19,7 @@
is longer, describing the behavior in more detail. All
documentation strings are automatically filled for output,
although newlines may be included to force a line break at a
particular point. All documenation strings are also passed to
particular point. All documentation strings are also passed to
the `gettext' function, for possible translation into the
current locale. */

View file

@ -28,7 +28,7 @@ make_named_socket (const char *filename)
the offset of the start of the filename,
plus its length,
plus one for the terminating null byte.
Alternativly you can just do:
Alternatively you can just do:
size = SUN_LEN (&name);
*/
size = (offsetof (struct sockaddr_un, sun_path)

View file

@ -40,7 +40,7 @@ directly.)
or vice-versa.
* Stream/Descriptor Precautions:: Precautions needed if you use both
descriptors and streams.
* Scatter-Gather:: Fast I/O to discontinous buffers.
* Scatter-Gather:: Fast I/O to discontinuous buffers.
* Memory-mapped I/O:: Using files like memory.
* Waiting for I/O:: How to check for input or output
on multiple file descriptors.
@ -1148,7 +1148,7 @@ Error Signals}).
Note that most hardware designs cannot support write permission without
read permission, and many do not distinguish read and execute permission.
Thus, you may recieve wider permissions than you ask for, and mappings of
Thus, you may receive wider permissions than you ask for, and mappings of
write-only files may be denied even if you do not use @code{PROT_READ}.
@var{flags} contains flags that control the nature of the map.
@ -1192,7 +1192,7 @@ Anonymous maps are used as the basic primitive to extend the heap on some
systems. They are also useful to share data between multiple tasks
without creating a file.
On some systems using private anonymous mmaps is more efficent than using
On some systems using private anonymous mmaps is more efficient than using
@code{malloc} for large blocks. This is not an issue with the GNU C library,
as the included @code{malloc} automatically uses @code{mmap} where appropriate.
@ -1270,8 +1270,8 @@ aligned.
When using shared mappings, the kernel can write the file at any time
before the mapping is removed. To be certain data has actually been
written to the file and will be accessable to non-memory-mapped I/O, it
is neccessary to use this function.
written to the file and will be accessible to non-memory-mapped I/O, it
is necessary to use this function.
It operates on the region @var{address} to (@var{address} + @var{length}).
It may be used on part of a mapping or multiple mappings, however the
@ -1579,7 +1579,7 @@ until the program ends. To avoid this, calls to @code{fsync} should be
protected using cancellation handlers.
@c ref pthread_cleanup_push / pthread_cleanup_pop
The return value of the function is zero if no error occured. Otherwise
The return value of the function is zero if no error occurred. Otherwise
it is @math{-1} and the global variable @var{errno} is set to the
following values:
@table @code
@ -1612,7 +1612,7 @@ required by @code{fdatasyn}.
The prototype for @code{fdatasync} is in @file{unistd.h}.
The return value of the function is zero if no error occured. Otherwise
The return value of the function is zero if no error occurred. Otherwise
it is @math{-1} and the global variable @var{errno} is set to the
following values:
@table @code
@ -1836,7 +1836,7 @@ might also be signaled asynchronously.
@item EINVAL
The @code{aiocbp->aio_offset} or @code{aiocbp->aio_reqpiro} value is
invalid. This condition need not be recognized before enqueueing the
request and so this error might also be signaled asynchrously.
request and so this error might also be signaled asynchronously.
@end table
If @code{aio_read} returns zero, the current status of the request

View file

@ -267,7 +267,7 @@ hashing table used through the whole program. The table is allocated
in local memory out of control of the programmer. As an extension the
GNU C library provides an additional set of functions with an reentrant
interface which provide a similar interface but which allow to keep
arbitrary many hashing tables.
arbitrarily many hashing tables.
It is possible to use more than one hashing table in the program run if
the former table is first destroyed by a call to @code{hdestroy}.
@ -390,7 +390,7 @@ entry in the table is not the return value of the functions. It is
returned by storing it in a pointer variables pointed to by the
@var{retval} parameter. The return value of the function is an integer
value indicating success if it is non-zero and failure if it is zero.
In the later case the global variable @var{errno} signals the reason for
In the latter case the global variable @var{errno} signals the reason for
the failure.
@table @code

View file

@ -1772,7 +1772,7 @@ that the status cannot change in the middle of accessing it. Once
@code{p->have_status} is set, it means that the child process is stopped
or terminated, and in either case, it cannot stop or terminate again
until the program has taken notice. @xref{Atomic Usage}, for more
information about coping with interruptions during accessings of a
information about coping with interruptions during accesses of a
variable.
Here is another way you can test whether the handler has run since the

View file

@ -1321,7 +1321,7 @@ numbers are represented is the form
@w{[@code{-}]@code{0x}@var{h}@code{.}@var{hhh}@code{p}[@code{+}|@code{-}]@var{dd}}.
At the left of the decimal-point character exactly one digit is print.
This character is only @code{0} if the number is denormalized.
Otherwise the value is unspecified; it is implemention dependent how many
Otherwise the value is unspecified; it is implementation dependent how many
bits are used. The number of hexadecimal digits on the right side of
the decimal-point character is equal to the precision. If the precision
is zero it is determined to be large enough to provide an exact

View file

@ -491,7 +491,7 @@ common example:
@cindex __va_copy
@cindex va_copy
@smallexample
/* @r{This function concats arbitrary many strings. The last}
/* @r{This function concatenates arbitrarily many strings. The last}
@r{parameter must be @code{NULL}.} */
char *
concat (const char *str, ...)
@ -536,7 +536,7 @@ bytes for the end of the string so that we can append the next string.
For all strings in total the comparisons necessary to find the end of
the intermediate results sums up to 5500! If we combine the copying
with the search for the allocation we can write this function more
efficent:
efficient:
@smallexample
char *
@ -1575,7 +1575,7 @@ the same elements, which is returned in @var{argz} and @var{argz_len}.
@deftypefun {error_t} argz_create_sep (const char *@var{string}, int @var{sep}, char **@var{argz}, size_t *@var{argz_len})
The @code{argz_create_sep} function converts the null-terminated string
@var{string} into an argz vector (returned in @var{argz} and
@var{argz_len}) by splitting it into elements at every occurance of the
@var{argz_len}) by splitting it into elements at every occurrence of the
character @var{sep}.
@end deftypefun
@ -1625,7 +1625,7 @@ argz vector @code{*@var{argz}}, and updates @code{*@var{argz}} and
@comment GNU
@deftypefun {error_t} argz_add_sep (char **@var{argz}, size_t *@var{argz_len}, const char *@var{str}, int @var{delim})
The @code{argz_add_sep} function is similar to @code{argz_add}, but
@var{str} is split into separate elements in the result at occurances of
@var{str} is split into separate elements in the result at occurrences of
the character @var{delim}. This is useful, for instance, for
adding the components of a Unix search path to an argz vector, by using
a value of @code{':'} for @var{delim}.
@ -1700,7 +1700,7 @@ invariant is maintained for argz vectors created by the functions here.
@comment argz.h
@comment GNU
@deftypefun error_t argz_replace (@w{char **@var{argz}, size_t *@var{argz_len}}, @w{const char *@var{str}, const char *@var{with}}, @w{unsigned *@var{replace_count}})
Replace any occurances of the string @var{str} in @var{argz} with
Replace any occurrences of the string @var{str} in @var{argz} with
@var{with}, reallocating @var{argz} as necessary. If
@var{replace_count} is non-zero, @code{*@var{replace_count}} will be
incremented by number of replacements performed.

View file

@ -420,7 +420,7 @@ to rely on these macros but to be consistent here is the list:
@vtable @code
@item MNTOPT_DEFAULTS
Expands to @code{"defaults"}. This option should be used alone since it
indicates all values for the custumizable values are chosen to be the
indicates all values for the customizable values are chosen to be the
default.
@item MNTOPT_RO
Expands to @code{"ro"}. See the @code{FSTAB_RO} value, it means the

View file

@ -1482,7 +1482,7 @@ pointed to by the elements of the result structure.
If a user with ID @var{uid} is found, the pointer returned in
@var{result} points to the record which contains the wanted data (i.e.,
@var{result} contains the value @var{result_buf}). If no user is found
or if an error occured, the pointer returned in @var{result} is a null
or if an error occurred, the pointer returned in @var{result} is a null
pointer. The function returns zero or an error code. If the buffer
@var{buffer} is too small to contain all the needed information, the
error code @code{ERANGE} is returned and @var{errno} is set to
@ -1695,7 +1695,7 @@ pointed to by the elements of the result structure.
If a group with ID @var{gid} is found, the pointer returned in
@var{result} points to the record which contains the wanted data (i.e.,
@var{result} contains the value @var{result_buf}). If no group is found
or if an error occured, the pointer returned in @var{result} is a null
or if an error occurred, the pointer returned in @var{result} is a null
pointer. The function returns zero or an error code. If the buffer
@var{buffer} is too small to contain all the needed information, the
error code @code{ERANGE} is returned and @var{errno} is set to

View file

@ -392,7 +392,7 @@ main (void)
if (count_errors)
{
printf ("\n%d errors occured.\n", count_errors);
printf ("\n%d errors occurred.\n", count_errors);
exit (1);
}
printf ("\n All tests passed successfully.\n");

View file

@ -174,7 +174,7 @@ nscd_gethst_r (const char *key, size_t keylen, request_type type,
char *ignore;
int n;
/* A first check whether the buffer is sufficently large is possible. */
/* A first check whether the buffer is sufficiently large is possible. */
/* Now allocate the buffer the array for the group members. We must
align the pointer and the base of the h_addr_list pointers. */
align1 = ((__alignof__ (char *) - (cp - ((char *) 0)))

View file

@ -41,7 +41,7 @@
#include "nss.h"
/*
The following define is neccessary for glibc 2.0.6
The following define is necessary for glibc 2.0.6
*/
#ifndef INET6_ADDRSTRLEN
# define INET6_ADDRSTRLEN 46
@ -362,9 +362,9 @@ main (void)
test_services ();
if (error_count)
printf ("\n %d errors occured!\n", error_count);
printf ("\n %d errors occurred!\n", error_count);
else
printf ("No visible errors occured!\n");
printf ("No visible errors occurred!\n");
exit (error_count);
}

View file

@ -6008,7 +6008,7 @@ regcomp (preg, pattern, cflags)
buffer. */
if (re_compile_fastmap (preg) == -2)
{
/* Some error occured while computing the fastmap, just forget
/* Some error occurred while computing the fastmap, just forget
about it. */
free (preg->fastmap);
preg->fastmap = NULL;

View file

@ -38,7 +38,7 @@ sub usage {
sub installation_problem {
print "The script has found some problems with your installation!\n";
print "Please read the FAQ and the README file and check the following:\n";
print "- Did you change the gcc specs file (neccessary after upgrading from\n";
print "- Did you change the gcc specs file (necessary after upgrading from\n";
print " Linux libc5)?\n";
print "- Are there any symbolic links of the form libXXX.so to old libraries?\n";
print " Links like libm.so -> libm.so.5 (where libm.so.5 is an old library) are wrong,\n";

View file

@ -48,7 +48,7 @@ canonicalize (const char *name, char *resolved)
{
/* As per Single Unix Specification V2 we must return an error if
either parameter is a null pointer. We extend this to allow
the RESOLVED parameter be NULL in case the we are expected to
the RESOLVED parameter to be NULL in case the we are expected to
allocate the room for the return value. */
__set_errno (EINVAL);
return NULL;

View file

@ -155,7 +155,7 @@ fmtmsg (long int classification, const char *label, int severity,
do_action ? action : "",
do_action && do_tag ? " " : "",
do_tag ? tag : "") == EOF)
/* Oh, oh. An error occured during the output. */
/* Oh, oh. An error occurred during the output. */
result = MM_NOMSG;
}

View file

@ -43,7 +43,7 @@ str_append (char **to, size_t *to_len, const char *buf, const size_t buf_len)
}
}
/* Replace any occurances of the string STR in ARGZ with WITH, reallocating
/* Replace any occurrences of the string STR in ARGZ with WITH, reallocating
ARGZ as necessary. If REPLACE_COUNT is non-zero, *REPLACE_COUNT will be
incremented by number of replacements performed. */
error_t

View file

@ -123,7 +123,7 @@ extern error_t argz_insert (char **__restrict __argz,
char *__restrict __before,
__const char *__restrict __entry) __THROW;
/* Replace any occurances of the string STR in ARGZ with WITH, reallocating
/* Replace any occurrences of the string STR in ARGZ with WITH, reallocating
ARGZ as necessary. If REPLACE_COUNT is non-zero, *REPLACE_COUNT will be
incremented by number of replacements performed. */
extern error_t __argz_replace (char **__restrict __argz,

View file

@ -37,7 +37,7 @@
to make sure we don't get redefinitions.
We must use here macros instead of inline functions since the
trick won't work with the later. */
trick won't work with the latter. */
#ifndef __STRING_INLINE
# ifdef __cplusplus

View file

@ -511,7 +511,7 @@ glob (pattern, flags, errfunc, pglob)
#endif /* __MSDOS__ || WINDOWS32 */
if (filename == NULL)
{
/* This can mean two things: a simple name or "~name". The later
/* This can mean two things: a simple name or "~name". The latter
case is nothing but a notation for a directory. */
if ((flags & (GLOB_TILDE|GLOB_TILDE_CHECK)) && pattern[0] == '~')
{

View file

@ -66,7 +66,7 @@ __libc_lock_define_initialized (static, envlock)
#endif
/* In the GNU C library implementation we try to be more clever and
allow arbitrary many changes of the environment given that the used
allow arbitrarily many changes of the environment given that the used
values are from a small set. Outside glibc this will eat up all
memory after a while. */
#if defined _LIBC || (defined HAVE_SEARCH_H && defined HAVE_TSEARCH \

View file

@ -53,7 +53,7 @@ ENTRY (memcmp)
or not depending on last subtraction. */
/* At this point %eax == 0, if the byte of block #1 was bigger, and
0xffffffff if the last byte of block #2 was bigger. The later
0xffffffff if the last byte of block #2 was bigger. The latter
case is already correct but the former needs a little adjustment.
Note that the following operation does not change 0xffffffff. */
orb $1, %al /* Change 0 to 1. */

View file

@ -79,7 +79,7 @@ waitid (idtype, id, infop, options)
{
/* The WHOHANG bit in OPTIONS is set and there are children available
but none has a status for us. The XPG docs do not mention this
case so we clear the `siginfo_t' struct and return succesfully. */
case so we clear the `siginfo_t' struct and return successfully. */
infop->si_signo = 0;
infop->si_code = 0;
return 0;

View file

@ -513,7 +513,7 @@ tz_compute (tm)
|| ! compute_change (&tz_rules[1], 1900 + tm->tm_year))
return 0;
/* We have to distinguish between northern and southern hemisphere.
For the later the daylight saving time ends in the next year.
For the latter the daylight saving time ends in the next year.
It is easier to detect this after first computing the time for the
wrong year since now we simply can compare the times to switch. */
if (tz_rules[0].change > tz_rules[1].change