935 linhas
33 KiB
C++
935 linhas
33 KiB
C++
/*************************************************************************
|
|
* Copyright (c) 2015-2019, NVIDIA CORPORATION. All rights reserved.
|
|
*
|
|
* See LICENSE.txt for license information
|
|
************************************************************************/
|
|
|
|
#include "nccl.h"
|
|
#include "channel.h"
|
|
#include "nvmlwrap.h"
|
|
#include "bootstrap.h"
|
|
#include "transport.h"
|
|
#include "group.h"
|
|
#include "net.h"
|
|
#include "enqueue.h"
|
|
#include "graph.h"
|
|
#include "argcheck.h"
|
|
#include "cpuset.h"
|
|
#include <sched.h>
|
|
#include <fcntl.h>
|
|
#include <string.h>
|
|
#include <errno.h>
|
|
#include <assert.h>
|
|
#include <dlfcn.h>
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <unistd.h>
|
|
|
|
#define STR2(v) #v
|
|
#define STR(v) STR2(v)
|
|
|
|
#ifdef ENABLE_TRACE
|
|
std::chrono::high_resolution_clock::time_point ncclEpoch;
|
|
#endif
|
|
|
|
#if CUDART_VERSION >= 9020
|
|
#define NCCL_GROUP_CUDA_STREAM 0 // CGMD: CUDA 9.2,10.X Don't need to use an internal CUDA stream
|
|
#else
|
|
#define NCCL_GROUP_CUDA_STREAM 1 // CGMD: CUDA 9.0,9.1 Need to use an internal CUDA stream
|
|
#endif
|
|
|
|
NCCL_PARAM(GroupCudaStream, "GROUP_CUDA_STREAM", NCCL_GROUP_CUDA_STREAM);
|
|
|
|
NCCL_PARAM(CheckPointers, "CHECK_POINTERS", 0);
|
|
|
|
ncclNet_t* ncclNet = NULL;
|
|
|
|
// Returns ncclInternalError if anything fails, causing that network to be ignored.
|
|
ncclResult_t initNet(ncclNet_t* net) {
|
|
int ndev;
|
|
if (net->init(ncclDebugLog) != ncclSuccess) return ncclInternalError;
|
|
if (net->devices(&ndev) != ncclSuccess) return ncclInternalError;
|
|
if (ndev <= 0) return ncclSystemError;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
ncclResult_t initNetPlugin(ncclNet_t** net) {
|
|
void* netPluginLib = dlopen("libnccl-net.so", RTLD_NOW | RTLD_LOCAL);
|
|
if (netPluginLib == NULL) {
|
|
// dlopen does not guarantee to set errno, but dlerror only gives us a
|
|
// string, so checking errno doesn't hurt to try to provide a better
|
|
// error message
|
|
if (errno == ENOENT) {
|
|
INFO(NCCL_INIT|NCCL_NET, "NET/Plugin : No plugin found (libnccl-net.so), using internal implementation");
|
|
} else {
|
|
INFO(NCCL_INIT|NCCL_NET, "NET/Plugin : Plugin load returned %d : %s.", errno, dlerror());
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
ncclNet_t* extNet = (ncclNet_t*) dlsym(netPluginLib, STR(NCCL_PLUGIN_SYMBOL));
|
|
if (extNet == NULL) {
|
|
INFO(NCCL_INIT|NCCL_NET, "NET/Plugin: Failed to find " STR(NCCL_PLUGIN_SYMBOL) " symbol.");
|
|
goto cleanup;
|
|
}
|
|
if (initNet(extNet) == ncclSuccess) {
|
|
*net = extNet;
|
|
return ncclSuccess;
|
|
}
|
|
cleanup:
|
|
if (netPluginLib != NULL) dlclose(netPluginLib);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
ncclResult_t initNet() {
|
|
// Always initialize bootstrap network
|
|
NCCLCHECK(bootstrapNetInit());
|
|
|
|
NCCLCHECK(initNetPlugin(&ncclNet));
|
|
if (ncclNet != NULL) return ncclSuccess;
|
|
if (initNet(&ncclNetIb) == ncclSuccess) {
|
|
ncclNet = &ncclNetIb;
|
|
} else {
|
|
NCCLCHECK(initNet(&ncclNetSocket));
|
|
ncclNet = &ncclNetSocket;
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
|
|
pthread_mutex_t initLock = PTHREAD_MUTEX_INITIALIZER;
|
|
static bool initialized = false;
|
|
static ncclResult_t ncclInit() {
|
|
if (initialized) return ncclSuccess;
|
|
pthread_mutex_lock(&initLock);
|
|
if (!initialized) {
|
|
initEnv();
|
|
initNet();
|
|
initialized = true;
|
|
}
|
|
pthread_mutex_unlock(&initLock);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclGetVersion, int* version);
|
|
ncclResult_t ncclGetVersion(int* version) {
|
|
if (version == NULL) return ncclInvalidArgument;
|
|
*version = NCCL_VERSION_CODE;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclGetUniqueId, ncclUniqueId* out);
|
|
ncclResult_t ncclGetUniqueId(ncclUniqueId* out) {
|
|
NCCLCHECK(ncclInit());
|
|
NCCLCHECK(PtrCheck(out, "GetUniqueId", "out"));
|
|
return bootstrapGetUniqueId(out);
|
|
}
|
|
|
|
// Prevent compiler from optimizing out these operations
|
|
#ifdef __clang__
|
|
#define NCCL_NO_OPTIMIZE __attribute__((noopt))
|
|
#else
|
|
#define NCCL_NO_OPTIMIZE __attribute__((optimize("O0")))
|
|
#endif
|
|
|
|
void NCCL_NO_OPTIMIZE commPoison(ncclComm_t comm) {
|
|
comm->rank = comm->cudaDev = comm->busId = comm->nRanks = -1;
|
|
}
|
|
|
|
#undef NCCL_NO_OPTIMIZE
|
|
|
|
static ncclResult_t commFree(ncclComm_t comm) {
|
|
if (comm == NULL)
|
|
return ncclSuccess;
|
|
|
|
free(comm->peerInfo);
|
|
ncclTopoFree(comm->topo);
|
|
|
|
if (comm->bootstrap)
|
|
NCCLCHECK(bootstrapClose(comm->bootstrap));
|
|
|
|
CUDACHECK(cudaFree(comm->hostDevComm.channels));
|
|
CUDACHECK(cudaFree(comm->devComm));
|
|
|
|
for (int channel=0; channel<comm->nChannels; channel++)
|
|
NCCLCHECK(freeChannel(comm->channels+channel, comm->nRanks));
|
|
|
|
if (comm->doneEvent != NULL)
|
|
CUDACHECK(cudaEventDestroy(comm->doneEvent));
|
|
|
|
if (comm->launchMode == ncclComm::GROUP) {
|
|
CUDACHECK(cudaStreamDestroy(comm->groupStream));
|
|
}
|
|
|
|
// Last rank frees shared resources between threads
|
|
int isLast;
|
|
NCCLCHECK(ncclCpuBarrierIn(comm, &isLast));
|
|
if (isLast) {
|
|
free(comm->intraBarrier);
|
|
free(comm->intraParams);
|
|
free(comm->intraCudaDevs);
|
|
free(comm->intraCGMode);
|
|
free(comm->intraCC);
|
|
}
|
|
CUDACHECK(cudaFreeHost((void *)comm->abortFlag));
|
|
CUDACHECK(cudaFreeHost((void *)comm->fatalDevError));
|
|
|
|
// Poison comm to try and catch a double free
|
|
commPoison(comm);
|
|
|
|
free(comm);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
static ncclResult_t commAlloc(ncclComm_t* comret, int ndev, int rank) {
|
|
if (ndev < 1) {
|
|
WARN("invalid device count (%d) requested", ndev);
|
|
return ncclInvalidArgument;
|
|
}
|
|
if (rank >= ndev || rank < 0) {
|
|
WARN("rank %d exceeds ndev=%d", rank, ndev);
|
|
return ncclInvalidArgument;
|
|
}
|
|
|
|
// Try to create a CUDA object right away. If there is something wrong with
|
|
// the device we're on (failure cause #1) , better know it early.
|
|
cudaEvent_t doneEvent;
|
|
CUDACHECK(cudaEventCreateWithFlags(&doneEvent, cudaEventDisableTiming));
|
|
|
|
struct ncclComm* comm;
|
|
NCCLCHECK(ncclCalloc(&comm, 1));
|
|
|
|
comm->rank = comm->hostDevComm.rank =rank;
|
|
comm->nRanks = comm->hostDevComm.nRanks = ndev;
|
|
cudaGetDevice(&comm->cudaDev);
|
|
NCCLCHECK(getBusId(comm->cudaDev, &comm->busId));
|
|
TRACE(NCCL_INIT,"comm %p rank %d nranks %d cudaDev %d busId %x", comm, rank, ndev, comm->cudaDev, comm->busId);
|
|
|
|
comm->doneEvent = doneEvent;
|
|
comm->checkPointers = ncclParamCheckPointers() == 1 ? true : false;
|
|
#if CUDART_VERSION >= 9020
|
|
comm->groupCudaStream = ncclParamGroupCudaStream();
|
|
#else
|
|
// Don't allow the user to overload the default setting in older CUDA builds
|
|
comm->groupCudaStream = NCCL_GROUP_CUDA_STREAM;
|
|
#endif
|
|
comm->fatalError = ncclSuccess;
|
|
|
|
NCCLCHECK(ncclCudaHostAlloc((void**) &comm->fatalDevError, (void**) &comm->hostDevComm.fatalDevError, sizeof(ncclDevError_t)));
|
|
*comm->fatalDevError = ncclDevSuccess;
|
|
|
|
NCCLCHECK(ncclCudaHostAlloc((void**) &comm->abortFlag, (void**) &comm->hostDevComm.abortFlag, sizeof(uint32_t)));
|
|
*comm->abortFlag = 0;
|
|
|
|
comm->argsptr = &comm->args;
|
|
|
|
*comret = comm;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
static ncclResult_t devCommSetup(ncclComm_t comm) {
|
|
// Duplicate the channels on the device
|
|
NCCLCHECK(ncclCudaCalloc(&comm->hostDevComm.channels, comm->nChannels));
|
|
NCCLCHECK(ncclCudaMemcpy(comm->hostDevComm.channels, comm->channels, comm->nChannels));
|
|
|
|
// Copy userRanks and peers
|
|
for (int r=0; r<comm->nChannels; r++) {
|
|
NCCLCHECK(ncclCudaMemcpy(comm->channels[r].ring.devUserRanks, comm->channels[r].ring.userRanks, comm->nRanks));
|
|
NCCLCHECK(ncclCudaMemcpy(comm->channels[r].devPeers, comm->channels[r].peers, comm->nRanks));
|
|
}
|
|
|
|
// Duplicate the dev comm on the device
|
|
NCCLCHECK(ncclCudaCalloc(&comm->devComm, 1));
|
|
NCCLCHECK(ncclCudaMemcpy(comm->devComm, &comm->hostDevComm, 1));
|
|
return ncclSuccess;
|
|
}
|
|
|
|
// Pre-process the string so that running "strings" on the lib can quickly reveal the version.
|
|
#define VERSION_STRING "NCCL version " STR(NCCL_MAJOR) "." STR(NCCL_MINOR) "." STR(NCCL_PATCH) NCCL_SUFFIX "+cuda" STR(CUDA_MAJOR) "." STR(CUDA_MINOR)
|
|
static void showVersion() {
|
|
static int shown = 0;
|
|
if (shown == 0 && ncclDebugLevel >= NCCL_LOG_VERSION) {
|
|
printf("%s\n", VERSION_STRING);
|
|
fflush(stdout);
|
|
if (ncclDebugFile != stdout)
|
|
INFO(NCCL_ALL,"%s", VERSION_STRING); // Also log NCCL version in one of the files
|
|
shown = 1;
|
|
}
|
|
}
|
|
|
|
static ncclResult_t fillInfo(struct ncclComm* comm, struct ncclPeerInfo* info, uint64_t commHash) {
|
|
info->rank = comm->rank;
|
|
CUDACHECK(cudaGetDevice(&info->cudaDev));
|
|
info->hostHash=getHostHash()+commHash;
|
|
info->pidHash=getPidHash()+commHash;
|
|
|
|
// Get the device MAJOR:MINOR of /dev/shm so we can use that
|
|
// information to decide whether we can use SHM for inter-process
|
|
// communication in a container environment
|
|
struct stat statbuf;
|
|
SYSCHECK(stat("/dev/shm", &statbuf), "stat");
|
|
info->shmDev = statbuf.st_dev;
|
|
|
|
info->busId = comm->busId;
|
|
int netDevs;
|
|
|
|
NCCLCHECK(ncclNetDevices(&netDevs));
|
|
for (int n=0; n<netDevs; n++) {
|
|
int ptrSupport;
|
|
NCCLCHECK(ncclNetPtrSupport(n, &ptrSupport));
|
|
if (ptrSupport & NCCL_PTR_CUDA) info->gdrSupport |= (1 << n);
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
|
|
template <int type>
|
|
static ncclResult_t selectTransport(struct ncclTopoSystem* topo, struct ncclTopoGraph* graph, struct ncclPeerInfo* myInfo, struct ncclPeerInfo* peerInfo, struct ncclConnect* connect, struct ncclConnector* connector, int buffSize, int channelId) {
|
|
for (int t=0; t<NTRANSPORTS; t++) {
|
|
struct ncclTransport *transport = ncclTransports+t;
|
|
struct ncclTransportComm* transportComm = type == 1 ? &transport->send : &transport->recv;
|
|
int ret = 0;
|
|
NCCLCHECK(transport->canConnect(&ret, topo, graph, myInfo, peerInfo));
|
|
if (ret) {
|
|
connector->transportComm = transportComm;
|
|
NCCLCHECK(transportComm->setup(topo, graph, myInfo, peerInfo, connect, connector, buffSize, channelId));
|
|
return ncclSuccess;
|
|
}
|
|
}
|
|
WARN("No transport found !");
|
|
return ncclInternalError;
|
|
}
|
|
|
|
static ncclResult_t setupChannel(struct ncclComm* comm, int channelId, int rank, int nranks, int* ringRanks) {
|
|
TRACE(NCCL_INIT, "rank %d nranks %d", rank, nranks);
|
|
NCCLCHECK(initChannel(comm, channelId));
|
|
|
|
struct ncclRing* ring = &comm->channels[channelId].ring;
|
|
// Reorganize ranks to start with rank.
|
|
int shift;
|
|
for (shift = 0; shift<nranks; shift++) {
|
|
if (ringRanks[shift] == rank) {
|
|
break;
|
|
}
|
|
}
|
|
for (int i=0; i<nranks; i++) {
|
|
ring->userRanks[i] = ringRanks[(i+shift)%nranks];
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
|
|
void* waitForNonNullPtr(void* p) {
|
|
volatile void** ptr = (volatile void**) p;
|
|
while (*ptr == NULL) sched_yield();
|
|
return (void*)*ptr;
|
|
}
|
|
|
|
ncclResult_t initParams(struct ncclComm* comm) {
|
|
struct cudaLaunchParams* params = comm->myParams = comm->intraParams+comm->intraRank;
|
|
params->args = &comm->argsptr;
|
|
params->stream = NULL;
|
|
params->sharedMem = 0;
|
|
params->blockDim.x = 0; params->blockDim.y = params->blockDim.z = 1;
|
|
params->gridDim.x = 0; params->gridDim.y = params->gridDim.z = 1;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
// Allocate/Set Intra Process Structures and set CG options
|
|
ncclResult_t ncclCommSetIntra(struct ncclComm* comm, int rank, int ranks, struct ncclComm* comm0) {
|
|
comm->intraRank = rank;
|
|
comm->intraRanks = ranks;
|
|
comm->intraPhase = 0;
|
|
|
|
// Alloc shared structures
|
|
if (rank == 0) {
|
|
assert(comm == comm0);
|
|
int* bar;
|
|
NCCLCHECK(ncclCalloc(&bar, 2));
|
|
bar[0] = bar[1] = 0;
|
|
comm->intraBarrier = bar;
|
|
NCCLCHECK(ncclCalloc(&comm->intraParams, comm->intraRanks));
|
|
NCCLCHECK(ncclCalloc(&comm->intraCudaDevs, comm->intraRanks));
|
|
int* CGMode;
|
|
NCCLCHECK(ncclCalloc(&CGMode, 1));
|
|
*CGMode = 0x11;
|
|
comm->intraCGMode = CGMode;
|
|
int* CC;
|
|
NCCLCHECK(ncclCalloc(&CC, 1));
|
|
*CC = ncclCudaCompCap();
|
|
comm->intraCC = CC;
|
|
} else {
|
|
comm->intraBarrier = (int*)waitForNonNullPtr(&comm0->intraBarrier);
|
|
comm->intraParams = (struct cudaLaunchParams*)waitForNonNullPtr(&comm0->intraParams);
|
|
comm->intraCudaDevs = (int*)waitForNonNullPtr(&comm0->intraCudaDevs);
|
|
comm->intraCGMode = (int*)waitForNonNullPtr(&comm0->intraCGMode);
|
|
comm->intraCC = (int*)waitForNonNullPtr(&comm0->intraCC);
|
|
}
|
|
comm->intraCudaDevs[comm->intraRank] = comm->cudaDev;
|
|
NCCLCHECK(initParams(comm));
|
|
|
|
int cgMdLaunch = 0;
|
|
|
|
// Set CG Mode
|
|
comm->launchMode = ncclComm::GROUP;
|
|
char* str = getenv("NCCL_LAUNCH_MODE");
|
|
if (comm->intraRanks == 1 || (str && strcmp(str, "PARALLEL") == 0)) {
|
|
comm->launchMode = ncclComm::PARALLEL;
|
|
}
|
|
if (comm->launchMode == ncclComm::GROUP) {
|
|
CUDACHECK(cudaStreamCreateWithFlags(&comm->groupStream, cudaStreamNonBlocking));
|
|
#if CUDART_VERSION >= 9000
|
|
if (*comm->intraCC && (ncclCudaCompCap() == *comm->intraCC)) {
|
|
// Check whether the GPU supports Cooperative Group Multi Device Launch
|
|
(void) cudaDeviceGetAttribute(&cgMdLaunch, cudaDevAttrCooperativeMultiDeviceLaunch, comm->cudaDev);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
// Disable cgMdLaunch if any rank does not support it
|
|
if (cgMdLaunch == 0) {
|
|
*comm->intraCGMode = 0x10;
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
|
|
static ncclResult_t p2pSetup(struct ncclComm* comm, struct ncclTopoGraph* graph, struct ncclChannel* channel, int nrecv, int* peerRecv, int nsend, int* peerSend) {
|
|
TRACE(NCCL_INIT, "nsend %d nrecv %d", nsend, nrecv);
|
|
uint32_t nSkippedSend = 0, nSkippedRecv = 0; /* for tracing */
|
|
struct ncclConnect connect;
|
|
struct ncclConnector* conn;
|
|
for (int i=0; i<nrecv; i++) {
|
|
int peer = peerRecv[i];
|
|
if (peer == -1) continue;
|
|
conn = &channel->peers[peer].recv;
|
|
if (conn->connected) { ++nSkippedRecv; continue; }
|
|
memset(&connect, 0, sizeof(connect));
|
|
NCCLCHECK(selectTransport<0>(comm->topo, graph, comm->peerInfo+comm->rank, comm->peerInfo+peer, &connect, conn, channel->buffSize, channel->id));
|
|
NCCLCHECK(bootstrapSend(comm->bootstrap, peer, &connect, sizeof(struct ncclConnect)));
|
|
}
|
|
for (int i=0; i<nsend; i++) {
|
|
int peer = peerSend[i];
|
|
if (peer == -1) continue;
|
|
conn = &channel->peers[peer].send;
|
|
if (conn->connected) { ++nSkippedSend; continue; }
|
|
memset(&connect, 0, sizeof(connect));
|
|
NCCLCHECK(selectTransport<1>(comm->topo, graph, comm->peerInfo+comm->rank, comm->peerInfo+peer, &connect, conn, channel->buffSize, channel->id));
|
|
NCCLCHECK(bootstrapSend(comm->bootstrap, peer, &connect, sizeof(struct ncclConnect)));
|
|
}
|
|
for (int i=0; i<nsend; i++) {
|
|
int peer = peerSend[i];
|
|
if (peer == -1) continue;
|
|
conn = &channel->peers[peer].send;
|
|
if (conn->connected) {++nSkippedSend; continue; }
|
|
memset(&connect, 0, sizeof(connect));
|
|
NCCLCHECK(bootstrapRecv(comm->bootstrap, peer, &connect, sizeof(struct ncclConnect)));
|
|
NCCLCHECK(conn->transportComm->connect(&connect, conn));
|
|
conn->connected = 1;
|
|
}
|
|
for (int i=0; i<nrecv; i++) {
|
|
int peer = peerRecv[i];
|
|
if (peer == -1) continue;
|
|
conn = &channel->peers[peer].recv;
|
|
if (conn->connected) {++nSkippedRecv; continue; }
|
|
memset(&connect, 0, sizeof(connect));
|
|
NCCLCHECK(bootstrapRecv(comm->bootstrap, peer, &connect, sizeof(struct ncclConnect)));
|
|
NCCLCHECK(conn->transportComm->connect(&connect, conn));
|
|
conn->connected = 1;
|
|
}
|
|
TRACE(NCCL_INIT, "nsend %d nrecv %d nSkippedSend %u nSkippedRecv %u - DONE", nsend, nrecv, nSkippedSend, nSkippedRecv);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_PARAM(CrossNic, "CROSS_NIC", 2);
|
|
|
|
static ncclResult_t initTransportsRank(struct ncclComm* comm, ncclUniqueId* commId) {
|
|
// We use 3 AllGathers
|
|
// 1. { peerInfo, comm }
|
|
// 2. ConnectTransport[nranks], ConnectValue[nranks]
|
|
// 3. { nThreads, nrings, compCap, prev[MAXCHANNELS], next[MAXCHANNELS] }
|
|
|
|
int rank = comm->rank;
|
|
int nranks = comm->nRanks;
|
|
uint64_t commHash = getHash(commId->internal, NCCL_UNIQUE_ID_BYTES);
|
|
TRACE(NCCL_INIT, "comm %p, commHash %lx, rank %d nranks %d - BEGIN", comm, commHash, rank, nranks);
|
|
NCCLCHECK(bootstrapInit(commId, rank, nranks, &comm->bootstrap));
|
|
|
|
// AllGather1 - begin
|
|
struct {
|
|
struct ncclPeerInfo peerInfo;
|
|
struct ncclComm* comm;
|
|
} *allGather1Data;
|
|
|
|
NCCLCHECK(ncclCalloc(&allGather1Data, nranks));
|
|
allGather1Data[rank].comm = comm;
|
|
struct ncclPeerInfo* myInfo = &allGather1Data[rank].peerInfo;
|
|
NCCLCHECK(fillInfo(comm, myInfo, commHash));
|
|
NCCLCHECK(bootstrapAllGather(comm->bootstrap, allGather1Data, sizeof(*allGather1Data)));
|
|
|
|
NCCLCHECK(ncclCalloc(&comm->peerInfo, nranks));
|
|
for (int i = 0; i < nranks; i++) {
|
|
memcpy(comm->peerInfo+i, &allGather1Data[i].peerInfo, sizeof(struct ncclPeerInfo));
|
|
if ((i != rank) && (comm->peerInfo[i].hostHash == myInfo->hostHash) && (comm->peerInfo[i].busId == myInfo->busId)) {
|
|
WARN("Duplicate GPU detected : rank %d and rank %d both on CUDA device %x", rank, i, myInfo->busId);
|
|
return ncclInvalidUsage;
|
|
}
|
|
}
|
|
// AllGather1 data is used again below
|
|
// AllGather1 - end
|
|
|
|
// Topo detection / System graph creation
|
|
NCCLCHECK(ncclTopoGetSystem(comm, &comm->topo));
|
|
// Compute paths between GPUs and NICs
|
|
NCCLCHECK(ncclTopoComputePaths(comm->topo, comm->peerInfo));
|
|
// Remove inaccessible GPUs and unused NICs
|
|
NCCLCHECK(ncclTopoTrimSystem(comm->topo, comm));
|
|
// Recompute paths after trimming
|
|
NCCLCHECK(ncclTopoComputePaths(comm->topo, comm->peerInfo));
|
|
// Compute max speed to accelerate search
|
|
NCCLCHECK(ncclTopoGetMaxSpeed(comm->topo));
|
|
// Print final topology
|
|
NCCLCHECK(ncclTopoPrint(comm->topo));
|
|
|
|
// Get rings and trees
|
|
struct ncclTopoGraph treeGraph;
|
|
treeGraph.pattern = NCCL_TOPO_PATTERN_SPLIT_TREE;
|
|
treeGraph.crossNic = ncclParamCrossNic();
|
|
// We communicate only half the data between node with trees on 2 nodes.
|
|
NCCLCHECK(ncclTopoCompute(comm->topo, &treeGraph));
|
|
NCCLCHECK(ncclTopoPrintGraph(comm->topo, &treeGraph));
|
|
struct ncclTopoGraph ringGraph;
|
|
ringGraph.pattern = NCCL_TOPO_PATTERN_RING;
|
|
ringGraph.crossNic = ncclParamCrossNic();
|
|
NCCLCHECK(ncclTopoCompute(comm->topo, &ringGraph));
|
|
NCCLCHECK(ncclTopoPrintGraph(comm->topo, &ringGraph));
|
|
|
|
// AllGather3 - begin
|
|
|
|
struct {
|
|
int cudaCompCap;
|
|
int fullCudaCompCap;
|
|
int nvlink;
|
|
int nChannels;
|
|
struct {
|
|
int sameChannels;
|
|
int speedIntra;
|
|
int speedInter;
|
|
int nvlink;
|
|
} tree;
|
|
struct {
|
|
int sameChannels;
|
|
int speedIntra;
|
|
int speedInter;
|
|
int nvlink;
|
|
} ring;
|
|
struct ncclTopoRanks topoRanks;
|
|
} *allGather3Data;
|
|
|
|
NCCLCHECK(ncclCalloc(&allGather3Data, nranks));
|
|
allGather3Data[rank].cudaCompCap = ncclCudaCompCap();
|
|
allGather3Data[rank].nvlink = treeGraph.nvlink;
|
|
allGather3Data[rank].nChannels = comm->nChannels = std::min(treeGraph.nChannels, ringGraph.nChannels);
|
|
allGather3Data[rank].tree.sameChannels = treeGraph.sameChannels;
|
|
allGather3Data[rank].tree.speedIntra = treeGraph.speedIntra;
|
|
allGather3Data[rank].tree.speedInter = treeGraph.speedInter;
|
|
allGather3Data[rank].tree.nvlink = treeGraph.nvlink;
|
|
allGather3Data[rank].ring.sameChannels = ringGraph.sameChannels;
|
|
allGather3Data[rank].ring.speedIntra = ringGraph.speedIntra;
|
|
allGather3Data[rank].ring.speedInter = ringGraph.speedInter;
|
|
allGather3Data[rank].ring.nvlink = ringGraph.nvlink;
|
|
|
|
NCCLCHECK(ncclTopoPreset(comm, &treeGraph, &ringGraph, &allGather3Data[rank].topoRanks));
|
|
|
|
NCCLCHECK(bootstrapAllGather(comm->bootstrap, allGather3Data, sizeof(*allGather3Data)));
|
|
|
|
// Determine nNodes, firstRanks, ...
|
|
int* nodesFirstRank;
|
|
NCCLCHECK(ncclCalloc(&nodesFirstRank, nranks));
|
|
for (int i=0; i<nranks; i++) {
|
|
int node = -1;
|
|
int firstRank = allGather3Data[i].topoRanks.ringRecv[0];
|
|
for (int n=0; n<comm->nNodes; n++) {
|
|
if (nodesFirstRank[n] == firstRank) node = n;
|
|
}
|
|
if (node == -1) {
|
|
node = comm->nNodes++;
|
|
nodesFirstRank[node] = firstRank;
|
|
}
|
|
if (i == comm->rank) comm->node = node;
|
|
}
|
|
|
|
// Determine the minimum CUDA Compute capability of all GPUs
|
|
int myCompCap = allGather3Data[rank].cudaCompCap;
|
|
int minCompCap = myCompCap, maxCompCap = myCompCap;
|
|
for (int i = 0; i < nranks; i++) {
|
|
minCompCap = std::min(allGather3Data[i].cudaCompCap, minCompCap);
|
|
maxCompCap = std::max(allGather3Data[i].cudaCompCap, maxCompCap);
|
|
}
|
|
|
|
comm->nvlink = 1;
|
|
for (int i = 0; i < nranks; i++) comm->nvlink &= allGather3Data[i].nvlink;
|
|
|
|
int nChannelsOrig = comm->nChannels;
|
|
struct ncclTopoRanks** allTopoRanks;
|
|
NCCLCHECK(ncclCalloc(&allTopoRanks, comm->nRanks));
|
|
for (int i=0; i<nranks; i++) {
|
|
allTopoRanks[i] = &allGather3Data[i].topoRanks;
|
|
// Make sure we align all ranks so that the tuning is consistent across ranks
|
|
treeGraph.nChannels = ringGraph.nChannels = comm->nChannels = std::min(allGather3Data[i].nChannels, comm->nChannels);
|
|
treeGraph.sameChannels = std::min(allGather3Data[i].tree.sameChannels, treeGraph.sameChannels);
|
|
treeGraph.speedIntra = std::min(allGather3Data[i].tree.speedIntra, treeGraph.speedIntra);
|
|
treeGraph.speedInter = std::min(allGather3Data[i].tree.speedInter, treeGraph.speedInter);
|
|
treeGraph.nvlink = std::min(allGather3Data[i].tree.nvlink, treeGraph.nvlink);
|
|
ringGraph.sameChannels = std::min(allGather3Data[i].ring.sameChannels, ringGraph.sameChannels);
|
|
ringGraph.speedIntra = std::min(allGather3Data[i].ring.speedIntra, ringGraph.speedIntra);
|
|
ringGraph.speedInter = std::min(allGather3Data[i].ring.speedInter, ringGraph.speedInter);
|
|
ringGraph.nvlink = std::min(allGather3Data[i].ring.nvlink, ringGraph.nvlink);
|
|
}
|
|
|
|
if (comm->nChannels < nChannelsOrig) {
|
|
// We started duplicating channels during Preset(), so we need to move the
|
|
// duplicated channels since we have removed some.
|
|
for (int i=0; i<comm->nChannels; i++) memcpy(comm->channels+comm->nChannels+i, comm->channels+nChannelsOrig+i, sizeof(struct ncclChannel));
|
|
}
|
|
|
|
int *rings;
|
|
NCCLCHECK(ncclCalloc(&rings, nranks*MAXCHANNELS));
|
|
|
|
NCCLCHECK(ncclTopoPostset(comm, nodesFirstRank, allTopoRanks, rings));
|
|
|
|
free(allTopoRanks);
|
|
free(nodesFirstRank);
|
|
free(allGather3Data);
|
|
|
|
// AllGather3 - end
|
|
|
|
TRACE(NCCL_INIT, "rank %d nranks %d - BUILT %d TREES/RINGS", rank, nranks, comm->nChannels);
|
|
|
|
NCCLCHECK(ncclSetThresholds(comm, minCompCap, maxCompCap, &treeGraph, &ringGraph));
|
|
|
|
char line[1024];
|
|
line[0]='\0';
|
|
for (int c=0; c<comm->nChannels; c++) {
|
|
struct ncclTree* treeUp = &comm->channels[c].treeUp;
|
|
struct ncclTree* treeDn = &comm->channels[c].treeDn;
|
|
snprintf(line+strlen(line), 1023-strlen(line), " [%d] %d/%d/%d->%d->%d|%d->%d->%d/%d/%d",
|
|
c, treeUp->down[0], treeUp->down[1], treeUp->down[2], rank, treeUp->up,
|
|
treeDn->up, rank, treeDn->down[0], treeDn->down[1], treeDn->down[2]);
|
|
}
|
|
line[1023] = '\0';
|
|
INFO(NCCL_INIT, "Trees%s", line);
|
|
|
|
// Connect with prev/next for each ring
|
|
struct ncclConnect *connect;
|
|
NCCLCHECK(ncclCalloc(&connect, 2));
|
|
for (int c=0; c<comm->nChannels; c++) {
|
|
struct ncclChannel* channel = comm->channels+c;
|
|
NCCLCHECK(setupChannel(comm, c, rank, nranks, rings+c*nranks));
|
|
if (comm->nRanks == 1) continue;
|
|
NCCLCHECK(p2pSetup(comm, &ringGraph, channel, 1, &channel->ring.prev, 1, &channel->ring.next));
|
|
NCCLCHECK(p2pSetup(comm, &treeGraph, channel, NCCL_MAX_TREE_ARITY, channel->treeUp.down, 1, &channel->treeUp.up));
|
|
NCCLCHECK(p2pSetup(comm, &treeGraph, channel, 1, &channel->treeDn.up, NCCL_MAX_TREE_ARITY, channel->treeDn.down));
|
|
}
|
|
TRACE(NCCL_INIT, "rank %d nranks %d - CONNECTED %d RINGS AND TREES", rank, nranks, comm->nChannels);
|
|
free(connect);
|
|
free(rings);
|
|
|
|
// Compute intra ranks (using AllGather1 data)
|
|
int intraRank0 = -1, intraRank = -1, intraRanks = 0;
|
|
for (int i = 0; i < nranks; i++) {
|
|
if ((allGather1Data[i].peerInfo.hostHash == allGather1Data[rank].peerInfo.hostHash) &&
|
|
(allGather1Data[i].peerInfo.pidHash == allGather1Data[rank].peerInfo.pidHash)) {
|
|
if (intraRanks == 0) intraRank0 = i;
|
|
if (i == rank) intraRank = intraRanks;
|
|
intraRanks++;
|
|
}
|
|
}
|
|
TRACE(NCCL_INIT,"hostHash[%d] %lx intraRank %d intraRanks %d intraRank0 %d",
|
|
rank, allGather1Data[rank].peerInfo.hostHash, intraRank, intraRanks, intraRank0);
|
|
if (intraRank == -1 || intraRank0 == -1 || allGather1Data[intraRank0].comm == NULL) {
|
|
WARN("Failed to determine intra ranks hostHash[%d] %lx intraRank %d intraRanks %d intraRank0 %d",
|
|
rank, allGather1Data[rank].peerInfo.hostHash, intraRank, intraRanks, intraRank0);
|
|
return ncclInternalError;
|
|
}
|
|
NCCLCHECK(ncclCommSetIntra(comm, intraRank, intraRanks, allGather1Data[intraRank0].comm));
|
|
|
|
// Done with AllGather1 data
|
|
free(allGather1Data);
|
|
|
|
if (comm->nNodes) NCCLCHECK(transportCreateProxy(comm));
|
|
|
|
TRACE(NCCL_INIT, "rank %d nranks %d - DONE", rank, nranks);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
static ncclResult_t getCpuGpuAffinity(int cudaDev, cpu_set_t* mask) {
|
|
CPU_ZERO_S(sizeof(cpu_set_t), mask);
|
|
char* cudaPath;
|
|
NCCLCHECK(ncclTopoCudaPath(cudaDev, &cudaPath));
|
|
char path[PATH_MAX];
|
|
strncpy(path, cudaPath, PATH_MAX-1);
|
|
snprintf(path+strlen(path), PATH_MAX-1-strlen(path), "/local_cpus");
|
|
path[PATH_MAX-1] = '\0';
|
|
int fd;
|
|
SYSCHECKVAL(open(path, O_RDONLY), "open", fd);
|
|
char affinityStr[sizeof(cpu_set_t)*2 + 1];
|
|
int r = read(fd, affinityStr, sizeof(cpu_set_t)*2);
|
|
if (r > 0) {
|
|
affinityStr[r] = '\0';
|
|
NCCLCHECK(ncclStrToCpuset(affinityStr, mask));
|
|
}
|
|
close(fd);
|
|
free(cudaPath);
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_PARAM(IgnoreCpuAffinity, "IGNORE_CPU_AFFINITY", 0);
|
|
|
|
static ncclResult_t setCpuAffinity(int cudaDev) {
|
|
// Query the CPU affinity set we were provided
|
|
cpu_set_t mask;
|
|
SYSCHECK(sched_getaffinity(0, sizeof(cpu_set_t), &mask), "sched_getaffinity");
|
|
|
|
#ifdef ENABLE_TRACE
|
|
{
|
|
char affinityStr[sizeof(cpu_set_t)*2];
|
|
NCCLCHECK(ncclCpusetToStr(&mask, affinityStr));
|
|
TRACE(NCCL_INIT, "Current affinity for GPU %d is %s", cudaDev, affinityStr);
|
|
}
|
|
#endif
|
|
|
|
// Find the CPUs that are local to the supplied GPU
|
|
cpu_set_t gpuMask;
|
|
NCCLCHECK(getCpuGpuAffinity(cudaDev, &gpuMask));
|
|
|
|
#ifdef ENABLE_TRACE
|
|
{
|
|
char affinityStr[sizeof(cpu_set_t)*2];
|
|
NCCLCHECK(ncclCpusetToStr(&gpuMask, affinityStr));
|
|
TRACE(NCCL_INIT, "CPU GPU affinity for GPU %d is %s", cudaDev, affinityStr);
|
|
}
|
|
#endif
|
|
|
|
cpu_set_t finalMask;
|
|
if (ncclParamIgnoreCpuAffinity())
|
|
// Ignore the CPU affinity set and use the GPU one instead
|
|
finalMask = gpuMask;
|
|
else
|
|
// Use a subset of the GPU affinity set
|
|
CPU_AND(&finalMask, &mask, &gpuMask);
|
|
|
|
// If there is a non empty set, use it to set affinity
|
|
if (CPU_COUNT(&finalMask)) {
|
|
char affinityStr[sizeof(cpu_set_t)*2];
|
|
NCCLCHECK(ncclCpusetToStr(&finalMask, affinityStr));
|
|
INFO(NCCL_INIT, "Setting affinity for GPU %d to %s", cudaDev, affinityStr);
|
|
SYSCHECK(sched_setaffinity(0, sizeof(cpu_set_t), &finalMask), "sched_setaffinity");
|
|
}
|
|
return ncclSuccess;
|
|
}
|
|
|
|
ncclResult_t ncclCommInitRankSync(ncclComm_t* newcomm, int nranks, ncclUniqueId commId, int myrank, int cudaDev) {
|
|
cpu_set_t affinitySave;
|
|
sched_getaffinity(0, sizeof(cpu_set_t), &affinitySave);
|
|
|
|
NCCLCHECK(wrapNvmlSymbols());
|
|
NCCLCHECK(wrapNvmlInit());
|
|
|
|
// Make sure all host memory allocation are close to the GPU
|
|
CUDACHECK(cudaSetDevice(cudaDev));
|
|
NCCLCHECK(setCpuAffinity(cudaDev));
|
|
ncclResult_t res;
|
|
|
|
NCCLCHECKGOTO(commAlloc(newcomm, nranks, myrank), res, cleanup);
|
|
NCCLCHECKGOTO(initTransportsRank(*newcomm, &commId), res, cleanup);
|
|
NCCLCHECKGOTO(devCommSetup(*newcomm), res, cleanup);
|
|
|
|
sched_setaffinity(0, sizeof(cpu_set_t), &affinitySave);
|
|
NCCLCHECKGOTO(wrapNvmlShutdown(), res, cleanup);
|
|
|
|
INFO(NCCL_INIT,"comm %p rank %d nranks %d cudaDev %d busId %x - Init COMPLETE", *newcomm, myrank, nranks, (*newcomm)->cudaDev, (*newcomm)->busId);
|
|
|
|
return ncclSuccess;
|
|
cleanup:
|
|
if ((*newcomm) && (*newcomm)->bootstrap) bootstrapAbort((*newcomm)->bootstrap);
|
|
*newcomm = NULL;
|
|
sched_setaffinity(0, sizeof(cpu_set_t), &affinitySave);
|
|
return res;
|
|
}
|
|
|
|
static ncclResult_t ncclCommInitRankDev(ncclComm_t* newcomm, int nranks, ncclUniqueId commId, int myrank, int cudaDev) {
|
|
ncclResult_t res;
|
|
char* env = getenv("NCCL_COMM_ID");
|
|
if (env && myrank == 0) {
|
|
NCCLCHECKGOTO(bootstrapCreateRoot(&commId, true), res, end);
|
|
}
|
|
|
|
NCCLCHECKGOTO(ncclInit(), res, end);
|
|
if (myrank == 0) showVersion();
|
|
|
|
// Make sure the CUDA runtime is initialized.
|
|
CUDACHECKGOTO(cudaFree(NULL), res, end);
|
|
|
|
NCCLCHECKGOTO(PtrCheck(newcomm, "CommInitRank", "newcomm"), res, end);
|
|
if (nranks < 1 || myrank < 0 || myrank >= nranks) {
|
|
WARN("Invalid rank requested : %d/%d", myrank, nranks);
|
|
res = ncclInvalidArgument;
|
|
goto end;
|
|
}
|
|
|
|
if (ncclAsyncMode()) {
|
|
NCCLCHECKGOTO(ncclAsyncInit(ncclCommInitRankSync, newcomm, nranks, commId, myrank, cudaDev), res, end);
|
|
} else {
|
|
NCCLCHECKGOTO(ncclCommInitRankSync(newcomm, nranks, commId, myrank, cudaDev), res, end);
|
|
}
|
|
end:
|
|
if (ncclAsyncMode()) return ncclAsyncErrCheck(res);
|
|
else return res;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommInitRank, ncclComm_t* newcomm, int nranks, ncclUniqueId commId, int myrank);
|
|
ncclResult_t ncclCommInitRank(ncclComm_t* newcomm, int nranks, ncclUniqueId commId, int myrank) {
|
|
int cudaDev;
|
|
CUDACHECK(cudaGetDevice(&cudaDev));
|
|
NCCLCHECK(ncclCommInitRankDev(newcomm, nranks, commId, myrank, cudaDev));
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommInitAll, ncclComm_t* comms, int ndev, const int* devlist);
|
|
ncclResult_t ncclCommInitAll(ncclComm_t* comms, int ndev, const int* devlist) {
|
|
NCCLCHECK(PtrCheck(comms, "CommInitAll", "comms"));
|
|
if (ndev < 0) {
|
|
WARN("Invalid device count requested : %d", ndev);
|
|
return ncclInvalidArgument;
|
|
}
|
|
|
|
ncclUniqueId uniqueId;
|
|
NCCLCHECK(ncclGetUniqueId(&uniqueId));
|
|
NCCLCHECK(ncclGroupStart());
|
|
for (int i=0; i<ndev; i++) {
|
|
// Ignore return codes .. we need to call ncclGroupEnd to clean up anyway
|
|
ncclCommInitRankDev(comms+i, ndev, uniqueId, i, devlist ? devlist[i] : i);
|
|
}
|
|
NCCLCHECK(ncclGroupEnd());
|
|
return ncclSuccess;
|
|
}
|
|
|
|
static ncclResult_t commDestroy(ncclComm_t comm) {
|
|
int savedDevice;
|
|
#ifdef ENABLE_TRACE
|
|
int rank = comm->rank;
|
|
#endif
|
|
CUDACHECK(cudaGetDevice(&savedDevice));
|
|
int commDevice = comm->cudaDev;
|
|
|
|
if (savedDevice != commDevice) {
|
|
CUDACHECK(cudaSetDevice(commDevice));
|
|
}
|
|
|
|
TRACE(NCCL_INIT, "Destroying comm %p rank %d abortFlag %d fatalError %d", comm, rank, *comm->abortFlag, comm->fatalError);
|
|
|
|
CUDACHECK(cudaStreamSynchronize(comm->groupStream));
|
|
NCCLCHECK(transportDestroyProxy(comm));
|
|
NCCLCHECK(commFree(comm));
|
|
|
|
if (savedDevice != commDevice)
|
|
CUDACHECK(cudaSetDevice(savedDevice));
|
|
|
|
TRACE(NCCL_INIT, "Destroyed comm %p rank %d", comm, rank);
|
|
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommDestroy, ncclComm_t comm);
|
|
ncclResult_t ncclCommDestroy(ncclComm_t comm) {
|
|
if (comm == NULL)
|
|
return ncclSuccess;
|
|
|
|
TRACE(NCCL_INIT, "comm %p rank %d nRanks %d cudaDev %d busId %x", comm, comm->rank, comm->nRanks, comm->cudaDev, comm->busId);
|
|
|
|
// Try and prevent a double free of the comm struct (user error)
|
|
if (comm->rank == -1 || comm->nRanks <= 0 || comm->cudaDev == -1 || comm->busId == -1) {
|
|
WARN("comm %p has already been destroyed", comm);
|
|
return ncclInvalidArgument;
|
|
}
|
|
|
|
return commDestroy(comm);
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommAbort, ncclComm_t comm);
|
|
ncclResult_t ncclCommAbort(ncclComm_t comm) {
|
|
if (comm == NULL)
|
|
return ncclSuccess;
|
|
|
|
// Ask anything that might still be running on the device to quit
|
|
*comm->abortFlag = 1;
|
|
|
|
return commDestroy(comm);
|
|
}
|
|
|
|
NCCL_API(const char*, ncclGetErrorString, ncclResult_t code);
|
|
const char* ncclGetErrorString(ncclResult_t code) {
|
|
switch (code) {
|
|
case ncclSuccess : return "no error";
|
|
case ncclUnhandledCudaError : return "unhandled cuda error";
|
|
case ncclSystemError : return "unhandled system error";
|
|
case ncclInternalError : return "internal error";
|
|
case ncclInvalidArgument : return "invalid argument";
|
|
case ncclInvalidUsage : return "invalid usage";
|
|
default : return "unknown result code";
|
|
}
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommGetAsyncError, ncclComm_t comm, ncclResult_t *asyncError);
|
|
ncclResult_t ncclCommGetAsyncError(ncclComm_t comm, ncclResult_t *asyncError) {
|
|
NCCLCHECK(PtrCheck(comm, "ncclGetAsyncError", "comm"));
|
|
NCCLCHECK(PtrCheck(asyncError, "ncclGetAsyncError", "asyncError"));
|
|
|
|
// Check device reported error
|
|
static ncclDevError_t printedDevErr = ncclDevSuccess;
|
|
switch(*comm->fatalDevError) {
|
|
case ncclDevSuccess :
|
|
break;
|
|
case ncclDevAssertedMismatch :
|
|
if (printedDevErr != ncclDevAssertedMismatch) {
|
|
WARN("Mismatched collective detected, please check your collective calls at and around rank %d. You can use NCCL_DEBUG=INFO and NCCL_DEBUG_SUBSYS=COLL to see the collective logs", comm->rank);
|
|
printedDevErr = ncclDevAssertedMismatch;
|
|
}
|
|
if (comm->fatalError == ncclSuccess) {
|
|
comm->fatalError = ncclInvalidUsage;
|
|
}
|
|
break;
|
|
case ncclDevSuspectedMismatch :
|
|
if (printedDevErr != ncclDevSuspectedMismatch) {
|
|
WARN("Your program may be hanging, this may be caused by a collective mismatch around rank %d. Please check your collective calls at and around this rank. You can use NCCL_DEBUG=INFO and NCCL_DEBUG_SUBSYS=COLL to see the collective logs", comm->rank);
|
|
printedDevErr = ncclDevSuspectedMismatch;
|
|
}
|
|
break;
|
|
default:
|
|
WARN("Unknown device error %d", *comm->fatalDevError);
|
|
return ncclInternalError;
|
|
}
|
|
*asyncError = comm->fatalError;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommCount, const ncclComm_t comm, int* count);
|
|
ncclResult_t ncclCommCount(const ncclComm_t comm, int* count) {
|
|
NCCLCHECK(PtrCheck(comm, "CommCount", "comm"));
|
|
NCCLCHECK(PtrCheck(count, "CommCount", "count"));
|
|
*count = comm->nRanks;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommCuDevice, const ncclComm_t comm, int* devid);
|
|
ncclResult_t ncclCommCuDevice(const ncclComm_t comm, int* devid) {
|
|
NCCLCHECK(PtrCheck(comm, "CommCuDevice", "comm"));
|
|
NCCLCHECK(PtrCheck(devid, "CommCuDevice", "devid"));
|
|
*devid = comm->cudaDev;
|
|
return ncclSuccess;
|
|
}
|
|
|
|
NCCL_API(ncclResult_t, ncclCommUserRank, const ncclComm_t comm, int* rank);
|
|
ncclResult_t ncclCommUserRank(const ncclComm_t comm, int* rank) {
|
|
NCCLCHECK(PtrCheck(comm, "CommUserRank", "comm"));
|
|
NCCLCHECK(PtrCheck(rank, "CommUserRank", "rank"));
|
|
*rank = comm->rank;
|
|
return ncclSuccess;
|
|
}
|