Function assertSuperOpFitsInCpuMem

quest/src/core/validation.cpp:2643–2671

}

void assertSuperOpFitsInCpuMem(int numQubits, bool isInKrausMap, const char* caller) {

    // attempt to fetch RAM, and simply return if we fail; if we unknowingly
    // didn't have enough RAM, then alloc validation will trigger later
    size_t memPerNode = 0;
    try {
        memPerNode = mem_tryGetLocalRamCapacityInBytes();
    } catch(mem::COULD_NOT_QUERY_RAM e) {
        return;
    }

    bool matrFitsInMem = mem_canSuperOpFitInMemory(numQubits, memPerNode);

    tokenSubs vars = {
        {"${NUM_QUBITS}",  numQubits},
        {"${QCOMP_BYTES}", sizeof(qcomp)},
        {"${RAM_SIZE}",    memPerNode}};
    
    /// @todo
    /// seek expensive node consensus in case of heterogeneous RAM - alas this may induce
    /// unnecessary slowdown (due to sync and broadcast) in applications allocating many
    /// small matrices in the heap. If this turns out to be the case, we could opt to
    /// enforce consensus only when the needed memory is large (e.g. >1GB) and ergo the 
    /// chance of it fitting into some node RAM but not others isn't negligible.
    auto msg = (isInKrausMap)?
        report::NEW_KRAUS_MAPS_SUPER_OP_CANNOT_FIT_INTO_CPU_MEM:
        report::NEW_SUPER_OP_CANNOT_FIT_INTO_CPU_MEM;
    assertAllNodesAgreeThat(matrFitsInMem, msg, vars, caller);
}

void assertSuperOpFitsInGpuMem(int numQubits, int isEnvGpuAccel, bool isInKrausMap, const char* caller) {