Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/memory/referenceProcessor.hpp
+++ new/src/share/vm/memory/referenceProcessor.hpp
1 1 /*
2 2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #ifndef SHARE_VM_MEMORY_REFERENCEPROCESSOR_HPP
26 26 #define SHARE_VM_MEMORY_REFERENCEPROCESSOR_HPP
27 27
28 28 #include "memory/referencePolicy.hpp"
29 29 #include "oops/instanceRefKlass.hpp"
30 30
31 31 // ReferenceProcessor class encapsulates the per-"collector" processing
32 32 // of java.lang.Reference objects for GC. The interface is useful for supporting
33 33 // a generational abstraction, in particular when there are multiple
34 34 // generations that are being independently collected -- possibly
35 35 // concurrently and/or incrementally. Note, however, that the
36 36 // ReferenceProcessor class abstracts away from a generational setting
37 37 // by using only a heap interval (called "span" below), thus allowing
38 38 // its use in a straightforward manner in a general, non-generational
39 39 // setting.
40 40 //
41 41 // The basic idea is that each ReferenceProcessor object concerns
42 42 // itself with ("weak") reference processing in a specific "span"
43 43 // of the heap of interest to a specific collector. Currently,
44 44 // the span is a convex interval of the heap, but, efficiency
45 45 // apart, there seems to be no reason it couldn't be extended
46 46 // (with appropriate modifications) to any "non-convex interval".
47 47
48 48 // forward references
49 49 class ReferencePolicy;
50 50 class AbstractRefProcTaskExecutor;
51 51 class DiscoveredList;
52 52
53 53 class ReferenceProcessor : public CHeapObj {
54 54 protected:
55 55 // End of list marker
56 56 static oop _sentinelRef;
57 57 MemRegion _span; // (right-open) interval of heap
58 58 // subject to wkref discovery
59 59 bool _discovering_refs; // true when discovery enabled
60 60 bool _discovery_is_atomic; // if discovery is atomic wrt
61 61 // other collectors in configuration
62 62 bool _discovery_is_mt; // true if reference discovery is MT.
63 63 // If true, setting "next" field of a discovered refs list requires
|
↓ open down ↓ |
63 lines elided |
↑ open up ↑ |
64 64 // write barrier(s). (Must be true if used in a collector in which
65 65 // elements of a discovered list may be moved during discovery: for
66 66 // example, a collector like Garbage-First that moves objects during a
67 67 // long-term concurrent marking phase that does weak reference
68 68 // discovery.)
69 69 bool _discovered_list_needs_barrier;
70 70 BarrierSet* _bs; // Cached copy of BarrierSet.
71 71 bool _enqueuing_is_done; // true if all weak references enqueued
72 72 bool _processing_is_mt; // true during phases when
73 73 // reference processing is MT.
74 - int _next_id; // round-robin counter in
74 + int _next_id; // round-robin mod _num_q counter in
75 75 // support of work distribution
76 76
77 77 // For collectors that do not keep GC marking information
78 78 // in the object header, this field holds a closure that
79 79 // helps the reference processor determine the reachability
80 80 // of an oop (the field is currently initialized to NULL for
81 81 // all collectors but the CMS collector).
82 82 BoolObjectClosure* _is_alive_non_header;
83 83
84 84 // Soft ref clearing policies
85 85 // . the default policy
86 86 static ReferencePolicy* _default_soft_ref_policy;
87 87 // . the "clear all" policy
88 88 static ReferencePolicy* _always_clear_soft_ref_policy;
89 89 // . the current policy below is either one of the above
90 90 ReferencePolicy* _current_soft_ref_policy;
91 91
92 92 // The discovered ref lists themselves
93 93
94 94 // The active MT'ness degree of the queues below
95 95 int _num_q;
|
↓ open down ↓ |
11 lines elided |
↑ open up ↑ |
96 96 // The maximum MT'ness degree of the queues below
97 97 int _max_num_q;
98 98 // Arrays of lists of oops, one per thread
99 99 DiscoveredList* _discoveredSoftRefs;
100 100 DiscoveredList* _discoveredWeakRefs;
101 101 DiscoveredList* _discoveredFinalRefs;
102 102 DiscoveredList* _discoveredPhantomRefs;
103 103
104 104 public:
105 105 int num_q() { return _num_q; }
106 - void set_mt_degree(int v) { _num_q = v; }
106 + int max_num_q() { return _max_num_q; }
107 + void set_active_mt_degree(int v) { _num_q = v; }
107 108 DiscoveredList* discovered_soft_refs() { return _discoveredSoftRefs; }
108 109 static oop sentinel_ref() { return _sentinelRef; }
109 110 static oop* adr_sentinel_ref() { return &_sentinelRef; }
110 111 ReferencePolicy* setup_policy(bool always_clear) {
111 112 _current_soft_ref_policy = always_clear ?
112 113 _always_clear_soft_ref_policy : _default_soft_ref_policy;
113 114 _current_soft_ref_policy->setup(); // snapshot the policy threshold
114 115 return _current_soft_ref_policy;
115 116 }
116 117
117 118 public:
118 119 // Process references with a certain reachability level.
119 120 void process_discovered_reflist(DiscoveredList refs_lists[],
120 121 ReferencePolicy* policy,
121 122 bool clear_referent,
122 123 BoolObjectClosure* is_alive,
123 124 OopClosure* keep_alive,
124 125 VoidClosure* complete_gc,
125 126 AbstractRefProcTaskExecutor* task_executor);
126 127
127 128 void process_phaseJNI(BoolObjectClosure* is_alive,
128 129 OopClosure* keep_alive,
129 130 VoidClosure* complete_gc);
130 131
131 132 // Work methods used by the method process_discovered_reflist
132 133 // Phase1: keep alive all those referents that are otherwise
133 134 // dead but which must be kept alive by policy (and their closure).
134 135 void process_phase1(DiscoveredList& refs_list,
135 136 ReferencePolicy* policy,
136 137 BoolObjectClosure* is_alive,
137 138 OopClosure* keep_alive,
138 139 VoidClosure* complete_gc);
139 140 // Phase2: remove all those references whose referents are
140 141 // reachable.
141 142 inline void process_phase2(DiscoveredList& refs_list,
142 143 BoolObjectClosure* is_alive,
143 144 OopClosure* keep_alive,
144 145 VoidClosure* complete_gc) {
145 146 if (discovery_is_atomic()) {
146 147 // complete_gc is ignored in this case for this phase
147 148 pp2_work(refs_list, is_alive, keep_alive);
148 149 } else {
149 150 assert(complete_gc != NULL, "Error");
150 151 pp2_work_concurrent_discovery(refs_list, is_alive,
151 152 keep_alive, complete_gc);
152 153 }
153 154 }
154 155 // Work methods in support of process_phase2
155 156 void pp2_work(DiscoveredList& refs_list,
156 157 BoolObjectClosure* is_alive,
157 158 OopClosure* keep_alive);
158 159 void pp2_work_concurrent_discovery(
159 160 DiscoveredList& refs_list,
160 161 BoolObjectClosure* is_alive,
161 162 OopClosure* keep_alive,
162 163 VoidClosure* complete_gc);
163 164 // Phase3: process the referents by either clearing them
164 165 // or keeping them alive (and their closure)
165 166 void process_phase3(DiscoveredList& refs_list,
166 167 bool clear_referent,
167 168 BoolObjectClosure* is_alive,
168 169 OopClosure* keep_alive,
169 170 VoidClosure* complete_gc);
170 171
171 172 // Enqueue references with a certain reachability level
172 173 void enqueue_discovered_reflist(DiscoveredList& refs_list, HeapWord* pending_list_addr);
173 174
174 175 // "Preclean" all the discovered reference lists
175 176 // by removing references with strongly reachable referents.
176 177 // The first argument is a predicate on an oop that indicates
177 178 // its (strong) reachability and the second is a closure that
178 179 // may be used to incrementalize or abort the precleaning process.
179 180 // The caller is responsible for taking care of potential
180 181 // interference with concurrent operations on these lists
181 182 // (or predicates involved) by other threads. Currently
182 183 // only used by the CMS collector. should_unload_classes is
183 184 // used to aid assertion checking when classes are collected.
184 185 void preclean_discovered_references(BoolObjectClosure* is_alive,
185 186 OopClosure* keep_alive,
186 187 VoidClosure* complete_gc,
187 188 YieldClosure* yield,
188 189 bool should_unload_classes);
189 190
190 191 // Delete entries in the discovered lists that have
191 192 // either a null referent or are not active. Such
192 193 // Reference objects can result from the clearing
193 194 // or enqueueing of Reference objects concurrent
194 195 // with their discovery by a (concurrent) collector.
195 196 // For a definition of "active" see java.lang.ref.Reference;
196 197 // Refs are born active, become inactive when enqueued,
197 198 // and never become active again. The state of being
198 199 // active is encoded as follows: A Ref is active
199 200 // if and only if its "next" field is NULL.
200 201 void clean_up_discovered_references();
201 202 void clean_up_discovered_reflist(DiscoveredList& refs_list);
202 203
203 204 // Returns the name of the discovered reference list
204 205 // occupying the i / _num_q slot.
205 206 const char* list_name(int i);
206 207
207 208 void enqueue_discovered_reflists(HeapWord* pending_list_addr, AbstractRefProcTaskExecutor* task_executor);
208 209
|
↓ open down ↓ |
92 lines elided |
↑ open up ↑ |
209 210 protected:
210 211 // "Preclean" the given discovered reference list
211 212 // by removing references with strongly reachable referents.
212 213 // Currently used in support of CMS only.
213 214 void preclean_discovered_reflist(DiscoveredList& refs_list,
214 215 BoolObjectClosure* is_alive,
215 216 OopClosure* keep_alive,
216 217 VoidClosure* complete_gc,
217 218 YieldClosure* yield);
218 219
220 + // round-robin mod _num_q (not: _not_ mode _max_num_q)
219 221 int next_id() {
220 222 int id = _next_id;
221 223 if (++_next_id == _num_q) {
222 224 _next_id = 0;
223 225 }
224 226 return id;
225 227 }
226 228 DiscoveredList* get_discovered_list(ReferenceType rt);
227 229 inline void add_to_discovered_list_mt(DiscoveredList& refs_list, oop obj,
228 230 HeapWord* discovered_addr);
229 231 void verify_ok_to_handle_reflists() PRODUCT_RETURN;
230 232
231 233 void abandon_partial_discovered_list(DiscoveredList& refs_list);
232 234
233 235 // Calculate the number of jni handles.
234 236 unsigned int count_jni_refs();
235 237
236 238 // Balances reference queues.
237 239 void balance_queues(DiscoveredList ref_lists[]);
238 240
239 241 // Update (advance) the soft ref master clock field.
240 242 void update_soft_ref_master_clock();
241 243
242 244 public:
243 245 // constructor
244 246 ReferenceProcessor():
245 247 _span((HeapWord*)NULL, (HeapWord*)NULL),
246 248 _discoveredSoftRefs(NULL), _discoveredWeakRefs(NULL),
247 249 _discoveredFinalRefs(NULL), _discoveredPhantomRefs(NULL),
248 250 _discovering_refs(false),
|
↓ open down ↓ |
20 lines elided |
↑ open up ↑ |
249 251 _discovery_is_atomic(true),
250 252 _enqueuing_is_done(false),
251 253 _discovery_is_mt(false),
252 254 _discovered_list_needs_barrier(false),
253 255 _bs(NULL),
254 256 _is_alive_non_header(NULL),
255 257 _num_q(0),
256 258 _max_num_q(0),
257 259 _processing_is_mt(false),
258 260 _next_id(0)
259 - {}
261 + { }
260 262
261 - ReferenceProcessor(MemRegion span, bool atomic_discovery,
262 - bool mt_discovery,
263 - int mt_degree = 1,
264 - bool mt_processing = false,
263 + // Default parameters give you a vanilla reference processor.
264 + ReferenceProcessor(MemRegion span,
265 + bool mt_processing = false, int mt_processing_degree = 1,
266 + bool mt_discovery = false, int mt_discovery_degree = 1,
267 + bool atomic_discovery = true,
268 + BoolObjectClosure* is_alive_non_header = NULL,
265 269 bool discovered_list_needs_barrier = false);
266 270
267 - // Allocates and initializes a reference processor.
268 - static ReferenceProcessor* create_ref_processor(
269 - MemRegion span,
270 - bool atomic_discovery,
271 - bool mt_discovery,
272 - BoolObjectClosure* is_alive_non_header = NULL,
273 - int parallel_gc_threads = 1,
274 - bool mt_processing = false,
275 - bool discovered_list_needs_barrier = false);
276 -
277 271 // RefDiscoveryPolicy values
278 272 enum DiscoveryPolicy {
279 273 ReferenceBasedDiscovery = 0,
280 274 ReferentBasedDiscovery = 1,
281 275 DiscoveryPolicyMin = ReferenceBasedDiscovery,
282 276 DiscoveryPolicyMax = ReferentBasedDiscovery
283 277 };
284 278
285 279 static void init_statics();
286 280
287 281 public:
288 282 // get and set "is_alive_non_header" field
289 283 BoolObjectClosure* is_alive_non_header() {
290 284 return _is_alive_non_header;
291 285 }
292 286 void set_is_alive_non_header(BoolObjectClosure* is_alive_non_header) {
293 287 _is_alive_non_header = is_alive_non_header;
294 288 }
295 289
296 290 // get and set span
297 291 MemRegion span() { return _span; }
298 292 void set_span(MemRegion span) { _span = span; }
299 293
300 294 // start and stop weak ref discovery
301 295 void enable_discovery() { _discovering_refs = true; }
302 296 void disable_discovery() { _discovering_refs = false; }
303 297 bool discovery_enabled() { return _discovering_refs; }
304 298
305 299 // whether discovery is atomic wrt other collectors
306 300 bool discovery_is_atomic() const { return _discovery_is_atomic; }
307 301 void set_atomic_discovery(bool atomic) { _discovery_is_atomic = atomic; }
308 302
309 303 // whether discovery is done by multiple threads same-old-timeously
310 304 bool discovery_is_mt() const { return _discovery_is_mt; }
311 305 void set_mt_discovery(bool mt) { _discovery_is_mt = mt; }
312 306
313 307 // Whether we are in a phase when _processing_ is MT.
314 308 bool processing_is_mt() const { return _processing_is_mt; }
315 309 void set_mt_processing(bool mt) { _processing_is_mt = mt; }
316 310
317 311 // whether all enqueuing of weak references is complete
318 312 bool enqueuing_is_done() { return _enqueuing_is_done; }
319 313 void set_enqueuing_is_done(bool v) { _enqueuing_is_done = v; }
320 314
321 315 // iterate over oops
322 316 void weak_oops_do(OopClosure* f); // weak roots
323 317 static void oops_do(OopClosure* f); // strong root(s)
324 318
325 319 // Balance each of the discovered lists.
326 320 void balance_all_queues();
327 321
328 322 // Discover a Reference object, using appropriate discovery criteria
329 323 bool discover_reference(oop obj, ReferenceType rt);
330 324
331 325 // Process references found during GC (called by the garbage collector)
332 326 void process_discovered_references(BoolObjectClosure* is_alive,
333 327 OopClosure* keep_alive,
334 328 VoidClosure* complete_gc,
335 329 AbstractRefProcTaskExecutor* task_executor);
336 330
337 331 public:
338 332 // Enqueue references at end of GC (called by the garbage collector)
339 333 bool enqueue_discovered_references(AbstractRefProcTaskExecutor* task_executor = NULL);
340 334
341 335 // If a discovery is in process that is being superceded, abandon it: all
342 336 // the discovered lists will be empty, and all the objects on them will
343 337 // have NULL discovered fields. Must be called only at a safepoint.
344 338 void abandon_partial_discovery();
345 339
346 340 // debugging
347 341 void verify_no_references_recorded() PRODUCT_RETURN;
348 342 void verify_referent(oop obj) PRODUCT_RETURN;
349 343 static void verify();
350 344
351 345 // clear the discovered lists (unlinking each entry).
352 346 void clear_discovered_references() PRODUCT_RETURN;
353 347 };
354 348
355 349 // A utility class to disable reference discovery in
356 350 // the scope which contains it, for given ReferenceProcessor.
357 351 class NoRefDiscovery: StackObj {
358 352 private:
359 353 ReferenceProcessor* _rp;
360 354 bool _was_discovering_refs;
361 355 public:
362 356 NoRefDiscovery(ReferenceProcessor* rp) : _rp(rp) {
363 357 _was_discovering_refs = _rp->discovery_enabled();
364 358 if (_was_discovering_refs) {
365 359 _rp->disable_discovery();
366 360 }
367 361 }
368 362
369 363 ~NoRefDiscovery() {
370 364 if (_was_discovering_refs) {
371 365 _rp->enable_discovery();
372 366 }
373 367 }
374 368 };
375 369
376 370
377 371 // A utility class to temporarily mutate the span of the
378 372 // given ReferenceProcessor in the scope that contains it.
379 373 class ReferenceProcessorSpanMutator: StackObj {
380 374 private:
381 375 ReferenceProcessor* _rp;
382 376 MemRegion _saved_span;
383 377
384 378 public:
385 379 ReferenceProcessorSpanMutator(ReferenceProcessor* rp,
386 380 MemRegion span):
387 381 _rp(rp) {
388 382 _saved_span = _rp->span();
389 383 _rp->set_span(span);
|
↓ open down ↓ |
103 lines elided |
↑ open up ↑ |
390 384 }
391 385
392 386 ~ReferenceProcessorSpanMutator() {
393 387 _rp->set_span(_saved_span);
394 388 }
395 389 };
396 390
397 391 // A utility class to temporarily change the MT'ness of
398 392 // reference discovery for the given ReferenceProcessor
399 393 // in the scope that contains it.
400 -class ReferenceProcessorMTMutator: StackObj {
394 +class ReferenceProcessorMTDiscoveryMutator: StackObj {
401 395 private:
402 396 ReferenceProcessor* _rp;
403 397 bool _saved_mt;
404 398
405 399 public:
406 - ReferenceProcessorMTMutator(ReferenceProcessor* rp,
407 - bool mt):
400 + ReferenceProcessorMTDiscoveryMutator(ReferenceProcessor* rp,
401 + bool mt):
408 402 _rp(rp) {
409 403 _saved_mt = _rp->discovery_is_mt();
410 404 _rp->set_mt_discovery(mt);
411 405 }
412 406
413 - ~ReferenceProcessorMTMutator() {
407 + ~ReferenceProcessorMTDiscoveryMutator() {
414 408 _rp->set_mt_discovery(_saved_mt);
415 409 }
416 410 };
417 411
418 412
419 413 // A utility class to temporarily change the disposition
420 414 // of the "is_alive_non_header" closure field of the
421 415 // given ReferenceProcessor in the scope that contains it.
422 416 class ReferenceProcessorIsAliveMutator: StackObj {
423 417 private:
424 418 ReferenceProcessor* _rp;
425 419 BoolObjectClosure* _saved_cl;
426 420
427 421 public:
428 422 ReferenceProcessorIsAliveMutator(ReferenceProcessor* rp,
429 423 BoolObjectClosure* cl):
430 424 _rp(rp) {
431 425 _saved_cl = _rp->is_alive_non_header();
432 426 _rp->set_is_alive_non_header(cl);
433 427 }
434 428
435 429 ~ReferenceProcessorIsAliveMutator() {
436 430 _rp->set_is_alive_non_header(_saved_cl);
437 431 }
438 432 };
439 433
440 434 // A utility class to temporarily change the disposition
441 435 // of the "discovery_is_atomic" field of the
442 436 // given ReferenceProcessor in the scope that contains it.
443 437 class ReferenceProcessorAtomicMutator: StackObj {
444 438 private:
445 439 ReferenceProcessor* _rp;
446 440 bool _saved_atomic_discovery;
447 441
448 442 public:
449 443 ReferenceProcessorAtomicMutator(ReferenceProcessor* rp,
450 444 bool atomic):
451 445 _rp(rp) {
452 446 _saved_atomic_discovery = _rp->discovery_is_atomic();
453 447 _rp->set_atomic_discovery(atomic);
454 448 }
455 449
456 450 ~ReferenceProcessorAtomicMutator() {
457 451 _rp->set_atomic_discovery(_saved_atomic_discovery);
458 452 }
459 453 };
460 454
461 455
462 456 // A utility class to temporarily change the MT processing
463 457 // disposition of the given ReferenceProcessor instance
464 458 // in the scope that contains it.
465 459 class ReferenceProcessorMTProcMutator: StackObj {
466 460 private:
467 461 ReferenceProcessor* _rp;
468 462 bool _saved_mt;
469 463
470 464 public:
471 465 ReferenceProcessorMTProcMutator(ReferenceProcessor* rp,
472 466 bool mt):
473 467 _rp(rp) {
474 468 _saved_mt = _rp->processing_is_mt();
475 469 _rp->set_mt_processing(mt);
476 470 }
477 471
478 472 ~ReferenceProcessorMTProcMutator() {
479 473 _rp->set_mt_processing(_saved_mt);
480 474 }
481 475 };
482 476
483 477
484 478 // This class is an interface used to implement task execution for the
485 479 // reference processing.
486 480 class AbstractRefProcTaskExecutor {
487 481 public:
488 482
489 483 // Abstract tasks to execute.
490 484 class ProcessTask;
491 485 class EnqueueTask;
492 486
493 487 // Executes a task using worker threads.
494 488 virtual void execute(ProcessTask& task) = 0;
495 489 virtual void execute(EnqueueTask& task) = 0;
496 490
497 491 // Switch to single threaded mode.
498 492 virtual void set_single_threaded_mode() { };
499 493 };
500 494
501 495 // Abstract reference processing task to execute.
502 496 class AbstractRefProcTaskExecutor::ProcessTask {
503 497 protected:
504 498 ProcessTask(ReferenceProcessor& ref_processor,
505 499 DiscoveredList refs_lists[],
506 500 bool marks_oops_alive)
507 501 : _ref_processor(ref_processor),
508 502 _refs_lists(refs_lists),
509 503 _marks_oops_alive(marks_oops_alive)
510 504 { }
511 505
512 506 public:
513 507 virtual void work(unsigned int work_id, BoolObjectClosure& is_alive,
514 508 OopClosure& keep_alive,
515 509 VoidClosure& complete_gc) = 0;
516 510
517 511 // Returns true if a task marks some oops as alive.
518 512 bool marks_oops_alive() const
519 513 { return _marks_oops_alive; }
520 514
521 515 protected:
522 516 ReferenceProcessor& _ref_processor;
523 517 DiscoveredList* _refs_lists;
524 518 const bool _marks_oops_alive;
525 519 };
526 520
527 521 // Abstract reference processing task to execute.
528 522 class AbstractRefProcTaskExecutor::EnqueueTask {
529 523 protected:
530 524 EnqueueTask(ReferenceProcessor& ref_processor,
531 525 DiscoveredList refs_lists[],
532 526 HeapWord* pending_list_addr,
533 527 oop sentinel_ref,
534 528 int n_queues)
535 529 : _ref_processor(ref_processor),
536 530 _refs_lists(refs_lists),
537 531 _pending_list_addr(pending_list_addr),
538 532 _sentinel_ref(sentinel_ref),
539 533 _n_queues(n_queues)
540 534 { }
541 535
542 536 public:
543 537 virtual void work(unsigned int work_id) = 0;
544 538
545 539 protected:
546 540 ReferenceProcessor& _ref_processor;
547 541 DiscoveredList* _refs_lists;
548 542 HeapWord* _pending_list_addr;
549 543 oop _sentinel_ref;
550 544 int _n_queues;
551 545 };
552 546
553 547 #endif // SHARE_VM_MEMORY_REFERENCEPROCESSOR_HPP
|
↓ open down ↓ |
130 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX