Home
last modified time | relevance | path

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

1234567

/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dstate-purge.cc321 auto_vec<function_point> worklist; in state_purge_per_ssa_name() local
366 add_to_worklist (point, &worklist, in state_purge_per_ssa_name()
377 add_to_worklist (point, &worklist, map.get_logger ()); in state_purge_per_ssa_name()
389 add_to_worklist (point, &worklist, map.get_logger ()); in state_purge_per_ssa_name()
402 while (worklist.length () > 0) in state_purge_per_ssa_name()
404 function_point point = worklist.pop (); in state_purge_per_ssa_name()
405 process_point (point, &worklist, map); in state_purge_per_ssa_name()
460 auto_vec<function_point> *worklist, in add_to_worklist() argument
487 worklist->safe_push (point); in add_to_worklist()
516 auto_vec<function_point> *worklist, in process_point() argument
[all …]
H A Dreachability.h42 auto_vec<const node_t *> worklist; in reachability() local
43 worklist.safe_push (target_node); in reachability()
46 while (worklist.length () > 0) in reachability()
48 const node_t *next = worklist.pop (); in reachability()
55 worklist.safe_push (pred->m_src); in reachability()
H A Dtrimmed-graph.cc108 auto_vec <const exploded_node *> worklist; in trimmed_graph() local
109 worklist.safe_push (inner_dst_node); in trimmed_graph()
111 while (worklist.length () > 0) in trimmed_graph()
113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph()
120 worklist.safe_push (inner_pred->m_src); in trimmed_graph()
H A Dstate-purge.h174 auto_vec<function_point> *worklist,
178 auto_vec<function_point> *worklist,
211 auto_vec<function_point> *worklist,
216 auto_vec<function_point> *worklist,
221 auto_vec<function_point> *worklist,
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dstate-purge.cc120 auto_vec<function_point> worklist; in state_purge_per_ssa_name() local
165 add_to_worklist (point, &worklist, in state_purge_per_ssa_name()
176 add_to_worklist (point, &worklist, map.get_logger ()); in state_purge_per_ssa_name()
188 add_to_worklist (point, &worklist, map.get_logger ()); in state_purge_per_ssa_name()
201 while (worklist.length () > 0) in state_purge_per_ssa_name()
203 function_point point = worklist.pop (); in state_purge_per_ssa_name()
204 process_point (point, &worklist, map); in state_purge_per_ssa_name()
251 auto_vec<function_point> *worklist, in add_to_worklist() argument
278 worklist->safe_push (point); in add_to_worklist()
287 auto_vec<function_point> *worklist, in process_point() argument
[all …]
H A Dreachability.h42 auto_vec<const node_t *> worklist; in reachability() local
43 worklist.safe_push (target_node); in reachability()
46 while (worklist.length () > 0) in reachability()
48 const node_t *next = worklist.pop (); in reachability()
55 worklist.safe_push (pred->m_src); in reachability()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dlcm.cc88 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 …]
H A Ddomwalk.cc292 basic_block *worklist = XNEWVEC (basic_block, in walk() local
324 worklist[sp++] = bb; in walk()
325 worklist[sp++] = NULL; in walk()
334 worklist[sp++] = dest; in walk()
339 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp, in walk()
344 while (sp > 0 && !worklist[sp - 1]) in walk()
347 bb = worklist[--sp]; in walk()
357 bb = worklist[--sp]; in walk()
361 free (worklist); in walk()
H A Dgraphite-scop-detection.cc443 auto_bitmap worklist, in_sese_region; in merge_sese() local
444 bitmap_set_bit (worklist, get_entry_bb (first)->index); in merge_sese()
445 bitmap_set_bit (worklist, get_exit_bb (first)->index); in merge_sese()
446 bitmap_set_bit (worklist, get_entry_bb (second)->index); in merge_sese()
447 bitmap_set_bit (worklist, get_exit_bb (second)->index); in merge_sese()
457 int index = bitmap_first_set_bit (worklist); in merge_sese()
458 bitmap_clear_bit (worklist, index); in merge_sese()
480 bitmap_set_bit (worklist, entry->src->index); in merge_sese()
484 bitmap_set_bit (worklist, e->src->index); in merge_sese()
494 bitmap_set_bit (worklist, exit->dest->index); in merge_sese()
[all …]
H A Dtree-ssa-loop-unswitch.cc126 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()
387 basic_block *tos, *worklist; in tree_unswitch_single_loop() local
392 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
405 while (tos != worklist) in tree_unswitch_single_loop()
440 free (worklist); in tree_unswitch_single_loop()
H A Dsanopt.cc981 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_unpoison() local
982 bitmap_copy (worklist, with_poison); in sanitize_asan_mark_unpoison()
985 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_unpoison()
987 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_unpoison()
988 bitmap_clear_bit (worklist, i); in sanitize_asan_mark_unpoison()
998 bitmap_set_bit (worklist, e->dest->index); in sanitize_asan_mark_unpoison()
1079 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_poison() local
1080 bitmap_copy (worklist, with_check); in sanitize_asan_mark_poison()
1083 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_poison()
1085 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_poison()
[all …]
H A Dtree-ssa-uninit.cc1176 vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) in find_uninit_use() argument
1231 worklist->safe_push (as_a<gphi *> (use_stmt)); in find_uninit_use()
1248 warn_uninitialized_phi (gphi *phi, vec<gphi *> *worklist, in warn_uninitialized_phi() argument
1266 worklist, added_to_worklist); in warn_uninitialized_phi()
1343 vec<gphi *> worklist = vNULL; in execute_late_warn_uninitialized() local
1379 worklist.safe_push (phi); in execute_late_warn_uninitialized()
1392 while (worklist.length () != 0) in execute_late_warn_uninitialized()
1395 cur_phi = worklist.pop (); in execute_late_warn_uninitialized()
1396 warn_uninitialized_phi (cur_phi, &worklist, &added_to_worklist); in execute_late_warn_uninitialized()
1399 worklist.release (); in execute_late_warn_uninitialized()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dlcm.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 …]
H A Ddomwalk.c292 basic_block *worklist = XNEWVEC (basic_block, in walk() local
324 worklist[sp++] = bb; in walk()
325 worklist[sp++] = NULL; in walk()
334 worklist[sp++] = dest; in walk()
339 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp, in walk()
344 while (sp > 0 && !worklist[sp - 1]) in walk()
347 bb = worklist[--sp]; in walk()
357 bb = worklist[--sp]; in walk()
361 free (worklist); in walk()
H A Dgraphite-scop-detection.c443 auto_bitmap worklist, in_sese_region; in merge_sese() local
444 bitmap_set_bit (worklist, get_entry_bb (first)->index); in merge_sese()
445 bitmap_set_bit (worklist, get_exit_bb (first)->index); in merge_sese()
446 bitmap_set_bit (worklist, get_entry_bb (second)->index); in merge_sese()
447 bitmap_set_bit (worklist, get_exit_bb (second)->index); in merge_sese()
457 int index = bitmap_first_set_bit (worklist); in merge_sese()
458 bitmap_clear_bit (worklist, index); in merge_sese()
480 bitmap_set_bit (worklist, entry->src->index); in merge_sese()
484 bitmap_set_bit (worklist, e->src->index); in merge_sese()
494 bitmap_set_bit (worklist, exit->dest->index); in merge_sese()
[all …]
H A Dtree-ssa-loop-unswitch.c125 auto_vec<tree> worklist; in is_maybe_undefined() local
126 worklist.safe_push (name); in is_maybe_undefined()
128 while (!worklist.is_empty ()) in is_maybe_undefined()
130 tree t = worklist.pop (); in is_maybe_undefined()
152 worklist.safe_push (t); in is_maybe_undefined()
179 worklist.safe_push (t); in is_maybe_undefined()
381 basic_block *tos, *worklist; in tree_unswitch_single_loop() local
386 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
399 while (tos != worklist) in tree_unswitch_single_loop()
434 free (worklist); in tree_unswitch_single_loop()
H A Dsanopt.c978 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_unpoison()
979 bitmap_copy (worklist, with_poison); in sanitize_asan_mark_unpoison()
982 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_unpoison()
984 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_unpoison()
985 bitmap_clear_bit (worklist, i); in sanitize_asan_mark_unpoison()
995 bitmap_set_bit (worklist, e->dest->index); in sanitize_asan_mark_unpoison()
1076 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1); in sanitize_asan_mark_poison()
1077 bitmap_copy (worklist, with_check); in sanitize_asan_mark_poison()
1080 while (!bitmap_empty_p (worklist)) in sanitize_asan_mark_poison()
1082 unsigned i = bitmap_first_set_bit (worklist); in sanitize_asan_mark_poison()
[all …]
H A Dtree-ssa-dce.c81 static vec<gimple *> worklist; variable
146 worklist.safe_push (stmt); in mark_stmt_necessary()
189 worklist.safe_push (stmt); in mark_operand_necessary()
733 while (worklist.length () > 0) in propagate_necessity()
736 stmt = worklist.pop (); in propagate_necessity()
1656 worklist.create (64); in tree_dce_init()
1676 worklist.release (); in tree_dce_done()
1867 simple_dce_from_worklist (bitmap worklist) in simple_dce_from_worklist() argument
1869 while (! bitmap_empty_p (worklist)) in simple_dce_from_worklist()
1872 unsigned i = bitmap_first_set_bit (worklist); in simple_dce_from_worklist()
[all …]
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/gpl3/binutils/dist/gold/
H A Dgc.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()
/netbsd-src/external/gpl3/binutils.old/dist/gold/
H A Dgc.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()
/netbsd-src/external/gpl3/gcc/dist/gcc/cp/
H A Dvtable-class-hierarchy.cc323 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 …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/cp/
H A Dvtable-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 …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/
H A Dthompson.d102 recycle(worklist); in with()
312 worklist.insertFront(fork(t, t.pc + IRL!(IR.RepeatEnd), t.counter % step)); in with()
319 worklist.insertFront(fork(t, t.pc - len, t.counter + step)); in with()
362 worklist.insertFront(fork(t, pc2, t.counter)); in with()
391 worklist.insertFront(fork(t, pc2, t.counter)); in with()
435 worklist.insertFront(fork(t, next, t.counter)); in with()
502 t = worklist.fetch(); in with()
577 recycle(worklist); in with()
605 t = worklist.fetch(); in with()
621 t = worklist.fetch(); in with()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/
H A Dthompson.d102 recycle(worklist); in with()
312 worklist.insertFront(fork(t, t.pc + IRL!(IR.RepeatEnd), t.counter % step)); in with()
319 worklist.insertFront(fork(t, t.pc - len, t.counter + step)); in with()
362 worklist.insertFront(fork(t, pc2, t.counter)); in with()
391 worklist.insertFront(fork(t, pc2, t.counter)); in with()
435 worklist.insertFront(fork(t, next, t.counter)); in with()
502 t = worklist.fetch(); in with()
575 recycle(worklist); in with()
603 t = worklist.fetch(); in with()
619 t = worklist.fetch(); in with()
[all …]

1234567