Function passesJitHeuristics

src/backend/cpu/Array.cpp:240–266

template<typename T>
kJITHeuristics passesJitHeuristics(span<Node *> root_nodes) {
    if (!evalFlag()) { return kJITHeuristics::Pass; }
    size_t bytes = 0;
    for (Node *n : root_nodes) {
        if (n->getHeight() > static_cast<int>(getMaxJitSize())) {
            return kJITHeuristics::TreeHeight;
        }
        // Check if approaching the memory limit
        if (getMemoryPressure() >= getMemoryPressureThreshold()) {
            NodeIterator<Node> it(n);
            NodeIterator<Node> end_node;
            bytes = accumulate(it, end_node, bytes,
                               [=](const size_t prev, const Node &n) {
                                   // getBytes returns the size of the data
                                   // Array. Sub arrays will be represented
                                   // by their parent size.
                                   return prev + n.getBytes();
                               });
        }
    }

    if (jitTreeExceedsMemoryPressure(bytes)) {
        return kJITHeuristics::MemoryPressure;
    }

    return kJITHeuristics::Pass;
}

template<typename T>
Array<T> createNodeArray(const dim4 &dims, Node_ptr node) {