Summary:
It is fully redundant with reset().
Change-Id: I25850b9f08eace757cf03cbb8780e970aca7f51a
Reviewers: arsenm, RKSimon, mehdi_amini, courbet
Subscribers: wdng, cfe-commits, llvm-commits
Tags: #clang, #llvm
Differential Revision: https://reviews.llvm.org/D83084
}
/// Releases the memory held by the dominator tree.
- virtual void releaseMemory() {
- DT.releaseMemory();
- }
+ virtual void releaseMemory() { DT.reset(); }
/// Converts the dominator tree to human readable form.
virtual void print(raw_ostream &OS, const llvm::Module* M= nullptr) const {
AU.setPreservesAll();
}
- void releaseMemory() override {
- DT.releaseMemory();
- }
+ void releaseMemory() override { DT.reset(); }
void print(raw_ostream &OS, const Module*) const override;
};
AU.setPreservesAll();
}
- void releaseMemory() override { DT.releaseMemory(); }
+ void releaseMemory() override { DT.reset(); }
void print(raw_ostream &OS, const Module *M = nullptr) const override;
};
return false;
}
- void releaseMemory() { reset(); }
-
/// getNode - return the (Post)DominatorTree node for the specified basic
/// block. This is the same as using operator[] on this class. The result
/// may (but is not required to) be null for a forward (backwards)
return DomTreeBuilder::Verify(*this, VL);
}
-protected:
- void addRoot(NodeT *BB) { this->Roots.push_back(BB); }
-
void reset() {
DomTreeNodes.clear();
Roots.clear();
SlowQueries = 0;
}
+protected:
+ void addRoot(NodeT *BB) { this->Roots.push_back(BB); }
+
// NewBB is split and now it has one successor. Update dominator tree to
// reflect this change.
template <class N>