| /llvm-project-15.0.7/mlir/lib/Conversion/PDLToPDLInterp/ |
| H A D | PredicateTree.cpp | 774 DenseSet<OrderedPredicate *> predicates; member 814 } else if (list.predicates.find(*current) == list.predicates.end()) { in propagatePattern() 883 std::vector<PositionalPredicate> predicates) in generateMatcherTree() 884 : pattern(pattern), root(root), predicates(std::move(predicates)) {} in generateMatcherTree() 893 std::vector<PositionalPredicate> predicates; in generateMatcherTree() member 907 for (auto &predicate : patternAndPredList.predicates) { in generateMatcherTree() 923 for (auto &predicate : patternAndPredList.predicates) { in generateMatcherTree() 925 list.predicates.insert(orderedPredicate); in generateMatcherTree() 938 for (auto *predicate : list.predicates) in generateMatcherTree() 940 for (auto *predicate : list.predicates) in generateMatcherTree()
|
| /llvm-project-15.0.7/llvm/docs/GlobalISel/ |
| H A D | InstructionSelect.rst | 63 ``SDNode`` objects. PatLeafs that handle immediate predicates should be 66 There's no standard answer for other PatLeafs. Some standard predicates have 86 The following predicates are useful for porting ComplexPattern:
|
| H A D | Legalizer.rst | 76 limit the information available to the predicates to that which is safe to rely 77 on. Currently, the information available to the predicates that determine 205 The rule factories also have predicates in common: 212 User-supplied predicates can also be combined using ``all(P0, P1, ...)``.
|
| /llvm-project-15.0.7/llvm/include/llvm/Target/ |
| H A D | TargetInstrPredicate.td | 25 // predicates. Definition `MCInstPredicateExample` identifies instructions 50 // portability: users don't need to specify predicates in C++. As a consequence 89 // This class is used as a building block to define predicates on instruction 186 // A sequence of predicates. It is used as the base class for CheckAll, and 187 // CheckAny. It allows to describe compositions of predicates. 192 // Check that all of the predicates in `Preds` evaluate to true. 196 // Check that at least one of the predicates in `Preds` evaluates to true. 229 // Base class for function predicates. 254 // it is lowering predicates for MCInst or MachineInstr.
|
| /llvm-project-15.0.7/llvm/test/MC/Disassembler/Hexagon/ |
| H A D | cr.txt | 10 # Logical reductions on predicates 44 # Logical operations on predicates
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64SchedPredExynos.td | 14 // Auxiliary predicates. 25 // Exynos predicates.
|
| H A D | AArch64SchedPredAmpere.td | 14 // Auxiliary predicates.
|
| /llvm-project-15.0.7/libcxx/docs/DesignDocs/ |
| H A D | NoexceptPolicy.rst | 11 Second, user-provided functions, such as custom predicates or custom
|
| /llvm-project-15.0.7/mlir/lib/Dialect/SCF/Transforms/ |
| H A D | LoopPipelining.cpp | 265 SmallVector<Value> predicates(maxStage + 1, nullptr); in createKernel() local 274 predicates[i] = pred; in createKernel() 325 if (predicates[useStage]) { in createKernel() 326 newOp = predicateFn(newOp, predicates[useStage], rewriter); in createKernel()
|
| /llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchDag.h | 173 iterator_range<predicate_iterator> predicates() { in predicates() function 176 iterator_range<const_predicate_iterator> predicates() const { in predicates() function
|
| /llvm-project-15.0.7/llvm/test/TableGen/ |
| H A D | GlobalISelEmitter-PR39045.td | 4 // Both predicates should be tested
|
| H A D | MnemonicAlias.td | 36 // without checking any predicates.
|
| H A D | GlobalISelEmitterCustomPredicate.td | 3 // Verify that all MI predicates are enumerated. 5 // CHECK: // PatFrag predicates. 13 // Verify that we emit cases for all MI predicates.
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/darwin/ |
| H A D | dispatch-once-nonstatic.rst | 7 storage. The behavior of using ``dispatch_once_t`` predicates with automatic or
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/ |
| H A D | postra-sink-subregs.mir | 7 # 3. If-conversion predicates block %bb.1. Since $d1 (made of $r2 and $r3)
|
| /llvm-project-15.0.7/llvm/include/llvm/Target/GlobalISel/ |
| H A D | SelectionDAGCompat.td | 32 // SelectionDAG has one node for all loads and uses predicates to 35 // depending on the predicates on the node. 178 // complications that tablegen must take care of. For example, predicates such
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/intrinsics/ |
| H A D | cr.ll | 22 ; Logical reductions on predicates 38 ; Logical operations on predicates
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/GlobalISel/ |
| H A D | select-leaf-constant.mir | 4 # This is necessary to test that attribute-based rule predicates work and that
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | optsize.ll | 100 ; We do not want to generate SCEV predicates when optimising for size, because 102 ; checks. Not generating SCEV predicates can still result in vectorisation as 132 ; We do not want to generate SCEV predicates when optimising for size, because 134 ; checks. Not generating SCEV predicates can still result in vectorisation as
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | GlobalISelEmitter.cpp | 1694 for (auto &&Predicate : zip(predicates(), B.predicates())) { in isHigherPriorityThan() 1708 predicates().begin(), predicates().end(), 0, in countRendererFns() 2403 for (auto &&P : zip(predicates(), B.predicates())) { in isHigherPriorityThan() 2426 predicates().begin(), predicates().end(), 0, in countRendererFns() 2439 for (auto &P : predicates()) in getOpcodeMatcher() 2539 for (auto &OP : OM->predicates()) in optimize() 2554 for (auto &OP : OM->predicates()) in optimize() 6023 for (auto &OP : OM->predicates()) in optimize() 6044 for (auto &OP : OM->predicates()) in hasFirstCondition() 6060 for (auto &OP : OM->predicates()) in getFirstCondition() [all …]
|
| /llvm-project-15.0.7/mlir/test/mlir-tblgen/ |
| H A D | constraint-unique.td | 45 // OpC has the same type, attribute, successor, and region predicates but has 137 /// Test that the op with the same predicates but different with descriptions
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/Arithmetic/IR/ |
| H A D | ArithmeticBase.td | 31 // well as predicates that are always true or false.
|
| /llvm-project-15.0.7/llvm/test/Transforms/JumpThreading/ |
| H A D | thread-cmp.ll | 2 ; When simplify a branch based on LVI predicates, we should replace the
|
| /llvm-project-15.0.7/clang/docs/ |
| H A D | LibASTMatchers.rst | 19 LibASTMatchers provides a domain specific language to create predicates on 25 AST matchers are predicates on nodes in the AST. Matchers are created by
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | predicates.ll | 3 ; These tests make sure the compiler is optimizing branches using predicates
|