version 1.7, 2018/08/28 03:34:53 |
version 1.7.2.3, 2019/01/18 08:50:56 |
Line 119 interval_tree_iter_first(struct rb_root |
|
Line 119 interval_tree_iter_first(struct rb_root |
|
node = rb_tree_find_node_geq(&root->rbr_tree, &start); |
node = rb_tree_find_node_geq(&root->rbr_tree, &start); |
if (node == NULL) |
if (node == NULL) |
return NULL; |
return NULL; |
KASSERT(node->start <= start); |
|
if (last < node->start) |
if (last < node->start) |
return NULL; |
return NULL; |
|
KASSERT(node->start <= last && node->last >= start); |
|
|
return node; |
return node; |
} |
} |
Line 141 interval_tree_iter_next(struct rb_root * |
|
Line 141 interval_tree_iter_next(struct rb_root * |
|
next = rb_tree_iterate(&root->rbr_tree, node, RB_DIR_RIGHT); |
next = rb_tree_iterate(&root->rbr_tree, node, RB_DIR_RIGHT); |
if (next == NULL) |
if (next == NULL) |
return NULL; |
return NULL; |
KASSERT(node->start <= start); |
if (last < next->start) |
if (last < node->start) |
|
return NULL; |
return NULL; |
|
KASSERT(next->start <= last && next->last >= start); |
|
|
return next; |
return next; |
} |
} |