mirror of
git://source.winehq.org/git/wine.git
synced 2024-11-05 18:01:34 +00:00
130 lines
3.4 KiB
C
130 lines
3.4 KiB
C
/*
|
|
* Copyright (C) 2007 Google (Evan Stade)
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include "windef.h"
|
|
#include "winbase.h"
|
|
|
|
#include "gdiplus.h"
|
|
#include "gdiplus_private.h"
|
|
|
|
GpStatus WINGDIPAPI GdipCreatePathIter(GpPathIterator **iterator, GpPath* path)
|
|
{
|
|
INT size;
|
|
|
|
if(!iterator || !path)
|
|
return InvalidParameter;
|
|
|
|
size = path->pathdata.Count;
|
|
|
|
*iterator = GdipAlloc(sizeof(GpPathIterator));
|
|
if(!*iterator) return OutOfMemory;
|
|
|
|
(*iterator)->pathdata.Types = GdipAlloc(size);
|
|
(*iterator)->pathdata.Points = GdipAlloc(size * sizeof(PointF));
|
|
|
|
memcpy((*iterator)->pathdata.Types, path->pathdata.Types, size);
|
|
memcpy((*iterator)->pathdata.Points, path->pathdata.Points,
|
|
size * sizeof(PointF));
|
|
(*iterator)->pathdata.Count = size;
|
|
|
|
(*iterator)->subpath_pos = 0;
|
|
(*iterator)->marker_pos = 0;
|
|
(*iterator)->pathtype_pos = 0;
|
|
|
|
return Ok;
|
|
}
|
|
|
|
GpStatus WINGDIPAPI GdipDeletePathIter(GpPathIterator *iter)
|
|
{
|
|
if(!iter)
|
|
return InvalidParameter;
|
|
|
|
GdipFree(iter->pathdata.Types);
|
|
GdipFree(iter->pathdata.Points);
|
|
GdipFree(iter);
|
|
|
|
return Ok;
|
|
}
|
|
|
|
GpStatus WINGDIPAPI GdipPathIterCopyData(GpPathIterator* iterator,
|
|
INT* resultCount, GpPointF* points, BYTE* types, INT startIndex, INT endIndex)
|
|
{
|
|
if(!iterator || !types || !points)
|
|
return InvalidParameter;
|
|
|
|
if(endIndex > iterator->pathdata.Count - 1 || startIndex < 0 ||
|
|
endIndex < startIndex){
|
|
*resultCount = 0;
|
|
return Ok;
|
|
}
|
|
|
|
*resultCount = endIndex - startIndex + 1;
|
|
|
|
memcpy(types, &(iterator->pathdata.Types[startIndex]), *resultCount);
|
|
memcpy(points, &(iterator->pathdata.Points[startIndex]),
|
|
*resultCount * sizeof(PointF));
|
|
|
|
return Ok;
|
|
}
|
|
|
|
GpStatus WINGDIPAPI GdipPathIterNextSubpath(GpPathIterator* iterator,
|
|
INT *resultCount, INT* startIndex, INT* endIndex, BOOL* isClosed)
|
|
{
|
|
INT i, count;
|
|
|
|
if(!iterator)
|
|
return InvalidParameter;
|
|
|
|
count = iterator->pathdata.Count;
|
|
|
|
if(iterator->subpath_pos == count){
|
|
*startIndex = *endIndex = *resultCount = 0;
|
|
*isClosed = 1;
|
|
return Ok;
|
|
}
|
|
|
|
*startIndex = iterator->subpath_pos;
|
|
|
|
for(i = iterator->subpath_pos + 1; i < count &&
|
|
!(iterator->pathdata.Types[i] == PathPointTypeStart); i++);
|
|
|
|
*endIndex = i - 1;
|
|
iterator->subpath_pos = i;
|
|
|
|
*resultCount = *endIndex - *startIndex + 1;
|
|
|
|
if(iterator->pathdata.Types[*endIndex] & PathPointTypeCloseSubpath)
|
|
*isClosed = TRUE;
|
|
else
|
|
*isClosed = FALSE;
|
|
|
|
return Ok;
|
|
}
|
|
GpStatus WINGDIPAPI GdipPathIterRewind(GpPathIterator *iterator)
|
|
{
|
|
if(!iterator)
|
|
return InvalidParameter;
|
|
|
|
iterator->subpath_pos = 0;
|
|
iterator->marker_pos = 0;
|
|
iterator->pathtype_pos = 0;
|
|
|
|
return Ok;
|
|
}
|