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

12 3 4 5 6 7 8 91011>>

  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/
_bisect.so 
  /external/brotli/dec/
huffman.h 40 /* Builds Huffman lookup table assuming code lengths are in symbol order. */
44 /* Builds Huffman lookup table assuming code lengths are in symbol order. */
  /external/clang/test/Analysis/diagnostics/
deref-track-symbolic-region.cpp 13 //expected-note@-2{{Assuming 'p' is null}}
21 // expected-note@-1{{Assuming 'ptr' is null}}
text-diagnostics.c 18 // CHECK-NEXT: text-diagnostics.c:[[@LINE-5]]:7: note: Assuming 'q' is null
  /external/llvm/test/CodeGen/X86/
gs-fold.ll 15 ; Check that we are not assuming that gs contains the address of gs if we are not targeting Linux
18 ; Check that we are assuming that gs contains the address of gs if we are targeting Linux
  /external/eigen/Eigen/src/Core/
NoAlias.h 18 * \brief Pseudo expression providing an operator = assuming no aliasing
23 * assuming no aliasing between the target expression and the source expression.
72 /** \returns a pseudo expression of \c *this with an operator= assuming
  /build/soong/cc/
sabi.go 46 // Assuming the filter is small enough.
67 // Assuming that the cflags which clang LibTooling tools cannot
  /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Universal/BdsDxe/BootMaint/
BBSsupport.h 47 Assuming [Harddisk1 CdRom2 Efi1] is ordered properly
51 Assuming [Efi1 Efi0 CdRom1 Harddisk0] is ordered properly
  /external/vboot_reference/tests/futility/
run_test_scripts.sh 22 yellow "Assuming BUILD=$BUILD"
27 yellow "Assuming SRCDIR=$SRCDIR"
  /art/test/656-loop-deopt/src/
Main.java 54 // So the deoptimization at the inline cache was incorrectly assuming
72 // So the deoptimization at the inline cache was incorrectly assuming
90 // So the deoptimization at the inline cache was incorrectly assuming
108 // So the deoptimization at the inline cache was incorrectly assuming
  /bionic/libc/tzcode/
difftime.c 22 ** (assuming that the larger type has more precision).
  /bionic/tests/
gtest_globals.cpp 27 // Calculate ANDROID_DATA assuming the binary is in "$ANDROID_DATA/somedir/binary-dir/binary"
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_ttk_guionly.py 14 # assuming ttk is not available
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
_bisectmodule.c 61 Return the index where to insert item x in list a, assuming a is sorted.\n\
102 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
162 Return the index where to insert item x in list a, assuming a is sorted.\n\
203 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
  /device/linaro/bootloader/edk2/QuarkSocPkg/QuarkNorthCluster/MemoryInit/Pei/
mrc.c 30 // configure uart base address assuming code relocated to eSRAM
  /external/autotest/tko/
tko.proto 52 optional string afe_parent_job_id = 16; // If none, assuming parent job.
  /external/bison/m4/
double-slash-root.m4 24 gl_cv_double_slash_root='unknown, assuming no' ;;
  /external/bison/po/
en@boldquot.header 24 # bold face, assuming the VT100/XTerm escape sequences.
  /external/bison/runtime-po/
en@boldquot.header 24 # bold face, assuming the VT100/XTerm escape sequences.
  /external/clang/test/Analysis/
keychainAPI-diagnostic-visitor.m 30 if (st == noErr) // expected-note {{Assuming 'st' is equal to noErr}} // expected-note{{Taking true branch}}
  /external/clang/test/CodeGenObjC/
debug-info-ivars-indirect.m 6 // This happens to be the order the members are emitted in... I'm assuming it's
  /external/e2fsprogs/po/
en@boldquot.header 24 # bold face, assuming the VT100/XTerm escape sequences.
  /external/elfutils/
README 4 This leaves byte ordering aside. While assuming this the code can be
  /external/elfutils/po/
en@boldquot.header 24 # bold face, assuming the VT100/XTerm escape sequences.
  /external/iptables/include/linux/netfilter_ipv4/
ipt_ULOG.h 23 * Assuming a standard ethernet-mtu of 1500, we could define this up

Completed in 643 milliseconds

12 3 4 5 6 7 8 91011>>