Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/gc_implementation/g1/ptrQueue.inline.hpp@830ca2573896 (annotated)
src/share/vm/gc_implementation/g1/ptrQueue.inline.hpp
Fri, 12 Jun 2009 16:20:16 -0400
- author
- tonyp
- date
- Fri, 12 Jun 2009 16:20:16 -0400
- changeset 1246
- 830ca2573896
- parent 777
- 37f87013dfd8
- permissions
- -rw-r--r--
6850846: G1: extend G1 marking verification
Summary: extend G1 marking verification to use either the "prev" or "next" marking information, as appropriate.
Reviewed-by: johnc, ysr
| ysr@777 | 1 | /* |
| ysr@777 | 2 | * Copyright 2001-2007 Sun Microsystems, Inc. All Rights Reserved. |
| ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| ysr@777 | 4 | * |
| ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
| ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| ysr@777 | 7 | * published by the Free Software Foundation. |
| ysr@777 | 8 | * |
| ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| ysr@777 | 13 | * accompanied this code). |
| ysr@777 | 14 | * |
| ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
| ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| ysr@777 | 18 | * |
| ysr@777 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| ysr@777 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| ysr@777 | 21 | * have any questions. |
| ysr@777 | 22 | * |
| ysr@777 | 23 | */ |
| ysr@777 | 24 | |
| ysr@777 | 25 | void PtrQueue::handle_zero_index() { |
| ysr@777 | 26 | assert(0 == _index, "Precondition."); |
| ysr@777 | 27 | // This thread records the full buffer and allocates a new one (while |
| ysr@777 | 28 | // holding the lock if there is one). |
| ysr@777 | 29 | void** buf = _buf; |
| ysr@777 | 30 | _buf = qset()->allocate_buffer(); |
| ysr@777 | 31 | _sz = qset()->buffer_size(); |
| ysr@777 | 32 | _index = _sz; |
| ysr@777 | 33 | assert(0 <= _index && _index <= _sz, "Invariant."); |
| ysr@777 | 34 | if (buf != NULL) { |
| ysr@777 | 35 | if (_lock) { |
| ysr@777 | 36 | locking_enqueue_completed_buffer(buf); |
| ysr@777 | 37 | } else { |
| ysr@777 | 38 | qset()->enqueue_complete_buffer(buf); |
| ysr@777 | 39 | } |
| ysr@777 | 40 | } |
| ysr@777 | 41 | } |
