diff options
| author | Henry Stiles <henry.stiles@artifex.com> | 1998-08-08 06:14:25 +0000 |
|---|---|---|
| committer | Henry Stiles <henry.stiles@artifex.com> | 1998-08-08 06:14:25 +0000 |
| commit | a54bb96de84363bd3ffc7696805c268babc95954 (patch) | |
| tree | ab95f514d2831fa22cecdf942d2530b656a66d9e /gs/src/shcgen.c | |
| parent | 3305477b99710b8ce6223a0bdd5014ced4de6997 (diff) | |
This commit was generated by cvs2svn to compensate for changes in r279,
which included commits to RCS files with non-trunk default branches.
git-svn-id: http://svn.ghostscript.com/ghostpcl/trunk/ghostpcl@280 06663e23-700e-0410-b217-a244a6096597
Diffstat (limited to 'gs/src/shcgen.c')
| -rw-r--r-- | gs/src/shcgen.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/gs/src/shcgen.c b/gs/src/shcgen.c index f807db63d..bc9286660 100644 --- a/gs/src/shcgen.c +++ b/gs/src/shcgen.c @@ -1,4 +1,4 @@ -/* Copyright (C) 1994, 1996 Aladdin Enterprises. All rights reserved. +/* Copyright (C) 1994, 1996, 1998 Aladdin Enterprises. All rights reserved. This file is part of Aladdin Ghostscript. @@ -16,7 +16,7 @@ all copies. */ -/* shcgen.c */ +/*Id: shcgen.c */ /* Generate (bounded) Huffman code definitions from frequencies, */ /* and tables from definitions. */ #include "memory_.h" @@ -51,20 +51,20 @@ print_nodes_proc(const count_node * nodes, int n, const char *tag, int lengths) { int i; - dprintf1("[w]---------------- %s ----------------\n", tag); + dlprintf1("[w]---------------- %s ----------------\n", tag); for (i = 0; i < n; ++i) - dprintf7("[w]node %d: f=%ld v=%d len=%d N=%d L=%d R=%d\n", - i, nodes[i].freq, nodes[i].value, nodes[i].code_length, - (nodes[i].next == 0 ? -1 : (int)(nodes[i].next - nodes)), - (nodes[i].left == 0 ? -1 : (int)(nodes[i].left - nodes)), - (nodes[i].right == 0 ? -1 : (int)(nodes[i].right - nodes))); + dlprintf7("[w]node %d: f=%ld v=%d len=%d N=%d L=%d R=%d\n", + i, nodes[i].freq, nodes[i].value, nodes[i].code_length, + (nodes[i].next == 0 ? -1 : (int)(nodes[i].next - nodes)), + (nodes[i].left == 0 ? -1 : (int)(nodes[i].left - nodes)), + (nodes[i].right == 0 ? -1 : (int)(nodes[i].right - nodes))); for (i = lengths; i > 0;) { int j = i; int len = nodes[--j].code_length; while (j > 0 && nodes[j - 1].code_length == len) --j; - dprintf2("[w]%d codes of length %d\n", i - j, len); + dlprintf2("[w]%d codes of length %d\n", i - j, len); i = j; } } |