| /src/games/phantasia/ |
| map.c | 134 char s1[2]; local in function:plusplus
139 s1[0] = *s++;
140 s1[1] = '\0';
141 label(s1);
151 char s1[2]; local in function:plusminus
156 s1[0] = *s++;
157 s1[1] = '\0';
158 label(s1);
|
| /src/usr.bin/xargs/ |
| strnsubst.c | 40 char *s1, *s2, *this; local in function:strnsubst
42 s1 = *str;
43 if (s1 == NULL)
46 * If maxsize is 0 then set it to to the length of s1, because we have
47 * to duplicate s1. XXX we maybe should double-check whether the match
48 * appears in s1. If it doesn't, then we also have to set the length
49 * to the length of s1, to avoid modifying the argument. It may make
50 * sense to check if maxsize is <= strlen(s1), because in that case we
55 maxsize = strlen(s1) + 1;
64 if (match == NULL || replstr == NULL || maxsize == strlen(s1)) {
[all...] |
| /src/tests/lib/librumpclient/ |
| h_exec.c | 51 int s1, s2; local in function:main
71 if ((s1 = rump_sys_socket(PF_INET, SOCK_STREAM, 0)) == -1)
81 if (rump_sys_bind(s1, (struct sockaddr *)&sin, sizeof(sin)) == -1)
87 if (rump_sys_listen(s1, 1) == -1)
103 if (rump_sys_fcntl(s1, F_SETFD, FD_CLOEXEC) == -1) {
|
| /src/lib/libm/src/ |
| e_sqrt.c | 99 u_int32_t r,t1,s1,ix1,q1; local in function:__ieee754_sqrt
137 q = q1 = s0 = s1 = 0; /* [q,q1] = sqrt(x) */
154 t1 = s1+r;
157 s1 = t1+r;
158 if(((t1&sign)==(u_int32_t)sign)&&(s1&sign)==0) s0 += 1;
|
| s_atan.c | 87 double w,s1,s2,z; local in function:atan
124 s1 = z*(aT[0]+w*(aT[2]+w*(aT[4]+w*(aT[6]+w*(aT[8]+w*aT[10])))));
126 if (id<0) return x - x*(s1+s2);
128 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
|
| s_atanf.c | 66 float w,s1,s2,z; local in function:atanf
100 s1 = z*(aT[0]+w*(aT[2]+w*(aT[4]+w*(aT[6]+w*(aT[8]+w*aT[10])))));
102 if (id<0) return x - x*(s1+s2);
104 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
|
| s_atanl.c | 55 long double w,s1,s2,z; local in function:atanl
97 s1 = z*T_even(w);
99 if (id<0) return x - x*(s1+s2);
101 z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
|
| /src/sys/arch/m68k/fpe/ |
| fpu_exp.c | 59 struct fpn *s1; local in function:fpu_etox_taylor
73 /* s1 = s0 * x / k */
80 s1 = fpu_div(fe);
82 /* break if s1 is enough small */
83 if (ISZERO(s1))
85 if (res.fp_exp - s1->fp_exp >= EXT_FRACBITS)
88 /* s0 := s1 for next loop */
89 CPYFPN(&s0, s1);
91 /* res += s1 */
92 CPYFPN(&fe->fe_f2, s1);
[all...] |
| /src/sys/arch/powerpc/pci/ |
| pchb.c | 81 const char *s1; local in function:mpc105_print
89 s1 = "256K";
92 s1 = "512K";
95 s1 = "1M";
98 s1 = "reserved size";
102 aprint_normal("%s, ", s1);
105 s1 = "uniprocessor/none";
108 s1 = "write-through";
111 s1 = "write-back";
114 s1 = "multiprocessor"
124 const char *s1; local in function:mpc106_print
186 const char *s1, *s2; local in function:ibm82660_print
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/ |
| tsan_sync_test.cc | 56 SyncVar *s1 = m->GetIfExistsAndLock((uptr)&block[0], true); local in function:__tsan::TEST
57 EXPECT_EQ(s1, (SyncVar*)0);
58 s1 = m->GetOrCreateAndLock(thr, 0, (uptr)&block[0], true);
59 EXPECT_NE(s1, (SyncVar*)0);
60 EXPECT_EQ(s1->addr, (uptr)&block[0]);
61 s1->mtx.Unlock();
67 s1 = m->GetIfExistsAndLock((uptr)&block[0], true);
68 EXPECT_EQ(s1, (SyncVar*)0);
81 SyncVar *s1 = m->GetOrCreateAndLock(thr, 0, (uptr)&block1[0], true); local in function:__tsan::TEST
82 s1->mtx.Unlock()
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/radeon/ |
| evergreen_smc.h | 37 uint16_t s1; member in struct:SMC_Evergreen_MCRegisterAddress
|
| /src/tests/lib/librt/ |
| t_sched.c | 51 struct sched_param s1, s2; local in function:ATF_TC_BODY
58 ATF_REQUIRE(sched_getparam(0, &s1) == 0);
61 ATF_CHECK_EQ(s1.sched_priority, s2.sched_priority);
67 ATF_REQUIRE(sched_getparam(-1, &s1) != 0);
|
| /src/lib/libc/gen/ |
| humanize_number.c | 51 int b, i, r, s1, s2, sign; local in function:humanize_number
188 s1 = b / 10;
191 sign * s1, localeconv()->decimal_point, s2,
|
| /src/lib/libc/gdtoa/test/ |
| xLtest.c | 82 char *s, *s1, *se, *se1; local in function:main
105 u.bits[_0] = (ULong)strtoul(s1 = s+1, &se, 16);
106 if (se > s1) {
107 u.bits[_1] = (ULong)strtoul(s1=se, &se, 16);
108 if (se > s1)
109 u.bits[_2] = (ULong)strtoul(s1=se, &se, 16);
|
| Qtest.c | 83 char *s, *s1, *se, *se1; local in function:main
111 u.bits[_0] = (ULong)strtoul(s1 = s+1, &se, 16);
112 if (se > s1) {
113 u.bits[_1] = (ULong)strtoul(s1 = se, &se, 16);
114 if (se > s1) {
115 u.bits[_2] = (ULong)strtoul(s1 = se, &se, 16);
116 if (se > s1)
117 u.bits[_3] = (ULong)strtoul(s1 = se, &se, 16);
|
| ddtest.c | 80 char *s, *s1, *se, *se1; local in function:main
119 for(s1 = s; *s1 > ' '; s1++){};
120 while(*s1 <= ' ' && *s1) s1++;
121 if (!*s1) {
|
| strtodt.c | 59 char *s, *s1, *se; local in function:process
75 if ((a.L[0] = (ULong)strtoul(s, &s1,16), s1 <= s)
76 || (a.L[1] = (ULong)strtoul(s1,&se,16), se <= s1)) {
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_stackdepot_test.cc | 22 StackTrace s1(array, ARRAY_SIZE(array)); local in function:__sanitizer::TEST
23 u32 i1 = StackDepotPut(s1);
48 StackTrace s1(array, ARRAY_SIZE(array)); local in function:__sanitizer::TEST
49 u32 i1 = StackDepotPut(s1);
50 u32 i2 = StackDepotPut(s1);
60 StackTrace s1(array1, ARRAY_SIZE(array1)); local in function:__sanitizer::TEST
61 u32 i1 = StackDepotPut(s1);
74 StackTrace s1(array1, ARRAY_SIZE(array1)); local in function:__sanitizer::TEST
78 ids[0] = StackDepotPut(s1);
|
| sanitizer_bitvector_test.cc | 118 set<uptr> s, s1, t_s; local in function:TestBitVector
132 s1.insert(bits[bv.size() / 2 + i]);
134 CheckBV(bv1, s1);
137 set_intersection(s.begin(), s.end(), s1.begin(), s1.end(),
144 t_s.insert(s1.begin(), s1.end());
156 set_difference(s.begin(), s.end(), s1.begin(), s1.end(),
|
| /src/tests/include/sys/ |
| t_socket.c | 89 int s1, s2, sgot; local in function:ATF_TC_BODY
102 s1 = rump_sys_socket(AF_LOCAL, SOCK_STREAM, 0);
103 if (s1 == -1)
105 if (rump_sys_bind(s1, (struct sockaddr *)&sun, SUN_LEN(&sun)) == -1)
107 if (rump_sys_listen(s1, 1) == -1)
165 sgot = rump_sys_accept(s1, (struct sockaddr *)&sun, &sl);
|
| t_bitops.c | 117 uint8_t i, s1, s2; local in function:ATF_TC_BODY
122 fast_divide32_prepare(b, &m, &s1, &s2);
124 q = fast_divide32(a, b, m, s1, s2);
125 r = fast_remainder32(a, b, m, s1, s2);
129 " m=%"PRIu32" s1=%"PRIu8" s2=%"PRIu8,
130 q, a, b, a / b, m, s1, s2);
133 " m=%"PRIu32" s1=%"PRIu8" s2=%"PRIu8,
134 q, a, b, a % b, m, s1, s2);
141 fast_divide32_prepare(b, &m, &s1, &s2);
143 q = fast_divide32(a, b, m, s1, s2)
[all...] |
| /src/usr.bin/tr/ |
| tr.c | 65 STR *s1, *s2; local in function:main
173 s1 = NULL; /* for safety */
178 s1 = str_create(1, argv[0]);
214 if (!next(s1, &ch)) {
252 if (s1 != NULL) {
253 str_destroy(s1);
|
| /src/lib/libc/gdtoa/ |
| gethex.c | 44 CONST char *decpt, *s, *s0, *s1; local in function:gethex
108 s1 = s;
121 s = s1;
185 n = (int)(s1 - s0) - 1;
197 while(s1 > s0) {
199 if (*--s1 == decimalpoint[i]) {
200 s1 -= i;
204 if (*--s1 == '.')
212 L |= (unsigned int)(hexdig[(unsigned char)*s1] & 0x0f) << n;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| asan_mem_test.cc | 212 char *s1 = MallocAndMemsetString(size); local in function:TEST
215 Ident(memcmp(s1, s2, size));
216 Ident(memcmp(s1 + size - 1, s2 + size - 1, 1));
217 Ident(memcmp(s1 - 1, s2 - 1, 0));
219 EXPECT_DEATH(Ident(memcmp)(s1 - 1, s2, 1), LeftOOBReadMessage(1));
220 EXPECT_DEATH(Ident(memcmp)(s1, s2 - 1, 1), LeftOOBReadMessage(1));
221 EXPECT_DEATH(Ident(memcmp)(s1 + size, s2, 1), RightOOBReadMessage(0));
222 EXPECT_DEATH(Ident(memcmp)(s1, s2 + size, 1), RightOOBReadMessage(0));
224 EXPECT_DEATH(Ident(memcmp)(s1 + 1, s2 + 1, size), RightOOBReadMessage(0));
225 EXPECT_DEATH(Ident(memcmp)(s1 + size - 1, s2, 2), RightOOBReadMessage(0))
[all...] |
| /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_hash/sha256/cp/ |
| hash_sha256_cp.c | 79 #define S1(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25))
81 #define s1(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHR(x, 10)) macro
84 h += S1(e) + Ch(e, f, g) + k; \
95 s1(W[i + ii + 14]) + W[i + ii + 9] + s0(W[i + ii + 1]) + W[i + ii]
|
