libavcodec/smacker.c:314: error: Null Dereference
  pointer `smk->type_tbl` last assigned on line 313 could be null and is dereferenced at line 314, column 9.

libavcodec/smacker.c:276:1: start of procedure decode_header_trees()
274. }
275. 
276. static int decode_header_trees(SmackVContext *smk) {
     ^
277.     GetBitContext gb;
278.     int mmap_size, mclr_size, full_size, type_size;

libavcodec/smacker.c:280:5: 
278.     int mmap_size, mclr_size, full_size, type_size;
279. 
280.     mmap_size = AV_RL32(smk->avctx->extradata);
         ^
281.     mclr_size = AV_RL32(smk->avctx->extradata + 4);
282.     full_size = AV_RL32(smk->avctx->extradata + 8);

libavcodec/smacker.c:281:5: 
279. 
280.     mmap_size = AV_RL32(smk->avctx->extradata);
281.     mclr_size = AV_RL32(smk->avctx->extradata + 4);
         ^
282.     full_size = AV_RL32(smk->avctx->extradata + 8);
283.     type_size = AV_RL32(smk->avctx->extradata + 12);

libavcodec/smacker.c:282:5: 
280.     mmap_size = AV_RL32(smk->avctx->extradata);
281.     mclr_size = AV_RL32(smk->avctx->extradata + 4);
282.     full_size = AV_RL32(smk->avctx->extradata + 8);
         ^
283.     type_size = AV_RL32(smk->avctx->extradata + 12);
284. 

libavcodec/smacker.c:283:5: 
281.     mclr_size = AV_RL32(smk->avctx->extradata + 4);
282.     full_size = AV_RL32(smk->avctx->extradata + 8);
283.     type_size = AV_RL32(smk->avctx->extradata + 12);
         ^
284. 
285.     init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);

libavcodec/smacker.c:285:5: 
283.     type_size = AV_RL32(smk->avctx->extradata + 12);
284. 
285.     init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
         ^
