| /src/games/hack/ |
| makedefs.c | 173 const char *sp0; local
196 sp0 = s + 1;
198 while (*sp0 && *sp0 == *sp1)
199 sp0++, sp1++;
200 if (!*sp0) {
|
| /src/lib/libc/stdlib/ |
| radixsort.c | 154 stack s[SIZE], *sp, *sp0, *sp1, temp; local
196 sp0 = sp1 = sp; /* Stack position of biggest bin. */
217 swap(*sp0, *sp1, temp); /* Play it safe -- biggest bin last. */
245 stack s[512], *sp, *sp0, *sp1, temp; local
278 sp0 = sp1 = sp;
302 swap(*sp0, *sp1, temp);
|
| /src/usr.bin/sort/ |
| radix_sort.c | 78 stack *s, *sp, *sp0, *sp1, temp; local
138 sp0 = sp1 = sp;
157 swap(*sp0, *sp1, temp);
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| sqrtrem.c | 187 mp_limb_t q, u, np0, sp0, rp0, q2; local
193 sp0 = mpn_sqrtrem1 (rp, np[1]);
195 /* rp0 <= 2*sp0 < 2^(Prec + 1) */
197 q = rp0 / sp0;
201 u = rp0 - q * sp0;
202 /* now we have (rp[0]<<Prec + np0>>Prec)/2 = q * sp0 + u */
203 sp0 = (sp0 << Prec) | q;
212 rp0 += sp0;
213 cc += rp0 < sp0;
[all...] |
| /src/sys/net/ |
| if_gre.c | 1165 struct gre_soparm sp0; local
1189 sp0 = sc->sc_soparm;
1190 sp0.sp_so = NULL;
1191 sp = &sp0;
|
