/src/xpdf-4.06/splash/SplashPath.cc
Line | Count | Source |
1 | | //======================================================================== |
2 | | // |
3 | | // SplashPath.cc |
4 | | // |
5 | | // Copyright 2003-2013 Glyph & Cog, LLC |
6 | | // |
7 | | //======================================================================== |
8 | | |
9 | | #include <aconf.h> |
10 | | |
11 | | #include <string.h> |
12 | | #include "gmem.h" |
13 | | #include "gmempp.h" |
14 | | #include "SplashErrorCodes.h" |
15 | | #include "SplashPath.h" |
16 | | |
17 | | //------------------------------------------------------------------------ |
18 | | // SplashPath |
19 | | //------------------------------------------------------------------------ |
20 | | |
21 | | // A path can be in three possible states: |
22 | | // |
23 | | // 1. no current point -- zero or more finished subpaths |
24 | | // [curSubpath == length] |
25 | | // |
26 | | // 2. one point in subpath |
27 | | // [curSubpath == length - 1] |
28 | | // |
29 | | // 3. open subpath with two or more points |
30 | | // [curSubpath < length - 1] |
31 | | |
32 | 2.01M | SplashPath::SplashPath() { |
33 | 2.01M | pts = NULL; |
34 | 2.01M | flags = NULL; |
35 | 2.01M | length = size = 0; |
36 | 2.01M | curSubpath = 0; |
37 | 2.01M | hints = NULL; |
38 | 2.01M | hintsLength = hintsSize = 0; |
39 | 2.01M | } |
40 | | |
41 | 0 | SplashPath::SplashPath(SplashPath *path) { |
42 | 0 | length = path->length; |
43 | 0 | size = path->size; |
44 | 0 | pts = (SplashPathPoint *)gmallocn(size, sizeof(SplashPathPoint)); |
45 | 0 | flags = (Guchar *)gmallocn(size, sizeof(Guchar)); |
46 | 0 | memcpy(pts, path->pts, length * sizeof(SplashPathPoint)); |
47 | 0 | memcpy(flags, path->flags, length * sizeof(Guchar)); |
48 | 0 | curSubpath = path->curSubpath; |
49 | 0 | if (path->hints) { |
50 | 0 | hintsLength = hintsSize = path->hintsLength; |
51 | 0 | hints = (SplashPathHint *)gmallocn(hintsSize, sizeof(SplashPathHint)); |
52 | 0 | memcpy(hints, path->hints, hintsLength * sizeof(SplashPathHint)); |
53 | 0 | } else { |
54 | 0 | hints = NULL; |
55 | 0 | hintsLength = hintsSize = 0; |
56 | 0 | } |
57 | 0 | } |
58 | | |
59 | 2.01M | SplashPath::~SplashPath() { |
60 | 2.01M | gfree(pts); |
61 | 2.01M | gfree(flags); |
62 | 2.01M | gfree(hints); |
63 | 2.01M | } |
64 | | |
65 | | // Add space for <nPts> more points. |
66 | 95.2M | void SplashPath::grow(int nPts) { |
67 | 95.2M | if (length + nPts > size) { |
68 | 1.67M | if (size == 0) { |
69 | 1.58M | size = 32; |
70 | 1.58M | } |
71 | 1.77M | while (size < length + nPts) { |
72 | 94.2k | size *= 2; |
73 | 94.2k | } |
74 | 1.67M | pts = (SplashPathPoint *)greallocn(pts, size, sizeof(SplashPathPoint)); |
75 | 1.67M | flags = (Guchar *)greallocn(flags, size, sizeof(Guchar)); |
76 | 1.67M | } |
77 | 95.2M | } |
78 | | |
79 | 663k | void SplashPath::append(SplashPath *path) { |
80 | 663k | int i; |
81 | | |
82 | 663k | curSubpath = length + path->curSubpath; |
83 | 663k | grow(path->length); |
84 | 6.39M | for (i = 0; i < path->length; ++i) { |
85 | 5.73M | pts[length] = path->pts[i]; |
86 | 5.73M | flags[length] = path->flags[i]; |
87 | 5.73M | ++length; |
88 | 5.73M | } |
89 | 663k | } |
90 | | |
91 | 19.9M | SplashError SplashPath::moveTo(SplashCoord x, SplashCoord y) { |
92 | 19.9M | if (onePointSubpath()) { |
93 | 0 | return splashErrBogusPath; |
94 | 0 | } |
95 | 19.9M | grow(1); |
96 | 19.9M | pts[length].x = x; |
97 | 19.9M | pts[length].y = y; |
98 | 19.9M | flags[length] = splashPathFirst | splashPathLast; |
99 | 19.9M | curSubpath = length++; |
100 | 19.9M | return splashOk; |
101 | 19.9M | } |
102 | | |
103 | 69.4M | SplashError SplashPath::lineTo(SplashCoord x, SplashCoord y) { |
104 | 69.4M | if (noCurrentPoint()) { |
105 | 0 | return splashErrNoCurPt; |
106 | 0 | } |
107 | 69.4M | flags[length-1] &= (Guchar)~splashPathLast; |
108 | 69.4M | grow(1); |
109 | 69.4M | pts[length].x = x; |
110 | 69.4M | pts[length].y = y; |
111 | 69.4M | flags[length] = splashPathLast; |
112 | 69.4M | ++length; |
113 | 69.4M | return splashOk; |
114 | 69.4M | } |
115 | | |
116 | | SplashError SplashPath::curveTo(SplashCoord x1, SplashCoord y1, |
117 | | SplashCoord x2, SplashCoord y2, |
118 | 5.11M | SplashCoord x3, SplashCoord y3) { |
119 | 5.11M | if (noCurrentPoint()) { |
120 | 0 | return splashErrNoCurPt; |
121 | 0 | } |
122 | 5.11M | flags[length-1] &= (Guchar)~splashPathLast; |
123 | 5.11M | grow(3); |
124 | 5.11M | pts[length].x = x1; |
125 | 5.11M | pts[length].y = y1; |
126 | 5.11M | flags[length] = splashPathCurve; |
127 | 5.11M | ++length; |
128 | 5.11M | pts[length].x = x2; |
129 | 5.11M | pts[length].y = y2; |
130 | 5.11M | flags[length] = splashPathCurve; |
131 | 5.11M | ++length; |
132 | 5.11M | pts[length].x = x3; |
133 | 5.11M | pts[length].y = y3; |
134 | 5.11M | flags[length] = splashPathLast; |
135 | 5.11M | ++length; |
136 | 5.11M | return splashOk; |
137 | 5.11M | } |
138 | | |
139 | 16.7M | SplashError SplashPath::close(GBool force) { |
140 | 16.7M | if (noCurrentPoint()) { |
141 | 24 | return splashErrNoCurPt; |
142 | 24 | } |
143 | 16.7M | if (force || |
144 | 8.27M | curSubpath == length - 1 || |
145 | 8.26M | pts[length - 1].x != pts[curSubpath].x || |
146 | 13.8M | pts[length - 1].y != pts[curSubpath].y) { |
147 | 13.8M | lineTo(pts[curSubpath].x, pts[curSubpath].y); |
148 | 13.8M | } |
149 | 16.7M | flags[curSubpath] |= splashPathClosed; |
150 | 16.7M | flags[length - 1] |= splashPathClosed; |
151 | 16.7M | curSubpath = length; |
152 | 16.7M | return splashOk; |
153 | 16.7M | } |
154 | | |
155 | | void SplashPath::addStrokeAdjustHint(int ctrl0, int ctrl1, |
156 | | int firstPt, int lastPt, |
157 | 22.7M | GBool projectingCap) { |
158 | 22.7M | if (hintsLength == hintsSize) { |
159 | 66.0k | hintsSize = hintsLength ? 2 * hintsLength : 8; |
160 | 66.0k | hints = (SplashPathHint *)greallocn(hints, hintsSize, |
161 | 66.0k | sizeof(SplashPathHint)); |
162 | 66.0k | } |
163 | 22.7M | hints[hintsLength].ctrl0 = ctrl0; |
164 | 22.7M | hints[hintsLength].ctrl1 = ctrl1; |
165 | 22.7M | hints[hintsLength].firstPt = firstPt; |
166 | 22.7M | hints[hintsLength].lastPt = lastPt; |
167 | 22.7M | hints[hintsLength].projectingCap = projectingCap; |
168 | 22.7M | ++hintsLength; |
169 | 22.7M | } |
170 | | |
171 | 675k | void SplashPath::offset(SplashCoord dx, SplashCoord dy) { |
172 | 675k | int i; |
173 | | |
174 | 6.43M | for (i = 0; i < length; ++i) { |
175 | 5.76M | pts[i].x += dx; |
176 | 5.76M | pts[i].y += dy; |
177 | 5.76M | } |
178 | 675k | } |
179 | | |
180 | 480k | GBool SplashPath::getCurPt(SplashCoord *x, SplashCoord *y) { |
181 | 480k | if (noCurrentPoint()) { |
182 | 0 | return gFalse; |
183 | 0 | } |
184 | 480k | *x = pts[length - 1].x; |
185 | 480k | *y = pts[length - 1].y; |
186 | 480k | return gTrue; |
187 | 480k | } |
188 | | |
189 | 0 | GBool SplashPath::containsZeroLengthSubpaths() { |
190 | 0 | GBool zeroLength; |
191 | 0 | int i; |
192 | |
|
193 | 0 | zeroLength = gTrue; // make gcc happy |
194 | 0 | for (i = 0; i < length; ++i) { |
195 | 0 | if (flags[i] & splashPathFirst) { |
196 | 0 | zeroLength = gTrue; |
197 | 0 | } else { |
198 | 0 | if (pts[i].x != pts[i-1].x || pts[i].y != pts[i-1].y) { |
199 | 0 | zeroLength = gFalse; |
200 | 0 | } |
201 | 0 | if (flags[i] & splashPathLast) { |
202 | 0 | if (zeroLength) { |
203 | 0 | return gTrue; |
204 | 0 | } |
205 | 0 | } |
206 | 0 | } |
207 | 0 | } |
208 | 0 | return gFalse; |
209 | 0 | } |