| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SIOptimizeExecMaskingPreRA.cpp | 131 auto *And = in optimizeVcndVcmpPair() local
133 if (!And || And->getOpcode() != AndOpc || in optimizeVcndVcmpPair()
134 !And->getOperand(1).isReg() || !And->getOperand(2).isReg()) in optimizeVcndVcmpPair()
137 MachineOperand *AndCC = &And->getOperand(1); in optimizeVcndVcmpPair()
141 AndCC = &And->getOperand(2); in optimizeVcndVcmpPair()
151 Cmp->getParent() != And->getParent()) in optimizeVcndVcmpPair()
199 << *And); in optimizeVcndVcmpPair()
202 BuildMI(MBB, *And, And->getDebugLoc(), TII->get(Andn2Opc), in optimizeVcndVcmpPair()
203 And->getOperand(0).getReg()) in optimizeVcndVcmpPair()
206 MachineOperand &AndSCC = And->getOperand(3); in optimizeVcndVcmpPair()
[all …]
|
| H A D | SILowerControlFlow.cpp | 243 MachineInstr *And = in emitIf() local
248 LV->replaceKillInstruction(Cond.getReg(), MI, *And); in emitIf()
250 setImpSCCDefDead(*And, true); in emitIf()
287 LIS->ReplaceMachineInstrInMaps(MI, *And); in emitIf()
330 MachineInstr *And = BuildMI(MBB, ElsePt, DL, TII->get(AndOpc), DstReg) in emitElse() local
335 LIS->InsertMachineInstrInMaps(*And); in emitElse()
390 MachineInstr *And = nullptr, *Or = nullptr; in emitIfBreak() local
393 And = BuildMI(MBB, &MI, DL, TII->get(AndOpc), AndReg) in emitIfBreak()
397 LV->replaceKillInstruction(MI.getOperand(1).getReg(), MI, *And); in emitIfBreak()
414 if (And) in emitIfBreak()
[all …]
|
| H A D | AMDGPUAtomicOptimizer.cpp | 127 case AtomicRMWInst::And: in visitAtomicRMWInst()
184 Op = AtomicRMWInst::And; in visitIntrinsicInst()
260 case AtomicRMWInst::And: in buildNonAtomicBinOp()
261 return B.CreateBinOp(Instruction::And, LHS, RHS); in buildNonAtomicBinOp()
444 case AtomicRMWInst::And: in getIdentityValueForAtomicOp()
576 case AtomicRMWInst::And: in optimizeAtomic()
673 case AtomicRMWInst::And: in optimizeAtomic()
|
| /llvm-project-15.0.7/clang/lib/Analysis/ |
| H A D | ThreadSafetyLogical.cpp | 44 case LExpr::And: in implies()
49 return RNeg ? RightOrOperator(cast<And>(RHS)) in implies()
50 : RightAndOperator(cast<And>(RHS)); in implies()
69 case LExpr::And: in implies()
74 return LNeg ? LeftAndOperator(cast<And>(LHS)) in implies()
75 : LeftOrOperator(cast<And>(LHS)); in implies()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | GuardUtils.cpp | 87 auto *And = dyn_cast<Instruction>(Cond); in parseWidenableBranch() local
88 if (!And) in parseWidenableBranch()
94 WC = &And->getOperandUse(0); in parseWidenableBranch()
95 C = &And->getOperandUse(1); in parseWidenableBranch()
101 WC = &And->getOperandUse(1); in parseWidenableBranch()
102 C = &And->getOperandUse(0); in parseWidenableBranch()
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyLogical.h | 25 And, enumerator
68 class And : public BinOp {
70 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {} in And() function
72 static bool classof(const LExpr *E) { return E->kind() == LExpr::And; } in classof()
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/unittests/ |
| H A D | DexTests.cpp | 80 And->advanceTo(0); in TEST()
81 EXPECT_EQ(And->peek(), 0U); in TEST()
82 And->advanceTo(5); in TEST()
83 EXPECT_EQ(And->peek(), 7U); in TEST()
84 And->advanceTo(10); in TEST()
86 And->advanceTo(42); in TEST()
88 And->advanceTo(8999); in TEST()
90 And->advanceTo(9001); in TEST()
100 EXPECT_EQ(And->peek(), 7U); in TEST()
101 And->advanceTo(300); in TEST()
[all …]
|
| /llvm-project-15.0.7/mlir/lib/TableGen/ |
| H A D | Predicate.cpp | 93 And, enumerator
125 .Case("PredCombinerAnd", PredCombinerKind::And) in getPredCombinerKind()
249 if (node->kind != PredCombinerKind::And && in propagateGroundTruth()
262 auto collapseKind = node->kind == PredCombinerKind::And in propagateGroundTruth()
265 auto eraseKind = node->kind == PredCombinerKind::And in propagateGroundTruth()
269 node->kind == PredCombinerKind::And ? knownFalsePreds : knownTruePreds; in propagateGroundTruth()
271 node->kind == PredCombinerKind::And ? knownTruePreds : knownFalsePreds; in propagateGroundTruth()
332 if (root.kind == PredCombinerKind::And) in getCombinedCondition()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
| H A D | cnstr_with_any.compile.pass.cpp | 24 struct And : std::true_type { }; struct
27 struct And<P1, Pn...> struct
28 : std::conditional<P1::value, And<Pn...>, std::false_type>::type
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | nonnull-global-constants.mm | 66 // And for types.
89 // And for NSString *.
97 // And for CFBooleanRefs.
103 // And again, only for const one.
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonPatternsHVX.td | 420 def: OpR_RR_pat<V6_vand, And, VecI8, HVI8>;
421 def: OpR_RR_pat<V6_vand, And, VecI16, HVI16>;
422 def: OpR_RR_pat<V6_vand, And, VecI32, HVI32>;
765 def: OpR_RR_pat<V6_pred_and, And, VecQ8, HQ8>;
766 def: OpR_RR_pat<V6_pred_and, And, VecQ16, HQ16>;
767 def: OpR_RR_pat<V6_pred_and, And, VecQ32, HQ32>;
775 def: OpR_RR_pat<V6_pred_and_n, VNot2<And, qnot>, VecQ8, HQ8>;
776 def: OpR_RR_pat<V6_pred_and_n, VNot2<And, qnot>, VecQ16, HQ16>;
777 def: OpR_RR_pat<V6_pred_and_n, VNot2<And, qnot>, VecQ32, HQ32>;
792 def: AccRRR_pat<V6_veqb_and, And, seteq, HQ8, HVI8, HVI8>;
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1759 match(And->getOperand(1), m_One())) in foldICmpAndConstConst()
1768 if (!And->hasOneUse()) in foldICmpAndConstConst()
1781 KnownBits Know = computeKnownBits(And->getOperand(0), 0, And); in foldICmpAndConstConst()
1829 Value *Or = And->getOperand(0); in foldICmpAndConstConst()
1834 if (And->hasOneUse()) in foldICmpAndConstConst()
1885 Value *X = And->getOperand(0); in foldICmpAndConstant()
1886 Value *Y = And->getOperand(1); in foldICmpAndConstant()
2231 Value *And = in foldICmpShlConstant() local
3218 case Instruction::And: { in foldICmpBinOpEqualityWithConstant()
3406 case Instruction::And: in foldICmpBinOpWithConstant()
[all …]
|
| H A D | InstCombineAtomicRMW.cpp | 45 case AtomicRMWInst::And: in isIdempotentRMW()
89 case AtomicRMWInst::And: in isSaturating()
|
| H A D | InstCombineAndOrXor.cpp | 1326 (Opcode == Instruction::And) ? Instruction::Or : Instruction::And; in matchDeMorgansLaws()
1478 assert(I.getOpcode() == Instruction::And); in foldAndToXor()
1551 Value *Op0 = And.getOperand(0), *Op1 = And.getOperand(1); in narrowMaskedBinOp()
1564 Type *Ty = And.getType(); in narrowMaskedBinOp()
1593 (Opcode == Instruction::And) ? Instruction::Or : Instruction::And; in foldComplexAndOrPatterns()
1791 And->takeName(Op0); in visitAnd()
1805 And->takeName(Op0); in visitAnd()
1880 return new ZExtInst(And, Ty); in visitAnd()
3402 case Instruction::And: in sinkNotIntoOtherHandOfAndOrOr()
3406 NewOpc = Instruction::And; in sinkNotIntoOtherHandOfAndOrOr()
[all …]
|
| /llvm-project-15.0.7/llvm/bindings/python/ |
| H A D | README.txt | 63 And run:
67 And try to keep the number of violations to a minimum.
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | MIPatternMatch.h | 255 template <typename... Preds> struct And { struct
263 struct And<Pred, Preds...> : And<Preds...> { argument
265 And(Pred &&p, Preds &&... preds)
266 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
270 return P.match(MRI, src) && And<Preds...>::match(MRI, src);
292 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
293 return And<Preds...>(std::forward<Preds>(preds)...);
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/modernize/ |
| H A D | raw-string-literal.rst | 18 const char *const Bell{"Hello!\a And welcome!"};
31 const char *const Bell{"Hello!\a And welcome!"};
|
| /llvm-project-15.0.7/llvm/lib/Target/RISCV/ |
| H A D | RISCVCodeGenPrepare.cpp | 110 if (BO->getOpcode() != Instruction::And) in optimizeAndExt()
168 else if (I.getOpcode() == Instruction::And) in runOnFunction()
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | OpBase.td | 479 : Type<And<[
512 Type<And<[containerPred,
520 Type<And<[containerPred,
561 And<[IsVectorTypePred,
584 And<[IsVectorTypePred,
811 And<[
1194 Attr<And<[
1311 let predicate = And<[
1407 And<[
1608 And<[
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 209 return Opcode == And || Opcode == Or || Opcode == Xor;
529 return Opcode == And || Opcode == Or || Opcode == Xor ||
545 case And: case Or: case Xor:
560 return Opcode == And || Opcode == Or;
|
| /llvm-project-15.0.7/clang/include/clang/Basic/ |
| H A D | OperatorPrecedence.h | 35 And = 8, // & enumerator
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-ranlib/ |
| H A D | bad-usage.test | 2 ## And that we return non-zero.
|
| /llvm-project-15.0.7/lld/test/ELF/ |
| H A D | dynamic-list.s | 12 ## And now using quoted strings (the output is the same since it does not
18 ## And now using --export-dynamic-symbol.
|
| /llvm-project-15.0.7/llvm/test/Transforms/JumpThreading/ |
| H A D | threadable-edge-cast.ll | 36 %And = and i32 %A, 1
37 %cond = trunc i32 %And to i1
|
| /llvm-project-15.0.7/llvm/unittests/IR/ |
| H A D | PatternMatch.cpp | 1644 Value *And = IRB.CreateSelect(X, Y, F); in TEST_F() local
1649 EXPECT_TRUE(match(And, m_LogicalAnd(m_Value(), m_Value()))); in TEST_F()
1650 EXPECT_TRUE(match(And, m_c_LogicalAnd(m_Value(), m_Value()))); in TEST_F()
1651 EXPECT_FALSE(match(And, m_LogicalOr(m_Value(), m_Value()))); in TEST_F()
1652 EXPECT_FALSE(match(And, m_c_LogicalOr(m_Value(), m_Value()))); in TEST_F()
1655 EXPECT_TRUE(match(And, m_LogicalAnd(m_Specific(X), m_Value()))); in TEST_F()
1656 EXPECT_TRUE(match(And, m_LogicalAnd(m_Value(), m_Specific(Y)))); in TEST_F()
1659 EXPECT_FALSE(match(And, m_LogicalAnd(m_Specific(Y), m_Value()))); in TEST_F()
1660 EXPECT_FALSE(match(And, m_LogicalAnd(m_Value(), m_Specific(X)))); in TEST_F()
1667 EXPECT_TRUE(match(And, m_c_LogicalAnd(m_Specific(X), m_Value()))); in TEST_F()
[all …]
|