| /* | |
| * Copyright 2006 The Android Open Source Project | |
| * | |
| * Use of this source code is governed by a BSD-style license that can be | |
| * found in the LICENSE file. | |
| */ | |
| #include "SkRect.h" | |
| #include "SkMalloc.h" | |
| void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { | |
| // do nothing if the params are empty | |
| if (left >= right || top >= bottom) { | |
| return; | |
| } | |
| // if we are empty, just assign | |
| if (fLeft >= fRight || fTop >= fBottom) { | |
| this->set(left, top, right, bottom); | |
| } else { | |
| if (left < fLeft) fLeft = left; | |
| if (top < fTop) fTop = top; | |
| if (right > fRight) fRight = right; | |
| if (bottom > fBottom) fBottom = bottom; | |
| } | |
| } | |
| ///////////////////////////////////////////////////////////////////////////// | |
| void SkRect::toQuad(SkPoint quad[4]) const { | |
| SkASSERT(quad); | |
| quad[0].set(fLeft, fTop); | |
| quad[1].set(fRight, fTop); | |
| quad[2].set(fRight, fBottom); | |
| quad[3].set(fLeft, fBottom); | |
| } | |
| #include "SkNx.h" | |
| bool SkRect::setBoundsCheck(const SkPoint pts[], int count) { | |
| SkASSERT((pts && count > 0) || count == 0); | |
| if (count <= 0) { | |
| this->setEmpty(); | |
| return true; | |
| } | |
| Sk4s min, max; | |
| if (count & 1) { | |
| min = max = Sk4s(pts->fX, pts->fY, | |
| pts->fX, pts->fY); | |
| pts += 1; | |
| count -= 1; | |
| } else { | |
| min = max = Sk4s::Load(pts); | |
| pts += 2; | |
| count -= 2; | |
| } | |
| Sk4s accum = min * 0; | |
| while (count) { | |
| Sk4s xy = Sk4s::Load(pts); | |
| accum = accum * xy; | |
| min = Sk4s::Min(min, xy); | |
| max = Sk4s::Max(max, xy); | |
| pts += 2; | |
| count -= 2; | |
| } | |
| bool all_finite = (accum * 0 == 0).allTrue(); | |
| if (all_finite) { | |
| this->set(SkTMin(min[0], min[2]), SkTMin(min[1], min[3]), | |
| SkTMax(max[0], max[2]), SkTMax(max[1], max[3])); | |
| } else { | |
| this->setEmpty(); | |
| } | |
| return all_finite; | |
| } | |
| void SkRect::setBoundsNoCheck(const SkPoint pts[], int count) { | |
| if (!this->setBoundsCheck(pts, count)) { | |
| this->set(SK_ScalarNaN, SK_ScalarNaN, SK_ScalarNaN, SK_ScalarNaN); | |
| } | |
| } | |
| #define CHECK_INTERSECT(al, at, ar, ab, bl, bt, br, bb) \ | |
| SkScalar L = SkMaxScalar(al, bl); \ | |
| SkScalar R = SkMinScalar(ar, br); \ | |
| SkScalar T = SkMaxScalar(at, bt); \ | |
| SkScalar B = SkMinScalar(ab, bb); \ | |
| do { if (!(L < R && T < B)) return false; } while (0) | |
| // do the !(opposite) check so we return false if either arg is NaN | |
| bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { | |
| CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); | |
| this->setLTRB(L, T, R, B); | |
| return true; | |
| } | |
| bool SkRect::intersect(const SkRect& r) { | |
| return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); | |
| } | |
| bool SkRect::intersect(const SkRect& a, const SkRect& b) { | |
| CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); | |
| this->setLTRB(L, T, R, B); | |
| return true; | |
| } | |
| void SkRect::join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { | |
| // do nothing if the params are empty | |
| if (left >= right || top >= bottom) { | |
| return; | |
| } | |
| // if we are empty, just assign | |
| if (fLeft >= fRight || fTop >= fBottom) { | |
| this->set(left, top, right, bottom); | |
| } else { | |
| fLeft = SkMinScalar(fLeft, left); | |
| fTop = SkMinScalar(fTop, top); | |
| fRight = SkMaxScalar(fRight, right); | |
| fBottom = SkMaxScalar(fBottom, bottom); | |
| } | |
| } | |
| //////////////////////////////////////////////////////////////////////////////////////////////// | |
| #include "SkString.h" | |
| #include "SkStringUtils.h" | |
| static const char* set_scalar(SkString* storage, SkScalar value, SkScalarAsStringType asType) { | |
| storage->reset(); | |
| SkAppendScalar(storage, value, asType); | |
| return storage->c_str(); | |
| } | |
| void SkRect::dump(bool asHex) const { | |
| SkScalarAsStringType asType = asHex ? kHex_SkScalarAsStringType : kDec_SkScalarAsStringType; | |
| SkString line; | |
| if (asHex) { | |
| SkString tmp; | |
| line.printf( "SkRect::MakeLTRB(%s, /* %f */\n", set_scalar(&tmp, fLeft, asType), fLeft); | |
| line.appendf(" %s, /* %f */\n", set_scalar(&tmp, fTop, asType), fTop); | |
| line.appendf(" %s, /* %f */\n", set_scalar(&tmp, fRight, asType), fRight); | |
| line.appendf(" %s /* %f */);", set_scalar(&tmp, fBottom, asType), fBottom); | |
| } else { | |
| SkString strL, strT, strR, strB; | |
| SkAppendScalarDec(&strL, fLeft); | |
| SkAppendScalarDec(&strT, fTop); | |
| SkAppendScalarDec(&strR, fRight); | |
| SkAppendScalarDec(&strB, fBottom); | |
| line.printf("SkRect::MakeLTRB(%s, %s, %s, %s);", | |
| strL.c_str(), strT.c_str(), strR.c_str(), strB.c_str()); | |
| } | |
| SkDebugf("%s\n", line.c_str()); | |
| } |