HomeSort by relevance Sort by last modified time
    Searched refs:chunk (Results 76 - 100 of 476) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/bison/lib/
obstack.h 62 The way we do this is to take a large chunk, allocating memory from
63 low addresses. When you want to build a symbol in the chunk you just
64 add chars above the current "high water mark" in the chunk. When you
67 Mostly the chars will not burst over the highest address of the chunk,
68 because you would typically expect a chunk to be (say) 100 times as
72 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
78 When the chars burst over a chunk boundary, we allocate a larger
79 chunk, and then copy the partly formed object from the end of the old
80 chunk to the beginning of the new larger chunk. We then carry o
152 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
    [all...]
  /external/chromium/base/
sync_socket_win.cc 116 DWORD chunk = static_cast<DWORD>( local
119 chunk, &len, NULL) == FALSE) {
132 DWORD chunk = static_cast<DWORD>( local
135 chunk, &len, NULL) == FALSE) {
  /external/chromium_org/third_party/WebKit/Source/bindings/v8/
ScriptHeapSnapshot.h 50 virtual void Write(const String& chunk) = 0;
  /external/chromium_org/third_party/libxml/src/
DOCBparser.c 101 * @chunk: an char array
102 * @size: the size in byte of the chunk
103 * @terminate: last chunk indicator
105 * Parse a Chunk of memory
111 const char *chunk ATTRIBUTE_UNUSED,
123 return (xmlParseChunk(ctxt, chunk, size, terminate));
130 * @chunk: a pointer to an array of chars
145 const char *chunk ATTRIBUTE_UNUSED,
158 return(xmlCreatePushParserCtxt(sax, user_data, chunk, size, filename));
  /external/chromium_org/v8/src/
incremental-marking.cc 88 MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); local
89 int counter = chunk->write_barrier_counter();
93 chunk->write_barrier_counter();
94 chunk->set_write_barrier_counter(
109 MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); local
110 int counter = chunk->write_barrier_counter();
114 chunk->write_barrier_counter();
115 chunk->set_write_barrier_counter(
227 MemoryChunk* chunk = MemoryChunk::FromAddress(object->address()); local
231 chunk->owner()->identity() == LO_SPACE)
704 MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); local
730 MemoryChunk* chunk = MemoryChunk::FromAddress(obj->address()); local
    [all...]
  /external/libxml2/
DOCBparser.c 101 * @chunk: an char array
102 * @size: the size in byte of the chunk
103 * @terminate: last chunk indicator
105 * Parse a Chunk of memory
111 const char *chunk ATTRIBUTE_UNUSED,
123 return (xmlParseChunk(ctxt, chunk, size, terminate));
130 * @chunk: a pointer to an array of chars
145 const char *chunk ATTRIBUTE_UNUSED,
158 return(xmlCreatePushParserCtxt(sax, user_data, chunk, size, filename));
  /ndk/sources/host-tools/sed-4.2.1/lib/
obstack.h 62 The way we do this is to take a large chunk, allocating memory from
63 low addresses. When you want to build a symbol in the chunk you just
64 add chars above the current "high water mark" in the chunk. When you
67 Mostly the chars will not burst over the highest address of the chunk,
68 because you would typically expect a chunk to be (say) 100 times as
72 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
78 When the chars burst over a chunk boundary, we allocate a larger
79 chunk, and then copy the partly formed object from the end of the old
80 chunk to the beginning of the new larger chunk. We then carry o
152 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
obstack.h 64 The way we do this is to take a large chunk, allocating memory from
65 low addresses. When you want to build a symbol in the chunk you just
66 add chars above the current "high water mark" in the chunk. When you
69 Mostly the chars will not burst over the highest address of the chunk,
70 because you would typically expect a chunk to be (say) 100 times as
74 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
80 When the chars burst over a chunk boundary, we allocate a larger
81 chunk, and then copy the partly formed object from the end of the old
82 chunk to the beginning of the new larger chunk. We then carry o
154 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/
obstack.h 64 The way we do this is to take a large chunk, allocating memory from
65 low addresses. When you want to build a symbol in the chunk you just
66 add chars above the current "high water mark" in the chunk. When you
69 Mostly the chars will not burst over the highest address of the chunk,
70 because you would typically expect a chunk to be (say) 100 times as
74 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
80 When the chars burst over a chunk boundary, we allocate a larger
81 chunk, and then copy the partly formed object from the end of the old
82 chunk to the beginning of the new larger chunk. We then carry o
154 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/
obstack.h 64 The way we do this is to take a large chunk, allocating memory from
65 low addresses. When you want to build a symbol in the chunk you just
66 add chars above the current "high water mark" in the chunk. When you
69 Mostly the chars will not burst over the highest address of the chunk,
70 because you would typically expect a chunk to be (say) 100 times as
74 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
80 When the chars burst over a chunk boundary, we allocate a larger
81 chunk, and then copy the partly formed object from the end of the old
82 chunk to the beginning of the new larger chunk. We then carry o
154 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/encodings/
uu_codec.py 36 chunk = read(45)
37 while chunk:
38 write(b2a_uu(chunk))
39 chunk = read(45)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/encodings/
uu_codec.py 36 chunk = read(45)
37 while chunk:
38 write(b2a_uu(chunk))
39 chunk = read(45)
  /external/srec/srec/EventLog/src/
