Function validatePath

libchigraph/src/FunctionValidator.cpp:145–188

\internal alreadyCalled stores the nodes that have been called at this node, and the inputExecIds it has been called at, to avoid infinite loops

/// alreadyCalled stores the nodes that have been called at this node, and the inputExecIds it has
/// been called at, to avoid infinite loops
Result validatePath(
    const NodeInstance& inst, int                                            inExecId,
    std::unordered_map<const NodeInstance*, std::vector<int> /*in Exec id*/> alreadyCalled) {
	Result res;

	// if we've already been here, then return, it's a loop
	{
		auto iter = alreadyCalled.find(&inst);
		if (iter != alreadyCalled.end() &&
		    std::find(iter->second.begin(), iter->second.end(), inExecId) != iter->second.end()) {
			return res;
		}
	}

	// make sure the inputs are already in processed
	auto id = 0ull;
	for (const auto& conn : inst.inputDataConnections) {
		if (conn.first == nullptr) {
			res.addEntry("EUKN", "Node is missing an input data connection",
			             {{"Node ID", inst.stringId()},
			              {"dataid", id},
			              {"nodetype", inst.type().qualifiedName()}});
			++id;
			continue;
		}

		if (!conn.first->type().pure() && alreadyCalled.find(conn.first) == alreadyCalled.end()) {
			res.addEntry("EUKN", "Node that accepts data from another node is called first",
			             {{"Node ID", inst.stringId()}, {"othernodeid", conn.first->stringId()}});
		}

		++id;
	}

	alreadyCalled[&inst].push_back(inExecId);

	// call this on the nodes this calls
	for (const auto& conn : inst.outputExecConnections) {
		if (conn.first == nullptr) { continue; }
		res += validatePath(*conn.first, conn.second, alreadyCalled);
	}

	return res;
}
}  // anonymous namespace

Result validateFunctionNodeInputs(const GraphFunction& func) {