Home
last modified time | relevance | path

Searched full:left (Results 1 – 25 of 2276) sorted by relevance

12345678910>>...92

/llvm-project/polly/include/polly/Support/
H A DISLOperators.h22 inline isl::pw_aff operator+(isl::pw_aff Left, isl::pw_aff Right) {
23 return Left.add(Right);
27 isl::pw_aff Left(Right.domain(), ValLeft);
28 return Left.add(Right);
31 inline isl::pw_aff operator+(isl::pw_aff Left, isl::val ValRight) {
32 isl::pw_aff Right(Left.domain(), ValRight);
33 return Left.add(Right);
39 isl::pw_aff Left(Right.domain(), ValLeft);
40 return Left.add(Right);
43 inline isl::pw_aff operator+(isl::pw_aff Left, long IntRight) {
[all …]
/llvm-project/llvm/test/Transforms/InstCombine/
H A Dphi-of-insertvalues.ll11 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
12 ; CHECK: left:
17 ; CHECK-NEXT: [[VAL_LEFT_PN:%.*]] = phi i32 [ [[VAL_LEFT:%.*]], [[LEFT]] ], [ [[VAL_RIGHT:%.*]],…
22 br i1 %c, label %left, label %right
24 left:
33 %r = phi { i32, i32 } [ %i0, %left ], [ %i1, %right ]
41 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
42 ; CHECK: left:
50 ; CHECK-NEXT: [[R:%.*]] = phi { i32, i32 } [ [[I0]], [[LEFT]] ], [ [[I1]], [[RIGHT]] ]
54 br i1 %c, label %left, label %right
[all …]
H A Dphi-extractvalue.ll11 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
12 ; CHECK: left:
17 ; CHECK-NEXT: [[AGG_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIG…
22 br i1 %c, label %left, label %right
24 left:
33 %r = phi i32 [ %i0, %left ], [ %i1, %right ]
41 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
42 ; CHECK: left:
50 ; CHECK-NEXT: [[R:%.*]] = phi i32 [ [[I0]], [[LEFT]] ], [ [[I1]], [[RIGHT]] ]
54 br i1 %c, label %left, label %right
[all …]
H A Dphi-aware-aggregate-reconstruction.ll19 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
20 ; CHECK: left:
27 ; CHECK-NEXT: [[AGG_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIGHT:%.*]], [[RIGHT]] ]
32 br i1 %c, label %left, label %right
34 left:
47 %i5 = phi i32 [ %i0, %left ], [ %i3, %right ]
48 %i6 = phi i32 [ %i2, %left ], [ %i4, %right ]
59 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]]
60 ; CHECK: left:
67 ; CHECK-NEXT: [[AGG_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIGH
[all...]
/llvm-project/compiler-rt/test/ubsan/TestCases/Integer/
H A Dunsigned-shift.cpp15 …0'00000010, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 2 by 31 pl… in main()
16 …0'00000100, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 4 by 31 pl… in main()
17 …0'00001000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 8 by 31 pl… in main()
18 …0'00010000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 16 by 31 p… in main()
19 …0'00100000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 32 by 31 p… in main()
20 …0'01000000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 64 by 31 p… in main()
21 …0'10000000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 128 by 31 … in main()
22 …1'00000000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 256 by 31 … in main()
23 …0'00000000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 512 by 31 … in main()
24 …0'00000000, 31); // CHECK: unsigned-shift.cpp:[[@LINE]]:3: runtime error: left shift of 1024 by 31… in main()
[all …]
/llvm-project/llvm/test/CodeGen/AArch64/GlobalISel/
H A Dpostlegalizer-lowering-shuf-to-ins.mir18 ; Matched M[0] = 0 -> G_INSERT_VECTOR_ELT should use %left.
24 ; CHECK: %left:_(<2 x s32>) = COPY $d0
26 ; CHECK: [[EVEC:%[0-9]+]]:_(s32) = G_EXTRACT_VECTOR_ELT %left(<2 x s32>), [[C]](s64)
28 ; CHECK: %shuf:_(<2 x s32>) = G_INSERT_VECTOR_ELT %left, [[EVEC]](s32), [[C1]](s64)
31 %left:_(<2 x s32>) = COPY $d0
33 %shuf:_(<2 x s32>) = G_SHUFFLE_VECTOR %left(<2 x s32>), %right, shufflemask(0, 0)
48 ; Matched M[1] = 1 -> G_INSERT_VECTOR_ELT should use %left.
54 ; CHECK: %left:_(<2 x s32>) = COPY $d0
56 ; CHECK: [[EVEC:%[0-9]+]]:_(s32) = G_EXTRACT_VECTOR_ELT %left(<2 x s32>), [[C]](s64)
58 ; CHECK: %shuf:_(<2 x s32>) = G_INSERT_VECTOR_ELT %left, [[EVEC]](s32), [[C1]](s64)
[all …]
/llvm-project/llvm/test/Transforms/RewriteStatepointsForGC/
H A Dbase-pointers-14.ll13 ; CHECK-NEXT: left:
16 ; CHECK-NEXT: [[B5:%.*]] = phi ptr addrspace(1) [ [[B2:%.*]], [[LEFT:%.*]] ], [ [[B5]], [[LOOP]]…
19 ; CHECK-NEXT: [[B6:%.*]] = phi ptr addrspace(1) [ [[B1:%.*]], [[LEFT]] ], [ [[B5]], [[LOOP]] ]
24 left:
28 %b5 = phi ptr addrspace(1) [ %b2, %left ], [ %b5, %loop ]
32 %b6 = phi ptr addrspace(1) [ %b1, %left ], [ %b5, %loop ]
40 ; CHECK-NEXT: br label [[LEFT:%.*]]
41 ; CHECK: left:
44 ; CHECK-NEXT: [[B5:%.*]] = phi ptr addrspace(1) [ [[B2:%.*]], [[LEFT]] ], [ [[B5]], [[LOOP]] ], …
48 ; CHECK-NEXT: i32 2, label [[LEFT]]
[all …]
/llvm-project/polly/www/
H A Dtodo.html41 <th align="left"> Move to isl C++ bindings
46 <th align="left"> &nbsp; &nbsp; - Add isl C++ bindings generator to isl
52 <th align="left"> Add isl as an external library to Polly SVN
58 <th align="left"> Compile-time: Speed up transformations
63 <th align="left"> &nbsp; &nbsp; - Optimize isl_int for small integers
69 <th align="left"> Compile-time: Minimize SCoP detection time
74 <th align="left"> &nbsp; &nbsp; - Reconsider pass-ordering (move Polly later)
90 <th align="left">
96 <th align="left">
102 <th align="left">
[all …]
/llvm-project/clang/lib/Format/
H A DTokenAnnotator.cpp63 /// With `Left` being '(', check if we're at either `[...](` or
66 static bool isLambdaParameterList(const FormatToken *Left) { in isLambdaParameterList()
68 if (Left->Previous && Left->Previous->is(tok::greater) && in isLambdaParameterList()
69 Left->Previous->MatchingParen && in isLambdaParameterList()
70 Left->Previous->MatchingParen->is(TT_TemplateOpener)) { in isLambdaParameterList()
71 Left = Left->Previous->MatchingParen; in isLambdaParameterList()
75 return Left->Previous && Left in isLambdaParameterList()
65 isLambdaParameterList(const FormatToken * Left) isLambdaParameterList() argument
175 FormatToken *Left = CurrentToken->Previous; parseAngle() local
666 FormatToken *Left = CurrentToken->Previous; parseSquare() local
1232 updateParameterCount(FormatToken * Left,FormatToken * Current) updateParameterCount() argument
4108 const FormatToken &Left = *Tok.Previous; splitPenalty() local
4335 spaceRequiredBetween(const AnnotatedLine & Line,const FormatToken & Left,const FormatToken & Right) const spaceRequiredBetween() argument
4807 const FormatToken &Left = *Right.Previous; spaceRequiredBefore() local
5425 const FormatToken &Left = *Right.Previous; mustBreakBefore() local
5887 const FormatToken &Left = *Right.Previous; canBreakBefore() local
[all...]
/llvm-project/clang/test/Analysis/
H A Dbitwise-shift-pedantic.c21 // TEST NEGATIVE LEFT OPERAND
26 // expected-warning@-1 {{Left operand is negative in left shift}} in negative_left_operand_literal()
27 // expected-note@-2 {{The result of left shift is undefined because the left operand is negative}} in negative_left_operand_literal()
30 int negative_left_operand_symbolic(int left, int right) { in negative_left_operand_symbolic() argument
31 // expected-note@+2 {{Assuming 'left' is < 0}} in negative_left_operand_symbolic()
33 if (left >= 0) in negative_left_operand_symbolic()
35 return left >> right; in negative_left_operand_symbolic()
36 // expected-warning@-1 {{Left operand is negative in right shift}} in negative_left_operand_symbolic()
37 …// expected-note@-2 {{The result of right shift is undefined because the left operand is negative}} in negative_left_operand_symbolic()
46 // expected-warning@-1 {{Left operand is negative in left shift}} in negative_left_operand_compound()
[all …]
H A Dbitwise-shift-common.c28 // expected-warning@-1 {{Right operand is negative in left shift}} in negative_right_operand_literal()
29 …// expected-note@-2 {{The result of left shift is undefined because the right operand is negative}} in negative_right_operand_literal()
32 int negative_right_operand_symbolic(int left, int right) { in negative_right_operand_symbolic() argument
37 return left >> right; in negative_right_operand_symbolic()
48 // expected-warning@-1 {{Right operand is negative in left shift}} in negative_right_operand_compound()
49 …// expected-note@-2 {{The result of left shift is undefined because the right operand is negative}} in negative_right_operand_compound()
57 // expected-warning@-1 {{Left shift by '32' overflows the capacity of 'int'}} in too_large_right_operand_literal()
58 …// expected-note@-2 {{The result of left shift is undefined because the right operand '32' is not … in too_large_right_operand_literal()
63 // expected-note@+3 {{Left side of '||' is false}} in too_large_right_operand_exact_symbolic()
69 // expected-warning@-1 {{Left shift by '34' overflows the capacity of 'int'}} in too_large_right_operand_exact_symbolic()
[all …]
/llvm-project/llvm/docs/_static/
H A Dllvm.css15 border-collapse: collapse; margin-top: 1em; margin-left: 1em;
33 padding-left: 8pt;
38 h1, .doc_title, .title { text-align: left; font-size: 25pt }
44 text-align: left; font-size: 12pt;
53 .doc_author { text-align: left; font-weight: bold; padding-left: 20pt }
54 .doc_text { text-align: left; padding-left: 20pt; padding-right: 10pt }
56 .doc_footer { text-align: left; padding: 0 0 0 0 }
81 h2+div, h2+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
82 h3+div, h3+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
83 h4+div, h4+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
[all …]
/llvm-project/flang/docs/_static/
H A Dllvm.css15 border-collapse: collapse; margin-top: 1em; margin-left: 1em;
33 padding-left: 8pt;
38 h1, .doc_title, .title { text-align: left; font-size: 25pt }
44 text-align: left; font-size: 12pt;
53 .doc_author { text-align: left; font-weight: bold; padding-left: 20pt }
54 .doc_text { text-align: left; padding-left: 20pt; padding-right: 10pt }
56 .doc_footer { text-align: left; padding: 0 0 0 0 }
81 h2+div, h2+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
82 h3+div, h3+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
83 h4+div, h4+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
[all …]
/llvm-project/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll34 ; CHECK: # preds left : 2
35 ; CHECK: # succs left : 0
37 ; CHECK: # preds left : 2
38 ; CHECK: # succs left : 0
40 ; CHECK: # preds left : 1
41 ; CHECK: # succs left : 4
43 ; CHECK: # preds left : 2
44 ; CHECK: # succs left : 0
46 ; CHECK: # preds left : 3
47 ; CHECK: # succs left : 0
[all …]
/llvm-project/llvm/test/SafepointIRVerifier/
H A Duses-in-phi-nodes.ll6 br i1 %new_arg, label %left, label %right
8 left:
17 ; CHECK-NEXT: Def: %val = phi ptr addrspace(1) [ %arg, %left ], [ %arg, %right ]
19 %val = phi ptr addrspace(1) [ %arg, %left ], [ %arg, %right ]
26 br i1 %new_arg, label %left, label %right
28 left:
37 ; CHECK-NEXT: Def: %val = phi ptr addrspace(1) [ %arg, %left ], [ null, %right ]
39 %val = phi ptr addrspace(1) [ %arg, %left ], [ null, %right ]
46 br i1 %new_arg, label %left, label %right
48 left
[all...]
/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp42 const SUnit *pickBest(const SUnit *left, const SUnit *right);
130 // Return -1 if left has higher priority, 1 if right has higher priority.
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency() argument
135 int LHeight = (int)left->getHeight(); in BUCompareLatency()
148 int LDepth = left->getDepth(); in BUCompareLatency()
151 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum in BUCompareLatency()
156 if (left->Latency != right->Latency) in BUCompareLatency()
157 return left->Latency > right->Latency ? 1 : -1; in BUCompareLatency()
162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest() argument
169 int spread = (int)left in pickBest()
[all...]
/llvm-project/llvm/test/Transforms/Inline/
H A Dinline-funclets.ll241 to label %noinfo.root.cont unwind label %noinfo.left
253 noinfo.left:
254 %noinfo.left.pad = cleanuppad within %noinfo.root.pad []
255 invoke void @g() [ "funclet"(token %noinfo.left.pad) ]
256 to label %unreachable unwind label %noinfo.left.child
262 noinfo.left.child:
263 …%noinfo.left.child.cs = catchswitch within %noinfo.left.pad [label %noinfo.left.child.catch] unwin…
267 noinfo.left.child.catch:
268 %noinfo.left.child.pad = catchpad within %noinfo.left.child.cs []
269 call void @g() [ "funclet"(token %noinfo.left.child.pad) ]
[all …]
/llvm-project/llvm/test/CodeGen/AArch64/
H A Dmisched-bundle.mir6 # CHECK-NEXT: # preds left : 0
7 # CHECK-NEXT: # succs left : 4
8 # CHECK-NEXT: # rdefs left : 0
19 # CHECK-NEXT: # preds left : 0
20 # CHECK-NEXT: # succs left : 9
21 # CHECK-NEXT: # rdefs left : 0
37 # CHECK-NEXT: # preds left : 0
38 # CHECK-NEXT: # succs left : 3
39 # CHECK-NEXT: # rdefs left : 0
49 # CHECK-NEXT: # preds left
[all...]
H A Dneon-bitselect.ll6 ; Check that an expanded vbsl(vneg(pre_cond), left, right) lowers to a VBSL
14 define <4 x i32> @vbsl_neg_cond_0000(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 {
22 %left_bits_0 = and <4 x i32> %neg_cond, %left
28 define <4 x i32> @vbsl_neg_cond_0001(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 {
36 %left_bits_1 = and <4 x i32> %left, %neg_cond
42 define <4 x i32> @vbsl_neg_cond_0010(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 {
50 %left_bits_0 = and <4 x i32> %neg_cond, %left
56 define <4 x i32> @vbsl_neg_cond_0011(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 {
64 %left_bits_1 = and <4 x i32> %left, %neg_cond
70 define <4 x i32> @vbsl_neg_cond_0100(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 {
[all …]
/llvm-project/clang/test/Analysis/exploded-graph-rewriter/
H A Dprogram_state_traits.dot7 // CHECK-SAME: <td align="left"><b>#0 Call</b></td>
8 // CHECK-SAME: <td align="left" colspan="2">
14 // CHECK-SAME: <td align="left"><i>S870</i></td>
15 // CHECK-SAME: <td align="left">
20 // CHECK-SAME: <td align="left">S s;</td>
21 // CHECK-SAME: <td align="left">&amp;s</td>
60 // CHECK-SAME: <td align="left"><b>#0 Call</b></td>
61 // CHECK-SAME: <td align="left" colspan="2">
67 // CHECK-SAME: <td align="left"><i>S895</i></td>
68 // CHECK-SAME: <td align="left">
[all …]
H A Dprogram_points.dot4 // CHECK-SAME: <table border="0" align="left" width="0">
8 // CHECK-SAME: <td align="left" width="0">
11 // CHECK-SAME: <td align="left">
18 // CHECK-SAME: <td align="left" width="0">
21 // CHECK-SAME: <td align="left">
55 // CHECK-SAME: <table border="0" align="left" width="0">
57 // CHECK-SAME: <td align="left" width="0">
60 // CHECK-SAME: <td align="left" width="0">
63 // CHECK-SAME: <td align="left"><i>S3</i></td>
64 // CHECK-SAME: <td align="left">
[all …]
H A Dobjects_under_construction.cpp15 // CHECK-SAME: <td align="left"><b>#0 Call</b></td> in test()
16 // CHECK-SAME: <td align="left" colspan="2"> in test()
21 // CHECK-SAME: <td align="left"><i>S{{[0-9]*}}</i></td> in test()
22 // CHECK-SAME: <td align="left"><font color="darkgreen"><i> in test()
25 // CHECK-SAME: <td align="left">S()</td> in test()
26 // CHECK-SAME: <td align="left">&amp;s</td> in test()
29 // CHECK-SAME: <td align="left"><i>S{{[0-9]*}}</i></td> in test()
30 // CHECK-SAME: <td align="left"><font color="darkgreen"><i> in test()
33 // CHECK-SAME: <td align="left">S()</td> in test()
34 // CHECK-SAME: <td align="left">&amp;s</td> in test()
[all …]
/llvm-project/llvm/test/CodeGen/WinEH/
H A Dwineh-no-demotion.ll18 to label %invoke.cont unwind label %left
24 left:
49 ; CHECK: %phi = phi i32 [ %x, %shared ], [ 0, %invoke.cont ], [ %x.for.left, %shared.for.left ]
61 to label %shared.cont unwind label %left
63 left:
87 ; CHECK: %x1 = phi i32 [ %x.for.left, %shared.for.left ], [ %x, %shared ]
99 to label %invoke.cont1 unwind label %left
105 left:
117 %phi = phi i32 [ 1, %left ], [ 0, %right ], [ -1, %right.other ]
124 ; CHECK: %phi.for.left = phi i32 [ 1, %left ]
[all …]
/llvm-project/llvm/include/llvm/ADT/
H A DIntervalTree.h51 // void insert(PointT Left, PointT Right, ValueT Value);
94 // IL: All intervals whose left value are completely to the left of the middle
98 // LS: Left subtree.
127 // IL: Intervals to the left (in ascending order by beginning point).
159 // void insert(PointT Left, PointT Right, ValueT Value);
160 // Left, Right: the interval left and right limits.
194 /// An interval data composed by a \a Left and \a Right points and an
204 PointType Left;
210 IntervalData(PointType Left, PointType Right, ValueType Value) in IntervalData() argument
211 : Left(Left), Right(Right), Value(Value) { in IntervalData()
[all …]
/llvm-project/flang/test/Semantics/
H A Dshape.f9011 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
12 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
16 !ERROR: Dimension 1 of left operand has extent 0, but right operand has extent 1
17 !ERROR: Dimension 1 of left operand has extent 0, but right operand has extent 1
24 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
25 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
29 !ERROR: Dimension 1 of left operand has extent 0, but right operand has extent 1
30 !ERROR: Dimension 1 of left operand has extent 0, but right operand has extent 1
37 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
38 !ERROR: Dimension 1 of left operand has extent 1, but right operand has extent 0
[all …]

12345678910>>...92