Lines Matching refs:symbol

205     int *symbol; // canonically ordered symbols
367 for (int symbol = 0; symbol < n; symbol++)
368 (h->count[length[symbol]])++; // assumes lengths are within bounds
388 // generate offsets into symbol table for each length for sorting
389 int offs[MAXBITS+1]; //offsets in symbol table for each length
395 * put symbols in table sorted by length, by symbol order within each
398 for (int symbol = 0; symbol < n; symbol++)
399 if (length[symbol] != 0)
400 h->symbol[offs[length[symbol]]++] = symbol;
455 { /* if length len, return symbol */
458 return h->symbol[index + (code - first)];
507 int symbol = doDecode(lencode);
508 if (symbol == 256)
510 if (symbol < 0)
514 if (symbol < 256) //literal
516 dest.push_back(symbol);
518 else if (symbol > 256)//length
520 symbol -= 257;
521 if (symbol >= 29)
527 if (!getBits(lext[symbol], &ret))
529 int len = lens[symbol] + ret;
531 symbol = doDecode(distcode);//distance
532 if (symbol < 0)
537 if (!getBits(dext[symbol], &ret))
539 unsigned int dist = dists[symbol] + ret;
621 int symbol = 0;
622 for ( ; symbol < 144; symbol++)
623 lengths[symbol] = 8;
624 for ( ; symbol < 256; symbol++)
625 lengths[symbol] = 9;
626 for ( ; symbol < 280; symbol++)
627 lengths[symbol] = 7;
628 for ( ; symbol < FIXLCODES; symbol++)
629 lengths[symbol] = 8;
633 for (int symbol = 0; symbol < MAXDCODES; symbol++)
634 lengths[symbol] = 5;
692 int symbol = doDecode(&lencode);
693 if (symbol < 16) // length in 0..15
694 lengths[index++] = symbol;
698 if (symbol == 16)
708 symbol = 3 + ret;
710 else if (symbol == 17) // repeat zero 3..10 times
714 symbol = 3 + ret;
720 symbol = 11 + ret;
722 if (index + symbol > nlen + ndist)
727 while (symbol--) // repeat last or zero symbol times