src/share/classes/java/util/HashMap.java

rev 12533 : 8174109: Better queuing priorities
Reviewed-by: smarks

*** 1,7 ****
  /*
!  * Copyright (c) 1997, 2013, 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.  Oracle designates this
--- 1,7 ----
  /*
!  * Copyright (c) 1997, 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.  Oracle designates this
*** 32,41 ****
--- 32,42 ----
  import java.lang.reflect.Type;
  import java.util.function.BiConsumer;
  import java.util.function.BiFunction;
  import java.util.function.Consumer;
  import java.util.function.Function;
+ import sun.misc.SharedSecrets;
  
  /**
   * Hash table based implementation of the <tt>Map</tt> interface.  This
   * implementation provides all of the optional map operations, and permits
   * <tt>null</tt> values and the <tt>null</tt> key.  (The <tt>HashMap</tt>
*** 1390,1399 ****
--- 1391,1404 ----
                         MAXIMUM_CAPACITY :
                         tableSizeFor((int)fc));
              float ft = (float)cap * lf;
              threshold = ((cap < MAXIMUM_CAPACITY && ft < MAXIMUM_CAPACITY) ?
                           (int)ft : Integer.MAX_VALUE);
+ 
+             // Check Map.Entry[].class since it's the nearest public type to
+             // what we're actually creating.
+             SharedSecrets.getJavaOISAccess().checkArray(s, Map.Entry[].class, cap);
              @SuppressWarnings({"rawtypes","unchecked"})
              Node<K,V>[] tab = (Node<K,V>[])new Node[cap];
              table = tab;
  
              // Read the keys and values, and put the mappings in the HashMap