speeded up a bit

lang/cem/libcc/gen/strcat.c

@@ -7,8 +7,9 @@ register char *s1, *s2;
   char *original = s1;
 
   /* Find the end of s1. */
-  while (*s1 != 0) s1++;
+  while (*s1++ != 0) ;
 
+  s1--;
   /* Now copy s2 to the end of s1. */
   while (*s1++ = *s2++) /* nothing */ ;
   return(original);

lang/cem/libcc/gen/strcmp.c

@@ -1,16 +1,10 @@
 /* $Header$ */
-int strcmp(s1, s2)
+int
-register char *s1, *s2;
+strcmp(s, t)
+	register char *s, *t;
 {
-/* Compare 2 strings. */
+	while (*s == *t++)
-
+		if (*s++ == '\0')
-  for(;;) {
+			return 0;
-	if (*s1 != *s2) {
+	return *s - *--t;
-		if (!*s1) return -1;
-		if (!*s2) return 1;
-		return(*s1 - *s2);
-	}
-	if (*s1++ == 0) return(0);
-	s2++;
-  }
 }

lang/cem/libcc/gen/strlen.c

@@ -1,11 +1,11 @@
 /* $Header$ */
-int strlen(s)
+int
-char *s;
+strlen(s)
+	char *s;
 {
-/* Return length of s. */
+	register char *b = s;
 
-  char *original = s;
+	while (*b++)
-
+		;
-  while (*s != 0) s++;
+	return b - s - 1;
-  return(s - original);
 }

lang/cem/libcc/gen/strncat.c

@@ -10,7 +10,9 @@ int n;
   if (n <= 0) return(s1);
 
   /* Find the end of s1. */
-  while (*s1 != 0) s1++;
+  while (*s1++ != 0) ;
+
+  s1--;
 
   /* Now copy s2 to the end of s1. */
   while (*s1++ = *s2++) {

lang/cem/libcc/gen/strncmp.c

@@ -1,19 +1,16 @@
 /* $Header$ */
 int
-strncmp(s1, s2, n)
+strncmp(s, t, n)
-	register char *s1, *s2;
+	register char *s, *t;
-	int n;
+	register int n;
 {
-/* Compare two strings, but at most n characters. */
+	while (n-- > 0) {
-
+		if (*s == *t++) {
-  while (n-- > 0) {
+			if (*s++ == '\0')
-	if (*s1 != *s2) {
+				return 0;
-		if (!*s1) return -1;
+		}
-		if (!*s2) return 1;
+		else
-		return(*s1 - *s2);
+			return *s - *--t;
 	}
-	if (*s1++ == 0) break;
+	return 0;
-	s2++;
-  }
-  return 0;
 }