src/share/vm/memory/binaryTreeDictionary.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 2001, 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.
--- 1,7 ----
  /*
!  * Copyright (c) 2001, 2014, 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.
*** 118,128 ****
    // A candidate chunk has been found.  If it is already under
    // populated, get a chunk associated with the hint for this
    // chunk.
  
    TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* curTL = this;
!   if (surplus() <= 0) {
      /* Use the hint to find a size with a surplus, and reset the hint. */
      TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* hintTL = this;
      while (hintTL->hint() != 0) {
        assert(hintTL->hint() > hintTL->size(),
          "hint points in the wrong direction");
--- 118,128 ----
    // A candidate chunk has been found.  If it is already under
    // populated, get a chunk associated with the hint for this
    // chunk.
  
    TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* curTL = this;
!   if (curTL->surplus() <= 0) {
      /* Use the hint to find a size with a surplus, and reset the hint. */
      TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* hintTL = this;
      while (hintTL->hint() != 0) {
        assert(hintTL->hint() > hintTL->size(),
          "hint points in the wrong direction");