HomeSort by: relevance | last modified time | path
    Searched defs:prior (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/dev/stbi/
stb_image.c 2727 uint8 *prior = cur - stride; local in function:create_png_image_raw
2737 case F_up : cur[k] = raw[k] + prior[k]; break;
2738 case F_avg : cur[k] = raw[k] + (prior[k]>>1); break;
2739 case F_paeth : cur[k] = (uint8) (raw[k] + paeth(0,prior[k],0)); break;
2747 prior += out_n;
2752 for (i=x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \
2759 CASE(F_up) cur[k] = raw[k] + prior[k];
2761 CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1);
2763 CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n]))
    [all...]
stb_image.c 2727 uint8 *prior = cur - stride; local in function:create_png_image_raw
2737 case F_up : cur[k] = raw[k] + prior[k]; break;
2738 case F_avg : cur[k] = raw[k] + (prior[k]>>1); break;
2739 case F_paeth : cur[k] = (uint8) (raw[k] + paeth(0,prior[k],0)); break;
2747 prior += out_n;
2752 for (i=x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \
2759 CASE(F_up) cur[k] = raw[k] + prior[k];
2761 CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1);
2763 CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n]))
    [all...]
stb_image.c 2727 uint8 *prior = cur - stride; local in function:create_png_image_raw
2737 case F_up : cur[k] = raw[k] + prior[k]; break;
2738 case F_avg : cur[k] = raw[k] + (prior[k]>>1); break;
2739 case F_paeth : cur[k] = (uint8) (raw[k] + paeth(0,prior[k],0)); break;
2747 prior += out_n;
2752 for (i=x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \
2759 CASE(F_up) cur[k] = raw[k] + prior[k];
2761 CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1);
2763 CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n]))
    [all...]

Completed in 54 milliseconds