Lines Matching +full:stack +full:- +full:utils

8  *      http://www.apache.org/licenses/LICENSE-2.0
26 #include "src/utils/common.h"
27 #include "src/utils/compiler_attributes.h"
28 #include "src/utils/constants.h"
29 #include "src/utils/memory.h"
30 #include "src/utils/queue.h"
31 #include "src/utils/types.h"
43       buffer->buffer_ = MakeAlignedUniquePtr<uint8_t>(32, buffer_size);  in Create()
44       if (buffer->buffer_ == nullptr ||  in Create()
45           !buffer->transform_parameters_.Init(queue_size) ||  in Create()
46           !buffer->partition_tree_order_.Init(queue_size)) {  in Create()
81 // A LIFO stack of ResidualBuffers. Owns the buffers in the stack.
92   // Pushes |buffer| to the top of the stack.
95   // If the stack is non-empty, returns the buffer at the top of the stack and
96   // removes it from the stack. If the stack is empty, returns nullptr.
99   // Swaps the contents of this stack and |other|.
102   // Returns the number of buffers in the stack.
106   // A singly-linked list of ResidualBuffers, chained together using the next_
113 // parameters) used for multi-threaded decoding. This class uses a stack to
116 // thread-safe.
129   // in the stack, it returns one from the stack, otherwise a new buffer is
132   // Returns the |buffer| back to the pool (by appending it to the stack).
133   // Subsequent calls to Get() may re-use this buffer.
136   // Used only in the tests. Returns the number of buffers in the stack.