OpenHarmony-v5.0-Beta1/s

// Copyright 2022 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "src/maglev/maglev-graph-printer.h"

#include <initializer_list>
#include <iomanip>
#include <ostream>
#include <type_traits>
#include <vector>

#include "src/maglev/maglev-basic-block.h"
#include "src/maglev/maglev-graph-labeller.h"
#include "src/maglev/maglev-graph-processor.h"
#include "src/maglev/maglev-graph.h"
#include "src/maglev/maglev-ir.h"

namespace v8 {
namespace internal {
namespace maglev {

namespace {

void PrintPaddedId(std::ostream& os, MaglevGraphLabeller* graph_labeller,
                   NodeBase* node, std::string padding = " ",
                   int padding_adjustement = 0) {
  int id = graph_labeller->NodeId(node);
  int id_width = std::ceil(std::log10(id + 1));
  int max_width = graph_labeller->max_node_id_width() + 2 + padding_adjustement;
  int padding_width = std::max(0, max_width - id_width);

  for (int i = 0; i < padding_width; ++i) {
    os << padding;
  }
  os << graph_labeller->NodeId(node) << ": ";
}

void PrintPadding(std::ostream& os, int size) {
  os << std::setfill(' ') << std::setw(size) << "";
}

void PrintPadding(std::ostream& os, MaglevGraphLabeller* graph_labeller,
                  int padding_adjustement = 0) {
  PrintPadding(os,
               graph_labeller->max_node_id_width() + 2 + padding_adjustement);
}

enum ConnectionLocation {
  kTop = 1 << 0,
  kLeft = 1 << 1,
  kRight = 1 << 2,
  kBottom = 1 << 3
};

struct Connection {
  void Connect(ConnectionLocation loc) { connected |= loc; }

  void AddHorizontal() {
    Connect(kLeft);
    Connect(kRight);
  }

  void AddVertical() {
    Connect(kTop);
    Connect(kBottom);
  }

  const char* ToString() const {
    switch (connected) {
      case 0:
        return " ";
      case kTop:
        return "╵";
      case kLeft:
        return "╴";
      case kRight:
        return "╶";
      case kBottom:
        return "╷";
      case kTop | kLeft:
        return "╯";
      case kTop | kRight:
        return "╰";
      case kBottom | kLeft:
        return "╮";
      case kBottom | kRight:
        return "╭";
      case kTop | kBottom:
        return "│";
      case kLeft | kRight:
        return "─";
      case kTop | kBottom | kLeft:
        return "┤";
      case kTop | kBottom | kRight:
        return "├";
      case kLeft | kRight | kTop:
        return "┴";
      case kLeft | kRight | kBottom:
        return "┬";
      case kTop | kLeft | kRight | kBottom:
        return "┼";
    }
    UNREACHABLE();
  }

