src/cal/cnt.c

#ifndef lint
static const char       RCSid[] = "$Id: cnt.c,v 1.6 2022/04/21 02:52:40 greg Exp $";
#endif
/*
 *  cnt.c - simple counting program.
 *
 *      2/1/88
 *
 *  Added -s (shuffle) option April 2022
 */

#include  <stdio.h>
#include  <time.h>
#include  "random.h"

#ifndef uint16
#define uint16  unsigned short          /* 16-bit unsigned integer */
#endif
#undef uby8
#define uby8  unsigned char             /* 8-bit unsigned integer */

#define MAXDIM  50

#define NLEVELS 9                       /* number of tree levels */
#define BRORDER 6                       /* branches/level */

/* Tree branch structure for quick occupancy search */
/* with 9 levels & 6 branches per level, we can store 1.94 Gbits in 259 MBytes (4.5% overhead) */
const struct {
        long    capacity;               /* slots/branch this level */
        long    skip_bytes;             /* bytes until next branch */
        int     cntr_siz;               /* occupancy counter size */
} tree_br[NLEVELS] = {
        {248L, 32L, 1},
        {248L*6, 32L*6+2, 2},
        {248L*6*6, (32L*6+2)*6+2, 2},
        {248L*6*6*6, ((32L*6+2)*6+2)*6+2, 2},
        {248L*6*6*6*6, (((32L*6+2)*6+2)*6+2)*6+3, 3},
        {248L*6*6*6*6*6, ((((32L*6+2)*6+2)*6+2)*6+3)*6+3, 3},
        {248L*6*6*6*6*6*6, (((((32L*6+2)*6+2)*6+2)*6+3)*6+3)*6+3, 3},
        {248L*6*6*6*6*6*6*6, ((((((32L*6+2)*6+2)*6+2)*6+3)*6+3)*6+3)*6+4, 4},
        {248L*6*6*6*6*6*6*6*6, (((((((32L*6+2)*6+2)*6+2)*6+3)*6+3)*6+3)*6+4)*6+4, 4},
};

char  buf[256];                         /* buffer for ordered array output */


/* Encode integer in string and return pointer to end */
static char *
tack(char *b, long i)
{
        char  *cp;
        char  *res;

        *b++ = '\t';
        cp = b;
        if (i == 0)
                *cp++ = '0';
        else
                do {
                        *cp++ = i%10L + '0';
                        i /= 10L;
                } while (i);
        res = cp--;
#define c i
        while (cp > b) {                /* reverse string */
                c = *cp;
                *cp-- = *b;
                *b++ = c;
        }
#undef c
        return(res);
}


/* Loop over dimensions, spitting out buffer after each increment */
static void
loop(long *n, char *b)
{
        long  i;

        if (n[0] == 0) {
                *b = '\0';
                puts(buf);
                return;
        }
        for (i = 0; i < n[0]; i++)
                loop(n+1, tack(b, i));
}


/* Print out shuffled value */
static void
print_shuf(long *n, long aval)
{
        int     i;

        for (i = 0; n[i+1]; i++) {
                printf("\t%ld", aval % n[i]);
                aval /= n[i];
        }
        printf("\t%ld\n", aval);
}


/* Allocate and prepare occupancy tree */
static uby8 *
tree_alloc(long alen)
{
        uby8  *troot;
        double  bytes_per_bit;
        int  i;
        int  ht = 0;
                                        /* how tall does our tree need to be? */
        while (tree_br[ht].capacity*BRORDER < alen)
                if (++ht >= NLEVELS) {
                        fputs("Array too large to shuffle\n", stderr);
                        exit(1);
                }
        bytes_per_bit = 1.;             /* figure out tree size (with overhead) */
        for (i = ht; i >= 0; i--)
                bytes_per_bit += (double)tree_br[i].cntr_siz;
        bytes_per_bit += (double)tree_br[ht].skip_bytes;
        bytes_per_bit /= (double)tree_br[ht].capacity;
        troot = (uby8 *)calloc((long)(alen*bytes_per_bit)+2, 1);
        if (troot == NULL) {
                fputs("Not enough memory for shuffle\n", stderr);
                exit(1);
        }
        *troot = ht;                    /* first byte is tree height */
        for (i = 256; i--; ) {          /* assign 0-bit count table */
                int     b;
                buf[i] = 8;
                for (b = i; b; b >>= 1)
                        buf[i] -= b&1;
        }
        return(troot);
}


