Home
last modified time | relevance | path

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

12

/openbsd-src/usr.bin/rcs/
H A Dworklist.c42 worklist_add(const char *path, struct wklhead *worklist) in worklist_add() argument
45 struct worklist *wkl; in worklist_add()
56 SLIST_INSERT_HEAD(worklist, wkl, wkl_list); in worklist_add()
65 worklist_run(struct wklhead *list, void (*cb)(struct worklist *)) in worklist_run() argument
68 struct worklist *wkl; in worklist_run()
87 worklist_clean(struct wklhead *list, void (*cb)(struct worklist *)) in worklist_clean() argument
89 struct worklist *wkl; in worklist_clean()
96 worklist_unlink(struct worklist *wkl) in worklist_unlink()
H A Dworklist.h33 struct worklist { struct
35 volatile SLIST_ENTRY(worklist) wkl_list; argument
38 SLIST_HEAD(wklhead, worklist);
41 void worklist_run(struct wklhead *, void (*cb)(struct worklist *));
42 void worklist_clean(struct wklhead *, void (*cb)(struct worklist *));
44 void worklist_unlink(struct worklist *);
H A DMakefile10 rcstime.c worklist.c xmalloc.c
/openbsd-src/usr.bin/cvs/
H A Dworklist.c37 worklist_add(const char *path, struct wklhead *worklist) in worklist_add() argument
40 struct worklist *wkl; in worklist_add()
51 SLIST_INSERT_HEAD(worklist, wkl, wkl_list); in worklist_add()
60 worklist_run(struct wklhead *list, void (*cb)(struct worklist *)) in worklist_run() argument
63 struct worklist *wkl; in worklist_run()
82 worklist_clean(struct wklhead *list, void (*cb)(struct worklist *)) in worklist_clean() argument
84 struct worklist *wkl; in worklist_clean()
91 worklist_unlink(struct worklist *wkl) in worklist_unlink()
H A Dworklist.h33 struct worklist { struct
35 volatile SLIST_ENTRY(worklist) wkl_list; argument
38 SLIST_HEAD(wklhead, worklist);
41 void worklist_run(struct wklhead *, void (*cb)(struct worklist *));
42 void worklist_clean(struct wklhead *, void (*cb)(struct worklist *));
44 void worklist_unlink(struct worklist *);
H A DMakefile12 root.c server.c status.c tag.c trigger.c worklist.c util.c update.c \
/openbsd-src/usr.sbin/bgpd/
H A Dpftable.c46 struct pfr_addr *worklist; member
69 tio.pfrio_buffer = pft->worklist; in pftable_change()
70 tio.pfrio_esize = sizeof(*pft->worklist); in pftable_change()
161 free(pft->worklist); in pftable_clear_all()
162 pft->worklist = NULL; in pftable_clear_all()
201 tmp = reallocarray(pft->worklist, pft->nalloc, sizeof(*tmp)); in pftable_add_work()
203 if (pft->worklist != NULL) { in pftable_add_work()
205 free(pft->worklist); in pftable_add_work()
206 pft->worklist = NULL; in pftable_add_work()
212 pft->worklist = tmp; in pftable_add_work()
[all …]
/openbsd-src/gnu/gcc/gcc/
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 Dlcm.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 …]
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()
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 …]
H A Dtree-vect-analyze.c1425 vect_mark_relevant (VEC(tree,heap) **worklist, tree stmt, in vect_mark_relevant() argument
1469 VEC_safe_push (tree, heap, *worklist, stmt); in vect_mark_relevant()
1555 VEC(tree,heap) *worklist; in vect_mark_stmts_to_be_vectorized()
1574 worklist = VEC_alloc (tree, heap, 64); in vect_mark_stmts_to_be_vectorized()
1588 vect_mark_relevant (&worklist, phi, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
1605 vect_mark_relevant (&worklist, stmt, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
1612 while (VEC_length (tree, worklist) > 0) in vect_mark_stmts_to_be_vectorized()
1614 stmt = VEC_pop (tree, worklist); in vect_mark_stmts_to_be_vectorized()
1690 VEC_free (tree, heap, worklist); in vect_mark_stmts_to_be_vectorized()
1713 vect_mark_relevant (&worklist, def_stmt, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
[all …]
H A Dtree-ssa-pre.c1692 VEC(basic_block, heap) * worklist; in compute_antic_aux()
1698 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); in compute_antic_aux()
1700 VEC_quick_push (basic_block, worklist, e->dest); in compute_antic_aux()
1701 first = VEC_index (basic_block, worklist, 0); in compute_antic_aux()
1704 for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++) in compute_antic_aux()
1718 VEC_free (basic_block, heap, worklist); in compute_antic_aux()
3369 basic_block *worklist; in compute_avail() local
3401 worklist = XNEWVEC (basic_block, n_basic_blocks); in compute_avail()
3408 worklist[sp++] = son; in compute_avail()
3419 block = worklist[--sp]; in compute_avail()
[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()
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 …]
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()
/openbsd-src/gnu/llvm/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.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()
/openbsd-src/gnu/llvm/lld/COFF/
H A DMarkLive.cpp27 SmallVector<SectionChunk *, 256> worklist; in markLive() local
35 worklist.push_back(sc); in markLive()
41 worklist.push_back(c); in markLive()
57 while (!worklist.empty()) { in markLive()
58 SectionChunk *sc = worklist.pop_back_val(); in markLive()
/openbsd-src/sys/dev/i2c/
H A Dadt7460.c98 } worklist[] = { variable
268 if (worklist[i].index >= 32768 && in adt_attach()
269 sc->chip->ratio[worklist[i].index - 32768] == 0) in adt_attach()
289 for (i = 0; i < sizeof worklist / sizeof(worklist[0]); i++) { in adt_refresh()
291 if (worklist[i].index >= 32768) { in adt_refresh()
292 ratio = sc->chip->ratio[worklist[i].index - 32768]; in adt_refresh()
296 cmd = worklist[i].cmd; in adt_refresh()
304 switch (worklist[i].sensor) { in adt_refresh()
330 cmd = worklist[i].cmd + 1; /* TACHnH follows TACHnL */ in adt_refresh()
349 cmd = worklist[i].cmd + 1; /* TACHnH follows TACHnL */ in adt_refresh()
/openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLowerRefTypesIntPtrConv.cpp60 std::set<Instruction *> worklist; in runOnFunction() local
76 worklist.insert(&*I); in runOnFunction()
80 for (Instruction *I : worklist) in runOnFunction()
83 return !worklist.empty(); in runOnFunction()
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dlcm.c112 basic_block *worklist, *qin, *qout, *qend; local
118 qin = qout = worklist
133 qin = worklist;
134 qend = &worklist[n_basic_blocks];
150 qout = worklist;
177 qin = worklist;
183 free (worklist);
264 basic_block *worklist, *qin, *qout, *qend, bb; local
272 qin = qout = worklist
305 qin = worklist;
[all …]
H A Dssa-ccp.c1099 sbitmap worklist = (sbitmap) data; local
1124 SET_BIT (worklist, REGNO (reg));
1137 SET_BIT (worklist, REGNO (x));
1150 sbitmap worklist = sbitmap_alloc (VARRAY_SIZE (ssa_definition)); local
1151 sbitmap_ones (worklist);
1155 while (sbitmap_first_set_bit (worklist) >= 0)
1161 reg = sbitmap_first_set_bit (worklist);
1162 RESET_BIT (worklist, reg);
1204 for_each_rtx (&PATTERN (def), mark_references, worklist);
1214 sbitmap_free (worklist);
H A Dssa.c588 sbitmap worklist; local
591 worklist = sbitmap_alloc (last_basic_block);
601 sbitmap_copy (worklist, evals[reg]);
612 EXECUTE_IF_SET_IN_SBITMAP (worklist, 0, b,
614 RESET_BIT (worklist, b);
619 sbitmap_union_of_diff (worklist, worklist, frontiers[b], idf);
627 sbitmap_free (worklist);
/openbsd-src/gnu/llvm/lld/MachO/
H A DMarkLive.cpp71 SmallVector<WorklistEntry *, 256> worklist; member in lld::macho::MarkLiveImpl
83 worklist.push_back(makeEntry(s, prev)); in enqueue()
149 while (!worklist.empty()) { in markTransitively()
150 WorklistEntry *entry = worklist.pop_back_val(); in markTransitively()
197 } while (!worklist.empty()); in markTransitively()
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp87 SmallVector<const CFGBlock*, 10> worklist; in computeReachableBlocks() local
88 worklist.push_back(&cfg.getEntry()); in computeReachableBlocks()
90 while (!worklist.empty()) { in computeReachableBlocks()
91 const CFGBlock *block = worklist.pop_back_val(); in computeReachableBlocks()
99 worklist.push_back(succ); in computeReachableBlocks()

12