286. 
287.     if(!get_bits1(&gb)) {

libavcodec/get_bits.h:391:1: start of procedure init_get_bits()
  389.  * responsible for checking for the buffer end yourself (take advantage of the padding)!
  390.  */
  391. static inline void init_get_bits(GetBitContext *s,
       ^
  392.                    const uint8_t *buffer, int bit_size)
  393. {

libavcodec/get_bits.h:394:5: 
  392.                    const uint8_t *buffer, int bit_size)
  393. {
  394.     int buffer_size = (bit_size+7)>>3;
           ^
  395.     if (buffer_size < 0 || bit_size < 0) {
  396.         buffer_size = bit_size = 0;

libavcodec/get_bits.h:395:9: Taking false branch
  393. {
  394.     int buffer_size = (bit_size+7)>>3;
  395.     if (buffer_size < 0 || bit_size < 0) {
               ^
  396.         buffer_size = bit_size = 0;
  397.         buffer = NULL;

libavcodec/get_bits.h:395:28: Taking false branch
  393. {
  394.     int buffer_size = (bit_size+7)>>3;
  395.     if (buffer_size < 0 || bit_size < 0) {
                                  ^
  396.         buffer_size = bit_size = 0;
  397.         buffer = NULL;

libavcodec/get_bits.h:400:5: 
  398.     }
  399. 
  400.     s->buffer       = buffer;
           ^
  401.     s->size_in_bits = bit_size;
  402.     s->buffer_end   = buffer + buffer_size;

libavcodec/get_bits.h:401:5: 
  399. 
  400.     s->buffer       = buffer;
  401.     s->size_in_bits = bit_size;
           ^
  402.     s->buffer_end   = buffer + buffer_size;
  403. #ifdef ALT_BITSTREAM_READER

libavcodec/get_bits.h:402:5: 
  400.     s->buffer       = buffer;
  401.     s->size_in_bits = bit_size;
  402.     s->buffer_end   = buffer + buffer_size;
           ^
  403. #ifdef ALT_BITSTREAM_READER
  404.     s->index        = 0;

libavcodec/get_bits.h:404:5: 
  402.     s->buffer_end   = buffer + buffer_size;
  403. #ifdef ALT_BITSTREAM_READER
  404.     s->index        = 0;
           ^
  405. #elif defined A32_BITSTREAM_READER
  406.     s->buffer_ptr   = (uint32_t*)((intptr_t)buffer & ~3);

libavcodec/get_bits.h:410:1: return from a call to init_get_bits
  408.     skip_bits_long(s, 0);
  409. #endif
  410. }
       ^
  411. 
  412. static inline void align_get_bits(GetBitContext *s)

libavcodec/smacker.c:287:9: 
285.     init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
286. 
287.     if(!get_bits1(&gb)) {
             ^
288.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);

libavcodec/get_bits.h:311:1: start of procedure get_bits1()
  309. }
  310. 
  311. static inline unsigned int get_bits1(GetBitContext *s){
       ^
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;

libavcodec/get_bits.h:313:5: 
  311. static inline unsigned int get_bits1(GetBitContext *s){
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
           ^
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE

libavcodec/get_bits.h:314:5: 
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
  314.     uint8_t result = s->buffer[index>>3];
           ^
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;

libavcodec/get_bits.h:316:5: 
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
           ^
  317.     result &= 1;
  318. #else

libavcodec/get_bits.h:317:5: 
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
  317.     result &= 1;
           ^
  318. #else
  319.     result <<= index & 7;

libavcodec/get_bits.h:322:5: 
  320.     result >>= 8 - 1;
  321. #endif
  322.     index++;
           ^
  323.     s->index = index;
  324. 

libavcodec/get_bits.h:323:5: 
  321. #endif
  322.     index++;
  323.     s->index = index;
           ^
  324. 
  325.     return result;

libavcodec/get_bits.h:325:5: 
  323.     s->index = index;
  324. 
  325.     return result;
           ^
  326. #else
  327.     return get_bits(s, 1);

libavcodec/get_bits.h:329:1: return from a call to get_bits1
  327.     return get_bits(s, 1);
  328. #endif
  329. }
       ^
  330. 
  331. static inline unsigned int show_bits1(GetBitContext *s){

libavcodec/smacker.c:287:9: Taking true branch
285.     init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
286. 
287.     if(!get_bits1(&gb)) {
             ^
288.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);

libavcodec/smacker.c:288:9: Skipping av_log(): empty list of specs
286. 
287.     if(!get_bits1(&gb)) {
288.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
             ^
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);
290.         smk->mmap_tbl[0] = 0;

libavcodec/smacker.c:289:9: 
287.     if(!get_bits1(&gb)) {
288.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);
             ^
290.         smk->mmap_tbl[0] = 0;
291.         smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;

libavutil/mem.c:64:1: start of procedure av_malloc()
  62.    linker will do it automatically. */
  63. 
  64. void *av_malloc(size_t size)
      ^
  65. {
  66.     void *ptr = NULL;

libavutil/mem.c:66:5: 
  64. void *av_malloc(size_t size)
  65. {
  66.     void *ptr = NULL;
          ^
  67. #if CONFIG_MEMALIGN_HACK
  68.     long diff;

libavutil/mem.c:72:8: Taking false branch
  70. 
  71.     /* let's disallow possible ambiguous cases */
  72.     if(size > (INT_MAX-32) )
             ^
  73.         return NULL;
  74. 

libavutil/mem.c:83:9: Taking false branch
  81.     ((char*)ptr)[-1]= diff;
  82. #elif HAVE_POSIX_MEMALIGN
  83.     if (posix_memalign(&ptr,32,size))
              ^
  84.         ptr = NULL;
  85. #elif HAVE_MEMALIGN

libavutil/mem.c:114:5: 
  112.     ptr = malloc(size);
  113. #endif
  114.     return ptr;
           ^
  115. }
  116. 

libavutil/mem.c:115:1: return from a call to av_malloc
  113. #endif
  114.     return ptr;
  115. }
       ^
  116. 
  117. void *av_realloc(void *ptr, size_t size)

libavcodec/smacker.c:290:9: 
288.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);
290.         smk->mmap_tbl[0] = 0;
             ^
291.         smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
292.     } else {

libavcodec/smacker.c:291:9: 
289.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);
290.         smk->mmap_tbl[0] = 0;
291.         smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
             ^
292.     } else {
293.         smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size);

libavcodec/smacker.c:295:9: 
293.         smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size);
294.     }
295.     if(!get_bits1(&gb)) {
             ^
296.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);

libavcodec/get_bits.h:311:1: start of procedure get_bits1()
  309. }
  310. 
  311. static inline unsigned int get_bits1(GetBitContext *s){
       ^
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;

libavcodec/get_bits.h:313:5: 
  311. static inline unsigned int get_bits1(GetBitContext *s){
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
           ^
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE

libavcodec/get_bits.h:314:5: 
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
  314.     uint8_t result = s->buffer[index>>3];
           ^
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;

libavcodec/get_bits.h:316:5: 
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
           ^
  317.     result &= 1;
  318. #else

libavcodec/get_bits.h:317:5: 
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
  317.     result &= 1;
           ^
  318. #else
  319.     result <<= index & 7;

libavcodec/get_bits.h:322:5: 
  320.     result >>= 8 - 1;
  321. #endif
  322.     index++;
           ^
  323.     s->index = index;
  324. 

libavcodec/get_bits.h:323:5: 
  321. #endif
  322.     index++;
  323.     s->index = index;
           ^
  324. 
  325.     return result;

libavcodec/get_bits.h:325:5: 
  323.     s->index = index;
  324. 
  325.     return result;
           ^
  326. #else
  327.     return get_bits(s, 1);

libavcodec/get_bits.h:329:1: return from a call to get_bits1
  327.     return get_bits(s, 1);
  328. #endif
  329. }
       ^
  330. 
  331. static inline unsigned int show_bits1(GetBitContext *s){

libavcodec/smacker.c:295:9: Taking true branch
293.         smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size);
294.     }
295.     if(!get_bits1(&gb)) {
             ^
296.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);

