... | @@ -21,7 +21,6 @@ Algorithmic optimizations: |
... | @@ -21,7 +21,6 @@ Algorithmic optimizations: |
|
- early exits in C inverse transform code if eob is small (e.g. identity^2 - although this applies to all types).
|
|
- early exits in C inverse transform code if eob is small (e.g. identity^2 - although this applies to all types).
|
|
|
|
|
|
Cleanups:
|
|
Cleanups:
|
|
- palette buffers are always 16-bit, even if content is 8-bit (remaining item in #257);
|
|
|
|
- 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.
|
|
- 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`, `dav1d_apply_grain`, and `dav1d_init_wedge_masks` functions uses excessively large stack buffers. Rewrite them in a way that reduces the stack usage, for example by using ring buffers or windowed approaches (which we already use for MC/LR SIMD). This would allow us to reduce the thread stack size requirements. |
|
- The `looprestoration`, `mc`, `dav1d_apply_grain`, and `dav1d_init_wedge_masks` functions uses excessively large stack buffers. Rewrite them in a way that reduces the stack usage, for example by using ring buffers or windowed approaches (which we already use for MC/LR SIMD). This would allow us to reduce the thread stack size requirements. |
|
\ No newline at end of file |
|
|