59 const char* reg_name = PerfDataManager::name_space(_name_space, "region", i);
60 const char* data_name = PerfDataManager::counter_name(reg_name, "data");
61 const char* ns = PerfDataManager::ns_to_string(SUN_GC);
62 const char* fullname = PerfDataManager::counter_name(ns, data_name);
63 assert(!PerfDataManager::exists(fullname), "must not exist");
64 _regions_data[i] = PerfDataManager::create_long_variable(SUN_GC, data_name,
65 PerfData::U_None, CHECK);
66 }
67 }
68 }
69
70 ShenandoahHeapRegionCounters::~ShenandoahHeapRegionCounters() {
71 if (_name_space != NULL) FREE_C_HEAP_ARRAY(char, _name_space);
72 }
73
74 void ShenandoahHeapRegionCounters::update() {
75 if (ShenandoahRegionSampling) {
76 jlong current = os::javaTimeMillis();
77 jlong last = _last_sample_millis;
78 if (current - last > ShenandoahRegionSamplingRate &&
79 Atomic::cmpxchg(current, &_last_sample_millis, last) == last) {
80
81 ShenandoahHeap* heap = ShenandoahHeap::heap();
82 jlong status = 0;
83 if (heap->is_concurrent_mark_in_progress()) status |= 1 << 0;
84 if (heap->is_evacuation_in_progress()) status |= 1 << 1;
85 if (heap->is_update_refs_in_progress()) status |= 1 << 2;
86 if (heap->is_concurrent_traversal_in_progress()) status |= 1 << 3;
87 _status->set_value(status);
88
89 _timestamp->set_value(os::elapsed_counter());
90
91 size_t num_regions = heap->num_regions();
92
93 {
94 ShenandoahHeapLocker locker(heap->lock());
95 size_t rs = ShenandoahHeapRegion::region_size_bytes();
96 for (uint i = 0; i < num_regions; i++) {
97 ShenandoahHeapRegion* r = heap->get_region(i);
98 jlong data = 0;
99 data |= ((100 * r->used() / rs) & PERCENT_MASK) << USED_SHIFT;
|
59 const char* reg_name = PerfDataManager::name_space(_name_space, "region", i);
60 const char* data_name = PerfDataManager::counter_name(reg_name, "data");
61 const char* ns = PerfDataManager::ns_to_string(SUN_GC);
62 const char* fullname = PerfDataManager::counter_name(ns, data_name);
63 assert(!PerfDataManager::exists(fullname), "must not exist");
64 _regions_data[i] = PerfDataManager::create_long_variable(SUN_GC, data_name,
65 PerfData::U_None, CHECK);
66 }
67 }
68 }
69
70 ShenandoahHeapRegionCounters::~ShenandoahHeapRegionCounters() {
71 if (_name_space != NULL) FREE_C_HEAP_ARRAY(char, _name_space);
72 }
73
74 void ShenandoahHeapRegionCounters::update() {
75 if (ShenandoahRegionSampling) {
76 jlong current = os::javaTimeMillis();
77 jlong last = _last_sample_millis;
78 if (current - last > ShenandoahRegionSamplingRate &&
79 Atomic::cmpxchg(&_last_sample_millis, last, current) == last) {
80
81 ShenandoahHeap* heap = ShenandoahHeap::heap();
82 jlong status = 0;
83 if (heap->is_concurrent_mark_in_progress()) status |= 1 << 0;
84 if (heap->is_evacuation_in_progress()) status |= 1 << 1;
85 if (heap->is_update_refs_in_progress()) status |= 1 << 2;
86 if (heap->is_concurrent_traversal_in_progress()) status |= 1 << 3;
87 _status->set_value(status);
88
89 _timestamp->set_value(os::elapsed_counter());
90
91 size_t num_regions = heap->num_regions();
92
93 {
94 ShenandoahHeapLocker locker(heap->lock());
95 size_t rs = ShenandoahHeapRegion::region_size_bytes();
96 for (uint i = 0; i < num_regions; i++) {
97 ShenandoahHeapRegion* r = heap->get_region(i);
98 jlong data = 0;
99 data |= ((100 * r->used() / rs) & PERCENT_MASK) << USED_SHIFT;
|