Searched refs:worklist (Results 1 - 25 of 138) sorted by relevance

123456

/netbsd-current/external/gpl3/binutils.old/dist/gold/
H A Dgc.cc32 // Garbage collection uses a worklist style algorithm to determine the
37 while (!this->worklist().empty())
41 Section_id entry = this->worklist().back();
42 this->worklist().pop_back();
60 this->worklist().push_back(*it_v);
/netbsd-current/external/gpl3/binutils/dist/gold/
H A Dgc.cc32 // Garbage collection uses a worklist style algorithm to determine the
37 while (!this->worklist().empty())
41 Section_id entry = this->worklist().back();
42 this->worklist().pop_back();
60 this->worklist().push_back(*it_v);
/netbsd-current/external/gpl3/gdb.old/dist/gold/
H A Dgc.cc32 // Garbage collection uses a worklist style algorithm to determine the
37 while (!this->worklist().empty())
41 Section_id entry = this->worklist().back();
42 this->worklist().pop_back();
60 this->worklist().push_back(*it_v);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dreachability.h42 auto_vec<const node_t *> worklist; local
43 worklist.safe_push (target_node);
46 while (worklist.length () > 0)
48 const node_t *next = worklist.pop ();
55 worklist.safe_push (pred->m_src);
H A Dstate-purge.cc120 auto_vec<function_point> worklist; local
122 /* Add all immediate uses of name to the worklist.
165 add_to_worklist (point, &worklist,
176 add_to_worklist (point, &worklist, map.get_logger ());
188 add_to_worklist (point, &worklist, map.get_logger ());
198 /* Process worklist by walking backwards until we reach the def stmt. */
200 log_scope s (map.get_logger (), "processing worklist");
201 while (worklist.length () > 0)
203 function_point point = worklist.pop ();
204 process_point (point, &worklist, ma
250 add_to_worklist(const function_point &point, auto_vec<function_point> *worklist, logger *logger) argument
286 process_point(const function_point &point, auto_vec<function_point> *worklist, const state_purge_map &map) argument
334 worklist, logger); local
367 worklist, logger); local
377 worklist, logger); local
388 worklist, logger); local
398 worklist, logger); local
406 worklist, logger); local
[all...]
H A Dstate-purge.h133 auto_vec<function_point> *worklist,
137 auto_vec<function_point> *worklist,
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/
H A Dreachability.h42 auto_vec<const node_t *> worklist; local
43 worklist.safe_push (target_node);
46 while (worklist.length () > 0)
48 const node_t *next = worklist.pop ();
55 worklist.safe_push (pred->m_src);
H A Dtrimmed-graph.cc108 auto_vec <const exploded_node *> worklist; local
109 worklist.safe_push (inner_dst_node);
111 while (worklist.length () > 0)
113 const exploded_node *inner_node = worklist.pop ();
120 worklist.safe_push (inner_pred->m_src);
H A Dstate-purge.cc321 auto_vec<function_point> worklist; local
323 /* Add all immediate uses of name to the worklist.
366 add_to_worklist (point, &worklist,
377 add_to_worklist (point, &worklist, map.get_logger ());
389 add_to_worklist (point, &worklist, map.get_logger ());
399 /* Process worklist by walking backwards until we reach the def stmt. */
401 log_scope s (map.get_logger (), "processing worklist");
402 while (worklist.length () > 0)
404 function_point point = worklist.pop ();
405 process_point (point, &worklist, ma
459 add_to_worklist(const function_point &point, auto_vec<function_point> *worklist, logger *logger) argument
515 process_point(const function_point &point, auto_vec<function_point> *worklist, const state_purge_map &map) argument
580 worklist, logger); local
608 worklist, logger); local
626 worklist, logger); local
636 worklist, logger); local
647 worklist, logger); local
657 worklist, logger); local
665 worklist, logger); local
727 auto_vec<function_point> worklist; local
751 auto_vec<function_point> worklist; local
780 add_to_worklist(const function_point &point, auto_vec<function_point> *worklist, point_set_t *seen, logger *logger) argument
857 process_point_backwards(const function_point &point, auto_vec<function_point> *worklist, point_set_t *seen, const state_purge_map &map, const region_model &model) argument
891 worklist, seen, logger); local
919 worklist, seen, logger); local
952 worklist, seen, logger); local
962 worklist, seen, logger); local
973 worklist, seen, logger); local
983 worklist, seen, logger); local
996 process_point_forwards(const function_point &point, auto_vec<function_point> *worklist, point_set_t *seen, const state_purge_map &map) argument
[all...]
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-current/external/apache2/llvm/dist/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp43 SmallVector<const CFGBlock *, 11> worklist; local
51 worklist.push_back(Dst);
54 while (!worklist.empty()) {
55 const CFGBlock *block = worklist.pop_back_val();
69 // Add the predecessors to the worklist.
73 worklist.push_back(*i);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Ddomwalk.c292 basic_block *worklist = XNEWVEC (basic_block, local
324 worklist[sp++] = bb;
325 worklist[sp++] = NULL;
334 worklist[sp++] = dest;
335 /* Sort worklist after RPO order if requested. */
339 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp,
344 while (sp > 0 && !worklist[sp - 1])
347 bb = worklist[--sp];
357 bb = worklist[--sp];
361 free (worklist);
[all...]
H A Dlcm.c89 basic_block *worklist, *qin, *qout, *qend;
93 /* Allocate a worklist array/queue. Entries are only added to the
96 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
102 /* Put every block on the worklist; this is necessary because of the
114 qin = worklist;
115 qend = &worklist[n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS];
123 /* Iterate until the worklist is empty. */
126 /* Take the first entry off the worklist. */
131 qout = worklist;
135 the EXIT block. That way we never add then to the worklist
88 basic_block *worklist, *qin, *qout, *qend; local
236 basic_block *worklist, *qin, *qout, *qend, bb; local
498 basic_block *worklist, *qin, *qout, *qend, bb; local
628 basic_block *worklist, *tos, bb; local
[all...]
H A Dgraphite-scop-detection.c443 auto_bitmap worklist, in_sese_region; local
444 bitmap_set_bit (worklist, get_entry_bb (first)->index);
445 bitmap_set_bit (worklist, get_exit_bb (first)->index);
446 bitmap_set_bit (worklist, get_entry_bb (second)->index);
447 bitmap_set_bit (worklist, get_exit_bb (second)->index);
451 src to the worklist (for single-exit loops) by skipping
457 int index = bitmap_first_set_bit (worklist);
458 bitmap_clear_bit (worklist, index);
480 bitmap_set_bit (worklist, entry->src->index);
484 bitmap_set_bit (worklist,
657 auto_vec<basic_block> worklist; local
[all...]
H A Dsanopt.c978 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1);
979 bitmap_copy (worklist, with_poison);
982 while (!bitmap_empty_p (worklist))
984 unsigned i = bitmap_first_set_bit (worklist);
985 bitmap_clear_bit (worklist, i);
995 bitmap_set_bit (worklist, e->dest->index);
1076 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1);
1077 bitmap_copy (worklist, with_check);
1080 while (!bitmap_empty_p (worklist))
1082 unsigned i = bitmap_first_set_bit (worklist);
[all...]
H A Dtree-ssa-loop-unswitch.c125 auto_vec<tree> worklist; local
126 worklist.safe_push (name);
128 while (!worklist.is_empty ())
130 tree t = worklist.pop ();
152 worklist.safe_push (t);
179 worklist.safe_push (t);
381 basic_block *tos, *worklist; local
386 tos = worklist = XNEWVEC (basic_block, loop->num_nodes);
399 while (tos != worklist)
434 free (worklist);
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Ddomwalk.cc292 basic_block *worklist = XNEWVEC (basic_block, local
324 worklist[sp++] = bb;
325 worklist[sp++] = NULL;
334 worklist[sp++] = dest;
335 /* Sort worklist after RPO order if requested. */
339 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp,
344 while (sp > 0 && !worklist[sp - 1])
347 bb = worklist[--sp];
357 bb = worklist[--sp];
361 free (worklist);
[all...]
H A Dlcm.cc89 basic_block *worklist, *qin, *qout, *qend;
93 /* Allocate a worklist array/queue. Entries are only added to the
96 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
102 /* Put every block on the worklist; this is necessary because of the
114 qin = worklist;
115 qend = &worklist[n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS];
123 /* Iterate until the worklist is empty. */
126 /* Take the first entry off the worklist. */
131 qout = worklist;
135 the EXIT block. That way we never add then to the worklist
88 basic_block *worklist, *qin, *qout, *qend; local
236 basic_block *worklist, *qin, *qout, *qend, bb; local
498 basic_block *worklist, *qin, *qout, *qend, bb; local
628 basic_block *worklist, *tos, bb; local
[all...]
H A Dgraphite-scop-detection.cc443 auto_bitmap worklist, in_sese_region; local
444 bitmap_set_bit (worklist, get_entry_bb (first)->index);
445 bitmap_set_bit (worklist, get_exit_bb (first)->index);
446 bitmap_set_bit (worklist, get_entry_bb (second)->index);
447 bitmap_set_bit (worklist, get_exit_bb (second)->index);
451 src to the worklist (for single-exit loops) by skipping
457 int index = bitmap_first_set_bit (worklist);
458 bitmap_clear_bit (worklist, index);
480 bitmap_set_bit (worklist, entry->src->index);
484 bitmap_set_bit (worklist,
657 auto_vec<basic_block> worklist; local
[all...]
H A Dsanopt.cc981 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1);
982 bitmap_copy (worklist, with_poison);
985 while (!bitmap_empty_p (worklist))
987 unsigned i = bitmap_first_set_bit (worklist);
988 bitmap_clear_bit (worklist, i);
998 bitmap_set_bit (worklist, e->dest->index);
1079 auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1);
1080 bitmap_copy (worklist, with_check);
1083 while (!bitmap_empty_p (worklist))
1085 unsigned i = bitmap_first_set_bit (worklist);
[all...]
H A Dgimple-range-path.cc564 auto_vec<tree> worklist (bitmap_count_bits (imports));
570 worklist.quick_push (name);
574 while (!worklist.is_empty ())
576 tree name = worklist.pop ();
584 worklist.safe_push (rhs);
587 worklist.safe_push (rhs);
599 worklist.safe_push (arg);
H A Dtree-ssa-loop-unswitch.cc126 auto_vec<tree> worklist; local
127 worklist.safe_push (name);
129 while (!worklist.is_empty ())
131 tree t = worklist.pop ();
153 worklist.safe_push (t);
180 worklist.safe_push (t);
387 basic_block *tos, *worklist; local
392 tos = worklist = XNEWVEC (basic_block, loop->num_nodes);
405 while (tos != worklist)
440 free (worklist);
[all...]
/netbsd-current/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp87 SmallVector<const CFGBlock*, 10> worklist;
88 worklist.push_back(&cfg.getEntry());
90 while (!worklist.empty()) {
91 const CFGBlock *block = worklist.pop_back_val();
99 worklist.push_back(succ);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/cp/
H A Dvtable-class-hierarchy.c317 worklist more than once. Each node represents a class somewhere in
319 to the worklist exactly once and removed from the worklist exactly
323 add_to_worklist (struct work_node **worklist, struct vtv_graph_node *node, argument
332 new_work_node->next = *worklist;
334 *worklist = new_work_node;
347 find_and_remove_next_leaf_node (struct work_node **worklist) argument
352 for (prev = NULL, cur = *worklist; cur; prev = cur, cur = cur->next)
357 (*worklist) = cur->next;
382 struct work_node *worklist local
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/cp/
H A Dvtable-class-hierarchy.cc317 worklist more than once. Each node represents a class somewhere in
319 to the worklist exactly once and removed from the worklist exactly
323 add_to_worklist (struct work_node **worklist, struct vtv_graph_node *node, argument
332 new_work_node->next = *worklist;
334 *worklist = new_work_node;
347 find_and_remove_next_leaf_node (struct work_node **worklist) argument
352 for (prev = NULL, cur = *worklist; cur; prev = cur, cur = cur->next)
357 (*worklist) = cur->next;
382 struct work_node *worklist local
[all...]

Completed in 182 milliseconds

123456