Home
last modified time | relevance | path

Searched refs:Block_t (Results 1 – 10 of 10) sorted by relevance

/titanic_41/usr/src/lib/libast/common/vmalloc/
H A Dvmbest.c59 static int vmintree(Block_t* node, Block_t* b) in vmintree()
62 Block_t* node; in vmintree()
63 Block_t* b;
65 { Block_t* t;
78 static int vmonlist(Block_t* list, Block_t* b) in vmonlist()
81 Block_t* list; in vmonlist()
82 Block_t* b;
93 static int vmisfree(Vmdata_t* vd, Block_t* b) in vmisfree()
97 Block_t* b;
117 static int vmisjunk(Vmdata_t* vd, Block_t* b) in vmisjunk()
[all …]
H A Dvmhdr.h106 typedef struct _block_s Block_t; typedef
258 Block_t* block;
278 Block_t* link; /* possible link list usage */
284 Block_t* link; /* possible link list usage */
296 { Block_t* link; /* next in link list */
297 Block_t* left; /* left child in free tree */
298 Block_t* right; /* right child in free tree */
299 Block_t** self; /* self pointer when free */
319 { Block_t* link;
320 Block_t* self;
[all …]
H A Dvmprivate.c39 static Block_t* vmextend(reg Vmalloc_t* vm, size_t size, Vmsearch_f searchf ) in vmextend()
41 static Block_t* vmextend(vm, size, searchf ) in vmextend()
49 reg Block_t *bp, *t;
66 s = size + sizeof(Seg_t) + sizeof(Block_t) + sizeof(Head_t) + 2*ALIGN;
68 return NIL(Block_t*);
70 return NIL(Block_t*);
104 return NIL(Block_t*);
114 return NIL(Block_t*);
132 vd->wild = NIL(Block_t*);
140 seg->free = NIL(Block_t*);
[all …]
H A Dvmlast.c43 reg Block_t *tp, *next;
86 { next = (Block_t*)((Vmuchar_t*)tp+size);
91 else seg->free = NIL(Block_t*);
114 reg Block_t* fp;
147 vd->free = NIL(Block_t*);
148 fp = (Block_t*)data;
152 seg->last = NIL(Block_t*);
171 reg Block_t* tp;
232 seg->free = NIL(Block_t*);
268 { tp = (Block_t*)data;
[all …]
H A Dvmclear.c43 reg Block_t* tp;
57 vd->free = vd->wild = NIL(Block_t*);
61 { vd->root = NIL(Block_t*);
63 TINY(vd)[s] = NIL(Block_t*);
65 CACHE(vd)[s] = NIL(Block_t*);
H A Dvmopen.c42 Block_t block; /* space for a block */
59 reg Block_t* b;
123 vd->free = vd->wild = NIL(Block_t*);
129 { vd->root = NIL(Block_t*);
131 TINY(vd)[e] = NIL(Block_t*);
133 CACHE(vd)[e] = NIL(Block_t*);
149 seg->free = NIL(Block_t*);
H A Dvmpool.c50 reg Block_t *tp, *next;
81 for(tp = NIL(Block_t*), seg = vd->seg; seg; seg = seg->next)
99 next = (Block_t*)((Vmuchar_t*)tp+size);
105 next = (Block_t*)((Vmuchar_t*)next + size);
107 seg->free = NIL(Block_t*);
133 reg Block_t *bp, *tp;
160 tp = (Block_t*)(laddr + (((Vmuchar_t*)addr-laddr)/size)*size );
186 reg Block_t* bp;
212 bp = (Block_t*)data;
298 reg Block_t* fp;
[all …]
H A Dvmdebug.c272 reg Block_t *b, *endb;
287 b = endb = NIL(Block_t*);
290 endb = (Block_t*)(seg->baddr - sizeof(Head_t));
320 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
338 reg Block_t *b, *endb;
354 endb = (Block_t*)(seg->baddr - sizeof(Head_t));
365 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
609 reg Block_t *b, *endb;
616 { if(_vmbestcheck(vd, NIL(Block_t*)) < 0)
626 endb = (Block_t*)(seg->baddr - sizeof(Head_t));
[all …]
H A Dvmstat.c44 reg Block_t *b, *endb;
102 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
H A Dvmtrace.c260 { Block_t *b, *endb;
279 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );