HomeSort by relevance Sort by last modified time
    Searched full:grow (Results 376 - 400 of 765) sorted by null

<<11121314151617181920>>

  /system/core/libpixelflinger/tinyutils/
VectorImpl.cpp 284 // LOGV("grow vector %p, new_capacity=%d", this, (int)new_capacity);
  /external/chromium/chrome/browser/visitedlink/
visitedlink_master.cc 739 const float max_table_load = 0.5f; // Grow when we're > this full.
748 // Table needs to grow or shrink.
    [all...]
  /external/flac/libFLAC/
bitwriter.c 132 * leads to this call) that we don't actually need to grow
575 /* burying the capacity check down here means we have to grow the buffer a little if there are more vals to do */
  /external/icu4c/i18n/unicode/
msgfmt.h     [all...]
  /external/llvm/lib/CodeGen/
LiveInterval.cpp 278 // If LR is a complete superset of an interval, we may need to grow its
682 EqClass.grow(LI->getNumValNums());
  /external/qemu/block/
qcow2-refcount.c 294 * If we come here, we need to grow the refcount table. Again, a new
330 fprintf(stderr, "qcow2: Grow refcount table %" PRId32 " => %" PRId64 "\n",
    [all...]
  /external/quake/quake/src/QW/client/
zone.c 621 return; // there is space to grow the hunk
644 return; // there is space to grow the hunk
  /external/quake/quake/src/WinQuake/
zone.cpp 616 return; // there is space to grow the hunk
639 return; // there is space to grow the hunk
  /external/tremolo/Tremolo/
framing.c 110 /* if the unused buffer is too small, grow it */
159 /* if the unused buffer is too small, grow it */
  /external/webkit/Source/JavaScriptCore/wtf/
Vector.h 568 void grow(size_t size);
865 void Vector<T, inlineCapacity>::grow(size_t size) function in class:WTF::Vector::Vector
    [all...]
  /libcore/luni/src/main/java/java/util/
HashMap.java 513 * specified number of mappings, with room to grow. If not, it increases the
516 * can grow the table by factors of 2^n for n > 1. Hopefully, a single call
    [all...]
Hashtable.java 432 * specified number of mappings, with room to grow. If not, it increases the
435 * can grow the table by factors of 2^n for n > 1. Hopefully, a single call
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
PriorityBlockingQueue.java 239 * Tries to grow array to accommodate at least one more element
255 (oldCap + 2) : // grow faster if small
    [all...]
  /external/webkit/Source/WebKit/android/nav/
CacheBuilder.cpp     [all...]
  /external/mesa3d/src/glsl/
glsl_lexer.cpp 220 * and can realloc() it to grow it, and should free() it to
    [all...]
  /external/webkit/Source/ThirdParty/ANGLE/src/compiler/
glslang_lex.cpp 242 * and can realloc() it to grow it, and should free() it to
    [all...]
  /external/dbus/dbus/
dbus-hash.c 1040 return; /* can't grow anymore */
1080 growing ? "GROW" : "SHRINK",
    [all...]
  /external/dropbear/libtommath/pre_gen/
mpi.c 238 /* grow a as required */
420 /* grow the destination as required */
524 /* grow the destination as required */
627 /* grow the destination as required */
742 /* grow a to accomodate the single bit */
892 /* grow c as required */
    [all...]
  /external/bison/src/
scan-gram.c 244 * and can realloc() it to grow it, and should free() it to
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/utils/
FastStringBuffer.java 37 * flow across to it. (The array of chunks may need to grow,
137 * reallocated when necessary in order to allow the buffer to grow;
    [all...]
  /external/icu4c/test/cintltst/
trie2test.c     [all...]
  /external/kernel-headers/original/linux/
skbuff.h 985 * the header has to grow. In the default case, if the header has to grow
    [all...]
  /external/protobuf/src/google/protobuf/
repeated_field.h 737 // The array is completely full with no cleared objects, so grow it.
742 // cleared objects awaiting reuse. We don't want to grow the array in this
    [all...]
  /external/qemu/
qemu-io.c     [all...]
  /external/v8/src/
liveedit.cc     [all...]

Completed in 3240 milliseconds

<<11121314151617181920>>