Home | History | Annotate | Download | only in gen

Lines Matching defs:it

360 rpst_iterator_match_p(const struct rpst_node *n, const struct rpst_iterator *it)
363 	if (n->n_y > it->it_max_y) {
366 	if (n->n_x < it->it_min_x) {
369 	if (n->n_x > it->it_max_x) {
377     uint64_t max_x, struct rpst_iterator *it)
389 	it->it_tree = t;
390 	it->it_cur = n;
391 	it->it_idx = (min_x & rpst_startmask(t)) != 0;
392 	it->it_level = 0;
393 	it->it_max_y = max_y;
394 	it->it_min_x = min_x;
395 	it->it_max_x = max_x;
396 	return rpst_iterate_next(it);
429 rpst_iterate_next(struct rpst_iterator *it)
434 	const uint64_t max_y = it->it_max_y;
435 	const uint64_t min_x = it->it_min_x;
436 	const uint64_t max_x = it->it_max_x;
442 	t = it->it_tree;
443 	n = it->it_cur;
444 	idx = it->it_idx;
445 	level = it->it_level;
448 	KASSERT(n == t->t_root || rpst_iterator_match_p(n, it));
462 			it->it_cur = n;
463 			it->it_idx = idx;
464 			it->it_level = level;
465 			KASSERT(rpst_iterator_match_p(n, it));
567 	struct rpst_iterator it;
577 	for (rn = rpst_iterate_first(&t, max_y, min_x, max_x, &it);
579 	    rn = rpst_iterate_next(&it)) {
596 		    n->found == rpst_iterator_match_p(&n->n, &it));
609 	struct rpst_iterator it;
623 	assert(NULL == rpst_iterate_first(&t, UINT64_MAX, 0, UINT64_MAX, &it));