Lines Matching refs:set
1724 V(DEF, set, LDSET) \
6412 // bits[13..12] are all set or all cleared.
6435 // bits[29..25] are all set or all cleared.
6459 // bits[61..54] are all set or all cleared.
6494 // value, with remaining bits set, eg. 0xffff1234, 0xffff1234ffffffff.
6535 // (s bits must not be all set)
6538 // are set. The pattern is rotated right by R, and repeated across a 32 or
6553 // is set, and then we know that the rotated case can't arise.)
6556 // If the low bit is 1, negate the value, and set a flag to remember that we
6582 // We find the lowest set bit (as an actual power-of-2 value, not its index)
6584 // bottommost stretch of set bits and replaces it with a 1 carried into the
6585 // next zero bit. Then we look for the new lowest set bit, which is in
6587 // but with the lowest stretch of set bits completely gone. Now we find the
6588 // lowest set bit again, which is position c in the diagram above. Then we'll
6603 // The general case, in which there is more than one stretch of set bits.
6604 // Compute the repeat distance d, and set up a bitmask covering the basic
6605 // unit of repetition (i.e. a word with the bottom d bits set). Also, in all
6615 // If any of those 'find lowest set bit' operations didn't find a set bit at
6626 // of set bits in our word, meaning that we have the trivial case of
6628 // the general case above, and set the N bit in the output.
6674 // Count the set bits in our basic stretch. The special case of clz(0) == -1
6685 // where we compensate: the number of set bits becomes the number of clear
6695 // it gives both the number of set bits and the length of the repeated