Searched defs:Changes (Results 1 - 10 of 10) sorted by relevance

/external/llvm/include/llvm/ADT/
H A DDeltaAlgorithm.h48 /// GetTestResult - Get the test result for the \p Changes from the
51 /// \param Changes - The change set to test.
53 bool GetTestResult(const changeset_ty &Changes);
58 /// Delta - Minimize a set of \p Changes which has been partioned into
60 changeset_ty Delta(const changeset_ty &Changes,
64 /// removed from \p Changes while still satisfying the predicate.
66 /// \param Res - On success, a subset of Changes which satisfies the
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets,
74 virtual void UpdatedSearchState(const changeset_ty &Changes, argument
83 /// Run - Minimize the set \p Changes b
[all...]
H A DDAGDeltaAlgorithm.h51 /// Run - Minimize the DAG formed by the \p Changes vertices and the
56 /// \param Changes The list of changes.
59 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
63 changeset_ty Run(const changeset_ty &Changes,
67 virtual void UpdatedSearchState(const changeset_ty &Changes, argument
/external/llvm/lib/Support/
H A DDeltaAlgorithm.cpp17 bool DeltaAlgorithm::GetTestResult(const changeset_ty &Changes) { argument
18 if (FailedTestsCache.count(Changes))
21 bool Result = ExecuteOneTest(Changes);
23 FailedTestsCache.insert(Changes);
44 DeltaAlgorithm::Delta(const changeset_ty &Changes, argument
46 // Invariant: union(Res) == Changes
47 UpdatedSearchState(Changes, Sets);
51 return Changes;
55 if (Search(Changes, Sets, Res))
64 return Changes;
69 Search(const changeset_ty &Changes, const changesetlist_ty &Sets, changeset_ty &Res) argument
104 Run(const changeset_ty &Changes) argument
[all...]
H A DDAGDeltaAlgorithm.cpp64 const changeset_ty &Changes; member in class:__anon21292::DAGDeltaAlgorithmImpl
119 void UpdatedSearchState(const changeset_ty &Changes, argument
122 DDA.UpdatedSearchState(Changes, Sets, Required);
146 /// GetTestResult - Get the test result for the active set \p Changes with
149 /// \param Changes - The set of active changes being minimized, which should
154 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
165 virtual void UpdatedSearchState(const changeset_ty &Changes,
167 DDAI.UpdatedSearchState(Changes, Sets, Required);
187 Changes(_Changes),
190 for (changeset_ty::const_iterator it = Changes
289 GetTestResult(const changeset_ty &Changes, const changeset_ty &Required) argument
357 Run(const changeset_ty &Changes, const std::vector<edge_ty> &Dependencies) argument
[all...]
/external/llvm/unittests/ADT/
H A DDAGDeltaAlgorithmTest.cpp25 virtual bool ExecuteOneTest(const changeset_ty &Changes) { argument
27 return std::includes(Changes.begin(), Changes.end(),
H A DDeltaAlgorithmTest.cpp40 virtual bool ExecuteOneTest(const changeset_ty &Changes) { argument
42 return std::includes(Changes.begin(), Changes.end(),
/external/clang/lib/Format/
H A DWhitespaceManager.h104 // Changes might be in the middle of a token, so we cannot just keep the
136 /// \brief Align trailing comments over all \c Changes.
143 /// \brief Align escaped newlines over all \c Changes.
161 SmallVector<Change, 16> Changes; member in class:clang::format::WhitespaceManager
/external/llvm/lib/CodeGen/
H A DLiveRangeCalc.cpp289 unsigned Changes; local
291 Changes = 0;
347 ++Changes;
375 ++Changes;
379 } while (Changes);
/external/llvm/lib/Target/R600/
H A DSIInsertWaits.cpp334 bool Changes = false; local
354 Changes |= insertWait(MBB, I, handleOperands(*I));
359 Changes |= insertWait(MBB, MBB.getFirstTerminator(), LastIssued);
362 return Changes;
/external/clang/lib/Parse/
H A DParseDecl.cpp818 AvailabilityChange Changes[Unknown]; local
913 if (!Changes[Index].KeywordLoc.isInvalid()) {
916 << SourceRange(Changes[Index].KeywordLoc,
917 Changes[Index].VersionRange.getEnd());
920 Changes[Index].KeywordLoc = KeywordLoc;
921 Changes[Index].Version = Version;
922 Changes[Index].VersionRange = VersionRange;
946 if (Changes[Index].KeywordLoc.isValid()) {
949 << SourceRange(Changes[Index].KeywordLoc,
950 Changes[Inde
[all...]

Completed in 306 milliseconds