aboutsummaryrefslogtreecommitdiff
path: root/sysdeps/i386
diff options
context:
space:
mode:
Diffstat (limited to 'sysdeps/i386')
-rw-r--r--sysdeps/i386/fpu/bits/mathinline.h4
-rw-r--r--sysdeps/i386/memchr.S8
2 files changed, 6 insertions, 6 deletions
diff --git a/sysdeps/i386/fpu/bits/mathinline.h b/sysdeps/i386/fpu/bits/mathinline.h
index 465592c..b188026 100644
--- a/sysdeps/i386/fpu/bits/mathinline.h
+++ b/sysdeps/i386/fpu/bits/mathinline.h
@@ -307,7 +307,7 @@ __sincosl (long double __x, long double *__sinx, long double *__cosx)
__asm __volatile__ \
("fldl2e # e^x - 1 = 2^(x * log2(e)) - 1\n\t" \
"fmul %%st(1) # x * log2(e)\n\t" \
- "fstl %%st(1)\n\t" \
+ "fst %%st(1)\n\t" \
"frndint # int(x * log2(e))\n\t" \
"fxch\n\t" \
"fsub %%st(1) # fract(x * log2(e))\n\t" \
@@ -328,7 +328,7 @@ __inline_mathcode_ (long double, __expm1l, __x, __expm1_code)
__asm __volatile__ \
("fldl2e # e^x = 2^(x * log2(e))\n\t" \
"fmul %%st(1) # x * log2(e)\n\t" \
- "fstl %%st(1)\n\t" \
+ "fst %%st(1)\n\t" \
"frndint # int(x * log2(e))\n\t" \
"fxch\n\t" \
"fsub %%st(1) # fract(x * log2(e))\n\t" \
diff --git a/sysdeps/i386/memchr.S b/sysdeps/i386/memchr.S
index c4dcef1..1750aa8 100644
--- a/sysdeps/i386/memchr.S
+++ b/sysdeps/i386/memchr.S
@@ -1,7 +1,7 @@
/* memchr (str, ch, n) -- Return pointer to first occurrence of CH in STR less
than N.
For Intel 80x86, x>=3.
- Copyright (C) 1994, 1995, 1996, 1997 Free Software Foundation, Inc.
+ Copyright (C) 1994, 1995, 1996, 1997, 1998 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>
Optimised a little by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>
@@ -70,7 +70,7 @@ ENTRY (memchr)
So process first bytes one by one until boundary is
reached. Don't use a loop for better performance. */
- testb $3, %eax /* correctly aligned ? */
+ testb $3, %al /* correctly aligned ? */
je L(2) /* yes => begin loop */
cmpb %dl, (%eax) /* compare byte */
je L(9) /* target found => return */
@@ -78,7 +78,7 @@ ENTRY (memchr)
decl %esi /* decrement length counter */
je L(4) /* len==0 => return NULL */
- testb $3, %eax /* correctly aligned ? */
+ testb $3, %al /* correctly aligned ? */
je L(2) /* yes => begin loop */
cmpb %dl, (%eax) /* compare byte */
je L(9) /* target found => return */
@@ -86,7 +86,7 @@ ENTRY (memchr)
decl %esi /* decrement length counter */
je L(4) /* len==0 => return NULL */
- testb $3, %eax /* correctly aligned ? */
+ testb $3, %al /* correctly aligned ? */
je L(2) /* yes => begin loop */
cmpb %dl, (%eax) /* compare byte */
je L(9) /* target found => return */