Searched refs:AR2 (Results 1 – 6 of 6) sorted by relevance
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | ArrayRefTest.cpp | 97 ArrayRef<int> AR2(TheNumbers, AR1.size() - 1); in TEST() local 98 EXPECT_TRUE(AR1.drop_back().equals(AR2)); in TEST() 105 EXPECT_TRUE(AR1.drop_front(2).equals(AR2)); in TEST() 133 ArrayRef<int> AR2(AR1.end() - 1, 1); in TEST() local 134 EXPECT_TRUE(AR1.take_back().equals(AR2)); in TEST() 140 ArrayRef<int> AR2(AR1.data(), 2); in TEST() local 141 EXPECT_TRUE(AR1.take_front(2).equals(AR2)); in TEST() 241 const ArrayRef<int> AR2(A1); in TEST() local 242 const ArrayRef<int> &AR2Ref = makeArrayRef(AR2); in TEST() 243 EXPECT_NE(&AR2Ref, &AR2); in TEST() [all …]
|
| /llvm-project-15.0.7/clang/test/CodeGen/ |
| H A D | ext-int.c | 21 int AR2[B]; variable
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopIdiom/ |
| H A D | memset-runtime-64bit.ll | 112 ; CHECK-NEXT: [[AR2:%.*]] = bitcast i32* [[AR:%.*]] to i8* 123 ; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* align 4 [[AR2]], i8 0, i64 [[TMP3]], i1 false) 290 ; CHECK-NEXT: [[AR2:%.*]] = bitcast i32* [[AR:%.*]] to i8* 308 ; CHECK-NEXT: call void @llvm.memset.p0i8.i64(i8* align 4 [[AR2]], i8 0, i64 [[TMP7]], i1 false)
|
| H A D | memset-runtime-32bit.ll | 112 ; CHECK-NEXT: [[AR2:%.*]] = bitcast i32* [[AR:%.*]] to i8* 123 ; CHECK-NEXT: call void @llvm.memset.p0i8.i32(i8* align 4 [[AR2]], i8 0, i32 [[TMP3]], i1 false)
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 2230 const SCEVAddRecExpr *AR2) const;
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 5532 const SCEVAddRecExpr *AR1, const SCEVAddRecExpr *AR2) const { in areAddRecsEqualWithPreds() 5533 if (AR1 == AR2) in areAddRecsEqualWithPreds() 5543 if (!areExprsEqual(AR1->getStart(), AR2->getStart()) || in areAddRecsEqualWithPreds() 5544 !areExprsEqual(AR1->getStepRecurrence(SE), AR2->getStepRecurrence(SE))) in areAddRecsEqualWithPreds()
|