1 // Test creation, use, and destruction of a element restriction 2 #include <ceed.h> 3 4 int main(int argc, char **argv) { 5 Ceed ceed; 6 CeedVector x, y; 7 CeedInt ne = 3; 8 CeedInt ind[2*ne]; 9 CeedScalar a[ne+1]; 10 const CeedScalar *yy; 11 CeedElemRestriction r; 12 13 CeedInit(argv[1], &ceed); 14 CeedVectorCreate(ceed, ne+1, &x); 15 for (CeedInt i=0; i<ne+1; i++) a[i] = 10 + i; 16 CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, a); 17 18 for (CeedInt i=0; i<ne; i++) { 19 ind[2*i+0] = i; 20 ind[2*i+1] = i+1; 21 } 22 CeedElemRestrictionCreate(ceed, ne, 2, ne+1, 1, CEED_MEM_HOST, CEED_USE_POINTER, 23 ind, &r); 24 CeedVectorCreate(ceed, ne*2, &y); 25 CeedVectorSetArray(y, CEED_MEM_HOST, CEED_COPY_VALUES, NULL); // Allocates array 26 CeedElemRestrictionApply(r, CEED_NOTRANSPOSE, CEED_NOTRANSPOSE, x, y, 27 CEED_REQUEST_IMMEDIATE); 28 CeedVectorGetArrayRead(y, CEED_MEM_HOST, &yy); 29 for (CeedInt i=0; i<ne*2; i++) { 30 if (10+(i+1)/2 != yy[i]) 31 return CeedError(ceed, (int)i, "Error in restricted array y[%d] = %f", 32 i, (double)yy[i]); 33 } 34 CeedVectorRestoreArrayRead(y, &yy); 35 CeedVectorDestroy(&x); 36 CeedVectorDestroy(&y); 37 CeedElemRestrictionDestroy(&r); 38 CeedDestroy(&ceed); 39 return 0; 40 } 41