Home
last modified time | relevance | path

Searched refs:S2 (Results 1 - 25 of 139) sorted by relevance

123456

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DStringSwitch.h115 const char (&S2)[N2], const T& Value) { in Cases()
116 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
122 const char (&S2)[N2], const char (&S3)[N3], in Cases()
124 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
130 const char (&S2)[N2], const char (&S3)[N3], in Cases()
132 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
139 const char (&S2)[N2], const char (&S3)[N3], in Cases()
142 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
149 const char (&S2)[N2], const char (&S3)[N3], in Cases()
152 return Case(S0, Value).Cases(S1, S2, S in Cases()
114 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const T& Value) Cases() argument
121 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const T& Value) Cases() argument
129 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const T& Value) Cases() argument
138 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const char (&S5)[N5], const T &Value) Cases() argument
148 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const char (&S5)[N5], const char (&S6)[N6], const T &Value) Cases() argument
158 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const char (&S5)[N5], const char (&S6)[N6], const char (&S7)[N7], const T &Value) Cases() argument
169 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const char (&S5)[N5], const char (&S6)[N6], const char (&S7)[N7], const char (&S8)[N8], const T &Value) Cases() argument
180 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const char (&S5)[N5], const char (&S6)[N6], const char (&S7)[N7], const char (&S8)[N8], const char (&S9)[N9], const T &Value) Cases() argument
224 CasesLower(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const T &Value) CasesLower() argument
231 CasesLower(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const T &Value) CasesLower() argument
238 CasesLower(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const T &Value) CasesLower() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DStringSwitch.h92 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
94 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
97 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
99 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
102 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
104 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
107 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
110 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
113 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
116 return Case(S0, Value).Cases(S1, S2, S in Cases()
119 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, T Value) Cases() argument
125 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, StringLiteral S8, T Value) Cases() argument
132 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
165 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, T Value) CasesLower() argument
170 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, T Value) CasesLower() argument
175 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, T Value) CasesLower() argument
[all...]
H A DSetOperations.h22 bool set_union(S1Ty &S1, const S2Ty &S2) { in set_union() argument
25 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_union()
36 /// elements that are not contained in S2.
39 void set_intersect(S1Ty &S1, const S2Ty &S2) { in set_intersect() argument
43 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 in set_intersect()
50 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { in set_difference() argument
54 if (!S2.count(*SI)) // if the element is not in set2 in set_difference()
62 void set_subtract(S1Ty &S1, const S2Ty &S2) { in set_subtract() argument
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/crypto/
H A Dsha1-tlsprf.c34 const u8 *S1, *S2; in tls_prf_sha1_md5() local
60 * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed) in tls_prf_sha1_md5()
65 S2 = secret + L_S1; in tls_prf_sha1_md5()
67 /* The last byte of S1 will be shared with S2 */ in tls_prf_sha1_md5()
68 S2--; in tls_prf_sha1_md5()
72 hmac_sha1_vector(S2, L_S2, 2, &SHA1_addr[1], &SHA1_len[1], A_SHA1); in tls_prf_sha1_md5()
83 hmac_sha1_vector(S2, L_S2, 3, SHA1_addr, SHA1_len, in tls_prf_sha1_md5()
86 hmac_sha1(S2, L_S2, A_SHA1, SHA1_MAC_LEN, A_SHA1); in tls_prf_sha1_md5()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/crypto/
H A Dsha1-tlsprf.c34 const u8 *S1, *S2; in tls_prf_sha1_md5() local
60 * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed) in tls_prf_sha1_md5()
65 S2 = secret + L_S1; in tls_prf_sha1_md5()
67 /* The last byte of S1 will be shared with S2 */ in tls_prf_sha1_md5()
68 S2--; in tls_prf_sha1_md5()
72 hmac_sha1_vector(S2, L_S2, 2, &SHA1_addr[1], &SHA1_len[1], A_SHA1); in tls_prf_sha1_md5()
83 hmac_sha1_vector(S2, L_S2, 3, SHA1_addr, SHA1_len, in tls_prf_sha1_md5()
86 hmac_sha1(S2, L_S2, A_SHA1, SHA1_MAC_LEN, A_SHA1); in tls_prf_sha1_md5()
/third_party/rust/crates/bindgen/bindgen-tests/tests/expectations/tests/
H A Dissue-1034.rs96 pub struct S2 { structure names
103 ::std::mem::size_of::<S2>(), in bindgen_test_layout_S2()
105 concat!("Size of: ", stringify!(S2)) in bindgen_test_layout_S2()
108 ::std::mem::align_of::<S2>(), in bindgen_test_layout_S2()
110 concat!("Alignment of ", stringify!(S2)) in bindgen_test_layout_S2()
113 impl S2 { impls
/third_party/typescript/tests/baselines/reference/
H A DsuperAccess.js4 private S2: string = "test";
11 var l4 = super.S2; // Expected => Error: Only public instance methods of the base class are accessible via the 'super' keyword
34 this.S2 = "test";
47 var l4 = _super.prototype.S2; // Expected => Error: Only public instance methods of the base class are accessible via the 'super' keyword
H A DassignmentCompatWithObjectMembers3.js5 class S implements S2 { foo: string; }
10 interface S2 { foo: string; bar?: string }
12 var s2: S2;
18 var a2: S2 = { foo: '' };
H A DassignmentCompatWithObjectMembers.js11 interface S2 { foo: string; }
13 var s2: S2;
52 interface S2 { foo: S2; }
54 var s2: S2;
H A DassignmentCompatWithObjectMembersStringNumericNames.js11 interface S2 { '1': string; bar?: string }
13 var s2: S2;
52 interface S2 { '1': string; bar?: string }
54 var s2: S2;
/third_party/libabigail/tests/data/test-diff-filter/
H A Dtest45-basic-type-change-v0.cc5 // data members of struct S1 and S2 as being redundant. This is
20 struct S2 struct
35 foo2(S2&) in foo2()
39 foo3(S2&) in foo3()
H A Dtest45-basic-type-change-v1.cc5 // data members of struct S1 and S2 as being redundant. This is
20 struct S2 struct
34 foo2(S2&) in foo2()
38 foo3(S2&) in foo3()
H A Dtest27-redundant-and-filtered-children-nodes-v0.cc13 struct S2 struct
21 S2* m2;
30 bar(S1*, S2*) in bar()
H A Dtest44-anonymous-data-member-v0.c10 struct S2 { struct
24 bar(struct S2* p) in bar()
H A Dtest44-anonymous-data-member-v1.c11 struct S2 { struct
26 bar(struct S2* p) in bar()
H A Dtest27-redundant-and-filtered-children-nodes-v1.cc17 struct S2 struct
21 typedef S2 S2Renamed;
/third_party/libabigail/tests/data/test-diff-suppr/
H A Dtest6-fn-suppr-v0.cc22 struct S2 struct
26 S2() in S2() function
42 bar(int, S2**) in bar()
H A Dtest6-fn-suppr-v1.cc32 struct S2 : private base struct
36 S2() in S2() function
52 bar(int, S2**) in bar()
/third_party/ltp/tools/sparse/sparse-src/validation/optim/
H A Dselect-and-shift.c2 #define S2 5 macro
3 #define S (S2 - S1)
6 #define B (1 << S2)
/third_party/libabigail/tests/data/test-abicompat/
H A Dtest0-fn-changed-libapp-v0.cc28 struct S2 struct
32 S2() in S2() function
72 fun2(S2*) in fun2()
/third_party/musl/src/math/
H A D__sinl.c31 S2 = 0.0083333333333333332, /* 0x11111111111111.0p-59 */ variable
38 #define POLY(z) (S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*S8))))))
51 S2 = 0.0083333333333333333333333333333331135404851288270047L, variable
63 #define POLY(z) (S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*(S8+ \
/third_party/musl/porting/liteos_a/kernel/src/math/
H A D__sinl.c31 S2 = 0.0083333333333333332, /* 0x11111111111111.0p-59 */ variable
38 #define POLY(z) (S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*S8))))))
51 S2 = 0.0083333333333333333333333333333331135404851288270047L, variable
63 #define POLY(z) (S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*(S8+ \
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp108 bool storesAreAdjacent(const MachineInstr *S1, const MachineInstr *S2);
282 // Check if store instructions S1 and S2 are adjacent. More precisely,
283 // S2 has to access memory immediately following that accessed by S1.
285 const MachineInstr *S2) { in storesAreAdjacent()
286 if (!handledStoreType(S1) || !handledStoreType(S2)) in storesAreAdjacent()
293 int Off2 = S2->getOperand(1).getImm(); in storesAreAdjacent()
354 MachineInstr *S2 = *I; in selectStores() local
355 // Stores are sorted, so if S1 and S2 are not adjacent, there won't be in selectStores()
357 if (!storesAreAdjacent(S1, S2)) in selectStores()
360 unsigned S2Size = getStoreTarget(S2) in selectStores()
284 storesAreAdjacent(const MachineInstr *S1, const MachineInstr *S2) storesAreAdjacent() argument
[all...]
/third_party/libabigail/src/
H A Dabg-reporter-priv.h16 /// If the diff about two subjects S1 and S2 was reported earlier or
22 /// @param S2 the second diff subject to take in account.
23 #define RETURN_IF_BEING_REPORTED_OR_WAS_REPORTED_EARLIER(S1, S2) \
26 if (diff_sptr _diff_ = ctxt->get_canonical_diff_for(S1, S2)) \
45 /// @param S2 the second diff subject to take in account.
71 /// If the diff about two subjects S1 and S2 was reported earlier or
78 #define RETURN_IF_BEING_REPORTED_OR_WAS_REPORTED_EARLIER3(S1, S2, INTRO_TEXT) \
80 if (diff_sptr _diff_ = d.context()->get_canonical_diff_for(S1, S2)) \
/third_party/libabigail/tests/data/test-diff-dwarf/
H A Dtest40-v1.c8 struct S2 struct
26 bar(struct S2* s) in bar()

Completed in 7 milliseconds

123456