BUSY
case BUSY:
case BUSY:
case BUSY:
"busy", BUSY, \
case BUSY:
case BUSY:
case BUSY:
"busy", BUSY, \
case BUSY:
if (block->status == BUSY)
block->status = BUSY;
p = (struct blk *)(Rcheat(p->word) & ~BUSY);
bloktop->word = (struct blk *)(Rcheat(rndstak) | BUSY);
p->word = (struct blk *)(Rcheat(p->word) & ~BUSY);
eui = (uint32_t *)(Rcheat(ptr->word) & ~BUSY);
q = (struct blk *)(Rcheat(p->word) & ~BUSY);
q = (struct blk *)(Rcheat(p->word) & ~BUSY);
p = (struct blk *)(Rcheat(pp->word) & ~BUSY);
#define busy(x) (Rcheat((x)->word) & BUSY)
(Rcheat(blokp) | BUSY);
return_cmp(BUSY);
#define SETBUSY(x) ((struct header *)((long)(x) | BUSY))
#define CLRBUSY(x) ((struct header *)((long)(x) & ~BUSY))
#define TESTBUSY(x) ((long)(x) & BUSY)
#define SETALL(x) ((long)(x) | (SMAL | BUSY))
#define CLRALL(x) ((long)(x) & ~(SMAL | BUSY))
arena[1].nextblk = (struct header *)BUSY;
arena[0].nextblk = (struct header *)BUSY;
block->status = BUSY;
if (block->status == BUSY)
if (rval == BUSY) { /* Check whether Lower path is usable */
if (use_flag == BUSY) {
if (use_flag == BUSY) {
if (use_flag == BUSY) {
if (use_flag == BUSY) {
rval = BUSY;
rval = BUSY;
rval = BUSY;
if (use_flag == BUSY) {
if (use_flag == BUSY) {
#if !defined(BUSY) /* warning: macro redefined */