| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | MIPatternMatch.h | 283 And(Pred &&p, Preds &&... preds)
284 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
302 Or(Pred &&p, Preds &&... preds)
303 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
310 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
311 return And<Preds...>(std::forward<Preds>(preds)...);
314 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
315 return Or<Preds...>(std::forward<Preds>(preds)...);
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | UnreachableBlockElim.cpp | 151 SmallPtrSet<MachineBasicBlock*, 8> preds(BB.pred_begin(), in runOnMachineFunction() local
155 if (!preds.count(Phi.getOperand(i).getMBB())) { in runOnMachineFunction()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 78 bool AllInInterval = llvm::all_of(B->preds(), [&](const Node *P) { in buildInterval()
178 for (const Node *P : H->preds()) { in partitionIntoIntervalsImpl()
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | IntervalPartition.h | 82 const llvm::SmallDenseSet<const CFGIntervalNode *> &preds() const { in preds() function
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/ |
| H A D | DataflowWorklist.h | 98 for (auto B : Block->preds()) in enqueuePredecessors()
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 240 pred_range preds() { return {Preds.begin(), Preds.end()}; } in preds() function
248 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; } in preds() function
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | UnreachableCodeChecker.cpp | 182 for (const CFGBlock *PredBlock : CB->preds()) { in FindUnreachableEntryPoints()
|
| H A D | BasicObjCFoundationChecks.cpp | 977 for (const ExplodedNode *N : N->preds()) { in alreadyExecutedAtLeastOneLoopIteration()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Mips/ |
| H A D | Mips.td | 52 class AdditionalRequires<list<Predicate> preds> {
53 list<Predicate> AdditionalPredicates = preds;
|
| H A D | MipsMSAInstrInfo.td | 3607 RegisterClass DstRC, list<Predicate> preds = [HasMSA]> :
3609 (COPY_TO_REGCLASS SrcVT:$src, DstRC), preds>;
|
| /freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.h | 1078 PatternToMatch(Record *srcrecord, ListInit *preds, TreePatternNodePtr src,
1082 : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src), in SrcRecord()
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CFG.h | 975 pred_range preds() { in preds() function
979 pred_const_range preds() const { in preds() function
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | Target.td | 827 class Requires<list<Predicate> preds> {
828 list<Predicate> Predicates = preds;
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64InstrInfo.td | 4701 list<Predicate> preds = []> {
4702 let Predicates = !listconcat(preds, [HasFullFP16]) in {
4708 let Predicates = preds in {
|
| H A D | AArch64InstrFormats.td | 7593 list<Predicate> preds = []> {
7597 let Predicates = preds in {
|