/openbsd-current/lib/libc/arch/i386/string/ |
H A D | strncmp.S | 21 jmp L2 /* Jump into the loop! */ 27 L2: jz L4 /* strings are equal */ label
|
/openbsd-current/gnu/llvm/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());
|
/openbsd-current/gnu/llvm/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowAnalysis.h | 104 const Lattice &L2 = llvm::any_cast<const Lattice &>(E2.Value); variable 105 return L1.join(L2); 118 const Lattice &L2 = llvm::any_cast<const Lattice &>(E2.Value); variable 119 return L1 == L2;
|
/openbsd-current/gnu/llvm/llvm/include/llvm/ADT/ |
H A D | EquivalenceClasses.h | 242 member_iterator unionSets(member_iterator L1, member_iterator L2) { argument 243 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 244 if (L1 == L2) return L1; // Unifying the same two sets, noop. 247 // point to the L2 leader node. 248 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 254 // Clear L2's leader flag: 257 // L2's leader is now L1.
|
/openbsd-current/gnu/usr.bin/perl/t/op/ |
H A D | goto.t | 404 L2: 408 goto L2 if $z == 10; 410 L2: 447 L2: # without this, fails 1 (middle) out of 3 iterations 449 L2: 453 goto L2 if $z == 10 and not $loop++; 872 goto L2; 873 L2:
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g77.f-torture/compile/ |
H A D | 19990826-3.f | 30 SUBROUTINE PCAPOP(M1,M2,L1,L2,NMEM,N1,N2,IB,IBB,K3,TF,TS,TC,TTO) 46 C VARIATION DE L1,L2, 89 N40=N20-L2+1 92 IF((N10.LT.L1).OR.(N20.LT.L2)) GOTO 3 126 AR5=(JOFI-1)*(N20-L2)*(M1-(IOFI-1)*IB1*N30)*(2*(RAD+RMU)+REQ) 127 %*IOFI+(M2-(JOFI-1)*N40+L2-2)*(M1-(IOFI-1)*IB1*N30)*(2*(RAD+RMU 140 T2=M1*(L2-1)*REQ 155 TNRAN=(N40+(POI-2)*N20+(M2-(JOFI-1)*N40+L2-1))*(RMI+RMU+RAD 195 %M1*N20+(M2-(JOFI-1)*N40+L2-1)*M1*IOFI)*TTRANS 245 T2=M1*(L2 [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 930126-1.c | 9 T*L92(T*),*L15(T*),*L14(T*),*L13(T*),*L12(T*),*L11(T*),*L10(T*),*L9(T*),*L8(T*),*L7(T*),*L6(T*),*L5(T*),*L4(T*),*L3(T*),*L2(T*),*L1(T*); 33 B2 = decl (L2, "");
|
H A D | structs.c | 35 struct struct2 foo2 = { 'a', 'b'}, L2; variable in typeref:struct: 121 L2 = foo2; 232 L2 = fun2();
|
/openbsd-current/gnu/llvm/clang/lib/Analysis/FlowSensitive/ |
H A D | WatchedLiteralsSolver.cpp | 92 /// For example, for the formula `(L1 v L2) ^ (L2 v L3 v L4)` the elements of 93 /// `Clauses` will be `[0, L1, L2, L2, L3, L4]`. 102 /// For example, for the formula `(L1 v L2) ^ (L2 v L3 v L4)` the elements of 137 /// Adds the `L1 v L2 v L3` clause to the formula. If `L2` or `L3` are 145 void addClause(Literal L1, Literal L2 = NullLit, Literal L3 = NullLit) { 148 assert(L1 != NullLit && L1 != L2 [all...] |
/openbsd-current/gnu/llvm/llvm/include/llvm/IR/ |
H A D | SymbolTableListTraits.h | 99 void transferNodesFromList(SymbolTableListTraits &L2, iterator first,
|
/openbsd-current/lib/libcrypto/whrlpool/ |
H A D | whirlpool.c | 494 u64 L0,L1,L2,L3,L4,L5,L6,L7; 530 L2 = C0(K,2) ^ C1(K,1) ^ C2(K,0) ^ C3(K,7) ^ 543 K.q[0] = L0; K.q[1] = L1; K.q[2] = L2; K.q[3] = L3; 550 L2 ^= C0(S,2) ^ C1(S,1) ^ C2(S,0) ^ C3(S,7) ^ 563 S.q[0] = L0; S.q[1] = L1; S.q[2] = L2; S.q[3] = L3; 566 L0 = C0(K,0); L1 = C1(K,0); L2 = C2(K,0); L3 = C3(K,0); 570 L1 ^= C0(K,1); L2 ^= C1(K,1); L3 ^= C2(K,1); L4 ^= C3(K,1); 573 L2 ^= C0(K,2); L3 ^= C1(K,2); L4 ^= C2(K,2); L5 ^= C3(K,2); 577 L7 ^= C4(K,3); L0 ^= C5(K,3); L1 ^= C6(K,3); L2 ^= C7(K,3); 580 L0 ^= C4(K,4); L1 ^= C5(K,4); L2 [all...] |
/openbsd-current/gnu/usr.bin/binutils/gdb/testsuite/gdb.arch/ |
H A D | gdb1291.s | 62 mov.l .L2,r1 80 .L2:
|
H A D | gdb1431.s | 62 mov.l .L2,r1 80 .L2:
|
/openbsd-current/gnu/usr.bin/binutils/gdb/testsuite/gdb.base/ |
H A D | structs.c | 109 struct struct2 foo2 = {'a','2'}, L2; variable in typeref:struct: 216 L2 = foo2; 366 L1.a = L2.a = L3.a = L4.a = L5.a = L6.a = L7.a = L8.a = L9.a = L10.a = L11.a = L12.a = L13.a = L14.a = L15.a = L16.a = L17.a = L18.a = 'Z'; 368 L2.b = L3.b = L4.b = L5.b = L6.b = L7.b = L8.b = L9.b = L10.b = L11.b = L12.b = L13.b = L14.b = L15.b = L16.b = L17.b = L18.b = 'Z'; 439 L2 = fun2();
|
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonExpandCondsets.cpp | 1156 LiveInterval &L2 = LIS->getInterval(R2.Reg); local 1157 if (L2.empty()) 1159 if (L1.hasSubRanges() || L2.hasSubRanges()) 1161 bool Overlap = L1.overlaps(L2); 1166 << printReg(R2.Reg, TRI, R2.Sub) << " " << L2 << "\n"); 1175 if (!isIntraBlocks(L1) && !isIntraBlocks(L2)) 1180 // Move all live segments from L2 to L1. 1183 for (LiveRange::Segment &I : L2) { 1194 while (!L2.empty()) 1195 L2 [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | ggc-page.c | 482 size_t L1, L2; 502 L2 = LOOKUP_L2 (p); 504 return base[L1] && base[L1][L2]; 515 size_t L1, L2; 529 L2 = LOOKUP_L2 (p); 531 return base[L1][L2]; 542 size_t L1, L2; 564 L2 = LOOKUP_L2 (p); 569 base[L1][L2] = entry; 478 size_t L1, L2; local 511 size_t L1, L2; local 538 size_t L1, L2; local
|
/openbsd-current/gnu/gcc/gcc/config/sparc/ |
H A D | lb1spc.asm | 257 bl L2.17 298 L2.17: 341 bl L2.15 381 L2.15: 604 bl L2.17 643 L2.17: 686 bl L2.15 726 L2.15:
|
/openbsd-current/gnu/usr.bin/gcc/gcc/config/sparc/ |
H A D | lb1spc.asm | 257 bl L2.17 298 L2.17: 341 bl L2.15 381 L2.15: 604 bl L2.17 643 L2.17: 686 bl L2.15 726 L2.15:
|
/openbsd-current/libexec/getty/ |
H A D | gettytab.h | 115 #define L2 gettynums[18].value macro
|
/openbsd-current/lib/libm/src/ |
H A D | e_pow.c | 75 L2 = 4.28571428578550184252e-01, /* 0x3FDB6DB6, 0xDB6FABFF */ variable 230 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
H A D | e_powf.c | 31 L2 = 4.2857143283e-01, /* 0x3edb6db7 */ variable 168 r = s2*s2*(L1+s2*(L2+s2*(L3+s2*(L4+s2*(L5+s2*L6)))));
|
/openbsd-current/gnu/llvm/clang/lib/Tooling/ASTDiff/ |
H A D | ASTDiff.cpp | 859 PriorityList L2(T2); 864 L2.push(T2.getRootId()); 867 while (std::min(Max1 = L1.peekMax(), Max2 = L2.peekMax()) > 875 for (NodeId Id : L2.pop()) 876 L2.open(Id); 881 H2 = L2.pop(); 896 L2.open(Id2);
|
/openbsd-current/gnu/gcc/gcc/ |
H A D | ggc-page.c | 560 size_t L1, L2; 580 L2 = LOOKUP_L2 (p); 582 return base[L1] && base[L1][L2]; 592 size_t L1, L2; 606 L2 = LOOKUP_L2 (p); 608 return base[L1][L2]; 617 size_t L1, L2; 639 L2 = LOOKUP_L2 (p); 644 base[L1][L2] = entry; 557 size_t L1, L2; local 589 size_t L1, L2; local 614 size_t L1, L2; local
|
/openbsd-current/gnu/llvm/clang/lib/AST/ |
H A D | RawCommentList.cpp | 73 SourceLocation L2 = R2.getBeginLoc(); local 77 unsigned C2 = SM.getPresumedColumnNumber(L2, &Invalid);
|
/openbsd-current/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DeadStoresChecker.cpp | 234 SourceLocation L2 = local 236 Fixits.push_back(FixItHint::CreateRemoval({L1, L2}));
|