Home
last modified time | relevance | path

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

123

/dragonfly/contrib/gcc-4.7/gcc/
HDdomwalk.c145 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks * 2); in walk_dominator_tree() local
194 worklist[sp++] = bb; in walk_dominator_tree()
195 worklist[sp++] = NULL; in walk_dominator_tree()
199 worklist[sp++] = dest; in walk_dominator_tree()
202 while (sp > 0 && !worklist[sp - 1]) in walk_dominator_tree()
205 bb = worklist[--sp]; in walk_dominator_tree()
232 bb = worklist[spp]; in walk_dominator_tree()
247 if (!worklist[spp - 1]) in walk_dominator_tree()
251 bb = worklist[spp]; in walk_dominator_tree()
252 worklist[spp] = worklist[--sp]; in walk_dominator_tree()
[all …]
HDlcm.c102 basic_block *worklist, *qin, *qout, *qend; in compute_antinout_edge() local
109 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks); in compute_antinout_edge()
123 qin = worklist; in compute_antinout_edge()
124 qend = &worklist[n_basic_blocks - NUM_FIXED_BLOCKS]; in compute_antinout_edge()
140 qout = worklist; in compute_antinout_edge()
167 qin = worklist; in compute_antinout_edge()
173 free (worklist); in compute_antinout_edge()
252 basic_block *worklist, *qin, *qout, *qend, bb; in compute_laterin() local
261 qin = qout = worklist in compute_laterin()
297 qin = worklist; in compute_laterin()
[all …]
HDtree-ssa-loop-unswitch.c269 basic_block *tos, *worklist; in tree_unswitch_single_loop() local
274 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
287 while (tos != worklist) in tree_unswitch_single_loop()
321 free (worklist); in tree_unswitch_single_loop()
HDtree-into-ssa.c380 basic_block bb, *worklist, *tos; in compute_global_livein() local
384 tos = worklist in compute_global_livein()
391 while (tos != worklist) in compute_global_livein()
416 free (worklist); in compute_global_livein()
837 VEC(int, heap) *worklist; in prune_unused_phi_nodes()
909 worklist = VEC_alloc (int, heap, n_defs + 1); in prune_unused_phi_nodes()
910 VEC_quick_push (int, worklist, 1); in prune_unused_phi_nodes()
920 VEC_pop (int, worklist); in prune_unused_phi_nodes()
921 top = VEC_index (int, worklist, VEC_length (int, worklist) - 1); in prune_unused_phi_nodes()
931 VEC_quick_push (int, worklist, b); in prune_unused_phi_nodes()
[all …]
HDtree-ssa-tail-merge.c616 static VEC (same_succ, heap) *worklist; in VEC()
624 for (i = 0; i < VEC_length (same_succ, worklist); ++i)
625 same_succ_print (file, VEC_index (same_succ, worklist, i));
640 VEC_safe_push (same_succ, heap, worklist, same); in add_to_worklist()
719 worklist = VEC_alloc (same_succ, heap, n_basic_blocks); in init_worklist()
741 VEC_free (same_succ, heap, worklist); in delete_worklist()
1373 while (!VEC_empty (same_succ, worklist)) in find_clusters()
1375 same = VEC_pop (same_succ, worklist); in find_clusters()
1570 while (!VEC_empty (same_succ, worklist)) in tail_merge_optimize()
1586 gcc_assert (VEC_empty (same_succ, worklist)); in tail_merge_optimize()
HDtree-ssa-pre.c2263 VEC(basic_block, heap) * worklist; in compute_antic_aux()
2267 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); in compute_antic_aux()
2274 VEC_quick_push (basic_block, worklist, e->dest); in compute_antic_aux()
2284 VEC_free (basic_block, heap, worklist); in compute_antic_aux()
2293 FOR_EACH_VEC_ELT (basic_block, worklist, i, bprime) in compute_antic_aux()
2305 VEC_free (basic_block, heap, worklist); in compute_antic_aux()
2423 VEC(basic_block, heap) * worklist; in compute_partial_antic_aux()
2427 worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); in compute_partial_antic_aux()
2432 VEC_quick_push (basic_block, worklist, e->dest); in compute_partial_antic_aux()
2434 if (VEC_length (basic_block, worklist) > 0) in compute_partial_antic_aux()
[all …]
HDtree-ssa-uninit.c1849 VEC(gimple, heap) **worklist, in find_uninit_use()
1907 VEC_safe_push (gimple, heap, *worklist, use_stmt); in find_uninit_use()
1925 warn_uninitialized_phi (gimple phi, VEC(gimple, heap) **worklist, in warn_uninitialized_phi() argument
1949 worklist, added_to_worklist); in warn_uninitialized_phi()
1971 VEC(gimple, heap) *worklist = 0; in execute_late_warn_uninitialized()
2005 VEC_safe_push (gimple, heap, worklist, phi); in execute_late_warn_uninitialized()
2017 while (VEC_length (gimple, worklist) != 0) in execute_late_warn_uninitialized()
2020 cur_phi = VEC_pop (gimple, worklist); in execute_late_warn_uninitialized()
2021 warn_uninitialized_phi (cur_phi, &worklist, added_to_worklist); in execute_late_warn_uninitialized()
2024 VEC_free (gimple, heap, worklist); in execute_late_warn_uninitialized()
HDdce.c52 static VEC(rtx,heap) *worklist;
175 VEC_safe_push (rtx, heap, worklist, insn); in mark_insn()
747 while (VEC_length (rtx, worklist) > 0) in rest_of_handle_ud_dce()
749 insn = VEC_pop (rtx, worklist); in rest_of_handle_ud_dce()
752 VEC_free (rtx, heap, worklist); in rest_of_handle_ud_dce()
HDtree-ssa-dce.c74 static VEC(gimple,heap) *worklist;
218 VEC_safe_push (gimple, heap, worklist, stmt); in mark_stmt_necessary()
261 VEC_safe_push (gimple, heap, worklist, stmt); in mark_operand_necessary()
703 while (VEC_length (gimple, worklist) > 0) in propagate_necessity()
706 stmt = VEC_pop (gimple, worklist); in propagate_necessity()
1500 worklist = VEC_alloc (gimple, heap, 64); in tree_dce_init()
1525 VEC_free (gimple, heap, worklist); in tree_dce_done()
HDtree-cfgcleanup.c920 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks); in merge_phi_nodes() local
921 basic_block *current = worklist; in merge_phi_nodes()
991 while (current != worklist) in merge_phi_nodes()
997 free (worklist); in merge_phi_nodes()
HDtree-vect-stmts.c128 vect_mark_relevant (VEC(gimple,heap) **worklist, gimple stmt, in vect_mark_relevant() argument
215 VEC_safe_push (gimple, heap, *worklist, stmt); in vect_mark_relevant()
361 enum vect_relevant relevant, VEC(gimple,heap) **worklist, in process_use()
488 vect_mark_relevant (worklist, def_stmt, relevant, live_p, in process_use()
513 VEC(gimple,heap) *worklist; in vect_mark_stmts_to_be_vectorized()
530 worklist = VEC_alloc (gimple, heap, 64); in vect_mark_stmts_to_be_vectorized()
546 vect_mark_relevant (&worklist, phi, relevant, live_p, false); in vect_mark_stmts_to_be_vectorized()
558 vect_mark_relevant (&worklist, stmt, relevant, live_p, false); in vect_mark_stmts_to_be_vectorized()
563 while (VEC_length (gimple, worklist) > 0) in vect_mark_stmts_to_be_vectorized()
568 stmt = VEC_pop (gimple, worklist); in vect_mark_stmts_to_be_vectorized()
[all …]
/dragonfly/sys/vfs/ufs/
HDsoftdep.h123 struct worklist { struct
124 LIST_ENTRY(worklist) wk_list; /* list of work requests */
175 struct worklist pd_list; /* page buffer */
234 struct worklist id_list; /* buffer holding inode block */
279 struct worklist sm_list; /* cylgrp buffer */
305 struct worklist ad_list; /* buffer holding block */
337 struct worklist ir_list; /* buffer holding indirect block */
359 struct worklist ai_list; /* buffer holding indirect block */
382 struct worklist ff_list; /* id_inowait or delayed worklist */
398 struct worklist fb_list; /* id_inowait or delayed worklist */
[all …]
HDffs_softdep.c194 static void add_to_worklist(struct worklist *);
347 static void worklist_insert(struct workhead *, struct worklist *);
348 static void worklist_remove(struct worklist *);
349 static void workitem_free(struct worklist *, int);
358 #define WORKITEM_FREE(item, type) workitem_free((struct worklist *)item, type)
361 worklist_insert(struct workhead *head, struct worklist *item) in worklist_insert()
373 worklist_remove(struct worklist *item) in worklist_remove()
385 workitem_free(struct worklist *item, int type) in workitem_free()
462 add_to_worklist(struct worklist *wk) in add_to_worklist()
464 static struct worklist *worklist_tail; in add_to_worklist()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
HDlcm.c88 basic_block *worklist, *qin, *qout, *qend; in compute_antinout_edge() local
95 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in compute_antinout_edge()
113 qin = worklist; in compute_antinout_edge()
114 qend = &worklist[n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS]; in compute_antinout_edge()
130 qout = worklist; in compute_antinout_edge()
157 qin = worklist; in compute_antinout_edge()
163 free (worklist); in compute_antinout_edge()
236 basic_block *worklist, *qin, *qout, *qend, bb; in compute_laterin() local
245 qin = qout = worklist in compute_laterin()
287 qin = worklist; in compute_laterin()
[all …]
HDdomwalk.c335 basic_block *worklist = XNEWVEC (basic_block, in walk() local
368 worklist[sp++] = bb; in walk()
369 worklist[sp++] = NULL; in walk()
378 worklist[sp++] = dest; in walk()
383 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp); in walk()
387 while (sp > 0 && !worklist[sp - 1]) in walk()
390 bb = worklist[--sp]; in walk()
400 bb = worklist[--sp]; in walk()
405 free (worklist); in walk()
HDtree-ssa-loop-unswitch.c126 auto_vec<tree> worklist; in is_maybe_undefined() local
127 worklist.safe_push (name); in is_maybe_undefined()
129 while (!worklist.is_empty ()) in is_maybe_undefined()
131 tree t = worklist.pop (); in is_maybe_undefined()
153 worklist.safe_push (t); in is_maybe_undefined()
180 worklist.safe_push (t); in is_maybe_undefined()
382 basic_block *tos, *worklist; in tree_unswitch_single_loop() local
387 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
400 while (tos != worklist) in tree_unswitch_single_loop()
435 free (worklist); in tree_unswitch_single_loop()
HDsanopt.c971 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_unpoison()
972 bitmap_copy (worklist, with_poison); in sanitize_asan_mark_unpoison()
975 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_unpoison()
977 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_unpoison()
978 bitmap_clear_bit (worklist, i); in sanitize_asan_mark_unpoison()
988 bitmap_set_bit (worklist, e->dest->index); in sanitize_asan_mark_unpoison()
1069 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_poison()
1070 bitmap_copy (worklist, with_check); in sanitize_asan_mark_poison()
1073 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_poison()
1075 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_poison()
[all …]
HDtree-ssa-dce.c82 static vec<gimple *> worklist; variable
139 worklist.safe_push (stmt); in mark_stmt_necessary()
182 worklist.safe_push (stmt); in mark_operand_necessary()
624 while (worklist.length () > 0) in propagate_necessity()
627 stmt = worklist.pop (); in propagate_necessity()
1519 worklist.create (64); in tree_dce_init()
1539 worklist.release (); in tree_dce_done()
1730 simple_dce_from_worklist (bitmap worklist) in simple_dce_from_worklist() argument
1732 while (! bitmap_empty_p (worklist)) in simple_dce_from_worklist()
1735 unsigned i = bitmap_first_set_bit (worklist); in simple_dce_from_worklist()
[all …]
HDtree-ssa-tail-merge.c689 static vec<same_succ *> worklist; variable
697 for (i = 0; i < worklist.length (); ++i) in print_worklist()
698 same_succ_print (file, worklist[i]); in print_worklist()
713 worklist.safe_push (same); in add_to_worklist()
789 worklist.create (n_basic_blocks_for_fn (cfun)); in init_worklist()
811 worklist.release (); in delete_worklist()
1522 while (!worklist.is_empty ()) in find_clusters()
1524 same = worklist.pop (); in find_clusters()
1760 while (!worklist.is_empty ()) in tail_merge_optimize()
1776 gcc_assert (worklist.is_empty ()); in tail_merge_optimize()
HDtree-ssa-pre.c2054 auto_vec<edge> worklist (EDGE_COUNT (block->succs)); in compute_antic_aux()
2061 worklist.quick_push (e); in compute_antic_aux()
2087 FOR_EACH_VEC_ELT (worklist, i, e) in compute_antic_aux()
2104 if (! worklist.is_empty ()) in compute_antic_aux()
2261 auto_vec<edge> worklist (EDGE_COUNT (block->succs)); in compute_partial_antic_aux()
2266 worklist.quick_push (e); in compute_partial_antic_aux()
2268 if (worklist.length () > 0) in compute_partial_antic_aux()
2270 FOR_EACH_VEC_ELT (worklist, i, e) in compute_partial_antic_aux()
2370 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in compute_antic()
2371 bitmap_clear (worklist); in compute_antic()
[all …]
/dragonfly/contrib/binutils-2.34/gold/
HDgc.cc37 while (!this->worklist().empty()) in do_transitive_closure()
41 Section_id entry = this->worklist().back(); in do_transitive_closure()
42 this->worklist().pop_back(); in do_transitive_closure()
60 this->worklist().push_back(*it_v); in do_transitive_closure()
/dragonfly/contrib/binutils-2.27/gold/
HDgc.cc37 while (!this->worklist().empty()) in do_transitive_closure()
41 Section_id entry = this->worklist().back(); in do_transitive_closure()
42 this->worklist().pop_back(); in do_transitive_closure()
60 this->worklist().push_back(*it_v); in do_transitive_closure()
/dragonfly/lib/libthread_xu/thread/
HDthr_list.c107 TAILQ_HEAD(, __pthread_s) worklist; in _thr_gc()
109 TAILQ_INIT(&worklist); in _thr_gc()
129 TAILQ_INSERT_HEAD(&worklist, td, gcle); in _thr_gc()
134 while ((td = TAILQ_FIRST(&worklist)) != NULL) { in _thr_gc()
135 TAILQ_REMOVE(&worklist, td, gcle); in _thr_gc()
/dragonfly/contrib/gcc-8.0/gcc/cp/
HDvtable-class-hierarchy.c323 add_to_worklist (struct work_node **worklist, struct vtv_graph_node *node, in add_to_worklist() argument
332 new_work_node->next = *worklist; in add_to_worklist()
334 *worklist = new_work_node; in add_to_worklist()
347 find_and_remove_next_leaf_node (struct work_node **worklist) in find_and_remove_next_leaf_node() argument
352 for (prev = NULL, cur = *worklist; cur; prev = cur, cur = cur->next) in find_and_remove_next_leaf_node()
357 (*worklist) = cur->next; in find_and_remove_next_leaf_node()
382 struct work_node *worklist = NULL; in vtv_compute_class_hierarchy_transitive_closure() local
403 add_to_worklist (&worklist, cur->class_info, inserted); in vtv_compute_class_hierarchy_transitive_closure()
409 while (worklist) in vtv_compute_class_hierarchy_transitive_closure()
412 find_and_remove_next_leaf_node (&worklist); in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dragonfly/contrib/gdb-7/gdb/python/
HDpy-type.c1006 VEC (type_equality_entry_d) **worklist) in check_types_equal()
1094 VEC_safe_push (type_equality_entry_d, *worklist, &entry); in check_types_equal()
1107 VEC_safe_push (type_equality_entry_d, *worklist, &entry); in check_types_equal()
1119 check_types_worklist (VEC (type_equality_entry_d) **worklist, in check_types_worklist() argument
1122 while (!VEC_empty (type_equality_entry_d, *worklist)) in check_types_worklist()
1127 entry = *VEC_last (type_equality_entry_d, *worklist); in check_types_worklist()
1128 VEC_pop (type_equality_entry_d, *worklist); in check_types_worklist()
1136 if (check_types_equal (entry.type1, entry.type2, worklist) == Py_NE) in check_types_worklist()
1166 VEC (type_equality_entry_d) *worklist = NULL; in typy_richcompare()
1173 VEC_safe_push (type_equality_entry_d, worklist, &entry); in typy_richcompare()
[all …]

123