  uint8_t connected = 0;
};

std::ostream& operator<<(std::ostream& os, const Connection& c) {
  return os << c.ToString();
}

// Print the vertical parts of connection arrows, optionally connecting arrows
// that were only first created on this line (passed in "arrows_starting_here")
// and should therefore connect rightwards instead of upwards.
void PrintVerticalArrows(
    std::ostream& os, const std::vector<BasicBlock*>& targets,
    const std::set<size_t>& arrows_starting_here = {},
    const std::set<BasicBlock*>& targets_starting_here = {},
    bool is_loop = false) {
  bool saw_start = false;
  for (size_t i = 0; i < targets.size(); ++i) {
    Connection c;
    if (saw_start) {
      c.AddHorizontal();
    }
    if (arrows_starting_here.find(i) != arrows_starting_here.end() ||
        targets_starting_here.find(targets[i]) != targets_starting_here.end()) {
      c.Connect(kRight);
      c.Connect(is_loop ? kTop : kBottom);
      saw_start = true;
    }

    // Only add the vertical connection if there was no other connection.
    if (c.connected == 0 && targets[i] != nullptr) {
      c.AddVertical();
    }
    os << c;
  }
}

// Add a target to the target list in the first non-null position from the end.
// This might have to extend the target list if there is no free spot.
size_t AddTarget(std::vector<BasicBlock*>& targets, BasicBlock* target) {
  if (targets.size() == 0 || targets.back() != nullptr) {
    targets.push_back(target);
    return targets.size() - 1;
  }

  size_t i = targets.size();
  while (i > 0) {
    if (targets[i - 1] != nullptr) break;
    i--;
  }
  targets[i] = target;
  return i;
}

// If the target is not a fallthrough, add i to the target list in the first
// non-null position from the end. This might have to extend the target list if
// there is no free spot. Returns true if it was added, false if it was a
// fallthrough.
bool AddTargetIfNotNext(std::vector<BasicBlock*>& targets, BasicBlock* target,
                        BasicBlock* next_block,
                        std::set<size_t>* arrows_starting_here = nullptr) {
  if (next_block == target) return false;
  size_t index = AddTarget(targets, target);
  if (arrows_starting_here != nullptr) arrows_starting_here->insert(index);
  return true;
}

class MaglevPrintingVisitorOstream : public std::ostream,
                                     private std::streambuf {
 public:
  MaglevPrintingVisitorOstream(std::ostream& os,
                               std::vector<BasicBlock*>* targets)
      : std::ostream(this), os_(os), targets_(targets), padding_size_(0) {}
  ~MaglevPrintingVisitorOstream() override = default;

  static MaglevPrintingVisitorOstream* cast(
      const std::unique_ptr<std::ostream>& os) {
    return static_cast<MaglevPrintingVisitorOstream*>(os.get());
  }

  void set_padding(int padding_size) { padding_size_ = padding_size; }

 protected:
  int overflow(int c) override;

 private:
  std::ostream& os_;
  std::vector<BasicBlock*>* targets_;
  int padding_size_;
  bool previous_was_new_line_ = true;
};

int MaglevPrintingVisitorOstream::overflow(int c) {
  if (c == EOF) return c;

  if (previous_was_new_line_) {
    PrintVerticalArrows(os_, *targets_);
    PrintPadding(os_, padding_size_);
  }
  os_.rdbuf()->sputc(c);
  previous_was_new_line_ = (c == '\n');
  return c;
}

}  // namespace

MaglevPrintingVisitor::MaglevPrintingVisitor(std::ostream& os)
    : os_(os),
      os_for_additional_info_(
          new MaglevPrintingVisitorOstream(os_, &targets_)) {}

void MaglevPrintingVisitor::PreProcessGraph(
    MaglevCompilationUnit* compilation_unit, Graph* graph) {
  os_ << "Graph (param count: " << compilation_unit->parameter_count()
      << ", frame size: " << compilation_unit->register_count() << ")\n\n";

  for (BasicBlock* block : *graph) {
    if (block->control_node()->Is<JumpLoop>()) {
      loop_headers_.insert(block->control_node()->Cast<JumpLoop>()->target());
    }
  }

  // Precalculate the maximum number of targets.
  for (BlockConstIterator block_it = graph->begin(); block_it != graph->end();
       ++block_it) {
    BasicBlock* block = *block_it;
    std::replace(targets_.begin(), targets_.end(), block,
                 static_cast<BasicBlock*>(nullptr));

    if (loop_headers_.find(block) != loop_headers_.end()) {
      AddTarget(targets_, block);
    }
    ControlNode* node = block->control_node();
    if (node->Is<JumpLoop>()) {
      BasicBlock* target = node->Cast<JumpLoop>()->target();
      std::replace(targets_.begin(), targets_.end(), target,
                   static_cast<BasicBlock*>(nullptr));
    } else if (node->Is<UnconditionalControlNode>()) {
      AddTargetIfNotNext(targets_,
                         node->Cast<UnconditionalControlNode>()->target(),
                         *(block_it + 1));
    } else if (node->Is<ConditionalControlNode>()) {
      AddTargetIfNotNext(targets_,
                         node->Cast<ConditionalControlNode>()->if_true(),
                         *(block_it + 1));
      AddTargetIfNotNext(targets_,
                         node->Cast<ConditionalControlNode>()->if_false(),
                         *(block_it + 1));
    }
  }
  DCHECK(std::all_of(targets_.begin(), targets_.end(),
                     [](BasicBlock* block) { return block == nullptr; }));
}

void MaglevPrintingVisitor::PreProcessBasicBlock(
    MaglevCompilationUnit* compilation_unit, BasicBlock* block) {
  MaglevGraphLabeller* graph_labeller = compilation_unit->graph_labeller();

  size_t loop_position = static_cast<size_t>(-1);
  if (loop_headers_.erase(block) > 0) {
    loop_position = AddTarget(targets_, block);
  }
  {
    bool saw_start = false;
    for (size_t i = 0; i < targets_.size(); ++i) {
      Connection c;
      if (saw_start) {
        c.AddHorizontal();
      }
      // If this is one of the arrows pointing to this block, terminate the
      // line by connecting it rightwards.
      if (targets_[i] == block) {
        c.Connect(kRight);
        // If this is the loop header, go down instead of up and don't clear
        // the target.
        if (i == loop_position) {
          c.Connect(kBottom);
        } else {
          c.Connect(kTop);
          targets_[i] = nullptr;
        }
        saw_start = true;
      } else if (c.connected == 0 && targets_[i] != nullptr) {
        // If this is another arrow, connect it, but only if that doesn't
        // clobber any existing drawing.
        c.AddVertical();
      }
      os_ << c;
    }
    os_ << (saw_start ? "►" : " ");
  }

  int block_id = graph_labeller->BlockId(block);
  os_ << "Block b" << block_id << "\n";

  MaglevPrintingVisitorOstream::cast(os_for_additional_info_)->set_padding(1);
}

namespace {

template <typename NodeT>
void PrintEagerDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
                     NodeT* node, const ProcessingState& state) {
  MaglevGraphLabeller* graph_labeller = state.graph_labeller();

  PrintVerticalArrows(os, targets);
  PrintPadding(os, graph_labeller, 0);

  EagerDeoptInfo* deopt_info = node->eager_deopt_info();
  os << "  ↱ eager @" << deopt_info->state.bytecode_position << " : {";
  bool first = true;
  int index = 0;
  deopt_info->state.register_frame->ForEachValue(
      *state.compilation_unit(),
      [&](ValueNode* node, interpreter::Register reg) {
        if (first) {
          first = false;
        } else {
          os << ", ";
        }
        os << reg.ToString() << ":" << PrintNodeLabel(graph_labeller, node)
           << ":" << deopt_info->input_locations[index].operand();
        index++;
      });
  os << "}\n";
}
void MaybePrintEagerDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
                          NodeBase* node, const ProcessingState& state) {
  switch (node->opcode()) {
#define CASE(Name)                                                   \
  case Opcode::k##Name:                                              \
    if constexpr (Name::kProperties.can_eager_deopt()) {             \
      PrintEagerDeopt<Name>(os, targets, node->Cast<Name>(), state); \
    }                                                                \
    break;
    NODE_BASE_LIST(CASE)
#undef CASE
  }
}

template <typename NodeT>
void PrintLazyDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
                    NodeT* node, const ProcessingState& state) {
  MaglevGraphLabeller* graph_labeller = state.graph_labeller();

  PrintVerticalArrows(os, targets);
  PrintPadding(os, graph_labeller, 0);

  LazyDeoptInfo* deopt_info = node->lazy_deopt_info();
  os << "  ↳ lazy @" << deopt_info->state.bytecode_position << " : {";
  bool first = true;
  int index = 0;
  deopt_info->state.register_frame->ForEachValue(
      *state.compilation_unit(),
      [&](ValueNode* node, interpreter::Register reg) {
        if (first) {
          first = false;
        } else {
          os << ", ";
        }
        os << reg.ToString() << ":";
        if (reg == deopt_info->result_location) {
          os << "<result>";
        } else {
          os << PrintNodeLabel(graph_labeller, node) << ":"
             << deopt_info->input_locations[index].operand();
        }
        index++;
      });
  os << "}\n";
}
void MaybePrintLazyDeopt(std::ostream& os, std::vector<BasicBlock*> targets,
                         NodeBase* node, const ProcessingState& state) {
  switch (node->opcode()) {
#define CASE(Name)                                                  \
  case Opcode::k##Name:                                             \
    if constexpr (Name::kProperties.can_lazy_deopt()) {             \
      PrintLazyDeopt<Name>(os, targets, node->Cast<Name>(), state); \
    }                                                               \
    break;
    NODE_BASE_LIST(CASE)
#undef CASE
  }
}

}  // namespace

