HomeSort by: relevance | last modified time | path
    Searched refs:rb_tree_find_node (Results 1 - 25 of 35) sorted by relevancy

1 2

  /src/sys/external/bsd/drm2/drm/
drm_vma_manager.c 255 node = rb_tree_find_node(&mgr->vom_nodes, &key);
305 rb_tree_find_node(&node->von_files, file);
320 (rb_tree_find_node(&node->von_files, file) != NULL);
  /src/lib/libc/stdlib/
_env.c 161 node = rb_tree_find_node(&env_tree, envvar);
200 node = rb_tree_find_node(&env_tree, envvar);
216 node = rb_tree_find_node(&env_tree, environ[num_entries]);
jemalloc.c 2812 node = rb_tree_find_node(&huge, &key);
2896 node = rb_tree_find_node(&huge, &key);
3089 node = rb_tree_find_node(&huge, &key);
  /src/sys/external/bsd/drm2/linux/
linux_idr.c 215 node = rb_tree_find_node(&idr->idr_tree, &id);
248 node = rb_tree_find_node(&idr->idr_tree, &id);
269 node = rb_tree_find_node(&idr->idr_tree, &id);
linux_xa.c 118 n = rb_tree_find_node(&xa->xa_tree, &key64);
237 n = rb_tree_find_node(&xa->xa_tree, &key64);
linux_kmap.c 259 rb_tree_find_node(&linux_kmap_entries, &paddr);
  /src/sys/lib/libunwind/
AddressSpace.hpp 248 n = (Range *)rb_tree_find_node(&segmentTree, &pc);
306 Range *n = static_cast<Range *>(rb_tree_find_node(&segmentTree, &pcStart));
327 n = (Range *)rb_tree_find_node(&dsoTree, &ehFrameBase);
  /src/sys/fs/msdosfs/
msdosfs_denode.c 659 fhp = rb_tree_find_node(&fh_rbtree, &fhkey);
685 fhp = rb_tree_find_node(&fh_rbtree, &fhkey);
708 fhp = rb_tree_find_node(&fh_rbtree, &fhkey);
  /src/common/lib/libprop/
prop_number.c 300 opn = rb_tree_find_node(&_prop_number_tree, pnv);
325 opn = rb_tree_find_node(&_prop_number_tree, pnv);
prop_dictionary.c 304 opdk = rb_tree_find_node(&_prop_dict_keysym_tree, key);
340 opdk = rb_tree_find_node(&_prop_dict_keysym_tree, key);
  /src/sys/external/bsd/drm2/i2c/
drm_encoder_slave.c 144 driver = rb_tree_find_node(&drm_i2c_encoder_drivers.tree, info->type);
  /src/usr.sbin/ldpd/
label.c 192 return rb_tree_find_node(&labels_tree, &l);
ldp_peer.c 520 return rb_tree_find_node(&p->label_mapping_tree, &rv);
  /src/sys/sys/
rbtree.h 199 void * rb_tree_find_node(rb_tree_t *, const void *);
  /src/usr.bin/make/filemon/
filemon_ktrace.c 454 S = rb_tree_find_node(&F->active, &key);
469 S = rb_tree_find_node(&F->active, &key);
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/
intel_engine_user.c 72 return rb_tree_find_node(&i915->uabi_engines.rbr_tree, key);
  /src/sys/external/bsd/drm2/dist/drm/
drm_prime.c 248 member = rb_tree_find_node(&prime_fpriv->handles.rbr_tree, &handle);
279 member = rb_tree_find_node(&prime_fpriv->dmabufs.rbr_tree, &dma_buf);
312 member = rb_tree_find_node(&prime_fpriv->dmabufs.rbr_tree, &dma_buf);
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_scheduler.c 157 p = rb_tree_find_node(&execlists->queue.rb_root.rbr_tree, &prio);
i915_active.c 301 node = rb_tree_find_node(&ref->tree.rbr_tree, &idx);
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/
nouveau_nvkm_core_object.c 41 object = rb_tree_find_node(&client->objtree, &handle);
  /src/share/man/man3/
Makefile 236 rbtree.3 rb_tree_find_node.3 \
  /src/sys/external/bsd/ipf/netinet/
ipf_rb.h 61 # define RBI_SEARCH(_n, _h, _k) rb_tree_find_node(_h, _k)
  /src/sys/dev/usb/
ugen.c 235 KASSERT(rb_tree_find_node(&ugenif.tree, &i) == NULL);
239 KASSERT(rb_tree_find_node(&ugenif.tree, &i) == sc);
254 KASSERT(rb_tree_find_node(&ugenif.tree, &sc->sc_unit) == sc);
266 sc = rb_tree_find_node(&ugenif.tree, &unit);
  /src/common/lib/libc/gen/
rb.c 61 __weak_alias(rb_tree_find_node, _rb_tree_find_node)
123 rb_tree_find_node(struct rb_tree *rbt, const void *key) function in typeref:typename:void *
  /src/sys/kern/
sys_futex.c 605 f = rb_tree_find_node(&futex_tab.oa, fk);
607 f = rb_tree_find_node(&futex_tab.va, fk);

Completed in 32 milliseconds

1 2