Home
last modified time | relevance | path

Searched refs:predicates (Results 1 – 25 of 44) sorted by relevance

12

/freebsd-13.1/contrib/googletest/googletest/docs/
H A DPumpManual.md56 // Foo$i does blah for $i-ary predicates.
75 // Foo0 does blah for 0-ary predicates.
81 // Foo1 does blah for 1-ary predicates.
87 // Foo2 does blah for 2-ary predicates.
93 // Foo3 does blah for 3-ary predicates.
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetInstrPredicate.td25 // 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.
H A DTargetSchedule.td115 // instructions which have any of the listed predicates in their Predicates
357 // Base class for scheduling predicates.
405 // of SchedWrite types under the conditions defined by its predicates.
416 // of SchedRead types under the conditions defined by its predicates.
H A DTarget.td414 // Pull in the common support for MCPredicate (portable scheduling predicates).
433 // List of predicates which will be turned into isel matching code.
497 // Predicates - List of predicates which will be turned into isel matching
650 /// instruction selection predicates. FastISel cannot handle such cases, but
693 /// predicates can be placed onto Instruction definitions.
701 /// every function change. Most predicates can leave this at '0'.
927 /// All operands which the MC layer classifies as predicates should inherit from
1459 /// and do allow Requires predicates, e.g.:
H A DTargetSelectionDAG.td758 // They can take arguments and have C++ predicates that control whether they
787 // Define a few pre-packaged predicates. This helps GlobalISel import
856 // (not an input pattern). These do not have predicates or transforms, but are
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64SchedPredExynos.td14 // Auxiliary predicates.
25 // Exynos predicates.
H A DAArch64SchedPredicates.td61 // Generic predicates.
342 // Target predicates.
/freebsd-13.1/cddl/usr.sbin/dtrace/tests/common/
H A DMakefile47 predicates \
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h176 iterator_range<predicate_iterator> predicates() { in predicates() function
179 iterator_range<const_predicate_iterator> predicates() const { in predicates() function
H A DGIMatchTree.cpp92 for (auto &P : enumerate(MatchDag.predicates())) { in GIMatchTreeBuilderLeafInfo()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Target/GlobalISel/
H A DSelectionDAGCompat.td32 // SelectionDAG has one node for all loads and uses predicates to
35 // depending on the predicates on the node.
174 // complications that tablegen must take care of. For example, predicates such
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCombine.td12 // TODO: GICombineRules should accept subtarget predicates
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DGlobalISelEmitter.cpp1690 for (auto &&Predicate : zip(predicates(), B.predicates())) { in isHigherPriorityThan()
1704 predicates().begin(), predicates().end(), 0, in countRendererFns()
2376 for (auto &&P : zip(predicates(), B.predicates())) { in isHigherPriorityThan()
2399 predicates().begin(), predicates().end(), 0, in countRendererFns()
2412 for (auto &P : predicates()) in getOpcodeMatcher()
2512 for (auto &OP : OM->predicates()) in optimize()
2527 for (auto &OP : OM->predicates()) in optimize()
5963 for (auto &OP : OM->predicates()) in optimize()
5984 for (auto &OP : OM->predicates()) in hasFirstCondition()
6000 for (auto &OP : OM->predicates()) in getFirstCondition()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMips.td19 // subclasses to partially override the predicates of their superclasses without
20 // having to re-add all the existing predicates.
H A DMipsInstrInfo.td285 // FIXME: I'd prefer to use additive predicates to build the instruction sets
289 // predicates.
3001 // predicates, because PredicateControl was not in the hierarchy. This was
3004 // predicates needs to be restored.
3115 // By making the predicates they use non-overlapping, the patterns were
3116 // reordered so that the effect of the newly introduced predicates can be
/freebsd-13.1/etc/mtree/
H A DBSD.tests.dist160 predicates
/freebsd-13.1/cddl/usr.sbin/dtrace/tests/tools/
H A Dexclude.sh119 exclude EXFAIL common/predicates/tst.argsnotcached.d
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCV.td12 // RISC-V subtarget features and instruction predicates.
/freebsd-13.1/contrib/googletest/googletest/
H A DCHANGES64 * New feature: predicates used inside EXPECT_TRUE() and friends
/freebsd-13.1/contrib/libxo/doc/
H A Dfield-modifiers.rst23 k key Field is a key, suitable for XPath predicates
/freebsd-13.1/targets/pseudo/tests/
H A DMakefile.depend83 cddl/usr.sbin/dtrace/tests/common/predicates \
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonIntrinsics.td90 // otherwise, we need to updated the predicates for immediates to exclude zero
/freebsd-13.1/crypto/heimdal/lib/roken/
H A Droken.h.in353 /* missing stat.h predicates */
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFInstrInfo.td83 // Conditional code predicates - used for pattern matching for jump instructions
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMScheduleSwift.td51 // Swift predicates.

12