// RUN: %gtest_amp %s -o %t.out 
// RUN: %t.out

#include <hc.hpp>
#include <stdlib.h>
#include <iostream>
#ifndef __KALMAR_ACCELERATOR__
#include <gtest/gtest.h>
#endif

class myVecAdd {
 public:
  // CPU-side constructor. Written by the user
  myVecAdd(hc::array_view<int>& a,
    hc::array_view<int> &b,
    hc::array_view<int, 1> &c):
    a_(a), b_(b), c_(c) {
  }
  void operator() (hc::index<1> idx) [[hc]] {
    c_[idx] = a_[idx]+b_[idx];
  }
 private:
  hc::array_view<int> a_, b_;
  hc::array_view<int>& c_;
};
void bar(void) [[cpu, hc]] {
  int* foo = reinterpret_cast<int*>(&myVecAdd::__cxxamp_trampoline);
}
#ifndef __KALMAR_ACCELERATOR__
TEST(Design, Final) {
  const int vecSize = 100;

  // Alloc & init input data
  hc::extent<1> e(vecSize);
  hc::array_view<int, 1> a(vecSize);
  hc::array_view<int, 1> b(vecSize);
  hc::array_view<int, 1> c(vecSize);
  int sum = 0;
  hc::array_view<int> ga(a);
  hc::array_view<int> gb(b);
  myVecAdd mf(ga, gb, c);
  for (hc::index<1> i(0); i[0] < vecSize; i++) {
    ga[i] = 100.0f * rand() / RAND_MAX;
    gb[i] = 100.0f * rand() / RAND_MAX;
    sum += a[i] + b[i];
  }

  hc::parallel_for_each(
    e,
    mf);

  int error = 0;
  for(unsigned i = 0; i < vecSize; i++) {
    error += c[hc::index<1>(i)] - (ga[i] + gb[i]);
  }
  EXPECT_EQ(error, 0);
}
#endif