Lines Matching +full:- +full:t

1 // Copyright (c) 2017-2026, Lawrence Livermore National Security, LLC and other CEED contributors.
2 // All Rights Reserved. See the top-level LICENSE and NOTICE files for details.
4 // SPDX-License-Identifier: BSD-2-Clause
18 //------------------------------------------------------------------------------
20 //------------------------------------------------------------------------------
28   const int l = threadIdx.x;  // The output column index of each B^T D B operation  in __launch_bounds__()
29                               // such that we have (Bout^T)_ij D_jk Bin_kl = C_il  in __launch_bounds__()
31 …mined by the reference (interface) implementation of the symbolic assembly, slowest --> fastest: e,  in __launch_bounds__()
37   // Strides for QF array, slowest --> fastest: e_in, comp_in, e_out, comp_out, e, q  in __launch_bounds__()
59               // Perform the B^T D B operation for this 'chunk' of D (the qf_array)  in __launch_bounds__()
66             result *= orients_in[NUM_NODES_IN * e + l] ? -1.0 : 1.0;  in __launch_bounds__()
69             result *= orients_out[NUM_NODES_OUT * e + i] ? -1.0 : 1.0;  in __launch_bounds__()
79 …(l > 0 ? s_C[NUM_NODES_IN * threadIdx.y + l - 1] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l - …  in __launch_bounds__()
81 …(l < (NUM_NODES_IN - 1) ? s_C[NUM_NODES_IN * threadIdx.y + l + 1] * curl_orients_in[3 * NUM_NODES_…  in __launch_bounds__()
87 …// Compute and store the final T^T (B^T D B T) using the fully computed C T product in shared memo…  in __launch_bounds__()
94 …(i > 0 ? s_CT[NUM_NODES_IN * (i - 1) + l] * curl_orients_out[3 * NUM_NODES_OUT * e + 3 * i - 1] : …  in __launch_bounds__()
96 …(i < (NUM_NODES_OUT - 1) ? s_CT[NUM_NODES_IN * (i + 1) + l] * curl_orients_out[3 * NUM_NODES_OUT *…  in __launch_bounds__()