/* * Copyright (c) 2017, 2017, Oracle and/or its affiliates. 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. * * 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. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package org.graalvm.compiler.core.test; import jdk.vm.ci.meta.ResolvedJavaMethod; import org.graalvm.compiler.nodes.IfNode; import org.graalvm.compiler.nodes.LogicNode; import org.graalvm.compiler.nodes.ReturnNode; import org.graalvm.compiler.nodes.calc.ObjectEqualsNode; import org.junit.Test; import java.util.HashMap; public class HashMapGetTest extends GraalCompilerTest { public static void mapGet(HashMap map, Integer key) { map.get(key); } @Test public void hashMapTest() { HashMap map = new HashMap<>(); ResolvedJavaMethod get = getResolvedJavaMethod(HashMapGetTest.class, "mapGet"); for (int i = 0; i < 5000; i++) { mapGet(map, i); map.put(i, i); mapGet(map, i); } test(get, null, map, new Integer(0)); for (IfNode ifNode : lastCompiledGraph.getNodes(IfNode.TYPE)) { LogicNode condition = ifNode.condition(); if (ifNode.getTrueSuccessorProbability() < 0.4 && condition instanceof ObjectEqualsNode) { assertTrue(ifNode.trueSuccessor().next() instanceof ReturnNode, "Expected return.", ifNode.trueSuccessor(), ifNode.trueSuccessor().next()); } } } }