237     PetscInt *queue_global;  in PCBDDCGraphGetCandidatesIS()  local
239     PetscCall(PetscMalloc1(graph->cptr[graph->ncc], &queue_global));  in PCBDDCGraphGetCandidatesIS()
240 …l(ISLocalToGlobalMappingApply(graph->l2gmap, graph->cptr[graph->ncc], graph->queue, queue_global));  in PCBDDCGraphGetCandidatesIS()
241 …PetscCall(PetscSortIntWithArray(graph->cptr[i + 1] - graph->cptr[i], &queue_global[graph->cptr[i]]…  in PCBDDCGraphGetCandidatesIS()
242     PetscCall(PetscFree(queue_global));  in PCBDDCGraphGetCandidatesIS()
733   PetscInt                *queue_global, *nodecount, **nodeneighs, *subset_sizes;  in PCBDDCGraphSetUp()  local
993   PetscCall(PetscMalloc1(graph->cptr[graph->ncc], &queue_global));  in PCBDDCGraphSetUp()
997 …l(ISLocalToGlobalMappingApply(graph->l2gmap, graph->cptr[graph->ncc], graph->queue, queue_global));  in PCBDDCGraphSetUp()
1006       ref_node = PetscMin(ref_node, queue_global[k]);  in PCBDDCGraphSetUp()
1011         PetscCall(PetscHMapIPut(cnt_unique, queue_global[k], &iter, &missing));  in PCBDDCGraphSetUp()
1110       const PetscInt   *lsub_queue_global = queue_global + graph->cptr[i];  in PCBDDCGraphSetUp()
1144   PetscCall(PetscFree(queue_global));  in PCBDDCGraphSetUp()