| /third_party/mesa3d/src/compiler/isaspec/ |
| D | isa.py | 126 if self.type in self.isa.bitsets:
325 parent = self.isa.bitsets[self.extends]
337 parent = self.isa.bitsets[self.extends]
343 parent = self.isa.bitsets[self.extends]
352 parent = self.isa.bitsets[self.extends]
367 return self.isa.bitsets[self.extends].get_root()
428 self.bitsets = {}
471 self.bitsets[b.name] = b
477 for name, bitsets in list(self.leafs.items()):
478 for bitset in bitsets:
[all …]
|
| D | encode.py | 125 yield from self.fields(isa.bitsets[bitset.extends])
146 self.append_forced(isa.bitsets[bitset.extends])
175 yield from self.assert_cases(isa.bitsets[bitset.extends])
191 parent_bitset = isa.bitsets[bitset.extends]
243 yield from self.bitset_used_exprs(self.isa.bitsets[bitset.extends])
250 return self.extractor_impl(self.isa.bitsets[bitset.extends], name)
302 return self.resolve_simple_field(isa.bitsets[bitset.extends], name)
310 return self.encode_type(isa.bitsets[bitset.extends])
|
| D | decode.c | 308 find_bitset(struct decode_state *state, const struct isa_bitset **bitsets, in find_bitset() argument
312 for (int n = 0; bitsets[n]; n++) { in find_bitset()
313 if (state->options->gpu_id > bitsets[n]->gen.max) in find_bitset()
315 if (state->options->gpu_id < bitsets[n]->gen.min) in find_bitset()
322 BITSET_AND(m.bitset, val.bitset, bitsets[n]->mask.bitset); in find_bitset()
324 BITSET_COPY(not_dontcare.bitset, bitsets[n]->dontcare.bitset); in find_bitset()
329 if (!BITSET_EQUAL(m.bitset, bitsets[n]->match.bitset)) { in find_bitset()
340 bitsets[n]->name); in find_bitset()
344 match = bitsets[n]; in find_bitset()
464 const struct isa_bitset *b = find_bitset(scope->state, field->bitsets, val); in display_bitset_field()
|
| D | README.rst | 41 decoding/encoding is the concept of a hierarchial tree of bitsets.
49 The leaves of the tree of instruction bitsets represent every possible
54 m = (val & bitsets[n]->mask) & ~bitsets[n]->dontcare;
56 if (m == bitsets[n]->match) {
204 as different derived bitsets, at the expense of a combinatorical explosion
|
| D | decode.h | 102 const struct isa_bitset **bitsets; /* if type==BITSET */ member
|
| /third_party/mesa3d/src/freedreno/registers/ |
| D | 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:
|
| D | rules-ng-ng.txt | 337 bitsets. The <bitset> tag has the same set of attributes as <enum> tag, and
|
| /third_party/mesa3d/docs/drivers/freedreno/ |
| D | isaspec.rst | 41 decoding/encoding is the concept of a hierarchial tree of bitsets.
49 The leaves of the tree of instruction bitsets represent every possible
54 m = (val & bitsets[n]->mask) & ~bitsets[n]->dontcare;
56 if (m == bitsets[n]->match) {
204 as different derived bitsets, at the expense of a combinatorical explosion
|
| /third_party/flutter/skia/third_party/externals/angle2/doc/ |
| D | DirtyBits.md | 37 bitsets. Each 1 bit indicates a specific changed state value. We call these bitsets "*dirty bits*".
51 to scan the bitsets for 1 bits. See [`bitset_utils.h`](../src/common/bitset_utils.h) for more
|
| /third_party/skia/third_party/externals/angle2/doc/ |
| D | DirtyBits.md | 37 bitsets. Each 1 bit indicates a specific changed state value. We call these bitsets "*dirty bits*".
51 to scan the bitsets for 1 bits. See [`bitset_utils.h`](../src/common/bitset_utils.h) for more
|
| D | DebugOverlayInVulkanBackend.md | 98 * **OverlayDraw**: Using the bitsets generated by **OverlayCull**, values that
|
| /third_party/mesa3d/src/freedreno/rnn/ |
| D | headergen2.c | 488 if (db->bitsets[i]->isinline) in main()
491 for (j = 0; j < db->bitsets[i]->bitfieldsnum; j++) in main()
492 printbitfield (db->bitsets[i]->bitfields[j], 0); in main()
|
| D | rnn.h | 55 struct rnnbitset **bitsets; member
|
| D | rnn.c | 426 if (!strcmp(db->bitsets[i]->name, name)) { in parsebitset()
427 cur = db->bitsets[i]; in parsebitset()
446 ADDARRAY(db->bitsets, cur); in parsebitset()
1323 prepbitset(db, db->bitsets[i]); in rnn_prepdb()
1341 if (!strcmp(db->bitsets[i]->name, name)) in rnn_findbitset()
1342 return db->bitsets[i]; in rnn_findbitset()
|
| /third_party/rust/crates/aho-corasick/src/packed/teddy/ |
| D | README.md | 114 To cut to the chase, Teddy works by using bitsets. In particular, Teddy creates
153 the values from `B` and use them to look up our bitsets in `A`. But of course,
158 our bitsets, we can use two masks, where one mask corresponds to the lower four
169 Notice that the bitsets for each nybble correspond to the union of all
262 This will give you only the bitsets corresponding to the full match of the
|
| /third_party/vk-gl-cts/doc/testspecs/GLES31/ |
| D | functional.shaders.sample_variables.txt | 99 distinct gl_SampleMaskIn bitsets matches the number guaranteed by
|
| /third_party/mesa3d/docs/vulkan/ |
| D | graphics-state.rst | 118 that it's compact allows us to use to index bitsets.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/PowerPC/ |
| D | PPCGenMCCodeEmitter.inc | 6409 // Feature bitsets.
|
| D | PPCGenAsmMatcher.inc | 4433 // Feature bitsets.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/Mips/ |
| D | MipsGenMCCodeEmitter.inc | 9149 // Feature bitsets.
|
| D | MipsGenAsmMatcher.inc | 5113 // Feature bitsets.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/ARM/ |
| D | ARMGenMCCodeEmitter.inc | 16488 // Feature bitsets.
|
| D | ARMGenAsmMatcher.inc | 9960 // Feature bitsets.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/AArch64/ |
| D | AArch64GenMCCodeEmitter.inc | 15860 // Feature bitsets.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/X86/ |
| D | X86GenGlobalISel.inc | 456 // Feature bitsets.
|