Bruce Evans 5182dcbec2 Rearrange the inner loop of scanc() to get better code on i*86's ... (on an i486, 10 cycles (+ cache misses) instead of 15). The change should be a no-op if the compiler is any good. The best possible i*86 code for the same algorithm is only 1 more cycle faster on i486's so I don't want to bother implementing an assembler version. scanc() is a bottleneck for OPOST processing. It is naturally about 4 times as slow as bcopy() on 32-bit systems.		1995-07-11 18:50:47 +00:00
..
adddi3.c
anddi3.c
ashldi3.c
ashrdi3.c
bcmp.c
cmpdi2.c
divdi3.c
ffs.c
fnmatch.c
inet_ntoa.c
iordi3.c
libkern.h
locc.c
lshldi3.c
lshrdi3.c
Makefile
mcount.c
moddi3.c
muldi3.c
negdi2.c
notdi2.c
qdivrem.c
quad.h
random.c
rindex.c
scanc.c	Rearrange the inner loop of scanc() to get better code on i*86's	1995-07-11 18:50:47 +00:00
skpc.c
strcat.c
strcmp.c
strcpy.c
strlen.c
strncmp.c
strncpy.c
strsep.c
strtol.c
subdi3.c
ucmpdi2.c
udivdi3.c
umoddi3.c
xordi3.c