/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
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. 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-11-stable/lib/libc/i386/string/ |
H A D | strcmp.S | 59 L1: incl %eax label 114 je L1
|
H A D | strncmp.S | 65 L1: incl %eax label 82 * L1: addl $8,%eax; addl $8,%ecx; subl $8,%edx; cmpl $8,%edx; jae Lx 155 je L1
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | DebugCrossImpSubsection.cpp | 81 llvm::sort(Ids, [this](const T &L1, const T &L2) { 82 return Strings.getIdForString(L1->getKey()) <
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | AggressiveInstCombine.cpp | 79 Value *L0, *L1, *R0, *R1; 85 m_c_Or(m_Shl(m_Value(L0), m_Value(L1)), m_LShr(m_Value(R0), Sub))); 86 if (RotL.match(V) && L0 == R0 && L1 == R1) { 88 Y = L1; 94 m_c_Or(m_LShr(m_Value(L0), m_Value(L1)), m_Shl(m_Value(R0), Sub))); 95 if (RotR.match(V) && L0 == R0 && L1 == R1) { 97 Y = L1;
|
/freebsd-11-stable/sys/powerpc/powerpc/ |
H A D | swtch32.S | 104 beq .L1 107 .L1:
|
H A D | swtch64.S | 130 beq .L1 134 .L1:
|
/freebsd-11-stable/contrib/lua/src/ |
H A D | llimits.h | 243 #define luai_userstatethread(L,L1) ((void)L) 247 #define luai_userstatefree(L,L1) ((void)L)
|
H A D | lstate.h | 246 LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | size_class_map.h | 72 const uptr L1 = L - MidSizeLog; local 73 return MidClass + (L1 << S) + HBits + (LBits > 0);
|
/freebsd-11-stable/crypto/openssl/crypto/whrlpool/ |
H A D | wp_block.c | 137 * because 16KB table certainly trashes L1 cache. I wish all CPUs 513 u64 L0, L1, L2, L3, L4, L5, L6, L7; 544 L1 = C0(K, 1) ^ C1(K, 0) ^ C2(K, 7) ^ C3(K, 6) ^ 560 K.q[1] = L1; 570 L1 ^= C0(S, 1) ^ C1(S, 0) ^ C2(S, 7) ^ C3(S, 6) ^ 586 S.q[1] = L1; 595 L1 = C1(K, 0); 604 L1 ^= C0(K, 1); 620 L1 ^= C7(K, 2); 628 L1 [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveDebugVariables.cpp | 214 static UserValue *merge(UserValue *L1, UserValue *L2) { argument 216 if (!L1) 218 L1 = L1->getLeader(); 219 if (L1 == L2) 220 return L1; 221 // Splice L2 before L1's members. 224 End->leader = L1; 227 End->leader = L1; 228 End->next = L1 [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/ |
H A D | llimits.h | 180 #define luai_userstatethread(L,L1) ((void)L) 184 #define luai_userstatefree(L,L1) ((void)L)
|
H A D | lstate.h | 222 LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/ |
H A D | xray_allocator.h | 246 SpinMutexLock L1(&O.Mutex); variable 261 SpinMutexLock L1(&O.Mutex); variable
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonSubtarget.cpp | 280 // Is the access size is longer than the L1 cache line, skip the check. 286 MachineInstr &L1 = *S1.getInstr(); local 287 if (!L1.mayLoad() || L1.mayStore() || 288 HII.getAddrMode(L1) != HexagonII::BaseImmOffset) 292 MachineOperand *BaseOp1 = HII.getBaseAndOffset(L1, Offset1, Size1);
|
H A D | HexagonExpandCondsets.cpp | 1136 LiveInterval &L1 = LIS->getInterval(R1.Reg); 1140 if (L1.hasSubRanges() || L2.hasSubRanges()) 1142 bool Overlap = L1.overlaps(L2); 1146 << printReg(R1.Reg, TRI, R1.Sub) << " " << L1 << "\n " 1156 if (!isIntraBlocks(L1) && !isIntraBlocks(L2)) 1161 // Move all live segments from L2 to L1. 1168 NewVN = L1.getNextValue(I->valno->def, LIS->getVNInfoAllocator()); 1173 L1.addSegment(LiveRange::Segment(I->start, I->end, NewVN)); 1180 LLVM_DEBUG(dbgs() << "coalesced: " << L1 << "\n"); 1181 L1 [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | ggc-page.c | 560 size_t L1, L2; 579 L1 = LOOKUP_L1 (p); 582 return base[L1] && base[L1][L2]; 592 size_t L1, L2; 605 L1 = LOOKUP_L1 (p); 608 return base[L1][L2]; 617 size_t L1, L2; 638 L1 = LOOKUP_L1 (p); 641 if (base[L1] 557 size_t L1, L2; local 589 size_t L1, L2; local 614 size_t L1, L2; local [all...] |
H A D | ggc-zone.c | 506 size_t L1, L2; local 519 L1 = LOOKUP_L1 (p); 522 return base[L1][L2]; 532 size_t L1, L2; local 553 L1 = LOOKUP_L1 (p); 556 if (base[L1] == NULL) 557 base[L1] = xcalloc (PAGE_L2_SIZE, sizeof (page_entry *)); 559 base[L1][L2] = entry;
|
/freebsd-11-stable/lib/msun/ld80/ |
H A D | k_expl.h | 47 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must 52 L1 = 5.4152123484527692e-3, /* 0x162e42ff000000.0p-60 */ variable 217 * "huge" is anything that would make fn*L1 inexact (|x| > ~2**17*ln2). 228 r = x - fn * L1 - fn * L2; /* r = r1 + r2 done independently. */ 239 r1 = x - fn * L1;
|
/freebsd-11-stable/sys/arm/arm/ |
H A D | locore-v4.S | 167 * entry point code is in the first L1 section and so if we clear the 242 .L1: 245 bgt .L1
|
/freebsd-11-stable/lib/msun/src/ |
H A D | e_pow.c | 78 L1 = 5.99999999999994648725e-01, /* 0x3FE33333, 0x33333303 */ variable 238 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
H A D | e_powf.c | 36 L1 = 6.0000002384e-01, /* 0x3f19999a */ variable 180 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
H A D | ASTDiff.cpp | 860 PriorityList L1(T1); 865 L1.push(T1.getRootId()); 869 while (std::min(Max1 = L1.peekMax(), Max2 = L2.peekMax()) > 872 for (NodeId Id : L1.pop()) 873 L1.open(Id); 882 H1 = L1.pop(); 894 L1.open(Id1);
|
/freebsd-11-stable/lib/msun/ld128/ |
H A D | k_expl.h | 47 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must 55 L1 = 5.41521234812457272982212595914567508e-3L; variable 235 * "huge" is anything that would make fn*L1 inexact (|x| > ~2**17*ln2). 258 r1 = x - fn * L1;
|