Searched defs:neighbor (Results 1 - 4 of 4) sorted by relevance

/illumos-gate/usr/src/psm/stand/boot/common/
H A Dheap_kmem.c605 Freehdr neighbor; /* Node to be coalesced */ local
606 char *neigh_block; /* Ptr to potential neighbor */
607 size_t neigh_size; /* Size of potential neighbor */
633 neighbor = *np;
634 while (neighbor != NIL) {
635 neigh_block = (char *)neighbor->block;
636 neigh_size = neighbor->size;
640 * Absorb and delete right neighbor
658 np = &neighbor->left;
663 * Absorb and delete left neighbor
[all...]
/illumos-gate/usr/src/common/avl/
H A Davl.c698 * neighbor node. That node will have at most 1 child. Note this
701 * As an optimization, we choose the greater neighbor if the tree
702 * is right heavy, otherwise the left neighbor. This reduces the
830 void *neighbor; local
832 ASSERT(((neighbor = AVL_NEXT(t, obj)) == NULL) ||
833 (t->avl_compar(obj, neighbor) <= 0));
835 neighbor = AVL_PREV(t, obj);
836 if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) < 0)) {
847 void *neighbor; local
864 void *neighbor; local
[all...]
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dmalloc.c568 Freehdr neighbor; /* Node to be coalesced */ local
569 Dblk neighbor_blk; /* Ptr to potential neighbor */
570 uint neighbor_size; /* Size of potential neighbor */
621 neighbor = *fpp;
622 while (neighbor != NIL) {
623 neighbor_blk = neighbor->block;
624 neighbor_size = neighbor->size;
629 * Absorb and delete right neighbor
648 fpp = &neighbor->left;
654 * Absorb and delete left neighbor
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/
H A Din.rwhod.c120 * We communicate with each neighbor in
125 struct neighbor { struct
126 struct neighbor *n_next;
134 static struct neighbor *neighbors;
375 struct neighbor *np;
504 struct neighbor *np;
505 struct neighbor *np2;
566 np = (struct neighbor *)malloc(sizeof (*np));

Completed in 333 milliseconds