void \
* \
*) \
- &(data)); \
+ &( \
+ data)); \
(counter)++)
/**
/* 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)
{
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);
}
if (r)
- empty = _eina_rectangle_merge_list(empty, r); /* Return empty */
+ {
+ empty = _eina_rectangle_merge_list(empty, r); /* Return empty */
+
+ }
return empty;
}
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 (n == 0)
{
if (siz != 0)
- {
- *d = '\0'; /* NUL-terminate dst */
-
- }
+ *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);
else if (str[3] == '\0')
slen = 3;
else
- {
- slen = 4; /* handled later */
-
- }
+ slen = 4; /* handled later */
if (slen < 2)
return;
}
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 */
-
- }
+ /* (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.height); /* not necessary to keep this, r (b) will be destroyed */
/* r.width -= w_2; */
}
;
if (!*j) /*if we got to the end of j this means we got a full match */
- return (Eina_Unicode *)haystack; /* return the new base position */
+ {
+ return (Eina_Unicode *)haystack; /* return the new base position */
+ }
}
return NULL;
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));
Evas_Stringshare_El *el, *pel = NULL;
if (!str)
- return NULL; // if (!f)
+ {
+ return NULL; // if (!f)
+
+ }
// {
// char bf[256];