mirror of
https://github.com/blakeblackshear/frigate.git
synced 2026-02-18 09:04:28 +03:00
285 lines
10 KiB
C++
285 lines
10 KiB
C++
/*
|
|
* The MIT License (MIT)
|
|
*
|
|
* Copyright (c) 2015-2024 Advanced Micro Devices, Inc. All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
* THE SOFTWARE.
|
|
*/
|
|
#include <migraphx/cpp_generator.hpp>
|
|
#include <migraphx/module.hpp>
|
|
#include <migraphx/operation.hpp>
|
|
#include <migraphx/ranges.hpp>
|
|
#include <migraphx/instruction.hpp>
|
|
#include <migraphx/builtin.hpp>
|
|
#include <migraphx/stringutils.hpp>
|
|
#include <migraphx/iterator_for.hpp>
|
|
#include <map>
|
|
#include <sstream>
|
|
|
|
namespace migraphx {
|
|
inline namespace MIGRAPHX_INLINE_NS {
|
|
|
|
cpp_generator::function&
|
|
cpp_generator::function::set_body(const module& m, const cpp_generator::generate_module_callback& g)
|
|
{
|
|
const std::string prefix = "zz";
|
|
std::unordered_map<migraphx::instruction_ref, std::string> names;
|
|
std::stringstream ss;
|
|
|
|
auto return_ins = std::prev(m.end());
|
|
|
|
for(auto ins : iterator_for(m))
|
|
{
|
|
ss << "// " << ins->get_operator() << " -> " << ins->get_shape() << "\n";
|
|
if(ins->name() == "@param")
|
|
{
|
|
names[ins] = to_c_id(
|
|
migraphx::any_cast<migraphx::builtin::param>(ins->get_operator()).parameter);
|
|
}
|
|
else if(ins->name() == "@return")
|
|
{
|
|
names[ins] = prefix + "return";
|
|
ss << "auto " << names[ins] << " = " << g(ins, names) << ";\n";
|
|
return_ins = ins;
|
|
}
|
|
else
|
|
{
|
|
std::string n = prefix + std::to_string(names.size());
|
|
names[ins] = n;
|
|
ss << "auto " << n << " = " << g(ins, names) << ";\n";
|
|
}
|
|
}
|
|
ss << "return " << names.at(return_ins) << ";\n";
|
|
body = ss.str();
|
|
return *this;
|
|
}
|
|
|
|
cpp_generator::function& cpp_generator::function::set_types(const module& m)
|
|
{
|
|
return cpp_generator::function::set_types(m, [](auto s) { return shape::cpp_type(s.type()); });
|
|
}
|
|
cpp_generator::function&
|
|
cpp_generator::function::set_types(const module& m, const std::function<std::string(shape)>& parse)
|
|
{
|
|
this->params.clear();
|
|
auto pmap = m.get_parameter_shapes();
|
|
std::map<std::string, shape> input_map(pmap.begin(), pmap.end());
|
|
std::transform(
|
|
input_map.begin(), input_map.end(), std::back_inserter(this->params), [&](auto&& p) {
|
|
return param{p.first, parse(p.second)};
|
|
});
|
|
auto output_shapes = m.get_output_shapes();
|
|
assert(not output_shapes.empty());
|
|
this->return_type = parse(output_shapes.front());
|
|
return *this;
|
|
}
|
|
|
|
cpp_generator::function& cpp_generator::function::set_generic_types(const module& m)
|
|
{
|
|
this->params.clear();
|
|
auto pmap = m.get_parameter_shapes();
|
|
std::map<std::string, shape> input_map(pmap.begin(), pmap.end());
|
|
std::transform(
|
|
input_map.begin(), input_map.end(), std::back_inserter(this->params), [&](auto&& p) {
|
|
return param{p.first, "T" + to_c_id(p.first)};
|
|
});
|
|
|
|
std::transform(input_map.begin(),
|
|
input_map.end(),
|
|
std::back_inserter(this->tparams),
|
|
[&](auto&& p) { return "class T" + to_c_id(p.first); });
|
|
this->return_type = "auto";
|
|
return *this;
|
|
}
|
|
|
|
cpp_generator::function& cpp_generator::function::unused_param(const std::string& pname)
|
|
{
|
|
body.insert(0, "(void)" + pname + ";\n");
|
|
return *this;
|
|
}
|
|
cpp_generator::function& cpp_generator::function::add_generic_param(const std::string& pname)
|
|
{
|
|
params.push_back({pname, "T" + pname});
|
|
tparams.push_back("class T" + pname);
|
|
return *this;
|
|
}
|
|
|
|
struct cpp_generator_impl
|
|
{
|
|
std::stringstream fs{};
|
|
std::size_t function_count = 0;
|
|
std::function<std::string(std::string)> fmap = nullptr;
|
|
std::function<std::string(shape)> fresult = nullptr;
|
|
std::unordered_map<std::string, std::string> point_op_map = {};
|
|
bool always_return_tuple = false;
|
|
};
|
|
cpp_generator::cpp_generator() : impl(std::make_unique<cpp_generator_impl>()) {}
|
|
|
|
cpp_generator::cpp_generator(cpp_generator&&) noexcept = default;
|
|
|
|
cpp_generator& cpp_generator::operator=(cpp_generator rhs)
|
|
{
|
|
std::swap(impl, rhs.impl);
|
|
return *this;
|
|
}
|
|
|
|
cpp_generator::~cpp_generator() noexcept = default;
|
|
|
|
void cpp_generator::fmap(const std::function<std::string(std::string)>& f) { impl->fmap = f; }
|
|
|
|
void cpp_generator::fresult(const std::function<std::string(shape)>& f) { impl->fresult = f; }
|
|
|
|
void cpp_generator::always_return_tuple(bool b) { impl->always_return_tuple = b; }
|
|
|
|
void cpp_generator::add_point_op(const std::string& op_name, const std::string& code)
|
|
{
|
|
impl->point_op_map[op_name] = code;
|
|
}
|
|
|
|
std::string cpp_generator::generate_point_op(const operation& op,
|
|
const std::vector<std::string>& args)
|
|
{
|
|
auto v = op.to_value();
|
|
std::string code;
|
|
if(contains(impl->point_op_map, op.name()))
|
|
{
|
|
code = impl->point_op_map.at(op.name());
|
|
}
|
|
else
|
|
{
|
|
auto attributes = op.attributes();
|
|
if(not attributes.contains("point_op"))
|
|
MIGRAPHX_THROW("op is missing point_op attribute: " + op.name());
|
|
code = attributes["point_op"].to<std::string>();
|
|
}
|
|
return interpolate_string(code, [&](auto start, auto last) -> std::string {
|
|
auto key = trim({start, last});
|
|
if(key.empty())
|
|
MIGRAPHX_THROW("Empty parameter");
|
|
std::string fselector = "function:";
|
|
if(starts_with(key, fselector))
|
|
{
|
|
auto fname = key.substr(fselector.size());
|
|
if(impl->fmap == nullptr)
|
|
return fname;
|
|
else
|
|
return impl->fmap(fname);
|
|
}
|
|
else if(with_char(::isdigit)(key[0]))
|
|
{
|
|
auto i = std::stoul(key);
|
|
if(i >= args.size())
|
|
MIGRAPHX_THROW("Invalid argument index: " + key);
|
|
return args.at(i);
|
|
}
|
|
else if(v.contains(key))
|
|
{
|
|
return v[key].template to<std::string>();
|
|
}
|
|
else
|
|
{
|
|
return key;
|
|
}
|
|
});
|
|
}
|
|
|
|
std::string cpp_generator::str() const { return impl->fs.str(); }
|
|
|
|
cpp_generator::function cpp_generator::generate_module(const module& m,
|
|
const generate_module_callback& g)
|
|
{
|
|
function f;
|
|
f.set_name(to_c_id(m.name()))
|
|
.set_types(m)
|
|
.set_body(m, [&](instruction_ref ins, const auto& names) -> std::string {
|
|
if(ins->name() == "@literal")
|
|
{
|
|
std::string string_literal;
|
|
ins->get_literal().visit([&](auto v) {
|
|
assert(v.size() == 1);
|
|
auto x = v.front();
|
|
if(std::isinf(static_cast<double>(x)))
|
|
{
|
|
string_literal = "__builtin_huge_val()";
|
|
if(x < 0)
|
|
string_literal = "-__builtin_huge_val()";
|
|
}
|
|
else if(std::isnan(static_cast<double>(x)))
|
|
string_literal = "__builtin_nan(\"0\")";
|
|
else
|
|
string_literal = ins->get_literal().to_string();
|
|
});
|
|
return shape::cpp_type(ins->get_shape().type()) + "(" + string_literal + ")";
|
|
}
|
|
if(ins->name() == "@return")
|
|
{
|
|
// TODO: Customize the make_tuple call
|
|
if(impl->always_return_tuple or ins->inputs().size() != 1)
|
|
return "make_tuple(" + join_strings(to_args(ins->inputs(), names), ", ") + ")";
|
|
return names.at(ins->inputs().front());
|
|
}
|
|
auto s = g(ins, names);
|
|
if(impl->fresult)
|
|
return impl->fresult(ins->get_shape()) + '(' + s + ')';
|
|
else
|
|
return s;
|
|
});
|
|
return f;
|
|
}
|
|
|
|
std::vector<std::string>
|
|
cpp_generator::to_args(const std::vector<instruction_ref>& inputs,
|
|
const std::unordered_map<instruction_ref, std::string>& names)
|
|
{
|
|
std::vector<std::string> args;
|
|
std::transform(inputs.begin(), inputs.end(), std::back_inserter(args), [&](auto i) {
|
|
return names.at(i);
|
|
});
|
|
return args;
|
|
}
|
|
|
|
cpp_generator::function cpp_generator::generate_module(const module& m)
|
|
{
|
|
return this->generate_module(m, [&](auto ins, const auto& names) {
|
|
return this->generate_point_op(ins->get_operator(), to_args(ins->inputs(), names));
|
|
});
|
|
}
|
|
|
|
std::string cpp_generator::create_function(const cpp_generator::function& f)
|
|
{
|
|
impl->function_count++;
|
|
if(not f.tparams.empty())
|
|
impl->fs << "template<" << join_strings(f.tparams, ", ") << ">\n";
|
|
std::string name = f.name.empty() ? "f" + std::to_string(impl->function_count) : f.name;
|
|
impl->fs << join_strings(f.attributes, " ") << " " << f.return_type << " " << name;
|
|
char delim = '(';
|
|
if(f.params.empty())
|
|
impl->fs << delim;
|
|
for(auto&& p : f.params)
|
|
{
|
|
impl->fs << delim << p.type << " " << to_c_id(p.name);
|
|
delim = ',';
|
|
}
|
|
impl->fs << ") {\n" << f.body << "\n}\n";
|
|
return name;
|
|
}
|
|
|
|
} // namespace MIGRAPHX_INLINE_NS
|
|
} // namespace migraphx
|