| /dalvik/libcore/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/qemu/distrib/sdl-1.2.12/src/audio/ |
| SDL_wave.h | 44 /* Not saved in the chunk we read:
56 /* The general chunk found in the WAVE file */
57 typedef struct Chunk {
61 } Chunk;
|
| /external/webkit/WebCore/bindings/v8/ |
| DOMDataStore.h | 61 m_chunks = new Chunk(m_chunks);
79 Chunk* toDelete = m_chunks;
93 Chunk* last = m_chunks;
95 Chunk* previous = last->m_previous;
114 for (Chunk* chunk = m_chunks->m_previous; chunk; chunk = chunk->m_previous)
115 visitEntries(chunk->m_entries, chunk->m_entries + CHUNK_SIZE, visitor)
[all...] |
| /sdk/ddms/libs/ddmlib/src/com/android/ddmlib/ |
| ChunkHandler.java | 26 * Subclass this with a class that handles one or more chunk types.
55 * Handle an incoming chunk. The data, of chunk type "type", begins
70 * in sub-classes should call this if the chunk type isn't recognized.
83 Log.w("ddms", "WARNING: received unknown chunk " + name(type)
94 * This is here because multiple chunk handlers can make use of it,
148 * header and one chunk header in addition to the demands of the
149 * chunk being created.
151 * "maxChunkLen" indicates the size of the chunk contents only.
162 * chunk data
[all...] |
| /frameworks/base/core/jni/android/graphics/ |
| NinePatchImpl.cpp | 106 const SkBitmap& bitmap, const android::Res_png_9patch& chunk,
123 chunk.xDivs, chunk.numXDivs,
124 chunk.yDivs, chunk.numYDivs,
148 LOGV("======== ninepatch xDivs [%d,%d]\n", chunk.xDivs[0], chunk.xDivs[1]);
149 LOGV("======== ninepatch yDivs [%d,%d]\n", chunk.yDivs[0], chunk.yDivs[1]);
174 const int32_t x0 = chunk.xDivs[0]
[all...] |
| /external/openssl/crypto/engine/ |
| eng_padlock.c | 909 size_t chunk, allocated=0; local
913 if ((chunk = ctx->num)) { /* borrow chunk variable */
918 if (chunk >= AES_BLOCK_SIZE)
922 while (chunk<AES_BLOCK_SIZE && nbytes!=0) {
923 ivp[chunk] = *(out_arg++) = *(in_arg++) ^ ivp[chunk];
924 chunk++, nbytes--;
926 else while (chunk<AES_BLOCK_SIZE && nbytes!=0) {
928 *(out_arg++) = c ^ ivp[chunk];
[all...] |
| /external/zlib/examples/ |
| zpipe.c | 18 #define CHUNK 16384
31 char in[CHUNK];
32 char out[CHUNK];
44 strm.avail_in = fread(in, 1, CHUNK, source);
55 strm.avail_out = CHUNK;
59 have = CHUNK - strm.avail_out;
87 char in[CHUNK];
88 char out[CHUNK];
102 strm.avail_in = fread(in, 1, CHUNK, source);
113 strm.avail_out = CHUNK;
[all...] |
| /dalvik/libcore/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 | 33 /* each chunk contains a certain number of sectors,
35 * lengths[i] is the length of the compressed chunk,
37 * sectorcounts[i] is the number of sectors in that chunk,
203 uint32_t chunk = search_chunk(s,sector_num); local
205 if(chunk>=s->n_chunks)
209 switch(s->types[chunk]) {
213 ret = lseek(s->fd, s->offsets[chunk], SEEK_SET);
217 /* we need to buffer, because only the chunk as whole can be
221 ret = read(s->fd, s->compressed_chunk+i, s->lengths[chunk]-i);
225 } while(ret>=0 && ret+i<s->lengths[chunk]);
[all...] |
| /external/v8/test/cctest/ |
| test-spaces.cc | 139 // Freeing pages at the first chunk starting at or after the second page
140 // should free the entire second chunk. It will return the last page in the
141 // first chunk (if the second page was in the first chunk) or else an
142 // invalid page (if the second page was the start of the second chunk).
147 // Freeing pages in the first chunk starting at the first page should free
148 // the first chunk and return an invalid page.
162 void* chunk = local
164 CHECK(chunk != NULL);
165 Address start = RoundUp(static_cast<Address>(chunk),
190 void* chunk = local
[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/opencore/pvmi/pvmf/include/ |
| pvmf_mempool.h | 71 * If numchunk and chunksize parameters are not set, memory pool of 1 chunk will be created in the first call to allocate.
72 * The chunk size will be set to the n passed in for allocate().
82 /** This API throws an exception when n is greater than the fixed chunk size or there are no free chunk available in the pool.
83 * If the memory pool hasn't been created yet, the pool will be created with chunk size equal to n so n must be greater than 0. Exception will be thrown if memory allocation for the memory pool fails.
85 * @return pointer to available chunk from memory pool
|
| /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.
|
| /system/core/include/cutils/ |
| mspace.h | 55 an allocated chunk, which may be more than you requested (although
94 chunkptr and chunklen refer to the heap-level chunk including
95 the chunk overhead, and userptr and userlen refer to the
96 user-usable part of the chunk. If the chunk is free, userptr
98 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...] |
| /external/iptables/include/linux/netfilter_ipv4/ |
| ipt_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/ |
| 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 */
|
| /external/sonivox/arm-wt-22k/lib_src/ |
| eas_xmf.h | 42 /* size of chunk info (chunk ID + chunk size) */
45 /* 'MTrk' track chunk ID */
|
| /external/bluetooth/glib/glib/ |
| gstring.c | 157 * @chunk: a #GStringChunk
164 g_string_chunk_free (GStringChunk *chunk)
168 g_return_if_fail (chunk != NULL);
170 if (chunk->storage_list)
172 for (tmp_list = chunk->storage_list; tmp_list; tmp_list = tmp_list->next)
175 g_slist_free (chunk->storage_list);
178 if (chunk->const_table)
179 g_hash_table_destroy (chunk->const_table);
181 g_free (chunk);
186 * @chunk: a #GStringChun
[all...] |
| /external/opencore/baselibs/threadsafe_callback_ao/src/ |
| threadsafe_mempool.cpp | 141 // Use the allocation size, n, as the chunk size for memory pool
158 // No free chunk is available
164 // Return the next available chunk from the pool
166 // Remove the chunk from the free list
194 // Returned memory is not aligned to the chunk.
200 // Put the returned chunk in the free pool
208 // Notify the observer about free chunk available if waiting for such callback
273 // Set up the free mem chunk list vector
|
| /frameworks/base/graphics/java/android/graphics/ |
| NinePatch.java | 42 * @param chunk The 9-patch data chunk describing how the underlying
46 public NinePatch(Bitmap bitmap, byte[] chunk, String srcName) {
48 mChunk = chunk;
50 validateNinePatchChunk(mBitmap.ni(), chunk); local
134 public native static boolean isNinePatchChunk(byte[] chunk);
141 private static native void validateNinePatchChunk(int bitmap, byte[] chunk);
149 int bitmap, byte[] chunk, Rect location);
|
