diff options
Diffstat (limited to 'tests/suite/ecore/src/lib/eina_tiler.c')
| -rw-r--r-- | tests/suite/ecore/src/lib/eina_tiler.c | 1860 |
1 files changed, 896 insertions, 964 deletions
diff --git a/tests/suite/ecore/src/lib/eina_tiler.c b/tests/suite/ecore/src/lib/eina_tiler.c index 2d263b7a15..5d31aba6cf 100644 --- a/tests/suite/ecore/src/lib/eina_tiler.c +++ b/tests/suite/ecore/src/lib/eina_tiler.c @@ -23,7 +23,7 @@ */ #ifdef HAVE_CONFIG_H -# include "config.h" +#include "config.h" #endif #include <stdlib.h> @@ -44,45 +44,39 @@ typedef struct list list_t; typedef struct rect rect_t; typedef struct rect_node rect_node_t; -struct list_node -{ - struct list_node *next; +struct list_node { + struct list_node *next; }; -struct list -{ - struct list_node *head; - struct list_node *tail; +struct list { + struct list_node *head; + struct list_node *tail; }; -struct rect -{ - short right; - short bottom; - short left; - short top; - short width; - short height; - int area; +struct rect { + short right; + short bottom; + short left; + short top; + short width; + short height; + int area; }; -struct rect_node -{ - struct list_node _lst; - struct rect rect; +struct rect_node { + struct list_node _lst; + struct rect rect; }; -typedef struct splitter -{ - Eina_Bool need_merge; - list_t rects; +typedef struct splitter { + Eina_Bool need_merge; + list_t rects; } splitter_t; -typedef struct list_node_pool -{ - list_node_t *node; - int len; - int max; +typedef struct list_node_pool { + list_node_t *node; + int len; + int max; } list_node_pool_t; @@ -91,23 +85,18 @@ static const list_t list_zeroed = { NULL, NULL }; static list_node_pool_t list_node_pool = { NULL, 0, 1024 }; -typedef struct _Eina_Iterator_Tiler -{ - Eina_Iterator iterator; - const Eina_Tiler *tiler; - list_node_t *curr; - EINA_MAGIC -} Eina_Iterator_Tiler; +typedef struct _Eina_Iterator_Tiler { + Eina_Iterator iterator; + const Eina_Tiler *tiler; + list_node_t *curr; + EINA_MAGIC} Eina_Iterator_Tiler; -struct _Eina_Tiler -{ - struct - { - int w, h; - } tile; - Eina_Rectangle area; - EINA_MAGIC - splitter_t splitter; +struct _Eina_Tiler { + struct { + int w, h; + } tile; + Eina_Rectangle area; + EINA_MAGIC splitter_t splitter; }; #define EINA_MAGIC_CHECK_TILER(d, ...) \ @@ -130,976 +119,919 @@ struct _Eina_Tiler } while(0) /* The Splitter algorithm */ -static inline void rect_init(rect_t *r, int x, int y, int w, int h) +static inline void rect_init(rect_t * r, int x, int y, int w, int h) { - r->area = w * h; + r->area = w * h; - r->left = x; - r->top = y; + r->left = x; + r->top = y; - r->right = x + w; - r->bottom = y + h; + r->right = x + w; + r->bottom = y + h; - r->width = w; - r->height = h; + r->width = w; + r->height = h; } -static inline list_node_t * -rect_list_node_pool_get(void) +static inline list_node_t *rect_list_node_pool_get(void) { - if (list_node_pool.node) - { - list_node_t *node; - - node = list_node_pool.node; - list_node_pool.node = node->next; - list_node_pool.len--; - - return node; - } - else - return malloc(sizeof(rect_node_t)); + if (list_node_pool.node) { + list_node_t *node; + + node = list_node_pool.node; + list_node_pool.node = node->next; + list_node_pool.len--; + + return node; + } else + return malloc(sizeof(rect_node_t)); } -static inline void rect_list_concat(list_t *rects, list_t *other) +static inline void rect_list_concat(list_t * rects, list_t * other) { - if (!other->head) - return; - - if (rects->tail) - { - rects->tail->next = other->head; - rects->tail = other->tail; - } - else - { - rects->head = other->head; - rects->tail = other->tail; - } - - *other = list_zeroed; + if (!other->head) + return; + + if (rects->tail) { + rects->tail->next = other->head; + rects->tail = other->tail; + } else { + rects->head = other->head; + rects->tail = other->tail; + } + + *other = list_zeroed; } -static inline void rect_list_append_node(list_t *rects, list_node_t *node) +static inline void rect_list_append_node(list_t * rects, + list_node_t * node) { - if (rects->tail) - { - rects->tail->next = node; - rects->tail = node; - } - else - { - rects->head = node; - rects->tail = node; - } + if (rects->tail) { + rects->tail->next = node; + rects->tail = node; + } else { + rects->head = node; + rects->tail = node; + } } -static inline void rect_list_append(list_t *rects, const rect_t r) +static inline void rect_list_append(list_t * rects, const rect_t r) { - rect_node_t *rect_node; + rect_node_t *rect_node; - rect_node = (rect_node_t *)rect_list_node_pool_get(); - rect_node->rect = r; - rect_node->_lst = list_node_zeroed; + rect_node = (rect_node_t *) rect_list_node_pool_get(); + rect_node->rect = r; + rect_node->_lst = list_node_zeroed; - rect_list_append_node(rects, (list_node_t *)rect_node); + rect_list_append_node(rects, (list_node_t *) rect_node); } -static inline void rect_list_append_xywh(list_t *rects, - int x, - int y, - int w, - int h) +static inline void rect_list_append_xywh(list_t * rects, + int x, int y, int w, int h) { - rect_t r; + rect_t r; - rect_init(&r, x, y, w, h); - rect_list_append(rects, r); + rect_init(&r, x, y, w, h); + rect_list_append(rects, r); } static inline void _calc_intra_rect_area(const rect_t a, const rect_t b, - int *width, int *height) + int *width, int *height) { - int max_left, min_right, max_top, min_bottom; + int max_left, min_right, max_top, min_bottom; - if (a.left < b.left) - max_left = b.left; - else - max_left = a.left; + if (a.left < b.left) + max_left = b.left; + else + max_left = a.left; - if (a.right < b.right) - min_right = a.right; - else - min_right = b.right; + if (a.right < b.right) + min_right = a.right; + else + min_right = b.right; - *width = min_right - max_left; + *width = min_right - max_left; - if (a.top < b.top) - max_top = b.top; - else - max_top = a.top; + if (a.top < b.top) + max_top = b.top; + else + max_top = a.top; - if (a.bottom < b.bottom) - min_bottom = a.bottom; - else - min_bottom = b.bottom; + if (a.bottom < b.bottom) + min_bottom = a.bottom; + else + min_bottom = b.bottom; - *height = min_bottom - max_top; + *height = min_bottom - max_top; } -static inline void _split_strict(list_t *dirty, const rect_t current, rect_t r) +static inline void _split_strict(list_t * dirty, const rect_t current, + rect_t r) { - int h_1, h_2, w_1, w_2; - - h_1 = current.top - r.top; - h_2 = r.bottom - current.bottom; - w_1 = current.left - r.left; - w_2 = r.right - current.right; - - if (h_1 > 0) - { - /* .--.r (b) .---.r2 - * | | | | - * .-------.cur (a) .---.r '---' - * | | | | -> | | + - * | `--' | `---' - * `-------' - */ - rect_list_append_xywh(dirty, r.left, r.top, r.width, h_1); - r.height -= h_1; - r.top = current.top; - } - - if (h_2 > 0) - { - /* .-------.cur (a) - * | .---. | .---.r - * | | | | -> | | - * `-------' `---' + .---.r2 - * | | | | - * `---'r (b) `---' - */ - rect_list_append_xywh(dirty, r.left, current.bottom, r.width, - h_2); - r.height -= h_2; - } - - if (w_1 > 0) - /* (b) r .----.cur (a) - * .--|-. | .--.r2 .-.r - * | | | | -> | | + | | - * `--|-' | `--' `-' - * `----' - */ - rect_list_append_xywh(dirty, r.left, r.top, w_1, r.height); /* not necessary to keep these, r (b) will be destroyed */ - - /* r.width -= w_1; */ - /* r.left = current.left; */ - - if (w_2 > 0) - /* .----.cur (a) - * | | - * | .-|--.r (b) .-.r .--.r2 - * | | | | -> | | + | | - * | `-|--' `-' `--' - * `----' - */ - rect_list_append_xywh(dirty, current.right, r.top, w_2, - r.height); /* not necessary to keep this, r (b) will be destroyed */ - - /* r.width -= w_2; */ + int h_1, h_2, w_1, w_2; + + h_1 = current.top - r.top; + h_2 = r.bottom - current.bottom; + w_1 = current.left - r.left; + w_2 = r.right - current.right; + + if (h_1 > 0) { + /* .--.r (b) .---.r2 + * | | | | + * .-------.cur (a) .---.r '---' + * | | | | -> | | + + * | `--' | `---' + * `-------' + */ + rect_list_append_xywh(dirty, r.left, r.top, r.width, h_1); + r.height -= h_1; + r.top = current.top; + } + + if (h_2 > 0) { + /* .-------.cur (a) + * | .---. | .---.r + * | | | | -> | | + * `-------' `---' + .---.r2 + * | | | | + * `---'r (b) `---' + */ + rect_list_append_xywh(dirty, r.left, current.bottom, + r.width, h_2); + r.height -= h_2; + } + + if (w_1 > 0) + /* (b) r .----.cur (a) + * .--|-. | .--.r2 .-.r + * | | | | -> | | + | | + * `--|-' | `--' `-' + * `----' + */ + rect_list_append_xywh(dirty, r.left, r.top, w_1, r.height); /* not necessary to keep these, r (b) will be destroyed */ + + /* r.width -= w_1; */ + /* r.left = current.left; */ + + if (w_2 > 0) + /* .----.cur (a) + * | | + * | .-|--.r (b) .-.r .--.r2 + * | | | | -> | | + | | + * | `-|--' `-' `--' + * `----' + */ + rect_list_append_xywh(dirty, current.right, r.top, w_2, r.height); /* not necessary to keep this, r (b) will be destroyed */ + + /* r.width -= w_2; */ } -static inline void _calc_intra_outer_rect_area(const rect_t a, const rect_t b, - rect_t *intra, rect_t *outer) +static inline void _calc_intra_outer_rect_area(const rect_t a, + const rect_t b, + rect_t * intra, + rect_t * outer) { - int min_left, max_left, min_right, max_right; - int min_top, max_top, min_bottom, max_bottom; - - if (a.left < b.left) - { - max_left = b.left; - min_left = a.left; - } - else - { - max_left = a.left; - min_left = b.left; - } - - if (a.right < b.right) - { - min_right = a.right; - max_right = b.right; - } - else - { - min_right = b.right; - max_right = a.right; - } - - intra->left = max_left; - intra->right = min_right; - intra->width = min_right - max_left; - - outer->left = min_left; - outer->right = max_right; - outer->width = max_right - min_left; - - if (a.top < b.top) - { - max_top = b.top; - min_top = a.top; - } - else - { - max_top = a.top; - min_top = b.top; - } - - if (a.bottom < b.bottom) - { - min_bottom = a.bottom; - max_bottom = b.bottom; - } - else - { - min_bottom = b.bottom; - max_bottom = a.bottom; - } - - intra->top = max_top; - intra->bottom = min_bottom; - intra->height = min_bottom - max_top; - if ((intra->width > 0) && (intra->height > 0)) - intra->area = intra->width * intra->height; - else - intra->area = 0; - - outer->top = min_top; - outer->bottom = max_bottom; - outer->height = max_bottom - min_top; - outer->area = outer->width * outer->height; + int min_left, max_left, min_right, max_right; + int min_top, max_top, min_bottom, max_bottom; + + if (a.left < b.left) { + max_left = b.left; + min_left = a.left; + } else { + max_left = a.left; + min_left = b.left; + } + + if (a.right < b.right) { + min_right = a.right; + max_right = b.right; + } else { + min_right = b.right; + max_right = a.right; + } + + intra->left = max_left; + intra->right = min_right; + intra->width = min_right - max_left; + + outer->left = min_left; + outer->right = max_right; + outer->width = max_right - min_left; + + if (a.top < b.top) { + max_top = b.top; + min_top = a.top; + } else { + max_top = a.top; + min_top = b.top; + } + + if (a.bottom < b.bottom) { + min_bottom = a.bottom; + max_bottom = b.bottom; + } else { + min_bottom = b.bottom; + max_bottom = a.bottom; + } + + intra->top = max_top; + intra->bottom = min_bottom; + intra->height = min_bottom - max_top; + if ((intra->width > 0) && (intra->height > 0)) + intra->area = intra->width * intra->height; + else + intra->area = 0; + + outer->top = min_top; + outer->bottom = max_bottom; + outer->height = max_bottom - min_top; + outer->area = outer->width * outer->height; } -enum -{ - SPLIT_FUZZY_ACTION_NONE, - SPLIT_FUZZY_ACTION_SPLIT, - SPLIT_FUZZY_ACTION_MERGE +enum { + SPLIT_FUZZY_ACTION_NONE, + SPLIT_FUZZY_ACTION_SPLIT, + SPLIT_FUZZY_ACTION_MERGE }; -static inline int _split_fuzzy(list_t *dirty, const rect_t a, rect_t *b) +static inline int _split_fuzzy(list_t * dirty, const rect_t a, rect_t * b) { - int h_1, h_2, w_1, w_2, action; - - h_1 = a.top - b->top; - h_2 = b->bottom - a.bottom; - w_1 = a.left - b->left; - w_2 = b->right - a.right; - - action = SPLIT_FUZZY_ACTION_NONE; - - if (h_1 > 0) - { - /* .--.r (b) .---.r2 - * | | | | - * .-------.cur (a) .---.r '---' - * | | | | -> | | + - * | `--' | `---' - * `-------' - */ - rect_list_append_xywh(dirty, b->left, b->top, b->width, h_1); - b->height -= h_1; - b->top = a.top; - action = SPLIT_FUZZY_ACTION_SPLIT; - } - - if (h_2 > 0) - { - /* .-------.cur (a) - * | .---. | .---.r - * | | | | -> | | - * `-------' `---' + .---.r2 - * | | | | - * `---'r (b) `---' - */ - rect_list_append_xywh(dirty, b->left, a.bottom, b->width, h_2); - b->height -= h_2; - action = SPLIT_FUZZY_ACTION_SPLIT; - } - - if (((w_1 > 0) || (w_2 > 0)) && (a.height == b->height)) - return SPLIT_FUZZY_ACTION_MERGE; - - if (w_1 > 0) - { - /* (b) r .----.cur (a) - * .--|-. | .--.r2 .-.r - * | | | | -> | | + | | - * `--|-' | `--' `-' - * `----' - */ - rect_list_append_xywh(dirty, b->left, b->top, w_1, b->height); - /* not necessary to keep these, r (b) will be destroyed */ - /* b->width -= w_1; */ - /* b->left = a.left; */ - action = SPLIT_FUZZY_ACTION_SPLIT; - } - - if (w_2 > 0) - { - /* .----.cur (a) - * | | - * | .-|--.r (b) .-.r .--.r2 - * | | | | -> | | + | | - * | `-|--' `-' `--' - * `----' - */ - rect_list_append_xywh(dirty, a.right, b->top, w_2, b->height); - /* not necessary to keep these, r (b) will be destroyed */ - /* b->width -= w_2; */ - action = SPLIT_FUZZY_ACTION_SPLIT; - } - - return action; + int h_1, h_2, w_1, w_2, action; + + h_1 = a.top - b->top; + h_2 = b->bottom - a.bottom; + w_1 = a.left - b->left; + w_2 = b->right - a.right; + + action = SPLIT_FUZZY_ACTION_NONE; + + if (h_1 > 0) { + /* .--.r (b) .---.r2 + * | | | | + * .-------.cur (a) .---.r '---' + * | | | | -> | | + + * | `--' | `---' + * `-------' + */ + rect_list_append_xywh(dirty, b->left, b->top, b->width, + h_1); + b->height -= h_1; + b->top = a.top; + action = SPLIT_FUZZY_ACTION_SPLIT; + } + + if (h_2 > 0) { + /* .-------.cur (a) + * | .---. | .---.r + * | | | | -> | | + * `-------' `---' + .---.r2 + * | | | | + * `---'r (b) `---' + */ + rect_list_append_xywh(dirty, b->left, a.bottom, b->width, + h_2); + b->height -= h_2; + action = SPLIT_FUZZY_ACTION_SPLIT; + } + + if (((w_1 > 0) || (w_2 > 0)) && (a.height == b->height)) + return SPLIT_FUZZY_ACTION_MERGE; + + if (w_1 > 0) { + /* (b) r .----.cur (a) + * .--|-. | .--.r2 .-.r + * | | | | -> | | + | | + * `--|-' | `--' `-' + * `----' + */ + rect_list_append_xywh(dirty, b->left, b->top, w_1, + b->height); + /* not necessary to keep these, r (b) will be destroyed */ + /* b->width -= w_1; */ + /* b->left = a.left; */ + action = SPLIT_FUZZY_ACTION_SPLIT; + } + + if (w_2 > 0) { + /* .----.cur (a) + * | | + * | .-|--.r (b) .-.r .--.r2 + * | | | | -> | | + | | + * | `-|--' `-' `--' + * `----' + */ + rect_list_append_xywh(dirty, a.right, b->top, w_2, + b->height); + /* not necessary to keep these, r (b) will be destroyed */ + /* b->width -= w_2; */ + action = SPLIT_FUZZY_ACTION_SPLIT; + } + + return action; } #if 0 static void rect_list_node_pool_set_max(int max) { - int diff; + int diff; - diff = list_node_pool.len - max; - for (; diff > 0 && list_node_pool.node != NULL; diff--) - { - list_node_t *node; + diff = list_node_pool.len - max; + for (; diff > 0 && list_node_pool.node != NULL; diff--) { + list_node_t *node; - node = list_node_pool.node; - list_node_pool.node = node->next; - list_node_pool.len--; + node = list_node_pool.node; + list_node_pool.node = node->next; + list_node_pool.len--; - free(node); - } + free(node); + } - list_node_pool.max = max; + list_node_pool.max = max; } #endif static void rect_list_node_pool_flush(void) { - while (list_node_pool.node) - { - list_node_t *node; + while (list_node_pool.node) { + list_node_t *node; - node = list_node_pool.node; - list_node_pool.node = node->next; - list_node_pool.len--; + node = list_node_pool.node; + list_node_pool.node = node->next; + list_node_pool.len--; - free(node); - } + free(node); + } } -static inline void rect_list_node_pool_put(list_node_t *node) +static inline void rect_list_node_pool_put(list_node_t * node) { - if (list_node_pool.len < list_node_pool.max) - { - node->next = list_node_pool.node; - list_node_pool.node = node; - list_node_pool.len++; - } - else - free(node); + if (list_node_pool.len < list_node_pool.max) { + node->next = list_node_pool.node; + list_node_pool.node = node; + list_node_pool.len++; + } else + free(node); } #if 0 static void rect_print(const rect_t r) { - printf("<rect(%d, %d, %d, %d)>", r.left, r.top, r.width, r.height); + printf("<rect(%d, %d, %d, %d)>", r.left, r.top, r.width, r.height); } static void rect_list_print(const list_t rects) { - list_node_t *node; - int len; - - len = 0; - for (node = rects.head; node != NULL; node = node->next) - len++; - - printf("["); - for (node = rects.head; node != NULL; node = node->next) - { - rect_print(((rect_node_t *)node)->rect); - if (node->next) - { - putchar(','); - if (len < 4) - putchar(' '); - else - { - putchar('\n'); - putchar(' '); - } - } - } - printf("]\n"); + list_node_t *node; + int len; + + len = 0; + for (node = rects.head; node != NULL; node = node->next) + len++; + + printf("["); + for (node = rects.head; node != NULL; node = node->next) { + rect_print(((rect_node_t *) node)->rect); + if (node->next) { + putchar(','); + if (len < 4) + putchar(' '); + else { + putchar('\n'); + putchar(' '); + } + } + } + printf("]\n"); } #endif -static inline list_node_t * -rect_list_unlink_next(list_t *rects, list_node_t *parent_node) +static inline list_node_t *rect_list_unlink_next(list_t * rects, + list_node_t * parent_node) { - list_node_t *node; - - if (parent_node) - { - node = parent_node->next; - parent_node->next = node->next; - } - else - { - node = rects->head; - rects->head = node->next; - } - - if (rects->tail == node) - rects->tail = parent_node; - - *node = list_node_zeroed; - return node; + list_node_t *node; + + if (parent_node) { + node = parent_node->next; + parent_node->next = node->next; + } else { + node = rects->head; + rects->head = node->next; + } + + if (rects->tail == node) + rects->tail = parent_node; + + *node = list_node_zeroed; + return node; } -static inline void rect_list_del_next(list_t *rects, list_node_t *parent_node) +static inline void rect_list_del_next(list_t * rects, + list_node_t * parent_node) { - list_node_t *node; + list_node_t *node; - node = rect_list_unlink_next(rects, parent_node); - rect_list_node_pool_put(node); + node = rect_list_unlink_next(rects, parent_node); + rect_list_node_pool_put(node); } -static void rect_list_clear(list_t *rects) +static void rect_list_clear(list_t * rects) { - list_node_t *node; - - node = rects->head; - while (node) - { - list_node_t *aux; - - aux = node->next; - rect_list_node_pool_put(node); - node = aux; - } - *rects = list_zeroed; + list_node_t *node; + + node = rects->head; + while (node) { + list_node_t *aux; + + aux = node->next; + rect_list_node_pool_put(node); + node = aux; + } + *rects = list_zeroed; } -static void rect_list_del_split_strict(list_t *rects, const rect_t del_r) +static void rect_list_del_split_strict(list_t * rects, const rect_t del_r) { - list_t modified = list_zeroed; - list_node_t *cur_node, *prev_node; - - prev_node = NULL; - cur_node = rects->head; - while (cur_node) - { - int intra_width, intra_height; - rect_t current; - - current = ((rect_node_t *)cur_node)->rect; - - _calc_intra_rect_area(del_r, current, &intra_width, - &intra_height); - if ((intra_width <= 0) || (intra_height <= 0)) - { - /* .---.current .---.del_r - * | | | | - * `---+---.del_r `---+---.current - * | | | | - * `---' `---' - * no intersection, nothing to do - */ - prev_node = cur_node; - cur_node = cur_node->next; - } - else if ((intra_width == current.width) && (intra_height - == current.height)) - { - /* .-------.del_r - * | .---. | - * | | | | - * | `---'current - * `-------' - * current is contained, remove from rects - */ - cur_node = cur_node->next; - rect_list_del_next(rects, prev_node); - } - else - { - _split_strict(&modified, del_r, current); - cur_node = cur_node->next; - rect_list_del_next(rects, prev_node); - } - } - - rect_list_concat(rects, &modified); + list_t modified = list_zeroed; + list_node_t *cur_node, *prev_node; + + prev_node = NULL; + cur_node = rects->head; + while (cur_node) { + int intra_width, intra_height; + rect_t current; + + current = ((rect_node_t *) cur_node)->rect; + + _calc_intra_rect_area(del_r, current, &intra_width, + &intra_height); + if ((intra_width <= 0) || (intra_height <= 0)) { + /* .---.current .---.del_r + * | | | | + * `---+---.del_r `---+---.current + * | | | | + * `---' `---' + * no intersection, nothing to do + */ + prev_node = cur_node; + cur_node = cur_node->next; + } else if ((intra_width == current.width) && (intra_height + == + current. + height)) { + /* .-------.del_r + * | .---. | + * | | | | + * | `---'current + * `-------' + * current is contained, remove from rects + */ + cur_node = cur_node->next; + rect_list_del_next(rects, prev_node); + } else { + _split_strict(&modified, del_r, current); + cur_node = cur_node->next; + rect_list_del_next(rects, prev_node); + } + } + + rect_list_concat(rects, &modified); } #if 0 -static void rect_list_add_split_strict(list_t *rects, list_node_t *node) +static void rect_list_add_split_strict(list_t * rects, list_node_t * node) { - list_t dirty = list_zeroed; - list_t new_dirty = list_zeroed; - list_node_t *cur_node; - - if (!rects->head) - { - rect_list_append_node(rects, node); - return; - } - - rect_list_append_node(&dirty, node); - - cur_node = rects->head; - while (dirty.head) - { - rect_t current; - - if (!cur_node) - { - rect_list_concat(rects, &dirty); - break; - } - - current = ((rect_node_t *)cur_node)->rect; - - while (dirty.head) - { - int intra_width, intra_height; - rect_t r; - - r = ((rect_node_t *)dirty.head)->rect; - _calc_intra_rect_area(r, current, &intra_width, - &intra_height); - if ((intra_width == r.width) && (intra_height - == r.height)) - /* .-------.cur - * | .---.r| - * | | | | - * | `---' | - * `-------' - */ - rect_list_del_next(&dirty, NULL); - else if ((intra_width <= 0) || (intra_height <= 0)) - { - /* .---.cur .---.r - * | | | | - * `---+---.r `---+---.cur - * | | | | - * `---' `---' - */ - list_node_t *tmp; - tmp = rect_list_unlink_next(&dirty, NULL); - rect_list_append_node(&new_dirty, tmp); - } - else - { - _split_strict(&new_dirty, current, r); - rect_list_del_next(&dirty, NULL); - } - } - dirty = new_dirty; - new_dirty = list_zeroed; - - cur_node = cur_node->next; - } + list_t dirty = list_zeroed; + list_t new_dirty = list_zeroed; + list_node_t *cur_node; + + if (!rects->head) { + rect_list_append_node(rects, node); + return; + } + + rect_list_append_node(&dirty, node); + + cur_node = rects->head; + while (dirty.head) { + rect_t current; + + if (!cur_node) { + rect_list_concat(rects, &dirty); + break; + } + + current = ((rect_node_t *) cur_node)->rect; + + while (dirty.head) { + int intra_width, intra_height; + rect_t r; + + r = ((rect_node_t *) dirty.head)->rect; + _calc_intra_rect_area(r, current, &intra_width, + &intra_height); + if ((intra_width == r.width) && (intra_height + == r.height)) + /* .-------.cur + * | .---.r| + * | | | | + * | `---' | + * `-------' + */ + rect_list_del_next(&dirty, NULL); + else if ((intra_width <= 0) || (intra_height <= 0)) { + /* .---.cur .---.r + * | | | | + * `---+---.r `---+---.cur + * | | | | + * `---' `---' + */ + list_node_t *tmp; + tmp = rect_list_unlink_next(&dirty, NULL); + rect_list_append_node(&new_dirty, tmp); + } else { + _split_strict(&new_dirty, current, r); + rect_list_del_next(&dirty, NULL); + } + } + dirty = new_dirty; + new_dirty = list_zeroed; + + cur_node = cur_node->next; + } } #endif -static list_node_t * -rect_list_add_split_fuzzy(list_t *rects, list_node_t *node, int accepted_error) +static list_node_t *rect_list_add_split_fuzzy(list_t * rects, + list_node_t * node, + int accepted_error) { - list_t dirty = list_zeroed; - list_node_t *old_last; - - old_last = rects->tail; - - if (!rects->head) - { - rect_list_append_node(rects, node); - return old_last; - } - - rect_list_append_node(&dirty, node); - while (dirty.head) - { - list_node_t *d_node, *cur_node, *prev_cur_node; - int keep_dirty; - rect_t r; - - d_node = rect_list_unlink_next(&dirty, NULL); - r = ((rect_node_t *)d_node)->rect; - - prev_cur_node = NULL; - cur_node = rects->head; - keep_dirty = 1; - while (cur_node) - { - int area, action; - rect_t current, intra, outer; - - current = ((rect_node_t *)cur_node)->rect; - - _calc_intra_outer_rect_area(r, current, &intra, &outer); - area = current.area + r.area - intra.area; - - if ((intra.width == r.width) && (intra.height - == r.height)) - { - /* .-------.cur - * | .---.r| - * | | | | - * | `---' | - * `-------' - */ - keep_dirty = 0; - break; - } - else if ((intra.width == current.width) - && (intra.height == current.height)) - { - /* .-------.r - * | .---.cur - * | | | | - * | `---' | - * `-------' - */ - if (old_last == cur_node) - old_last = prev_cur_node; - - cur_node = cur_node->next; - rect_list_del_next(rects, prev_cur_node); - } - else if ((outer.area - area) <= accepted_error) - { - /* .-----------. bounding box (outer) - * |.---. .---.| - * ||cur| |r || - * || | | || - * |`---' `---'| - * `-----------' - * merge them, remove both and add merged - */ - rect_node_t *n; - - if (old_last == cur_node) - old_last = prev_cur_node; - - n = (rect_node_t *)rect_list_unlink_next( - rects, prev_cur_node); - n->rect = outer; - rect_list_append_node(&dirty, (list_node_t *)n); - - keep_dirty = 0; - break; - } - else if (intra.area <= accepted_error) - { - /* .---.cur .---.r - * | | | | - * `---+---.r `---+---.cur - * | | | | - * `---' `---' - * no split, no merge - */ - prev_cur_node = cur_node; - cur_node = cur_node->next; - } - else - { - /* split is required */ - action = _split_fuzzy(&dirty, current, &r); - if (action == SPLIT_FUZZY_ACTION_MERGE) - { + list_t dirty = list_zeroed; + list_node_t *old_last; + + old_last = rects->tail; + + if (!rects->head) { + rect_list_append_node(rects, node); + return old_last; + } + + rect_list_append_node(&dirty, node); + while (dirty.head) { + list_node_t *d_node, *cur_node, *prev_cur_node; + int keep_dirty; + rect_t r; + + d_node = rect_list_unlink_next(&dirty, NULL); + r = ((rect_node_t *) d_node)->rect; + + prev_cur_node = NULL; + cur_node = rects->head; + keep_dirty = 1; + while (cur_node) { + int area, action; + rect_t current, intra, outer; + + current = ((rect_node_t *) cur_node)->rect; + + _calc_intra_outer_rect_area(r, current, &intra, + &outer); + area = current.area + r.area - intra.area; + + if ((intra.width == r.width) && (intra.height + == r.height)) { + /* .-------.cur + * | .---.r| + * | | | | + * | `---' | + * `-------' + */ + keep_dirty = 0; + break; + } else if ((intra.width == current.width) + && (intra.height == current.height)) { + /* .-------.r + * | .---.cur + * | | | | + * | `---' | + * `-------' + */ + if (old_last == cur_node) + old_last = prev_cur_node; + + cur_node = cur_node->next; + rect_list_del_next(rects, prev_cur_node); + } else if ((outer.area - area) <= accepted_error) { + /* .-----------. bounding box (outer) + * |.---. .---.| + * ||cur| |r || + * || | | || + * |`---' `---'| + * `-----------' + * merge them, remove both and add merged + */ + rect_node_t *n; + + if (old_last == cur_node) + old_last = prev_cur_node; + + n = (rect_node_t *) + rect_list_unlink_next(rects, + prev_cur_node); + n->rect = outer; + rect_list_append_node(&dirty, + (list_node_t *) n); + + keep_dirty = 0; + break; + } else if (intra.area <= accepted_error) { + /* .---.cur .---.r + * | | | | + * `---+---.r `---+---.cur + * | | | | + * `---' `---' + * no split, no merge + */ + prev_cur_node = cur_node; + cur_node = cur_node->next; + } else { + /* split is required */ + action = _split_fuzzy(&dirty, current, &r); + if (action == SPLIT_FUZZY_ACTION_MERGE) { /* horizontal merge is possible: remove both, add merged */ - rect_node_t *n; - - if (old_last == cur_node) - old_last = prev_cur_node; - - n - = (rect_node_t *)rect_list_unlink_next( - rects, - prev_cur_node); - - n->rect.left = outer.left; - n->rect.width = outer.width; - n->rect.right = outer.right; - n->rect.area = outer.width * r.height; - rect_list_append_node(&dirty, - (list_node_t *)n); - } - else if (action == SPLIT_FUZZY_ACTION_NONE) - { + rect_node_t *n; + + if (old_last == cur_node) + old_last = prev_cur_node; + + n = (rect_node_t *) + rect_list_unlink_next(rects, + prev_cur_node); + + n->rect.left = outer.left; + n->rect.width = outer.width; + n->rect.right = outer.right; + n->rect.area = + outer.width * r.height; + rect_list_append_node(&dirty, + (list_node_t + *) n); + } else if (action == + SPLIT_FUZZY_ACTION_NONE) { /* * this rect check was totally useless, * should never happen */ /* prev_cur_node = cur_node; */ /* cur_node = cur_node->next; */ - printf("Should not get here!\n"); - abort(); - } - - keep_dirty = 0; - break; - } - } - if (EINA_UNLIKELY(keep_dirty)) - rect_list_append_node(rects, d_node); - else - rect_list_node_pool_put(d_node); - } - - return old_last; + printf("Should not get here!\n"); + abort(); + } + + keep_dirty = 0; + break; + } + } + if (EINA_UNLIKELY(keep_dirty)) + rect_list_append_node(rects, d_node); + else + rect_list_node_pool_put(d_node); + } + + return old_last; } static inline void _calc_outer_rect_area(const rect_t a, const rect_t b, - rect_t *outer) + rect_t * outer) { - int min_left, max_right; - int min_top, max_bottom; - - if (a.left < b.left) - min_left = a.left; - else - min_left = b.left; - - if (a.right < b.right) - max_right = b.right; - else - max_right = a.right; - - outer->left = min_left; - outer->right = max_right; - outer->width = max_right - min_left; - - if (a.top < b.top) - min_top = a.top; - else - min_top = b.top; - - if (a.bottom < b.bottom) - max_bottom = b.bottom; - else - max_bottom = a.bottom; - - outer->top = min_top; - outer->bottom = max_bottom; - outer->height = max_bottom - min_top; - - outer->area = outer->width * outer->height; + int min_left, max_right; + int min_top, max_bottom; + + if (a.left < b.left) + min_left = a.left; + else + min_left = b.left; + + if (a.right < b.right) + max_right = b.right; + else + max_right = a.right; + + outer->left = min_left; + outer->right = max_right; + outer->width = max_right - min_left; + + if (a.top < b.top) + min_top = a.top; + else + min_top = b.top; + + if (a.bottom < b.bottom) + max_bottom = b.bottom; + else + max_bottom = a.bottom; + + outer->top = min_top; + outer->bottom = max_bottom; + outer->height = max_bottom - min_top; + + outer->area = outer->width * outer->height; } -static void rect_list_merge_rects(list_t *rects, - list_t *to_merge, - int accepted_error) +static void rect_list_merge_rects(list_t * rects, + list_t * to_merge, int accepted_error) { - while (to_merge->head) - { - list_node_t *node, *parent_node; - rect_t r1; - int merged; - - r1 = ((rect_node_t *)to_merge->head)->rect; - - merged = 0; - parent_node = NULL; - node = rects->head; - while (node) - { - rect_t r2, outer; - int area; - - r2 = ((rect_node_t *)node)->rect; - - _calc_outer_rect_area(r1, r2, &outer); - area = r1.area + r2.area; /* intra area is taken as 0 */ - if (outer.area - area <= accepted_error) - { - /* - * remove both r1 and r2, create r3 - * actually r3 uses r2 instance, saves memory - */ - rect_node_t *n; - - n = (rect_node_t *)rect_list_unlink_next( - rects, parent_node); - n->rect = outer; - rect_list_append_node(to_merge, - (list_node_t *)n); - merged = 1; - break; - } - - parent_node = node; - node = node->next; - } - - if (!merged) - { - list_node_t *n; - n = rect_list_unlink_next(to_merge, NULL); - rect_list_append_node(rects, n); - } - else - rect_list_del_next(to_merge, NULL); - } + while (to_merge->head) { + list_node_t *node, *parent_node; + rect_t r1; + int merged; + + r1 = ((rect_node_t *) to_merge->head)->rect; + + merged = 0; + parent_node = NULL; + node = rects->head; + while (node) { + rect_t r2, outer; + int area; + + r2 = ((rect_node_t *) node)->rect; + + _calc_outer_rect_area(r1, r2, &outer); + area = r1.area + r2.area; /* intra area is taken as 0 */ + if (outer.area - area <= accepted_error) { + /* + * remove both r1 and r2, create r3 + * actually r3 uses r2 instance, saves memory + */ + rect_node_t *n; + + n = (rect_node_t *) + rect_list_unlink_next(rects, + parent_node); + n->rect = outer; + rect_list_append_node(to_merge, + (list_node_t *) n); + merged = 1; + break; + } + + parent_node = node; + node = node->next; + } + + if (!merged) { + list_node_t *n; + n = rect_list_unlink_next(to_merge, NULL); + rect_list_append_node(rects, n); + } else + rect_list_del_next(to_merge, NULL); + } } -static void rect_list_add_split_fuzzy_and_merge(list_t *rects, - list_node_t *node, - int split_accepted_error, - int merge_accepted_error) +static void rect_list_add_split_fuzzy_and_merge(list_t * rects, + list_node_t * node, + int split_accepted_error, + int merge_accepted_error) { - list_node_t *n; + list_node_t *n; - n = rect_list_add_split_fuzzy(rects, node, split_accepted_error); - if (n && n->next) - { - list_t to_merge; + n = rect_list_add_split_fuzzy(rects, node, split_accepted_error); + if (n && n->next) { + list_t to_merge; - /* split list into 2 segments, already merged and to merge */ - to_merge.head = n->next; - to_merge.tail = rects->tail; - rects->tail = n; - n->next = NULL; + /* split list into 2 segments, already merged and to merge */ + to_merge.head = n->next; + to_merge.tail = rects->tail; + rects->tail = n; + n->next = NULL; - rect_list_merge_rects(rects, &to_merge, merge_accepted_error); - } + rect_list_merge_rects(rects, &to_merge, + merge_accepted_error); + } } -static inline void _splitter_new(Eina_Tiler *t) +static inline void _splitter_new(Eina_Tiler * t) { - t->splitter.rects = list_zeroed; - t->splitter.need_merge = EINA_FALSE; + t->splitter.rects = list_zeroed; + t->splitter.need_merge = EINA_FALSE; } -static inline void _splitter_del(Eina_Tiler *t) +static inline void _splitter_del(Eina_Tiler * t) { - rect_list_clear(&t->splitter.rects); - rect_list_node_pool_flush(); + rect_list_clear(&t->splitter.rects); + rect_list_node_pool_flush(); } -static inline void _splitter_tile_size_set(Eina_Tiler *t, - int w __UNUSED__, - int h __UNUSED__) +static inline void _splitter_tile_size_set(Eina_Tiler * t, + int w __UNUSED__, + int h __UNUSED__) { - /* TODO are w and h used for something? */ - t->splitter.rects = list_zeroed; + /* TODO are w and h used for something? */ + t->splitter.rects = list_zeroed; } -static inline Eina_Bool _splitter_rect_add(Eina_Tiler *t, Eina_Rectangle *rect) +static inline Eina_Bool _splitter_rect_add(Eina_Tiler * t, + Eina_Rectangle * rect) { - rect_node_t *rn; - - //printf("ACCOUNTING[1]: add_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); - rect->x >>= 1; - rect->y >>= 1; - rect->w += 2; - rect->w >>= 1; - rect->h += 2; - rect->h >>= 1; - - rn = (rect_node_t *)rect_list_node_pool_get(); - rn->_lst = list_node_zeroed; - rect_init(&rn->rect, rect->x, rect->y, rect->w, rect->h); - //printf("ACCOUNTING[2]: add_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); - //testing on my core2 duo desktop - fuzz of 32 or 48 is best. + rect_node_t *rn; + + //printf("ACCOUNTING[1]: add_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); + rect->x >>= 1; + rect->y >>= 1; + rect->w += 2; + rect->w >>= 1; + rect->h += 2; + rect->h >>= 1; + + rn = (rect_node_t *) rect_list_node_pool_get(); + rn->_lst = list_node_zeroed; + rect_init(&rn->rect, rect->x, rect->y, rect->w, rect->h); + //printf("ACCOUNTING[2]: add_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); + //testing on my core2 duo desktop - fuzz of 32 or 48 is best. #define FUZZ 32 - rect_list_add_split_fuzzy_and_merge(&t->splitter.rects, - (list_node_t *)rn, - FUZZ * FUZZ, - FUZZ * FUZZ); - return EINA_TRUE; + rect_list_add_split_fuzzy_and_merge(&t->splitter.rects, + (list_node_t *) rn, + FUZZ * FUZZ, FUZZ * FUZZ); + return EINA_TRUE; } -static inline void _splitter_rect_del(Eina_Tiler *t, Eina_Rectangle *rect) +static inline void _splitter_rect_del(Eina_Tiler * t, + Eina_Rectangle * rect) { - rect_t r; + rect_t r; - if (!t->splitter.rects.head) - return; + if (!t->splitter.rects.head) + return; - rect->x += 1; - rect->y += 1; - rect->x >>= 1; - rect->y >>= 1; - rect->w -= 1; - rect->w >>= 1; - rect->h -= 1; - rect->h >>= 1; + rect->x += 1; + rect->y += 1; + rect->x >>= 1; + rect->y >>= 1; + rect->w -= 1; + rect->w >>= 1; + rect->h -= 1; + rect->h >>= 1; - if ((rect->w <= 0) || (rect->h <= 0)) - return; + if ((rect->w <= 0) || (rect->h <= 0)) + return; - rect_init(&r, rect->x, rect->y, rect->w, rect->h); - //fprintf(stderr, "ACCOUNTING: del_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); + rect_init(&r, rect->x, rect->y, rect->w, rect->h); + //fprintf(stderr, "ACCOUNTING: del_redraw: %4d,%4d %3dx%3d\n", x, y, w, h); - rect_list_del_split_strict(&t->splitter.rects, r); - t->splitter.need_merge = EINA_TRUE; - return; + rect_list_del_split_strict(&t->splitter.rects, r); + t->splitter.need_merge = EINA_TRUE; + return; } -static inline void _splitter_clear(Eina_Tiler *t) +static inline void _splitter_clear(Eina_Tiler * t) { - rect_list_clear(&t->splitter.rects); - t->splitter.need_merge = EINA_FALSE; + rect_list_clear(&t->splitter.rects); + t->splitter.need_merge = EINA_FALSE; } + /* end of splitter algorithm */ -static Eina_Bool _iterator_next(Eina_Iterator_Tiler *it, void **data) +static Eina_Bool _iterator_next(Eina_Iterator_Tiler * it, void **data) { - Eina_Rectangle *rect = (Eina_Rectangle *)data; - list_node_t *n; + Eina_Rectangle *rect = (Eina_Rectangle *) data; + list_node_t *n; - for (n = it->curr; n; n = n->next) - { - rect_t cur; + for (n = it->curr; n; n = n->next) { + rect_t cur; - cur = ((rect_node_t *)n)->rect; + cur = ((rect_node_t *) n)->rect; - rect->x = cur.left << 1; - rect->y = cur.top << 1; - rect->w = cur.width << 1; - rect->h = cur.height << 1; + rect->x = cur.left << 1; + rect->y = cur.top << 1; + rect->w = cur.width << 1; + rect->h = cur.height << 1; - if (eina_rectangle_intersection(rect, &it->tiler->area) == EINA_FALSE) - continue; + if (eina_rectangle_intersection(rect, &it->tiler->area) == + EINA_FALSE) + continue; - if ((rect->w <= 0) || (rect->h <= 0)) - continue; + if ((rect->w <= 0) || (rect->h <= 0)) + continue; - it->curr = n->next; - return EINA_TRUE; - } - return EINA_FALSE; + it->curr = n->next; + return EINA_TRUE; + } + return EINA_FALSE; } -static void *_iterator_get_container(Eina_Iterator_Tiler *it) +static void *_iterator_get_container(Eina_Iterator_Tiler * it) { - EINA_MAGIC_CHECK_TILER_ITERATOR(it, NULL); - return (void *)it->tiler; + EINA_MAGIC_CHECK_TILER_ITERATOR(it, NULL); + return (void *) it->tiler; } -static void _iterator_free(Eina_Iterator_Tiler *it) +static void _iterator_free(Eina_Iterator_Tiler * it) { - EINA_MAGIC_CHECK_TILER_ITERATOR(it); - free(it); + EINA_MAGIC_CHECK_TILER_ITERATOR(it); + free(it); } /*============================================================================* @@ -1112,138 +1044,138 @@ static void _iterator_free(Eina_Iterator_Tiler *it) EAPI Eina_Tiler *eina_tiler_new(int w, int h) { - Eina_Tiler *t; - - t = calloc(1, sizeof(Eina_Tiler)); - t->area.w = w; - t->area.h = h; - t->tile.w = w; - t->tile.h = h; - EINA_MAGIC_SET(t, EINA_MAGIC_TILER); - _splitter_new(t); - return t; + Eina_Tiler *t; + + t = calloc(1, sizeof(Eina_Tiler)); + t->area.w = w; + t->area.h = h; + t->tile.w = w; + t->tile.h = h; + EINA_MAGIC_SET(t, EINA_MAGIC_TILER); + _splitter_new(t); + return t; } -EAPI void eina_tiler_free(Eina_Tiler *t) +EAPI void eina_tiler_free(Eina_Tiler * t) { - EINA_MAGIC_CHECK_TILER(t); - _splitter_del(t); - free(t); + EINA_MAGIC_CHECK_TILER(t); + _splitter_del(t); + free(t); } -EAPI void eina_tiler_tile_size_set(Eina_Tiler *t, int w, int h) +EAPI void eina_tiler_tile_size_set(Eina_Tiler * t, int w, int h) { - EINA_MAGIC_CHECK_TILER(t); - if ((w <= 0) || (h <= 0)) - return; + EINA_MAGIC_CHECK_TILER(t); + if ((w <= 0) || (h <= 0)) + return; - t->tile.w = w; - t->tile.h = h; - _splitter_tile_size_set(t, w, h); + t->tile.w = w; + t->tile.h = h; + _splitter_tile_size_set(t, w, h); } -EAPI Eina_Bool eina_tiler_rect_add(Eina_Tiler *t, const Eina_Rectangle *r) +EAPI Eina_Bool eina_tiler_rect_add(Eina_Tiler * t, + const Eina_Rectangle * r) { - Eina_Rectangle tmp; + Eina_Rectangle tmp; - EINA_MAGIC_CHECK_TILER(t, EINA_FALSE); - if ((r->w <= 0) || (r->h <= 0)) - return EINA_FALSE; + EINA_MAGIC_CHECK_TILER(t, EINA_FALSE); + if ((r->w <= 0) || (r->h <= 0)) + return EINA_FALSE; - tmp = *r; - if (eina_rectangle_intersection(&tmp, &t->area) == EINA_FALSE) - return EINA_FALSE; + tmp = *r; + if (eina_rectangle_intersection(&tmp, &t->area) == EINA_FALSE) + return EINA_FALSE; - if ((tmp.w <= 0) || (tmp.h <= 0)) - return EINA_FALSE; + if ((tmp.w <= 0) || (tmp.h <= 0)) + return EINA_FALSE; - return _splitter_rect_add(t, &tmp); + return _splitter_rect_add(t, &tmp); } -EAPI void eina_tiler_rect_del(Eina_Tiler *t, const Eina_Rectangle *r) +EAPI void eina_tiler_rect_del(Eina_Tiler * t, const Eina_Rectangle * r) { - Eina_Rectangle tmp; + Eina_Rectangle tmp; - EINA_MAGIC_CHECK_TILER(t); - if ((r->w <= 0) || (r->h <= 0)) - return; + EINA_MAGIC_CHECK_TILER(t); + if ((r->w <= 0) || (r->h <= 0)) + return; - tmp = *r; - if (eina_rectangle_intersection(&tmp, &t->area) == EINA_FALSE) - return; + tmp = *r; + if (eina_rectangle_intersection(&tmp, &t->area) == EINA_FALSE) + return; - if ((tmp.w <= 0) || (tmp.h <= 0)) - return; + if ((tmp.w <= 0) || (tmp.h <= 0)) + return; - _splitter_rect_del(t, &tmp); + _splitter_rect_del(t, &tmp); } -EAPI void eina_tiler_clear(Eina_Tiler *t) +EAPI void eina_tiler_clear(Eina_Tiler * t) { - EINA_MAGIC_CHECK_TILER(t); - _splitter_clear(t); + EINA_MAGIC_CHECK_TILER(t); + _splitter_clear(t); } -EAPI Eina_Iterator *eina_tiler_iterator_new(const Eina_Tiler *t) +EAPI Eina_Iterator *eina_tiler_iterator_new(const Eina_Tiler * t) { - Eina_Iterator_Tiler *it; + Eina_Iterator_Tiler *it; - EINA_MAGIC_CHECK_TILER(t, NULL); + EINA_MAGIC_CHECK_TILER(t, NULL); - it = calloc(1, sizeof (Eina_Iterator_Tiler)); - if (!it) - return NULL; + it = calloc(1, sizeof(Eina_Iterator_Tiler)); + if (!it) + return NULL; - it->tiler = t; + it->tiler = t; - if (t->splitter.need_merge == EINA_TRUE) - { - list_t to_merge; - splitter_t *sp; + if (t->splitter.need_merge == EINA_TRUE) { + list_t to_merge; + splitter_t *sp; - sp = (splitter_t *)&(t->splitter); - to_merge = t->splitter.rects; - sp->rects = list_zeroed; - rect_list_merge_rects(&sp->rects, &to_merge, FUZZ * FUZZ); - sp->need_merge = 0; - } + sp = (splitter_t *) & (t->splitter); + to_merge = t->splitter.rects; + sp->rects = list_zeroed; + rect_list_merge_rects(&sp->rects, &to_merge, FUZZ * FUZZ); + sp->need_merge = 0; + } - it->curr = it->tiler->splitter.rects.head; + it->curr = it->tiler->splitter.rects.head; - it->iterator.version = EINA_ITERATOR_VERSION; - it->iterator.next = FUNC_ITERATOR_NEXT(_iterator_next); - it->iterator.get_container = FUNC_ITERATOR_GET_CONTAINER( - _iterator_get_container); - it->iterator.free = FUNC_ITERATOR_FREE(_iterator_free); + it->iterator.version = EINA_ITERATOR_VERSION; + it->iterator.next = FUNC_ITERATOR_NEXT(_iterator_next); + it->iterator.get_container = + FUNC_ITERATOR_GET_CONTAINER(_iterator_get_container); + it->iterator.free = FUNC_ITERATOR_FREE(_iterator_free); - EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_ITERATOR); - EINA_MAGIC_SET(it, EINA_MAGIC_TILER_ITERATOR); + EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_ITERATOR); + EINA_MAGIC_SET(it, EINA_MAGIC_TILER_ITERATOR); - return &it->iterator; + return &it->iterator; } -struct _Eina_Tile_Grid_Slicer_Iterator -{ - Eina_Iterator iterator; - Eina_Tile_Grid_Slicer priv; +struct _Eina_Tile_Grid_Slicer_Iterator { + Eina_Iterator iterator; + Eina_Tile_Grid_Slicer priv; }; -typedef struct _Eina_Tile_Grid_Slicer_Iterator Eina_Tile_Grid_Slicer_Iterator; +typedef struct _Eina_Tile_Grid_Slicer_Iterator + Eina_Tile_Grid_Slicer_Iterator; static void -eina_tile_grid_slicer_iterator_free(Eina_Tile_Grid_Slicer_Iterator *it) +eina_tile_grid_slicer_iterator_free(Eina_Tile_Grid_Slicer_Iterator * it) { - EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_NONE); - free(it); + EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_NONE); + free(it); } static Eina_Bool -eina_tile_grid_slicer_iterator_next(Eina_Tile_Grid_Slicer_Iterator *it, - void **data) +eina_tile_grid_slicer_iterator_next(Eina_Tile_Grid_Slicer_Iterator * it, + void **data) { - return eina_tile_grid_slicer_next - (&it->priv, (const Eina_Tile_Grid_Info **)data); + return eina_tile_grid_slicer_next + (&it->priv, (const Eina_Tile_Grid_Info **) data); } /** @@ -1266,30 +1198,30 @@ eina_tile_grid_slicer_iterator_next(Eina_Tile_Grid_Slicer_Iterator *it, * region, then @c full flag * is set. */ -EAPI Eina_Iterator * -eina_tile_grid_slicer_iterator_new(int x, - int y, - int w, - int h, - int tile_w, - int tile_h) +EAPI Eina_Iterator *eina_tile_grid_slicer_iterator_new(int x, + int y, + int w, + int h, + int tile_w, + int tile_h) { - Eina_Tile_Grid_Slicer_Iterator *it; + Eina_Tile_Grid_Slicer_Iterator *it; - it = calloc(1, sizeof(*it)); - if (!it) - { - eina_error_set(EINA_ERROR_OUT_OF_MEMORY); - return NULL; - } + it = calloc(1, sizeof(*it)); + if (!it) { + eina_error_set(EINA_ERROR_OUT_OF_MEMORY); + return NULL; + } - EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_ITERATOR); + EINA_MAGIC_SET(&it->iterator, EINA_MAGIC_ITERATOR); - it->iterator.version = EINA_ITERATOR_VERSION; - it->iterator.next = FUNC_ITERATOR_NEXT(eina_tile_grid_slicer_iterator_next); - it->iterator.free = FUNC_ITERATOR_FREE(eina_tile_grid_slicer_iterator_free); + it->iterator.version = EINA_ITERATOR_VERSION; + it->iterator.next = + FUNC_ITERATOR_NEXT(eina_tile_grid_slicer_iterator_next); + it->iterator.free = + FUNC_ITERATOR_FREE(eina_tile_grid_slicer_iterator_free); - eina_tile_grid_slicer_setup(&it->priv, x, y, w, h, tile_w, tile_h); + eina_tile_grid_slicer_setup(&it->priv, x, y, w, h, tile_w, tile_h); - return &it->iterator; + return &it->iterator; } |