1 files changed, 269 insertions, 0 deletions

diff --git a/libraries/evas/src/modules/engines/directfb/polygon.c b/libraries/evas/src/modules/engines/directfb/polygon.c
new file mode 100644
index 0000000..715fd84
--- /dev/null
+++ b/libraries/evas/src/modules/engines/directfb/polygon.c
@@ -0,0 +1,269 @@
+#include <math.h>
+#include "evas_engine.h"
+
+/* reduce calls to DirectFB (FillSpans), but uses twice as much memory */
+//#define USE_SPAN_RECTS 1
+
+#define MAX_SPANS 512
+typedef struct _RGBA_Edge RGBA_Edge;
+typedef struct _RGBA_Vertex RGBA_Vertex;
+
+struct _RGBA_Edge
+{
+   double x, dx;
+   int i;
+};
+
+struct _RGBA_Vertex
+{
+   double x, y;
+   int i;
+};
+
+#define POLY_EDGE_DEL(_i)                                               \
+{                                                                       \
+   int _j;                                                              \
+                                                                        \
+   for (_j = 0; (_j < num_active_edges) && (edges[_j].i != _i); _j++);  \
+   if (_j < num_active_edges)                                           \
+     {                                                                  \
+        num_active_edges--;                                             \
+        memmove(&(edges[_j]), &(edges[_j + 1]),                         \
+                (num_active_edges - _j) * sizeof(RGBA_Edge));           \
+     }                                                                  \
+}
+
+#define POLY_EDGE_ADD(_i, _y)                                           \
+{                                                                       \
+   int _j;                                                              \
+   float _dx;                                                           \
+   RGBA_Vertex *_p, *_q;                                                \
+   if (_i < (n - 1)) _j = _i + 1;                                       \
+   else _j = 0;                                                         \
+   if (point[_i].y < point[_j].y)                                       \
+     {                                                                  \
+        _p = &(point[_i]);                                              \
+        _q = &(point[_j]);                                              \
+     }                                                                  \
+   else                                                                 \
+     {                                                                  \
+        _p = &(point[_j]);                                              \
+        _q = &(point[_i]);                                              \
+     }                                                                  \
+   edges[num_active_edges].dx = _dx = (_q->x - _p->x) / (_q->y - _p->y); \
+   edges[num_active_edges].x = (_dx * ((float)_y + 0.5 - _p->y)) + _p->x; \
+   edges[num_active_edges].i = _i;                                      \
+   num_active_edges++;                                                  \
+}
+
+static int
+polygon_point_sorter(const void *a, const void *b)
+{
+   RGBA_Vertex *p, *q;
+
+   p = (RGBA_Vertex *)a;
+   q = (RGBA_Vertex *)b;
+   if (p->y <= q->y) return -1;
+   return 1;
+}
+
+static int
+polygon_edge_sorter(const void *a, const void *b)
+{
+   RGBA_Edge *p, *q;
+
+   p = (RGBA_Edge *)a;
+   q = (RGBA_Edge *)b;
+   if (p->x <= q->x) return -1;
+   return 1;
+}
+
+#ifndef USE_SPAN_RECTS
+typedef DFBSpan span_t;
+
+static void
+polygon_span_add(span_t *span, int y __UNUSED__, int x, int w)
+{
+   span->x = x;
+   span->w = w;
+}
+
+static void
+polygon_spans_fill(IDirectFBSurface *surface, int y, const span_t *spans, int n_spans)
+{
+   /* directfb automatically increments y for each span */
+   for (; n_spans > 0; n_spans--, spans++)
+     surface->FillSpans(surface, y, spans, 1);
+}
+#else /* USE_SPAN_RECTS */
+typedef DFBRectangle span_t;
+
+static void
+polygon_span_add(span_t *span, int y, int x, int w)
+{
+   span->x = x;
+   span->y = y;
+   span->w = w;
+   span->h = 1;
+}
+
+static void
+polygon_spans_fill(IDirectFBSurface *surface, int y, const span_t *spans, int n_spans)
+{
+   surface->FillRectangles(surface, spans, n_spans);
+}
+#endif /* USE_SPAN_RECTS */
+
+
+void
+_dfb_polygon_draw(IDirectFBSurface *surface, RGBA_Draw_Context *dc, Eina_Inlist *points, int px, int py)
+{
+   RGBA_Polygon_Point *pt;
+   RGBA_Vertex        *point;
+   RGBA_Edge          *edges;
+   int                 num_active_edges;
+   int                 n;
+   int                 i, j, k;
+   int                 y0, y1, y;
+   int                 ext_x, ext_y, ext_w, ext_h;
+   int                *sorted_index;
+
+   ext_x = 0;
+   ext_y = 0;
+   surface->GetSize(surface, &ext_w, &ext_h);
+   if (dc->clip.use)
+     {
+        if (dc->clip.x > ext_x)
+          {
+             ext_w += ext_x - dc->clip.x;
+             ext_x = dc->clip.x;
+          }
+        if ((ext_x + ext_w) > (dc->clip.x + dc->clip.w))
+          {
+             ext_w = (dc->clip.x + dc->clip.w) - ext_x;
+          }
+        if (dc->clip.y > ext_y)
+          {
+             ext_h += ext_y - dc->clip.y;
+             ext_y = dc->clip.y;
+          }
+        if ((ext_y + ext_h) > (dc->clip.y + dc->clip.h))
+          {
+             ext_h = (dc->clip.y + dc->clip.h) - ext_y;
+          }
+     }
+   if ((ext_w <= 0) || (ext_h <= 0)) return;
+
+   evas_common_cpu_end_opt();
+
+   if (!_dfb_surface_set_color_from_context(surface, dc))
+     return;
+
+   n = 0; EINA_INLIST_FOREACH(points, pt) n++;
+   if (n < 3) return;
+   edges = malloc(sizeof(RGBA_Edge) * n);
+   if (!edges) return;
+   point = malloc(sizeof(RGBA_Vertex) * n);
+   if (!point)
+     {
+        free(edges);
+        return;
+     }
+   sorted_index = malloc(sizeof(int) * n);
+   if (!sorted_index)
+     {
+        free(edges);
+        free(point);
+        return;
+     }
+
+   k = 0;
+   EINA_INLIST_FOREACH(points, pt)
+     {
+        point[k].x = pt->x + px;
+        point[k].y = pt->y + py;
+        point[k].i = k;
+        k++;
+     }
+   qsort(point, n, sizeof(RGBA_Vertex), polygon_point_sorter);
+   for (k = 0; k < n; k++) sorted_index[k] = point[k].i;
+   k = 0;
+   EINA_INLIST_FOREACH(points, pt)
+     {
+        point[k].x = pt->x + px;
+        point[k].y = pt->y + py;
+        point[k].i = k;
+        k++;
+     }
+
+   y0 = MAX(ext_y, ceil(point[sorted_index[0]].y - 0.5));
+   y1 = MIN(ext_y + ext_h - 1, floor(point[sorted_index[n - 1]].y - 0.5));
+
+   k = 0;
+   num_active_edges = 0;
+
+   for (y = y0; y <= y1; y++)
+     {
+        span_t spans[MAX_SPANS];
+        unsigned int n_spans = 0;
+
+        for (; (k < n) && (point[sorted_index[k]].y <= ((double)y + 0.5)); k++)
+          {
+             i = sorted_index[k];
+
+             if (i > 0) j = i - 1;
+             else j = n - 1;
+             if (point[j].y <= ((double)y - 0.5))
+               {
+                  POLY_EDGE_DEL(j)
+               }
+             else if (point[j].y > ((double)y + 0.5))
+               {
+                  POLY_EDGE_ADD(j, y)
+               }
+             if (i < (n - 1)) j = i + 1;
+             else j = 0;
+             if (point[j].y <= ((double)y - 0.5))
+               {
+                  POLY_EDGE_DEL(i)
+               }
+             else if (point[j].y > ((double)y + 0.5))
+               {
+                  POLY_EDGE_ADD(i, y)
+               }
+          }
+
+        qsort(edges, num_active_edges, sizeof(RGBA_Edge), polygon_edge_sorter);
+
+        for (j = 0; j < num_active_edges; j += 2)
+          {
+             int x0, x1;
+
+             x0 = ceil(edges[j].x - 0.5);
+             if (j < (num_active_edges - 1))
+               x1 = floor(edges[j + 1].x - 0.5);
+             else
+               x1 = x0;
+             if ((x1 >= ext_x) && (x0 < (ext_x + ext_w)) && (x0 <= x1))
+               {
+                  if (n_spans == MAX_SPANS)
+                    {
+                       polygon_spans_fill(surface, y, spans, n_spans);
+                       n_spans = 0;
+                    }
+
+                  polygon_span_add(spans + n_spans, y, x0, (x1 - x0) + 1);
+                  n_spans++;
+               }
+             edges[j].x += edges[j].dx;
+             edges[j + 1].x += edges[j + 1].dx;
+          }
+
+        if (n_spans)
+          polygon_spans_fill(surface, y, spans, n_spans);
+     }
+
+   free(edges);
+   free(point);
+   free(sorted_index);
+}