/external/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 : Worklist(std::move(Arg.Worklist)), 40 Worklist = std::move(RHS.Worklist); 45 bool isEmpty() const { return Worklist.empty(); } 47 /// Add - Add the specified instruction to the worklist if it isn't already 50 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 38 : Worklist(std::move(Arg.Worklist)), 41 Worklist = std::move(RHS.Worklist); 54 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for InstCombine pass ----*- C++ -*-===// 25 /// InstCombineWorklist - This is the worklist management logic for 28 SmallVector<Instruction*, 256> Worklist; 37 bool isEmpty() const { return Worklist.empty(); } 39 /// Add - Add the specified instruction to the worklist if it isn't already 42 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 44 Worklist.push_back(I); 54 /// which should only be done when the worklist is empty and when the group 57 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
InstCombine.h | 28 InstCombineWorklist Worklist; 45 InstCombineWorklist Worklist;
|
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===// 23 /// InstCombineWorklist - This is the worklist management logic for 26 SmallVector<Instruction*, 256> Worklist; 34 bool isEmpty() const { return Worklist.empty(); } 36 /// Add - Add the specified instruction to the worklist if it isn't already 39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 41 Worklist.push_back(I); 51 /// which should only be done when the worklist is empty and when the group 54 assert(Worklist.empty() && "Worklist must be empty to add initial group") [all...] |
/external/llvm/lib/Analysis/ |
IteratedDominanceFrontier.cpp | 43 SmallVector<DomTreeNode *, 32> Worklist; 58 Worklist.clear(); 59 Worklist.push_back(Root); 62 while (!Worklist.empty()) { 63 DomTreeNode *Node = Worklist.pop_back_val(); 96 Worklist.push_back(DomChild);
|
/external/llvm/lib/Transforms/Scalar/ |
ADCE.cpp | 78 SmallVector<Instruction*, 128> Worklist; 88 Worklist.push_back(&I); 95 while (!Worklist.empty()) { 96 Instruction *Curr = Worklist.pop_back_val(); 105 Worklist.push_back(Inst); 112 // NOTE: We reuse the Worklist vector here for memory efficiency. 136 Worklist.push_back(&I); 140 for (Instruction *&I : Worklist) { 145 return !Worklist.empty();
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
CaptureTracking.cpp | 49 SmallVector<Use*, Threshold> Worklist; 62 Worklist.push_back(U); 65 while (!Worklist.empty()) { 66 Use *U = Worklist.pop_back_val(); 125 Worklist.push_back(U);
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
LoopPassManager.h | 106 /// Helper to implement appending of loops onto a worklist. 108 /// We want to process loops in postorder, but the worklist is a LIFO data 115 SmallPriorityWorklist<Loop *, 4> &Worklist) { 116 // We use an internal worklist to build up the preorder traversal without 121 // to visit defs before uses and the worklist is LIFO. 125 "Must start with an empty preorder walk worklist."); 133 Worklist.insert(std::move(PreOrderLoops)); 182 // Insert ourselves back into the worklist first, as this loop should be 184 Worklist.insert(CurrentL); 193 internal::appendLoopsToWorklist(NewChildLoops, Worklist); [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
LoopPassManager.h | 106 /// Helper to implement appending of loops onto a worklist. 108 /// We want to process loops in postorder, but the worklist is a LIFO data 115 SmallPriorityWorklist<Loop *, 4> &Worklist) { 116 // We use an internal worklist to build up the preorder traversal without 121 // to visit defs before uses and the worklist is LIFO. 125 "Must start with an empty preorder walk worklist."); 133 Worklist.insert(std::move(PreOrderLoops)); 182 // Insert ourselves back into the worklist first, as this loop should be 184 Worklist.insert(CurrentL); 193 internal::appendLoopsToWorklist(NewChildLoops, Worklist); [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
LoopPassManager.h | 106 /// Helper to implement appending of loops onto a worklist. 108 /// We want to process loops in postorder, but the worklist is a LIFO data 115 SmallPriorityWorklist<Loop *, 4> &Worklist) { 116 // We use an internal worklist to build up the preorder traversal without 121 // to visit defs before uses and the worklist is LIFO. 125 "Must start with an empty preorder walk worklist."); 133 Worklist.insert(std::move(PreOrderLoops)); 182 // Insert ourselves back into the worklist first, as this loop should be 184 Worklist.insert(CurrentL); 193 internal::appendLoopsToWorklist(NewChildLoops, Worklist); [all...] |