Lines Matching refs:BIT7
117 p[sievingPrime * 12 + 2] &= BIT7; in crossOff()
126 case 3: CHECK_FINISHED(3); *p &= BIT7; p += sievingPrime * 4 + 1; FALLTHROUGH; in crossOff()
141 p[sievingPrime * 10 + 3] &= BIT7; in crossOff()
150 case 10: CHECK_FINISHED(10); *p &= BIT7; p += sievingPrime * 2 + 1; FALLTHROUGH; in crossOff()
165 p[sievingPrime * 6 + 2] &= BIT7; in crossOff()
174 case 17: CHECK_FINISHED(17); *p &= BIT7; p += sievingPrime * 4 + 2; FALLTHROUGH; in crossOff()
195 p[sievingPrime * 22 + 12] &= BIT7; in crossOff()
204 case 30: CHECK_FINISHED(30); *p &= BIT7; p += sievingPrime * 6 + 4; FALLTHROUGH; in crossOff()
219 p[sievingPrime * 18 + 11] &= BIT7; in crossOff()
228 case 37: CHECK_FINISHED(37); *p &= BIT7; p += sievingPrime * 4 + 3; FALLTHROUGH; in crossOff()
243 p[sievingPrime * 16 + 12] &= BIT7; in crossOff()
252 case 44: CHECK_FINISHED(44); *p &= BIT7; p += sievingPrime * 2 + 2; FALLTHROUGH; in crossOff()
271 p[sievingPrime * 28 + 27] &= BIT7; in crossOff()
280 case 55: CHECK_FINISHED(55); *p &= BIT7; p += sievingPrime * 2 + 2; in crossOff()
289 p[sievingPrime * 0 + 0] &= BIT7; in crossOff()
298 CHECK_FINISHED(56); *p &= BIT7; p += sievingPrime * 6 + 1; FALLTHROUGH; in crossOff()