/openjdk7/jdk/src/windows/classes/java/lang/ |
H A D | ProcessEnvironment.java | 261 private ProcessEnvironment(int capacity) { argument 262 super(capacity); 289 static Map<String,String> emptyEnvironment(int capacity) { argument 290 return new ProcessEnvironment(capacity);
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | BaseFileManager.java | 215 if (dest.limit() == dest.capacity()) { 216 dest = CharBuffer.allocate(dest.capacity()+1).put(dest); 222 10 + dest.capacity() + 245 dest.limit(dest.capacity()); 306 ByteBuffer get(int capacity) { argument 307 if (capacity < 20480) capacity = 20480; 309 (cached != null && cached.capacity() >= capacity) 311 : ByteBuffer.allocate(capacity [all...] |
/openjdk7/jdk/src/share/native/com/sun/media/sound/ |
H A D | PlatformMidi.h | 95 INT32 capacity; member in struct:tag_MidiQueue 130 MidiMessageQueue* MIDI_CreateQueue(int capacity);
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | SunLayoutEngine.cpp | 113 jint capacity = env->GetArrayLength(glyphArray); local 114 if (count + glyphCount > capacity) {
|
/openjdk7/jdk/test/java/util/zip/ |
H A D | FlaterCriticalArray.java | 56 private static byte[] grow(byte[] a, int capacity) { argument 57 while (a.length < capacity) {
|
/openjdk7/jdk/test/javax/crypto/Cipher/ |
H A D | ByteBuffersNull.java | 72 ByteBuffer getByteBuffer(int capacity, int position, argument 74 ByteBuffer bb = ByteBuffer.allocate(capacity); 89 // ByteBuffer with capacity 0 90 buffers[0]= new BufferDescr("ByteBuffer with capacity == 0", 95 "ByteBuffer with some capacity but limit == 0", 98 // ByteBuffer with some remaining data (limit = capacity)
|
/openjdk7/jdk/src/share/classes/sun/font/ |
H A D | GlyphLayout.java | 513 private void init(int capacity) { argument 516 this._gvdata.init(capacity);
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Hashtable.java | 38 * performance: <i>initial capacity</i> and <i>load factor</i>. The 39 * <i>capacity</i> is the number of <i>buckets</i> in the hash table, and the 40 * <i>initial capacity</i> is simply the capacity at the time the hash table 44 * table is allowed to get before its capacity is automatically increased. 45 * The initial capacity and load factor parameters are merely hints to 54 * The initial capacity controls a tradeoff between wasted space and the 57 * capacity is greater than the maximum number of entries the 59 * setting the initial capacity too high can waste space.<p> 62 * creating it with a sufficiently large capacity ma 224 initHashSeedAsNeeded(int capacity) argument [all...] |
H A D | IdentityHashMap.java | 139 * The initial capacity used by the no-args constructor. 147 * The minimum capacity, used if a lower value is implicitly specified 155 * The maximum capacity, used if a higher value is implicitly specified 179 * The next size value at which to resize (capacity * load factor). 223 init(capacity(expectedMaxSize)); 227 * Returns the appropriate capacity for the specified expected maximum 234 private int capacity(int expectedMaxSize) { method in class:IdentityHashMap 235 // Compute min capacity for expectedMaxSize given a load factor of 2/3 238 // Compute the appropriate capacity 252 * capacity, whic [all...] |
H A D | Vector.java | 36 * {@code capacity} and a {@code capacityIncrement}. The 37 * {@code capacity} is always at least as large as the vector 41 * capacity of a vector before inserting a large number of 85 * stored. The capacity of the vector is the length of this array buffer, 104 * The amount by which the capacity of the vector is automatically 105 * incremented when its size becomes greater than its capacity. If 106 * the capacity increment is less than or equal to zero, the capacity 117 * Constructs an empty vector with the specified initial capacity and 118 * capacity incremen 301 public synchronized int capacity() { method in class:Vector [all...] |
H A D | HashMap.java | 41 * collection views requires time proportional to the "capacity" of the 44 * capacity too high (or the load factor too low) if iteration performance is 48 * performance: <i>initial capacity</i> and <i>load factor</i>. The 49 * <i>capacity</i> is the number of buckets in the hash table, and the initial 50 * capacity is simply the capacity at the time the hash table is created. The 52 * get before its capacity is automatically increased. When the number of 54 * current capacity, the hash table is <i>rehashed</i> (that is, internal data 63 * into account when setting its initial capacity, so as to minimize the 64 * number of rehash operations. If the initial capacity i 340 initHashSeedAsNeeded(int capacity) argument 1190 int capacity() { return table.length; } method in class:HashMap [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | LinkedBlockingDeque.java | 49 * <p> The optional capacity bound constructor argument serves as a 50 * way to prevent excessive expansion. The capacity, if unspecified, 53 * deque above capacity. 152 private final int capacity; field in class:LinkedBlockingDeque 164 * Creates a {@code LinkedBlockingDeque} with a capacity of 172 * Creates a {@code LinkedBlockingDeque} with the given (fixed) capacity. 174 * @param capacity the capacity of this deque 175 * @throws IllegalArgumentException if {@code capacity} is less than 1 177 public LinkedBlockingDeque(int capacity) { argument [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | concurrentMarkSweepGeneration.inline.hpp | 298 return _young_gen->as_DefNewGeneration()->eden()->capacity(); 420 inline size_t ConcurrentMarkSweepGeneration::capacity() const { function in class:ConcurrentMarkSweepGeneration 421 return _cmsSpace->capacity();
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | sparsePRT.cpp | 148 RSHashTable::RSHashTable(size_t capacity) : argument 149 _capacity(capacity), _capacity_mask(capacity-1), 151 _entries((SparsePRTEntry*)NEW_C_HEAP_ARRAY(char, SparsePRTEntry::size() * capacity, mtGC)), 152 _buckets(NEW_C_HEAP_ARRAY(int, capacity, mtGC)), 255 assert(occupied_entries() < capacity(), "Precondition"); 277 assert(0 <= new_ind && (size_t)new_ind < capacity(), "There should be room."); 295 } else if ((size_t) _free_region+1 < capacity()) { 357 while ((size_t)_tbl_ind < _rsht->capacity()) { 378 capacity() * (SparsePRTEntr [all...] |
H A D | sparsePRT.hpp | 142 RSHashTable(size_t capacity); 150 // entries to a larger-capacity representation. 165 size_t capacity() const { return _capacity; } function in class:RSHashTable 261 // entries to a larger-capacity representation. 277 // Clear the table, and reinitialize to initial capacity.
|
/openjdk7/jdk/src/solaris/classes/java/lang/ |
H A D | ProcessEnvironment.java | 100 static Map<String,String> emptyEnvironment(int capacity) { argument 101 return new StringEnvironment(new HashMap<Variable,Value>(capacity));
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | parallelScavengeHeap.cpp | 286 size_t ParallelScavengeHeap::capacity() const { function in class:ParallelScavengeHeap 317 return MAX2(estimated, capacity()); 980 prev_used, used(), capacity()); 985 prev_used / K, used() / K, capacity() / K);
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | defNewGeneration.cpp | 361 size_t old_size = next_gen->capacity(); 413 size_t eden_size_after = eden()->capacity(); 414 size_t survivor_size_after = from()->capacity(); 439 size_t DefNewGeneration::capacity() const { function in class:DefNewGeneration 440 return eden()->capacity() 441 + from()->capacity(); // to() is only used during scavenge 467 return eden()->capacity(); 637 age_table()->compute_tenuring_threshold(to()->capacity()/HeapWordSize); 1052 return eden()->capacity();
|
H A D | generation.cpp | 78 prev_used, used(), capacity()); 83 prev_used / K, used() / K, capacity() / K); 103 capacity()/K, used()/K); 424 // the most that the generation can expand since it has some capacity to 539 size_t OneContigSpaceCardGeneration::capacity() const { function in class:OneContigSpaceCardGeneration 540 return _the_space->capacity(); 588 // update the space and generation capacity counters 620 size_t new_word_size = heap_word_size(_the_space->capacity());
|
H A D | space.hpp | 205 size_t capacity() const { return byte_size(bottom(), end()); } function in class:Space 542 allowed_deadspace = (capacity() * ratio / 100) / HeapWordSize; \ 848 size_t capacity() const { return byte_size(bottom(), end()); } function in class:ContiguousSpace
|
H A D | genCollectedHeap.cpp | 245 size_t capacity = align_size_up(mapinfo->space_capacity(lr), alignment); local 246 heap_address = mapinfo->region_base(lr) + capacity; 305 policy->initialize_size_policy(def_new_gen->eden()->capacity(), 306 old_gen->capacity(), 307 def_new_gen->from()->capacity()); 318 size_t GenCollectedHeap::capacity() const { function in class:GenCollectedHeap 321 res += _gens[i]->capacity(); 1288 prev_used, used(), capacity()); 1293 prev_used / K, used() / K, capacity() / K);
|
/openjdk7/hotspot/src/share/vm/asm/ |
H A D | codeBuffer.hpp | 152 csize_t capacity() const { return (csize_t)(_limit - _start); } function in class:VALUE_OBJ_CLASS_SPEC 483 // capacity in bytes of the insts sections 484 csize_t insts_capacity() const { return _insts.capacity(); }
|
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | classLoader.cpp | 1196 size_t capacity = Universe::heap()->permanent_capacity(); local 1197 tty->print_cr("Permanent generation used %dK of %dK", used/K, capacity/K); 1198 tty->print_cr("Increase size by setting e.g. -XX:MaxPermSize=%dK\n", capacity*2/K);
|
/openjdk7/jdk/src/share/back/ |
H A D | util.c | 1546 createLocalRefSpace(JNIEnv *env, jint capacity) argument 1558 if (JNI_FUNC_PTR(env,PushLocalFrame)(env, capacity) < 0) {
|
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_util.c | 604 pushLocalFrame(JNIEnv *env, jint capacity) argument 610 ret = JNI_FUNC_PTR(env,PushLocalFrame)(env, capacity);
|