Home
last modified time | relevance | path

Searched refs:BLOCK_CHAIN (Results 1 – 25 of 45) sorted by relevance

12

/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-ssa-live.c367 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) in mark_scope_block_unused()
493 tree next = BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
497 while (BLOCK_CHAIN (*t)) in remove_unused_scope_block_p()
500 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
502 BLOCK_CHAIN (*t) = next; in remove_unused_scope_block_p()
504 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
508 *t = BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
512 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
667 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) in dump_scope_block()
H A Dfunction.c1880 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t)) in instantiate_decls_1()
4500 next = BLOCK_CHAIN (block); in blocks_nreverse_all()
4501 BLOCK_CHAIN (block) = prev; in blocks_nreverse_all()
4538 BLOCK_CHAIN (block) = NULL_TREE; in reorder_blocks()
4554 block = BLOCK_CHAIN (block); in clear_block_marks()
4661 next = BLOCK_CHAIN (block); in blocks_nreverse()
4662 BLOCK_CHAIN (block) = prev; in blocks_nreverse()
4681 for (t1 = op1; BLOCK_CHAIN (t1); t1 = BLOCK_CHAIN (t1)) in block_chainon()
4683 BLOCK_CHAIN (t1) = op2; in block_chainon()
4688 for (t2 = op2; t2; t2 = BLOCK_CHAIN (t2)) in block_chainon()
[all …]
H A Dgimple-low.c101 BLOCK_CHAIN (data.block) = NULL_TREE; in lower_function_body()
436 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (old_block); in lower_gimple_bind()
H A Dtree-pretty-print.c1136 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t)) in dump_block_node()
1144 if (BLOCK_CHAIN (block)) in dump_block_node()
1147 for (t = BLOCK_CHAIN (block); t; t = BLOCK_CHAIN (t)) in dump_block_node()
H A Ddbxout.c3738 for (; block; block = BLOCK_CHAIN (block)) in dbx_block_with_cold_children()
3782 for (; block; block = BLOCK_CHAIN (block)) in dbxout_block()
H A Dprint-tree.c885 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4); in print_node()
H A Dtree-streamer-in.c957 BLOCK_CHAIN (expr) = BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr)); in lto_input_ts_block_tree_pointers()
H A Domp-grid.c1290 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (enc_block); in grid_attempt_target_gridification()
H A Dtree-inline.c733 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in remap_blocks()
747 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in remap_blocks_to_null()
4287 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block); in prepend_lexical_block()
4652 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id->block)) in expand_call_inline()
H A Dcfgexpand.c1720 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in expand_used_vars_for_block()
1738 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in clear_tree_used()
5943 block = BLOCK_CHAIN (block); in set_block_levels()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-ssa-live.c407 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) in mark_scope_block_unused()
514 tree next = BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
518 while (BLOCK_CHAIN (*t)) in remove_unused_scope_block_p()
521 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
523 BLOCK_CHAIN (*t) = next; in remove_unused_scope_block_p()
525 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
529 *t = BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
533 t = &BLOCK_CHAIN (*t); in remove_unused_scope_block_p()
645 for (t = BLOCK_SUBBLOCKS (scope); t ; t = BLOCK_CHAIN (t)) in dump_scope_block()
H A Dintegrate.c126 subblock = BLOCK_CHAIN (subblock)) in set_block_origin_self()
192 subblock = BLOCK_CHAIN (subblock)) in set_block_abstract_flags()
H A Dfunction.c1826 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t)) in instantiate_decls_1()
4042 next = BLOCK_CHAIN (block); in blocks_nreverse_all()
4043 BLOCK_CHAIN (block) = prev; in blocks_nreverse_all()
4077 BLOCK_CHAIN (block) = NULL_TREE; in reorder_blocks()
4095 block = BLOCK_CHAIN (block); in clear_block_marks()
4166 next = BLOCK_CHAIN (block); in blocks_nreverse()
4167 BLOCK_CHAIN (block) = prev; in blocks_nreverse()
4186 for (t1 = op1; BLOCK_CHAIN (t1); t1 = BLOCK_CHAIN (t1)) in block_chainon()
4188 BLOCK_CHAIN (t1) = op2; in block_chainon()
4193 for (t2 = op2; t2; t2 = BLOCK_CHAIN (t2)) in block_chainon()
[all …]
H A Dgimple-low.c106 BLOCK_CHAIN (data.block) = NULL_TREE; in lower_function_body()
500 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (old_block); in lower_gimple_bind()
H A Dxcoffout.c377 block = BLOCK_CHAIN (block); in xcoffout_block()
H A Dtree-pretty-print.c520 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t)) in dump_block_node()
528 if (BLOCK_CHAIN (block)) in dump_block_node()
531 for (t = BLOCK_CHAIN (block); t; t = BLOCK_CHAIN (t)) in dump_block_node()
H A Dtree-browser.c567 TB_SET_HEAD (BLOCK_CHAIN (head));
H A Dprint-tree.c923 print_node (file, "chain", BLOCK_CHAIN (node), indent + 4); in print_node()
H A Dtree-streamer-in.c808 BLOCK_CHAIN (expr) = BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr)); in lto_input_ts_block_tree_pointers()
H A Dsdbout.c673 block = BLOCK_CHAIN (block); in sdbout_block()
H A Dcfgexpand.c1281 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in expand_used_vars_for_block()
1299 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in clear_tree_used()
4189 block = BLOCK_CHAIN (block); in set_block_levels()
H A Dtree.def62 chained through the BLOCK_CHAIN field.
67 BLOCK_CHAIN points to the next BLOCK at the same level.
H A Dtree-inline.c669 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t)) in remap_blocks()
3742 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block); in prepend_lexical_block()
H A Dtree-nested.c2213 subblock = BLOCK_CHAIN (subblock)) in remap_vla_decls()
/dragonfly/contrib/gcc-8.0/gcc/c/
H A Dgimple-parser.c103 BLOCK_CHAIN (block) = NULL_TREE; in c_parser_parse_gimple_body()

12