/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/wpa_supplicant_8/hostapd/src/tls/ |
H A D | libtommath.c | 1192 register mp_digit *bottom, *top; local 1196 /* bottom */ 1197 bottom = a->dp; 1204 * the top of the window are copied to the bottom 1213 *bottom++ = *top++; 1218 *bottom++ = 0; 1520 register mp_digit *top, *bottom; local 1529 bottom = a->dp + a->used - 1 - b; 1533 * the bottom to the top. see bn_mp_rshd.c for more info. 1536 *top-- = *bottom [all...] |
/external/wpa_supplicant_8/src/tls/ |
H A D | libtommath.c | 1192 register mp_digit *bottom, *top; local 1196 /* bottom */ 1197 bottom = a->dp; 1204 * the top of the window are copied to the bottom 1213 *bottom++ = *top++; 1218 *bottom++ = 0; 1520 register mp_digit *top, *bottom; local 1529 bottom = a->dp + a->used - 1 - b; 1533 * the bottom to the top. see bn_mp_rshd.c for more info. 1536 *top-- = *bottom [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/tls/ |
H A D | libtommath.c | 1192 register mp_digit *bottom, *top; local 1196 /* bottom */ 1197 bottom = a->dp; 1204 * the top of the window are copied to the bottom 1213 *bottom++ = *top++; 1218 *bottom++ = 0; 1520 register mp_digit *top, *bottom; local 1529 bottom = a->dp + a->used - 1 - b; 1533 * the bottom to the top. see bn_mp_rshd.c for more info. 1536 *top-- = *bottom [all...] |
/external/valgrind/main/callgrind/ |
H A D | global.h | 580 fn_node **bottom, **top; member in struct:_fn_stack
|
/external/skia/samplecode/ |
H A D | SampleHairline.cpp | 70 int bottom = bm.height() - i - 1; local 71 if (!check_zeros(bm.getAddr32(0, bottom), bm.width(), 1)) {
|
H A D | SampleRegion.cpp | 124 static void make_rgn(SkRegion* rgn, int left, int top, int right, int bottom, argument 127 r.set(left, top, right, bottom);
|
/external/skia/src/core/ |
H A D | SkAAClip.cpp | 122 int bottom() const { return fBottom; } function in class:SkAAClip::Iter 525 // Look to trim away empty rows from the bottom. 536 // removing from the bottom is easier than from the top, as we don't 551 // making us valid after the Builder. Since we build from top to bottom, its 839 bool SkAAClip::quickContains(int left, int top, int right, int bottom) const { 843 if (!fBounds.contains(left, top, right, bottom)) { 854 if (lastY < bottom) { 1344 typedef void (*RowProc)(SkAAClip::Builder&, int bottom, 1523 botA = iter.bottom(); 1537 int botA = iterA.bottom(); [all...] |
H A D | SkBBoxRecord.cpp | 101 // Pad top and bottom with max extents from FontMetrics 211 SkScalar bottom = flatPaintData->topBot()[1]; local 212 SkScalar pad = top - bottom; 233 bbox.fBottom = bottom + constY;
|
H A D | SkCanvas.cpp | 1111 devCull.x(), devCull.y(), devCull.right(), devCull.bottom(), 1113 fCullStack.top().right(), fCullStack.top().bottom())); 2404 SkScalar right, SkScalar bottom, 2408 r.set(left, top, right, bottom); 2403 drawRectCoords(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom, const SkPaint& paint) argument
|
H A D | SkDraw.cpp | 1425 int bottom = top + glyph.fHeight; local 1431 mask.fBounds.set(left, top, right, bottom); 1435 if (!state.fClipBounds.containsNoEmptyCheck(left, top, right, bottom)) {
|
H A D | SkPath.cpp | 73 SkScalar right, SkScalar bottom) { 74 fRect.set(left, top, right, bottom); 416 SkScalar bottom = pts->fY; local 418 if (left != right && top != bottom) { 421 if (left == right && top == bottom) { 424 nextDirection = rect_make_dir(right - left, bottom - top); 835 SkScalar bottom, Direction dir) { 840 SkAutoPathBoundsUpdate apbu(this, left, top, right, bottom); 846 this->lineTo(left, bottom); 847 this->lineTo(right, bottom); 72 SkAutoPathBoundsUpdate(SkPath* path, SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument 834 addRect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom, Direction dir) argument [all...] |
H A D | SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument 14 if (left >= right || top >= bottom) { 20 this->set(left, top, right, bottom); 25 if (bottom > fBottom) fBottom = bottom; 103 SkScalar bottom) { 104 if (left < right && top < bottom && !this->isEmpty() && // check for empties 105 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 110 if (fBottom > bottom) fBottom = bottom; 102 intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument 152 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
H A D | SkRegion.cpp | 54 assert_sentinel(runs[1], false); // bottom 144 int32_t right, int32_t bottom) { 145 if (left >= right || top >= bottom) { 149 fBounds.set(left, top, right, bottom); 242 // trim off any empty spans from the top and bottom 247 assert_sentinel(runs[1], false); // bottom 252 runs[0] = runs[-2]; // set new top to prev bottom 263 if (stop[-5] == SkRegion::kRunTypeSentinel) { // eek, stop[-4] was a bottom with no x-runs 271 assert_sentinel(stop[-6], false); // last bottom 561 int bottom local 143 setRect(int32_t left, int32_t top, int32_t right, int32_t bottom) argument 773 addSpan(int bottom, const SkRegion::RunType a_runs[], const SkRegion::RunType b_runs[]) argument [all...] |
H A D | SkRegionPriv.h | 154 int bottom = runs[0]; local 157 SkASSERT(bottom < SkRegion::kRunTypeSentinel); 158 if (y < bottom) {
|
H A D | SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom 40 * @param bottom the one based index in the array of the last entry in the heap. 43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) { argument 47 while (j <= bottom) { 48 if (j < bottom && lessThan(array[j-1], array[j])) { 68 /* Sifts a broken heap. The input array is a heap from root to bottom 74 * @param bottom the one based index in the array of the last entry in the heap. 77 void SkTHeapSort_SiftDown(T array[], size_t root, size_t bottom, C lessThan) { argument 80 while (child <= bottom) { 81 if (child < bottom [all...] |
/external/skia/src/effects/ |
H A D | SkLightingImageFilter.cpp | 168 int bottom = bounds.bottom(); local 195 for (++y; y < bottom - 1; ++y) { 224 const SkPMColor* row0 = src.getAddr32(x, bottom - 2); 225 const SkPMColor* row1 = src.getAddr32(x, bottom - 1);
|
H A D | SkMatrixConvolutionImageFilter.cpp | 297 SkIRect bottom = SkIRect::MakeLTRB(bounds.left(), interior.bottom(), local 298 bounds.right(), bounds.bottom()); 300 interior.left(), interior.bottom()); 302 bounds.right(), interior.bottom()); 307 filterBorderPixels(src, result, bottom, bounds); 569 float bottom = (float) bounds.bottom() / texture.height(); local 571 uman.set4f(fBoundsUni, left, 1.0f - bottom, right, 1.0f - top); 573 uman.set4f(fBoundsUni, left, top, right, bottom); [all...] |
/external/skia/src/gpu/gl/ |
H A D | GrGpuGL.cpp | 1676 // now reverse the order of the rows, since GL's are bottom-to-top, but our 1677 // API presents top-to-bottom. We must preserve the padding contents. Note 1687 char* bottom = top + (height - 1) * rowBytes; local 1690 memcpy(top, bottom, tightRowBytes); 1691 memcpy(bottom, tmpRow, tightRowBytes); 1693 bottom -= rowBytes;
|
/external/skia/src/pathops/ |
H A D | SkDCubicLineIntersection.cpp | 220 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument 221 addExactVerticalEndPoints(top, bottom, axisIntercept); 223 addNearVerticalEndPoints(top, bottom, axisIntercept); 232 double lineT = (pt.fY - top) / (bottom - top); 298 void addExactVerticalEndPoints(double top, double bottom, double x) { argument 300 double lineT = SkDLine::ExactPointV(fCubic[cIndex], top, bottom, x); 309 void addNearVerticalEndPoints(double top, double bottom, double x) { argument 315 double lineT = SkDLine::NearPointV(fCubic[cIndex], top, bottom, x); 383 int SkIntersections::vertical(const SkDCubic& cubic, double top, double bottom, double x, argument 385 SkDLine line = {{{ x, top }, { x, bottom }}}; [all...] |
H A D | SkDLineIntersection.cpp | 330 int SkIntersections::vertical(const SkDLine& line, double top, double bottom, argument 339 if (top != bottom) { 340 SkDPoint bottomPt = { x, bottom }; 345 if ((t = SkDLine::ExactPointV(line[index], top, bottom, x)) >= 0) { 354 if (between(top, yIntercept, bottom)) { 355 fT[1][0] = (yIntercept - top) / (bottom - top); 371 if (top != bottom) { 372 SkDPoint bottomPt = { x, bottom }; 377 if ((t = SkDLine::NearPointV(line[index], top, bottom, x)) >= 0) {
|
H A D | SkDQuadLineIntersection.cpp | 201 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument 202 addExactVerticalEndPoints(top, bottom, axisIntercept); 204 addNearVerticalEndPoints(top, bottom, axisIntercept); 211 double lineT = (pt.fY - top) / (bottom - top); 276 void addExactVerticalEndPoints(double top, double bottom, double x) { argument 278 double lineT = SkDLine::ExactPointV(fQuad[qIndex], top, bottom, x); 287 void addNearVerticalEndPoints(double top, double bottom, double x) { argument 293 double lineT = SkDLine::NearPointV(fQuad[qIndex], top, bottom, x); 361 int SkIntersections::vertical(const SkDQuad& quad, double top, double bottom, double x, argument 363 SkDLine line = {{{ x, top }, { x, bottom }}}; [all...] |
H A D | SkIntersectionHelper.h | 62 SkScalar bottom() const { function in class:SkIntersectionHelper
|
H A D | SkIntersections.cpp | 188 int SkIntersections::verticalLine(const SkPoint a[2], SkScalar top, SkScalar bottom, argument 192 return vertical(line, top, bottom, x, flipped); 195 int SkIntersections::verticalQuad(const SkPoint a[3], SkScalar top, SkScalar bottom, argument 199 return vertical(quad, top, bottom, x, flipped); 202 int SkIntersections::verticalCubic(const SkPoint a[4], SkScalar top, SkScalar bottom, argument 206 return vertical(cubic, top, bottom, x, flipped);
|
H A D | SkIntersections.h | 70 int cubicVertical(const SkPoint a[4], SkScalar top, SkScalar bottom, SkScalar x, bool flipped) { argument 74 return vertical(cubic, top, bottom, x, flipped); 120 int lineVertical(const SkPoint a[2], SkScalar top, SkScalar bottom, SkScalar x, bool flipped) { argument 124 return vertical(line, top, bottom, x, flipped); 156 int quadVertical(const SkPoint a[3], SkScalar top, SkScalar bottom, SkScalar x, bool flipped) { argument 160 return vertical(quad, top, bottom, x, flipped); 254 int vertical(const SkDLine&, double top, double bottom, double x, bool flipped); 255 int vertical(const SkDQuad&, double top, double bottom, double x, bool flipped); 256 int vertical(const SkDCubic&, double top, double bottom, double x, bool flipped); 257 int verticalCubic(const SkPoint a[4], SkScalar top, SkScalar bottom, SkScala [all...] |