Mercurial > jdk8-mips64-public > hotspot / file comparison
comparison: src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.cpp
src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.cpp
- changeset 2314
- f95d63e2154a
- parent 2132
- 179464550c7d
equal
deleted
inserted
replaced
| 2313:e33f46fc48ed | 2314:f95d63e2154a |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
| 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | 4 * |
| 5 * This code is free software; you can redistribute it and/or modify it | 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 | 6 * under the terms of the GNU General Public License version 2 only, as |
| 7 * published by the Free Software Foundation. | 7 * published by the Free Software Foundation. |
| 20 * or visit www.oracle.com if you need additional information or have any | 20 * or visit www.oracle.com if you need additional information or have any |
| 21 * questions. | 21 * questions. |
| 22 * | 22 * |
| 23 */ | 23 */ |
| 24 | 24 |
| 25 # include "incls/_precompiled.incl" | 25 #include "precompiled.hpp" |
| 26 # include "incls/_binaryTreeDictionary.cpp.incl" | 26 #include "gc_implementation/concurrentMarkSweep/binaryTreeDictionary.hpp" |
| 27 #include "gc_implementation/shared/allocationStats.hpp" | |
| 28 #include "gc_implementation/shared/spaceDecorator.hpp" | |
| 29 #include "memory/space.inline.hpp" | |
| 30 #include "runtime/globals.hpp" | |
| 31 #include "utilities/ostream.hpp" | |
| 27 | 32 |
| 28 //////////////////////////////////////////////////////////////////////////////// | 33 //////////////////////////////////////////////////////////////////////////////// |
| 29 // A binary tree based search structure for free blocks. | 34 // A binary tree based search structure for free blocks. |
| 30 // This is currently used in the Concurrent Mark&Sweep implementation. | 35 // This is currently used in the Concurrent Mark&Sweep implementation. |
| 31 //////////////////////////////////////////////////////////////////////////////// | 36 //////////////////////////////////////////////////////////////////////////////// |
