10036de2cSjeremylt /// @file 20036de2cSjeremylt /// Test creation, use, and destruction of a blocked element restriction with multiple components in the lvector, and libCEED owns ind pointer 30036de2cSjeremylt /// \test Test creation, use, and destruction of a blocked element restriction with multiple components in the lvector, and libCEED owns ind pointer 40036de2cSjeremylt #include <ceed.h> 50acb07cdSJeremy L Thompson #include <ceed/backend.h> 60acb07cdSJeremy L Thompson #include <stdlib.h> 70acb07cdSJeremy L Thompson #include <string.h> 80036de2cSjeremylt 90036de2cSjeremylt int main(int argc, char **argv) { 100036de2cSjeremylt Ceed ceed; 110036de2cSjeremylt CeedVector x, y; 12d1d35e2fSjeremylt CeedInt num_elem = 8; 130acb07cdSJeremy L Thompson CeedInt elem_size = 2; 140acb07cdSJeremy L Thompson CeedInt num_blk = 2; 15d1d35e2fSjeremylt CeedInt blk_size = 5; 16d1d35e2fSjeremylt CeedInt num_comp = 3; 170acb07cdSJeremy L Thompson CeedInt ind[elem_size * num_elem]; 180acb07cdSJeremy L Thompson CeedInt *ceed_ind = malloc(sizeof(CeedInt) * elem_size * num_elem); 19*4fee36f0SJeremy L Thompson CeedScalar x_array[num_comp * (num_elem + 1)]; 200acb07cdSJeremy L Thompson CeedInt layout[3]; 21*4fee36f0SJeremy L Thompson CeedElemRestriction elem_restriction; 220036de2cSjeremylt 230036de2cSjeremylt CeedInit(argv[1], &ceed); 240036de2cSjeremylt 250acb07cdSJeremy L Thompson CeedVectorCreate(ceed, num_comp * (num_elem + 1), &x); 260acb07cdSJeremy L Thompson for (CeedInt i = 0; i < num_elem + 1; i++) { 27*4fee36f0SJeremy L Thompson x_array[i + 0 * (num_elem + 1)] = 10 + i; 28*4fee36f0SJeremy L Thompson x_array[i + 1 * (num_elem + 1)] = 20 + i; 29*4fee36f0SJeremy L Thompson x_array[i + 2 * (num_elem + 1)] = 30 + i; 300036de2cSjeremylt } 31*4fee36f0SJeremy L Thompson CeedVectorSetArray(x, CEED_MEM_HOST, CEED_USE_POINTER, x_array); 32*4fee36f0SJeremy L Thompson CeedVectorCreate(ceed, num_comp * num_blk * blk_size * elem_size, &y); 330acb07cdSJeremy L Thompson 34d1d35e2fSjeremylt for (CeedInt i = 0; i < num_elem; i++) { 350036de2cSjeremylt ind[2 * i + 0] = i; 360036de2cSjeremylt ind[2 * i + 1] = i + 1; 370036de2cSjeremylt } 380acb07cdSJeremy L Thompson memcpy(ceed_ind, ind, sizeof(CeedInt) * elem_size * num_elem); 392b730f8bSJeremy L Thompson CeedElemRestrictionCreateBlocked(ceed, num_elem, elem_size, blk_size, num_comp, num_elem + 1, num_comp * (num_elem + 1), CEED_MEM_HOST, 40*4fee36f0SJeremy L Thompson CEED_OWN_POINTER, ceed_ind, &elem_restriction); 410036de2cSjeremylt 420036de2cSjeremylt // NoTranspose 43*4fee36f0SJeremy L Thompson CeedElemRestrictionApply(elem_restriction, CEED_NOTRANSPOSE, x, y, CEED_REQUEST_IMMEDIATE); 44*4fee36f0SJeremy L Thompson { 45*4fee36f0SJeremy L Thompson const CeedScalar *y_array; 46*4fee36f0SJeremy L Thompson 47*4fee36f0SJeremy L Thompson CeedVectorGetArrayRead(y, CEED_MEM_HOST, &y_array); 48*4fee36f0SJeremy L Thompson CeedElemRestrictionGetELayout(elem_restriction, &layout); 492b730f8bSJeremy L Thompson for (CeedInt i = 0; i < elem_size; i++) { // Node 502b730f8bSJeremy L Thompson for (CeedInt j = 0; j < num_comp; j++) { // Component 510acb07cdSJeremy L Thompson for (CeedInt k = 0; k < num_elem; k++) { // Element 520acb07cdSJeremy L Thompson CeedInt block = k / blk_size; 530acb07cdSJeremy L Thompson CeedInt elem = k % blk_size; 542b730f8bSJeremy L Thompson CeedInt index = (i * blk_size + elem) * layout[0] + j * layout[1] * blk_size + block * layout[2] * blk_size; 55*4fee36f0SJeremy L Thompson if (y_array[index] != x_array[ind[k * elem_size + i] + j * (num_elem + 1)]) 560acb07cdSJeremy L Thompson // LCOV_EXCL_START 57*4fee36f0SJeremy L Thompson printf("Error in restricted array y[%" CeedInt_FMT "][%" CeedInt_FMT "][%" CeedInt_FMT "] = %f\n", i, j, k, (double)y_array[index]); 580acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 590acb07cdSJeremy L Thompson } 602b730f8bSJeremy L Thompson } 612b730f8bSJeremy L Thompson } 62*4fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(y, &y_array); 63*4fee36f0SJeremy L Thompson } 640036de2cSjeremylt 650036de2cSjeremylt // Transpose 660acb07cdSJeremy L Thompson CeedVectorSetValue(x, 0); 67*4fee36f0SJeremy L Thompson CeedElemRestrictionApply(elem_restriction, CEED_TRANSPOSE, y, x, CEED_REQUEST_IMMEDIATE); 68*4fee36f0SJeremy L Thompson { 69*4fee36f0SJeremy L Thompson const CeedScalar *x_array; 70*4fee36f0SJeremy L Thompson 71*4fee36f0SJeremy L Thompson CeedVectorGetArrayRead(x, CEED_MEM_HOST, &x_array); 720acb07cdSJeremy L Thompson for (CeedInt i = 0; i < num_elem + 1; i++) { 730acb07cdSJeremy L Thompson for (CeedInt j = 0; j < num_comp; j++) { 74*4fee36f0SJeremy L Thompson if (x_array[i + j * (num_elem + 1)] != ((j + 1) * 10 + i) * (i > 0 && i < num_elem ? 2.0 : 1.0)) { 750acb07cdSJeremy L Thompson // LCOV_EXCL_START 76*4fee36f0SJeremy L Thompson printf("Error in restricted array x[%" CeedInt_FMT "][%" CeedInt_FMT "] = %f\n", j, i, (double)x_array[i + j * (num_elem + 1)]); 770acb07cdSJeremy L Thompson // LCOV_EXCL_STOP 780acb07cdSJeremy L Thompson } 790acb07cdSJeremy L Thompson } 802b730f8bSJeremy L Thompson } 81*4fee36f0SJeremy L Thompson CeedVectorRestoreArrayRead(x, &x_array); 82*4fee36f0SJeremy L Thompson } 830036de2cSjeremylt 840036de2cSjeremylt CeedVectorDestroy(&x); 850036de2cSjeremylt CeedVectorDestroy(&y); 86*4fee36f0SJeremy L Thompson CeedElemRestrictionDestroy(&elem_restriction); 870036de2cSjeremylt CeedDestroy(&ceed); 880036de2cSjeremylt return 0; 890036de2cSjeremylt } 90