| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| reachability.h | 42 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);
|
| trimmed-graph.cc | 96 auto_vec <const exploded_node *> worklist; local
97 worklist.safe_push (inner_dst_node);
99 while (worklist.length () > 0)
101 const exploded_node *inner_node = worklist.pop ();
108 worklist.safe_push (inner_pred->m_src);
|
| state-purge.cc | 317 auto_vec<function_point> worklist; local
319 /* Add all immediate uses of name to the worklist.
371 add_to_worklist (point, &worklist,
382 add_to_worklist (point, &worklist, map.get_logger ());
394 add_to_worklist (point, &worklist, map.get_logger ());
404 /* Process worklist by walking backwards until we reach the def stmt. */
406 log_scope s (map.get_logger (), "processing worklist");
407 while (worklist.length () > 0)
409 function_point point = worklist.pop ();
410 process_point (point, &worklist, map)
585 worklist, logger); local
613 worklist, logger); local
631 worklist, logger); local
641 worklist, logger); local
652 worklist, logger); local
662 worklist, logger); local
670 worklist, logger); local
732 auto_vec<function_point> worklist; local
756 auto_vec<function_point> worklist; local
900 worklist, seen, logger); local
928 worklist, seen, logger); local
961 worklist, seen, logger); local
971 worklist, seen, logger); local
982 worklist, seen, logger); local
992 worklist, seen, logger); local
[all...] |
| state-purge.h | 175 auto_vec<function_point> *worklist,
179 auto_vec<function_point> *worklist,
212 auto_vec<function_point> *worklist,
217 auto_vec<function_point> *worklist,
222 auto_vec<function_point> *worklist,
|
| infinite-recursion.cc | 345 auto_vec<exploded_node *> worklist; local
350 worklist.safe_push (in_edge->m_src);
352 while (worklist.length () > 0)
354 exploded_node *iter = worklist.pop ();
364 worklist.safe_push (in_edge->m_src);
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| reachability.h | 42 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);
|
| trimmed-graph.cc | 108 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);
|
| state-purge.cc | 321 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, map)
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
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
[all...] |
| state-purge.h | 174 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,
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 43 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);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| domwalk.cc | 294 basic_block *worklist = XNEWVEC (basic_block, local
326 worklist[sp++] = bb;
327 worklist[sp++] = NULL;
336 worklist[sp++] = dest;
337 /* Sort worklist after RPO order if requested. */
341 sort_bbs_postorder (&worklist[saved_sp], sp - saved_sp,
346 while (sp > 0 && !worklist[sp - 1])
349 bb = worklist[--sp];
359 bb = worklist[--sp];
363 free (worklist);
[all...] |
| lcm.cc | 86 basic_block *worklist, *qin, *qout, *qend;
90 /* Allocate a worklist array/queue. Entries are only added to the
93 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
99 /* Put every block on the worklist; this is necessary because of the
116 qin = worklist;
117 qend = &worklist[n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS];
125 /* Iterate until the worklist is empty. */
128 /* Take the first entry off the worklist. */
133 qout = worklist;
137 the EXIT block. That way we never add then to the worklist
85 basic_block *worklist, *qin, *qout, *qend; local
238 basic_block *worklist, *qin, *qout, *qend, bb; local
499 basic_block *worklist, *qin, *qout, *qend, bb; local
627 basic_block *worklist, *tos, bb; local
[all...] |
| gimple-ssa-sccopy.cc | 103 unvisited Vertex hasn't yet been popped from worklist.
144 auto_vec<unsigned> worklist; /* DFS stack. */ member in class:__anon13742::scc_discovery
182 /* Put unvisited neighbors on worklist. Update lowlink of parent
187 worklist.safe_push (neigh_version);
245 worklist.safe_push (i);
248 /* Worklist loop. */
250 while (!worklist.is_empty ())
252 unsigned i = worklist.pop ();
265 /* Put vertex on stack and also on worklist to be closed later. */
267 worklist.safe_push (i)
547 auto_vec<vec<gimple *>> worklist = discovery.compute_sccs (useful_stmts); local
[all...] |
| graphite-scop-detection.cc | 453 auto_bitmap worklist, in_sese_region; local
454 bitmap_set_bit (worklist, get_entry_bb (first)->index);
455 bitmap_set_bit (worklist, get_exit_bb (first)->index);
456 bitmap_set_bit (worklist, get_entry_bb (second)->index);
457 bitmap_set_bit (worklist, get_exit_bb (second)->index);
461 src to the worklist (for single-exit loops) by skipping
467 int index = bitmap_clear_first_set_bit (worklist);
489 bitmap_set_bit (worklist, entry->src->index);
493 bitmap_set_bit (worklist, e->src->index);
503 bitmap_set_bit (worklist, exit->dest->index)
747 auto_vec<basic_block> worklist; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| domwalk.cc | 292 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...] |
| lcm.cc | 89 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...] |
| graphite-scop-detection.cc | 443 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, e->src->index)
657 auto_vec<basic_block> worklist; local
[all...] |
| sanopt.cc | 981 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...] |
| gimple-range-path.cc | 564 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);
|
| tree-ssa-loop-unswitch.cc | 126 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...] |
| tree-ssa-uninit.cc | 1169 holding the position(s) of uninit PHI operands. WORKLIST
1172 if the new phi is already in the worklist. */
1176 vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist)
1222 add the phi to the worklist. */
1227 fprintf (dump_file, "[WORKLIST]: Update worklist with phi: ");
1231 worklist->safe_push (as_a<gphi *> (use_stmt));
1243 by the compiler, the fewer false positives the warning is. WORKLIST
1245 a pointer set tracking if the new phi is added to the worklist or not. */
1248 warn_uninitialized_phi (gphi *phi, vec<gphi *> *worklist,
1343 vec<gphi *> worklist = vNULL; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-selftests.cc | 162 const std::vector<poly_int64> &worklist)
181 for (const poly_int64 &poly_val : worklist)
194 std::vector<poly_int64> worklist local
226 run_poly_int_selftest ("rv64imafdv", ABI_LP64D, POLY_TEST_PMODE, worklist);
228 worklist);
229 run_poly_int_selftest ("rv32imafdv", ABI_ILP32, POLY_TEST_PMODE, worklist);
230 run_poly_int_selftest ("rv32imafdv", ABI_ILP32, POLY_TEST_DIMODE, worklist);
232 worklist);
234 worklist);
257 std::vector<HOST_WIDE_INT> worklist = {-111, -17, -16, 7, 15, 16, 111} local
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| DeadStoresChecker.cpp | 87 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);
|
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| vtable-class-hierarchy.cc | 314 vtv_graph_node to the WORKLIST, which is a linked list of
317 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,
332 new_work_node->next = *worklist;
334 *worklist = new_work_node;
341 the WORKLIST of class hierarchy nodes looking for a "leaf" node,
344 the linked list (WORKLIST) and returns the node. */
347 find_and_remove_next_leaf_node (struct work_node **worklist)
382 struct work_node *worklist = NULL; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| vtable-class-hierarchy.cc | 314 vtv_graph_node to the WORKLIST, which is a linked list of
317 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,
332 new_work_node->next = *worklist;
334 *worklist = new_work_node;
341 the WORKLIST of class hierarchy nodes looking for a "leaf" node,
344 the linked list (WORKLIST) and returns the node. */
347 find_and_remove_next_leaf_node (struct work_node **worklist)
382 struct work_node *worklist = NULL; local
[all...] |
