173d26085Sjeremylt /// @file 273d26085Sjeremylt /// Test creation, transpose use, and destruction of a multicomponent element restriction 373d26085Sjeremylt /// \test Test creation, transpose use, and destruction of a 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; 14*4fee36f0SJeremy L Thompson CeedElemRestriction elem_restriction; 1573d26085Sjeremylt 1673d26085Sjeremylt CeedInit(argv[1], &ceed); 1773d26085Sjeremylt 1873d26085Sjeremylt // Setup 19d1d35e2fSjeremylt CeedVectorCreate(ceed, 2 * (num_elem * 2), &x); 20*4fee36f0SJeremy L Thompson CeedVectorCreate(ceed, 2 * (num_elem + 1), &y); 21*4fee36f0SJeremy L Thompson CeedVectorSetValue(y, 0.0); // Allocates array, transpose mode sums into vector 2273d26085Sjeremylt 23d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) { 2473d26085Sjeremylt ind[2 * i + 0] = i; 2573d26085Sjeremylt ind[2 * i + 1] = i + 1; 2673d26085Sjeremylt } 27*4fee36f0SJeremy L Thompson CeedElemRestrictionCreate(ceed, num_elem, 2, 2, num_elem + 1, 2 * (num_elem + 1), CEED_MEM_HOST, CEED_USE_POINTER, ind, &elem_restriction); 2873d26085Sjeremylt 2949fd234cSJeremy L Thompson // Set x data in backend E-layout 30*4fee36f0SJeremy L Thompson CeedElemRestrictionGetELayout(elem_restriction, &layout); 31*4fee36f0SJeremy L Thompson { 32*4fee36f0SJeremy L Thompson CeedScalar x_array[2 * (num_elem * 2)]; 33*4fee36f0SJeremy L Thompson 342b730f8bSJeremy L Thompson for (CeedInt i = 0; i < 2; i++) { // Node 352b730f8bSJeremy L Thompson for (CeedInt j = 0; j < 2; j++) { // Component 362b730f8bSJeremy L Thompson for (CeedInt k = 0; k < num_elem; k++) { // Element 37*4fee36f0SJeremy L Thompson x_array[i * layout[0] + j * layout[1] + k * layout[2]] = 10 * j + (2 * k + i + 1) / 2; 382b730f8bSJeremy L Thompson } 392b730f8bSJeremy L Thompson } 402b730f8bSJeremy L Thompson } 41*4fee36f0SJeremy L Thompson CeedVectorSetArray(x, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 42*4fee36f0SJeremy L Thompson } 4349fd234cSJeremy L Thompson 4473d26085Sjeremylt // Restrict 45*4fee36f0SJeremy L Thompson CeedElemRestrictionApply(elem_restriction, CEED_TRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE); 4673d26085Sjeremylt 4773d26085Sjeremylt // Check 48*4fee36f0SJeremy L Thompson { 49*4fee36f0SJeremy L Thompson const CeedScalar *y_array; 50*4fee36f0SJeremy L Thompson 51*4fee36f0SJeremy L Thompson CeedVectorGetArrayRead(y, CEED_MEM_HOST, &y_array); 52d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem + 1; i++) { 53d1d35e2fSjeremylt mult = i > 0 && i < num_elem ? 2 : 1; 54*4fee36f0SJeremy 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); 55*4fee36f0SJeremy L Thompson if (y_array[i + num_elem + 1] != (10 + i) * mult) { 56a2546046Sjeremylt // LCOV_EXCL_START 57*4fee36f0SJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "] = %f != %f\n", i + num_elem + 1, (CeedScalar)y_array[i + num_elem + 1], 58*4fee36f0SJeremy L Thompson (10. + i) * mult); 59de996c55Sjeremylt // LCOV_EXCL_STOP 602b730f8bSJeremy L Thompson } 6173d26085Sjeremylt } 62*4fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(y, &y_array); 63*4fee36f0SJeremy L Thompson } 6473d26085Sjeremylt 6573d26085Sjeremylt CeedVectorDestroy(&x); 6673d26085Sjeremylt CeedVectorDestroy(&y); 67*4fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction); 6873d26085Sjeremylt CeedDestroy(&ceed); 6973d26085Sjeremylt return 0; 7073d26085Sjeremylt } 71