xref: /libCEED/tests/t207-elemrestriction.c (revision a8d322087fa8f150327cdc2bf14a171452b711ec)
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>
573d26085Sjeremylt 
673d26085Sjeremylt int main(int argc, char **argv) {
773d26085Sjeremylt   Ceed ceed;
873d26085Sjeremylt   CeedVector x, y;
973d26085Sjeremylt   CeedInt ne = 5, mult;
1073d26085Sjeremylt   CeedInt ind[2*ne];
1173d26085Sjeremylt   CeedScalar a[2*(ne*2)];
1273d26085Sjeremylt   const CeedScalar *yy;
1373d26085Sjeremylt   CeedElemRestriction r;
14*a8d32208Sjeremylt   CeedTransposeMode lmode = CEED_TRANSPOSE;
1573d26085Sjeremylt 
1673d26085Sjeremylt   CeedInit(argv[1], &ceed);
1773d26085Sjeremylt 
1873d26085Sjeremylt   // Setup
1973d26085Sjeremylt   CeedVectorCreate(ceed, 2*(ne*2), &x);
2073d26085Sjeremylt   for (CeedInt i=0; i<ne; i++) {
2173d26085Sjeremylt     for (CeedInt n=0; n<2; n++) {
2273d26085Sjeremylt       a[i*4+n] = 10+(2*i+n+1)/2;
2373d26085Sjeremylt       a[i*4+n+2] = 20+(2*i+n+1)/2;
2473d26085Sjeremylt     }
2573d26085Sjeremylt   }
2673d26085Sjeremylt   CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, a);
2773d26085Sjeremylt 
2873d26085Sjeremylt   for (CeedInt i=0; i<ne; i++) {
2973d26085Sjeremylt     ind[2*i+0] = i;
3073d26085Sjeremylt     ind[2*i+1] = i+1;
3173d26085Sjeremylt   }
32*a8d32208Sjeremylt   CeedElemRestrictionCreate(ceed, lmode, ne, 2, ne+1, 2, CEED_MEM_HOST,
33288c0443SJeremy L Thompson                             CEED_USE_POINTER, ind, &r);
3473d26085Sjeremylt   CeedVectorCreate(ceed, 2*(ne+1), &y);
3573d26085Sjeremylt   CeedVectorSetValue(y, 0); // Allocates array
3673d26085Sjeremylt 
3773d26085Sjeremylt   // Restrict
38*a8d32208Sjeremylt   CeedElemRestrictionApply(r, CEED_TRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE);
3973d26085Sjeremylt 
4073d26085Sjeremylt   // Check
4173d26085Sjeremylt   CeedVectorGetArrayRead(y, CEED_MEM_HOST, &yy);
4273d26085Sjeremylt   for (CeedInt i=0; i<ne+1; i++) {
4373d26085Sjeremylt     mult = i>0&&i<ne ? 2 : 1;
4473d26085Sjeremylt     if (yy[2*i] != (10+i)*mult)
45a2546046Sjeremylt       // LCOV_EXCL_START
4673d26085Sjeremylt       printf("Error in restricted array y[%d] = %f != %f\n",
4773d26085Sjeremylt              2*i, (double)yy[2*i], (10.+i)*mult);
48de996c55Sjeremylt     // LCOV_EXCL_STOP
4973d26085Sjeremylt     if (yy[2*i+1] != (20+i)*mult)
50a2546046Sjeremylt       // LCOV_EXCL_START
5173d26085Sjeremylt       printf("Error in restricted array y[%d] = %f != %f\n",
5273d26085Sjeremylt              2*i+1, (double)yy[2*i+1], (20.+i)*mult);
53de996c55Sjeremylt     // LCOV_EXCL_STOP
5473d26085Sjeremylt   }
5573d26085Sjeremylt 
5673d26085Sjeremylt   CeedVectorRestoreArrayRead(y, &yy);
5773d26085Sjeremylt   CeedVectorDestroy(&x);
5873d26085Sjeremylt   CeedVectorDestroy(&y);
5973d26085Sjeremylt   CeedElemRestrictionDestroy(&r);
6073d26085Sjeremylt   CeedDestroy(&ceed);
6173d26085Sjeremylt   return 0;
6273d26085Sjeremylt }
63