Home
last modified time | relevance | path

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

12345678

/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/gstreamer/gstplugins_good/gst/deinterlace/tvtime/
Dgreedyh.c60 const guint8 * L2, const guint8 * L1, const guint8 * L3, const guint8 * L2P,
74 greedyh_scanline_C_ayuv (GstDeinterlaceMethodGreedyH * self, const guint8 * L1, in greedyh_scanline_C_ayuv() argument
97 l1 = L1[0]; in greedyh_scanline_C_ayuv()
104 l1_1 = L1[4]; in greedyh_scanline_C_ayuv()
176 L1 += 1; in greedyh_scanline_C_ayuv()
185 greedyh_scanline_C_yuy2 (GstDeinterlaceMethodGreedyH * self, const guint8 * L1, in greedyh_scanline_C_yuy2() argument
208 l1_l = L1[0]; in greedyh_scanline_C_yuy2()
209 l1_c = L1[1]; in greedyh_scanline_C_yuy2()
219 l1_1_l = L1[2]; in greedyh_scanline_C_yuy2()
220 l1_1_c = L1[3]; in greedyh_scanline_C_yuy2()
[all …]
Dgreedyh.asm33 FUNCT_NAME_YUY2 (GstDeinterlaceMethodGreedyH *self, const guint8 * L1, const guint8 * L2, const gui…
54 C_FUNCT_YUY2 (self, L1, L2, L3, L2P, Dest, width);
228 [L1] "m" (L1),
252 FUNCT_NAME_UYVY (GstDeinterlaceMethodGreedyH *self, const guint8 * L1, const guint8 * L2, const gui…
273 C_FUNCT_UYVY (self, L1, L2, L3, L2P, Dest, width);
450 [L1] "m" (L1),
/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;
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);
DoptionalParamArgsTest.types137 var L1 = function() {return 0;}
138 >L1 : () => number
192 var l1v1=L1();
194 >L1() : number
195 >L1 : () => number
383 L1(1);
384 >L1(1) : number
385 >L1 : () => number
/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/flutter/flutter/packages/flutter/test/widgets/
Dsemantics_4_test.dart29 label: 'L1',
55 label: 'L1',
90 label: 'L1',
115 label: 'L1',
/third_party/typescript/tests/cases/compiler/
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/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
/third_party/ffmpeg/libavcodec/mips/
Daacpsdsp_mips.c67 float *L1=&L[0][0][i]; in ps_hybrid_analysis_ileave_mips() local
95 : [out1]"+r"(out1), [L1]"+r"(L1), [j]"+r"(j), in ps_hybrid_analysis_ileave_mips()
104 L1-=(len<<6)-1; in ps_hybrid_analysis_ileave_mips()

12345678