/haiku-buildtools/gcc/gcc/ |
H A D | domwalk.c | 164 basic_block *worklist = XNEWVEC (basic_block, local 192 worklist[sp++] = bb; 193 worklist[sp++] = NULL; 198 worklist[sp++] = dest; 206 qsort (&worklist[saved_sp], sp - saved_sp, 211 while (sp > 0 && !worklist[sp - 1]) 214 bb = worklist[--sp]; 221 bb = worklist[--sp]; 230 free (worklist);
|
H A D | lcm.c | 108 basic_block *worklist, *qin, *qout, *qend; 112 /* Allocate a worklist array/queue. Entries are only added to the 115 qin = qout = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); 121 /* Put every block on the worklist; this is necessary because of the 133 qin = worklist; 134 qend = &worklist[n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS]; 142 /* Iterate until the worklist is empty. */ 145 /* Take the first entry off the worklist. */ 150 qout = worklist; 154 the EXIT block. That way we never add then to the worklist 107 basic_block *worklist, *qin, *qout, *qend; local 261 basic_block *worklist, *qin, *qout, *qend, bb; local 524 basic_block *worklist, *qin, *qout, *qend, bb; local 661 basic_block *worklist, *tos, bb; local [all...] |
H A D | tree-ssa-loop-unswitch.c | 308 basic_block *tos, *worklist; local 313 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); 326 while (tos != worklist) 361 free (worklist);
|
H A D | tree-ssa-pre.c | 2166 auto_vec<basic_block> worklist (EDGE_COUNT (block->succs)); 2173 worklist.quick_push (e->dest); 2192 FOR_EACH_VEC_ELT (worklist, i, bprime) 2314 auto_vec<basic_block> worklist (EDGE_COUNT (block->succs)); 2319 worklist.quick_push (e->dest); 2321 if (worklist.length () > 0) 2323 FOR_EACH_VEC_ELT (worklist, i, bprime) 2423 sbitmap worklist = sbitmap_alloc (last_basic_block_for_fn (cfun) + 1); local 2424 bitmap_ones (worklist); 2437 if (bitmap_bit_p (worklist, postorde 3639 basic_block *worklist; local 4671 bitmap worklist; local [all...] |
H A D | tree-ssa-tail-merge.c | 246 in_worklist indicates whether it's currently part of worklist. */ 259 /* Indicates whether the struct is currently in the worklist. */ 693 static vec<same_succ> worklist; variable 695 /* Prints worklist to FILE. */ 701 for (i = 0; i < worklist.length (); ++i) 702 same_succ_print (file, worklist[i]); 705 /* Adds SAME to worklist. */ 717 worklist.safe_push (same); 791 /* Initializes worklist administration. */ 801 worklist [all...] |
H A D | tree-ssa-dce.c | 117 static vec<gimple> worklist; variable 152 worklist if ADD_TO_WORKLIST is true. */ 171 worklist.safe_push (stmt); 214 worklist.safe_push (stmt); 218 /* Mark STMT as necessary if it obviously is. Add it to the worklist if 643 Process the uses on each statement in the worklist, and add all 645 value to the worklist. 655 fprintf (dump_file, "\nProcessing worklist:\n"); 657 while (worklist.length () > 0) 659 /* Take STMT from worklist [all...] |
H A D | tree-cfgcleanup.c | 1000 basic_block *worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun)); local 1001 basic_block *current = worklist; 1072 while (current != worklist) 1077 free (worklist);
|
H A D | tree-ssa-uninit.c | 2260 if the new phi is already in the worklist. */ 2264 vec<gphi *> *worklist, 2303 add the phi to the worklist. */ 2308 fprintf (dump_file, "[WORKLIST]: Update worklist with phi: "); 2312 worklist->safe_push (as_a <gphi *> (use_stmt)); 2326 a pointer set tracking if the new phi is added to the worklist or not. */ 2329 warn_uninitialized_phi (gphi *phi, vec<gphi *> *worklist, argument 2355 worklist, added_to_worklist); 2416 vec<gphi *> worklist = vNULL; local 2430 /* Initialize worklist */ 2263 find_uninit_use(gphi *phi, unsigned uninit_opnds, vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) argument [all...] |
H A D | tree-if-conv.c | 2639 vec<gimple> worklist; local 2644 worklist.create (64); 2650 worklist.safe_push (phi); 2661 worklist.safe_push (stmt); 2668 worklist.safe_push (stmt); 2682 worklist.safe_push (stmt); 2689 while (worklist.length () > 0) 2695 stmt = worklist.pop (); 2706 worklist.safe_push (stmt1);
|
H A D | dce.c | 70 static vec<rtx_insn *> worklist; variable 198 the worklist. */ 206 worklist.safe_push (insn); 209 fprintf (dump_file, " Adding insn %d to worklist\n", INSN_UID (insn)); 780 while (worklist.length () > 0) 782 insn = worklist.pop (); 785 worklist.release ();
|
H A D | tree-into-ssa.c | 831 Instead, we basically emulate standard dce. We put all uses to worklist, 834 add the predecessors of its basic block to the worklist. 870 auto_vec<int> worklist (n_defs + 1); 871 worklist.quick_push (1); 881 worklist.pop (); 882 top = worklist[worklist.length () - 1]; 892 worklist.quick_push (b); 903 worklist.pop (); 904 gcc_assert (worklist [all...] |
H A D | tree-ssa-loop-manip.c | 219 auto_vec<basic_block> worklist (MAX (8, n_basic_blocks_for_fn (cfun) / 128)); 230 worklist.safe_push (use_bb); 233 /* Iterate until the worklist is empty. */ 234 while (! worklist.is_empty ()) 239 /* Pull a block off the worklist. */ 240 basic_block bb = worklist.pop (); 244 worklist.reserve (EDGE_COUNT (bb->preds)); 272 /* If we have visited PRED before, don't add it to the worklist. 279 worklist.quick_push (pred);
|
H A D | df-core.c | 1014 DATAFLOW is problem we are solving, PENDING is worklist of basic blocks we 1041 bitmap worklist = BITMAP_ALLOC (&df_bitmap_obstack); 1058 /* Swap pending and worklist. */ 1059 bitmap temp = worklist; 1060 worklist = pending; 1063 EXECUTE_IF_SET_IN_BITMAP (worklist, 0, index, bi) 1086 bitmap_clear (worklist); 1091 BITMAP_FREE (worklist); 1104 /* Worklist-based dataflow solver. It uses sbitmap as a worklist, 1108 The only significant difference is that the worklist i 1040 bitmap worklist = BITMAP_ALLOC (&df_bitmap_obstack); local [all...] |
H A D | cfganal.c | 168 basic_block *tos, *worklist, bb; 170 tos = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); 177 /* Add our starting points to the worklist. Almost always there will 191 while (tos != worklist) 207 free (worklist); 1317 /* Pop a block off the worklist, add every block that appears in 1319 the worklist. Iterate until the worklist is empty. Blocks 1320 which are added to the worklist are potential sites for 167 basic_block *tos, *worklist, bb; local
|
H A D | trans-mem.c | 3409 /* Is the current BB in the worklist? */ 3638 basic_block *worklist, *qin, *qout, *qend, bb; 3643 /* Allocate a worklist array/queue. Entries are only added to the 3647 qin = qout = worklist = 3650 /* Put every block in the region on the worklist. */ 3667 qin = worklist; 3668 qend = &worklist[qlen]; 3670 /* Iterate until the worklist is empty. */ 3673 /* Take the first entry off the worklist. */ 3678 qout = worklist; [all...] |
H A D | ipa-split.c | 253 vec<basic_block> worklist = vNULL; local 263 worklist.safe_push (e->src); 267 while (!worklist.is_empty ()) 269 bb = worklist.pop (); 276 worklist.safe_push (e->src); 357 worklist.release ();
|
H A D | ipa-icf.h | 47 /* Flag is used in case we want to remove a class from worklist and 486 std::list<congruence_class *> worklist; member in class:ipa_icf::sem_item_optimizer 547 /* Adds a newly created congruence class CLS to worklist. */ 550 /* Pops a class from worklist. */
|
H A D | bt-load.c | 917 basic_block *worklist, *tos; 919 tos = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun) + 1); 961 while (tos != worklist) 994 free (worklist); 916 basic_block *worklist, *tos; local
|
H A D | tree-ssa-propagate.c | 80 the CFG worklist is seeded with all the statements in the entry 150 unnecessarily when draining an SSA edge worklist. If while 162 /* Array of control flow edges on the worklist. */ 180 varying (this worklist), and the other contains all other SSA edges 187 thing using the VARYING worklist achieves. In addition, if we 188 don't use a separate worklist for VARYING edges, we end up with 194 /* Return true if the block worklist empty. */ 203 /* Add a basic block to the worklist. The block must not be already 204 in the worklist, and it must not be the ENTRY or EXIT block. */ 254 /* Remove a block from the worklist [all...] |
H A D | tree-predcom.c | 2364 auto_vec<chain_p> worklist; variable 2368 worklist.safe_push (ch1); 2370 while (!worklist.is_empty ()) 2372 ch1 = worklist.pop (); 2384 worklist.safe_push (cch);
|
H A D | lra.c | 2111 basic_block *tos, *worklist, bb; 2118 tos = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun) + 1); 2123 /* Place the exit block on our worklist. */ 2128 while (tos != worklist) 2135 free (worklist); 2149 free (worklist); 2103 basic_block *tos, *worklist, bb; local
|
/haiku-buildtools/binutils/gold/ |
H A D | gc.cc | 32 // 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);
|
H A D | gc.h | 72 worklist() function in class:gold::Garbage_collection
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20041122-1.c | 22 basic_block *tos, *worklist; local 23 tos = worklist = xmalloc (sizeof (basic_block) * n_basic_blocks); 30 return worklist;
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | vtable-class-hierarchy.c | 329 worklist more than once. Each node represents a class somewhere in 331 to the worklist exactly once and removed from the worklist exactly 335 add_to_worklist (struct work_node **worklist, struct vtv_graph_node *node, argument 344 new_work_node->next = *worklist; 346 *worklist = new_work_node; 359 find_and_remove_next_leaf_node (struct work_node **worklist) argument 364 for (prev = NULL, cur = *worklist; cur; prev = cur, cur = cur->next) 369 (*worklist) = cur->next; 394 struct work_node *worklist local [all...] |