| /external/llvm/include/llvm/ADT/ |
| H A D | DeltaAlgorithm.h | 48 /// 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 D | DAGDeltaAlgorithm.h | 51 /// 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 D | DeltaAlgorithm.cpp | 17 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 D | DAGDeltaAlgorithm.cpp | 66 const changeset_ty &Changes; member in class:__anon25907::DAGDeltaAlgorithmImpl
121 void UpdatedSearchState(const changeset_ty &Changes, argument
124 DDA.UpdatedSearchState(Changes, Sets, Required);
148 /// GetTestResult - Get the test result for the active set \p Changes with
151 /// \param Changes - The set of active changes being minimized, which should
156 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
167 void UpdatedSearchState(const changeset_ty &Changes,
169 DDAI.UpdatedSearchState(Changes, Sets, Required);
189 Changes(_Changes),
192 for (changeset_ty::const_iterator it = Changes
291 GetTestResult(const changeset_ty &Changes, const changeset_ty &Required) argument
359 Run(const changeset_ty &Changes, const std::vector<edge_ty> &Dependencies) argument
[all...] |
| /external/llvm/unittests/ADT/ |
| H A D | DAGDeltaAlgorithmTest.cpp | 25 virtual bool ExecuteOneTest(const changeset_ty &Changes) { argument
27 return std::includes(Changes.begin(), Changes.end(),
|
| H A D | DeltaAlgorithmTest.cpp | 40 virtual bool ExecuteOneTest(const changeset_ty &Changes) { argument
42 return std::includes(Changes.begin(), Changes.end(),
|
| /external/clang/lib/Format/ |
| H A D | WhitespaceManager.h | 116 // Changes might be in the middle of a token, so we cannot just keep the
167 /// \brief Align trailing comments over all \c Changes.
174 /// \brief Align escaped newlines over all \c Changes.
193 SmallVector<Change, 16> Changes; member in class:clang::format::WhitespaceManager
|
| /external/llvm/lib/CodeGen/ |
| H A D | LiveRangeCalc.cpp | 283 unsigned Changes; local
285 Changes = 0;
341 ++Changes;
370 ++Changes;
374 } while (Changes);
|
| /external/chromium_org/mojo/services/public/cpp/view_manager/tests/ |
| H A D | view_unittest.cc | 334 typedef std::vector<Change> Changes; typedef in class:mojo::__anon8823::OrderChangeObserver
343 Changes GetAndClearChanges() {
344 Changes changes;
368 Changes changes_;
395 OrderChangeObserver::Changes changes = observer.GetAndClearChanges();
415 OrderChangeObserver::Changes changes = observer.GetAndClearChanges();
435 OrderChangeObserver::Changes changes = observer.GetAndClearChanges();
455 OrderChangeObserver::Changes changes = observer.GetAndClearChanges();
469 typedef std::vector<std::string> Changes; typedef in namespace:mojo::__anon8824
490 Changes GetAndClearChange
[all...] |
| /external/llvm/lib/Target/R600/ |
| H A D | SIInsertWaits.cpp | 347 bool Changes = false; local
367 Changes |= insertWait(MBB, I, handleOperands(*I));
372 Changes |= insertWait(MBB, MBB.getFirstTerminator(), LastIssued);
375 return Changes;
|
| /external/chromium_org/mojo/services/view_manager/ |
| H A D | view_manager_unittest.cc | 50 // ViewManagerClient messages received by way of a vector of Changes. Use
91 // Run the current message loop. When |count| Changes have been received,
451 typedef std::vector<std::string> Changes; typedef in namespace:mojo::service
871 const Changes changes(ChangesToDescription1(connection_->changes()));
882 const Changes changes(ChangesToDescription1(connection_->changes()));
928 const Changes changes(ChangesToDescription1(connection_->changes()));
938 const Changes changes(ChangesToDescription1(connection_->changes()));
973 const Changes changes(ChangesToDescription1(connection_->changes()));
985 const Changes changes(ChangesToDescription1(connection_->changes()));
1008 const Changes change
[all...] |
| /external/clang/lib/Parse/ |
| H A D | ParseDecl.cpp | 768 AvailabilityChange Changes[Unknown]; local
858 if (!Changes[Index].KeywordLoc.isInvalid()) {
861 << SourceRange(Changes[Index].KeywordLoc,
862 Changes[Index].VersionRange.getEnd());
865 Changes[Index].KeywordLoc = KeywordLoc;
866 Changes[Index].Version = Version;
867 Changes[Index].VersionRange = VersionRange;
887 if (Changes[Index].KeywordLoc.isValid()) {
890 << SourceRange(Changes[Index].KeywordLoc,
891 Changes[Inde
[all...] |