Lines Matching refs:max_size
64 bool PartitionTreeNode::CreateChildren(int max_size) {
65 assert(max_size > 0);
68 if (this_size_ + size_vector_[0] <= max_size) {
113 PartitionTreeNode* PartitionTreeNode::GetOptimalNode(int max_size,
115 CreateChildren(max_size);
123 return right->GetOptimalNode(max_size, penalty);
126 return left->GetOptimalNode(max_size, penalty);
137 first = first->GetOptimalNode(max_size, penalty);
139 second = second->GetOptimalNode(max_size, penalty);
173 void Vp8PartitionAggregator::SetPriorMinMax(int min_size, int max_size) {
176 assert(max_size >= min_size);
178 root_->set_max_parent_size(max_size);
182 Vp8PartitionAggregator::FindOptimalConfiguration(int max_size, int penalty) {
184 assert(max_size >= largest_partition_size_);
185 PartitionTreeNode* opt = root_->GetOptimalNode(max_size, penalty);
200 int* min_size, int* max_size) const {
204 if (*max_size < 0) {
205 *max_size = 0;
219 if (this_size > *max_size) {
220 *max_size = this_size;
229 int max_size) {
230 assert(max_size <= max_payload_size);
231 assert(min_size <= max_size);
236 if (min_size < 0 || max_size < 0) {
251 } else if (fragment_size > max_size) {
252 cost = fragment_size - max_size + n * penalty;