Region.cpp revision 3e010f3138593cc6953039ee0e3db8ee31881296
1/* 2 * Copyright (C) 2007 The Android Open Source Project 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17#define LOG_TAG "Region" 18 19#include <limits.h> 20 21#include <utils/Log.h> 22#include <utils/String8.h> 23#include <utils/CallStack.h> 24 25#include <ui/Rect.h> 26#include <ui/Region.h> 27#include <ui/Point.h> 28 29#include <private/ui/RegionHelper.h> 30 31// ---------------------------------------------------------------------------- 32#define VALIDATE_REGIONS (false) 33#define VALIDATE_WITH_CORECG (false) 34// ---------------------------------------------------------------------------- 35 36#if VALIDATE_WITH_CORECG 37#include <core/SkRegion.h> 38#endif 39 40namespace android { 41// ---------------------------------------------------------------------------- 42 43enum { 44 op_nand = region_operator<Rect>::op_nand, 45 op_and = region_operator<Rect>::op_and, 46 op_or = region_operator<Rect>::op_or, 47 op_xor = region_operator<Rect>::op_xor 48}; 49 50enum { 51 direction_LTR, 52 direction_RTL 53}; 54 55// ---------------------------------------------------------------------------- 56 57Region::Region() { 58 mStorage.add(Rect(0,0)); 59} 60 61Region::Region(const Region& rhs) 62 : mStorage(rhs.mStorage) 63{ 64#if VALIDATE_REGIONS 65 validate(rhs, "rhs copy-ctor"); 66#endif 67} 68 69Region::Region(const Rect& rhs) { 70 mStorage.add(rhs); 71} 72 73Region::~Region() 74{ 75} 76 77/** 78 * Copy rects from the src vector into the dst vector, resolving vertical T-Junctions along the way 79 * 80 * First pass through, divideSpanRTL will be set because the 'previous span' (indexing into the dst 81 * vector) will be reversed. Each rectangle in the original list, starting from the bottom, will be 82 * compared with the span directly below, and subdivided as needed to resolve T-junctions. 83 * 84 * The resulting temporary vector will be a completely reversed copy of the original, without any 85 * bottom-up T-junctions. 86 * 87 * Second pass through, divideSpanRTL will be false since the previous span will index into the 88 * final, correctly ordered region buffer. Each rectangle will be compared with the span directly 89 * above it, and subdivided to resolve any remaining T-junctions. 90 */ 91static void reverseRectsResolvingJunctions(const Rect* begin, const Rect* end, 92 Vector<Rect>& dst, int spanDirection) { 93 dst.clear(); 94 95 const Rect* current = end - 1; 96 int lastTop = current->top; 97 98 // add first span immediately 99 do { 100 dst.add(*current); 101 current--; 102 } while (current->top == lastTop && current >= begin); 103 104 unsigned int beginLastSpan = -1; 105 unsigned int endLastSpan = -1; 106 int top = -1; 107 int bottom = -1; 108 109 // for all other spans, split if a t-junction exists in the span directly above 110 while (current >= begin) { 111 if (current->top != (current + 1)->top) { 112 // new span 113 if ((spanDirection == direction_RTL && current->bottom != (current + 1)->top) || 114 (spanDirection == direction_LTR && current->top != (current + 1)->bottom)) { 115 // previous span not directly adjacent, don't check for T junctions 116 beginLastSpan = INT_MAX; 117 } else { 118 beginLastSpan = endLastSpan + 1; 119 } 120 endLastSpan = dst.size() - 1; 121 122 top = current->top; 123 bottom = current->bottom; 124 } 125 int left = current->left; 126 int right = current->right; 127 128 for (unsigned int prevIndex = beginLastSpan; prevIndex <= endLastSpan; prevIndex++) { 129 const Rect* prev = &dst[prevIndex]; 130 if (spanDirection == direction_RTL) { 131 // iterating over previous span RTL, quit if it's too far left 132 if (prev->right <= left) break; 133 134 if (prev->right > left && prev->right < right) { 135 dst.add(Rect(prev->right, top, right, bottom)); 136 right = prev->right; 137 } 138 139 if (prev->left > left && prev->left < right) { 140 dst.add(Rect(prev->left, top, right, bottom)); 141 right = prev->left; 142 } 143 144 // if an entry in the previous span is too far right, nothing further left in the 145 // current span will need it 146 if (prev->left >= right) { 147 beginLastSpan = prevIndex; 148 } 149 } else { 150 // iterating over previous span LTR, quit if it's too far right 151 if (prev->left >= right) break; 152 153 if (prev->left > left && prev->left < right) { 154 dst.add(Rect(left, top, prev->left, bottom)); 155 left = prev->left; 156 } 157 158 if (prev->right > left && prev->right < right) { 159 dst.add(Rect(left, top, prev->right, bottom)); 160 left = prev->right; 161 } 162 // if an entry in the previous span is too far left, nothing further right in the 163 // current span will need it 164 if (prev->right <= left) { 165 beginLastSpan = prevIndex; 166 } 167 } 168 } 169 170 if (left < right) { 171 dst.add(Rect(left, top, right, bottom)); 172 } 173 174 current--; 175 } 176} 177 178/** 179 * Creates a new region with the same data as the argument, but divides rectangles as necessary to 180 * remove T-Junctions 181 * 182 * Note: the output will not necessarily be a very efficient representation of the region, since it 183 * may be that a triangle-based approach would generate significantly simpler geometry 184 */ 185Region Region::createTJunctionFreeRegion(const Region& r) { 186 if (r.isEmpty()) return r; 187 if (r.isRect()) return r; 188 189 Vector<Rect> reversed; 190 reverseRectsResolvingJunctions(r.begin(), r.end(), reversed, direction_RTL); 191 192 Region outputRegion; 193 reverseRectsResolvingJunctions(reversed.begin(), reversed.end(), 194 outputRegion.mStorage, direction_LTR); 195 outputRegion.mStorage.add(r.getBounds()); // to make region valid, mStorage must end with bounds 196 197#if VALIDATE_REGIONS 198 validate(outputRegion, "T-Junction free region"); 199#endif 200 201 return outputRegion; 202} 203 204Region& Region::operator = (const Region& rhs) 205{ 206#if VALIDATE_REGIONS 207 validate(*this, "this->operator="); 208 validate(rhs, "rhs.operator="); 209#endif 210 mStorage = rhs.mStorage; 211 return *this; 212} 213 214Region& Region::makeBoundsSelf() 215{ 216 if (mStorage.size() >= 2) { 217 const Rect bounds(getBounds()); 218 mStorage.clear(); 219 mStorage.add(bounds); 220 } 221 return *this; 222} 223 224void Region::clear() 225{ 226 mStorage.clear(); 227 mStorage.add(Rect(0,0)); 228} 229 230void Region::set(const Rect& r) 231{ 232 mStorage.clear(); 233 mStorage.add(r); 234} 235 236void Region::set(uint32_t w, uint32_t h) 237{ 238 mStorage.clear(); 239 mStorage.add(Rect(w,h)); 240} 241 242// ---------------------------------------------------------------------------- 243 244void Region::addRectUnchecked(int l, int t, int r, int b) 245{ 246 Rect rect(l,t,r,b); 247 size_t where = mStorage.size() - 1; 248 mStorage.insertAt(rect, where, 1); 249} 250 251// ---------------------------------------------------------------------------- 252 253Region& Region::orSelf(const Rect& r) { 254 return operationSelf(r, op_or); 255} 256Region& Region::xorSelf(const Rect& r) { 257 return operationSelf(r, op_xor); 258} 259Region& Region::andSelf(const Rect& r) { 260 return operationSelf(r, op_and); 261} 262Region& Region::subtractSelf(const Rect& r) { 263 return operationSelf(r, op_nand); 264} 265Region& Region::operationSelf(const Rect& r, int op) { 266 Region lhs(*this); 267 boolean_operation(op, *this, lhs, r); 268 return *this; 269} 270 271// ---------------------------------------------------------------------------- 272 273Region& Region::orSelf(const Region& rhs) { 274 return operationSelf(rhs, op_or); 275} 276Region& Region::xorSelf(const Region& rhs) { 277 return operationSelf(rhs, op_xor); 278} 279Region& Region::andSelf(const Region& rhs) { 280 return operationSelf(rhs, op_and); 281} 282Region& Region::subtractSelf(const Region& rhs) { 283 return operationSelf(rhs, op_nand); 284} 285Region& Region::operationSelf(const Region& rhs, int op) { 286 Region lhs(*this); 287 boolean_operation(op, *this, lhs, rhs); 288 return *this; 289} 290 291Region& Region::translateSelf(int x, int y) { 292 if (x|y) translate(*this, x, y); 293 return *this; 294} 295 296// ---------------------------------------------------------------------------- 297 298const Region Region::merge(const Rect& rhs) const { 299 return operation(rhs, op_or); 300} 301const Region Region::mergeExclusive(const Rect& rhs) const { 302 return operation(rhs, op_xor); 303} 304const Region Region::intersect(const Rect& rhs) const { 305 return operation(rhs, op_and); 306} 307const Region Region::subtract(const Rect& rhs) const { 308 return operation(rhs, op_nand); 309} 310const Region Region::operation(const Rect& rhs, int op) const { 311 Region result; 312 boolean_operation(op, result, *this, rhs); 313 return result; 314} 315 316// ---------------------------------------------------------------------------- 317 318const Region Region::merge(const Region& rhs) const { 319 return operation(rhs, op_or); 320} 321const Region Region::mergeExclusive(const Region& rhs) const { 322 return operation(rhs, op_xor); 323} 324const Region Region::intersect(const Region& rhs) const { 325 return operation(rhs, op_and); 326} 327const Region Region::subtract(const Region& rhs) const { 328 return operation(rhs, op_nand); 329} 330const Region Region::operation(const Region& rhs, int op) const { 331 Region result; 332 boolean_operation(op, result, *this, rhs); 333 return result; 334} 335 336const Region Region::translate(int x, int y) const { 337 Region result; 338 translate(result, *this, x, y); 339 return result; 340} 341 342// ---------------------------------------------------------------------------- 343 344Region& Region::orSelf(const Region& rhs, int dx, int dy) { 345 return operationSelf(rhs, dx, dy, op_or); 346} 347Region& Region::xorSelf(const Region& rhs, int dx, int dy) { 348 return operationSelf(rhs, dx, dy, op_xor); 349} 350Region& Region::andSelf(const Region& rhs, int dx, int dy) { 351 return operationSelf(rhs, dx, dy, op_and); 352} 353Region& Region::subtractSelf(const Region& rhs, int dx, int dy) { 354 return operationSelf(rhs, dx, dy, op_nand); 355} 356Region& Region::operationSelf(const Region& rhs, int dx, int dy, int op) { 357 Region lhs(*this); 358 boolean_operation(op, *this, lhs, rhs, dx, dy); 359 return *this; 360} 361 362// ---------------------------------------------------------------------------- 363 364const Region Region::merge(const Region& rhs, int dx, int dy) const { 365 return operation(rhs, dx, dy, op_or); 366} 367const Region Region::mergeExclusive(const Region& rhs, int dx, int dy) const { 368 return operation(rhs, dx, dy, op_xor); 369} 370const Region Region::intersect(const Region& rhs, int dx, int dy) const { 371 return operation(rhs, dx, dy, op_and); 372} 373const Region Region::subtract(const Region& rhs, int dx, int dy) const { 374 return operation(rhs, dx, dy, op_nand); 375} 376const Region Region::operation(const Region& rhs, int dx, int dy, int op) const { 377 Region result; 378 boolean_operation(op, result, *this, rhs, dx, dy); 379 return result; 380} 381 382// ---------------------------------------------------------------------------- 383 384// This is our region rasterizer, which merges rects and spans together 385// to obtain an optimal region. 386class Region::rasterizer : public region_operator<Rect>::region_rasterizer 387{ 388 Rect bounds; 389 Vector<Rect>& storage; 390 Rect* head; 391 Rect* tail; 392 Vector<Rect> span; 393 Rect* cur; 394public: 395 rasterizer(Region& reg) 396 : bounds(INT_MAX, 0, INT_MIN, 0), storage(reg.mStorage), head(), tail(), cur() { 397 storage.clear(); 398 } 399 400 ~rasterizer() { 401 if (span.size()) { 402 flushSpan(); 403 } 404 if (storage.size()) { 405 bounds.top = storage.itemAt(0).top; 406 bounds.bottom = storage.top().bottom; 407 if (storage.size() == 1) { 408 storage.clear(); 409 } 410 } else { 411 bounds.left = 0; 412 bounds.right = 0; 413 } 414 storage.add(bounds); 415 } 416 417 virtual void operator()(const Rect& rect) { 418 //ALOGD(">>> %3d, %3d, %3d, %3d", 419 // rect.left, rect.top, rect.right, rect.bottom); 420 if (span.size()) { 421 if (cur->top != rect.top) { 422 flushSpan(); 423 } else if (cur->right == rect.left) { 424 cur->right = rect.right; 425 return; 426 } 427 } 428 span.add(rect); 429 cur = span.editArray() + (span.size() - 1); 430 } 431private: 432 template<typename T> 433 static inline T min(T rhs, T lhs) { return rhs < lhs ? rhs : lhs; } 434 template<typename T> 435 static inline T max(T rhs, T lhs) { return rhs > lhs ? rhs : lhs; } 436 void flushSpan() { 437 bool merge = false; 438 if (tail-head == ssize_t(span.size())) { 439 Rect const* p = span.editArray(); 440 Rect const* q = head; 441 if (p->top == q->bottom) { 442 merge = true; 443 while (q != tail) { 444 if ((p->left != q->left) || (p->right != q->right)) { 445 merge = false; 446 break; 447 } 448 p++, q++; 449 } 450 } 451 } 452 if (merge) { 453 const int bottom = span[0].bottom; 454 Rect* r = head; 455 while (r != tail) { 456 r->bottom = bottom; 457 r++; 458 } 459 } else { 460 bounds.left = min(span.itemAt(0).left, bounds.left); 461 bounds.right = max(span.top().right, bounds.right); 462 storage.appendVector(span); 463 tail = storage.editArray() + storage.size(); 464 head = tail - span.size(); 465 } 466 span.clear(); 467 } 468}; 469 470bool Region::validate(const Region& reg, const char* name, bool silent) 471{ 472 bool result = true; 473 const_iterator cur = reg.begin(); 474 const_iterator const tail = reg.end(); 475 const_iterator prev = cur; 476 Rect b(*prev); 477 while (cur != tail) { 478 if (cur->isValid() == false) { 479 ALOGE_IF(!silent, "%s: region contains an invalid Rect", name); 480 result = false; 481 } 482 if (cur->right > region_operator<Rect>::max_value) { 483 ALOGE_IF(!silent, "%s: rect->right > max_value", name); 484 result = false; 485 } 486 if (cur->bottom > region_operator<Rect>::max_value) { 487 ALOGE_IF(!silent, "%s: rect->right > max_value", name); 488 result = false; 489 } 490 if (prev != cur) { 491 b.left = b.left < cur->left ? b.left : cur->left; 492 b.top = b.top < cur->top ? b.top : cur->top; 493 b.right = b.right > cur->right ? b.right : cur->right; 494 b.bottom = b.bottom > cur->bottom ? b.bottom : cur->bottom; 495 if ((*prev < *cur) == false) { 496 ALOGE_IF(!silent, "%s: region's Rects not sorted", name); 497 result = false; 498 } 499 if (cur->top == prev->top) { 500 if (cur->bottom != prev->bottom) { 501 ALOGE_IF(!silent, "%s: invalid span %p", name, cur); 502 result = false; 503 } else if (cur->left < prev->right) { 504 ALOGE_IF(!silent, 505 "%s: spans overlap horizontally prev=%p, cur=%p", 506 name, prev, cur); 507 result = false; 508 } 509 } else if (cur->top < prev->bottom) { 510 ALOGE_IF(!silent, 511 "%s: spans overlap vertically prev=%p, cur=%p", 512 name, prev, cur); 513 result = false; 514 } 515 prev = cur; 516 } 517 cur++; 518 } 519 if (b != reg.getBounds()) { 520 result = false; 521 ALOGE_IF(!silent, 522 "%s: invalid bounds [%d,%d,%d,%d] vs. [%d,%d,%d,%d]", name, 523 b.left, b.top, b.right, b.bottom, 524 reg.getBounds().left, reg.getBounds().top, 525 reg.getBounds().right, reg.getBounds().bottom); 526 } 527 if (reg.mStorage.size() == 2) { 528 result = false; 529 ALOGE_IF(!silent, "%s: mStorage size is 2, which is never valid", name); 530 } 531 if (result == false && !silent) { 532 reg.dump(name); 533 CallStack stack; 534 stack.update(); 535 stack.dump(""); 536 } 537 return result; 538} 539 540void Region::boolean_operation(int op, Region& dst, 541 const Region& lhs, 542 const Region& rhs, int dx, int dy) 543{ 544#if VALIDATE_REGIONS 545 validate(lhs, "boolean_operation (before): lhs"); 546 validate(rhs, "boolean_operation (before): rhs"); 547 validate(dst, "boolean_operation (before): dst"); 548#endif 549 550 size_t lhs_count; 551 Rect const * const lhs_rects = lhs.getArray(&lhs_count); 552 553 size_t rhs_count; 554 Rect const * const rhs_rects = rhs.getArray(&rhs_count); 555 556 region_operator<Rect>::region lhs_region(lhs_rects, lhs_count); 557 region_operator<Rect>::region rhs_region(rhs_rects, rhs_count, dx, dy); 558 region_operator<Rect> operation(op, lhs_region, rhs_region); 559 { // scope for rasterizer (dtor has side effects) 560 rasterizer r(dst); 561 operation(r); 562 } 563 564#if VALIDATE_REGIONS 565 validate(lhs, "boolean_operation: lhs"); 566 validate(rhs, "boolean_operation: rhs"); 567 validate(dst, "boolean_operation: dst"); 568#endif 569 570#if VALIDATE_WITH_CORECG 571 SkRegion sk_lhs; 572 SkRegion sk_rhs; 573 SkRegion sk_dst; 574 575 for (size_t i=0 ; i<lhs_count ; i++) 576 sk_lhs.op( 577 lhs_rects[i].left + dx, 578 lhs_rects[i].top + dy, 579 lhs_rects[i].right + dx, 580 lhs_rects[i].bottom + dy, 581 SkRegion::kUnion_Op); 582 583 for (size_t i=0 ; i<rhs_count ; i++) 584 sk_rhs.op( 585 rhs_rects[i].left + dx, 586 rhs_rects[i].top + dy, 587 rhs_rects[i].right + dx, 588 rhs_rects[i].bottom + dy, 589 SkRegion::kUnion_Op); 590 591 const char* name = "---"; 592 SkRegion::Op sk_op; 593 switch (op) { 594 case op_or: sk_op = SkRegion::kUnion_Op; name="OR"; break; 595 case op_xor: sk_op = SkRegion::kUnion_XOR; name="XOR"; break; 596 case op_and: sk_op = SkRegion::kIntersect_Op; name="AND"; break; 597 case op_nand: sk_op = SkRegion::kDifference_Op; name="NAND"; break; 598 } 599 sk_dst.op(sk_lhs, sk_rhs, sk_op); 600 601 if (sk_dst.isEmpty() && dst.isEmpty()) 602 return; 603 604 bool same = true; 605 Region::const_iterator head = dst.begin(); 606 Region::const_iterator const tail = dst.end(); 607 SkRegion::Iterator it(sk_dst); 608 while (!it.done()) { 609 if (head != tail) { 610 if ( 611 head->left != it.rect().fLeft || 612 head->top != it.rect().fTop || 613 head->right != it.rect().fRight || 614 head->bottom != it.rect().fBottom 615 ) { 616 same = false; 617 break; 618 } 619 } else { 620 same = false; 621 break; 622 } 623 head++; 624 it.next(); 625 } 626 627 if (head != tail) { 628 same = false; 629 } 630 631 if(!same) { 632 ALOGD("---\nregion boolean %s failed", name); 633 lhs.dump("lhs"); 634 rhs.dump("rhs"); 635 dst.dump("dst"); 636 ALOGD("should be"); 637 SkRegion::Iterator it(sk_dst); 638 while (!it.done()) { 639 ALOGD(" [%3d, %3d, %3d, %3d]", 640 it.rect().fLeft, 641 it.rect().fTop, 642 it.rect().fRight, 643 it.rect().fBottom); 644 it.next(); 645 } 646 } 647#endif 648} 649 650void Region::boolean_operation(int op, Region& dst, 651 const Region& lhs, 652 const Rect& rhs, int dx, int dy) 653{ 654 if (!rhs.isValid()) { 655 ALOGE("Region::boolean_operation(op=%d) invalid Rect={%d,%d,%d,%d}", 656 op, rhs.left, rhs.top, rhs.right, rhs.bottom); 657 return; 658 } 659 660#if VALIDATE_WITH_CORECG || VALIDATE_REGIONS 661 boolean_operation(op, dst, lhs, Region(rhs), dx, dy); 662#else 663 size_t lhs_count; 664 Rect const * const lhs_rects = lhs.getArray(&lhs_count); 665 666 region_operator<Rect>::region lhs_region(lhs_rects, lhs_count); 667 region_operator<Rect>::region rhs_region(&rhs, 1, dx, dy); 668 region_operator<Rect> operation(op, lhs_region, rhs_region); 669 { // scope for rasterizer (dtor has side effects) 670 rasterizer r(dst); 671 operation(r); 672 } 673 674#endif 675} 676 677void Region::boolean_operation(int op, Region& dst, 678 const Region& lhs, const Region& rhs) 679{ 680 boolean_operation(op, dst, lhs, rhs, 0, 0); 681} 682 683void Region::boolean_operation(int op, Region& dst, 684 const Region& lhs, const Rect& rhs) 685{ 686 boolean_operation(op, dst, lhs, rhs, 0, 0); 687} 688 689void Region::translate(Region& reg, int dx, int dy) 690{ 691 if ((dx || dy) && !reg.isEmpty()) { 692#if VALIDATE_REGIONS 693 validate(reg, "translate (before)"); 694#endif 695 size_t count = reg.mStorage.size(); 696 Rect* rects = reg.mStorage.editArray(); 697 while (count) { 698 rects->translate(dx, dy); 699 rects++; 700 count--; 701 } 702#if VALIDATE_REGIONS 703 validate(reg, "translate (after)"); 704#endif 705 } 706} 707 708void Region::translate(Region& dst, const Region& reg, int dx, int dy) 709{ 710 dst = reg; 711 translate(dst, dx, dy); 712} 713 714// ---------------------------------------------------------------------------- 715 716size_t Region::getSize() const { 717 return mStorage.size() * sizeof(Rect); 718} 719 720status_t Region::flatten(void* buffer) const { 721#if VALIDATE_REGIONS 722 validate(*this, "Region::flatten"); 723#endif 724 Rect* rects = reinterpret_cast<Rect*>(buffer); 725 memcpy(rects, mStorage.array(), mStorage.size() * sizeof(Rect)); 726 return NO_ERROR; 727} 728 729status_t Region::unflatten(void const* buffer, size_t size) { 730 Region result; 731 if (size >= sizeof(Rect)) { 732 Rect const* rects = reinterpret_cast<Rect const*>(buffer); 733 size_t count = size / sizeof(Rect); 734 if (count > 0) { 735 result.mStorage.clear(); 736 ssize_t err = result.mStorage.insertAt(0, count); 737 if (err < 0) { 738 return status_t(err); 739 } 740 memcpy(result.mStorage.editArray(), rects, count*sizeof(Rect)); 741 } 742 } 743#if VALIDATE_REGIONS 744 validate(result, "Region::unflatten"); 745#endif 746 747 if (!result.validate(result, "Region::unflatten", true)) { 748 ALOGE("Region::unflatten() failed, invalid region"); 749 return BAD_VALUE; 750 } 751 mStorage = result.mStorage; 752 return NO_ERROR; 753} 754 755// ---------------------------------------------------------------------------- 756 757Region::const_iterator Region::begin() const { 758 return mStorage.array(); 759} 760 761Region::const_iterator Region::end() const { 762 size_t numRects = isRect() ? 1 : mStorage.size() - 1; 763 return mStorage.array() + numRects; 764} 765 766Rect const* Region::getArray(size_t* count) const { 767 const_iterator const b(begin()); 768 const_iterator const e(end()); 769 if (count) *count = e-b; 770 return b; 771} 772 773SharedBuffer const* Region::getSharedBuffer(size_t* count) const { 774 // We can get to the SharedBuffer of a Vector<Rect> because Rect has 775 // a trivial destructor. 776 SharedBuffer const* sb = SharedBuffer::bufferFromData(mStorage.array()); 777 if (count) { 778 size_t numRects = isRect() ? 1 : mStorage.size() - 1; 779 count[0] = numRects; 780 } 781 sb->acquire(); 782 return sb; 783} 784 785// ---------------------------------------------------------------------------- 786 787void Region::dump(String8& out, const char* what, uint32_t flags) const 788{ 789 (void)flags; 790 const_iterator head = begin(); 791 const_iterator const tail = end(); 792 793 size_t SIZE = 256; 794 char buffer[SIZE]; 795 796 snprintf(buffer, SIZE, " Region %s (this=%p, count=%d)\n", 797 what, this, tail-head); 798 out.append(buffer); 799 while (head != tail) { 800 snprintf(buffer, SIZE, " [%3d, %3d, %3d, %3d]\n", 801 head->left, head->top, head->right, head->bottom); 802 out.append(buffer); 803 head++; 804 } 805} 806 807void Region::dump(const char* what, uint32_t flags) const 808{ 809 (void)flags; 810 const_iterator head = begin(); 811 const_iterator const tail = end(); 812 ALOGD(" Region %s (this=%p, count=%d)\n", what, this, tail-head); 813 while (head != tail) { 814 ALOGD(" [%3d, %3d, %3d, %3d]\n", 815 head->left, head->top, head->right, head->bottom); 816 head++; 817 } 818} 819 820// ---------------------------------------------------------------------------- 821 822}; // namespace android 823