mirror of
https://github.com/blakeblackshear/frigate.git
synced 2026-02-19 09:27:06 +03:00
333 lines
12 KiB
C++
333 lines
12 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/program.hpp>
|
||
|
|
#include <migraphx/module.hpp>
|
||
|
|
#include <migraphx/iterator_for.hpp>
|
||
|
|
#include <migraphx/instruction.hpp>
|
||
|
|
#include <migraphx/par_for.hpp>
|
||
|
|
#include <migraphx/register_op.hpp>
|
||
|
|
#include <migraphx/algorithm.hpp>
|
||
|
|
#include <migraphx/op/identity.hpp>
|
||
|
|
#include <migraphx/gpu/compiler.hpp>
|
||
|
|
#include <migraphx/gpu/compile_ops.hpp>
|
||
|
|
#include <migraphx/gpu/context.hpp>
|
||
|
|
#include <migraphx/gpu/time_op.hpp>
|
||
|
|
|
||
|
|
namespace migraphx {
|
||
|
|
inline namespace MIGRAPHX_INLINE_NS {
|
||
|
|
namespace gpu {
|
||
|
|
|
||
|
|
MIGRAPHX_DECLARE_ENV_VAR(MIGRAPHX_GPU_COMPILE_PARALLEL);
|
||
|
|
MIGRAPHX_DECLARE_ENV_VAR(MIGRAPHX_TRACE_BENCHMARKING);
|
||
|
|
|
||
|
|
struct precompile_op
|
||
|
|
{
|
||
|
|
operation op = op::identity{};
|
||
|
|
std::size_t additional_args = 1;
|
||
|
|
bool ignore_modules = false;
|
||
|
|
std::optional<shape> output_shape = nullopt;
|
||
|
|
|
||
|
|
template <class Self, class F>
|
||
|
|
static auto reflect(Self& self, F f)
|
||
|
|
{
|
||
|
|
return pack(f(self.op, "op"),
|
||
|
|
f(self.additional_args, "additional_args"),
|
||
|
|
f(self.ignore_modules, "ignore_modules"),
|
||
|
|
f(self.output_shape, "output_shape"));
|
||
|
|
}
|
||
|
|
|
||
|
|
std::string name() const { return "gpu::precompile_op"; }
|
||
|
|
|
||
|
|
shape compute_shape(std::vector<shape> inputs, const std::vector<module_ref>& mods) const
|
||
|
|
{
|
||
|
|
// Pop off additional args
|
||
|
|
inputs.resize(inputs.size() - additional_args);
|
||
|
|
if(output_shape.has_value())
|
||
|
|
return output_shape.value();
|
||
|
|
if(ignore_modules)
|
||
|
|
return op.compute_shape(inputs);
|
||
|
|
return op.compute_shape(inputs, mods);
|
||
|
|
}
|
||
|
|
|
||
|
|
std::ptrdiff_t output_alias(const std::vector<shape>& shapes) const
|
||
|
|
{
|
||
|
|
return shapes.size() - 1;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
MIGRAPHX_REGISTER_OP(precompile_op);
|
||
|
|
|
||
|
|
struct compiled_result
|
||
|
|
{
|
||
|
|
compiler_replace replace;
|
||
|
|
instruction_ref ins;
|
||
|
|
|
||
|
|
friend std::ostream& operator<<(std::ostream& os, const compiled_result& cr)
|
||
|
|
{
|
||
|
|
cr.replace.trace(os, cr.ins);
|
||
|
|
return os;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
struct compile_plan
|
||
|
|
{
|
||
|
|
context* ctx;
|
||
|
|
operation preop;
|
||
|
|
instruction_ref ins;
|
||
|
|
optional<tuning_config> config = nullopt;
|
||
|
|
std::vector<optional<compiled_result>> results = {};
|
||
|
|
void update_config(bool exhaustive)
|
||
|
|
{
|
||
|
|
config = get_tuning_config(*ctx, ins, preop, exhaustive);
|
||
|
|
}
|
||
|
|
template <class Vector>
|
||
|
|
void insert_compiles(Vector& compiles, const value& solution, std::size_t i)
|
||
|
|
{
|
||
|
|
compiles.emplace_back([=] {
|
||
|
|
try
|
||
|
|
{
|
||
|
|
results[i] = compiled_result{compile(*ctx, ins, preop, solution), ins};
|
||
|
|
}
|
||
|
|
catch(const std::exception& e)
|
||
|
|
{
|
||
|
|
const auto trace_level = value_of(MIGRAPHX_TRACE_BENCHMARKING{});
|
||
|
|
if(trace_level > 0)
|
||
|
|
std::cerr << "Exception in " + preop.name() + ": " + e.what() << std::endl;
|
||
|
|
results[i] = nullopt;
|
||
|
|
}
|
||
|
|
catch(...)
|
||
|
|
{
|
||
|
|
results[i] = nullopt;
|
||
|
|
}
|
||
|
|
});
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class Vector>
|
||
|
|
void add_compiles(Vector& compiles)
|
||
|
|
{
|
||
|
|
if(config.has_value())
|
||
|
|
{
|
||
|
|
const auto& problem = config->problem;
|
||
|
|
if(auto sol = ctx->get_problem_cache().get(preop.name(), problem))
|
||
|
|
{
|
||
|
|
auto solution = sol.value();
|
||
|
|
// No solution yet until benchmarked so skip for now
|
||
|
|
if(solution.is_null())
|
||
|
|
return;
|
||
|
|
results.resize(1);
|
||
|
|
insert_compiles(compiles, solution, 0);
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
ctx->get_problem_cache().mark(preop.name(), problem);
|
||
|
|
const auto& solutions = config->solutions;
|
||
|
|
if(solutions.empty())
|
||
|
|
MIGRAPHX_THROW("No solutions provided for " + preop.name() + " with " +
|
||
|
|
to_string(problem));
|
||
|
|
results.resize(solutions.size());
|
||
|
|
for(auto i : range(solutions.size()))
|
||
|
|
{
|
||
|
|
auto solution = solutions[i];
|
||
|
|
insert_compiles(compiles, solution, i);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
results.resize(1);
|
||
|
|
insert_compiles(compiles, value{}, 0);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
std::string problem_string() const
|
||
|
|
{
|
||
|
|
if(config)
|
||
|
|
return to_string(config->problem);
|
||
|
|
return "<no problem key>";
|
||
|
|
}
|
||
|
|
|
||
|
|
const compiled_result& benchmark() const
|
||
|
|
{
|
||
|
|
const auto trace_level = value_of(MIGRAPHX_TRACE_BENCHMARKING{});
|
||
|
|
if(trace_level > 0 and not results.empty())
|
||
|
|
{
|
||
|
|
std::cout << "Benchmarking " << preop.name() << ": " << results.size() << " configs"
|
||
|
|
<< std::endl;
|
||
|
|
}
|
||
|
|
if(results.empty())
|
||
|
|
MIGRAPHX_THROW("No valid tuned compilation for " + preop.name() + " with " +
|
||
|
|
problem_string());
|
||
|
|
if(results.size() == 1)
|
||
|
|
{
|
||
|
|
if(not results.front().has_value())
|
||
|
|
MIGRAPHX_THROW("No valid tuned compilation for " + preop.name() + " with " +
|
||
|
|
problem_string());
|
||
|
|
return *results.front();
|
||
|
|
}
|
||
|
|
if(not config)
|
||
|
|
MIGRAPHX_THROW("Multiple kernels without config for " + preop.name());
|
||
|
|
if(trace_level > 1)
|
||
|
|
std::cout << "Problem: " << config->problem << std::endl;
|
||
|
|
std::vector<double> times;
|
||
|
|
times.reserve(results.size());
|
||
|
|
std::transform(results.begin(),
|
||
|
|
results.end(),
|
||
|
|
config->solutions.begin(),
|
||
|
|
std::back_inserter(times),
|
||
|
|
[&](const auto& cr, const auto& solution) {
|
||
|
|
if(trace_level > 1)
|
||
|
|
std::cout << "Benchmarking solution: " << solution << std::endl;
|
||
|
|
if(not cr.has_value())
|
||
|
|
{
|
||
|
|
if(trace_level > 1)
|
||
|
|
std::cout << "No binary" << std::endl;
|
||
|
|
return std::numeric_limits<double>::max();
|
||
|
|
}
|
||
|
|
if(trace_level > 2)
|
||
|
|
std::cout << *cr << std::endl;
|
||
|
|
/*
|
||
|
|
create a small program with insturction being compiled and call "replace"
|
||
|
|
on that which would insert all the compiled code objects, prefills etc.
|
||
|
|
necessary to run candidate code object
|
||
|
|
*/
|
||
|
|
program bench_prog;
|
||
|
|
auto* bench_mm = bench_prog.get_main_module();
|
||
|
|
std::vector<instruction_ref> bench_ins_inputs;
|
||
|
|
|
||
|
|
std::transform(cr->ins->inputs().begin(),
|
||
|
|
cr->ins->inputs().end(),
|
||
|
|
std::back_inserter(bench_ins_inputs),
|
||
|
|
[&](const auto& arg) {
|
||
|
|
return bench_mm->add_parameter(
|
||
|
|
std::to_string(bench_ins_inputs.size()),
|
||
|
|
arg->get_shape());
|
||
|
|
});
|
||
|
|
auto bench_ins = bench_mm->add_instruction(
|
||
|
|
cr->ins->get_operator(), bench_ins_inputs, cr->ins->module_inputs());
|
||
|
|
cr->replace.replace(*bench_mm, bench_ins);
|
||
|
|
// do dead code elimination by directly removing instruction
|
||
|
|
bench_mm->remove_instruction(bench_ins);
|
||
|
|
auto t = time_program(*ctx, bench_prog, 20);
|
||
|
|
if(trace_level > 1)
|
||
|
|
std::cout << t << "ms" << std::endl;
|
||
|
|
return t;
|
||
|
|
});
|
||
|
|
std::this_thread::sleep_for(std::chrono::milliseconds{50});
|
||
|
|
auto i = std::distance(times.begin(), std::min_element(times.begin(), times.end()));
|
||
|
|
if(trace_level > 0)
|
||
|
|
std::cout << "Fastest solution: " << config->solutions.at(i) << std::endl;
|
||
|
|
ctx->get_problem_cache().insert(preop.name(), config->problem, config->solutions.at(i));
|
||
|
|
if(not results[i].has_value())
|
||
|
|
MIGRAPHX_THROW("No valid tuned compilation for " + preop.name() + " with " +
|
||
|
|
problem_string());
|
||
|
|
auto skipped = std::count_if(
|
||
|
|
results.begin(), results.end(), [](const auto& cr) { return not cr.has_value(); });
|
||
|
|
if(skipped > 0)
|
||
|
|
std::cout << "Skipped " << skipped << " configs for " << preop.name() << std::endl;
|
||
|
|
|
||
|
|
return *results[i];
|
||
|
|
}
|
||
|
|
|
||
|
|
void replace(module& m) const
|
||
|
|
{
|
||
|
|
const auto& cr = benchmark();
|
||
|
|
cr.replace.replace(m, cr.ins);
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <class F>
|
||
|
|
void par_compile(std::size_t n, F f)
|
||
|
|
{
|
||
|
|
if(n == 0)
|
||
|
|
return;
|
||
|
|
auto d = value_of(MIGRAPHX_GPU_COMPILE_PARALLEL{});
|
||
|
|
if(d == 0)
|
||
|
|
d = n;
|
||
|
|
par_for(n, n / d, f);
|
||
|
|
}
|
||
|
|
|
||
|
|
struct compile_manager
|
||
|
|
{
|
||
|
|
std::vector<compile_plan> cps;
|
||
|
|
bool exhaustive = false;
|
||
|
|
|
||
|
|
template <class... Ts>
|
||
|
|
void add_plan(Ts&&... xs)
|
||
|
|
{
|
||
|
|
cps.push_back({std::forward<Ts>(xs)...});
|
||
|
|
}
|
||
|
|
|
||
|
|
void update_configs()
|
||
|
|
{
|
||
|
|
par_compile(cps.size(), [&](auto i) { cps[i].update_config(exhaustive); });
|
||
|
|
}
|
||
|
|
|
||
|
|
void compile(module& m)
|
||
|
|
{
|
||
|
|
std::vector<std::function<void()>> compiles;
|
||
|
|
for(auto& cp : cps)
|
||
|
|
{
|
||
|
|
cp.add_compiles(compiles);
|
||
|
|
}
|
||
|
|
par_compile(compiles.size(), [&](auto i) { compiles[i](); });
|
||
|
|
|
||
|
|
// Replace and/or benchmark
|
||
|
|
for(const auto& cp : cps)
|
||
|
|
{
|
||
|
|
if(cp.results.empty())
|
||
|
|
continue;
|
||
|
|
cp.replace(m);
|
||
|
|
}
|
||
|
|
|
||
|
|
// Remove compile_plan already executed
|
||
|
|
cps.erase(std::remove_if(cps.begin(),
|
||
|
|
cps.end(),
|
||
|
|
[](const auto& cp) { return not cp.results.empty(); }),
|
||
|
|
cps.end());
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
void compile_ops::apply(module& m) const
|
||
|
|
{
|
||
|
|
compile_manager cm;
|
||
|
|
cm.exhaustive = exhaustive_tune;
|
||
|
|
// Find all precompile ops
|
||
|
|
for(auto ins : iterator_for(m))
|
||
|
|
{
|
||
|
|
if(ins->name() != "gpu::precompile_op")
|
||
|
|
continue;
|
||
|
|
operation preop = any_cast<precompile_op>(ins->get_operator()).op;
|
||
|
|
cm.add_plan(ctx, preop, ins);
|
||
|
|
}
|
||
|
|
cm.update_configs();
|
||
|
|
cm.compile(m);
|
||
|
|
// Compile already tuned configs
|
||
|
|
cm.compile(m);
|
||
|
|
assert(cm.cps.empty());
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace gpu
|
||
|
|
|
||
|
|
} // namespace MIGRAPHX_INLINE_NS
|
||
|
|
} // namespace migraphx
|