Method remove_unreachable_code

lib/asmjit/asmjit/core/rapass.cpp:688–743

// ============================

Error BaseRAPass::remove_unreachable_code() noexcept {
  size_t num_all_blocks = block_count();
  size_t num_reachable_blocks = reachable_block_count();

  // All reachable -> nothing to do.
  if (num_all_blocks == num_reachable_blocks) {
    return Error::kOk;
  }

#ifndef ASMJIT_NO_LOGGING
  Logger* logger = logger_if(DiagnosticOptions::kRADebugUnreachable);
  String& sb = _tmp_string;
  ASMJIT_RA_LOG_FORMAT("[remove_unreachable_code - detected %zu of %zu unreachable blocks]\n", num_all_blocks - num_reachable_blocks, num_all_blocks);
#endif

  for (RABlock* block : _blocks.iterate()) {
    if (block->is_reachable()) {
      continue;
    }

    ASMJIT_RA_LOG_FORMAT("  removing code from unreachable block {%u}\n", uint32_t(block->block_id()));
    BaseNode* first = block->first();
    BaseNode* last = block->last();

    BaseNode* before_first = first->prev();
    BaseNode* after_last = last->next();

    BaseNode* node = first;
    while (node != after_last) {
      BaseNode* next = node->next();

      if (node->is_code() || node->is_removable()) {
#ifndef ASMJIT_NO_LOGGING
        if (logger) {
          sb.clear();
          Formatter::format_node(sb, _format_options, &_cb, node);
          logger->logf("    %s\n", sb.data());
        }
#endif
        cc().remove_node(node);
      }
      node = next;
    }

    if (before_first->next() == after_last) {
      block->set_first(nullptr);
      block->set_last(nullptr);
    }
    else {
      block->set_first(before_first->next());
      block->set_last(after_last->prev());
    }
  }

  return Error::kOk;
}

BaseNode* BaseRAPass::find_successor_starting_at(BaseNode* node) noexcept {