Lines Matching refs:bit
78 the function. Each character of the string represents one bit,
79 with the least significant bit being the last. A character can be
97 case where its first argument contains matching values in those bit
107 two such lines to specify exactly the same constant bit values. But
108 it is allowed for a line to have all the same constant bit values as
124 shifted as if that bitfield were in the least-significant bit
125 position. Thus, a single-bit field always has value 0 or 1.
163 microprocessor. This processor has 8-bit opcodes which are
201 on the value of the argument, which is assumed to be a three-bit
314 /* componentbits has a 1 bit for every possible number of strings we may want
494 fprintf(stderr, "%s: %s(%d): bit string is too long: %.*s\n",
694 fprintf(stderr, "%s: %s(%d): bit string of length %d;\n",
696 fprintf(stderr, " function %s has bit strings of length %d\n",
708 char bit;
714 bit = bitstring[nbits - 1 - i];
715 switch (bit) {
723 if (!isalpha(bit)) {
725 progname, filename, lineno, bit);
730 if (bp->name == bit) {
733 progname, filename, lineno, bit);
739 for (j = i + 1; j < nbits && bitstring[nbits - 1 - j] == bit; j++)
744 bp->name = bit;
1860 a bit that is sometimes constant and deal with those cases first.
1955 "%s: warning: variable bit(s) could be constant:\n",