/haiku-buildtools/gcc/gcc/ |
H A D | gimplify-me.c | 66 force_gimple_operand_1 (tree expr, gimple_seq *stmts, argument 72 *stmts = NULL; 95 gimplify_and_add (expr, stmts); 100 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue); 116 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var) argument 118 return force_gimple_operand_1 (expr, stmts, 135 gimple_seq stmts; local 137 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var); 139 if (!gimple_seq_empty_p (stmts)) 142 gsi_insert_seq_before (gsi, stmts, [all...] |
H A D | tree-loop-distribution.c | 364 create_rdg_vertices (struct graph *rdg, vec<gimple> stmts, loop_p loop, argument 370 FOR_EACH_VEC_ELT (stmts, i, stmt) 407 stmts_from_loop (struct loop *loop, vec<gimple> *stmts) argument 419 stmts->safe_push (bsi.phi ()); 426 stmts->safe_push (stmt); 469 /* Create the RDG vertices from the stmts of the loop nest. */ 470 auto_vec<gimple, 10> stmts; variable 471 stmts_from_loop (loop_nest[0], &stmts); 472 rdg = new_graph (stmts.length ()); 474 if (!create_rdg_vertices (rdg, stmts, loop_nes 499 bitmap stmts; member in struct:partition_s 514 partition_alloc(bitmap stmts, bitmap loops) argument 1433 distribute_loop(struct loop *loop, vec<gimple> stmts, control_dependences *cd, int *nb_calls) argument [all...] |
H A D | tree-vect-patterns.c | 289 stmts that constitute the pattern. In this case it will be: 301 vect_recog_dot_prod_pattern (vec<gimple> *stmts, tree *type_in, 304 gimple stmt, last_stmt = (*stmts)[0]; 515 stmts that constitute the pattern. In this case it will be: 520 vect_recog_sad_pattern (vec<gimple> *stmts, tree *type_in, 523 gimple last_stmt = (*stmts)[0]; 845 stmts that constitute the pattern. In this case it will be: 852 vect_recog_widen_mult_pattern (vec<gimple> *stmts, 855 gimple last_stmt = stmts->pop (); 1041 stmts 1295 vect_operation_fits_smaller_type(gimple stmt, tree def, tree *new_type, tree *op0, tree *op1, gimple *new_def_stmt, vec<gimple> *stmts) argument 2905 adjust_bool_pattern(tree var, tree out_type, tree trueval, vec<gimple> *stmts) argument [all...] |
H A D | tree-ssa-loop-manip.c | 94 gimple_seq stmts; local 150 step = force_gimple_operand (step, &stmts, true, NULL_TREE); 151 if (stmts) 152 gsi_insert_seq_on_edge_immediate (pe, stmts); 160 initial = force_gimple_operand (base, &stmts, true, var); 161 if (stmts) 162 gsi_insert_seq_on_edge_immediate (pe, stmts); 855 gimple_seq stmts; local 928 cond = force_gimple_operand (unshare_expr (cond), &stmts, false, NULL_TREE); 929 if (stmts) 930 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 938 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 944 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 947 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 1351 gimple_seq stmts; local 1388 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local [all...] |
H A D | lto-streamer-in.c | 935 fixup_call_stmt_edges_1 (struct cgraph_node *node, gimple *stmts, argument 947 cedge->call_stmt = as_a <gcall *> (stmts[cedge->lto_stmt_uid - 1]); 957 cedge->call_stmt = as_a <gcall *> (stmts[cedge->lto_stmt_uid - 1]); 967 ref->stmt = stmts[ref->lto_stmt_uid - 1]; 977 fixup_call_stmt_edges (struct cgraph_node *orig, gimple *stmts) argument 986 fixup_call_stmt_edges_1 (orig, stmts, fn); 990 fixup_call_stmt_edges_1 (node, stmts, fn); 1070 gimple *stmts; local 1136 stmts = (gimple *) xcalloc (gimple_stmt_max_uid (fn), sizeof (gimple)); 1144 stmts[gimple_ui [all...] |
H A D | tree-chkp.c | 442 tree stmts; member in struct:chkp_ctor_stmt_list 1069 struct chkp_ctor_stmt_list *stmts = (struct chkp_ctor_stmt_list *)arg; local 1076 append_to_statement_list (modify, &stmts->stmts); 1078 stmts->avail--; 1096 struct chkp_ctor_stmt_list *stmts) 1137 stmts->avail -= targetm.chkp_initialize_bounds (bnd_var, lb, ub, 1138 &stmts->stmts); 1139 if (stmts 1095 chkp_output_static_bounds(tree bnd_var, tree var, struct chkp_ctor_stmt_list *stmts) argument 1364 gimple_seq stmts; local 3782 struct chkp_ctor_stmt_list stmts; local [all...] |
H A D | tree-ssa-pre.c | 2506 unsigned int *operand, gimple_seq *stmts) 2521 fn = find_or_generate_expression (block, currop->op0, stmts); 2526 sc = find_or_generate_expression (block, currop->op1, stmts); 2534 operand, stmts); 2554 stmts); 2579 stmts); 2584 genop0 = find_or_generate_expression (block, currop->op0, stmts); 2590 genop1 = find_or_generate_expression (block, nextop->op0, stmts); 2610 stmts); 2619 stmts); 2505 create_component_ref_by_pieces_1(basic_block block, vn_reference_t ref, unsigned int *operand, gimple_seq *stmts) argument 2747 create_component_ref_by_pieces(basic_block block, vn_reference_t ref, gimple_seq *stmts) argument 2761 find_or_generate_expression(basic_block block, tree op, gimple_seq *stmts) argument 2817 create_expression_by_pieces(basic_block block, pre_expr expr, gimple_seq *stmts, tree type) argument 3033 gimple_seq stmts = NULL; local [all...] |
H A D | gimple-fold.c | 588 adjusting the replacement stmts location and virtual operands. 593 gsi_replace_with_seq_vops (gimple_stmt_iterator *si_p, gimple_seq stmts) argument 598 annotate_all_with_location (stmts, gimple_location (stmt)); 603 for (gimple_stmt_iterator i = gsi_last (stmts); 628 for (gimple_stmt_iterator i = gsi_start (stmts); 656 gsi_replace_with_seq (si_p, stmts, false); 675 gimple_seq stmts = NULL; local 686 gimplify_and_add (expr, &stmts); 689 if (gimple_seq_empty_p (stmts)) 703 tree tmp = get_initialized_tmp_var (expr, &stmts, NUL 2422 gimple_seq stmts = NULL; local 6073 gimple_seq stmts = NULL; local [all...] |
H A D | tree-parloops.c | 515 gimple_seq stmts; local 562 &stmts, true, NULL_TREE); 563 if (!gimple_seq_empty_p (stmts)) 564 gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT); 568 name = force_gimple_operand (fold_convert (type, name), &stmts, true, 570 if (!gimple_seq_empty_p (stmts)) 571 gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT); 1348 /* Now process debug bind stmts. We must not create decls while 1349 processing debug stmts, so we defer their processing so as to 1771 gimple_seq stmts; local 1846 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 1864 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 1871 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local [all...] |
H A D | graphite-sese-to-poly.c | 168 gimple_seq stmts = NULL; local 173 var = force_gimple_operand (scev, &stmts, true, NULL_TREE); 177 gimple_seq_add_stmt (&stmts, stmt); 178 gsi_insert_seq_on_edge (e, stmts); 1977 analyze_drs_in_stmts (scop_p scop, basic_block bb, vec<gimple> stmts) argument 1991 FOR_EACH_VEC_ELT (stmts, i, stmt) 2012 insert_stmts (scop_p scop, gimple stmt, gimple_seq stmts, argument 2018 gimple_seq_add_stmt (&stmts, stmt); 2019 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi)) 2022 gsi_insert_seq_before (&insert_gsi, stmts, GSI_SAME_STM 2031 gimple_seq stmts; local 2088 gimple_seq stmts = NULL; local 2148 gimple_seq stmts; local 2173 gsi_insert_seq_on_edge (SESE_ENTRY (region), stmts); local [all...] |
H A D | tree-if-conv.c | 209 set_bb_predicate_gimplified_stmts (basic_block bb, gimple_seq stmts) argument 211 ((bb_predicate_p) bb->aux)->predicate_gimplified_stmts = stmts; 218 add_bb_predicate_gimplified_stmts (basic_block bb, gimple_seq stmts) argument 221 (&(((bb_predicate_p) bb->aux)->predicate_gimplified_stmts), stmts); 240 gimple_seq stmts = bb_predicate_gimplified_stmts (bb); local 241 if (stmts) 245 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i)) 502 gimple_seq stmts; local 503 *tp = force_gimple_operand_1 (*tp, &stmts, is_gimple_condexpr, NULL_TREE); 504 add_bb_predicate_gimplified_stmts (bb, stmts); 1933 gimple_seq stmts; local [all...] |
H A D | tree-predcom.c | 1408 the loop it was analyzed in. Append init stmts to STMTS. */ 1411 ref_at_iteration (data_reference_p dr, int iter, gimple_seq *stmts) argument 1424 addr = force_gimple_operand_1 (unshare_expr (addr), stmts, 1490 gimple_seq stmts; local 1521 init = force_gimple_operand (init, &stmts, true, NULL_TREE); 1522 if (stmts) 1523 gsi_insert_seq_on_edge_immediate (entry, stmts); 1562 gimple_seq stmts; local 1581 init = force_gimple_operand (init, &stmts, written, NULL_TREE); 1582 if (stmts) 2424 gimple_seq stmts = NULL; local [all...] |
H A D | sese.c | 253 /* Reset debug stmts that reference SSA_NAMES defined in REGION that 456 gimple_seq stmts; 477 new_expr = force_gimple_operand (new_expr, &stmts, true, var); 478 gsi_insert_seq_before (gsi_tgt, stmts, GSI_SAME_STMT); 511 new_expr = force_gimple_operand (unshare_expr (new_expr), &stmts, 514 gsi_insert_seq_before (gsi_tgt, stmts, GSI_SAME_STMT); 453 gimple_seq stmts; local
|
H A D | vtable-verify.c | 590 gimple_seq stmts; local 595 stmts = bb_seq (bb); 596 gsi_virtual_call = gsi_start (stmts);
|
H A D | gimple-iterator.c | 854 gsi_insert_seq_on_edge_immediate (edge e, gimple_seq stmts) argument 863 update_call_edge_frequencies (gimple_seq_first (stmts), gsi.bb); 866 gsi_insert_seq_after (&gsi, stmts, GSI_NEW_STMT); 868 gsi_insert_seq_before (&gsi, stmts, GSI_NEW_STMT);
|
H A D | tree-vect-loop-manip.c | 137 /* A stack of values to be adjusted in debug stmts. We have to 145 /* Adjust any debug stmts that referenced AI->from values to use the 161 /* Adjust any debug stmts that held onto non-loop-closed 192 /* Adjust debug stmts as scheduled before. */ 211 /* Adjust any debug stmts that referenced FROM values to use the 238 to adjust any debug stmts that referenced the old phi arg, 940 Returns the skip edge, inserts new stmts on the COND_EXPR_STMT_LIST. */ 1066 gimple_seq stmts = NULL; local 1110 force_gimple_operand (scalar_loop_iters, &stmts, false, var); 1113 if (stmts) 1860 gimple_seq stmts; local 2026 gimple_seq stmts = NULL; local 2027 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local [all...] |
H A D | tree-vect-loop.c | 141 The loop transformation phase scans all the stmts in the loop, and 142 creates a vector stmt (or a sequence of stmts) for each scalar stmt S in 147 stmts which use the def of stmt S. Stmt S is removed if it writes to memory; 325 /* Skip stmts which do not need to be vectorized. */ 359 /* If a pattern statement has def stmts, analyze them too. */ 453 /* The only case when a vectype had been already set is for stmts 454 that contain a dataref, or for "pattern-stmts" (stmts 884 stmt_vec_info structs for all the stmts in LOOP. */ 899 /* Create/Update stmt_info for all stmts i 3364 gimple_seq stmts = NULL; local 4067 gimple_seq stmts; local 4070 gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts); local 5783 gimple_seq stmts = NULL; local 5831 gimple stmts = NULL; local 5857 gimple stmts = NULL; local 5872 gimple stmts = NULL; local [all...] |
H A D | cfgloopmanip.c | 792 gimple_seq stmts; local 833 initial_value = force_gimple_operand (initial_value, &stmts, true, iv); 834 if (stmts) 836 gsi_insert_seq_on_edge (loop_preheader_edge (loop), stmts); local 840 upper_bound = force_gimple_operand (upper_bound, &stmts, true, NULL); 841 if (stmts) 843 gsi_insert_seq_on_edge (loop_preheader_edge (loop), stmts); local
|
/haiku-buildtools/gcc/gcc/java/ |
H A D | decl.c | 431 tree stmts; variable 478 NULL, /* stmts */ 1430 if (current_binding_level->stmts) 1450 BIND_EXPR_BODY (bind) = current_binding_level->stmts; 1462 current_binding_level->stmts = NULL; 2030 tree stmts = current_binding_level->stmts; local 2036 if (stmts == NULL) 2037 return current_binding_level->stmts = new_stmt; 2040 if (TREE_CODE (stmts) ! [all...] |
H A D | except.c | 524 tree stmts = make_node (STATEMENT_LIST); local 525 tree_stmt_iterator stmts_i = tsi_last (stmts); 540 x = build2 (CATCH_EXPR, void_type_node, eh_type, stmts);
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | semantics.c | 4919 tree stmts[7]; 4933 && *tp != DECL_EXPR_DECL (udr_data->stmts[udr_data->combiner_p ? 0 : 3]) 4934 && *tp != DECL_EXPR_DECL (udr_data->stmts[udr_data->combiner_p ? 1 : 4])) 5027 memset (data.stmts, 0, sizeof data.stmts); 5031 data.stmts[i] = tsi_stmt (tsi); 5036 gcc_assert (TREE_CODE (data.stmts[0]) == DECL_EXPR 5037 && TREE_CODE (data.stmts[1]) == DECL_EXPR); 5038 if (TREE_NO_WARNING (DECL_EXPR_DECL (data.stmts[0]))) 5041 if (cp_walk_tree (&data.stmts[ 4918 tree stmts[7]; member in struct:cp_check_omp_declare_reduction_data 5188 tree stmts[7]; local [all...] |
H A D | optimize.c | 95 tree stmts; local 114 stmts = DECL_SAVED_TREE (fn); 115 walk_tree (&stmts, copy_tree_body_r, &id, NULL); 130 append_to_statement_list_force (stmts, &DECL_SAVED_TREE (clone));
|
/haiku-buildtools/cloog/include/cloog/ |
H A D | clast.h | 171 struct clast_for ***loops, int *nloops, int **stmts, int *nstmts);
|
/haiku-buildtools/cloog/source/ |
H A D | clast.c | 1984 * stmts: an array of statement numbers under node 1985 * nstmts: number of stmt numbers pointed to by stmts 1993 int **stmts, int *nstmts) 2001 *stmts = NULL; 2017 *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); 2029 *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); 2036 *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); 2046 ret = add_if_new((void **)stmts, *nstmts, &user_stmt->statement->number, sizeof(int)); 2050 *nstmts = concat_if_new((void **)stmts, *nstmts, stmts_next, num_next_stmts, sizeof(int)); 2060 *nstmts = concat_if_new((void **)stmts, *nstmt 1990 clast_filter(struct clast_stmt *node, ClastFilter filter, struct clast_for ***loops, int *nloops, int **stmts, int *nstmts) argument [all...] |
/haiku-buildtools/gcc/gcc/config/nvptx/ |
H A D | mkoffload.c | 496 write_stmts (FILE *out, const Stmt *stmts) argument 498 for (; stmts; stmts = stmts->next) 499 write_stmt (out, stmts);
|