| /llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/ |
| H A D | unroll-loop-invalidation.ll | 13 ; CHECK: Running analysis: LoopAccessAnalysis on Loop at depth 2 containing: %inner2.header 17 ; CHECK: Clearing all analysis results for: inner2.header 67 br label %inner2.ph 69 inner2.ph: 70 br label %inner2.header 72 inner2.header: 73 %inner2.i = phi i32 [ 0, %inner2.ph ], [ %inner2.i.next, %inner2.header ] 74 %inner2.i.next = add i32 %inner2.i, 1 75 %inner2.cond = icmp eq i32 %inner2.i, 4 76 br i1 %inner2.cond, label %inner2.exit, label %inner2.header [all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopFusion/ |
| H A D | triple_loop_nest_inner_guard.ll | 37 ; CHECK: br i1 %{{.*}}, label %[[INNER_EXIT:inner2.exit]], label %[[INNER_BODY:inner1.body]] 119 br label %middle2.body.inner2.guard 121 middle2.body.inner2.guard: 123 br i1 %cmp696, label %inner2.ph, label %middle2.latch 125 inner2.ph: 126 br label %inner2.body 128 inner2.body: 129 %iv = phi i64 [ %iv.next, %inner2.body ], [ 0, %inner2.ph ] 137 br i1 %exitcond, label %inner2.exit, label %inner2.body 139 inner2.exit: [all …]
|
| H A D | double_loop_nest_inner_guard.ll | 31 ; CHECK: br i1 %{{.*}}, label %[[INNER_EXIT:inner2.exit]], label %[[INNER_BODY:inner1.body]] 87 br i1 %cmp261, label %inner2.ph, label %outer2.latch 89 inner2.ph: 90 br label %inner2.body 92 inner2.body: 93 %iv = phi i64 [ %iv.next, %inner2.body ], [ 0, %inner2.ph ] 101 br i1 %exitcond, label %inner2.exit, label %inner2.body 103 inner2.exit:
|
| /llvm-project-15.0.7/clang/test/CXX/temp/temp.decls/temp.class/temp.mem.class/ |
| H A D | p1.cpp | 23 X0<int*, float *>::Inner inner2; in test() local 24 inner2.x = &i; in test() 25 inner2.y = &f; in test() 26 inner2.f(); // expected-note{{instantiation}} in test()
|
| /llvm-project-15.0.7/flang/test/Semantics/ |
| H A D | resolve69.f90 | 75 function inner2() function 76 real inner2(n) local 77 end function inner2
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/ |
| H A D | call-site-attrs.ll | 19 define internal i32 @inner2() alwaysinline { 20 ; CHECK: @inner2( 28 %r = call i32 @inner2() noinline
|
| H A D | inlinedefault-threshold.ll | 15 define i32 @inner2() { 80 ; CHECK: call i32 @inner2() 81 %r = call i32 @inner2() 101 ; CHECK-NOT: call i32 @inner2() 102 %r = call i32 @inner2()
|
| H A D | ephemeral.ll | 31 ; CHECK: Analyzing call of inner2... 33 define void @inner2(i8* %y) { 42 call void @inner2(i8* %y)
|
| H A D | inline_returns_twice.ll | 25 define i32 @inner2() returns_twice { 36 %call = call i32 @inner2() returns_twice
|
| H A D | ptr-diff.ll | 64 ; CHECK: call i32 @inner2 69 %result = call i32 @inner2(i32* %ptr1, i32* %ptr2) 73 define i32 @inner2(i32* %begin, i32* %end) {
|
| H A D | alloca-bonus.ll | 32 ; CHECK: call void @inner2 34 call void @inner2(i32* %ptr) 39 define void @inner2(i32 *%ptr) {
|
| H A D | redundant-loads.ll | 28 ; CHECK: call void @inner2 29 call void @inner2(i32* %a, i32* %b) 33 define void @inner2(i32* %a, i32* %b) {
|
| H A D | always-inline.ll | 32 define internal void @inner2(i32 %N) alwaysinline { 33 ; CHECK-NOT: @inner2( 43 ; CHECK-NOT: call void @inner2 46 call void @inner2( i32 %N )
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/AArch64/ |
| H A D | gep-cost.ll | 13 call void @inner2([4 x i32]* %ptr, i32 %i) 32 ; The gep in inner2() is reg+imm+reg, which is not a legal addressing mode for 34 ; CHECK: Analyzing call of inner2 37 define void @inner2([4 x i32]* %ptr, i32 %i) {
|
| H A D | logical-and-or.ll | 26 %C = call i1 @inner2(i32 1, i32 %a) 30 ; CHECK: Analyzing call of inner2 33 define i1 @inner2(i32 %a, i32 %b) {
|
| H A D | ext.ll | 24 %C = call i32 @inner2(i32* %ptr, i32 %i) 29 ; CHECK: Analyzing call of inner2 32 define i32 @inner2(i32* %ptr, i32 %i) {
|
| /llvm-project-15.0.7/llvm/test/Transforms/Attributor/ |
| H A D | wrapper.ll | 34 ; CHECK: define linkonce i32 @inner2(i32 %a, i32 %b) 42 define linkonce i32 @inner2(i32 %a, i32 %b) { 49 ; CHECK: call i32 @inner2 53 %ret = call i32 @inner2(i32 1, i32 2)
|
| H A D | internalize.ll | 31 ; CHECK-NOT: inner2.internalized 32 define weak i32 @inner2(i32 %a, i32 %b) { 33 ; CHECK-LABEL: define {{[^@]+}}@inner2 91 ; Since the inner2 cannot be internalized, there should be no change to its callsite 101 ; CHECK_DISABLED-NEXT: [[RET2:%.*]] = call i32 @inner2(i32 noundef 1, i32 noundef 2) 111 ; CHECK_ENABLED-NEXT: [[RET2:%.*]] = call i32 @inner2(i32 noundef 1, i32 noundef 2) 118 %ret2 = call i32 @inner2(i32 1, i32 2)
|
| H A D | alwaysinline.ll | 43 define linkonce i32 @inner2() { 44 ; CHECK-LABEL: define {{[^@]+}}@inner2() { 58 ; IS__TUNIT____-NEXT: [[R:%.*]] = call i32 @inner2() #[[ATTR3:[0-9]+]] 63 ; IS__CGSCC____-NEXT: [[R:%.*]] = call i32 @inner2() #[[ATTR2:[0-9]+]] 67 %r = call i32 @inner2() alwaysinline
|
| /llvm-project-15.0.7/clang/test/CXX/expr/expr.prim/expr.prim.general/ |
| H A D | p8-0x.cpp | 13 struct inner2 { struct 24 operator decltype(outer::middle())::inner2 ();
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopUnrollAndJam/ |
| H A D | unprofitable.ll | 14 ; CHECK: %j = phi i32 [ 0, %for.outer ], [ %inc, %for.inner2 ] 29 %j = phi i32 [ 0, %for.outer ], [ %inc, %for.inner2 ] 30 %sum1 = phi i32 [ 0, %for.outer ], [ %add, %for.inner2 ] 34 br label %for.inner2 36 for.inner2: 42 %add.lcssa = phi i32 [ %add, %for.inner2 ]
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/PowerPC/ |
| H A D | ext.ll | 23 %C = call i32 @inner2(i8* %ptr) 28 ; CHECK: Analyzing call of inner2 31 define i32 @inner2(i8* %ptr) {
|
| /llvm-project-15.0.7/llvm/test/Transforms/Inline/X86/ |
| H A D | ext.ll | 24 %C = call i16 @inner2(i8* %ptr) 29 ; CHECK: Analyzing call of inner2 32 define i16 @inner2(i8* %ptr) {
|
| /llvm-project-15.0.7/clang/test/Parser/ |
| H A D | recursion-limits.cpp | 5 class inner2 { inner2(); }; class in outer
|
| /llvm-project-15.0.7/mlir/test/Target/LLVMIR/ |
| H A D | openmp-nested.mlir | 41 // CHECK: call void (ptr, i32, ptr, ...) @__kmpc_fork_call(ptr @3, i32 1, ptr @[[inner2:.+]], ptr %…
|