/freebsd-13-stable/lib/libc/i386/string/ |
H A D | strcpy.S | 57 je L2 61 je L2 65 je L2 69 je L2 73 je L2 77 je L2 81 je L2 88 L2: popl %eax /* pop dst address */ label
|
H A D | strcat.S | 67 je L2 71 je L2 75 je L2 79 je L2 83 je L2 87 je L2 91 je L2 98 L2: popl %eax /* pop destination address */ label
|
H A D | strchr.S | 56 je L2 61 L2: label
|
H A D | strrchr.S | 57 jne L2 59 L2: label
|
H A D | swab.S | 58 jz L2 # while swaping alternate bytes. 67 L2: shrl $3,%ecx # copy remainder 8 words at a time label
|
H A D | strcmp.S | 56 jmp L2 /* Jump into the loop! */ 61 L2: movb (%eax),%cl label
|
H A D | strncmp.S | 62 jmp L2 /* Jump into the loop! */ 68 L2: jz L4 /* strings are equal */ label
|
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | Linkage.h | 120 inline Linkage minLinkage(Linkage L1, Linkage L2) { argument 121 if (L2 == VisibleNoLinkage) 122 std::swap(L1, L2); 124 if (L2 == InternalLinkage) 126 if (L2 == UniqueExternalLinkage) 129 return L1 < L2 ? L1 : L2;
|
/freebsd-13-stable/crypto/openssl/crypto/ec/curve448/ |
H A D | f_generic.c | 174 gf L0, L1, L2; local 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); 183 gf_mul(L0, L2, L1); 184 gf_sqrn(L2, L0, 9); 185 gf_mul(L1, L0, L2); 187 gf_mul(L2, [all...] |
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/builtins/riscv/ |
H A D | int_mul_impl.inc | 24 beqz a3, .L2 26 .L2:
|
/freebsd-13-stable/libexec/rtld-elf/arm/ |
H A D | rtld_start.S | 44 ldr sl, .L2 45 ldr r5, .L2+4 46 ldr r0, .L2+8 66 .L2:
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ilist.h | 245 template <class Cloner> void cloneFrom(const iplist_impl &L2, Cloner clone) { argument 247 for (const_reference V : L2) 286 void transfer(iterator position, iplist_impl &L2, iterator first, iterator last) { argument 291 this->transferNodesFromList(L2, first, last); 293 base_list_type::splice(position, L2, first, last); 329 void splice(iterator where, iplist_impl &L2) { argument 330 if (!L2.empty()) 331 transfer(where, L2, L2.begin(), L2 333 splice(iterator where, iplist_impl &L2, iterator first) argument 338 splice(iterator where, iplist_impl &L2, iterator first, iterator last) argument 341 splice(iterator where, iplist_impl &L2, reference N) argument 344 splice(iterator where, iplist_impl &L2, pointer N) argument [all...] |
H A D | simple_ilist.h | 173 void cloneFrom(const simple_ilist &L2, Cloner clone, Disposer dispose) { argument 175 for (const_reference V : L2) 238 void splice(iterator I, simple_ilist &L2) { argument 239 splice(I, L2, L2.begin(), L2.end()); 243 void splice(iterator I, simple_ilist &L2, iterator Node) { argument 244 splice(I, L2, Node, std::next(Node));
|
H A D | EquivalenceClasses.h | 221 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. 226 // point to the L2 leader node. 227 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 233 // Clear L2's leader flag: 236 // L2's leader is now L1.
|
/freebsd-13-stable/sys/dev/ath/ath_hal/ar5212/ |
H A D | ar5212_rfgain.c | 128 uint32_t L1, L2, L3, L4; local 133 L2 = 107; 137 L2 = 83; 145 L2 = (gStep == 0x3f) ? 50 : gStep + 4; 155 return !((g >= L1 && g<= L2) || (g >= L3 && g <= L4));
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | DebugCrossImpSubsection.cpp | 81 llvm::sort(Ids, [this](const T &L1, const T &L2) { 83 Strings.getIdForString(L2->getKey());
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | SymbolTableListTraitsImpl.h | 89 SymbolTableListTraits &L2, iterator first, iterator last) { 96 ItemParentClass *OldIP = L2.getListOwner(); 88 transferNodesFromList( SymbolTableListTraits &L2, iterator first, iterator last) argument
|
/freebsd-13-stable/sys/powerpc/powerpc/ |
H A D | swtch32.S | 117 beq .L2 120 .L2:
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonExpandCondsets.cpp | 1137 LiveInterval &L2 = LIS->getInterval(R2.Reg); local 1138 if (L2.empty()) 1140 if (L1.hasSubRanges() || L2.hasSubRanges()) 1142 bool Overlap = L1.overlaps(L2); 1147 << printReg(R2.Reg, TRI, R2.Sub) << " " << L2 << "\n"); 1156 if (!isIntraBlocks(L1) && !isIntraBlocks(L2)) 1161 // Move all live segments from L2 to L1. 1164 for (LiveInterval::iterator I = L2.begin(), E = L2.end(); I != E; ++I) { 1175 while (L2 [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | SymbolTableListTraits.h | 97 void transferNodesFromList(SymbolTableListTraits &L2, iterator first,
|
/freebsd-13-stable/crypto/openssl/crypto/ |
H A D | c64xpluscpuid.pl | 203 CLFLUSH A5,B4,A1 ; write-back and invalidate L2 line 217 CLFLUSH A5,B4,A1 ; write-back and invalidate L2 line 247 CLFLUSH A5,B4,A1 ; write-back and invalidate L2 line 262 CLFLUSH A5,B4,A1 ; write-back and invalidate L2 line
|
/freebsd-13-stable/crypto/openssl/crypto/whrlpool/ |
H A D | wp_block.c | 532 u64 L0, L1, L2, L3, L4, L5, L6, L7; 565 L2 = C0(K, 2) ^ C1(K, 1) ^ C2(K, 0) ^ C3(K, 7) ^ 580 K.q[2] = L2; 591 L2 ^= C0(S, 2) ^ C1(S, 1) ^ C2(S, 0) ^ C3(S, 7) ^ 606 S.q[2] = L2; 615 L2 = C2(K, 0); 624 L2 ^= C1(K, 1); 632 L2 ^= C0(K, 2); 648 L2 ^= C7(K, 3); 656 L2 [all...] |
/freebsd-13-stable/lib/msun/ld80/ |
H A D | k_expl.h | 49 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must 55 L2 = -3.2819649005320973e-13, /* -0x1718432a1b0e26.0p-94 */ variable 229 r = x - fn * L1 - fn * L2; /* r = r1 + r2 done independently. */ 235 r2 = fn * -L2;
|
/freebsd-13-stable/contrib/bearssl/src/aead/ |
H A D | eax.c | 53 * - The derived keys for padding are kept in L2 and L4 (double and 103 pad = ctx->L2; 161 * Encrypt a whole-zero block to compute L2 and L4. 166 double_gf128(ctx->L2, tmp); 167 double_gf128(ctx->L4, ctx->L2);
|
/freebsd-13-stable/contrib/bearssl/inc/ |
H A D | bearssl_aead.h | 584 unsigned char L2[16]; member in struct:__anon155
|