Searched defs:size (Results 551 - 575 of 1126) sorted by relevance

<<21222324252627282930>>

/openjdk7/hotspot/src/share/vm/code/
H A Dstubs.hpp63 // | code | | size
75 void initialize(int size, argument
76 CodeStrings& strings) { ShouldNotCallThis(); } // called to initialize/specify the stub's size
80 int size() const { ShouldNotCallThis(); return 0; } // must return the size provided by initialize function in class:VALUE_OBJ_CLASS_SPEC
81 static int code_size_to_size(int code_size) { ShouldNotCallThis(); return 0; } // computes the size given the code size
109 virtual void initialize(Stub* self, int size,
114 virtual int size(Stub* self) const = 0; // the total size o
178 stub_initialize(Stub* s, int size, CodeStrings& strings) argument
[all...]
H A DvtableStubs.cpp52 void* VtableStub::operator new(size_t size, int code_size) { argument
53 assert(size == sizeof(VtableStub), "mismatched size");
55 // compute real VtableStub size (rounded to nearest word)
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.hpp48 bool mark_obj(HeapWord* addr, size_t size);
49 inline bool mark_obj(oop obj, int size);
72 // Return the size in words of an object given a begin bit and an end bit, or
77 // Return the size in words of the object (a search is done for the end bit).
142 inline size_t size() const;
161 inline void clear() { clear_range(0, size()); }
266 ParMarkBitMap::size() const function in class:ParMarkBitMap
268 return _beg_bits.size();
340 const idx_t end_bit = _end_bits.get_next_one_offset_inline(beg_bit, size());
342 assert(end_bit < size(), "en
[all...]
H A DpsAdaptiveSizePolicy.hpp78 size_t _survivor_size_limit; // Limit in bytes of survivor size
84 // major pause time vs. old gen size
86 // major pause time vs. young gen size
138 // Change the young generation size to achieve a minor GC pause time goal
223 // generations, the initial survivor space size, the
235 // Methods indicating events of interest to the adaptive size policy,
242 void tenured_allocation(size_t size) { argument
243 _avg_pretenured->sample(size);
279 // Return true if the old generation size was changed
287 // Return true if the young generation size wa
[all...]
H A DpsYoungGen.cpp45 assert(_init_gen_size != 0, "Should have a finite size");
107 size_t size = virtual_space()->reserved_size(); local
113 max_survivor_size = size / MinSurvivorRatio;
115 // round the survivor space size down to the nearest alignment
116 // and make sure its size is greater than 0.
120 // set the maximum size of eden to be the size of the young gen
121 // less two times the minimum survivor size. The minimum survivor
122 // size for UseAdaptiveSizePolicy is one alignment.
123 max_eden_size = size
160 size_t size = virtual_space()->committed_size(); local
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DgcHeapSummary.hpp60 size_t size() const { return (uintptr_t)_end - (uintptr_t)_start; } function in class:SpaceSummary
H A DgcUtil.hpp149 void* operator new(size_t size) { return CHeapObj<mtGC>::operator new(size); } argument
H A DmutableSpace.cpp51 size_t size = pointer_delta(end, start, sizeof(char)); local
54 os::free_memory((char*)start, size, page_size);
56 os::numa_make_global((char*)start, size);
174 HeapWord* MutableSpace::allocate(size_t size) { argument
180 if (pointer_delta(end(), obj) >= size) {
181 HeapWord* new_top = obj + size;
192 HeapWord* MutableSpace::cas_allocate(size_t size) { argument
195 if (pointer_delta(end(), obj) >= size) {
196 HeapWord* new_top = obj + size;
214 bool MutableSpace::cas_deallocate(HeapWord *obj, size_t size) { argument
[all...]
H A DvmGCOperations.hpp161 size_t _size; // size of object to be allocated.
164 VM_GenCollectForAllocation(size_t size, argument
168 _size(size),
199 size_t _size; // size of object to be allocated
201 VM_GenCollectForPermanentAllocation(size_t size, argument
206 _size(size) {
/openjdk7/hotspot/src/share/vm/libadt/
H A Ddict.cpp66 // doubled in size; the total amount of EXTRA times all hash functions are
67 // computed for the doubling is no more than the current size - thus the
68 // doubling in size costs no more than a constant factor in speed.
88 Dict::Dict(CmpKey initcmp, Hash inithash, Arena *arena, int size) argument
102 while( i < size ) i <<= 1;
129 // grow to this size again.
133 // Double hash table size. If can't do so, just suffer. If can, then run
140 _size <<= 1; // Double in size
211 // dictionary is too full, it's size is doubled. The prior value being
217 uint i = hash & (_size-1); // Get hash key, corrected for size
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DbinaryTreeDictionary.hpp74 using FreeList<Chunk>::size;
96 // address and size.
98 static TreeList<Chunk>* as_TreeList(HeapWord* addr, size_t size);
108 // those in the list for this size; potentially slow and expensive,
156 size_t size() const volatile { return Chunk::size(); } function in class:TreeChunk
190 // Remove a chunk of size "size" or larger from the tree and
192 // is the last chunk of that size, remove the node for that size
253 get_chunk(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither) argument
[all...]
H A DcollectorPolicy.cpp72 // Don't increase Perm size limit above specified.
125 vm_exit_during_initialization("Too small initial heap for new size specified");
219 // byte entry and the os page size is 4096, the maximum heap size should
245 // Adjust max size parameters
258 vm_exit_during_initialization("Too small new size specified");
289 // such as the use of NewRatio are used to size the generation.
298 // Determine maximum size of gen0
310 "new generation size of " SIZE_FORMAT "k will be used.",
332 // Bound the maximum size b
538 mem_allocate_work(size_t size, bool is_tlab, bool* gc_overhead_limit_was_exceeded) argument
666 expand_heap_and_allocate(size_t size, bool is_tlab) argument
680 satisfy_failed_allocation(size_t size, bool is_tlab) argument
[all...]
H A Dfilemap.cpp116 // Jar file - record timestamp and file size.
219 void FileMapInfo::write_region(int region, char* base, size_t size, argument
228 " file offset 0x%x", region, size, base, _file_offset);
234 si->_used = size;
238 write_bytes_aligned(base, (int)size);
330 size_t size = align_size_up(used, os::vm_allocation_granularity()); local
335 si->_base, size, false /* !read_only */,
356 size_t size = align_size_up(used, os::vm_allocation_granularity()); local
358 ReservedSpace mapped_rs = rs.first_part(size, true, true);
359 ReservedSpace unmapped_rs = rs.last_part(size);
377 size_t size = align_size_up(used, os::vm_allocation_granularity()); local
406 size_t size = align_size_up(used, os::vm_allocation_granularity()); local
[all...]
H A DfreeList.hpp57 size_t _hint; // next larger size list with a positive surplus
112 assert(!_head || _head->size() == _size, "bad chunk size");
133 assert(!_tail || _tail->size() == _size, "bad chunk size");
148 size_t size() const { function in class:VALUE_OBJ_CLASS_SPEC
313 // Prepend "fl" (whose size is required to be the same as that of "this")
H A Dheap.cpp75 static size_t align_to_page_size(size_t size) {
78 return (size + alignment - 1) & ~(alignment - 1);
82 static size_t align_to_allocation_size(size_t size) {
85 return (size + alignment - 1) & ~(alignment - 1);
89 void CodeHeap::on_code_mapping(char* base, size_t size) {
91 extern void linux_wrap_code(char* base, size_t size);
92 linux_wrap_code(base, size);
100 assert(segment_size >= sizeof(FreeBlock), "segment size is too small");
119 rs.base(), rs.size());
151 bool CodeHeap::expand_by(size_t size) {
175 shrink_by(size_t size) argument
186 allocate(size_t size) argument
[all...]
H A Dheap.hpp97 size_t number_of_segments(size_t size) const { return (size + _segment_size - 1) >> _log2_segment_size; }
98 size_t size(size_t number_of_segments) const { return number_of_segments << _log2_segment_size; } function in class:CodeHeap
122 void on_code_mapping(char* base, size_t size);
130 bool expand_by(size_t size); // expands commited memory by size
131 void shrink_by(size_t size); // shrinks commited memory by size
135 void* allocate (size_t size); // allocates a block of size o
[all...]
H A DoopFactory.cpp103 int size = objArrayOopDesc::object_size(length); local
106 Universe::heap()->permanent_array_allocate(klass, size, length, CHECK_NULL);
H A DtenuredGeneration.cpp104 // Don't shrink less than the initial generation size
179 // Capacity too large, compute shrinking size
186 // size without shrinking, it goes back to 0%.
188 assert(shrink_bytes <= max_shrink_bytes, "invalid shrink size");
222 assert(shrink_bytes <= max_shrink_bytes, "invalid shrink size");
261 size_t size,
275 if (!result && should_allocate(size, is_tlab)) {
280 size);
307 size_t size,
311 size, is_tla
260 should_collect(bool full, size_t size, bool is_tlab) argument
305 collect(bool full, bool clear_all_soft_refs, size_t size, bool is_tlab) argument
[all...]
/openjdk7/hotspot/src/share/vm/oops/
H A DconstMethodKlass.cpp42 // Make sure size calculation is right
43 assert(k()->size() == align_object_size(header_size()),
44 "wrong size for object");
73 int size = constMethodOopDesc::object_size(byte_code_size, local
80 CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL);
88 cm->set_constMethod_size(size);
93 assert(cm->size() == size, "wrong size for object");
126 // Get size befor
128 int size = cm->object_size(); local
143 int size = cm->object_size(); local
157 int size = cm->object_size(); local
[all...]
H A DconstantPoolKlass.cpp59 int size = constantPoolOopDesc::object_size(length); local
65 (constantPoolOop)CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL);
85 // size be correct, consistent and henceforth stable, at this stage.
86 assert(pool->is_oop() && pool->is_parsable(), "Else size() below is unreliable");
87 assert(size == pool->size(), "size() is wrong");
97 // Check that our size was stable at its old value.
98 assert(size == pool->size(), "siz
176 int size = cp->object_size(); local
206 int size = cp->object_size(); local
234 int size = cp->object_size(); local
[all...]
H A DinstanceRefKlass.cpp233 int size = size_helper(); local
241 return size;
257 return size; \
296 return size; \
302 // all closures. Macros calling macros above for each oop size.
308 /* Get size before changing pointers */ \
311 int size = instanceKlass::oop_oop_iterate##nv_suffix(obj, closure); \
325 /* Get size before changing pointers */ \
328 int size = instanceKlass::oop_oop_iterate_backwards##nv_suffix(obj, closure); \
347 int size
[all...]
H A DklassVtable.hpp161 // size in words
162 static int size() { function in class:VALUE_OBJ_CLASS_SPEC
214 // Static size and offset accessors
215 static int size() { return sizeof(itableOffsetEntry) / HeapWordSize; } // size in words function in class:VALUE_OBJ_CLASS_SPEC
234 // Static size and offset accessors
235 static int size() { return sizeof(itableMethodEntry) / HeapWordSize; } // size in words function in class:VALUE_OBJ_CLASS_SPEC
263 int _size_offset_table; // size of offset table (in itableOffset entries)
264 int _size_method_table; // size o
[all...]
/openjdk7/jdk/src/share/classes/com/sun/java/swing/plaf/windows/
H A DWindowsInternalFrameTitlePane.java288 // Set drawing scale to make icon scale to our desired size
487 // We can use an arbitrary size here because we scale to it in paintIcon()
510 * @return the <code>Icon</code> closest to the requested size
512 protected Icon getBestIcon(int size) { argument
520 int diff = Math.abs(iconSize - size);
537 int size = getIconWidth();
539 Icon icon = getBestIcon((int)(size * scale));
542 // Set drawing scale to make icon act true to our reported size
543 double drawScale = size / (double)iconSize;
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DPropMap.java104 // The segment size is unlimited
180 List<Object> res = new ArrayList<>(values.size());
253 public int size() { method in class:PropMap
254 return theMap.size();
/openjdk7/jdk/src/share/classes/com/sun/jdi/request/
H A DEventRequestManager.java220 * A <code>size</code>value of {@link com.sun.jdi.request.StepRequest#STEP_MIN} will generate a
222 * smallest step size available and often maps to the instruction
224 * A <code>size</code> value of {@link com.sun.jdi.request.StepRequest#STEP_LINE} will generate a
256 * @param size the step size
260 * @throws IllegalArgumentException if the size or depth arguments
264 int size,
263 createStepRequest(ThreadReference thread, int size, int depth) argument

Completed in 65 milliseconds

<<21222324252627282930>>