2 * Copyright (c) 1999-2000 Image Power, Inc. and the University of
4 * Copyright (c) 2001-2003 Michael David Adams.
8 /* __START_OF_JASPER_LICENSE__
10 * JasPer License Version 2.0
12 * Copyright (c) 1999-2000 Image Power, Inc.
13 * Copyright (c) 1999-2000 The University of British Columbia
14 * Copyright (c) 2001-2003 Michael David Adams
16 * All rights reserved.
18 * Permission is hereby granted, free of charge, to any person (the
19 * "User") obtaining a copy of this software and associated documentation
20 * files (the "Software"), to deal in the Software without restriction,
21 * including without limitation the rights to use, copy, modify, merge,
22 * publish, distribute, and/or sell copies of the Software, and to permit
23 * persons to whom the Software is furnished to do so, subject to the
24 * following conditions:
26 * 1. The above copyright notices and this permission notice (which
27 * includes the disclaimer below) shall be included in all copies or
28 * substantial portions of the Software.
30 * 2. The name of a copyright holder shall not be used to endorse or
31 * promote products derived from the Software without specific prior
34 * THIS DISCLAIMER OF WARRANTY CONSTITUTES AN ESSENTIAL PART OF THIS
35 * LICENSE. NO USE OF THE SOFTWARE IS AUTHORIZED HEREUNDER EXCEPT UNDER
36 * THIS DISCLAIMER. THE SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS
37 * "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
38 * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
39 * PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN NO
40 * EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL
41 * INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING
42 * FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
43 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
44 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. NO ASSURANCES ARE
45 * PROVIDED BY THE COPYRIGHT HOLDERS THAT THE SOFTWARE DOES NOT INFRINGE
46 * THE PATENT OR OTHER INTELLECTUAL PROPERTY RIGHTS OF ANY OTHER ENTITY.
47 * EACH COPYRIGHT HOLDER DISCLAIMS ANY LIABILITY TO THE USER FOR CLAIMS
48 * BROUGHT BY ANY OTHER ENTITY BASED ON INFRINGEMENT OF INTELLECTUAL
49 * PROPERTY RIGHTS OR OTHERWISE. AS A CONDITION TO EXERCISING THE RIGHTS
50 * GRANTED HEREUNDER, EACH USER HEREBY ASSUMES SOLE RESPONSIBILITY TO SECURE
51 * ANY OTHER INTELLECTUAL PROPERTY RIGHTS NEEDED, IF ANY. THE SOFTWARE
52 * IS NOT FAULT-TOLERANT AND IS NOT INTENDED FOR USE IN MISSION-CRITICAL
53 * SYSTEMS, SUCH AS THOSE USED IN THE OPERATION OF NUCLEAR FACILITIES,
54 * AIRCRAFT NAVIGATION OR COMMUNICATION SYSTEMS, AIR TRAFFIC CONTROL
55 * SYSTEMS, DIRECT LIFE SUPPORT MACHINES, OR WEAPONS SYSTEMS, IN WHICH
56 * THE FAILURE OF THE SOFTWARE OR SYSTEM COULD LEAD DIRECTLY TO DEATH,
57 * PERSONAL INJURY, OR SEVERE PHYSICAL OR ENVIRONMENTAL DAMAGE ("HIGH
58 * RISK ACTIVITIES"). THE COPYRIGHT HOLDERS SPECIFICALLY DISCLAIM ANY
59 * EXPRESS OR IMPLIED WARRANTY OF FITNESS FOR HIGH RISK ACTIVITIES.
61 * __END_OF_JASPER_LICENSE__
67 * $Id: jpc_t2enc.c,v 1.1 2005/05/22 18:33:05 malaterre Exp $
70 /******************************************************************************\
72 \******************************************************************************/
78 #include "jasper/jas_fix.h"
79 #include "jasper/jas_malloc.h"
80 #include "jasper/jas_math.h"
81 #include "jasper/jas_debug.h"
84 #include "jpc_t2enc.h"
85 #include "jpc_t2cod.h"
86 #include "jpc_tagtree.h"
90 /******************************************************************************\
92 \******************************************************************************/
94 static int jpc_putcommacode(jpc_bitstream_t *out, int n)
99 if (jpc_bitstream_putbit(out, 1) == EOF) {
103 if (jpc_bitstream_putbit(out, 0) == EOF) {
109 static int jpc_putnumnewpasses(jpc_bitstream_t *out, int n)
116 ret = jpc_bitstream_putbit(out, 0);
118 ret = jpc_bitstream_putbits(out, 2, 2);
120 ret = jpc_bitstream_putbits(out, 4, 0xc | (n - 3));
121 } else if (n <= 36) {
122 ret = jpc_bitstream_putbits(out, 9, 0x1e0 | (n - 6));
123 } else if (n <= 164) {
124 ret = jpc_bitstream_putbits(out, 16, 0xff80 | (n - 37));
126 /* The standard has no provision for encoding a larger value.
127 In practice, however, it is highly unlikely that this
128 limitation will ever be encountered. */
132 return (ret != EOF) ? 0 : (-1);
135 int jpc_enc_encpkts(jpc_enc_t *enc, jas_stream_t *out)
137 jpc_enc_tile_t *tile;
142 jpc_init_t2state(enc, 0);
146 if (!jpc_pi_next(pi)) {
148 if (jpc_enc_encpkt(enc, out, jpc_pi_cmptno(pi), jpc_pi_rlvlno(pi),
149 jpc_pi_prcno(pi), jpc_pi_lyrno(pi))) {
152 if (jpc_pi_next(pi)) {
161 int jpc_enc_encpkt(jpc_enc_t *enc, jas_stream_t *out, int compno, int lvlno, int prcno, int lyrno)
163 jpc_enc_tcmpt_t *comp;
165 jpc_enc_band_t *band;
166 jpc_enc_band_t *endbands;
167 jpc_enc_cblk_t *cblk;
168 jpc_enc_cblk_t *endcblks;
169 jpc_bitstream_t *outb;
170 jpc_enc_pass_t *pass;
171 jpc_enc_pass_t *startpass;
172 jpc_enc_pass_t *lastpass;
173 jpc_enc_pass_t *endpass;
174 jpc_enc_pass_t *endpasses;
178 jpc_tagtreenode_t *leaf;
187 jpc_enc_tile_t *tile;
195 if (cp->tcp.csty & JPC_COD_SOP) {
196 if (!(ms = jpc_ms_create(JPC_MS_SOP))) {
199 ms->parms.sop.seqno = jpc_pi_getind(tile->pi);
200 if (jpc_putms(out, enc->cstate, ms)) {
206 outb = jpc_bitstream_sopen(out, "w+");
209 if (jpc_bitstream_putbit(outb, 1) == EOF) {
212 JAS_DBGLOG(10, ("\n"));
213 JAS_DBGLOG(10, ("present. "));
215 comp = &tile->tcmpts[compno];
216 lvl = &comp->rlvls[lvlno];
217 endbands = &lvl->bands[lvl->numbands];
218 for (band = lvl->bands; band != endbands; ++band) {
222 prc = &band->prcs[prcno];
227 endcblks = &prc->cblks[prc->numcblks];
228 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
230 leaf = jpc_tagtree_getleaf(prc->nlibtree, cblk - prc->cblks);
231 jpc_tagtree_setvalue(prc->nlibtree, leaf, cblk->numimsbs);
233 pass = cblk->curpass;
234 included = (pass && pass->lyrno == lyrno);
235 if (included && (!cblk->numencpasses)) {
236 assert(pass->lyrno == lyrno);
237 leaf = jpc_tagtree_getleaf(prc->incltree,
239 jpc_tagtree_setvalue(prc->incltree, leaf, pass->lyrno);
243 endcblks = &prc->cblks[prc->numcblks];
244 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
245 pass = cblk->curpass;
246 included = (pass && pass->lyrno == lyrno);
247 if (!cblk->numencpasses) {
248 leaf = jpc_tagtree_getleaf(prc->incltree,
250 if (jpc_tagtree_encode(prc->incltree, leaf, lyrno
255 if (jpc_bitstream_putbit(outb, included) == EOF) {
259 JAS_DBGLOG(10, ("included=%d ", included));
263 if (!cblk->numencpasses) {
265 leaf = jpc_tagtree_getleaf(prc->nlibtree, cblk - prc->cblks);
267 if ((ret = jpc_tagtree_encode(prc->nlibtree, leaf, i, outb)) < 0) {
275 assert(leaf->known_ && i == leaf->value_ + 1);
278 endpasses = &cblk->passes[cblk->numpasses];
281 while (endpass != endpasses && endpass->lyrno == lyrno){
284 numnewpasses = endpass - startpass;
285 if (jpc_putnumnewpasses(outb, numnewpasses)) {
288 JAS_DBGLOG(10, ("numnewpasses=%d ", numnewpasses));
290 lastpass = endpass - 1;
291 n = startpass->start;
294 for (pass = startpass; pass != endpass; ++pass) {
295 if (pass->term || pass == lastpass) {
296 datalen = pass->end - n;
297 t1 = jpc_firstone(datalen) + 1;
298 t2 = cblk->numlenbits + jpc_floorlog2(passcount);
299 adjust = JAS_MAX(t1 - t2, 0);
300 maxadjust = JAS_MAX(adjust, maxadjust);
307 if (jpc_putcommacode(outb, maxadjust)) {
310 cblk->numlenbits += maxadjust;
312 lastpass = endpass - 1;
313 n = startpass->start;
315 for (pass = startpass; pass != endpass; ++pass) {
316 if (pass->term || pass == lastpass) {
317 datalen = pass->end - n;
318 assert(jpc_firstone(datalen) < cblk->numlenbits + jpc_floorlog2(passcount));
319 if (jpc_bitstream_putbits(outb, cblk->numlenbits + jpc_floorlog2(passcount), datalen) == EOF) {
331 jpc_bitstream_outalign(outb, 0);
332 jpc_bitstream_close(outb);
334 if (cp->tcp.csty & JPC_COD_EPH) {
335 if (!(ms = jpc_ms_create(JPC_MS_EPH))) {
338 jpc_putms(out, enc->cstate, ms);
342 comp = &tile->tcmpts[compno];
343 lvl = &comp->rlvls[lvlno];
344 endbands = &lvl->bands[lvl->numbands];
345 for (band = lvl->bands; band != endbands; ++band) {
349 prc = &band->prcs[prcno];
353 endcblks = &prc->cblks[prc->numcblks];
354 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
355 pass = cblk->curpass;
360 if (pass->lyrno != lyrno) {
361 assert(pass->lyrno < 0 || pass->lyrno > lyrno);
365 endpasses = &cblk->passes[cblk->numpasses];
368 while (endpass != endpasses && endpass->lyrno == lyrno){
371 lastpass = endpass - 1;
372 numnewpasses = endpass - startpass;
374 jas_stream_seek(cblk->stream, startpass->start, SEEK_SET);
375 assert(jas_stream_tell(cblk->stream) == startpass->start);
376 if (jas_stream_copy(out, cblk->stream, lastpass->end - startpass->start)) {
379 cblk->curpass = (endpass != endpasses) ? endpass : 0;
380 cblk->numencpasses += numnewpasses;
388 void jpc_save_t2state(jpc_enc_t *enc)
390 /* stream pos in embedded T1 stream may be wrong since not saved/restored! */
392 jpc_enc_tcmpt_t *comp;
393 jpc_enc_tcmpt_t *endcomps;
395 jpc_enc_rlvl_t *endlvls;
396 jpc_enc_band_t *band;
397 jpc_enc_band_t *endbands;
398 jpc_enc_cblk_t *cblk;
399 jpc_enc_cblk_t *endcblks;
400 jpc_enc_tile_t *tile;
406 endcomps = &tile->tcmpts[tile->numtcmpts];
407 for (comp = tile->tcmpts; comp != endcomps; ++comp) {
408 endlvls = &comp->rlvls[comp->numrlvls];
409 for (lvl = comp->rlvls; lvl != endlvls; ++lvl) {
413 endbands = &lvl->bands[lvl->numbands];
414 for (band = lvl->bands; band != endbands; ++band) {
418 for (prcno = 0, prc = band->prcs; prcno < lvl->numprcs; ++prcno, ++prc) {
422 jpc_tagtree_copy(prc->savincltree, prc->incltree);
423 jpc_tagtree_copy(prc->savnlibtree, prc->nlibtree);
424 endcblks = &prc->cblks[prc->numcblks];
425 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
426 cblk->savedcurpass = cblk->curpass;
427 cblk->savednumencpasses = cblk->numencpasses;
428 cblk->savednumlenbits = cblk->numlenbits;
437 void jpc_restore_t2state(jpc_enc_t *enc)
440 jpc_enc_tcmpt_t *comp;
441 jpc_enc_tcmpt_t *endcomps;
443 jpc_enc_rlvl_t *endlvls;
444 jpc_enc_band_t *band;
445 jpc_enc_band_t *endbands;
446 jpc_enc_cblk_t *cblk;
447 jpc_enc_cblk_t *endcblks;
448 jpc_enc_tile_t *tile;
454 endcomps = &tile->tcmpts[tile->numtcmpts];
455 for (comp = tile->tcmpts; comp != endcomps; ++comp) {
456 endlvls = &comp->rlvls[comp->numrlvls];
457 for (lvl = comp->rlvls; lvl != endlvls; ++lvl) {
461 endbands = &lvl->bands[lvl->numbands];
462 for (band = lvl->bands; band != endbands; ++band) {
466 for (prcno = 0, prc = band->prcs; prcno < lvl->numprcs; ++prcno, ++prc) {
470 jpc_tagtree_copy(prc->incltree, prc->savincltree);
471 jpc_tagtree_copy(prc->nlibtree, prc->savnlibtree);
472 endcblks = &prc->cblks[prc->numcblks];
473 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
474 cblk->curpass = cblk->savedcurpass;
475 cblk->numencpasses = cblk->savednumencpasses;
476 cblk->numlenbits = cblk->savednumlenbits;
484 void jpc_init_t2state(jpc_enc_t *enc, int raflag)
486 /* It is assumed that band->numbps and cblk->numbps precomputed */
488 jpc_enc_tcmpt_t *comp;
489 jpc_enc_tcmpt_t *endcomps;
491 jpc_enc_rlvl_t *endlvls;
492 jpc_enc_band_t *band;
493 jpc_enc_band_t *endbands;
494 jpc_enc_cblk_t *cblk;
495 jpc_enc_cblk_t *endcblks;
496 jpc_enc_pass_t *pass;
497 jpc_enc_pass_t *endpasses;
498 jpc_tagtreenode_t *leaf;
499 jpc_enc_tile_t *tile;
505 endcomps = &tile->tcmpts[tile->numtcmpts];
506 for (comp = tile->tcmpts; comp != endcomps; ++comp) {
507 endlvls = &comp->rlvls[comp->numrlvls];
508 for (lvl = comp->rlvls; lvl != endlvls; ++lvl) {
512 endbands = &lvl->bands[lvl->numbands];
513 for (band = lvl->bands; band != endbands; ++band) {
517 for (prcno = 0, prc = band->prcs; prcno < lvl->numprcs; ++prcno, ++prc) {
521 jpc_tagtree_reset(prc->incltree);
522 jpc_tagtree_reset(prc->nlibtree);
523 endcblks = &prc->cblks[prc->numcblks];
524 for (cblk = prc->cblks; cblk != endcblks; ++cblk) {
525 if (jas_stream_rewind(cblk->stream)) {
528 cblk->curpass = (cblk->numpasses > 0) ? cblk->passes : 0;
529 cblk->numencpasses = 0;
530 cblk->numlenbits = 3;
531 cblk->numimsbs = band->numbps - cblk->numbps;
532 assert(cblk->numimsbs >= 0);
533 leaf = jpc_tagtree_getleaf(prc->nlibtree, cblk - prc->cblks);
534 jpc_tagtree_setvalue(prc->nlibtree, leaf, cblk->numimsbs);
537 endpasses = &cblk->passes[cblk->numpasses];
538 for (pass = cblk->passes; pass != endpasses; ++pass) {
551 jpc_pi_t *jpc_enc_pi_create(jpc_enc_cp_t *cp, jpc_enc_tile_t *tile)
555 jpc_picomp_t *picomp;
556 jpc_pirlvl_t *pirlvl;
557 jpc_enc_tcmpt_t *tcomp;
559 jpc_enc_rlvl_t *rlvl;
563 if (!(pi = jpc_pi_create0())) {
567 pi->numcomps = cp->numcmpts;
568 if (!(pi->picomps = jas_malloc(pi->numcomps * sizeof(jpc_picomp_t)))) {
572 for (compno = 0, picomp = pi->picomps; compno < pi->numcomps; ++compno,
577 for (compno = 0, tcomp = tile->tcmpts, picomp = pi->picomps;
578 compno < pi->numcomps; ++compno, ++tcomp, ++picomp) {
579 picomp->numrlvls = tcomp->numrlvls;
580 if (!(picomp->pirlvls = jas_malloc(picomp->numrlvls *
581 sizeof(jpc_pirlvl_t)))) {
585 for (rlvlno = 0, pirlvl = picomp->pirlvls; rlvlno <
586 picomp->numrlvls; ++rlvlno, ++pirlvl) {
587 pirlvl->prclyrnos = 0;
589 for (rlvlno = 0, pirlvl = picomp->pirlvls, rlvl = tcomp->rlvls;
590 rlvlno < picomp->numrlvls; ++rlvlno, ++pirlvl, ++rlvl) {
591 /* XXX sizeof(long) should be sizeof different type */
592 pirlvl->numprcs = rlvl->numprcs;
594 if (!(pirlvl->prclyrnos = jas_malloc(pirlvl->numprcs *
600 pirlvl->prclyrnos = 0;
606 for (compno = 0, tcomp = tile->tcmpts, picomp = pi->picomps;
607 compno < pi->numcomps; ++compno, ++tcomp, ++picomp) {
608 picomp->hsamp = cp->ccps[compno].sampgrdstepx;
609 picomp->vsamp = cp->ccps[compno].sampgrdstepy;
610 for (rlvlno = 0, pirlvl = picomp->pirlvls, rlvl = tcomp->rlvls;
611 rlvlno < picomp->numrlvls; ++rlvlno, ++pirlvl, ++rlvl) {
612 pirlvl->prcwidthexpn = rlvl->prcwidthexpn;
613 pirlvl->prcheightexpn = rlvl->prcheightexpn;
614 for (prcno = 0, prclyrno = pirlvl->prclyrnos;
615 prcno < pirlvl->numprcs; ++prcno, ++prclyrno) {
618 pirlvl->numhprcs = rlvl->numhprcs;
620 if (pi->maxrlvls < tcomp->numrlvls) {
621 pi->maxrlvls = tcomp->numrlvls;
625 pi->numlyrs = tile->numlyrs;
626 pi->xstart = tile->tlx;
627 pi->ystart = tile->tly;
628 pi->xend = tile->brx;
629 pi->yend = tile->bry;
644 pi->defaultpchg.prgord = tile->prg;
645 pi->defaultpchg.compnostart = 0;
646 pi->defaultpchg.compnoend = pi->numcomps;
647 pi->defaultpchg.rlvlnostart = 0;
648 pi->defaultpchg.rlvlnoend = pi->maxrlvls;
649 pi->defaultpchg.lyrnoend = pi->numlyrs;