| /dragonfly/contrib/gcc-4.7/gcc/ |
| HD | gimple.h | 1781 gimple_op (const_gimple gs, unsigned i) in gimple_op() function 1843 return gimple_op (gs, 0); in gimple_assign_lhs() 1876 return gimple_op (gs, 1); in gimple_assign_rhs1() 1910 return gimple_op (gs, 2); in gimple_assign_rhs2() 1946 return gimple_op (gs, 3); in gimple_assign_rhs3() 2108 return gimple_op (gs, 0); in gimple_call_lhs() 2184 return gimple_op (gs, 1); in gimple_call_fn() 2283 return gimple_op (gs, 2); in gimple_call_chain() 2325 return gimple_op (gs, index + 3); in gimple_call_arg() 2576 return gimple_op (gs, 0); in gimple_cond_lhs() [all …]
|
| HD | gimple-streamer-out.c | 116 tree op = gimple_op (stmt, i); in output_gimple_stmt()
|
| HD | tree-vect-slp.c | 227 oprnd = gimple_op (stmt, op_idx++); in vect_get_and_check_slp_defs() 1761 && TREE_CODE (gimple_op (stmt, 0)) == SSA_NAME) in vect_detect_hybrid_slp_stmts() 1762 FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, gimple_op (stmt, 0)) in vect_detect_hybrid_slp_stmts() 2235 op = gimple_op (stmt, reduc_index); in vect_get_constant_vectors() 2347 op = gimple_op (stmt, op_num + 1); in vect_get_constant_vectors()
|
| HD | ipa-pure-const.c | 482 if (gimple_op (call, i) in check_call() 483 && tree_could_throw_p (gimple_op (call, i))) in check_call()
|
| HD | tree-complex.c | 1455 type = TREE_TYPE (gimple_op (stmt, 0)); in expand_complex_operations_1() 1480 inner_type = TREE_TYPE (gimple_op (stmt, 1)); in expand_complex_operations_1()
|
| HD | gimple.c | 2066 && is_gimple_val (gimple_op (gs, 1))); in gimple_assign_copy_p() 2419 gimple_set_op (copy, i, unshare_expr (gimple_op (stmt, i))); in gimple_copy() 2506 if (tree_could_trap_p (gimple_op (s, i))) in gimple_could_trap_p_1() 5255 tree op = gimple_op (stmt, i); in walk_stmt_load_store_addr_ops()
|
| HD | tree-vect-loop.c | 3579 reduction_op = gimple_op (stmt, reduc_index + 1); in vect_create_epilog_for_reduction() 5196 op = TREE_OPERAND (gimple_op (stmt, 1), i); in vectorizable_live_operation() 5198 op = gimple_op (stmt, i + 1); in vectorizable_live_operation()
|
| HD | tree-ssa-ccp.c | 625 tree op = gimple_op (stmt, i); in likely_value()
|
| HD | tree-inline.c | 3529 gimple_op (stmt, 0), in estimate_num_insns() 3530 gimple_op (stmt, 1)); in estimate_num_insns()
|
| HD | tree-ssa-reassoc.c | 425 op = gimple_op (stmt, i); in get_rank()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| HD | tree-vect-slp.c | 341 oprnd = TREE_OPERAND (gimple_op (stmt, first_op_idx), map[i]); in vect_get_and_check_slp_defs() 343 oprnd = gimple_op (stmt, map[i]); in vect_get_and_check_slp_defs() 346 oprnd = gimple_op (stmt, first_op_idx + (swapped ? !i : i)); in vect_get_and_check_slp_defs() 1938 tree op = gimple_op (stmt, i); in vect_analyze_slp_cost_1() 1974 elt = gimple_op (SLP_TREE_SCALAR_STMTS (node)[si], i); in vect_analyze_slp_cost_1() 1978 else if (elt != gimple_op (SLP_TREE_SCALAR_STMTS (node)[si], i)) in vect_analyze_slp_cost_1() 3588 op = gimple_op (stmt, op_num + 1); in vect_get_constant_vectors() 3609 op = gimple_op (stmt, op_num + 1); in vect_get_constant_vectors() 3620 op = gimple_op (stmt, op_num + 1); in vect_get_constant_vectors()
|
| HD | gimple-streamer-out.c | 135 tree op = gimple_op (stmt, i); in output_gimple_stmt()
|
| HD | gimplify-me.c | 227 tree op = gimple_op (stmt, i - 1); in gimple_regimplify_operands()
|
| HD | gimple-ssa-split-paths.c | 283 tree op = gimple_op (cond, i); in is_feasible_trace()
|
| HD | gimple.h | 2381 gimple_op (const gimple *gs, unsigned i) 3699 return gimple_op (gs, 0); 4662 return gimple_op (dbg, 0); 4673 return gimple_op (dbg, 1); 4731 return gimple_op (dbg, 1) != GIMPLE_DEBUG_BIND_NOVALUE; 4754 return gimple_op (dbg, 0); 4765 return gimple_op (dbg, 1); 6254 return gimple_op (gs, 1);
|
| HD | ipa-icf-gimple.c | 821 arg1 = gimple_op (s1, i); in compare_gimple_assign() 822 arg2 = gimple_op (s2, i); in compare_gimple_assign()
|
| HD | gimple.c | 1551 && is_gimple_val (gimple_op (gs, 1))); in gimple_assign_copy_p() 1943 gimple_set_op (copy, i, unshare_expr (gimple_op (stmt, i))); in gimple_copy() 2020 if (tree_could_trap_p (gimple_op (s, i))) in gimple_could_trap_p_1()
|
| HD | ipa-pure-const.c | 605 if (gimple_op (call, i) in check_call() 606 && tree_could_throw_p (gimple_op (call, i))) in check_call()
|
| HD | tree-complex.c | 1523 type = TREE_TYPE (gimple_op (stmt, 0)); in expand_complex_operations_1() 1548 inner_type = TREE_TYPE (gimple_op (stmt, 1)); in expand_complex_operations_1()
|
| HD | ssa-iterators.h | 559 val = gimple_op (ptr->stmt, ptr->i); in op_iter_next_tree()
|
| HD | tree-tailcall.c | 582 tree op = gimple_op (stmt, opno); in find_tail_calls()
|
| HD | gimple-walk.c | 781 tree op = gimple_op (stmt, i); in walk_stmt_load_store_addr_ops()
|
| HD | ipa-icf.c | 1656 add_expr (gimple_op (stmt, i), hstate); in hash_stmt() 1657 if (gimple_op (stmt, i)) in hash_stmt() 1658 add_type (TREE_TYPE (gimple_op (stmt, i)), hstate); in hash_stmt()
|
| HD | ipa-fnsummary.c | 1585 && gimple_op (stmt, 0) in will_be_nonconstant_predicate() 1586 && TREE_CODE (gimple_op (stmt, 0)) == SSA_NAME) in will_be_nonconstant_predicate() 1587 nonconstant_names[SSA_NAME_VERSION (gimple_op (stmt, 0))] in will_be_nonconstant_predicate()
|
| /dragonfly/contrib/gcc-4.7/gcc/doc/ |
| HD | gimple.texi | 612 @deftypefn {GIMPLE function} tree gimple_op (gimple g, unsigned i) 628 using @code{gimple_op}(), if this becomes a bottleneck, a pass can 805 @deftypefn {GIMPLE function} tree gimple_op (gimple g, unsigned i)
|