pathiterator.c File Reference

#include <stdarg.h>
#include "windef.h"
#include "winbase.h"
#include "wingdi.h"
#include "objbase.h"
#include "gdiplus.h"
#include "gdiplus_private.h"
#include "wine/debug.h"

Include dependency graph for pathiterator.c:

Go to the source code of this file.

Functions
	WINE_DEFAULT_DEBUG_CHANNEL (gdiplus)
GpStatus WINGDIPAPI	GdipCreatePathIter (GpPathIterator **iterator, GpPath *path)
GpStatus WINGDIPAPI	GdipDeletePathIter (GpPathIterator *iter)
GpStatus WINGDIPAPI	GdipPathIterCopyData (GpPathIterator *iterator, INT *resultCount, GpPointF *points, BYTE *types, INT startIndex, INT endIndex)
GpStatus WINGDIPAPI	GdipPathIterHasCurve (GpPathIterator *iterator, BOOL *hasCurve)
GpStatus WINGDIPAPI	GdipPathIterGetSubpathCount (GpPathIterator *iterator, INT *count)
GpStatus WINGDIPAPI	GdipPathIterNextMarker (GpPathIterator *iterator, INT *resultCount, INT *startIndex, INT *endIndex)
GpStatus WINGDIPAPI	GdipPathIterNextMarkerPath (GpPathIterator *iterator, INT *result, GpPath *path)
GpStatus WINGDIPAPI	GdipPathIterNextSubpath (GpPathIterator *iterator, INT *resultCount, INT *startIndex, INT *endIndex, BOOL *isClosed)
GpStatus WINGDIPAPI	GdipPathIterRewind (GpPathIterator *iterator)
GpStatus WINGDIPAPI	GdipPathIterGetCount (GpPathIterator *iterator, INT *count)
GpStatus WINGDIPAPI	GdipPathIterEnumerate (GpPathIterator *iterator, INT *resultCount, GpPointF *points, BYTE *types, INT count)
GpStatus WINGDIPAPI	GdipPathIterIsValid (GpPathIterator *iterator, BOOL *valid)
GpStatus WINGDIPAPI	GdipPathIterNextPathType (GpPathIterator *iter, INT *result, BYTE *type, INT *start, INT *end)
GpStatus WINGDIPAPI	GdipPathIterNextSubpathPath (GpPathIterator *iter, INT *result, GpPath *path, BOOL *closed)

Function Documentation

GdipCreatePathIter()

GpStatus WINGDIPAPI GdipCreatePathIter	(	GpPathIterator **	iterator,
		GpPath *	path
	)

Definition at line 34 of file pathiterator.c.

