Lines Matching defs:const
46 int count() const { return fCount; }
76 static SkRegionPriv::RunType* skip_intervals(const SkRegionPriv::RunType runs[]) {
91 bool SkRegion::RunsAreARect(const SkRegion::RunType runs[], int count,
120 SkRegion::SkRegion(const SkRegion& src) {
125 SkRegion::SkRegion(const SkIRect& rect) {
151 void SkRegion::allocateRuns(const RunHead& head) {
157 SkRegion& SkRegion::operator=(const SkRegion& src) {
168 int SkRegion::computeRegionComplexity() const {
184 bool SkRegion::setRect(const SkIRect& r) {
196 bool SkRegion::setRegion(const SkRegion& src) {
209 bool SkRegion::op(const SkIRect& rect, const SkRegion& rgn, Op op) {
215 bool SkRegion::op(const SkRegion& rgn, const SkIRect& rect, Op op) {
233 const int max = (count*((11*4)+5))+11+1;
241 const SkIRect& r = iter.rect();
253 int SkRegion::count_runtype_values(int* itop, int* ibot) const {
345 void SkRegion::BuildRectRuns(const SkIRect& bounds,
356 bool SkRegion::contains(int32_t x, int32_t y) const {
367 const RunType* runs = fRunHead->findScanline(y);
390 static SkRegionPriv::RunType scanline_bottom(const SkRegionPriv::RunType runs[]) {
394 static const SkRegionPriv::RunType* scanline_next(const SkRegionPriv::RunType runs[]) {
399 static bool scanline_contains(const SkRegionPriv::RunType runs[],
414 bool SkRegion::contains(const SkIRect& r) const {
425 const RunType* scanline = fRunHead->findScanline(r.fTop);
438 bool SkRegion::contains(const SkRegion& rgn) const {
459 const SkRegion::RunType* SkRegion::getRuns(RunType tmpStorage[],
460 int* intervals) const {
462 const RunType* runs = tmpStorage;
479 static bool scanline_intersects(const SkRegionPriv::RunType runs[],
494 bool SkRegion::intersects(const SkIRect& r) const {
510 const RunType* scanline = fRunHead->findScanline(sect.fTop);
523 bool SkRegion::intersects(const SkRegion& rgn) const {
551 bool SkRegion::operator==(const SkRegion& b) const {
562 const SkRegion::RunHead* ah = fRunHead;
563 const SkRegion::RunHead* bh = b.fRunHead;
581 const int32_t lo = -SK_MaxS32-1,
588 void SkRegion::translate(int dx, int dy, SkRegion* dst) const {
617 const RunType* sruns = fRunHead->readonly_runs();
649 bool SkRegion::setRects(const SkIRect rects[], int count) {
678 const SkRegionPriv::RunType* fA_runs;
679 const SkRegionPriv::RunType* fB_runs;
683 void init(const SkRegionPriv::RunType a_runs[],
684 const SkRegionPriv::RunType b_runs[]) {
694 bool done() const {
768 static int distance_to_sentinel(const SkRegionPriv::RunType* runs) {
769 const SkRegionPriv::RunType* ptr = runs;
774 static int operate_on_span(const SkRegionPriv::RunType a_runs[],
775 const SkRegionPriv::RunType b_runs[],
816 static const struct {
840 void addSpan(int bottom, const SkRegionPriv::RunType a_runs[],
841 const SkRegionPriv::RunType b_runs[]) {
878 bool isEmpty() const { return 0 == fPrevLen; }
893 static int operate(const SkRegionPriv::RunType a_runs[],
894 const SkRegionPriv::RunType b_runs[],
898 const SkRegionPriv::RunType gEmptyScanline[] = {
909 const SkRegionPriv::RunType* const gSentinel = &gEmptyScanline[2];
933 const SkRegionPriv::RunType* run0 = gSentinel;
934 const SkRegionPriv::RunType* run1 = gSentinel;
1010 interval, but we can first trim off the const overhead of the initial TOP
1024 static bool setRectCheck(SkRegion* result, const SkIRect& rect) {
1028 static bool setRegionCheck(SkRegion* result, const SkRegion& rgn) {
1032 bool SkRegion::Oper(const SkRegion& rgnaOrig, const SkRegion& rgnbOrig, Op op,
1041 const SkRegion* rgna = &rgnaOrig;
1042 const SkRegion* rgnb = &rgnbOrig;
1119 const RunType* a_runs = rgna->getRuns(tmpA, &a_intervals);
1120 const RunType* b_runs = rgnb->getRuns(tmpB, &b_intervals);
1134 bool SkRegion::op(const SkRegion& rgna, const SkRegion& rgnb, Op op) {
1143 size_t SkRegion::writeToMemory(void* storage) const {
1194 static bool validate_run(const int32_t* runs,
1196 const SkIRect& givenBounds,
1210 const int32_t* const end = runs + runCount;
1270 size_t SkRegion::readFromMemory(const void* storage, size_t length) {
1298 if (!validate_run((const int32_t*)((const char*)storage + buffer.pos()), count,
1315 bool SkRegion::isValid() const {
1330 void SkRegion::dump(std::string& desc, int depth) const {
1344 const RunType* runs = fRunHead->readonly_runs();
1355 void SkRegionPriv::Validate(const SkRegion& rgn) { SkASSERT(rgn.isValid()); }
1357 void SkRegion::dump() const {
1363 const RunType* runs = fRunHead->readonly_runs();
1375 SkRegion::Iterator::Iterator(const SkRegion& rgn) {
1387 void SkRegion::Iterator::reset(const SkRegion& rgn) {
1415 const RunType* runs = fRuns;
1445 SkRegion::Cliperator::Cliperator(const SkRegion& rgn, const SkIRect& clip)
1447 const SkIRect& r = fIter.rect();
1466 const SkIRect& r = fIter.rect();
1484 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,
1488 const SkIRect& r = rgn.getBounds();
1505 const SkRegion::RunType* runs = rgn.fRunHead->findScanline(y);
1544 const SkRegion::RunType* runs = fRuns;
1565 static void visit_pairs(int pairCount, int y, const int32_t pairs[],
1566 const std::function<void(const SkIRect&)>& visitor) {
1573 void SkRegionPriv::VisitSpans(const SkRegion& rgn,
1574 const std::function<void(const SkIRect&)>& visitor) {
1581 const int32_t* p = rgn.fRunHead->readonly_runs();