void MaglevPrintingVisitor::Process(Phi* phi, const ProcessingState& state) {
  MaglevGraphLabeller* graph_labeller = state.graph_labeller();

  PrintVerticalArrows(os_, targets_);
  PrintPaddedId(os_, graph_labeller, phi);
  os_ << "Phi (";
  // Manually walk Phi inputs to print just the node labels, without
  // input locations (which are shown in the predecessor block's gap
  // moves).
  for (int i = 0; i < phi->input_count(); ++i) {
    if (i > 0) os_ << ", ";
    if (state.block()->predecessor_at(i) == nullptr) {
      os_ << "<dead>";
    } else {
      os_ << PrintNodeLabel(graph_labeller, phi->input(i).node());
    }
  }
  os_ << ") → " << phi->result().operand() << "\n";

  MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
      ->set_padding(graph_labeller->max_node_id_width() + 4);
}

void MaglevPrintingVisitor::Process(Node* node, const ProcessingState& state) {
  MaglevGraphLabeller* graph_labeller = state.graph_labeller();

  MaybePrintEagerDeopt(os_, targets_, node, state);

  PrintVerticalArrows(os_, targets_);
  PrintPaddedId(os_, graph_labeller, node);
  os_ << PrintNode(graph_labeller, node) << "\n";

  MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
      ->set_padding(graph_labeller->max_node_id_width() + 4);

  MaybePrintLazyDeopt(os_, targets_, node, state);
}

