#define EINA_ACCESSOR_FOREACH(accessor, counter, data) for ((counter) = 0; \
eina_accessor_data_get(( \
accessor), \
- (counter), (void **)&(data)); (counter)++)
+ ( \
+ counter), \
+ ( \
+ void \
+ * \
+ *) \
+ &(data)); \
+ (counter)++)
/**
* @}
#define EINA_INLIST_FOREACH(list, l) for (l = NULL, \
l = \
(list ? _EINA_INLIST_CONTAINER(l, \
- list) : NULL); \
+ list) \
+ : NULL); \
l; \
l = \
(EINA_INLIST_GET(l)->next ? \
_EINA_INLIST_CONTAINER(l, \
EINA_INLIST_GET( \
l)-> \
- next) : NULL))
+ next) : \
+ NULL))
#define EINA_INLIST_REVERSE_FOREACH(list, l) for (l = NULL, \
l = \
(list ? \
- _EINA_INLIST_CONTAINER(l, list->last) : NULL); \
+ _EINA_INLIST_CONTAINER(l, \
+ list \
+ -> \
+ last) \
+ : NULL); \
l; \
l = \
(EINA_INLIST_GET(l)->prev \
eina_list_data_get(l); \
l; \
l = eina_list_prev(l), \
- data = eina_list_data_get(l))
+ data = \
+ eina_list_data_get(l))
/**
* @def EINA_LIST_FOREACH_SAFE
#define EINA_LIST_FOREACH_SAFE(list, l, l_next, data) for (l = list, \
l_next = \
eina_list_next(l), \
- data = eina_list_data_get(l); \
+ data = \
+ eina_list_data_get( \
+ l); \
l; \
l = l_next, l_next = \
- eina_list_next(l), data = eina_list_data_get(l))
+ eina_list_next(l), \
+ data = \
+ eina_list_data_get( \
+ l))
/**
* @def EINA_LIST_REVERSE_FOREACH_SAFE
#define EINA_LIST_REVERSE_FOREACH_SAFE(list, l, l_prev, data) for (l = \
eina_list_last( \
list), \
- l_prev = eina_list_prev(l), data = eina_list_data_get(l); \
+ l_prev = \
+ eina_list_prev( \
+ l), \
+ data = \
+ eina_list_data_get( \
+ l); \
l; \
l = l_prev, \
- l_prev = eina_list_prev(l), data = eina_list_data_get(l))
+ l_prev = \
+ eina_list_prev( \
+ l), \
+ data = \
+ eina_list_data_get( \
+ l))
/**
* @def EINA_LIST_FREE
#define EINA_LIST_FREE(list, data) for (data = eina_list_data_get(list); list; \
list = \
eina_list_remove_list(list, \
- list), data = eina_list_data_get(list))
+ list), data = \
+ eina_list_data_get(list))
#include "eina_inline_list.x"
/* fp >= 1 */
if (fp >= 0x0000000100000000LL)
- while (fp >= 0x0000000100000000LL)
- {
- p++;
- /* fp /= 2 */
- fp >>= 1;
- }
- /* fp < 0.5 */
+ {
+ while (fp >= 0x0000000100000000LL)
+ {
+ p++;
+ /* fp /= 2 */
+ fp >>= 1;
+ } /* fp < 0.5 */
+ }
else if (fp < 0x80000000)
while (fp < 0x80000000)
{
i < idx && over != NULL;
++i, over = over->next)
;
-
else
{
middle = it->index >> 1;
return NULL;
if (!move_list)
- return list; /* Promoting head to be head. */
+ return list; /* Promoting head to be head. */
if (move_list == list)
return list;
return NULL;
if (!move_list)
- return list; /* Demoting tail to be tail. */
+ return list; /* Demoting tail to be tail. */
if (move_list == list->accounting->last)
return list;
/* Update pointer list if necessary. */
if (list == move_list)
- list = move_list->next; /* Remove the demoted item from the list. */
+ list = move_list->next; /* Remove the demoted item from the list. */
if (move_list->prev)
move_list->prev->next = move_list->next;
snprintf(file, length, "%s/%s", path, name);
m = eina_module_new(file);
if (!m)
- return; /* call the user provided cb on this module */
+ return; /* call the user provided cb on this module */
if (!cb_data->cb(m, cb_data->data))
eina_module_free(m);
}
}
-
#endif /* ! HAVE_DLADDR */
return NULL;
}
if (r)
- empty = _eina_rectangle_merge_list(empty, r); /* Return empty */
+ empty = _eina_rectangle_merge_list(empty, r); /* Return empty */
return empty;
}
fprintf(stderr, "eina share_common statistic:\n");
fprintf(stderr,
" * maximum shared strings : %i\n",
- share->population.max);
+ share->population.max);
fprintf(stderr,
" * maximum shared strings per node : %i\n",
- share->max_node_population);
+ share->max_node_population);
for (i = 0;
i < sizeof (share->population_group) /
for (i = 0; i < EINA_SHARE_COMMON_BUCKETS; i++)
{
if (!share->share->buckets[i])
- continue; // printf("DDD: BUCKET # %i (HEAD=%i, NODE=%i)\n", i,
+ continue; // printf("DDD: BUCKET # %i (HEAD=%i, NODE=%i)\n", i,
// sizeof(Eina_Share_Common_Head), sizeof(Eina_Share_Common_Node));
it = eina_rbtree_iterator_prefix(
if (siz != 0)
{
*d = '\0'; /* NUL-terminate dst */
+
}
while (*s++)
/* resize the buffer if necessary */
if (EINA_UNLIKELY(!_eina_strbuf_common_grow(_STRBUF_CSIZE, buf,
buf->len - len1 + len2)))
- return EINA_FALSE; /* move the existing text */
+ return EINA_FALSE; /* move the existing text */
memmove(buf->buf + pos + len2, buf->buf + pos + len1,
buf->len - pos - len1);
}
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; */
+ {
+ /* (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
- * | | | | -> | | + | |
- * | `-|--' `-' `--'
- * `----'
- */
+ {
+ /* .----.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; */
+ 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,
* this rect check was totally useless,
* should never happen
*/
- /* prev_cur_node = cur_node; */
+/* prev_cur_node = cur_node; */
/* cur_node = cur_node->next; */
printf("Should not get here!\n");
abort();
return (const Eina_Unicode *)eina_share_common_add_length(ustringshare_share,
(const char *)str,
slen *
- sizeof(Eina_Unicode),
+ sizeof(
+ Eina_Unicode),
sizeof(
Eina_Unicode));
}
check:
/* already on the last order */
if (block->order + b->min_order == b->max_order)
- goto end; /* get the buddy */
+ goto end; /* get the buddy */
buddy = &b->blocks[index ^ (1 << block->order)];
if (!buddy->available)
- goto end; /* merge two blocks */
+ goto end; /* merge two blocks */
b->areas[block->order] = eina_inlist_remove(b->areas[block->order],
EINA_INLIST_GET(buddy));
#ifdef DEBUG
if (pool->usage > 0)
INF(
- "Bad news we are destroying memory still referenced in mempool [%s]\n",
- pool->name);
+ "Bad news we are destroying memory still referenced in mempool [%s]\n",
+ pool->name);
if (pool->over > 0)
INF("Bad news we are loosing track of pointer from mempool [%s]\n",
Evas_Stringshare_El *el, *pel = NULL;
if (!str)
- return NULL; // if (!f)
+ return NULL; // if (!f)
// {
// char bf[256];