Lines Matching refs:bitsets
44 * The set of leaf node bitsets in the bitset hiearchy which defines all
58 * bitsets, where half/fullness is determined by fields outset if bitset
308 find_bitset(struct decode_state *state, const struct isa_bitset **bitsets,
312 for (int n = 0; bitsets[n]; n++) {
313 if (state->options->gpu_id > bitsets[n]->gen.max)
315 if (state->options->gpu_id < bitsets[n]->gen.min)
318 // m = (val & bitsets[n]->mask) & ~bitsets[n]->dontcare;
322 BITSET_AND(m.bitset, val.bitset, bitsets[n]->mask.bitset);
324 BITSET_COPY(not_dontcare.bitset, bitsets[n]->dontcare.bitset);
329 if (!BITSET_EQUAL(m.bitset, bitsets[n]->match.bitset)) {
340 bitsets[n]->name);
344 match = bitsets[n];
464 const struct isa_bitset *b = find_bitset(scope->state, field->bitsets, val);