919 	       int atomlen, int firstnum, int secondnum, int special_case)  in replace_repeat()  argument
924 	int init_q = (firstnum == 0);		/* first added char will be ? */  in replace_repeat()
925 	int n_q_reps = secondnum-firstnum;	/* m>n, so reduce until {1,m-n} left  */  in replace_repeat()
930 	if (firstnum > 1) {	/* add room for reps 2 through firstnum */  in replace_repeat()
931 		size += atomlen*(firstnum-1);  in replace_repeat()
951 	for (i = 1; i < firstnum; i++) {	/* copy x reps 	*/  in replace_repeat()
987 		  int atomlen, int firstnum, int secondnum)  in repeat()  argument
997 		if (firstnum < 2) {  in repeat()
1002 				firstnum, secondnum, REPEAT_PLUS_APPENDED);  in repeat()
1004 	} else if (firstnum == secondnum) {	/* {n} or {n,n} -> simply repeat n-1 times */  in repeat()
1005 		if (firstnum == 0) {	/* {0} or {0,0} */  in repeat()
1010 					firstnum, secondnum, REPEAT_ZERO);  in repeat()
1013 					firstnum, secondnum, REPEAT_SIMPLE);  in repeat()
1015 	} else if (firstnum < secondnum) {	/* {n,m} -> repeat n-1 times then alternate  */  in repeat()
1018 					firstnum, secondnum, REPEAT_WITH_Q);  in repeat()