From 8fcfc44f611d494d2ec5fcc4a3e43f6aebce99f7 Mon Sep 17 00:00:00 2001 From: Jan Hubicka Date: Sun, 1 Dec 2019 00:19:58 +0100 Subject: [PATCH] ipa-inline.c (compute_max_insns): Return int64_t. * ipa-inline.c (compute_max_insns): Return int64_t. (inline_small_functions): Simplify. From-SVN: r278880 --- gcc/ChangeLog | 5 +++++ gcc/ipa-inline.c | 5 ++--- 2 files changed, 7 insertions(+), 3 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index e173bad..cc33a04 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,10 @@ 2019-11-30 Jan Hubicka + * ipa-inline.c (compute_max_insns): Return int64_t. + (inline_small_functions): Simplify. + +2019-11-30 Jan Hubicka + * tree-cfg.c (execute_fixup_cfg): Update also max_bb_count when scaling happen. diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index 56ea671..0f87c47 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -1722,7 +1722,7 @@ recursive_inlining (struct cgraph_edge *edge, /* Given whole compilation unit estimate of INSNS, compute how large we can allow the unit to grow. */ -static int +static int64_t compute_max_insns (cgraph_node *node, int insns) { int max_insns = insns; @@ -1977,9 +1977,8 @@ inline_small_functions (void) if (dump_file) fprintf (dump_file, "Enqueueing calls in %s.\n", node->dump_name ()); - for (edge = node->callees; edge; edge = next) + for (edge = node->callees; edge; edge = edge->next_callee) { - next = edge->next_callee; if (edge->inline_failed && !edge->aux && can_inline_edge_p (edge, true) -- 2.7.4