173d26085Sjeremylt /// @file 2ceac335aSJeremy L Thompson /// Test creation, transpose use, and destruction of an interlaced multi-component element restriction 3ceac335aSJeremy L Thompson /// \test Test creation, transpose use, and destruction of an interlaced multi-component element restriction 473d26085Sjeremylt #include <ceed.h> 5ec3da8bcSJed Brown #include <ceed/backend.h> 6*49aac155SJeremy L Thompson #include <stdio.h> 773d26085Sjeremylt 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]; 1349fd234cSJeremy L Thompson CeedInt layout[3]; 1449fd234cSJeremy L Thompson CeedScalar mult; 154fee36f0SJeremy L Thompson CeedElemRestriction elem_restriction; 1673d26085Sjeremylt 1773d26085Sjeremylt CeedInit(argv[1], &ceed); 184fee36f0SJeremy L Thompson CeedVectorCreate(ceed, 2 * (num_elem + 1), &y); 194fee36f0SJeremy L Thompson CeedVectorSetValue(y, 0.0); // Allocates array 2073d26085Sjeremylt 2173d26085Sjeremylt // Setup 22d1d35e2fSjeremylt CeedVectorCreate(ceed, 2 * (num_elem * 2), &x); 2373d26085Sjeremylt 24d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) { 25d979a051Sjeremylt ind[2 * i + 0] = 2 * i; 26d979a051Sjeremylt ind[2 * i + 1] = 2 * (i + 1); 2773d26085Sjeremylt } 284fee36f0SJeremy L Thompson CeedElemRestrictionCreate(ceed, num_elem, 2, 2, 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 314fee36f0SJeremy L Thompson CeedElemRestrictionGetELayout(elem_restriction, &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 384fee36f0SJeremy L Thompson x_array[i * layout[0] + j * layout[1] + k * 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[2 * i] != i * mult) { 56a2546046Sjeremylt // LCOV_EXCL_START 574fee36f0SJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", 2 * i, (CeedScalar)y_array[2 * i], i * mult); 58de996c55Sjeremylt // LCOV_EXCL_STOP 592b730f8bSJeremy L Thompson } 604fee36f0SJeremy L Thompson if (y_array[2 * i + 1] != (10 + i) * mult) { 61a2546046Sjeremylt // LCOV_EXCL_START 624fee36f0SJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", 2 * i + 1, (CeedScalar)y_array[2 * i + 1], (10. + i) * mult); 63de996c55Sjeremylt // LCOV_EXCL_STOP 6473d26085Sjeremylt } 652b730f8bSJeremy L Thompson } 664fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(y, &y_array); 674fee36f0SJeremy L Thompson } 6873d26085Sjeremylt 6973d26085Sjeremylt CeedVectorDestroy(&x); 7073d26085Sjeremylt CeedVectorDestroy(&y); 714fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction); 7273d26085Sjeremylt CeedDestroy(&ceed); 7373d26085Sjeremylt return 0; 7473d26085Sjeremylt } 75