[trunk] Set of warnings fix for gcc -pedantic

[openjpeg.git] / src / lib / openjp3d / tgt.c

diff --git a/src/lib/openjp3d/tgt.c b/src/lib/openjp3d/tgt.c
index 1772afacbd5973b90eee59aeea9b1ec90e1565f6..77a751a602baccebc4011eb06036c59819ba4802 100755 (executable)
--- a/src/lib/openjp3d/tgt.c
+++ b/src/lib/openjp3d/tgt.c
@@ -112,33 +112,33 @@ opj_tgt_tree_t *tgt_create(int numleafsh, int numleafsv, int numleafsz) {
        p = tree->numleafsh * tree->numleafsv * tree->numleafsz;\r
        p0 = p;\r
        n = 0;\r
-       //fprintf(stdout,"\nH %d V %d Z %d numlvls %d nodes %d\n",tree->numleafsh,tree->numleafsv,tree->numleafsz,numlvls,tree->numnodes);\r
+       /*fprintf(stdout,"\nH %d V %d Z %d numlvls %d nodes %d\n",tree->numleafsh,tree->numleafsv,tree->numleafsz,numlvls,tree->numnodes);*/\r
        for (i = 0; i < numlvls - 1; ++i) {\r
                for (j = 0; j < nplv[i]; ++j) {\r
                        k = nplh[i]*nplz[i];\r
                        while (--k >= 0) {\r
-                               node->parent = parentnode;              //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
+                               node->parent = parentnode;              /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
                                ++node; ++n;            \r
                                if (--k >= 0 && n < p) {\r
-                                       node->parent = parentnode;      //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
+                                       node->parent = parentnode;      /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
                                        ++node; ++n;    \r
                                }\r
-                               if (nplz[i] != 1){ //2D operation vs 3D operation\r
+                               if (nplz[i] != 1){ /*2D operation vs 3D operation*/\r
                                        if (--k >= 0 && n < p) {\r
-                                               node->parent = parentnode;      //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
+                                               node->parent = parentnode;      /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
                                                ++node; ++n;\r
                                        }\r
                                        if (--k >= 0 && n < p) {\r
-                                               node->parent = parentnode;      //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
+                                               node->parent = parentnode;      /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
                                                ++node; ++n;\r
                                        }\r
                                }\r
                                ++parentnode; ++p;\r
                        }\r
                        if ((j & 1) || j == nplv[i] - 1) {\r
-                               parentnode0 = parentnode;                       p0 = p;         //fprintf(stdout,"parent = node[%d] \n",p);\r
+                               parentnode0 = parentnode;                       p0 = p;         /*fprintf(stdout,"parent = node[%d] \n",p);*/\r
                        } else {\r
-                               parentnode = parentnode0;                       p = p0;         //fprintf(stdout,"parent = node[%d] \n",p);\r
+                               parentnode = parentnode0;                       p = p0;         /*fprintf(stdout,"parent = node[%d] \n",p);*/\r
                                parentnode0 += nplh[i]*nplz[i];         p0 += nplh[i]*nplz[i];\r
                        }\r
                }\r