HomeSort by: relevance | last modified time | path
    Searched refs:bitsets (Results 1 - 8 of 8) sorted by relevancy

  /xsrc/external/mit/MesaLib/dist/src/compiler/isaspec/
decode.h 102 const struct isa_bitset **bitsets; /* if type==BITSET */ member in union:isa_field::__anon765
encode.py 117 yield from self.fields(isa.bitsets[bitset.extends])
138 self.append_forced(isa.bitsets[bitset.extends])
167 yield from self.assert_cases(isa.bitsets[bitset.extends])
183 parent_bitset = isa.bitsets[bitset.extends]
219 # expressions used in a bitset (case or field or recursively parent bitsets)
228 yield from self.bitset_used_exprs(self.isa.bitsets[bitset.extends])
235 return self.extractor_impl(self.isa.bitsets[bitset.extends], name)
287 return self.resolve_simple_field(isa.bitsets[bitset.extends], name)
295 return self.encode_type(isa.bitsets[bitset.extends])
isa.py 126 if self.type in self.isa.bitsets:
325 parent = self.isa.bitsets[self.extends]
337 parent = self.isa.bitsets[self.extends]
346 return self.isa.bitsets[self.extends].get_root()
404 # Table of all bitsets:
405 self.bitsets = {}
439 # Extract bitsets:
448 self.bitsets[b.name] = b
452 for name, bitset in self.bitsets.items():
461 for bitset_name, bitset in self.bitsets.items()
    [all...]
decode.c 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)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/freedreno/registers/
gen_header.py 298 self.bitsets = {}
360 if "type" in attrs and attrs["type"] in self.bitsets:
361 bitset = self.bitsets[attrs["type"]]
414 self.bitsets[self.current_bitset.name] = self.current_bitset
437 bitsets = []
443 bitsets.append(e)
447 for e in enums + bitsets + regs:
  /xsrc/external/mit/MesaLib/dist/src/freedreno/rnn/
rnn.h 55 struct rnnbitset **bitsets; member in struct:rnndb
headergen2.c 488 if (db->bitsets[i]->isinline)
491 for (j = 0; j < db->bitsets[i]->bitfieldsnum; j++)
492 printbitfield (db->bitsets[i]->bitfields[j], 0);
rnn.c 426 if (!strcmp(db->bitsets[i]->name, name)) {
427 cur = db->bitsets[i];
446 ADDARRAY(db->bitsets, cur);
1323 prepbitset(db, db->bitsets[i]);
1341 if (!strcmp(db->bitsets[i]->name, name))
1342 return db->bitsets[i];

Completed in 80 milliseconds