Searched refs:p_ceed (Results 1 – 2 of 2) sorted by relevance
330 for (CeedInt p_ceed = 0; p_ceed < P; p_ceed++) { in BasisCreateFromTabulation() local331 CeedInt p_petsc = is_simplex ? (p_ceed * num_comp) : permutation_indices[p_ceed * num_comp]; in BasisCreateFromTabulation()333 …interp[q * P + p_ceed] = basis_tabulation->T[0][((face * Q + q) * P * num_comp + p_petsc) * num_co… in BasisCreateFromTabulation()335 …grad[(d * Q + q) * P + p_ceed] = basis_tabulation->T[1][(((face * Q + q) * P * num_comp + p_petsc)… in BasisCreateFromTabulation()
319 for (CeedInt p_ceed = 0; p_ceed < P; p_ceed++) { in BasisCreateFromTabulation() local320 CeedInt p_petsc = is_simplex ? (p_ceed * num_comp) : permutation_indices[p_ceed * num_comp]; in BasisCreateFromTabulation()322 …interp[q * P + p_ceed] = basis_tabulation->T[0][((face * Q + q) * P * num_comp + p_petsc) * num_co… in BasisCreateFromTabulation()324 …grad[(d * Q + q) * P + p_ceed] = basis_tabulation->T[1][(((face * Q + q) * P * num_comp + p_petsc)… in BasisCreateFromTabulation()