Searched defs:size (Results 401 - 425 of 1126) sorted by relevance

<<11121314151617181920>>

/openjdk7/jdk/src/share/classes/javax/management/openmbean/
H A DTabularDataSupport.java147 this.indexNamesArray = tmpNames.toArray(new String[tmpNames.size()]);
448 if ( (t == null) || (t.size() == 0) ) {
457 t.values().toArray(new CompositeData[t.size()]);
548 public int size() { method in class:TabularDataSupport
550 return dataMap.size();
560 return (this.size() == 0);
722 // . same size
726 if (this.size() != other.size()) {
829 // key[] should have the size expecte
[all...]
/openjdk7/jdk/src/share/classes/javax/naming/
H A DCompositeName.java343 public int size() { method in class:CompositeName
344 return (impl.size());
375 * Must be in the range [0,size()).
390 * Must be in the range [0,size()].
407 * Must be in the range [0,size()].
409 * the range [posn,size()). If posn is equal to
410 * size(), an empty composite name is returned.
422 * getPrefix(n.size())--in other words, this composite name
431 return (impl.startsWith(n.size(), n.getAll()));
440 * getSuffix(size()
[all...]
H A DCompoundName.java323 public int size() { method in class:CompoundName
324 return (impl.size());
354 * Must be in the range [0,size()).
372 * Must be in the range [0,size()].
391 * Must be in the range [0,size()].
393 * the range [posn,size()). If posn is equal to
394 * size(), an empty compound name is returned.
406 * getPrefix(n.size())--in other words, this compound name
418 return (impl.startsWith(n.size(), n.getAll()));
427 * getSuffix(size()
[all...]
/openjdk7/jdk/src/share/classes/javax/naming/directory/
H A DBasicAttributes.java156 public int size() { method in class:BasicAttributes
157 return attrs.size();
200 if (attrs.size() == 0) {
234 if (size() == target.size()) {
288 s.writeInt(attrs.size());
304 : new Hashtable(2); // can't have initial size of 0 (grrr...)
/openjdk7/jdk/src/share/classes/javax/naming/ldap/
H A DLdapName.java147 this.rdns = new ArrayList(rdns.size());
148 for (int i = 0; i < rdns.size(); i++) {
178 public int size() { method in class:LdapName
179 return rdns.size();
219 * Must be in the range [0,size()).
231 * Must be in the range [0,size()).
246 * Must be in the range [0,size()].
258 "Posn: " + posn + ", Size: "+ rdns.size());
269 * Must be in the range [0,size()].
271 * components at indexes in the range [posn,size())
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A DclassFileStream.hpp78 void guarantee_more(int size, TRAPS) { argument
80 unsigned int usize = (unsigned int)size;
H A DstackMapTable.hpp143 int32_t size, int32_t max_size, TRAPS) {
144 if (size < 0 || size > max_size) {
150 "StackMapTable format error: bad type array size");
171 // There's no stackmap table present. Frame count and size are 0.
182 StackMapStream::stackmap_format_error("wrong attribute size", CHECK);
142 check_verification_type_array_size( int32_t size, int32_t max_size, TRAPS) argument
/openjdk7/hotspot/src/share/vm/code/
H A Dstubs.cpp42 // ^0 ^begin ^end ^size = limit
49 // ^0 ^end ^begin ^limit ^size
67 intptr_t size = round_to(buffer_size, 2*BytesPerWord); local
68 BufferBlob* blob = BufferBlob::create(name, size);
70 vm_exit_out_of_memory(size, err_msg("CodeCache: no room for %s", name));
118 // ^0 ^begin ^end ^size = limit
138 // ^0 ^end ^begin ^limit ^size
154 assert(committed_size <= stub_size(s), "committed size must not exceed requested size");
234 guarantee(0 <= _buffer_size, "buffer size mus
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp52 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
64 rs.base(), rs.size());
97 ParMarkBitMap::mark_obj(HeapWord* addr, size_t size) argument
101 const idx_t end_bit = addr_to_bit(addr + size - 1);
105 DEBUG_ONLY(Atomic::add_ptr(size, &mark_bitmap_size));
177 const size_t size = obj_size(cur_beg, cur_end);
178 IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
213 const size_t size = obj_size(range_beg, dead_space_end); local
214 dead_closure->do_addr(bit_to_addr(range_beg), size); local
225 const size_t size local
238 const size_t size = obj_size(dead_space_beg, dead_space_end); local
239 dead_closure->do_addr(bit_to_addr(dead_space_beg), size); local
[all...]
H A DpsMarkSweepDecorator.cpp134 size_t size = oop(q)->size(); local
141 while(size > compaction_max_size) {
175 VALIDATE_MARK_SWEEP_ONLY(MarkSweep::register_live_oop(oop(q), size));
176 compact_top += size;
180 q += size;
188 end += oop(end)->size();
289 assert((int) deadlength == oop(q)->size(), "bad filler object size");
317 size_t size local
341 size_t size = oop(q)->adjust_pointers(); local
375 size_t size = oop(q)->size(); local
405 size_t size = oop(q)->size(); local
[all...]
H A DpsPromotionLAB.hpp97 HeapWord* allocate(size_t size) { argument
101 HeapWord* new_top = obj + size;
102 // The 'new_top>obj' check is needed to detect overflow of obj+size.
129 HeapWord* allocate(size_t size) { argument
134 HeapWord* new_top = obj + size;
135 // The 'new_top>obj' check is needed to detect overflow of obj+size.
/openjdk7/hotspot/src/share/vm/gc_interface/
H A DcollectedHeap.inline.hpp124 HeapWord* CollectedHeap::common_mem_allocate_noinit(KlassHandle klass, size_t size, TRAPS) { argument
137 result = allocate_from_tlab(klass, THREAD, size);
145 result = Universe::heap()->mem_allocate(size,
149 check_for_non_bad_heap_word_value(result, size));
152 THREAD->incr_allocated_bytes(size * HeapWordSize);
154 AllocTracer::send_allocation_outside_tlab_event(klass, size * HeapWordSize);
185 HeapWord* CollectedHeap::common_mem_allocate_init(KlassHandle klass, size_t size, TRAPS) { argument
186 HeapWord* obj = common_mem_allocate_noinit(klass, size, CHECK_NULL);
187 init_obj(obj, size);
192 HeapWord* CollectedHeap::common_permanent_mem_allocate_noinit(size_t size, TRAP argument
228 common_permanent_mem_allocate_init(size_t size, TRAPS) argument
234 allocate_from_tlab(KlassHandle klass, Thread* thread, size_t size) argument
245 init_obj(HeapWord* obj, size_t size) argument
253 obj_allocate(KlassHandle klass, int size, TRAPS) argument
263 array_allocate(KlassHandle klass, int size, int length, TRAPS) argument
276 array_allocate_nozero(KlassHandle klass, int size, int length, TRAPS) argument
293 permanent_obj_allocate(KlassHandle klass, int size, TRAPS) argument
301 permanent_obj_allocate_no_klass_install(KlassHandle klass, int size, TRAPS) argument
316 permanent_array_allocate(KlassHandle klass, int size, int length, TRAPS) argument
[all...]
/openjdk7/hotspot/src/share/vm/interpreter/
H A Dbytecode.cpp55 void Bytecode::assert_index_size(int size, Bytecodes::Code bc, bool is_wide) { argument
62 switch (size) {
69 tty->print_cr("assert_index_size %d: bc=%d%s %d != %d", size, bc, (is_wide?"/wide":""), have_fmt, need_fmt);
74 void Bytecode::assert_offset_size(int size, Bytecodes::Code bc, bool is_wide) { argument
77 switch (size) {
83 tty->print_cr("assert_offset_size %d: bc=%d%s %d != %d", size, bc, (is_wide?"/wide":""), have_fmt, need_fmt);
88 void Bytecode::assert_constant_size(int size, int where, Bytecodes::Code bc, bool is_wide) { argument
93 switch (size) {
99 if (have_fmt != need_fmt || where + size != length) {
100 tty->print_cr("assert_constant_size %d @%d: bc=%d%s %d != %d", size, wher
[all...]
H A Dinterpreter.hpp48 int _size; // the size in bytes
55 void initialize(int size, argument
56 CodeStrings& strings) { _size = size; DEBUG_ONLY(_strings.assign(strings);) }
60 int size() const { return _size; } function in class:InterpreterCodelet
65 address code_end() const { return (address)this + size(); }
/openjdk7/hotspot/src/share/vm/libadt/
H A Dvectset.hpp33 // These sets can grow or shrink, based on the initial size and the largest
49 uint size; // Size of data IN LONGWORDS (32bits) member in class:VectorSet
102 memset( data, 0, size*sizeof(uint32) );
110 uint word_size() const { return size; }
121 if( word >= size ) // Beyond the last?
136 if( word >= size ) return 0; // Beyond the last?
144 if( word >= size ) { // Beyond the last?
182 int test(void) { return i < s->size; }
/openjdk7/hotspot/src/share/vm/memory/
H A DgenerationSpec.hpp54 void set_init_size(size_t size) { _init_size = size; } argument
56 void set_max_size(size_t size) { _max_size = size; } argument
109 void set_init_size(size_t size) { _init_size = size; } argument
111 // Max size for user DOES NOT include shared spaces.
112 // Max size for space allocation DOES include shared spaces.
H A DmemRegion.hpp102 void* operator new(size_t size, ResourceObj::allocation_type type, MEMFLAGS flags) { argument
103 return ResourceObj::operator new(size, type, flags);
105 void* operator new(size_t size, Arena *arena) { argument
106 return ResourceObj::operator new(size, arena);
108 void* operator new(size_t size) { argument
109 return ResourceObj::operator new(size);
H A Drestore.cpp74 // Assumes that size_t and pointers are the same size.
84 void do_region(u_char* start, size_t size) { argument
86 assert(size % sizeof(oop) == 0, "bad size");
87 do_tag((int)size);
88 while (size > 0) {
91 size -= sizeof(oop);
H A DsharedHeap.hpp330 HeapWord* permanent_mem_allocate(size_t size) { argument
332 return _perm_gen->mem_allocate(size);
/openjdk7/hotspot/src/share/vm/oops/
H A DarrayKlass.cpp41 // size of an array klass object
42 assert(header_size <= instanceKlass::header_size(), "bad header size");
46 int size = header_size + align_object_offset(vtable_length()); local
48 int size = header_size + vtable_length(); local
50 return align_object_size(size);
78 // we must insert filler fields into arrayKlass to make it the same size as instanceKlass.
81 "array klasses must be same size as instanceKlass");
83 // Arrays don't add any new methods, so their vtable is the same size as
107 // Make sure size calculation is right
108 assert(k()->size()
159 int size = objArrayOopDesc::object_size(length); local
[all...]
H A DcpCacheKlass.cpp54 int size = constantPoolCacheOopDesc::object_size(length); local
61 // size(), before setting its klass word further below.
63 // CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL);
65 oop obj = CollectedHeap::permanent_obj_allocate_no_klass_install(klass, size, CHECK_NULL);
68 Universe::heap()->check_for_bad_heap_word_value(((HeapWord*) obj)+hs, size-hs);
78 assert(cache->size() == size, "Incorrect cache->size()");
86 // Make sure size calculation is right
87 assert(k()->size()
126 int size = cache->object_size(); local
142 int size = cache->object_size(); local
158 int size = cache->object_size(); local
[all...]
H A DinstanceMirrorKlass.cpp171 int size = oop_size(obj); local
177 return size;
197 // all closures. Macros calling macros above for each oop size.
203 /* Get size before changing pointers */ \
220 /* Get size before changing pointers */ \
289 int size = instance_size(k); local
291 instanceOop i = (instanceOop) CollectedHeap::Class_obj_allocate(h_k, size, k, CHECK_NULL);
H A DmethodDataKlass.cpp47 // Make sure size calculation is right
48 assert(k()->size() == align_object_size(header_size()),
49 "wrong size for object");
67 int size = methodDataOopDesc::compute_allocation_size_in_words(method); local
70 (methodDataOop)CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL);
76 assert(size == mdo->object_size(), "wrong size for methodDataOop");
116 // Get size before changing pointers
117 // Don't call size() or oop_size() since that is a virtual call.
118 int size local
136 int size = m->object_size(); local
157 int size = m->object_size(); local
[all...]
H A DmethodKlass.cpp46 // Make sure size calculation is right
47 assert(k()->size() == align_object_size(header_size()), "wrong size for object");
67 int size = methodOopDesc::object_size(access_flags.is_native()); local
70 methodOop m = (methodOop)CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL);
76 m->set_method_size(size);
114 assert(m->size() == size, "wrong size for object");
149 // Get size befor
151 int size = m->object_size(); local
167 int size = m->object_size(); local
186 int size = m->object_size(); local
[all...]
H A Dsymbol.hpp115 size_t size = heap_word_size(sizeof(Symbol) + (length > 0 ? length - 1 : 0)); local
116 return align_object_size(size);
125 void* operator new(size_t size, int len, TRAPS);
126 void* operator new(size_t size, int len, Arena* arena, TRAPS);
134 // Returns the largest size symbol we can safely hold.
176 char* as_C_string(char* buf, int size) const;
177 // Use buf if needed buffer length is <= size.
178 char* as_C_string_flexible_buffer(Thread* t, char* buf, int size) const;
183 char* as_utf8_flexible_buffer(Thread* t, char* buf, int size) const {
184 return as_C_string_flexible_buffer(t, buf, size);
[all...]

Completed in 131 milliseconds

<<11121314151617181920>>