118   void UpdatedSearchState(const changeset_ty &Changes,  in UpdatedSearchState()  argument
121     DDA.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
139   DAGDeltaAlgorithmImpl(DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
144   /// GetTestResult - Get the test result for the active set \p Changes with
145   /// \p Required changes from the cache, executing the test if necessary.
147   /// \param Changes - The set of active changes being minimized, which should
149   /// \param Required - The set of changes which have previously been
152   bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
155 /// Helper object for minimizing an active set of changes.
162   /// UpdatedSearchState - Callback used when the search state changes.
163   void UpdatedSearchState(const changeset_ty &Changes,  in UpdatedSearchState()  argument
165     DDAI.UpdatedSearchState(Changes, Sets, Required);  in UpdatedSearchState()
181     DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,  in DAGDeltaAlgorithmImpl()  argument
184   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
185          ie = Changes.end(); it != ie; ++it) {  in DAGDeltaAlgorithmImpl()
196   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
197          ie = Changes.end(); it != ie; ++it)  in DAGDeltaAlgorithmImpl()
217   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
218          ie = Changes.end(); it != ie; ++it)  in DAGDeltaAlgorithmImpl()
220   for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
221          ie = Changes.end(); it != ie; ++it)  in DAGDeltaAlgorithmImpl()
229       llvm::errs() << "Changes: [";  in DAGDeltaAlgorithmImpl()
230       for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
231              ie = Changes.end(); it != ie; ++it) {  in DAGDeltaAlgorithmImpl()
232         if (it != Changes.begin()) llvm::errs() << ", ";  in DAGDeltaAlgorithmImpl()
256       for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
257              ie = Changes.end(); it != ie; ++it) {  in DAGDeltaAlgorithmImpl()
268       for (changeset_ty::const_iterator it = Changes.begin(),  in DAGDeltaAlgorithmImpl()
269              ie = Changes.end(); it != ie; ++it) {  in DAGDeltaAlgorithmImpl()
283 bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes,  in GetTestResult()  argument
286   Extended.insert(Changes.begin(), Changes.end());  in GetTestResult()
287   for (changeset_ty::const_iterator it = Changes.begin(),  in GetTestResult()
288          ie = Changes.end(); it != ie; ++it)  in GetTestResult()
303   // The current set of changes we are minimizing, starting at the roots.  in Run()
306   // The set of required changes.  in Run()
309   // Iterate until the active set of changes is empty. Convergence is guaranteed  in Run()
316         llvm::errs() << "DAG_DD - " << CurrentSet.size() << " active changes, "  in Run()
317                      << Required.size() << " required changes\n";  in Run()
320     // Minimize the current set of changes.  in Run()
324     // Update the set of required changes. Since  in Run()
334     // active changes.  in Run()
351 DAGDeltaAlgorithm::Run(const changeset_ty &Changes,  in Run()  argument
353   return DAGDeltaAlgorithmImpl(*this, Changes, Dependencies).Run();  in Run()