| /external/v8/test/cctest/ |
| test-liveedit.cc | 113 for (DiffChunkStruct* chunk = first_chunk;
114 chunk != NULL;
115 chunk = chunk->next) {
116 int diff_pos1 = chunk->pos1;
120 ASSERT_EQ(diff_pos2, chunk->pos2);
127 diff_parameter += chunk->len1 + chunk->len2;
128 pos1 = diff_pos1 + chunk->len1;
129 pos2 = diff_pos2 + chunk->len2
[all...] |
| /external/zlib/examples/ |
| zpipe.c | 28 #define CHUNK 16384
41 unsigned char in[CHUNK];
42 unsigned char out[CHUNK];
54 strm.avail_in = fread(in, 1, CHUNK, source);
65 strm.avail_out = CHUNK;
69 have = CHUNK - strm.avail_out;
97 unsigned char in[CHUNK];
98 unsigned char out[CHUNK];
112 strm.avail_in = fread(in, 1, CHUNK, source);
123 strm.avail_out = CHUNK;
[all...] |
| /frameworks/base/core/jni/android/graphics/ |
| BitmapFactory.cpp | 405 android::Res_png_9patch* chunk = static_cast<android::Res_png_9patch*>(storage); local
406 memcpy(chunk, array, chunkSize);
407 android::Res_png_9patch::deserialize(chunk);
409 chunk->paddingLeft = int(chunk->paddingLeft * scale + 0.5f);
410 chunk->paddingTop = int(chunk->paddingTop * scale + 0.5f);
411 chunk->paddingRight = int(chunk->paddingRight * scale + 0.5f);
412 chunk->paddingBottom = int(chunk->paddingBottom * scale + 0.5f)
[all...] |
| /frameworks/base/libs/binder/ |
| CursorWindow.cpp | 224 RowSlotChunk* chunk = static_cast<RowSlotChunk*>( local
227 chunk = static_cast<RowSlotChunk*>(offsetToPtr(chunk->nextChunkOffset));
230 return &chunk->slots[chunkPos];
235 RowSlotChunk* chunk = static_cast<RowSlotChunk*>( local
238 chunk = static_cast<RowSlotChunk*>(offsetToPtr(chunk->nextChunkOffset));
242 if (!chunk->nextChunkOffset) {
243 chunk->nextChunkOffset = alloc(sizeof(RowSlotChunk), true /*aligned*/);
244 if (!chunk->nextChunkOffset)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ChunkedIntArray.java | 94 int[] chunk = chunks.elementAt(chunkpos); local
95 chunk[slotpos] = w0;
96 chunk[slotpos+1] = w1;
97 chunk[slotpos+2] = w2;
98 chunk[slotpos+3] = w3;
126 int[] chunk = chunks.elementAt(chunkpos); local
127 return chunk[slotpos + offset];
148 int[] chunk = chunks.elementAt(chunkpos); local
153 ancestor = chunk[slotpos + 1];
175 CIA; when only a single characters() chunk has been recieved, its inde
207 int[] chunk = chunks.elementAt(chunkpos); local
230 int[] chunk = chunks.elementAt(chunkpos); local
263 int[] chunk = chunks.elementAt(chunkpos); local
[all...] |
| /external/qemu/block/ |
| dmg.c | 31 /* each chunk contains a certain number of sectors,
33 * lengths[i] is the length of the compressed chunk,
35 * sectorcounts[i] is the number of sectors in that chunk,
217 uint32_t chunk = search_chunk(s,sector_num); local
219 if(chunk>=s->n_chunks)
223 switch(s->types[chunk]) {
227 /* we need to buffer, because only the chunk as whole can be
231 ret = bdrv_pread(bs->file, s->offsets[chunk] + i,
232 s->compressed_chunk+i, s->lengths[chunk]-i);
236 } while(ret>=0 && ret+i<s->lengths[chunk]);
[all...] |
| /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...] |
| /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/bison/lib/ |
| obstack.h | 63 The way we do this is to take a large chunk, allocating memory from
64 low addresses. When you want to build a symbol in the chunk you just
65 add chars above the current "high water mark" in the chunk. When you
68 Mostly the chars will not burst over the highest address of the chunk,
69 because you would typically expect a chunk to be (say) 100 times as
73 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
79 When the chars burst over a chunk boundary, we allocate a larger
80 chunk, and then copy the partly formed object from the end of the old
81 chunk to the beginning of the new larger chunk. We then carry o
153 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
[all...] |
| /external/v8/src/ |
| bignum.cc | 70 bigits_[i] = static_cast<Chunk>(value & kBigitMask);
143 Chunk current_bigit = 0;
151 Chunk most_significant_bigit = 0; // Could be = 0;
193 Chunk carry = 0;
197 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
204 Chunk sum = bigits_[bigit_pos] + carry;
223 Chunk borrow = 0;
227 Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow;
232 Chunk difference = bigits_[i + offset] - borrow;
259 // Assert that this number + 1 (for the carry) fits into double chunk
[all...] |
| /prebuilt/linux-x86/toolchain/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...] |
| /external/clang/lib/Sema/ |
| CodeCompleteConsumer.cpp | 81 CodeCompletionString::Chunk::Chunk(ChunkKind Kind, const char *Text)
156 CodeCompletionString::Chunk
157 CodeCompletionString::Chunk::CreateText(const char *Text) {
158 return Chunk(CK_Text, Text);
161 CodeCompletionString::Chunk
162 CodeCompletionString::Chunk::CreateOptional(CodeCompletionString *Optional) {
163 Chunk Result;
169 CodeCompletionString::Chunk
170 CodeCompletionString::Chunk::CreatePlaceholder(const char *Placeholder)
[all...] |
| /external/openssl/crypto/md4/ |
| md4_one.c | 81 unsigned long chunk;
85 chunk = (n > sizeof(temp)) ? sizeof(temp) : n;
86 ebcdic2ascii(temp, d, chunk);
87 MD4_Update(&c,temp,chunk);
88 n -= chunk;
89 d += chunk;
|
| /external/openssl/crypto/md5/ |
| md5_one.c | 81 unsigned long chunk;
85 chunk = (n > sizeof(temp)) ? sizeof(temp) : n;
86 ebcdic2ascii(temp, d, chunk);
87 MD5_Update(&c,temp,chunk);
88 n -= chunk;
89 d += chunk;
|
| /external/srec/srec/EventLog/include/ |
| riff.h | 73 * Generic start of every RIFF chunk.
82 * Chunk length.
98 * The length of the RIFF chunk.
110 * The length of the format chunk.
149 * For "supp" or "lost" chunk.
181 * For "kval" chunk.
|
| /external/webkit/Source/WebKit2/Shared/gtk/ |
| UpdateChunk.cpp | 78 bool UpdateChunk::decode(CoreIPC::ArgumentDecoder* decoder, UpdateChunk& chunk)
80 ASSERT_ARG(chunk, chunk.isEmpty());
86 chunk.m_rect = rect;
93 chunk.m_sharedMemory = 0;
101 chunk.m_sharedMemory = SharedMemory::create(handle, SharedMemory::ReadOnly);
|
| /external/webkit/Source/WebKit2/Shared/qt/ |
| UpdateChunk.cpp | 77 bool UpdateChunk::decode(CoreIPC::ArgumentDecoder* decoder, UpdateChunk& chunk)
79 ASSERT_ARG(chunk, chunk.isEmpty());
85 chunk.m_rect = rect;
92 chunk.m_sharedMemory = 0;
100 chunk.m_sharedMemory = SharedMemory::create(handle, SharedMemory::ReadOnly);
|
| /libcore/luni/src/main/java/libcore/net/http/ |
| ChunkedOutputStream.java | 25 * An HTTP body with alternating chunk sizes and chunk bodies. Chunks are
27 * chunk is written and the buffer is cleared.
51 * Returns the amount of data that can be transmitted in a chunk whose total
72 // fill the buffered chunk and then maybe write that to the stream
81 // write a single chunk of size maxChunkLength to the stream
|
| /system/core/include/cutils/ |
| mspace.h | 55 an allocated chunk, which may be more than you requested (although
99 chunkptr and chunklen refer to the heap-level chunk including
100 the chunk overhead, and userptr and userlen refer to the
101 user-usable part of the chunk. If the chunk is free, userptr
103 to be the same value passed into malloc() for a given chunk;
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| obstack.h | 68 The way we do this is to take a large chunk, allocating memory from
69 low addresses. When you want to build a symbol in the chunk you just
70 add chars above the current "high water mark" in the chunk. When you
73 Mostly the chars will not burst over the highest address of the chunk,
74 because you would typically expect a chunk to be (say) 100 times as
78 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
84 When the chars burst over a chunk boundary, we allocate a larger
85 chunk, and then copy the partly formed object from the end of the old
86 chunk to the beginning of the new larger chunk. We then carry o
167 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| obstack.h | 68 The way we do this is to take a large chunk, allocating memory from
69 low addresses. When you want to build a symbol in the chunk you just
70 add chars above the current "high water mark" in the chunk. When you
73 Mostly the chars will not burst over the highest address of the chunk,
74 because you would typically expect a chunk to be (say) 100 times as
78 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
84 When the chars burst over a chunk boundary, we allocate a larger
85 chunk, and then copy the partly formed object from the end of the old
86 chunk to the beginning of the new larger chunk. We then carry o
167 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
[all...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
| obstack.h | 68 The way we do this is to take a large chunk, allocating memory from
69 low addresses. When you want to build a symbol in the chunk you just
70 add chars above the current "high water mark" in the chunk. When you
73 Mostly the chars will not burst over the highest address of the chunk,
74 because you would typically expect a chunk to be (say) 100 times as
78 the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed)
84 When the chars burst over a chunk boundary, we allocate a larger
85 chunk, and then copy the partly formed object from the end of the old
86 chunk to the beginning of the new larger chunk. We then carry o
167 struct _obstack_chunk *chunk; \/* address of current struct obstack_chunk *\/ member in struct:obstack
[all...] |
| /external/iptables/include/linux/netfilter/ |
| xt_sctp.h | 26 #define SCTP_CHUNK_MATCH_ANY 0x01 /* Match if any of the chunk types are present */
27 #define SCTP_CHUNK_MATCH_ALL 0x02 /* Match if all of the chunk types are present */
28 #define SCTP_CHUNK_MATCH_ONLY 0x04 /* Match if these are the only chunk types present */
|
| /external/kernel-headers/original/linux/netfilter/ |
| xt_sctp.h | 27 #define SCTP_CHUNK_MATCH_ANY 0x01 /* Match if any of the chunk types are present */
28 #define SCTP_CHUNK_MATCH_ALL 0x02 /* Match if all of the chunk types are present */
29 #define SCTP_CHUNK_MATCH_ONLY 0x04 /* Match if these are the only chunk types present */
|
| /external/kernel-headers/original/linux/netfilter_ipv4/ |
| ipt_sctp.h | 25 #define SCTP_CHUNK_MATCH_ANY 0x01 /* Match if any of the chunk types are present */
26 #define SCTP_CHUNK_MATCH_ALL 0x02 /* Match if all of the chunk types are present */
27 #define SCTP_CHUNK_MATCH_ONLY 0x04 /* Match if these are the only chunk types present */
|
