140  * Parse a string for # of samples.  The input consists of one or more
144  * user-calculated # of samples.
148  * calculate # of samples.
153 static char const * parsesamples(sox_rate_t rate, const char *str0, uint64_t *samples, int def, int…
155 char const * lsx_parsesamples(sox_rate_t rate, const char *str0, uint64_t *samples, int def)  in lsx_parsesamples()  argument
157   *samples = 0;  in lsx_parsesamples()
158   return parsesamples(rate, str0, samples, def, '+');  in lsx_parsesamples()
161 static char const * parsesamples(sox_rate_t rate, const char *str0, uint64_t *samples, int def, int…  in parsesamples()  argument
231       case '+': *samples += samples_part; break;  in parsesamples()
232       case '-': *samples = samples_part <= *samples ?  in parsesamples()
233                            *samples - samples_part : 0;  in parsesamples()
249   next = lsx_parsesamples(10000, str, &samples, 't'); \
250   assert(samples == samp && next == str + len);
255   uint64_t samples;
285   assert(!lsx_parsesamples(10000, "1e6t", &samples, 't'));
307   assert(!lsx_parsesamples(10000, "x", &samples, 't'));
334  * specifying samples = NULL.  If this passes, a later reparse of the same
338 char const * lsx_parseposition(sox_rate_t rate, const char *str0, uint64_t *samples, uint64_t lates…  in lsx_parseposition()  argument
356   if (!samples) {  in lsx_parseposition()
363     case '=': *samples = 0; break;  in lsx_parseposition()
364     case '+': *samples = latest; break;  in lsx_parseposition()
365     case '-': *samples = end; break;  in lsx_parseposition()
373       /* *samples already set to SOX_UNKNOWN_LEN */  in lsx_parseposition()
379   return parsesamples(rate, str, samples, 't', combine);  in lsx_parseposition()