Lines Matching refs:n_segments
125 int n_segments;
232 static void free_segment_dynarray(struct segment **segments, int n_segments)
235 for (i = 0; i < n_segments; i++) {
244 free_segment_dynarray(pls->segments, pls->n_segments);
246 pls->n_segments = 0;
793 prev_n_segments = pls->n_segments;
795 pls->n_segments = 0;
874 int64_t seq = pls->start_seq_no + pls->n_segments;
946 uint64_t seq = pls->start_seq_no + (uint64_t)pls->n_segments;
991 dynarray_add(&pls->segments, &pls->n_segments, seg);
1045 if (n >= pls->n_segments)
1053 if (n >= pls->n_segments)
1417 return pls->n_segments > 0 ?
1418 pls->segments[pls->n_segments - 1]->duration :
1532 if (v->cur_seq_no >= v->start_seq_no + v->n_segments) {
1697 for (i = 0; i < pls->n_segments; i++) {
1709 *seq_no = pls->start_seq_no + pls->n_segments - 1;
1734 c->cur_seq_no < pls->start_seq_no + pls->n_segments)
1744 seq_no = pls->start_seq_no + FFMAX(pls->n_segments +
1748 pls->n_segments - 1);
1757 for (int i = 0; i < pls->n_segments; i++)
1951 if (c->n_playlists > 1 || c->playlists[0]->n_segments == 0) {
1966 if (c->variants[i]->playlists[0]->n_segments == 0) {
1976 for (i = 0; i < c->variants[0]->playlists[0]->n_segments; i++)
2008 if (pls->n_segments == 0)
2026 if (pls->n_segments == 0)
2041 highest_cur_seq_no < pls->start_seq_no + pls->n_segments) {