Lines Matching refs:np
124 TREE *np;
129 if ((np = malloc_unlocked((size + WORDSIZE)*NPS)) == NULL)
133 for (n = 0, List[i] = np; n < NPS; ++n) {
134 tp = np;
139 np = NULL;
142 np = NEXT(tp);
144 AFTER(tp) = np;
286 TREE *tp, *np;
349 np = NEXT(tp);
350 unprotect(np);
351 if (ISBIT0(SIZE(np)))
352 protect(np);
355 ASSERT(SIZE(np) >= MINSIZE);
356 ASSERT(!ISBIT1(SIZE(np)));
357 SIZE(tp) += SIZE(np) + WORDSIZE;
358 if (np != Bottom)
359 t_delete(np);
363 tmp = NEXT(np);
389 np = NEXT(tp);
390 SIZE(np) = n | BIT0;
391 realfree(DATA(np));
446 np = LAST(tp);
447 unprotect(np);
448 if ((SIZE(np) + SIZE(tp) + WORDSIZE) >= size) {
449 ASSERT(!ISBIT0(SIZE(np)));
450 t_delete(np);
451 SIZE(np) += SIZE(tp) + WORDSIZE;
455 (void) memmove(DATA(np), old, SIZE(tp));
456 old = DATA(np);
457 tp = np;
461 protect(np);
483 TREE *tp, *sp, *np, *tmp;
522 np = NEXT(tp);
523 unprotect(np);
524 if (ISBIT0(SIZE(np)))
525 protect(np);
527 if (np != Bottom)
528 t_delete(np);
529 SIZE(tp) += SIZE(np) + WORDSIZE;
534 np = LAST(tp);
535 unprotect(np);
536 ASSERT(!ISBIT0(SIZE(np)));
537 ASSERT(np != Bottom);
538 t_delete(np);
539 SIZE(np) += SIZE(tp) + WORDSIZE;
540 tp = np;
553 np = Root;
555 unprotect(np);
556 if (SIZE(np) > size) {
557 if ((tmp = LEFT(np)) != NULL) {
558 protect(np);
559 np = tmp;
561 LEFT(np) = tp;
562 PARENT(tp) = np;
563 protect(np);
566 } else if (SIZE(np) < size) {
567 if ((tmp = RIGHT(np)) != NULL) {
568 protect(np);
569 np = tmp;
571 RIGHT(np) = tp;
572 PARENT(tp) = np;
573 protect(np);
577 if ((sp = PARENT(np)) != NULL) {
579 if (np == LEFT(sp))
589 if ((sp = LEFT(np)) != NULL) {
596 if ((sp = RIGHT(np)) != NULL) {
604 LINKFOR(tp) = np;
605 LINKBAK(np) = tp;
606 SETNOTREE(np);
607 protect(np);