Home
last modified time | relevance | path

Searched refs:preds (Results 1 – 14 of 14) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPredicateControl.td28 preds, p,
29 preds # !listremove([p], [TruePredicate, NoTrue16Predicate] # preds));
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSDPatternMatch.h333 And(const Pred &p, const Preds &...preds) : And<Preds...>(preds...), P(p) {}
350 Or(const Pred &p, const Preds &...preds) : Or<Preds...>(preds...), P(p) {}
376 template <typename... Preds> And<Preds...> m_AllOf(const Preds &...preds) {
377 return And<Preds...>(preds...);
380 template <typename... Preds> Or<Preds...> m_AnyOf(const Preds &...preds) {
381 return Or<Preds...>(preds...);
384 template <typename... Preds> auto m_NoneOf(const Preds &...preds) {
385 return m_Unless(m_AnyOf(preds...));
402 Operands_match(const OpndPred &p, const OpndPreds &...preds)
403 : Operands_match<OpIdx + 1, OpndPreds...>(preds...), P(p) {}
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h283 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/contrib/llvm-project/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp155 SmallPtrSet<MachineBasicBlock*, 8> preds(BB.pred_begin(), in runOnMachineFunction() local
159 if (!preds.count(Phi.getOperand(i).getMBB())) { in runOnMachineFunction()
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h240 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/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp184 for (const CFGBlock *PredBlock : CB->preds()) { in FindUnreachableEntryPoints()
H A DBasicObjCFoundationChecks.cpp973 for (const ExplodedNode *N : N->preds()) { in alreadyExecutedAtLeastOneLoopIteration()
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMips.td52 class AdditionalRequires<list<Predicate> preds> {
53 list<Predicate> AdditionalPredicates = preds;
H A DMipsMSAInstrInfo.td3607 RegisterClass DstRC, list<Predicate> preds = [HasMSA]> :
3609 (COPY_TO_REGCLASS SrcVT:$src, DstRC), preds>;
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenDAGPatterns.h1067 PatternToMatch(Record *srcrecord, ListInit *preds, TreePatternNodePtr src,
1071 : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src), in SrcRecord()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h976 pred_range preds() { in preds() function
980 pred_const_range preds() const { in preds() function
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DTarget.td857 class Requires<list<Predicate> preds> {
858 list<Predicate> Predicates = preds;
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.td5012 list<Predicate> preds = []> {
5013 let Predicates = !listconcat(preds, [HasFullFP16]) in {
5019 let Predicates = preds in {
H A DAArch64InstrFormats.td7594 list<Predicate> preds = []> {
7598 let Predicates = preds in {