Lines Matching refs:TREE
65 static TREE *Root; /* root of the free tree */
66 static TREE *Bottom; /* the last free chunk in the arena */
69 static void t_delete(TREE *);
70 static void t_splay(TREE *);
74 static TREE *morecore(size_t);
76 static void protect(TREE *);
77 static void unprotect(TREE *);
92 copy_pattern(int pat, TREE *tp)
106 static TREE *List[MINSIZE/WORDSIZE-1];
107 static TREE *Last[MINSIZE/WORDSIZE-1];
115 TREE *tp;
127 TREE *np;
177 TREE *tp, *sp, *tmp;
289 TREE *tp, *np;
353 TREE *tmp;
482 TREE *tp, *sp, *np, *tmp;
634 static TREE *
637 TREE *tp;
725 tp = ((TREE *)addr);
747 in_list(TREE *tp, TREE **npp)
749 TREE *sp;
764 LEFT1(TREE *x, TREE *y)
766 TREE *node[3];
767 TREE **npp = node;
768 TREE *tp;
792 RIGHT1(TREE *x, TREE *y)
794 TREE *node[3];
795 TREE **npp = node;
796 TREE *tp;
820 BULEFT2(TREE *x, TREE *y, TREE *z)
822 TREE *node[4];
823 TREE **npp = node;
824 TREE *tp;
854 BURIGHT2(TREE *x, TREE *y, TREE *z)
856 TREE *node[4];
857 TREE **npp = node;
858 TREE *tp;
888 TDLEFT2(TREE *x, TREE *y, TREE *z)
890 TREE *node[3];
891 TREE **npp = node;
892 TREE *tp;
917 TDRIGHT2(TREE *x, TREE *y, TREE *z)
919 TREE *node[3];
920 TREE **npp = node;
921 TREE *tp;
949 t_delete(TREE *op)
951 TREE *tp, *sp, *gp;
1037 t_splay(TREE *tp)
1039 TREE *pp, *gp;
1115 #define nextblk(p, size) ((TREE *)((char *)(p) + (size)))
1121 TREE *p; /* Ptr returned from malloc() */
1122 TREE *blk; /* For addressing fragment blocks */
1124 TREE *alignedp; /* Ptr to properly aligned boundary */
1125 TREE *aligned_blk; /* The block to be returned */
1166 p = (TREE *) malloc(reqsize);
1167 if (p == (TREE *) NULL) {
1188 alignedp = (TREE *)x;
1404 protect(TREE *tp)
1428 unprotect(TREE *tp)