Lines Matching refs:walk
136 struct vnode *walk = root->u.vnode.children;
138 while (walk) {
139 if (walk == item) {
141 prev->next = walk->next;
144 root->u.vnode.children = walk->next;
148 prev = walk;
149 walk = walk->next;
284 * walk of the tree. Each vnode is encoded as an entry in an array.
318 // depth-first walk
457 struct vregion *walk = pmap->vspace->head;
458 assert(walk != NULL); // assume there's always at least one existing entry
469 if (minva + size <= vregion_get_base_addr(walk)) {
474 while (walk->next) { // Try to insert between existing mappings
475 genvaddr_t walk_base = vregion_get_base_addr(walk);
476 genvaddr_t walk_size = ROUND_UP(vregion_get_size(walk), BASE_PAGE_SIZE);
478 genvaddr_t next_base = vregion_get_base_addr(walk->next);
489 walk = walk->next;
493 vaddr = ROUND_UP((vregion_get_base_addr(walk)
494 + ROUND_UP(vregion_get_size(walk), BASE_PAGE_SIZE)),