2024-01-11 22:27:44 +08:00
|
|
|
// Copyright © 2023 Apple Inc.
|
|
|
|
|
2024-01-15 22:08:18 +08:00
|
|
|
#include <iostream> // TODO
|
2024-01-11 22:27:44 +08:00
|
|
|
#include "doctest/doctest.h"
|
2024-01-15 22:08:18 +08:00
|
|
|
#include "mlx/utils.h" // TODO
|
2024-01-11 22:27:44 +08:00
|
|
|
|
|
|
|
#include "mlx/mlx.h"
|
|
|
|
|
|
|
|
using namespace mlx::core;
|
|
|
|
|
|
|
|
std::vector<array> simple_fun(const std::vector<array>& inputs) {
|
|
|
|
return std::vector<array>{inputs[0] + inputs[1]};
|
2024-01-15 11:42:36 +08:00
|
|
|
}
|
2024-01-11 22:27:44 +08:00
|
|
|
|
|
|
|
TEST_CASE("test simple compile") {
|
|
|
|
auto compfn = compile(simple_fun);
|
2024-01-15 11:42:36 +08:00
|
|
|
auto out = compfn({array(1.0f), array(2.0f)})[0];
|
2024-01-11 22:27:44 +08:00
|
|
|
CHECK_EQ(out.item<float>(), 3.0f);
|
2024-01-15 01:50:31 +08:00
|
|
|
|
2024-01-15 11:42:36 +08:00
|
|
|
out = compfn({array(1.0f), array(2.0f)})[0];
|
2024-01-15 01:50:31 +08:00
|
|
|
CHECK_EQ(out.item<float>(), 3.0f);
|
2024-01-15 11:42:36 +08:00
|
|
|
|
|
|
|
// Change the shapes
|
|
|
|
out = compfn({array({1.0f, 2.0f}), array(2.0f)})[0];
|
|
|
|
CHECK(array_equal(out, array({3.0f, 4.0f})).item<bool>());
|
|
|
|
|
|
|
|
out = compfn({array(2.0f), array({1.0f, 2.0f})})[0];
|
|
|
|
CHECK(array_equal(out, array({3.0f, 4.0f})).item<bool>());
|
|
|
|
|
|
|
|
// Change the types
|
|
|
|
out = compfn({array(2, int32), array({1.0f, 2.0f})})[0];
|
|
|
|
CHECK(array_equal(out, array({3.0f, 4.0f})).item<bool>());
|
|
|
|
|
|
|
|
out = compfn({array(2.0f), array({1, 2}, int32)})[0];
|
|
|
|
CHECK(array_equal(out, array({3.0f, 4.0f})).item<bool>());
|
2024-01-11 22:27:44 +08:00
|
|
|
}
|
2024-01-15 11:42:36 +08:00
|
|
|
|
2024-01-15 22:08:18 +08:00
|
|
|
std::vector<array> grad_fun(const std::vector<array>& inputs) {
|
2024-01-15 11:42:36 +08:00
|
|
|
auto loss = [](std::vector<array> ins) { return exp(ins[0] + ins[1]); };
|
2024-01-15 22:08:18 +08:00
|
|
|
return grad(loss, {0, 1})(inputs);
|
2024-01-15 11:42:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("test compile with grad") {
|
|
|
|
auto x = array(1.0f);
|
|
|
|
auto y = array(1.0f);
|
2024-01-15 22:08:18 +08:00
|
|
|
auto grads_expected = grad_fun({x, y});
|
|
|
|
auto grads_compile = compile(grad_fun)({x, y});
|
2024-01-15 11:42:36 +08:00
|
|
|
CHECK_EQ(grads_compile[0].item<float>(), grads_expected[0].item<float>());
|
2024-01-15 22:08:18 +08:00
|
|
|
CHECK_EQ(grads_compile[1].item<float>(), grads_expected[1].item<float>());
|
2024-01-15 11:42:36 +08:00
|
|
|
}
|
|
|
|
|
2024-01-15 22:08:18 +08:00
|
|
|
TEST_CASE("test compile inputs with primitive") {
|
|
|
|
auto [k1, k2] = random::split(random::key(0));
|
|
|
|
auto x = random::uniform({5, 5}, k1);
|
|
|
|
auto y = random::uniform({5, 5}, k2);
|
|
|
|
auto expected = simple_fun({x, y})[0];
|
|
|
|
|
|
|
|
x = random::uniform({5, 5}, k1);
|
|
|
|
y = random::uniform({5, 5}, k2);
|
|
|
|
auto out = compile(simple_fun)({x, y})[0];
|
|
|
|
CHECK(array_equal(expected, out).item<bool>());
|
|
|
|
|
|
|
|
// Same thing twice
|
|
|
|
out = compile(simple_fun)({x, y})[0];
|
|
|
|
CHECK(array_equal(expected, out).item<bool>());
|
|
|
|
}
|
|
|
|
|
|
|
|
/*std::vector<array> bigger_fun(const std::vector<array>& inputs) {
|
|
|
|
auto x = inputs[1];
|
|
|
|
for (int i = 1; i < inputs.size(); ++i) {
|
|
|
|
w = inputs[i]
|
|
|
|
x = maximum(matmul(x, w), 0);
|
|
|
|
}
|
|
|
|
return take(x, array(3)) - logsumexp(x);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE("test bigger graph") {
|
|
|
|
std::vector<array> inputs;
|
|
|
|
inputs.push_back(
|
|
|
|
for (int
|
|
|
|
for
|
|
|
|
}*/
|
|
|
|
|
2024-01-15 11:42:36 +08:00
|
|
|
TEST_CASE("test nested compile") {}
|