squash some signed/unsigned comparison warnings
Change-Id: Ifc64cf990ae04d77934da3324d0afb3993f061e7
This commit is contained in:
parent
bb1915274f
commit
b651875e24
2
args.c
2
args.c
@ -57,7 +57,7 @@ int arg_match(struct arg *arg_, const struct arg_def *def, char **argv)
|
||||
}
|
||||
else if (def->long_name)
|
||||
{
|
||||
int name_len = strlen(def->long_name);
|
||||
const size_t name_len = strlen(def->long_name);
|
||||
|
||||
if (strlen(arg.argv[0]) >= name_len + 2
|
||||
&& arg.argv[0][1] == '-'
|
||||
|
@ -484,7 +484,8 @@ static void setup_token_decoder(VP8D_COMP *pbi,
|
||||
const unsigned char* token_part_sizes)
|
||||
{
|
||||
vp8_reader *bool_decoder = &pbi->bc2;
|
||||
int fragment_idx, partition_idx;
|
||||
unsigned int partition_idx;
|
||||
int fragment_idx;
|
||||
int num_token_partitions;
|
||||
const unsigned char *first_fragment_end = pbi->fragments[0] +
|
||||
pbi->fragment_sizes[0];
|
||||
|
@ -1206,7 +1206,7 @@ static void sum_probs_over_prev_coef_context(
|
||||
{
|
||||
for (j=0; j < PREV_COEF_CONTEXTS; ++j)
|
||||
{
|
||||
const int tmp = out[i];
|
||||
const unsigned int tmp = out[i];
|
||||
out[i] += probs[j][i];
|
||||
/* check for wrap */
|
||||
if (out[i] < tmp)
|
||||
|
@ -48,7 +48,7 @@ vp8_lookahead_destroy(struct lookahead_ctx *ctx)
|
||||
{
|
||||
if(ctx->buf)
|
||||
{
|
||||
int i;
|
||||
unsigned int i;
|
||||
|
||||
for(i = 0; i < ctx->max_sz; i++)
|
||||
vp8_yv12_de_alloc_frame_buffer(&ctx->buf[i].img);
|
||||
@ -65,7 +65,7 @@ vp8_lookahead_init(unsigned int width,
|
||||
unsigned int depth)
|
||||
{
|
||||
struct lookahead_ctx *ctx = NULL;
|
||||
int i;
|
||||
unsigned int i;
|
||||
|
||||
/* Clamp the lookahead queue depth */
|
||||
if(depth < 1)
|
||||
@ -188,7 +188,7 @@ vp8_lookahead_pop(struct lookahead_ctx *ctx,
|
||||
|
||||
struct lookahead_entry*
|
||||
vp8_lookahead_peek(struct lookahead_ctx *ctx,
|
||||
int index)
|
||||
unsigned int index)
|
||||
{
|
||||
struct lookahead_entry* buf = NULL;
|
||||
|
||||
|
@ -92,7 +92,7 @@ vp8_lookahead_pop(struct lookahead_ctx *ctx,
|
||||
*/
|
||||
struct lookahead_entry*
|
||||
vp8_lookahead_peek(struct lookahead_ctx *ctx,
|
||||
int index);
|
||||
unsigned int index);
|
||||
|
||||
|
||||
/**\brief Get the number of frames currently in the lookahead queue
|
||||
|
@ -1156,7 +1156,7 @@ int vp8_diamond_search_sadx4
|
||||
int tot_steps;
|
||||
int_mv this_mv;
|
||||
|
||||
int bestsad = INT_MAX;
|
||||
unsigned int bestsad = UINT_MAX;
|
||||
int best_site = 0;
|
||||
int last_site = 0;
|
||||
|
||||
@ -1397,7 +1397,7 @@ int vp8_full_search_sadx3(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
|
||||
unsigned char *bestaddress;
|
||||
int_mv *best_mv = &d->bmi.mv;
|
||||
int_mv this_mv;
|
||||
int bestsad = INT_MAX;
|
||||
unsigned int bestsad = UINT_MAX;
|
||||
int r, c;
|
||||
|
||||
unsigned char *check_here;
|
||||
@ -1527,7 +1527,7 @@ int vp8_full_search_sadx8(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
|
||||
unsigned char *bestaddress;
|
||||
int_mv *best_mv = &d->bmi.mv;
|
||||
int_mv this_mv;
|
||||
int bestsad = INT_MAX;
|
||||
unsigned int bestsad = UINT_MAX;
|
||||
int r, c;
|
||||
|
||||
unsigned char *check_here;
|
||||
|
@ -1080,10 +1080,10 @@ void vp8_set_speed_features(VP8_COMP *cpi)
|
||||
|
||||
if (Speed > 6)
|
||||
{
|
||||
unsigned int i, sum = 0;
|
||||
unsigned int sum = 0;
|
||||
unsigned int total_mbs = cm->MBs;
|
||||
int thresh;
|
||||
int total_skip;
|
||||
int i, thresh;
|
||||
unsigned int total_skip;
|
||||
|
||||
int min = 2000;
|
||||
|
||||
@ -1513,8 +1513,8 @@ static void init_config(VP8_COMP *cpi, VP8_CONFIG *oxcf)
|
||||
// Temporal scalabilty
|
||||
if (cpi->oxcf.number_of_layers > 1)
|
||||
{
|
||||
int i;
|
||||
int prev_layer_frame_rate=0;
|
||||
unsigned int i;
|
||||
double prev_layer_frame_rate=0;
|
||||
|
||||
for (i=0; i<cpi->oxcf.number_of_layers; i++)
|
||||
{
|
||||
@ -3539,7 +3539,7 @@ static void encode_frame_to_data_rate
|
||||
|
||||
if (cpi->oxcf.number_of_layers > 1)
|
||||
{
|
||||
int i;
|
||||
unsigned int i;
|
||||
|
||||
// Propagate bits saved by dropping the frame to higher layers
|
||||
for (i=cpi->current_layer+1; i<cpi->oxcf.number_of_layers; i++)
|
||||
@ -4316,7 +4316,7 @@ static void encode_frame_to_data_rate
|
||||
|
||||
if (cpi->oxcf.number_of_layers > 1)
|
||||
{
|
||||
int i;
|
||||
unsigned int i;
|
||||
for (i=cpi->current_layer+1; i<cpi->oxcf.number_of_layers; i++)
|
||||
cpi->layer_context[i].total_byte_count += (*size);
|
||||
}
|
||||
@ -4427,7 +4427,7 @@ static void encode_frame_to_data_rate
|
||||
// Propagate values to higher temporal layers
|
||||
if (cpi->oxcf.number_of_layers > 1)
|
||||
{
|
||||
int i;
|
||||
unsigned int i;
|
||||
|
||||
for (i=cpi->current_layer+1; i<cpi->oxcf.number_of_layers; i++)
|
||||
{
|
||||
|
@ -98,7 +98,7 @@ void vp8_temporal_filter_apply_c
|
||||
unsigned short *count
|
||||
)
|
||||
{
|
||||
int i, j, k;
|
||||
unsigned int i, j, k;
|
||||
int modifier;
|
||||
int byte = 0;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user