Lines Matching full:v
47 CEED_QFUNCTION_HELPER CeedScalar DotN(const CeedScalar *u, const CeedScalar *v, const CeedInt N) { in DotN() argument
49 CeedPragmaSIMD for (CeedInt i = 0; i < N; i++) output += u[i] * v[i]; in DotN()
54 …dScalar Dot3(const CeedScalar *u, const CeedScalar *v) { return u[0] * v[0] + u[1] * v[1] + u[2] *… in Dot3() argument
57 CEED_QFUNCTION_HELPER void Cross3(const CeedScalar u[3], const CeedScalar v[3], CeedScalar w[3]) { in Cross3()
58 w[0] = (u[1] * v[2]) - (u[2] * v[1]); in Cross3()
59 w[1] = (u[2] * v[0]) - (u[0] * v[2]); in Cross3()
60 w[2] = (u[0] * v[1]) - (u[1] * v[0]); in Cross3()
64 CEED_QFUNCTION_HELPER void Curl3(const CeedScalar gradient[3][3], CeedScalar v[3]) { in Curl3()
65 v[0] = gradient[2][1] - gradient[1][2]; in Curl3()
66 v[1] = gradient[0][2] - gradient[2][0]; in Curl3()
67 v[2] = gradient[1][0] - gradient[0][1]; in Curl3()
157 CEED_QFUNCTION_HELPER void KMUnpack(const CeedScalar v[6], CeedScalar A[3][3]) { in KMUnpack()
159 A[0][0] = v[0]; in KMUnpack()
160 A[1][1] = v[1]; in KMUnpack()
161 A[2][2] = v[2]; in KMUnpack()
162 A[2][1] = A[1][2] = weight * v[3]; in KMUnpack()
163 A[2][0] = A[0][2] = weight * v[4]; in KMUnpack()
164 A[1][0] = A[0][1] = weight * v[5]; in KMUnpack()
168 CEED_QFUNCTION_HELPER void KMPack(const CeedScalar A[3][3], CeedScalar v[6]) { in KMPack()
170 v[0] = A[0][0]; in KMPack()
171 v[1] = A[1][1]; in KMPack()
172 v[2] = A[2][2]; in KMPack()
173 v[3] = A[2][1] * weight; in KMPack()
174 v[4] = A[2][0] * weight; in KMPack()
175 v[5] = A[1][0] * weight; in KMPack()