Home
last modified time | relevance | path

Searched refs:L2 (Results 1 – 25 of 366) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/llvm/test/MC/AArch64/
H A Darm64-directive_loh.s9 L2: label
22 .loh AdrpAdrp L1, L2
23 .loh 1 L1, L2
27 .loh AdrpLdr L1, L2
28 .loh 2 L1, L2
33 .loh 3 L1, L2, L3
38 .loh 4 L1, L2, L3
43 .loh 5 L1, L2, L3
48 .loh 6 L1, L2, L3
53 .loh 7 L1, L2
[all …]
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DImmutableListTest.cpp56 EXPECT_FALSE(L2.isEmpty()); in TEST_F()
59 EXPECT_FALSE(L == L2); in TEST_F()
61 EXPECT_FALSE(L.isEqual(L2)); in TEST_F()
63 EXPECT_FALSE(L2.begin() == L2.end()); in TEST_F()
64 EXPECT_TRUE(L2.begin() != L2.end()); in TEST_F()
67 EXPECT_EQ(3, L2.getHead()); in TEST_F()
68 EXPECT_TRUE(L2.contains(3)); in TEST_F()
78 EXPECT_FALSE(L2 == L3); in TEST_F()
118 EXPECT_FALSE(L2.isEmpty()); in TEST_F()
213 EXPECT_FALSE(L2 == L3); in TEST_F()
[all …]
H A DSimpleIListTest.cpp74 L1.swap(L2); in TEST()
347 L2.push_back(B); in TEST()
348 L2.push_back(C); in TEST()
371 L2.push_back(D); in TEST()
372 L2.push_back(B); in TEST()
376 L1.splice(--L1.end(), L2, ++L2.begin()); in TEST()
383 I = L2.begin(); in TEST()
404 L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end()); in TEST()
412 I = L2.begin(); in TEST()
502 I = L2.begin(); in TEST()
[all …]
H A DBumpPtrListTest.cpp150 BumpPtrList<int> L2; in TEST() local
151 L2.insert(L2.end(), std::begin(N2s), std::end(N2s)); in TEST()
154 L1.swap(L2); in TEST()
157 auto I = L2.begin(); in TEST()
187 BumpPtrList<int> L1, L2; in TEST() local
189 L2.push_back(2); in TEST()
190 L1 = std::move(L2); in TEST()
201 L1 = std::move(L2); in TEST()
208 L2.push_back(2); in TEST()
209 L1 = L2; in TEST()
[all …]
H A DIListTest.cpp49 ilist<Node> L1, L2, L3; in TEST() local
65 EXPECT_EQ(2u, L2.size()); in TEST()
66 EXPECT_EQ(&L2Nodes[0], &L2.front()); in TEST()
67 EXPECT_EQ(&L2Nodes[1], &L2.back()); in TEST()
74 L2.clearAndLeakNodesUnsafely(); in TEST()
234 ilist<NodeWithCallback> L1, L2; in TEST() local
245 L2.splice(L2.end(), L1); in TEST()
246 ASSERT_EQ(&N, &L2.front()); in TEST()
300 ilist<PrivateNode> L2; in TEST() local
301 L2.splice(L2.end(), L); in TEST()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dcreate-induction-resume.ll87 L2.header: ; preds = %L2.Inner.header, %L1.exit, %L2.header
88 switch i32 %L2.switch, label %L2.header [
93 L2.Inner.header: ; preds = %L2.Inner.header, %L2.header
94 %L2.accum = phi i32 [ %L2.accum.next, %L2.Inner.header ], [ 1, %L2.header ]
95 %L2.iv = phi i64 [ %L2.iv.next, %L2.Inner.header ], [ 1, %L2.header ]
96 %L2.accum.next = sub i32 %L2.accum, %L1.exit.val
97 %L2.dummy.but.need.it = sext i32 %L2.accum.next to i64
98 %L2.iv.next = add nuw nsw i64 %L2.iv, 1
99 %L2.exit_cond = icmp ugt i64 %L2.iv, 11
100 br i1 %L2.exit_cond, label %L2.header, label %L2.Inner.header
[all …]
/llvm-project-15.0.7/libcxx/test/std/thread/thread.mutex/thread.lock.algorithm/
H A Dlock.pass.cpp76 class L2 class
125 L2 l1; in main()
138 L2 l0; in main()
153 L2 l1; in main()
166 L2 l0; in main()
180 L2 l0; in main()
181 L2 l1; in main()
206 L2 l0; in main()
207 L2 l1; in main()
208 L2 l2; in main()
[all …]
H A Dtry_lock.pass.cpp57 class L2 class
101 L2 l1; in main()
114 L2 l0; in main()
149 L2 l0; in main()
150 L2 l1; in main()
151 L2 l2; in main()
167 L2 l2; in main()
205 L2 l2; in main()
220 L2 l1; in main()
235 L2 l0; in main()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dcond-br-tuning.ll22 L2:
41 L2:
59 L2:
77 L2:
95 L2:
115 br label %L2
116 L2:
135 br label %L2
136 L2:
156 L2:
[all …]
H A Dsve-intrinsics-create-tuple.ll21 L2:
39 L2:
60 L2:
78 L2:
99 L2:
117 L2:
138 L2:
156 L2:
177 L2:
195 L2:
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dcomparisons-i32.ll12 ; CHECK-NEXT: i32.eq $push[[L2:[0-9]+]]=, $pop[[L0]], $pop[[L1]]{{$}}
13 ; SLOW-NEXT: return $pop[[L2]]{{$}}
28 ; FAST-NEXT: return $pop[[L2]]{{$}}
40 ; FAST-NEXT: return $pop[[L2]]{{$}}
52 ; FAST-NEXT: return $pop[[L2]]{{$}}
64 ; FAST-NEXT: return $pop[[L2]]{{$}}
76 ; FAST-NEXT: return $pop[[L2]]{{$}}
88 ; FAST-NEXT: return $pop[[L2]]{{$}}
100 ; FAST-NEXT: return $pop[[L2]]{{$}}
112 ; FAST-NEXT: return $pop[[L2]]{{$}}
[all …]
H A Dcomparisons-i64.ll12 ; CHECK-NEXT: i64.eq $push[[L2:[0-9]+]]=, $pop[[L0]], $pop[[L1]]{{$}}
13 ; SLOW-NEXT: return $pop[[L2]]{{$}}
28 ; FAST-NEXT: return $pop[[L2]]{{$}}
40 ; FAST-NEXT: return $pop[[L2]]{{$}}
52 ; FAST-NEXT: return $pop[[L2]]{{$}}
64 ; FAST-NEXT: return $pop[[L2]]{{$}}
76 ; FAST-NEXT: return $pop[[L2]]{{$}}
88 ; FAST-NEXT: return $pop[[L2]]{{$}}
100 ; FAST-NEXT: return $pop[[L2]]{{$}}
112 ; FAST-NEXT: return $pop[[L2]]{{$}}
[all …]
/llvm-project-15.0.7/clang/test/Sema/
H A Dscope-check.c61 goto L2; // expected-error {{cannot jump from this goto statement to its label}} in test8()
64 L2:; in test8()
138 L2: ; in test9()
148 &&L2, in test9()
161 goto L2; // expected-error {{cannot jump from this goto statement to its label}} in test10()
163 L2: in test10()
186 goto L2; in test12()
187 L2: in test12()
221 static const void *addrs[] = { &&L1, &&L2 }; in test15()
228 L2: // expected-note {{possible target}} in test15()
/llvm-project-15.0.7/llvm/test/MC/RISCV/
H A Dfixups-expr.s18 .L2: label
22 .dword .L2-.L1
24 .word .L2-.L1
26 .half .L2-.L1
28 .byte .L2-.L1
30 # RELAX: 0x0 R_RISCV_ADD64 .L2 0x0
34 # RELAX: 0x10 R_RISCV_ADD32 .L2 0x0
38 # RELAX: 0x18 R_RISCV_ADD16 .L2 0x0
42 # RELAX: 0x1C R_RISCV_ADD8 .L2 0x0
/llvm-project-15.0.7/clang/include/clang/Basic/
H A DLinkage.h120 inline Linkage minLinkage(Linkage L1, Linkage L2) { in minLinkage() argument
121 if (L2 == VisibleNoLinkage) in minLinkage()
122 std::swap(L1, L2); in minLinkage()
124 if (L2 == InternalLinkage) in minLinkage()
126 if (L2 == UniqueExternalLinkage) in minLinkage()
129 return L1 < L2 ? L1 : L2; in minLinkage()
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A Dtail-merge-branch-weight.ll5 ; p(L0_L1 -> L2) = p(entry -> L0) * p(L0 -> L2) + p(entry -> L1) * p(L1 -> L2)
23 br i1 %cmp1, label %L2, label %L3, !prof !1
29 br i1 %cmp3, label %L2, label %L3, !prof !2
31 L2: ; preds = %L1, %L0
34 L3: ; preds = %L0, %L1, %L2
35 %retval.0 = phi i32 [ 100, %L2 ], [ 6, %L1 ], [ 6, %L0 ]
/llvm-project-15.0.7/llvm/test/CodeGen/XCore/
H A Devents.ll14 call void @llvm.xcore.setv.p1i8(i8 addrspace(1)* %r, i8* blockaddress(@f, %L2))
17 indirectbr i8* %goto_addr, [label %L1, label %L2]
20 L2:
23 %retval = phi i32 [1, %L1], [2, %L2]
33 %goto_addr = call i8* @llvm.xcore.checkevent(i8 *blockaddress(@f, %L2))
36 indirectbr i8* %goto_addr, [label %L1, label %L2]
39 L2:
42 %retval = phi i32 [1, %L1], [2, %L2]
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dreturn-noreturn.cpp34 switch (x) default: L1: L2: case 4: pr6884_abort_struct(); in f4()
37 switch (x) default: L1: { L2: case 4: pr6884_abort_struct(); } in f5()
40 switch (x) default: L1: L2: case 4: { pr6884_abort_struct(); } in f6()
45 switch (x) default: L1: L2: case 4: { in f7()
71 switch (x) default: L1: L2: case 4: pr6884_abort_struct(); in g4()
75 switch (x) default: L1: { L2: case 4: pr6884_abort_struct(); } in g5()
79 switch (x) default: L1: L2: case 4: { pr6884_abort_struct(); } in g6()
98 switch (x) default: L1: L2: case 4: pr6884_abort_struct a; in h4()
102 switch (x) default: L1: { L2: case 4: pr6884_abort_struct a; } in h5()
106 switch (x) default: L1: L2: case 4: { pr6884_abort_struct a; } in h6()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A Dilist.h248 for (const_reference V : L2)
292 this->transferNodesFromList(L2, first, last);
294 base_list_type::splice(position, L2, first, last);
330 void splice(iterator where, iplist_impl &L2) {
331 if (!L2.empty())
332 transfer(where, L2, L2.begin(), L2.end());
337 transfer(where, L2, first, last);
340 if (first != last) transfer(where, L2, first, last);
343 splice(where, L2, iterator(N));
345 void splice(iterator where, iplist_impl &L2, pointer N) {
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dbrev_ld.ll26 %1 = tail call { i64, i8* } @llvm.hexagon.L2.loadrd.pbr(i8* %0, i32 %mod)
37 %1 = tail call { i32, i8* } @llvm.hexagon.L2.loadri.pbr(i8* %0, i32 %mod)
48 %1 = tail call { i32, i8* } @llvm.hexagon.L2.loadrh.pbr(i8* %0, i32 %mod)
59 %1 = tail call { i32, i8* } @llvm.hexagon.L2.loadruh.pbr(i8* %0, i32 %mod)
69 %0 = tail call { i32, i8* } @llvm.hexagon.L2.loadrb.pbr(i8* %ptr, i32 %mod)
84 declare { i64, i8* } @llvm.hexagon.L2.loadrd.pbr(i8*, i32) #1
85 declare { i32, i8* } @llvm.hexagon.L2.loadri.pbr(i8*, i32) #1
86 declare { i32, i8* } @llvm.hexagon.L2.loadrh.pbr(i8*, i32) #1
87 declare { i32, i8* } @llvm.hexagon.L2.loadruh.pbr(i8*, i32) #1
88 declare { i32, i8* } @llvm.hexagon.L2.loadrb.pbr(i8*, i32) #1
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopDeletion/
H A Dunreachable-loops.ll244 ; CHECK: L2.preheader:
267 L2:
275 %y = phi i64 [ %y.next, %L1 ], [ %y.L2, %L2 ]
303 L2:
332 L2:
340 %cond2 = icmp slt i64 %y.L2, %n
348 ; Since L3 is not deleted, and entirely contained within L2, L2 is also not
363 L2:
371 %y.L3 = phi i64 [ %y.L2, %L2 ], [ %y.L3.next, %L3 ]
405 L2:
[all …]
/llvm-project-15.0.7/llvm/test/Bitcode/
H A Dblockaddress-addrspace.ll109 L2:
117 L2:
125 L2:
133 L2:
144 L2:
155 L2:
209 L2:
220 L2:
234 L2:
248 L2:
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopStrengthReduce/X86/
H A Dincorrect-offset-scaling.ll10 L: ; preds = %idxend.10, %idxend, %L2, %top
13 L1: ; preds = %L1.preheader, %L2
14 %r13 = phi i64 [ %r1, %L2 ], [ 1, %L ]
15 ; CHECK: %lsr.iv = phi i64 [ 0, %L{{[^ ]+}} ], [ %lsr.iv.next, %L2 ]
16 ; CHECK-NOT: %lsr.iv = phi i64 [ -1, %L{{[^ ]+}} ], [ %lsr.iv.next, %L2 ]
21 L2: ; preds = %idxend.8
33 br i1 undef, label %if6, label %L2
/llvm-project-15.0.7/llvm/test/Transforms/JumpThreading/
H A Dfold-not-thread.ll33 switch i32 %val, label %L2 [
42 L2:
74 br i1 %cond, label %L1, label %L2
79 L2:
128 L2:
150 i32 96, label %L2
156 L2:
172 br i1 %cmp, label %L0, label %L2
178 i32 96, label %L2
184 L2:
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/MSP430/
H A Dindirectbr2.ll2 @C.0.2070 = private constant [5 x i8*] [i8* blockaddress(@foo, %L1), i8* blockaddress(@foo, %L2), i…
9 indirectbr i8* %gotovar.4.0, [label %L5, label %L4, label %L3, label %L2, label %L1]
20 br label %L2
22 L2: ; preds = %L3, %bb2
26 L1: ; preds = %L2, %bb2
27 %res.3 = phi i16 [ %res.2, %L2 ], [ 2, %entry ] ; <i16> [#uses=1]

12345678910>>...15