001/*
002 * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.compiler.test;
024
025import jdk.internal.jvmci.meta.*;
026
027import org.junit.*;
028
029import com.oracle.graal.nodes.*;
030import com.oracle.graal.nodes.StructuredGraph.AllowAssumptions;
031import com.oracle.graal.nodes.calc.*;
032import com.oracle.graal.nodes.debug.*;
033import com.oracle.graal.phases.common.*;
034import com.oracle.graal.phases.schedule.*;
035import com.oracle.graal.phases.schedule.SchedulePhase.SchedulingStrategy;
036import com.oracle.graal.phases.tiers.*;
037
038public class LongNodeChainTest extends GraalCompilerTest {
039
040    public static final int N = 10000;
041
042    private static final SchedulingStrategy[] Strategies = new SchedulingStrategy[]{SchedulingStrategy.EARLIEST};
043
044    @Test
045    public void testLongAddChain() {
046        longAddChain(true);
047        longAddChain(false);
048    }
049
050    private void longAddChain(boolean reverse) {
051        HighTierContext context = getDefaultHighTierContext();
052        StructuredGraph graph = new StructuredGraph(AllowAssumptions.NO);
053        ValueNode constant = graph.unique(ConstantNode.forPrimitive(JavaConstant.INT_1));
054        ValueNode value = null;
055        if (reverse) {
056            // Make sure the constant's stamp is not used to infer the add node's stamp.
057            OpaqueNode opaque = graph.unique(new OpaqueNode(constant));
058            constant = opaque;
059            AddNode addNode = graph.unique(new AddNode(constant, constant));
060            value = addNode;
061            for (int i = 1; i < N; ++i) {
062                AddNode newAddNode = graph.addWithoutUnique(new AddNode(constant, constant));
063                addNode.setY(newAddNode);
064                addNode = newAddNode;
065            }
066            opaque.replaceAndDelete(opaque.getValue());
067        } else {
068            value = constant;
069            for (int i = 0; i < N; ++i) {
070                value = graph.unique(new AddNode(constant, value));
071            }
072        }
073        ReturnNode returnNode = graph.add(new ReturnNode(value));
074        graph.start().setNext(returnNode);
075
076        for (SchedulingStrategy s : Strategies) {
077            new SchedulePhase(s).apply(graph);
078        }
079
080        new CanonicalizerPhase().apply(graph, context);
081        JavaConstant asConstant = (JavaConstant) returnNode.result().asConstant();
082        Assert.assertEquals(N + 1, asConstant.asInt());
083    }
084}