Lines Matching full:new
102 struct range new;
116 * reverse order. Its first element must be all zero, the "old" and "new"
286 (*dd)[i].new.from = c;
287 (*dd)[i].new.to = d;
290 (*dd)[i].new.from < (*dd)[i - 1].new.to)
296 (*dd)[i].new.from = (*dd)[i].new.to = (*dd)[i - 1].new.to;
377 if (!t2 || (t1 && d1->new.to < d2->new.from)) {
382 keep(2, &d1->new);
383 change(3, &d1->new, false);
391 if (!t1 || (t2 && d2->new.to < d1->new.from)) {
394 keep(1, &d2->new);
395 change(3, &d2->new, false);
409 if (d1 + 1 < d13 + m1 && d1->new.to >= d1[1].new.from) {
411 d1[1].new.from = d1->new.from;
417 if (d2 + 1 < d23 + m2 && d2->new.to >= d2[1].new.from) {
419 d2[1].new.from = d2->new.from;
424 if (d1->new.from == d2->new.from && d1->new.to == d2->new.to) {
435 change(3, &d3->new, false);
448 if (d1->new.from < d2->new.from) {
449 d2->old.from -= d2->new.from - d1->new.from;
450 d2->new.from = d1->new.from;
451 } else if (d2->new.from < d1->new.from) {
452 d1->old.from -= d1->new.from - d2->new.from;
453 d1->new.from = d2->new.from;
455 if (d1->new.to > d2->new.to) {
456 d2->old.to += d1->new.to - d2->new.to;
457 d2->new.to = d1->new.to;
458 } else if (d2->new.to > d1->new.to) {
459 d1->old.to += d2->new.to - d1->new.to;
460 d1->new.to = d2->new.to;
557 * the same data as the new range (in file 2).
622 de[j].new.from = diff->new.from;
623 de[j].new.to = diff->new.to;
661 struct range *new, *old;
664 new = &de[n].new;
667 delete = (new->from == new->to);
670 printf("%dd\n", new->from - 1);
671 else if (old->from == new->from && old->to == new->to) {
684 printrange(fp[2], new);
714 struct range *new, *old;
717 new = &de[n].new;
719 deletenew = (new->from == new->to);
725 printrange(fp[2], new);
727 startmark = new->to - 1;
735 (new->to - new->from));
747 printrange(fp[2], new);
755 r.to = new->to;
761 printrange(fp[2], new);
794 struct range r, *new, *old;
802 new = &de[n].new;
809 delete = (new->from == new->to);
811 r.to = new->from - 1;
814 r.to = new->from;
823 printrange(fp[2], new);
829 printrange(fp[2], new);
834 printrange(fp[2], new);
845 or.to = new->to;
854 printrange(fp[2], new);
864 r.from = new->to;
874 * If the new range is 0 length (from == to), we need to use the old
877 new = &de[n-1].new;
880 if (old->from == new->from && old->to == new->to)
882 else if (new->from == new->to)