Lines Matching refs:splices
56 } * splices; member
130 p->splices[i].str = lsx_strdup(argv[i]); in parse()
132 p->splices[i].overlap = rate * 0.01 + .5; in parse()
133 p->splices[i].search = p->fade_type == Cosine_4? 0 : p->splices[i].overlap; in parse()
135 next = lsx_parseposition(rate, p->splices[i].str, in parse()
136 argv ? NULL : &p->splices[i].start, last_seen, in_length, '='); in parse()
138 last_seen = p->splices[i].start; in parse()
141 next = lsx_parsesamples(rate, next + 1, &p->splices[i].overlap, 't'); in parse()
143 p->splices[i].overlap *= 2; in parse()
145 next = lsx_parsesamples(rate, next + 1, &p->splices[i].search, 't'); in parse()
147 p->splices[i].search *= 2; in parse()
151 p->splices[i].overlap = max(p->splices[i].overlap + 4, 16); in parse()
152 p->splices[i].overlap &= ~7; /* Make divisible by 8 for loop optimisation */ in parse()
155 if (i > 0 && p->splices[i].start <= p->splices[i-1].start) break; in parse()
156 if (p->splices[i].start < p->splices[i].overlap) break; in parse()
157 p->splices[i].start -= p->splices[i].overlap; in parse()
158 buffer_size = 2 * p->splices[i].overlap + p->splices[i].search; in parse()
177 p->splices = lsx_calloc(p->nsplices, sizeof(*p->splices)); in create()
189 p->state = p->splices_pos != p->nsplices && p->in_pos == p->splices[p->splices_pos].start; in start()
192 if (p->splices[i].overlap) { in start()
212 if (p->splices_pos != p->nsplices && p->in_pos == p->splices[p->splices_pos].start) { in flow()
224 …size_t buffer_size = (2 * p->splices[p->splices_pos].overlap + p->splices[p->splices_pos].search) … in flow()
228 p->splices[p->splices_pos].overlap, in flow()
229 p->splices[p->splices_pos].search, in flow()
243 …size_t buffer_size = (2 * p->splices[p->splices_pos].overlap + p->splices[p->splices_pos].search) … in flow()
248 p->state = p->splices_pos != p->nsplices && p->in_pos == p->splices[p->splices_pos].start; in flow()
283 free(p->splices[i].str); in lsx_kill()
284 free(p->splices); in lsx_kill()