Home
last modified time | relevance | path

Searched refs:b_t (Results 1 – 2 of 2) sorted by relevance

/libCEED/include/ceed/jit-source/cuda/
H A Dcuda-ref-operator-assemble-diagonal.h66 const CeedScalar *b_t = NULL; in __launch_bounds__() local
68 … GetBasisPointer(&b_t, eval_modes_out[e_out], identity, interp_out, grad_out, div_out, curl_out); in __launch_bounds__()
70 else b_t = &b_t[(++d_out) * NUM_QPTS * NUM_NODES]; in __launch_bounds__()
94 e_value += b_t[q * NUM_NODES + tid] * qf_value * b[q * NUM_NODES + tid]; in __launch_bounds__()
108 e_value += b_t[q * NUM_NODES + tid] * qf_value * b[q * NUM_NODES + tid]; in __launch_bounds__()
/libCEED/include/ceed/jit-source/hip/
H A Dhip-ref-operator-assemble-diagonal.h66 const CeedScalar *b_t = NULL; in __launch_bounds__() local
68 … GetBasisPointer(&b_t, eval_modes_out[e_out], identity, interp_out, grad_out, div_out, curl_out); in __launch_bounds__()
70 else b_t = &b_t[(++d_out) * NUM_QPTS * NUM_NODES]; in __launch_bounds__()
94 e_value += b_t[q * NUM_NODES + tid] * qf_value * b[q * NUM_NODES + tid]; in __launch_bounds__()
108 e_value += b_t[q * NUM_NODES + tid] * qf_value * b[q * NUM_NODES + tid]; in __launch_bounds__()