HomeSort by: relevance | last modified time | path
    Searched defs:worklist (Results 1 - 25 of 112) sorted by relevancy

1 2 3 4 5

  /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/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);
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);
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...]
  /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...]
  /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...]
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...]
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...]
fwprop.cc 980 /* ??? This code uses a worklist in order to preserve the behavior
984 auto_vec<insn_info *> worklist;
990 worklist.safe_push (insn);
992 for (unsigned int i = 0; i < worklist.length (); ++i)
994 insn_info *insn = worklist[i];
996 worklist.safe_push (insn);
983 auto_vec<insn_info *> worklist; local
ipa-free-lang-data.cc 61 /* Worklist to avoid excessive recursion. */
62 auto_vec<tree> worklist; member in class:__anon13783::free_lang_data_d
89 /* Push tree node T into FLD->WORKLIST. */
95 fld->worklist.safe_push ((t));
877 if (fld->worklist.is_empty ())
879 t = fld->worklist.pop ();
ipa-icf.h 48 /* Flag is used in case we want to remove a class from worklist and
528 /* Worklist of congruence classes that can potentially
530 fibonacci_heap<unsigned, congruence_class> worklist; member in class:ipa_icf::sem_item_optimizer
599 /* Adds a newly created congruence class CLS to worklist. */
602 /* Pops a class from worklist. */
dce.cc 54 static vec<rtx_insn *> worklist; variable
216 the worklist. */
224 worklist.safe_push (insn);
227 fprintf (dump_file, " Adding insn %d to worklist\n", INSN_UID (insn));
809 while (worklist.length () > 0)
811 insn = worklist.pop ();
814 worklist.release ();
ipa-utils.cc 927 struct worklist struct
936 auto_vec<worklist, 32> worklist_vec;
951 worklist we = {EXIT_BLOCK_PTR_FOR_FN (fun), NULL};
955 worklist &w = worklist_vec.last ();
978 worklist we = {bb2, NULL};
984 worklist we = {e->src, NULL};
987 /* Keep BB on worklist so we process it last time. */
  /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...]
fwprop.cc 973 /* ??? This code uses a worklist in order to preserve the behavior
977 auto_vec<insn_info *> worklist;
983 worklist.safe_push (insn);
985 for (unsigned int i = 0; i < worklist.length (); ++i)
987 insn_info *insn = worklist[i];
989 worklist.safe_push (insn);
976 auto_vec<insn_info *> worklist; local
ipa-free-lang-data.cc 61 /* Worklist to avoid excessive recursion. */
62 auto_vec<tree> worklist; member in class:__anon16213::free_lang_data_d
89 /* Push tree node T into FLD->WORKLIST. */
95 fld->worklist.safe_push ((t));
877 if (fld->worklist.is_empty ())
879 t = fld->worklist.pop ();
ipa-icf.h 48 /* Flag is used in case we want to remove a class from worklist and
524 /* Worklist of congruence classes that can potentially
526 fibonacci_heap<unsigned, congruence_class> worklist; member in class:ipa_icf::sem_item_optimizer
595 /* Adds a newly created congruence class CLS to worklist. */
598 /* Pops a class from worklist. */
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...]
  /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/llvm/lib/Analysis/
LazyValueInfo.cpp 47 // This is the number of worklist items we will process to try to discover an
298 std::vector<BasicBlock*> worklist; local
299 worklist.push_back(OldSucc);
307 // Use a worklist to perform a depth-first search of OldSucc's successors.
311 while (!worklist.empty()) {
312 BasicBlock *ToUpdate = worklist.back();
313 worklist.pop_back();
336 llvm::append_range(worklist, successors(ToUpdate));
  /src/external/gpl3/gcc/dist/gcc/rtl-ssa/
blocks.cc 641 auto_bitmap worklist; local
660 bitmap_set_bit (worklist, b2);
663 while (!bitmap_empty_p (worklist))
665 unsigned int b1 = bitmap_first_set_bit (worklist);
666 bitmap_clear_bit (worklist, b1);
682 bitmap_set_bit (worklist, b2);

Completed in 43 milliseconds

1 2 3 4 5