Searched refs:worklist (Results 1 - 8 of 8) sorted by relevance
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
H A D | ADCE.cpp | 54 SmallVector<Instruction*, 128> worklist; local 63 worklist.push_back(I.getInstructionIterator()); 67 while (!worklist.empty()) { 68 Instruction* curr = worklist.pop_back_val(); 73 worklist.push_back(Inst); 79 // NOTE: We reuse the worklist vector here for memory efficiency. 82 worklist.push_back(I.getInstructionIterator()); 86 for (SmallVector<Instruction*, 1024>::iterator I = worklist.begin(), 87 E = worklist.end(); I != E; ++I) { 92 return !worklist [all...] |
H A D | CodeGenPrepare.cpp | 911 SmallVector<Value*, 8> worklist; local 913 worklist.push_back(Addr); 915 // Use a worklist to iteratively look through PHI nodes, and ensure that 923 while (!worklist.empty()) { 924 Value *V = worklist.back(); 925 worklist.pop_back(); 936 worklist.push_back(P->getIncomingValue(i));
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 151 std::vector<Function*> worklist; local 152 worklist.reserve(M.size()); 155 worklist.push_back(&*FI); 158 while (!worklist.empty()) { 159 Function* currFunc = worklist.back(); 160 worklist.pop_back(); 176 worklist.push_back(newFunc);
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/API/ |
H A D | ObjcRuntimeExtras.h | 49 Vector<Protocol *> worklist; local 52 // Initially fill the worklist with the Class's protocols. 55 worklist.append(protocols, protocolsCount); 58 while (!worklist.isEmpty()) { 59 Protocol *protocol = worklist.last(); 60 worklist.removeLast(); 70 // Add incorporated protocols to the worklist. 72 worklist.append(protocols, protocolsCount);
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGGraph.cpp | 388 void Graph::handleSuccessor(Vector<BlockIndex, 16>& worklist, BlockIndex blockIndex, BlockIndex successorIndex) argument 393 worklist.append(successorIndex); 401 Vector<BlockIndex, 16> worklist; local 402 worklist.append(0); 404 while (!worklist.isEmpty()) { 405 BlockIndex index = worklist.last(); 406 worklist.removeLast(); 415 handleSuccessor(worklist, index, node->takenBlockIndex()); 417 handleSuccessor(worklist, index, node->takenBlockIndex()); 418 handleSuccessor(worklist, inde [all...] |
H A D | DFGGraph.h | 729 void handleSuccessor(Vector<BlockIndex, 16>& worklist, BlockIndex blockIndex, BlockIndex successorIndex);
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 949 std::vector<BasicBlock*> worklist; local 950 worklist.push_back(OldSucc); 959 // Use a worklist to perform a depth-first search of OldSucc's successors. 963 while (!worklist.empty()) { 964 BasicBlock *ToUpdate = worklist.back(); 965 worklist.pop_back(); 993 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
|
/macosx-10.9.5/crontabs-51/newsyslog/ |
H A D | newsyslog.c | 749 struct conf_entry *globlist, *lastnew, *worklist; local 752 defconf = globlist = worklist = NULL; 767 parse_file(f, fname, &worklist, &globlist, &defconf); 784 parse_file(f, fname, &worklist, &globlist, &defconf); 793 * a worklist and a globlist. If there were no specific files 796 * and adds them to the worklist. Then return the worklist. 799 expand_globs(&worklist, &globlist); 803 return (worklist); 823 * then create a new worklist whic [all...] |
Completed in 184 milliseconds