Lines Matching defs:split
322 var split[4];
327 v4x4 split[4];
332 v8x8 split[4];
337 v16x16 split[4];
342 v32x32 split[4];
347 var *split[4];
364 node->split[i] = &vt->split[i].part_variances.none;
371 node->split[i] = &vt->split[i].part_variances.none;
378 node->split[i] = &vt->split[i].part_variances.none;
385 node->split[i] = &vt->split[i].part_variances.none;
391 for (i = 0; i < 4; i++) node->split[i] = &vt->split[i];
425 sum_2_variances(node.split[0], node.split[1], &node.part_variances->horz[0]);
426 sum_2_variances(node.split[2], node.split[3], &node.part_variances->horz[1]);
427 sum_2_variances(node.split[0], node.split[2], &node.part_variances->vert[0]);
428 sum_2_variances(node.split[1], node.split[3], &node.part_variances->vert[1]);
449 // variance is below threshold, otherwise split will be selected.
450 // No check for vert/horiz split as too few samples for variance.
464 // For key frame: take split for bsize above 32X32 or very high variance.
470 // If variance is low, take the bsize (no split).
478 // Check vertical split.
491 // Check horizontal split.
530 // Set the variance split thresholds for following the block sizes:
532 // 3 - vbp_threshold_8x8. vbp_threshold_8x8 (to split to 4x4 partition) is
696 fill_variance(sse, sum, 0, &vst->split[k].part_variances.none);
732 fill_variance(sse, sum, 0, &vst->split[k].part_variances.none);
736 // Check if most of the superblock is skin content, and if so, force split to
836 if (vt->split[i].part_variances.none.variance < threshold_32x32)
845 if (vt->split[i].split[j].part_variances.none.variance <
1472 v16x16 *vst = &vt.split[i].split[j];
1481 fill_variance_tree(&vt.split[i].split[j], BLOCK_16X16);
1482 get_variance(&vt.split[i].split[j].part_variances.none);
1483 avg_16x16[i] += vt.split[i].split[j].part_variances.none.variance;
1484 if (vt.split[i].split[j].part_variances.none.variance < minvar_16x16[i])
1485 minvar_16x16[i] = vt.split[i].split[j].part_variances.none.variance;
1486 if (vt.split[i].split[j].part_variances.none.variance > maxvar_16x16[i])
1487 maxvar_16x16[i] = vt.split[i].split[j].part_variances.none.variance;
1488 if (vt.split[i].split[j].part_variances.none.variance > thresholds[2]) {
1489 // 16X16 variance is above threshold for split, so force split to 8x8
1495 vt.split[i].split[j].part_variances.none.variance >
1500 // force split to 8x8 block for this 16x16 block.
1517 vt.split[i].split[j].part_variances.none.variance >
1525 v8x8 *vst2 = is_key_frame ? &vst->split[k] : &vt2[i2 + j].split[k];
1537 // Fill the rest of the variance tree by summing split partition values.
1543 v16x16 *vtemp = (!is_key_frame) ? &vt2[i2 + j] : &vt.split[i].split[j];
1544 for (m = 0; m < 4; m++) fill_variance_tree(&vtemp->split[m], BLOCK_8X8);
1547 // to split. This also forces a split on the upper levels.
1556 fill_variance_tree(&vt.split[i], BLOCK_32X32);
1559 // force this block to split. This also forces a split on the upper
1562 get_variance(&vt.split[i].part_variances.none);
1563 var_32x32 = vt.split[i].part_variances.none.variance;
1566 if (vt.split[i].part_variances.none.variance > thresholds[1] ||
1568 vt.split[i].part_variances.none.variance > (thresholds[1] >> 1) &&
1569 vt.split[i].part_variances.none.variance > (avg_16x16[i] >> 1))) {
1585 // variance over the sub-32x32 blocks, then force this block to split.
1592 // above a miniumum threshold, then force the split of a 64x64 block
1609 if (!set_vt_partitioning(cpi, x, xd, &vt.split[i], BLOCK_32X32,
1621 : &vt.split[i].split[j];
1630 if (!set_vt_partitioning(cpi, x, xd, &vtemp->split[k],
2177 pc_tree->split[0]);
2179 subsize, pc_tree->split[1]);
2181 subsize, pc_tree->split[2]);
2183 subsize, pc_tree->split[3]);
2515 pc_tree->split[0]);
2517 subsize, pc_tree->split[1]);
2519 subsize, pc_tree->split[2]);
2521 output_enabled, subsize, pc_tree->split[3]);
2578 // Check if any of the sub blocks are further split.
2591 // If partition is not none try none unless each of the 4 splits are split
2683 pc_tree->split[i]);
2727 pc_tree->split[i]->partitioning = PARTITION_NONE;
2729 &tmp_rdc, split_subsize, &pc_tree->split[i]->none,
2744 split_subsize, pc_tree->split[i]);
3203 // Decide whether we shall split directly and skip searching NONE by using
3380 pc_tree->split[i]->index = i;
3383 best_rdc.rdcost - sum_rdc.rdcost, pc_tree->split[i]);
3805 fill_mode_info_sb(cm, x, mi_row, mi_col, subsize, pc_tree->split[0]);
3807 pc_tree->split[1]);
3809 pc_tree->split[2]);
3811 pc_tree->split[3]);
3829 for (i = 0; i < 4; ++i) pred_pixel_ready_reset(pc_tree->split[i], subsize);
3948 best_rdc.rdcost - sum_rdc.rdcost, pc_tree->split[i]);
4180 pc_tree->split[0]);
4183 pc_tree->split[1]);
4191 &this_rdc, pc_tree->split[2]);
4199 output_enabled, &this_rdc, pc_tree->split[3]);
4304 output_enabled, dummy_cost, pc_tree->split[0]);
4307 pc_tree->split[1]);
4310 dummy_cost, pc_tree->split[2]);
4313 dummy_cost, pc_tree->split[3]);