Lines Matching refs:root
21 bool has_vnode(struct vnode *root, uint32_t entry, size_t len,
24 assert(root != NULL);
25 assert(root->is_vnode);
32 for (n = root->u.vnode.children; n; n = n->next) {
87 * \brief Starting at a given root, return the vnode with entry equal to #entry
89 struct vnode *find_vnode(struct vnode *root, uint16_t entry)
91 assert(root != NULL);
92 assert(root->is_vnode);
95 for(n = root->u.vnode.children; n != NULL; n = n->next) {
114 bool inside_region(struct vnode *root, uint32_t entry, uint32_t npages)
116 assert(root != NULL);
117 assert(root->is_vnode);
121 for (n = root->u.vnode.children; n; n = n->next) {
133 void remove_vnode(struct vnode *root, struct vnode *item)
135 assert(root->is_vnode);
136 struct vnode *walk = root->u.vnode.children;
144 root->u.vnode.children = walk->next;
157 errval_t alloc_vnode(struct pmap_x86 *pmap, struct vnode *root,
199 err = vnode_map(root->u.vnode.invokable, newvnode->u.vnode.cap, entry,
208 newvnode->next = root->u.vnode.children;
209 root->u.vnode.children = newvnode;
216 void remove_empty_vnodes(struct pmap_x86 *pmap, struct vnode *root,
221 for (struct vnode *n = root->u.vnode.children; n; n = n->next) {
235 err = vnode_unmap(root->u.vnode.cap, n->mapping);
275 remove_vnode(root, n);
286 * We abuse the slot of the first entry, which is the root and thus is always
291 uint8_t depth; ///< Depth of this node (0 = root)
346 err = serialise_tree(0, &pmapx->root, out, outlen, &outpos);
425 err = deserialise_tree(pmap, &in, &inlen, 1, &pmapx->root);