mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-10 07:10:06 +00:00
Update.
2002-01-09 Jakub Jelinek <jakub@redhat.com> * elf/elf.h (SHN_UNDEF): Remove duplicate definition. 2002-01-09 Jakub Jelinek <jakub@redhat.com> * sysdeps/alpha/fpu/e_sqrt.c (__ieee754_sqrt): Don't use multi-line string literals. (__full_ieee754_sqrt): Add __attribute_used__. 2002-01-10 Ulrich Drepper <drepper@redhat.com> * sysdeps/generic/group_member.c (__group_member): Also check groups[0] [PR libc/2781].
This commit is contained in:
parent
ab92bebd3e
commit
d77a71c5fe
15
ChangeLog
15
ChangeLog
@ -1,3 +1,18 @@
|
|||||||
|
2002-01-09 Jakub Jelinek <jakub@redhat.com>
|
||||||
|
|
||||||
|
* elf/elf.h (SHN_UNDEF): Remove duplicate definition.
|
||||||
|
|
||||||
|
2002-01-09 Jakub Jelinek <jakub@redhat.com>
|
||||||
|
|
||||||
|
* sysdeps/alpha/fpu/e_sqrt.c (__ieee754_sqrt): Don't use multi-line
|
||||||
|
string literals.
|
||||||
|
(__full_ieee754_sqrt): Add __attribute_used__.
|
||||||
|
|
||||||
|
2002-01-10 Ulrich Drepper <drepper@redhat.com>
|
||||||
|
|
||||||
|
* sysdeps/generic/group_member.c (__group_member): Also check
|
||||||
|
groups[0] [PR libc/2781].
|
||||||
|
|
||||||
2002-01-08 Ulrich Drepper <drepper@redhat.com>
|
2002-01-08 Ulrich Drepper <drepper@redhat.com>
|
||||||
|
|
||||||
* Makefile (distribute): Add scripts/cpp.
|
* Makefile (distribute): Add scripts/cpp.
|
||||||
|
@ -415,10 +415,6 @@ typedef struct
|
|||||||
#define SYMINFO_NUM 2
|
#define SYMINFO_NUM 2
|
||||||
|
|
||||||
|
|
||||||
/* Special section index. */
|
|
||||||
|
|
||||||
#define SHN_UNDEF 0 /* No section, undefined symbol. */
|
|
||||||
|
|
||||||
/* How to extract and insert information held in the st_info field. */
|
/* How to extract and insert information held in the st_info field. */
|
||||||
|
|
||||||
#define ELF32_ST_BIND(val) (((unsigned char) (val)) >> 4)
|
#define ELF32_ST_BIND(val) (((unsigned char) (val)) >> 4)
|
||||||
|
@ -1,4 +1,4 @@
|
|||||||
/* Copyright (C) 1996, 1997, 1998 Free Software Foundation, Inc.
|
/* Copyright (C) 1996, 1997, 1998, 2002 Free Software Foundation, Inc.
|
||||||
Contributed by David Mosberger (davidm@cs.arizona.edu).
|
Contributed by David Mosberger (davidm@cs.arizona.edu).
|
||||||
This file is part of the GNU C Library.
|
This file is part of the GNU C Library.
|
||||||
|
|
||||||
@ -17,6 +17,7 @@
|
|||||||
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
||||||
02111-1307 USA. */
|
02111-1307 USA. */
|
||||||
|
|
||||||
|
#include <features.h>
|
||||||
|
|
||||||
#if !defined(_IEEE_FP_INEXACT)
|
#if !defined(_IEEE_FP_INEXACT)
|
||||||
|
|
||||||
@ -53,110 +54,110 @@ const static struct sqrt_data_struct {
|
|||||||
};
|
};
|
||||||
|
|
||||||
asm ("\
|
asm ("\
|
||||||
/* Define offsets into the structure defined in C above. */
|
/* Define offsets into the structure defined in C above. */ \n\
|
||||||
$DN = 0*8
|
$DN = 0*8 \n\
|
||||||
$UP = 1*8
|
$UP = 1*8 \n\
|
||||||
$HALF = 2*8
|
$HALF = 2*8 \n\
|
||||||
$ALMOST_THREE_HALF = 3*8
|
$ALMOST_THREE_HALF = 3*8 \n\
|
||||||
$NAN = 7*8
|
$NAN = 7*8 \n\
|
||||||
$T2 = 8*8
|
$T2 = 8*8 \n\
|
||||||
|
\n\
|
||||||
/* Stack variables. */
|
/* Stack variables. */ \n\
|
||||||
$K = 0
|
$K = 0 \n\
|
||||||
$Y = 8
|
$Y = 8 \n\
|
||||||
|
\n\
|
||||||
.text
|
.text \n\
|
||||||
.align 5
|
.align 5 \n\
|
||||||
.globl __ieee754_sqrt
|
.globl __ieee754_sqrt \n\
|
||||||
.ent __ieee754_sqrt
|
.ent __ieee754_sqrt \n\
|
||||||
__ieee754_sqrt:
|
__ieee754_sqrt: \n\
|
||||||
ldgp $29, 0($27)
|
ldgp $29, 0($27) \n\
|
||||||
subq $sp, 16, $sp
|
subq $sp, 16, $sp \n\
|
||||||
.frame $sp, 16, $26, 0\n"
|
.frame $sp, 16, $26, 0\n"
|
||||||
#ifdef PROF
|
#ifdef PROF
|
||||||
" lda $28, _mcount
|
" lda $28, _mcount \n\
|
||||||
jsr $28, ($28), _mcount\n"
|
jsr $28, ($28), _mcount\n"
|
||||||
#endif
|
#endif
|
||||||
" .prologue 1
|
" .prologue 1 \n\
|
||||||
|
\n\
|
||||||
.align 4
|
.align 4 \n\
|
||||||
stt $f16, $K($sp) # e0 :
|
stt $f16, $K($sp) # e0 : \n\
|
||||||
mult $f31, $f31, $f31 # .. fm :
|
mult $f31, $f31, $f31 # .. fm : \n\
|
||||||
lda $4, sqrt_data # e0 :
|
lda $4, sqrt_data # e0 : \n\
|
||||||
fblt $f16, $fixup # .. fa :
|
fblt $f16, $fixup # .. fa : \n\
|
||||||
|
\n\
|
||||||
ldah $2, 0x5fe8 # e0 :
|
ldah $2, 0x5fe8 # e0 : \n\
|
||||||
ldq $3, $K($sp) # .. e1 :
|
ldq $3, $K($sp) # .. e1 : \n\
|
||||||
ldt $f12, $HALF($4) # e0 :
|
ldt $f12, $HALF($4) # e0 : \n\
|
||||||
ldt $f18, $ALMOST_THREE_HALF($4) # .. e1 :
|
ldt $f18, $ALMOST_THREE_HALF($4) # .. e1 : \n\
|
||||||
|
\n\
|
||||||
sll $3, 52, $5 # e0 :
|
sll $3, 52, $5 # e0 : \n\
|
||||||
lda $6, 0x7fd # .. e1 :
|
lda $6, 0x7fd # .. e1 : \n\
|
||||||
fnop # .. fa :
|
fnop # .. fa : \n\
|
||||||
fnop # .. fm :
|
fnop # .. fm : \n\
|
||||||
|
\n\
|
||||||
subq $5, 1, $5 # e1 :
|
subq $5, 1, $5 # e1 : \n\
|
||||||
srl $3, 33, $1 # .. e0 :
|
srl $3, 33, $1 # .. e0 : \n\
|
||||||
cmpule $5, $6, $5 # e0 :
|
cmpule $5, $6, $5 # e0 : \n\
|
||||||
beq $5, $fixup # .. e1 :
|
beq $5, $fixup # .. e1 : \n\
|
||||||
|
\n\
|
||||||
mult $f16, $f12, $f11 # fm : $f11 = x * 0.5
|
mult $f16, $f12, $f11 # fm : $f11 = x * 0.5 \n\
|
||||||
subl $2, $1, $2 # .. e0 :
|
subl $2, $1, $2 # .. e0 : \n\
|
||||||
addt $f12, $f12, $f17 # .. fa : $f17 = 1.0
|
addt $f12, $f12, $f17 # .. fa : $f17 = 1.0 \n\
|
||||||
srl $2, 12, $1 # e0 :
|
srl $2, 12, $1 # e0 : \n\
|
||||||
|
\n\
|
||||||
and $1, 0xfc, $1 # e0 :
|
and $1, 0xfc, $1 # e0 : \n\
|
||||||
addq $1, $4, $1 # e1 :
|
addq $1, $4, $1 # e1 : \n\
|
||||||
ldl $1, $T2($1) # e0 :
|
ldl $1, $T2($1) # e0 : \n\
|
||||||
addt $f12, $f17, $f15 # .. fa : $f15 = 1.5
|
addt $f12, $f17, $f15 # .. fa : $f15 = 1.5 \n\
|
||||||
|
\n\
|
||||||
subl $2, $1, $2 # e0 :
|
subl $2, $1, $2 # e0 : \n\
|
||||||
ldt $f14, $DN($4) # .. e1 :
|
ldt $f14, $DN($4) # .. e1 : \n\
|
||||||
sll $2, 32, $2 # e0 :
|
sll $2, 32, $2 # e0 : \n\
|
||||||
stq $2, $Y($sp) # e0 :
|
stq $2, $Y($sp) # e0 : \n\
|
||||||
|
\n\
|
||||||
ldt $f13, $Y($sp) # e0 :
|
ldt $f13, $Y($sp) # e0 : \n\
|
||||||
mult/su $f11, $f13, $f10 # fm 2: $f10 = (x * 0.5) * y
|
mult/su $f11, $f13, $f10 # fm 2: $f10 = (x * 0.5) * y \n\
|
||||||
mult $f10, $f13, $f10 # fm 4: $f10 = ((x * 0.5) * y) * y
|
mult $f10, $f13, $f10 # fm 4: $f10 = ((x*0.5)*y)*y \n\
|
||||||
subt $f15, $f10, $f1 # fa 4: $f1 = (1.5 - 0.5*x*y*y)
|
subt $f15, $f10, $f1 # fa 4: $f1 = (1.5-0.5*x*y*y) \n\
|
||||||
|
\n\
|
||||||
mult $f13, $f1, $f13 # fm 4: yp = y*(1.5 - 0.5*x*y*y)
|
mult $f13, $f1, $f13 # fm 4: yp = y*(1.5-0.5*x*y^2)\n\
|
||||||
mult/su $f11, $f13, $f1 # fm 4: $f11 = x * 0.5 * yp
|
mult/su $f11, $f13, $f1 # fm 4: $f11 = x * 0.5 * yp \n\
|
||||||
mult $f1, $f13, $f11 # fm 4: $f11 = (x * 0.5 * yp) * yp
|
mult $f1, $f13, $f11 # fm 4: $f11 = (x*0.5*yp)*yp \n\
|
||||||
subt $f18, $f11, $f1 # fa 4: $f1= (1.5-2^-30) - 0.5*x*yp*yp
|
subt $f18, $f11, $f1 # fa 4: $f1=(1.5-2^-30)-x/2*yp^2\n\
|
||||||
|
\n\
|
||||||
mult $f13, $f1, $f13 # fm 4: ypp = $f13 = yp*$f1
|
mult $f13, $f1, $f13 # fm 4: ypp = $f13 = yp*$f1 \n\
|
||||||
subt $f15, $f12, $f1 # .. fa : $f1 = (1.5 - 0.5)
|
subt $f15, $f12, $f1 # .. fa : $f1 = (1.5 - 0.5) \n\
|
||||||
ldt $f15, $UP($4) # .. e0 :
|
ldt $f15, $UP($4) # .. e0 : \n\
|
||||||
mult/su $f16, $f13, $f10 # fm 4: z = $f10 = x * ypp
|
mult/su $f16, $f13, $f10 # fm 4: z = $f10 = x * ypp \n\
|
||||||
|
\n\
|
||||||
mult $f10, $f13, $f11 # fm 4: $f11 = z*ypp
|
mult $f10, $f13, $f11 # fm 4: $f11 = z*ypp \n\
|
||||||
mult $f10, $f12, $f12 # fm : $f12 = z*0.5
|
mult $f10, $f12, $f12 # fm : $f12 = z*0.5 \n\
|
||||||
subt $f1, $f11, $f1 # fa 4: $f1 = 1 - z*ypp
|
subt $f1, $f11, $f1 # fa 4: $f1 = 1 - z*ypp \n\
|
||||||
mult $f12, $f1, $f12 # fm 4: $f12 = z*0.5*(1 - z*ypp)
|
mult $f12, $f1, $f12 # fm 4: $f12 = z/2*(1 - z*ypp)\n\
|
||||||
|
\n\
|
||||||
addt $f10, $f12, $f0 # fa 4: zp=res= z + z*0.5*(1 - z*ypp)
|
addt $f10, $f12, $f0 # fa 4: zp=res= z+z/2*(1-z*ypp)\n\
|
||||||
mult/c $f0, $f14, $f12 # fm 4: zmi = zp * DN
|
mult/c $f0, $f14, $f12 # fm 4: zmi = zp * DN \n\
|
||||||
mult/c $f0, $f15, $f11 # fm : zpl = zp * UP
|
mult/c $f0, $f15, $f11 # fm : zpl = zp * UP \n\
|
||||||
mult/c $f0, $f12, $f1 # fm : $f1 = zp * zmi
|
mult/c $f0, $f12, $f1 # fm : $f1 = zp * zmi \n\
|
||||||
|
\n\
|
||||||
mult/c $f0, $f11, $f15 # fm : $f15 = zp * zpl
|
mult/c $f0, $f11, $f15 # fm : $f15 = zp * zpl \n\
|
||||||
subt/su $f1, $f16, $f13 # .. fa : y1 = zp*zmi - x
|
subt/su $f1, $f16, $f13 # .. fa : y1 = zp*zmi - x \n\
|
||||||
subt/su $f15, $f16, $f14 # fa 4: y2 = zp*zpl - x
|
subt/su $f15, $f16, $f14 # fa 4: y2 = zp*zpl - x \n\
|
||||||
fcmovge $f13, $f12, $f0 # fa 3: res = (y1 >= 0) ? zmi : res
|
fcmovge $f13, $f12, $f0 # fa 3: res = (y1>=0)?zmi:res \n\
|
||||||
|
\n\
|
||||||
fcmovlt $f14, $f11, $f0 # fa 4: res = (y2 < 0) ? zpl : res
|
fcmovlt $f14, $f11, $f0 # fa 4: res = (y2<0)?zpl:res \n\
|
||||||
addq $sp, 16, $sp # .. e0 :
|
addq $sp, 16, $sp # .. e0 : \n\
|
||||||
ret # .. e1 :
|
ret # .. e1 : \n\
|
||||||
|
\n\
|
||||||
.align 4
|
.align 4 \n\
|
||||||
$fixup:
|
$fixup: \n\
|
||||||
addq $sp, 16, $sp
|
addq $sp, 16, $sp \n\
|
||||||
br "ASM_ALPHA_NG_SYMBOL_PREFIX"__full_ieee754_sqrt..ng
|
br "ASM_ALPHA_NG_SYMBOL_PREFIX"__full_ieee754_sqrt..ng \n\
|
||||||
|
\n\
|
||||||
.end __ieee754_sqrt");
|
.end __ieee754_sqrt");
|
||||||
|
|
||||||
static double __full_ieee754_sqrt(double) __attribute__((unused));
|
static double __full_ieee754_sqrt(double) __attribute_used__;
|
||||||
#define __ieee754_sqrt __full_ieee754_sqrt
|
#define __ieee754_sqrt __full_ieee754_sqrt
|
||||||
|
|
||||||
#endif /* _IEEE_FP_INEXACT */
|
#endif /* _IEEE_FP_INEXACT */
|
||||||
|
@ -1,5 +1,5 @@
|
|||||||
/* `group_member' -- test if process is in a given group.
|
/* `group_member' -- test if process is in a given group.
|
||||||
Copyright (C) 1995, 1997 Free Software Foundation, Inc.
|
Copyright (C) 1995, 1997, 2002 Free Software Foundation, Inc.
|
||||||
This file is part of the GNU C Library.
|
This file is part of the GNU C Library.
|
||||||
|
|
||||||
The GNU C Library is free software; you can redistribute it and/or
|
The GNU C Library is free software; you can redistribute it and/or
|
||||||
@ -41,7 +41,7 @@ __group_member (gid)
|
|||||||
size *= 2;
|
size *= 2;
|
||||||
} while (n == size / 2);
|
} while (n == size / 2);
|
||||||
|
|
||||||
while (n > 0)
|
while (n >= 0)
|
||||||
if (groups[n--] == gid)
|
if (groups[n--] == gid)
|
||||||
return 1;
|
return 1;
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user