Home
last modified time | relevance | path

Searched full:s2 (Results 1 – 25 of 934) sorted by relevance

12345678910>>...38

/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerInterceptors.cpp62 static int internal_strcmp_strncmp(const char *s1, const char *s2, bool strncmp, in internal_strcmp_strncmp() argument
72 unsigned c2 = *s2; in internal_strcmp_strncmp()
78 s2++; in internal_strcmp_strncmp()
83 static int internal_strncmp(const char *s1, const char *s2, size_t n) { in internal_strncmp() argument
84 return internal_strcmp_strncmp(s1, s2, true, n); in internal_strncmp()
87 static int internal_strcmp(const char *s1, const char *s2) { in internal_strcmp() argument
88 return internal_strcmp_strncmp(s1, s2, false, 0); in internal_strcmp()
91 static int internal_memcmp(const void *s1, const void *s2, size_t n) { in internal_memcmp() argument
93 const uint8_t *t2 = static_cast<const uint8_t *>(s2); in internal_memcmp()
125 const void *s2, size_t n, int result);
[all …]
/freebsd/crypto/openssl/crypto/camellia/
H A Dcamellia.c276 * adjusting n accordingly, e.g. RotLeft128(s1,s2,s3,s0,n-32).
288 register u32 s0, s1, s2, s3; in Camellia_Ekeygen() local
292 k[2] = s2 = GETU32(rawKey + 8); in Camellia_Ekeygen()
299 k[10] = s2 = ~s0; in Camellia_Ekeygen()
302 k[10] = s2 = GETU32(rawKey + 24); in Camellia_Ekeygen()
305 s0 ^= k[0], s1 ^= k[1], s2 ^= k[2], s3 ^= k[3]; in Camellia_Ekeygen()
309 Camellia_Feistel(s0, s1, s2, s3, SIGMA + 0); in Camellia_Ekeygen()
310 Camellia_Feistel(s2, s3, s0, s1, SIGMA + 2); in Camellia_Ekeygen()
312 s0 ^= k[0], s1 ^= k[1], s2 ^= k[2], s3 ^= k[3]; in Camellia_Ekeygen()
313 Camellia_Feistel(s0, s1, s2, s3, SIGMA + 4); in Camellia_Ekeygen()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSetOperations.h43 template <class S1Ty, class S2Ty> bool set_union(S1Ty &S1, const S2Ty &S2) { in set_union() argument
46 for (const auto &E : S2) in set_union()
56 /// elements that are not contained in S2.
58 template <class S1Ty, class S2Ty> void set_intersect(S1Ty &S1, const S2Ty &S2) { in set_intersect() argument
59 auto Pred = [&S2](const auto &E) { return !S2.count(E); }; in set_intersect()
66 if (!S2.count(*I)) in set_intersect()
67 S1.erase(I); // Erase element if not in S2 in set_intersect()
73 S1Ty set_intersection_impl(const S1Ty &S1, const S2Ty &S2) { in set_intersection_impl() argument
76 if (S2.count(E)) in set_intersection_impl()
83 S1Ty set_intersection(const S1Ty &S1, const S2Ty &S2) { in set_intersection() argument
[all …]
H A DStringSwitch.h94 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
96 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
99 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
101 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
104 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
106 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
109 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
112 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
115 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
118 return Case(S0, Value).Cases(S1, S2, S in Cases()
121 Cases(StringLiteral S0,StringLiteral S1,StringLiteral S2,StringLiteral S3,StringLiteral S4,StringLiteral S5,StringLiteral S6,StringLiteral S7,T Value) Cases() argument
127 Cases(StringLiteral S0,StringLiteral S1,StringLiteral S2,StringLiteral S3,StringLiteral S4,StringLiteral S5,StringLiteral S6,StringLiteral S7,StringLiteral S8,T Value) Cases() argument
134 Cases(StringLiteral S0,StringLiteral S1,StringLiteral S2,StringLiteral S3,StringLiteral S4,StringLiteral S5,StringLiteral S6,StringLiteral S7,StringLiteral S8,StringLiteral S9,T Value) Cases() argument
167 CasesLower(StringLiteral S0,StringLiteral S1,StringLiteral S2,T Value) CasesLower() argument
172 CasesLower(StringLiteral S0,StringLiteral S1,StringLiteral S2,StringLiteral S3,T Value) CasesLower() argument
177 CasesLower(StringLiteral S0,StringLiteral S1,StringLiteral S2,StringLiteral S3,StringLiteral S4,T Value) CasesLower() argument
[all...]
/freebsd/lib/libc/string/
H A Dwmemchr.373 .Fn wmemcmp "const wchar_t *s1" "const wchar_t *s2" "size_t n"
75 .Fn wmemcpy "wchar_t * restrict s1" "const wchar_t * restrict s2" "size_t n"
77 .Fn wmemmove "wchar_t *s1" "const wchar_t *s2" "size_t n"
79 .Fn wmempcpy "wchar_t * restrict s1" "const wchar_t * restrict s2" "size_t n"
83 .Fn wcpcpy "wchar_t * restrict s1" "const wchar_t * restrict s2"
85 .Fn wcpncpy "wchar_t * restrict s1" "const wchar_t * restrict s2" "size_t n"
87 .Fn wcscasecmp "const wchar_t *s1" "const wchar_t *s2"
89 .Fn wcscat "wchar_t * restrict s1" "const wchar_t * restrict s2"
93 .Fn wcscmp "const wchar_t *s1" "const wchar_t *s2"
95 .Fn wcscpy "wchar_t * restrict s1" "const wchar_t * restrict s2"
[all …]
/freebsd/contrib/ntp/sntp/libpkgver/
H A Dcolcomp.c37 colcomp (s1, s2) in colcomp() argument
39 register char *s2;
43 while (*s1 && *s2)
46 && MyIsDigit(*s2))
48 hilo = (*s1 < *s2) ? -1 : (*s1 > *s2) ? 1 : 0;
50 ++s2;
52 && MyIsDigit(*s2))
55 hilo = (*s1 < *s2) ? -1 : (*s1 > *s2) ? 1 : 0;
57 ++s2;
60 hilo = 1; /* s2 is first */
[all …]
/freebsd/contrib/sendmail/libsm/
H A Dstrcaseeq.c24 ** s2 -- string
27 ** true iff s1 == s2
31 sm_strcaseeq(s1, s2) in sm_strcaseeq() argument
33 const char *s2;
41 if (!asciistr(s2))
43 return (sm_strcasecmp(s1, s2) == 0);
45 if (asciistr(s2))
55 l2 = sm_lowercase(s2);
70 ** s2 -- string
74 ** true iff s1 == s2 (for up to the first n char)
[all …]
H A Dt-strrevcmp.c24 char *s2; variable
29 s2 = "equal";
30 SM_TEST(sm_strrevcmp(s1, s2) == 0);
33 s2 = "qual";
34 SM_TEST(sm_strrevcmp(s1, s2) > 0);
37 s2 = "equal";
38 SM_TEST(sm_strrevcmp(s1, s2) < 0);
41 s2 = "equal";
42 SM_TEST(sm_strrevcmp(s1, s2) < 0);
45 s2 = "equal";
[all …]
H A Dstrrevcmp.c26 ** s2 -- second string.
29 ** strcasecmp(reverse(s1), reverse(s2))
33 sm_strrevcasecmp(s1, s2) in sm_strrevcasecmp() argument
34 const char *s1, *s2; in sm_strrevcasecmp()
39 i2 = strlen(s2) - 1;
42 charmap[(unsigned char) s2[i2]])
60 charmap[(unsigned char) s2[i2]]);
68 ** s2 -- second string.
71 ** strcmp(reverse(s1), reverse(s2))
75 sm_strrevcmp(s1, s2) in sm_strrevcmp() argument
[all …]
/freebsd/crypto/openssl/crypto/aes/asm/
H A Daes-armv4.pl61 $s2="r2";
229 ldrb $s2,[$rounds,#11]
235 orr $s2,$s2,$t1,lsl#8
237 orr $s2,$s2,$t2,lsl#16
239 orr $s2,$s2,$t3,lsl#24
248 ldr $s2,[$rounds,#8]
253 rev $s2,$s2
264 rev $s2,$s2
269 str $s2,[$rounds,#8]
284 mov $t1,$s2,lsr#24
[all …]
H A Daes-s390x.pl119 $s2="%r10";
275 llgf $s2,8($inp)
284 st $s2,8($out)
297 x $s2,8($key)
333 srlg $i1,$s2,`8-3` # i0
334 srlg $i2,$s2,`16-3` # i1
337 sllg $i3,$s2,`0+3`
338 srl $s2,`24-3`
339 nr $s2,$mask
349 x $s0,2($i1,$tbl) # Te2[s2>>8]
[all …]
H A Daes-ppc.pl88 $s2="r10";
381 lwz $s2,8($inp)
391 rotlwi $s2,$t2,8
395 rlwimi $s2,$t2,24,0,7
399 rlwimi $s2,$t2,24,16,23
410 rotlwi $t2,$s2,8
414 rlwimi $t2,$s2,24,0,7
418 rlwimi $t2,$s2,24,16,23
428 stw $s2,8($out)
455 lbz $s2,11($inp)
[all …]
/freebsd/crypto/openssh/regress/unittests/sshbuf/
H A Dtest_sshbuf_getput_basic.c37 char *s2; in sshbuf_getput_basic_tests() local
348 r = sshbuf_get_cstring(p1, &s2, &s); in sshbuf_getput_basic_tests()
360 r = sshbuf_get_cstring(p1, &s2, NULL); in sshbuf_getput_basic_tests()
371 ASSERT_INT_EQ(sshbuf_get_cstring(p1, &s2, &s), 0); in sshbuf_getput_basic_tests()
373 ASSERT_MEM_EQ(s2, x, s); in sshbuf_getput_basic_tests()
374 free(s2); in sshbuf_getput_basic_tests()
553 s2 = sshbuf_dtob16(p1); in sshbuf_getput_basic_tests()
554 ASSERT_PTR_NE(s2, NULL); in sshbuf_getput_basic_tests()
555 ASSERT_STRING_EQ(s2, "a1b2c3d4e5f607180000"); in sshbuf_getput_basic_tests()
556 free(s2); in sshbuf_getput_basic_tests()
[all …]
/freebsd/usr.bin/tr/
H A Dtr.c53 static STR s2 = { STRING2, NORMAL, 0, OOBCH, 0, { 0, OOBCH }, NULL, NULL }; variable
126 squeeze = setup(argv[1], &s2, 0, 0); in main()
194 if ((s2.str = strdup(argv[1])) == NULL) in main()
197 s2.str = argv[1]; in main()
199 if (!next(&s2)) in main()
212 s2.state == CCLASS_UPPER && in main()
213 s1.cnt == 1 && s2.cnt == 1) { in main()
224 if (!next(&s2)) in main()
226 } while (s2.state == CCLASS_UPPER && s2.cnt > 1); in main()
229 s2.state == CCLASS_LOWER && in main()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dcstring27 void* memcpy(void* restrict s1, const void* restrict s2, size_t n);
28 void* memmove(void* s1, const void* s2, size_t n);
29 char* strcpy (char* restrict s1, const char* restrict s2);
30 char* strncpy(char* restrict s1, const char* restrict s2, size_t n);
31 char* strcat (char* restrict s1, const char* restrict s2);
32 char* strncat(char* restrict s1, const char* restrict s2, size_t n);
33 int memcmp(const void* s1, const void* s2, size_t n);
34 int strcmp (const char* s1, const char* s2);
35 int strncmp(const char* s1, const char* s2, size_t n);
36 int strcoll(const char* s1, const char* s2);
[all …]
H A Dstring.h24 void* memcpy(void* restrict s1, const void* restrict s2, size_t n);
25 void* memmove(void* s1, const void* s2, size_t n);
26 char* strcpy (char* restrict s1, const char* restrict s2);
27 char* strncpy(char* restrict s1, const char* restrict s2, size_t n);
28 char* strcat (char* restrict s1, const char* restrict s2);
29 char* strncat(char* restrict s1, const char* restrict s2, size_t n);
30 int memcmp(const void* s1, const void* s2, size_t n);
31 int strcmp (const char* s1, const char* s2);
32 int strncmp(const char* s1, const char* s2, size_t n);
33 int strcoll(const char* s1, const char* s2);
[all...]
H A Dwchar.h67 wchar_t* wcscpy(wchar_t* restrict s1, const wchar_t* restrict s2);
68 wchar_t* wcsncpy(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
69 wchar_t* wcscat(wchar_t* restrict s1, const wchar_t* restrict s2);
70 wchar_t* wcsncat(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
71 int wcscmp(const wchar_t* s1, const wchar_t* s2);
72 int wcscoll(const wchar_t* s1, const wchar_t* s2);
73 int wcsncmp(const wchar_t* s1, const wchar_t* s2, size_t n);
74 size_t wcsxfrm(wchar_t* restrict s1, const wchar_t* restrict s2, size_t n);
77 size_t wcscspn(const wchar_t* s1, const wchar_t* s2);
79 const wchar_t* wcspbrk(const wchar_t* s1, const wchar_t* s2);
[all...]
/freebsd/crypto/openssl/test/testutil/
H A Dtests.c213 const char *s1, const char *s2, \
218 test_fail_message(NULL, file, line, #type, s1, s2, #op, \
277 const char *s1, const char *s2) in test_str_eq() argument
279 if (s1 == NULL && s2 == NULL) in test_str_eq()
281 if (s1 == NULL || s2 == NULL || strcmp(s1, s2) != 0) { in test_str_eq()
284 s2, s2 == NULL ? 0 : strlen(s2)); in test_str_eq()
291 const char *s1, const char *s2) in test_str_ne() argument
293 if ((s1 == NULL) ^ (s2 == NULL)) in test_str_ne()
295 if (s1 == NULL || strcmp(s1, s2) == 0) { in test_str_ne()
298 s2, s2 == NULL ? 0 : strlen(s2)); in test_str_ne()
[all …]
/freebsd/contrib/bearssl/src/symcipher/
H A Dchacha20_sse2.c92 __m128i s0, s1, s2, s3; in br_chacha20_sse2_run() local
97 s2 = kw1; in br_chacha20_sse2_run()
110 s2 = _mm_add_epi32(s2, s3); in br_chacha20_sse2_run()
111 s1 = _mm_xor_si128(s1, s2); in br_chacha20_sse2_run()
122 s2 = _mm_add_epi32(s2, s3); in br_chacha20_sse2_run()
123 s1 = _mm_xor_si128(s1, s2); in br_chacha20_sse2_run()
134 s2 = _mm_shuffle_epi32(s2, 0x4E); in br_chacha20_sse2_run()
143 s2 = _mm_add_epi32(s2, s3); in br_chacha20_sse2_run()
144 s1 = _mm_xor_si128(s1, s2); in br_chacha20_sse2_run()
155 s2 = _mm_add_epi32(s2, s3); in br_chacha20_sse2_run()
[all …]
/freebsd/contrib/bearssl/T0/
H A DSType.cs74 public static bool operator ==(SType s1, SType s2) in operator ==()
76 return s1.din == s2.din && s1.dout == s2.dout; in operator ==()
79 public static bool operator !=(SType s1, SType s2) in operator !=()
81 return s1.din != s2.din || s1.dout != s2.dout; in operator !=()
108 * s2 if any of the following holds:
109 * -- s1 and s2 are known, s1.din <= s2.din and s1 does not exit.
110 * -- s1 and s2 are known, s1.din <= s2.din, s1 and s2 exit,
111 * and s1.din - s1.dout == s2.din - s2.dout.
/freebsd/sys/contrib/device-tree/Bindings/regulator/
H A Dqcom,smd-rpm-regulator.yaml25 For mp5496, s1, s2
27 For pm2250, s1, s2, s3, s4, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11,
30 For pm6125 s1, s2, s3, s4, s5, s6, s7, s8, l1, l2, l3, l5, l6, l7, l8, l9,
33 For pm660, s1, s2, s3, s4, s5, s6, l1, l2, l3, l5, l6, l7, l8, l9, l10, l22,
36 For pm660l s1, s2, s3, s5, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, bob
38 For pm8226, s1, s2, s3, s4, s5, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10,
42 For pm8841, s1, s2, s3, s4, s5, s6, s7, s8
44 For pm8909, s1, s2, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13,
47 For pm8916, s1, s2, s3, s4, l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11,
50 For pm8937, s1, s2, s
[all...]
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_i32_priv.c36 uint32_t *mp, *mq, *s1, *s2, *t1, *t2, *t3; in br_rsa_i32_private() local
44 * The mp, mq, s1, s2, t1 and t2 buffers are large enough to in br_rsa_i32_private()
46 * RSA modulus. t3 shares its storage space with s2, s1 and t1, in br_rsa_i32_private()
52 s2 = tmp + 3 * U; in br_rsa_i32_private()
55 t3 = s2; in br_rsa_i32_private()
111 * Compute s2 = x^dq mod q. in br_rsa_i32_private()
114 br_i32_decode_reduce(s2, x, xlen, mq); in br_rsa_i32_private()
115 br_i32_modpow(s2, sk->dq, sk->dqlen, mq, q0i, t1, t2); in br_rsa_i32_private()
119 * h = (s1 - s2)*(1/q) mod p in br_rsa_i32_private()
120 * s1 is an integer modulo p, but s2 is modulo q. PKCS#1 is in br_rsa_i32_private()
[all …]
H A Drsa_i15_priv.c41 uint16_t *mp, *mq, *s1, *s2, *t1, *t2, *t3; in br_rsa_i15_private() local
145 * Compute s2 = x^dq mod q. in br_rsa_i15_private()
148 s2 = mq + fwlen; in br_rsa_i15_private()
149 br_i15_decode_reduce(s2, x, xlen, mq); in br_rsa_i15_private()
150 r &= br_i15_modpow_opt(s2, sk->dq, sk->dqlen, mq, q0i, in br_rsa_i15_private()
164 * h = (s1 - s2)*(1/q) mod p in br_rsa_i15_private()
165 * s1 is an integer modulo p, but s2 is modulo q. PKCS#1 is in br_rsa_i15_private()
177 br_i15_reduce(t2, s2, mp); in br_rsa_i15_private()
185 * s = s2 + q*h in br_rsa_i15_private()
188 * We need mq, s2 and t2. We use the t3 buffer as destination. in br_rsa_i15_private()
[all …]
H A Drsa_i31_priv.c41 uint32_t *mp, *mq, *s1, *s2, *t1, *t2, *t3; in br_rsa_i31_private() local
139 * Compute s2 = x^dq mod q. in br_rsa_i31_private()
142 s2 = mq + fwlen; in br_rsa_i31_private()
143 br_i31_decode_reduce(s2, x, xlen, mq); in br_rsa_i31_private()
144 r &= br_i31_modpow_opt(s2, sk->dq, sk->dqlen, mq, q0i, in br_rsa_i31_private()
158 * h = (s1 - s2)*(1/q) mod p in br_rsa_i31_private()
159 * s1 is an integer modulo p, but s2 is modulo q. PKCS#1 is in br_rsa_i31_private()
171 br_i31_reduce(t2, s2, mp); in br_rsa_i31_private()
179 * s = s2 + q*h in br_rsa_i31_private()
182 * We need mq, s2 and t2. We use the t3 buffer as destination. in br_rsa_i31_private()
[all …]
/freebsd/contrib/netbsd-tests/lib/libc/regex/
H A Dt_exhaust.c81 char *d, *s1, *s2; in p0() local
83 s2 = concat(s1, ")"); in p0()
85 d = concat("(", s2); in p0()
86 free(s2); in p0()
93 char *d, *s1, *s2, *s3; in p1() local
95 s2 = mkstr("(.*)", len); in p1()
96 s3 = concat(s1, s2); in p1()
97 free(s2); in p1()
109 char *d, *s1, *s2, *s3; in ps() local
111 s2 = mkstr(s, len); in ps()
[all …]

12345678910>>...38