Lines Matching defs:c_full

476     uint32_t c_full = a->fullB[(a->curMin-a->st) >> 3];
478 c_full <<= 4 * ((a->curMin - a->st) & 0x00000007);
481 int nbBit = masks[c_full >> 28] + masks[c_part >> 28];
505 c_full = a->fullB[(i + 1 - a->st) >> 3];
508 c_full <<= 4;
576 uint32_t c_full[4];
577 c_full[0] = as[0]->fullB[(curMin - theSt) >> 3] | as[0]->partB[(curMin - theSt) >> 3];
578 c_full[0] <<= 4 * ((curMin - theSt) & 7);
579 c_full[1] = as[1]->fullB[(curMin - theSt) >> 3] | as[1]->partB[(curMin - theSt) >> 3];
580 c_full[1] <<= 4 * ((curMin - theSt) & 7);
581 c_full[2] = as[2]->fullB[(curMin - theSt) >> 3] | as[2]->partB[(curMin - theSt) >> 3];
582 c_full[2] <<= 4* ((curMin - theSt) & 7);
583 c_full[3] = as[3]->fullB[(curMin - theSt) >> 3] | as[3]->partB[(curMin - theSt) >> 3];
584 c_full[3] <<= 4* ((curMin - theSt) & 7);
590 if ( c_full[0] == 0 && c_full[1] == 0 && c_full[2] == 0 && c_full[3] == 0 ) {
598 } else if ( c_full[0] == 0xFFFFFFFF && c_full[1] == 0xFFFFFFFF &&
599 c_full[2] == 0xFFFFFFFF && c_full[3] == 0xFFFFFFFF ) {
615 nbBit += masks[c_full[0] >> 28];
616 nbBit += masks[c_full[1] >> 28];
617 nbBit += masks[c_full[2] >> 28];
618 nbBit += masks[c_full[3] >> 28];
644 c_full[0] = as[0]->fullB[(i + 1 - theSt) >> 3] | as[0]->partB[(i + 1 - theSt) >> 3];
645 c_full[1] = as[1]->fullB[(i + 1 - theSt) >> 3] | as[1]->partB[(i + 1 - theSt) >> 3];
646 c_full[2] = as[2]->fullB[(i + 1 - theSt) >> 3] | as[2]->partB[(i + 1 - theSt) >> 3];
647 c_full[3] = as[3]->fullB[(i + 1 - theSt) >> 3] | as[3]->partB[(i + 1 - theSt) >> 3];
652 c_full[0] <<= 4;
653 c_full[1] <<= 4;
654 c_full[2] <<= 4;
655 c_full[3] <<= 4;
661 uint32_t c_full[16]; // we take nbSub < 16, since 16*16 supersampling makes a 1/256 precision in alpha values
665 // start by putting the bits of the nbSub BitLignes in as[] in their respective c_full
669 c_full[i] = as[i]->fullB[(curMin - theSt) >> 3] | as[i]->partB[(curMin - theSt) >> 3];
670 c_full[i] <<= 4 * ((curMin - theSt) & 7);
680 // what's remaining in the c_full at best we flush an entire c_full, ie 32 bits, or 32/4=8 pixels
684 if ( c_full[j] != 0 /*|| c_part[j] != 0*/ ) {
691 // the remaining bits in c_full[] are empty: flush
699 if ( c_full[j] != 0xFFFFFFFF ) {
706 // the remaining bits in c_full[] are empty: flush
723 nbBit += masks[c_full[j] >> 28];
752 // move to the right: shift bits in the c_full[], and if we shifted everything, load the next c_full[]
757 c_full[j] = as[j]->fullB[(i + 1 - theSt) >> 3] | as[j]->partB[(i + 1 - theSt) >> 3];
765 c_full[j]<<=4;