Searched refs:stmt (Results 1 - 25 of 227) sorted by relevance

12345678910

/haiku-buildtools/gcc/gcc/
H A D	tree-cfgcleanup.h	26 extern bool fixup_noreturn_call (gimple stmt);
H A D	tree-ssa-dce.c	97 #include "stmt.h" 155 mark_stmt_necessary (gimple stmt, bool add_to_worklist) argument 157 gcc_assert (stmt); 159 if (gimple_plf (stmt, STMT_NECESSARY)) 164 fprintf (dump_file, "Marking useful stmt: "); 165 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM); 169 gimple_set_plf (stmt, STMT_NECESSARY, true); 171 worklist.safe_push (stmt); 172 if (bb_contains_live_stmts && !is_gimple_debug (stmt)) 173 bitmap_set_bit (bb_contains_live_stmts, gimple_bb (stmt) 182 gimple stmt; local 225 mark_stmt_if_obviously_necessary(gimple stmt, bool aggressive) argument 343 gimple stmt = last_stmt (bb); local 404 gimple phi, stmt; local 550 mark_aliased_reaching_defs_necessary(gimple stmt, tree ref) argument 623 mark_all_reaching_defs_necessary(gimple stmt) argument 652 gimple stmt; local 1099 gimple stmt = gsi_stmt (*i); local 1211 gimple stmt = gsi_stmt (*gsi); local 1301 gimple stmt; local [all...]
H A D	tree-ssa-operands.c	35 #include "stmt.h" 64 SSA optimizer. For every stmt, we maintain an operand cache in the stmt 69 operands are represented as pointers into the stmt's operand tree. Thus 72 variable for the SSA_NAME may, or may not occur in the stmt's tree. 73 Manipulation of the virtual operands will not be reflected in the stmt tree. 76 from a stmt tree. 79 through the stmt tree for the occurrence of operands which may be of 87 Once the stmt tree is completely parsed, the finalize_ssa_operands() 91 If the stmt ha 329 add_use_op(struct function *fn, gimple stmt, tree *op, use_optype_p last) argument 335 link_imm_use_stmt (USE_OP_PTR (new_use), *op, stmt); local 347 finalize_ssa_defs(struct function *fn, gimple stmt) argument 386 finalize_ssa_uses(struct function *fn, gimple stmt) argument 462 finalize_ssa_stmt_operands(struct function *fn, gimple stmt) argument 543 add_stmt_operand(struct function *fn, tree *var_p, gimple stmt, int flags) argument 607 get_mem_ref_operands(struct function *fn, gimple stmt, tree expr, int flags) argument 629 get_tmr_operands(struct function *fn, gimple stmt, tree expr, int flags) argument 651 maybe_add_call_vops(struct function *fn, gcall *stmt) argument 672 get_asm_stmt_operands(struct function *fn, gasm *stmt) argument 730 get_expr_operands(struct function *fn, gimple stmt, tree *expr_p, int flags) argument 918 parse_ssa_operands(struct function *fn, gimple stmt) argument 968 build_ssa_operands(struct function *fn, gimple stmt) argument 981 verify_ssa_operands(struct function *fn, gimple stmt) argument 1070 free_stmt_operands(struct function *fn, gimple stmt) argument 1095 update_stmt_operands(struct function *fn, gimple stmt) argument 1116 swap_ssa_operands(gimple stmt, tree *exp0, tree *exp1) argument 1305 unlink_stmt_vdef(gimple stmt) argument 1347 single_imm_use_1(const ssa_use_operand_t *head, use_operand_p *use_p, gimple *stmt) argument [all...]
H A D	tree-ssa-dse.c	69 #include "stmt.h" 118 dse_possible_dead_store_p (ao_ref *ref, gimple stmt, gimple *use_stmt) argument 126 memory stmt stores to with no intermediate statement that may use 127 part of the memory stmt stores. That is, find a store that may 128 prove stmt to be a dead store. */ 129 temp = stmt; 137 /* Limit stmt walking to be linear in the number of possibly 152 /* If we ever reach our DSE candidate stmt again fail. We 154 if (use_stmt == stmt) 167 || gimple_bb (stmt) 244 gimple stmt = gsi_stmt (*gsi); local [all...]
H A D	gimple-walk.c	37 #include "stmt.h" 111 walk_gimple_asm (gasm *stmt, walk_tree_fn callback_op, argument 121 noutputs = gimple_asm_noutputs (stmt); 129 op = gimple_asm_output_op (stmt, i); 141 n = gimple_asm_ninputs (stmt); 144 op = gimple_asm_input_op (stmt, i); 165 n = gimple_asm_nlabels (stmt); 168 op = gimple_asm_label_op (stmt, i); 194 walk_gimple_op (gimple stmt, walk_tree_fn callback_op, argument 201 switch (gimple_code (stmt)) 539 gimple stmt = gsi_stmt (*gsi); local 704 walk_stmt_load_store_addr_ops(gimple stmt, void *data, walk_stmt_load_store_addr_fn visit_load, walk_stmt_load_store_addr_fn visit_store, walk_stmt_load_store_addr_fn visit_addr) argument 922 walk_stmt_load_store_ops(gimple stmt, void *data, walk_stmt_load_store_addr_fn visit_load, walk_stmt_load_store_addr_fn visit_store) argument [all...]
H A D	gimple-streamer-in.c	119 gimple stmt; local 131 stmt = gimple_alloc (code, num_ops); 132 stmt->no_warning = bp_unpack_value (&bp, 1); 133 if (is_gimple_assign (stmt)) 134 stmt->nontemporal_move = bp_unpack_value (&bp, 1); 135 stmt->has_volatile_ops = bp_unpack_value (&bp, 1); 137 stmt->subcode = bp_unpack_var_len_unsigned (&bp); 141 gimple_set_location (stmt, stream_input_location_now (&bp, data_in)); 144 gimple_set_block (stmt, stream_read_tree (ib, data_in)); 150 gimple_resx_set_region (as_a <gresx *> (stmt), 306 gimple stmt = input_gimple_stmt (ib, data_in, tag); local [all...]
H A D	gimple-low.c	76 greturn *stmt; member in struct:return_statements_t 141 || (gimple_return_retval (data.return_statements.last().stmt) 158 gsi_insert_after (&i, t.stmt, GSI_CONTINUE_LINKING); 164 gimple_set_location (t.stmt, UNKNOWN_LOCATION); 237 gimple stmt; local 239 stmt = gsi_stmt (*gsi); 241 lower_sequence (gimple_omp_body_ptr (stmt), data); 242 gsi_insert_seq_after (gsi, gimple_omp_body (stmt), GSI_CONTINUE_LINKING); 243 gimple_omp_set_body (stmt, NULL); 258 gimple stmt local 410 gbind *stmt = as_a <gbind *> (gsi_stmt (*gsi)); local 464 gimple stmt = gsi_stmt (*gsi); local 526 gimple_try_catch_may_fallthru(gtry *stmt) argument 582 gimple_stmt_may_fallthru(gimple stmt) argument 658 greturn *stmt = as_a <greturn *> (gsi_stmt (*gsi)); local 749 gimple stmt = gsi_stmt (*gsi); local 834 gimple stmt, call = gsi_stmt (*gsi); local [all...]
H A D	gimplify-me.c	39 #include "stmt.h" 175 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p) argument 184 switch (gimple_code (stmt)) 188 gcond *cond_stmt = as_a <gcond *> (stmt); 196 gimplify_expr (gimple_switch_index_ptr (as_a <gswitch *> (stmt)), 201 as_a <gomp_atomic_load *> (stmt)), 206 gasm *asm_stmt = as_a <gasm *> (stmt); 246 num_ops = gimple_num_ops (stmt); 249 tree op = gimple_op (stmt, i - 1); 252 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assig [all...]
H A D	gimple-streamer-out.c	84 output_gimple_stmt (struct output_block *ob, gimple stmt) argument 93 code = gimple_code (stmt); 99 bp_pack_var_len_unsigned (&bp, gimple_num_ops (stmt)); 100 bp_pack_value (&bp, gimple_no_warning_p (stmt), 1); 101 if (is_gimple_assign (stmt)) 104 as_a <gassign *> (stmt)), 106 bp_pack_value (&bp, gimple_has_volatile_ops (stmt), 1); 107 hist = gimple_histogram_value (cfun, stmt); 109 bp_pack_var_len_unsigned (&bp, stmt->subcode); 112 stream_output_location (ob, &bp, LOCATION_LOCUS (gimple_location (stmt))); 246 gimple stmt = gsi_stmt (bsi); local [all...]
H A D	value-prof.c	51 #include "stmt.h" 172 enum hist_type type, gimple stmt, tree value) 176 hist->hvalue.stmt = stmt; 186 return htab_hash_pointer (((const_histogram_value)x)->hvalue.stmt); 194 return ((const_histogram_value) x)->hvalue.stmt == (const_gimple) y; 200 set_histogram_value (struct function *fun, gimple stmt, histogram_value hist) argument 208 loc = htab_find_slot_with_hash (VALUE_HISTOGRAMS (fun), stmt, 209 htab_hash_pointer (stmt), 223 gimple_histogram_value (struct function *fun, gimple stmt) argument 171 gimple_alloc_histogram_value(struct function *fun ATTRIBUTE_UNUSED, enum hist_type type, gimple stmt, tree value) argument 234 gimple_add_histogram_value(struct function *fun, gimple stmt, histogram_value hist) argument 246 gimple_remove_histogram_value(struct function *fun, gimple stmt, histogram_value hist) argument 271 gimple_histogram_value_of_type(struct function *fun, gimple stmt, enum hist_type type) argument 441 stream_in_histogram_value(struct lto_input_block *ib, gimple stmt) argument 507 dump_histograms_for_stmt(struct function *fun, FILE *dump_file, gimple stmt) argument 517 gimple_remove_stmt_histograms(struct function *fun, gimple stmt) argument 527 gimple_duplicate_stmt_histograms(struct function *fun, gimple stmt, struct function *ofun, gimple ostmt) argument 546 gimple_move_stmt_histograms(struct function *fun, gimple stmt, gimple ostmt) argument 598 gimple stmt = gsi_stmt (gsi); local 653 check_counter(gimple stmt, const char * name, gcov_type *count, gcov_type *all, gcov_type bb_count) argument 704 gimple stmt = gsi_stmt (gsi); local 757 gimple_divmod_fixed_value(gassign *stmt, tree value, int prob, gcov_type count, gcov_type all) argument 843 gassign *stmt; local 919 gimple_mod_pow2(gassign *stmt, int prob, gcov_type count, gcov_type all) argument 1006 gassign *stmt; local 1072 gimple_mod_subtract(gassign *stmt, int prob1, int prob2, int ncounts, gcov_type count1, gcov_type count2, gcov_type all) argument 1180 gassign *stmt; local 1593 gcall *stmt; local 1814 gcall *stmt; local 1908 stringop_block_profile(gimple stmt, unsigned int *expected_align, HOST_WIDE_INT *expected_size) argument 1960 gimple_divmod_values_to_profile(gimple stmt, histogram_values *values) argument 2018 gimple_indirect_call_to_profile(gimple stmt, histogram_values *values) argument 2046 gcall *stmt; local 2082 gimple_values_to_profile(gimple stmt, histogram_values *values) argument [all...]
H A D	tree-nrv.c	195 gimple stmt = gsi_stmt (gsi); local 198 if (greturn *return_stmt = dyn_cast <greturn *> (stmt)) 207 else if (gimple_has_lhs (stmt) 208 && gimple_get_lhs (stmt) == result) 212 if (!gimple_assign_copy_p (stmt)) 215 rhs = gimple_assign_rhs1 (stmt); 241 else if (gimple_has_lhs (stmt)) 243 tree addr = get_base_address (gimple_get_lhs (stmt)); 288 gimple stmt = gsi_stmt (gsi); local 290 if (gimple_assign_copy_p (stmt) 400 gcall *stmt; local [all...]
H A D	tree-ssa-ccp.c	294 gimple stmt; local 296 stmt = SSA_NAME_DEF_STMT (var); 298 if (gimple_nop_p (stmt)) 323 else if (is_gimple_assign (stmt)) 326 if (gimple_assign_single_p (stmt) 327 && DECL_P (gimple_assign_rhs1 (stmt)) 328 && (cst = get_symbol_constant_value (gimple_assign_rhs1 (stmt)))) 340 else if ((is_gimple_call (stmt) 341 && gimple_call_lhs (stmt) != NULL_TREE) 342 || gimple_code (stmt) 645 likely_value(gimple stmt) argument 764 surely_varying_stmt_p(gimple stmt) argument 819 gimple stmt = gsi_stmt (i); local 1168 ccp_fold(gimple stmt) argument 1574 bit_value_assume_aligned(gimple stmt, tree attr, ccp_prop_value_t ptrval, bool alloc_aligned) argument 1674 evaluate_stmt(gimple stmt) argument 1946 gimple stmt; local 2015 gimple stmt; local 2042 fold_builtin_alloca_with_align(gimple stmt) argument 2101 gimple stmt = gsi_stmt (*gsi); local 2241 visit_assignment(gimple stmt, tree *output_p) argument 2286 visit_cond_stmt(gimple stmt, edge *taken_edge_p) argument 2319 ccp_visit_stmt(gimple stmt, edge *taken_edge_p, tree *output_p) argument 2439 gimple stmt; local 2599 gimple stmt; local 2703 gimple stmt, old_stmt; local [all...]
H A D	tree-ssa-loop-unswitch.c	158 gcond *stmt; local 167 stmt = as_a <gcond *> (last); 172 if (gimple_cond_true_p (stmt) || gimple_cond_false_p (stmt)) 176 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE) 185 cond = build2 (gimple_cond_code (stmt), boolean_type_node, 186 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt)); 199 gimple stmt; local 203 stmt 235 gimple stmt; local 335 gimple stmt = last_stmt (b); local [all...]
H A D	gimple-ssa-isolate-paths.c	77 check_loadstore (gimple stmt, tree op, tree, void *data) argument 84 update_stmt (stmt); 104 gimple stmt = gsi_stmt (*si_p); local 105 if (walk_stmt_load_store_ops (stmt, (void *)op, NULL, check_loadstore) 106 && is_gimple_assign (stmt) 107 && INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_lhs (stmt)))) 111 tree type = TREE_TYPE (gimple_assign_lhs (stmt)); 112 gimple_assign_set_rhs_code (stmt, INTEGER_CST); 113 gimple_assign_set_rhs1 (stmt, fold_convert (type, integer_zero_node)); 114 update_stmt (stmt); 132 split_block (gimple_bb (stmt), stmt); local 169 isolate_path(basic_block bb, basic_block duplicate, edge e, gimple stmt, tree op, bool ret_zero) argument 403 gimple stmt = gsi_stmt (si); local [all...]
H A D	tree-ssa-threadedge.c	145 lhs_of_dominating_assert (tree op, basic_block bb, gimple stmt) argument 154 if (use_stmt != stmt 264 fold_assignment_stmt (gimple stmt) argument 266 enum tree_code subcode = gimple_assign_rhs_code (stmt); 271 return fold (gimple_assign_rhs1 (stmt)); 275 tree lhs = gimple_assign_lhs (stmt); 276 tree op0 = gimple_assign_rhs1 (stmt); 282 tree lhs = gimple_assign_lhs (stmt); 283 tree op0 = gimple_assign_rhs1 (stmt); 284 tree op1 = gimple_assign_rhs2 (stmt); 373 gimple stmt = NULL; local 573 simplify_control_stmt_condition(edge e, gimple stmt, gcond *dummy_cond, tree (*simplify) (gimple, gimple), bool handle_dominating_asserts) argument 747 gimple stmt = gsi_stmt (si); local 767 gimple stmt = gsi_stmt (si); local 794 gimple stmt = gsi_stmt (si); local 872 gimple stmt; local 1171 gimple stmt = gsi_stmt (gsi); local [all...]
H A D	tree-ssa-loop-im.c	130 gimple stmt; /* The statement in that it occurs. */ member in struct:mem_ref_loc 243 init_lim_data (gimple stmt) argument 246 lim_aux_data_map->put (stmt, p); 252 get_lim_data (gimple stmt) argument 254 lim_aux_data **p = lim_aux_data_map->get (stmt); 271 clear_lim_data (gimple stmt) argument 273 lim_aux_data **p = lim_aux_data_map->get (stmt); 300 movement_possibility (gimple stmt) argument 306 && gimple_code (stmt) == GIMPLE_COND) 313 if (gimple_code (stmt) 482 stmt_cost(gimple stmt) argument 588 simple_mem_ref_in_stmt(gimple stmt, bool *is_store) argument 617 mem_ref_in_stmt(gimple stmt) argument 710 determine_max_movement(gimple stmt, bool must_preserve_exec) argument 846 set_level(gimple stmt, struct loop *orig_loop, struct loop *level) argument 874 set_profitable_level(gimple stmt) argument 882 nonpure_call_p(gimple stmt) argument 895 gassign *stmt, *stmt1, *stmt2; local 929 gassign *stmt; local 1039 gimple stmt; local 1193 gphi *stmt = bsi.phi (); local 1258 gimple stmt = gsi_stmt (bsi); local 1391 gimple stmt; local 1465 record_mem_ref_loc(mem_ref_p ref, gimple stmt, tree *loc) argument 1500 gather_mem_refs_stmt(struct loop *loop, gimple stmt) argument 1852 gimple stmt; local 1971 gimple stmt = gimple_build_assign (flag, boolean_true_node); local [all...]
H A D	tree-ssa-propagate.c	331 simulate_stmt (gimple stmt) argument 339 if (!prop_simulate_again_p (stmt)) 342 if (gimple_code (stmt) == GIMPLE_PHI) 344 val = ssa_prop_visit_phi (as_a <gphi *> (stmt)); 345 output_name = gimple_phi_result (stmt); 348 val = ssa_prop_visit_stmt (stmt, &taken_edge, &output_name); 352 prop_set_simulate_again (stmt, false); 361 if (stmt_ends_bb_p (stmt)) 365 basic_block bb = gimple_bb (stmt); 399 gimple stmt variable 422 simulate_stmt (stmt); variable 461 gimple stmt = gsi_stmt (j); local 738 finish_update_gimple_call(gimple_stmt_iterator *si_p, gimple new_stmt, gimple stmt) argument 759 gcall *new_stmt, *stmt = as_a <gcall *> (gsi_stmt (*si_p)); local 784 gimple stmt = gsi_stmt (*si_p); local 909 stmt_makes_single_store(gimple stmt) argument 947 replace_uses_in(gimple stmt, ssa_prop_get_value_fn get_value) argument 1131 gimple stmt = gsi_stmt (i); local 1279 gimple stmt = walker.stmts_to_remove.pop (); local 1307 gimple stmt = walker.stmts_to_fixup.pop (); local 1508 gimple stmt = gsi_stmt (*gsi); local [all...]
H A D	tree-ssa-sink.c	219 gimple stmt) 247 if (gimple_vuse (stmt) || gimple_vdef (stmt)) 271 statement_sink_location (gimple stmt, basic_block frombb, argument 283 if (!is_gimple_assign (stmt)) 287 def_p = single_ssa_def_operand (stmt, SSA_OP_ALL_DEFS); 291 /* Return if there are no immediate uses of this stmt. */ 318 if (stmt_ends_bb_p (stmt) 319 || gimple_has_side_effects (stmt) 320 || gimple_has_volatile_ops (stmt) 217 select_best_block(basic_block early_bb, basic_block late_bb, gimple stmt) argument 402 FOR_EACH_IMM_USE_FAST(use_p, imm_iter, gimple_vuse (stmt)) argument 509 gimple stmt = gsi_stmt (gsi); local [all...]
H A D	gimple-iterator.c	65 update_modified_stmt (gimple stmt) argument 69 update_stmt_if_modified (stmt); 394 gsi_set_stmt (gimple_stmt_iterator *gsi, gimple stmt) argument 399 stmt->next = next = orig_stmt->next; 400 stmt->prev = prev = orig_stmt->prev; 405 prev->next = stmt; 407 gimple_seq_set_first (gsi->seq, stmt); 409 next->prev = stmt; 411 gimple_seq_set_last (gsi->seq, stmt); 413 gsi->ptr = stmt; 455 gsi_replace(gimple_stmt_iterator *gsi, gimple stmt, bool update_eh_info) argument 524 gsi_insert_before_without_update(gimple_stmt_iterator *i, gimple stmt, enum gsi_iterator_update m) argument 536 gsi_insert_before(gimple_stmt_iterator *i, gimple stmt, enum gsi_iterator_update m) argument 554 gsi_insert_after_without_update(gimple_stmt_iterator *i, gimple stmt, enum gsi_iterator_update m) argument 567 gsi_insert_after(gimple_stmt_iterator *i, gimple stmt, enum gsi_iterator_update m) argument 588 gimple stmt = gsi_stmt (*i); local 634 gsi_for_stmt(gimple stmt) argument 667 gimple stmt = gsi_stmt (*from); local 682 gimple stmt = gsi_stmt (*from); local 712 gsi_insert_on_edge(edge e, gimple stmt) argument 714 gimple_seq_add_stmt (&PENDING_STMT (e), stmt); local 830 gsi_insert_on_edge_immediate(edge e, gimple stmt) argument [all...]
H A D	tree-ssa-copy.c	106 stmt_may_generate_copy (gimple stmt) argument 108 if (gimple_code (stmt) == GIMPLE_PHI) 109 return !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_phi_result (stmt)); 111 if (gimple_code (stmt) != GIMPLE_ASSIGN) 116 if (gimple_has_volatile_ops (stmt)) 120 if (gimple_vuse (stmt)) 126 return ((gimple_assign_rhs_code (stmt) == SSA_NAME 127 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_assign_rhs1 (stmt))) 128 || is_gimple_min_invariant (gimple_assign_rhs1 (stmt))); 219 copy_prop_visit_assignment (gimple stmt, tre argument 249 copy_prop_visit_cond_stmt(gimple stmt, edge *taken_edge_p) argument 295 copy_prop_visit_stmt(gimple stmt, edge *taken_edge_p, tree *result_p) argument 473 gimple stmt = gsi_stmt (si); local [all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/debug/
H A D	pr53466.C	17 static inline gimple_stmt_iterator gsi_start_1 (gimple stmt) argument 20 i.ptr = stmt; 24 static bool gimple_try_catch_may_fallthru (gimple stmt) argument 26 gimple_stmt_iterator i = gsi_start_1 (stmt); 33 bool gimple_stmt_may_fallthru (gimple stmt, bool x) argument 36 return gimple_may_fallthru (stmt); 38 return gimple_try_catch_may_fallthru (stmt);
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A D	vrp17.c	22 gimplify_for_stmt (tree stmt) argument 24 if (2 >= tree_code_length[stmt->common.code]) 26 if (3 >= tree_code_length[stmt->common.code])
/haiku-buildtools/gcc/gcc/objcp/
H A D	objcp-decl.c	116 objcp_end_compound_stmt (tree stmt, int flags ATTRIBUTE_UNUSED) argument 120 if (TREE_CODE (stmt) == BIND_EXPR) 121 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt)); 122 else if (STATEMENT_LIST_NO_SCOPE (stmt)) 123 stmt = pop_stmt_list (stmt); 125 stmt = do_poplevel (stmt); 127 return stmt; [all...]
/haiku-buildtools/legacy/gcc/gcc/f/
H A D	std.c	500 static bool ffestd_is_reachable_; /* Is the current stmt reachable? */ 525 static void ffestd_stmt_append_ (ffestdStmt_ stmt); 636 /* ffestd_stmt_append_ -- Append statement to end of stmt list 642 ffestd_stmt_append_ (ffestdStmt_ stmt) 644 stmt->next = (ffestdStmt_) &ffestd_stmt_list_.first; 645 stmt->previous = ffestd_stmt_list_.last; 646 stmt->next->previous = stmt; 647 stmt->previous->next = stmt; 641 ffestd_stmt_append_(ffestdStmt_ stmt) argument 659 ffestdStmt_ stmt; local 675 ffestdStmt_ stmt; local 1198 ffestpInquireStmt *stmt; local 1473 ffestdStmt_ stmt; local 1523 ffestdStmt_ stmt = ffestd_stmt_list_.first; local 1610 ffestdStmt_ stmt; local 2893 ffestdStmt_ stmt; local 3046 ffestdStmt_ stmt; local 3074 ffestdStmt_ stmt; local 3099 ffestdStmt_ stmt; local 3148 ffestdStmt_ stmt; local 3179 ffestdStmt_ stmt; local 3214 ffestdStmt_ stmt; local 3272 ffestdStmt_ stmt; local 3313 ffestdStmt_ stmt; local 3351 ffestdStmt_ stmt; local 3376 ffestdStmt_ stmt; local 3402 ffestdStmt_ stmt; local 3429 ffestdStmt_ stmt; local 3459 ffestdStmt_ stmt; local 3492 ffestdStmt_ stmt; local 3522 ffestdStmt_ stmt; local 3553 ffestdStmt_ stmt; local 3585 ffestdStmt_ stmt; local 3608 ffestdStmt_ stmt; local 3653 ffestdStmt_ stmt; local 3717 ffestdStmt_ stmt; local 3745 ffestdStmt_ stmt; local 3798 ffestdStmt_ stmt; local 3897 ffestdStmt_ stmt; local 3977 ffestdStmt_ stmt; local 4054 ffestdStmt_ stmt; local 4082 ffestdStmt_ stmt; local 4110 ffestdStmt_ stmt; local 4165 ffestdStmt_ stmt; local 4195 ffestdStmt_ stmt; local 4279 ffestdStmt_ stmt; local 4894 ffestdStmt_ stmt; local 5058 ffestdStmt_ stmt; local 5382 ffestdStmt_ stmt; local 5561 ffestdStmt_ stmt; local 5628 ffestdStmt_ stmt; local 5654 ffestdStmt_ stmt; local 5684 ffestdStmt_ stmt; local 6182 ffestdStmt_ stmt; local 6278 ffestdStmt_ stmt; local 6375 ffestdStmt_ stmt; local 6471 ffestdStmt_ stmt; local 6506 ffestdStmt_ stmt; local 6542 ffestdStmt_ stmt; local 6637 ffestdStmt_ stmt; local 6732 ffestdStmt_ stmt; local 6765 ffestdStmt_ stmt; local 6798 ffestdStmt_ stmt; local 6829 ffestdStmt_ stmt; local 6921 ffestdStmt_ stmt; local [all...]
/haiku-buildtools/gcc/gcc/cp/
H A D	cp-gimplify.c	185 tree stmt, cond, then_, else_; local 188 stmt = *stmt_p; 189 cond = IF_COND (stmt); 190 then_ = THEN_CLAUSE (stmt); 191 else_ = ELSE_CLAUSE (stmt); 199 stmt = then_; 201 stmt = else_; 203 stmt = build3 (COND_EXPR, void_type_node, cond, then_, else_); 204 if (CAN_HAVE_LOCATION_P (stmt) && !EXPR_HAS_LOCATION (stmt)) 285 tree stmt = *stmt_p; local 309 tree stmt = *stmt_p; local 319 tree stmt = *stmt_p; local 329 tree stmt = *stmt_p; local 380 tree stmt = *stmt_p; local 421 tree stmt = EXPR_STMT_EXPR (*stmt_p); local 510 tree stmt = *expr_p; local 917 tree stmt = *stmt_p; local [all...]

Completed in 281 milliseconds

12345678910

Indexes created Mon Jun 03 19:47:05 MDT 2024