{
    INT size;
 
    TRACE("(%p, %p)\n", iterator, path);
 
    if(!iterator)
        return InvalidParameter;
 
    *iterator = heap_alloc_zero(sizeof(GpPathIterator));
    if(!*iterator)  return OutOfMemory;
 
    if(path){
        size = path->pathdata.Count;
 
        (*iterator)->pathdata.Types  = heap_alloc_zero(size);
        (*iterator)->pathdata.Points = heap_alloc_zero(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;
    }
    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;
}

Referenced by test_constructor_destructor(), test_getsubpathcount(), test_hascurve(), test_isvalid(), test_nextmarker(), test_nextmarkerpath(), test_nextpathtype(), test_nextsubpath(), and test_nextsubpathpath().

GdipDeletePathIter()

GpStatus WINGDIPAPI GdipDeletePathIter

(

GpPathIterator *

iter

)

Definition at line 69 of file pathiterator.c.

{
    TRACE("(%p)\n", iter);
 
    if(!iter)
        return InvalidParameter;
 
    heap_free(iter->pathdata.Types);
    heap_free(iter->pathdata.Points);
    heap_free(iter);
 
    return Ok;
}

Referenced by test_constructor_destructor(), test_getsubpathcount(), test_hascurve(), test_isvalid(), test_nextmarker(), test_nextmarkerpath(), test_nextpathtype(), test_nextsubpath(), and test_nextsubpathpath().

GdipPathIterCopyData()

GpStatus WINGDIPAPI GdipPathIterCopyData	(	GpPathIterator *	iterator,
		INT *	resultCount,
		GpPointF *	points,
		BYTE *	types,
		INT	startIndex,
		INT	endIndex
	)

Definition at line 83 of file pathiterator.c.

{
    TRACE("(%p, %p, %p, %p, %d, %d)\n", iterator, resultCount, points, types,
           startIndex, 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;
}

Referenced by GdipPathIterEnumerate().

GdipPathIterEnumerate()

GpStatus WINGDIPAPI GdipPathIterEnumerate	(	GpPathIterator *	iterator,
		INT *	resultCount,
		GpPointF *	points,
		BYTE *	types,
		INT	count
	)

Definition at line 267 of file pathiterator.c.

{
    TRACE("(%p, %p, %p, %p, %d)\n", iterator, resultCount, points, types, count);
 
    if((count < 0) || !resultCount)
        return InvalidParameter;
 
    if(count == 0){
        *resultCount = 0;
        return Ok;
    }
 
    return GdipPathIterCopyData(iterator, resultCount, points, types, 0, count-1);
}

GdipPathIterGetCount()

GpStatus WINGDIPAPI GdipPathIterGetCount	(	GpPathIterator *	iterator,
		INT *	count
	)

Definition at line 255 of file pathiterator.c.

{
    TRACE("(%p, %p)\n", iterator, count);
 
    if(!iterator || !count)
        return InvalidParameter;
 
    *count = iterator->pathdata.Count;
 
    return Ok;
}

GdipPathIterGetSubpathCount()

GpStatus WINGDIPAPI GdipPathIterGetSubpathCount	(	GpPathIterator *	iterator,
		INT *	count
	)

Definition at line 127 of file pathiterator.c.

{
    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;
}

Referenced by test_getsubpathcount().

GdipPathIterHasCurve()

GpStatus WINGDIPAPI GdipPathIterHasCurve	(	GpPathIterator *	iterator,
		BOOL *	hasCurve
	)

Definition at line 107 of file pathiterator.c.

{
    INT i;
 
    TRACE("(%p, %p)\n", iterator, hasCurve);
 
    if(!iterator)
        return InvalidParameter;
 
    *hasCurve = FALSE;
 
    for(i = 0; i < iterator->pathdata.Count; i++)
        if((iterator->pathdata.Types[i] & PathPointTypePathTypeMask) == PathPointTypeBezier){
            *hasCurve = TRUE;
            break;
        }
 
    return Ok;
}

Referenced by test_hascurve().

GdipPathIterIsValid()

GpStatus WINGDIPAPI GdipPathIterIsValid	(	GpPathIterator *	iterator,
		BOOL *	valid
	)

Definition at line 283 of file pathiterator.c.

{
    TRACE("(%p, %p)\n", iterator, valid);
 
    if(!iterator || !valid)
        return InvalidParameter;
 
    *valid = TRUE;
 
    return Ok;
}

Referenced by test_isvalid().

GdipPathIterNextMarker()

GpStatus WINGDIPAPI GdipPathIterNextMarker	(	GpPathIterator *	iterator,
		INT *	resultCount,
		INT *	startIndex,
		INT *	endIndex
	)

Definition at line 145 of file pathiterator.c.

{
    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;
}

Referenced by GdipPathIterNextMarkerPath(), test_isvalid(), and test_nextmarker().

GdipPathIterNextMarkerPath()

GpStatus WINGDIPAPI GdipPathIterNextMarkerPath	(	GpPathIterator *	iterator,
		INT *	result,
		GpPath *	path
	)

Definition at line 173 of file pathiterator.c.

{
    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;
}

Referenced by test_nextmarkerpath().

GdipPathIterNextPathType()

GpStatus WINGDIPAPI GdipPathIterNextPathType	(	GpPathIterator *	iter,
		INT *	result,
		BYTE *	type,
		INT *	start,
		INT *	end
	)

Definition at line 295 of file pathiterator.c.

{
    FIXME("(%p, %p, %p, %p, %p) stub\n", iter, result, type, start, end);
 
    if(!iter || !result || !type || !start || !end)
        return InvalidParameter;
 
    return NotImplemented;
}

Referenced by test_nextpathtype().

GdipPathIterNextSubpath()

GpStatus WINGDIPAPI GdipPathIterNextSubpath	(	GpPathIterator *	iterator,
		INT *	resultCount,
		INT *	startIndex,
		INT *	endIndex,
		BOOL *	isClosed
	)

Definition at line 199 of file pathiterator.c.

{
    INT i, count;
 
    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 = TRUE;
        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;
}

Referenced by GdipPathIterNextSubpathPath(), and test_nextsubpath().

GdipPathIterNextSubpathPath()

GpStatus WINGDIPAPI GdipPathIterNextSubpathPath	(	GpPathIterator *	iter,
		INT *	result,
		GpPath *	path,
		BOOL *	closed
	)

Definition at line 306 of file pathiterator.c.

{
    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;
}

Referenced by test_nextsubpathpath().

GdipPathIterRewind()

GpStatus WINGDIPAPI GdipPathIterRewind

(

GpPathIterator *

iterator

)

Definition at line 241 of file pathiterator.c.

{
    TRACE("(%p)\n", iterator);
 
    if(!iterator)
        return InvalidParameter;
 
    iterator->subpath_pos = 0;
    iterator->marker_pos = 0;
    iterator->pathtype_pos = 0;
 
    return Ok;
}

WINE_DEFAULT_DEBUG_CHANNEL()

WINE_DEFAULT_DEBUG_CHANNEL

(

gdiplus

)