2 * Copyright (C) 2007 Google (Evan Stade)
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
28 #include "gdiplus_private.h"
30 GpStatus WINGDIPAPI GdipCreatePathIter(GpPathIterator **iterator, GpPath* path)
35 return InvalidParameter;
37 *iterator = GdipAlloc(sizeof(GpPathIterator));
38 if(!*iterator) return OutOfMemory;
41 size = path->pathdata.Count;
43 (*iterator)->pathdata.Types = GdipAlloc(size);
44 (*iterator)->pathdata.Points = GdipAlloc(size * sizeof(PointF));
46 memcpy((*iterator)->pathdata.Types, path->pathdata.Types, size);
47 memcpy((*iterator)->pathdata.Points, path->pathdata.Points,size * sizeof(PointF));
48 (*iterator)->pathdata.Count = size;
51 (*iterator)->pathdata.Types = NULL;
52 (*iterator)->pathdata.Points = NULL;
53 (*iterator)->pathdata.Count = 0;
56 (*iterator)->subpath_pos = 0;
57 (*iterator)->marker_pos = 0;
58 (*iterator)->pathtype_pos = 0;
63 GpStatus WINGDIPAPI GdipDeletePathIter(GpPathIterator *iter)
66 return InvalidParameter;
68 GdipFree(iter->pathdata.Types);
69 GdipFree(iter->pathdata.Points);
75 GpStatus WINGDIPAPI GdipPathIterCopyData(GpPathIterator* iterator,
76 INT* resultCount, GpPointF* points, BYTE* types, INT startIndex, INT endIndex)
78 if(!iterator || !types || !points)
79 return InvalidParameter;
81 if(endIndex > iterator->pathdata.Count - 1 || startIndex < 0 ||
82 endIndex < startIndex){
87 *resultCount = endIndex - startIndex + 1;
89 memcpy(types, &(iterator->pathdata.Types[startIndex]), *resultCount);
90 memcpy(points, &(iterator->pathdata.Points[startIndex]),
91 *resultCount * sizeof(PointF));
96 GpStatus WINGDIPAPI GdipPathIterHasCurve(GpPathIterator* iterator, BOOL* hasCurve)
101 return InvalidParameter;
105 for(i = 0; i < iterator->pathdata.Count; i++)
106 if((iterator->pathdata.Types[i] & PathPointTypePathTypeMask) == PathPointTypeBezier){
114 GpStatus WINGDIPAPI GdipPathIterGetSubpathCount(GpPathIterator* iterator, INT* count)
118 if(!iterator || !count)
119 return InvalidParameter;
122 for(i = 0; i < iterator->pathdata.Count; i++){
123 if(iterator->pathdata.Types[i] == PathPointTypeStart)
130 GpStatus WINGDIPAPI GdipPathIterNextMarker(GpPathIterator* iterator, INT *resultCount,
131 INT* startIndex, INT* endIndex)
135 if(!iterator || !startIndex || !endIndex)
136 return InvalidParameter;
140 /* first call could start with second point as all subsequent, cause
141 path couldn't contain only one */
142 for(i = iterator->marker_pos + 1; i < iterator->pathdata.Count; i++){
143 if((iterator->pathdata.Types[i] & PathPointTypePathMarker) ||
144 (i == iterator->pathdata.Count - 1)){
145 *startIndex = iterator->marker_pos;
146 if(iterator->marker_pos > 0) (*startIndex)++;
147 *endIndex = iterator->marker_pos = i;
148 *resultCount= *endIndex - *startIndex + 1;
156 GpStatus WINGDIPAPI GdipPathIterNextMarkerPath(GpPathIterator* iterator, INT* result,
161 if(!iterator || !result)
162 return InvalidParameter;
164 GdipPathIterNextMarker(iterator, result, &start, &end);
166 if(((*result) > 0) && path){
169 if(!lengthen_path(path, *result))
172 memcpy(path->pathdata.Points, &(iterator->pathdata.Points[start]), sizeof(GpPointF)*(*result));
173 memcpy(path->pathdata.Types, &(iterator->pathdata.Types[start]), sizeof(BYTE)*(*result));
174 path->pathdata.Count = *result;
180 GpStatus WINGDIPAPI GdipPathIterNextSubpath(GpPathIterator* iterator,
181 INT *resultCount, INT* startIndex, INT* endIndex, BOOL* isClosed)
185 if(!iterator || !startIndex || !endIndex || !isClosed || !resultCount)
186 return InvalidParameter;
188 count = iterator->pathdata.Count;
190 /* iterator created with NULL path */
196 if(iterator->subpath_pos == count){
197 *startIndex = *endIndex = *resultCount = 0;
202 *startIndex = iterator->subpath_pos;
204 for(i = iterator->subpath_pos + 1; i < count &&
205 !(iterator->pathdata.Types[i] == PathPointTypeStart); i++);
208 iterator->subpath_pos = i;
210 *resultCount = *endIndex - *startIndex + 1;
212 if(iterator->pathdata.Types[*endIndex] & PathPointTypeCloseSubpath)
219 GpStatus WINGDIPAPI GdipPathIterRewind(GpPathIterator *iterator)
222 return InvalidParameter;
224 iterator->subpath_pos = 0;
225 iterator->marker_pos = 0;
226 iterator->pathtype_pos = 0;
231 GpStatus WINGDIPAPI GdipPathIterGetCount(GpPathIterator* iterator, INT* count)
233 if(!iterator || !count)
234 return InvalidParameter;
236 *count = iterator->pathdata.Count;
241 GpStatus WINGDIPAPI GdipPathIterEnumerate(GpPathIterator* iterator, INT* resultCount,
242 GpPointF *points, BYTE *types, INT count)
244 if((count < 0) || !resultCount)
245 return InvalidParameter;
252 return GdipPathIterCopyData(iterator, resultCount, points, types, 0, count-1);
255 GpStatus WINGDIPAPI GdipPathIterIsValid(GpPathIterator* iterator, BOOL* valid)
257 if(!iterator || !valid)
258 return InvalidParameter;
265 GpStatus WINGDIPAPI GdipPathIterNextSubpathPath(GpPathIterator* iter, INT* result,
266 GpPath* path, BOOL* closed)
270 if(!iter || !result || !closed)
271 return InvalidParameter;
273 GdipPathIterNextSubpath(iter, result, &start, &end, closed);
275 if(((*result) > 0) && path){
278 if(!lengthen_path(path, *result))
281 memcpy(path->pathdata.Points, &(iter->pathdata.Points[start]), sizeof(GpPointF)*(*result));
282 memcpy(path->pathdata.Types, &(iter->pathdata.Types[start]), sizeof(BYTE)*(*result));
283 path->pathdata.Count = *result;