comparison snow.c @ 4408:c3be13eac2d6 libavcodec

Bring down the number of snow.c warnings from 27 to 17 by using the const keyword.
author takis
date Thu, 25 Jan 2007 09:54:22 +0000
parents 15688bdfe1b5
children 1907b07173cf
comparison
equal deleted inserted replaced
4407:15688bdfe1b5 4408:c3be13eac2d6
1957 } 1957 }
1958 assert(!ref_index); 1958 assert(!ref_index);
1959 } 1959 }
1960 1960
1961 static inline void pred_mv(SnowContext *s, int *mx, int *my, int ref, 1961 static inline void pred_mv(SnowContext *s, int *mx, int *my, int ref,
1962 BlockNode *left, BlockNode *top, BlockNode *tr){ 1962 const BlockNode *left, const BlockNode *top, const BlockNode *tr){
1963 if(s->ref_frames == 1){ 1963 if(s->ref_frames == 1){
1964 *mx = mid_pred(left->mx, top->mx, tr->mx); 1964 *mx = mid_pred(left->mx, top->mx, tr->mx);
1965 *my = mid_pred(left->my, top->my, tr->my); 1965 *my = mid_pred(left->my, top->my, tr->my);
1966 }else{ 1966 }else{
1967 const int *scale = scale_mv_ref[ref]; 1967 const int *scale = scale_mv_ref[ref];
1996 const int rem_depth= s->block_max_depth - level; 1996 const int rem_depth= s->block_max_depth - level;
1997 const int index= (x + y*w) << rem_depth; 1997 const int index= (x + y*w) << rem_depth;
1998 const int block_w= 1<<(LOG2_MB_SIZE - level); 1998 const int block_w= 1<<(LOG2_MB_SIZE - level);
1999 int trx= (x+1)<<rem_depth; 1999 int trx= (x+1)<<rem_depth;
2000 int try= (y+1)<<rem_depth; 2000 int try= (y+1)<<rem_depth;
2001 BlockNode *left = x ? &s->block[index-1] : &null_block; 2001 const BlockNode *left = x ? &s->block[index-1] : &null_block;
2002 BlockNode *top = y ? &s->block[index-w] : &null_block; 2002 const BlockNode *top = y ? &s->block[index-w] : &null_block;
2003 BlockNode *right = trx<w ? &s->block[index+1] : &null_block; 2003 const BlockNode *right = trx<w ? &s->block[index+1] : &null_block;
2004 BlockNode *bottom= try<h ? &s->block[index+w] : &null_block; 2004 const BlockNode *bottom= try<h ? &s->block[index+w] : &null_block;
2005 BlockNode *tl = y && x ? &s->block[index-w-1] : left; 2005 const BlockNode *tl = y && x ? &s->block[index-w-1] : left;
2006 BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt 2006 const BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt
2007 int pl = left->color[0]; 2007 int pl = left->color[0];
2008 int pcb= left->color[1]; 2008 int pcb= left->color[1];
2009 int pcr= left->color[2]; 2009 int pcr= left->color[2];
2010 int pmx, pmy; 2010 int pmx, pmy;
2011 int mx=0, my=0; 2011 int mx=0, my=0;
2223 const int w= s->b_width << s->block_max_depth; 2223 const int w= s->b_width << s->block_max_depth;
2224 const int rem_depth= s->block_max_depth - level; 2224 const int rem_depth= s->block_max_depth - level;
2225 const int index= (x + y*w) << rem_depth; 2225 const int index= (x + y*w) << rem_depth;
2226 int trx= (x+1)<<rem_depth; 2226 int trx= (x+1)<<rem_depth;
2227 BlockNode *b= &s->block[index]; 2227 BlockNode *b= &s->block[index];
2228 BlockNode *left = x ? &s->block[index-1] : &null_block; 2228 const BlockNode *left = x ? &s->block[index-1] : &null_block;
2229 BlockNode *top = y ? &s->block[index-w] : &null_block; 2229 const BlockNode *top = y ? &s->block[index-w] : &null_block;
2230 BlockNode *tl = y && x ? &s->block[index-w-1] : left; 2230 const BlockNode *tl = y && x ? &s->block[index-w-1] : left;
2231 BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt 2231 const BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt
2232 int pl = left->color[0]; 2232 int pl = left->color[0];
2233 int pcb= left->color[1]; 2233 int pcb= left->color[1];
2234 int pcr= left->color[2]; 2234 int pcr= left->color[2];
2235 int pmx, pmy; 2235 int pmx, pmy;
2236 int ref_context= av_log2(2*left->ref) + av_log2(2*top->ref); 2236 int ref_context= av_log2(2*left->ref) + av_log2(2*top->ref);
2276 static void decode_q_branch(SnowContext *s, int level, int x, int y){ 2276 static void decode_q_branch(SnowContext *s, int level, int x, int y){
2277 const int w= s->b_width << s->block_max_depth; 2277 const int w= s->b_width << s->block_max_depth;
2278 const int rem_depth= s->block_max_depth - level; 2278 const int rem_depth= s->block_max_depth - level;
2279 const int index= (x + y*w) << rem_depth; 2279 const int index= (x + y*w) << rem_depth;
2280 int trx= (x+1)<<rem_depth; 2280 int trx= (x+1)<<rem_depth;
2281 BlockNode *left = x ? &s->block[index-1] : &null_block; 2281 const BlockNode *left = x ? &s->block[index-1] : &null_block;
2282 BlockNode *top = y ? &s->block[index-w] : &null_block; 2282 const BlockNode *top = y ? &s->block[index-w] : &null_block;
2283 BlockNode *tl = y && x ? &s->block[index-w-1] : left; 2283 const BlockNode *tl = y && x ? &s->block[index-w-1] : left;
2284 BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt 2284 const BlockNode *tr = y && trx<w && ((x&1)==0 || level==0) ? &s->block[index-w+(1<<rem_depth)] : tl; //FIXME use lt
2285 int s_context= 2*left->level + 2*top->level + tl->level + tr->level; 2285 int s_context= 2*left->level + 2*top->level + tl->level + tr->level;
2286 2286
2287 if(s->keyframe){ 2287 if(s->keyframe){
2288 set_blocks(s, level, x, y, null_block.color[0], null_block.color[1], null_block.color[2], null_block.mx, null_block.my, null_block.ref, BLOCK_INTRA); 2288 set_blocks(s, level, x, y, null_block.color[0], null_block.color[1], null_block.color[2], null_block.mx, null_block.my, null_block.ref, BLOCK_INTRA);
2289 return; 2289 return;
2903 2903
2904 static inline int get_block_bits(SnowContext *s, int x, int y, int w){ 2904 static inline int get_block_bits(SnowContext *s, int x, int y, int w){
2905 const int b_stride = s->b_width << s->block_max_depth; 2905 const int b_stride = s->b_width << s->block_max_depth;
2906 const int b_height = s->b_height<< s->block_max_depth; 2906 const int b_height = s->b_height<< s->block_max_depth;
2907 int index= x + y*b_stride; 2907 int index= x + y*b_stride;
2908 BlockNode *b = &s->block[index]; 2908 const BlockNode *b = &s->block[index];
2909 BlockNode *left = x ? &s->block[index-1] : &null_block; 2909 const BlockNode *left = x ? &s->block[index-1] : &null_block;
2910 BlockNode *top = y ? &s->block[index-b_stride] : &null_block; 2910 const BlockNode *top = y ? &s->block[index-b_stride] : &null_block;
2911 BlockNode *tl = y && x ? &s->block[index-b_stride-1] : left; 2911 const BlockNode *tl = y && x ? &s->block[index-b_stride-1] : left;
2912 BlockNode *tr = y && x+w<b_stride ? &s->block[index-b_stride+w] : tl; 2912 const BlockNode *tr = y && x+w<b_stride ? &s->block[index-b_stride+w] : tl;
2913 int dmx, dmy; 2913 int dmx, dmy;
2914 // int mx_context= av_log2(2*FFABS(left->mx - top->mx)); 2914 // int mx_context= av_log2(2*FFABS(left->mx - top->mx));
2915 // int my_context= av_log2(2*FFABS(left->my - top->my)); 2915 // int my_context= av_log2(2*FFABS(left->my - top->my));
2916 2916
2917 if(x<0 || x>=b_stride || y>=b_height) 2917 if(x<0 || x>=b_stride || y>=b_height)