2 * The copyright in this software is being made available under the 2-clauses
3 * BSD License, included below. This software may be subject to other third
4 * party and contributor rights, including patent rights, and no such rights
5 * are granted under this license.
7 * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
8 * Copyright (c) 2002-2014, Professor Benoit Macq
9 * Copyright (c) 2001-2003, David Janssens
10 * Copyright (c) 2002-2003, Yannick Verschueren
11 * Copyright (c) 2003-2007, Francois-Olivier Devaux
12 * Copyright (c) 2003-2014, Antonin Descampe
13 * Copyright (c) 2005, Herve Drolon, FreeImage Team
14 * All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
38 #include "opj_includes.h"
41 ==========================================================
42 Tag-tree coder interface
43 ==========================================================
46 opj_tgt_tree_t *tgt_create(int numleafsh, int numleafsv)
50 opj_tgt_node_t *node = NULL;
51 opj_tgt_node_t *parentnode = NULL;
52 opj_tgt_node_t *parentnode0 = NULL;
53 opj_tgt_tree_t *tree = NULL;
58 tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));
62 tree->numleafsh = numleafsh;
63 tree->numleafsv = numleafsv;
70 n = nplh[numlvls] * nplv[numlvls];
71 nplh[numlvls + 1] = (nplh[numlvls] + 1) / 2;
72 nplv[numlvls + 1] = (nplv[numlvls] + 1) / 2;
78 if (tree->numnodes == 0) {
83 tree->nodes = (opj_tgt_node_t*) opj_calloc(tree->numnodes,
84 sizeof(opj_tgt_node_t));
91 parentnode = &tree->nodes[tree->numleafsh * tree->numleafsv];
92 parentnode0 = parentnode;
94 for (i = 0; i < numlvls - 1; ++i) {
95 for (j = 0; j < nplv[i]; ++j) {
98 node->parent = parentnode;
101 node->parent = parentnode;
106 if ((j & 1) || j == nplv[i] - 1) {
107 parentnode0 = parentnode;
109 parentnode = parentnode0;
110 parentnode0 += nplh[i];
121 void tgt_destroy(opj_tgt_tree_t *tree)
123 opj_free(tree->nodes);
127 void tgt_reset(opj_tgt_tree_t *tree)
135 for (i = 0; i < tree->numnodes; i++) {
136 tree->nodes[i].value = 999;
137 tree->nodes[i].low = 0;
138 tree->nodes[i].known = 0;
142 void tgt_setvalue(opj_tgt_tree_t *tree, int leafno, int value)
144 opj_tgt_node_t *node;
145 node = &tree->nodes[leafno];
146 while (node && node->value > value) {
152 void tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno,
155 opj_tgt_node_t *stk[31];
156 opj_tgt_node_t **stkptr;
157 opj_tgt_node_t *node;
161 node = &tree->nodes[leafno];
162 while (node->parent) {
169 if (low > node->low) {
175 while (low < threshold) {
176 if (low >= node->value) {
178 bio_write(bio, 1, 1);
183 bio_write(bio, 0, 1);
195 int tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold)
197 opj_tgt_node_t *stk[31];
198 opj_tgt_node_t **stkptr;
199 opj_tgt_node_t *node;
203 node = &tree->nodes[leafno];
204 while (node->parent) {
211 if (low > node->low) {
216 while (low < threshold && low < node->value) {
217 if (bio_read(bio, 1)) {
230 return (node->value < threshold) ? 1 : 0;