Update openjpeg

core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/tgt.c

 /*
  * The copyright in this software is being made available under the 2-clauses 
  * BSD License, included below. This software may be subject to other third 
  * party and contributor rights, including patent rights, and no such rights
  * are granted under this license.
  *
  * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
  * Copyright (c) 2002-2014, Professor Benoit Macq
  * Copyright (c) 2001-2003, David Janssens
  * Copyright (c) 2002-2003, Yannick Verschueren
@@ skipping 39 matching lines @@
         OPJ_INT32 nplv[32];
         opj_tgt_node_t *node = 00;
         opj_tgt_node_t *l_parent_node = 00;
         opj_tgt_node_t *l_parent_node0 = 00;
         opj_tgt_tree_t *tree = 00;
         OPJ_UINT32 i;
         OPJ_INT32  j,k;
         OPJ_UINT32 numlvls;
         OPJ_UINT32 n;
 
-        tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));
+        tree = (opj_tgt_tree_t *) opj_calloc(1,sizeof(opj_tgt_tree_t));
         if(!tree) {
                 fprintf(stderr, "ERROR in tgt_create while allocating tree\n");
                 return 00;
         }
-        memset(tree,0,sizeof(opj_tgt_tree_t));
 
         tree->numleafsh = numleafsh;
         tree->numleafsv = numleafsv;
 
         numlvls = 0;
         nplh[0] = (OPJ_INT32)numleafsh;
         nplv[0] = (OPJ_INT32)numleafsv;
         tree->numnodes = 0;
         do {
                 n = (OPJ_UINT32)(nplh[numlvls] * nplv[numlvls]);
                 nplh[numlvls + 1] = (nplh[numlvls] + 1) / 2;
                 nplv[numlvls + 1] = (nplv[numlvls] + 1) / 2;
                 tree->numnodes += n;
                 ++numlvls;
         } while (n > 1);
 
         /* ADD */
         if (tree->numnodes == 0) {
                 opj_free(tree);
                 fprintf(stderr, "WARNING in tgt_create tree->numnodes == 0, no tree created.\n");
                 return 00;
         }
 
         tree->nodes = (opj_tgt_node_t*) opj_calloc(tree->numnodes, sizeof(opj_tgt_node_t));
         if(!tree->nodes) {
                 fprintf(stderr, "ERROR in tgt_create while allocating node of the tree\n");
                 opj_free(tree);
                 return 00;
         }
-        memset(tree->nodes,0,tree->numnodes * sizeof(opj_tgt_node_t));
         tree->nodes_size = tree->numnodes * (OPJ_UINT32)sizeof(opj_tgt_node_t);
 
         node = tree->nodes;
         l_parent_node = &tree->nodes[tree->numleafsh * tree->numleafsv];
         l_parent_node0 = l_parent_node;
 
         for (i = 0; i < numlvls - 1; ++i) {
                 for (j = 0; j < nplv[i]; ++j) {
                         k = nplh[i];
                         while (--k >= 0) {
@@ skipping 222 matching lines @@
                 }
                 node->low = low;
                 if (stkptr == stk) {
                         break;
                 }
                 node = *--stkptr;
         }
         
         return (node->value < threshold) ? 1 : 0;
 }