| /openbsd/gnu/gcc/gcc/ |
| H A D | gimple-low.c | 559 tree value, t, label; in lower_return_expr() local
575 label = TREE_PURPOSE (t); in lower_return_expr()
581 label = create_artificial_label (); in lower_return_expr()
582 data->return_statements = tree_cons (label, stmt, data->return_statements); in lower_return_expr()
586 t = build1 (GOTO_EXPR, void_type_node, label); in lower_return_expr()
|
| H A D | gimplify.c | 1479 tree label = create_artificial_label (); in build_and_jump() local
1480 *label_p = label; in build_and_jump()
5193 tree oldval, oldival, oldival2, newval, newival, label; in gimplify_omp_atomic_pipeline() local
5237 label = create_artificial_label (); in gimplify_omp_atomic_pipeline()
5238 x = build1 (LABEL_EXPR, void_type_node, label); in gimplify_omp_atomic_pipeline()
5277 build1 (GOTO_EXPR, void_type_node, label), NULL); in gimplify_omp_atomic_pipeline()
|
| H A D | haifa-sched.c | 3630 rtx x, label; in init_before_recovery() local
3650 LABEL_NUSES (label)++; in init_before_recovery()
3673 rtx label; in create_recovery_block() local
3687 rec = create_basic_block (label, label, before_recovery); in create_recovery_block()
3727 label = 0; in create_check_block_twin()
4150 if (LABEL_P (label)) in unlink_bb_notes()
4151 note = NEXT_INSN (label); in unlink_bb_notes()
4153 note = label; in unlink_bb_notes()
4194 if (LABEL_P (label)) in restore_bb_notes()
4195 note = NEXT_INSN (label); in restore_bb_notes()
[all …]
|
| H A D | insn-notes.def | 56 just before the return insn or return label. In an optimizing
|
| H A D | jump.c | 324 rtx label; in get_label_before() local
330 if (label == 0 || !LABEL_P (label)) in get_label_before()
338 return label; in get_label_before()
346 rtx label; in get_label_after() local
352 if (label == 0 || !LABEL_P (label)) in get_label_after()
358 return label; in get_label_after()
1049 rtx value = label; in follow_jumps()
1075 return label; in follow_jumps()
1085 return label; in follow_jumps()
1140 if (NOTE_P (label) in mark_jump_label()
[all …]
|
| H A D | langhooks.c | 181 char *label; in lhd_set_decl_assembler_name() local
183 ASM_FORMAT_PRIVATE_NAME (label, name, DECL_UID (decl)); in lhd_set_decl_assembler_name()
184 SET_DECL_ASSEMBLER_NAME (decl, get_identifier (label)); in lhd_set_decl_assembler_name()
|
| H A D | loop-doloop.c | 234 rtx seq, jump, label; in add_test() local
247 label = block_label (dest); in add_test()
248 do_compare_rtx_and_jump (op0, op1, code, 0, mode, NULL_RTX, NULL_RTX, label); in add_test()
271 JUMP_LABEL (jump) = label; in add_test()
277 LABEL_NUSES (label)++; in add_test()
|
| H A D | loop-unswitch.c | 92 compare_and_jump_seq (rtx op0, rtx op1, enum rtx_code comp, rtx label, int prob, in compare_and_jump_seq() argument
116 redirect_jump (jump, label, 0); in compare_and_jump_seq()
125 mode, NULL_RTX, NULL_RTX, label); in compare_and_jump_seq()
127 JUMP_LABEL (jump) = label; in compare_and_jump_seq()
128 LABEL_NUSES (label)++; in compare_and_jump_seq()
|
| H A D | optabs.c | 2928 rtx label; in expand_copysign_absneg() local
2981 label = gen_label_rtx (); in expand_copysign_absneg()
2991 emit_label (label); in expand_copysign_absneg()
3784 if (label) in emit_cmp_and_jump_insn_1()
3804 if (label) in emit_cmp_and_jump_insn_1()
3817 if (label) in emit_cmp_and_jump_insn_1()
3860 gcc_assert (label); in emit_cmp_and_jump_insns()
4616 emit_label (label); in expand_float()
4636 0, label); in expand_float()
4647 emit_label (label); in expand_float()
[all …]
|
| H A D | print-rtl.c | 312 const char *label = NOTE_DELETED_LABEL_NAME (in_rtx); in print_rtx() local
313 if (label) in print_rtx()
314 fprintf (outfile, " (\"%s\")", label); in print_rtx()
|
| H A D | reload1.c | 3440 set_initial_eh_label_offset (rtx label) in set_initial_eh_label_offset() argument
3442 set_label_offsets (label, NULL_RTX, 1); in set_initial_eh_label_offset()
|
| H A D | reorg.c | 862 && label != 0 in get_jump_flags()
2880 rtx label; in fill_slots_from_thread() local
2893 label = find_end_label (); in fill_slots_from_thread()
2895 label = new_thread; in fill_slots_from_thread()
2899 if (label) in fill_slots_from_thread()
3098 if (label) in relax_delay_slots()
3099 ++LABEL_NUSES (label); in relax_delay_slots()
3107 if (label) in relax_delay_slots()
3108 --LABEL_NUSES (label); in relax_delay_slots()
3347 if (label == 0) in relax_delay_slots()
[all …]
|
| H A D | rtl-factoring.c | 221 rtx label; member
898 sb->label = NULL_RTX; in determine_seq_blocks()
916 temp->label = NULL_RTX; in determine_seq_blocks()
936 gen_symbol_ref_rtx_for_label (rtx label) in gen_symbol_ref_rtx_for_label() argument
1024 sb->label = block_label (split_block (bb, insn)->dest); in split_pattern_seq()
1079 JUMP_LABEL (callinsn) = sb->label; in erase_matching_seqs()
1080 LABEL_NUSES (sb->label)++; in erase_matching_seqs()
1092 make_edge (BLOCK_FOR_INSN (seq_blocks->label), in erase_matching_seqs()
1322 rtx rtx_jump, rtx_store, rtx_return, reg, label; in compute_init_costs() local
1329 label = block_label (bb); in compute_init_costs()
[all …]
|
| H A D | rtl.def | 137 /* Holds a label that is followed by instructions.
139 4: is used in jump.c for the use-count of the label.
140 5: is used in flow.c to point to the chain of label_ref's to this label.
142 7: is the user-given name of the label, if any. */
242 min_after_vec: true iff minimum addr target label is after the ADDR_DIFF_VEC.
243 max_after_vec: true iff maximum addr target label is after the ADDR_DIFF_VEC.
244 min_after_base: true iff minimum address target label is after BASE.
245 max_after_base: true iff maximum address target label is after BASE.
396 /* Reference to an assembler label in the code for this function.
400 /* Reference to a named label:
[all …]
|
| H A D | rtlanal.c | 2480 rtx label, table; in tablejump_p() local
2483 && (label = JUMP_LABEL (insn)) != NULL_RTX in tablejump_p()
2484 && (table = next_active_insn (label)) != NULL_RTX in tablejump_p()
2490 *labelp = label; in tablejump_p()
3205 label_is_jump_target_p (rtx label, rtx jump_insn) in label_is_jump_target_p() argument
3209 if (label == tmp) in label_is_jump_target_p()
3219 if (XEXP (RTVEC_ELT (vec, i), 0) == label) in label_is_jump_target_p()
|
| H A D | sdbout.c | 348 char label[10]; in gen_fake_label() local
350 sprintf (label, ".%dfake", unnamed_struct_number); in gen_fake_label()
352 labelstr = xstrdup (label); in gen_fake_label()
|
| H A D | stmt.c | 132 label_rtx (tree label) in label_rtx() argument
140 if (FORCED_LABEL (label) || DECL_NONLOCAL (label)) in label_rtx()
171 emit_jump (rtx label) in emit_jump() argument
212 if (DECL_NAME (label)) in expand_label()
213 LABEL_NAME (DECL_RTL (label)) = IDENTIFIER_POINTER (DECL_NAME (label)); in expand_label()
226 if (DECL_NONLOCAL (label) || FORCED_LABEL (label)) in expand_label()
2080 tree label) in add_case_node() argument
2164 rtx label; member
2201 return CODE_LABEL_NUMBER (d2->label) - CODE_LABEL_NUMBER (d1->label); in case_bit_test_cmp()
2235 if (label == test[i].label) in emit_case_bit_tests()
[all …]
|
| H A D | tree-cfg.c | 940 main_block_label (tree label) in main_block_label() argument
1032 CASE_LABEL (elt) = label; in cleanup_dead_labels()
1076 || DECL_NONLOCAL (label) in cleanup_dead_labels()
1777 if (DECL_NONLOCAL (label)) in remove_useless_stmts_label()
2607 tree stmt, label; in disband_implicit_edges() local
4027 tree label, stmt; in tree_block_label() local
4039 return label; in tree_block_label()
4046 return label; in tree_block_label()
4098 tree label, stmt; in tree_redirect_edge_and_branch() local
4144 CASE_LABEL (cases) = label; in tree_redirect_edge_and_branch()
[all …]
|
| H A D | tree-cfgcleanup.c | 201 tree label; local
210 target_block = label_to_block (label);
385 tree label; in remove_forwarder_block() local
399 label = first_stmt (dest); in remove_forwarder_block()
400 if (label in remove_forwarder_block()
401 && TREE_CODE (label) == LABEL_EXPR in remove_forwarder_block()
479 label = bsi_stmt (bsi); in remove_forwarder_block()
636 tree label; in remove_forwarder_block_with_phi() local
647 label = first_stmt (dest); in remove_forwarder_block_with_phi()
648 if (label in remove_forwarder_block_with_phi()
[all …]
|
| H A D | tree-eh.c | 388 tree new, one, label; in replace_goto_queue_cond_clause() local
755 tree label = tf->fallthru_label; in lower_try_finally_fallthru_label() local
756 if (!label) in lower_try_finally_fallthru_label()
758 label = create_artificial_label (); in lower_try_finally_fallthru_label()
759 tf->fallthru_label = label; in lower_try_finally_fallthru_label()
763 return label; in lower_try_finally_fallthru_label()
1066 tree label; in lower_try_finally_copy() member
1117 lab = labels[index].label; in lower_try_finally_copy()
1270 tree label; in lower_try_finally_switch() local
1279 label = create_artificial_label (); in lower_try_finally_switch()
[all …]
|
| H A D | tree-nested.c | 1492 tree t = *tp, label, new_label, target_context, x, arg, field; in convert_nl_goto_reference() local
1499 label = GOTO_DESTINATION (t); in convert_nl_goto_reference()
1500 if (TREE_CODE (label) != LABEL_DECL) in convert_nl_goto_reference()
1502 target_context = decl_function_context (label); in convert_nl_goto_reference()
1516 dummy.old = label; in convert_nl_goto_reference()
1525 elt->old = label; in convert_nl_goto_reference()
1560 tree t = *tp, label, new_label, x; in convert_nl_goto_receiver() local
1567 label = LABEL_EXPR_LABEL (t); in convert_nl_goto_receiver()
1569 dummy.old = label; in convert_nl_goto_receiver()
1581 x = build1 (GOTO_EXPR, void_type_node, label); in convert_nl_goto_receiver()
|
| H A D | tree-ssa-dom.c | 1292 tree label = TREE_VEC_ELT (labels, i); in record_edge_info() local
1293 basic_block target_bb = label_to_block (CASE_LABEL (label)); in record_edge_info()
1295 if (CASE_HIGH (label) in record_edge_info()
1296 || !CASE_LOW (label) in record_edge_info()
1300 info[target_bb->index] = label; in record_edge_info()
|
| H A D | tree-ssa-structalias.c | 467 unsigned int *label; member
1776 firstlabel = graph->label[j]; in label_visit()
1784 graph->label[n] = 0; in label_visit()
1786 graph->label[n] = firstlabel; in label_visit()
1823 graph->label[si->node_mapping[i]]); in perform_var_substitution()
1852 free (graph->label); in free_var_substitution_info()
1872 gcc_assert (label < graph->size); in find_equivalent_node()
1874 if (graph->eq_rep[label] != -1) in find_equivalent_node()
1879 return graph->eq_rep[label]; in find_equivalent_node()
1883 graph->eq_rep[label] = node; in find_equivalent_node()
[all …]
|
| H A D | tree-ssa-uncprop.c | 204 tree label = TREE_VEC_ELT (labels, i); in associate_equivalences_with_edges() local
205 basic_block bb = label_to_block (CASE_LABEL (label)); in associate_equivalences_with_edges()
208 if (CASE_HIGH (label) in associate_equivalences_with_edges()
209 || !CASE_LOW (label) in associate_equivalences_with_edges()
213 info[bb->index] = label; in associate_equivalences_with_edges()
|
| H A D | tree.def | 317 in C, it is a flag, nonzero if the label's definition has been seen.
805 /* A label definition, encapsulated as a statement.
806 Operand 0 is the LABEL_DECL node for the label that appears here.
844 /* Used to represent a case label. The operands are CASE_LOW and
845 CASE_HIGH, respectively. If CASE_LOW is NULL_TREE, the label is a
846 'default' label. If CASE_HIGH is NULL_TREE, the label is a normal case
847 label. CASE_LABEL is the corresponding LABEL_DECL. */
|