Home | History | Annotate | Download | only in gen

Lines Matching defs:max_x

377     uint64_t max_x, struct rpst_iterator *it)
381 	KASSERT(min_x <= max_x);
395 	it->it_max_x = max_x;
407 rpst_maxidx(const struct rpst_node *n, uint64_t max_x, uint64_t mask)
410 	if (rpst_node_on_edge_p(n, max_x, mask)) {
411 		return (max_x & mask) != 0;
436 	const uint64_t max_x = it->it_max_x;
447 	maxidx = rpst_maxidx(n, max_x, mask);
452 	KASSERT(maxidx == rpst_maxidx(n, max_x, mask));
461 		if (min_x <= n->n_x && n->n_x <= max_x) {
483 		maxidx = rpst_maxidx(n, max_x, mask);
501 	maxidx = rpst_maxidx(n, max_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);
615 	uint64_t max_x = 0;
646 		if (n->n.n_x > max_x) {
647 			max_x = n->n.n_x;
678 	assert(max_x == UINT64_MAX ||
679 	    0 == query(UINT64_MAX, max_x + 1, UINT64_MAX));
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);