Searched refs:is_node (Results 1 – 3 of 3) sorted by relevance
252 bool *is_node; in CeedElemRestrictionOffset_Sycl() local265 CeedCallBackend(CeedCalloc(l_size, &is_node)); in CeedElemRestrictionOffset_Sycl()268 for (CeedInt i = 0; i < size_indices; i++) is_node[indices[i]] = 1; in CeedElemRestrictionOffset_Sycl()269 for (CeedInt i = 0; i < l_size; i++) num_nodes += is_node[i]; in CeedElemRestrictionOffset_Sycl()276 if (is_node[i]) { in CeedElemRestrictionOffset_Sycl()281 CeedCallBackend(CeedFree(&is_node)); in CeedElemRestrictionOffset_Sycl()
418 bool *is_node; in CeedElemRestrictionOffset_Cuda() local434 CeedCallBackend(CeedCalloc(l_size, &is_node)); in CeedElemRestrictionOffset_Cuda()436 for (CeedInt i = 0; i < size_indices; i++) is_node[indices[i]] = 1; in CeedElemRestrictionOffset_Cuda()437 for (CeedInt i = 0; i < l_size; i++) num_nodes += is_node[i]; in CeedElemRestrictionOffset_Cuda()444 if (is_node[i]) { in CeedElemRestrictionOffset_Cuda()449 CeedCallBackend(CeedFree(&is_node)); in CeedElemRestrictionOffset_Cuda()
419 bool *is_node; in CeedElemRestrictionOffset_Hip() local435 CeedCallBackend(CeedCalloc(l_size, &is_node)); in CeedElemRestrictionOffset_Hip()437 for (CeedInt i = 0; i < size_indices; i++) is_node[indices[i]] = 1; in CeedElemRestrictionOffset_Hip()438 for (CeedInt i = 0; i < l_size; i++) num_nodes += is_node[i]; in CeedElemRestrictionOffset_Hip()445 if (is_node[i]) { in CeedElemRestrictionOffset_Hip()450 CeedCallBackend(CeedFree(&is_node)); in CeedElemRestrictionOffset_Hip()