Searched refs:L1 (Results 1 - 25 of 77) sorted by relevance

1234

/freebsd-13-stable/lib/libc/i386/string/
H A Dffs.S47 jz L1 /* ZF is set if all bits are 0 */
52 L1: xorl %eax,%eax /* clear result */ label
H A Dbcmp.S52 jne L1
58 L1: label
H A Dstrchr.S53 L1: label
59 jne L1
H A Dstrrchr.S54 L1: label
62 jne L1
H A Dbzero.S57 jle L1
76 L1: rep label
H A Dmemset.S59 jle L1
83 L1: rep label
H A Dstrcpy.S54 L1: movb (%edx),%al /* unroll loop, but not too much */ label
87 jne L1
H A Dswab.S60 L1: lodsw label
65 jnz L1
H A Dwcschr.S41 L1: movl (%ecx),%ebx label
62 jmp L1
H A Dwcslen.S41 L1: cmpl %ebx,(%ecx) label
59 jmp L1
H A Dstrcat.S64 L1: movb (%edx),%al /* unroll loop, but not too much */ label
97 jne L1
H A Dstrcmp.S59 L1: incl %eax label
114 je L1
H A Dstrncmp.S65 L1: incl %eax label
82 * L1: addl $8,%eax; addl $8,%ecx; subl $8,%edx; cmpl $8,%edx; jae Lx
155 je L1
/freebsd-13-stable/sys/contrib/openzfs/module/lua/
H A Dlstate.c130 static void stack_init (lua_State *L1, lua_State *L) { argument
133 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue);
134 L1->stacksize = BASIC_STACK_SIZE;
136 setnilvalue(L1->stack + i); /* erase new stack */
137 L1->top = L1->stack;
138 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK;
140 ci = &L1
236 lua_State *L1; local
254 luaE_freethread(lua_State *L, lua_State *L1) argument
[all...]
/freebsd-13-stable/crypto/openssl/crypto/ec/curve448/
H A Df_generic.c174 gf L0, L1, L2; local
176 gf_sqr(L1, x);
177 gf_mul(L2, x, L1);
178 gf_sqr(L1, L2);
179 gf_mul(L2, x, L1);
180 gf_sqrn(L1, L2, 3);
181 gf_mul(L0, L2, L1);
182 gf_sqrn(L1, L0, 3);
183 gf_mul(L0, L2, L1);
185 gf_mul(L1, L
[all...]
/freebsd-13-stable/contrib/lua/src/
H A Dldblib.c31 ** If L1 != L, L1 can be in any state, and therefore there are no
32 ** guarantees about its stack space; any push in L1 must be
35 static void checkstack (lua_State *L, lua_State *L1, int n) { argument
36 if (L != L1 && !lua_checkstack(L1, n))
134 static void treatstackoption (lua_State *L, lua_State *L1, const char *fname) { argument
135 if (L == L1)
138 lua_xmove(L1, L, 1); /* move object to the "main" stack */
145 ** L1 need
152 lua_State *L1 = getthread(L, &arg); local
204 lua_State *L1 = getthread(L, &arg); local
236 lua_State *L1 = getthread(L, &arg); local
367 lua_State *L1 = getthread(L, &arg); local
396 lua_State *L1 = getthread(L, &arg); local
436 lua_State *L1 = getthread(L, &arg); local
[all...]
H A Dlstate.c180 static void stack_init (lua_State *L1, lua_State *L) { argument
183 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, StackValue);
185 setnilvalue(s2v(L1->stack + i)); /* erase new stack */
186 L1->top = L1->stack;
187 L1->stack_last = L1->stack + BASIC_STACK_SIZE;
189 ci = &L1->base_ci;
192 ci->func = L1->top;
195 setnilvalue(s2v(L1
287 lua_State *L1; local
317 luaE_freethread(lua_State *L, lua_State *L1) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DLinkage.h120 inline Linkage minLinkage(Linkage L1, Linkage L2) { argument
122 std::swap(L1, L2);
123 if (L1 == VisibleNoLinkage) {
129 return L1 < L2 ? L1 : L2;
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_common_interceptors_vfork_i386.inc.S33 call .L1$pb
34 .L1$pb:
37 add $_GLOBAL_OFFSET_TABLE_+(.Ltmp1-.L1$pb), %ebx
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/builtins/riscv/
H A Dint_mul_impl.inc22 .L1:
29 bnez a1, .L1
/freebsd-13-stable/libexec/rtld-elf/arm/
H A Drtld_start.S47 .L1:
67 .word _GLOBAL_OFFSET_TABLE_ - (.L1+8)
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DEquivalenceClasses.h221 member_iterator unionSets(member_iterator L1, member_iterator L2) { argument
222 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!");
223 if (L1 == L2) return L1; // Unifying the same two sets, noop.
225 // Otherwise, this is a real union operation. Set the end of the L1 list to
227 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node;
236 // L2's leader is now L1.
238 return L1;
/freebsd-13-stable/sys/dev/ath/ath_hal/ar5212/
H A Dar5212_rfgain.c128 uint32_t L1, L2, L3, L4; local
132 L1 = 0;
144 L1 = 0;
146 L3 = (gStep != 0x3f) ? 0x40 : L1;
149 gv->loTrig = L1 + (gStep == 0x3f ? DYN_ADJ_LO_MARGIN : 0);
155 return !((g >= L1 && g<= L2) || (g >= L3 && g <= L4));
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DDebugCrossImpSubsection.cpp81 llvm::sort(Ids, [this](const T &L1, const T &L2) {
82 return Strings.getIdForString(L1->getKey()) <
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp86 Value *L0, *L1, *R0, *R1;
92 m_c_Or(m_Shl(m_Value(L0), m_Value(L1)), m_LShr(m_Value(R0), Sub)));
93 if (RotL.match(V) && L0 == R0 && L1 == R1) {
95 Y = L1;
101 m_c_Or(m_LShr(m_Value(L0), m_Value(L1)), m_Shl(m_Value(R0), Sub)));
102 if (RotR.match(V) && L0 == R0 && L1 == R1) {
104 Y = L1;

Completed in 105 milliseconds

1234