/llvm-project/polly/include/polly/Support/ |
H A D | ISLOperators.h | 22 inline isl::pw_aff operator+(isl::pw_aff Left, isl::pw_aff Right) { 23 return Left.add(Right); 26 inline isl::pw_aff operator+(isl::val ValLeft, isl::pw_aff Right) { 27 isl::pw_aff Left(Right.domain(), ValLeft); 28 return Left.add(Right); 32 isl::pw_aff Right(Left.domain(), ValRight); 33 return Left.add(Right); 36 inline isl::pw_aff operator+(long IntLeft, isl::pw_aff Right) { 37 isl::ctx Ctx = Right.ctx(); 39 isl::pw_aff Left(Right.domain(), ValLeft); [all …]
|
/llvm-project/clang/test/Analysis/ |
H A D | bitwise-shift-common.c | 23 // TEST NEGATIVE RIGHT OPERAND 28 // 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 33 // expected-note@+2 {{Assuming 'right' is < 0}} in negative_right_operand_symbolic() 35 if (right >= 0) in negative_right_operand_symbolic() 37 return left >> right; in negative_right_operand_symbolic() 38 // expected-warning@-1 {{Right operand is negative in right shift}} in negative_right_operand_symbolic() 39 …// expected-note@-2 {{The result of right shift is undefined because the right operand is negative… in negative_right_operand_symbolic() 48 // expected-warning@-1 {{Right operand is negative in left shift}} in negative_right_operand_compound() [all …]
|
H A D | bitwise-shift-sanity-checks.c | 35 // In shifts the type of the right operand does not affect the type of the in shift_unsigned() 44 int no_info(int left, int right) { in no_info() argument 45 return left << right; // no-warning in no_info() 48 int all_okay(int left, int right) { in all_okay() argument 49 if (left < 0 || right < 0) in all_okay() 51 return (left << right) + (left >> right); // no-warning in all_okay() 57 int signed_arithmetic_good(int left, int right) { in signed_arithmetic_good() argument 58 if (right >= 32) in signed_arithmetic_good() 60 return left << (right - 32); in signed_arithmetic_good() 61 // expected-warning@-1 {{Right operand is negative in left shift}} in signed_arithmetic_good() [all …]
|
/llvm-project/llvm/test/Transforms/InstCombine/ |
H A D | phi-of-insertvalues.ll | 11 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]] 14 ; CHECK: right: 17 …: [[VAL_LEFT_PN:%.*]] = phi i32 [ [[VAL_LEFT:%.*]], [[LEFT]] ], [ [[VAL_RIGHT:%.*]], [[RIGHT]] ] 22 br i1 %c, label %left, label %right 28 right: 33 %r = phi { i32, i32 } [ %i0, %left ], [ %i1, %right ] 41 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]] 46 ; CHECK: right: 50 ; CHECK-NEXT: [[R:%.*]] = phi { i32, i32 } [ [[I0]], [[LEFT]] ], [ [[I1]], [[RIGHT]] ] 54 br i1 %c, label %left, label %right [all …]
|
H A D | phi-extractvalue.ll | 11 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]] 14 ; CHECK: right: 17 …G_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIGHT:%.*]], [[RIGHT]] ] 22 br i1 %c, label %left, label %right 28 right: 33 %r = phi i32 [ %i0, %left ], [ %i1, %right ] 41 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]] 46 ; CHECK: right: 50 ; CHECK-NEXT: [[R:%.*]] = phi i32 [ [[I0]], [[LEFT]] ], [ [[I1]], [[RIGHT]] ] 54 br i1 %c, label %left, label %right [all …]
|
H A D | phi-aware-aggregate-reconstruction.ll | 19 ; CHECK-NEXT: br i1 [[C:%.*]], label [[LEFT:%.*]], label [[RIGHT:%.*]] 23 ; CHECK: right: 27 ; CHECK-NEXT: [[AGG_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIGHT:%.*]], [[RIGHT]] ] 32 br i1 %c, label %left, label %right 40 right: 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:%.*]] 63 ; CHECK: right: 67 ; CHECK-NEXT: [[AGG_LEFT_PN:%.*]] = phi { i32, i32 } [ [[AGG_LEFT:%.*]], [[LEFT]] ], [ [[AGG_RIGHT:%.*]], [[RIGHT]] ] [all...] |
/llvm-project/llvm/test/Analysis/BlockFrequencyInfo/ |
H A D | irreducible.ll | 168 br i1 %x, label %left, label %right, !prof !4 172 br i1 %x, label %right, label %loop.end, !prof !5 174 right: 175 ; CHECK-NEXT: right: float = 8.0, 199 br i1 %x, label %a.left, label %a.right, !prof !7 203 br i1 %x, label %a.right, label %exit, !prof !6 205 a.right: 206 ; CHECK-NEXT: a.right: float = 1.5, 211 br i1 %x, label %b.left, label %b.right, !prof !7 215 br i1 %x, label %b.right, label %exit, !prof !8 [all …]
|
/llvm-project/llvm/test/SafepointIRVerifier/ |
H A D | uses-in-phi-nodes.ll | 6 br i1 %new_arg, label %left, label %right 12 right: 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 32 right: 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 52 right [all...] |
/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 42 const SUnit *pickBest(const SUnit *left, const SUnit *right); 92 // scheduled right before its predecessors that it doesn't lengthen in getNodePriority() 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 136 int RHeight = (int)right->getHeight(); in BUCompareLatency() 149 int RDepth = right->getDepth(); in BUCompareLatency() 152 << ") depth " << LDepth << " vs SU (" << right->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 [all...] |
/llvm-project/llvm/test/CodeGen/AArch64/GlobalISel/ |
H A D | postlegalizer-lowering-shuf-to-ins.mir | 32 %right:_(<2 x s32>) = COPY $d1 33 %shuf:_(<2 x s32>) = G_SHUFFLE_VECTOR %left(<2 x s32>), %right, shufflemask(0, 0) 62 %right:_(<2 x s32>) = COPY $d1 63 %shuf:_(<2 x s32>) = G_SHUFFLE_VECTOR %left(<2 x s32>), %right, shufflemask(1, 1) 85 ; CHECK: %right:_(<2 x s32>) = COPY $d1 87 ; CHECK: [[EVEC:%[0-9]+]]:_(s32) = G_EXTRACT_VECTOR_ELT %right(<2 x s32>), [[C]](s64) 93 %right:_(<2 x s32>) = COPY $d1 94 %shuf:_(<2 x s32>) = G_SHUFFLE_VECTOR %left(<2 x s32>), %right, shufflemask(0, 3) 110 ; Matched M[1] = 1 + 2 -> G_INSERT_VECTOR_ELT should use %right. 117 ; CHECK: %right:_(<2 x s32>) = COPY $d1 [all …]
|
/llvm-project/llvm/test/Transforms/MergeFunc/ |
H A D | crash2.ll | 21 call void @right(i64 %p) 22 call void @right(i64 %p) 23 call void @right(i64 %p) 24 call void @right(i64 %p) 30 call void @right(i64 %p) 31 call void @right(i64 %p) 32 call void @right(i64 %p) 33 call void @right(i64 %p) 40 call void @right(i64 %p) 41 call void @right(i64 %p) [all …]
|
/llvm-project/clang/lib/Format/ |
H A D | TokenAnnotator.cpp | 199 // tokens to prevent splitting right shift operators and potentially in parseAngle() 2753 // If there is an identifier (or with a few exceptions a keyword) right in rParenEndsCast() 2761 // Certain other tokens right before the parentheses are also signals that in rParenEndsCast() 3026 // After right braces, star tokens are likely to be pointers to struct, in determineStarAmpUsage() 3060 // Thus, having an identifier on the right-hand side indicates a binary in determinePlusMinusCaretUsage() 3295 // intervene so that the fake right paren is inserted correctly. 4219 const FormatToken &Right = Tok; in splitPenalty() 4226 if (Right.isOneOf(Keywords.kw_extends, Keywords.kw_throws)) in splitPenalty() 4228 if (Right.is(Keywords.kw_implements)) in splitPenalty() 4233 if (Right in splitPenalty() 4109 const FormatToken &Right = Tok; splitPenalty() local [all...] |
/llvm-project/llvm/test/Transforms/Inline/ |
H A D | inline-funclets.ll | 278 to label %unreachable unwind label %noinfo.right 283 noinfo.right: 284 …%noinfo.right.cs = catchswitch within %noinfo.root.pad [label %noinfo.right.catch] unwind to caller 288 noinfo.right.catch: 289 %noinfo.right.pad = catchpad within %noinfo.right.cs [] 290 invoke void @g() [ "funclet"(token %noinfo.right.pad) ] 291 to label %unreachable unwind label %noinfo.right.child 297 noinfo.right.child: 298 %noinfo.right.child.pad = cleanuppad within %noinfo.right.pad [] 299 call void @g() [ "funclet"(token %noinfo.right.child.pad) ] [all …]
|
/llvm-project/llvm/test/CodeGen/AArch64/ |
H A D | neon-bitselect.ll | 6 ; 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 { 23 %right_bits_0 = and <4 x i32> %min_cond, %right 28 define <4 x i32> @vbsl_neg_cond_0001(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 { 37 %right_bits_0 = and <4 x i32> %min_cond, %right 42 define <4 x i32> @vbsl_neg_cond_0010(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 { 51 %right_bits_1 = and <4 x i32> %right, %min_cond 56 define <4 x i32> @vbsl_neg_cond_0011(<4 x i32> %pre_cond, <4 x i32> %left, <4 x i32> %right) #0 { 65 %right_bits_1 = and <4 x i32> %right, %min_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/CodeGenCXX/ |
H A D | microsoft-abi-multiple-nonvirtual-inheritance.cpp | 7 struct Right { struct 8 virtual void right(); 11 struct ChildNoOverride : Left, Right { 14 struct ChildOverride : Left, Right { 16 virtual void right(); 65 child->right(); in call_right_no_override() 66 // When calling a right base's virtual method, one needs to adjust 'this' at in call_right_no_override() 78 void ChildOverride::right() { in right() function in ChildOverride 79 // CHECK-LABEL: define dso_local x86_thiscallcc void @"?right@ChildOverride@@UAEXXZ"(ptr in right() 81 // ChildOverride::right gets 'this' cast to Right* in ECX (i.e. this+4) so we in right() [all …]
|
H A D | microsoft-abi-this-nullable.cpp | 8 struct Right { struct 9 virtual void right(); 12 struct ChildNoOverride : Left, Right { 15 struct ChildOverride : Left, Right { 17 virtual void right(); 30 child->right(); in call_right_no_override() 31 // When calling a right base's virtual method, one needs to adjust `this` at the caller site. in call_right_no_override() 39 void ChildOverride::right() { in right() function in ChildOverride 44 child->right(); in call_right_override() 47 // CHECK: %[[RIGHT:.*]] = getelementptr inbounds i8, ptr %[[CHILD]], i32 4 in call_right_override() [all …]
|
H A D | microsoft-abi-methods.cpp | 20 // Make sure that the call uses the right calling convention: in call_simple_method() 24 // Make sure that the definition uses the right calling convention: in call_simple_method() 32 // Make sure that the call uses the right calling convention: in call_cdecl_method() 36 // Make sure that the definition uses the right calling convention: in call_cdecl_method() 44 // Make sure that the call uses the right calling convention: in call_vararg_method() 48 // Make sure that the definition uses the right calling convention: in call_vararg_method() 54 // Make sure that the call uses the right calling convention: in call_static_method() 58 // Make sure that the definition uses the right calling convention: in call_static_method() 73 // the right calling convention: in constructors() 79 // the right calling convention: in constructors() [all …]
|
/llvm-project/llvm/include/llvm/ADT/ |
H A D | IntervalTree.h | 51 // void insert(PointT Left, PointT Right, ValueT Value); 96 // IR: All intervals whose right value are completely to the right of the 99 // RS: Right subtree. 128 // IR: Intervals to the right (in descending order by ending 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 205 PointType Right; variable 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 D | shape.f90 | 11 !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 …]
|
/llvm-project/clang/test/SemaCXX/ |
H A D | cxx1y-variable-templates_in_class.cpp | 14 template<typename T, typename T0> static CONST T right = T(100); member in A 15 template<typename T> static CONST T right<T,int> = 5; 16 template<typename T> CONST int right<int,T>; // expected-error {{non-static data member 'right' cannot be declared as a template}} 17 template<typename T> CONST float right<float,T> = 5; // expected-error {{non-static data member 'right' cannot be declared as a template}} 24 template<> CONST int right<int,int> = 7; 25 template<> CONST float right<float,int>; 26 template static CONST int right<int,int>; // expected-error {{expected '<' after 'template'}} member in A 31 template<typename T, typename T0> static CONST T right member in out_of_line::B0 35 template CONST int B0::right<int,int>; // expected-warning {{has no effect}} global() member in out_of_line::B0 37 template CONST int B0::right<int,float>; // expected-warning {{has no effect}} global() member in out_of_line::B0 40 template<typename T, typename T0> static CONST T right; global() member in out_of_line::B1 43 template<typename T, typename T0> CONST T B1::right = T(100); global() member in out_of_line::B1 47 template<typename T, typename T0> static CONST T right = T(100); // expected-note {{previous initialization is here}} global() member in out_of_line::B2 50 template<typename T, typename T0> CONST T B2::right = T(100); // expected-error {{static data member 'right' already has an initializer}} global() member in out_of_line::B2 54 template<typename T, typename T0> static CONST T right = T(100); global() member in out_of_line::B3 57 template<typename T, typename T0> CONST T B3::right; global() member in out_of_line::B3 167 template<typename T, typename T0> static constexpr T right = T(100); global() member in constexpred::A 174 template static constexpr int right<int,int>; // expected-error {{expected '<' after 'template'}} global() member in constexpred::A [all...] |
/llvm-project/llvm/test/CodeGen/WinEH/ |
H A D | wineh-no-demotion.ll | 29 cleanupret from %0 unwind label %right 31 right: 68 cleanupret from %0 unwind label %right 70 right: 103 to label %exit unwind label %right 109 right: 111 br i1 %x, label %shared, label %right.other 113 right.other: 117 %phi = phi i32 [ 1, %left ], [ 0, %right ], [ -1, %right.other ] 121 ; CHECK: %phi = phi i32 [ 0, %right ], [ -1, %right.other ]
|
/llvm-project/llvm/test/Transforms/JumpThreading/ |
H A D | implied-cond.ll | 11 br i1 %c0, label %left, label %right 15 ; CHECK: br i1 %c0, label %left0, label %right 23 br i1 %c1, label %left0, label %right 29 right: 41 br i1 %c0, label %left, label %right 45 ; CHECK: br i1 %c0, label %left0, label %right 53 br i1 %c1, label %left0, label %right 59 right: 69 ; CHECK: br i1 %c0, label %cont, label %right 71 ; CHECK: br i1 %c, label %left0, label %right [all …]
|
/llvm-project/openmp/docs/_themes/llvm-openmp-theme/static/ |
H A D | agogo.css_t | 30 margin-right: auto; 56 .right { 57 float: right; 157 float: right; 179 padding-right: 2em; 277 float: right; 332 border-right: 5px solid {{ theme_headerlinkcolor }}; 336 border-right: none; 362 div.footer .right { 363 text-align: right; [all …]
|
/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | HTMLLogger.css | 22 padding-right: 0.5em; 41 text-align: right; 56 text-align: right; 58 border-right: 1px solid #008; 79 padding-right: 0.2em; 109 text-align: right; 110 padding-right: 2px; 112 border-right: 1px solid #888; 113 margin-right: 8px; 116 border-right: 4px solid black; [all …]
|
/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | BitwiseShiftChecker.cpp | 34 enum class OperandSide { Left, Right }; enumerator 44 {"", "right operand of bit shift is less than "}, 45 {"left operand of bit shift is non-negative", " and right operand is less than "}, 46 {"right operand of bit shift is non-negative", " but less than "}, 47 {"both operands of bit shift are non-negative", " and right operand is less than "} 95 StringRef shiftDir() const { return isLeftShift() ? "left" : "right"; } in shiftDir() 101 // Report a bug if the right operand is >= the bit width of the type of the in run() 108 // Report a bug if the right operand is negative: in run() 109 if (BugReportPtr BR = checkOperandNegative(OperandSide::Right)) { in run() 170 if (assumeRequirement(OperandSide::Right, BO_L in checkOvershift() 173 const SVal Right = Ctx.getSVal(operandExpr(OperandSide::Right)); checkOvershift() local 271 const SVal Right = Ctx.getSVal(Op->getRHS()); checkLeftShiftOverflow() local [all...] |