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

  /src/sys/sys/
rbtree.h 102 #define RB_TREE_MIN(T) rb_tree_iterate((T), NULL, RB_DIR_LEFT)
103 #define RB_TREE_MAX(T) rb_tree_iterate((T), NULL, RB_DIR_RIGHT)
104 #define RB_TREE_NEXT(T, N) rb_tree_iterate((T), (N), RB_DIR_RIGHT)
105 #define RB_TREE_PREV(T, N) rb_tree_iterate((T), (N), RB_DIR_LEFT)
203 void * rb_tree_iterate(rb_tree_t *, void *, const unsigned int);
  /src/sys/external/bsd/drm2/include/linux/
interval_tree.h 141 next = rb_tree_iterate(&root->rb_root.rbr_tree, node, RB_DIR_RIGHT);
interval_tree_generic.h 124 __next = rb_tree_iterate(&__root->rb_root.rbr_tree, __node, \
  /src/sys/ufs/chfs/
chfs_readinode.c 332 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
373 struct rb_node *next = rb_tree_iterate(&rii->tdi_root, this, RB_DIR_RIGHT);
421 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT);
436 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
446 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
456 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT);
460 node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_RIGHT);
904 pen = (struct chfs_tmp_dnode_info *)rb_tree_iterate(&rii->tdi_root, last, RB_DIR_LEFT);
924 vers_next = (struct chfs_tmp_dnode_info *)rb_tree_iterate(&ver_tree, this, RB_DIR_LEFT);
951 vers_next = (struct chfs_tmp_dnode_info *)rb_tree_iterate(&ver_tree, this, RB_DIR_LEFT)
    [all...]
chfs.h 264 #define frag_next(tree, frag) (struct chfs_node_frag *)rb_tree_iterate(tree, frag, RB_DIR_RIGHT)
265 #define frag_prev(tree, frag) (struct chfs_node_frag *)rb_tree_iterate(tree, frag, RB_DIR_LEFT)
  /src/usr.sbin/ldpd/
label.c 223 lnext = rb_tree_iterate(&labels_tree, l, RB_DIR_RIGHT);
324 return rb_tree_iterate(&labels_tree, l, RB_DIR_RIGHT);
ldp_peer.c 580 return rb_tree_iterate(&p->label_mapping_tree, map,
  /src/sys/kern/
bufq_priocscan.c 142 return rb_tree_iterate(&q->cq_buffers, NULL, RB_DIR_LEFT) == NULL;
162 bp = rb_tree_iterate(&q->cq_buffers, NULL, RB_DIR_LEFT);
  /src/lib/libc/stdlib/
_env.c 223 next = rb_tree_iterate(&env_tree, node, RB_DIR_RIGHT);
  /src/sys/external/bsd/ipf/netinet/
ipf_rb.h 51 while ((rb = rb_tree_iterate(head, NULL, RB_DIR_RIGHT)) != NULL) {\
60 # define RBI_ISEMPTY(_h) (rb_tree_iterate(_h, NULL, RB_DIR_RIGHT) == NULL)
  /src/sys/external/bsd/drm2/linux/
linux_idr.c 370 search = rb_tree_iterate(&idr->idr_tree, search, RB_DIR_RIGHT);
  /src/common/lib/libc/gen/
rb.c 66 __weak_alias(rb_tree_iterate, _rb_tree_iterate)
808 standin = RB_ITEMTONODE(rbto, rb_tree_iterate(rbt, object, which));
964 rb_tree_iterate(struct rb_tree *rbt, void *object, const unsigned int direction) function in typeref:typename:void *
  /src/share/man/man3/
Makefile 239 rbtree.3 rb_tree_iterate.3
  /src/sys/uvm/
uvm_physseg.c 428 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
439 return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
uvm_map.c 615 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_LEFT);
623 trtmp = rb_tree_iterate(&map->rb_tree, tmp, RB_DIR_RIGHT);
  /src/sys/fs/msdosfs/
msdosfs_denode.c 731 nfhp = rb_tree_iterate(&fh_rbtree, fhp, RB_DIR_RIGHT);
  /src/lib/libc/include/
namespace.h 945 #define rb_tree_iterate _rb_tree_iterate macro
  /src/sys/fs/udf/
udf_subr.c 6428 n_udf_node = rb_tree_iterate(&ump->udf_node_tree,
6540 udf_next_node = rb_tree_iterate(&ump->udf_node_tree,

Completed in 28 milliseconds