HomeSort by relevance Sort by last modified time
    Searched defs:chunks (Results 1 - 14 of 14) sorted by 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;
  /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/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/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)
  /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...]
  /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/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/
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/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/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:__anon2164
146 gsize count; /* approximative chunks list length *
    [all...]
  /external/elfcopy/
dwarf.c 3072 Frame_Chunk *chunks = 0; local
    [all...]
  /external/libpcap/
gencode.c 156 * We divy out chunks of memory rather than call malloc each time so
170 static struct chunk chunks[NCHUNKS]; variable in typeref:struct:chunk
270 cp = &chunks[cur_chunk];
295 if (chunks[i].m != NULL) {
296 free(chunks[i].m);
297 chunks[i].m = NULL;
    [all...]
  /cts/tools/signature-tools/lib/
stringtemplate.jar 

Completed in 376 milliseconds