HomeSort by relevance Sort by last modified time
    Searched full:roots (Results 251 - 275 of 577) sorted by null

<<11121314151617181920>>

  /dalvik/vm/alloc/
CardTable.cpp 359 * processing. We treat objects marked from the roots and weak
  /external/chromium_org/base/json/
json_parser.h 47 // objects by using "hidden roots," discussed in the implementation.
  /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ElementShadow.cpp 303 // Only allow reprojecting older shadow roots between the same type to
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
expspeed.c 68 * modular inverse, or modular square roots */
  /external/chromium_org/third_party/openssl/openssl/crypto/ec/
ecp_oct.c 98 * so y is one of the square roots of x^3 + a*x + b.
  /external/chromium_org/v8/src/
global-handles.h 206 // Iterates over all weak roots in heap.
v8threads.cc 335 // Ensure that data containing GC roots are archived first, and handle them
  /external/chromium_org/v8/src/x64/
deoptimizer-x64.cc 305 // Set up the roots register.
  /external/clang/lib/Analysis/
ReachableCode.cpp 305 // blocks as roots.
  /external/llvm/include/llvm/CodeGen/
MachineScheduler.h 113 /// Notify this strategy that all roots have been released (including those
  /external/llvm/include/llvm/IR/
MDBuilder.h 118 /// name. This may be identified (uniqued) with other roots with the same
  /external/openssl/crypto/bn/
expspeed.c 68 * modular inverse, or modular square roots */
  /external/openssl/crypto/ec/
ecp_oct.c 98 * so y is one of the square roots of x^3 + a*x + b.
  /external/v8/src/
heap.h 48 // Defines all the roots in Heap.
81 /* The first 32 roots above this line should be boring from a GC point of */ \
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
arith_routines_logist.c 278 /* convert to magnitude spectrum, by doing square-roots (modified from SPLIB) */
  /frameworks/base/packages/ExternalStorageProvider/src/com/android/externalstorage/
TestDocumentsProvider.java 113 Log.d(TAG, "Someone asked for our roots!");
  /frameworks/support/tests/java/android/support/v4/content/
FileProviderTest.java 73 fail("somehow got uri for file outside roots?");
  /libcore/json/src/main/java/org/json/
JSONStringer.java 176 throw new JSONException("Nesting problem: multiple top-level roots");
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
ExpandableDictionary.java 393 * @param roots node whose children have to be search for matches
407 private void getWordsRec(final NodeArray roots, final WordComposer codes, final char[] word,
410 final int count = roots.mLength;
424 final Node node = roots.mData[i];
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1/
legendre_function.tcc 152 // Two square roots seem more accurate more of the time

Completed in 504 milliseconds

<<11121314151617181920>>