Lines Matching refs:remaining_bits
94 remaining_bits = self.max_bits - total
95 next_opcode = min_opcode + (1 << remaining_bits)
98 for M in range(0, remaining_bits):
99 op_count = 1 << (remaining_bits - M);
126 # case when M is 0 or remaining_bits, the node is a leaf.
128 if (M == 0) or (M == remaining_bits):
129 return [remaining_bits, [], 0, 0]
151 return [remaining_bits, [], 0, 0]
165 def dump_tree(self, node, base_opcode, remaining_bits, base_entry, depth):
168 child_M = remaining_bits - M
175 print ' /* [%u] -> opcode range [%u, %u], node depth %u */' % (base_entry, base_opcode, base_opcode + (1 << remaining_bits), depth)
231 self.dump_tree(child, base_opcode, remaining_bits - M, child_index, depth + 1)
234 base_opcode += 1 << (remaining_bits - M)