173d26085Sjeremylt /// @file 273d26085Sjeremylt /// Test creation, transpose use, and destruction of an interlaced multicomponent element restriction 373d26085Sjeremylt /// \test Test creation, transpose use, and destruction of an interlaced multicomponent element restriction 473d26085Sjeremylt #include <ceed.h> 5ec3da8bcSJed Brown #include <ceed/backend.h> 673d26085Sjeremylt 773d26085Sjeremylt int main(int argc, char **argv) { 873d26085Sjeremylt Ceed ceed; 973d26085Sjeremylt CeedVector x, y; 10d1d35e2fSjeremylt CeedInt num_elem = 5; 11d1d35e2fSjeremylt CeedInt ind[2 * num_elem]; 1249fd234cSJeremy L Thompson CeedInt layout[3]; 1349fd234cSJeremy L Thompson CeedScalar mult; 14d1d35e2fSjeremylt CeedScalar a[2 * (num_elem * 2)]; 1573d26085Sjeremylt const CeedScalar *yy; 1673d26085Sjeremylt CeedElemRestriction r; 1773d26085Sjeremylt 1873d26085Sjeremylt CeedInit(argv[1], &ceed); 1973d26085Sjeremylt 2073d26085Sjeremylt // Setup 21d1d35e2fSjeremylt CeedVectorCreate(ceed, 2 * (num_elem * 2), &x); 2273d26085Sjeremylt 23d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) { 24d979a051Sjeremylt ind[2 * i + 0] = 2 * i; 25d979a051Sjeremylt ind[2 * i + 1] = 2 * (i + 1); 2673d26085Sjeremylt } 27*2b730f8bSJeremy L Thompson CeedElemRestrictionCreate(ceed, num_elem, 2, 2, 1, 2 * (num_elem + 1), CEED_MEM_HOST, CEED_USE_POINTER, ind, &r); 28d1d35e2fSjeremylt CeedVectorCreate(ceed, 2 * (num_elem + 1), &y); 2973d26085Sjeremylt CeedVectorSetValue(y, 0); // Allocates array 3073d26085Sjeremylt 3149fd234cSJeremy L Thompson // Set x data in backend E-layout 3249fd234cSJeremy L Thompson CeedElemRestrictionGetELayout(r, &layout); 33*2b730f8bSJeremy L Thompson for (CeedInt i = 0; i < 2; i++) { // Node 34*2b730f8bSJeremy L Thompson for (CeedInt j = 0; j < 2; j++) { // Component 35*2b730f8bSJeremy L Thompson for (CeedInt k = 0; k < num_elem; k++) { // Element 3649fd234cSJeremy L Thompson a[i * layout[0] + j * layout[1] + k * layout[2]] = 10 * j + (2 * k + i + 1) / 2; 37*2b730f8bSJeremy L Thompson } 38*2b730f8bSJeremy L Thompson } 39*2b730f8bSJeremy L Thompson } 4049fd234cSJeremy L Thompson CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, a); 4149fd234cSJeremy L Thompson 4273d26085Sjeremylt // Restrict 43a8d32208Sjeremylt CeedElemRestrictionApply(r, CEED_TRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE); 4473d26085Sjeremylt 4573d26085Sjeremylt // Check 4673d26085Sjeremylt CeedVectorGetArrayRead(y, CEED_MEM_HOST, &yy); 47d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem + 1; i++) { 48d1d35e2fSjeremylt mult = i > 0 && i < num_elem ? 2 : 1; 49*2b730f8bSJeremy L Thompson if (yy[2 * i] != i * mult) { 50a2546046Sjeremylt // LCOV_EXCL_START 51*2b730f8bSJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", 2 * i, (CeedScalar)yy[2 * i], i * mult); 52de996c55Sjeremylt // LCOV_EXCL_STOP 53*2b730f8bSJeremy L Thompson } 54*2b730f8bSJeremy L Thompson if (yy[2 * i + 1] != (10 + i) * mult) { 55a2546046Sjeremylt // LCOV_EXCL_START 56*2b730f8bSJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", 2 * i + 1, (CeedScalar)yy[2 * i + 1], (10. + i) * mult); 57de996c55Sjeremylt // LCOV_EXCL_STOP 5873d26085Sjeremylt } 59*2b730f8bSJeremy L Thompson } 6073d26085Sjeremylt 6173d26085Sjeremylt CeedVectorRestoreArrayRead(y, &yy); 6273d26085Sjeremylt CeedVectorDestroy(&x); 6373d26085Sjeremylt CeedVectorDestroy(&y); 6473d26085Sjeremylt CeedElemRestrictionDestroy(&r); 6573d26085Sjeremylt CeedDestroy(&ceed); 6673d26085Sjeremylt return 0; 6773d26085Sjeremylt } 68