Home
last modified time | relevance | path

Searched refs:L1 (Results 1 – 25 of 170) sorted by relevance

1234567

/third_party/spirv-tools/test/
Dext_inst.debuginfo_test.cpp71 #define CASE_ILL(Enum, L0, L1) \ argument
73 uint32_t(DebugInfoDebug##Enum), "Debug" #Enum, " %4 " #L0 " " #L1, { \
74 4, L0, L1 \
126 #define CASE_IIILLI(Enum, L0, L1) \ argument
129 " %4 %5 %6 " #L0 " " #L1 " %7", { \
130 4, 5, 6, L0, L1, 7 \
134 #define CASE_IIILLIL(Enum, L0, L1, L2) \ argument
137 " %4 %5 %6 " #L0 " " #L1 " %7 " #L2, { \
138 4, 5, 6, L0, L1, 7, L2 \
184 #define CASE_ILLII(Enum, L0, L1) \ argument
[all …]
Dext_inst.cldebug100_test.cpp179 #define CASE_ILL(Enum, L0, L1) \ argument
182 " %4 " #L0 " " #L1, { \
183 4, L0, L1 \
242 #define CASE_IIILLI(Enum, L0, L1) \ argument
245 " %4 %5 %6 " #L0 " " #L1 " %7", { \
246 4, 5, 6, L0, L1, 7 \
250 #define CASE_IIILLIF(Enum, L0, L1, Fstr, Fnum) \ argument
253 " %4 %5 %6 " #L0 " " #L1 " %7 " Fstr, { \
254 4, 5, 6, L0, L1, 7, Fnum \
258 #define CASE_IIILLIFL(Enum, L0, L1, Fstr, Fnum, L2) \ argument
[all …]
/third_party/skia/third_party/externals/spirv-tools/test/
Dext_inst.debuginfo_test.cpp71 #define CASE_ILL(Enum, L0, L1) \ argument
73 uint32_t(DebugInfoDebug##Enum), "Debug" #Enum, " %4 " #L0 " " #L1, { \
74 4, L0, L1 \
126 #define CASE_IIILLI(Enum, L0, L1) \ argument
129 " %4 %5 %6 " #L0 " " #L1 " %7", { \
130 4, 5, 6, L0, L1, 7 \
134 #define CASE_IIILLIL(Enum, L0, L1, L2) \ argument
137 " %4 %5 %6 " #L0 " " #L1 " %7 " #L2, { \
138 4, 5, 6, L0, L1, 7, L2 \
184 #define CASE_ILLII(Enum, L0, L1) \ argument
[all …]
Dext_inst.cldebug100_test.cpp179 #define CASE_ILL(Enum, L0, L1) \ argument
182 " %4 " #L0 " " #L1, { \
183 4, L0, L1 \
242 #define CASE_IIILLI(Enum, L0, L1) \ argument
245 " %4 %5 %6 " #L0 " " #L1 " %7", { \
246 4, 5, 6, L0, L1, 7 \
250 #define CASE_IIILLIF(Enum, L0, L1, Fstr, Fnum) \ argument
253 " %4 %5 %6 " #L0 " " #L1 " %7 " Fstr, { \
254 4, 5, 6, L0, L1, 7, Fnum \
258 #define CASE_IIILLIFL(Enum, L0, L1, Fstr, Fnum, L2) \ argument
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/
Dext_inst.debuginfo_test.cpp71 #define CASE_ILL(Enum, L0, L1) \ argument
73 uint32_t(DebugInfoDebug##Enum), "Debug" #Enum, " %4 " #L0 " " #L1, { \
74 4, L0, L1 \
126 #define CASE_IIILLI(Enum, L0, L1) \ argument
129 " %4 %5 %6 " #L0 " " #L1 " %7", { \
130 4, 5, 6, L0, L1, 7 \
134 #define CASE_IIILLIL(Enum, L0, L1, L2) \ argument
137 " %4 %5 %6 " #L0 " " #L1 " %7 " #L2, { \
138 4, 5, 6, L0, L1, 7, L2 \
184 #define CASE_ILLII(Enum, L0, L1) \ argument
[all …]
Dext_inst.cldebug100_test.cpp179 #define CASE_ILL(Enum, L0, L1) \ argument
182 " %4 " #L0 " " #L1, { \
183 4, L0, L1 \
242 #define CASE_IIILLI(Enum, L0, L1) \ argument
245 " %4 %5 %6 " #L0 " " #L1 " %7", { \
246 4, 5, 6, L0, L1, 7 \
250 #define CASE_IIILLIF(Enum, L0, L1, Fstr, Fnum) \ argument
253 " %4 %5 %6 " #L0 " " #L1 " %7 " Fstr, { \
254 4, 5, 6, L0, L1, 7, Fnum \
258 #define CASE_IIILLIFL(Enum, L0, L1, Fstr, Fnum, L2) \ argument
[all …]
/third_party/openssl/crypto/ec/curve448/
Df_generic.c174 gf L0, L1, L2; in gf_isr() local
176 gf_sqr(L1, x); in gf_isr()
177 gf_mul(L2, x, L1); in gf_isr()
178 gf_sqr(L1, L2); in gf_isr()
179 gf_mul(L2, x, L1); in gf_isr()
180 gf_sqrn(L1, L2, 3); in gf_isr()
181 gf_mul(L0, L2, L1); in gf_isr()
182 gf_sqrn(L1, L0, 3); in gf_isr()
183 gf_mul(L0, L2, L1); in gf_isr()
185 gf_mul(L1, L0, L2); in gf_isr()
[all …]
/third_party/node/deps/openssl/openssl/crypto/ec/curve448/
Df_generic.c174 gf L0, L1, L2; in gf_isr() local
176 gf_sqr(L1, x); in gf_isr()
177 gf_mul(L2, x, L1); in gf_isr()
178 gf_sqr(L1, L2); in gf_isr()
179 gf_mul(L2, x, L1); in gf_isr()
180 gf_sqrn(L1, L2, 3); in gf_isr()
181 gf_mul(L0, L2, L1); in gf_isr()
182 gf_sqrn(L1, L0, 3); in gf_isr()
183 gf_mul(L0, L2, L1); in gf_isr()
185 gf_mul(L1, L0, L2); in gf_isr()
[all …]
/third_party/typescript/tests/cases/compiler/
DramdaToolsNoInfinite2.ts295 export type _Concat<L extends List, L1 extends List> = _Reverse<_Reverse<L>, L1>;
297 …export type Concat<L extends List, L1 extends List> = L extends unknown ? L1 extends L1 ? _Concat<…
552 …type GapOf<L1 extends List, L2 extends List, LN extends List, I extends Iteration = IterationOf<'0…
554 …type _GapsOf<L1 extends List, L2 extends List, LN extends List = [], I extends Iteration = Iterati…
555 0: _GapsOf<L1, L2, GapOf<L1, L2, LN, I>, Next<I>>;
557 }[Extends<Pos<I>, Length<L1>>];
559 …type GapsOf<L1 extends List, L2 extends List> = _GapsOf<L1, L2> extends infer X ? Cast<X, List> : …
DoptionalParamArgsTest.ts49 var L1 = function() {return 0;} variable
59 var l1v1=L1();
101 L1(1);
Dcf.ts7 L1: for (var i=0;i<19;i++) {
9 continue L1;
/third_party/node/deps/openssl/openssl/crypto/whrlpool/
Dwp_block.c538 u64 L0, L1, L2, L3, L4, L5, L6, L7; in whirlpool_block()
569 L1 = C0(K, 1) ^ C1(K, 0) ^ C2(K, 7) ^ C3(K, 6) ^ in whirlpool_block()
585 K.q[1] = L1; in whirlpool_block()
595 L1 ^= C0(S, 1) ^ C1(S, 0) ^ C2(S, 7) ^ C3(S, 6) ^ in whirlpool_block()
611 S.q[1] = L1; in whirlpool_block()
620 L1 = C1(K, 0); in whirlpool_block()
629 L1 ^= C0(K, 1); in whirlpool_block()
645 L1 ^= C7(K, 2); in whirlpool_block()
653 L1 ^= C6(K, 3); in whirlpool_block()
661 L1 ^= C5(K, 4); in whirlpool_block()
[all …]
/third_party/openssl/crypto/whrlpool/
Dwp_block.c538 u64 L0, L1, L2, L3, L4, L5, L6, L7; in whirlpool_block()
569 L1 = C0(K, 1) ^ C1(K, 0) ^ C2(K, 7) ^ C3(K, 6) ^ in whirlpool_block()
585 K.q[1] = L1; in whirlpool_block()
595 L1 ^= C0(S, 1) ^ C1(S, 0) ^ C2(S, 7) ^ C3(S, 6) ^ in whirlpool_block()
611 S.q[1] = L1; in whirlpool_block()
620 L1 = C1(K, 0); in whirlpool_block()
629 L1 ^= C0(K, 1); in whirlpool_block()
645 L1 ^= C7(K, 2); in whirlpool_block()
653 L1 ^= C6(K, 3); in whirlpool_block()
661 L1 ^= C5(K, 4); in whirlpool_block()
[all …]
/third_party/typescript/tests/baselines/reference/
Dcf.js7 L1: for (var i=0;i<19;i++) {
9 continue L1;
65 L1: for (var i = 0; i < 19; i++) {
67 continue L1;
DramdaToolsNoInfinite2.js295 export type _Concat<L extends List, L1 extends List> = _Reverse<_Reverse<L>, L1>;
297 …export type Concat<L extends List, L1 extends List> = L extends unknown ? L1 extends L1 ? _Concat<…
552 …type GapOf<L1 extends List, L2 extends List, LN extends List, I extends Iteration = IterationOf<'0…
554 …type _GapsOf<L1 extends List, L2 extends List, LN extends List = [], I extends Iteration = Iterati…
555 0: _GapsOf<L1, L2, GapOf<L1, L2, LN, I>, Next<I>>;
557 }[Extends<Pos<I>, Length<L1>>];
559 …type GapsOf<L1 extends List, L2 extends List> = _GapsOf<L1, L2> extends infer X ? Cast<X, List> : …
Dcf.types16 L1: for (var i=0;i<19;i++) {
17 >L1 : any
31 continue L1;
32 >L1 : any
DoptionalParamArgsTest.js50 var L1 = function() {return 0;} class
60 var l1v1=L1();
102 L1(1);
187 var L1 = function () { return 0; };
200 var l1v1 = L1();
235 L1(1);
DramdaToolsNoInfinite2.types617 export type _Concat<L extends List, L1 extends List> = _Reverse<_Reverse<L>, L1>;
618 >_Concat : _Concat<L, L1>
620 …export type Concat<L extends List, L1 extends List> = L extends unknown ? L1 extends L1 ? _Concat<…
621 >Concat : Concat<L, L1>
1322 …type GapOf<L1 extends List, L2 extends List, LN extends List, I extends Iteration = IterationOf<'0…
1323 >GapOf : GapOf<L1, L2, LN, I>
1325 …type _GapsOf<L1 extends List, L2 extends List, LN extends List = [], I extends Iteration = Iterati…
1326 >_GapsOf : _GapsOf<L1, L2, LN, I>
1328 0: _GapsOf<L1, L2, GapOf<L1, L2, LN, I>, Next<I>>;
1329 >0 : _GapsOf<L1, L2, GapOf<L1, L2, LN, I>, Next<I>>
[all …]
/third_party/libwebsockets/READMEs/
DREADME.lws_cache.md8 L1 cache is always stored on heap, but it may be hooked up to additional levels
14 formats and media, while being able to take advantage of a suitably-sized L1
35 Items in L1 can be accessed in heap casually and reliably if the following is
73 For L1, in heap, this frees any allocations. For other levels, eg, with file
86 The combined caches are always accessed via the L1 cache, writing new items is
87 done at L1 and writes through to each cache layer immediately, so new items go
116 any cache layer. Again this should use L1, it will bring a copy of the item
117 into L1 if one is not already there, so it can be accessed from heap.
130 own that is also cached in L1.
142 The lookup results themselves are cached in L1, any new key that matches the
[all …]
DREADME.http-cache.md6 A L1 heap cache of recent cookies is maintained, along with LRU tracking and
25 |`.http_nsc_heap_max_footprint`|0, or Max size in bytes for the L1 heap cache|
26 |`.http_nsc_heap_max_items`|0, or Max number of cookies allowed in L1 heap cache|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DEquivalenceClasses.h221 member_iterator unionSets(member_iterator L1, member_iterator L2) { in unionSets() argument
222 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); in unionSets()
223 if (L1 == L2) return L1; // Unifying the same two sets, noop. in unionSets()
227 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; in unionSets()
238 return L1; in unionSets()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/AggressiveInstCombine/
DAggressiveInstCombine.cpp79 Value *L0, *L1, *R0, *R1; in foldGuardedRotateToFunnelShift() local
85 m_c_Or(m_Shl(m_Value(L0), m_Value(L1)), m_LShr(m_Value(R0), Sub))); in foldGuardedRotateToFunnelShift()
86 if (RotL.match(V) && L0 == R0 && L1 == R1) { in foldGuardedRotateToFunnelShift()
88 Y = L1; in foldGuardedRotateToFunnelShift()
94 m_c_Or(m_LShr(m_Value(L0), m_Value(L1)), m_Shl(m_Value(R0), Sub))); in foldGuardedRotateToFunnelShift()
95 if (RotR.match(V) && L0 == R0 && L1 == R1) { in foldGuardedRotateToFunnelShift()
97 Y = L1; in foldGuardedRotateToFunnelShift()
/third_party/skia/resources/sksl/shared/
DOssfuzz28904.sksl1 void n() { -2 .L1==- -2 .L1; }
/third_party/ltp/tools/sparse/sparse-src/validation/optim/
Dcgoto01.c8 label = &&L1; in foo()
12 L1: return 0; in foo()
/third_party/musl/src/ldso/sh/
Ddlsym.s6 mov.l L1, r0
11 L1: .long __dlsym@PLT-(1b+4-.) label

1234567