libavcodec/smacker.c:296:9: Skipping av_log(): empty list of specs
294.     }
295.     if(!get_bits1(&gb)) {
296.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
             ^
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);
298.         smk->mclr_tbl[0] = 0;

libavcodec/smacker.c:297:9: 
295.     if(!get_bits1(&gb)) {
296.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);
             ^
298.         smk->mclr_tbl[0] = 0;
299.         smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;

libavutil/mem.c:64:1: start of procedure av_malloc()
  62.    linker will do it automatically. */
  63. 
  64. void *av_malloc(size_t size)
      ^
  65. {
  66.     void *ptr = NULL;

libavutil/mem.c:66:5: 
  64. void *av_malloc(size_t size)
  65. {
  66.     void *ptr = NULL;
          ^
  67. #if CONFIG_MEMALIGN_HACK
  68.     long diff;

libavutil/mem.c:72:8: Taking false branch
  70. 
  71.     /* let's disallow possible ambiguous cases */
  72.     if(size > (INT_MAX-32) )
             ^
  73.         return NULL;
  74. 

libavutil/mem.c:83:9: Taking false branch
  81.     ((char*)ptr)[-1]= diff;
  82. #elif HAVE_POSIX_MEMALIGN
  83.     if (posix_memalign(&ptr,32,size))
              ^
  84.         ptr = NULL;
  85. #elif HAVE_MEMALIGN

libavutil/mem.c:114:5: 
  112.     ptr = malloc(size);
  113. #endif
  114.     return ptr;
           ^
  115. }
  116. 

libavutil/mem.c:115:1: return from a call to av_malloc
  113. #endif
  114.     return ptr;
  115. }
       ^
  116. 
  117. void *av_realloc(void *ptr, size_t size)

libavcodec/smacker.c:298:9: 
296.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);
298.         smk->mclr_tbl[0] = 0;
             ^
299.         smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
300.     } else {

libavcodec/smacker.c:299:9: 
297.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);
298.         smk->mclr_tbl[0] = 0;
299.         smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
             ^
300.     } else {
301.         smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size);

libavcodec/smacker.c:303:9: 
301.         smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size);
302.     }
303.     if(!get_bits1(&gb)) {
             ^
304.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);

