blob: 4f82ea8b8c32da9ee96b01bf25d3d5fab2b87ec4 (
plain)
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
|
/*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef GrTessellator_DEFINED
#define GrTessellator_DEFINED
#include "GrColor.h"
#include "SkColorData.h"
#include "SkPoint.h"
class SkPath;
struct SkRect;
/**
* Provides utility functions for converting paths to a collection of triangles.
*/
#define TESSELLATOR_WIREFRAME 0
namespace GrTessellator {
class VertexAllocator {
public:
VertexAllocator(size_t stride) : fStride(stride) {}
virtual ~VertexAllocator() {}
virtual void* lock(int vertexCount) = 0;
virtual void unlock(int actualCount) = 0;
size_t stride() const { return fStride; }
private:
size_t fStride;
};
struct WindingVertex {
SkPoint fPos;
int fWinding;
};
// Triangulates a path to an array of vertices. Each triangle is represented as a set of three
// WindingVertex entries, each of which contains the position and winding count (which is the same
// for all three vertices of a triangle). The 'verts' out parameter is set to point to the resultant
// vertex array. CALLER IS RESPONSIBLE for deleting this buffer to avoid a memory leak!
int PathToVertices(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds,
WindingVertex** verts);
int PathToTriangles(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds,
VertexAllocator*, bool antialias, const GrColor& color,
bool canTweakAlphaForCoverage, bool *isLinear);
}
#endif
|