libavcodec/wmv2enc.c:48: error: Null Dereference
  pointer `&pb->buf_ptr` last assigned on line 35 could be null and is dereferenced by call to `flush_put_bits()` at line 48, column 5.

libavcodec/wmv2enc.c:30:1: start of procedure encode_ext_header()
28. 
29. 
30. static int encode_ext_header(Wmv2Context *w){
    ^
31.     MpegEncContext * const s= &w->s;
32.     PutBitContext pb;

libavcodec/wmv2enc.c:31:5: 
29. 
30. static int encode_ext_header(Wmv2Context *w){
31.     MpegEncContext * const s= &w->s;
        ^
32.     PutBitContext pb;
33.     int code;

libavcodec/wmv2enc.c:35:5: 
33.     int code;
34. 
35.     init_put_bits(&pb, s->avctx->extradata, s->avctx->extradata_size);
        ^
36. 
37.     put_bits(&pb, 5, s->avctx->time_base.den / s->avctx->time_base.num); //yes 29.97 -> 29

libavcodec/put_bits.h:52:1: start of procedure init_put_bits()
  50.  * @param buffer_size the size in bytes of buffer
  51.  */
  52. static inline void init_put_bits(PutBitContext *s, uint8_t *buffer, int buffer_size)
      ^
  53. {
  54.     if(buffer_size < 0) {

libavcodec/put_bits.h:54:8: Taking true branch
  52. static inline void init_put_bits(PutBitContext *s, uint8_t *buffer, int buffer_size)
  53. {
  54.     if(buffer_size < 0) {
             ^
  55.         buffer_size = 0;
  56.         buffer = NULL;

libavcodec/put_bits.h:55:9: 
  53. {
  54.     if(buffer_size < 0) {
  55.         buffer_size = 0;
              ^
  56.         buffer = NULL;
  57.     }

libavcodec/put_bits.h:56:9: 
  54.     if(buffer_size < 0) {
  55.         buffer_size = 0;
  56.         buffer = NULL;
              ^
  57.     }
  58. 

libavcodec/put_bits.h:59:5: 
  57.     }
  58. 
  59.     s->size_in_bits= 8*buffer_size;
          ^
  60.     s->buf = buffer;
  61.     s->buf_end = s->buf + buffer_size;

libavcodec/put_bits.h:60:5: 
  58. 
  59.     s->size_in_bits= 8*buffer_size;
  60.     s->buf = buffer;
          ^
  61.     s->buf_end = s->buf + buffer_size;
  62.     s->buf_ptr = s->buf;

libavcodec/put_bits.h:61:5: 
  59.     s->size_in_bits= 8*buffer_size;
  60.     s->buf = buffer;
  61.     s->buf_end = s->buf + buffer_size;
          ^
  62.     s->buf_ptr = s->buf;
  63.     s->bit_left=32;

libavcodec/put_bits.h:62:5: 
  60.     s->buf = buffer;
  61.     s->buf_end = s->buf + buffer_size;
  62.     s->buf_ptr = s->buf;
          ^
  63.     s->bit_left=32;
  64.     s->bit_buf=0;

libavcodec/put_bits.h:63:5: 
  61.     s->buf_end = s->buf + buffer_size;
  62.     s->buf_ptr = s->buf;
  63.     s->bit_left=32;
          ^
  64.     s->bit_buf=0;
  65. }

libavcodec/put_bits.h:64:5: 
  62.     s->buf_ptr = s->buf;
  63.     s->bit_left=32;
  64.     s->bit_buf=0;
          ^
  65. }
  66. 

libavcodec/put_bits.h:65:1: return from a call to init_put_bits
  63.     s->bit_left=32;
  64.     s->bit_buf=0;
  65. }
      ^
  66. 
  67. /**

libavcodec/wmv2enc.c:37:5: 
35.     init_put_bits(&pb, s->avctx->extradata, s->avctx->extradata_size);
36. 
37.     put_bits(&pb, 5, s->avctx->time_base.den / s->avctx->time_base.num); //yes 29.97 -> 29
        ^
38.     put_bits(&pb, 11, FFMIN(s->bit_rate/1024, 2047));
39. 

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:38:23: Condition is true
36. 
37.     put_bits(&pb, 5, s->avctx->time_base.den / s->avctx->time_base.num); //yes 29.97 -> 29
38.     put_bits(&pb, 11, FFMIN(s->bit_rate/1024, 2047));
                          ^
39. 
40.     put_bits(&pb, 1, w->mspel_bit=1);

libavcodec/wmv2enc.c:38:5: 
36. 
37.     put_bits(&pb, 5, s->avctx->time_base.den / s->avctx->time_base.num); //yes 29.97 -> 29
38.     put_bits(&pb, 11, FFMIN(s->bit_rate/1024, 2047));
        ^
39. 
40.     put_bits(&pb, 1, w->mspel_bit=1);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:40:5: 
38.     put_bits(&pb, 11, FFMIN(s->bit_rate/1024, 2047));
39. 
40.     put_bits(&pb, 1, w->mspel_bit=1);
        ^
41.     put_bits(&pb, 1, s->loop_filter);
42.     put_bits(&pb, 1, w->abt_flag=1);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:41:5: 
39. 
40.     put_bits(&pb, 1, w->mspel_bit=1);
41.     put_bits(&pb, 1, s->loop_filter);
        ^
42.     put_bits(&pb, 1, w->abt_flag=1);
43.     put_bits(&pb, 1, w->j_type_bit=1);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:42:5: 
40.     put_bits(&pb, 1, w->mspel_bit=1);
41.     put_bits(&pb, 1, s->loop_filter);
42.     put_bits(&pb, 1, w->abt_flag=1);
        ^
43.     put_bits(&pb, 1, w->j_type_bit=1);
44.     put_bits(&pb, 1, w->top_left_mv_flag=0);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:43:5: 
41.     put_bits(&pb, 1, s->loop_filter);
42.     put_bits(&pb, 1, w->abt_flag=1);
43.     put_bits(&pb, 1, w->j_type_bit=1);
        ^
44.     put_bits(&pb, 1, w->top_left_mv_flag=0);
45.     put_bits(&pb, 1, w->per_mb_rl_bit=1);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:44:5: 
42.     put_bits(&pb, 1, w->abt_flag=1);
43.     put_bits(&pb, 1, w->j_type_bit=1);
44.     put_bits(&pb, 1, w->top_left_mv_flag=0);
        ^
45.     put_bits(&pb, 1, w->per_mb_rl_bit=1);
46.     put_bits(&pb, 3, code=1);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:45:5: 
43.     put_bits(&pb, 1, w->j_type_bit=1);
44.     put_bits(&pb, 1, w->top_left_mv_flag=0);
45.     put_bits(&pb, 1, w->per_mb_rl_bit=1);
        ^
46.     put_bits(&pb, 3, code=1);
47. 

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:46:5: 
44.     put_bits(&pb, 1, w->top_left_mv_flag=0);
45.     put_bits(&pb, 1, w->per_mb_rl_bit=1);
46.     put_bits(&pb, 3, code=1);
        ^
47. 
48.     flush_put_bits(&pb);

libavcodec/put_bits.h:128:1: start of procedure put_bits()
  126.  * Use put_bits32 to write 32 bits.
  127.  */
  128. static inline void put_bits(PutBitContext *s, int n, unsigned int value)
       ^
  129. {
  130.     unsigned int bit_buf;

libavcodec/put_bits.h:133:5: 
  131.     int bit_left;
  132. 
  133.     assert(n <= 31 && value < (1U << n));
           ^
  134. 
  135.     bit_buf = s->bit_buf;

libavcodec/put_bits.h:135:5: 
  133.     assert(n <= 31 && value < (1U << n));
  134. 
  135.     bit_buf = s->bit_buf;
           ^
  136.     bit_left = s->bit_left;
  137. 

libavcodec/put_bits.h:136:5: 
  134. 
  135.     bit_buf = s->bit_buf;
  136.     bit_left = s->bit_left;
           ^
  137. 
  138.     /* XXX: optimize */

libavcodec/put_bits.h:149:9: Taking true branch
  147.     bit_left-=n;
  148. #else
  149.     if (n < bit_left) {
               ^
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;

libavcodec/put_bits.h:150:9: 
  148. #else
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
               ^
  151.         bit_left-=n;
  152.     } else {

libavcodec/put_bits.h:151:9: 
  149.     if (n < bit_left) {
  150.         bit_buf = (bit_buf<<n) | value;
  151.         bit_left-=n;
               ^
  152.     } else {
  153.         bit_buf<<=bit_left;

libavcodec/put_bits.h:162:5: 
  160. #endif
  161. 
  162.     s->bit_buf = bit_buf;
           ^
  163.     s->bit_left = bit_left;
  164. }

libavcodec/put_bits.h:163:5: 
  161. 
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
           ^
  164. }
  165. 

libavcodec/put_bits.h:164:1: return from a call to put_bits
  162.     s->bit_buf = bit_buf;
  163.     s->bit_left = bit_left;
  164. }
       ^
  165. 
  166. static inline void put_sbits(PutBitContext *pb, int n, int32_t value)

libavcodec/wmv2enc.c:48:5: 
46.     put_bits(&pb, 3, code=1);
47. 
48.     flush_put_bits(&pb);
        ^
49. 
50.     s->slice_height = s->mb_height / code;

libavcodec/put_bits.h:78:1: start of procedure flush_put_bits()
  76.  * Pad the end of the output stream with zeros.
  77.  */
  78. static inline void flush_put_bits(PutBitContext *s)
      ^
  79. {
  80. #ifndef BITSTREAM_WRITER_LE

libavcodec/put_bits.h:81:9: Taking true branch
  79. {
  80. #ifndef BITSTREAM_WRITER_LE
  81.     if (s->bit_left < 32)
              ^
  82.         s->bit_buf<<= s->bit_left;
  83. #endif

libavcodec/put_bits.h:82:9: 
  80. #ifndef BITSTREAM_WRITER_LE
  81.     if (s->bit_left < 32)
  82.         s->bit_buf<<= s->bit_left;
              ^
  83. #endif
  84.     while (s->bit_left < 32) {

libavcodec/put_bits.h:84:12: Loop condition is true. Entering loop body
  82.         s->bit_buf<<= s->bit_left;
  83. #endif
  84.     while (s->bit_left < 32) {
                 ^
  85.         /* XXX: should test end of buffer */
  86. #ifdef BITSTREAM_WRITER_LE

libavcodec/put_bits.h:90:9: 
  88.         s->bit_buf>>=8;
  89. #else
  90.         *s->buf_ptr++=s->bit_buf >> 24;
              ^
  91.         s->bit_buf<<=8;
  92. #endif
