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> 5*0acb07cdSJeremy 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; 12*0acb07cdSJeremy L Thompson CeedInt num_blk = 2; 13*0acb07cdSJeremy L Thompson CeedInt blk_size = 5; 14d1d35e2fSjeremylt CeedInt ind[elem_size*num_elem]; 15d1d35e2fSjeremylt CeedScalar a[num_elem + 1]; 16*0acb07cdSJeremy L Thompson const CeedScalar *xx, *yy; 17*0acb07cdSJeremy L Thompson CeedInt layout[3]; 18be9261b7Sjeremylt CeedElemRestriction r; 19be9261b7Sjeremylt 20be9261b7Sjeremylt CeedInit(argv[1], &ceed); 21288c0443SJeremy L Thompson 22d1d35e2fSjeremylt CeedVectorCreate(ceed, num_elem+1, &x); 23d1d35e2fSjeremylt for (CeedInt i=0; i<num_elem+1; i++) 24288c0443SJeremy L Thompson a[i] = 10 + i; 25be9261b7Sjeremylt CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, a); 26be9261b7Sjeremylt 27d1d35e2fSjeremylt for (CeedInt i=0; i<num_elem; i++) { 28*0acb07cdSJeremy L Thompson ind[2*i+0] = i; 29*0acb07cdSJeremy L Thompson ind[2*i+1] = i+1; 30be9261b7Sjeremylt } 31d1d35e2fSjeremylt CeedElemRestrictionCreateBlocked(ceed, num_elem, elem_size, blk_size, 1, 1, 32*0acb07cdSJeremy L Thompson num_elem+1, CEED_MEM_HOST, CEED_USE_POINTER, 33*0acb07cdSJeremy L Thompson ind, &r); 34d1d35e2fSjeremylt CeedVectorCreate(ceed, blk_size*elem_size, &y); 35be9261b7Sjeremylt CeedVectorSetValue(y, 0); // Allocates array 36be9261b7Sjeremylt 37be9261b7Sjeremylt // NoTranspose 38a8d32208Sjeremylt CeedElemRestrictionApplyBlock(r, 1, CEED_NOTRANSPOSE, x, y, 39be9261b7Sjeremylt CEED_REQUEST_IMMEDIATE); 40*0acb07cdSJeremy L Thompson CeedVectorGetArrayRead(y, CEED_MEM_HOST, &yy); 41*0acb07cdSJeremy L Thompson CeedElemRestrictionGetELayout(r, &layout); 42*0acb07cdSJeremy L Thompson for (CeedInt i=0; i<elem_size; i++) // Node 43*0acb07cdSJeremy L Thompson for (CeedInt j=0; j<1; j++) // Component 44*0acb07cdSJeremy L Thompson for (CeedInt k=blk_size; k<num_elem; k++) { // Element 45*0acb07cdSJeremy L Thompson CeedInt block = k / blk_size; 46*0acb07cdSJeremy L Thompson CeedInt elem = k % blk_size; 47*0acb07cdSJeremy L Thompson CeedInt index = (i*blk_size+elem)*layout[0] + j*layout[1]*blk_size + 48*0acb07cdSJeremy L Thompson block*layout[2]*blk_size - blk_size*elem_size; 49*0acb07cdSJeremy L Thompson if (yy[index] != a[ind[k*elem_size + i]]) 50*0acb07cdSJeremy L Thompson // LCOV_EXCL_START 51*0acb07cdSJeremy L Thompson printf("Error in restricted array y[%d][%d][%d] = %f\n", 52*0acb07cdSJeremy L Thompson i, j, k, (double)yy[index]); 53*0acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 54db10e42cSDavid Medina } 55*0acb07cdSJeremy L Thompson CeedVectorRestoreArrayRead(y, &yy); 56be9261b7Sjeremylt 57be9261b7Sjeremylt // Transpose 58*0acb07cdSJeremy L Thompson CeedVectorSetValue(x, 0); 59a8d32208Sjeremylt CeedElemRestrictionApplyBlock(r, 1, CEED_TRANSPOSE, y, x, 60be9261b7Sjeremylt CEED_REQUEST_IMMEDIATE); 61*0acb07cdSJeremy L Thompson CeedVectorGetArrayRead(x, CEED_MEM_HOST, &xx); 62*0acb07cdSJeremy L Thompson for (CeedInt i=blk_size; i<num_elem+1; i++) 63*0acb07cdSJeremy L Thompson if (xx[i] != (10+i)*(i > blk_size && i < num_elem ? 2.0 : 1.0)) 64*0acb07cdSJeremy L Thompson // LCOV_EXCL_START 65*0acb07cdSJeremy L Thompson printf("Error in restricted array x[%d] = %f\n", 66*0acb07cdSJeremy L Thompson i, (double)xx[i]); 67*0acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 68*0acb07cdSJeremy L Thompson CeedVectorRestoreArrayRead(x, &xx); 69be9261b7Sjeremylt 70be9261b7Sjeremylt CeedVectorDestroy(&x); 71be9261b7Sjeremylt CeedVectorDestroy(&y); 72be9261b7Sjeremylt CeedElemRestrictionDestroy(&r); 73be9261b7Sjeremylt CeedDestroy(&ceed); 74be9261b7Sjeremylt return 0; 75be9261b7Sjeremylt } 76