int
gs_closepath(gs_state * pgs)
{
gx_path *ppath = pgs->path;
int code = gx_path_close_subpath(ppath);
if (code < 0)
return code;
pgs->current_point = pgs->subpath_start;
return code;
}
/* We know ppath != ppath_old. */
int
gx_path_copy_reversed(const gx_path *ppath_old, gx_path *ppath, int init)
{ const subpath *psub = ppath_old->first_subpath;
#ifdef DEBUG
if ( gs_debug['p'] )
gx_dump_path(ppath_old, "before reversepath");
#endif
if ( init )
gx_path_init(ppath, &ppath_old->memory_procs);
nsp: while ( psub )
{ const segment *pseg = psub->last;
const segment *prev;
int code = gx_path_add_point(ppath, pseg->pt.x, pseg->pt.y);
if ( code < 0 )
{ gx_path_release(ppath);
return code;
}
for ( ; ; pseg = prev )
{ prev = pseg->prev;
switch ( pseg->type )
{
case s_start:
/* Finished subpath */
if ( psub->closed )
code = gx_path_close_subpath(ppath);
psub = (const subpath *)psub->last->next;
goto nsp;
case s_curve:
{ const curve_segment *pc = (const curve_segment *)pseg;
code = gx_path_add_curve(ppath,
pc->p2.x, pc->p2.y,
pc->p1.x, pc->p1.y,
prev->pt.x, prev->pt.y);
break;
}
case s_line:
case s_line_close:
code = gx_path_add_line(ppath, prev->pt.x, prev->pt.y);
break;
}
if ( code )
{ gx_path_release(ppath);
return code;
}
}
/* not reached */
}
ppath->position = ppath_old->position; /* restore current point */
#ifdef DEBUG
if ( gs_debug['p'] )
gx_dump_path(ppath, "after reversepath");
#endif
return 0;
}
/* This is a special case of adding a closed polygon. */
int
gx_path_add_rectangle(gx_path * ppath, fixed x0, fixed y0, fixed x1, fixed y1)
{
gs_fixed_point pts[3];
int code;
pts[0].x = x0;
pts[1].x = pts[2].x = x1;
pts[2].y = y0;
pts[0].y = pts[1].y = y1;
if ((code = gx_path_add_point(ppath, x0, y0)) < 0 ||
(code = gx_path_add_lines(ppath, pts, 3)) < 0 ||
(code = gx_path_close_subpath(ppath)) < 0
)
return code;
return 0;
}
int
gs_closepath(gs_state *pgs)
{ return gx_path_close_subpath(pgs->path);
}
