-
Notifications
You must be signed in to change notification settings - Fork 87
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Split tests based on operator for ref_ops_test.cpp
- Loading branch information
Showing
3 changed files
with
164 additions
and
76 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,79 @@ | ||
/* | ||
* The MIT License (MIT) | ||
* | ||
* Copyright (c) 2015-2023 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 <iostream> | ||
#include <vector> | ||
#include <cmath> | ||
#include <random> | ||
#include <limits> | ||
#include <migraphx/literal.hpp> | ||
#include <migraphx/op/pooling.hpp> | ||
#include <migraphx/instruction.hpp> | ||
#include <migraphx/quantization.hpp> | ||
#include <migraphx/register_target.hpp> | ||
#include <migraphx/verify.hpp> | ||
#include <migraphx/onnx.hpp> | ||
#include <migraphx/make_op.hpp> | ||
|
||
#include <migraphx/serialize.hpp> | ||
|
||
#include "test.hpp" | ||
#include <migraphx/half.hpp> | ||
#include <iomanip> | ||
|
||
TEST_CASE(abs_test) | ||
{ | ||
migraphx::program p; | ||
auto* mm = p.get_main_module(); | ||
migraphx::shape s{migraphx::shape::float_type, {2, 2}}; | ||
auto l = mm->add_literal(migraphx::literal{s, {-1, 2, -3, 4}}); | ||
mm->add_instruction(migraphx::make_op("abs"), l); | ||
p.compile(migraphx::make_target("ref")); | ||
auto result = p.eval({}).back(); | ||
std::vector<float> results_vector(4); | ||
result.visit([&](auto output) { results_vector.assign(output.begin(), output.end()); }); | ||
std::vector<float> gold{1, 2, 3, 4}; | ||
EXPECT(migraphx::verify::verify_range(results_vector, gold)); | ||
} | ||
|
||
TEST_CASE(abs_dyn_test) | ||
{ | ||
migraphx::program p; | ||
auto* mm = p.get_main_module(); | ||
migraphx::shape s{migraphx::shape::float_type, {{2, 8}, {2, 2}}}; | ||
auto input = mm->add_parameter("X", s); | ||
mm->add_instruction(migraphx::make_op("abs"), input); | ||
p.compile(migraphx::make_target("ref")); | ||
|
||
std::vector<float> a = {-1, 2, -3, 4}; | ||
migraphx::parameter_map params0; | ||
migraphx::shape input_fixed_shape0{migraphx::shape::float_type, {2, 2}}; | ||
params0["X"] = migraphx::argument(input_fixed_shape0, a.data()); | ||
auto result = p.eval(params0).back(); | ||
std::vector<float> results_vector(4); | ||
result.visit([&](auto output) { results_vector.assign(output.begin(), output.end()); }); | ||
std::vector<float> gold{1, 2, 3, 4}; | ||
EXPECT(migraphx::verify::verify_range(results_vector, gold)); | ||
} | ||
|
||
int main(int argc, const char* argv[]) { test::run(argc, argv); } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,85 @@ | ||
/* | ||
* The MIT License (MIT) | ||
* | ||
* Copyright (c) 2015-2023 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 <iostream> | ||
#include <vector> | ||
#include <cmath> | ||
#include <random> | ||
#include <limits> | ||
#include <migraphx/literal.hpp> | ||
#include <migraphx/op/pooling.hpp> | ||
#include <migraphx/instruction.hpp> | ||
#include <migraphx/quantization.hpp> | ||
#include <migraphx/register_target.hpp> | ||
#include <migraphx/verify.hpp> | ||
#include <migraphx/onnx.hpp> | ||
#include <migraphx/make_op.hpp> | ||
|
||
#include <migraphx/serialize.hpp> | ||
|
||
#include "test.hpp" | ||
#include <migraphx/half.hpp> | ||
#include <iomanip> | ||
|
||
TEST_CASE(acos_test) | ||
{ | ||
migraphx::program p; | ||
auto* mm = p.get_main_module(); | ||
migraphx::shape s{migraphx::shape::double_type, {3}}; | ||
std::vector<float> data{-0.8f, 0.0f, 1.0f}; | ||
auto l = mm->add_literal(migraphx::literal{s, data}); | ||
mm->add_instruction(migraphx::make_op("acos"), l); | ||
p.compile(migraphx::make_target("ref")); | ||
auto result = p.eval({}).back(); | ||
std::vector<float> results_vector(3); | ||
result.visit([&](auto output) { results_vector.assign(output.begin(), output.end()); }); | ||
std::vector<float> gold = data; | ||
std::transform( | ||
gold.begin(), gold.end(), gold.begin(), [](float n) -> float { return acosf(n); }); | ||
EXPECT(migraphx::verify::verify_range(results_vector, gold)); | ||
} | ||
|
||
TEST_CASE(acos_dyn_test) | ||
{ | ||
migraphx::program p; | ||
auto* mm = p.get_main_module(); | ||
migraphx::shape::dynamic_dimension dd{3, 8}; | ||
migraphx::shape s{migraphx::shape::float_type, {dd}}; | ||
auto input = mm->add_parameter("X", s); | ||
mm->add_instruction(migraphx::make_op("acos"), input); | ||
p.compile(migraphx::make_target("ref")); | ||
|
||
std::vector<float> input_data{-0.8f, 0.0f, 1.0f}; | ||
migraphx::parameter_map params0; | ||
migraphx::shape input_fixed_shape0{migraphx::shape::float_type, {3}}; | ||
params0["X"] = migraphx::argument(input_fixed_shape0, input_data.data()); | ||
auto result = p.eval(params0).back(); | ||
std::vector<float> results_vector(3); | ||
result.visit([&](auto output) { results_vector.assign(output.begin(), output.end()); }); | ||
std::vector<float> gold = input_data; | ||
std::transform( | ||
gold.begin(), gold.end(), gold.begin(), [](float n) -> float { return acosf(n); }); | ||
EXPECT(migraphx::verify::verify_range(results_vector, gold)); | ||
} | ||
|
||
int main(int argc, const char* argv[]) { test::run(argc, argv); } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters