* Copyright (c) 2025 Huawei Technologies Co., Ltd.
* This program is free software, you can redistribute it and/or modify it under the terms and conditions of
* CANN Open Software License Agreement Version 2.0 (the "License").
* Please refer to the License for details. You may not use this file except in compliance with the License.
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED,
* INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE.
* See LICENSE in the root of the software repository for the full text of the License.
*/
#include "es_showcase.h"
#include "es_Add.h"
#include "es_Sigmoid.h"
#include "utils.h"
#include <memory>
#include <vector>
#include <iostream>
#include "ge/ge_api.h"
using namespace ge;
using namespace ge::es;
namespace {
es::EsTensorHolder MakeSigmoidAddGraph(es::EsTensorHolder input) {
REG_OP(Sigmoid)
.INPUT(x, TensorType::UnaryDataType())
.OUTPUT(y, TensorType::UnaryDataType())
.OP_END_FACTORY_REG(Sigmoid)
*/
auto sigmoid0 = Sigmoid(input);
sigmoid0.SetAttrForNode("_stream_label", "label_0");
auto sigmoid1 = Sigmoid(input);
sigmoid1.SetAttrForNode("node_rank", static_cast<int64_t>(1));
sigmoid1.SetAttrForNode("execution_priority", static_cast<int64_t>(2));
sigmoid1.SetAttrForNode("memory_optimization", true);
sigmoid1.SetAttrForNode("_stream_label", "label_1");
auto add = Add(sigmoid0, sigmoid1);
return add;
}
}
namespace es_showcase {
int RunGraph(ge::Graph &graph, const std::vector<ge::Tensor> &inputs, const std::string &output_prefix) {
ge::Utils::PrintTensorsToFile(inputs, "input");
std::map<ge::AscendString, ge::AscendString> options;
auto *s = new (std::nothrow) ge::Session(options);
if (s == nullptr) {
std::cout << "Global session not ready" << std::endl;
return -1;
}
static uint32_t next = 0;
const uint32_t graph_id = next++;
auto ret = s->AddGraph(graph_id, graph);
if (ret != ge::SUCCESS) {
std::cout << "AddGraph failed" << std::endl;
delete s;
return -1;
}
std::vector<ge::Tensor> outputs;
ret = s->RunGraph(graph_id, inputs, outputs);
if (ret != ge::SUCCESS) {
std::cout << "RunGraph failed" << std::endl;
(void)s->RemoveGraph(graph_id);
delete s;
return -1;
}
(void)s->RemoveGraph(graph_id);
ge::Utils::PrintTensorsToFile(outputs, output_prefix);
delete s;
return 0;
}
void MakeSigmoidAddGraphByEsAndDump() {
std::unique_ptr<ge::Graph> graph = MakeSigmoidAddGraphByEs();
graph->DumpToFile(ge::Graph::DumpFormat::kOnnx, ge::AscendString("make_sigmoid_add_graph"));
graph->DumpToFile(ge::Graph::DumpFormat::kTxt, ge::AscendString("make_sigmoid_add_graph"));
}
std::unique_ptr<ge::Graph> MakeSigmoidAddGraphByEs() {
auto graph_builder = std::make_unique<EsGraphBuilder>("MakeSigmoidAddGraph");
auto input = graph_builder->CreateInput(0, "input", ge::DT_FLOAT, ge::FORMAT_ND, {2, 3});
auto result = MakeSigmoidAddGraph(input);
(void)graph_builder->SetOutput(result, 0);
return graph_builder->BuildAndReset();
}
int MakeSigmoidAddGraphByEsAndRun() {
std::unique_ptr<ge::Graph> graph = MakeSigmoidAddGraphByEs();
std::vector<ge::Tensor> inputs;
std::vector<float> input_data(2 * 3, 1.0f);
auto input_tensor = ge::Utils::StubTensor<float>(input_data, {2, 3});
inputs.push_back(*input_tensor);
return RunGraph(*graph, inputs, "SigmoidAdd");
}
}