Lines Matching refs:start
19 * ITSTART(n): start endpoint of ITSTRUCT node n
42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
51 if (start < ITSTART(parent)) \
72 * Iterate over intervals intersecting [start;last] \
74 * Note that a node's interval intersects [start;last] iff: \
77 * Cond2: start <= ITLAST(node) \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
85 * Loop invariant: start <= node->ITSUBTREE \
91 if (start <= left->ITSUBTREE) { \
105 if (start <= ITLAST(node)) /* Cond2 */ \
110 if (start <= node->ITSUBTREE) \
120 ITTYPE start, ITTYPE last) \
134 * 'start' and largest 'last' in the tree. For the later, we \
141 if (node->ITSUBTREE < start) \
148 return ITPREFIX ## _subtree_search(node, start, last); \
152 ITPREFIX ## _iter_next(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
166 if (start <= right->ITSUBTREE) \
168 start, last); \
181 /* Check if the node intersects [start;last] */ \
184 else if (start <= ITLAST(node)) /* Cond2 */ \