Home
last modified time | relevance | path

Searched refs:PartitionTreeNode (Results 1 – 3 of 3) sorted by relevance

/external/libgav1/libgav1/src/
Dresidual_buffer_pool.h65 Queue<PartitionTreeNode>* partition_tree_order() { in partition_tree_order()
76 Queue<PartitionTreeNode> partition_tree_order_;
/external/libgav1/libgav1/src/utils/
Dtypes.h530 struct PartitionTreeNode { struct
531 PartitionTreeNode() = default;
532 PartitionTreeNode(int row4x4, int column4x4, BlockSize block_size) in PartitionTreeNode() function
/external/libgav1/libgav1/src/tile/
Dtile.cc2143 ->Push(PartitionTreeNode(row4x4, column4x4, block_size)); in ProcessBlock()
2223 Stack<PartitionTreeNode, kDfsStackSize> stack; in ProcessPartition()
2227 PartitionTreeNode(row4x4_start, column4x4_start, SuperBlockSize())); in ProcessPartition()
2232 PartitionTreeNode node = stack.Pop(); in ProcessPartition()
2286 stack.Push(PartitionTreeNode(row4x4 + half_block4x4, in ProcessPartition()
2289 PartitionTreeNode(row4x4 + half_block4x4, column4x4, sub_size)); in ProcessPartition()
2291 PartitionTreeNode(row4x4, column4x4 + half_block4x4, sub_size)); in ProcessPartition()
2292 stack.Push(PartitionTreeNode(row4x4, column4x4, sub_size)); in ProcessPartition()
2495 Queue<PartitionTreeNode>& partition_tree_order = in DecodeSuperBlock()
2499 PartitionTreeNode block = partition_tree_order.Front(); in DecodeSuperBlock()