🚀 go-pugleaf

In article <9996@sri-spam.istc.sri.com> robert@sri-spam.UUCP (Robert Allen) writes:
>
>To further speed this up you could write it as:
>
>	strcpy2(ss1,ss2)
>	register char *ss1, *ss2;
>	{
>	    while (*s1++ = *s2++)
>	    ;
>	}
>
>thus eliminating two assignments and two local variables.
>
If your machine doesn't complain at char-int alignment, try

strcmp2(s1, s2)
register short int *s1, *s2;
{
	while (*s1 == *s2++)
		if (!((*s1++ & 255) && (*(char *)s1)))
			return(0);
	return(*s1 - *--s2);
}

This relies on the fact that it doesn't matter if you compare the NULLs at the
end of two equal strings or not. We go along the string twice as fast because
of the 16 bit operations, although there is a slight penalty due to the extra
test. The alignment problem only comes in if either of 
the strings begins on an odd boundary, which is fairly unusual anyway. 
Also watch the last part of the 'if' condition - this won't work on 
some machines, you may have to add 1 to the pointer.
-- 
       -Adam.

/* If at first it don't compile, kludge, kludge again.*/