/*
* Copyright (C) 2007 Google (Evan Stade)
+ * Copyright (C) 2008 Nikolay Sivov <bunglehead at gmail dot com>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
#include "gdiplus.h"
#include "gdiplus_private.h"
+#include "wine/debug.h"
+
+WINE_DEFAULT_DEBUG_CHANNEL(gdiplus);
GpStatus WINGDIPAPI GdipCreatePathIter(GpPathIterator **iterator, GpPath* path)
{
INT size;
- if(!iterator || !path)
- return InvalidParameter;
+ TRACE("(%p, %p)\n", iterator, path);
- size = path->pathdata.Count;
+ if(!iterator)
+ return InvalidParameter;
*iterator = GdipAlloc(sizeof(GpPathIterator));
if(!*iterator) return OutOfMemory;
- (*iterator)->pathdata.Types = GdipAlloc(size);
- (*iterator)->pathdata.Points = GdipAlloc(size * sizeof(PointF));
+ if(path){
+ size = path->pathdata.Count;
- memcpy((*iterator)->pathdata.Types, path->pathdata.Types, size);
- memcpy((*iterator)->pathdata.Points, path->pathdata.Points,
- size * sizeof(PointF));
- (*iterator)->pathdata.Count = size;
+ (*iterator)->pathdata.Types = GdipAlloc(size);
+ (*iterator)->pathdata.Points = GdipAlloc(size * sizeof(PointF));
- (*iterator)->subpath_pos = 0;
- (*iterator)->marker_pos = 0;
+ memcpy((*iterator)->pathdata.Types, path->pathdata.Types, size);
+ memcpy((*iterator)->pathdata.Points, path->pathdata.Points,size * sizeof(PointF));
+ (*iterator)->pathdata.Count = size;
+ }
+ else{
+ (*iterator)->pathdata.Types = NULL;
+ (*iterator)->pathdata.Points = NULL;
+ (*iterator)->pathdata.Count = 0;
+ }
+
+ (*iterator)->subpath_pos = 0;
+ (*iterator)->marker_pos = 0;
(*iterator)->pathtype_pos = 0;
return Ok;
GpStatus WINGDIPAPI GdipDeletePathIter(GpPathIterator *iter)
{
+ TRACE("(%p)\n", iter);
+
if(!iter)
return InvalidParameter;
GpStatus WINGDIPAPI GdipPathIterCopyData(GpPathIterator* iterator,
INT* resultCount, GpPointF* points, BYTE* types, INT startIndex, INT endIndex)
{
+ TRACE("(%p, %p, %p, %p, %d, %d)\n", iterator, resultCount, points, types,
+ startIndex, endIndex);
+
if(!iterator || !types || !points)
return InvalidParameter;
{
INT i;
+ TRACE("(%p, %p)\n", iterator, hasCurve);
+
if(!iterator)
return InvalidParameter;
return Ok;
}
+GpStatus WINGDIPAPI GdipPathIterGetSubpathCount(GpPathIterator* iterator, INT* count)
+{
+ INT i;
+
+ TRACE("(%p, %p)\n", iterator, count);
+
+ if(!iterator || !count)
+ return InvalidParameter;
+
+ *count = 0;
+ for(i = 0; i < iterator->pathdata.Count; i++){
+ if(iterator->pathdata.Types[i] == PathPointTypeStart)
+ (*count)++;
+ }
+
+ return Ok;
+}
+
+GpStatus WINGDIPAPI GdipPathIterNextMarker(GpPathIterator* iterator, INT *resultCount,
+ INT* startIndex, INT* endIndex)
+{
+ INT i;
+
+ TRACE("(%p, %p, %p, %p)\n", iterator, resultCount, startIndex, endIndex);
+
+ if(!iterator || !startIndex || !endIndex)
+ return InvalidParameter;
+
+ *resultCount = 0;
+
+ /* first call could start with second point as all subsequent, cause
+ path couldn't contain only one */
+ for(i = iterator->marker_pos + 1; i < iterator->pathdata.Count; i++){
+ if((iterator->pathdata.Types[i] & PathPointTypePathMarker) ||
+ (i == iterator->pathdata.Count - 1)){
+ *startIndex = iterator->marker_pos;
+ if(iterator->marker_pos > 0) (*startIndex)++;
+ *endIndex = iterator->marker_pos = i;
+ *resultCount= *endIndex - *startIndex + 1;
+ break;
+ }
+ }
+
+ return Ok;
+}
+
+GpStatus WINGDIPAPI GdipPathIterNextMarkerPath(GpPathIterator* iterator, INT* result,
+ GpPath* path)
+{
+ INT start, end;
+
+ TRACE("(%p, %p, %p)\n", iterator, result, path);
+
+ if(!iterator || !result)
+ return InvalidParameter;
+
+ GdipPathIterNextMarker(iterator, result, &start, &end);
+ /* return path */
+ if(((*result) > 0) && path){
+ GdipResetPath(path);
+
+ if(!lengthen_path(path, *result))
+ return OutOfMemory;
+
+ memcpy(path->pathdata.Points, &(iterator->pathdata.Points[start]), sizeof(GpPointF)*(*result));
+ memcpy(path->pathdata.Types, &(iterator->pathdata.Types[start]), sizeof(BYTE)*(*result));
+ path->pathdata.Count = *result;
+ }
+
+ return Ok;
+}
+
GpStatus WINGDIPAPI GdipPathIterNextSubpath(GpPathIterator* iterator,
INT *resultCount, INT* startIndex, INT* endIndex, BOOL* isClosed)
{
INT i, count;
- if(!iterator)
+ TRACE("(%p, %p, %p, %p, %p)\n", iterator, resultCount, startIndex,
+ endIndex, isClosed);
+
+ if(!iterator || !startIndex || !endIndex || !isClosed || !resultCount)
return InvalidParameter;
count = iterator->pathdata.Count;
+ /* iterator created with NULL path */
+ if(count == 0){
+ *resultCount = 0;
+ return Ok;
+ }
+
if(iterator->subpath_pos == count){
*startIndex = *endIndex = *resultCount = 0;
*isClosed = 1;
}
GpStatus WINGDIPAPI GdipPathIterRewind(GpPathIterator *iterator)
{
+ TRACE("(%p)\n", iterator);
+
if(!iterator)
return InvalidParameter;
GpStatus WINGDIPAPI GdipPathIterGetCount(GpPathIterator* iterator, INT* count)
{
+ TRACE("(%p, %p)\n", iterator, count);
+
if(!iterator || !count)
return InvalidParameter;
GpStatus WINGDIPAPI GdipPathIterEnumerate(GpPathIterator* iterator, INT* resultCount,
GpPointF *points, BYTE *types, INT count)
{
+ TRACE("(%p, %p, %p, %p, %d)\n", iterator, resultCount, points, types, count);
+
if((count < 0) || !resultCount)
return InvalidParameter;
return GdipPathIterCopyData(iterator, resultCount, points, types, 0, count-1);
}
+
+GpStatus WINGDIPAPI GdipPathIterIsValid(GpPathIterator* iterator, BOOL* valid)
+{
+ TRACE("(%p, %p)\n", iterator, valid);
+
+ if(!iterator || !valid)
+ return InvalidParameter;
+
+ *valid = TRUE;
+
+ return Ok;
+}
+
+GpStatus WINGDIPAPI GdipPathIterNextPathType(GpPathIterator* iter, INT* result,
+ BYTE* type, INT* start, INT* end)
+{
+ FIXME("(%p, %p, %p, %p, %p) stub\n", iter, result, type, start, end);
+
+ if(!iter || !result || !type || !start || !end)
+ return InvalidParameter;
+
+ return NotImplemented;
+}
+
+GpStatus WINGDIPAPI GdipPathIterNextSubpathPath(GpPathIterator* iter, INT* result,
+ GpPath* path, BOOL* closed)
+{
+ INT start, end;
+
+ TRACE("(%p, %p, %p, %p)\n", iter, result, path, closed);
+
+ if(!iter || !result || !closed)
+ return InvalidParameter;
+
+ GdipPathIterNextSubpath(iter, result, &start, &end, closed);
+ /* return path */
+ if(((*result) > 0) && path){
+ GdipResetPath(path);
+
+ if(!lengthen_path(path, *result))
+ return OutOfMemory;
+
+ memcpy(path->pathdata.Points, &(iter->pathdata.Points[start]), sizeof(GpPointF)*(*result));
+ memcpy(path->pathdata.Types, &(iter->pathdata.Types[start]), sizeof(BYTE)*(*result));
+ path->pathdata.Count = *result;
+ }
+
+ return Ok;
+}
projects / reactos.git / blobdiff