mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-21 12:30:06 +00:00
Fix typos.
This commit is contained in:
Ondřej Bílka
parent
46ed103824
commit
c0c3f78afb
43
ChangeLog
43
ChangeLog
@ -1,3 +1,46 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* argp/argp-help.c: Fix typos.
|
||||
* crypt/speeds.c: Likewise.
|
||||
* csu/check_fds.c: Likewise.
|
||||
* elf/dl-load.c: Likewise.
|
||||
* elf/dl-open.c: Likewise.
|
||||
* elf/reldep3.c: Likewise.
|
||||
* elf/reldep.c: Likewise.
|
||||
* elf/sprof.c: Likewise.
|
||||
* iconv/iconv_charmap.c: Likewise.
|
||||
* iconv/skeleton.c: Likewise.
|
||||
* iconv/strtab.c: Likewise.
|
||||
* io/lockf64.c: Likewise.
|
||||
* libio/libioP.h: Likewise.
|
||||
* resolv/gai_notify.c: Likewise.
|
||||
* resolv/ns_name.c: Likewise.
|
||||
* resolv/ns_samedomain.c: Likewise.
|
||||
* resolv/res_send.c: Likewise.
|
||||
* stdlib/random.c: Likewise.
|
||||
* sunrpc/rpc/xdr.h: Likewise.
|
||||
* sysdeps/i386/fpu/fraiseexcpt.c: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/memcmp-sse4.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/memset-sse2-rep.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/memset-sse2.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/strcat-sse2.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/strcmp-sse4.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/strcmp-ssse3.S: Likewise.
|
||||
* sysdeps/i386/i686/multiarch/strcpy-sse2.S: Likewise.
|
||||
* sysdeps/mach/hurd/check_fds.c: Likewise.
|
||||
* sysdeps/powerpc/powerpc32/cell/memcpy.S: Likewise.
|
||||
* sysdeps/powerpc/powerpc32/fpu/setjmp.S: Likewise.
|
||||
* sysdeps/powerpc/powerpc32/power4/memcmp.S: Likewise.
|
||||
* sysdeps/powerpc/powerpc32/power7/memcmp.S: Likewise.
|
||||
* sysdeps/powerpc/powerpc32/setjmp.S: Likewise.
|
||||
* sysdeps/powerpc/powerpc64/cell/memcpy.S: Likewise.
|
||||
* sysdeps/pthread/aio_notify.c: Likewise.
|
||||
* sysdeps/sparc/fpu/fraiseexcpt.c: Likewise.
|
||||
* sysdeps/unix/sysv/linux/socketcall.h: Likewise.
|
||||
* sysdeps/x86_64/fpu/fraiseexcpt.c: Likewise.
|
||||
* sysdeps/x86_64/multiarch/strcpy-sse2-unaligned.S: Likewise.
|
||||
* sysdeps/x86/fpu/bits/fenv.h: Likewise.
|
||||
|
||||
2013-08-21 Liubov Dmitrieva <liubov.dmitrieva@intel.com>
|
||||
|
||||
* sysdeps/i386/i686/multiarch/strcmp.S: Skip SSE4_2
|
||||
|
||||
@ -357,7 +357,7 @@ struct hol_entry
|
||||
/* A pointers into the HOL's short_options field, to the first short option
|
||||
letter for this entry. The order of the characters following this point
|
||||
corresponds to the order of options pointed to by OPT, and there are at
|
||||
most NUM. A short option recorded in a option following OPT is only
|
||||
most NUM. A short option recorded in an option following OPT is only
|
||||
valid if it occurs in the right place in SHORT_OPTIONS (otherwise it's
|
||||
probably been shadowed by some other entry). */
|
||||
char *short_options;
|
||||
@ -736,12 +736,12 @@ hol_entry_cmp (const struct hol_entry *entry1,
|
||||
if (entry1->cluster != entry2->cluster)
|
||||
{
|
||||
/* The entries are not within the same cluster, so we can't compare them
|
||||
directly, we have to use the appropiate clustering level too. */
|
||||
directly, we have to use the appropriate clustering level too. */
|
||||
if (! entry1->cluster)
|
||||
/* ENTRY1 is at the `base level', not in a cluster, so we have to
|
||||
compare it's group number with that of the base cluster in which
|
||||
ENTRY2 resides. Note that if they're in the same group, the
|
||||
clustered option always comes laster. */
|
||||
clustered option always comes last. */
|
||||
return group_cmp (group1, hol_cluster_base (entry2->cluster)->group, -1);
|
||||
else if (! entry2->cluster)
|
||||
/* Likewise, but ENTRY2's not in a cluster. */
|
||||
|
||||
@ -16,7 +16,7 @@
|
||||
* patch from chip@chinacat.unicom.com (Chip Rosenthal):
|
||||
* you may enable it if your system does not include
|
||||
* a setitimer() function. You'll have to ensure the
|
||||
* existence a environment variable: HZ giving how many
|
||||
* existence an environment variable: HZ giving how many
|
||||
* ticks goes per second.
|
||||
* If not existing in your default environment 50, 60
|
||||
* or even 100 may be the right value. Perhaps you should
|
||||
|
||||
@ -60,7 +60,7 @@ check_one_fd (int fd, int mode)
|
||||
|
||||
/* Something is wrong with this descriptor, it's probably not
|
||||
opened. Open /dev/null so that the SUID program we are
|
||||
about to start does not accidently use this descriptor. */
|
||||
about to start does not accidentally use this descriptor. */
|
||||
int nullfd = open_not_cancel (name, mode, 0);
|
||||
|
||||
/* We are very paranoid here. With all means we try to ensure
|
||||
|
||||
@ -324,7 +324,7 @@ _dl_dst_substitute (struct link_map *l, const char *name, char *result,
|
||||
const char *const start = name;
|
||||
|
||||
/* Now fill the result path. While copying over the string we keep
|
||||
track of the start of the last path element. When we come accross
|
||||
track of the start of the last path element. When we come across
|
||||
a DST we copy over the value or (if the value is not available)
|
||||
leave the entire path element out. */
|
||||
char *wp = result;
|
||||
|
||||
@ -396,7 +396,7 @@ dl_open_worker (void *a)
|
||||
/* If this here is the shared object which we want to profile
|
||||
make sure the profile is started. We can find out whether
|
||||
this is necessary or not by observing the `_dl_profile_map'
|
||||
variable. If it was NULL but is not NULL afterwars we must
|
||||
variable. If it was NULL but is not NULL afterwards we must
|
||||
start the profiling. */
|
||||
struct link_map *old_profile_map = GL(dl_profile_map);
|
||||
|
||||
|
||||
@ -54,7 +54,7 @@ main (void)
|
||||
}
|
||||
|
||||
/* Now close the first object. If must still be around since we have
|
||||
a implicit dependency. */
|
||||
an implicit dependency. */
|
||||
if (dlclose (h1) != 0)
|
||||
{
|
||||
printf ("closing h1 failed: %s\n", dlerror ());
|
||||
|
||||
@ -54,7 +54,7 @@ main (void)
|
||||
}
|
||||
|
||||
/* Now close the first object. If must still be around since we have
|
||||
a implicit dependency. */
|
||||
an implicit dependency. */
|
||||
if (dlclose (h1) != 0)
|
||||
{
|
||||
printf ("closing h1 failed: %s\n", dlerror ());
|
||||
|
||||
@ -1364,7 +1364,7 @@ generate_call_graph (struct profdata *profdata)
|
||||
runp = runp->next;
|
||||
}
|
||||
|
||||
/* Info abount the function itself. */
|
||||
/* Info about the function itself. */
|
||||
n = printf ("[%Zu]", cnt);
|
||||
printf ("%*s%5.1f%8.2f%8.2f%9" PRIdMAX " %s [%Zd]\n",
|
||||
(int) (7 - n), " ",
|
||||
|
||||
@ -454,7 +454,7 @@ process_block (struct convtable *tbl, char *addr, size_t len, FILE *output)
|
||||
while (! is_term (cur, byte))
|
||||
if (cur->val[byte].sub == NULL)
|
||||
{
|
||||
/* This is a invalid sequence. Skip the first byte if we are
|
||||
/* This is an invalid sequence. Skip the first byte if we are
|
||||
ignoring errors. Otherwise punt. */
|
||||
if (! omit_invalid)
|
||||
{
|
||||
|
||||
@ -514,7 +514,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
|
||||
size_t *lirreversiblep = irreversible ? &lirreversible : NULL;
|
||||
|
||||
/* The following assumes that encodings, which have a variable length
|
||||
what might unalign a buffer even though it is a aligned in the
|
||||
what might unalign a buffer even though it is an aligned in the
|
||||
beginning, either don't have the minimal number of bytes as a divisor
|
||||
of the maximum length or have a minimum length of 1. This is true
|
||||
for all known and supported encodings.
|
||||
@ -659,7 +659,7 @@ FUNCTION_NAME (struct __gconv_step *step, struct __gconv_step_data *data,
|
||||
data->__outbuf = outbuf;
|
||||
|
||||
/* Remember how many non-identical characters we
|
||||
converted in a irreversible way. */
|
||||
converted in an irreversible way. */
|
||||
*irreversible += lirreversible;
|
||||
|
||||
break;
|
||||
|
||||
@ -180,7 +180,7 @@ newstring (struct Strtab *st, const char *str, size_t len)
|
||||
|
||||
|
||||
/* XXX This function should definitely be rewritten to use a balancing
|
||||
tree algorith (AVL, red-black trees). For now a simple, correct
|
||||
tree algorithm (AVL, red-black trees). For now a simple, correct
|
||||
implementation is enough. */
|
||||
static struct Strent **
|
||||
searchstring (struct Strent **sep, struct Strent *newstr)
|
||||
|
||||
@ -21,7 +21,7 @@
|
||||
#include <errno.h>
|
||||
#include <string.h>
|
||||
|
||||
/* lockf.c defines lockf64 as an lias if __OFF_T_MATCHES_OFF64_T. */
|
||||
/* lockf.c defines lockf64 as an alias if __OFF_T_MATCHES_OFF64_T. */
|
||||
#ifndef __OFF_T_MATCHES_OFF64_T
|
||||
|
||||
/* lockf is a simplified interface to fcntl's locking facilities. */
|
||||
|
||||
@ -73,7 +73,7 @@ extern "C" {
|
||||
* These are all the same, just used differently.
|
||||
* An _IO_FILE (or FILE) object is allows followed by a pointer to
|
||||
* a jump table (of pointers to functions). The pointer is accessed
|
||||
* with the _IO_JUMPS macro. The jump table has a eccentric format,
|
||||
* with the _IO_JUMPS macro. The jump table has an eccentric format,
|
||||
* so as to be compatible with the layout of a C++ virtual function table.
|
||||
* (as implemented by g++). When a pointer to a streambuf object is
|
||||
* coerced to an (_IO_FILE*), then _IO_JUMPS on the result just
|
||||
@ -224,7 +224,7 @@ typedef int (*_IO_doallocate_t) (_IO_FILE *);
|
||||
There is no correspondence in the ANSI/ISO C++ standard library.
|
||||
The hooks basically correspond to the Unix system functions
|
||||
(read, write, close, lseek, and stat) except that a _IO_FILE*
|
||||
parameter is used instead of a integer file descriptor; the default
|
||||
parameter is used instead of an integer file descriptor; the default
|
||||
implementation used for normal files just calls those functions.
|
||||
The advantage of overriding these functions instead of the higher-level
|
||||
ones (underflow, overflow etc) is that you can leave all the buffering
|
||||
|
||||
@ -1,3 +1,8 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* pthread_getschedparam.c: Fix typos.
|
||||
* sysdeps/unix/sysv/linux/register-atfork.c: Likewise.
|
||||
|
||||
2013-07-23 David S. Miller <davem@davemloft.net>
|
||||
|
||||
* tst-cancel4.c (WRITE_BUFFER_SIZE): Adjust comment.
|
||||
|
||||
@ -40,7 +40,7 @@ __pthread_getschedparam (threadid, policy, param)
|
||||
lll_lock (pd->lock, LLL_PRIVATE);
|
||||
|
||||
/* The library is responsible for maintaining the values at all
|
||||
times. If the user uses a interface other than
|
||||
times. If the user uses an interface other than
|
||||
pthread_setschedparam to modify the scheduler setting it is not
|
||||
the library's problem. In case the descriptor's values have
|
||||
not yet been retrieved do it now. */
|
||||
|
||||
@ -127,7 +127,7 @@ libc_freeres_fn (free_mem)
|
||||
/* No more fork handlers. */
|
||||
__fork_handlers = NULL;
|
||||
|
||||
/* Free eventually alloated memory blocks for the object pool. */
|
||||
/* Free eventually allocated memory blocks for the object pool. */
|
||||
struct fork_handler_pool *runp = fork_handler_pool.next;
|
||||
|
||||
memset (&fork_handler_pool, '\0', sizeof (fork_handler_pool));
|
||||
|
||||
@ -1,3 +1,7 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* sysdeps/am33/fpu/fraiseexcpt.c: Fix typos.
|
||||
|
||||
2013-06-05 Joseph Myers <joseph@codesourcery.com>
|
||||
|
||||
* sysdeps/am33/elf/start.S: Remove trailing whitespace.
|
||||
|
||||
@ -1,3 +1,9 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* sysdeps/hppa/dl-lookupcfg.h: Fix typos.
|
||||
* sysdeps/hppa/fpu/fraiseexcpt.c: Likewise.
|
||||
* sysdeps/unix/sysv/linux/hppa/sysdep.h: Likewise.
|
||||
|
||||
2013-07-23 Carlos O'Donell <carlos@redhat.com>
|
||||
|
||||
* sysdeps/hppa/fpu/libm-test-ulps: Regenerate.
|
||||
|
||||
@ -1,3 +1,12 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* sysdeps/ia64/fpu/e_atanhl.S: Fix typos.
|
||||
* sysdeps/ia64/fpu/e_log2l.S: Likewise.
|
||||
* sysdeps/ia64/fpu/e_logl.S: Likewise.
|
||||
* sysdeps/ia64/fpu/fraiseexcpt.c: Likewise.
|
||||
* sysdeps/ia64/fpu/libm_lgammal.S: Likewise.
|
||||
* sysdeps/ia64/fpu/s_log1pl.S: Likewise.
|
||||
|
||||
2013-07-04 Andreas Jaeger <aj@suse.de>
|
||||
|
||||
* sysdeps/unix/sysv/linux/ia64/sys/ptrace.h (PTRACE_LISTEN):
|
||||
|
||||
@ -1,3 +1,7 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* sysdeps/m68k/m680x0/fpu/fraiseexcpt.c: Fix typos.
|
||||
|
||||
2013-07-20 Andreas Schwab <schwab@linux-m68k.org>
|
||||
|
||||
* sysdeps/unix/sysv/linux/m68k/dl-static.c: New file.
|
||||
|
||||
@ -1,3 +1,7 @@
|
||||
2013-08-21 Ondřej Bílka <neleai@seznam.cz>
|
||||
|
||||
* sysdeps/tile/jmpbuf-offsets.h: Fix typos.
|
||||
|
||||
2013-07-22 Chris Metcalf <cmetcalf@tilera.com>
|
||||
|
||||
[BZ #15759]
|
||||
|
||||
@ -35,7 +35,7 @@ __feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if (excepts & FE_INVALID)
|
||||
{
|
||||
/* One example of a invalid operation is 0 * Infinity. */
|
||||
/* One example of an invalid operation is 0 * Infinity. */
|
||||
float x = HUGE_VALF, y = 0.0f;
|
||||
__asm__ __volatile__ ("fmul %1,%0" : "+f" (x) : "f" (y));
|
||||
}
|
||||
|
||||
@ -57,7 +57,7 @@ void _dl_unmap (struct link_map *map);
|
||||
})
|
||||
|
||||
|
||||
/* The test for "addr & 2" below is to accomodate old binaries which
|
||||
/* The test for "addr & 2" below is to accommodate old binaries which
|
||||
violated the ELF ABI by pointing DT_INIT and DT_FINI at a function
|
||||
descriptor. */
|
||||
#define DL_DT_INIT_ADDRESS(map, addr) \
|
||||
|
||||
@ -42,7 +42,7 @@ feraiseexcept (int excepts)
|
||||
/* First: Invalid exception. */
|
||||
if (excepts & FE_INVALID)
|
||||
{
|
||||
/* One example of a invalid operation is 0 * Infinity. */
|
||||
/* One example of an invalid operation is 0 * Infinity. */
|
||||
double d = HUGE_VAL;
|
||||
__asm__ __volatile__ (
|
||||
" fcpy,dbl %%fr0,%%fr22\n"
|
||||
|
||||
@ -99,7 +99,7 @@
|
||||
// calculation is subdivided into two stages. The first stage is
|
||||
// calculating of X = 2*|x|/(1-|x|). The second one is calculating of
|
||||
// sign(x)*log1pl(X)/2. To obtain required accuracy we use precise division
|
||||
// algorythm output of which is a pair of two extended precision values those
|
||||
// algorithm output of which is a pair of two extended precision values those
|
||||
// approximate result of division with accuracy higher than working
|
||||
// precision. This pair is passed to modified log1pl function.
|
||||
//
|
||||
|
||||
@ -471,7 +471,7 @@ GLOBAL_IEEE754_ENTRY(log2l)
|
||||
(p7) br.cond.spnt LOG2_PSEUDO_ZERO
|
||||
}
|
||||
{.mfi
|
||||
// get T_low adress
|
||||
// get T_low address
|
||||
shladd r3=r28,3,r3
|
||||
// if first 8 bits after leading 1 are all ones, use polynomial approx. only
|
||||
(p10) fms.s1 f6=f7,f36,f1
|
||||
|
||||
@ -211,7 +211,7 @@
|
||||
//
|
||||
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 d_5 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_1 indeed always begin
|
||||
// with 1.0000 in fixed point.
|
||||
//
|
||||
@ -232,7 +232,7 @@
|
||||
//
|
||||
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_2 indeed always begin
|
||||
// with 1.00000000 in fixed point.
|
||||
//
|
||||
|
||||
@ -40,7 +40,7 @@ feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if (FE_INVALID & excepts)
|
||||
{
|
||||
/* One example of a invalid operation is 0 * Infinity. */
|
||||
/* One example of an invalid operation is 0 * Infinity. */
|
||||
tmp = 0;
|
||||
__asm__ __volatile__ ("frcpa.s0 %0,p1=f0,f0" : "=f" (tmp) : : "p1" );
|
||||
}
|
||||
|
||||
@ -317,7 +317,7 @@
|
||||
//
|
||||
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 d_5 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_1 indeed always begin
|
||||
// with 1.0000 in fixed point.
|
||||
//
|
||||
@ -338,7 +338,7 @@
|
||||
//
|
||||
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_2 indeed always begin
|
||||
// with 1.00000000 in fixed point.
|
||||
//
|
||||
|
||||
@ -221,7 +221,7 @@
|
||||
//
|
||||
// Calculate X_1 := X_0 * Z_1 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 d_5 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_1 indeed always begin
|
||||
// with 1.0000 in fixed point.
|
||||
//
|
||||
@ -242,7 +242,7 @@
|
||||
//
|
||||
// Calculate X_2 := X_1 * Z_2 truncated to lsb = 2^(-14)
|
||||
// = 1.0 0 0 0 0 0 0 0 d_9 d_10 ... d_14
|
||||
// This is accomplised by integer multiplication.
|
||||
// This is accomplished by integer multiplication.
|
||||
// It is proved that X_2 indeed always begin
|
||||
// with 1.00000000 in fixed point.
|
||||
//
|
||||
|
||||
@ -33,7 +33,7 @@ __feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if (excepts & FE_INVALID)
|
||||
{
|
||||
/* One example of a invalid operation is 0 * Infinity. */
|
||||
/* One example of an invalid operation is 0 * Infinity. */
|
||||
double d = HUGE_VAL;
|
||||
__asm__ __volatile__ ("fmul%.s %#0r0,%0; fnop" : "=f" (d) : "0" (d));
|
||||
}
|
||||
|
||||
@ -45,7 +45,7 @@
|
||||
#define JB_PC 25 /* normally LR, r55 */
|
||||
#define JB_ICS 26 /* interrupt critical section bit */
|
||||
|
||||
/* We save space for some extra state to accomodate future changes. */
|
||||
/* We save space for some extra state to accommodate future changes. */
|
||||
#define JB_LEN 32 /* number of words */
|
||||
|
||||
#define JB_SIZE (JB_LEN * REGSIZE)
|
||||
|
||||
@ -219,7 +219,7 @@
|
||||
|
||||
|
||||
/* FIXME: This comment is not true.
|
||||
* All the syscall assembly macros rely on finding the approriate
|
||||
* All the syscall assembly macros rely on finding the appropriate
|
||||
SYSCALL_ERROR_LABEL or rather HANDLER. */
|
||||
|
||||
/* int * __errno_location(void) so you have to store your value
|
||||
|
||||
@ -117,7 +117,7 @@ __gai_notify (struct requestlist *req)
|
||||
#endif
|
||||
}
|
||||
else
|
||||
/* This is part of a asynchronous `getaddrinfo_a' operation. If
|
||||
/* This is part of an asynchronous `getaddrinfo_a' operation. If
|
||||
this request is the last one, send the signal. */
|
||||
if (--*waitlist->counterp == 0)
|
||||
{
|
||||
|
||||
@ -180,7 +180,7 @@ libresolv_hidden_def (ns_name_ntop)
|
||||
strong_alias (ns_name_ntop, __ns_name_ntop)
|
||||
|
||||
/*%
|
||||
* Convert a ascii string into an encoded domain name as per RFC1035.
|
||||
* Convert an ascii string into an encoded domain name as per RFC1035.
|
||||
*
|
||||
* return:
|
||||
*
|
||||
|
||||
@ -29,7 +29,7 @@ static const char rcsid[] = "$BINDId: ns_samedomain.c,v 8.9 1999/10/15 21:06:51
|
||||
* Check whether a name belongs to a domain.
|
||||
*
|
||||
* Inputs:
|
||||
*\li a - the domain whose ancestory is being verified
|
||||
*\li a - the domain whose ancestry is being verified
|
||||
*\li b - the potential ancestor we're checking against
|
||||
*
|
||||
* Return:
|
||||
|
||||
@ -875,7 +875,7 @@ send_vc(res_state statp,
|
||||
}
|
||||
}
|
||||
/*
|
||||
* If the calling applicating has bailed out of
|
||||
* If the calling application has bailed out of
|
||||
* a previous call and failed to arrange to have
|
||||
* the circuit closed or the server has got
|
||||
* itself confused, then drop the packet and
|
||||
|
||||
@ -160,7 +160,7 @@ static int32_t randtbl[DEG_3 + 1] =
|
||||
static struct random_data unsafe_state =
|
||||
{
|
||||
/* FPTR and RPTR are two pointers into the state info, a front and a rear
|
||||
pointer. These two pointers are always rand_sep places aparts, as they
|
||||
pointer. These two pointers are always rand_sep places apart, as they
|
||||
cycle through the state information. (Yes, this does mean we could get
|
||||
away with just one pointer, but the code for random is more efficient
|
||||
this way). The pointers are left positioned as they would be from the call:
|
||||
|
||||
@ -221,7 +221,7 @@ typedef bool_t (*xdrproc_t) (XDR *, void *,...);
|
||||
/*
|
||||
* Support struct for discriminated unions.
|
||||
* You create an array of xdrdiscrim structures, terminated with
|
||||
* a entry with a null procedure pointer. The xdr_union routine gets
|
||||
* an entry with a null procedure pointer. The xdr_union routine gets
|
||||
* the discriminant value and then searches the array of structures
|
||||
* for a matching value. If a match is found the associated xdr routine
|
||||
* is called to handle that part of the union. If there is
|
||||
|
||||
@ -31,7 +31,7 @@ __feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if ((FE_INVALID & excepts) != 0)
|
||||
{
|
||||
/* One example of a invalid operation is 0.0 / 0.0. */
|
||||
/* One example of an invalid operation is 0.0 / 0.0. */
|
||||
double d;
|
||||
__asm__ __volatile__ ("fldz; fdiv %%st, %%st(0); fwait" : "=t" (d));
|
||||
(void) &d;
|
||||
|
||||
@ -58,7 +58,7 @@
|
||||
/* Get the entry and convert the relative offset to the \
|
||||
absolute address. */ \
|
||||
addl (%ebx,INDEX,SCALE), %ebx; \
|
||||
/* We loaded the jump table and adjuested EDX/ESI. Go. */ \
|
||||
/* We loaded the jump table and adjusted EDX/ESI. Go. */ \
|
||||
jmp *%ebx
|
||||
# else
|
||||
# define JMPTBL(I, B) I
|
||||
|
||||
@ -62,7 +62,7 @@
|
||||
absolute address. */ \
|
||||
add (%ebx,%ecx,4), %ebx; \
|
||||
add %ecx, %edx; \
|
||||
/* We loaded the jump table and adjuested EDX. Go. */ \
|
||||
/* We loaded the jump table and adjusted EDX. Go. */ \
|
||||
jmp *%ebx
|
||||
#else
|
||||
# define ENTRANCE
|
||||
|
||||
@ -62,7 +62,7 @@
|
||||
absolute address. */ \
|
||||
add (%ebx,%ecx,4), %ebx; \
|
||||
add %ecx, %edx; \
|
||||
/* We loaded the jump table and adjuested EDX. Go. */ \
|
||||
/* We loaded the jump table and adjusted EDX. Go. */ \
|
||||
jmp *%ebx
|
||||
#else
|
||||
# define ENTRANCE
|
||||
|
||||
@ -49,7 +49,7 @@
|
||||
/* Get the entry and convert the relative offset to the \
|
||||
absolute address. */ \
|
||||
addl (%ecx,INDEX,SCALE), %ecx; \
|
||||
/* We loaded the jump table and adjuested ECX. Go. */ \
|
||||
/* We loaded the jump table and adjusted ECX. Go. */ \
|
||||
jmp *%ecx
|
||||
# else
|
||||
# define JMPTBL(I, B) I
|
||||
|
||||
@ -53,7 +53,7 @@
|
||||
# define STR1 8
|
||||
# endif
|
||||
# define STR2 STR1+4
|
||||
# define LOCALE 12 /* Loaded before the adjustement. */
|
||||
# define LOCALE 12 /* Loaded before the adjustment. */
|
||||
# ifdef PIC
|
||||
# define RETURN POP (%edi); POP (%ebx); ret; \
|
||||
.p2align 4; CFI_PUSH (%ebx); CFI_PUSH (%edi)
|
||||
@ -73,7 +73,7 @@
|
||||
# endif
|
||||
# define STR2 STR1+4
|
||||
# define CNT STR2+4
|
||||
# define LOCALE 16 /* Loaded before the adjustement. */
|
||||
# define LOCALE 16 /* Loaded before the adjustment. */
|
||||
# ifdef PIC
|
||||
# define RETURN POP (%edi); POP (REM); POP (%ebx); ret; \
|
||||
.p2align 4; \
|
||||
|
||||
@ -61,7 +61,7 @@
|
||||
# define STR1 4
|
||||
# endif
|
||||
# define STR2 STR1+4
|
||||
# define LOCALE 12 /* Loaded before the adjustement. */
|
||||
# define LOCALE 12 /* Loaded before the adjustment. */
|
||||
# ifdef PIC
|
||||
# define RETURN POP (%ebx); ret; .p2align 4; CFI_PUSH (%ebx)
|
||||
# else
|
||||
@ -82,7 +82,7 @@
|
||||
# endif
|
||||
# define STR2 STR1+4
|
||||
# define CNT STR2+4
|
||||
# define LOCALE 16 /* Loaded before the adjustement. */
|
||||
# define LOCALE 16 /* Loaded before the adjustment. */
|
||||
# ifdef PIC
|
||||
# define RETURN POP (REM); POP (%ebx); ret; \
|
||||
.p2align 4; CFI_PUSH (%ebx); CFI_PUSH (REM)
|
||||
|
||||
@ -64,7 +64,7 @@
|
||||
/* Get the entry and convert the relative offset to the \
|
||||
absolute address. */ \
|
||||
addl (%ecx,INDEX,SCALE), %ecx; \
|
||||
/* We loaded the jump table and adjuested ECX. Go. */ \
|
||||
/* We loaded the jump table and adjusted ECX. Go. */ \
|
||||
jmp *%ecx
|
||||
# else
|
||||
# define JMPTBL(I, B) I
|
||||
@ -128,7 +128,7 @@ ENTRY (STRCPY)
|
||||
|
||||
sub %ecx, %edi
|
||||
|
||||
/* If source adress alignment != destination adress alignment */
|
||||
/* If source address alignment != destination address alignment */
|
||||
.p2align 4
|
||||
L(Unalign16Both):
|
||||
mov $16, %ecx
|
||||
@ -271,7 +271,7 @@ L(Unaligned64Leave):
|
||||
lea 49(%edi, %edx), %edi
|
||||
jmp L(StrncpyFillTailWithZero)
|
||||
|
||||
/* If source adress alignment == destination adress alignment */
|
||||
/* If source address alignment == destination address alignment */
|
||||
|
||||
L(SourceStringAlignmentZero):
|
||||
pxor %xmm0, %xmm0
|
||||
|
||||
@ -42,7 +42,7 @@ check_one_fd (int fd, int mode)
|
||||
{
|
||||
/* This descriptor hasn't been opened. We try to allocate the
|
||||
descriptor and open /dev/null on it so that the SUID program
|
||||
we are about to start does not accidently use this
|
||||
we are about to start does not accidentally use this
|
||||
descriptor. */
|
||||
d = _hurd_alloc_fd (NULL, fd);
|
||||
if (d != NULL)
|
||||
|
||||
@ -49,7 +49,7 @@ EALIGN (memcpy, 5, 0)
|
||||
|
||||
.Lbigcopy:
|
||||
neg r8,r3 /* LS 3 bits = # bytes to 8-byte dest bdry */
|
||||
clrlwi r8,r8,32-4 /* aling to 16byte boundary */
|
||||
clrlwi r8,r8,32-4 /* align to 16byte boundary */
|
||||
sub r7,r4,r3
|
||||
cmplwi cr0,r8,0
|
||||
beq+ .Ldst_aligned
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* non alitivec (old) version of setjmp for PowerPC.
|
||||
/* non altivec (old) version of setjmp for PowerPC.
|
||||
Copyright (C) 1995-2013 Free Software Foundation, Inc.
|
||||
This file is part of the GNU C Library.
|
||||
|
||||
|
||||
@ -512,7 +512,7 @@ L(zeroLength):
|
||||
of rBITDIF to 0. If rBITDIF == 0 then rStr1 is word aligned and can
|
||||
perform the Wunaligned loop.
|
||||
|
||||
Otherwise we know that rSTR1 is not aready word aligned yet.
|
||||
Otherwise we know that rSTR1 is not already word aligned yet.
|
||||
So we can force the string addresses to the next lower word
|
||||
boundary and special case this first word using shift left to
|
||||
eliminate bits preceding the first byte. Since we want to join the
|
||||
|
||||
@ -515,7 +515,7 @@ L(zeroLength):
|
||||
of rBITDIF to 0. If rBITDIF == 0 then rStr1 is word aligned and can
|
||||
perform the Wunaligned loop.
|
||||
|
||||
Otherwise we know that rSTR1 is not aready word aligned yet.
|
||||
Otherwise we know that rSTR1 is not already word aligned yet.
|
||||
So we can force the string addresses to the next lower word
|
||||
boundary and special case this first word using shift left to
|
||||
eliminate bits preceding the first byte. Since we want to join the
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* non alitivec (old) version of setjmp for PowerPC.
|
||||
/* non altivec (old) version of setjmp for PowerPC.
|
||||
Copyright (C) 1995-2013 Free Software Foundation, Inc.
|
||||
This file is part of the GNU C Library.
|
||||
|
||||
|
||||
@ -49,7 +49,7 @@ EALIGN (memcpy, 5, 0)
|
||||
|
||||
.Lbigcopy:
|
||||
neg r8,r3 /* LS 3 bits = # bytes to 8-byte dest bdry */
|
||||
clrldi r8,r8,64-4 /* aling to 16byte boundary */
|
||||
clrldi r8,r8,64-4 /* align to 16byte boundary */
|
||||
sub r7,r4,r3
|
||||
cmpldi cr0,r8,0
|
||||
beq+ .Ldst_aligned
|
||||
|
||||
@ -157,7 +157,7 @@ __aio_notify (struct requestlist *req)
|
||||
#endif
|
||||
}
|
||||
else
|
||||
/* This is part of a asynchronous `lio_listio' operation. If
|
||||
/* This is part of an asynchronous `lio_listio' operation. If
|
||||
this request is the last one, send the signal. */
|
||||
if (--*waitlist->counterp == 0)
|
||||
{
|
||||
|
||||
@ -39,7 +39,7 @@ __feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if ((FE_INVALID & excepts) != 0)
|
||||
{
|
||||
/* One example of a invalid operation is 0/0. */
|
||||
/* One example of an invalid operation is 0/0. */
|
||||
__asm ("" : "=e" (d) : "0" (c.zero));
|
||||
d /= c.zero;
|
||||
__asm __volatile ("" : : "e" (d));
|
||||
|
||||
@ -22,7 +22,7 @@
|
||||
/* Define unique numbers for the operations permitted on socket. Linux
|
||||
uses a single system call for all these functions. The relevant code
|
||||
file is /usr/include/linux/net.h.
|
||||
We cannot use a enum here because the values are used in assembler
|
||||
We cannot use an enum here because the values are used in assembler
|
||||
code. */
|
||||
|
||||
#define SOCKOP_socket 1
|
||||
|
||||
@ -115,7 +115,7 @@ __NTH (feraiseexcept (int __excepts))
|
||||
{
|
||||
if ((FE_INVALID & __excepts) != 0)
|
||||
{
|
||||
/* One example of a invalid operation is 0.0 / 0.0. */
|
||||
/* One example of an invalid operation is 0.0 / 0.0. */
|
||||
float __f = 0.0;
|
||||
|
||||
# ifdef __SSE_MATH__
|
||||
|
||||
@ -30,7 +30,7 @@ __feraiseexcept (int excepts)
|
||||
/* First: invalid exception. */
|
||||
if ((FE_INVALID & excepts) != 0)
|
||||
{
|
||||
/* One example of a invalid operation is 0.0 / 0.0. */
|
||||
/* One example of an invalid operation is 0.0 / 0.0. */
|
||||
float f = 0.0;
|
||||
|
||||
__asm__ __volatile__ ("divss %0, %0 " : : "x" (f));
|
||||
|
||||
@ -93,7 +93,7 @@ ENTRY (STRCPY)
|
||||
movdqu (%rsi, %rcx), %xmm1 /* copy 16 bytes */
|
||||
movdqu %xmm1, (%rdi)
|
||||
|
||||
/* If source adress alignment != destination adress alignment */
|
||||
/* If source address alignment != destination address alignment */
|
||||
.p2align 4
|
||||
L(Unalign16Both):
|
||||
sub %rcx, %rdi
|
||||
@ -289,7 +289,7 @@ L(Unaligned64Leave):
|
||||
BRANCH_TO_JMPTBL_ENTRY (L(ExitTable), %rdx, 4)
|
||||
# endif
|
||||
|
||||
/* If source adress alignment == destination adress alignment */
|
||||
/* If source address alignment == destination address alignment */
|
||||
|
||||
L(SourceStringAlignmentLess32):
|
||||
pxor %xmm0, %xmm0
|
||||
|
||||
Loading…
Reference in New Issue
Block a user