rpst.c | 376 rpst_iterate_first(struct rpst_tree *t, uint64_t max_y, uint64_t min_x, 381 KASSERT(min_x <= max_x); 386 if (rpst_height2max(t->t_height) < min_x) { 391 it->it_idx = (min_x & rpst_startmask(t)) != 0; 394 it->it_min_x = min_x; 418 rpst_minidx(const struct rpst_node *n, uint64_t min_x, uint64_t mask) 421 if (rpst_node_on_edge_p(n, min_x, mask)) { 422 return (min_x & mask) != 0; 435 const uint64_t min_x = it->it_min_x; local in function:rpst_iterate_next 451 KASSERT(idx >= rpst_minidx(n, min_x, mask)) 614 uint64_t min_x = UINT64_MAX; local in function:main [all...] |