void MaglevPrintingVisitor::Process(ControlNode* control_node,
                                    const ProcessingState& state) {
  MaglevGraphLabeller* graph_labeller = state.graph_labeller();

  MaybePrintEagerDeopt(os_, targets_, control_node, state);

  bool has_fallthrough = false;

  if (control_node->Is<JumpLoop>()) {
    BasicBlock* target = control_node->Cast<JumpLoop>()->target();

    PrintVerticalArrows(os_, targets_, {}, {target}, true);
    os_ << "◄─";
    PrintPaddedId(os_, graph_labeller, control_node, "─", -2);
    std::replace(targets_.begin(), targets_.end(), target,
                 static_cast<BasicBlock*>(nullptr));

  } else if (control_node->Is<UnconditionalControlNode>()) {
    BasicBlock* target =
        control_node->Cast<UnconditionalControlNode>()->target();

    std::set<size_t> arrows_starting_here;
    has_fallthrough |= !AddTargetIfNotNext(targets_, target, state.next_block(),
                                           &arrows_starting_here);
    PrintVerticalArrows(os_, targets_, arrows_starting_here);
    PrintPaddedId(os_, graph_labeller, control_node,
                  has_fallthrough ? " " : "─");

  } else if (control_node->Is<ConditionalControlNode>()) {
    BasicBlock* true_target =
        control_node->Cast<ConditionalControlNode>()->if_true();
    BasicBlock* false_target =
        control_node->Cast<ConditionalControlNode>()->if_false();

    std::set<size_t> arrows_starting_here;
    has_fallthrough |= !AddTargetIfNotNext(
        targets_, false_target, state.next_block(), &arrows_starting_here);
    has_fallthrough |= !AddTargetIfNotNext(
        targets_, true_target, state.next_block(), &arrows_starting_here);
    PrintVerticalArrows(os_, targets_, arrows_starting_here);
    PrintPaddedId(os_, graph_labeller, control_node, "─");

  } else {
    PrintVerticalArrows(os_, targets_);
    PrintPaddedId(os_, graph_labeller, control_node);
  }

  os_ << PrintNode(graph_labeller, control_node) << "\n";

  bool printed_phis = false;
  if (control_node->Is<UnconditionalControlNode>()) {
    BasicBlock* target =
        control_node->Cast<UnconditionalControlNode>()->target();
    if (target->has_phi()) {
      printed_phis = true;
      PrintVerticalArrows(os_, targets_);
      PrintPadding(os_, graph_labeller, -1);
      os_ << (has_fallthrough ? "│" : " ");
      os_ << "  with gap moves:\n";
      int pid = state.block()->predecessor_id();
      for (Phi* phi : *target->phis()) {
        PrintVerticalArrows(os_, targets_);
        PrintPadding(os_, graph_labeller, -1);
        os_ << (has_fallthrough ? "│" : " ");
        os_ << "    - ";
        graph_labeller->PrintInput(os_, phi->input(pid));
        os_ << " → " << graph_labeller->NodeId(phi) << ": Phi "
            << phi->result().operand() << "\n";
      }
    }
  }

  PrintVerticalArrows(os_, targets_);
  if (has_fallthrough) {
    PrintPadding(os_, graph_labeller, -1);
    if (printed_phis) {
      os_ << "▼";
    } else {
      os_ << "↓";
    }
  }
  os_ << "\n";

  // TODO(leszeks): Allow MaglevPrintingVisitorOstream to print the arrowhead
  // so that it overlaps the fallthrough arrow.
  MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
      ->set_padding(graph_labeller->max_node_id_width() + 4);
}

void PrintGraph(std::ostream& os, MaglevCompilationUnit* compilation_unit,
                Graph* const graph) {
  GraphProcessor<MaglevPrintingVisitor> printer(compilation_unit, os);
  printer.ProcessGraph(graph);
}

void PrintNode::Print(std::ostream& os) const {
  node_->Print(os, graph_labeller_);
}

std::ostream& operator<<(std::ostream& os, const PrintNode& printer) {
  printer.Print(os);
  return os;
}

void PrintNodeLabel::Print(std::ostream& os) const {
  graph_labeller_->PrintNodeLabel(os, node_);
}

std::ostream& operator<<(std::ostream& os, const PrintNodeLabel& printer) {
  printer.Print(os);
  return os;
}

}  // namespace maglev
}  // namespace internal
}  // namespace v8