X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FSupport%2FDAGDeltaAlgorithm.cpp;h=0d504ee86b4339141e05758134a5e1b026351dca;hb=487ecab8d41e70700ca27895127b99f955e31fd0;hp=4da3fe34c8837d871661c537b69506a318a1af38;hpb=73c6031a2546ad18ab0b454fe5d711715620d140;p=oota-llvm.git diff --git a/lib/Support/DAGDeltaAlgorithm.cpp b/lib/Support/DAGDeltaAlgorithm.cpp index 4da3fe34c88..0d504ee86b4 100644 --- a/lib/Support/DAGDeltaAlgorithm.cpp +++ b/lib/Support/DAGDeltaAlgorithm.cpp @@ -42,6 +42,8 @@ #include using namespace llvm; +#define DEBUG_TYPE "dag-delta" + namespace { class DAGDeltaAlgorithmImpl { @@ -122,7 +124,7 @@ private: DDA.UpdatedSearchState(Changes, Sets, Required); } - /// ExecuteOneTest - Execute a single test predicate on the change set \arg S. + /// ExecuteOneTest - Execute a single test predicate on the change set \p S. bool ExecuteOneTest(const changeset_ty &S) { // Check dependencies invariant. DEBUG({ @@ -143,8 +145,8 @@ public: changeset_ty Run(); - /// GetTestResult - Get the test result for the active set \arg Changes with - /// \arg Required changes from the cache, executing the test if necessary. + /// GetTestResult - Get the test result for the active set \p Changes with + /// \p Required changes from the cache, executing the test if necessary. /// /// \param Changes - The set of active changes being minimized, which should /// have their pred closure included in the test. @@ -162,12 +164,12 @@ class DeltaActiveSetHelper : public DeltaAlgorithm { protected: /// UpdatedSearchState - Callback used when the search state changes. - virtual void UpdatedSearchState(const changeset_ty &Changes, - const changesetlist_ty &Sets) { + void UpdatedSearchState(const changeset_ty &Changes, + const changesetlist_ty &Sets) override { DDAI.UpdatedSearchState(Changes, Sets, Required); } - virtual bool ExecuteOneTest(const changeset_ty &S) { + bool ExecuteOneTest(const changeset_ty &S) override { return DDAI.GetTestResult(S, Required); } @@ -290,7 +292,7 @@ bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes, const changeset_ty &Required) { changeset_ty Extended(Required); Extended.insert(Changes.begin(), Changes.end()); - for (changeset_ty::iterator it = Changes.begin(), + for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end(); it != ie; ++it) Extended.insert(pred_closure_begin(*it), pred_closure_end(*it)); @@ -350,6 +352,9 @@ DAGDeltaAlgorithmImpl::Run() { return Required; } +void DAGDeltaAlgorithm::anchor() { +} + DAGDeltaAlgorithm::changeset_ty DAGDeltaAlgorithm::Run(const changeset_ty &Changes, const std::vector &Dependencies) {