START
#define COUNT_LINKED_LIST(COUNT, PTYPE, START, FIELD) \
PTYPE cll_ptr = (START); \
tm_Time_F(START);
tm_Time_F(START);
if (s == START) {
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
Time_F(START);
#define INTERVAL_TREE_DEFINE(type, field, valtype, dummy, START, LAST, \
__IT_DEFINE_ITER_FROM(type, field, valtype, START, LAST, name) \
__IT_DEFINE_INSERT(type, field, START, attr, name) \
#define __IT_DEFINE_ITER_FROM(type, field, valtype, START, LAST, name) \
if (LAST(node) >= start && START(node) <= last) \
else if (START(node) > last) \
#define __IT_DEFINE_INSERT(type, field, START, attr, name) \
if (START(node) < START(iter_node)) \
INTERVAL_TREE_DEFINE(struct interval_tree_node, rb, unsigned long,, START,