annotate src/share/vm/gc_implementation/g1/concurrentG1Refine.hpp @ 794:315a5d70b295

6484957: G1: parallel concurrent refinement 6826318: G1: remove traversal-based refinement code Summary: Removed traversal-based refinement code as it's no longer used. Made the concurrent refinement (queue-based) parallel. Reviewed-by: tonyp
author iveresov
date Mon, 11 May 2009 16:30:56 -0700
parents 0fbdb4381b99
children 215f81b4d9b3
rev   line source
ysr@342 1 /*
xdono@579 2 * Copyright 2001-2009 Sun Microsystems, Inc. All Rights Reserved.
ysr@342 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@342 4 *
ysr@342 5 * This code is free software; you can redistribute it and/or modify it
ysr@342 6 * under the terms of the GNU General Public License version 2 only, as
ysr@342 7 * published by the Free Software Foundation.
ysr@342 8 *
ysr@342 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@342 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@342 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@342 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@342 13 * accompanied this code).
ysr@342 14 *
ysr@342 15 * You should have received a copy of the GNU General Public License version
ysr@342 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@342 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@342 18 *
ysr@342 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
ysr@342 20 * CA 95054 USA or visit www.sun.com if you need additional information or
ysr@342 21 * have any questions.
ysr@342 22 *
ysr@342 23 */
ysr@342 24
ysr@342 25 // Forward decl
ysr@342 26 class ConcurrentG1RefineThread;
ysr@342 27 class G1RemSet;
ysr@342 28
apetrusenko@549 29 class ConcurrentG1Refine: public CHeapObj {
iveresov@794 30 ConcurrentG1RefineThread** _threads;
iveresov@794 31 int _n_threads;
ysr@342 32
ysr@342 33 // The cache for card refinement.
ysr@342 34 bool _use_cache;
ysr@342 35 bool _def_use_cache;
ysr@342 36 size_t _n_periods;
ysr@342 37 size_t _total_cards;
ysr@342 38 size_t _total_travs;
ysr@342 39
ysr@342 40 unsigned char* _card_counts;
ysr@342 41 unsigned _n_card_counts;
ysr@342 42 const jbyte* _ct_bot;
ysr@342 43 unsigned* _cur_card_count_histo;
ysr@342 44 unsigned* _cum_card_count_histo;
ysr@342 45 jbyte** _hot_cache;
ysr@342 46 int _hot_cache_size;
ysr@342 47 int _n_hot;
ysr@342 48 int _hot_cache_idx;
ysr@342 49
ysr@342 50 // Returns the count of this card after incrementing it.
ysr@342 51 int add_card_count(jbyte* card_ptr);
ysr@342 52
ysr@342 53 void print_card_count_histo_range(unsigned* histo, int from, int to,
ysr@342 54 float& cum_card_pct,
ysr@342 55 float& cum_travs_pct);
ysr@342 56 public:
ysr@342 57 ConcurrentG1Refine();
ysr@342 58 ~ConcurrentG1Refine();
ysr@342 59
ysr@342 60 void init(); // Accomplish some initialization that has to wait.
iveresov@794 61 void stop();
ysr@342 62
iveresov@794 63 // Iterate over the conc refine threads
iveresov@794 64 void threads_do(ThreadClosure *tc);
ysr@342 65
ysr@342 66 // If this is the first entry for the slot, writes into the cache and
ysr@342 67 // returns NULL. If it causes an eviction, returns the evicted pointer.
ysr@342 68 // Otherwise, its a cache hit, and returns NULL.
ysr@342 69 jbyte* cache_insert(jbyte* card_ptr);
ysr@342 70
ysr@342 71 // Process the cached entries.
ysr@342 72 void clean_up_cache(int worker_i, G1RemSet* g1rs);
ysr@342 73
ysr@342 74 // Discard entries in the hot cache.
ysr@342 75 void clear_hot_cache() {
ysr@342 76 _hot_cache_idx = 0; _n_hot = 0;
ysr@342 77 }
ysr@342 78
ysr@342 79 bool hot_cache_is_empty() { return _n_hot == 0; }
ysr@342 80
ysr@342 81 bool use_cache() { return _use_cache; }
ysr@342 82 void set_use_cache(bool b) {
ysr@342 83 if (b) _use_cache = _def_use_cache;
ysr@342 84 else _use_cache = false;
ysr@342 85 }
ysr@342 86
ysr@342 87 void clear_and_record_card_counts();
ysr@342 88 void print_final_card_counts();
ysr@342 89 };