Searched refs:call_stmt (Results 1 - 25 of 38) sorted by relevance

12

/haiku-buildtools/gcc/gcc/
H A Dcgraph.c667 return (hashval_t) ((intptr_t)e->call_stmt >> 3);
673 cgraph_edge_hasher::hash (gimple call_stmt) argument
677 return (hashval_t) ((intptr_t)call_stmt >> 3);
680 /* Return nonzero if the call_stmt of of cgraph_edge X is stmt *Y. */
685 return x->call_stmt == y;
693 gimple call = e->call_stmt;
708 (e->call_stmt, cgraph_edge_hasher::hash (e->call_stmt), INSERT);
724 cgraph_node::get_edge (gimple call_stmt) argument
731 (call_stmt, cgraph_edge_hashe
823 create_edge(cgraph_node *caller, cgraph_node *callee, gcall *call_stmt, gcov_type count, int freq, bool indir_unknown_callee) argument
905 create_edge(cgraph_node *callee, gcall *call_stmt, gcov_type count, int freq) argument
942 create_indirect_edge(gcall *call_stmt, int ecf_flags, gcov_type count, int freq, bool compute_indirect_info) argument
3434 gimple_check_call_matching_types(gimple call_stmt, tree callee, bool args_count_match) argument
[all...]
H A Dcgraphbuild.c363 if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
367 decl = gimple_call_fndecl (call_stmt);
369 node->create_edge (cgraph_node::get_create (decl), call_stmt, bb->count, freq); local
370 else if (gimple_call_internal_p (call_stmt))
373 node->create_indirect_edge (call_stmt,
374 gimple_call_flags (call_stmt),
458 if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
462 decl = gimple_call_fndecl (call_stmt);
464 node->create_edge (cgraph_node::get_create (decl), call_stmt, local
466 else if (gimple_call_internal_p (call_stmt))
[all...]
H A Dgimple-streamer-in.c216 if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
218 if (gimple_call_internal_p (call_stmt))
220 (call_stmt, streamer_read_enum (ib, internal_fn, IFN_LAST));
222 gimple_call_set_fntype (call_stmt, stream_read_tree (ib, data_in));
H A Dvtable-verify.c615 gcall *call_stmt; local
676 call_stmt = gimple_build_call
692 call_stmt = gimple_build_call
702 return value, and make the call_stmt use the
705 gimple_call_set_lhs (call_stmt, tmp0);
706 update_stmt (call_stmt);
715 if (use_stmt == call_stmt)
729 gsi_insert_after (&gsi_vtbl_assign, call_stmt,
H A Dcgraphclones.c127 cgraph_edge::clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid, argument
145 if (call_stmt && (decl = gimple_call_fndecl (call_stmt))
152 new_edge = n->create_edge (callee, call_stmt, gcov_count, freq);
156 new_edge = n->create_indirect_edge (call_stmt,
164 new_edge = n->create_edge (callee, call_stmt, gcov_count, freq);
176 /* Clone flags that depend on call_stmt availability manually. */
521 e->clone (new_node, e->call_stmt, e->lto_stmt_uid, count_scale,
525 e->clone (new_node, e->call_stmt, e->lto_stmt_uid,
891 gimple_call_set_fndecl (e->call_stmt, new_versio
[all...]
H A Dgimple-walk.c787 else if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
791 tree arg = gimple_call_lhs (call_stmt);
800 for (i = 0; i < gimple_call_num_args (call_stmt); ++i)
802 tree arg = gimple_call_arg (call_stmt, i);
814 && gimple_call_chain (call_stmt)
815 && TREE_CODE (gimple_call_chain (call_stmt)) == ADDR_EXPR)
816 ret |= visit_addr (stmt, TREE_OPERAND (gimple_call_chain (call_stmt), 0),
817 gimple_call_chain (call_stmt), data);
819 && gimple_call_return_slot_opt_p (call_stmt)
820 && gimple_call_lhs (call_stmt) !
[all...]
H A Dtree-inline.c1641 if (gcall *call_stmt = dyn_cast <gcall *> (copy))
1643 if (gimple_call_tail_p (call_stmt))
1644 gimple_call_set_tail (call_stmt, false);
1645 if (gimple_call_from_thunk_p (call_stmt))
1646 gimple_call_set_from_thunk (call_stmt, false);
1849 gcall *call_stmt; local
1852 call_stmt = dyn_cast <gcall *> (stmt);
1853 if (call_stmt
1854 && gimple_call_va_arg_pack_p (call_stmt)
1855 && id->call_stmt)
4426 gcall *call_stmt; local
[all...]
H A Dtree-inline.h104 gimple call_stmt; member in struct:copy_body_data
H A Dipa-utils.c569 e->count = gimple_bb (e->call_stmt)->count;
572 gimple_bb (e->call_stmt));
577 gcov_type count = gimple_bb (e->call_stmt)->count;
580 gimple_bb (e->call_stmt));
H A Dgimple.h2715 const gcall *call_stmt = as_a <const gcall *> (gs);
2718 return call_stmt->u.fntype;
2724 gimple_call_set_fntype (gcall *call_stmt, tree fntype)
2726 gcc_gimple_checking_assert (!gimple_call_internal_p (call_stmt));
2727 call_stmt->u.fntype = fntype;
2776 gimple_call_set_internal_fn (gcall *call_stmt, enum internal_fn fn)
2778 gcc_gimple_checking_assert (gimple_call_internal_p (call_stmt));
2779 call_stmt->u.internal_fn = fn;
2823 gimple_call_chain_ptr (const gcall *call_stmt)
2825 return gimple_op_ptr (call_stmt,
[all...]
H A Dtree-object-size.c985 gcall *call_stmt = as_a <gcall *> (stmt); local
986 tree arg = pass_through_call (call_stmt);
996 call_object_size (osi, var, call_stmt);
1122 gcall *call_stmt = as_a <gcall *> (stmt); local
1123 tree arg = pass_through_call (call_stmt);
H A Dtrans-mem.c3162 gcall *call_stmt;
3168 call_stmt = dyn_cast <gcall *> (stmt);
3169 if ((!call_stmt)
3170 || (gimple_call_flags (call_stmt) & ECF_TM_BUILTIN) == 0)
3173 if (DECL_FUNCTION_CODE (gimple_call_fndecl (call_stmt))
3181 tree arg = gimple_call_arg (call_stmt, 0);
3190 split_bb_make_tm_edge (call_stmt, o->restart_block,
3203 split_bb_make_tm_edge (call_stmt, region->restart_block, gsi,
3222 split_bb_make_tm_edge (call_stmt, o->restart_block, gsi, &next_gsi);
3229 gimple_call_set_tail (call_stmt, fals
[all...]
H A Dipa-prop.c395 if (cs->call_stmt)
398 print_gimple_stmt (f, cs->call_stmt, 0, TDF_SLIM);
1617 : gimple_call_fntype (e->call_stmt));
1652 gcall *call = cs->call_stmt;
1676 arg, cs->call_stmt,
1678 context.get_dynamic_type (instance, arg, NULL, cs->call_stmt);
2349 ipa_bb_info *bi = ipa_get_bb_info (&fbi, gimple_bb (cs->call_stmt));
2355 ipa_bb_info *bi = ipa_get_bb_info (&fbi, gimple_bb (cs->call_stmt));
2589 location_t loc = gimple_location_safe (ie->call_stmt);
2601 location_t loc = gimple_location_safe (ie->call_stmt);
[all...]
H A Dipa.c245 if (edge->call_stmt)
246 locus = gimple_location (edge->call_stmt);
258 else if (edge->call_stmt)
264 gimple_call_set_with_bounds (edge->call_stmt, false);
H A Dipa-inline.c1965 edge->call_stmt
1967 edge->call_stmt))
1969 ? gimple_filename ((const_gimple) edge->call_stmt)
1971 edge->call_stmt
1972 ? gimple_lineno ((const_gimple) edge->call_stmt)
2715 = estimate_num_insns (edge->call_stmt, &eni_size_weights);
2717 = estimate_num_insns (edge->call_stmt, &eni_time_weights);
2743 = estimate_num_insns (edge->call_stmt, &eni_size_weights);
2745 = estimate_num_insns (edge->call_stmt, &eni_time_weights);
2749 edge->call_stmt, edg
[all...]
H A Dcgraph.h1007 gcall *call_stmt, gcov_type count,
1013 cgraph_edge *create_indirect_edge (gcall *call_stmt, int ecf_flags,
1028 cgraph_edge *get_edge (gimple call_stmt);
1513 /* Change field call_stmt of edge to NEW_STMT.
1555 cgraph_edge * clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid,
1588 gcall *call_stmt; variable
1596 /* The stmt_uid of call_stmt. This is used by LTO to recover the call_stmt
2139 gcall *call_stmt, gcov_type count, int freq,
H A Dlto-streamer-in.c931 /* Go through all NODE edges and fixup call_stmt pointers
947 cedge->call_stmt = as_a <gcall *> (stmts[cedge->lto_stmt_uid - 1]);
948 if (!cedge->call_stmt)
957 cedge->call_stmt = as_a <gcall *> (stmts[cedge->lto_stmt_uid - 1]);
958 if (!cedge->call_stmt)
974 /* Fixup call_stmt pointers in NODE and all clones. */
H A Dcgraphunit.c896 edge->call_stmt, 0,
901 location_t locus = gimple_location_safe (edge->call_stmt);
912 gimple_call_set_with_bounds (edge->call_stmt, false);
919 edge->call_stmt, 0,
1686 callees->call_stmt = call;
H A Dtree-vect-slp.c578 if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
581 if (gimple_call_internal_p (call_stmt)
582 || gimple_call_tail_p (call_stmt)
583 || gimple_call_noreturn_p (call_stmt)
584 || !gimple_call_nothrow_p (call_stmt)
585 || gimple_call_chain (call_stmt))
592 call_stmt, 0);
H A Dtree-ssa-dom.c338 else if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
340 size_t nargs = gimple_call_num_args (call_stmt);
343 gcc_assert (gimple_call_lhs (call_stmt));
345 expr->type = TREE_TYPE (gimple_call_lhs (call_stmt));
347 expr->ops.call.fn_from = call_stmt;
349 if (gimple_call_flags (call_stmt) & (ECF_CONST | ECF_PURE))
357 expr->ops.call.args[i] = gimple_call_arg (call_stmt, i);
H A Dtree-sra.c4908 if (!cs->call_stmt || !callsite_arguments_match_p (cs->call_stmt))
4922 if (!cs->call_stmt || !gimple_vuse (cs->call_stmt))
4949 ipa_modify_call_arguments (cs, cs->call_stmt, *adjustments);
5065 gimple call_stmt = cs->call_stmt; local
5066 unsigned count = gimple_call_num_args (call_stmt);
5069 tree arg = gimple_call_arg (call_stmt, i);
H A Dtree-ssa-math-opts.c1092 gcall *call_stmt; local
1095 call_stmt = gimple_build_call (fn, 1, arg);
1097 gimple_set_lhs (call_stmt, ssa_target);
1098 gimple_set_location (call_stmt, loc);
1099 gsi_insert_before (gsi, call_stmt, GSI_SAME_STMT);
H A Dvalue-prof.c1376 check_ic_target (gcall *call_stmt, struct cgraph_node *target) argument
1379 if (gimple_check_call_matching_types (call_stmt, target->decl, true))
1382 locus = gimple_location (call_stmt);
H A Dubsan.c695 gcall *call_stmt = dyn_cast <gcall *> (stmt); local
699 tree decl = gimple_call_fndecl (call_stmt);
701 node->create_edge (cgraph_node::get_create (decl), call_stmt, bb->count, local
H A Dtree-chkp.c573 /* Redirect edge E to the correct node according to call_stmt.
574 Return 1 if bounds removal from call_stmt should be done
588 && !gimple_call_with_bounds_p (e->call_stmt))
591 && gimple_call_with_bounds_p (e->call_stmt)
592 && !chkp_gimple_call_builtin_p (e->call_stmt, BUILT_IN_CHKP_BNDCL)
593 && !chkp_gimple_call_builtin_p (e->call_stmt, BUILT_IN_CHKP_BNDCU)
594 && !chkp_gimple_call_builtin_p (e->call_stmt, BUILT_IN_CHKP_BNDSTX))
605 gimple_call_set_with_bounds (e->call_stmt, false);

Completed in 886 milliseconds

12