... | @@ -35,3 +35,4 @@ Cleanups: |
... | @@ -35,3 +35,4 @@ Cleanups: |
|
- lfmask and l/a ctx zero can be done in tile instead of frame context for better distribution.
|
|
- lfmask and l/a ctx zero can be done in tile instead of frame context for better distribution.
|
|
- show_existing_frame will be placed in the frame output queue as something keeping a frame thread busy, meaning for such cases, the frame thread will momentarily stall. This is partially required to prevent overflows of the output queue, or growing it to possibly infinite size on garbage input. But for the regular use case, we can make the output buffer queue twice as big, so that each invisible frame can have one matching show_existing_frame, allowing all frame-threads to be active for the worst-"real"-case while still never overflowing on pathological conditions;
|
|
- show_existing_frame will be placed in the frame output queue as something keeping a frame thread busy, meaning for such cases, the frame thread will momentarily stall. This is partially required to prevent overflows of the output queue, or growing it to possibly infinite size on garbage input. But for the regular use case, we can make the output buffer queue twice as big, so that each invisible frame can have one matching show_existing_frame, allowing all frame-threads to be active for the worst-"real"-case while still never overflowing on pathological conditions;
|
|
- the output queue handling is duplicated in `decode.c`, `lib.c` and `obu.c`, so merge this in one common place.
|
|
- the output queue handling is duplicated in `decode.c`, `lib.c` and `obu.c`, so merge this in one common place.
|
|
|
|
- The `looprestoration`, `mc`, and `dav1d_apply_grain` DSP functions uses excessively large stack buffers. Rewrite them in a way that reduces the stack usage, for example by using ring buffers. This would allow us to reduce the thread stack size requirements. |
|
|
|
\ No newline at end of file |