8f75ea6b5c
Most of the code that actually uses these matrices indexes them as if they were a single contiguous array, and coverity produces reports about the resulting accesses that overflow the static bounds of the first row. This is perfectly legal in C, but converting them to actual [16] arrays should eliminate the report, and removes a good deal of extraneous indexing and address operators from the code. Change-Id: Ibda479e2232b3e51f9edf3b355b8640520fdbf23
123 lines
2.9 KiB
C
123 lines
2.9 KiB
C
/*
|
|
* 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.
|
|
*/
|
|
|
|
|
|
#ifndef __INC_BLOCK_H
|
|
#define __INC_BLOCK_H
|
|
|
|
#include "onyx.h"
|
|
#include "blockd.h"
|
|
#include "entropymv.h"
|
|
#include "entropy.h"
|
|
#include "vpx_ports/mem.h"
|
|
|
|
// motion search site
|
|
typedef struct
|
|
{
|
|
MV mv;
|
|
int offset;
|
|
} search_site;
|
|
|
|
typedef struct
|
|
{
|
|
// 16 Y blocks, 4 U blocks, 4 V blocks each with 16 entries
|
|
short *src_diff;
|
|
short *coeff;
|
|
|
|
// 16 Y blocks, 4 U blocks, 4 V blocks each with 16 entries
|
|
short *quant;
|
|
short *quant_shift;
|
|
short *zbin;
|
|
short *zrun_zbin_boost;
|
|
short *round;
|
|
|
|
// Zbin Over Quant value
|
|
short zbin_extra;
|
|
|
|
unsigned char **base_src;
|
|
int src;
|
|
int src_stride;
|
|
|
|
// MV enc_mv;
|
|
int force_empty;
|
|
|
|
} BLOCK;
|
|
|
|
typedef struct
|
|
{
|
|
int count;
|
|
B_MODE_INFO bmi[16];
|
|
} PARTITION_INFO;
|
|
|
|
typedef struct
|
|
{
|
|
DECLARE_ALIGNED(16, short, src_diff[400]); // 16x16 Y 8x8 U 8x8 V 4x4 2nd Y
|
|
DECLARE_ALIGNED(16, short, coeff[400]); // 16x16 Y 8x8 U 8x8 V 4x4 2nd Y
|
|
|
|
// 16 Y blocks, 4 U blocks, 4 V blocks, 1 DC 2nd order block each with 16 entries
|
|
BLOCK block[25];
|
|
|
|
YV12_BUFFER_CONFIG src;
|
|
|
|
MACROBLOCKD e_mbd;
|
|
PARTITION_INFO *partition_info; /* work pointer */
|
|
PARTITION_INFO *pi; /* Corresponds to upper left visible macroblock */
|
|
PARTITION_INFO *pip; /* Base of allocated array */
|
|
|
|
search_site *ss;
|
|
int ss_count;
|
|
int searches_per_step;
|
|
|
|
int errorperbit;
|
|
int sadperbit16;
|
|
int sadperbit4;
|
|
int errthresh;
|
|
int rddiv;
|
|
int rdmult;
|
|
|
|
int mvcosts[2][MVvals+1];
|
|
int *mvcost[2];
|
|
int mvsadcosts[2][MVvals+1];
|
|
int *mvsadcost[2];
|
|
int mbmode_cost[2][MB_MODE_COUNT];
|
|
int intra_uv_mode_cost[2][MB_MODE_COUNT];
|
|
unsigned int bmode_costs[10][10][10];
|
|
unsigned int inter_bmode_costs[B_MODE_COUNT];
|
|
|
|
// These define limits to motion vector components to prevent them from extending outside the UMV borders
|
|
int mv_col_min;
|
|
int mv_col_max;
|
|
int mv_row_min;
|
|
int mv_row_max;
|
|
|
|
int vector_range; // Used to monitor limiting range of recent vectors to guide search.
|
|
int skip;
|
|
|
|
int encode_breakout;
|
|
|
|
//char * gf_active_ptr;
|
|
signed char *gf_active_ptr;
|
|
|
|
unsigned char *active_ptr;
|
|
MV_CONTEXT *mvc;
|
|
|
|
unsigned int token_costs[BLOCK_TYPES] [COEF_BANDS] [PREV_COEF_CONTEXTS] [vp8_coef_tokens];
|
|
int optimize;
|
|
|
|
void (*vp8_short_fdct4x4)(short *input, short *output, int pitch);
|
|
void (*vp8_short_fdct8x4)(short *input, short *output, int pitch);
|
|
void (*short_walsh4x4)(short *input, short *output, int pitch);
|
|
void (*quantize_b)(BLOCK *b, BLOCKD *d);
|
|
|
|
} MACROBLOCK;
|
|
|
|
|
|
#endif
|