/** * Copyright 2019-2021 Huawei Technologies Co., Ltd * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include "debug/anf_ir_dump.h" #if defined(_WIN32) || defined(_WIN64) #include #endif #include #include #include #include #include "ir/primitive.h" #include "ir/func_graph.h" #include "runtime/device/kernel_info.h" #include "ir/graph_utils.h" #include "backend/session/anf_runtime_algorithm.h" #include "frontend/parallel/ops_info/operator_info.h" #include "pipeline/jit/base.h" #include "debug/common.h" #include "debug/trace.h" #include "utils/trace_base.h" namespace mindspore { const std::string ToShortString(const TypeId &typeId) { std::string label = TypeIdLabel(typeId); std::string prefix = "kNumberType"; if (prefix.length() > label.length()) { return label; } auto position = label.find(prefix); // position is 0 when label begins with prefix if (position != 0) { return label; } auto sub_position = position + prefix.length(); if (sub_position >= label.length()) { return label; } return label.substr(sub_position); } void PrintKernelFormatAndType(std::ostringstream &buffer, const std::string &fmt, const TypeId &type, const std::vector &shape) { buffer << "<" << ToShortString(type); if (!fmt.empty()) { buffer << "x" << fmt << shape; } buffer << ">"; } void PrintNodeOutputType(std::ostringstream &buffer, const AnfNodePtr &nd) { if (nd == nullptr) { return; } abstract::ShapePtr shape = dyn_cast(nd->Shape()); TypePtr type = dyn_cast(nd->Type()); if ((nullptr != shape) && (nullptr != type)) { buffer << "<" << type << "x" << shape->shape() << ">"; } else if (nullptr != type) { buffer << "<" << type << ">"; } else { buffer << ""; } } void PrintNodeInputType(std::ostringstream &buffer, const AnfNodePtr &nd) { if (nd == nullptr) { return; } const auto &inputs = GetInputs(nd); size_t len = inputs.size(); if (len > 1) { // skip inputs[0] which is Primitive value node for (size_t i = 1; i < len; ++i) { AnfNodePtr in = inputs[i]; if (i != 1) { buffer << ", "; } PrintNodeOutputType(buffer, in); } } } void PrintInputAndOutputInferType(std::ostringstream &buffer, const AnfNodePtr &nd) { buffer << " : ("; PrintNodeInputType(buffer, nd); buffer << ") -> ("; PrintNodeOutputType(buffer, nd); buffer << ")"; } struct SubGraphIRInfo { int32_t local_var; std::ostringstream buffer; OrderedMap local_var_map; }; void DumpGlobalInfoEntry(const FuncGraphPtr &graph, std::ostringstream &buffer) { if (graph == nullptr) { return; } buffer << "#IR entry : @" << graph->ToString() << "." << graph->debug_info()->get_id() << std::endl; buffer << "#attrs :" << std::endl; for (const auto &attr : graph->attrs()) { buffer << attr.first << " : "; if (attr.second->isa()) { buffer << GetValue(attr.second); } else if (attr.second->isa()) { buffer << GetValue(attr.second); } buffer << std::endl; } } void DumpKernelInfo(const CNodePtr &node, const std::shared_ptr &gsub) { if (node == nullptr || gsub == nullptr) { return; } auto kernel_info = node->kernel_info(); if (kernel_info == nullptr || !kernel_info->has_build_info()) { return; } gsub->buffer << " : ("; size_t input_num = AnfAlgo::GetInputTensorNum(node); for (size_t i = 0; i < input_num; ++i) { if (i != 0) { gsub->buffer << ", "; } auto format = AnfAlgo::GetInputFormat(node, i); auto type = AnfAlgo::GetInputDeviceDataType(node, i); auto shape = AnfAlgo::GetInputDeviceShape(node, i); PrintKernelFormatAndType(gsub->buffer, format, type, shape); } gsub->buffer << ") -> ("; size_t output_num = AnfAlgo::GetOutputTensorNum(node); for (size_t i = 0; i < output_num; ++i) { if (i != 0) { gsub->buffer << ", "; } auto format = AnfAlgo::GetOutputFormat(node, i); auto type = AnfAlgo::GetOutputDeviceDataType(node, i); auto shape = AnfAlgo::GetOutputDeviceShape(node, i); PrintKernelFormatAndType(gsub->buffer, format, type, shape); } gsub->buffer << ")"; gsub->buffer << std::endl; } int32_t DumpParams(const FuncGraphPtr &graph, std::ostringstream &buffer, OrderedMap *para_map) { if (graph == nullptr) { MS_LOG(INFO) << "Param graph is nullptr."; return 0; } std::vector parameters = graph->parameters(); buffer << "#Total params : " << parameters.size() << std::endl; buffer << std::endl; // dump parameters int32_t para = 1; for (const auto &p : parameters) { if (p == nullptr) { continue; } auto parameter_ptr = p->cast(); if (parameter_ptr == nullptr) { MS_LOG(EXCEPTION) << "p cannot cast to ParameterPtr"; } buffer << "%para" << para << "_" << parameter_ptr->name() << " : "; // print parameters' type and shape PrintNodeOutputType(buffer, p); auto kernel_info = p->kernel_info(); if (kernel_info != nullptr && kernel_info->has_build_info()) { buffer << " : "; auto type = AnfAlgo::GetOutputDeviceDataType(p, 0); auto format = AnfAlgo::GetOutputFormat(p, 0); auto shape = AnfAlgo::GetOutputDeviceShape(p, 0); PrintKernelFormatAndType(buffer, format, type, shape); buffer << " : IsWeight:" << std::boolalpha << AnfAlgo::IsParameterWeight(parameter_ptr); } buffer << std::endl; if (para_map != nullptr) { (*para_map)[p] = para++; } MS_LOG(DEBUG) << "Record param: " << p->ToString() << " graph belong : " << p->func_graph()->ToString(); } return para; } void DumpOperator(const AnfNodePtr &op, const std::shared_ptr &gsub) { if (op == nullptr) { MS_LOG(INFO) << "Param op is nullptr"; return; } if (gsub == nullptr) { MS_LOG(INFO) << "Param gsub is nullptr"; return; } if (IsValueNode(op)) { FuncGraphPtr fg = GetValueNode(op); if (fg != nullptr) { gsub->buffer << "call @" << fg->ToString() << "." << fg->debug_info()->get_id(); } } else if (op->isa()) { if (gsub->local_var_map.find(op) != gsub->local_var_map.end()) { gsub->buffer << "%" << gsub->local_var_map[op]; } else { auto node = op->cast(); auto fg = node->func_graph(); gsub->buffer << "$(" << fg->ToString() << "." << fg->debug_info()->get_id() << ":" << node->ToString() << ")"; } } else if (op->isa()) { gsub->buffer << GetValueNode(op)->ToString(); } else { gsub->buffer << op->ToString(); } } void DumpOperands(const AnfNodePtr &nd, OrderedMap *para_map, const std::shared_ptr &gsub) { if (nd == nullptr || para_map == nullptr || gsub == nullptr) { return; } gsub->buffer << "("; const auto &inputs = GetInputs(nd); size_t len = inputs.size(); if (len > 1) { // skip inputs[0] which is Primitive valuenode for (size_t i = 1; i < len; ++i) { AnfNodePtr in = inputs[i]; MS_EXCEPTION_IF_NULL(in); if (i != 1) { gsub->buffer << ", "; } if (in->isa()) { if (!(*para_map)[in]) { gsub->buffer << "%para_" << in->ToString(); } else { gsub->buffer << "%para" << (*para_map)[in] << "_" << in->ToString(); } } else if (in->isa()) { if (gsub->local_var_map.find(in) != gsub->local_var_map.end()) { gsub->buffer << "%" << gsub->local_var_map[in]; } else { auto node = in->cast(); auto fg = node->func_graph(); gsub->buffer << "$(" << fg->ToString() << "." << fg->debug_info()->get_id() << ":" << node->ToString() << ")"; } } else if (in->isa() && !IsValueNode(in)) { // non Primitive valuenode gsub->buffer << GetValueNode(in)->ToString(); } else if (IsValueNode(in)) { FuncGraphPtr fg = GetValueNode(in); gsub->buffer << "@" << fg->ToString() << "." << fg->debug_info()->get_id(); } else { gsub->buffer << in->ToString(); } } } gsub->buffer << ")"; } void DumpParallelInfo(const CNodePtr &node, const std::shared_ptr &gsub) { if ((node == nullptr) || (gsub == nullptr)) { return; } auto operator_info = node->user_data(); if (operator_info == nullptr) { return; } auto strategy = operator_info->strategy(); if (strategy == nullptr) { return; } ValuePtr temp = MakeValue(strategy->GetInputDim()); gsub->buffer << " { strategy: "; gsub->buffer << temp->ToString(); gsub->buffer << " }"; } void DumpOperateAttrs(const AnfNodePtr &op, const std::shared_ptr &gsub) { if (op == nullptr || gsub == nullptr) { return; } if (IsValueNode(op)) { PrimitivePtr primitive = GetValueNode(op); if (!primitive->instance_name().empty()) { gsub->buffer << " {"; gsub->buffer << "instance name" << ": "; gsub->buffer << primitive->instance_name(); gsub->buffer << "}"; } auto attrs = primitive->attrs(); if (!attrs.empty()) { gsub->buffer << " primitive_attrs: {"; int i = 0; for (const auto &attr : attrs) { if (attr.first == PARALLEL_STRATEGY) { continue; // skip the strategy } if (i++ != 0) { gsub->buffer << ", "; } gsub->buffer << attr.first << ": "; if (attr.second == nullptr) { gsub->buffer << "null"; } else { gsub->buffer << attr.second->ToString(); } } gsub->buffer << "}"; } } } void DumpCNodeAttrs(const CNodePtr &op, const std::shared_ptr &gsub) { if (op == nullptr || gsub == nullptr) { return; } if (op->attrs().empty()) { gsub->buffer << std::endl; return; } auto attrs = op->attrs(); gsub->buffer << " cnode_attrs: {"; int i = 0; for (const auto &attr : attrs) { if (i++ != 0) { gsub->buffer << ", "; } gsub->buffer << attr.first << ": "; if (attr.second == nullptr) { gsub->buffer << "null"; } else { gsub->buffer << attr.second->ToString(); } } gsub->buffer << "}"; gsub->buffer << std::endl; } void DumpShape(const AnfNodePtr &nd, const FuncGraphPtr &sub_graph, const std::shared_ptr &gsub) { if (nd == nullptr || sub_graph == nullptr || gsub == nullptr) { return; } if (nd != sub_graph->get_return()) { gsub->buffer << " : ("; PrintNodeInputType(gsub->buffer, nd); gsub->buffer << ") -> ("; PrintNodeOutputType(gsub->buffer, nd); gsub->buffer << ")"; } else { gsub->buffer << " : ("; PrintNodeInputType(gsub->buffer, nd); gsub->buffer << ")"; } gsub->buffer << std::endl; } void DumpCNode(const CNodePtr &nd, const FuncGraphPtr &sub_graph, OrderedMap *const para_map, const std::shared_ptr &gsub, bool dump_full_name = false, LocDumpMode dump_location = kOff) { if (nd == nullptr || sub_graph == nullptr || para_map == nullptr || gsub == nullptr) { return; } if (nd != sub_graph->get_return()) { gsub->buffer << " %" << gsub->local_var << "(" << nd->ToString() << ")" << " = "; gsub->local_var_map[nd] = gsub->local_var++; } else { gsub->buffer << " "; } if (nd->inputs().empty()) { MS_LOG(EXCEPTION) << "Input of apply node is empty"; } // print operator AnfNodePtr op = nd->input(0); DumpOperator(op, gsub); // print operands DumpOperands(nd, para_map, gsub); // print operator attrs DumpOperateAttrs(op, gsub); // print cnode attrs DumpCNodeAttrs(nd, gsub); // print parallel info DumpParallelInfo(nd, gsub); // print shape info DumpShape(nd, sub_graph, gsub); // print kernel info DumpKernelInfo(nd, gsub); if (dump_full_name) { gsub->buffer << " : (" << nd->fullname_with_scope() << ")" << std::endl; } if (dump_location == kTopStack) { if (label_manage::GetGlobalTraceLabelType() == label_manage::TraceLabelType::kWithUniqueId) { gsub->buffer << trace::GetDebugInfo(nd->debug_info(), " # ", kSourceLineTipDiscard) << "#" << label_manage::Label(nd->debug_info()) << "\n"; } else { gsub->buffer << trace::GetDebugInfo(nd->debug_info(), " # ", kSourceLineTipDiscard) << "\n"; } } else if (dump_location == kWholeStack) { auto traces = mindspore::trace::GetSourceLineList(nd); for (auto &trace : traces) { gsub->buffer << " # " << trace; } } } void DumpIRInSubgraph(const std::vector &nodes, OrderedMap *para_map, OrderedMap> *const sub_graphs, int32_t total_para, bool dump_full_name = false, LocDumpMode dump_location = kOff) { if (para_map == nullptr || sub_graphs == nullptr) { return; } for (const auto &nd : nodes) { MS_EXCEPTION_IF_NULL(nd); FuncGraphPtr sub_graph = nd->func_graph(); if (sub_graph == nullptr) { MS_LOG(DEBUG) << "Node[" << nd->ToString() << "] belongs to no graph!"; continue; } std::shared_ptr gsub = (*sub_graphs)[sub_graph]; if (gsub == nullptr) { gsub = std::make_shared(); gsub->local_var = 0; (*sub_graphs)[sub_graph] = gsub; } std::vector parameters = sub_graph->parameters(); for (size_t idx = 0; idx < parameters.size(); idx++) { MS_EXCEPTION_IF_NULL(parameters[idx]); if ((*para_map).count(parameters[idx]) == 0) { (*para_map)[parameters[idx]] = total_para++; } } if (!nd->isa()) { if (nd->isa()) { // print and record output of operator if it is not 'Return' DumpCNode(nd->cast(), sub_graph, para_map, gsub, dump_full_name, dump_location); } else { gsub->buffer << " " << nd->ToString() << std::endl; } } } } void DumpSubgraph(const OrderedMap> *sub_graphs, const FuncGraphPtr &graph, OrderedMap *para_map, std::ofstream &fout) { if (sub_graphs == nullptr || graph == nullptr) { return; } fout << "#Total subgraph : " << sub_graphs->size() << std::endl; fout << std::endl; for (const auto &sg : *sub_graphs) { fout << "subgraph attr:" << std::endl; MS_EXCEPTION_IF_NULL(sg.first); for (const auto &attr : sg.first->attrs()) { fout << attr.first << " : "; if (attr.second->isa()) { fout << GetValue(attr.second); } else if (attr.second->isa()) { fout << GetValue(attr.second); } fout << std::endl; } fout << "subgraph @" << sg.first->ToString() << "."; fout << sg.first->debug_info()->get_id() << "("; if (sg.first != graph) { std::vector parameters = sg.first->parameters(); if (parameters.size() == 1) { MS_EXCEPTION_IF_NULL(parameters[0]); fout << "%para" << (*para_map)[parameters[0]] << "_" << parameters[0]->ToString(); } else if (parameters.size() > 1) { for (size_t idx = 0; idx < parameters.size() - 1; idx++) { MS_EXCEPTION_IF_NULL(parameters[idx]); fout << "%para" << (*para_map)[parameters[idx]] << "_" << parameters[idx]->ToString(); fout << ", "; } MS_EXCEPTION_IF_NULL(parameters[parameters.size() - 1]); fout << "%para" << (*para_map)[parameters[parameters.size() - 1]] << "_" << parameters[parameters.size() - 1]->ToString(); } } fout << ") {" << std::endl; MS_EXCEPTION_IF_NULL(sg.second); fout << sg.second->buffer.str(); fout << "}" << std::endl; fout << std::endl; } } std::string AddGlobalId(const std::string &filename) { static size_t g_id = 0; std::ostringstream s; auto i = filename.rfind(".ir"); if (i >= filename.size()) { s << filename; s << "_" << std::setfill('0') << std::setw(4) << g_id; } else { s << filename.substr(0, i); s << "_" << std::setfill('0') << std::setw(4) << g_id; if (i + 1 < filename.size()) { s << filename.substr(i); } } ++g_id; return s.str(); } void GetEnvDumpIrLineLevel(LocDumpMode *dump_location) { static std::unordered_map dump_level_map = { {std::to_string(kOff), kOff}, {std::to_string(kTopStack), kTopStack}, {std::to_string(kWholeStack), kWholeStack}}; static auto dump_level_in_env = common::GetEnv("ENV_DUMP_IR_LINE_LEVEL"); auto it = dump_level_map.find(dump_level_in_env); if (it == dump_level_map.end()) { return; } // Use the env setting instead parameter setting. *dump_location = it->second; } #ifdef ENABLE_DUMP_IR void DumpIR(const std::string &filename, const FuncGraphPtr &graph, bool dump_full_name, LocDumpMode dump_location, const std::string &target_file) { GetEnvDumpIrLineLevel(&dump_location); if (graph == nullptr) { return; } auto path = pipeline::GetSaveGraphsPathName(AddGlobalId(filename)); if (!target_file.empty()) { path = target_file; } auto realpath = Common::GetRealPath(path); if (!realpath.has_value()) { MS_LOG(ERROR) << "Get real path failed. path=" << path; return; } ChangeFileMode(realpath.value(), S_IRWXU); std::ofstream fout(realpath.value()); std::ostringstream buffer; if (!fout.is_open()) { MS_LOG(ERROR) << "Open dump file '" << realpath.value() << "' failed!"; return; } auto nodes = TopoSort(graph->get_return(), SuccDeeperSimple, AlwaysInclude); OrderedMap para_map; // dump global info DumpGlobalInfoEntry(graph, buffer); int32_t total_para = DumpParams(graph, buffer, ¶_map); OrderedMap> sub_graphs; // dump ir in each sub graph DumpIRInSubgraph(nodes, ¶_map, &sub_graphs, total_para, dump_full_name, dump_location); // output global info fout << buffer.str() << std::endl; // output each sub graph DumpSubgraph(&sub_graphs, graph, ¶_map, fout); fout.close(); // set file mode to read only by user ChangeFileMode(realpath.value(), S_IRUSR); } void DumpIRForRDR(const std::string &filename, const FuncGraphPtr &graph, bool dump_full_name, LocDumpMode dump_location) { GetEnvDumpIrLineLevel(&dump_location); if (graph == nullptr) { return; } auto path = AddGlobalId(filename); auto realpath = Common::GetRealPath(path); if (!realpath.has_value()) { MS_LOG(ERROR) << "Get real path failed. path=" << path; return; } ChangeFileMode(realpath.value(), S_IRWXU); std::ofstream fout(realpath.value()); std::ostringstream buffer; if (!fout.is_open()) { MS_LOG(ERROR) << "Open dump file '" << realpath.value() << "' failed!"; return; } auto nodes = TopoSort(graph->get_return(), SuccDeeperSimple, AlwaysInclude); OrderedMap para_map; // dump global info DumpGlobalInfoEntry(graph, buffer); int32_t total_para = DumpParams(graph, buffer, ¶_map); OrderedMap> sub_graphs; // dump ir in each sub graph DumpIRInSubgraph(nodes, ¶_map, &sub_graphs, total_para, dump_full_name, dump_location); // output global info fout << buffer.str() << std::endl; // output each sub graph DumpSubgraph(&sub_graphs, graph, ¶_map, fout); fout.close(); // set file mode to read only by user ChangeFileMode(realpath.value(), S_IRUSR); } #else void DumpIR(const std::string &, const FuncGraphPtr &, bool, LocDumpMode, const std::string &) { static bool already_printed = false; if (already_printed) { return; } already_printed = true; MS_LOG(WARNING) << "The functionality of dumping function graph IR is disabled, " << "please recompile source to enable it. See help of building script."; } void DumpIRForRDR(const std::string &, const FuncGraphPtr &, bool, LocDumpMode) { static bool already_printed = false; if (already_printed) { return; } already_printed = true; MS_LOG(WARNING) << "The functionality of dumping function graph IR is disabled, " << "please recompile source to enable it. See help of building script."; } #endif } // namespace mindspore