(int dist)
| 146 | // must not have side effects. _dist_code[256] and _dist_code[257] are never |
| 147 | // used. |
| 148 | static int d_code(int dist){ |
| 149 | return ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>>7)]); |
| 150 | } |
| 151 | |
| 152 | short[] dyn_tree; // the dynamic tree |
| 153 | int max_code; // largest code with non zero frequency |
no outgoing calls
no test coverage detected