Home
last modified time | relevance | path

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

12

/NextBSD/sys/ufs/ffs/
HDsoftdep.h200 struct worklist { struct
201 LIST_ENTRY(worklist) wk_list; /* list of work requests */
278 struct worklist pd_list; /* page buffer */
338 struct worklist id_list; /* buffer holding inode block */
380 struct worklist sm_list; /* cylgrp buffer */
410 struct worklist nb_list; /* See comment above. */
483 struct worklist ir_list; /* buffer holding indirect block */
541 struct worklist ff_list; /* id_inowait or delayed worklist */
543 struct worklist *ff_jdep; /* Associated journal entry. */
561 struct worklist fb_list; /* id_inowait or delayed worklist */
[all …]
HDffs_softdep.c785 static struct jnewblk *cancel_newblk(struct newblk *, struct worklist *,
874 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *,
910 static void add_to_worklist(struct worklist *, int);
911 static void wake_worklist(struct worklist *);
912 static void wait_worklist(struct worklist *, char *);
913 static void remove_from_worklist(struct worklist *);
924 static void add_to_journal(struct worklist *);
925 static void remove_from_journal(struct worklist *);
927 static void softdep_process_journal(struct mount *, struct worklist *, int);
946 static int jwait(struct worklist *, int);
[all …]
/NextBSD/contrib/gcc/
HDlcm.c103 basic_block *worklist, *qin, *qout, *qend; in compute_antinout_edge() local
110 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks); in compute_antinout_edge()
124 qin = worklist; in compute_antinout_edge()
125 qend = &worklist[n_basic_blocks - NUM_FIXED_BLOCKS]; 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()
253 basic_block *worklist, *qin, *qout, *qend, bb; in compute_laterin() local
262 qin = qout = worklist in compute_laterin()
298 qin = worklist; in compute_laterin()
[all …]
HDdomwalk.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()
HDtree-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()
HDtree-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()
HDtree-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()
904 worklist = VEC_alloc (int, heap, n_defs + 1); 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()
926 VEC_quick_push (int, worklist, b); in prune_unused_phi_nodes()
[all …]
HDtree-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 …]
HDtree-ssa-pre.c1709 VEC(basic_block, heap) * worklist; in compute_antic_aux()
1715 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); in compute_antic_aux()
1717 VEC_quick_push (basic_block, worklist, e->dest); in compute_antic_aux()
1718 first = VEC_index (basic_block, worklist, 0); in compute_antic_aux()
1721 for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++) in compute_antic_aux()
1735 VEC_free (basic_block, heap, worklist); in compute_antic_aux()
3386 basic_block *worklist; in compute_avail() local
3418 worklist = XNEWVEC (basic_block, n_basic_blocks); in compute_avail()
3425 worklist[sp++] = son; in compute_avail()
3436 block = worklist[--sp]; in compute_avail()
[all …]
HDtree-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()
193 mark_aliases_call_clobbered (tree tag, VEC (tree, heap) **worklist, in mark_aliases_call_clobbered() argument
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()
[all …]
HDcfganal.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()
HDtree-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()
HDvar-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()
HDbt-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()
/NextBSD/contrib/llvm/tools/clang/lib/Analysis/
HDCFGReachabilityAnalysis.cpp43 SmallVector<const CFGBlock *, 11> worklist; in mapReachability() local
51 worklist.push_back(Dst); in mapReachability()
54 while (!worklist.empty()) { in mapReachability()
55 const CFGBlock *block = worklist.pop_back_val(); in mapReachability()
73 worklist.push_back(*i); in mapReachability()
HDLiveVariables.cpp31 SmallVector<const CFGBlock *, 20> worklist; member in __anon4ca1618f0111::DataflowWorklist
52 worklist.push_back(block); in enqueueBlock()
57 const unsigned OldWorklistSize = worklist.size(); in enqueuePredecessors()
63 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) in enqueuePredecessors()
70 std::sort(worklist.begin(), worklist.end(), POV->getComparator()); in sortWorklist()
74 if (worklist.empty()) in dequeue()
76 const CFGBlock *b = worklist.pop_back_val(); in dequeue()
502 DataflowWorklist worklist(*cfg, AC); in computeLiveness() local
508 worklist.enqueueBlock(block); in computeLiveness()
531 worklist.sortWorklist(); in computeLiveness()
[all …]
HDUninitializedValues.cpp209 SmallVector<const CFGBlock *, 20> worklist; member in __anon8fa3d10f0311::DataflowWorklist
234 worklist.push_back(Successor); in enqueueSuccessors()
244 if (!worklist.empty()) in dequeue()
245 B = worklist.pop_back_val(); in dequeue()
893 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); in runUninitializedVariablesAnalysis() local
895 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
900 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis()
908 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
/NextBSD/contrib/llvm/lib/Transforms/IPO/
HDPartialInlining.cpp152 std::vector<Function*> worklist; in runOnModule() local
153 worklist.reserve(M.size()); in runOnModule()
156 worklist.push_back(&*FI); in runOnModule()
159 while (!worklist.empty()) { in runOnModule()
160 Function* currFunc = worklist.back(); in runOnModule()
161 worklist.pop_back(); in runOnModule()
176 worklist.push_back(newFunc); in runOnModule()
/NextBSD/lib/libthr/thread/
HDthr_list.c98 TAILQ_HEAD(, pthread) worklist; in _thr_gc()
100 TAILQ_INIT(&worklist); in _thr_gc()
111 TAILQ_INSERT_HEAD(&worklist, td, gcle); in _thr_gc()
115 while ((td = TAILQ_FIRST(&worklist)) != NULL) { in _thr_gc()
116 TAILQ_REMOVE(&worklist, td, gcle); in _thr_gc()
/NextBSD/contrib/llvm/lib/Transforms/Scalar/
HDPlaceSafepoints.cpp293 std::vector<BasicBlock *> &worklist) { in scanOneBB() argument
309 worklist.push_back(Succ); in scanOneBB()
320 std::vector<BasicBlock *> worklist; in scanInlinedCode() local
322 scanOneBB(start, end, calls, seen, worklist); in scanInlinedCode()
323 while (!worklist.empty()) { in scanInlinedCode()
324 BasicBlock *BB = worklist.back(); in scanInlinedCode()
325 worklist.pop_back(); in scanInlinedCode()
326 scanOneBB(&*BB->begin(), end, calls, seen, worklist); in scanInlinedCode()
/NextBSD/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
HDDeadStoresChecker.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()
/NextBSD/contrib/bsnmp/lib/
HDsnmpclient.c104 TAILQ_HEAD(worklist, work);
112 struct worklist worklist; member
146 while ((w = TAILQ_FIRST(&work->worklist)) != NULL) { in table_free()
147 TAILQ_REMOVE(&work->worklist, w, link); in table_free()
186 w = TAILQ_FIRST(&work->worklist); in table_find()
325 w1 = TAILQ_FIRST(&work->worklist); in table_find()
334 TAILQ_INSERT_TAIL(&work->worklist, w, link); in table_find()
569 TAILQ_INIT(&work.worklist); in snmp_table_fetch()
719 TAILQ_INIT(&work->worklist); in snmp_table_fetch_async()
/NextBSD/contrib/llvm/lib/Analysis/
HDLazyValueInfo.cpp1053 std::vector<BasicBlock*> worklist; in threadEdge() local
1054 worklist.push_back(OldSucc); in threadEdge()
1065 while (!worklist.empty()) { in threadEdge()
1066 BasicBlock *ToUpdate = worklist.back(); in threadEdge()
1067 worklist.pop_back(); in threadEdge()
1094 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate)); in threadEdge()
/NextBSD/sys/geom/bde/
HDg_bde_work.c107 TAILQ_INSERT_TAIL(&sc->worklist, wp, list); in g_bde_new_work()
119 TAILQ_REMOVE(&sc->worklist, wp, list); in g_bde_delete_work()
284 TAILQ_FOREACH(wp2, &sc->worklist, list) { in g_bde_release_keysector()
562 TAILQ_FOREACH_SAFE(wp, &sc->worklist, list, twp) { in g_bde_worker()
HDg_bde.h133 TAILQ_HEAD(, g_bde_work) worklist;

12