gettext-tools/src/format-lisp.c

72   unsigned int repcount; /* Number of consecutive arguments this constraint
152   ASSERT (e->repcount > 0);
170       total_repcount += list->initial.element[i].repcount;
179       total_repcount += list->repeated.element[i].repcount;
223   newelement->repcount = oldelement->repcount;
257 	  length += list->initial.element[i].repcount;
276 	  length += list->repeated.element[i].repcount;
291    ignoring the repcount.  */
319       if (!(e1->repcount == e2->repcount && equal_element (e1, e2)))
331       if (!(e1->repcount == e2->repcount && equal_element (e1, e2)))
421 	list->initial.element[j-1].repcount +=
422 	  list->initial.element[i].repcount;
439 	list->repeated.element[j-1].repcount +=
440 	  list->repeated.element[i].repcount;
463 	  repcount0_extra = list->repeated.element[n-1].repcount;
467 	 list->repeated.element[0].repcount incremented by repcount0_extra.  */
475 	      if (!((list->repeated.element[i].repcount
477 		     == list->repeated.element[i+m].repcount)
505 		 Its repcount is irrelevant.  The second-to-last element is
508 		list->initial.element[list->initial.count-1].repcount;
519 		MIN (list->initial.element[list->initial.count-1].repcount,
520 		     list->repeated.element[list->repeated.count-1].repcount);
525 		list->repeated.element[0].repcount += moved_repcount;
535 		  list->repeated.element[0].repcount = moved_repcount;
539 	      list->repeated.element[list->repeated.count-1].repcount -=
541 	      if (list->repeated.element[list->repeated.count-1].repcount == 0)
548 	      list->initial.element[list->initial.count-1].repcount -=
550 	      if (list->initial.element[list->initial.count-1].repcount == 0)
609   list->repeated.element[0].repcount = 1;
687 	 copy with higher repcount is appended to list->initial.  */
694       list->initial.element[i].repcount = m - list->initial.length;
712 	   s < list->repeated.count && t >= list->repeated.element[s].repcount;
713 	   t -= list->repeated.element[s].repcount, s++)
739 	    list->initial.element[i].repcount = t;
747 	     + list->repeated[0..s-1].repcount + t
773 	      newelement[0].repcount -= t;
774 	      newelement[oldcount].repcount = t;
807        s < list->initial.count && t >= list->initial.element[s].repcount;
808        t -= list->initial.element[s].repcount, s++)
817   oldrepcount = list->initial.element[s].repcount;
823   list->initial.element[s].repcount = t;
824   list->initial.element[s+1].repcount = oldrepcount - t;
856        s < list->initial.count && t >= list->initial.element[s].repcount;
857        t -= list->initial.element[s].repcount, s++)
863   if (list->initial.element[s].repcount > 1)
867       unsigned int oldrepcount = list->initial.element[s].repcount;
880 	      list->initial.element[s].repcount = 1;
881 	      list->initial.element[s+1].repcount = oldrepcount - 1;
885 	      list->initial.element[s].repcount = oldrepcount - 1;
886 	      list->initial.element[s+1].repcount = 1;
897 	  list->initial.element[s].repcount = t;
898 	  list->initial.element[s+1].repcount = 1;
899 	  list->initial.element[s+2].repcount = oldrepcount - 1 - t;
906   /* Now the entry for index n has repcount 1.  */
907   ASSERT (list->initial.element[s].repcount == 1);
929       list->initial.element[0].repcount = n;
1089 	  list->initial.length -= list->initial.element[i].repcount;
1097 	  if (list->initial.element[i].repcount > 1)
1098 	    list->initial.element[i].repcount--;
1189 	re->repcount = MIN (e1->repcount, e2->repcount);
1202 	result->initial.length += re->repcount;
1204 	e1->repcount -= re->repcount;
1205 	if (e1->repcount == 0)
1210 	e2->repcount -= re->repcount;
1211 	if (e2->repcount == 0)
1277 	re->repcount = MIN (e1->repcount, e2->repcount);
1293 	result->repeated.length += re->repcount;
1295 	e1->repcount -= re->repcount;
1296 	if (e1->repcount == 0)
1301 	e2->repcount -= re->repcount;
1302 	if (e2->repcount == 0)
1567 	re->repcount = MIN (e1->repcount, e2->repcount);
1573 	result->initial.length += re->repcount;
1575 	e1->repcount -= re->repcount;
1576 	if (e1->repcount == 0)
1581 	e2->repcount -= re->repcount;
1582 	if (e2->repcount == 0)
1604 	    re->repcount = 1;
1607 	    e1->repcount -= 1;
1608 	    if (e1->repcount == 0)
1624 	    result->initial.length += re->repcount;
1644 	    re->repcount = 1;
1647 	    e2->repcount -= 1;
1648 	    if (e2->repcount == 0)
1664 	    result->initial.length += re->repcount;
1689 	  re->repcount = MIN (e1->repcount, e2->repcount);
1695 	  result->repeated.length += re->repcount;
1697 	  e1->repcount -= re->repcount;
1698 	  if (e1->repcount == 0)
1703 	  e2->repcount -= re->repcount;
1704 	  if (e2->repcount == 0)
1771       ASSERT (list->initial.element[0].repcount == 1);
1826        s < list->initial.count && t >= list->initial.element[s].repcount;
1827        t -= list->initial.element[s].repcount, s++)
1847        s < list->repeated.count && t >= list->repeated.element[s].repcount;
1848        t -= list->repeated.element[s].repcount, s++)
1896       rest -= list->initial.element[i].repcount;
1933       list->initial.length -= list->initial.element[i].repcount;
2071       listlist->repeated.element[0].repcount = 1;
2183       unsigned int k = MIN (srcseg->element[si].repcount - ti, p - i);
2189       list->initial.element[list->initial.count].repcount = k;
2195       if (ti == srcseg->element[si].repcount)
2207       ASSERT (list->initial.element[0].repcount == 1);
2215 	MIN (srcseg->element[si].repcount - ti,
2216 	     list->initial.element[sj].repcount - tj);
2238       list->initial.element[list->initial.count].repcount = k;
2244       if (ti == srcseg->element[si].repcount)
2252       if (tj == list->initial.element[sj].repcount)
3451     for (j = 0; j < list->initial.element[i].repcount; j++)
3462 	for (j = 0; j < list->repeated.element[i].repcount; j++)