We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Instead of recomputing the "final" index to access a field each time (for each field), like:
... u_vert(kIter * NumVertices + nbhIdx) * dual_normal_x[kIter * NumEdges * E_C_V_SIZE + nbhIter * NumEdges + pidx]) + (v_vert[kIter * NumVertices + nbhIdx] ...
we should store, at the beginning of the relevant scope, such index, so that
nvcc
const int sparseIdx = kIter * NumEdges * E_C_V_SIZE + nbhIter * NumEdges + pidx; assert(sparseIdx < NumEdges * E_C_V_SIZE * kSize);
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Instead of recomputing the "final" index to access a field each time (for each field), like:
we should store, at the beginning of the relevant scope, such index, so that
nvcc
with common subexpression eliminationThe text was updated successfully, but these errors were encountered: