Lines Matching refs:entry
75 * 1) Space efficient; only two pointers per entry.
94 * of the largest entry in ltree, and ist_rtreep points to the
95 * lchild field of the smallest entry in rtree. The pointed-to
106 * to point back to the parent entry. When ascending,
300 * Picks and returns a random entry in a splay tree.
328 * Finds an entry in a splay tree.
366 * Inserts a new entry into a splay tree.
367 * The caller supplies a new entry.
375 ipc_tree_entry_t entry)
379 assert(entry != ITE_NULL);
385 entry->ite_lchild = ITE_NULL;
386 entry->ite_rchild = ITE_NULL;
411 entry->ite_lchild = splay->ist_ltree;
412 entry->ite_rchild = splay->ist_rtree;
415 entry->ite_name = name;
416 splay->ist_root = entry;
427 * Deletes an entry from a splay tree.
429 * Frees the entry.
431 * The "entry" argument isn't currently used.
439 __assert_only ipc_tree_entry_t entry)
458 assert(root == entry);
618 /* get smallest entry in splay tree to top */
705 * pointers back into real entry pointers,
714 ipc_tree_entry_t entry;
716 entry = (ipc_tree_entry_t)
720 *lowerp = entry->ite_name;
728 ipc_tree_entry_t entry;
730 entry = (ipc_tree_entry_t)
734 *upperp = entry->ite_name;
748 * for (entry = ipc_splay_traverse_start(splay);
749 * entry != ITE_NULL;
750 * entry = ipc_splay_traverse_next(splay, delete)) {
751 * do something with entry
755 * If "delete" is TRUE, then the current entry
876 * A state machine: for each entry, we
878 * 2) traverse the entry