Star659
445
代码
代码
Issues36
Pull Requests116
Actions
项目讨论
Wiki
分析
Star659
445
已合并
【fix】: 修正单词拼写 #3890
kantao1创建于 7月6日
【fix】: 修正单词拼写 #3890
已合并
kantao1创建于 7月6日
从kantao1/geclean_code合入到cann/gedevelop
共 14 个文件变更+25-25
Mcompiler/engines/custom_engine/custom_graph_optimizer.h+1-1
@@ -34,7 +34,7 @@ class CustomGraphOptimizer : public ge::GraphOptimizer {
34 ge::Status Finalize() override;34 ge::Status Finalize() override;
35 35 
36 /**36 /**
37- * @brief optimize original graph, using in graph prepatation stage37+ * @brief optimize original graph, using in graph preparation stage
38 * @param graph computation graph38 * @param graph computation graph
39 * @return status whether success39 * @return status whether success
40 */40 */
Mcompiler/engines/dvpp_engine/adapter/dvpp_graph_optimizer.h+2-2
@@ -60,7 +60,7 @@ class DvppGraphOptimizer : public ge::GraphOptimizer {
60 ge::Status OptimizeGraphPrepare(ge::ComputeGraph &graph) override;60 ge::Status OptimizeGraphPrepare(ge::ComputeGraph &graph) override;
61 61 
62 /**62 /**
63- * @brief optimize original graph, using in graph prepatation stage63+ * @brief optimize original graph, using in graph preparation stage
64 * @param graph computation graph64 * @param graph computation graph
65 * @return status whether success65 * @return status whether success
66 */66 */
@@ -68,7 +68,7 @@ class DvppGraphOptimizer : public ge::GraphOptimizer {
68 68 
69 /**69 /**
70 * @brief optimize original graph70 * @brief optimize original graph
71- * using for conversion op insert in graph prepatation stage71+ * using for conversion op insert in graph preparation stage
72 * @param graph computation graph72 * @param graph computation graph
73 * @return status whether success73 * @return status whether success
74 */74 */
Mcompiler/engines/local_engine/engine/ge_local_graph_optimizer.h+2-2
@@ -33,7 +33,7 @@ class GeLocalGraphOptimizer : public ge::GraphOptimizer {
33 ge::Status Finalize() override;33 ge::Status Finalize() override;
34 34 
35 /**35 /**
36- * @brief optimize original graph, using in graph prepatation stage36+ * @brief optimize original graph, using in graph preparation stage
37 * @param graph computation graph37 * @param graph computation graph
38 * @return status whether success38 * @return status whether success
39 */39 */
@@ -41,7 +41,7 @@ class GeLocalGraphOptimizer : public ge::GraphOptimizer {
41 41 
42 /**42 /**
43 * @brief optimize original graph43 * @brief optimize original graph
44- * using for conversion op insert in graph prepatation stage44+ * using for conversion op insert in graph preparation stage
45 * @param graph computation graph45 * @param graph computation graph
46 * @return status whether success46 * @return status whether success
47 */47 */
Mcompiler/graph/optimize/autofuse/autofuse/lowering/op_lowering_impl/lowering_impl.cpp+1-1
@@ -867,7 +867,7 @@ graphStatus LowerSplit(const NodePtr &node) {
867 InDataAnchorPtr x_anchor;867 InDataAnchorPtr x_anchor;
868 vector<ge::Expression> x_dims;868 vector<ge::Expression> x_dims;
869 LOWERING_WARN_RECORD_REASON(ParseSplitNodeAndValidate(node, x_anchor, split_dim, x_dims) == GRAPH_SUCCESS, node,869 LOWERING_WARN_RECORD_REASON(ParseSplitNodeAndValidate(node, x_anchor, split_dim, x_dims) == GRAPH_SUCCESS, node,
870- "Faile to ParseSplitNodeAndValidate");870+ "Failed to ParseSplitNodeAndValidate");
871 const auto backend_spec = ge::GetAutofuseBackendSpec();871 const auto backend_spec = ge::GetAutofuseBackendSpec();
872 GE_CHECK_NOTNULL(backend_spec);872 GE_CHECK_NOTNULL(backend_spec);
873 if (split_dim < 0) {873 if (split_dim < 0) {
Mcompiler/graph/optimize/autofuse/autofuse/post_process/scheduler_adapter/serialize_asc_backend.h+1-1
@@ -39,7 +39,7 @@ inline Status SerilizeAscBackendNode(const ComputeGraphPtr &graph) {
39 "_extra_param_builder", std::function<std::string()>([node_ptr]() -> std::string {39 "_extra_param_builder", std::function<std::string()>([node_ptr]() -> std::string {
40 std::string output;40 std::string output;
41 if (AutofuseUtils::SerilizeAscBackend(node_ptr, output) != SUCCESS) {41 if (AutofuseUtils::SerilizeAscBackend(node_ptr, output) != SUCCESS) {
42- GELOGE(FAILED, "node:%s(%s) serilize failed.", node_ptr->GetName().c_str(), node_ptr->GetType().c_str());42+ GELOGE(FAILED, "node:%s(%s) serialize failed.", node_ptr->GetName().c_str(), node_ptr->GetType().c_str());
43 return std::string("");43 return std::string("");
44 }44 }
45 return output;45 return output;
Mcompiler/graph/passes/base_pass.cc+1-1
@@ -138,7 +138,7 @@ void AddNextIterNodes(const NodePtr &cur_node, OrderedNodeSet &out_nodes_before_
138 //138 //
139 for (const auto &node : out_nodes_before_pass) {139 for (const auto &node : out_nodes_before_pass) {
140 // A-->B-->C if B was140 // A-->B-->C if B was
141- // unlink edge may happend, add these node to queue if needed141+ // Unlink edge may happen, add these node to queue if needed
142 if ((!IsNodeAlreadySeen(node, graph_state)) && (IsNodeReadyToQueue(node, graph_state))) {142 if ((!IsNodeAlreadySeen(node, graph_state)) && (IsNodeReadyToQueue(node, graph_state))) {
143 GELOGD("Node %s may lost from cur node %s, add to queue if not seen.", node->GetName().c_str(),143 GELOGD("Node %s may lost from cur node %s, add to queue if not seen.", node->GetName().c_str(),
144 cur_node->GetName().c_str());144 cur_node->GetName().c_str());
Mcompiler/graph/passes/format_optimize/transpose_transdata_pass.cc+1-1
@@ -81,7 +81,7 @@ Status TransposeTransDataPass::Run(NodePtr &node) {
81 GE_ASSERT_NOTNULL(op_desc->GetOutputDescPtr(0));81 GE_ASSERT_NOTNULL(op_desc->GetOutputDescPtr(0));
82 auto output_format = op_desc->GetOutputDescPtr(0)->GetFormat();82 auto output_format = op_desc->GetOutputDescPtr(0)->GetFormat();
83 if (input_format == output_format) {83 if (input_format == output_format) {
84- GELOGW("Node %s input format is %s, output format is %s, should not happend. Ignore pass.",84+ GELOGW("Node %s input format is %s, output format is %s, should not happened. Ignore pass.",
85 op_desc->GetName().c_str(), TypeUtils::FormatToSerialString(input_format).c_str(),85 op_desc->GetName().c_str(), TypeUtils::FormatToSerialString(input_format).c_str(),
86 TypeUtils::FormatToSerialString(output_format).c_str());86 TypeUtils::FormatToSerialString(output_format).c_str());
87 return SUCCESS;87 return SUCCESS;
Mdflow/base/deploy/deploy_planner.cc+1-1
@@ -1115,7 +1115,7 @@ Status DeployPlannerBase::AssignDequeueQueues() {
1115 } else {1115 } else {
1116 GE_CHK_STATUS_RET_NOLOG(GetOrCreateInputEndpoint(model_queue_loc, queue_info, dst_endpoint_idx));1116 GE_CHK_STATUS_RET_NOLOG(GetOrCreateInputEndpoint(model_queue_loc, queue_info, dst_endpoint_idx));
1117 GE_CHK_STATUS_RET_NOLOG(ResolveDequeueFusion(src_endpoint_idx, dst_endpoint_idx));1117 GE_CHK_STATUS_RET_NOLOG(ResolveDequeueFusion(src_endpoint_idx, dst_endpoint_idx));
1118- // aggregation endpoint need to known current intance index1118+ // aggregation endpoint need to know current instance index
1119 InputGroupAttr input_group_attr = {};1119 InputGroupAttr input_group_attr = {};
1120 input_group_attr.instance_num = static_cast<int32_t>(queue_loc_and_queue_infos.second.size());1120 input_group_attr.instance_num = static_cast<int32_t>(queue_loc_and_queue_infos.second.size());
1121 input_group_attr.instance_idx = static_cast<int32_t>(i);1121 input_group_attr.instance_idx = static_cast<int32_t>(i);
Mruntime/v2/subscriber/dumper/executor_dumper.cc+2-2
@@ -1118,8 +1118,8 @@ ge::Status ExecutorDumper::FillExtraDumpInfo(const Node &node) {
1118 GE_ASSERT_NOTNULL(kernel_extend_info);1118 GE_ASSERT_NOTNULL(kernel_extend_info);
1119 const auto kernel_type = kernel_extend_info->GetKernelType();1119 const auto kernel_type = kernel_extend_info->GetKernelType();
1120 ge::Status ret = ge::SUCCESS;1120 ge::Status ret = ge::SUCCESS;
1121- ExecutorExceptionDumpInfoWrapper warpper(&node_names_to_extra_units_[node_name]);1121+ ExecutorExceptionDumpInfoWrapper wrapper(&node_names_to_extra_units_[node_name]);
1122- ret = filler(reinterpret_cast<const KernelContext *>(ctx), static_cast<ExceptionDumpInfoWrapper &>(warpper));1122+ ret = filler(reinterpret_cast<const KernelContext *>(ctx), static_cast<ExceptionDumpInfoWrapper &>(wrapper));
1123 GE_ASSERT_SUCCESS(ret, "Dump filler failed, node %s, kernel %s.", node_name, kernel_type);1123 GE_ASSERT_SUCCESS(ret, "Dump filler failed, node %s, kernel %s.", node_name, kernel_type);
1124 GELOGI("Exception dump filler, node %s, kernel %s.", node_name, kernel_type);1124 GELOGI("Exception dump filler, node %s, kernel %s.", node_name, kernel_type);
1125 return ret;1125 return ret;
Mtests/dflow/runner/st/testcase/data_flow_graph/data_flow_graph_test.cc+1-1
@@ -601,7 +601,7 @@ bool CheckCacheResult(const std::string &cache_dir, const std::string &graph_key
601 601 
602 std::vector<ge::CacheFileIndex> cache_file_list;602 std::vector<ge::CacheFileIndex> cache_file_list;
603 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {603 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {
604- std::cout << "Faile to read cache index file:" << cache_idx_file << std::endl;604+ std::cout << "Failed to read cache index file:" << cache_idx_file << std::endl;
605 return false;605 return false;
606 }606 }
607 for (auto &idx : cache_file_list) {607 for (auto &idx : cache_file_list) {
Mtests/dflow/runner/ut/dflow/session/dflow_api_unittest.cc+4-4
@@ -637,10 +637,10 @@ TEST_F(UtestDflowApi, test_build) {
637 std::map<std::string, std::string> options = {{"ge.buildMode", "tuning"}, {"ge.buildStep", "after_merge"}};637 std::map<std::string, std::string> options = {{"ge.buildMode", "tuning"}, {"ge.buildStep", "after_merge"}};
638 ge::DFlowSessionImpl impl(0, {});638 ge::DFlowSessionImpl impl(0, {});
639 impl.Initialize(options);639 impl.Initialize(options);
640- ge::FlowModelBuilder &builer = impl.dflow_graph_manager_.flow_model_builder_;640+ ge::FlowModelBuilder &builder = impl.dflow_graph_manager_.flow_model_builder_;
641- EXPECT_FALSE(builer.process_node_engines_.empty());641+ EXPECT_FALSE(builder.process_node_engines_.empty());
642- auto pne_iter = builer.process_node_engines_.find(ge::PNE_ID_NPU);642+ auto pne_iter = builder.process_node_engines_.find(ge::PNE_ID_NPU);
643- ASSERT_NE(pne_iter, builer.process_node_engines_.cend());643+ ASSERT_NE(pne_iter, builder.process_node_engines_.cend());
644 ge::ProcessNodeEnginePtr pne = pne_iter->second;644 ge::ProcessNodeEnginePtr pne = pne_iter->second;
645 ComputeGraphPtr graph = ge::MakeShared<ge::ComputeGraph>("test");645 ComputeGraphPtr graph = ge::MakeShared<ge::ComputeGraph>("test");
646 ge::PneModelPtr model;646 ge::PneModelPtr model;
Mtests/ge/st/testcase/test_mem_layout_conflict.cc+2-2
@@ -1071,7 +1071,7 @@ TEST_F(MemLayoutConflictTest, UserInputConnectToNoPaddingContinuousOutput_NotIns
1071TEST_F(MemLayoutConflictTest, UserInputConnectToNoPaddingContinuousOutput_InsertIdentity_CheckAddressCorrect) {1071TEST_F(MemLayoutConflictTest, UserInputConnectToNoPaddingContinuousOutput_InsertIdentity_CheckAddressCorrect) {
1072 DUMP_GRAPH_WHEN("PreRunAfterMemConflictProc");1072 DUMP_GRAPH_WHEN("PreRunAfterMemConflictProc");
1073 auto graph = MemConflictShareGraph::BuildUserInConnectNoPaddingContinuousOutputGraph();1073 auto graph = MemConflictShareGraph::BuildUserInConnectNoPaddingContinuousOutputGraph();
1074- ge::AttrUtils::SetBool(graph, ge::ATTR_SINGLE_OP_SCENE, true); // set graph to signle op1074+ ge::AttrUtils::SetBool(graph, ge::ATTR_SINGLE_OP_SCENE, true); // set graph to single op
1075 1075 
1076 map<AscendString, AscendString> options;1076 map<AscendString, AscendString> options;
1077 Session session(options);1077 Session session(options);
@@ -1506,7 +1506,7 @@ TEST_F(MemLayoutConflictTest, UserInOutAndContinuousInOut_InsertIdentity) {
1506 * 期望：1506 * 期望：
1507 * phonyconcat1 输入前面插入identity1507 * phonyconcat1 输入前面插入identity
1508 * phonysplit output_0 后面插入identity1508 * phonysplit output_0 后面插入identity
1509- * phonysplit 输入插入identity (offline 编译， signle op, load model withq 场景)1509+ * phonysplit 输入插入identity (offline 编译， single op, load model withq 场景)
1510 */1510 */
1511TEST_F(MemLayoutConflictTest, UserInOutAndNoPaddingContinuousInOut_InsertIdentity) {1511TEST_F(MemLayoutConflictTest, UserInOutAndNoPaddingContinuousInOut_InsertIdentity) {
1512 DUMP_GRAPH_WHEN("PreRunAfterMemConflictProc");1512 DUMP_GRAPH_WHEN("PreRunAfterMemConflictProc");
Mtests/ge/ut/ge/graph/build/model_cache_unittest.cc+2-2
@@ -204,7 +204,7 @@ bool CheckCacheResult(const std::string &cache_dir, const std::string &graph_key
204 204 
205 std::vector<ge::CacheFileIdx> cache_file_list;205 std::vector<ge::CacheFileIdx> cache_file_list;
206 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {206 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {
207- std::cout << "Faile to read cache index file:" << cache_idx_file << std::endl;207+ std::cout << "Failed to read cache index file:" << cache_idx_file << std::endl;
208 return false;208 return false;
209 }209 }
210 for (auto &idx : cache_file_list) {210 for (auto &idx : cache_file_list) {
@@ -255,7 +255,7 @@ std::string GetCacheFileName(const std::string &cache_dir, const std::string &gr
255 255 
256 std::vector<ge::CacheFileIdx> cache_file_list;256 std::vector<ge::CacheFileIdx> cache_file_list;
257 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {257 if (!ReadIndexFile(cache_idx_file, cache_file_list)) {
258- std::cout << "Faile to read cache index file:" << cache_idx_file << std::endl;258+ std::cout << "Failed to read cache index file:" << cache_idx_file << std::endl;
259 return "";259 return "";
260 }260 }
261 for (auto &idx : cache_file_list) {261 for (auto &idx : cache_file_list) {
Mtests/ge/ut/ge/graph/passes/subexpression_migration_pass_unittest.cc+4-4
@@ -117,7 +117,7 @@ static ComputeGraphPtr BuildIdentityGraph() {
117 ->NODE("sub1/identityn", IDENTITYN)117 ->NODE("sub1/identityn", IDENTITYN)
118 ->EDGE(1, 1)118 ->EDGE(1, 1)
119 ->NODE("sub1/add", ADD));119 ->NODE("sub1/add", ADD));
120- CHAIN(NODE("sub1/variale", VARIABLE)120+ CHAIN(NODE("sub1/variable", VARIABLE)
121 ->NODE("sub1/identity3", IDENTITY)121 ->NODE("sub1/identity3", IDENTITY)
122 ->EDGE(0, 2)122 ->EDGE(0, 2)
123 ->NODE("sub1/identityn", IDENTITYN)123 ->NODE("sub1/identityn", IDENTITYN)
@@ -141,7 +141,7 @@ static ComputeGraphPtr BuildIdentityGraph() {
141 ->NODE("sub2/identityn", IDENTITYN)141 ->NODE("sub2/identityn", IDENTITYN)
142 ->EDGE(1, 1)142 ->EDGE(1, 1)
143 ->NODE("sub2/add", ADD));143 ->NODE("sub2/add", ADD));
144- CHAIN(NODE("sub2/variale", VARIABLE)144+ CHAIN(NODE("sub2/variable", VARIABLE)
145 ->NODE("sub2/identity3", IDENTITY)145 ->NODE("sub2/identity3", IDENTITY)
146 ->EDGE(0, 2)146 ->EDGE(0, 2)
147 ->NODE("sub2/identityn", IDENTITYN)147 ->NODE("sub2/identityn", IDENTITYN)
@@ -182,7 +182,7 @@ static ComputeGraphPtr BuildIdentityGraph2() {
182 ->EDGE(0, 0)182 ->EDGE(0, 0)
183 ->NODE("sub1/add3", ADD)183 ->NODE("sub1/add3", ADD)
184 ->NODE("sub1/netoutput", NETOUTPUT));184 ->NODE("sub1/netoutput", NETOUTPUT));
185- CHAIN(NODE("sub1/variale", VARIABLE)185+ CHAIN(NODE("sub1/variable", VARIABLE)
186 ->EDGE(0, 2)186 ->EDGE(0, 2)
187 ->NODE("sub1/identityn", IDENTITYN)187 ->NODE("sub1/identityn", IDENTITYN)
188 ->EDGE(2, 1)188 ->EDGE(2, 1)
@@ -210,7 +210,7 @@ static ComputeGraphPtr BuildIdentityGraph2() {
210 ->EDGE(0, 0)210 ->EDGE(0, 0)
211 ->NODE("sub2/add3", ADD)211 ->NODE("sub2/add3", ADD)
212 ->NODE("sub2/netoutput", NETOUTPUT));212 ->NODE("sub2/netoutput", NETOUTPUT));
213- CHAIN(NODE("sub2/variale", VARIABLE)213+ CHAIN(NODE("sub2/variable", VARIABLE)
214 ->EDGE(0, 2)214 ->EDGE(0, 2)
215 ->NODE("sub2/identityn", IDENTITYN)215 ->NODE("sub2/identityn", IDENTITYN)
216 ->EDGE(2, 1)216 ->EDGE(2, 1)