116   void UpdatedSearchState(const changeset_ty &Changes,  in UpdatedSearchState()  argument
119     DDA.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
137   DAGDeltaAlgorithmImpl(DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
142   /// GetTestResult - Get the test result for the active set \p Changes with
143   /// \p Required changes from the cache, executing the test if necessary.
145   /// \param Changes - The set of active changes being minimized, which should
147   /// \param Required - The set of changes which have previously been
150   bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
153 /// Helper object for minimizing an active set of changes.
160   /// UpdatedSearchState - Callback used when the search state changes.
161   void UpdatedSearchState(const changeset_ty &Changes,  in UpdatedSearchState()  argument
163     DDAI.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
179     DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,  in DAGDeltaAlgorithmImpl()  argument
182   for (change_ty Change : Changes) {  in DAGDeltaAlgorithmImpl()
192   for (change_ty Change : Changes)  in DAGDeltaAlgorithmImpl()
212   for (change_ty Change : Changes)  in DAGDeltaAlgorithmImpl()
214   for (change_ty Change : Changes)  in DAGDeltaAlgorithmImpl()
223     llvm::errs() << "Changes: [";  in DAGDeltaAlgorithmImpl()
224     for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end();  in DAGDeltaAlgorithmImpl()
226       if (it != Changes.begin())  in DAGDeltaAlgorithmImpl()
254     for (change_ty Change : Changes) {  in DAGDeltaAlgorithmImpl()
267     for (change_ty Change : Changes) {  in DAGDeltaAlgorithmImpl()
283 bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes,  in GetTestResult()  argument
286   Extended.insert(Changes.begin(), Changes.end());  in GetTestResult()
287   for (change_ty Change : Changes)  in GetTestResult()
302   // The current set of changes we are minimizing, starting at the roots.  in Run()
305   // The set of required changes.  in Run()
308   // Iterate until the active set of changes is empty. Convergence is guaranteed  in Run()
315       llvm::errs() << "DAG_DD - " << CurrentSet.size() << " active changes, "  in Run()
316                    << Required.size() << " required changes\n";  in Run()
319     // Minimize the current set of changes.  in Run()
323     // Update the set of required changes. Since  in Run()
333     // active changes.  in Run()
349 DAGDeltaAlgorithm::Run(const changeset_ty &Changes,  in Run()  argument
351   return DAGDeltaAlgorithmImpl(*this, Changes, Dependencies).Run();  in Run()