/* Get number of slots available at this branch location */
static long
get_avail(const uby8 *ctrp, int lvl)
{
        long    cnt = 0;
        int     n = tree_br[lvl].cntr_siz;

        while (--n > 0) {               /* LSB first */
                cnt |= ctrp[n];
                cnt <<= 8;
        }
        cnt |= ctrp[0];

        return(tree_br[lvl].capacity - cnt);
}


/* Increment branch occupancy counter */
static void
incr_counter(uby8 *ctrp, int n)
{
        n = tree_br[n].cntr_siz;

        while (++(*ctrp++))             /* LSB first */
                if (--n <= 0) {
                        fputs("Shuffle occupancy overflow!\n", stderr);
                        exit(1);        /* means we sized something wrong */
                }
}


/* Skip to and allocate a leaf from tree */
static long
eat_nth_leaf(uby8 *brp, long ski)
{
        int     lvl = *brp++;                   /* tree height in first byte */
        long    pos = 0;
        int     b;

        while (lvl >= 0) {                      /* descend to leaves */
                long  navail;
                b = 0;                          /* select each branch */
                while (ski >= (navail = get_avail(brp, lvl))) {
                        if (++b >= BRORDER) {
                                fputs("Shuffle tree error!\n", stderr);
                                exit(1);
                        }
                        pos += tree_br[lvl].capacity;
                        ski -= navail;
                        brp += tree_br[lvl].skip_bytes;
                }
                incr_counter(brp, lvl);         /* we intend to eat one */
                brp += tree_br[lvl--].cntr_siz; /* drop a level */
        }
        while (ski >= buf[*brp]) {              /* browse the leaves */
                pos += 8;
                ski -= buf[*brp++];             /* buf contains 0-bit counts */
        }
        b = 0;                                  /* find target bit in byte */
        while ((ski -= !(*brp & 1<<b)) >= 0) {
                pos++;
                b++;
        }
        *brp |= 1<<b;                           /* eat it */
        return(pos);                            /* & return leaf's slot# */
}


/* Shuffle all possible output strings and spit out randomly (tree version) */
static void
big_shuffle(long *n, long alen)
{
        uby8  *tree_root;
                                        /* size and allocate holder tree */
        tree_root = tree_alloc(alen);

        while (alen > 0)                /* allocate and print random array entries */
                print_shuf(n, eat_nth_leaf(tree_root, irandom(alen--)));

        free(tree_root);                /* all done */
}


/* Shuffle all possible output strings and spit out randomly */
static void
shuffle(long *n)
{
        long  alen;
        uint16  *myshuf;
        int  i;

        alen = 1;               /* compute shuffle size */
        for (i = 0; n[i]; i++) {
                if (alen*n[i] <= alen) {
                        fputs("Array too large to count!\n", stderr);
                        exit(1);
                }
                alen *= n[i];
        }
                                /* get unique starting point */
        srandom((long)time(0));

        if (alen > 1L<<16) {    /* use large shuffle method? */
                big_shuffle(n, alen);
                return;
        }
        myshuf = (uint16 *)malloc(alen*sizeof(uint16));
        if (myshuf == NULL) {
                fputs("Insufficient memory for shuffle\n", stderr);
                exit(1);
        }
        for (i = alen; i--; )   /* initialize in any order */
                myshuf[i] = i;
                                /* perform Fisher-Yates shuffle */
        for (i = 0; i < alen-1; i++) {
                int     ix = irandom(alen-i) + i;
                int     ndx = myshuf[i];
                myshuf[i] = myshuf[ix];
                myshuf[ix] = ndx;
        }
                                /* put randomly indexed output */
        for (i = alen; i--; )
                print_shuf(n, (long)myshuf[i]);

        free(myshuf);           /* all done */
}


