Lines Matching defs:min_x
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;
451 KASSERT(idx >= rpst_minidx(n, min_x, mask));
461 if (min_x <= n->n_x && n->n_x <= max_x) {
500 idx = rpst_minidx(n, min_x, mask);
563 query(uint64_t max_y, uint64_t min_x, uint64_t max_x)
572 printf("querying max_y=%" PRIu64 " min_x=%" PRIu64 " max_x=%" PRIu64
574 max_y, min_x, max_x);
577 for (rn = rpst_iterate_first(&t, max_y, min_x, max_x, &it);
614 uint64_t min_x = UINT64_MAX;
643 if (n->n.n_x < min_x) {
644 min_x = n->n.n_x;
680 assert(min_x == 0 || 0 == query(UINT64_MAX, 0, min_x - 1));
682 done = query(max_y, min_x, max_x);
688 w = max_x - min_x;
689 query(max_y / 2, min_x, max_x);
690 query(max_y, min_x + w / 2, max_x);
691 query(max_y / 2, min_x + w / 2, max_x);
692 query(max_y / 2, min_x, max_x - w / 2);
693 query(max_y / 2, min_x + w / 3, max_x - w / 3);
694 query(max_y - 1, min_x + 1, max_x - 1);