Lines Matching defs:mask
33 the match/dontcare/mask bitmasks. The following
37 (match || dontcare) == mask
39 For a leaf node, the mask should be (1 << size) - 1
45 self.mask = bitset.mask
52 p.mask = p.mask | self.mask
57 return self.match | self.dontcare | self.mask | self.field_mask
73 mask = ((1 << (1 + high - low)) - 1) << low
79 assert not is_defined_bits(mask), "Redefined bits in {} {}: {}..{}".format(xml.tag, name, low, high);
94 dbg("{}: {}.{} => {:016x} / {:016x} / {:016x}".format(xml.tag, name, patstr, match << low, dontcare << low, mask))
96 return match << low, dontcare << low, mask
130 def mask(self):
149 match, dontcare, mask = extract_pattern(xml, case.bitset.name)
276 # Collect up the match/dontcare/mask bitmasks for
280 self.mask = 0
287 return ((self.field_mask | self.mask | self.dontcare | self.match) & m) != 0
290 m = field.mask()
298 m = field.mask()
317 match, dontcare, mask = extract_pattern(pattern, self.name, is_defined_bits)
321 self.mask |= mask
522 assert ((pat.mask | pat.field_mask) == (1 << sz) - 1), "leaf bitset {} has undefined bits: {:x}".format(
523 bitset.name, ~(pat.mask | pat.field_mask) & ((1 << sz) - 1))
556 mask, parts = (1 << bitsize) - 1, []
560 parts.append(hex(value & mask))