Home
last modified time | relevance | path

Searched full:start (Results 1 – 25 of 5249) sorted by relevance

12345678910>>...210

/llvm-project/llvm/test/Transforms/ConstraintElimination/
H A Dmul.ll6 define i1 @test_mul_const_nuw_unsigned_1(i8 %start, i8 %high) {
9 ; CHECK-NEXT: [[START_MUL_4:%.*]] = mul nuw i8 [[START:%.*]], 4
15 %start.mul.4 = mul nuw i8 %start, 4
16 %c.1 = icmp ult i8 %start.mul.4, %high
19 %t.1 = icmp ult i8 %start, %high
23 define i1 @test_mul_const_nuw_unsigned_2(i8 %start, i8 %high) {
26 ; CHECK-NEXT: [[START_MUL_4:%.*]] = mul nuw i8 [[START:%.*]], 4
29 ; CHECK-NEXT: [[START_MUL_2:%.*]] = mul nuw i8 [[START]], 2
33 %start.mul.4 = mul nuw i8 %start, 4
34 %c.1 = icmp ult i8 %start.mul.4, %high
[all …]
H A Dshl.ll6 define i1 @test_shl_const_nuw_unsigned_1(i8 %start, i8 %high) {
9 ; CHECK-NEXT: [[START_SHL_4:%.*]] = shl nuw i8 [[START:%.*]], 4
15 %start.shl.4 = shl nuw i8 %start, 4
16 %c.1 = icmp ult i8 %start.shl.4, %high
19 %t.1 = icmp ult i8 %start, %high
23 define i1 @test_shl_const_nuw_unsigned_2(i8 %start, i8 %high) {
26 ; CHECK-NEXT: [[START_SHL_4:%.*]] = shl nuw i8 [[START:%.*]], 4
29 ; CHECK-NEXT: [[START_SHL_2:%.*]] = shl nuw i8 [[START]], 2
33 %start.shl.4 = shl nuw i8 %start, 4
34 %c.1 = icmp ult i8 %start.shl.4, %high
[all …]
H A Dmul-nsw.ll7 define void @slt_mul_nsw_3_known_positive_1(i8 %start, i8 %high) {
10 ; CHECK-NEXT: [[MUL_3:%.*]] = mul nsw i8 [[START:%.*]], 3
12 ; CHECK-NEXT: [[C_2:%.*]] = icmp sgt i8 [[START]], 0
17 ; CHECK-NEXT: [[START_1:%.*]] = mul nsw i8 [[START]], 1
19 ; CHECK-NEXT: [[START_2:%.*]] = mul nsw i8 [[START]], 2
21 ; CHECK-NEXT: [[START_3:%.*]] = mul nsw i8 [[START]], 3
23 ; CHECK-NEXT: [[START_4:%.*]] = mul nsw i8 [[START]], 4
31 %mul.3 = mul nsw i8 %start, 3
33 %c.2 = icmp sgt i8 %start, 0
38 %t.0 = icmp slt i8 %start, %high
[all …]
H A Dadd.ll4 define void @test.not.uge.ult(i8 %start, i8 %low, i8 %high) {
7 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = add i8 [[START:%.*]], 3
13 ; CHECK-NEXT: [[T_0:%.*]] = icmp ult i8 [[START]], [[HIGH]]
15 ; CHECK-NEXT: [[START_1:%.*]] = add i8 [[START]], 1
18 ; CHECK-NEXT: [[START_2:%.*]] = add i8 [[START]], 2
21 ; CHECK-NEXT: [[START_3:%.*]] = add i8 [[START]], 3
24 ; CHECK-NEXT: [[START_4:%.*]] = add i8 [[START]], 4
30 %add.ptr.i = add i8 %start, 3
38 %t.0 = icmp ult i8 %start, %high
40 %start.1 = add i8 %start, 1
[all …]
H A Dsub.ll4 define void @test.not.uge.ult(i8 %start, i8 %low, i8 %high) {
7 ; CHECK-NEXT: [[SUB_PTR_I:%.*]] = sub i8 [[START:%.*]], 3
13 ; CHECK-NEXT: [[T_0:%.*]] = icmp ult i8 [[START]], [[HIGH]]
15 ; CHECK-NEXT: [[START_1:%.*]] = sub i8 [[START]], 1
18 ; CHECK-NEXT: [[START_2:%.*]] = sub i8 [[START]], 2
21 ; CHECK-NEXT: [[START_3:%.*]] = sub i8 [[START]], 3
24 ; CHECK-NEXT: [[START_4:%.*]] = sub i8 [[START]], 4
30 %sub.ptr.i = sub i8 %start, 3
38 %t.0 = icmp ult i8 %start, %high
40 %start.1 = sub i8 %start, 1
[all …]
H A Dmixed-signed-unsigned-predicates.ll4 define i1 @test_add_nuw(i8 %start, i8 %low, i8 %high) {
7 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = add nuw i8 [[START:%.*]], 3
11 ; CHECK-NEXT: [[UC_3:%.*]] = icmp ugt i8 [[START]], [[HIGH]]
12 ; CHECK-NEXT: [[START_1_1:%.*]] = add nuw i8 [[START]], 1
15 ; CHECK-NEXT: [[START_3_1:%.*]] = add nuw i8 [[START]], 3
25 ; CHECK-NEXT: [[START_1:%.*]] = add nuw i8 [[START]], 1
27 ; CHECK-NEXT: [[SC_1:%.*]] = icmp sgt i8 [[START]], [[HIGH]]
31 ; CHECK-NEXT: [[START_2:%.*]] = add nuw i8 [[START]], 2
37 ; CHECK-NEXT: [[START_3:%.*]] = add nuw i8 [[START]], 3
41 ; CHECK-NEXT: [[START_4:%.*]] = add nuw i8 [[START]], 4
[all …]
H A Dadd-nsw.ll7 define void @test.not.uge.ult(i8 %start, i8 %high) {
10 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = add nsw i8 [[START:%.*]], 3
16 ; CHECK-NEXT: [[T_0:%.*]] = icmp ult i8 [[START]], [[HIGH]]
18 ; CHECK-NEXT: [[START_1:%.*]] = add nsw i8 [[START]], 1
21 ; CHECK-NEXT: [[START_2:%.*]] = add nsw i8 [[START]], 2
24 ; CHECK-NEXT: [[START_3:%.*]] = add nsw i8 [[START]], 3
27 ; CHECK-NEXT: [[START_4:%.*]] = add nsw i8 [[START]], 4
33 %add.ptr.i = add nsw i8 %start, 3
41 %t.0 = icmp ult i8 %start, %high
43 %start.1 = add nsw i8 %start, 1
[all …]
H A Dor.ll405 ; CHECK-NEXT: [[START:%.*]] = shl nuw nsw i8 [[INIT_VAL:%.*]], 2
406 ; CHECK-NEXT: [[START_PLUS_3:%.*]] = add nuw i8 [[START]], 3
410 ; CHECK-NEXT: [[F_0:%.*]] = icmp ult i8 [[START]], [[HIGH]]
412 ; CHECK-NEXT: [[I_1:%.*]] = or disjoint i8 [[START]], 1
415 ; CHECK-NEXT: [[I_2:%.*]] = or disjoint i8 [[START]], 2
421 ; CHECK-NEXT: [[START_1:%.*]] = or disjoint i8 [[START]], 1
423 ; CHECK-NEXT: [[START_2:%.*]] = or disjoint i8 [[START]], 2
425 ; CHECK-NEXT: [[START_3:%.*]] = or disjoint i8 [[START]], 3
427 ; CHECK-NEXT: [[START_4:%.*]] = or i8 [[START]], 4
433 %start
[all...]
H A Dgeps-pointers-to-structs.ll7 define i1 @test.ult.true.due.to.first.dimension(ptr %start, ptr %high) {
10 ; CHECK-NEXT: [[ADD_PTR:%.*]] = getelementptr inbounds [[STRUCT_1:%.*]], ptr [[START:%.*]], i64 …
15 ; CHECK-NEXT: [[START_0:%.*]] = getelementptr inbounds [[STRUCT_1]], ptr [[START]], i64 5, i32 0
22 %add.ptr = getelementptr inbounds %struct.1, ptr %start, i64 6, i32 0
28 %start.0 = getelementptr inbounds %struct.1, ptr %start, i64 5, i32 0
29 %start.0.cast = bitcast ptr %start.0 to ptr
30 %c.0 = icmp ult ptr %start.0.cast, %high
37 define i1 @test.ult.true.due.to.first.dimension.var.index.0(ptr %start, ptr %high, i32 %idx) {
42 ; CHECK-NEXT: [[ADD_PTR:%.*]] = getelementptr inbounds [[STRUCT_1:%.*]], ptr [[START:%.*]], i64 …
48 ; CHECK-NEXT: [[START_0:%.*]] = getelementptr inbounds [[STRUCT_1]], ptr [[START]], i64 [[IDX_EX…
[all …]
H A Dgeps-pointers-to-arrays.ll4 define void @pointer.to.array.test.ult.true.due.to.first.dimension(ptr %start, ptr %high) {
7 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = getelementptr inbounds [10 x i8], ptr [[START:%.*]], i64 9, i6…
11 ; CHECK-NEXT: [[START_0:%.*]] = getelementptr inbounds [10 x i8], ptr [[START]], i64 5, i64 0
18 %add.ptr.i = getelementptr inbounds [10 x i8], ptr %start, i64 9, i64 3
23 %start.0 = getelementptr inbounds [10 x i8], ptr %start, i64 5, i64 0
24 %c.0 = icmp ult ptr %start.0, %high
32 define void @pointer.to.array.test.ult.unknown.due.to.first.dimension(ptr %start, ptr %high) {
35 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = getelementptr inbounds [10 x i8], ptr [[START:%.*]], i64 5, i6…
39 ; CHECK-NEXT: [[START_0:%.*]] = getelementptr inbounds [10 x i8], ptr [[START]], i64 10, i64 0
47 %add.ptr.i = getelementptr inbounds [10 x i8], ptr %start, i64 5, i64 3
[all …]
H A Dsub-nuw.ll4 define void @test.not.uge.ult(i8 %start, i8 %low, i8 %high) {
7 ; CHECK-NEXT: [[SUB_PTR_I:%.*]] = sub nuw i8 [[START:%.*]], 3
13 ; CHECK-NEXT: [[T_0:%.*]] = icmp ult i8 [[START]], [[HIGH]]
15 ; CHECK-NEXT: [[START_1:%.*]] = sub nuw i8 [[START]], 1
18 ; CHECK-NEXT: [[START_2:%.*]] = sub nuw i8 [[START]], 2
21 ; CHECK-NEXT: [[START_3:%.*]] = sub nuw i8 [[START]], 3
23 ; CHECK-NEXT: [[START_4:%.*]] = sub nuw i8 [[START]], 4
28 %sub.ptr.i = sub nuw i8 %start, 3
36 %t.0 = icmp ult i8 %start, %high
38 %start.1 = sub nuw i8 %start, 1
[all …]
H A Ddecompose-with-temporary-indices.ll7 define i1 @test_uge_temporary_indices_decompose(i8 %start, i8 %n, i8 %idx) {
11 ; CHECK-NEXT: [[START_ADD_IDX:%.*]] = add nuw nsw i8 [[START:%.*]], [[IDX]]
12 ; CHECK-NEXT: [[START_ADD_N:%.*]] = add nuw nsw i8 [[START]], [[N]]
13 ; CHECK-NEXT: [[START_ADD_1:%.*]] = add nuw nsw i8 [[START]], 1
32 %start.add.idx = add nuw nsw i8 %start, %idx
33 %start.add.n = add nuw nsw i8 %start, %n
34 %start.add.1 = add nuw nsw i8 %start, 1
38 %t.0 = icmp ult i8 %start.add.idx, %start.add.n
39 %f.0 = icmp uge i8 %start.add.idx, %start.add.n
42 %c.1 = icmp ult i8 %start.add.1, %start.add.n
[all …]
H A Dgeps-unsigned-predicates.ll180 define void @test.not.uge.ult(ptr %start, ptr %low, ptr %high) {
183 ; CHECK-NEXT: [[ADD_PTR_I:%.*]] = getelementptr inbounds i8, ptr [[START:%.*]], i64 3
190 ; CHECK-NEXT: [[START_1:%.*]] = getelementptr inbounds i8, ptr [[START]], i64 1
192 ; CHECK-NEXT: [[START_2:%.*]] = getelementptr inbounds i8, ptr [[START]], i64 2
194 ; CHECK-NEXT: [[START_3:%.*]] = getelementptr inbounds i8, ptr [[START]], i64 3
196 ; CHECK-NEXT: [[START_4:%.*]] = getelementptr inbounds i8, ptr [[START]], i64 4
202 %add.ptr.i = getelementptr inbounds i8, ptr %start, i64 3
210 %t.0 = icmp ult ptr %start, %high
212 %start.1 = getelementptr inbounds i8, ptr %start, i64 1
213 %t.1 = icmp ult ptr %start.1, %high
[all …]
/llvm-project/clang/test/CodeGen/
H A Dbuiltins-hexagon-circ.c6 unsigned char test1(int mod, void *start) { in test1() argument
7 unsigned char *base = start; in test1()
8 return __builtin_HEXAGON_L2_loadrub_pci(&base, 4, mod, start); in test1()
13 unsigned char test2(int mod, void *start) { in test2() argument
14 char *base = start; in test2()
15 return __builtin_HEXAGON_L2_loadrb_pci(&base, 4, mod, start); in test2()
20 unsigned short test3(int mod, void *start) { in test3() argument
21 unsigned short *base = start; in test3()
22 return __builtin_HEXAGON_L2_loadruh_pci(&base, 4, mod, start); in test3()
27 short test4(int mod, void *start) { in test4() argument
[all …]
/llvm-project/llvm/test/tools/llvm-symbolizer/
H A Dsym-verbose.test21 CHECK-NEXT: Function start filename: /tmp{{[\\/]}}discrim.c
22 CHECK-NEXT: Function start line: 4
23 CHECK-NEXT: Function start address: 0x400590
28 CHECK-NEXT: Function start filename: /tmp{{[\\/]}}discrim.c
29 CHECK-NEXT: Function start line: 9
30 CHECK-NEXT: Function start address: 0x400590
37 CHECK-NEXT: Function start filename: /tmp{{[\\/]}}discrim.c
38 CHECK-NEXT: Function start line: 4
39 CHECK-NEXT: Function start address: 0x400590
45 CHECK-NEXT: Function start filename: /tmp{{[\\/]}}discrim.c
[all …]
/llvm-project/polly/test/DeLICM/
H A Dreduction_looprotate_hoisted.ll5 ; int Start = *Startptr;
6 ; int phi = Start;
7 ; for (int i = Start; i < 4; i += 1) /* reduction */
27 %Start = load i32, ptr %StartPtr
31 %i = phi i32 [%Start, %reduction.preheader], [%i.inc, %reduction.inc]
32 %phi = phi i32 [%Start, %reduction.preheader], [%mul, %reduction.inc]
67 ; load-hoisting %Start is an affine loop. To be fixed in ScopBuilder.
72 ; CHECK-NEXT: [Start] -> { Stmt_reduction_preheader[i0] -> MemRef_phi__phi[] };
73 ; CHECK-NEXT: new: [Start] -> { Stmt_reduction_preheader[i0] -> MemRef_A[i0] };
76 ; CHECK-NEXT: [Start] -> { Stmt_reduction_for[i0, i1] -> MemRef_phi__phi[] };
[all …]
/llvm-project/llvm/test/CodeGen/Hexagon/
H A Dcirc_new.ll7 define zeroext i8 @test1(i32 %mod, ptr %start) local_unnamed_addr #0 {
9 %0 = tail call { i32, ptr } @llvm.hexagon.L2.loadrub.pci(ptr %start, i32 4, i32 %mod, ptr %start)
21 define zeroext i8 @test2(i32 %mod, ptr %start) local_unnamed_addr #0 {
23 %0 = tail call { i32, ptr } @llvm.hexagon.L2.loadrb.pci(ptr %start, i32 4, i32 %mod, ptr %start)
35 define zeroext i16 @test3(i32 %mod, ptr %start) local_unnamed_addr #0 {
37 %0 = tail call { i32, ptr } @llvm.hexagon.L2.loadruh.pci(ptr %start, i32 4, i32 %mod, ptr %start)
49 define signext i16 @test4(i32 %mod, ptr %start) local_unnamed_add
[all...]
/llvm-project/llvm/test/MC/AArch64/
H A Dadr-diagnostics.s3 adr x0, -start
5 // CHECK-NEXT: adr x0, -start
7 adr x1, start * 10
9 // CHECK-NEXT: adr x1, start * 10
11 adr x2, 2 * (start + 987136)
13 // CHECK-NEXT: adr x2, 2 * (start + 987136)
15 adr x3, (end + start)
17 // CHECK-NEXT: adr x3, (end + start)
19 adr x4, #(end - start)
20 // CHECK: error: symbol 'start' can not be undefined in a subtraction expression
[all …]
/llvm-project/llvm/test/Analysis/ScalarEvolution/
H A Dtrip-count13.ll5 ; E.g.: %rhs = 255, %start = 99, backedge taken 156 times
15 %start = add i8 %rhs, 100
19 %iv = phi i8 [ %start, %entry ], [ %iv.inc, %loop ]
29 define void @u_1(i8 %start) {
33 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start))
35 … Loop %loop: symbolic max backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start)),…
39 ; E.g.: %start = 99, %rhs = 255, backedge taken 156 times
40 %rhs = add i8 %start, -100
44 %iv = phi i8 [ %start, %entry ], [ %iv.inc, %loop ]
64 ; E.g.: %rhs = 127, %start = -29, backedge taken 156 times
[all …]
H A Dincreasing-or-decreasing-iv.ll7 ; CHECK-NEXT: %start = select i1 %c, i32 127, i32 0
8 ; CHECK-NEXT: --> %start U: [0,128) S: [0,128)
13 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
14 ; CHECK-NEXT: --> {%start,+,%step}<nsw><%loop> U: [0,128) S: [0,128) Exits: ((127 * %step)<nsw> …
16 … CHECK-NEXT: --> {(%step + %start),+,%step}<nw><%loop> U: [-256,256) S: [-256,256) Exits: ((128…
26 %start = select i1 %c, i32 127, i32 0
32 %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
45 ; CHECK-NEXT: %start = select i1 %c, i32 120, i32 0
46 ; CHECK-NEXT: --> %start U: [0,121) S: [0,121)
51 ; CHECK-NEXT: %iv = phi i32 [ %start, %entry ], [ %iv.next, %loop ]
[all …]
/llvm-project/llvm/utils/
H A Dbisect-skip-count47 start = args.skipstart variable
51 print("Start: %d" % start)
55 while start != end and start != end-1:
56 count = start + (end - start)//2
57 print("Visiting Skip: %d with (Start, End) = (%d,%d)" % (count, start, end))
66 print(" FAILS! Setting start to count")
67 start = count variable
71 firstcount = start
72 print("Last good skip: %d" % start)
73 start = args.countstart variable
[all …]
/llvm-project/llvm/test/tools/llvm-objcopy/ELF/
H A Dchange-entry-point.test3 # Test --set-start.
4 # RUN: llvm-objcopy --set-start 0x1000 %t %t2
6 # RUN: llvm-objcopy --set-start 4096 %t %t3
8 # RUN: llvm-objcopy --set-start 0x100000000 %t %t4
10 # RUN: not llvm-objcopy --set-start -123 %t %t5 2>&1 | FileCheck %s --check-prefix=SET-ERR
12 # Test --change-start.
13 # RUN: llvm-objcopy --change-start 0x50 %t %t6
15 # RUN: llvm-objcopy --change-start 0x100000000 %t %t7
17 # RUN: llvm-objcopy --change-start -128 %t %t8
19 # RUN: llvm-objcopy --change-start -4353 %t %t9
[all …]
/llvm-project/llvm/test/CodeGen/Generic/
H A Dllc-start-stop.ll21 ; RUN: llc < %s -debug-pass=Structure -start-after=loop-reduce -o /dev/null 2>&1 | FileCheck %s -check-prefix=START-AFTER
22 ; START-AFTER: -aa -mergeicmps
23 ; START-AFTER: FunctionPass Manager
24 ; START-AFTER-NEXT: Dominator Tree Construction
26 ; RUN: llc < %s -debug-pass=Structure -start-before=loop-reduce -o /dev/null 2>&1 | FileCheck %s -check-prefix=START-BEFORE
27 ; START-BEFORE: -machine-branch-prob -regalloc-evict -regalloc-priority -domtree
28 ; START-BEFORE: FunctionPass Manager
29 ; START
[all...]
/llvm-project/llvm/test/Analysis/StackSafetyAnalysis/
H A Dlifetime.ll14 call void @llvm.lifetime.start.p0(i64 -1, ptr %z)
15 ; CHECK: call void @llvm.lifetime.start.p0(i64 -1, ptr %z)
18 call void @llvm.lifetime.start.p0(i64 -1, ptr %x)
19 ; CHECK: call void @llvm.lifetime.start.p0(i64 -1, ptr %x)
27 call void @llvm.lifetime.start.p0(i64 -1, ptr %y)
28 ; CHECK: call void @llvm.lifetime.start.p0(i64 -1, ptr %y)
51 call void @llvm.lifetime.start.p0(i64 -1, ptr %x)
52 ; CHECK: call void @llvm.lifetime.start.p0(i64 -1, ptr %x)
72 call void @llvm.lifetime.start.p0(i64 -1, ptr %x)
73 ; CHECK: call void @llvm.lifetime.start
[all...]
/llvm-project/llvm/unittests/ADT/
H A DIntervalMapTest.cpp94 EXPECT_EQ(100u, I.start()); in TEST()
107 EXPECT_EQ(100u, I.start()); in TEST()
116 EXPECT_EQ(100u, I.start()); in TEST()
123 EXPECT_EQ(0u, I.start()); in TEST()
129 EXPECT_EQ(0u, I.start()); in TEST()
136 EXPECT_EQ(150u, I.start()); in TEST()
143 EXPECT_EQ(150u, I.start()); in TEST()
149 EXPECT_EQ(150u, I.start()); in TEST()
156 EXPECT_EQ(160u, I.start()); in TEST()
179 EXPECT_EQ(149u, I.start()); in TEST()
[all …]

12345678910>>...210