[GR-36557] Fix bad size calculation.

PullRequest: graal/11765

Author: boris-spas

compiler/src/org.graalvm.compiler.truffle.compiler/src/org/graalvm/compiler/truffle/compiler/phases/inlining/CallNode.java

@@ -381,10 +381,12 @@ public int getSize() {
         return ir.getNodeCount();
     }
 
-    public void recalculateSize() {
+    public int recalculateSize() {
         if (getCallTree().useSize) {
             graphSize = NodeCostUtil.computeGraphSize(ir);
+            return graphSize;
         }
+        return ir.getNodeCount();
     }
 
     public Object getPolicyData() {

compiler/src/org.graalvm.compiler.truffle.compiler/src/org/graalvm/compiler/truffle/compiler/phases/inlining/DefaultInliningPolicy.java

@@ -112,8 +112,8 @@ public Object newCallNodeData(CallNode callNode) {
     private void inline(CallTree tree) {
         String inlineOnly = options.get(PolyglotCompilerOptions.InlineOnly);
         final int inliningBudget = options.get(PolyglotCompilerOptions.InliningInliningBudget);
-        int inlinedSize = tree.getRoot().getSize();
         final PriorityQueue<CallNode> inlineQueue = getQueue(tree, CallNode.State.Expanded);
+        int rootSize = tree.getRoot().getSize();
         CallNode candidate;
         while ((candidate = inlineQueue.poll()) != null) {
             if (!InliningPolicy.acceptForInline(candidate, inlineOnly)) {
@@ -124,12 +124,15 @@ private void inline(CallTree tree) {
                 continue;
             }
             int candidateCost = candidate.getSize();
-            if (inlinedSize + candidateCost > inliningBudget) {
-                break;
+            if (rootSize + candidateCost > inliningBudget) {
+                rootSize = tree.getRoot().recalculateSize();
+                if (rootSize + candidateCost > inliningBudget) {
+                    break;
+                }
             }
             if (data(candidate).callDiff <= 0) {
                 candidate.inline();
-                inlinedSize += candidateCost;
+                rootSize += candidateCost;
                 updateQueue(candidate, inlineQueue, CallNode.State.Expanded);
             }
         }