Lines Matching refs:SIZE
100 if(SIZE(b) & (BUSY|JUNK|PFREE))
106 if(SIZE(b) < MAXTINY)
107 return vmonlist(TINY(vd)[INDEX(SIZE(b))], b);
126 if((SIZE(b)&BUSY) == 0 || (SIZE(b)&JUNK) == 0)
133 for(t = CACHE(vd)[C_INDEX(SIZE(b))]; t; t = LINK(t))
138 if(C_INDEX(SIZE(b)) < S_CACHE)
155 if(SIZE(node) & BITS)
159 if(SIZE(t) != SIZE(node))
163 { if(SIZE(t) >= SIZE(node) )
168 { if(SIZE(t) <= SIZE(node) )
199 { nextb = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
201 if(!ISBUSY(SIZE(b)) ) /* a completely free block */
203 if(SIZE(b) & (BUSY|JUNK|PFREE) )
207 if(!ISBUSY(SIZE(nextb)) || !ISPFREE(SIZE(nextb)) )
228 if(ISPFREE(SIZE(nextb)) )
232 if(ISPFREE(SIZE(b)) && LAST(b) != freeb &&
237 if(ISJUNK(SIZE(b)) && !vmisjunk(vd, b))
296 { /**/ ASSERT(!ISBITS(size) && !ISBITS(SIZE(root)));
297 if(size == (s = SIZE(root)) )
301 { if(size <= (s = SIZE(t)) )
316 { if(size >= (s = SIZE(t)) )
360 vd->root = r; /**/ASSERT(!r || !ISBITS(SIZE(r)));
398 ** scanned only once. It works because the LINK and SIZE
413 size = SIZE(fp);
437 s = SIZE(fp); /**/ASSERT(!(s&BITS));
452 s = SIZE(np); /**/ASSERT(s > 0);
463 SIZE(np) = 0;
469 SIZE(fp) = size;
472 np = NEXT(fp); /**/ASSERT(ISBUSY(SIZE(np)));
473 /**/ASSERT(!ISJUNK(SIZE(np)));
474 SETPFREE(SIZE(np));
514 size = SIZE(fp);
517 if((s = SIZE(np)) > size)
586 if(!ISPFREE(SIZE(bp)) )
590 size = SIZE(bp);
615 CLRPFREE(SIZE(NEXT(bp)));
626 SIZE(bp) = size - sizeof(Head_t);
631 { /**/ ASSERT(SIZE(bp) >= BODYSIZE);
634 SIZE(bp) |= BUSY|JUNK;
635 LINK(bp) = CACHE(vd)[C_INDEX(SIZE(bp))];
636 CACHE(vd)[C_INDEX(SIZE(bp))] = bp;
693 { /**/ASSERT(ISBUSY(SIZE(tp)) );
694 /**/ASSERT(ISJUNK(SIZE(tp)) );
698 if((s = SIZE(tp)) >= size && s < (size << 1) )
700 { SIZE(tp) = size;
703 SIZE(np) = ((s&~BITS) - (size+sizeof(Head_t)))|JUNK|BUSY;
705 SIZE(tp) |= s&BITS;
707 CLRJUNK(SIZE(tp));
723 if((tp = vd->wild) && SIZE(tp) >= size)
742 /**/ ASSERT(!ISBITS(SIZE(tp)));
743 /**/ ASSERT(SIZE(tp) >= size);
744 /**/ ASSERT((SIZE(tp)%ALIGN) == 0);
748 CLRPFREE(SIZE(NEXT(tp))); /**/ ASSERT(ISBUSY(SIZE(NEXT(tp))));
750 if((s = SIZE(tp)-size) >= (sizeof(Head_t)+BODYSIZE) )
751 { SIZE(tp) = size;
755 SIZE(np) = (s - sizeof(Head_t)) | BUSY|JUNK;
758 { SIZE(np) &= ~BITS;
759 *SELF(np) = np; /**/ASSERT(ISBUSY(SIZE(NEXT(np))));
760 SETPFREE(SIZE(NEXT(np)));
766 SETBUSY(SIZE(tp));
816 if(seg && SEG(b) == seg && ISBUSY(SIZE(b)) && !ISJUNK(SIZE(b)) )
824 reg size_t size = SIZE(b)&~BITS;
827 { if(ISJUNK(SIZE(b)) || !ISBUSY(SIZE(b)))
883 bp = BLOCK(data); s = SIZE(bp);
892 { SETJUNK(SIZE(bp));
907 if(SIZE(bp) >= 2*vd->incr)
909 if(vd->wild && SIZE(vd->wild) >= COMPACT*vd->incr)
972 rp = BLOCK(data); /**/ASSERT(ISBUSY(SIZE(rp)) && !ISJUNK(SIZE(rp)));
973 oldsize = SIZE(rp); CLRBITS(oldsize);
977 { s = SIZE(np); /**/ASSERT(!ISPFREE(s));
985 s = SIZE(np); /**/ASSERT(s%ALIGN == 0);
994 SIZE(rp) += (s += sizeof(Head_t)); /**/ASSERT((s%ALIGN) == 0);
996 CLRPFREE(SIZE(np));
997 } while(SIZE(rp) < size);
999 if(SIZE(rp) < size && size > vd->incr && SEGWILD(rp) )
1002 s = (size - SIZE(rp)) + sizeof(Head_t); s = ROUND(s,vd->incr);
1006 { SIZE(rp) += s;
1010 s = (SIZE(rp)&~BITS) + sizeof(Head_t);
1013 SIZE(np) = BUSY;
1018 if((s = SIZE(rp)) >= (size + (BODYSIZE+sizeof(Head_t))) )
1019 { SIZE(rp) = size;
1022 SIZE(np) = (((s&~BITS)-size) - sizeof(Head_t))|BUSY|JUNK;
1023 CPYBITS(SIZE(rp),s);
1037 SETJUNK(SIZE(rp));
1052 done: if(data && (type&VM_RSZERO) && (size = SIZE(BLOCK(data))&~BITS) > oldsize )
1092 { if(!ISBUSY(SIZE(b)) || ISJUNK(SIZE(b)) )
1094 else size = (long)SIZE(b)&~BITS;
1100 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
1176 SIZE(np) = ((SIZE(tp)&~BITS) - s)|BUSY;
1179 SIZE(tp) = (s - sizeof(Head_t)) | (SIZE(tp)&BITS) | JUNK;
1180 /**/ ASSERT(SIZE(tp) >= sizeof(Body_t) );
1181 LINK(tp) = CACHE(vd)[C_INDEX(SIZE(tp))];
1182 CACHE(vd)[C_INDEX(SIZE(tp))] = tp;
1186 if((s = SIZE(np) - size) >= sizeof(Block_t))
1187 { SIZE(np) = size;
1190 SIZE(tp) = ((s & ~BITS) - sizeof(Head_t)) | BUSY | JUNK;
1192 LINK(tp) = CACHE(vd)[C_INDEX(SIZE(tp))];
1193 CACHE(vd)[C_INDEX(SIZE(tp))] = tp;
1195 SIZE(np) |= s&BITS;