225 |
ad->tm_nfree --; |
ad->tm_nfree --; |
226 |
bcopy(beg ,&(p->buf[i]), amt); |
bcopy(beg ,&(p->buf[i]), amt); |
227 |
bzero(beg+8,amt-8); |
bzero(beg+8,amt-8); |
228 |
x->d.m = 0; |
make_unfree(x); |
229 |
if (p->free2[i]) |
if (p->free2[i]) |
230 |
{ x = (object) p->free2[i]; |
{ x = (object) p->free2[i]; |
231 |
beg = (char *)x; |
beg = (char *)x; |
232 |
x->d.m = 0; |
make_unfree(x); |
233 |
bzero(beg+8,amt-8); |
bzero(beg+8,amt-8); |
234 |
SS1(ad->tm_free,OBJ_LINK(p->free2[i])); |
SS1(ad->tm_free,OBJ_LINK(p->free2[i])); |
235 |
ad->tm_nfree --; |
ad->tm_nfree --; |
281 |
object x = (object)beg; |
object x = (object)beg; |
282 |
int amt = ad->tm_size; |
int amt = ad->tm_size; |
283 |
RS1(p->free2[i],(p->free1[i])); |
RS1(p->free2[i],(p->free1[i])); |
284 |
if (x->d.m) error("should not be free"); |
if (is_marked_or_free(x)) error("should not be free"); |
285 |
bcopy(&(p->buf[i]),beg, amt); |
bcopy(&(p->buf[i]),beg, amt); |
286 |
if (p->free2[i]) |
if (p->free2[i]) |
287 |
{ x = (object) p->free2[i]; |
{ x = (object) p->free2[i]; |
288 |
if (x->d.m) error("should not be free"); |
if (is_marked_or_free(x)) error("should not be free"); |
289 |
x->d.m = FREE; |
make_free(x); |
290 |
F_LINK(F_LINK(ad->tm_free)) = (long )current_fl; |
F_LINK(F_LINK(ad->tm_free)) = (long )current_fl; |
291 |
ad->tm_nfree += 2; |
ad->tm_nfree += 2; |
292 |
} |
} |