diff options
author | Rahul Joshi <rjoshi@nvidia.com> | 2025-05-19 12:16:33 -0700 |
---|---|---|
committer | GitHub <noreply@github.com> | 2025-05-19 12:16:33 -0700 |
commit | 3932360b14c390188977a53ecba6c13fff685aae (patch) | |
tree | 41facadd367f7ca6dc0b213fe554e36c0e045b1a /llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp | |
parent | 0f38543df55575562c75e1227fc9ada22417fa8f (diff) | |
download | llvm-3932360b14c390188977a53ecba6c13fff685aae.zip llvm-3932360b14c390188977a53ecba6c13fff685aae.tar.gz llvm-3932360b14c390188977a53ecba6c13fff685aae.tar.bz2 |
[LLVM][TableGen] Rename `ListInit::getValues()` to `getElements()` (#140289)
Rename `ListInit::getValues()` to `getElements()` to better match with
other `ListInit` members like `getElement`. Keep `getValues()` for
existing downstream code but mark it deprecated.
Diffstat (limited to 'llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp')
-rw-r--r-- | llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp b/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp index 45f1446..f03cbd9 100644 --- a/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp +++ b/llvm/utils/TableGen/Common/CodeGenDAGPatterns.cpp @@ -1012,7 +1012,7 @@ std::string TreePredicateFn::getPredCode() const { " if ("; ListSeparator LS(" && "); - for (const Init *Val : AddressSpaces->getValues()) { + for (const Init *Val : AddressSpaces->getElements()) { Code += LS; const IntInit *IntVal = dyn_cast<IntInit>(Val); @@ -1489,7 +1489,7 @@ int PatternToMatch::getPatternComplexity(const CodeGenDAGPatterns &CGP) const { void PatternToMatch::getPredicateRecords( SmallVectorImpl<const Record *> &PredicateRecs) const { - for (const Init *I : Predicates->getValues()) { + for (const Init *I : Predicates->getElements()) { if (const DefInit *Pred = dyn_cast<DefInit>(I)) { const Record *Def = Pred->getDef(); if (!Def->isSubClassOf("Predicate")) { @@ -1934,7 +1934,7 @@ static unsigned GetNumNodeResults(const Record *Operator, const ListInit *LI = Operator->getValueAsListInit("Fragments"); assert(LI && "Invalid Fragment"); unsigned NumResults = 0; - for (const Init *I : LI->getValues()) { + for (const Init *I : LI->getElements()) { const Record *Op = nullptr; if (const DagInit *Dag = dyn_cast<DagInit>(I)) if (const DefInit *DI = dyn_cast<DefInit>(Dag->getOperator())) @@ -2855,7 +2855,7 @@ TreePattern::TreePattern(const Record *TheRec, const ListInit *RawPat, bool isInput, CodeGenDAGPatterns &cdp) : TheRecord(TheRec), CDP(cdp), isInputPattern(isInput), HasError(false), Infer(*this) { - for (const Init *I : RawPat->getValues()) + for (const Init *I : RawPat->getElements()) Trees.push_back(ParseTreePattern(I, "")); } @@ -3766,7 +3766,7 @@ static bool hasNullFragReference(const DagInit *DI) { /// hasNullFragReference - Return true if any DAG in the list references /// the null_frag operator. static bool hasNullFragReference(const ListInit *LI) { - for (const Init *I : LI->getValues()) { + for (const Init *I : LI->getElements()) { const DagInit *DI = dyn_cast<DagInit>(I); assert(DI && "non-dag in an instruction Pattern list?!"); if (hasNullFragReference(DI)) |