| /prebuilts/clang/host/linux-x86/clang-3859424/lib64/clang/4.0/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/lib64/clang/5.0/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/compiler-rt/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/lib64/clang/5.0.1/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/lib64/clang/5.0.2/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/lib64/clang/6.0.1/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/lib64/clang/6.0.1/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/lib64/clang/6.0.1/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/lib64/clang/6.0.2/include/sanitizer/ |
| common_interface_defs.h | 72 // [beg, end); the memory [beg, mid) is used to store the current elements
73 // and the memory [mid, end) is reserved for future elements;
74 // beg <= mid <= end. For example, in "std::vector<> v"
77 // mid = beg + v.size() * sizeof(v[0]);
80 // container so that the tool can report errors when memory from [mid, end)
82 // Supply the old and the new values of mid (old_mid/new_mid).
83 // In the initial state mid == end and so should be the final
104 // - [beg, mid) is addressable,
105 // - [mid, end) is unaddressable.
107 // such complexity by touching only parts of the container around beg/mid/end
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| Site.java | 51 private long mId = -1;
206 mId = id++;
382 return mId;
393 if (id == mId) {
401 int mid = start + ((end - start) / 2); local
402 Site midSite = mChildren.get(mid);
403 if (id < midSite.mId) {
404 end = mid;
405 } else if (mid + 1 == end) {
409 } else if (id < mChildren.get(mid + 1).mId)
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/ |
| RunQueue.h | 126 unsigned mid = back; local
127 if (size > 1) mid = back + (size - 1) / 2;
130 for (; static_cast<int>(mid - back) >= 0; mid--) {
131 Elem* e = &array_[mid & kMask];
138 start = mid;
|
| /frameworks/base/core/jni/ |
| android_animation_PropertyValuesHolder.cpp | 36 jmethodID mid = env->GetMethodID(targetClass, nativeString, "(I)V"); local
38 return reinterpret_cast<jlong>(mid);
45 jmethodID mid = env->GetMethodID(targetClass, nativeString, "(F)V"); local
47 return reinterpret_cast<jlong>(mid);
58 jmethodID mid = env->GetMethodID(targetClass, nativeString, signature); local
61 return reinterpret_cast<jlong>(mid);
|
| /external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/ |
| UConverterAlias.java | 188 int mid, start, limit; local
200 mid = limit;
204 mid = (start + limit) / 2;
205 if (lastMid == mid) { /* Have we moved? */
208 lastMid = mid;
209 aliasToCompare = GET_NORMALIZED_STRING(gAliasList[mid]);
213 limit = mid;
215 start = mid;
222 if ((gUntaggedConvArray[mid] & AMBIGUOUS_ALIAS_MAP_BIT) != 0) {
230 && ((gMainTable.untaggedConvArray[mid] & UCNV_CONTAINS_OPTION_BIT) != 0)
[all...] |
| /external/skia/src/utils/ |
| SkParseColor.cpp | 406 int mid = (hi + lo) >> 1; local
407 while ((int) gColorNames[mid] >= 0)
408 --mid;
410 while (gColorNames[mid] == *sixMatchPtr) {
411 ++mid;
413 *color = gColorNames[mid] | 0xFF000000;
419 int midMask = gColorNames[mid] & ~0x80000000;
421 lo = mid + 2; // skip color
424 } else if (hi == mid)
427 hi = mid;
[all...] |
| /external/skqp/src/utils/ |
| SkParseColor.cpp | 406 int mid = (hi + lo) >> 1; local
407 while ((int) gColorNames[mid] >= 0)
408 --mid;
410 while (gColorNames[mid] == *sixMatchPtr) {
411 ++mid;
413 *color = gColorNames[mid] | 0xFF000000;
419 int midMask = gColorNames[mid] & ~0x80000000;
421 lo = mid + 2; // skip color
424 } else if (hi == mid)
427 hi = mid;
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/binutils/ |
| addr2liner_nm.go | 104 mid := (low + high) / 2
105 v := a.m[mid].address
107 low = mid
110 low = mid
112 high = mid
|
| /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/binutils/ |
| addr2liner_nm.go | 104 mid := (low + high) / 2
105 v := a.m[mid].address
107 low = mid
110 low = mid
112 high = mid
|
| /external/syslinux/core/fs/xfs/ |
| xfs_dir2.c | 357 int mid = 0; local
392 mid = (low + high) >> 1;
393 if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant)
396 low = mid + 1;
398 high = mid - 1;
407 while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant)
408 mid--;
410 for (lep = &leaf->ents[mid];
411 mid < be16_to_cpu(leaf->hdr.count) &
613 int mid = 0; local
[all...] |
| /external/jemalloc/test/src/ |
| SFMT.c | 644 int mid; local
663 mid = (size - lag) / 2;
671 r = func1(psfmt32[idxof(0)] ^ psfmt32[idxof(mid)]
673 psfmt32[idxof(mid)] += r;
675 psfmt32[idxof(mid + lag)] += r;
680 r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
682 psfmt32[idxof((i + mid) % N32)] += r;
684 psfmt32[idxof((i + mid + lag) % N32)] += r;
689 r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)]
691 psfmt32[idxof((i + mid) % N32)] += r
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Arrays.java | 1352 int mid = (low + high) >>> 1; local
1759 int mid = (low + high) >>> 1; local
1840 int mid = (low + high) >>> 1; local
1921 int mid = (low + high) >>> 1; local
2002 int mid = (low + high) >>> 1; local
2083 int mid = (low + high) >>> 1; local
2166 int mid = (low + high) >>> 1; local
2257 int mid = (low + high) >>> 1; local
2363 int mid = (low + high) >>> 1; local
2471 int mid = (low + high) >>> 1; local
[all...] |
| /external/libunwind_llvm/src/ |
| UnwindCursor.hpp | 1011 uint32_t mid = (low + high) \/ 2; local
1061 uint32_t mid = (low + high) \/ 2; local
1116 uint32_t mid = (low + high) \/ 2; local
1184 uint32_t mid = (low + high) \/ 2; local
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_poisoning.cc | 384 uptr mid = reinterpret_cast<uptr>(mid_p); local
385 CHECK_LE(beg, mid);
386 CHECK_LE(mid, end);
387 // Check some bytes starting from beg, some bytes around mid, and some bytes
391 uptr r1_end = Min(end + kMaxRangeToCheck, mid);
392 uptr r2_beg = Max(beg, mid - kMaxRangeToCheck);
393 uptr r2_end = Min(end, mid + kMaxRangeToCheck);
394 uptr r3_beg = Max(end - kMaxRangeToCheck, mid);
399 for (uptr i = r2_beg; i < mid; i++)
402 for (uptr i = mid; i < r2_end; i++
[all...] |
| /external/valgrind/coregrind/ |
| m_rangemap.c | 176 Word mid = (lo + hi) / 2; local
177 Range* mid_rng = (Range*)VG_(indexXA)(ranges, mid);
180 if (key < key_mid_min) { hi = mid-1; continue; }
181 if (key > key_mid_max) { lo = mid+1; continue; }
182 return mid;
|
| /frameworks/opt/setupwizard/library/main/src/com/android/setupwizardlib/items/ |
| ItemGroup.java | 44 final int mid = (lo + hi) >>> 1; local
45 final int midVal = array.valueAt(mid);
48 lo = mid + 1;
50 hi = mid - 1;
52 return array.keyAt(mid); // value found
|
| /packages/apps/TV/src/com/android/tv/dvr/ui/ |
| SortedArrayAdapter.java | 224 int mid = (lb + ub) / 2; local
225 T r = (T) get(mid);
228 return mid;
230 lb = mid + 1;
232 ub = mid - 1;
|
