Lines Matching refs:SIZE
91 if(SIZE(b) & (BUSY|JUNK|PFREE))
97 if(SIZE(b) < MAXTINY)
98 return vmonlist(TINY(vd)[INDEX(SIZE(b))], b);
117 if((SIZE(b)&BUSY) == 0 || (SIZE(b)&JUNK) == 0)
124 for(t = CACHE(vd)[C_INDEX(SIZE(b))]; t; t = LINK(t))
129 if(C_INDEX(SIZE(b)) < S_CACHE)
146 if(SIZE(node) & BITS)
150 if(SIZE(t) != SIZE(node))
154 { if(SIZE(t) >= SIZE(node) )
159 { if(SIZE(t) <= SIZE(node) )
190 { nextb = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
192 if(!ISBUSY(SIZE(b)) ) /* a completely free block */
194 if(SIZE(b) & (BUSY|JUNK|PFREE) )
198 if(!ISBUSY(SIZE(nextb)) || !ISPFREE(SIZE(nextb)) )
219 if(ISPFREE(SIZE(nextb)) )
223 if(ISPFREE(SIZE(b)) && LAST(b) != freeb &&
228 if(ISJUNK(SIZE(b)) && !vmisjunk(vd, b))
287 { /**/ ASSERT(!ISBITS(size) && !ISBITS(SIZE(root)));
288 if(size == (s = SIZE(root)) )
292 { if(size <= (s = SIZE(t)) )
307 { if(size >= (s = SIZE(t)) )
351 vd->root = r; /**/ASSERT(!r || !ISBITS(SIZE(r)));
388 ** scanned only once. It works because the LINK and SIZE
403 size = SIZE(fp);
409 s = SIZE(fp); /**/ASSERT(!(s&BITS));
417 s = SIZE(np); /**/ASSERT(s > 0);
428 SIZE(np) = 0;
434 SIZE(fp) = size;
437 np = NEXT(fp); /**/ASSERT(ISBUSY(SIZE(np)));
438 /**/ASSERT(!ISJUNK(SIZE(np)));
439 SETPFREE(SIZE(np));
479 size = SIZE(fp);
482 if((s = SIZE(np)) > size)
542 if(!ISPFREE(SIZE(bp)) )
546 size = SIZE(bp);
572 CLRPFREE(SIZE(tp));
583 SIZE(bp) = size - sizeof(Head_t);
588 { /**/ ASSERT(SIZE(bp) >= BODYSIZE);
591 SIZE(bp) |= BUSY|JUNK;
592 LINK(bp) = CACHE(vd)[C_INDEX(SIZE(bp))];
593 CACHE(vd)[C_INDEX(SIZE(bp))] = bp;
638 { /**/ASSERT(ISBUSY(SIZE(tp)) );
639 /**/ASSERT(ISJUNK(SIZE(tp)) );
643 if((s = SIZE(tp)) >= size && s < (size << 1) )
645 { SIZE(tp) = size;
648 SIZE(np) = ((s&~BITS) - (size+sizeof(Head_t)))|JUNK|BUSY;
650 SIZE(tp) |= s&BITS;
652 CLRJUNK(SIZE(tp));
667 if((tp = vd->wild) && SIZE(tp) >= size)
677 /**/ ASSERT(!ISBITS(SIZE(tp)));
678 /**/ ASSERT(SIZE(tp) >= size);
679 /**/ ASSERT((SIZE(tp)%ALIGN) == 0);
684 CLRPFREE(SIZE(np)); /**/ ASSERT(ISBUSY(SIZE(np)));
686 if((s = SIZE(tp)-size) >= (sizeof(Head_t)+BODYSIZE) )
687 { SIZE(tp) = size;
691 SIZE(np) = (s - sizeof(Head_t)) | BUSY|JUNK;
694 { SIZE(np) &= ~BITS;
696 ap = NEXT(np); /**/ASSERT(ISBUSY(SIZE(ap)));
697 SETPFREE(SIZE(ap));
703 SETBUSY(SIZE(tp));
743 if(seg && SEG(b) == seg && ISBUSY(SIZE(b)) && !ISJUNK(SIZE(b)) )
749 reg size_t size = SIZE(b)&~BITS;
752 { if(ISJUNK(SIZE(b)) || !ISBUSY(SIZE(b)))
800 bp = BLOCK(data); s = SIZE(bp);
809 { SETJUNK(SIZE(bp));
824 if(SIZE(bp) >= 2*vd->incr)
826 if(vd->wild && SIZE(vd->wild) >= COMPACT*vd->incr)
875 rp = BLOCK(data); /**/ASSERT(ISBUSY(SIZE(rp)) && !ISJUNK(SIZE(rp)));
876 oldz = SIZE(rp); CLRBITS(oldz);
880 { s = SIZE(np); /**/ASSERT(!ISPFREE(s));
888 s = SIZE(np); /**/ASSERT(s%ALIGN == 0);
897 SIZE(rp) += (s += sizeof(Head_t)); /**/ASSERT((s%ALIGN) == 0);
899 CLRPFREE(SIZE(np));
900 } while(SIZE(rp) < size);
902 if(SIZE(rp) < size && size > vd->incr && SEGWILD(rp) )
905 s = (size - SIZE(rp)) + sizeof(Head_t); s = ROUND(s,vd->incr);
909 { SIZE(rp) += s;
913 s = (SIZE(rp)&~BITS) + sizeof(Head_t);
916 SIZE(np) = BUSY;
921 if((s = SIZE(rp)) >= (size + (BODYSIZE+sizeof(Head_t))) )
922 { SIZE(rp) = size;
925 SIZE(np) = (((s&~BITS)-size) - sizeof(Head_t))|BUSY|JUNK;
926 CPYBITS(SIZE(rp),s);
940 SETJUNK(SIZE(rp));
948 if(data && (type&VM_RSZERO) && (size = SIZE(BLOCK(data))&~BITS) > oldz )
984 { if(!ISBUSY(SIZE(b)) || ISJUNK(SIZE(b)) )
986 else size = (long)SIZE(b)&~BITS;
992 b = (Block_t*)((Vmuchar_t*)DATA(b) + (SIZE(b)&~BITS) );
1057 SIZE(np) = ((SIZE(tp)&~BITS) - s)|BUSY;
1060 SIZE(tp) = (s - sizeof(Head_t)) | (SIZE(tp)&BITS) | JUNK;
1061 /**/ ASSERT(SIZE(tp) >= sizeof(Body_t) );
1062 LINK(tp) = CACHE(vd)[C_INDEX(SIZE(tp))];
1063 CACHE(vd)[C_INDEX(SIZE(tp))] = tp;
1067 if((s = SIZE(np) - size) >= sizeof(Block_t))
1068 { SIZE(np) = size;
1071 SIZE(tp) = ((s & ~BITS) - sizeof(Head_t)) | BUSY | JUNK;
1073 LINK(tp) = CACHE(vd)[C_INDEX(SIZE(tp))];
1074 CACHE(vd)[C_INDEX(SIZE(tp))] = tp;
1076 SIZE(np) |= s&BITS;