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
39 opj_tgt_tree_t *tgt_create(int numleafsh, int numleafsv) {
\r
42 opj_tgt_node_t *node = NULL;
\r
43 opj_tgt_node_t *parentnode = NULL;
\r
44 opj_tgt_node_t *parentnode0 = NULL;
\r
45 opj_tgt_tree_t *tree = NULL;
\r
50 tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));
\r
51 if(!tree) return NULL;
\r
52 tree->numleafsh = numleafsh;
\r
53 tree->numleafsv = numleafsv;
\r
56 nplh[0] = numleafsh;
\r
57 nplv[0] = numleafsv;
\r
60 n = nplh[numlvls] * nplv[numlvls];
\r
61 nplh[numlvls + 1] = (nplh[numlvls] + 1) / 2;
\r
62 nplv[numlvls + 1] = (nplv[numlvls] + 1) / 2;
\r
63 tree->numnodes += n;
\r
68 if (tree->numnodes == 0) {
\r
73 tree->nodes = (opj_tgt_node_t *) opj_malloc(tree->numnodes * sizeof(opj_tgt_node_t));
\r
80 parentnode = &tree->nodes[tree->numleafsh * tree->numleafsv];
\r
81 parentnode0 = parentnode;
\r
83 for (i = 0; i < numlvls - 1; ++i) {
\r
84 for (j = 0; j < nplv[i]; ++j) {
\r
87 node->parent = parentnode;
\r
90 node->parent = parentnode;
\r
95 if ((j & 1) || j == nplv[i] - 1) {
\r
96 parentnode0 = parentnode;
\r
98 parentnode = parentnode0;
\r
99 parentnode0 += nplh[i];
\r
110 void tgt_destroy(opj_tgt_tree_t *tree) {
\r
111 opj_free(tree->nodes);
\r
115 void tgt_reset(opj_tgt_tree_t *tree) {
\r
121 for (i = 0; i < tree->numnodes; i++) {
\r
122 tree->nodes[i].value = 999;
\r
123 tree->nodes[i].low = 0;
\r
124 tree->nodes[i].known = 0;
\r
128 void tgt_setvalue(opj_tgt_tree_t *tree, int leafno, int value) {
\r
129 opj_tgt_node_t *node;
\r
130 node = &tree->nodes[leafno];
\r
131 while (node && node->value > value) {
\r
132 node->value = value;
\r
133 node = node->parent;
\r
137 void tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {
\r
138 opj_tgt_node_t *stk[31];
\r
139 opj_tgt_node_t **stkptr;
\r
140 opj_tgt_node_t *node;
\r
144 node = &tree->nodes[leafno];
\r
145 while (node->parent) {
\r
147 node = node->parent;
\r
152 if (low > node->low) {
\r
158 while (low < threshold) {
\r
159 if (low >= node->value) {
\r
160 if (!node->known) {
\r
161 bio_write(bio, 1, 1);
\r
166 bio_write(bio, 0, 1);
\r
177 int tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {
\r
178 opj_tgt_node_t *stk[31];
\r
179 opj_tgt_node_t **stkptr;
\r
180 opj_tgt_node_t *node;
\r
184 node = &tree->nodes[leafno];
\r
185 while (node->parent) {
\r
187 node = node->parent;
\r
192 if (low > node->low) {
\r
197 while (low < threshold && low < node->value) {
\r
198 if (bio_read(bio, 1)) {
\r
205 if (stkptr == stk) {
\r
211 return (node->value < threshold) ? 1 : 0;
\r