History

avfilter/vf_mix: improve speed even more by avoiding using filter private context

Paul B Mahol committed 3 years ago

Commit 613f7161 parent c789a231 file · +8 −5Browse files

Unified · Split

libavfilter/vf_mix.c+8−5
@@ -161,27 +161,27 @@ typedef struct ThreadData { · 160 unmodified lines
161161 continue; \
162162 } \
163163 \
164− for (int i = 0; i < s->nb_inputs; i++) \
164+ for (int i = 0; i < nb_inputs; i++) \
165165 linesize[i] = in[i]->linesize[p]; \
166166 \
167− for (int i = 0; i < s->nb_inputs; i++) \
167+ for (int i = 0; i < nb_inputs; i++) \
168168 srcf[i] = in[i]->data[p] + slice_start * linesize[i]; \
169169 \
170170 for (int y = slice_start; y < slice_end; y++) { \
171171 for (int x = 0; x < width; x++) { \
172172 float val = 0.f; \
173173 \
174− for (int i = 0; i < s->nb_inputs; i++) { \
174+ for (int i = 0; i < nb_inputs; i++) { \
175175 float src = *(type *)(srcf[i] + x * sizeof(type)); \
176176 \
177177 val += src * weights[i]; \
178178 } \
179179 \
180− dst[x] = clip(fun(val * s->wfactor), 0, s->max); \
180+ dst[x] = clip(fun(val * wfactor), 0, max); \
181181 } \
182182 \
183183 dst += dst_linesize; \
184− for (int i = 0; i < s->nb_inputs; i++) \
184+ for (int i = 0; i < nb_inputs; i++) \
185185 srcf[i] += linesize[i]; \
186186 } \
187187 }
@@ -200,6 +200,9 @@ static int mix_frames(AVFilterContext *ctx, void *arg, int jobnr, int nb_jobs) · 12 unmodified lines
200200 const float *weights = s->weights;
201201 uint8_t **srcf = s->data + jobnr * s->nb_inputs;
202202 int *linesize = s->linesize + jobnr * s->nb_inputs;
203+ const int nb_inputs = s->nb_inputs;
204+ const float wfactor = s->wfactor;
205+ const int max = s->max;
203206
204207 if (s->depth <= 8) {
205208 MIX_SLICE(uint8_t, lrintf, CLIP8)

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t