| tag | line | file | source code |
|---|
| huft | 28 | zBoot/inflate.c | struct huft *t; /* pointer to next level of table */ |
| huft | 35 | zBoot/inflate.c | struct huft **, int *)); |
| huft | 36 | zBoot/inflate.c | int huft_free OF((struct huft *)); |
| huft | 37 | zBoot/inflate.c | int inflate_codes OF((struct huft *, struct huft *, int, int)); |
| huft | 105 | zBoot/inflate.c | struct huft **t; /* result: starting table */ |
| huft | 123 | zBoot/inflate.c | register struct huft *q; /* points to current table */ |
| huft | 124 | zBoot/inflate.c | struct huft r; /* table entry for structure assignment */ |
| huft | 125 | zBoot/inflate.c | struct huft *u[BMAX]; /* table stack */ |
| huft | 143 | zBoot/inflate.c | *t = (struct huft *)NULL; |
| huft | 201 | zBoot/inflate.c | u[0] = (struct huft *)NULL; /* just to keep compilers happy */ |
| huft | 202 | zBoot/inflate.c | q = (struct huft *)NULL; /* ditto */ |
| huft | 240 | zBoot/inflate.c | if ((q = (struct huft *)malloc((z + 1)*sizeof(struct huft))) == |
| huft | 241 | zBoot/inflate.c | (struct huft *)NULL) |
| huft | 252 | zBoot/inflate.c | *(t = &(q->v.t)) = (struct huft *)NULL; |
| huft | 316 | zBoot/inflate.c | struct huft *t; /* table to free */ |
| huft | 321 | zBoot/inflate.c | register struct huft *p, *q; |
| huft | 326 | zBoot/inflate.c | while (p != (struct huft *)NULL) |
| huft | 337 | zBoot/inflate.c | struct huft *tl, *td; /* literal/length and distance decoder tables */ |
| huft | 345 | zBoot/inflate.c | struct huft *t; /* pointer to table entry */ |
| huft | 504 | zBoot/inflate.c | struct huft *tl; /* literal/length code table */ |
| huft | 505 | zBoot/inflate.c | struct huft *td; /* distance code table */ |
| huft | 560 | zBoot/inflate.c | struct huft *tl; /* literal/length code table */ |
| huft | 561 | zBoot/inflate.c | struct huft *td; /* distance code table */ |