Lines Matching defs:fast
1919 // - still fast on x86 (copying globals into locals doesn't help x86)
1927 // - fast huffman; reasonable integer IDCT
1938 stbi_uc fast[1 << FAST_BITS];
2032 memset(h->fast, 255, 1 << FAST_BITS);
2039 h->fast[c+j] = (stbi_uc) i;
2052 stbi_uc fast = h->fast[i];
2054 if (fast < 255) {
2055 int rs = h->values[fast];
2058 int len = h->size[fast];
2105 k = h->fast[c];
2235 if (r) { // fast-AC path
2313 if (r) { // fast-AC path
2364 int rs = stbi__jpeg_huff_decode(j, hac); // @OPTIMIZE see if we can use the fast path here, advance-by-r is so slow, eh
2499 // no fast case since the first 1D IDCT spread components out
3856 // fast 0..255 * 0..255 => 0..255 rounded multiplication
4084 // - fast huffman
4088 // fast-way is faster to check than jpeg huffman, but slow way is slower
4097 stbi__uint16 fast[1 << STBI__ZFAST_BITS];
4129 memset(z->fast, 0, sizeof(z->fast));
4159 z->fast[j] = fastv;
4224 // not resolved by fast table, so compute it the slow way
4249 b = z->fast[a->code_buffer & STBI__ZFAST_MASK];
4582 // - uses stb_zlib, a PD zlib implementation with fast huffman decoding