/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | CopyOnWriteArrayList.java | 142 public int size() { method in class:CopyOnWriteArrayList 152 return size() == 0; 269 * than or equal to the current size of this list 317 * the size of this list. 550 * ({@code{fromIndex < 0 || toIndex > size() || toIndex < fromIndex}) 1112 private int size; field in class:CopyOnWriteArrayList.COWSubList 1121 size = toIndex - fromIndex; 1132 if (index<0 || index>=size) 1134 ",Size: "+size); 1163 public int size() { method in class:CopyOnWriteArrayList.COWSubList 1271 private final int size; field in class:CopyOnWriteArrayList.COWSubListIterator 1273 COWSubListIterator(List<E> l, int index, int offset, int size) argument [all...] |
H A D | LinkedBlockingDeque.java | 707 * less the current {@code size} of this deque. 801 public int size() { method in class:LinkedBlockingDeque 907 * runtime type of the specified array and the size of this deque.
|
/openjdk7/jdk/src/share/classes/java/util/zip/ |
H A D | ZipFile.java | 365 // MORE: Compute good size for inflater stream: 366 long size = getEntrySize(jzentry) + 2; // Inflater likes a bit of slack 367 if (size > 65536) size = 8192; 368 if (size <= 0) size = 4096; 371 new ZipFileInflaterInputStream(in, inf, (int)size); 388 int size) { 389 super(zfin, inf, size); 427 long avail = zfin.size() 387 ZipFileInflaterInputStream(ZipFileInputStream zfin, Inflater inf, int size) argument 560 public int size() { method in class:ZipFile 657 protected long size; // uncompressed size of this entry field in class:ZipFile.ZipFileInputStream 716 public long size() { method in class:ZipFile.ZipFileInputStream [all...] |
/openjdk7/jdk/src/share/classes/javax/naming/ |
H A D | NameImpl.java | 453 int size = components.size(); 455 for (int i = 0; i < size; i++) { 458 stringifyComp((String) components.elementAt(size - 1 - i)); 468 if (compsAllEmpty && (size >= 1) && (syntaxSeparator != null)) 476 if (target.size() == this.size()) { 514 int len1 = size(); 515 int len2 = obj.size(); 542 public int size() { method in class:NameImpl [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | compactibleFreeListSpace.hpp | 59 size_t _allocation_size_limit; // largest size that will be allocated 103 SmallForLinearAlloc = 16, // size < this then use _sLAB 104 SmallForDictionary = 257, // size < this then use _indexedFreeList 133 FreeBlockDictionary<FreeChunk>* _dictionary; // ptr to dictionary for large size blocks 136 // indexed array for small size blocks 152 HeapWord* forward(oop q, size_t size, CompactPoint* cp, HeapWord* compact_top); 166 // Attempt to obtain up to "n" blocks of the size "word_sz" (which is 171 // list of size "word_sz", and must now be decremented. 179 HeapWord* allocate_adaptive_freelists(size_t size); 183 HeapWord* allocate_non_adaptive_freelists(size_t size); 272 freed(HeapWord* start, size_t size) argument 465 adjustObjectSize(size_t size) argument [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1BlockOffsetTable.cpp | 40 size_t size = compute_size(reserved.word_size()); local 41 ReservedSpace rs(ReservedSpace::allocation_align_size_up(size)); 57 " rs.size(): " INTPTR_FORMAT 59 rs.base(), rs.size(), rs.base() + rs.size()); 406 n += obj->size(); 458 // Note that the committed size of the covered space may have changed, 459 // so the table size might also wish to change. 586 "obj: "PTR_FORMAT" word size: "SIZE_FORMAT" "
|
H A D | sparsePRT.hpp | 58 // Returns the size of the entry, used for entry allocation. 59 static size_t size() { return sizeof(SparsePRTEntry) + sizeof(CardIdx_t) * (cards_num() - 1); } function in class:SparsePRTEntry 60 // Returns the size of the card array. 171 SparsePRTEntry* entry(int i) const { return (SparsePRTEntry*)((char*)_entries + SparsePRTEntry::size() * i); }
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psOldGen.cpp | 153 // reserved size is not 0. 183 // Allocation. We report all successful allocations to the size policy 229 // providing a page per lgroup. Alignment is larger or equal to the page size. 317 size_t size = align_size_down(bytes, virtual_space()->alignment()); local 318 if (size > 0) { 345 assert(gen_size_limit() >= reserved().byte_size(), "max new size problem?"); 351 gclog_or_tty->print_cr("AdaptiveSizePolicy::old generation size: " 353 " new size: " SIZE_FORMAT " current size " SIZE_FORMAT 376 gclog_or_tty->print_cr("AdaptiveSizePolicy::old generation size [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/ |
H A D | markSweep.cpp | 79 gclog_or_tty->print_cr("Revisit klass stack size = " SIZE_FORMAT, 80 _revisit_klass_stack.size()); 101 gclog_or_tty->print_cr("Revisit MDO stack size = " SIZE_FORMAT, 102 _revisit_mdo_stack.size()); 164 assert( _preserved_oop_stack.size() == _preserved_mark_stack.size(), 181 assert(_preserved_oop_stack.size() == _preserved_mark_stack.size(), 185 _preserved_count + _preserved_oop_stack.size()); 262 void MarkSweep::register_live_oop(oop p, size_t size) { argument 270 validate_live_oop(oop p, size_t size) argument 279 live_oop_moved_to(HeapWord* q, size_t size, HeapWord* compaction_top) argument 284 MarkSweep::validate_live_oop(oop(q), size); local [all...] |
/openjdk7/hotspot/src/share/vm/interpreter/ |
H A D | bytecodeTracer.cpp | 229 size_t size = cache->size() * HeapWordSize; local 230 size -= sizeof(constantPoolCacheOopDesc); 231 size /= sizeof(ConstantPoolCacheEntry); 232 climit = (int) size; 379 // zero size (for some reason) and we want to print stuff out for them.
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | blockOffsetTable.cpp | 43 size_t size = compute_size(reserved.word_size()); local 44 ReservedSpace rs(size); 60 " rs.size(): " INTPTR_FORMAT 62 rs.base(), rs.size(), rs.base() + rs.size()); 394 // blk_size is the size of the original block 395 // left_blk_size is the size of the first part of the split 626 // that the block [blk_start, blk_end) or [blk, blk + size) is a 637 HeapWord* blk, size_t size) { 638 verify_single_block(blk, blk + size); 636 verify_single_block( HeapWord* blk, size_t size) argument [all...] |
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | constMethodOop.hpp | 35 // applications load thousands of methods, so keeping the size of this 244 // Object size needed 251 void set_constMethod_size(int size) { _constMethod_size = size; } argument 255 // code size 257 void set_code_size(int size) { argument 259 "u2 is too small to hold method code size in general"); 260 assert(0 <= size && size <= max_method_code_size, "invalid code size"); [all...] |
H A D | instanceKlassKlass.cpp | 58 // Make sure size calculation is right 59 assert(k()->size() == align_object_size(header_size()), "wrong size for object"); 169 // Get size before changing pointers. 170 // Don't call size() or oop_size() since that is a virtual call. 171 int size = ik->object_size(); local 202 return size; 210 // Get size before changing pointers. 211 // Don't call size() or oop_size() since that is a virtual call. 212 int size local 365 int size = align_object_offset(vtable_len) + align_object_offset(itable_len); local [all...] |
H A D | objArrayKlass.cpp | 64 int size = objArrayOopDesc::object_size(length); local 66 objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL); 70 report_java_out_of_memory("Requested array size exceeds VM limit"); 375 /* Get size before changing pointers. */ \ 376 /* Don't call size() or oop_size() since that is a virtual call. */ \ 377 int size = a->object_size(); \ 382 return size; \ 393 /* Get size before changing pointers. */ \ 394 /* Don't call size() or oop_size() since that is a virtual call */ \ 395 int size 452 int size = a->object_size(); local [all...] |
H A D | typeArrayKlass.cpp | 70 assert(k()->size() > header_size(), "bad size"); 83 size_t size = typeArrayOopDesc::object_size(layout_helper(), length); local 88 t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL); 90 t = (typeArrayOop)CollectedHeap::array_allocate_nozero(h_k, (int)size, length, CHECK_NULL); 95 report_java_out_of_memory("Requested array size exceeds VM limit"); 106 int size = typeArrayOopDesc::object_size(layout_helper(), length); local 109 CollectedHeap::permanent_array_allocate(h_k, size, length, CHECK_NULL);
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | bytecodeInfo.cpp | 114 int size = callee_method->code_size_for_inlining(); local 118 size < InlineThrowMaxSize ) { 130 return true; // size and frequency are represented in a new way 143 // bump the max size if the call is frequent 149 if (size <= max_inline_size && TraceFrequencyInlining) { 164 if (size > max_inline_size) { 217 // %%% adjust wci_result->size()? 311 // Old algorithm had funny accumulating BC-size counters 315 set_msg("size > DesiredMethodLimit"); 398 int size local [all...] |
H A D | callGenerator.hpp | 212 // Small size favors inlining, since small methods are more likely to 213 // inline smoothly. The size is estimated by examining the native code 238 // size in a clique of mutually inlinable methods. 277 float size() const { return _size; } function in class:WarmCallInfo
|
H A D | matcher.hpp | 222 // _old_SP + out_preserve_stack_slots + incoming argument size. 255 // Limits on vector size (number of elements). 258 static const bool vector_size_supported(const BasicType bt, int size) { argument 259 return (Matcher::max_vector_size(bt) >= size && 260 Matcher::min_vector_size(bt) <= size); 287 // The size of stack slots is defined by VMRegImpl::stack_slot_size. 368 // Threshold small size (in bytes) for a ClearArray/CopyArray node. 369 // Anything this size or smaller may get converted to discrete scalar stores.
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | Fixups.java | 49 int size; // number of relocations field in class:Fixups 50 Entry[] entries; // [0..size-1] relocations 82 public int size() { method in class:Fixups 83 return size; 87 if (size != entries.length) { 89 entries = new Entry[size]; 90 System.arraycopy(oldEntries, 0, entries, 0, size); 103 for (int i = 0; i < size; i++) { 117 size = 0; 120 // do not trim to size, howeve [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/internal/ |
H A D | ArrayNotificationBuffer.java | 77 notification buffer size, and this size is recorded by the 78 corresponding ShareBuffer. The buffer size of the 81 size is adjusted accordingly. 100 to the array of notifications, including its size, and to the 128 //Find out queue size 208 while (queue.size() > newSize) 215 ShareBuffer(int size) { argument 216 this.size = size; 239 private final int size; field in class:ArrayNotificationBuffer.ShareBuffer [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/ |
H A D | SnmpMib.java | 62 private int size; field in class:LongList 80 size = 0; 86 * Same behaviour than size() in {@link java.util.List}. 88 public final int size() { return size;} method in class:LongList 96 if (size >= list.length) 98 list[size++]=o; 109 if (index > size) throw new IndexOutOfBoundsException(); 111 if (index == size) { 112 list[size [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/daemon/ |
H A D | SnmpRequestHandler.java | 112 subs= new Hashtable<SnmpMibAgent, SnmpSubRequestHandler>(mibs.size()); 395 if (mibs.size() < 1) { 550 int nbSubRequest= subs.size(); 583 int nbSubRequest= subs.size(); 1000 int nbAgents= mibs.size(); 1118 private SnmpVarBind[] mergeBulkResponses(int size) { argument 1121 SnmpVarBind[] result= new SnmpVarBind[size]; 1122 for(int i= size-1; i >=0; --i) {
|
/openjdk7/jdk/src/share/classes/com/sun/jndi/dns/ |
H A D | ResourceRecord.java | 89 int msgLen; // msg size (in octets) 146 public int size() { method in class:ResourceRecord 489 * Returns the size of the encoded string, including the initial 509 return (len + 1); // size includes initial octet
|
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/ |
H A D | LdapName.java | 129 for (int i = rdns.size() - 1; i >= 0; i--) { 130 if (i < rdns.size() - 1) { 155 int minSize = Math.min(rdns.size(), that.rdns.size()); 166 return (rdns.size() - that.rdns.size()); // longer DN wins 174 for (int i = 0; i < rdns.size(); i++) { 181 public int size() { method in class:LdapName 182 return rdns.size(); 211 return new LdapName(null, rdns, pos, rdns.size()); [all...] |
/openjdk7/jdk/src/share/classes/com/sun/media/sound/ |
H A D | SoftReverb.java | 80 AllPass(int size) { argument 81 delaybuffer = new float[size]; 82 delaybuffersize = size; 130 Comb(int size) { argument 131 delaybuffer = new float[size]; 132 delaybuffersize = size; 406 // Small Room A small size room with a length 415 // Medium Room A medium size room with a length 424 // Large Room A large size room suitable for 433 // Medium Hall A medium size concer [all...] |