/openjdk7/jdk/src/share/classes/sun/rmi/transport/tcp/ |
H A D | TCPChannel.java | 5 * This code is free software; you can redistribute it and/or modify it 166 // loop until we find a free live connection (in which case 171 // try to get a free connection 186 // and nonnull if a free connection of uncertain vitality 197 this.free(conn, false); 201 // none free, so create a new connection 329 public void free(Connection conn, boolean reuse) { method in class:TCPChannel 422 // Close all the connections that were free
|
H A D | TCPTransport.java | 5 * This code is free software; you can redistribute it and/or modify it 213 public void free(Endpoint ep) { method in class:TCPTransport
|
/openjdk7/jdk/src/solaris/classes/sun/nio/ch/ |
H A D | PollArrayWrapper.java | 5 * This code is free software; you can redistribute it and/or modify it 69 void free() { method in class:PollArrayWrapper 70 pollArray.free(); 111 pollArray.free();
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/ |
H A D | Generation.java | 5 * This code is free software; you can redistribute it and/or modify it 155 /** The number of free bytes in the gen. */ 156 public abstract long free(); method in class:Generation 158 /** The largest number of contiguous free words in the generation,
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | codeBlob.cpp | 5 * This code is free software; you can redistribute it and/or modify it 144 // chunk of memory, its your job to free it. 188 _strings.free(); 253 void BufferBlob::free( BufferBlob *blob ) { function in class:BufferBlob 257 CodeCache::free((CodeBlob*)blob);
|
H A D | codeCache.cpp | 5 * This code is free software; you can redistribute it and/or modify it 196 void CodeCache::free(CodeBlob* cb) { function in class:CodeCache 200 print_trace("free", cb);
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | heap.hpp | 5 * This code is free software; you can redistribute it and/or modify it 57 // Used/free 60 bool free() { return !_header._used; } function in class:VALUE_OBJ_CLASS_SPEC
|
H A D | threadLocalAllocBuffer.hpp | 5 * This code is free software; you can redistribute it and/or modify it 47 size_t _refill_waste_limit; // hold onto tlab if free() is larger than this 117 size_t free() const { return pointer_delta(end(), top()); } function in class:ThreadLocalAllocBuffer
|
H A D | allocation.cpp | 5 * This code is free software; you can redistribute it and/or modify it 164 tty->print_cr("Heap free " INTPTR_FORMAT, p); 172 // MT-safe pool of chunks to reduce malloc/free thrashing 217 void free(Chunk* chunk) { function in class:ChunkPool 233 // if we have more than n chunks, free all of them 236 // free chunks at end of queue, for better locality 254 os::free(cur, mtChunk); 333 case Chunk::size: ChunkPool::large_pool()->free(c); break; 334 case Chunk::medium_size: ChunkPool::medium_pool()->free(c); break; 335 case Chunk::init_size: ChunkPool::small_pool()->free( [all...] |
H A D | defNewGeneration.cpp | 5 * This code is free software; you can redistribute it and/or modify it 451 size_t DefNewGeneration::free() const { function in class:DefNewGeneration 452 return eden()->free() 453 + from()->free(); // to() is only used during scavenge 463 return eden()->free(); 471 return eden()->free(); 499 " free: " SIZE_FORMAT, 504 from()->free()); 1003 // Note that since DefNewGeneration supports lock-free allocation, we
|
H A D | generation.cpp | 5 * This code is free software; you can redistribute it and/or modify it 172 // The largest number of contiguous free words in this or any higher generation. 549 size_t OneContigSpaceCardGeneration::free() const { function in class:OneContigSpaceCardGeneration 550 return _the_space->free(); 558 return _the_space->free(); 562 return _the_space->free() + _virtual_space.uncommitted_size();
|
H A D | space.hpp | 5 * This code is free software; you can redistribute it and/or modify it 53 // implementations for keeping track of free and used space, 54 // for iterating over objects and free blocks, etc. 61 // - ContiguousSpace -- a compactible space in which all free space 207 virtual size_t free() const = 0; 391 // free-list-based space whose normal collection is a mark-sweep without 486 // Minimum size of a free block. 497 // free block of the given "word_len", and that "q", were it an object, 498 // would not move if forwared. If the size allows, fill the free 500 // iff the free regio 850 size_t free() const { return byte_size(top(), end()); } function in class:ContiguousSpace [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | indexSet.cpp | 5 * This code is free software; you can redistribute it and/or modify it 120 // Populate the free BitBlock list with a batch of BitBlocks. The BitBlocks 125 BitBlock *free = (BitBlock*)compile->indexSet_free_block_list(); local 133 // Add the new blocks to the free list. 135 new_blocks->set_next(free); 136 free = new_blocks; 140 compile->set_indexSet_free_block_list(free); 151 // Allocate a BitBlock from the free list. If the free list is empty, 185 // Add a BitBlock to the free lis [all...] |
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/c14n/implementations/ |
H A D | NameSpaceSymbTable.java | 321 int free=23; field in class:SymbMap 325 entries=new NameSpaceSymbEntry[free]; 326 keys=new String[free]; 334 if (--free == 0) { 335 free=entries.length; 336 int newCapacity = free<<2;
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | stack.inline.hpp | 5 * This code is free software; you can redistribute it and/or modify it 146 void Stack<E, F>::free(E* addr, size_t bytes) function in class:Stack 184 free(_cur_seg, segment_bytes()); 199 free(seg, bytes); 253 void ResourceStack<E, F>::free(E* addr, size_t bytes) function in class:ResourceStack
|
/openjdk7/jdk/test/java/io/File/ |
H A D | GetXSpace.java | 5 * This code is free software; you can redistribute it and/or modify it 110 private long free; field in class:GetXSpace.Space 112 Space(String total, String free, String name) { argument 115 this.free = Long.valueOf(free) * KSIZE; 125 long free() { return free; } method in class:GetXSpace.Space 127 return ((freeSpace >= (free / 10)) && (freeSpace <= (free * 10))); 130 return String.format("%s (%d/%d)", name, free, tota [all...] |
/openjdk7/jdk/src/share/classes/sun/nio/ch/ |
H A D | Util.java | 5 * This code is free software; you can redistribute it and/or modify it 169 // buffer from the cache and free it. 172 free(buf); 195 free(buf); 210 free(buf); 217 private static void free(ByteBuffer buf) { method in class:Util
|
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | concurrentMarkSweepGeneration.inline.hpp | 5 * This code is free software; you can redistribute it and/or modify it 428 inline size_t ConcurrentMarkSweepGeneration::free() const { function in class:ConcurrentMarkSweepGeneration 429 return _cmsSpace->free();
|
H A D | concurrentMarkSweepGeneration.cpp | 5 * This code is free software; you can redistribute it and/or modify it 225 // offsets match. The ability to tell free chunks from objects 278 // end of a collection, we let CMSTrigger[Perm]Ratio of the (purported) free 381 double CMSStats::cms_free_adjustment_factor(size_t free) const { 386 void CMSStats::adjust_cms_free_adjustment_factor(bool fail, size_t free) { argument 393 size_t cms_free = _cms_gen->cmsSpace()->free(); 568 -1 /* lock-free */, "No_lock" /* dummy */), 881 // part of the space ends in a free block we should add that to 894 return free() + _virtual_space.uncommitted_size(); 952 double free_percentage = ((double) free()) / capacit [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | jniHandles.cpp | 5 * This code is free software; you can redistribute it and/or modify it 291 // Check the thread-local free list for a block so we don't 319 // Get block from free list 338 // Put returned block at the beginning of the thread-local free list. 356 // Return blocks to free list 392 // traverse heap pointers only, not deleted handles or free list 416 // traverse heap pointers only, not deleted handles or free list pointers 472 // Try free list 486 // No space available, we have to rebuild free list or expand 505 int free local [all...] |
/openjdk7/jdk/src/share/javavm/export/ |
H A D | jdwpTransport.h | 5 * This code is free software; you can redistribute it and/or modify it 132 void (*free)(void *buffer); /* Call this for all deallocations */ member in struct:jdwpTransportCallback
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | zip.cpp | 5 * This code is free software; you can redistribute it and/or modify it 476 u->gzin->free(); 543 void gunzip::free() { function in class:gunzip 549 ::free(zstream); 552 ::free(this); 565 void gunzip::free() { function in class:gunzip
|
/openjdk7/jdk/src/share/native/sun/security/pkcs11/wrapper/ |
H A D | p11_util.c | 262 free(attrPtr[i].pValue); 265 free(attrPtr); 326 free(jpTemp); 332 free(jpTemp); 339 free(jpTemp); 368 free(jpTemp); 378 free(jpTemp); 385 free(jpTemp); 415 free(jTemp); 421 free(jTem 1107 #undef free macro [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | DeferredDocumentImpl.java | 786 * <em>Calling this method does not free the parent index.</em> 794 * @param free True to free parent node. 796 public int getParentNode(int nodeIndex, boolean free) { argument 804 return free ? clearChunkIndex(fNodeParent, chunk, index) 816 * @param free True to free child index. 818 public int getLastChild(int nodeIndex, boolean free) { argument 826 return free ? clearChunkIndex(fNodeLastChild, chunk, index) 841 * @param free Tru 843 getPrevSibling(int nodeIndex, boolean free) argument 884 getRealPrevSibling(int nodeIndex, boolean free) argument 1119 getNodeName(int nodeIndex, boolean free) argument 1141 getNodeValueString(int nodeIndex, boolean free) argument 1258 getNodeValue(int nodeIndex, boolean free) argument 1283 getNodeExtra(int nodeIndex, boolean free) argument 1305 getNodeType(int nodeIndex, boolean free) argument 1346 getNodeURI(int nodeIndex, boolean free) argument [all...] |
/openjdk7/hotspot/src/share/vm/asm/ |
H A D | codeBuffer.cpp | 5 * This code is free software; you can redistribute it and/or modify it 121 // free the BufferBlob. 130 // free any overflow storage 212 BufferBlob::free(_blob); 840 // Make sure the old cb won't try to use it or free it. 880 xtty->print_cr("<sect index='%d' size='" SIZE_FORMAT "' free='" SIZE_FORMAT "'/>", 926 os::free((void*)_string, mtCode); 1011 void CodeStrings::free() { function in class:CodeStrings
|