Mon, 26 Jan 2009 12:47:21 -0800
6786503: Overflow list performance can be improved
Summary: Avoid overflow list walk in CMS & ParNew when it is unnecessary. Fix a couple of correctness issues, including a C-heap leak, in ParNew at the intersection of promotion failure, work queue overflow and object array chunking. Add stress testing option and related assertion checking.
Reviewed-by: jmasa
duke@435 | 1 | /* |
xdono@631 | 2 | * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // The following classes are C++ `closures` for iterating over objects, roots and spaces |
duke@435 | 26 | |
duke@435 | 27 | class ReferenceProcessor; |
duke@435 | 28 | |
ysr@777 | 29 | // Closure provides abortability. |
ysr@777 | 30 | |
ysr@777 | 31 | class Closure : public StackObj { |
ysr@777 | 32 | protected: |
ysr@777 | 33 | bool _abort; |
ysr@777 | 34 | void set_abort() { _abort = true; } |
ysr@777 | 35 | public: |
ysr@777 | 36 | Closure() : _abort(false) {} |
ysr@777 | 37 | // A subtype can use this mechanism to indicate to some iterator mapping |
ysr@777 | 38 | // functions that the iteration should cease. |
ysr@777 | 39 | bool abort() { return _abort; } |
ysr@777 | 40 | void clear_abort() { _abort = false; } |
ysr@777 | 41 | }; |
ysr@777 | 42 | |
duke@435 | 43 | // OopClosure is used for iterating through roots (oop*) |
duke@435 | 44 | |
ysr@777 | 45 | class OopClosure : public Closure { |
duke@435 | 46 | public: |
duke@435 | 47 | ReferenceProcessor* _ref_processor; |
duke@435 | 48 | OopClosure(ReferenceProcessor* rp) : _ref_processor(rp) { } |
duke@435 | 49 | OopClosure() : _ref_processor(NULL) { } |
duke@435 | 50 | virtual void do_oop(oop* o) = 0; |
duke@435 | 51 | virtual void do_oop_v(oop* o) { do_oop(o); } |
coleenp@548 | 52 | virtual void do_oop(narrowOop* o) = 0; |
coleenp@548 | 53 | virtual void do_oop_v(narrowOop* o) { do_oop(o); } |
duke@435 | 54 | |
duke@435 | 55 | // In support of post-processing of weak links of KlassKlass objects; |
duke@435 | 56 | // see KlassKlass::oop_oop_iterate(). |
duke@435 | 57 | virtual const bool should_remember_klasses() const { return false; } |
duke@435 | 58 | virtual void remember_klass(Klass* k) { /* do nothing */ } |
duke@435 | 59 | |
duke@435 | 60 | // If "true", invoke on nmethods (when scanning compiled frames). |
duke@435 | 61 | virtual const bool do_nmethods() const { return false; } |
duke@435 | 62 | |
duke@435 | 63 | // The methods below control how object iterations invoking this closure |
duke@435 | 64 | // should be performed: |
duke@435 | 65 | |
duke@435 | 66 | // If "true", invoke on header klass field. |
duke@435 | 67 | bool do_header() { return true; } // Note that this is non-virtual. |
duke@435 | 68 | // Controls how prefetching is done for invocations of this closure. |
duke@435 | 69 | Prefetch::style prefetch_style() { // Note that this is non-virtual. |
duke@435 | 70 | return Prefetch::do_none; |
duke@435 | 71 | } |
ysr@777 | 72 | |
ysr@777 | 73 | // True iff this closure may be safely applied more than once to an oop |
ysr@777 | 74 | // location without an intervening "major reset" (like the end of a GC). |
ysr@777 | 75 | virtual bool idempotent() { return false; } |
ysr@777 | 76 | virtual bool apply_to_weak_ref_discovered_field() { return false; } |
duke@435 | 77 | }; |
duke@435 | 78 | |
duke@435 | 79 | // ObjectClosure is used for iterating through an object space |
duke@435 | 80 | |
ysr@777 | 81 | class ObjectClosure : public Closure { |
duke@435 | 82 | public: |
duke@435 | 83 | // Called for each object. |
duke@435 | 84 | virtual void do_object(oop obj) = 0; |
duke@435 | 85 | }; |
duke@435 | 86 | |
duke@435 | 87 | |
duke@435 | 88 | class BoolObjectClosure : public ObjectClosure { |
duke@435 | 89 | public: |
duke@435 | 90 | virtual bool do_object_b(oop obj) = 0; |
duke@435 | 91 | }; |
duke@435 | 92 | |
duke@435 | 93 | // Applies an oop closure to all ref fields in objects iterated over in an |
duke@435 | 94 | // object iteration. |
duke@435 | 95 | class ObjectToOopClosure: public ObjectClosure { |
duke@435 | 96 | OopClosure* _cl; |
duke@435 | 97 | public: |
duke@435 | 98 | void do_object(oop obj); |
duke@435 | 99 | ObjectToOopClosure(OopClosure* cl) : _cl(cl) {} |
duke@435 | 100 | }; |
duke@435 | 101 | |
duke@435 | 102 | // A version of ObjectClosure with "memory" (see _previous_address below) |
duke@435 | 103 | class UpwardsObjectClosure: public BoolObjectClosure { |
duke@435 | 104 | HeapWord* _previous_address; |
duke@435 | 105 | public: |
duke@435 | 106 | UpwardsObjectClosure() : _previous_address(NULL) { } |
duke@435 | 107 | void set_previous(HeapWord* addr) { _previous_address = addr; } |
duke@435 | 108 | HeapWord* previous() { return _previous_address; } |
duke@435 | 109 | // A return value of "true" can be used by the caller to decide |
duke@435 | 110 | // if this object's end should *NOT* be recorded in |
duke@435 | 111 | // _previous_address above. |
duke@435 | 112 | virtual bool do_object_bm(oop obj, MemRegion mr) = 0; |
duke@435 | 113 | }; |
duke@435 | 114 | |
duke@435 | 115 | // A version of ObjectClosure that is expected to be robust |
duke@435 | 116 | // in the face of possibly uninitialized objects. |
duke@435 | 117 | class ObjectClosureCareful : public ObjectClosure { |
duke@435 | 118 | public: |
duke@435 | 119 | virtual size_t do_object_careful_m(oop p, MemRegion mr) = 0; |
duke@435 | 120 | virtual size_t do_object_careful(oop p) = 0; |
duke@435 | 121 | }; |
duke@435 | 122 | |
duke@435 | 123 | // The following are used in CompactibleFreeListSpace and |
duke@435 | 124 | // ConcurrentMarkSweepGeneration. |
duke@435 | 125 | |
duke@435 | 126 | // Blk closure (abstract class) |
duke@435 | 127 | class BlkClosure : public StackObj { |
duke@435 | 128 | public: |
duke@435 | 129 | virtual size_t do_blk(HeapWord* addr) = 0; |
duke@435 | 130 | }; |
duke@435 | 131 | |
duke@435 | 132 | // A version of BlkClosure that is expected to be robust |
duke@435 | 133 | // in the face of possibly uninitialized objects. |
duke@435 | 134 | class BlkClosureCareful : public BlkClosure { |
duke@435 | 135 | public: |
duke@435 | 136 | size_t do_blk(HeapWord* addr) { |
duke@435 | 137 | guarantee(false, "call do_blk_careful instead"); |
duke@435 | 138 | return 0; |
duke@435 | 139 | } |
duke@435 | 140 | virtual size_t do_blk_careful(HeapWord* addr) = 0; |
duke@435 | 141 | }; |
duke@435 | 142 | |
duke@435 | 143 | // SpaceClosure is used for iterating over spaces |
duke@435 | 144 | |
duke@435 | 145 | class Space; |
duke@435 | 146 | class CompactibleSpace; |
duke@435 | 147 | |
duke@435 | 148 | class SpaceClosure : public StackObj { |
duke@435 | 149 | public: |
duke@435 | 150 | // Called for each space |
duke@435 | 151 | virtual void do_space(Space* s) = 0; |
duke@435 | 152 | }; |
duke@435 | 153 | |
duke@435 | 154 | class CompactibleSpaceClosure : public StackObj { |
duke@435 | 155 | public: |
duke@435 | 156 | // Called for each compactible space |
duke@435 | 157 | virtual void do_space(CompactibleSpace* s) = 0; |
duke@435 | 158 | }; |
duke@435 | 159 | |
duke@435 | 160 | |
duke@435 | 161 | |
duke@435 | 162 | // MonitorClosure is used for iterating over monitors in the monitors cache |
duke@435 | 163 | |
duke@435 | 164 | class ObjectMonitor; |
duke@435 | 165 | |
duke@435 | 166 | class MonitorClosure : public StackObj { |
duke@435 | 167 | public: |
duke@435 | 168 | // called for each monitor in cache |
duke@435 | 169 | virtual void do_monitor(ObjectMonitor* m) = 0; |
duke@435 | 170 | }; |
duke@435 | 171 | |
duke@435 | 172 | // A closure that is applied without any arguments. |
duke@435 | 173 | class VoidClosure : public StackObj { |
duke@435 | 174 | public: |
duke@435 | 175 | // I would have liked to declare this a pure virtual, but that breaks |
duke@435 | 176 | // in mysterious ways, for unknown reasons. |
duke@435 | 177 | virtual void do_void(); |
duke@435 | 178 | }; |
duke@435 | 179 | |
duke@435 | 180 | |
duke@435 | 181 | // YieldClosure is intended for use by iteration loops |
duke@435 | 182 | // to incrementalize their work, allowing interleaving |
duke@435 | 183 | // of an interruptable task so as to allow other |
duke@435 | 184 | // threads to run (which may not otherwise be able to access |
duke@435 | 185 | // exclusive resources, for instance). Additionally, the |
duke@435 | 186 | // closure also allows for aborting an ongoing iteration |
duke@435 | 187 | // by means of checking the return value from the polling |
duke@435 | 188 | // call. |
duke@435 | 189 | class YieldClosure : public StackObj { |
duke@435 | 190 | public: |
duke@435 | 191 | virtual bool should_return() = 0; |
duke@435 | 192 | }; |
duke@435 | 193 | |
duke@435 | 194 | // Abstract closure for serializing data (read or write). |
duke@435 | 195 | |
duke@435 | 196 | class SerializeOopClosure : public OopClosure { |
duke@435 | 197 | public: |
duke@435 | 198 | // Return bool indicating whether closure implements read or write. |
duke@435 | 199 | virtual bool reading() const = 0; |
duke@435 | 200 | |
duke@435 | 201 | // Read/write the int pointed to by i. |
duke@435 | 202 | virtual void do_int(int* i) = 0; |
duke@435 | 203 | |
duke@435 | 204 | // Read/write the size_t pointed to by i. |
duke@435 | 205 | virtual void do_size_t(size_t* i) = 0; |
duke@435 | 206 | |
duke@435 | 207 | // Read/write the void pointer pointed to by p. |
duke@435 | 208 | virtual void do_ptr(void** p) = 0; |
duke@435 | 209 | |
duke@435 | 210 | // Read/write the HeapWord pointer pointed to be p. |
duke@435 | 211 | virtual void do_ptr(HeapWord** p) = 0; |
duke@435 | 212 | |
duke@435 | 213 | // Read/write the region specified. |
duke@435 | 214 | virtual void do_region(u_char* start, size_t size) = 0; |
duke@435 | 215 | |
duke@435 | 216 | // Check/write the tag. If reading, then compare the tag against |
duke@435 | 217 | // the passed in value and fail is they don't match. This allows |
duke@435 | 218 | // for verification that sections of the serialized data are of the |
duke@435 | 219 | // correct length. |
duke@435 | 220 | virtual void do_tag(int tag) = 0; |
duke@435 | 221 | }; |