Lines Matching defs:left
63 * a. addr(D(left(s))) < addr(s) < addr(D(right(s)))
64 * b. len(D(left(s))) <= len(s) >= len(D(right(s)))
82 * The left pointer of a header blocks is used to chain free header
95 Freehdr left; /* Left tree pointer */
228 tree = &x->left;
244 left_hook = &newhdr->left;
247 newhdr->left = NIL;
258 * below (i.e., to the left of) p. Similarly
265 * rewrite link crossing from the left
275 right_hook = &x->left;
276 x = x->left;
290 * The left and right sons of the node to be deleted define two
304 Freehdr left_branch; /* left subtree of deleted node */
308 left_branch = x->left;
313 * iterate until left branch and right branch are
318 * promote the left branch
328 p = &right_branch->left;
329 right_branch = right_branch->left;
342 * The left and right subtrees of the node to be demoted are to
372 left_branch = x->left;
382 * promote the left branch
392 p = &right_branch->left;
398 x->left = left_branch;
489 left_son = a->left;
497 p = &a->left;
508 p = &a->left;
512 left_son = a->left;
545 x->left = a->left;
563 x->left = a->left;
656 * Search to the left
658 np = &neighbor->left;
663 * Absorb and delete left neighbor
818 kmem_info.free_hdr_list = kmem_info.free_hdr_list->left;
846 p->left = kmem_info.free_hdr_list;
867 prtree(p->left, (char *)NULL);
874 "(%p): (left = %p, right = %p, block = %p, size = %lx)\n",
875 p, p->left, p->right, p->block, p->size);