/src/sys/arch/luna68k/luna68k/ |
disksubr.c | 308 u_short cksum, *sp1, *sp2; local in function:disklabel_om_to_bsd 313 sp1 = (u_short *)sl; 316 while (sp1 < sp2) 317 cksum ^= *sp1++; 405 u_short cksum, *sp1, *sp2; local in function:disklabel_bsd_to_om 435 sp1 = (u_short *)sl; 438 while (sp1 < sp2) 439 cksum ^= *sp1++;
|
/src/sys/dev/sun/ |
disksubr.c | 247 u_short cksum, *sp1, *sp2; local in function:disklabel_sun_to_bsd 252 sp1 = (u_short *)sl; 255 while (sp1 < sp2) 256 cksum ^= *sp1++; 342 u_short cksum, *sp1, *sp2; local in function:disklabel_bsd_to_sun 381 sp1 = (u_short *)sl; 384 while (sp1 < sp2) 385 cksum ^= *sp1++;
|
/src/games/hack/ |
makedefs.c | 174 char *sp1; local in function:skipuntil 197 sp1 = lp; 198 while (*sp0 && *sp0 == *sp1) 199 sp0++, sp1++; 201 lp = sp1;
|
/src/lib/libc/stdlib/ |
radixsort.c | 154 stack s[SIZE], *sp, *sp0, *sp1, temp; local in function:r_sort_a 196 sp0 = sp1 = sp; /* Stack position of biggest bin. */ 210 sp1 = sp; 217 swap(*sp0, *sp1, temp); /* Play it safe -- biggest bin last. */ 245 stack s[512], *sp, *sp0, *sp1, temp; local in function:r_sort_b 278 sp0 = sp1 = sp; 294 sp1 = sp; 302 swap(*sp0, *sp1, temp);
|
/src/usr.bin/sort/ |
radix_sort.c | 78 stack *s, *sp, *sp0, *sp1, temp; local in function:radix_sort 132 sp1 = erealloc(s, stack_size * sizeof *s); 133 sp = sp1 + (sp - s); 134 s = sp1; 138 sp0 = sp1 = sp; 148 sp1 = sp; 157 swap(*sp0, *sp1, temp);
|
/src/sys/arch/sparc/stand/ofwboot/ |
ofdev.c | 257 u_short cksum, *sp1, *sp2; local in function:disklabel_sun_to_bsd 262 sp1 = (u_short *)sl; 265 while (sp1 < sp2) 266 cksum ^= *sp1++;
|
/src/bin/csh/ |
func.c | 568 struct srch *sp, *sp1, *sp2; local in function:srchx 572 * Binary search Sp1 is the beginning of the current search range. Sp2 is 575 for (sp1 = srchn, sp2 = srchn + nsrchn; sp1 < sp2;) { 576 sp = sp1 + ((sp2 - sp1) >> 1); 583 sp1 = sp + 1;
|
/src/sbin/disklabel/ |
main.c | 2184 const char *const *sp1 = (const char *const *)v1; local in function:qsort_strcmp 2187 return strcmp(*sp1, *sp2);
|