Lines Matching defs:index
358 * A Pos is an index in the character window. We use short instead of
402 * Link to older string with same hash index. To limit the
404 * the last 32K strings. An index in this array is thus a
405 * window index modulo 32K.
410 uInt ins_h; /* hash index of string to be inserted */
532 uInt last_lit; /* running index in l_buf */
1468 * we prevent matches with the string of window index 0.
1983 * with the string of window index 0 (in
2110 * with the string of window index 0 (in
2338 int extra_base; /* base index for extra_bits */
2465 int dist; /* distance index */
2666 int h; /* heap index */
2762 int bits; /* bit index */
2763 int n; /* code index */
3000 * Construct the Huffman tree for the bit lengths and return the index in
3007 /* index of last bit length code of non zero freq */
3052 int rank; /* index in bl_order */
3164 /* index of last bit length code of non zero freq */
3189 * and get the index in bl_order of the last bit
3366 unsigned lx = 0; /* running index in l_buf */
4173 uInt index; /* index into blens (or border) */
4476 s->sub.trees.index = 0;
4481 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
4484 s->sub.trees.blens[border[s->sub.trees.index++]] =
4488 while (s->sub.trees.index < 19)
4489 s->sub.trees.blens[border[s->sub.trees.index++]] =
4503 s->sub.trees.index = 0;
4509 s->sub.trees.index < 258 + (t & 0x1f) +
4523 s->sub.trees.blens[s->sub.trees.index++] =
4532 i = s->sub.trees.index;
4549 s->sub.trees.index = i;