#include "generator.h" #include #include #include #include namespace rcx { namespace { // ── Identifier sanitisation ── static QString sanitizeIdent(const QString& name) { if (name.isEmpty()) return QStringLiteral("unnamed"); QString out; out.reserve(name.size()); for (QChar c : name) { if (c.isLetterOrNumber() || c == '_') out += c; else out += '_'; } if (!out[0].isLetter() && out[0] != '_') out.prepend('_'); return out; } // ── C type name for a primitive NodeKind ── static QString cTypeName(NodeKind kind) { switch (kind) { case NodeKind::Hex8: return QStringLiteral("uint8_t"); case NodeKind::Hex16: return QStringLiteral("uint16_t"); case NodeKind::Hex32: return QStringLiteral("uint32_t"); case NodeKind::Hex64: return QStringLiteral("uint64_t"); case NodeKind::Int8: return QStringLiteral("int8_t"); case NodeKind::Int16: return QStringLiteral("int16_t"); case NodeKind::Int32: return QStringLiteral("int32_t"); case NodeKind::Int64: return QStringLiteral("int64_t"); case NodeKind::UInt8: return QStringLiteral("uint8_t"); case NodeKind::UInt16: return QStringLiteral("uint16_t"); case NodeKind::UInt32: return QStringLiteral("uint32_t"); case NodeKind::UInt64: return QStringLiteral("uint64_t"); case NodeKind::Float: return QStringLiteral("float"); case NodeKind::Double: return QStringLiteral("double"); case NodeKind::Bool: return QStringLiteral("bool"); case NodeKind::Pointer32: return QStringLiteral("uint32_t"); case NodeKind::Pointer64: return QStringLiteral("uint64_t"); case NodeKind::FuncPtr32: return QStringLiteral("uint32_t"); case NodeKind::FuncPtr64: return QStringLiteral("uint64_t"); case NodeKind::Vec2: return QStringLiteral("float"); case NodeKind::Vec3: return QStringLiteral("float"); case NodeKind::Vec4: return QStringLiteral("float"); case NodeKind::Mat4x4: return QStringLiteral("float"); case NodeKind::UTF8: return QStringLiteral("char"); case NodeKind::UTF16: return QStringLiteral("wchar_t"); default: return QStringLiteral("uint8_t"); } } // ── Generator context ── struct GenContext { const NodeTree& tree; QHash> childMap; QSet emittedTypeNames; // struct type names already emitted QSet emittedIds; // struct node IDs already emitted QSet visiting; // cycle guard QSet forwardDeclared; // forward-declared type IDs QString output; int padCounter = 0; const QHash* typeAliases = nullptr; bool emitAsserts = false; QString uniquePadName() { return QStringLiteral("_pad%1").arg(padCounter++, 4, 16, QChar('0')); } // Resolve the C type name for a primitive, consulting aliases first QString cType(NodeKind kind) const { if (typeAliases) { auto it = typeAliases->find(kind); if (it != typeAliases->end() && !it.value().isEmpty()) return it.value(); } return cTypeName(kind); } // Resolve the canonical type name for a struct/array node QString structName(const Node& n) const { if (!n.structTypeName.isEmpty()) return sanitizeIdent(n.structTypeName); if (!n.name.isEmpty()) return sanitizeIdent(n.name); return QStringLiteral("anon_%1").arg(n.id, 0, 16); } }; // Forward declarations static void emitStruct(GenContext& ctx, uint64_t structId); // ── Field line with offset comment (code + marker + comment) ── // We use a \x01 marker to separate the code part from the offset comment. // After all output is generated, alignComments() replaces markers with padding. static const QChar kCommentMarker = QChar(0x01); static QString offsetComment(int offset, bool isSizeof = false) { if (isSizeof) return QString(kCommentMarker) + QStringLiteral("// sizeof 0x%1").arg(QString::number(offset, 16).toUpper()); return QString(kCommentMarker) + QStringLiteral("// 0x%1").arg(QString::number(offset, 16).toUpper()); } static QString indent(int depth) { return QString(depth * 4, ' '); } static QString emitField(GenContext& ctx, const Node& node, int depth, int baseOffset) { const NodeTree& tree = ctx.tree; QString ind = indent(depth); QString name = sanitizeIdent(node.name.isEmpty() ? QStringLiteral("field_%1").arg(node.offset, 2, 16, QChar('0')) : node.name); QString oc = offsetComment(baseOffset + node.offset); switch (node.kind) { case NodeKind::Vec2: return ind + QStringLiteral("%1 %2[2];").arg(ctx.cType(NodeKind::Float), name) + oc; case NodeKind::Vec3: return ind + QStringLiteral("%1 %2[3];").arg(ctx.cType(NodeKind::Float), name) + oc; case NodeKind::Vec4: return ind + QStringLiteral("%1 %2[4];").arg(ctx.cType(NodeKind::Float), name) + oc; case NodeKind::Mat4x4: return ind + QStringLiteral("%1 %2[4][4];").arg(ctx.cType(NodeKind::Float), name) + oc; case NodeKind::UTF8: return ind + QStringLiteral("%1 %2[%3];").arg(ctx.cType(NodeKind::UTF8), name).arg(node.strLen) + oc; case NodeKind::UTF16: return ind + QStringLiteral("%1 %2[%3];").arg(ctx.cType(NodeKind::UTF16), name).arg(node.strLen) + oc; case NodeKind::Pointer32: case NodeKind::Pointer64: { if (node.refId != 0) { int refIdx = tree.indexOfId(node.refId); if (refIdx >= 0) { QString target = ctx.structName(tree.nodes[refIdx]); return ind + QStringLiteral("struct %1* %2;").arg(target, name) + oc; } } // Native pointer: use void* when this is the target's natural pointer kind bool isNativePtr = (node.kind == NodeKind::Pointer32 && ctx.tree.pointerSize <= 4) || (node.kind == NodeKind::Pointer64 && ctx.tree.pointerSize >= 8); if (isNativePtr) return ind + QStringLiteral("void* %1;").arg(name) + oc; // Cross-size pointer: fall back to raw integer type return ind + QStringLiteral("%1 %2;").arg(ctx.cType(node.kind), name) + oc; } case NodeKind::FuncPtr32: return ind + QStringLiteral("void (*%1)();").arg(name) + oc; case NodeKind::FuncPtr64: return ind + QStringLiteral("void (*%1)();").arg(name) + oc; default: return ind + QStringLiteral("%1 %2;").arg(ctx.cType(node.kind), name) + oc; } } // ── Emit struct body (fields + padding) — Vergilius-style ── static void emitStructBody(GenContext& ctx, uint64_t structId, bool isUnion, int depth, int baseOffset) { const NodeTree& tree = ctx.tree; int idx = tree.indexOfId(structId); if (idx < 0) return; int structSize = tree.structSpan(structId, &ctx.childMap); QString ind = indent(depth); QVector allChildren = ctx.childMap.value(structId); QVector children, staticIdxs; for (int ci : allChildren) { if (tree.nodes[ci].isStatic) staticIdxs.append(ci); else children.append(ci); } std::sort(children.begin(), children.end(), [&](int a, int b) { return tree.nodes[a].offset < tree.nodes[b].offset; }); // Helper: emit a padding/hex run as a single collapsed byte array auto emitPadRun = [&](int relOffset, int size) { if (size <= 0) return; ctx.output += ind + QStringLiteral("uint8_t %1[0x%2];%3\n") .arg(ctx.uniquePadName()) .arg(QString::number(size, 16).toUpper()) .arg(offsetComment(baseOffset + relOffset)); }; int cursor = 0; int i = 0; while (i < children.size()) { const Node& child = tree.nodes[children[i]]; int childSize; if (child.kind == NodeKind::Struct || child.kind == NodeKind::Array) childSize = tree.structSpan(child.id, &ctx.childMap); else childSize = child.byteSize(); // Gap/overlap handling (skip for unions) if (!isUnion) { if (child.offset > cursor) emitPadRun(cursor, child.offset - cursor); else if (child.offset < cursor) ctx.output += ind + QStringLiteral("// WARNING: overlap at offset 0x%1 (previous field ends at 0x%2)\n") .arg(QString::number(baseOffset + child.offset, 16).toUpper()) .arg(QString::number(baseOffset + cursor, 16).toUpper()); } // Collapse consecutive hex nodes into a single padding array if (isHexNode(child.kind)) { int runStart = child.offset; int runEnd = child.offset + childSize; int j = i + 1; while (j < children.size()) { const Node& next = tree.nodes[children[j]]; if (!isHexNode(next.kind)) break; int nextSize = next.byteSize(); if (next.offset < runEnd) break; runEnd = next.offset + nextSize; j++; } emitPadRun(runStart, runEnd - runStart); cursor = runEnd; i = j; continue; } // Emit the field if (child.kind == NodeKind::Struct) { // Bitfield container — emit inline bitfield members if (child.classKeyword == QStringLiteral("bitfield") && !child.bitfieldMembers.isEmpty()) { QString bfType = ctx.cType(child.elementKind); if (bfType.isEmpty()) bfType = QStringLiteral("uint32_t"); QString fieldName = child.name.isEmpty() ? QString() : QStringLiteral(" ") + sanitizeIdent(child.name); ctx.output += ind + QStringLiteral("struct\n"); ctx.output += ind + QStringLiteral("{\n"); QString bfInd = indent(depth + 1); for (const auto& m : child.bitfieldMembers) { ctx.output += bfInd + bfType + QStringLiteral(" ") + sanitizeIdent(m.name) + QStringLiteral(" : ") + QString::number(m.bitWidth) + QStringLiteral(";") + offsetComment(baseOffset + child.offset) + QStringLiteral("\n"); } ctx.output += ind + QStringLiteral("}") + fieldName + QStringLiteral(";") + offsetComment(baseOffset + child.offset) + QStringLiteral("\n"); } else { bool isAnonymous = child.structTypeName.isEmpty(); if (isAnonymous) { // Inline anonymous struct/union QString kw = child.resolvedClassKeyword(); ctx.output += ind + kw + QStringLiteral("\n"); ctx.output += ind + QStringLiteral("{\n"); bool childIsUnion = (kw == QStringLiteral("union")); emitStructBody(ctx, child.id, childIsUnion, depth + 1, baseOffset + child.offset); QString fieldName = child.name.isEmpty() ? QString() : QStringLiteral(" ") + sanitizeIdent(child.name); ctx.output += ind + QStringLiteral("}") + fieldName + QStringLiteral(";") + offsetComment(baseOffset + child.offset) + QStringLiteral("\n"); } else { // Named struct — reference by name with struct keyword prefix QString kw = child.resolvedClassKeyword(); if (kw == QStringLiteral("enum") && child.enumMembers.isEmpty()) kw = QStringLiteral("struct"); QString typeName = sanitizeIdent(child.structTypeName); QString fieldName = sanitizeIdent(child.name); ctx.output += ind + kw + QStringLiteral(" ") + typeName + QStringLiteral(" ") + fieldName + QStringLiteral(";") + offsetComment(baseOffset + child.offset) + QStringLiteral("\n"); } } // end bitfield else } else if (child.kind == NodeKind::Array) { QVector arrayKids = ctx.childMap.value(child.id); bool hasStructChild = false; QString elemTypeName; for (int ak : arrayKids) { if (tree.nodes[ak].kind == NodeKind::Struct) { hasStructChild = true; elemTypeName = ctx.structName(tree.nodes[ak]); break; } } QString fieldName = sanitizeIdent(child.name); if (hasStructChild && !elemTypeName.isEmpty()) { ctx.output += ind + QStringLiteral("struct %1 %2[%3];%4\n") .arg(elemTypeName, fieldName).arg(child.arrayLen) .arg(offsetComment(baseOffset + child.offset)); } else { ctx.output += ind + QStringLiteral("%1 %2[%3];%4\n") .arg(ctx.cType(child.elementKind), fieldName).arg(child.arrayLen) .arg(offsetComment(baseOffset + child.offset)); } } else { ctx.output += emitField(ctx, child, depth, baseOffset) + QStringLiteral("\n"); } int childEnd = child.offset + childSize; if (childEnd > cursor) cursor = childEnd; i++; } // Tail padding (skip for unions) if (!isUnion && cursor < structSize) emitPadRun(cursor, structSize - cursor); // Emit static field comments (static fields are runtime-only, not part of struct layout) for (int si : staticIdxs) { const Node& sf = tree.nodes[si]; QString sfType = sf.structTypeName.isEmpty() ? ctx.cType(sf.kind) : sf.structTypeName; ctx.output += ind + QStringLiteral("// static: %1 %2 @ %3\n") .arg(sfType, sanitizeIdent(sf.name), sf.offsetExpr); } } // ── Emit a complete top-level struct definition (Vergilius-style) ── static void emitStruct(GenContext& ctx, uint64_t structId) { if (ctx.emittedIds.contains(structId)) return; if (ctx.visiting.contains(structId)) return; // cycle ctx.visiting.insert(structId); int idx = ctx.tree.indexOfId(structId); if (idx < 0) { ctx.visiting.remove(structId); return; } const Node& node = ctx.tree.nodes[idx]; if (node.kind != NodeKind::Struct && node.kind != NodeKind::Array) { ctx.visiting.remove(structId); return; } if (node.kind == NodeKind::Array) { ctx.visiting.remove(structId); return; } // Deduplicate by struct type name QString typeName = ctx.structName(node); if (ctx.emittedTypeNames.contains(typeName)) { ctx.emittedIds.insert(structId); ctx.visiting.remove(structId); return; } ctx.emittedIds.insert(structId); ctx.emittedTypeNames.insert(typeName); int structSize = ctx.tree.structSpan(structId, &ctx.childMap); QString kw = node.resolvedClassKeyword(); // Enum with members: emit as proper C enum if (kw == QStringLiteral("enum") && !node.enumMembers.isEmpty()) { ctx.output += QStringLiteral("enum %1 {\n").arg(typeName); for (const auto& m : node.enumMembers) { ctx.output += QStringLiteral(" %1 = %2,\n") .arg(sanitizeIdent(m.first)) .arg(m.second); } ctx.output += QStringLiteral("};\n\n"); ctx.visiting.remove(structId); return; } if (kw == QStringLiteral("enum")) kw = QStringLiteral("struct"); ctx.output += kw + QStringLiteral(" ") + typeName + QStringLiteral("\n{\n"); emitStructBody(ctx, structId, kw == QStringLiteral("union"), 1, 0); ctx.output += QStringLiteral("};") + offsetComment(structSize, true) + QStringLiteral("\n"); if (ctx.emitAsserts) ctx.output += QStringLiteral("static_assert(sizeof(%1) == 0x%2, \"Size mismatch for %1\");\n") .arg(typeName) .arg(QString::number(structSize, 16).toUpper()); ctx.output += QStringLiteral("\n"); ctx.visiting.remove(structId); } // ── Build the child map used by all generators ── static QHash> buildChildMap(const NodeTree& tree) { QHash> map; for (int i = 0; i < tree.nodes.size(); i++) map[tree.nodes[i].parentId].append(i); return map; } // ── Align offset comments ── // Replaces kCommentMarker with spaces so all "// 0x..." comments align to // the same column (the longest code portion + 1 space). static QString alignComments(const QString& raw) { QStringList lines = raw.split('\n'); // First pass: find the maximum code width (text before the marker) int maxCode = 0; for (const QString& line : lines) { int pos = line.indexOf(kCommentMarker); if (pos >= 0) maxCode = qMax(maxCode, pos); } // Second pass: replace markers with padding QString result; result.reserve(raw.size() + lines.size() * 8); for (int i = 0; i < lines.size(); i++) { if (i > 0) result += '\n'; const QString& line = lines[i]; int pos = line.indexOf(kCommentMarker); if (pos >= 0) { result += line.left(pos); int pad = maxCode - pos + 1; if (pad < 1) pad = 1; result += QString(pad, ' '); result += line.mid(pos + 1); // skip the marker char } else { result += line; } } return result; } } // anonymous namespace // ── Public API ── QString renderCpp(const NodeTree& tree, uint64_t rootStructId, const QHash* typeAliases, bool emitAsserts) { int idx = tree.indexOfId(rootStructId); if (idx < 0) return {}; const Node& root = tree.nodes[idx]; if (root.kind != NodeKind::Struct) return {}; GenContext ctx{tree, buildChildMap(tree), {}, {}, {}, {}, {}, 0, typeAliases, emitAsserts}; ctx.output += QStringLiteral("#pragma once\n\n"); emitStruct(ctx, rootStructId); return alignComments(ctx.output); } QString renderCppAll(const NodeTree& tree, const QHash* typeAliases, bool emitAsserts) { GenContext ctx{tree, buildChildMap(tree), {}, {}, {}, {}, {}, 0, typeAliases, emitAsserts}; ctx.output += QStringLiteral("#pragma once\n\n"); QVector roots = ctx.childMap.value(0); std::sort(roots.begin(), roots.end(), [&](int a, int b) { return tree.nodes[a].offset < tree.nodes[b].offset; }); for (int ri : roots) { if (tree.nodes[ri].kind == NodeKind::Struct) emitStruct(ctx, tree.nodes[ri].id); } return alignComments(ctx.output); } QString renderNull(const NodeTree&, uint64_t) { return {}; } } // namespace rcx