int
main(int argc, char *argv[])
{
        char  *prog = argv[0];
        int  doshuffle = 0;
        long  n[MAXDIM];
        int  a;

        argv++; argc--;
        if (argc <= 0)
                goto userr;
        if (argv[0][0] == '-' && argv[0][1] == 's') {
                doshuffle = 1;
                argv++; argc--;
        }
        for (a = 0; a < argc; a++)
                if ((n[a] = atol(argv[a])) <= 1)
                        goto userr;
        n[a] = 0;
        if (!a)
                goto userr;

        if (doshuffle)
                shuffle(n);
        else
                loop(n, buf);

        return(0);
userr:
        fputs("Usage: ", stderr);
        fputs(prog, stderr);
        fputs(" [-s] N0 [N1 ..]\n", stderr);
        return(1);
}
Revision:	1.7
Committed:	Fri Apr 22 15:50:34 2022 UTC (2 years ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 1.6:	+6 -4 lines
Log Message:	fix(cnt): Added extra check for occupancy counter overflow
#	User	Rev	Content
1	greg	1.1	#ifndef lint
2	greg	1.7	static const char RCSid[] = "$Id: cnt.c,v 1.6 2022/04/21 02:52:40 greg Exp $";
3	greg	1.1	#endif
4			/*
5			* cnt.c - simple counting program.
6			*
7			* 2/1/88
8	greg	1.3	*
9			* Added -s (shuffle) option April 2022
10	greg	1.1	*/
11
12			#include <stdio.h>
13	greg	1.3	#include <time.h>
14			#include "random.h"
15	greg	1.1
16	greg	1.4	#ifndef uint16
17			#define uint16 unsigned short /* 16-bit unsigned integer */
18			#endif
19			#undef uby8
20			#define uby8 unsigned char /* 8-bit unsigned integer */
21
22	greg	1.3	#define MAXDIM 50
23	greg	1.1
24	greg	1.4	#define NLEVELS 9 /* number of tree levels */
25			#define BRORDER 6 /* branches/level */
26
27			/* Tree branch structure for quick occupancy search */
28			/* with 9 levels & 6 branches per level, we can store 1.94 Gbits in 259 MBytes (4.5% overhead) */
29			const struct {
30			long capacity; /* slots/branch this level */
31			long skip_bytes; /* bytes until next branch */
32			int cntr_siz; /* occupancy counter size */
33			} tree_br[NLEVELS] = {
34			{248L, 32L, 1},
35			{248L6, 32L6+2, 2},
36			{248L66, (32L6+2)6+2, 2},
37			{248L666, ((32L6+2)6+2)6+2, 2},
38			{248L6666, (((32L6+2)6+2)6+2)6+3, 3},
39			{248L66666, ((((32L6+2)6+2)6+2)6+3)6+3, 3},
40			{248L666666, (((((32L6+2)6+2)6+2)6+3)6+3)6+3, 3},
41			{248L6666666, ((((((32L6+2)6+2)6+2)6+3)6+3)6+3)6+4, 4},
42			{248L66666666, (((((((32L6+2)6+2)6+2)6+3)6+3)6+3)6+4)6+4, 4},
43			};
44
45			char buf[256]; /* buffer for ordered array output */
46	greg	1.1
47
48	greg	1.3	/* Encode integer in string and return pointer to end */
49			static char *
50	greg	1.4	tack(char *b, long i)
51	greg	1.1	{
52	greg	1.3	char *cp;
53	greg	1.1	char *res;
54
55			*b++ = '\t';
56			cp = b;
57			if (i == 0)
58			*cp++ = '0';
59			else
60			do {
61	greg	1.4	*cp++ = i%10L + '0';
62			i /= 10L;
63	greg	1.1	} while (i);
64			res = cp--;
65			#define c i
66			while (cp > b) { /* reverse string */
67			c = *cp;
68			cp-- = b;
69			*b++ = c;
70			}
71			#undef c
72			return(res);
73			}
74
75
76	greg	1.3	/* Loop over dimensions, spitting out buffer after each increment */
77	schorsch	1.2	static void
78	greg	1.4	loop(long n, char b)
79	greg	1.1	{
80	greg	1.4	long i;
81	greg	1.1
82			if (n[0] == 0) {
83			*b = '\0';
84			puts(buf);
85			return;
86			}
87			for (i = 0; i < n[0]; i++)
88			loop(n+1, tack(b, i));
89			}
90	greg	1.3
91
92	greg	1.4	/* Print out shuffled value */
93			static void
94			print_shuf(long *n, long aval)
95			{
96			int i;
97
98			for (i = 0; n[i+1]; i++) {
99			printf("\t%ld", aval % n[i]);
100			aval /= n[i];
101			}
102			printf("\t%ld\n", aval);
103			}
104
105
106			/* Allocate and prepare occupancy tree */
107			static uby8 *
108			tree_alloc(long alen)
109			{
110			uby8 *troot;
111			double bytes_per_bit;
112			int i;
113			int ht = 0;
114			/* how tall does our tree need to be? */
115			while (tree_br[ht].capacity*BRORDER < alen)
116			if (++ht >= NLEVELS) {
117			fputs("Array too large to shuffle\n", stderr);
118			exit(1);
119			}
120			bytes_per_bit = 1.; /* figure out tree size (with overhead) */
121			for (i = ht; i >= 0; i--)
122			bytes_per_bit += (double)tree_br[i].cntr_siz;
123			bytes_per_bit += (double)tree_br[ht].skip_bytes;
124			bytes_per_bit /= (double)tree_br[ht].capacity;
125			troot = (uby8 )calloc((long)(alenbytes_per_bit)+2, 1);
126			if (troot == NULL) {
127			fputs("Not enough memory for shuffle\n", stderr);
128			exit(1);
129			}
130			troot = ht; / first byte is tree height */
131	greg	1.5	for (i = 256; i--; ) { /* assign 0-bit count table */
132	greg	1.4	int b;
133	greg	1.5	buf[i] = 8;
134	greg	1.4	for (b = i; b; b >>= 1)
135	greg	1.5	buf[i] -= b&1;
136	greg	1.4	}
137			return(troot);
138			}
139
140
141			/* Get number of slots available at this branch location */
142			static long
143			get_avail(const uby8 *ctrp, int lvl)
144			{
145			long cnt = 0;
146			int n = tree_br[lvl].cntr_siz;
147
148			while (--n > 0) { /* LSB first */
149			cnt \|= ctrp[n];
150			cnt <<= 8;
151			}
152			cnt \|= ctrp[0];
153
154			return(tree_br[lvl].capacity - cnt);
155			}
156
157
158			/* Increment branch occupancy counter */
159			static void
160			incr_counter(uby8 *ctrp, int n)
161			{
162			n = tree_br[n].cntr_siz;
163
164	greg	1.7	while (++(ctrp++)) / LSB first */
165			if (--n <= 0) {
166			fputs("Shuffle occupancy overflow!\n", stderr);
167			exit(1); /* means we sized something wrong */
168			}
169	greg	1.4	}
170
171
172			/* Skip to and allocate a leaf from tree */
173			static long
174			eat_nth_leaf(uby8 *brp, long ski)
175			{
176			int lvl = brp++; / tree height in first byte */
177			long pos = 0;
178			int b;
179
180			while (lvl >= 0) { /* descend to leaves */
181			long navail;
182			b = 0; /* select each branch */
183			while (ski >= (navail = get_avail(brp, lvl))) {
184			if (++b >= BRORDER) {
185			fputs("Shuffle tree error!\n", stderr);
186			exit(1);
187			}
188			pos += tree_br[lvl].capacity;
189			ski -= navail;
190			brp += tree_br[lvl].skip_bytes;
191			}
192			incr_counter(brp, lvl); /* we intend to eat one */
193			brp += tree_br[lvl--].cntr_siz; /* drop a level */
194			}
195	greg	1.5	while (ski >= buf[brp]) { / browse the leaves */
196	greg	1.4	pos += 8;
197	greg	1.5	ski -= buf[brp++]; / buf contains 0-bit counts */
198	greg	1.4	}
199	greg	1.5	b = 0; /* find target bit in byte */
200			while ((ski -= !(*brp & 1<<b)) >= 0) {
201	greg	1.4	pos++;
202	greg	1.5	b++;
203	greg	1.4	}
204	greg	1.5	brp \|= 1<<b; / eat it */
205			return(pos); /* & return leaf's slot# */
206	greg	1.4	}
207
208
209			/* Shuffle all possible output strings and spit out randomly (tree version) */
210			static void
211			big_shuffle(long *n, long alen)
212			{
213			uby8 *tree_root;
214			/* size and allocate holder tree */
215			tree_root = tree_alloc(alen);
216
217			while (alen > 0) /* allocate and print random array entries */
218	greg	1.6	print_shuf(n, eat_nth_leaf(tree_root, irandom(alen--)));
219	greg	1.4
220			free(tree_root); /* all done */
221			}
222
223
224	greg	1.3	/* Shuffle all possible output strings and spit out randomly */
225			static void
226	greg	1.4	shuffle(long *n)
227			{
228			long alen;
229			uint16 *myshuf;
230			int i;
231
232			alen = 1; /* compute shuffle size */
233			for (i = 0; n[i]; i++) {
234			if (alen*n[i] <= alen) {
235			fputs("Array too large to count!\n", stderr);
236	greg	1.3	exit(1);
237	greg	1.4	}
238			alen *= n[i];
239			}
240			/* get unique starting point */
241			srandom((long)time(0));
242	greg	1.3
243	greg	1.4	if (alen > 1L<<16) { /* use large shuffle method? */
244			big_shuffle(n, alen);
245			return;
246			}
247			myshuf = (uint16 )malloc(alensizeof(uint16));
248	greg	1.3	if (myshuf == NULL) {
249			fputs("Insufficient memory for shuffle\n", stderr);
250			exit(1);
251			}
252			for (i = alen; i--; ) /* initialize in any order */
253			myshuf[i] = i;
254			/* perform Fisher-Yates shuffle */
255			for (i = 0; i < alen-1; i++) {
256	greg	1.6	int ix = irandom(alen-i) + i;
257	greg	1.3	int ndx = myshuf[i];
258			myshuf[i] = myshuf[ix];
259			myshuf[ix] = ndx;
260			}
261			/* put randomly indexed output */
262	greg	1.4	for (i = alen; i--; )
263			print_shuf(n, (long)myshuf[i]);
264
265			free(myshuf); /* all done */
266	greg	1.3	}
267
268
269			int
270	greg	1.4	main(int argc, char *argv[])
271	greg	1.3	{
272			char *prog = argv[0];
273			int doshuffle = 0;
274	greg	1.4	long n[MAXDIM];
275	greg	1.3	int a;
276
277			argv++; argc--;
278			if (argc <= 0)
279			goto userr;
280			if (argv[0][0] == '-' && argv[0][1] == 's') {
281			doshuffle = 1;
282			argv++; argc--;
283			}
284			for (a = 0; a < argc; a++)
285	greg	1.4	if ((n[a] = atol(argv[a])) <= 1)
286	greg	1.3	goto userr;
287			n[a] = 0;
288			if (!a)
289			goto userr;
290
291			if (doshuffle)
292			shuffle(n);
293			else
294			loop(n, buf);
295
296			return(0);
297			userr:
298			fputs("Usage: ", stderr);
299			fputs(prog, stderr);
300			fputs(" [-s] N0 [N1 ..]\n", stderr);
301			return(1);
302			}