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

12 3 4 5 6 7 8 9

  /dalvik/vm/alloc/
HeapSource.h 108 * Allocates <n> bytes of zeroed data, growing up to absoluteMaxSize
  /external/antlr/src/org/antlr/runtime/misc/
LookaheadStream.java 37 * to avoid growing a huge buffer.
  /external/e2fsprogs/lib/ext2fs/
res_gdt.c 2 * res_gdt.c --- reserve blocks for growing the group descriptor table
  /external/speex/libspeex/
buffer.c 170 /* FIXME: move data/pointers properly for growing the buffer */
  /external/v8/src/
regexp-stack.h 43 // Create and delete an instance to control the life-time of a growing stack.
zone.cc 175 // Limit the size of new segments to avoid growing the segment size
  /external/v8/test/mjsunit/
array-elements-from-array-prototype.js 161 // Growing array.
array-elements-from-object-prototype.js 161 // Growing array.
array-elements-from-array-prototype-chain.js 161 // Growing array.
  /external/webkit/Tools/iExploder/iexploder-1.7.2/src/
scanner.rb 19 # This is a simple sequential combination creator with a constantly growing width
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
tags.h 178 /** @brief Selects the growing block size variant for std::find().
  /external/chromium/chrome/browser/visitedlink/
visitedlink_master.h 252 // For growing the table. ResizeTableIfNecessary will check to see if the
257 // Resizes the table (growing or shrinking) as necessary to accomodate the
  /external/clang/include/clang/Basic/
SourceLocation.h 77 /// and growing upwards, contains all buffers from this module. The other,
78 /// starting at the highest possible offset and growing downwards, contains
  /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/chromium/base/
stack_container.h 123 // initial capacity of the vector is based on. Growing the container beyond the
  /external/chromium/chrome/browser/debugger/
devtools_netlog_observer.cc 167 // Prevents us from passively growing the memory unbounded in
  /external/dbus/tools/
dbus-print-message.c 103 * manually growing a string chunk by chunk.
  /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/oprofile/libdb/
odb.h 50 * the hash table (when growing we avoid to copy node array)
  /external/oprofile/libregex/
op_regex.cpp 168 // FIXME limit output string size ? (cause we can have exponential growing
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
equivalent.h 109 // G(n) is a very slowly growing function that can be approximated
  /external/webkit/Source/JavaScriptCore/wtf/
StackBounds.cpp 71 // This method assumes the stack is growing downwards.
  /frameworks/base/core/java/android/provider/
SearchRecentSuggestions.java 217 * Reduces the length of the history table, to prevent it from growing too large.
  /external/apache-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.

Completed in 5392 milliseconds

12 3 4 5 6 7 8 9