Back to index

lightning-sunbird  0.9+nobinonly
Functions
cairo-polygon.c File Reference
#include <stdlib.h>
#include "cairoint.h"

Go to the source code of this file.

Functions

static cairo_status_t _cairo_polygon_grow_by (cairo_polygon_t *polygon, int additional)
void _cairo_polygon_init (cairo_polygon_t *polygon)
void _cairo_polygon_fini (cairo_polygon_t *polygon)
cairo_status_t _cairo_polygon_add_edge (cairo_polygon_t *polygon, cairo_point_t *p1, cairo_point_t *p2)
cairo_status_t _cairo_polygon_move_to (cairo_polygon_t *polygon, cairo_point_t *point)
cairo_status_t _cairo_polygon_line_to (cairo_polygon_t *polygon, cairo_point_t *point)
cairo_status_t _cairo_polygon_close (cairo_polygon_t *polygon)

Function Documentation

Definition at line 94 of file cairo-polygon.c.

{
    cairo_status_t status;
    cairo_edge_t *edge;

    /* drop horizontal edges */
    if (p1->y == p2->y) {
       goto DONE;
    }

    if (polygon->num_edges >= polygon->edges_size) {
       int additional = polygon->edges_size ? polygon->edges_size : 16;
       status = _cairo_polygon_grow_by (polygon, additional);
       if (status) {
           return status;
       }
    }

    edge = &polygon->edges[polygon->num_edges];
    if (p1->y < p2->y) {
       edge->edge.p1 = *p1;
       edge->edge.p2 = *p2;
       edge->clockWise = 1;
    } else {
       edge->edge.p1 = *p2;
       edge->edge.p2 = *p1;
       edge->clockWise = 0;
    }

    polygon->num_edges++;

  DONE:
    _cairo_polygon_move_to (polygon, p2);

    return CAIRO_STATUS_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 157 of file cairo-polygon.c.

{
    cairo_status_t status;

    if (polygon->has_current_point) {
       status = _cairo_polygon_add_edge (polygon,
                                     &polygon->current_point,
                                     &polygon->first_point);
       if (status)
           return status;

       polygon->has_current_point = 0;
    }

    return CAIRO_STATUS_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 57 of file cairo-polygon.c.

{
    if (polygon->edges_size) {
       free (polygon->edges);
       polygon->edges = NULL;
       polygon->edges_size = 0;
       polygon->num_edges = 0;
    }

    polygon->has_current_point = 0;
}

Here is the caller graph for this function:

static cairo_status_t _cairo_polygon_grow_by ( cairo_polygon_t polygon,
int  additional 
) [static]

Definition at line 70 of file cairo-polygon.c.

{
    cairo_edge_t *new_edges;
    int old_size = polygon->edges_size;
    int new_size = polygon->num_edges + additional;

    if (new_size <= polygon->edges_size) {
       return CAIRO_STATUS_SUCCESS;
    }

    polygon->edges_size = new_size;
    new_edges = realloc (polygon->edges, polygon->edges_size * sizeof (cairo_edge_t));

    if (new_edges == NULL) {
       polygon->edges_size = old_size;
       return CAIRO_STATUS_NO_MEMORY;
    }

    polygon->edges = new_edges;

    return CAIRO_STATUS_SUCCESS;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 46 of file cairo-polygon.c.

{
    polygon->num_edges = 0;

    polygon->edges_size = 0;
    polygon->edges = NULL;

    polygon->has_current_point = 0;
}

Here is the caller graph for this function:

Definition at line 143 of file cairo-polygon.c.

{
    cairo_status_t status = CAIRO_STATUS_SUCCESS;

    if (polygon->has_current_point) {
       status = _cairo_polygon_add_edge (polygon, &polygon->current_point, point);
    } else {
       _cairo_polygon_move_to (polygon, point);
    }

    return status;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 132 of file cairo-polygon.c.

{
    if (! polygon->has_current_point)
       polygon->first_point = *point;
    polygon->current_point = *point;
    polygon->has_current_point = 1;

    return CAIRO_STATUS_SUCCESS;
}

Here is the caller graph for this function: