src/share/vm/memory/binaryTreeDictionary.cpp
Index Unified diffs Context diffs Sdiffs Wdiffs Patch New Old Previous File Next File
*** old/src/share/vm/memory/binaryTreeDictionary.cpp	Sun May  4 14:38:49 2014
--- new/src/share/vm/memory/binaryTreeDictionary.cpp	Sun May  4 14:38:47 2014

*** 1,7 **** --- 1,7 ---- /* ! * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved. ! * 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 **** --- 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");

src/share/vm/memory/binaryTreeDictionary.cpp
Index Unified diffs Context diffs Sdiffs Wdiffs Patch New Old Previous File Next File