1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/*
Copyright 2010 Google Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#ifndef GrClip_DEFINED
#define GrClip_DEFINED
#include "GrClipIterator.h"
#include "GrRect.h"
#include "GrPath.h"
#include "GrTArray.h"
class GrClip {
public:
GrClip();
GrClip(const GrClip& src);
/**
* If specified, the conservativeBounds parameter already takes (tx,ty)
* into account.
*/
GrClip(GrClipIterator* iter, GrScalar tx, GrScalar ty,
const GrRect* conservativeBounds = NULL);
GrClip(const GrIRect& rect);
GrClip(const GrRect& rect);
~GrClip();
GrClip& operator=(const GrClip& src);
bool hasConservativeBounds() const { return fConservativeBoundsValid; }
const GrRect& getConservativeBounds() const { return fConservativeBounds; }
int getElementCount() const { return fList.count(); }
GrClipType getElementType(int i) const { return fList[i].fType; }
const GrPath& getPath(int i) const {
GrAssert(kPath_ClipType == fList[i].fType);
return fList[i].fPath;
}
GrPathFill getPathFill(int i) const {
GrAssert(kPath_ClipType == fList[i].fType);
return fList[i].fPathFill;
}
const GrRect& getRect(int i) const {
GrAssert(kRect_ClipType == fList[i].fType);
return fList[i].fRect;
}
GrSetOp getOp(int i) const { return fList[i].fOp; }
bool isRect() const {
if (1 == fList.count() && kRect_ClipType == fList[0].fType) {
// if we determined that the clip is a single rect
// we ought to have also used that rect as the bounds.
GrAssert(fConservativeBoundsValid);
GrAssert(fConservativeBounds == fList[0].fRect);
return true;
} else {
return false;
}
}
bool isEmpty() const { return 0 == fList.count(); }
/**
* Resets this clip to be empty
*/
void setEmpty();
/**
* If specified, the bounds parameter already takes (tx,ty) into account.
*/
void setFromIterator(GrClipIterator* iter, GrScalar tx, GrScalar ty,
const GrRect* conservativeBounds = NULL);
void setFromRect(const GrRect& rect);
void setFromIRect(const GrIRect& rect);
friend bool operator==(const GrClip& a, const GrClip& b) {
if (a.fList.count() != b.fList.count()) {
return false;
}
int count = a.fList.count();
for (int i = 0; i < count; ++i) {
if (a.fList[i] != b.fList[i]) {
return false;
}
}
return true;
}
friend bool operator!=(const GrClip& a, const GrClip& b) {
return !(a == b);
}
private:
struct Element {
GrClipType fType;
GrRect fRect;
GrPath fPath;
GrPathFill fPathFill;
GrSetOp fOp;
bool operator ==(const Element& e) const {
if (e.fType != fType || e.fOp != fOp) {
return false;
}
switch (fType) {
case kRect_ClipType:
return fRect == e.fRect;
break;
case kPath_ClipType:
return fPath == e.fPath;
default:
GrCrash("Unknown clip element type.");
return false; // suppress warning
}
}
bool operator !=(const Element& e) const { return !(*this == e); }
};
GrRect fConservativeBounds;
bool fConservativeBoundsValid;
enum {
kPreAllocElements = 4,
};
uint8_t fListMemory[sizeof(Element) * kPreAllocElements];
GrTArray<Element> fList;
};
#endif
|
