/openjdk10/hotspot/test/native/gc/shared/ |
H A D | test_memset_with_concurrent_readers.cpp | 40 const size_t block_size = (chunk_count + 4) * chunk_size; local 41 char block[block_size]; 42 char clear_block[block_size]; 43 char set_block[block_size]; 55 memset(clear_block, clear_value, block_size); 56 memset(set_block, set_value, block_size); 65 memset(block, clear_value, block_size); 69 bool tail_clear = !memcmp(clear_block, block + set_end, block_size - set_end); 74 for (unsigned chunk = 0; chunk < (block_size / chunk_size); ++chunk) {
|
/openjdk10/jdk/src/java.base/share/classes/com/sun/crypto/provider/ |
H A D | BlockCipherParamsCore.java | 48 private int block_size = 0; field in class:BlockCipherParamsCore 52 block_size = blksize; 62 if (tmpIv.length != block_size) { 64 block_size + " bytes long"); 76 if (tmpIv.length != block_size) { 77 throw new IOException("IV not " + block_size +
|
/openjdk10/jdk/test/sun/util/calendar/zi/ |
H A D | Gen.java | 190 int block_size; 241 block_size = 2; 242 raf.writeShort(block_size & 0xFFFF); 250 block_size += 1 + size; 256 raf.writeShort((block_size) & 0xFFFF); 262 index += 3 + block_size; 263 block_size = roi_size * 4; 264 raf.writeShort(block_size & 0xFFFF); 271 index += 3 + block_size; 272 block_size [all...] |
/openjdk10/jdk/test/javax/print/PrintSubInputStream/ |
H A D | Example.java | 131 block_size = avail / sections; 137 return true_avail == 0 ? 0 : block_size; 140 private int block_size; field in class:Example.TestInputStream
|
/openjdk10/hotspot/src/share/vm/gc/parallel/ |
H A D | objectStartArray.cpp | 37 assert((int)block_size == (int)CardTableModRefBS::card_size, "Sanity"); 38 assert((int)block_size <= 512, "block_size must be less than or equal to 512"); 86 assert((uintptr_t(low_bound) & (block_size - 1)) == 0, "heap must start at block boundary"); 87 assert((uintptr_t(high_bound) & (block_size - 1)) == 0, "heap must end at block boundary");
|
H A D | objectStartArray.hpp | 57 block_size = 1 << block_shift, enumerator in enum:ObjectStartArray::BlockSizeConstants 58 block_size_in_words = block_size / sizeof(HeapWord)
|
H A D | parallelScavengeHeap.hpp | 210 size_t block_size(const HeapWord* addr) const;
|
/openjdk10/hotspot/src/share/vm/gc/serial/ |
H A D | tenuredGeneration.inline.hpp | 43 size_t TenuredGeneration::block_size(const HeapWord* addr) const { function in class:TenuredGeneration 47 assert(addr == _the_space->top(), "non-block head arg to block_size");
|
H A D | tenuredGeneration.hpp | 87 inline size_t block_size(const HeapWord* addr) const;
|
/openjdk10/hotspot/src/share/vm/gc/g1/ |
H A D | g1BlockOffsetTable.inline.hpp | 45 HeapWord* n = q + block_size(q); 103 inline size_t G1BlockOffsetTablePart::block_size(const HeapWord* p) const { function in class:G1BlockOffsetTablePart 104 return _space->block_size(p); 144 n += block_size(q); 156 HeapWord* n = q + block_size(q);
|
H A D | g1RemSet.cpp | 367 size_t const block_size = G1RSetScanBlockSize; local 372 size_t claimed_card_block = _scan_state->iter_claimed_next(region_idx, block_size); 374 if (current_card >= claimed_card_block + block_size) { 375 claimed_card_block = _scan_state->iter_claimed_next(region_idx, block_size);
|
H A D | g1BlockOffsetTable.hpp | 145 inline size_t block_size(const HeapWord* p) const;
|
H A D | heapRegion.inline.hpp | 171 inline size_t HeapRegion::block_size(const HeapWord *addr) const { 331 HeapWord* next = cur + block_size(cur);
|
H A D | g1BlockOffsetTable.cpp | 233 n += block_size(q); 343 size_t obj_size = block_size(obj);
|
H A D | heapRegion.hpp | 218 return HeapRegion::block_size(addr); // Avoid virtual call 356 size_t block_size(const HeapWord* p) const;
|
/openjdk10/hotspot/src/share/vm/gc/cms/ |
H A D | parCardTableModRefBS.cpp | 211 byte_for(first_block + sp->block_size(first_block) - 1); 276 const size_t last_block_size = sp->block_size(last_block);
|
H A D | compactibleFreeListSpace.hpp | 311 return CompactibleFreeListSpace::block_size(addr); // Avoid virtual call 441 size_t block_size(const HeapWord* p) const;
|
/openjdk10/hotspot/src/share/vm/gc/shared/ |
H A D | generation.cpp | 228 size = s->block_size(_p); 234 size_t Generation::block_size(const HeapWord* p) const { function in class:Generation
|
H A D | space.cpp | 60 // Use the block_size() method of the space over which 63 // be reflected in the block_size() method. 87 for (; bottom < top; bottom += _sp->block_size(bottom)) { 200 assert(_sp->block_size(top_obj) == (size_t) oop(top_obj)->size(), 592 size_t ContiguousSpace::block_size(const HeapWord* p) const {
|
H A D | cardTableRS.cpp | 464 begin = boundary_block + s->block_size(boundary_block); 474 for (HeapWord* cur = start_block; cur < end; cur += s->block_size(cur)) {
|
H A D | space.hpp | 203 virtual size_t block_size(const HeapWord* addr) const = 0; 349 // Additionally, this also means that changes to block_size() or block_is_obj() that 646 size_t block_size(const HeapWord* p) const;
|
H A D | generation.hpp | 527 virtual size_t block_size(const HeapWord* addr) const ;
|
H A D | genCollectedHeap.hpp | 258 virtual size_t block_size(const HeapWord* addr) const;
|
H A D | blockOffsetTable.cpp | 561 n += _sp->block_size(n); 693 n += _sp->block_size(n);
|
/openjdk10/hotspot/src/share/vm/utilities/ |
H A D | hashtable.cpp | 62 int block_size = MIN2(512, MAX2((int)_table_size / 2, (int)_number_of_entries)); local 63 int len = _entry_size * block_size;
|