riff.c 58 * data - descriptor for the "data" chunk
361 { /* skip this non-RIFF chunk */
401 //GS_SetResult(res,"RIFF chunk not found",GS_STATIC);
405 //if(feof(f)) GS_SetResult(res,"RIFF chunk not found",GS_STATIC);
418 { /* skip this non-LIST chunk */
460 ChunkContext chunk, list_chunk; local
465 strncpy(chunk.tag, "swi ", 4);
466 if (riffDescend(f, &chunk, parent, FIND_LIST, doSwap) == ESR_SUCCESS)
470 if (riffDescend(f, &list_chunk, &chunk, FIND_CHUNK, doSwap) == ESR_SUCCESS)
497 if (riffDescend(f, &list_chunk, &chunk, FIND_CHUNK, doSwap) == ESR_SUCCESS
559 ChunkContext chunk, parent; local
681 ChunkContext chunk, parent; local
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/utils/
FastStringBuffer.java 36 * exceeds the space available; we just allocate another chunk and
39 * recopying may arise when we extract Strings which cross chunk
48 * variation in chunk sizes), but this implementation has proven to
56 // If nonzero, forces the inial chunk size.
68 * This should be used when normalize-to-SAX is called for the first chunk of a
69 * multi-chunk output, or one following unsuppressed whitespace in a previous
70 * chunk.
76 * This should be used when normalize-to-SAX is called for the last chunk of a
77 * multi-chunk output; it may have to be or'ed with SUPPRESS_LEADING_WS.
89 /** Manifest constant: Carry trailing whitespace of one chunk as leading
419 char[] chunk; local
488 char[] chunk = m_array[m_lastChunk]; local
570 char[] chunk = m_array[m_lastChunk]; local
653 char[] chunk = m_array[m_lastChunk]; local
740 char[] chunk = m_array[m_lastChunk]; local
    [all...]
  /external/chromium_org/third_party/simplejson/
encoder.py 251 for chunk in JSONEncoder().iterencode(bigobject):
252 mysocket.write(chunk)
336 for chunk in chunks:
337 chunk = chunk.replace('&', '\\u0026')
338 chunk = chunk.replace('<', '\\u003c')
339 chunk = chunk.replace('>', '\\u003e')
340 yield chunk
    [all...]
  /system/extras/tests/sdcard/
sdcard_perf_test.cpp 74 // adb shell /system/bin/sdcard_perf_test --test=read --size=1000 --chunk-size=100 --procnb=1 --iterations=10 --dump > /tmp/data.txt
75 // adb shell /system/bin/sdcard_perf_test --test=write --size=1000 --chunk-size=100 --procnb=1 --iterations=100 --dump > /tmp/data.txt
112 {"chunk-size", required_argument, 0, 'S'},
133 " -S --chunk-size: Size of a chunk. Default to size ie 1 chunk.\n"
134 " Data will be written/read using that chunk size.\n"
286 // @param chunk buffer large enough where the chunk read are written.
290 bool readData(char *const chunk, const int idx, TestCase *testCase
356 char *const chunk = new char[chunk_size]; local
568 char * const chunk = new char[testCase->chunkSize()]; local
    [all...]
  /frameworks/base/core/jni/android/graphics/
BitmapFactory.cpp 103 static void scaleNinePatchChunk(android::Res_png_9patch* chunk, float scale) {
104 chunk->paddingLeft = int(chunk->paddingLeft * scale + 0.5f);
105 chunk->paddingTop = int(chunk->paddingTop * scale + 0.5f);
106 chunk->paddingRight = int(chunk->paddingRight * scale + 0.5f);
107 chunk->paddingBottom = int(chunk->paddingBottom * scale + 0.5f);
109 for (int i = 0; i < chunk->numXDivs; i++)
    [all...]
  /external/chromium_org/remoting/base/
compound_buffer.cc 174 // Add data from the current chunk only if it is in the specified interval.
211 const CompoundBuffer::DataChunk& chunk = buffer_->chunks_[current_chunk_]; local
212 int read_size = chunk.size - current_chunk_position_;
213 *data = chunk.start + current_chunk_position_;
241 const CompoundBuffer::DataChunk& chunk = buffer_->chunks_[current_chunk_]; local
242 current_chunk_position_ = chunk.size - count;
255 const CompoundBuffer::DataChunk& chunk = buffer_->chunks_[current_chunk_]; local
256 int read = std::min(count, chunk.size - current_chunk_position_);
264 if (current_chunk_position_ == chunk.size) {
  /external/chromium_org/third_party/libxml/src/include/libxml/
DOCBparser.h 75 const char *chunk,
81 const char *chunk,
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
compute_memory_pool.h 34 int64_t id; ///ID of the memory chunk
39 int64_t size_in_dw; ///Size of the chunk in dwords
65 struct compute_memory_item* compute_memory_postalloc_chunk(struct compute_memory_pool* pool, int64_t start_in_dw); ///search for the chunk where we can link our new chunk after it
93 struct compute_memory_item* chunk, void* data,
96 void compute_memory_transfer_direct(struct compute_memory_pool* pool, int chunk_to_data, struct compute_memory_item* chunk, struct r600_resource* data, int offset_in_chunk, int offset_in_data, int size); ///Transfer data between chunk<->data, it is for VRAM<->GART transfers
  /external/libxml2/include/libxml/
DOCBparser.h 75 const char *chunk,
81 const char *chunk,
  /external/mesa3d/src/gallium/drivers/r600/
compute_memory_pool.h 34 int64_t id; ///ID of the memory chunk
39 int64_t size_in_dw; ///Size of the chunk in dwords
65 struct compute_memory_item* compute_memory_postalloc_chunk(struct compute_memory_pool* pool, int64_t start_in_dw); ///search for the chunk where we can link our new chunk after it
93 struct compute_memory_item* chunk, void* data,
96 void compute_memory_transfer_direct(struct compute_memory_pool* pool, int chunk_to_data, struct compute_memory_item* chunk, struct r600_resource* data, int offset_in_chunk, int offset_in_data, int size); ///Transfer data between chunk<->data, it is for VRAM<->GART transfers
  /frameworks/av/media/libstagefright/
SampleIterator.cpp 87 uint32_t chunk =
91 if (!mInitialized || chunk != mCurrentChunkIndex) {
92 mCurrentChunkIndex = chunk;
95 if ((err = getChunkOffset(chunk, &mCurrentChunkOffset)) != OK) {
182 status_t SampleIterator::getChunkOffset(uint32_t chunk, off64_t *offset) {
185 if (chunk >= mTable->mNumChunkOffsets) {
193 mTable->mChunkOffsetOffset + 8 + 4 * chunk,
205 mTable->mChunkOffsetOffset + 8 + 8 * chunk,
  /frameworks/base/core/java/android/ddm/
DdmHandleAppName.java 19 import org.apache.harmony.dalvik.ddmc.Chunk;
59 * Handle a chunk of data.
61 public Chunk handleChunk(Chunk request) {
87 * Send an APNM (APplication NaMe) chunk.
102 Chunk chunk = new Chunk(CHUNK_APNM, out); local
103 DdmServer.sendChunk(chunk);
  /frameworks/rs/cpu_ref/linkloader/include/impl/
ELFSectionProgBits.hxx 66 if (!result->chunk.allocate(alloc_size)) {
71 stubs->initStubTable(result->chunk.getBuffer() + section_size,

Completed in 506 milliseconds

1 2 34 5 6 7 8 91011>>