HomeSort by: relevance | last modified time | path
    Searched refs:radix_tree (Results 1 - 4 of 4) sorted by relevancy

  /src/sys/sys/
radixtree.h 32 struct radix_tree { struct
57 void radix_tree_init_tree(struct radix_tree *);
58 void radix_tree_fini_tree(struct radix_tree *);
59 bool radix_tree_empty_tree_p(struct radix_tree *);
65 int radix_tree_insert_node(struct radix_tree *, uint64_t, void *);
66 void *radix_tree_replace_node(struct radix_tree *, uint64_t, void *);
67 void *radix_tree_remove_node(struct radix_tree *, uint64_t);
68 void *radix_tree_lookup_node(struct radix_tree *, uint64_t);
69 unsigned int radix_tree_gang_lookup_node(struct radix_tree *, uint64_t,
71 unsigned int radix_tree_gang_lookup_node_reverse(struct radix_tree *, uint64_t
    [all...]
  /src/sys/external/bsd/drm2/include/linux/
radix-tree.h 49 struct radix_tree rtr_tree;
  /src/sys/uvm/
uvm_object.h 62 struct radix_tree uo_pages; /* tree of pages */
  /src/common/lib/libc/gen/
radixtree.c 88 * (struct radix_tree) without allocating any intermediate nodes. In that
223 path_pptr(const struct radix_tree *t, const struct radix_tree_path *p,
232 path_node(const struct radix_tree * t, const struct radix_tree_path *p,
247 radix_tree_init_tree(struct radix_tree *t)
261 radix_tree_fini_tree(struct radix_tree *t)
275 radix_tree_empty_tree_p(struct radix_tree *t)
291 radix_tree_empty_tagged_tree_p(struct radix_tree *t, unsigned int tagmask)
450 radix_tree_grow(struct radix_tree *t, unsigned int newheight)
502 radix_tree_lookup_ptr(struct radix_tree *t, uint64_t idx,
595 radix_tree_undo_insert_node(struct radix_tree *t, uint64_t idx
    [all...]

Completed in 16 milliseconds