HomeSort by relevance Sort by last modified time
    Searched full:growing (Results 26 - 50 of 126) sorted by null

12 3 4 5 6

  /external/speex/libspeex/
buffer.c 170 /* FIXME: move data/pointers properly for growing the buffer */
  /external/v8/src/
regexp-stack.h 46 // Create and delete an instance to control the life-time of a growing stack.
zone.cc 172 // Limit the size of new segments to avoid growing the segment size
  /external/webkit/WebCore/history/
PageCache.cpp 162 // FIXME: <rdar://problem/5211190> This limit of 42 risks growing the page cache far beyond its nominal capacity.
  /external/icu4c/layout/
LEGlyphStorage.h 81 * The source index while growing the data arrays.
88 * The destination index used while growing the data arrays.
  /external/icu4c/test/intltest/
cntabcol.cpp 64 // range. Also, maybe a silent growing should take place....
  /external/libffi/src/s390/
ffi.c 173 p_fpr: bottom of the FPR area (growing upwards)
174 p_gpr: bottom of the GPR area (growing upwards)
175 p_ov: bottom of the overflow area (growing upwards)
176 p_struct: top of the struct copy area (growing downwards)
  /external/opencore/pvmi/pvmf/include/
pvmf_port_base_impl.h 131 * allocated when the queue grows beyond the reserve size, but will stop growing at
  /external/oprofile/libdb/
odb.h 50 * the hash table (when growing we avoid to copy node array)
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
equivalent.h 109 // G(n) is a very slowly growing function that can be approximated
  /frameworks/base/core/java/android/provider/
SearchRecentSuggestions.java 205 * Reduces the length of the history table, to prevent it from growing too large.
  /dalvik/libcore/xml/src/main/java/org/apache/xpath/axes/
NodeSequence.java 73 * growing until the iterator is walked to exhaustion,
908 * growing list of nodes as they are appended
927 * is complete, or no longer growing.
  /dalvik/libcore/xml/src/main/java/org/apache/xml/utils/
FastStringBuffer.java 407 * Append a single character onto the FastStringBuffer, growing the
470 * growing the storage if necessary.
552 * growing the storage if necessary.
634 * FastStringBuffer, growing the storage if necessary.
717 * this FastStringBuffer, growing the storage if necessary.
    [all...]
SuballocatedIntVector.java 154 // Growing the outer array should be rare. We initialize to a
  /dalvik/libcore/luni/src/main/java/java/util/
Vector.java 230 * Returns the number of elements this vector can hold without growing.
362 * without growing.
366 * before growing.
    [all...]
  /dalvik/libcore/nio/src/main/java/org/apache/harmony/nio/internal/
SelectorImpl.java 291 // to avoid growing too frequently
  /dalvik/vm/
ReferenceTable.c 85 LOGVV("Growing %p from %d to %d\n", pRef, pRef->allocEntries, newSize);
IndirectRefTable.c 176 LOGI("Growing ireftab %p from %d to %d (max=%d)\n",
  /dalvik/vm/alloc/
HeapSource.c 89 Maybe avoid growing small heap, even if there's slack? Look at
711 * Allocates <n> bytes of zeroed data, growing as much as possible
733 * see if we can allocate without actually growing.
    [all...]
  /external/opencore/nodes/pvamrffparsernode/src/
pvmf_amrffparser_port.h 393 * allocated when the queue grows beyond the reserve size, but will stop growing at
  /external/opencore/nodes/streaming/medialayernode/include/
pvmf_medialayer_port.h 325 * allocated when the queue grows beyond the reserve size, but will stop growing at
  /external/opencore/oscl/oscl/osclproc/src/
oscl_timer.h 412 // in real-time rather than with a slower (growing delay) H.223 mux output
  /external/stlport/src/
ios.cpp 84 // Internal functions used for managing exponentially-growing arrays of
  /external/dbus/dbus/
dbus-hash.c 1020 dbus_bool_t growing; local
1027 growing = table->n_entries >= table->hi_rebuild_size;
1032 if (growing)
1060 if (growing)
1079 growing ? "GROW" : "SHRINK",
    [all...]
  /dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
TwoKeyHashMap.java 208 // will keep array from further growing

Completed in 497 milliseconds

12 3 4 5 6