Home
last modified time | relevance | path

Searched refs:def_stmt (Results 1 – 14 of 14) sorted by relevance

/openbsd/gnu/gcc/gcc/
H A Dtree-vect-patterns.c82 if (!vect_is_simple_use (name, loop_vinfo, def_stmt, &def, &dt)) in widened_name_p()
89 if (! *def_stmt) in widened_name_p()
92 if (TREE_CODE (*def_stmt) != MODIFY_EXPR) in widened_name_p()
95 expr = TREE_OPERAND (*def_stmt, 1); in widened_name_p()
215 tree def_stmt; in vect_recog_dot_prod_pattern() local
226 if (widened_name_p (oprnd0, stmt, &half_type, &def_stmt)) in vect_recog_dot_prod_pattern()
228 stmt = def_stmt; in vect_recog_dot_prod_pattern()
268 tree def_stmt; in vect_recog_dot_prod_pattern() local
278 if (!widened_name_p (oprnd0, stmt, &half_type0, &def_stmt)) in vect_recog_dot_prod_pattern()
280 oprnd00 = TREE_OPERAND (TREE_OPERAND (def_stmt, 1), 0); in vect_recog_dot_prod_pattern()
[all …]
H A Dtree-ssa.c1044 tree def_stmt; in walk_use_def_chains_1() local
1049 def_stmt = SSA_NAME_DEF_STMT (var); in walk_use_def_chains_1()
1051 if (TREE_CODE (def_stmt) != PHI_NODE) in walk_use_def_chains_1()
1054 return fn (var, def_stmt, data); in walk_use_def_chains_1()
1064 if (fn (PHI_ARG_DEF (def_stmt, i), def_stmt, data)) in walk_use_def_chains_1()
1070 tree arg = PHI_ARG_DEF (def_stmt, i); in walk_use_def_chains_1()
1080 if (fn (PHI_ARG_DEF (def_stmt, i), def_stmt, data)) in walk_use_def_chains_1()
1114 tree def_stmt; in walk_use_def_chains() local
1118 def_stmt = SSA_NAME_DEF_STMT (var); in walk_use_def_chains()
1122 if (TREE_CODE (def_stmt) != PHI_NODE) in walk_use_def_chains()
[all …]
H A Dtree-vectorizer.c1645 *def_stmt = NULL_TREE; in vect_is_simple_use()
1668 if (*def_stmt == NULL_TREE ) in vect_is_simple_use()
1683 if (IS_EMPTY_STMT (*def_stmt)) in vect_is_simple_use()
1698 bb = bb_for_stmt (*def_stmt); in vect_is_simple_use()
1726 switch (TREE_CODE (*def_stmt)) in vect_is_simple_use()
1729 *def = PHI_RESULT (*def_stmt); in vect_is_simple_use()
1735 *def = TREE_OPERAND (*def_stmt, 0); in vect_is_simple_use()
1816 tree def_stmt, def1, def2; in vect_is_simple_reduction() local
1833 if (!def_stmt) in vect_is_simple_reduction()
1948 return def_stmt; in vect_is_simple_reduction()
[all …]
H A Dtree-ssa-forwprop.c429 tree def_stmt = SSA_NAME_DEF_STMT (op0); in find_equivalent_equality_comparison() local
431 while (def_stmt in find_equivalent_equality_comparison()
432 && TREE_CODE (def_stmt) == MODIFY_EXPR in find_equivalent_equality_comparison()
433 && TREE_CODE (TREE_OPERAND (def_stmt, 1)) == SSA_NAME) in find_equivalent_equality_comparison()
434 def_stmt = SSA_NAME_DEF_STMT (TREE_OPERAND (def_stmt, 1)); in find_equivalent_equality_comparison()
438 if (def_stmt && TREE_CODE (def_stmt) == MODIFY_EXPR) in find_equivalent_equality_comparison()
440 tree def_rhs = TREE_OPERAND (def_stmt, 1); in find_equivalent_equality_comparison()
H A Dtree-vect-transform.c456 tree def_stmt; in vect_get_vec_def_for_operand() local
486 if (def_stmt) in vect_get_vec_def_for_operand()
537 *scalar_def = def_stmt; in vect_get_vec_def_for_operand()
1149 tree def, def_stmt; in vectorizable_reduction() local
1218 gcc_assert (TREE_CODE (def_stmt) == PHI_NODE); in vectorizable_reduction()
1386 tree def, def_stmt; in vectorizable_assignment() local
1491 tree def, def_stmt; in vectorizable_operation() local
1670 tree def, def_stmt; in vectorizable_store() local
1986 tree def, def_stmt; in vectorizable_live_operation() local
2425 basic_block bb = bb_for_stmt (def_stmt); in update_vuses_to_preheader()
[all …]
H A Dtree-ssa-dse.c168 tree def_stmt; in memory_ssa_name_same() local
179 def_stmt = SSA_NAME_DEF_STMT (expr); in memory_ssa_name_same()
180 def_bb = bb_for_stmt (def_stmt); in memory_ssa_name_same()
191 return def_stmt; in memory_ssa_name_same()
H A Dtree-ssa-loop-im.c303 tree def_stmt; in outermost_invariant_loop() local
310 def_stmt = SSA_NAME_DEF_STMT (def); in outermost_invariant_loop()
311 def_bb = bb_for_stmt (def_stmt); in outermost_invariant_loop()
317 if (LIM_DATA (def_stmt) && LIM_DATA (def_stmt)->max_loop) in outermost_invariant_loop()
319 LIM_DATA (def_stmt)->max_loop->outer); in outermost_invariant_loop()
378 tree def_stmt = SSA_NAME_DEF_STMT (def); in add_dependency() local
379 basic_block def_bb = bb_for_stmt (def_stmt); in add_dependency()
393 if (!LIM_DATA (def_stmt)) in add_dependency()
402 data->cost += LIM_DATA (def_stmt)->cost; in add_dependency()
405 dep->stmt = def_stmt; in add_dependency()
H A Dtree-vect-analyze.c1568 tree def, def_stmt; in vect_mark_stmts_to_be_vectorized() local
1686 if (!vect_is_simple_use (use, loop_vinfo, &def_stmt, &def, &dt)) in vect_mark_stmts_to_be_vectorized()
1694 if (!def_stmt || IS_EMPTY_STMT (def_stmt)) in vect_mark_stmts_to_be_vectorized()
1703 bb = bb_for_stmt (def_stmt); in vect_mark_stmts_to_be_vectorized()
1710 && TREE_CODE (def_stmt) == PHI_NODE) in vect_mark_stmts_to_be_vectorized()
1713 vect_mark_relevant (&worklist, def_stmt, relevant_p, live_p); in vect_mark_stmts_to_be_vectorized()
H A Dtree-ssa-ccp.c2102 tree var, def_stmt, val; in get_maxval_strlen() local
2144 def_stmt = SSA_NAME_DEF_STMT (var); in get_maxval_strlen()
2146 switch (TREE_CODE (def_stmt)) in get_maxval_strlen()
2155 rhs = TREE_OPERAND (def_stmt, 1); in get_maxval_strlen()
2166 for (i = 0; i < PHI_NUM_ARGS (def_stmt); i++) in get_maxval_strlen()
2168 tree arg = PHI_ARG_DEF (def_stmt, i); in get_maxval_strlen()
2176 if (arg == PHI_RESULT (def_stmt)) in get_maxval_strlen()
H A Dtree-ssa-reassoc.c816 tree def_stmt; in is_phi_for_stmt() local
824 def_stmt = SSA_NAME_DEF_STMT (operand); in is_phi_for_stmt()
825 if (TREE_CODE (def_stmt) != PHI_NODE) in is_phi_for_stmt()
828 FOR_EACH_PHI_ARG (arg_p, def_stmt, i, SSA_OP_USE) in is_phi_for_stmt()
H A Dtree-ssa-pre.c3086 tree def_stmt; in try_look_through_load() local
3089 def_stmt = SSA_NAME_DEF_STMT (vuse); in try_look_through_load()
3096 if (!def_stmt in try_look_through_load()
3097 || TREE_CODE (def_stmt) != MODIFY_EXPR in try_look_through_load()
3098 || !ZERO_SSA_OPERANDS (def_stmt, SSA_OP_VIRTUAL_USES)) in try_look_through_load()
3104 if (store_stmt && store_stmt != def_stmt) in try_look_through_load()
3110 if (!operand_equal_p (TREE_OPERAND (def_stmt, 0), mem_ref, 0)) in try_look_through_load()
3115 store_stmt = def_stmt; in try_look_through_load()
H A Dtree-ssa-loop-manip.c129 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); in add_exit_phis_edge() local
130 basic_block def_bb = bb_for_stmt (def_stmt); in add_exit_phis_edge()
H A Dtree-vrp.c3657 tree def_stmt = SSA_NAME_DEF_STMT (t); in find_assert_locations() local
3659 while (TREE_CODE (def_stmt) == MODIFY_EXPR in find_assert_locations()
3660 && TREE_CODE (TREE_OPERAND (def_stmt, 1)) == NOP_EXPR in find_assert_locations()
3661 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (def_stmt, 1), 0)) == SSA_NAME in find_assert_locations()
3662 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (def_stmt, 1), 0)))) in find_assert_locations()
3664 t = TREE_OPERAND (TREE_OPERAND (def_stmt, 1), 0); in find_assert_locations()
3665 def_stmt = SSA_NAME_DEF_STMT (t); in find_assert_locations()
/openbsd/gnu/gcc/gcc/doc/
H A Dtree-ssa.texi1443 (@var{def_stmt}) and a generic pointer to whatever state information
1448 Note, that if @var{def_stmt} is a @code{PHI} node, the semantics are