Searched refs:maxlev (Results 1 - 7 of 7) sorted by relevance
/ast/src/cmd/pack/ |
H A D | huffgethdr.c | 49 /* get number of levels in maxlev, */ 50 hp->maxlev = sfgetc(infile); 51 if(hp->maxlev==0) 56 hp->maxlev = sfgetc(infile); 58 if(hp->maxlev < 0 || hp->maxlev > HUFFLEV) 61 for (i=1; i<=hp->maxlev; i++) 71 for (i=1; i<=hp->maxlev; i++)
|
H A D | huffputhdr.c | 56 sfputc(fp,hp->maxlev); 57 for (i=1; i<hp->maxlev; i++) 59 sfputc(fp,hp->levcount[hp->maxlev]-2); 61 for (i=1; i<=hp->maxlev; i++)
|
H A D | huffman.h | 47 int maxlev; member in struct:__anon178 62 #define huffhsize(hp) ((hp)->maxlev+(hp)->nchars+7)
|
H A D | huffdecode.c | 105 fillbuff(buffer,left,hp->maxlev,inp); 171 for (i=1; i<=hp->maxlev; i++) 181 intnodes[hp->maxlev] += 2; 186 for (n=0, i=hp->maxlev; i>=1; i--) 205 if(hp->maxlev <= CHUNK) 207 hp->excess = CHUNK+1-hp->maxlev; 208 hp->maxlev = CHUNK;
|
H A D | huffinit.c | 110 size = hp->maxlev = 0; 120 if (c > hp->maxlev) 121 hp->maxlev = c;
|
H A D | huffencode.c | 70 for (n=0, i=hp->maxlev; i>0; i--)
|
H A D | pack.c | 225 sfprintf(sfstdout," Huffman tree has %d levels below root\n", hp->maxlev);
|
Completed in 88 milliseconds