Mon, 09 Jun 2008 07:18:59 -0700
6711930: NUMA allocator: ParOld can create a hole less than minimal object size in the lgrp chunk
Summary: The fix takes care of three issues that can create a hole less a minimal object in the lgrp chunk
Reviewed-by: ysr, apetrusenko
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2004 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 | /* Copyright 1992 Sun Microsystems, Inc. and Stanford University. |
duke@435 | 26 | See the LICENSE file for license information. */ |
duke@435 | 27 | |
duke@435 | 28 | # include "incls/_precompiled.incl" |
duke@435 | 29 | # include "incls/_ageTable.cpp.incl" |
duke@435 | 30 | |
duke@435 | 31 | ageTable::ageTable(bool global) { |
duke@435 | 32 | |
duke@435 | 33 | clear(); |
duke@435 | 34 | |
duke@435 | 35 | if (UsePerfData && global) { |
duke@435 | 36 | |
duke@435 | 37 | ResourceMark rm; |
duke@435 | 38 | EXCEPTION_MARK; |
duke@435 | 39 | |
duke@435 | 40 | const char* agetable_ns = "generation.0.agetable"; |
duke@435 | 41 | const char* bytes_ns = PerfDataManager::name_space(agetable_ns, "bytes"); |
duke@435 | 42 | |
duke@435 | 43 | for(int age = 0; age < table_size; age ++) { |
duke@435 | 44 | char age_name[10]; |
duke@435 | 45 | jio_snprintf(age_name, sizeof(age_name), "%2.2d", age); |
duke@435 | 46 | const char* cname = PerfDataManager::counter_name(bytes_ns, age_name); |
duke@435 | 47 | _perf_sizes[age] = PerfDataManager::create_variable(SUN_GC, cname, |
duke@435 | 48 | PerfData::U_Bytes, |
duke@435 | 49 | CHECK); |
duke@435 | 50 | } |
duke@435 | 51 | |
duke@435 | 52 | const char* cname = PerfDataManager::counter_name(agetable_ns, "size"); |
duke@435 | 53 | PerfDataManager::create_constant(SUN_GC, cname, PerfData::U_None, |
duke@435 | 54 | table_size, CHECK); |
duke@435 | 55 | } |
duke@435 | 56 | } |
duke@435 | 57 | |
duke@435 | 58 | void ageTable::clear() { |
duke@435 | 59 | for (size_t* p = sizes; p < sizes + table_size; ++p) { |
duke@435 | 60 | *p = 0; |
duke@435 | 61 | } |
duke@435 | 62 | } |
duke@435 | 63 | |
duke@435 | 64 | void ageTable::merge(ageTable* subTable) { |
duke@435 | 65 | for (int i = 0; i < table_size; i++) { |
duke@435 | 66 | sizes[i]+= subTable->sizes[i]; |
duke@435 | 67 | } |
duke@435 | 68 | } |
duke@435 | 69 | |
duke@435 | 70 | int ageTable::compute_tenuring_threshold(size_t survivor_capacity) { |
duke@435 | 71 | size_t desired_survivor_size = (size_t)((((double) survivor_capacity)*TargetSurvivorRatio)/100); |
duke@435 | 72 | size_t total = 0; |
duke@435 | 73 | int age = 1; |
duke@435 | 74 | assert(sizes[0] == 0, "no objects with age zero should be recorded"); |
duke@435 | 75 | while (age < table_size) { |
duke@435 | 76 | total += sizes[age]; |
duke@435 | 77 | // check if including objects of age 'age' made us pass the desired |
duke@435 | 78 | // size, if so 'age' is the new threshold |
duke@435 | 79 | if (total > desired_survivor_size) break; |
duke@435 | 80 | age++; |
duke@435 | 81 | } |
duke@435 | 82 | int result = age < MaxTenuringThreshold ? age : MaxTenuringThreshold; |
duke@435 | 83 | |
duke@435 | 84 | if (PrintTenuringDistribution || UsePerfData) { |
duke@435 | 85 | |
duke@435 | 86 | if (PrintTenuringDistribution) { |
duke@435 | 87 | gclog_or_tty->cr(); |
duke@435 | 88 | gclog_or_tty->print_cr("Desired survivor size %ld bytes, new threshold %d (max %d)", |
duke@435 | 89 | desired_survivor_size*oopSize, result, MaxTenuringThreshold); |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | total = 0; |
duke@435 | 93 | age = 1; |
duke@435 | 94 | while (age < table_size) { |
duke@435 | 95 | total += sizes[age]; |
duke@435 | 96 | if (sizes[age] > 0) { |
duke@435 | 97 | if (PrintTenuringDistribution) { |
duke@435 | 98 | gclog_or_tty->print_cr("- age %3d: %10ld bytes, %10ld total", |
duke@435 | 99 | age, sizes[age]*oopSize, total*oopSize); |
duke@435 | 100 | } |
duke@435 | 101 | } |
duke@435 | 102 | if (UsePerfData) { |
duke@435 | 103 | _perf_sizes[age]->set_value(sizes[age]*oopSize); |
duke@435 | 104 | } |
duke@435 | 105 | age++; |
duke@435 | 106 | } |
duke@435 | 107 | if (UsePerfData) { |
duke@435 | 108 | SharedHeap* sh = SharedHeap::heap(); |
duke@435 | 109 | CollectorPolicy* policy = sh->collector_policy(); |
duke@435 | 110 | GCPolicyCounters* gc_counters = policy->counters(); |
duke@435 | 111 | gc_counters->tenuring_threshold()->set_value(result); |
duke@435 | 112 | gc_counters->desired_survivor_size()->set_value( |
duke@435 | 113 | desired_survivor_size*oopSize); |
duke@435 | 114 | } |
duke@435 | 115 | } |
duke@435 | 116 | |
duke@435 | 117 | return result; |
duke@435 | 118 | } |