Searched refs:worklist (Results 1 - 25 of 33) sorted by relevance

12

/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DADCE.cpp54 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 (SmallVectorImpl<Instruction *>::iterator I = worklist.begin(),
87 E = worklist.end(); I != E; ++I) {
92 return !worklist
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp43 SmallVector<const CFGBlock *, 11> worklist; local
51 worklist.push_back(Dst);
54 while (!worklist.empty()) {
55 const CFGBlock *block = worklist.pop_back_val();
69 // Add the predecessors to the worklist.
72 worklist.push_back(*i);
H A DLiveVariables.cpp31 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon3042::DataflowWorklist
53 worklist.push_back(block);
58 const unsigned OldWorklistSize = worklist.size();
64 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
71 const unsigned OldWorklistSize = worklist.size();
77 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
84 std::sort(worklist.begin(), worklist.end(), POV->getComparator());
88 if (worklist.empty())
90 const CFGBlock *b = worklist
[all...]
H A DUninitializedValues.cpp202 // Worklist: worklist for dataflow analysis.
208 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon3050::DataflowWorklist
233 worklist.push_back(Successor);
241 // First dequeue from the worklist. This can represent
243 if (!worklist.empty())
244 B = worklist.pop_back_val();
832 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>());
834 worklist.enqueueSuccessors(&cfg.getEntry());
839 while (const CFGBlock *block = worklist.dequeue()) {
847 worklist
[all...]
/freebsd-9.3-release/sys/ufs/ffs/
H A Dsoftdep.h87 * the old name must be added to the worklist to do the necessary
100 * The INPROGRESS flag marks worklist structures that are still on the
101 * worklist, but are being considered for action by some process.
109 * onto a worklist.
158 /* LIST_HEAD(workhead, worklist); -- declared in buf.h */
161 * Each request can be linked onto a work queue through its worklist structure.
164 * worklist is needed in the structure, then a wk_data field must be added
167 struct worklist { struct
168 LIST_ENTRY(worklist) wk_list; /* list of work requests */
245 struct worklist pd_lis
[all...]
H A Dffs_softdep.c859 static struct jnewblk *cancel_newblk(struct newblk *, struct worklist *,
948 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *,
982 static void add_to_worklist(struct worklist *, int);
983 static void wake_worklist(struct worklist *);
984 static void wait_worklist(struct worklist *, char *);
985 static void remove_from_worklist(struct worklist *);
996 static void add_to_journal(struct worklist *);
997 static void remove_from_journal(struct worklist *);
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Ddomwalk.c149 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks * 2); local
216 worklist[sp++] = bb;
217 worklist[sp++] = NULL;
221 worklist[sp++] = dest;
224 while (sp > 0 && !worklist[sp - 1])
227 bb = worklist[--sp];
263 bb = worklist[--sp];
267 free (worklist);
H A Dlcm.c104 basic_block *worklist, *qin, *qout, *qend;
108 /* Allocate a worklist array/queue. Entries are only added to the
111 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks);
117 /* Put every block on the worklist; this is necessary because of the
125 qin = worklist;
126 qend = &worklist[n_basic_blocks - NUM_FIXED_BLOCKS];
134 /* Iterate until the worklist is empty. */
137 /* Take the first entry off the worklist. */
142 qout = worklist;
146 the EXIT block. That way we never add then to the worklist
103 basic_block *worklist, *qin, *qout, *qend; local
253 basic_block *worklist, *qin, *qout, *qend, bb; local
480 basic_block *worklist, *qin, *qout, *qend, bb; local
609 basic_block *worklist, *tos, bb; local
[all...]
H A Dtree-cfgcleanup.c378 stored to worklist. */
381 remove_forwarder_block (basic_block bb, basic_block **worklist) argument
465 worklist. */
467 *(*worklist)++ = s->src;
518 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks); local
519 basic_block *current = worklist;
527 while (current != worklist)
533 free (worklist);
762 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks); local
763 basic_block *current = worklist;
[all...]
H A Dtree-ssa-dce.c79 static VEC(tree,heap) *worklist;
225 worklist if ADD_TO_WORKLIST is true. */
244 VEC_safe_push (tree, heap, worklist, stmt);
272 VEC_safe_push (tree, heap, worklist, stmt);
277 /* Mark STMT as necessary if it obviously is. Add it to the worklist if
472 the uses on each statement in the worklist, and add all feeding statements
473 which contribute to the calculation of this value to the worklist.
484 fprintf (dump_file, "\nProcessing worklist:\n");
486 while (VEC_length (tree, worklist) > 0)
488 /* Take `i' from worklist
[all...]
H A Dtree-into-ssa.c365 basic_block bb, *worklist, *tos; local
369 tos = worklist
377 /* Iterate until the worklist is empty. */
378 while (tos != worklist)
383 /* Pull a block off the worklist. */
403 free (worklist);
832 VEC(int, heap) *worklist;
865 Instead, we basically emulate standard dce. We put all uses to worklist,
868 add the predecessors of its basic block to the worklist.
904 worklist
[all...]
H A Dtree-vect-analyze.c1480 vect_mark_relevant (VEC(tree,heap) **worklist, tree stmt,
1512 /* Don't put phi-nodes in the worklist. Phis that are marked relevant
1524 VEC_safe_push (tree, heap, *worklist, stmt);
1610 VEC(tree,heap) *worklist;
1629 worklist = VEC_alloc (tree, heap, 64);
1631 /* 1. Init worklist. */
1643 vect_mark_relevant (&worklist, phi, relevant_p, live_p);
1660 vect_mark_relevant (&worklist, stmt, relevant_p, live_p);
1667 while (VEC_length (tree, worklist) > 0)
1669 stmt = VEC_pop (tree, worklist);
[all...]
H A Dcfganal.c285 basic_block *tos, *worklist, bb;
287 tos = worklist = XNEWVEC (basic_block, n_basic_blocks);
294 /* Add our starting points to the worklist. Almost always there will
308 while (tos != worklist)
324 free (worklist);
283 basic_block *tos, *worklist, bb; local
H A Dtree-ssa-pre.c1709 VEC(basic_block, heap) * worklist;
1715 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs));
1717 VEC_quick_push (basic_block, worklist, e->dest);
1718 first = VEC_index (basic_block, worklist, 0);
1721 for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++)
1735 VEC_free (basic_block, heap, worklist);
2179 /* Inserted expressions are placed onto this worklist, which is used
2185 worklist, which, after performing dead code elimination, is walked
3386 basic_block *worklist; local
3417 /* Allocate the worklist
[all...]
H A Dtree-ssa-alias.c157 init_transitive_clobber_worklist (VEC (tree, heap) **worklist,
167 VEC_safe_push (tree, heap, *worklist, curr);
178 add_to_worklist (tree alias, VEC (tree, heap) **worklist, argument
184 VEC_safe_push (tree, heap, *worklist, alias);
193 mark_aliases_call_clobbered (tree tag, VEC (tree, heap) **worklist, argument
211 add_to_worklist (entry, worklist, worklist2, ta->escape_mask);
410 VEC (tree, heap) *worklist = NULL;
414 init_transitive_clobber_worklist (&worklist, &worklist2);
415 while (VEC_length (tree, worklist) != 0)
417 tree curr = VEC_pop (tree, worklist);
[all...]
H A Dtree-ssa-propagate.c53 the CFG worklist is seeded with all the statements in the entry
124 worklist. If while simulating a basic block, we find a statement with
132 /* Array of control flow edges on the worklist. */
150 varying (this worklist), and the other contains all other SSA edges
157 thing using the VARYING worklist achieves. In addition, if we
158 don't use a separate worklist for VARYING edges, we end up with
164 /* Return true if the block worklist empty. */
173 /* Add a basic block to the worklist. The block must not be already
174 in the worklist, and it must not be the ENTRY or EXIT block. */
211 /* Remove a block from the worklist
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp151 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);
/freebsd-9.3-release/lib/libthr/thread/
H A Dthr_list.c98 TAILQ_HEAD(, pthread) worklist;
100 TAILQ_INIT(&worklist);
111 TAILQ_INSERT_HEAD(&worklist, td, gcle);
115 while ((td = TAILQ_FIRST(&worklist)) != NULL) {
116 TAILQ_REMOVE(&worklist, td, gcle);
/freebsd-9.3-release/sys/ufs/ufs/
H A Dufsmount.h83 struct worklist *softdep_worklist_tail; /* Tail pointer for above */
85 struct worklist *softdep_journal_tail; /* Tail pointer for above */
90 int softdep_on_worklist; /* Items on the worklist */
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp86 SmallVector<const CFGBlock*, 10> worklist;
87 worklist.push_back(&cfg.getEntry());
89 while (!worklist.empty()) {
90 const CFGBlock *block = worklist.pop_back_val();
98 worklist.push_back(succ);
/freebsd-9.3-release/lib/libkse/thread/
H A Dthr_kern.c1258 TAILQ_HEAD(, pthread) worklist;
1260 TAILQ_INIT(&worklist);
1298 TAILQ_INSERT_HEAD(&worklist, td, gcle);
1304 while ((td = TAILQ_FIRST(&worklist)) != NULL) {
1305 TAILQ_REMOVE(&worklist, td, gcle);
1333 TAILQ_HEAD(, kse) worklist;
1338 TAILQ_INIT(&worklist);
1344 TAILQ_INSERT_HEAD(&worklist, kse, k_qe);
1350 while ((kse = TAILQ_FIRST(&worklist))) {
1351 TAILQ_REMOVE(&worklist, ks
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Analysis/
H A DLazyValueInfo.cpp953 std::vector<BasicBlock*> worklist; local
954 worklist.push_back(OldSucc);
963 // Use a worklist to perform a depth-first search of OldSucc's successors.
967 while (!worklist.empty()) {
968 BasicBlock *ToUpdate = worklist.back();
969 worklist.pop_back();
997 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
/freebsd-9.3-release/sys/geom/bde/
H A Dg_bde.h133 TAILQ_HEAD(, g_bde_work) worklist; member in struct:g_bde_softc
H A Dg_bde_work.c107 TAILQ_INSERT_TAIL(&sc->worklist, wp, list);
119 TAILQ_REMOVE(&sc->worklist, wp, list);
284 TAILQ_FOREACH(wp2, &sc->worklist, list) {
562 TAILQ_FOREACH_SAFE(wp, &sc->worklist, list, twp) {
/freebsd-9.3-release/contrib/bsnmp/lib/
H A Dsnmpclient.c104 TAILQ_HEAD(worklist, work);
112 struct worklist worklist; member in struct:tabwork
135 * Free the entire table and work list. If table is NULL only the worklist
146 while ((w = TAILQ_FIRST(&work->worklist)) != NULL) {
147 TAILQ_REMOVE(&work->worklist, w, link);
186 w = TAILQ_FIRST(&work->worklist);
325 w1 = TAILQ_FIRST(&work->worklist);
334 TAILQ_INSERT_TAIL(&work->worklist, w, link);
569 TAILQ_INIT(&work.worklist);
[all...]

Completed in 465 milliseconds

12