Home
last modified time | relevance | path

Searched refs:TREE (Results 1 – 7 of 7) sorted by relevance

/titanic_44/usr/src/lib/watchmalloc/common/
H A Dmalloc.c65 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) in copy_pattern()
106 static TREE *List[MINSIZE/WORDSIZE-1];
107 static TREE *Last[MINSIZE/WORDSIZE-1];
[all …]
H A Dmallint.h62 #define MINSIZE (sizeof (TREE) - sizeof (WORD))
89 } TREE; typedef
108 #define SETNOTREE(b) (LEFT(b) = (TREE *)(-1))
109 #define ISNOTREE(b) (LEFT(b) == (TREE *)(-1))
113 #define BLOCK(d) ((TREE *)(((char *)(d)) - WORDSIZE))
116 #define NEXT(b) ((TREE *)(((char *)(b)) + RSIZE(b) + WORDSIZE))
/titanic_44/usr/src/lib/libc/port/gen/
H A Dmemalign.c37 #define _nextblk(p, size) ((TREE *)((uintptr_t)(p) + (size)))
64 TREE *p; /* Ptr returned from malloc() */ in memalign()
65 TREE *blk; /* For addressing fragment blocks */ in memalign()
67 TREE *alignedp; /* Ptr to properly aligned boundary */ in memalign()
68 TREE *aligned_blk; /* The block to be returned */ in memalign()
116 p = (TREE *)malloc(reqsize); in memalign()
117 if (p == (TREE *)NULL) { in memalign()
136 alignedp = (TREE *)x; in memalign()
H A Dmallint.h63 #define MINSIZE (sizeof (TREE) - sizeof (WORD))
83 } TREE; typedef
118 } TREE; typedef
138 #define SETNOTREE(b) (LEFT(b) = (TREE *)(-1))
139 #define ISNOTREE(b) (LEFT(b) == (TREE *)(-1))
143 #define BLOCK(d) ((TREE *)(((uintptr_t)(d)) - WORDSIZE))
144 #define SELFP(b) ((TREE **)(((uintptr_t)(b)) + SIZE(b)))
145 #define LAST(b) (*((TREE **)(((uintptr_t)(b)) - WORDSIZE)))
146 #define NEXT(b) ((TREE *)(((uintptr_t)(b)) + SIZE(b) + WORDSIZE))
H A Dmalloc.c81 static TREE *Root, /* root of the free tree */
88 static void t_delete(TREE *);
89 static void t_splay(TREE *);
118 static TREE *List[MINSIZE/WORDSIZE-1]; /* lists of small blocks */
123 TREE *tp; in _smalloc()
135 TREE *np; in _smalloc()
182 TREE *tp, *sp; in _malloc_unlocked()
304 TREE *tp, *np; in realloc()
490 TREE *tp, *sp, *np; in realfree()
600 static TREE *
[all …]
/titanic_44/usr/src/tools/scripts/
H A Dflg.flp.sh253 TREE=$SUBTREE
254 while [[ $TREE != $CODEMGR_WS ]]; do
255 [[ -f $TREE/req.flg ]] && exec_file $TREE/req.flg
256 TREE=`dirname $TREE`
/titanic_44/usr/src/lib/librstp/common/
H A DCOPYING.descrip1 SPANNING TREE SOFTWARE