Searched defs:mid (Results 76 - 100 of 256) sorted by path

1234567891011

/external/chromium_org/third_party/skia/src/animator/
H A DSkParseSVGPath.cpp32 SkPoint c,j,k,l,m,n,o,p,q, mid; local
43 midPt(mid,m,n);
44 fPath.quadTo(mid,q);
49 midPt(mid,m,n);
50 fPath.quadTo(mid,p2);
/external/chromium_org/third_party/skia/src/core/
H A DSkGlyphCache.cpp296 int mid = (hi + lo) >> 1; local
297 if (gptr[mid]->fID < id) {
298 lo = mid + 1;
300 hi = mid;
H A DSkPath.cpp1012 // The mid point of the quadratic arc approximation is half way between the two
1014 const SkScalar mid = 1 - (SK_Scalar1 + SK_ScalarTanPIOver8) / 2; local
1015 SkScalar midPtX = rx * mid;
1016 SkScalar midPtY = ry * mid;
2157 // with a mid point outset by 2x float epsilon in tests had an error
2635 SkScalar mid;
2638 mid = SkScalarAve(minT, maxT);
2639 SkScalar delta = eval_cubic_coeff(A, B, C, D, mid);
2641 minT = mid;
2644 maxT = mid;
[all...]
H A DSkStrokerPriv.cpp168 SkVector mid; local
196 mid.set(SkScalarMul(before.fX + after.fX, radius),
216 // choose the most accurate way to form the initial mid-vector
219 mid.set(after.fY - before.fY, before.fX - after.fX);
221 mid.negate();
224 mid.set(before.fX + after.fX, before.fY + after.fY);
226 mid.setLength(SkScalarDiv(radius, sinHalfAngle));
229 outer->setLastPt(pivot.fX + mid.fX, pivot.fY + mid.fY);
231 outer->lineTo(pivot.fX + mid
[all...]
H A DSkTSearch.cpp32 int mid = (hi + lo) >> 1; local
33 const char* elem = index_into_base(base, mid, elemSize);
37 lo = mid + 1;
39 hi = mid;
41 return mid;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp122 SkDPoint mid = q2.ptAtT(tMid); local
124 line[0] = line[1] = mid;
141 if (!pt2.approximatelyEqual(mid)) {
237 SkDVector mid = q[1] - q[0]; local
240 return fabs(mid.cross(dxy) / length);
H A DSkIntersectionHelper.h87 double mid = (t1 + t2) / 2; local
88 SkDPoint midPtByT = segment.dPtAtT(mid);
H A DSkPathOpsCommon.cpp41 const double mid = *midPtr; local
43 double tAtMid = current->tAtMid(index, endIndex, mid);
80 double midT = current->tAtMid(index, endIndex, mid);
84 SkDebugf("%s [%d] mid=%1.9g->%1.9g s=%1.9g (%1.9g,%1.9g) m=%1.9g (%1.9g,%1.9g)"
86 current->debugID(), mid, newMid,
88 baseT + mid * (endT - baseT), midXY.fX, midXY.fY,
120 *bestHit = baseT + mid * (endT - baseT);
H A DSkPathOpsCubic.cpp382 SkDPoint mid = ptAtT(t); local
383 if (topPt.fY > mid.fY || (topPt.fY == mid.fY && topPt.fX > mid.fX)) {
384 topPt = mid;
/external/chromium_org/third_party/skia/src/ports/
H A DSkFontHost_win.cpp184 int32_t mid = min + ((max - min) / 2); local
185 if (GetGlyphOutlineW(hdc, mid, GGO_METRICS | GGO_GLYPH_INDEX, &gm, 0,
187 max = mid;
189 min = mid + 1;
/external/chromium_org/third_party/skia/src/utils/
H A DSkParseColor.cpp407 int mid = (hi + lo) >> 1; local
408 while ((int) gColorNames[mid] >= 0)
409 --mid;
411 while (gColorNames[mid] == *sixMatchPtr) {
412 ++mid;
414 *color = gColorNames[mid] | 0xFF000000;
420 int midMask = gColorNames[mid] & ~0x80000000;
422 lo = mid + 2; // skip color
425 } else if (hi == mid)
428 hi = mid;
[all...]
/external/chromium_org/third_party/skia/src/views/unix/
H A Dkeysym2ucs.c822 int mid; local
835 mid = (min + max) / 2;
836 if (keysymtab[mid].keysym < keysym)
837 min = mid + 1;
838 else if (keysymtab[mid].keysym > keysym)
839 max = mid - 1;
842 return keysymtab[mid].ucs;
/external/chromium_org/third_party/skia/tests/
H A DPathOpsDLineTest.cpp50 SkDPoint mid = line.ptAtT(.5); local
51 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX));
52 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY));
/external/chromium_org/v8/src/
H A Dlist-inl.h223 int mid = (low + high) / 2; local
224 T mid_elem = list[mid];
227 high = mid - 1;
231 low = mid + 1;
235 return mid;
H A Dobjects-inl.h2769 int mid = (low + high) / 2; local
2770 Name* mid_name = array->GetSortedKey(mid);
2774 high = mid;
2776 low = mid + 1;
H A Dunicode.cc59 unsigned int mid = low + ((high - low) >> 1); local
60 uchar current_value = GetEntry(TableGet<kEntryDist>(table, mid));
64 (mid + 1 == size ||
65 GetEntry(TableGet<kEntryDist>(table, mid + 1)) > value)) {
66 low = mid;
69 low = mid + 1;
73 if (mid == 0) break;
74 high = mid - 1;
115 unsigned int mid = low + ((high - low) >> 1); local
116 uchar current_value = GetEntry(TableGet<kEntryDist>(table, mid));
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-run-machops.cc3411 MLabel blocka, blockb, mid, blockd, blocke, end; local
3418 m.Goto(&mid);
3420 m.Goto(&mid);
3421 m.Bind(&mid);
/external/compiler-rt/lib/asan/
H A Dasan_poisoning.cc322 uptr mid = reinterpret_cast<uptr>(mid_p); local
323 CHECK_LE(beg, mid);
324 CHECK_LE(mid, end);
325 // Check some bytes starting from beg, some bytes around mid, and some bytes
329 uptr r1_end = Min(end + kMaxRangeToCheck, mid);
330 uptr r2_beg = Max(beg, mid - kMaxRangeToCheck);
331 uptr r2_end = Min(end, mid + kMaxRangeToCheck);
332 uptr r3_beg = Max(end - kMaxRangeToCheck, mid);
337 for (uptr i = r2_beg; i < mid; i++)
340 for (uptr i = mid;
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_allocator.h1142 uptr mid = (beg + end) / 2; // Invariant: mid >= beg + 1 local
1143 if (p < reinterpret_cast<uptr>(chunks_[mid]))
1144 end = mid - 1; // We are not interested in chunks_[mid].
1146 beg = mid; // chunks_[mid] may still be what we want.
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_mutex.cc54 uptr addr, u64 mid) {
61 rep.AddMutex(mid);
118 u64 mid = s->GetId(); local
126 rep.AddMutex(mid);
143 thr->mset.Remove(mid);
181 u64 mid = s->GetId(); local
185 ReportMutexMisuse(thr, pc, ReportTypeMutexDoubleLock, addr, mid);
222 u64 mid = s->GetId(); local
226 ReportMutexMisuse(thr, pc, ReportTypeMutexBadUnlock, addr, mid);
258 u64 mid local
53 ReportMutexMisuse(ThreadState *thr, uptr pc, ReportType typ, uptr addr, u64 mid) argument
289 u64 mid = s->GetId(); local
337 u64 mid = s->GetId(); local
[all...]
H A Dtsan_rtl_report.cc186 u64 mid = this->AddMutex(d.id); local
187 ReportMopMutex mtx = {mid, d.write};
281 u64 mid = id; local
288 mid = s->uid;
295 return mid;
/external/compiler-rt/test/asan/TestCases/
H A Dcontiguous_container.cc14 char *mid = beg + capacity; local
20 old_mid = mid;
21 mid = beg + size;
22 __sanitizer_annotate_contiguous_container(beg, end, old_mid, mid);
28 assert(__sanitizer_verify_contiguous_container(beg, mid, end));
29 if (mid != beg)
30 assert(!__sanitizer_verify_contiguous_container(beg, mid - 1, end));
31 if (mid != end)
32 assert(!__sanitizer_verify_contiguous_container(beg, mid + 1, end));
36 __sanitizer_annotate_contiguous_container(beg, end, mid, en
[all...]
/external/deqp/modules/gles2/performance/
H A Des2pShaderOperatorTests.cpp398 const Vec2 mid = mean(data); local
405 const Vec2 diff = data[i] - mid;
412 const float offset = mid.y() - slope*mid.x();
/external/deqp/modules/gles3/performance/
H A Des3pShaderOperatorTests.cpp398 const Vec2 mid = mean(data); local
405 const Vec2 diff = data[i] - mid;
412 const float offset = mid.y() - slope*mid.x();
/external/deqp/modules/glshared/
H A DglsCalibration.cpp50 const typename vector<T>::iterator mid = data.begin()+data.size()/2; local
52 std::nth_element(data.begin(), mid, data.end());
55 return (*mid + *std::max_element(data.begin(), mid))*0.5f; // Data is partially sorted around mid, mid is half an item after center
57 return *mid;

Completed in 569 milliseconds

1234567891011