libavcodec/get_bits.h:311:1: start of procedure get_bits1()
  309. }
  310. 
  311. static inline unsigned int get_bits1(GetBitContext *s){
       ^
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;

libavcodec/get_bits.h:313:5: 
  311. static inline unsigned int get_bits1(GetBitContext *s){
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
           ^
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE

libavcodec/get_bits.h:314:5: 
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
  314.     uint8_t result = s->buffer[index>>3];
           ^
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;

libavcodec/get_bits.h:316:5: 
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
           ^
  317.     result &= 1;
  318. #else

libavcodec/get_bits.h:317:5: 
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
  317.     result &= 1;
           ^
  318. #else
  319.     result <<= index & 7;

libavcodec/get_bits.h:322:5: 
  320.     result >>= 8 - 1;
  321. #endif
  322.     index++;
           ^
  323.     s->index = index;
  324. 

libavcodec/get_bits.h:323:5: 
  321. #endif
  322.     index++;
  323.     s->index = index;
           ^
  324. 
  325.     return result;

libavcodec/get_bits.h:325:5: 
  323.     s->index = index;
  324. 
  325.     return result;
           ^
  326. #else
  327.     return get_bits(s, 1);

libavcodec/get_bits.h:329:1: return from a call to get_bits1
  327.     return get_bits(s, 1);
  328. #endif
  329. }
       ^
  330. 
  331. static inline unsigned int show_bits1(GetBitContext *s){

libavcodec/smacker.c:303:9: Taking true branch
301.         smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size);
302.     }
303.     if(!get_bits1(&gb)) {
             ^
304.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);

libavcodec/smacker.c:304:9: Skipping av_log(): empty list of specs
302.     }
303.     if(!get_bits1(&gb)) {
304.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
             ^
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);
306.         smk->full_tbl[0] = 0;

libavcodec/smacker.c:305:9: 
303.     if(!get_bits1(&gb)) {
304.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);
             ^
306.         smk->full_tbl[0] = 0;
307.         smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;

libavutil/mem.c:64:1: start of procedure av_malloc()
  62.    linker will do it automatically. */
  63. 
  64. void *av_malloc(size_t size)
      ^
  65. {
  66.     void *ptr = NULL;

libavutil/mem.c:66:5: 
  64. void *av_malloc(size_t size)
  65. {
  66.     void *ptr = NULL;
          ^
  67. #if CONFIG_MEMALIGN_HACK
  68.     long diff;

libavutil/mem.c:72:8: Taking false branch
  70. 
  71.     /* let's disallow possible ambiguous cases */
  72.     if(size > (INT_MAX-32) )
             ^
  73.         return NULL;
  74. 

libavutil/mem.c:83:9: Taking false branch
  81.     ((char*)ptr)[-1]= diff;
  82. #elif HAVE_POSIX_MEMALIGN
  83.     if (posix_memalign(&ptr,32,size))
              ^
  84.         ptr = NULL;
  85. #elif HAVE_MEMALIGN

libavutil/mem.c:114:5: 
  112.     ptr = malloc(size);
  113. #endif
  114.     return ptr;
           ^
  115. }
  116. 

libavutil/mem.c:115:1: return from a call to av_malloc
  113. #endif
  114.     return ptr;
  115. }
       ^
  116. 
  117. void *av_realloc(void *ptr, size_t size)

libavcodec/smacker.c:306:9: 
304.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);
306.         smk->full_tbl[0] = 0;
             ^
307.         smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
308.     } else {

libavcodec/smacker.c:307:9: 
305.         smk->full_tbl = av_malloc(sizeof(int) * 2);
306.         smk->full_tbl[0] = 0;
307.         smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
             ^
308.     } else {
309.         smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size);

