360 ClassListParser::populate_cds_indy_info(pool, pool_index, &cii, CHECK);
361 GrowableArray<const char*>* indy_items = cii.items();
362 for (int i = 0; i < indy_items->length(); i++) {
363 w.stream()->print(" %s", indy_items->at(i));
364 }
365 w.stream()->cr();
366 }
367 }
368 }
369 }
370
371 bool ArchiveUtils::has_aot_initialized_mirror(InstanceKlass* src_ik) {
372 if (!ArchiveBuilder::current()->has_been_archived(src_ik)) {
373 return false;
374 }
375 return ArchiveBuilder::current()->get_buffered_addr(src_ik)->has_aot_initialized_mirror();
376 }
377
378 size_t HeapRootSegments::size_in_bytes(size_t seg_idx) {
379 assert(seg_idx < _count, "In range");
380 return objArrayOopDesc::object_size(size_in_elems(seg_idx)) * HeapWordSize;
381 }
382
383 int HeapRootSegments::size_in_elems(size_t seg_idx) {
384 assert(seg_idx < _count, "In range");
385 if (seg_idx != _count - 1) {
386 return _max_size_in_elems;
387 } else {
388 // Last slice, leftover
389 return _roots_count % _max_size_in_elems;
390 }
391 }
392
393 size_t HeapRootSegments::segment_offset(size_t seg_idx) {
394 assert(seg_idx < _count, "In range");
395 return _base_offset + seg_idx * _max_size_in_bytes;
396 }
397
398 ArchiveWorkers::ArchiveWorkers() :
399 _end_semaphore(0),
400 _num_workers(max_workers()),
|
360 ClassListParser::populate_cds_indy_info(pool, pool_index, &cii, CHECK);
361 GrowableArray<const char*>* indy_items = cii.items();
362 for (int i = 0; i < indy_items->length(); i++) {
363 w.stream()->print(" %s", indy_items->at(i));
364 }
365 w.stream()->cr();
366 }
367 }
368 }
369 }
370
371 bool ArchiveUtils::has_aot_initialized_mirror(InstanceKlass* src_ik) {
372 if (!ArchiveBuilder::current()->has_been_archived(src_ik)) {
373 return false;
374 }
375 return ArchiveBuilder::current()->get_buffered_addr(src_ik)->has_aot_initialized_mirror();
376 }
377
378 size_t HeapRootSegments::size_in_bytes(size_t seg_idx) {
379 assert(seg_idx < _count, "In range");
380 return refArrayOopDesc::object_size(size_in_elems(seg_idx)) * HeapWordSize;
381 }
382
383 int HeapRootSegments::size_in_elems(size_t seg_idx) {
384 assert(seg_idx < _count, "In range");
385 if (seg_idx != _count - 1) {
386 return _max_size_in_elems;
387 } else {
388 // Last slice, leftover
389 return _roots_count % _max_size_in_elems;
390 }
391 }
392
393 size_t HeapRootSegments::segment_offset(size_t seg_idx) {
394 assert(seg_idx < _count, "In range");
395 return _base_offset + seg_idx * _max_size_in_bytes;
396 }
397
398 ArchiveWorkers::ArchiveWorkers() :
399 _end_semaphore(0),
400 _num_workers(max_workers()),
|