Lines Matching defs:bitno
58 unsigned int bitno;
190 node->bitno = -1;
208 Store the bit number in BITTREE->BITNO if the division succeeds. If unable
229 unsigned int bitno;
287 bitno = 0;
288 while (!(mask_and & (1 << bitno)))
289 ++bitno;
290 bitmask = (1 << bitno);
293 printf ("use bit %d\n", bitno);
296 bittree->bitno = bitno;
324 /* If BITNO can NOT divide the opcode group, try next bit. */
417 indented_print (indent, "if (((word >> %d) & 0x1) == 0)\n", bittree->bitno);
419 pattern[bittree->bitno] = '0';
424 pattern[bittree->bitno] = '1';
427 pattern[bittree->bitno] = 'x';
