52 		(x) = (x) * 10 + (line[cursor] - '0'); \
80 	assert(upper - lower <= MAX_ELEMENTS);  in next_field()
94 		uint_t num = 0, num2 = 0, step = 0;  in next_field()  local
117 			num = lower;  in next_field()
125 			READNUMBER(num);  in next_field()
127 			if (num < lower || num > upper) {  in next_field()
132 			if (line[cursor] == '-') {  in next_field()
146 				ADDELEMENT(num);  in next_field()
169 		if (num <= num2) {  in next_field()
170 			for (i = num; i <= num2; i += step) {  in next_field()
174 			/* Wrap-around range */  in next_field()
175 			for (i = num; i <= upper; i += step) {  in next_field()
179 			i -= (upper - lower + 1);  in next_field()
204 		custr_t *cs = NULL;  in next_field()  local
206 		if (custr_alloc(&cs) != 0) {  in next_field()
212 			if (custr_len(cs) > 0) {  in next_field()
213 				if (custr_appendc(cs, ',') != 0) {  in next_field()
214 					custr_free(cs);  in next_field()
219 			if (custr_append_printf(cs, "%u", elements[i]) != 0) {  in next_field()
220 				custr_free(cs);  in next_field()
226 		if (custr_len(cs) != 0)  in next_field()
227 			*ret = xstrdup(custr_cstr(cs));  in next_field()
228 		custr_free(cs);  in next_field()