173d26085Sjeremylt /// @file
2ceac335aSJeremy L Thompson /// Test creation, transpose use, and destruction of a multi-component element restriction
3ceac335aSJeremy L Thompson /// \test Test creation, transpose use, and destruction of a multi-component element restriction
473d26085Sjeremylt #include <ceed.h>
5ec3da8bcSJed Brown #include <ceed/backend.h>
649aac155SJeremy L Thompson #include <stdio.h>
773d26085Sjeremylt
main(int argc,char ** argv)873d26085Sjeremylt int main(int argc, char **argv) {
973d26085Sjeremylt Ceed ceed;
1073d26085Sjeremylt CeedVector x, y;
11d1d35e2fSjeremylt CeedInt num_elem = 5;
12d1d35e2fSjeremylt CeedInt ind[2 * num_elem];
13*33c56a19SJeremy L Thompson CeedInt e_layout[3];
1449fd234cSJeremy L Thompson CeedScalar mult;
154fee36f0SJeremy L Thompson CeedElemRestriction elem_restriction;
1673d26085Sjeremylt
1773d26085Sjeremylt CeedInit(argv[1], &ceed);
1873d26085Sjeremylt
1973d26085Sjeremylt // Setup
20d1d35e2fSjeremylt CeedVectorCreate(ceed, 2 * (num_elem * 2), &x);
214fee36f0SJeremy L Thompson CeedVectorCreate(ceed, 2 * (num_elem + 1), &y);
224fee36f0SJeremy L Thompson CeedVectorSetValue(y, 0.0); // Allocates array, transpose mode sums into vector
2373d26085Sjeremylt
24d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) {
2573d26085Sjeremylt ind[2 * i + 0] = i;
2673d26085Sjeremylt ind[2 * i + 1] = i + 1;
2773d26085Sjeremylt }
284fee36f0SJeremy L Thompson CeedElemRestrictionCreate(ceed, num_elem, 2, 2, num_elem + 1, 2 * (num_elem + 1), CEED_MEM_HOST, CEED_USE_POINTER, ind, &elem_restriction);
2973d26085Sjeremylt
3049fd234cSJeremy L Thompson // Set x data in backend E-layout
31*33c56a19SJeremy L Thompson CeedElemRestrictionGetELayout(elem_restriction, e_layout);
324fee36f0SJeremy L Thompson {
334fee36f0SJeremy L Thompson CeedScalar x_array[2 * (num_elem * 2)];
344fee36f0SJeremy L Thompson
352b730f8bSJeremy L Thompson for (CeedInt i = 0; i < 2; i++) { // Node
362b730f8bSJeremy L Thompson for (CeedInt j = 0; j < 2; j++) { // Component
372b730f8bSJeremy L Thompson for (CeedInt k = 0; k < num_elem; k++) { // Element
38*33c56a19SJeremy L Thompson x_array[i * e_layout[0] + j * e_layout[1] + k * e_layout[2]] = 10 * j + (2 * k + i + 1) / 2;
392b730f8bSJeremy L Thompson }
402b730f8bSJeremy L Thompson }
412b730f8bSJeremy L Thompson }
424fee36f0SJeremy L Thompson CeedVectorSetArray(x, CEED_MEM_HOST, CEED_COPY_VALUES, x_array);
434fee36f0SJeremy L Thompson }
4449fd234cSJeremy L Thompson
4573d26085Sjeremylt // Restrict
464fee36f0SJeremy L Thompson CeedElemRestrictionApply(elem_restriction, CEED_TRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE);
4773d26085Sjeremylt
4873d26085Sjeremylt // Check
494fee36f0SJeremy L Thompson {
504fee36f0SJeremy L Thompson const CeedScalar *y_array;
514fee36f0SJeremy L Thompson
524fee36f0SJeremy L Thompson CeedVectorGetArrayRead(y, CEED_MEM_HOST, &y_array);
53d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem + 1; i++) {
54d1d35e2fSjeremylt mult = i > 0 && i < num_elem ? 2 : 1;
554fee36f0SJeremy L Thompson if (y_array[i] != i * mult) printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", i, (CeedScalar)y_array[i], i * mult);
564fee36f0SJeremy L Thompson if (y_array[i + num_elem + 1] != (10 + i) * mult) {
57a2546046Sjeremylt // LCOV_EXCL_START
584fee36f0SJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", i + num_elem + 1, (CeedScalar)y_array[i + num_elem + 1],
594fee36f0SJeremy L Thompson (10. + i) * mult);
60de996c55Sjeremylt // LCOV_EXCL_STOP
612b730f8bSJeremy L Thompson }
6273d26085Sjeremylt }
634fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(y, &y_array);
644fee36f0SJeremy L Thompson }
6573d26085Sjeremylt
6673d26085Sjeremylt CeedVectorDestroy(&x);
6773d26085Sjeremylt CeedVectorDestroy(&y);
684fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction);
6973d26085Sjeremylt CeedDestroy(&ceed);
7073d26085Sjeremylt return 0;
7173d26085Sjeremylt }
72