Cross Reference: /external/llvm/lib/Support/DAGDeltaAlgorithm.cpp

Lines Matching refs:Changes
118   void UpdatedSearchState(const changeset_ty &Changes,
121     DDA.UpdatedSearchState(Changes, Sets, Required);
139   DAGDeltaAlgorithmImpl(DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
144   /// GetTestResult - Get the test result for the active set \p Changes with
147   /// \param Changes - The set of active changes being minimized, which should
152   bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
163   void UpdatedSearchState(const changeset_ty &Changes,
165     DDAI.UpdatedSearchState(Changes, Sets, Required);
181     DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
184   for (changeset_ty::const_iterator it = Changes.begin(),
185          ie = Changes.end(); it != ie; ++it) {
196   for (changeset_ty::const_iterator it = Changes.begin(),
197          ie = Changes.end(); it != ie; ++it)
217   for (changeset_ty::const_iterator it = Changes.begin(),
218          ie = Changes.end(); it != ie; ++it)
220   for (changeset_ty::const_iterator it = Changes.begin(),
221          ie = Changes.end(); it != ie; ++it)
229       llvm::errs() << "Changes: [";
230       for (changeset_ty::const_iterator it = Changes.begin(),
231              ie = Changes.end(); it != ie; ++it) {
232         if (it != Changes.begin()) llvm::errs() << ", ";
256       for (changeset_ty::const_iterator it = Changes.begin(),
257              ie = Changes.end(); it != ie; ++it) {
268       for (changeset_ty::const_iterator it = Changes.begin(),
269              ie = Changes.end(); it != ie; ++it) {
283 bool DAGDeltaAlgorithmImpl::GetTestResult(const changeset_ty &Changes,
286   Extended.insert(Changes.begin(), Changes.end());
287   for (changeset_ty::const_iterator it = Changes.begin(),
288          ie = Changes.end(); it != ie; ++it)
351 DAGDeltaAlgorithm::Run(const changeset_ty &Changes,
353   return DAGDeltaAlgorithmImpl(*this, Changes, Dependencies).Run();