/openjdk7/jdk/src/share/classes/com/sun/crypto/provider/ |
H A D | BlockCipherParamsCore.java | 49 private int block_size = 0; field in class:BlockCipherParamsCore 53 block_size = blksize; 63 if (tmpIv.length != block_size) { 65 block_size + " bytes long"); 77 if (tmpIv.length != block_size) { 78 throw new IOException("IV not " + block_size +
|
/openjdk7/jdk/make/tools/src/build/tools/javazic/ |
H A D | Gen.java | 199 int block_size; 250 block_size = 2; 251 raf.writeShort(block_size & 0xFFFF); 259 block_size += 1 + size; 265 raf.writeShort((block_size) & 0xFFFF); 271 index += 3 + block_size; 272 block_size = roi_size * 4; 273 raf.writeShort(block_size & 0xFFFF); 280 index += 3 + block_size; 281 block_size [all...] |
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_blocks.c | 74 int block_size; local 81 block_size = blocks->elem_size*blocks->population; 82 if ( nbytes > block_size ) { 83 block_size = real_size(blocks->alignment, nbytes); 85 block_header = (BlockHeader*)HPROF_MALLOC(block_size+header_size); 87 block_header->bytes_left = block_size;
|
/openjdk7/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
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | objectStartArray.cpp | 36 assert((int)block_size == (int)CardTableModRefBS::card_size, "Sanity"); 37 assert((int)block_size <= 512, "block_size must be less than or equal to 512"); 85 assert((uintptr_t(low_bound) & (block_size - 1)) == 0, "heap must start at block boundary"); 86 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 | 255 size_t block_size(const HeapWord* addr) const;
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | generation.inline.hpp | 62 size_t OneContigSpaceCardGeneration::block_size(const HeapWord* addr) const { function in class:OneContigSpaceCardGeneration 65 assert(addr == the_space()->top(), "non-block head arg to block_size");
|
H A D | compactingPermGenGen.hpp | 199 inline size_t block_size(const HeapWord* addr) const { function in class:CompactingPermGenGen 204 assert(addr == the_space()->top(), "non-block head arg to block_size"); 212 assert(addr == ro_space()->top(), "non-block head arg to block_size"); 220 assert(addr == rw_space()->top(), "non-block head arg to block_size");
|
H A D | generation.hpp | 588 virtual size_t block_size(const HeapWord* addr) const ; 738 inline size_t block_size(const HeapWord* addr) const;
|
H A D | space.cpp | 59 // Use the block_size() method of the space over which 62 // be reflected in the block_size() method. 86 for (; bottom < top; bottom += _sp->block_size(bottom)) { 198 assert(_sp->block_size(top_obj) == (size_t) oop(top_obj)->size(), 447 SCAN_AND_FORWARD(cp, end, block_is_obj, block_size); 486 q += block_size(q); 607 const size_t size = block_size(blk_start_addr); 811 size_t ContiguousSpace::block_size(const HeapWord* p) const { function in class:ContiguousSpace
|
H A D | space.hpp | 268 virtual size_t block_size(const HeapWord* addr) const = 0; 507 #define SCAN_AND_FORWARD(cp,scan_limit,block_is_obj,block_size) { \ 566 size_t size = block_size(q); \ 576 end += block_size(end); \ 938 size_t block_size(const HeapWord* p) const;
|
H A D | genCollectedHeap.cpp | 121 uintx block_size = 64*1024*1024; local 123 char* dummy = os::reserve_memory(block_size); 124 reserved += block_size; 1028 size_t GenCollectedHeap::block_size(const HeapWord* addr) const { function in class:GenCollectedHeap 1029 assert(is_in_reserved(addr), "block_size of address outside of heap"); 1034 return _gens[i]->block_size(addr); 1040 return perm_gen()->block_size(addr);
|
H A D | cardTableRS.cpp | 447 begin = boundary_block + s->block_size(boundary_block); 457 for (HeapWord* cur = start_block; cur < end; cur += s->block_size(cur)) {
|
H A D | genCollectedHeap.hpp | 258 virtual size_t block_size(const HeapWord* addr) const;
|
H A D | blockOffsetTable.cpp | 571 n += _sp->block_size(n); 703 n += _sp->block_size(n);
|
H A D | generation.cpp | 263 size = s->block_size(_p); 269 size_t Generation::block_size(const HeapWord* p) const { function in class:Generation
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1BlockOffsetTable.inline.hpp | 114 n += _sp->block_size(q); 126 HeapWord* n = q + _sp->block_size(q);
|
H A D | g1BlockOffsetTable.cpp | 379 HeapWord* n = q + _sp->block_size(q); 418 n += _sp->block_size(q); 631 HeapWord* n = q + _sp->block_size(q);
|
H A D | g1CollectedHeap.hpp | 1495 virtual size_t block_size(const HeapWord* addr) const;
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | hashtable.cpp | 54 int block_size = MIN2(512, MAX2((int)_table_size / 2, (int)_number_of_entries)); local 55 int len = _entry_size * block_size;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parNew/ |
H A D | parCardTableModRefBS.cpp | 222 byte_for(first_block + sp->block_size(first_block) - 1); 311 const size_t last_block_size = sp->block_size(last_block);
|
/openjdk7/hotspot/src/share/vm/gc_interface/ |
H A D | collectedHeap.hpp | 616 virtual size_t block_size(const HeapWord* addr) const = 0;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | compactibleFreeListSpace.hpp | 388 size_t block_size(const HeapWord* p) const;
|
H A D | compactibleFreeListSpace.cpp | 699 size_t bot_size = _cfls->CompactibleFreeListSpace::block_size(bottom); \ 703 bot_size = _cfls->CompactibleFreeListSpace::block_size(bottom); \ 715 bottom += _cfls->CompactibleFreeListSpace::block_size(bottom); \ 791 curSize = block_size(cur); 828 obj_addr += block_size(obj_addr); 868 curSize = block_size(cur); 892 curSize = block_size(cur); 992 size_t CompactibleFreeListSpace::block_size(const HeapWord* p) const { function in class:CompactibleFreeListSpace 2121 SCAN_AND_FORWARD(cp,end,block_is_obj,block_size);
|