/external/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 26 /// The DAG should be used to represent dependencies in the changes which are 33 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 51 /// Run - Minimize the DAG formed by the \p Changes vertices and the 53 /// changes and returning the smallest set which still satisfies the test 56 /// \param Changes The list of changes. 58 /// \param Dependencies The list of dependencies amongst changes. For each 59 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 63 changeset_ty Run(const changeset_ty &Changes, 66 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 48 /// GetTestResult - Get the test result for the \arg Changes from the 51 /// \param Changes - The change set to test. 53 bool GetTestResult(const changeset_ty &Changes); 55 /// Split - Partition a set of changes \arg S into one or two subsets. 58 /// Delta - Minimize a set of \arg Changes which has been partioned into 60 changeset_ty Delta(const changeset_ty &Changes, 64 /// removed from \arg 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 [all...] |
DAGDeltaAlgorithm.h | 26 /// The DAG should be used to represent dependencies in the changes which are 33 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 50 /// Run - Minimize the DAG formed by the \arg Changes vertices and the \arg 52 /// changes and returning the smallest set which still satisfies the test 55 /// \param Changes The list of changes. 57 /// \param Dependencies The list of dependencies amongst changes. For each 58 /// (x,y) in \arg Dependencies, both x and y must be in \arg Changes. The 61 changeset_ty Run(const changeset_ty &Changes, 64 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 29 /// (2) If the predicate returns true for a set of changes, it should return 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); 55 /// Split - Partition a set of changes \p S into one or two subsets. 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 [all...] |
DAGDeltaAlgorithm.h | 27 /// The DAG should be used to represent dependencies in the changes which are 34 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG 53 /// Run - Minimize the DAG formed by the \p Changes vertices and the 55 /// changes and returning the smallest set which still satisfies the test 58 /// \param Changes The list of changes. 60 /// \param Dependencies The list of dependencies amongst changes. For each 61 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The 65 changeset_ty Run(const changeset_ty &Changes, 68 /// UpdatedSearchState - Callback used when the search state changes [all...] |
/external/clang/lib/Format/ |
WhitespaceManager.cpp | 46 Changes.clear(); 57 Changes.push_back( 69 Changes.push_back(Change( 84 Changes.push_back(Change( 94 if (Changes.empty()) 97 std::sort(Changes.begin(), Changes.end(), Change::IsBeforeInFile(SourceMgr)); 109 Changes[0].PreviousEndOfTokenColumn = 0; 110 Change *LastOutsideTokenChange = &Changes[0]; 111 for (unsigned i = 1, e = Changes.size(); i != e; ++i) [all...] |
/external/llvm/lib/Support/ |
DeltaAlgorithm.cpp | 17 bool DeltaAlgorithm::GetTestResult(const changeset_ty &Changes) { 18 if (FailedTestsCache.count(Changes)) 21 bool Result = ExecuteOneTest(Changes); 23 FailedTestsCache.insert(Changes); 44 DeltaAlgorithm::Delta(const changeset_ty &Changes, 46 // Invariant: union(Res) == Changes 47 UpdatedSearchState(Changes, Sets); 51 return Changes; 55 if (Search(Changes, Sets, Res)) 64 return Changes; [all...] |
DAGDeltaAlgorithm.cpp | 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 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 [all...] |
/external/swiftshader/third_party/LLVM/lib/Support/ |
DeltaAlgorithm.cpp | 17 bool DeltaAlgorithm::GetTestResult(const changeset_ty &Changes) { 18 if (FailedTestsCache.count(Changes)) 21 bool Result = ExecuteOneTest(Changes); 23 FailedTestsCache.insert(Changes); 44 DeltaAlgorithm::Delta(const changeset_ty &Changes, 46 // Invariant: union(Res) == Changes 47 UpdatedSearchState(Changes, Sets); 51 return Changes; 55 if (Search(Changes, Sets, Res)) 64 return Changes; [all...] |
DAGDeltaAlgorithm.cpp | 64 const changeset_ty &Changes; 119 void UpdatedSearchState(const changeset_ty &Changes, 122 DDA.UpdatedSearchState(Changes, Sets, Required); 146 /// GetTestResult - Get the test result for the active set \arg Changes with 147 /// \arg Required changes from the cache, executing the test if necessary. 149 /// \param Changes - The set of active changes being minimized, which should 151 /// \param Required - The set of changes which have previously been 154 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required); 157 /// Helper object for minimizing an active set of changes [all...] |