Lines Matching defs:cur
3566 // even pixels = 3*cur + prev = cur*4 + (prev - cur)
3567 // odd pixels = 3*cur + next = cur*4 + (next - cur)
3606 // even pixels = 3*cur + prev = cur*4 + (prev - cur)
3607 // odd pixels = 3*cur + next = cur*4 + (next - cur)
4262 unsigned int cur, limit, old_limit;
4265 cur = (unsigned int) (z->zout - z->zout_start);
4267 if (UINT_MAX - cur < (unsigned) n) return stbi__err("outofmem", "Out of memory");
4268 while (cur + n > limit) {
4276 z->zout = q + cur;
4677 stbi_uc *cur = a->out + stride*j;
4686 cur += x*out_n - img_width_bytes; // store output to the rightmost img_len bytes, so we can decode in place
4690 prior = cur - stride; // bugfix: need to compute this after 'cur +=' computation above
4698 case STBI__F_none : cur[k] = raw[k]; break;
4699 case STBI__F_sub : cur[k] = raw[k]; break;
4700 case STBI__F_up : cur[k] = STBI__BYTECAST(raw[k] + prior[k]); break;
4701 case STBI__F_avg : cur[k] = STBI__BYTECAST(raw[k] + (prior[k]>>1)); break;
4702 case STBI__F_paeth : cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(0,prior[k],0)); break;
4703 case STBI__F_avg_first : cur[k] = raw[k]; break;
4704 case STBI__F_paeth_first: cur[k] = raw[k]; break;
4710 cur[img_n] = 255; // first pixel
4712 cur += out_n;
4716 cur[filter_bytes] = 255; // first pixel top byte
4717 cur[filter_bytes+1] = 255; // first pixel bottom byte
4720 cur += output_bytes;
4724 cur += 1;
4736 case STBI__F_none: memcpy(cur, raw, nk); break;
4737 STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k-filter_bytes]); } break;
4738 STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); } break;
4739 STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k-filter_bytes])>>1)); } break;
4740 STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k-filter_bytes],prior[k],prior[k-filter_bytes])); } break;
4741 STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k-filter_bytes] >> 1)); } break;
4742 STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k-filter_bytes],0,0)); } break;
4750 for (i=x-1; i >= 1; --i, cur[filter_bytes]=255,raw+=filter_bytes,cur+=output_bytes,prior+=output_bytes) \
4753 STBI__CASE(STBI__F_none) { cur[k] = raw[k]; } break;
4754 STBI__CASE(STBI__F_sub) { cur[k] = STBI__BYTECAST(raw[k] + cur[k- output_bytes]); } break;
4755 STBI__CASE(STBI__F_up) { cur[k] = STBI__BYTECAST(raw[k] + prior[k]); } break;
4756 STBI__CASE(STBI__F_avg) { cur[k] = STBI__BYTECAST(raw[k] + ((prior[k] + cur[k- output_bytes])>>1)); } break;
4757 STBI__CASE(STBI__F_paeth) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k- output_bytes],prior[k],prior[k- output_bytes])); } break;
4758 STBI__CASE(STBI__F_avg_first) { cur[k] = STBI__BYTECAST(raw[k] + (cur[k- output_bytes] >> 1)); } break;
4759 STBI__CASE(STBI__F_paeth_first) { cur[k] = STBI__BYTECAST(raw[k] + stbi__paeth(cur[k- output_bytes],0,0)); } break;
4766 cur = a->out + stride*j; // start at the beginning of the row again
4767 for (i=0; i < x; ++i,cur+=output_bytes) {
4768 cur[filter_bytes+1] = 255;
4779 stbi_uc *cur = a->out + stride*j;
4793 *cur++ = scale * ((*in >> 4) );
4794 *cur++ = scale * ((*in ) & 0x0f);
4796 if (k > 0) *cur++ = scale * ((*in >> 4) );
4799 *cur++ = scale * ((*in >> 6) );
4800 *cur++ = scale * ((*in >> 4) & 0x03);
4801 *cur++ = scale * ((*in >> 2) & 0x03);
4802 *cur++ = scale * ((*in ) & 0x03);
4804 if (k > 0) *cur++ = scale * ((*in >> 6) );
4805 if (k > 1) *cur++ = scale * ((*in >> 4) & 0x03);
4806 if (k > 2) *cur++ = scale * ((*in >> 2) & 0x03);
4809 *cur++ = scale * ((*in >> 7) );
4810 *cur++ = scale * ((*in >> 6) & 0x01);
4811 *cur++ = scale * ((*in >> 5) & 0x01);
4812 *cur++ = scale * ((*in >> 4) & 0x01);
4813 *cur++ = scale * ((*in >> 3) & 0x01);
4814 *cur++ = scale * ((*in >> 2) & 0x01);
4815 *cur++ = scale * ((*in >> 1) & 0x01);
4816 *cur++ = scale * ((*in ) & 0x01);
4818 if (k > 0) *cur++ = scale * ((*in >> 7) );
4819 if (k > 1) *cur++ = scale * ((*in >> 6) & 0x01);
4820 if (k > 2) *cur++ = scale * ((*in >> 5) & 0x01);
4821 if (k > 3) *cur++ = scale * ((*in >> 4) & 0x01);
4822 if (k > 4) *cur++ = scale * ((*in >> 3) & 0x01);
4823 if (k > 5) *cur++ = scale * ((*in >> 2) & 0x01);
4824 if (k > 6) *cur++ = scale * ((*in >> 1) & 0x01);
4829 cur = a->out + stride*j;
4832 cur[q*2+1] = 255;
4833 cur[q*2+0] = cur[q];
4838 cur[q*4+3] = 255;
4839 cur[q*4+2] = cur[q*3+2];
4840 cur[q*4+1] = cur[q*3+1];
4841 cur[q*4+0] = cur[q*3+0];
4851 stbi_uc *cur = a->out;
4852 stbi__uint16 *cur16 = (stbi__uint16*)cur;
4854 for(i=0; i < x*y*out_n; ++i,cur16++,cur+=2) {
4855 *cur16 = (cur[0] << 8) | cur[1];