Lines Matching defs:bits
161 // Initialise empty vectors for sampled bits and pattern table.
167 uint32_t bits) {
174 compiled_node_->SetNodeForBits(bits, n->GetCompiledNode());
440 const auto& bits = GetSampledBits();
443 VIXL_ASSERT(bits.size() == GetPatternLength(pattern_table_[0].pattern));
444 for (size_t i = 0; i < bits.size(); i++) {
445 single_decode_mask |= 1U << bits[i];
448 single_decode_value |= 1U << bits[i];
499 for (uint32_t bits = 0; bits < (1U << GetSampledBitsCount()); bits++) {
501 if ((bits & matches[i].first) == matches[i].second) {
502 // Only one instruction class should match for each value of bits, so
504 VIXL_ASSERT(compiled_node_->GetNodeForBits(bits) == NULL);
505 CompileNodeForBits(decoder, String(pattern_table_[i].handler, GetAllocator().Adapter()), bits);
510 // If the decode_table_ entry for these bits is still NULL, the
513 if (compiled_node_->GetNodeForBits(bits) == NULL) {
514 CompileNodeForBits(decoder, String(otherwise, GetAllocator().Adapter()), bits);
553 // Place symbols into the field of set bits. Symbols are two bits wide and
564 // Iterate over the pattern one symbol (two bits) at a time.
575 // and the number of sampled bits.