2 * Copyright (c) 2001-2003, David Janssens
\r
3 * Copyright (c) 2002-2003, Yannick Verschueren
\r
4 * Copyright (c) 2003-2005, Francois Devaux and Antonin Descampe
\r
5 * Copyright (c) 2005, Herv� Drolon, FreeImage Team
\r
6 * Copyright (c) 2002-2005, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
\r
7 * All rights reserved.
\r
9 * Redistribution and use in source and binary forms, with or without
\r
10 * modification, are permitted provided that the following conditions
\r
12 * 1. Redistributions of source code must retain the above copyright
\r
13 * notice, this list of conditions and the following disclaimer.
\r
14 * 2. Redistributions in binary form must reproduce the above copyright
\r
15 * notice, this list of conditions and the following disclaimer in the
\r
16 * documentation and/or other materials provided with the distribution.
\r
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
\r
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
\r
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
\r
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
\r
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
\r
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
\r
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
\r
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
\r
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
\r
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
\r
28 * POSSIBILITY OF SUCH DAMAGE.
\r
31 #include "opj_includes.h"
\r
34 ==========================================================
\r
35 Tag-tree coder interface
\r
36 ==========================================================
\r
38 void tgt_tree_dump (FILE *fd, opj_tgt_tree_t * tree){
\r
41 fprintf(fd, "TGT_TREE {\n");
\r
42 fprintf(fd, " numnodes: %d \n", tree->numnodes);
\r
43 fprintf(fd, " numleafsh: %d, numleafsv: %d, numleafsz: %d,\n", tree->numleafsh, tree->numleafsv, tree->numleafsz);
\r
45 for (nodesno = 0; nodesno < tree->numnodes; nodesno++) {
\r
46 fprintf(fd, "tgt_node %d {\n", nodesno);
\r
47 fprintf(fd, " value: %d \n", tree->nodes[nodesno].value);
\r
48 fprintf(fd, " low: %d \n", tree->nodes[nodesno].low);
\r
49 fprintf(fd, " known: %d \n", tree->nodes[nodesno].known);
\r
50 if (tree->nodes[nodesno].parent) {
\r
51 fprintf(fd, " parent.value: %d \n", tree->nodes[nodesno].parent->value);
\r
52 fprintf(fd, " parent.low: %d \n", tree->nodes[nodesno].parent->low);
\r
53 fprintf(fd, " parent.known: %d \n", tree->nodes[nodesno].parent->known);
\r
63 opj_tgt_tree_t *tgt_create(int numleafsh, int numleafsv, int numleafsz) {
\r
68 opj_tgt_node_t *node = NULL;
\r
69 opj_tgt_node_t *parentnode = NULL;
\r
70 opj_tgt_node_t *parentnode0 = NULL;
\r
71 opj_tgt_tree_t *tree = NULL;
\r
76 tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));
\r
79 tree->numleafsh = numleafsh;
\r
80 tree->numleafsv = numleafsv;
\r
81 tree->numleafsz = numleafsz;
\r
84 nplh[0] = numleafsh;
\r
85 nplv[0] = numleafsv;
\r
86 nplz[0] = numleafsz;
\r
89 n = nplh[numlvls] * nplv[numlvls] * nplz[numlvls];
\r
90 nplh[numlvls + 1] = (nplh[numlvls] + 1) / 2;
\r
91 nplv[numlvls + 1] = (nplv[numlvls] + 1) / 2;
\r
92 nplz[numlvls + 1] = (nplz[numlvls] + 1) / 2;
\r
93 tree->numnodes += n;
\r
97 if (tree->numnodes == 0) {
\r
102 tree->nodes = (opj_tgt_node_t *) opj_malloc(tree->numnodes * sizeof(opj_tgt_node_t));
\r
108 node = tree->nodes;
\r
109 parentnode = &tree->nodes[tree->numleafsh * tree->numleafsv * tree->numleafsz];
\r
110 parentnode0 = parentnode;
\r
112 p = tree->numleafsh * tree->numleafsv * tree->numleafsz;
\r
115 //fprintf(stdout,"\nH %d V %d Z %d numlvls %d nodes %d\n",tree->numleafsh,tree->numleafsv,tree->numleafsz,numlvls,tree->numnodes);
\r
116 for (i = 0; i < numlvls - 1; ++i) {
\r
117 for (j = 0; j < nplv[i]; ++j) {
\r
118 k = nplh[i]*nplz[i];
\r
120 node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);
\r
122 if (--k >= 0 && n < p) {
\r
123 node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);
\r
126 if (nplz[i] != 1){ //2D operation vs 3D operation
\r
127 if (--k >= 0 && n < p) {
\r
128 node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);
\r
131 if (--k >= 0 && n < p) {
\r
132 node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);
\r
138 if ((j & 1) || j == nplv[i] - 1) {
\r
139 parentnode0 = parentnode; p0 = p; //fprintf(stdout,"parent = node[%d] \n",p);
\r
141 parentnode = parentnode0; p = p0; //fprintf(stdout,"parent = node[%d] \n",p);
\r
142 parentnode0 += nplh[i]*nplz[i]; p0 += nplh[i]*nplz[i];
\r
154 void tgt_destroy(opj_tgt_tree_t *tree) {
\r
155 opj_free(tree->nodes);
\r
159 void tgt_reset(opj_tgt_tree_t *tree) {
\r
165 for (i = 0; i < tree->numnodes; i++) {
\r
166 tree->nodes[i].value = 999;
\r
167 tree->nodes[i].low = 0;
\r
168 tree->nodes[i].known = 0;
\r
172 void tgt_setvalue(opj_tgt_tree_t *tree, int leafno, int value) {
\r
173 opj_tgt_node_t *node;
\r
174 node = &tree->nodes[leafno];
\r
175 while (node && node->value > value) {
\r
176 node->value = value;
\r
177 node = node->parent;
\r
181 void tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {
\r
182 opj_tgt_node_t *stk[31];
\r
183 opj_tgt_node_t **stkptr;
\r
184 opj_tgt_node_t *node;
\r
188 node = &tree->nodes[leafno];
\r
189 while (node->parent) {
\r
191 node = node->parent;
\r
196 if (low > node->low) {
\r
202 while (low < threshold) {
\r
203 if (low >= node->value) {
\r
204 if (!node->known) {
\r
205 bio_write(bio, 1, 1);
\r
210 bio_write(bio, 0, 1);
\r
221 int tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {
\r
222 opj_tgt_node_t *stk[31];
\r
223 opj_tgt_node_t **stkptr;
\r
224 opj_tgt_node_t *node;
\r
228 node = &tree->nodes[leafno];
\r
229 while (node->parent) {
\r
231 node = node->parent;
\r
236 if (low > node->low) {
\r
241 while (low < threshold && low < node->value) {
\r
242 if (bio_read(bio, 1)) {
\r
249 if (stkptr == stk) {
\r
255 return (node->value < threshold) ? 1 : 0;
\r