rev_code          910 src/punutil/miniz.c             mz_uint rev_code = 0, code, code_size;
rev_code          915 src/punutil/miniz.c                 rev_code = (rev_code << 1) | (code & 1);
rev_code          916 src/punutil/miniz.c             d->m_huff_codes[table_num][i] = (mz_uint16)rev_code;
rev_code         2604 src/punutil/miniz.c                         mz_uint rev_code = 0, l, cur_code, code_size = pCode_size[sym_index];
rev_code         2609 src/punutil/miniz.c                             rev_code = (rev_code << 1) | (cur_code & 1);
rev_code         2613 src/punutil/miniz.c                             while (rev_code < TINFL_FAST_LOOKUP_SIZE)
rev_code         2615 src/punutil/miniz.c                                 pLookUp[rev_code] = k;
rev_code         2616 src/punutil/miniz.c                                 rev_code += (1 << code_size);
rev_code         2620 src/punutil/miniz.c                         if (0 == (tree_cur = pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)]))
rev_code         2622 src/punutil/miniz.c                             pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next;
rev_code         2626 src/punutil/miniz.c                         rev_code >>= (TINFL_FAST_LOOKUP_BITS - 1);
rev_code         2629 src/punutil/miniz.c                             tree_cur -= ((rev_code >>= 1) & 1);
rev_code         2639 src/punutil/miniz.c                         tree_cur -= ((rev_code >>= 1) & 1);