Lines Matching defs:upp
500 struct unr *upp;
517 upp = TAILQ_PREV(up, unrhd, list);
518 if (upp == NULL)
519 upp = TAILQ_NEXT(up, list);
522 up = upp;
527 upp = TAILQ_PREV(up, unrhd, list);
528 if (upp != NULL && up->ptr == upp->ptr) {
529 up->len += upp->len;
530 TAILQ_REMOVE(&uh->head, upp, list);
531 delete_unr(uh, upp);
533 upp = TAILQ_NEXT(up, list);
534 if (upp != NULL && up->ptr == upp->ptr) {
535 up->len += upp->len;
536 TAILQ_REMOVE(&uh->head, upp, list);
537 delete_unr(uh, upp);
542 upp = TAILQ_FIRST(&uh->head);
543 if (upp != NULL && upp->ptr == uh) {
544 uh->first += upp->len;
545 TAILQ_REMOVE(&uh->head, upp, list);
546 delete_unr(uh, upp);
547 if (up == upp)
552 upp = TAILQ_LAST(&uh->head, unrhd);
553 if (upp != NULL && upp->ptr == NULL) {
554 uh->last += upp->len;
555 TAILQ_REMOVE(&uh->head, upp, list);
556 delete_unr(uh, upp);
557 if (up == upp)
765 struct unr *up, *upp, *upn;
774 upp = TAILQ_FIRST(&uh->head);
778 if (item + 1 == uh->first && upp == NULL) {
830 upp = TAILQ_PREV(up, unrhd, list);
831 if (item == 0 && upp != NULL && upp->ptr == NULL) {
832 upp->len++;
852 upp = new_unr(uh, p1, p2);
853 upp->ptr = uh;
854 upp->len = pl;
855 TAILQ_INSERT_AFTER(&uh->head, up, upp, list);
860 upp = new_unr(uh, p1, p2);
861 upp->len = item;
862 upp->ptr = uh;
863 TAILQ_INSERT_BEFORE(up, upp, list);