Searched defs:chunk (Results 1 - 24 of 24) sorted by relevance

/openjdk7/jdk/test/java/io/charStreams/
H A DBCat.java33 public static int chunk = 512; field in class:BCat
36 BufferedReader in = new BufferedReader(new InputStreamReader(new ABCInputStream(count, chunk)),
H A DBufferSizes.java34 static int chunk = 100; field in class:BufferSizes
41 = new BufferedInputStream(new ABCInputStream(count, chunk), sz);
58 = new BufferedReader(new InputStreamReader(new ABCInputStream(count, chunk)), sz);
H A DABCInputStream.java32 int chunk; field in class:ABCInputStream
40 ABCInputStream(int len, int chunk) { argument
42 this.chunk = chunk;
68 int n = (len > chunk) ? chunk : len;
84 return (remaining > chunk) ? chunk : remaining;
/openjdk7/jdk/test/java/lang/ProcessBuilder/
H A DBigFork.java57 static void touchPages(byte[] chunk) { argument
59 for (int i = 0; i < chunk.length; i+= pageSize) {
60 chunk[i] = (byte) rnd.nextInt();
86 byte[] chunk = new byte[chunkSize];
87 touchPages(chunk);
88 chunks.add(chunk);
91 chunks.set(0, null); // Free up one chunk
/openjdk7/hotspot/src/share/vm/runtime/
H A Dhandles.cpp65 static uintx chunk_oops_do(OopClosure* f, Chunk* chunk, char* chunk_top) { argument
66 oop* bottom = (oop*) chunk->bottom();
69 assert(top >= bottom && top <= (oop*) chunk->top(), "just checking");
85 // First handle the current chunk. It is filled to the high water mark.
137 handles = area->_hwm - _hwm; // no new chunk allocated
139 handles = _max - _hwm; // add rest in first chunk
157 // arena size could exceed total chunk size
169 // clear out first chunk (to detect allocation bugs)
H A DvframeArray.cpp51 MonitorChunk* chunk = _monitors; local
53 jt->remove_monitor_chunk(chunk);
54 delete chunk;
76 // Allocate monitor chunk
80 // Migrate the BasicLocks from the stack to the monitor chunk
445 vframeArray* vframeArray::allocate(JavaThread* thread, int frame_size, GrowableArray<compiledVFrame*>* chunk, argument
450 sizeof(vframeArrayElement) * (chunk->length() - 1), // variable part
452 result->_frames = chunk->length();
458 result->fill_in(thread, frame_size, chunk, reg_map);
464 GrowableArray<compiledVFrame*>* chunk,
462 fill_in(JavaThread* thread, int frame_size, GrowableArray<compiledVFrame*>* chunk, const RegisterMap *reg_map) argument
573 structural_compare(JavaThread* thread, GrowableArray<compiledVFrame*>* chunk) argument
[all...]
H A Ddeoptimization.cpp201 GrowableArray<compiledVFrame*>* chunk = new GrowableArray<compiledVFrame*>(10); local
205 chunk->push(compiledVFrame::cast(vf));
209 chunk->push(compiledVFrame::cast(vf));
216 assert (chunk->at(0)->scope() != NULL,"expect only compiled java frames");
217 GrowableArray<ScopeValue*>* objects = chunk->at(0)->scope()->objects();
226 bool save_oop_result = chunk->at(0)->scope()->return_oop();
265 for (int i = 0; i < chunk->length(); i++) {
266 compiledVFrame* cvf = chunk->at(i);
296 vframeArray* array = create_vframeArray(thread, deoptee, &map, chunk);
988 vframeArray* Deoptimization::create_vframeArray(JavaThread* thread, frame fr, RegisterMap *reg_map, GrowableArray<compiledVFrame*>* chunk) { argument
[all...]
H A Dthread.cpp1990 for (MonitorChunk* chunk = monitor_chunks(); chunk != NULL; chunk = chunk->next()) {
1991 if (chunk->contains(adr)) return true;
1998 void JavaThread::add_monitor_chunk(MonitorChunk* chunk) { argument
1999 chunk->set_next(monitor_chunks());
2000 set_monitor_chunks(chunk);
2003 void JavaThread::remove_monitor_chunk(MonitorChunk* chunk) { argument
2005 if (monitor_chunks() == chunk) {
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DfreeList.cpp94 // The chunk fc being removed has a "next". Set the "next" to the
139 // Remove this chunk from the list
144 assert(fc != NULL, "Remove a NULL chunk");
152 // The chunk fc being removed has a "next". Set the "next" to the
175 assert(fc->is_free(), "Should still be a free chunk");
182 // Add this chunk at the head of the list.
184 void FreeList<Chunk>::return_chunk_at_head(Chunk* chunk, bool record_return) { argument
186 assert(chunk != NULL, "insert a NULL chunk");
187 assert(size() == chunk
212 return_chunk_at_head(Chunk* chunk) argument
219 return_chunk_at_tail(Chunk* chunk, bool record_return) argument
248 return_chunk_at_tail(Chunk* chunk) argument
[all...]
H A DbinaryTreeDictionary.hpp95 // For constructing a TreeList from a Tree chunk or
103 // Returns the first available chunk in the free list as a pointer
113 // If "tc" is the first chunk in the list, it is also the
130 // chunk in the free list is also the tree node. Note that the
132 // the first chunk in the list is distinguished in this fashion
133 // (also is the node in the tree), it is the last chunk to be found
135 // it is the last chunk on the free list.
141 TreeList<Chunk> _embedded_list; // if non-null, this chunk is on _list
190 // Remove a chunk of size "size" or larger from the tree and
191 // return it. If the chunk
261 return_chunk(Chunk* chunk) argument
266 remove_chunk(Chunk* chunk) argument
[all...]
H A Dallocation.cpp175 Chunk* _first; // first cached Chunk; its first word points to next chunk
178 const size_t _size; // size of each chunk (must be uniform)
199 // Allocate a new chunk from the pool (might expand the pool)
216 // Return a chunk to the pool
217 void free(Chunk* chunk) { argument
218 assert(chunk->length() + Chunk::aligned_overhead_size() == _size, "bad size");
222 // Add chunk to list
223 chunk->set_next(_first);
224 _first = chunk;
349 // clear out this chunk (t
673 free_malloced_objects(Chunk* chunk, char* hwm, char* max, char* hwm2) argument
[all...]
H A DbinaryTreeDictionary.cpp63 // This first free chunk in the list will be the tree list.
87 // is not remangled when a free chunk is returned to the free list
88 // (since it is used to maintain the chunk on the free list).
117 assert(list != NULL, "should have at least the target chunk");
122 // first chunk in the list unless it is the last chunk in the list
123 // because the first chunk is also acting as the tree node.
124 // When coalescing happens, however, the first chunk in the a tree
128 // to allow mutator activity. If this chunk is the first in the
130 // TreeList<Chunk> from the first chunk t
219 return_chunk_at_tail(TreeChunk<Chunk>* chunk) argument
244 return_chunk_at_head(TreeChunk<Chunk>* chunk) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/
H A DXSDeclarationPool.java48 /** Initial chunk count (). */
85 int chunk = fElementDeclIndex >> CHUNK_SHIFT;
87 ensureElementDeclCapacity(chunk);
88 if (fElementDecl[chunk][index] == null) {
89 fElementDecl[chunk][index] = new XSElementDecl();
91 fElementDecl[chunk][index].reset();
94 return fElementDecl[chunk][index];
98 int chunk = fAttrDeclIndex >> CHUNK_SHIFT;
100 ensureAttrDeclCapacity(chunk);
101 if (fAttrDecl[chunk][inde
185 ensureElementDeclCapacity(int chunk) argument
202 ensureParticleDeclCapacity(int chunk) argument
213 ensureModelGroupCapacity(int chunk) argument
236 ensureAttrDeclCapacity(int chunk) argument
253 ensureAttributeUseCapacity(int chunk) argument
270 ensureSTDeclCapacity(int chunk) argument
287 ensureCTDeclCapacity(int chunk) argument
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsPromotionManager.hpp135 oop *chunk = (oop*)p; // cast p to oop (uses conversion operator) local
136 oop ret = oop((oop*)((uintptr_t)chunk & ~PS_CHUNKED_ARRAY_OOP_MASK));
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmserr.c280 // this way have be freed at once. Next function allocates a single chunk for linked list
286 _cmsSubAllocator_chunk* chunk; local
293 chunk = (_cmsSubAllocator_chunk*) _cmsMallocZero(ContextID, sizeof(_cmsSubAllocator_chunk));
294 if (chunk == NULL) return NULL;
297 chunk ->Block = (cmsUInt8Number*) _cmsMalloc(ContextID, Initial);
298 if (chunk ->Block == NULL) {
301 _cmsFree(ContextID, chunk);
307 chunk ->BlockSize = Initial;
308 chunk ->Used = 0;
309 chunk
339 _cmsSubAllocator_chunk *chunk, *n; local
364 _cmsSubAllocator_chunk* chunk; local
[all...]
/openjdk7/jaxp/src/com/sun/xml/internal/stream/dtd/nonvalidating/
H A DDTDGrammar.java66 /** Initial chunk count (1 << (10 - CHUNK_SHIFT)). */
264 int chunk = fCurrentElementIndex >> CHUNK_SHIFT;
265 ensureElementDeclCapacity(chunk);
395 int chunk = fCurrentAttributeIndex >> CHUNK_SHIFT;
396 ensureAttributeDeclCapacity(chunk);
455 int chunk = elementIndex >> CHUNK_SHIFT;
458 if(fElementDeclType[chunk][index] == -1){
462 return (short) (fElementDeclType[chunk][index] & LIST_MASK);
481 int chunk = elementDeclIndex >> CHUNK_SHIFT;
484 elementDecl.name.setValues(fElementDeclName[chunk][inde
750 ensureElementDeclCapacity(int chunk) argument
769 ensureAttributeDeclCapacity(int chunk) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/
H A DDeferredDocumentImpl.java79 /** Initial chunk size. */
208 int chunk = nodeIndex >> CHUNK_SHIFT;
212 setChunkValue(fNodeName, rootElementName, chunk, index);
213 setChunkValue(fNodeValue, publicId, chunk, index);
214 setChunkValue(fNodeURI, systemId, chunk, index);
222 int chunk = doctypeIndex >> CHUNK_SHIFT;
229 setChunkIndex(fNodeExtra, extraDataIndex, chunk, index);
239 int chunk = nodeIndex >> CHUNK_SHIFT;
249 setChunkValue(fNodeName, notationName, chunk, index);
250 setChunkValue(fNodeValue, publicId, chunk, inde
1781 ensureCapacity(int chunk) argument
1934 createChunk(int data[][], int chunk) argument
1943 createChunk(Object data[][], int chunk) argument
1953 setChunkIndex(int data[][], int value, int chunk, int index) argument
1971 setChunkValue(Object data[][], Object value, int chunk, int index) argument
1994 getChunkIndex(int data[][], int chunk, int index) argument
1997 getChunkValue(Object data[][], int chunk, int index) argument
2000 getNodeValue(int chunk, int index) argument
2022 clearChunkIndex(int data[][], int chunk, int index) argument
2033 clearChunkValue(Object data[][], int chunk, int index) argument
[all...]
/openjdk7/jdk/src/share/demo/jvmti/hprof/
H A Dhprof_table.c300 BV_CHUNK_TYPE chunk; local
307 /* Go to beginning of chunk */
312 /* Find chunk with any bit set */
313 chunk = 0;
315 chunk = BV_CHUNK(p, istart);
316 if ( chunk != 0 ) {
320 HPROF_ASSERT(chunk!=0);
321 HPROF_ASSERT(chunk==BV_CHUNK(p,istart));
324 /* Find bit in chunk and return index of freed item */
329 if ( (chunk
[all...]
/openjdk7/jdk/src/share/native/sun/awt/libpng/
H A Dpngset.c183 png_warning(png_ptr, "Insufficient memory for hIST chunk data");
613 png_warning(png_ptr, "Insufficient memory to process iCCP chunk");
753 png_warning(png_ptr, "iTXt chunk not supported");
830 png_debug1(3, "transferred text chunk %d", info_ptr->num_text);
889 "tRNS chunk has out-of-range samples for bit_depth");
955 "Out of memory while processing sPLT chunk");
966 "Out of memory while processing sPLT chunk");
1004 "Out of memory while processing unknown chunk");
1038 "Out of memory while processing unknown chunk");
1054 int chunk, in
1053 png_set_unknown_chunk_location(png_structp png_ptr, png_infop info_ptr, int chunk, int location) argument
[all...]
H A Dpngtest.c43 * the basic chunk handling, filtering, and (de)compression code is working
125 static char tIME_string[PNG_tIME_STRING_LENGTH] = "tIME chunk is not present";
719 /* Demonstration of user chunk support of the sTER and vpAg chunks */
722 /* (sTER is a public chunk not yet known by libpng. vpAg is a private
723 chunk used in ImageMagick to store "virtual page" size). */
734 png_unknown_chunkp chunk)
740 * return (-n); chunk had an error
744 * The unknown chunk structure contains the chunk data:
752 if (chunk
733 read_user_chunk_callback(png_struct *png_ptr, png_unknown_chunkp chunk) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/
H A DDTDGrammar.java127 /** Initial chunk count (1 << (10 - CHUNK_SHIFT)). */
361 int chunk = elementDeclIndex >> CHUNK_SHIFT;
363 return (fElementDeclIsExternal[chunk][index] != 0);
378 int chunk = attributeDeclIndex >> CHUNK_SHIFT;
380 return (fAttributeDeclIsExternal[chunk][index] != 0);
572 int chunk = fCurrentElementIndex >> CHUNK_SHIFT;
574 ensureElementDeclCapacity(chunk);
575 fElementDeclIsExternal[chunk][index] = (fReadingExternalDTD || fPEDepth > 0) ? 1 : 0;
702 int chunk = fCurrentAttributeIndex >> CHUNK_SHIFT;
704 ensureAttributeDeclCapacity(chunk);
2458 ensureElementDeclCapacity(int chunk) argument
2484 ensureAttributeDeclCapacity(int chunk) argument
2514 ensureEntityDeclCapacity(int chunk) argument
2540 ensureNotationDeclCapacity(int chunk) argument
2558 ensureContentSpecCapacity(int chunk) argument
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dchaitin.cpp1136 static bool is_legal_reg(LRG &lrg, OptoReg::Name reg, int chunk) { argument
1137 if (reg >= chunk && reg < (chunk + RegMask::CHUNK_SIZE) &&
1138 lrg.mask().Member(OptoReg::add(reg,-chunk))) {
1163 OptoReg::Name PhaseChaitin::bias_color( LRG &lrg, int chunk ) {
1177 if (is_legal_reg(lrg, reg, chunk))
1188 if (is_legal_reg(lrg, reg, chunk))
1190 } else if( chunk == 0 ) {
1204 return OptoReg::add(lrg.mask().find_first_set(lrg.num_regs()),chunk);
1220 return OptoReg::add( reg, chunk );
1280 int chunk = 0; // Current chunk is first chunk local
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp98 // as one big chunk. We'll need to decide here which of several
127 // a chunk of any size.
296 // Reset the space to the new reality - one free chunk.
308 "Why was the chunk broken up?");
319 // chunk, if it exists. Use with caution since it involves
617 // Now, take this new chunk and add it to the free blocks.
1002 // If the object is still a free chunk, return the size, else it
1090 // stable. But being a free chunk may not be (because of parallel
1295 // Don't record chunk off a LinAB? smallSplitBirth(size);
1343 assert(ret == NULL || ret->is_free(), "Should be returning a free chunk");
1713 returnChunkToDictionary(FreeChunk* chunk) argument
1752 addChunkToFreeListsAtEndRecordingStats( HeapWord* chunk, size_t size) argument
1791 addChunkToFreeLists(HeapWord* chunk, size_t size) argument
1809 addChunkAndRepairOffsetTable(HeapWord* chunk, size_t size, bool coalesced) argument
1915 splitChunkAndReturnRemainder(FreeChunk* chunk, size_t new_size) argument
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A DjavaClasses.cpp1587 // backtrace has space for one chunk (next is NULL)
1657 objArrayOop chunk = objArrayOop(backtrace(throwable)); local
1659 if (chunk != NULL) {
1662 objArrayOop next = objArrayOop(chunk->obj_at(trace_next_offset));
1665 chunk = next;
1667 assert(chunk != NULL && chunk->obj_at(trace_next_offset) == NULL, "sanity check");
1668 // Count element in remaining partial chunk
1669 objArrayOop methods = objArrayOop(chunk->obj_at(trace_methods_offset));
1670 typeArrayOop bcis = typeArrayOop(chunk
1689 objArrayOop chunk = objArrayOop(backtrace(throwable)); local
[all...]

Completed in 110 milliseconds