Lines Matching full:0
19 // in[0] is Jacobians with shape [dim, dim, Q] in build_diff()
22 CeedScalar(*q_data)[CEED_Q_VLA] = (CeedScalar(*)[CEED_Q_VLA])out[0]; in build_diff()
28 const CeedScalar(*J)[1][CEED_Q_VLA] = (const CeedScalar(*)[1][CEED_Q_VLA])in[0]; in build_diff()
30 …CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { q_data[0][i] = w[i] / J[0][0][i]; } // End of Qu… in build_diff()
33 const CeedScalar(*J)[2][CEED_Q_VLA] = (const CeedScalar(*)[2][CEED_Q_VLA])in[0]; in build_diff()
35 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { in build_diff()
36 // J: 0 2 q_data: 0 2 adj(J): J11 -J01 in build_diff()
38 const CeedScalar J00 = J[0][0][i]; in build_diff()
39 const CeedScalar J10 = J[0][1][i]; in build_diff()
40 const CeedScalar J01 = J[1][0][i]; in build_diff()
44 q_data[0][i] = qw * (J01 * J01 + J11 * J11); in build_diff()
50 const CeedScalar(*J)[3][CEED_Q_VLA] = (const CeedScalar(*)[3][CEED_Q_VLA])in[0]; in build_diff()
52 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { in build_diff()
56 for (CeedInt j = 0; j < 3; j++) { in build_diff()
57 for (CeedInt k = 0; k < 3; k++) { in build_diff()
66 … const CeedScalar qw = w[i] / (J[0][0][i] * A[0][0] + J[0][1][i] * A[0][1] + J[0][2][i] * A[0][2]); in build_diff()
70 // 0 5 4 in build_diff()
73 q_data[0][i] = qw * (A[0][0] * A[0][0] + A[0][1] * A[0][1] + A[0][2] * A[0][2]); in build_diff()
74 q_data[1][i] = qw * (A[1][0] * A[1][0] + A[1][1] * A[1][1] + A[1][2] * A[1][2]); in build_diff()
75 q_data[2][i] = qw * (A[2][0] * A[2][0] + A[2][1] * A[2][1] + A[2][2] * A[2][2]); in build_diff()
76 q_data[3][i] = qw * (A[1][0] * A[2][0] + A[1][1] * A[2][1] + A[1][2] * A[2][2]); in build_diff()
77 q_data[4][i] = qw * (A[0][0] * A[2][0] + A[0][1] * A[2][1] + A[0][2] * A[2][2]); in build_diff()
78 q_data[5][i] = qw * (A[0][0] * A[1][0] + A[0][1] * A[1][1] + A[0][2] * A[1][2]); in build_diff()
89 // in[0], out[0] solution gradients with shape [dim, 1, Q] in apply_diff()
95 const CeedScalar *ug = in[0]; in apply_diff()
96 CeedScalar *vg = out[0]; in apply_diff()
98 …CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { vg[i] = ug[i] * q_data[0][i]; } // End of Quadra… in apply_diff()
101 const CeedScalar(*ug)[CEED_Q_VLA] = (const CeedScalar(*)[CEED_Q_VLA])in[0]; in apply_diff()
102 CeedScalar(*vg)[CEED_Q_VLA] = (CeedScalar(*)[CEED_Q_VLA])out[0]; in apply_diff()
104 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { in apply_diff()
107 // 0 2 in apply_diff()
110 {q_data[0][i], q_data[2][i]}, in apply_diff()
115 …for (int j = 0; j < 2; j++) vg[j][i] = (ug[0][i] * dXdxdXdx_T[0][j] + ug[1][i] * dXdxdXdx_T[1][j]); in apply_diff()
119 const CeedScalar(*ug)[CEED_Q_VLA] = (const CeedScalar(*)[CEED_Q_VLA])in[0]; in apply_diff()
120 CeedScalar(*vg)[CEED_Q_VLA] = (CeedScalar(*)[CEED_Q_VLA])out[0]; in apply_diff()
122 CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { in apply_diff()
125 // 0 5 4 in apply_diff()
129 {q_data[0][i], q_data[5][i], q_data[4][i]}, in apply_diff()
135 …for (int j = 0; j < 3; j++) vg[j][i] = (ug[0][i] * dXdxdXdx_T[0][j] + ug[1][i] * dXdxdXdx_T[1][j] … in apply_diff()