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

<<11121314151617181920>>

  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp     [all...]
  /external/llvm/lib/Target/AArch64/
AArch64BranchRelaxation.cpp 66 /// inline assembly, this is a worst case estimate.
  /external/llvm/lib/Target/X86/
X86ScheduleAtom.td 424 // worst case for mov REG_CRx
  /external/llvm/unittests/ADT/
TinyPtrVectorTest.cpp 28 // The world's worst RNG, but it is deterministic and makes it easy to get
  /external/mesa3d/src/mesa/drivers/dri/r200/
r200_tcl.c 289 * Prediction has to aim towards the best possible value that is worse than worst case scenario
  /external/mesa3d/src/mesa/tnl/
t_vertex_sse.c 427 /* Potentially the worst case - hardcode 2+1 copying:
  /external/okhttp/okhttp-urlconnection/src/main/java/com/squareup/okhttp/internal/huc/
HttpURLConnectionImpl.java 138 // connection will close its streams directly. If it doesn't, the worst
  /external/pdfium/core/include/fxcrt/
fx_string.h 304 // To ensure ref counts do not overflow, consider the worst possible case:
  /external/regex-re2/re2/
regexp.cc 649 // Assume worst-case space and then trim.
  /external/skia/tools/
skdiff_main.cpp 594 "\n --sortbymaxmismatch: sort by worst color channel mismatch;"
  /external/tagsoup/
README 11 to even the worst HTML. TagSoup also includes a command-line processor
  /external/v8/src/
bignum.cc 334 // In the worst case we have to accumulate nb-digits products of digit*digit.
json-stringifier.h 629 // serialized without allocating a new string part. The worst case length of
  /external/v8/src/heap/
store-buffer.cc 528 // the worst case (compaction doesn't eliminate any pointers).
  /external/valgrind/VEX/priv/
host_amd64_defs.h 821 worst case we will merely assert at startup. */
host_mips_defs.h 717 worst case we will merely assert at startup. */
host_x86_defs.h 752 worst case we will merely assert at startup. */
  /external/vboot_reference/tests/
rollback_index2_tests.c 32 * overrun the buffer the worst that's likely to happen is we'll crash
  /external/vboot_reference/utility/
bmpblk_utility.cc 430 // Calculate the worst case of buffer size.
  /external/webrtc/webrtc/modules/audio_processing/utility/
delay_estimator.c 579 // 1) If the difference bit counts between the best and the worst delay
  /external/wpa_supplicant_8/src/wps/
httpread.c 484 /* ensure we have enough room for worst case for body
  /frameworks/base/core/java/android/app/
DialogFragment.java 458 // after the activity is paused. Worst case, when the user comes
  /frameworks/base/core/java/android/util/
ArraySet.java 517 // (except for hash collisions, which means worst case still n*m), then do one
  /frameworks/base/core/java/com/android/internal/view/menu/
IconMenuView.java 194 * all of the items' titles. Worst case, we use mMaxRows.
  /frameworks/base/graphics/java/android/graphics/drawable/
RippleDrawable.java 244 // Worst-case scenario.
    [all...]

Completed in 1281 milliseconds

<<11121314151617181920>>