Lines Matching defs:bits
3465 the architecture. It's 32 bits for 32 bit archs, and 64 bits for
3509 /* Count bits in bitmask. */
3524 Bitmask Size: %zu bytes %" PRIuFAST32 "%% bits set 2nd hash shift: %u\n"),
3748 /* Don't overflow, ptrdiff_t might be 32bits, but signed. */
6300 char name[REGNAMESZ], int *bits, int *type)
6306 bits ?: &ignore, type ?: &ignore);
6313 if (bits != NULL)
6314 *bits = loc != NULL ? loc->bits : 0;
6321 if (bits != NULL && *bits <= 0)
6322 *bits = loc != NULL ? loc->bits : 0;
6708 /* We did not use any of the bits after all. */
7062 the lower 32 bits. */
11932 the number of bits of w is undefined behaviour. In
11987 tv_usec is actually a 32-bit field with 32 bits of padding
12195 if (regloc->bits % 8 != 0)
12203 int bits;
12205 register_info (ebl, reg, regloc, name, &bits, &type);
12213 #define BITS(bits, xtype, sfmt, ufmt) \
12214 uint##bits##_t b##bits; int##bits##_t b##bits##s
12223 switch (bits)
12225 #define BITS(bits, xtype, sfmt, ufmt) \
12226 case bits: \
12231 sfmt, value.b##bits##s); \
12235 ufmt, value.b##bits); \
12258 assert (bits % 8 == 0);
12260 desc += bits / 8;
12261 char hex[bits / 4 + 1];
12262 hex[bits / 4] = '\0';
12266 bytes += bits / 8 - 1;
12270 for (char *h = hex; bits > 0; bits -= 8, idx += incr)
12294 int bits;
12303 * (r->regloc->bits + r->regloc->pad * 8)));
12310 return ((int) r2->bits - (int) r1->bits
12348 && a->bits == b->bits
12385 info->name, &info->bits, &info->type);