/*
* Copyright (c) 2021, Alibaba Group Holding Limited. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Alibaba designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/*
* @test
* @summary Profiling based inlining for three receivers
* @run main/othervm -XX:CompileCommand=TrimorphicInlining::test* TrimorphicInlining
*/
import java.util.function.IntBinaryOperator;
public class TrimorphicInlining {
    private final static IntBinaryOperator
            ADD = (op1, op2) -> op1 + op2,
            SUB = (op1, op2) -> op1 - op2,
            XOR = (op1, op2) -> op1 ^ op2;
    static IntBinaryOperator[] ops = new IntBinaryOperator[]{ADD, SUB, XOR};
    static int test1(int n) {
        int accumulator = 0;
        for (IntBinaryOperator op : ops) {
            accumulator = op.applyAsInt(accumulator, n++);
        }
        return accumulator;
    }
    public static void main(String[] args) {
        int accumulator = Integer.MIN_VALUE;
        for (int i = 0; i < 100000; i++) {
            accumulator += test1(i);
        }
        System.out.println(accumulator);
    }
}