Priorities.h

Go to the documentation of this file.

// Copyright 2015 - 2026, GIBIS-UNIFESP and the wiRedPanda contributors
// SPDX-License-Identifier: GPL-3.0-or-later

 
#pragma once
 
#include <algorithm>
 
#include <QHash>
#include <QSet>
#include <QStack>
#include <QVector>

template<typename T>
QSet<T *> findFeedbackNodes(
    const QVector<T *> &elements,
    const QHash<T *, QVector<T *>> &successors)
{
    QSet<T *> feedbackNodes;
 
    int indexCounter = 0;
    QHash<T *, int> nodeIndex;
    QHash<T *, int> lowlink;
    QStack<T *> sccStack;
    QSet<T *> onStack;
 
    struct Frame {
        T *node;
        int successorIdx;
    };
 
    for (auto *element : elements) {
        if (nodeIndex.contains(element)) {
            continue;
        }
 
        QStack<Frame> callStack;
        nodeIndex[element] = indexCounter;
        lowlink[element] = indexCounter;
        ++indexCounter;
        sccStack.push(element);
        onStack.insert(element);
        callStack.push({element, 0});
 
        while (!callStack.isEmpty()) {
            auto &frame = callStack.top();
            T *node = frame.node;
 
            const auto it = successors.constFind(node);
            const int succCount = (it != successors.constEnd()) ? static_cast<int>(it->size()) : 0;
 
            if (frame.successorIdx < succCount) {
                T *succ = (*it)[frame.successorIdx];
                ++frame.successorIdx;
 
                if (!nodeIndex.contains(succ)) {
                    nodeIndex[succ] = indexCounter;
                    lowlink[succ] = indexCounter;
                    ++indexCounter;
                    sccStack.push(succ);
                    onStack.insert(succ);
                    callStack.push({succ, 0});
                } else if (onStack.contains(succ)) {
                    lowlink[node] = (std::min)(lowlink[node], nodeIndex[succ]);
                }
            } else {
                // All successors processed — check if node is root of an SCC.
                if (lowlink[node] == nodeIndex[node]) {
                    QVector<T *> scc;
                    T *w;
                    do {
                        w = sccStack.pop();
                        onStack.remove(w);
                        scc.append(w);
                    } while (w != node);
 
                    if (scc.size() > 1) {
                        for (auto *n : std::as_const(scc)) {
                            feedbackNodes.insert(n);
                        }
                    } else if ((it != successors.constEnd()) && it->contains(node)) {
                        feedbackNodes.insert(node); // self-loop
                    }
                }
 
                callStack.pop();
 
                if (!callStack.isEmpty()) {
                    T *parent = callStack.top().node;
                    lowlink[parent] = (std::min)(lowlink[parent], lowlink[node]);
                }
            }
        }
    }
 
    return feedbackNodes;
}
 
namespace PrioritiesInternal {

template<typename T>
void legacyCalculatePriorities(
    const QVector<T *> &elements,
    const QHash<T *, QVector<T *>> &successors,
    QHash<T *, int> &outPriorities)
{
    QStack<T *> stack;
    QSet<T *> inStack;
 
    for (auto *element : elements) {
        if (outPriorities.contains(element)) {
            continue;
        }
 
        stack.push(element);
        inStack.insert(element);
 
        while (!stack.isEmpty()) {
            auto *current = stack.top();
 
            if (outPriorities.contains(current)) {
                stack.pop();
                inStack.remove(current);
                continue;
            }
 
            bool allProcessed = true;
            int maxSuccessorPriority = 0;
            bool hasFeedbackLoop = false;
 
            const auto it = successors.find(current);
            if (it != successors.end()) {
                for (auto *successor : *it) {
                    if (!outPriorities.contains(successor)) {
                        if (!inStack.contains(successor)) {
                            stack.push(successor);
                            inStack.insert(successor);
                            allProcessed = false;
                        } else {
                            hasFeedbackLoop = true;
                        }
                    } else {
                        maxSuccessorPriority = (std::max)(maxSuccessorPriority, outPriorities.value(successor));
                    }
                }
            }
 
            // Assign priority when all successors are computed, OR when a
            // feedback loop is detected.  The early assignment on feedback is
            // intentional: it gives feedback-loop nodes a *lower* priority
            // (based only on already-computed successors) so the simulation
            // processes them *after* their non-cyclic inputs.  Because
            // LogicElement::updateLogic() reads live predecessor outputs,
            // processing feedback nodes late ensures they see fresh values
            // from the current iteration rather than stale ones.
            if (allProcessed || hasFeedbackLoop) {
                outPriorities[current] = maxSuccessorPriority + 1;
                stack.pop();
                inStack.remove(current);
            }
        }
    }
}
 
} // namespace PrioritiesInternal

template<typename T>
void calculatePriorities(
    const QVector<T *> &elements,
    const QHash<T *, QVector<T *>> &successors,
    QHash<T *, int> &outPriorities)
{
    if (!findFeedbackNodes(elements, successors).isEmpty()) {
        PrioritiesInternal::legacyCalculatePriorities(elements, successors, outPriorities);
        return;
    }
 
    // Cycle-free: two-phase iterative DFS (expand, then assign in post-order).
    // On first visit a node pushes its unfinished successors and stays on the
    // stack; when it surfaces again every successor pushed above it has been
    // assigned (guaranteed acyclic), so its own priority is final.  A node
    // reached from several parents may sit on the stack more than once — the
    // duplicate pops in O(1) via the priority check — keeping the whole pass
    // linear in nodes + edges.
    QSet<T *> expanded;
 
    for (auto *element : elements) {
        if (outPriorities.contains(element)) {
            continue;
        }
 
        QStack<T *> stack;
        stack.push(element);
 
        while (!stack.isEmpty()) {
            auto *current = stack.top();
 
            if (outPriorities.contains(current)) {
                stack.pop();
                continue;
            }
 
            const auto it = successors.constFind(current);
 
            if (!expanded.contains(current)) {
                expanded.insert(current);
                if (it != successors.constEnd()) {
                    for (auto *successor : *it) {
                        if (!outPriorities.contains(successor)) {
                            stack.push(successor);
                        }
                    }
                }
                continue;
            }
 
            int maxSuccessorPriority = 0;
            if (it != successors.constEnd()) {
                for (auto *successor : *it) {
                    maxSuccessorPriority = (std::max)(maxSuccessorPriority, outPriorities.value(successor));
                }
            }
 
            outPriorities[current] = maxSuccessorPriority + 1;
            stack.pop();
        }
    }
}