Lines Matching defs:Changes
66 const changeset_ty &Changes;
121 void UpdatedSearchState(const changeset_ty &Changes,
124 DDA.UpdatedSearchState(Changes, Sets, Required);
148 /// GetTestResult - Get the test result for the active set \p Changes with
149 /// \p Required changes from the cache, executing the test if necessary.
151 /// \param Changes - The set of active changes being minimized, which should
153 /// \param Required - The set of changes which have previously been
156 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
159 /// Helper object for minimizing an active set of changes.
166 /// UpdatedSearchState - Callback used when the search state changes.
167 void UpdatedSearchState(const changeset_ty &Changes,
169 DDAI.UpdatedSearchState(Changes, Sets, Required);
189 Changes(_Changes),
192 for (changeset_ty::const_iterator it = Changes.begin(),
193 ie = Changes.end(); it != ie; ++it) {
204 for (changeset_ty::const_iterator it = Changes.begin(),
205 ie = Changes.end(); it != ie; ++it)
225 for (changeset_ty::const_iterator it = Changes.begin(),
226 ie = Changes.end(); it != ie; ++it)
228 for (changeset_ty::const_iterator it = Changes.begin(),
229 ie = Changes.end(); it != ie; ++it)
237 llvm::errs() << "Changes: [";
238 for (changeset_ty::const_iterator it = Changes.begin(),
239 ie = Changes.end(); it != ie; ++it) {
240 if (it != Changes.begin()) llvm::errs() << ", ";
264 for (changeset_ty::const_iterator it = Changes.begin(),
265 ie = Changes.end(); it != ie; ++it) {
276 for (changeset_ty::const_iterator it = Changes.begin(),
277 ie = Changes.end(); it != ie; ++it) {
291 bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes,
294 Extended.insert(Changes.begin(), Changes.end());
295 for (changeset_ty::const_iterator it = Changes.begin(),
296 ie = Changes.end(); it != ie; ++it)
311 // The current set of changes we are minimizing, starting at the roots.
314 // The set of required changes.
317 // Iterate until the active set of changes is empty. Convergence is guaranteed
324 llvm::errs() << "DAG_DD - " << CurrentSet.size() << " active changes, "
325 << Required.size() << " required changes\n";
328 // Minimize the current set of changes.
332 // Update the set of required changes. Since
342 // active changes.
359 DAGDeltaAlgorithm::Run(const changeset_ty &Changes,
361 return DAGDeltaAlgorithmImpl(*this, Changes, Dependencies).Run();
