d38f137e9b
Review URL: http://codereview.appspot.com/5250070/ git-svn-id: http://skia.googlecode.com/svn/trunk@2471 2bbb7eff-a529-9590-31e7-b0007b416f81
142 lines
3.8 KiB
C++
142 lines
3.8 KiB
C++
|
|
/*
|
|
* Copyright 2010 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
|
|
|
|
#ifndef GrClip_DEFINED
|
|
#define GrClip_DEFINED
|
|
|
|
#include "GrClipIterator.h"
|
|
#include "GrRect.h"
|
|
#include "GrPath.h"
|
|
#include "GrTemplates.h"
|
|
|
|
#include "SkTArray.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 &&
|
|
(kIntersect_SetOp == fList[0].fOp ||
|
|
kReplace_SetOp == fList[0].fOp)) {
|
|
// 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;
|
|
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,
|
|
};
|
|
SkSTArray<kPreAllocElements, Element> fList;
|
|
};
|
|
#endif
|
|
|