116     if (merge && q->nb_subs > 0) {  in ff_subtitles_queue_insert()
120         sub = q->subs[q->nb_subs - 1];  in ff_subtitles_queue_insert()
128         if (q->nb_subs >= INT_MAX/sizeof(*q->subs) - 1)  in ff_subtitles_queue_insert()
131                                (q->nb_subs + 1) * sizeof(*q->subs));  in ff_subtitles_queue_insert()
142         subs[q->nb_subs++] = sub;  in ff_subtitles_queue_insert()
175     for (i = 1; i < q->nb_subs; i++) {  in drop_dups()
193         q->nb_subs -= drop;  in drop_dups()
202     if (!q->nb_subs)  in ff_subtitles_queue_finalize()
205     qsort(q->subs, q->nb_subs, sizeof(*q->subs),  in ff_subtitles_queue_finalize()
208     for (i = 0; i < q->nb_subs; i++)  in ff_subtitles_queue_finalize()
209 …if (q->subs[i]->duration < 0 && i < q->nb_subs - 1 && q->subs[i + 1]->pts - (uint64_t)q->subs[i]->…  in ff_subtitles_queue_finalize()
221     if (q->current_sub_idx == q->nb_subs)  in ff_subtitles_queue_read_packet()
235     int s1 = 0, s2 = q->nb_subs - 1;  in search_sub_ts()
261         if (ts < 0 || ts >= q->nb_subs)  in ff_subtitles_queue_seek()
270         for (i = idx; i < q->nb_subs && q->subs[i]->pts < min_ts; i++)  in ff_subtitles_queue_seek()
311     for (i = 0; i < q->nb_subs; i++)  in ff_subtitles_queue_clean()
314     q->nb_subs = q->allocated_size = q->current_sub_idx = 0;  in ff_subtitles_queue_clean()