| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_until.pass.cpp | 44 typedef std::unique_lock<L0> L1;
55 L1 lk(m0);
80 L1 lk(m0);
94 L1 lk(m0);
|
| wait_until_pred.pass.cpp | 55 typedef std::unique_lock<L0> L1;
66 L1 lk(m0);
92 L1 lk(m0);
106 L1 lk(m0);
|
| /external/chromium_org/third_party/opus/src/celt/ |
| mathops.c | 137 #define L1 32767
147 return ADD16(1,MIN16(32766,ADD32(SUB16(L1,x2), MULT16_16_P15(x2, ADD32(L2, MULT16_16_P15(x2, ADD32(L3, MULT16_16_P15(L4, x2
151 #undef L1
|
| /external/chromium_org/v8/test/cctest/ |
| test-disasm-ia32.cc | 260 Label L1, L2;
261 __ bind(&L1);
263 __ call(&L1);
275 __ jmp(&L1);
|
| /external/clang/test/SemaCXX/ |
| implicit-member-functions.cpp | 117 Line<void> L1;
118 Line<void> L2(L1);
|
| /external/libcxx/test/thread/thread.condition/thread.condition.condvarany/ |
| wait_until_pred.pass.cpp | 55 typedef std::unique_lock<L0> L1;
66 L1 lk(m0);
92 L1 lk(m0);
106 L1 lk(m0);
|
| /external/libopus/celt/ |
| mathops.c | 137 #define L1 32767
147 return ADD16(1,MIN16(32766,ADD32(SUB16(L1,x2), MULT16_16_P15(x2, ADD32(L2, MULT16_16_P15(x2, ADD32(L3, MULT16_16_P15(L4, x2
151 #undef L1
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 124 const Loop *L1 = getOutermostLoop(LI, BB1);
126 return L1 != nullptr && L1 == L2;
|
| /external/chromium_org/third_party/skia/third_party/lua/src/ |
| lstate.c | 133 static void stack_init (lua_State *L1, lua_State *L) {
136 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue);
137 L1->stacksize = BASIC_STACK_SIZE;
139 setnilvalue(L1->stack + i); /* erase new stack */
140 L1->top = L1->stack;
141 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK;
143 ci = &L1->base_ci
[all...] |
| ldblib.c | 101 static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) {
102 if (L == L1) {
107 lua_xmove(L1, L, 1);
115 lua_State *L1 = getthread(L, &arg);
118 if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) {
127 lua_xmove(L, L1, 1);
131 if (!lua_getinfo(L1, options, &ar))
155 treatstackoption(L, L1, "activelines");
157 treatstackoption(L, L1, "func");
164 lua_State *L1 = getthread(L, &arg)
[all...] |
| /external/llvm/test/MC/X86/ |
| x86-32.s | 482 L1:
483 jcxz L1
484 // CHECK: jcxz L1
486 jecxz L1
487 // CHECK: jecxz L1
|
| x86-16.s | 371 L1:
372 jcxz L1
373 // CHECK: jcxz L1
375 jecxz L1
376 // CHECK: jecxz L1
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src_gcc/ |
| armVCM4P10_DecodeCoeffsToPair_s.S | 51 BCC L1
53 L1:
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| common_defs.h | 25 enum RegularizationType { L0, L1, L2, L1L2, L1LInf };
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_pow.c | 74 L1 = 5.99999999999994648725e-01, /* 0x3FE33333, 0x33333303 */
234 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
| e_powf.c | 33 L1 = 6.0000002384e-01, /* 0x3f19999a */
177 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
| /external/bison/src/ |
| reader.c | 157 merger_list *L1 = L0->next;
159 L0 = L1;
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| e_pow.h | 74 L1 = 5.99999999999994648725e-01, /* 0x3FE33333, 0x33333303 */
226 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
| /external/speex/libspeex/ |
| math_approx.h | 203 #define L1 32767
213 return ADD16(1,MIN16(32766,ADD32(SUB16(L1,x2), MULT16_16_P15(x2, ADD32(L2, MULT16_16_P15(x2, ADD32(L3, MULT16_16_P15(L4, x2))))))));
|
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| s_expl.c | 61 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must
69 L1 = 5.41521234812457272982212595914567508e-3L;
269 r1 = x - fn * L1;
446 r1 = x - fn * L1;
|
| /external/clang/test/Sema/ |
| warn-duplicate-enum.c | 75 L1,
76 L2 = L1,
|
| /external/fdlibm/ |
| e_pow.c | 78 L1 = 5.99999999999994648725e-01, /* 0x3FE33333, 0x33333303 */
236 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
| /external/llvm/test/MC/MachO/ |
| x86_32-symbols.s | 7 L1:
|
| x86_64-symbols.s | 7 L1:
|
| /external/opencv/cv/src/ |
| cvoptflowlk.cpp | 284 int L1 = i - 1;
290 if( L1 < 0 )
291 L1 = 0;
300 Line1 = L1 * imgStep;
|
