HomeSort by relevance Sort by last modified time
    Searched full:chunk (Results 176 - 200 of 1233) sorted by null

1 2 3 4 5 6 78 91011>>

  /bionic/libc/bionic/
dlmalloc.c 76 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes)
78 Each malloced chunk has a hidden word of overhead holding size
107 If FOOTERS is defined nonzero, then each allocated chunk
166 chooses the best-fitting existing chunk for a request, with ties
170 exactly fitting available chunk by preferring to use space adjacent
225 caught). If FOOTERS is defined, then each chunk carries around a tag
301 set will attempt to check every non-mmapped allocated and free chunk
707 Returns a pointer to a newly allocated chunk of at least n bytes, or
711 If n is zero, malloc returns a minimum-sized chunk. (The minimum
723 Releases the chunk of memory pointed to by p, that had been previousl
    [all...]
  /external/v8/src/
spaces.h 322 // and the chunk number (0 ~ 8K-1). Only MemoryAllocator should use
326 // word *may* (if the page start and large object chunk start are the
327 // same) contain the address of the next large object chunk.
332 // second word *may* (if the page start and large object chunk start are
333 // the same) contain the large object chunk size. In either case, the
434 // Allocates a chunk of memory from the large-object portion of
483 // space). A paged chunk consists of pages. Pages in a chunk have contiguous
486 // The allocator keeps an initial chunk which is used for the new space. The
487 // leftover regions of the initial chunk are used for the initial chunks o
    [all...]
  /external/libffi/src/
dlmalloc.c 49 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes)
51 Each malloced chunk has a hidden word of overhead holding size
80 If FOOTERS is defined nonzero, then each allocated chunk
139 chooses the best-fitting existing chunk for a request, with ties
143 exactly fitting available chunk by preferring to use space adjacent
198 caught). If FOOTERS is defined, then each chunk carries around a tag
274 set will attempt to check every non-mmapped allocated and free chunk
663 Returns a pointer to a newly allocated chunk of at least n bytes, or
667 If n is zero, malloc returns a minimum-sized chunk. (The minimum
679 Releases the chunk of memory pointed to by p, that had been previousl
    [all...]
  /external/qemu/distrib/sdl-1.2.12/src/stdlib/
SDL_malloc.c 85 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes)
87 Each malloced chunk has a hidden word of overhead holding size
116 If FOOTERS is defined nonzero, then each allocated chunk
175 chooses the best-fitting existing chunk for a request, with ties
179 exactly fitting available chunk by preferring to use space adjacent
234 caught). If FOOTERS is defined, then each chunk carries around a tag
310 set will attempt to check every non-mmapped allocated and free chunk
707 Returns a pointer to a newly allocated chunk of at least n bytes, or
711 If n is zero, malloc returns a minimum-sized chunk. (The minimum
723 Releases the chunk of memory pointed to by p, that had been previousl
    [all...]
  /external/qemu/distrib/libpng-1.2.19/
pngpread.c 196 /* First we make sure we have enough data for the 4 byte chunk name
197 * and the 4 byte chunk length before proceeding with decoding the
198 * chunk data. To fully decode each of these chunks, we also make
200 * end of every chunk (except IDAT, which is handled separately).
278 /* If we reach an IDAT chunk, this means we have read all of the
1073 png_warning(png_ptr, "tEXt chunk too large to fit in memory");
    [all...]
  /bootable/recovery/applypatch/
imgdiff.h 17 // Image patch chunk types
  /dalvik/vm/native/
org_apache_harmony_dalvik_ddmc_DdmServer.cpp 28 * Send a DDM chunk to the server.
  /external/chromium/chrome/browser/search_engines/
template_url_parser.h 29 // Decodes the chunk of data representing a TemplateURL. If data does
  /external/chromium/chrome/common/
child_process_logging_mac.mm 21 const char *kUrlChunkFormatStr = "url-chunk-%d";
55 // On Windows the url-chunk items are 1-based, so match that.
75 // On Windows the url-chunk items are 1-based, so match that.
84 // Next chunk.
  /external/chromium/third_party/libjingle/source/talk/base/
md5.h 11 * To compute the message digest of a chunk of bytes, declare an
  /external/elfutils/libelf/
gelf_freechunk.c 1 /* Release uninterpreted chunk of the file contents.
  /external/flac/libFLAC/include/private/
md5.h 15 * To compute the message digest of a chunk of bytes, declare an
  /external/libvpx/
md5_utils.h 12 * To compute the message digest of a chunk of bytes, declare an
  /external/llvm/lib/Target/ARM/
Thumb1RegisterInfo.cpp 145 unsigned Chunk = ((1 << NumBits) - 1) * Scale;
148 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes;
153 Chunk = ((1 << NumBits) - 1) * Scale;
156 NumMIs += Bytes / Chunk;
157 if ((Bytes % Chunk) != 0)
237 unsigned Chunk = (1 << 3) - 1;
238 unsigned ThisVal = (Bytes > Chunk) ? Chunk : Bytes;
253 unsigned Chunk = ((1 << NumBits) - 1) * Scale
    [all...]
  /external/webkit/Source/WebCore/manual-tests/
bugzilla-48077.html 63 <!-- Time consuming job to make HTML parser run over chunk time limit -->
68 <!-- Lots of tags to make HTML parser run over chunk size limit -->
71 <!-- Time consuming job to make HTML parser run over chunk time limit -->
76 <!-- Lots of tags to make HTML parser run over chunk size limit -->
  /frameworks/base/core/jni/
android_backup_BackupHelperDispatcher.cpp 64 // >0 means skip this chunk
72 LOGW("Failed reading chunk header");
82 // >0 means skip this chunk
88 LOGD("chunk header:");
  /frameworks/base/media/libstagefright/include/
SampleIterator.h 67 status_t getChunkOffset(uint32_t chunk, off64_t *offset);
  /frameworks/compile/linkloader/include/impl/
ELFSectionNoBits.hxx 35 if (!result->chunk.allocate(sh->getSize())) {