introduce the NODES_FOREACH and GREP_FIRST macros
This commit is contained in:
parent
443753bea6
commit
0e2d58347c
|
@ -25,6 +25,21 @@
|
||||||
#define FOR_TABLE(workspace) \
|
#define FOR_TABLE(workspace) \
|
||||||
for (int cols = 0; cols < (workspace)->cols; cols++) \
|
for (int cols = 0; cols < (workspace)->cols; cols++) \
|
||||||
for (int rows = 0; rows < (workspace)->rows; rows++)
|
for (int rows = 0; rows < (workspace)->rows; rows++)
|
||||||
|
|
||||||
|
#define NODES_FOREACH(head) \
|
||||||
|
for (Con *child = (Con*)-1; (child == (Con*)-1) && ((child = 0), true);) \
|
||||||
|
TAILQ_FOREACH(child, &((head)->nodes_head), nodes)
|
||||||
|
|
||||||
|
/* greps the ->nodes of the given head and returns the first node that matches the given condition */
|
||||||
|
#define GREP_FIRST(dest, head, condition) \
|
||||||
|
NODES_FOREACH(head) { \
|
||||||
|
if (!(condition)) \
|
||||||
|
continue; \
|
||||||
|
\
|
||||||
|
(dest) = child; \
|
||||||
|
break; \
|
||||||
|
}
|
||||||
|
|
||||||
#define FREE(pointer) do { \
|
#define FREE(pointer) do { \
|
||||||
if (pointer != NULL) { \
|
if (pointer != NULL) { \
|
||||||
free(pointer); \
|
free(pointer); \
|
||||||
|
|
Loading…
Reference in New Issue