Lines Matching refs:Op
67 // Test that a different op on one level triggers not equal.
147 // the union op will prevent these from being fused together
200 // A op B
207 // invA op B
214 // A op invB
221 // invA op invB
229 static const SkRegion::Op gOps[] = {
254 for (size_t op = 0; op < SK_ARRAY_COUNT(gOps); ++op) {
267 stack.clipDevRect(rectB, gOps[op], false);
270 stack.clipDevPath(clipB, gOps[op], false);
280 (gOps[op] == SkRegion::kIntersect_Op));
624 // Replace Op tests
634 stack.save(); // To prevent in-place substitution by replace OP
643 stack.save(); // To prevent in-place substitution by replace OP
658 // Intersect Op tests with rectangles
683 // Intersect Op tests with circle paths
708 // Intersect Op tests with inverse filled rectangles
745 // Intersect Op tests with inverse filled circles
788 SkRegion::Op op,
791 static void add_round_rect(const SkRect& rect, bool invert, SkRegion::Op op, SkClipStack* stack) {
799 stack->clipDevPath(path, op, false);
802 static void add_rect(const SkRect& rect, bool invert, SkRegion::Op op, SkClipStack* stack) {
807 stack->clipDevPath(path, op, false);
809 stack->clipDevRect(rect, op, false);
813 static void add_oval(const SkRect& rect, bool invert, SkRegion::Op op, SkClipStack* stack) {
819 stack->clipDevPath(path, op, false);
858 region->op(elemRegion, element.getOp());
901 static const SkRegion::Op kOps[] = {
931 SkRegion::Op op = kOps[r.nextULessThan(SK_ARRAY_COUNT(kOps))];
932 if (op == SkRegion::kReplace_Op) {
952 kElementFuncs[r.nextULessThan(SK_ARRAY_COUNT(kElementFuncs))](rect, invert, op, &stack);
