34     sox_sample_t const * f2, uint64_t overlap, uint64_t search, size_t channels)  in best_overlap_position()  argument
37   double diff, least_diff = difference(f2, f1, (size_t) (channels * overlap));  in best_overlap_position()
40     diff = difference(f2 + channels * i, f1, (size_t) (channels * overlap));  in best_overlap_position()
53     uint64_t overlap;    /* Number of samples to overlap */  member
67     sox_sample_t * in2, sox_sample_t * output, uint64_t overlap, size_t channels)  in splice()  argument
73     double fade_step = M_PI_2 / overlap;  in splice()
74     for (i = 0; i < overlap; ++i) {  in splice()
84     double fade_step = M_PI / overlap;  in splice()
85     for (i = 0; i < overlap; ++i) {  in splice()
95     double fade_step = 1. / overlap;  in splice()
96     for (i = 0; i < overlap; ++i) {  in splice()
108     sox_sample_t * f, uint64_t overlap, uint64_t search, size_t channels)  in do_splice()  argument
111       f, f + overlap * channels, overlap, search, channels) : 0;  in do_splice()
112   splice(effp, f, f + (overlap + offset) * channels,  in do_splice()
113       f + (overlap + offset) * channels, overlap, channels);  in do_splice()
114   return overlap + offset;  in do_splice()
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()
141       next = lsx_parsesamples(rate, next + 1, &p->splices[i].overlap, 't');  in parse()
143       p->splices[i].overlap *= 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()
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()
192     if (p->splices[i].overlap) {  in start()
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()
243 …size_t buffer_size = (2 * p->splices[p->splices_pos].overlap + p->splices[p->splices_pos].search) …  in flow()