1 /*
   2  * Copyright (c) 2017, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 
  25 package org.graalvm.compiler.core.test;
  26 
  27 import jdk.vm.ci.meta.ResolvedJavaMethod;
  28 import org.graalvm.compiler.nodes.IfNode;
  29 import org.graalvm.compiler.nodes.LogicNode;
  30 import org.graalvm.compiler.nodes.ReturnNode;
  31 import org.graalvm.compiler.nodes.calc.ObjectEqualsNode;
  32 import org.junit.Test;
  33 
  34 import java.util.HashMap;
  35 
  36 public class HashMapGetTest extends GraalCompilerTest {
  37 
  38     public static void mapGet(HashMap<Integer, Integer> map, Integer key) {
  39         map.get(key);
  40     }
  41 
  42     @Test
  43     public void hashMapTest() {
  44         HashMap<Integer, Integer> map = new HashMap<>();
  45         ResolvedJavaMethod get = getResolvedJavaMethod(HashMapGetTest.class, "mapGet");
  46         for (int i = 0; i < 5000; i++) {
  47             mapGet(map, i);
  48             map.put(i, i);
  49             mapGet(map, i);
  50         }
  51         test(get, null, map, 0);
  52         for (IfNode ifNode : lastCompiledGraph.getNodes(IfNode.TYPE)) {
  53             LogicNode condition = ifNode.condition();
  54             if (ifNode.getTrueSuccessorProbability() < 0.4 && condition instanceof ObjectEqualsNode) {
  55                 assertTrue(ifNode.trueSuccessor().next() instanceof ReturnNode, "Expected return.", ifNode.trueSuccessor(), ifNode.trueSuccessor().next());
  56             }
  57         }
  58     }
  59 
  60 }