-/*
- * Copyright (c) 2001-2002, David Janssens
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "tgt.h"
-#include "bio.h"
-#include <stdlib.h>
-#include <stdio.h>
-
-/* <summary> */
-/* Reset tag-tree. */
-/* </summary> */
-void tgt_reset(tgt_tree_t * tree)
-{
- int i;
- /* new */
- if (!tree || tree == NULL)
- return;
-
- for (i = 0; i < tree->numnodes; i++) {
- tree->nodes[i].value = 999;
- tree->nodes[i].low = 0;
- tree->nodes[i].known = 0;
- }
-}
-
-/* <summary> */
-/* Create tag-tree. */
-/* </summary> */
-tgt_tree_t *tgt_create(int numleafsh, int numleafsv)
-{
- int nplh[32];
- int nplv[32];
- tgt_node_t *node;
- tgt_node_t *parentnode;
- tgt_node_t *parentnode0;
- tgt_tree_t *tree;
- int i, j, k;
- int numlvls;
- int n;
-
- tree = (tgt_tree_t *) malloc(sizeof(tgt_tree_t));
- tree->numleafsh = numleafsh;
- tree->numleafsv = numleafsv;
-
- numlvls = 0;
- nplh[0] = numleafsh;
- nplv[0] = numleafsv;
- tree->numnodes = 0;
- do {
- n = 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) {
- free(tree);
- return NULL;
- }
-
- tree->nodes = (tgt_node_t *) malloc(tree->numnodes * sizeof(tgt_node_t));
-
- node = tree->nodes;
- parentnode = &tree->nodes[tree->numleafsh * tree->numleafsv];
- parentnode0 = parentnode;
-
- for (i = 0; i < numlvls - 1; ++i) {
- for (j = 0; j < nplv[i]; ++j) {
- k = nplh[i];
- while (--k >= 0) {
- node->parent = parentnode;
- ++node;
- if (--k >= 0) {
- node->parent = parentnode;
- ++node;
- }
- ++parentnode;
- }
- if ((j & 1) || j == nplv[i] - 1) {
- parentnode0 = parentnode;
- } else {
- parentnode = parentnode0;
- parentnode0 += nplh[i];
- }
- }
- }
- node->parent = 0;
-
- tgt_reset(tree);
-
- return tree;
-}
-
-/* <summary> */
-/* Destroy tag-tree. */
-/* </summary> */
-void tgt_destroy(tgt_tree_t * t)
-{
- free(t->nodes);
- free(t);
-}
-
-/* <summary> */
-/* Set the value of a leaf of the tag-tree. */
-/* </summary> */
-void tgt_setvalue(tgt_tree_t * tree, int leafno, int value)
-{
- tgt_node_t *node;
- node = &tree->nodes[leafno];
- while (node && node->value > value) {
- node->value = value;
- node = node->parent;
- }
-}
-
-/* <summary> */
-/* Encode the value of a leaf of the tag-tree. */
-/* </summary> */
-void tgt_encode(tgt_tree_t * tree, int leafno, int threshold)
-{
- tgt_node_t *stk[31];
- tgt_node_t **stkptr;
- tgt_node_t *node;
- int low;
-
- stkptr = stk;
- node = &tree->nodes[leafno];
- while (node->parent) {
- *stkptr++ = node;
- node = node->parent;
- }
-
- low = 0;
- for (;;) {
- if (low > node->low) {
- node->low = low;
- } else {
- low = node->low;
- }
-
- while (low < threshold) {
- if (low >= node->value) {
- if (!node->known) {
- bio_write(1, 1);
- node->known = 1;
- }
- break;
- }
- bio_write(0, 1);
- ++low;
- }
-
- node->low = low;
- if (stkptr == stk)
- break;
- node = *--stkptr;
- }
-
-}
-
-/* <summary> */
-/* Decode the value of a leaf of the tag-tree. */
-/* </summary> */
-int tgt_decode(tgt_tree_t * tree, int leafno, int threshold)
-{
- tgt_node_t *stk[31];
- tgt_node_t **stkptr;
- tgt_node_t *node;
- int low;
-
- stkptr = stk;
- node = &tree->nodes[leafno];
- while (node->parent) {
- *stkptr++ = node;
- node = node->parent;
- }
-
- low = 0;
- for (;;) {
- if (low > node->low) {
- node->low = low;
- } else {
- low = node->low;
- }
- while (low < threshold && low < node->value) {
- if (bio_read(1)) {
- node->value = low;
- } else {
- ++low;
- }
- }
- node->low = low;
- if (stkptr == stk) {
- break;
- }
- node = *--stkptr;
- }
-
- return (node->value < threshold) ? 1 : 0;
-}
+/*\r
+ * Copyright (c) 2001-2003, David Janssens\r
+ * Copyright (c) 2002-2003, Yannick Verschueren\r
+ * Copyright (c) 2003-2005, Francois Devaux and Antonin Descampe\r
+ * Copyright (c) 2005, Hervé Drolon, FreeImage Team\r
+ * Copyright (c) 2002-2005, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'\r
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\r
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r
+ * POSSIBILITY OF SUCH DAMAGE.\r
+ */\r
+\r
+#include "opj_includes.h"\r
+\r
+/* \r
+==========================================================\r
+ Tag-tree coder interface\r
+==========================================================\r
+*/\r
+\r
+opj_tgt_tree_t *tgt_create(int numleafsh, int numleafsv) {\r
+ int nplh[32];\r
+ int nplv[32];\r
+ opj_tgt_node_t *node = NULL;\r
+ opj_tgt_node_t *parentnode = NULL;\r
+ opj_tgt_node_t *parentnode0 = NULL;\r
+ opj_tgt_tree_t *tree = NULL;\r
+ int i, j, k;\r
+ int numlvls;\r
+ int n;\r
+\r
+ tree = (opj_tgt_tree_t *) opj_malloc(sizeof(opj_tgt_tree_t));\r
+ if(!tree) return NULL;\r
+ tree->numleafsh = numleafsh;\r
+ tree->numleafsv = numleafsv;\r
+\r
+ numlvls = 0;\r
+ nplh[0] = numleafsh;\r
+ nplv[0] = numleafsv;\r
+ tree->numnodes = 0;\r
+ do {\r
+ n = nplh[numlvls] * nplv[numlvls];\r
+ nplh[numlvls + 1] = (nplh[numlvls] + 1) / 2;\r
+ nplv[numlvls + 1] = (nplv[numlvls] + 1) / 2;\r
+ tree->numnodes += n;\r
+ ++numlvls;\r
+ } while (n > 1);\r
+ \r
+ /* ADD */\r
+ if (tree->numnodes == 0) {\r
+ opj_free(tree);\r
+ return NULL;\r
+ }\r
+\r
+ tree->nodes = (opj_tgt_node_t *) opj_malloc(tree->numnodes * sizeof(opj_tgt_node_t));\r
+ if(!tree->nodes) {\r
+ opj_free(tree);\r
+ return NULL;\r
+ }\r
+\r
+ node = tree->nodes;\r
+ parentnode = &tree->nodes[tree->numleafsh * tree->numleafsv];\r
+ parentnode0 = parentnode;\r
+ \r
+ for (i = 0; i < numlvls - 1; ++i) {\r
+ for (j = 0; j < nplv[i]; ++j) {\r
+ k = nplh[i];\r
+ while (--k >= 0) {\r
+ node->parent = parentnode;\r
+ ++node;\r
+ if (--k >= 0) {\r
+ node->parent = parentnode;\r
+ ++node;\r
+ }\r
+ ++parentnode;\r
+ }\r
+ if ((j & 1) || j == nplv[i] - 1) {\r
+ parentnode0 = parentnode;\r
+ } else {\r
+ parentnode = parentnode0;\r
+ parentnode0 += nplh[i];\r
+ }\r
+ }\r
+ }\r
+ node->parent = 0;\r
+ \r
+ tgt_reset(tree);\r
+ \r
+ return tree;\r
+}\r
+\r
+void tgt_destroy(opj_tgt_tree_t *tree) {\r
+ opj_free(tree->nodes);\r
+ opj_free(tree);\r
+}\r
+\r
+void tgt_reset(opj_tgt_tree_t *tree) {\r
+ int i;\r
+\r
+ if (NULL == tree)\r
+ return;\r
+ \r
+ for (i = 0; i < tree->numnodes; i++) {\r
+ tree->nodes[i].value = 999;\r
+ tree->nodes[i].low = 0;\r
+ tree->nodes[i].known = 0;\r
+ }\r
+}\r
+\r
+void tgt_setvalue(opj_tgt_tree_t *tree, int leafno, int value) {\r
+ opj_tgt_node_t *node;\r
+ node = &tree->nodes[leafno];\r
+ while (node && node->value > value) {\r
+ node->value = value;\r
+ node = node->parent;\r
+ }\r
+}\r
+\r
+void tgt_encode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {\r
+ opj_tgt_node_t *stk[31];\r
+ opj_tgt_node_t **stkptr;\r
+ opj_tgt_node_t *node;\r
+ int low;\r
+\r
+ stkptr = stk;\r
+ node = &tree->nodes[leafno];\r
+ while (node->parent) {\r
+ *stkptr++ = node;\r
+ node = node->parent;\r
+ }\r
+ \r
+ low = 0;\r
+ for (;;) {\r
+ if (low > node->low) {\r
+ node->low = low;\r
+ } else {\r
+ low = node->low;\r
+ }\r
+ \r
+ while (low < threshold) {\r
+ if (low >= node->value) {\r
+ if (!node->known) {\r
+ bio_write(bio, 1, 1);\r
+ node->known = 1;\r
+ }\r
+ break;\r
+ }\r
+ bio_write(bio, 0, 1);\r
+ ++low;\r
+ }\r
+ \r
+ node->low = low;\r
+ if (stkptr == stk)\r
+ break;\r
+ node = *--stkptr;\r
+ }\r
+}\r
+\r
+int tgt_decode(opj_bio_t *bio, opj_tgt_tree_t *tree, int leafno, int threshold) {\r
+ opj_tgt_node_t *stk[31];\r
+ opj_tgt_node_t **stkptr;\r
+ opj_tgt_node_t *node;\r
+ int low;\r
+\r
+ stkptr = stk;\r
+ node = &tree->nodes[leafno];\r
+ while (node->parent) {\r
+ *stkptr++ = node;\r
+ node = node->parent;\r
+ }\r
+ \r
+ low = 0;\r
+ for (;;) {\r
+ if (low > node->low) {\r
+ node->low = low;\r
+ } else {\r
+ low = node->low;\r
+ }\r
+ while (low < threshold && low < node->value) {\r
+ if (bio_read(bio, 1)) {\r
+ node->value = low;\r
+ } else {\r
+ ++low;\r
+ }\r
+ }\r
+ node->low = low;\r
+ if (stkptr == stk) {\r
+ break;\r
+ }\r
+ node = *--stkptr;\r
+ }\r
+ \r
+ return (node->value < threshold) ? 1 : 0;\r
+}\r
git://git.creatis.insa-lyon.fr / gdcm.git / blobdiff