1be9261b7Sjeremylt /// @file 2be9261b7Sjeremylt /// Test creation, use, and destruction of a blocked element restriction 3be9261b7Sjeremylt /// \test Test creation, use, and destruction of a blocked element restriction 4be9261b7Sjeremylt #include <ceed.h> 50acb07cdSJeremy L Thompson #include <ceed/backend.h> 6be9261b7Sjeremylt 7be9261b7Sjeremylt int main(int argc, char **argv) { 8be9261b7Sjeremylt Ceed ceed; 9be9261b7Sjeremylt CeedVector x, y; 10d1d35e2fSjeremylt CeedInt num_elem = 8; 11d1d35e2fSjeremylt CeedInt elem_size = 2; 120acb07cdSJeremy L Thompson CeedInt blk_size = 5; 13d1d35e2fSjeremylt CeedInt ind[elem_size * num_elem]; 14d1d35e2fSjeremylt CeedScalar a[num_elem + 1]; 150acb07cdSJeremy L Thompson const CeedScalar *xx, *yy; 160acb07cdSJeremy L Thompson CeedInt layout[3]; 17be9261b7Sjeremylt CeedElemRestriction r; 18be9261b7Sjeremylt 19be9261b7Sjeremylt CeedInit(argv[1], &ceed); 20288c0443SJeremy L Thompson 21d1d35e2fSjeremylt CeedVectorCreate(ceed, num_elem + 1, &x); 22*2b730f8bSJeremy L Thompson for (CeedInt i = 0; i < num_elem + 1; i++) a[i] = 10 + i; 23be9261b7Sjeremylt CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, a); 24be9261b7Sjeremylt 25d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) { 260acb07cdSJeremy L Thompson ind[2 * i + 0] = i; 270acb07cdSJeremy L Thompson ind[2 * i + 1] = i + 1; 28be9261b7Sjeremylt } 29*2b730f8bSJeremy L Thompson CeedElemRestrictionCreateBlocked(ceed, num_elem, elem_size, blk_size, 1, 1, num_elem + 1, CEED_MEM_HOST, CEED_USE_POINTER, ind, &r); 30d1d35e2fSjeremylt CeedVectorCreate(ceed, blk_size * elem_size, &y); 31be9261b7Sjeremylt 32be9261b7Sjeremylt // NoTranspose 33*2b730f8bSJeremy L Thompson CeedElemRestrictionApplyBlock(r, 1, CEED_NOTRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE); 340acb07cdSJeremy L Thompson CeedVectorGetArrayRead(y, CEED_MEM_HOST, &yy); 350acb07cdSJeremy L Thompson CeedElemRestrictionGetELayout(r, &layout); 36*2b730f8bSJeremy L Thompson for (CeedInt i = 0; i < elem_size; i++) { // Node 37*2b730f8bSJeremy L Thompson for (CeedInt j = 0; j < 1; j++) { // Component 380acb07cdSJeremy L Thompson for (CeedInt k = blk_size; k < num_elem; k++) { // Element 390acb07cdSJeremy L Thompson CeedInt block = k / blk_size; 400acb07cdSJeremy L Thompson CeedInt elem = k % blk_size; 41*2b730f8bSJeremy L Thompson CeedInt index = (i * blk_size + elem) * layout[0] + j * layout[1] * blk_size + block * layout[2] * blk_size - blk_size * elem_size; 42*2b730f8bSJeremy L Thompson if (yy[index] != a[ind[k * elem_size + i]]) { 430acb07cdSJeremy L Thompson // LCOV_EXCL_START 44*2b730f8bSJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "][%" CeedInt_FMT "][%" CeedInt_FMT "] = %f\n", i, j, k, (double)yy[index]); 450acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 46db10e42cSDavid Medina } 47*2b730f8bSJeremy L Thompson } 48*2b730f8bSJeremy L Thompson } 49*2b730f8bSJeremy L Thompson } 500acb07cdSJeremy L Thompson CeedVectorRestoreArrayRead(y, &yy); 51be9261b7Sjeremylt 52be9261b7Sjeremylt // Transpose 530acb07cdSJeremy L Thompson CeedVectorSetValue(x, 0); 54*2b730f8bSJeremy L Thompson CeedElemRestrictionApplyBlock(r, 1, CEED_TRANSPOSE, y, x, CEED_REQUEST_IMMEDIATE); 550acb07cdSJeremy L Thompson CeedVectorGetArrayRead(x, CEED_MEM_HOST, &xx); 56*2b730f8bSJeremy L Thompson for (CeedInt i = blk_size; i < num_elem + 1; i++) { 57*2b730f8bSJeremy L Thompson if (xx[i] != (10 + i) * (i > blk_size && i < num_elem ? 2.0 : 1.0)) { 580acb07cdSJeremy L Thompson // LCOV_EXCL_START 59*2b730f8bSJeremy L Thompson printf("Error in restricted array x[%" CeedInt_FMT "] = %f\n", i, (double)xx[i]); 600acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 61*2b730f8bSJeremy L Thompson } 62*2b730f8bSJeremy L Thompson } 630acb07cdSJeremy L Thompson CeedVectorRestoreArrayRead(x, &xx); 64be9261b7Sjeremylt 65be9261b7Sjeremylt CeedVectorDestroy(&x); 66be9261b7Sjeremylt CeedVectorDestroy(&y); 67be9261b7Sjeremylt CeedElemRestrictionDestroy(&r); 68be9261b7Sjeremylt CeedDestroy(&ceed); 69be9261b7Sjeremylt return 0; 70be9261b7Sjeremylt } 71