Home
last modified time | relevance | path

Searched refs:worklist (Results 1 – 25 of 35) sorted by relevance

12

/freebsd-12.1/sys/ufs/ffs/
H A Dsoftdep.h211 struct worklist { struct
289 struct worklist pd_list; /* page buffer */
391 struct worklist sm_list; /* cylgrp buffer */
421 struct worklist nb_list; /* See comment above. */
603 struct worklist fw_list; /* Delayed worklist. */
627 struct worklist fd_list; /* Delayed worklist. */
737 struct worklist dm_list; /* delayed worklist */
873 struct worklist jn_list; /* See lists above. */
954 struct worklist jd_list; /* See above for lists. */
969 struct worklist js_list; /* b_deps link for journal */
[all …]
H A Dffs_softdep.c879 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *,
1104 struct worklist *wkn;
1105 struct worklist *wk;
1136 struct worklist *wk;
1507 struct worklist *wk; in add_to_worklist()
1538 struct worklist *wk; in remove_from_worklist()
1552 struct worklist *wk; in wake_worklist()
1562 struct worklist *wk; in wait_worklist()
1763 struct worklist *wk;
2111 struct worklist *wk;
[all …]
/freebsd-12.1/contrib/gcc/
H A Dlcm.c124 qin = worklist; in compute_antinout_edge()
141 qout = worklist; in compute_antinout_edge()
168 qin = worklist; in compute_antinout_edge()
174 free (worklist); in compute_antinout_edge()
298 qin = worklist; in compute_laterin()
310 qout = worklist; in compute_laterin()
346 free (worklist); in compute_laterin()
501 qin = worklist; in compute_available()
518 qout = worklist; in compute_available()
548 qin = worklist; in compute_available()
[all …]
H A Ddomwalk.c149 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks * 2); in walk_dominator_tree() local
216 worklist[sp++] = bb; in walk_dominator_tree()
217 worklist[sp++] = NULL; in walk_dominator_tree()
221 worklist[sp++] = dest; in walk_dominator_tree()
224 while (sp > 0 && !worklist[sp - 1]) in walk_dominator_tree()
227 bb = worklist[--sp]; in walk_dominator_tree()
263 bb = worklist[--sp]; in walk_dominator_tree()
267 free (worklist); in walk_dominator_tree()
H A Dtree-cfgcleanup.c381 remove_forwarder_block (basic_block bb, basic_block **worklist) in remove_forwarder_block() argument
467 *(*worklist)++ = s->src; in remove_forwarder_block()
518 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks); in cleanup_forwarder_blocks() local
519 basic_block *current = worklist; in cleanup_forwarder_blocks()
527 while (current != worklist) in cleanup_forwarder_blocks()
533 free (worklist); in cleanup_forwarder_blocks()
762 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks); in merge_phi_nodes() local
763 basic_block *current = worklist; in merge_phi_nodes()
831 while (current != worklist) in merge_phi_nodes()
837 free (worklist); in merge_phi_nodes()
H A Dtree-ssa-dce.c78 static VEC(tree,heap) *worklist;
241 VEC_safe_push (tree, heap, worklist, stmt); in mark_stmt_necessary()
269 VEC_safe_push (tree, heap, worklist, stmt); in mark_operand_necessary()
479 while (VEC_length (tree, worklist) > 0) in propagate_necessity()
482 i = VEC_pop (tree, worklist); in propagate_necessity()
609 while (VEC_length (tree, worklist) > 0) in mark_really_necessary_kill_operand_phis()
611 tree use = VEC_pop (tree, worklist); in mark_really_necessary_kill_operand_phis()
837 worklist = VEC_alloc (tree, heap, 64); in tree_dce_init()
860 VEC_free (tree, heap, worklist); in tree_dce_done()
H A Dtree-into-ssa.c365 basic_block bb, *worklist, *tos; in compute_global_livein() local
369 tos = worklist in compute_global_livein()
378 while (tos != worklist) in compute_global_livein()
403 free (worklist); in compute_global_livein()
832 VEC(int, heap) *worklist; in prune_unused_phi_nodes()
905 VEC_quick_push (int, worklist, 1); in prune_unused_phi_nodes()
915 VEC_pop (int, worklist); in prune_unused_phi_nodes()
916 top = VEC_index (int, worklist, VEC_length (int, worklist) - 1); in prune_unused_phi_nodes()
937 VEC_pop (int, worklist); in prune_unused_phi_nodes()
949 b = VEC_pop (int, worklist); in prune_unused_phi_nodes()
[all …]
H A Dtree-vect-analyze.c1480 vect_mark_relevant (VEC(tree,heap) **worklist, tree stmt, in vect_mark_relevant() argument
1524 VEC_safe_push (tree, heap, *worklist, stmt); in vect_mark_relevant()
1610 VEC(tree,heap) *worklist; in vect_mark_stmts_to_be_vectorized()
1629 worklist = VEC_alloc (tree, heap, 64); in vect_mark_stmts_to_be_vectorized()
1643 vect_mark_relevant (&worklist, phi, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
1660 vect_mark_relevant (&worklist, stmt, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
1667 while (VEC_length (tree, worklist) > 0) in vect_mark_stmts_to_be_vectorized()
1669 stmt = VEC_pop (tree, worklist); in vect_mark_stmts_to_be_vectorized()
1745 VEC_free (tree, heap, worklist); in vect_mark_stmts_to_be_vectorized()
1768 vect_mark_relevant (&worklist, def_stmt, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
[all …]
H A Dtree-ssa-pre.c1709 VEC(basic_block, heap) * worklist; in compute_antic_aux()
3386 basic_block *worklist; in compute_avail() local
3425 worklist[sp++] = son; in compute_avail()
3436 block = worklist[--sp]; in compute_avail()
3546 worklist[sp++] = son; in compute_avail()
3549 free (worklist); in compute_avail()
3666 VEC(tree,heap) *worklist = NULL; in remove_dead_inserted_code()
3674 VEC_quick_push (tree, worklist, t); in remove_dead_inserted_code()
3676 while (VEC_length (tree, worklist) > 0) in remove_dead_inserted_code()
3678 t = VEC_pop (tree, worklist); in remove_dead_inserted_code()
[all …]
H A Dtree-ssa-alias.c157 init_transitive_clobber_worklist (VEC (tree, heap) **worklist, in init_transitive_clobber_worklist() argument
167 VEC_safe_push (tree, heap, *worklist, curr); in init_transitive_clobber_worklist()
178 add_to_worklist (tree alias, VEC (tree, heap) **worklist, in add_to_worklist() argument
184 VEC_safe_push (tree, heap, *worklist, alias); in add_to_worklist()
211 add_to_worklist (entry, worklist, worklist2, ta->escape_mask); in mark_aliases_call_clobbered()
410 VEC (tree, heap) *worklist = NULL; in compute_call_clobbered()
414 init_transitive_clobber_worklist (&worklist, &worklist2); in compute_call_clobbered()
415 while (VEC_length (tree, worklist) != 0) in compute_call_clobbered()
417 tree curr = VEC_pop (tree, worklist); in compute_call_clobbered()
421 mark_aliases_call_clobbered (curr, &worklist, &worklist2); in compute_call_clobbered()
[all …]
H A Dcfganal.c283 basic_block *tos, *worklist, bb; in find_unreachable_blocks() local
285 tos = worklist = XNEWVEC (basic_block, n_basic_blocks); in find_unreachable_blocks()
306 while (tos != worklist) in find_unreachable_blocks()
322 free (worklist); in find_unreachable_blocks()
H A Dtree-ssa-propagate.c365 process_ssa_edge_worklist (VEC(tree,gc) **worklist) in process_ssa_edge_worklist() argument
368 while (VEC_length (tree, *worklist) > 0) in process_ssa_edge_worklist()
373 tree stmt = VEC_pop (tree, *worklist); in process_ssa_edge_worklist()
H A Dvar-tracking.c1826 fibheap_t worklist, pending, fibheap_swap; in vt_find_locations() local
1843 worklist = fibheap_new (); in vt_find_locations()
1857 pending = worklist; in vt_find_locations()
1858 worklist = fibheap_swap; in vt_find_locations()
1865 while (!fibheap_empty (worklist)) in vt_find_locations()
1867 bb = fibheap_extract_min (worklist); in vt_find_locations()
1909 fibheap_insert (worklist, bb_order[e->dest->index], in vt_find_locations()
1919 fibheap_delete (worklist); in vt_find_locations()
H A Dbt-load.c905 basic_block *worklist, *tos; in augment_live_range() local
907 tos = worklist = XNEWVEC (basic_block, n_basic_blocks + 1); in augment_live_range()
949 while (tos != worklist) in augment_live_range()
982 free (worklist); in augment_live_range()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp44 SmallVector<const CFGBlock *, 11> worklist; in mapReachability() local
52 worklist.push_back(Dst); in mapReachability()
55 while (!worklist.empty()) { in mapReachability()
56 const CFGBlock *block = worklist.pop_back_val(); in mapReachability()
74 worklist.push_back(*i); in mapReachability()
H A DLiveVariables.cpp35 PostOrderCFGView::BlockOrderCompare> worklist; member in __anon853d68e50111::DataflowWorklist
41 worklist(POV->getComparator()) {} in DataflowWorklist()
54 worklist.push(block); in enqueueBlock()
66 if (worklist.empty()) in dequeue()
68 const CFGBlock *b = worklist.top(); in dequeue()
69 worklist.pop(); in dequeue()
559 DataflowWorklist worklist(*cfg, AC); in computeLiveness() local
565 worklist.enqueueBlock(block); in computeLiveness()
588 while (const CFGBlock *block = worklist.dequeue()) { in computeLiveness()
613 worklist.enqueuePredecessors(block); in computeLiveness()
H A DUninitializedValues.cpp224 SmallVector<const CFGBlock *, 20> worklist; member in __anon80f980e50311::DataflowWorklist
251 worklist.push_back(Successor); in enqueueSuccessors()
261 if (!worklist.empty()) in dequeue()
262 B = worklist.pop_back_val(); in dequeue()
911 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); in runUninitializedVariablesAnalysis() local
913 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
918 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis()
926 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
/freebsd-12.1/lib/libthr/thread/
H A Dthr_list.c102 TAILQ_HEAD(, pthread) worklist; in _thr_gc()
104 TAILQ_INIT(&worklist); in _thr_gc()
115 TAILQ_INSERT_HEAD(&worklist, td, gcle); in _thr_gc()
119 while ((td = TAILQ_FIRST(&worklist)) != NULL) { in _thr_gc()
120 TAILQ_REMOVE(&worklist, td, gcle); in _thr_gc()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp86 SmallVector<const CFGBlock*, 10> worklist; in computeReachableBlocks() local
87 worklist.push_back(&cfg.getEntry()); in computeReachableBlocks()
89 while (!worklist.empty()) { in computeReachableBlocks()
90 const CFGBlock *block = worklist.pop_back_val(); in computeReachableBlocks()
98 worklist.push_back(succ); in computeReachableBlocks()
/freebsd-12.1/contrib/bsnmp/lib/
H A Dsnmpclient.c110 TAILQ_HEAD(worklist, work);
118 struct worklist worklist; member
152 while ((w = TAILQ_FIRST(&work->worklist)) != NULL) { in table_free()
153 TAILQ_REMOVE(&work->worklist, w, link); in table_free()
192 w = TAILQ_FIRST(&work->worklist); in table_find()
331 w1 = TAILQ_FIRST(&work->worklist); in table_find()
340 TAILQ_INSERT_TAIL(&work->worklist, w, link); in table_find()
575 TAILQ_INIT(&work.worklist); in snmp_table_fetch()
725 TAILQ_INIT(&work->worklist); in snmp_table_fetch_async()
/freebsd-12.1/sys/geom/bde/
H A Dg_bde_work.c109 TAILQ_INSERT_TAIL(&sc->worklist, wp, list); in g_bde_new_work()
121 TAILQ_REMOVE(&sc->worklist, wp, list); in g_bde_delete_work()
286 TAILQ_FOREACH(wp2, &sc->worklist, list) { in g_bde_release_keysector()
564 TAILQ_FOREACH_SAFE(wp, &sc->worklist, list, twp) { in g_bde_worker()
H A Dg_bde.h135 TAILQ_HEAD(, g_bde_work) worklist;
H A Dg_bde.c184 TAILQ_INIT(&sc->worklist); in g_bde_create_geom()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyValueInfo.cpp303 std::vector<BasicBlock*> worklist; in threadEdgeImpl() local
304 worklist.push_back(OldSucc); in threadEdgeImpl()
315 while (!worklist.empty()) { in threadEdgeImpl()
316 BasicBlock *ToUpdate = worklist.back(); in threadEdgeImpl()
317 worklist.pop_back(); in threadEdgeImpl()
345 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate)); in threadEdgeImpl()
/freebsd-12.1/usr.sbin/newsyslog/
H A Dnewsyslog.c304 struct cflist *worklist; in main() local
318 worklist = get_worklist(argv); in main()
324 while (!STAILQ_EMPTY(worklist)) { in main()
325 p = STAILQ_FIRST(worklist); in main()
326 STAILQ_REMOVE_HEAD(worklist, cf_nextp); in main()

12