| /external/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
38 WorklistMap(std::move(Arg.WorklistMap)) {}
41 WorklistMap = std::move(RHS.WorklistMap);
50 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
67 WorklistMap.reserve(List.size());
71 WorklistMap.insert(std::make_pair(I, Idx++));
78 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
79 if (It == WorklistMap.end()) return; // Not in worklist
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/InstCombine/ |
| InstCombineWorklist.h | 29 DenseMap<Instruction*, unsigned> WorklistMap;
42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
59 WorklistMap.reserve(List.size());
63 WorklistMap.insert(std::make_pair(I, Idx++));
70 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
71 if (It == WorklistMap.end()) return; // Not in worklist.
76 WorklistMap.erase(It);
81 WorklistMap.erase(I);
98 assert(WorklistMap.empty() && "Worklist empty, but map not?");
101 WorklistMap.clear()
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombineWorklist.h | 27 DenseMap<Instruction*, unsigned> WorklistMap;
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
56 WorklistMap.resize(NumEntries);
60 WorklistMap.insert(std::make_pair(I, Worklist.size()));
67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
68 if (It == WorklistMap.end()) return; // Not in worklist.
73 WorklistMap.erase(It);
79 WorklistMap.erase(I);
97 assert(WorklistMap.empty() && "Worklist empty, but map not?");
100 WorklistMap.clear()
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 110 DenseMap<SDNode *, unsigned> WorklistMap;
140 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
148 auto It = WorklistMap.find(N);
149 if (It == WorklistMap.end())
154 WorklistMap.erase(It);
[all...] |
