/* * Copyright (c) 2010 The WebM project authors. All Rights Reserved. * * Use of this source code is governed by a BSD-style license * that can be found in the LICENSE file in the root of the source * tree. An additional intellectual property rights grant can be found * in the file PATENTS. All contributing project authors may * be found in the AUTHORS file in the root of the source tree.
*/
void vp8_mb_init_dequantizer(VP8D_COMP *pbi, MACROBLOCKD *xd) { int i; int QIndex;
MB_MODE_INFO *mbmi = &xd->mode_info_context->mbmi;
VP8_COMMON *const pc = &pbi->common;
/* Decide whether to use the default or alternate baseline Q value. */ if (xd->segmentation_enabled) { /* Abs Value */ if (xd->mb_segment_abs_delta == SEGMENT_ABSDATA) {
QIndex = xd->segment_feature_data[MB_LVL_ALT_Q][mbmi->segment_id];
if (xd->mode_info_context->mbmi.mb_skip_coeff) {
vp8_reset_mb_tokens_context(xd);
} elseif (!vp8dx_bool_error(xd->current_bc)) { int eobtotal;
eobtotal = vp8_decode_mb_tokens(pbi, xd);
/* Special case: Force the loopfilter to skip when eobtotal is zero */
xd->mode_info_context->mbmi.mb_skip_coeff = (eobtotal == 0);
}
mode = xd->mode_info_context->mbmi.mode;
if (xd->segmentation_enabled) vp8_mb_init_dequantizer(pbi, xd);
#if CONFIG_ERROR_CONCEALMENT
if (pbi->ec_active) { int throw_residual; /* When we have independent partitions we can apply residual even * though other partitions within the frame are corrupt.
*/
throw_residual =
(!pbi->independent_partitions && pbi->frame_corrupt_residual);
throw_residual = (throw_residual || vp8dx_bool_error(xd->current_bc));
if ((mb_idx >= pbi->mvs_corrupt_from_mb || throw_residual)) { /* MB with corrupt residuals or corrupt mode/motion vectors. * Better to use the predictor as reconstruction.
*/
pbi->frame_corrupt_residual = 1;
memset(xd->qcoeff, 0, sizeof(xd->qcoeff));
corruption_detected = 1;
/* force idct to be skipped for B_PRED and use the * prediction only for reconstruction
* */
memset(xd->eobs, 0, 25);
}
} #endif
/* do prediction */ if (xd->mode_info_context->mbmi.ref_frame == INTRA_FRAME) {
vp8_build_intra_predictors_mbuv_s(
xd, xd->recon_above[1], xd->recon_above[2], xd->recon_left[1],
xd->recon_left[2], xd->recon_left_stride[1], xd->dst.u_buffer,
xd->dst.v_buffer, xd->dst.uv_stride);
if (mode != B_PRED) {
vp8_build_intra_predictors_mby_s(
xd, xd->recon_above[0], xd->recon_left[0], xd->recon_left_stride[0],
xd->dst.y_buffer, xd->dst.y_stride);
} else { short *DQC = xd->dequant_y1; int dst_stride = xd->dst.y_stride;
/* clear out residual eob info */ if (xd->mode_info_context->mbmi.mb_skip_coeff) memset(xd->eobs, 0, 25);
/* copy the left and right most columns out */
src_ptr1 = y_src;
src_ptr2 = src_ptr1 + plane_width - 1;
dest_ptr1 = src_ptr1 - Border;
dest_ptr2 = src_ptr2 + 1;
for (i = 0; i < plane_height; ++i) {
memset(dest_ptr1, src_ptr1[0], Border);
memset(dest_ptr2, src_ptr2[0], Border);
src_ptr1 += plane_stride;
src_ptr2 += plane_stride;
dest_ptr1 += plane_stride;
dest_ptr2 += plane_stride;
}
/* copy the left and right most columns out */
src_ptr1 = u_src;
src_ptr2 = src_ptr1 + plane_width - 1;
dest_ptr1 = src_ptr1 - Border;
dest_ptr2 = src_ptr2 + 1;
for (i = 0; i < plane_height; ++i) {
memset(dest_ptr1, src_ptr1[0], Border);
memset(dest_ptr2, src_ptr2[0], Border);
src_ptr1 += plane_stride;
src_ptr2 += plane_stride;
dest_ptr1 += plane_stride;
dest_ptr2 += plane_stride;
}
/***********/ /* V Plane */ /***********/
/* copy the left and right most columns out */
src_ptr1 = v_src;
src_ptr2 = src_ptr1 + plane_width - 1;
dest_ptr1 = src_ptr1 - Border;
dest_ptr2 = src_ptr2 + 1;
for (i = 0; i < plane_height; ++i) {
memset(dest_ptr1, src_ptr1[0], Border);
memset(dest_ptr2, src_ptr2[0], Border);
src_ptr1 += plane_stride;
src_ptr2 += plane_stride;
dest_ptr1 += plane_stride;
dest_ptr2 += plane_stride;
}
}
for (mb_col = 0; mb_col < pc->mb_cols; ++mb_col) { /* Distance of Mb to the various image edges. * These are specified to 8th pel as they are always compared to values * that are in 1/8th pel units
*/
xd->mb_to_left_edge = -((mb_col * 16) << 3);
xd->mb_to_right_edge = ((pc->mb_cols - 1 - mb_col) * 16) << 3;
#if CONFIG_ERROR_CONCEALMENT
{ int corrupt_residual =
(!pbi->independent_partitions && pbi->frame_corrupt_residual) ||
vp8dx_bool_error(xd->current_bc); if (pbi->ec_active &&
xd->mode_info_context->mbmi.ref_frame == INTRA_FRAME &&
corrupt_residual) { /* We have an intra block with corrupt coefficients, better to * conceal with an inter block. Interpolate MVs from neighboring * MBs. * * Note that for the first mb with corrupt residual in a frame, * we might not discover that before decoding the residual. That * happens after this check, and therefore no inter concealment * will be done.
*/
vp8_interpolate_motion(xd, mb_row, mb_col, pc->mb_rows, pc->mb_cols);
}
} #endif
staticint read_is_valid(constunsignedchar *start, size_t len, constunsignedchar *end) { return len != 0 && end > start && len <= (size_t)(end - start);
}
staticunsignedint read_available_partition_size(
VP8D_COMP *pbi, constunsignedchar *token_part_sizes, constunsignedchar *fragment_start, constunsignedchar *first_fragment_end, constunsignedchar *fragment_end, int i, int num_part) {
VP8_COMMON *pc = &pbi->common; constunsignedchar *partition_size_ptr = token_part_sizes + i * 3; unsignedint partition_size = 0;
ptrdiff_t bytes_left = fragment_end - fragment_start; if (bytes_left < 0) {
vpx_internal_error(
&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated packet or corrupt partition. No bytes left %d.",
(int)bytes_left);
} /* Calculate the length of this partition. The last partition * size is implicit. If the partition size can't be read, then * either use the remaining data in the buffer (for EC mode) * or throw an error.
*/ if (i < num_part - 1) { if (read_is_valid(partition_size_ptr, 3, first_fragment_end)) {
partition_size = read_partition_size(pbi, partition_size_ptr);
} elseif (pbi->ec_active) {
partition_size = (unsignedint)bytes_left;
} else {
vpx_internal_error(&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated partition size data");
}
} else {
partition_size = (unsignedint)bytes_left;
}
/* Validate the calculated partition length. If the buffer * described by the partition can't be fully read, then restrict * it to the portion that can be (for EC mode) or throw an error.
*/ if (!read_is_valid(fragment_start, partition_size, fragment_end)) { if (pbi->ec_active) {
partition_size = (unsignedint)bytes_left;
} else {
vpx_internal_error(&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated packet or corrupt partition " "%d length",
i + 1);
}
} return partition_size;
}
/* Check for partitions within the fragments and unpack the fragments
* so that each fragment pointer points to its corresponding partition. */ for (fragment_idx = 0; fragment_idx < pbi->fragments.count; ++fragment_idx) { unsignedint fragment_size = pbi->fragments.sizes[fragment_idx]; constunsignedchar *fragment_end =
pbi->fragments.ptrs[fragment_idx] + fragment_size; /* Special case for handling the first partition since we have already
* read its size. */ if (fragment_idx == 0) { /* Size of first partition + token partition sizes element */
ptrdiff_t ext_first_part_size = token_part_sizes -
pbi->fragments.ptrs[0] +
3 * (num_token_partitions - 1); if (fragment_size < (unsignedint)ext_first_part_size)
vpx_internal_error(&pbi->common.error, VPX_CODEC_CORRUPT_FRAME, "Corrupted fragment size %d", fragment_size);
fragment_size -= (unsignedint)ext_first_part_size; if (fragment_size > 0) {
pbi->fragments.sizes[0] = (unsignedint)ext_first_part_size; /* The fragment contains an additional partition. Move to
* next. */
fragment_idx++;
pbi->fragments.ptrs[fragment_idx] =
pbi->fragments.ptrs[0] + pbi->fragments.sizes[0];
}
} /* Split the chunk into partitions read from the bitstream */ while (fragment_size > 0) {
ptrdiff_t partition_size = read_available_partition_size(
pbi, token_part_sizes, pbi->fragments.ptrs[fragment_idx],
first_fragment_end, fragment_end, fragment_idx - 1,
num_token_partitions);
pbi->fragments.sizes[fragment_idx] = (unsignedint)partition_size; if (fragment_size < (unsignedint)partition_size)
vpx_internal_error(&pbi->common.error, VPX_CODEC_CORRUPT_FRAME, "Corrupted fragment size %d", fragment_size);
fragment_size -= (unsignedint)partition_size;
assert(fragment_idx <= num_token_partitions); if (fragment_size > 0) { /* The fragment contains an additional partition.
* Move to next. */
fragment_idx++;
pbi->fragments.ptrs[fragment_idx] =
pbi->fragments.ptrs[fragment_idx - 1] + partition_size;
}
}
}
pbi->fragments.count = num_token_partitions + 1;
for (partition_idx = 1; partition_idx < pbi->fragments.count;
++partition_idx) { if (vp8dx_start_decode(bool_decoder, pbi->fragments.ptrs[partition_idx],
pbi->fragments.sizes[partition_idx], pbi->decrypt_cb,
pbi->decrypt_state)) {
vpx_internal_error(&pbi->common.error, VPX_CODEC_MEM_ERROR, "Failed to allocate bool decoder %d", partition_idx);
}
bool_decoder++;
}
#if CONFIG_MULTITHREAD /* Clamp number of decoder threads */ if (pbi->decoding_thread_count > num_token_partitions - 1) {
pbi->decoding_thread_count = num_token_partitions - 1;
} if ((int)pbi->decoding_thread_count > pbi->common.mb_rows - 1) {
assert(pbi->common.mb_rows > 0);
pbi->decoding_thread_count = pbi->common.mb_rows - 1;
} #endif
}
if (pc->frame_type == KEY_FRAME) { /* Various keyframe initializations */
memcpy(pc->fc.mvc, vp8_default_mv_context, sizeof(vp8_default_mv_context));
vp8_init_mbmode_probs(pc);
vp8_default_coef_probs(pc);
/* reset the segment feature data to 0 with delta coding (Default state). */
memset(xd->segment_feature_data, 0, sizeof(xd->segment_feature_data));
xd->mb_segment_abs_delta = SEGMENT_DELTADATA;
/* reset the mode ref deltasa for loop filter */
memset(xd->ref_lf_deltas, 0, sizeof(xd->ref_lf_deltas));
memset(xd->mode_lf_deltas, 0, sizeof(xd->mode_lf_deltas));
/* All buffers are implicitly updated on key frames. */
pc->refresh_golden_frame = 1;
pc->refresh_alt_ref_frame = 1;
pc->copy_buffer_to_gf = 0;
pc->copy_buffer_to_arf = 0;
/* Note that Golden and Altref modes cannot be used on a key frame so * ref_frame_sign_bias[] is undefined and meaningless
*/
pc->ref_frame_sign_bias[GOLDEN_FRAME] = 0;
pc->ref_frame_sign_bias[ALTREF_FRAME] = 0;
} else { /* To enable choice of different interploation filters */ if (!pc->use_bilinear_mc_filter) {
xd->subpixel_predict = vp8_sixtap_predict4x4;
xd->subpixel_predict8x4 = vp8_sixtap_predict8x4;
xd->subpixel_predict8x8 = vp8_sixtap_predict8x8;
xd->subpixel_predict16x16 = vp8_sixtap_predict16x16;
} else {
xd->subpixel_predict = vp8_bilinear_predict4x4;
xd->subpixel_predict8x4 = vp8_bilinear_predict8x4;
xd->subpixel_predict8x8 = vp8_bilinear_predict8x8;
xd->subpixel_predict16x16 = vp8_bilinear_predict16x16;
}
xd->fullpixel_mask = ~0; if (pc->full_pixel) xd->fullpixel_mask = ~7;
}
int vp8_decode_frame(VP8D_COMP *pbi) {
vp8_reader *const bc = &pbi->mbc[8];
VP8_COMMON *const pc = &pbi->common;
MACROBLOCKD *const xd = &pbi->mb; constunsignedchar *data = pbi->fragments.ptrs[0]; constunsignedint data_sz = pbi->fragments.sizes[0]; constunsignedchar *data_end = data + data_sz;
ptrdiff_t first_partition_length_in_bytes;
int i, j, k, l; constint *const mb_feature_data_bits = vp8_mb_feature_data_bits; int corrupt_tokens = 0; int prev_independent_partitions = pbi->independent_partitions;
/* start with no corruption of current frame */
xd->corrupted = 0;
yv12_fb_new->corrupted = 0;
if (data_end - data < 3) { if (!pbi->ec_active) {
vpx_internal_error(&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated packet");
}
/* Declare the missing frame as an inter frame since it will be handled as an inter frame when we have estimated its
motion vectors. */
pc->frame_type = INTER_FRAME;
pc->version = 0;
pc->show_frame = 1;
first_partition_length_in_bytes = 0;
} else { unsignedchar clear_buffer[10]; constunsignedchar *clear = data; if (pbi->decrypt_cb) { int n = (int)VPXMIN(sizeof(clear_buffer), data_sz);
pbi->decrypt_cb(pbi->decrypt_state, data, clear_buffer, n);
clear = clear_buffer;
}
if (!pbi->ec_active && (data + first_partition_length_in_bytes > data_end ||
data + first_partition_length_in_bytes < data)) {
vpx_internal_error(&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated packet or corrupt partition 0 length");
}
data += 3;
clear += 3;
vp8_setup_version(pc);
if (pc->frame_type == KEY_FRAME) { /* vet via sync code */ /* When error concealment is enabled we should only check the sync * code if we have enough bits available
*/ if (data + 3 < data_end) { if (clear[0] != 0x9d || clear[1] != 0x01 || clear[2] != 0x2a) {
vpx_internal_error(&pc->error, VPX_CODEC_UNSUP_BITSTREAM, "Invalid frame sync code");
}
}
/* If error concealment is enabled we should only parse the new size * if we have enough data. Otherwise we will end up with the wrong * size.
*/ if (data + 6 < data_end) {
pc->Width = (clear[3] | (clear[4] << 8)) & 0x3fff;
pc->horiz_scale = clear[4] >> 6;
pc->Height = (clear[5] | (clear[6] << 8)) & 0x3fff;
pc->vert_scale = clear[6] >> 6;
data += 7;
} elseif (!pbi->ec_active) {
vpx_internal_error(&pc->error, VPX_CODEC_CORRUPT_FRAME, "Truncated key frame header");
} else { /* Error concealment is active, clear the frame. */
data = data_end;
}
} else {
memcpy(&xd->pre, yv12_fb_new, sizeof(YV12_BUFFER_CONFIG));
memcpy(&xd->dst, yv12_fb_new, sizeof(YV12_BUFFER_CONFIG));
}
} if ((!pbi->decoded_key_frame && pc->frame_type != KEY_FRAME)) { return -1;
}
init_frame(pbi);
if (vp8dx_start_decode(bc, data, (unsignedint)(data_end - data),
pbi->decrypt_cb, pbi->decrypt_state)) {
vpx_internal_error(&pc->error, VPX_CODEC_MEM_ERROR, "Failed to allocate bool decoder 0");
} if (pc->frame_type == KEY_FRAME) {
(void)vp8_read_bit(bc); // colorspace
pc->clamp_type = (CLAMP_TYPE)vp8_read_bit(bc);
}
/* Is segmentation enabled */
xd->segmentation_enabled = (unsignedchar)vp8_read_bit(bc);
if (xd->segmentation_enabled) { /* Signal whether or not the segmentation map is being explicitly updated
* this frame. */
xd->update_mb_segmentation_map = (unsignedchar)vp8_read_bit(bc);
xd->update_mb_segmentation_data = (unsignedchar)vp8_read_bit(bc);
if (xd->update_mb_segmentation_data) {
xd->mb_segment_abs_delta = (unsignedchar)vp8_read_bit(bc);
/* For each segmentation feature (Quant and loop filter level) */ for (i = 0; i < MB_LVL_MAX; ++i) { for (j = 0; j < MAX_MB_SEGMENTS; ++j) { /* Frame level data */ if (vp8_read_bit(bc)) {
xd->segment_feature_data[i][j] =
(signedchar)vp8_read_literal(bc, mb_feature_data_bits[i]);
if (xd->update_mb_segmentation_map) { /* Which macro block level features are enabled */
memset(xd->mb_segment_tree_probs, 255, sizeof(xd->mb_segment_tree_probs));
/* Read the probs used to decode the segment id for each macro block. */ for (i = 0; i < MB_FEATURE_TREE_PROBS; ++i) { /* If not explicitly set value is defaulted to 255 by memset above */ if (vp8_read_bit(bc)) {
xd->mb_segment_tree_probs[i] = (vp8_prob)vp8_read_literal(bc, 8);
}
}
}
} else { /* No segmentation updates on this frame */
xd->update_mb_segmentation_map = 0;
xd->update_mb_segmentation_data = 0;
}
/* Read the loop filter level and type */
pc->filter_type = (LOOPFILTERTYPE)vp8_read_bit(bc);
pc->filter_level = vp8_read_literal(bc, 6);
pc->sharpness_level = vp8_read_literal(bc, 3);
/* Read in loop filter deltas applied at the MB level based on mode or ref
* frame. */
xd->mode_ref_lf_delta_update = 0;
xd->mode_ref_lf_delta_enabled = (unsignedchar)vp8_read_bit(bc);
if (xd->mode_ref_lf_delta_enabled) { /* Do the deltas need to be updated */
xd->mode_ref_lf_delta_update = (unsignedchar)vp8_read_bit(bc);
if (xd->mode_ref_lf_delta_update) { /* Send update */ for (i = 0; i < MAX_REF_LF_DELTAS; ++i) { if (vp8_read_bit(bc)) { /*sign = vp8_read_bit( bc );*/
xd->ref_lf_deltas[i] = (signedchar)vp8_read_literal(bc, 6);
/* Send update */ for (i = 0; i < MAX_MODE_LF_DELTAS; ++i) { if (vp8_read_bit(bc)) { /*sign = vp8_read_bit( bc );*/
xd->mode_lf_deltas[i] = (signedchar)vp8_read_literal(bc, 6);
/* Determine if the golden frame or ARF buffer should be updated and how. * For all non key frames the GF and ARF refresh flags and sign bias * flags must be set explicitly.
*/ if (pc->frame_type != KEY_FRAME) { /* Should the GF or ARF be updated from the current frame */
pc->refresh_golden_frame = vp8_read_bit(bc); #if CONFIG_ERROR_CONCEALMENT /* Assume we shouldn't refresh golden if the bit is missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->refresh_golden_frame = 0; #endif
pc->refresh_alt_ref_frame = vp8_read_bit(bc); #if CONFIG_ERROR_CONCEALMENT /* Assume we shouldn't refresh altref if the bit is missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->refresh_alt_ref_frame = 0; #endif
/* Buffer to buffer copy flags. */
pc->copy_buffer_to_gf = 0;
if (!pc->refresh_golden_frame) {
pc->copy_buffer_to_gf = vp8_read_literal(bc, 2);
}
#if CONFIG_ERROR_CONCEALMENT /* Assume we shouldn't copy to the golden if the bit is missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->copy_buffer_to_gf = 0; #endif
pc->copy_buffer_to_arf = 0;
if (!pc->refresh_alt_ref_frame) {
pc->copy_buffer_to_arf = vp8_read_literal(bc, 2);
}
#if CONFIG_ERROR_CONCEALMENT /* Assume we shouldn't copy to the alt-ref if the bit is missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->copy_buffer_to_arf = 0; #endif
pc->refresh_entropy_probs = vp8_read_bit(bc); #if CONFIG_ERROR_CONCEALMENT /* Assume we shouldn't refresh the probabilities if the bit is
* missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->refresh_entropy_probs = 0; #endif if (pc->refresh_entropy_probs == 0) {
memcpy(&pc->lfc, &pc->fc, sizeof(pc->fc));
}
#if CONFIG_ERROR_CONCEALMENT /* Assume we should refresh the last frame if the bit is missing */
xd->corrupted |= vp8dx_bool_error(bc); if (pbi->ec_active && xd->corrupted) pc->refresh_last_frame = 1; #endif
{
pbi->independent_partitions = 1;
/* read coef probability tree */ for (i = 0; i < BLOCK_TYPES; ++i) { for (j = 0; j < COEF_BANDS; ++j) { for (k = 0; k < PREV_COEF_CONTEXTS; ++k) { for (l = 0; l < ENTROPY_NODES; ++l) {
vp8_prob *const p = pc->fc.coef_probs[i][j][k] + l;
/* clear out the coeff buffer */
memset(xd->qcoeff, 0, sizeof(xd->qcoeff));
vp8_decode_mode_mvs(pbi);
#if CONFIG_ERROR_CONCEALMENT if (pbi->ec_active &&
pbi->mvs_corrupt_from_mb < (unsignedint)pc->mb_cols * pc->mb_rows) { /* Motion vectors are missing in this frame. We will try to estimate
* them and then continue decoding the frame as usual */
vp8_estimate_missing_mvs(pbi);
} #endif
/* Collect information about decoder corruption. */ /* 1. Check first boolean decoder for errors. */
yv12_fb_new->corrupted = vp8dx_bool_error(bc); /* 2. Check the macroblock information */
yv12_fb_new->corrupted |= corrupt_tokens;
if (!pbi->decoded_key_frame) { if (pc->frame_type == KEY_FRAME && !yv12_fb_new->corrupted) {
pbi->decoded_key_frame = 1;
} else {
vpx_internal_error(&pbi->common.error, VPX_CODEC_CORRUPT_FRAME, "A stream must start with a complete key frame");
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.