Searched refs:numInnerNodes (Results 1 – 4 of 4) sorted by relevance
146 const uint numInnerNodes = BVHBase_numNodes(bvh);147 const uint startID = (get_group_id(0) + 0) * numInnerNodes / get_num_groups(0);148 const uint endID = (get_group_id(0) + 1) * numInnerNodes / get_num_groups(0);455 const uint numInnerNodes = BVHBase_numNodes(bvh);458 if (innerNodeIdx >= numInnerNodes) return;
715 uint numInnerNodes = BVHBase_GetNumInternalNodes(bvh); in post_refit_encode_qnode_tree_per_group() local718 …t_local_id(0) + 1 /*+1 because node 0 is already updated*/; nodeIdx < numInnerNodes; nodeIdx += ge… in post_refit_encode_qnode_tree_per_group()1065 uniform const uint numInnerNodes = BVHBase_numNodes(bvh); in find_refit_treelets() local1084 if (global_id < numInnerNodes) { in find_refit_treelets()1114 uniform const uint numInnerNodes = BVHBase_numNodes(bvh); in assign_refit_startpoints_to_treelets() local1123 if (curNodeIndex < numInnerNodes) in assign_refit_startpoints_to_treelets()
500 const uint numInnerNodes = BVHBase_numNodes(bvh); in DO_Refit_per_one_startpoint_sg() local505 if (innerNodeIdx >= numInnerNodes) return; in DO_Refit_per_one_startpoint_sg()
129 unsigned numInnerNodes = BVHBase_GetNumInternalNodes(base);135 for (uint32_t nodeI = get_local_id(0); nodeI < numInnerNodes; nodeI += get_local_size(0))