| /libcore/luni/src/main/java/org/apache/xml/dtm/ref/ |
| ChunkedIntArray.java | 45 static final int lowbits=10; // How many bits address within chunks
49 ChunksVector chunks=new ChunksVector(); field in class:ChunkedIntArray
63 chunks.addElement(fastArray);
92 if (chunkpos > chunks.size() - 1)
93 chunks.addElement(new int[chunkalloc]);
94 int[] chunk = chunks.elementAt(chunkpos);
126 int[] chunk = chunks.elementAt(chunkpos);
148 int[] chunk = chunks.elementAt(chunkpos);
207 int[] chunk = chunks.elementAt(chunkpos);
228 if (chunkpos > chunks.size() - 1
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/serializer/ |
| WriterToUTF8Buffered.java | 197 * Cut the buffer up into chunks, each of which will
203 final int chunks; local
205 chunks = split + 1;
207 chunks = split;
209 for (int chunk = 1; chunk <= chunks; chunk++)
212 end_chunk = start + (int) ((((long) length) * chunk) / chunks);
334 * so break it up in chunks that don't exceed the buffer size.
338 final int chunks; local
340 chunks = split + 1;
342 chunks = split
[all...] |
| /bootable/recovery/applypatch/ |
| imgdiff.c | 19 * and recovery.img -- that consist primarily of large chunks of gzipped
26 * chunks of two types: "normal" and "gzip". Normal chunks are simply
27 * patched using a plain bsdiff. Gzip chunks are first expanded, then a
29 * gzipped using the same encoder parameters. Patched chunks are
43 * chunks, followed by N bsdiff patches, one per chunk.
47 * chunks in the same order. Android boot and recovery images currently
48 * consist of five chunks: a small normal header, a gzipped kernel, a
103 * including the gzip header and footer for gzip chunks. "source
133 unsigned char* data; // data to be patched (uncompressed, for deflate chunks)
[all...] |
| /libcore/luni/src/main/java/java/util/jar/ |
| InitManifest.java | 56 Map<String, Manifest.Chunk> chunks) throws IOException {
74 if (chunks != null) {
75 if (chunks.get(entryNameValue) != null) {
76 // TODO A bug: there might be several verification chunks for
79 // this: either use a list of chunks, or decide on used
80 // signature algorithm in advance and reread the chunks while
84 chunks.put(entryNameValue, new Manifest.Chunk(mark, pos));
|
| Manifest.java | 62 private HashMap<String, Chunk> chunks; field in class:Manifest
107 chunks = new HashMap<String, Chunk>();
211 im.initEntries(entries, chunks);
297 return chunks.get(name);
301 chunks = null;
|
| /external/chromium/third_party/modp_b64/ |
| modp_b64.cc | 138 int chunks = (leftover == 0) ? len / 4 - 1 : len /4; local
145 for (i = 0; i < chunks; ++i) {
164 return (chunks+1)*3;
182 return 3*chunks + (6*leftover)/8;
208 int chunks = (leftover == 0) ? len / 4 - 1 : len /4; local
215 for (i = 0; i < chunks; ++i) {
239 return (chunks+1)*3;
260 return 3*chunks + (6*leftover)/8;
|
| /external/bluetooth/glib/glib/ |
| gslice.c | 57 * of recently freed and soon to be allocated chunks is maintained per thread.
61 * - the magazine cache. allocating and freeing chunks to/from threads only
70 * the blocks are divided into smaller chunks which are used to satisfy
75 * freeing and allocation of chunks (as long as the allocation of an entirely
87 * the handed out memory chunks. to avoid excessive page-wise fragmentation,
99 * [4] allocating ca. 8 chunks per block/page keeps a good balance between
112 #define MAX_SLAB_CHUNK_SIZE(al) (((al)->max_page_size - SLAB_INFO_SIZE) / 8) /* we want at last 8 chunks per page, see [4] */
140 ChunkLink *chunks; member in struct:_SlabInfo
145 ChunkLink *chunks; member in struct:__anon1997
146 gsize count; /* approximative chunks list length *
[all...] |
| /external/bluetooth/glib/gio/ |
| gmemoryinputstream.c | 36 * @short_description: Streaming input operations on memory chunks
41 * memory chunks as input for GIO streaming input operations.
54 GSList *chunks; member in struct:_GMemoryInputStreamPrivate
164 g_slist_foreach (priv->chunks, free_chunk, NULL);
165 g_slist_free (priv->chunks);
261 priv->chunks = g_slist_append (priv->chunks, chunk);
284 for (l = priv->chunks; l; l = l->next)
|
| /bionic/libc/bionic/ |
| dlmalloc.h | 231 ordblks: the number of free chunks
255 MALLINFO_FIELD_TYPE ordblks; /* number of free chunks */
272 independent_calloc(size_t n_elements, size_t element_size, void* chunks[]);
283 The "chunks" argument is optional (i.e., may be null, which is
286 no longer needed. Otherwise, the chunks array must be of at least
288 chunks.
291 null if the allocation failed. If n_elements is zero and "chunks"
326 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]);
329 chunks with sizes indicated in the "sizes" array. It returns
336 The "chunks" argument is optional (i.e., may be null). If it is nul
[all...] |
| dlmalloc.c | 98 ends of chunks) in code that calls malloc. This malloc
111 executions, so externally crafted fake chunks cannot be
176 possibly fragmenting memory used only for large chunks.)
240 Controls the minimum alignment for malloc'ed chunks. It must be a
260 information in the footers of allocated chunks. This adds
426 more large chunks) the value should be high enough so that your
432 program undergoes phases where several large chunks are allocated
434 mixed with phases where there are no such chunks at all. The trim
448 segregates relatively large chunks of memory so that they can be
456 `locked' between other chunks, as can happen with normally allocate
[all...] |
| /external/webkit/WebKitTools/simplejson/ |
| decoder.py | 71 chunks = []
72 _append = chunks.append
109 return u''.join(chunks), end
|
| encoder.py | 352 chunks = list(self.iterencode(o))
353 return ''.join(chunks)
|
| /external/iptables/extensions/ |
| libip6t_sctp.c | 174 const char *chunks)
182 buffer = strdup(chunks);
246 const char *chunks)
248 DEBUGP("Match type: %s Chunks: %s\n", match_type, chunks);
261 parse_sctp_chunk(einfo, chunks);
|
| libipt_sctp.c | 175 const char *chunks)
183 buffer = strdup(chunks);
247 const char *chunks)
249 DEBUGP("Match type: %s Chunks: %s\n", match_type, chunks);
262 parse_sctp_chunk(einfo, chunks);
|
| /external/openssl/crypto/ |
| mem_dbg.c | 660 int chunks; member in struct:mem_leak_st
704 l->chunks++;
767 ml.chunks=0;
771 if (ml.chunks != 0)
773 BIO_printf(b,"%ld bytes leaked in %d chunks\n",
774 ml.bytes,ml.chunks);
|
| /external/protobuf/java/src/main/java/com/google/protobuf/micro/ |
| CodedInputStreamMicro.java | 728 final java.util.Vector chunks = new java.util.Vector(); local
743 chunks.addElement(chunk);
753 // And now all the chunks.
754 for (int i = 0; i < chunks.size(); i++) {
755 byte [] chunk = (byte [])chunks.elementAt(i);
|
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
| /external/webkit/WebCore/rendering/ |
| SVGRenderTreeAsText.cpp | 337 Vector<SVGTextChunk>& chunks = const_cast<Vector<SVGTextChunk>& >(box->svgTextChunks());
338 ts << " at (" << text.x() << "," << text.y() << ") size " << box->width() << "x" << box->height() << " contains " << chunks.size() << " chunk(s)";
368 Vector<SVGTextChunk>& chunks = const_cast<Vector<SVGTextChunk>& >(rootBox->svgTextChunks());
370 Vector<SVGTextChunk>::iterator it = chunks.begin();
371 Vector<SVGTextChunk>::iterator end = chunks.end();
373 // Write text chunks
|
| /external/protobuf/java/src/main/java/com/google/protobuf/ |
| CodedInputStream.java | 790 final List<byte[]> chunks = new ArrayList<byte[]>(); local
805 chunks.add(chunk);
815 // And now all the chunks.
816 for (final byte[] chunk : chunks) {
|
| /external/webkit/WebCore/svg/ |
| SVGTextContentElement.cpp | 297 static Vector<SVGInlineTextBox*> findInlineTextBoxInTextChunks(const SVGTextContentElement* element, const Vector<SVGTextChunk>& chunks)
299 Vector<SVGTextChunk>::const_iterator it = chunks.begin();
300 const Vector<SVGTextChunk>::const_iterator end = chunks.end();
353 // Walk text chunks to find chunks associated with our inline text box
|
| /external/chromium/net/flip/ |
| flip_network_transaction_unittest.cc | 85 // |num_chunks| is the number of chunks to create.
87 MockWrite* chunks = new MockWrite[num_chunks + 1]; local
93 chunks[index] = MockWrite(true, ptr, chunk_size);
95 chunks[num_chunks] = MockWrite(true, 0, 0);
96 return chunks;
[all...] |
| /external/libffi/src/ |
| dlmalloc.c | 71 ends of chunks) in code that calls malloc. This malloc
84 executions, so externally crafted fake chunks cannot be
149 possibly fragmenting memory used only for large chunks.)
213 Controls the minimum alignment for malloc'ed chunks. It must be a
233 information in the footers of allocated chunks. This adds
399 more large chunks) the value should be high enough so that your
405 program undergoes phases where several large chunks are allocated
407 mixed with phases where there are no such chunks at all. The trim
421 segregates relatively large chunks of memory so that they can be
429 `locked' between other chunks, as can happen with normally allocate
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_malloc.c | 107 ends of chunks) in code that calls malloc. This malloc
120 executions, so externally crafted fake chunks cannot be
185 possibly fragmenting memory used only for large chunks.)
249 Controls the minimum alignment for malloc'ed chunks. It must be a
269 information in the footers of allocated chunks. This adds
435 more large chunks) the value should be high enough so that your
441 program undergoes phases where several large chunks are allocated
443 mixed with phases where there are no such chunks at all. The trim
457 segregates relatively large chunks of memory so that they can be
465 `locked' between other chunks, as can happen with normally allocate
[all...] |
| /dalvik/docs/ |
| prettify.js | 61 * @param {Array.<string>} out output buffer that receives chunks of HTML.
373 * successive chunks of text, and will maintain its own internal state to
433 /** split markup into chunks of html tags (style null) and
443 // this will return a list of all chunks which we then classify and wrap as
663 * recursively lex source chunks.
[all...] |
| /external/libvpx/ |
| vpxdec.c | 200 unsigned int chunks; member in struct:input_ctx
217 if(input->chunk >= input->chunks)
233 if(nestegg_packet_count(input->pkt, &input->chunks))
|