libavcodec/smacker.c:311:9: 
309.         smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size);
310.     }
311.     if(!get_bits1(&gb)) {
             ^
312.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
313.         smk->type_tbl = av_malloc(sizeof(int) * 2);

libavcodec/get_bits.h:311:1: start of procedure get_bits1()
  309. }
  310. 
  311. static inline unsigned int get_bits1(GetBitContext *s){
       ^
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;

libavcodec/get_bits.h:313:5: 
  311. static inline unsigned int get_bits1(GetBitContext *s){
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
           ^
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE

libavcodec/get_bits.h:314:5: 
  312. #ifdef ALT_BITSTREAM_READER
  313.     unsigned int index = s->index;
  314.     uint8_t result = s->buffer[index>>3];
           ^
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;

libavcodec/get_bits.h:316:5: 
  314.     uint8_t result = s->buffer[index>>3];
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
           ^
  317.     result &= 1;
  318. #else

libavcodec/get_bits.h:317:5: 
  315. #ifdef ALT_BITSTREAM_READER_LE
  316.     result >>= index & 7;
  317.     result &= 1;
           ^
  318. #else
  319.     result <<= index & 7;

libavcodec/get_bits.h:322:5: 
  320.     result >>= 8 - 1;
  321. #endif
  322.     index++;
           ^
  323.     s->index = index;
  324. 

libavcodec/get_bits.h:323:5: 
  321. #endif
  322.     index++;
  323.     s->index = index;
           ^
  324. 
  325.     return result;

libavcodec/get_bits.h:325:5: 
  323.     s->index = index;
  324. 
  325.     return result;
           ^
  326. #else
  327.     return get_bits(s, 1);

libavcodec/get_bits.h:329:1: return from a call to get_bits1
  327.     return get_bits(s, 1);
  328. #endif
  329. }
       ^
  330. 
  331. static inline unsigned int show_bits1(GetBitContext *s){

libavcodec/smacker.c:311:9: Taking true branch
309.         smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size);
310.     }
311.     if(!get_bits1(&gb)) {
             ^
312.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
313.         smk->type_tbl = av_malloc(sizeof(int) * 2);

libavcodec/smacker.c:312:9: Skipping av_log(): empty list of specs
310.     }
311.     if(!get_bits1(&gb)) {
312.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
             ^
313.         smk->type_tbl = av_malloc(sizeof(int) * 2);
314.         smk->type_tbl[0] = 0;

libavcodec/smacker.c:313:9: 
311.     if(!get_bits1(&gb)) {
312.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
313.         smk->type_tbl = av_malloc(sizeof(int) * 2);
             ^
314.         smk->type_tbl[0] = 0;
315.         smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;

libavutil/mem.c:64:1: start of procedure av_malloc()
  62.    linker will do it automatically. */
  63. 
  64. void *av_malloc(size_t size)
      ^
  65. {
  66.     void *ptr = NULL;

libavutil/mem.c:66:5: 
  64. void *av_malloc(size_t size)
  65. {
  66.     void *ptr = NULL;
          ^
  67. #if CONFIG_MEMALIGN_HACK
  68.     long diff;

libavutil/mem.c:72:8: Taking false branch
  70. 
  71.     /* let's disallow possible ambiguous cases */
  72.     if(size > (INT_MAX-32) )
             ^
  73.         return NULL;
  74. 

libavutil/mem.c:83:9: Taking true branch
  81.     ((char*)ptr)[-1]= diff;
  82. #elif HAVE_POSIX_MEMALIGN
  83.     if (posix_memalign(&ptr,32,size))
              ^
  84.         ptr = NULL;
  85. #elif HAVE_MEMALIGN

libavutil/mem.c:84:9: 
  82. #elif HAVE_POSIX_MEMALIGN
  83.     if (posix_memalign(&ptr,32,size))
  84.         ptr = NULL;
              ^
  85. #elif HAVE_MEMALIGN
  86.     ptr = memalign(32,size);

libavutil/mem.c:114:5: 
  112.     ptr = malloc(size);
  113. #endif
  114.     return ptr;
           ^
  115. }
  116. 

libavutil/mem.c:115:1: return from a call to av_malloc
  113. #endif
  114.     return ptr;
  115. }
       ^
  116. 
  117. void *av_realloc(void *ptr, size_t size)

libavcodec/smacker.c:314:9: 
312.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
313.         smk->type_tbl = av_malloc(sizeof(int) * 2);
314.         smk->type_tbl[0] = 0;
             ^
315.         smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
316.     } else {
