Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 | 38x 38x 1188x 816x 42x 521x 567x 182x 385x 2x 383x 10x 373x 23x 23x 23x 2x 21x 16x 16x 16x 16x 16x 478x 478x 2x 476x 476x 476x 421x 55x 48x 7x 5x 2x 474x 474x 2x 472x 12x 785x 785x 754x 754x 11x 11x 11x 743x 743x 4x 739x 694x 45x 41x 4x 1603x 1603x 1243x 360x 360x 360x 22x 338x 338x 5x 333x 333x 6x 327x 327x 11x 316x 316x 8x 308x 77x 77x 76x 138x 122x 122x 208x 208x 146x 146x 146x 74x 208x 208x 208x 208x 187x 187x 21x 163x 163x 251x 251x 164x 76x 76x 76x 18x 58x 214x 214x 214x 433x 433x 433x 294x 294x 214x 433x 433x 2x 431x 431x 26x 3076x 2388x 2388x 14x 2381x 2378x 2378x 3082x 3082x 2726x 2378x 2381x 2388x 76x 76x 433x 433x 433x 2x 2x 433x 2x 2x 2x 433x 2x 2x 2x 26x 26x 26x 1731x 1731x 1730x 1730x 249x 249x 100x 100x 1481x 42x 42x 42x 42x 1479x 1731x 351x 351x 212x 139x 1267x 351x 208x 143x 143x 208x 40x 168x 5x 5x 163x 163x 84x 79x 45x 45x 7x 38x 143x 143x 81x 62x 49x 13x 9x 4x 1736x 1736x 790x 790x 790x 790x 665x 125x 946x 42x 904x 7x 897x 897x 766x 766x 131x 131x 22x 22x 109x 109x 1x 108x 6x 6x 30x 30x 28x 2x 2x 1x 1x 308x 115x 22x 8x 14x 6x 6x 8x 3x 3x 167x 167x 81x | /**
* TypeResolver - Handles type inference, classification, and validation
* Static class that reads from CodeGenState directly.
*/
import { ParserRuleContext } from "antlr4ng";
import * as Parser from "../../logic/parser/grammar/CNextParser";
import CodeGenState from "../../state/CodeGenState";
import INTEGER_TYPES from "./types/INTEGER_TYPES";
import FLOAT_TYPES from "./types/FLOAT_TYPES";
import SIGNED_TYPES from "./types/SIGNED_TYPES";
import UNSIGNED_TYPES from "./types/UNSIGNED_TYPES";
import TYPE_WIDTH from "../../constants/TYPE_WIDTH";
import TYPE_RANGES from "./types/TYPE_RANGES";
import ExpressionUnwrapper from "../../../utils/ExpressionUnwrapper";
import type TOverflowBehavior from "../../types/TOverflowBehavior";
import type TTypeInfo from "../../types/TTypeInfo";
import QualifiedNameGenerator from "./utils/QualifiedNameGenerator";
import QualifiedCName from "../../../utils/QualifiedCName";
import ScopeUtils from "../../../utils/ScopeUtils";
/**
* Internal type info tracked through postfix suffix chains.
* Preserves isArray so indexing can distinguish array access from bit indexing.
*/
type InternalTypeInfo = { baseType: string; isArray: boolean };
/**
* Discriminated union for postfix suffix processing results.
* stop=true: return type immediately (terminal suffix like bit indexing).
* stop=false: continue chain with updated InternalTypeInfo.
*/
type SuffixResult =
| { stop: true; type: string | null }
| { stop: false; info: InternalTypeInfo };
class TypeResolver {
/** Sentinel value for `global` keyword in postfix expression type resolution */
private static readonly GLOBAL_SENTINEL = "__global__";
/** Sentinel value for `this` keyword in postfix expression type resolution */
private static readonly THIS_SENTINEL = "__this__";
/**
* ADR-024: Check if a type is any integer (signed or unsigned)
*/
static isIntegerType(typeName: string): boolean {
return (INTEGER_TYPES as readonly string[]).includes(typeName);
}
/**
* ADR-024: Check if a type is a floating point type
*/
static isFloatType(typeName: string): boolean {
return (FLOAT_TYPES as readonly string[]).includes(typeName);
}
/**
* ADR-024: Check if a type is a signed integer
*/
static isSignedType(typeName: string): boolean {
return (SIGNED_TYPES as readonly string[]).includes(typeName);
}
/**
* ADR-024: Check if a type is an unsigned integer
*/
static isUnsignedType(typeName: string): boolean {
return (UNSIGNED_TYPES as readonly string[]).includes(typeName);
}
/**
* Check if a type is a user-defined struct (C-Next or C header).
* Issue #103: Now checks both knownStructs AND SymbolTable.
*/
static isStructType(typeName: string): boolean {
if (CodeGenState.symbols?.knownStructs.has(typeName)) {
return true;
}
// Issue #551: Bitmaps are struct-like (use pass-by-reference with -> access)
if (CodeGenState.symbols?.knownBitmaps.has(typeName)) {
return true;
}
if (CodeGenState.symbolTable.getStructFields(typeName)) {
return true;
}
return false;
}
/**
* ADR-024: Check if conversion from sourceType to targetType is narrowing
*/
static isNarrowingConversion(
sourceType: string,
targetType: string,
): boolean {
const sourceWidth = TYPE_WIDTH[sourceType] || 0;
const targetWidth = TYPE_WIDTH[targetType] || 0;
if (sourceWidth === 0 || targetWidth === 0) {
return false;
}
return targetWidth < sourceWidth;
}
/**
* ADR-024: Check if conversion involves a sign change
*/
static isSignConversion(sourceType: string, targetType: string): boolean {
const sourceIsSigned = TypeResolver.isSignedType(sourceType);
const sourceIsUnsigned = TypeResolver.isUnsignedType(sourceType);
const targetIsSigned = TypeResolver.isSignedType(targetType);
const targetIsUnsigned = TypeResolver.isUnsignedType(targetType);
return (
(sourceIsSigned && targetIsUnsigned) ||
(sourceIsUnsigned && targetIsSigned)
);
}
/**
* ADR-024: Validate that a literal value fits within the target type's range.
* Throws an error if the value doesn't fit.
*/
static validateLiteralFitsType(
literalText: string,
targetType: string,
): void {
const range = TYPE_RANGES[targetType];
if (!range) {
return;
}
let value: bigint;
try {
const cleanText = literalText.trim();
if (/^-?\d+$/.exec(cleanText)) {
value = BigInt(cleanText);
} else if (/^0[xX][0-9a-fA-F]+$/.exec(cleanText)) {
value = BigInt(cleanText);
} else if (/^0[bB][01]+$/.exec(cleanText)) {
value = BigInt(cleanText);
} else {
return;
}
} catch {
return;
}
const [min, max] = range;
if (TypeResolver.isUnsignedType(targetType) && value < 0n) {
throw new Error(
`Error: Negative value ${literalText} cannot be assigned to unsigned type ${targetType}`,
);
}
if (value < min || value > max) {
throw new Error(
`Error: Value ${literalText} exceeds ${targetType} range (${min} to ${max})`,
);
}
}
/**
* ADR-024: Get the type from a literal (suffixed or unsuffixed).
*/
static getLiteralType(ctx: Parser.LiteralContext): string | null {
const text = ctx.getText();
if (text === "true" || text === "false") return "bool";
const suffixMatch = /([uUiI])(8|16|32|64)$/.exec(text);
if (suffixMatch) {
const signChar = suffixMatch[1].toLowerCase();
const width = suffixMatch[2];
return (signChar === "u" ? "u" : "i") + width;
}
const floatMatch = /[fF](32|64)$/.exec(text);
if (floatMatch) {
return "f" + floatMatch[1];
}
// Plain integer literals (no suffix) have type int in C
// Check for integer: starts with digit, no decimal point
if (/^\d+$/.test(text) || /^0[xXbBoO][\da-fA-F]+$/.test(text)) {
return "int";
}
// Plain float literals (no suffix) have type double in C
if (
/^\d*\.\d+([eE][+-]?\d+)?$/.test(text) ||
/^\d+[eE][+-]?\d+$/.test(text)
) {
return "f64";
}
return null;
}
/**
* ADR-024: Get the type of an expression for type checking.
*/
static getExpressionType(ctx: Parser.ExpressionContext): string | null {
const postfix = ExpressionUnwrapper.getPostfixExpression(ctx);
if (postfix) {
return TypeResolver.getPostfixExpressionType(postfix);
}
const ternary = ctx.ternaryExpression();
const orExprs = ternary.orExpression();
if (orExprs.length > 1) {
return null;
}
const or = orExprs[0];
if (or.andExpression().length > 1) {
return "bool";
}
const and = or.andExpression()[0];
if (and.equalityExpression().length > 1) {
return "bool";
}
const eq = and.equalityExpression()[0];
if (eq.relationalExpression().length > 1) {
return "bool";
}
const rel = eq.relationalExpression()[0];
if (rel.bitwiseOrExpression().length > 1) {
return "bool";
}
return null;
}
/**
* Resolve the C-Next integer type of an expression, including composite
* arithmetic/bitwise expressions that `getExpressionType` leaves unresolved.
*
* MISRA C:2012 Rule 10.4 (enforced by MixedTypeCategoryAnalyzer) guarantees a
* binary operator's operands share an essential type category, so a composite
* integer expression's category is uniform; its essential width is the widest
* integer operand. This is what lets slice-assignment serialize an arithmetic
* source (e.g. `a + b`) MISRA Rule 10.8-clean instead of guessing a width.
*
* Returns null when no integer-typed variable leaf can be resolved (e.g. a
* struct-field or function-call composite — left for a later pass).
*/
static getIntegerExpressionType(
ctx: Parser.ExpressionContext,
): string | null {
const direct = TypeResolver.getExpressionType(ctx);
if (direct !== null) return direct;
return TypeResolver.resolveCompositeIntegerType(ctx);
}
/**
* Combine the leaf VALUE operands of a composite expression into a single
* C-Next type: the (uniform, per Rule 10.4) category at the widest width.
*
* Operands are typed by their value (Issue #1085 review) — an array index
* (`arr[i]`), bit offset (`x[off, w]`) or struct member name is NOT a value
* operand and must not contribute to the width. A bit-extraction contributes
* its EXTRACTED width, not the variable's full width (typing `a + b[0, 32]`
* as u64 would cast the composite to a wider type — MISRA Rule 10.8).
*/
/**
* Issue #1152: the C-Next integer type of any composite node, for callers
* that hold an `additiveExpression`/`multiplicativeExpression` rather than a
* whole `expression`. Same rule as getIntegerExpressionType: the (uniform,
* per Rule 10.4) category at the widest operand's width.
*/
static getCompositeIntegerType(node: ParserRuleContext): string | null {
return TypeResolver.resolveCompositeIntegerType(node);
}
/**
* Issue #1152: the overflow behavior of a composite arithmetic expression.
*
* `clamp` is the default (ADR-044), and safety wins a mix: the expression
* wraps only when EVERY integer operand was explicitly declared `wrap`. One
* saturating operand is enough to make the result saturate, which is what
* makes a bounds guard like `offset + length <= limit` trustworthy when
* `offset` can saturate (see #231).
*
* Returns null when no operand resolves to a declared integer variable, in
* which case the caller should leave the expression alone.
*/
static getCompositeOverflowBehavior(
node: ParserRuleContext,
): TOverflowBehavior | null {
let sawInteger = false;
for (const operand of TypeResolver.collectOperandPostfixes(node)) {
const info = TypeResolver.operandTypeInfo(operand);
if (info === undefined) continue;
Iif (!TypeResolver.isIntegerType(info.baseType)) continue;
sawInteger = true;
if (info.overflowBehavior === "clamp") return "clamp";
}
return sawInteger ? "wrap" : null;
}
/**
* The declared type info for a leaf operand, when it is a plain variable.
* Anything else (array element, member chain, call result) has no declared
* overflow behavior of its own to consult.
*/
private static operandTypeInfo(
postfix: Parser.PostfixExpressionContext,
): TTypeInfo | undefined {
const primary = postfix.primaryExpression();
Iif (!primary) return undefined;
const ops = postfix.postfixOp();
if (ops.length === 0) {
const name = primary.getText();
return name ? CodeGenState.getVariableTypeInfo(name) : undefined;
}
return TypeResolver.scopeMemberOperandTypeInfo(primary, ops);
}
/**
* The declared type info for a SCOPE MEMBER operand (`Counter.value`,
* `this.value`).
*
* Issue #1303: this used to return undefined for anything with a postfix op,
* so ADR-044's overflow behavior was dropped for every scope member -- with
* no file boundary involved. `Local.value <- Local.value + 10` emitted plain
* C arithmetic in the very file that declared `Local`, while an identical
* statement on a plain global saturated correctly.
*
* A scope member is a plain global under a qualified C name, so the answer is
* the SAME lookup the bare-identifier branch makes -- only the key differs.
* Deriving the key here rather than giving member operands their own notion of
* overflow behavior is what keeps this one decision: fix the fact on the
* symbol (as #1303 does for the cross-file half) and both branches inherit it.
*
* Returns undefined for anything that is not a pure member chain -- a
* subscript or a call has no declared behavior of its own to consult.
*
* Also undefined for a struct field, but for a different reason worth keeping
* separate: `p.x` IS a declared integer and DOES have an ADR-044 behavior, it
* simply has no `p__x` entry here, because a struct field is a field of a
* value rather than a global under a qualified name. So it currently wraps --
* tracked as #1411, and not fixable by extending the key. ADR-063 forbids
* `__` inside an identifier, so the key this builds can never collide with a
* real bare name.
*/
private static scopeMemberOperandTypeInfo(
primary: Parser.PrimaryExpressionContext,
ops: Parser.PostfixOpContext[],
): TTypeInfo | undefined {
const members: string[] = [];
for (const op of ops) {
const identifier = op.IDENTIFIER();
if (identifier === null || op.LBRACKET() !== null) return undefined;
members.push(identifier.getText());
}
// `this.value` names the CURRENT scope, which the syntax does not spell
// out; `Counter.value` spells its own path. Both go through the one
// encoder rather than joining with "__" by hand.
return CodeGenState.getVariableTypeInfo(
TypeResolver.memberChainKey(primary, members),
);
}
/**
* The registry key for a member chain, for each of the three spellings
* ADR-016 gives one scope member.
*
* `this.value` names the CURRENT scope, which the syntax does not spell out.
* `global.Counter.value` names the path from global scope, so the qualifier
* contributes no component of its own. `Counter.value` spells its whole path.
* All three reach the same C lvalue and must reach the same key -- #1303
* originally answered only two of them, which left `global.` wrapping while
* the other two saturated, in one function.
*
* Every branch goes through the one encoder rather than joining with `__` by
* hand, per the rule that a qualified name has a single producer.
*/
private static memberChainKey(
primary: Parser.PrimaryExpressionContext,
members: readonly string[],
): string {
Iif (primary.THIS() !== null) {
return ScopeUtils.qualifyPathInScope(
[...members],
CodeGenState.currentScope,
);
}
if (primary.GLOBAL() !== null) {
return QualifiedCName.fromParts(members);
}
return QualifiedCName.fromParts([primary.getText(), ...members]);
}
private static resolveCompositeIntegerType(
ctx: ParserRuleContext,
): string | null {
let category: "i" | "u" | null = null;
let width = 0;
for (const operand of TypeResolver.collectOperandPostfixes(ctx)) {
const operandType = TypeResolver.typeOperandPostfix(operand);
const match = operandType
? /^([iu])(8|16|32|64)$/.exec(operandType)
: null;
if (!match) continue;
category ??= match[1] as "i" | "u";
width = Math.max(width, Number.parseInt(match[2], 10));
}
return category && width > 0 ? `${category}${width}` : null;
}
/**
* Type one leaf operand of a composite by its VALUE type. A bit-extraction
* `x[start, width]` yields an unsigned value of the extracted width; a simple
* function call `name(...)` yields its declared return type; everything else
* (variable, array element, struct field, member chain) defers to
* getPostfixExpressionType. Returns null for an operand it cannot classify
* (e.g. a literal, which is contextually typed).
*/
private static typeOperandPostfix(
postfix: Parser.PostfixExpressionContext,
): string | null {
const extractionWidth = TypeResolver.bitExtractionWidth(postfix);
if (extractionWidth !== null) {
return TypeResolver.unsignedTypeForBits(extractionWidth);
}
const direct = TypeResolver.getPostfixExpressionType(postfix);
if (direct !== null) return direct;
return TypeResolver.callReturnType(postfix);
}
/**
* Collect the leaf operand postfix expressions of a composite WITHOUT
* descending into a postfix's own internals — so an array index (`arr[i]`) or
* bit offset (`x[off, w]`) variable is never mistaken for a value operand.
*/
private static collectOperandPostfixes(
node: ParserRuleContext,
): Parser.PostfixExpressionContext[] {
if (node instanceof Parser.PostfixExpressionContext) return [node];
// Issue #1152: a ternary's VALUE is its two arms; the condition is a
// separate expression contributing no value operand. Counting it types
// `(val > 0) ? 1 : -1` by `val`, reporting an i32 result as u32.
// Addressed via orExpression() rather than child indices because the
// condition is parenthesised, so it sits at child index 1, not 0.
const arms = TypeResolver.ternaryValueArms(node);
if (arms !== null) {
return arms.flatMap((arm) => TypeResolver.collectOperandPostfixes(arm));
}
// Issue #1152: `&x` (address-of, ADR-006) yields an ADDRESS, not x's
// value, so x's type must not flow out as the expression's type --
// `u32 addr <- &counter` with an i32 counter is not a sign conversion.
if (TypeResolver.isAddressOf(node)) return [];
const operands: Parser.PostfixExpressionContext[] = [];
for (let i = 0; i < node.getChildCount(); i += 1) {
const child = node.getChild(i);
if (child instanceof ParserRuleContext) {
operands.push(...TypeResolver.collectOperandPostfixes(child));
}
}
return operands;
}
/**
* True for a `&expr` address-of node (ADR-006). Detected by the leading
* token rather than by child count, since the operand is itself a
* unaryExpression.
*/
private static isAddressOf(node: ParserRuleContext): boolean {
return (
node instanceof Parser.UnaryExpressionContext &&
node.getChildCount() === 2 &&
node.getChild(0)?.getText() === "&"
);
}
/**
* The two value arms of a conditional ternary, or null when this node is not
* one. A ternaryExpression with a single orExpression child is a
* pass-through and has no condition to exclude.
*/
private static ternaryValueArms(
node: ParserRuleContext,
): Parser.OrExpressionContext[] | null {
if (!(node instanceof Parser.TernaryExpressionContext)) return null;
const branches = node.orExpression();
return branches.length === 3 ? [branches[1]!, branches[2]!] : null;
}
/**
* If a postfix expression's terminal suffix is a bit-range extraction
* `[start, width]` with a compile-time-constant width, return that width in
* bits; else null.
*/
private static bitExtractionWidth(
postfix: Parser.PostfixExpressionContext,
): number | null {
const ops = postfix.postfixOp();
const last = ops.at(-1);
if (last?.expression().length !== 2) return null;
const widthExpr = last.expression()[1];
// Resolve the width through the constant evaluator — the same path the slice
// offset/length use — so a named const or any-base literal width
// (`b[0, WIDTH]`, `b[0, 0b100000]`) is sized at its real width rather than
// dropped, which would mis-type a composite slice source (Issue #1085 review).
const evaluated = CodeGenState.generator?.tryEvaluateConstant(widthExpr);
Iif (evaluated !== undefined) {
return evaluated > 0 ? evaluated : null;
}
// Fallback for contexts with no generator (e.g. isolated unit tests): accept
// a plain decimal/hex literal width directly.
const widthText = widthExpr.getText();
Iif (!/^(0x[0-9a-fA-F]+|\d+)$/.test(widthText)) return null;
const value = Number.parseInt(
widthText,
widthText.startsWith("0x") ? 16 : 10,
);
return Number.isNaN(value) || value <= 0 ? null : value;
}
/** Smallest standard unsigned C-Next type holding `bits` bits, or null if >64. */
private static unsignedTypeForBits(bits: number): string | null {
Iif (bits <= 8) return "u8";
Iif (bits <= 16) return "u16";
Eif (bits <= 32) return "u32";
if (bits <= 64) return "u64";
return null;
}
/**
* If a postfix expression is a simple function call `name(...)`, return the
* function's declared return type — a call operand's width comes from its
* return type, not from being ignored (Issue #1085 review).
*/
private static callReturnType(
postfix: Parser.PostfixExpressionContext,
): string | null {
const ops = postfix.postfixOp();
Eif (ops.length !== 1 || !ops[0].getText().startsWith("(")) return null;
const name = postfix.primaryExpression()?.IDENTIFIER()?.getText();
return name ? (CodeGenState.getFunctionReturnType(name) ?? null) : null;
}
/**
* ADR-024: Get the type of a postfix expression.
* Tracks InternalTypeInfo (baseType + isArray) through the suffix chain
* so that array indexing is correctly distinguished from bit indexing.
*/
static getPostfixExpressionType(
ctx: Parser.PostfixExpressionContext,
): string | null {
const primary = ctx.primaryExpression();
if (!primary) return null;
let current = TypeResolver.getPrimaryExpressionTypeInfo(primary);
if (!current) {
// #1303: a scope member named through its scope (`Counter.value`) has no
// type at the primary -- `Counter` is a scope, not a variable, so the
// lookup above returns null and the whole operand used to type as
// nothing. That silently cost the operand BOTH its width and its ADR-044
// overflow behavior, which is why `Counter__value + 10` was emitted
// unclamped and without the `U` suffix every other operand carries.
//
// `this.value` reached the registry through the sentinel branch in
// processMemberSuffix and so was unaffected -- the two spellings of one
// member disagreed purely on which of them the resolver could name.
const ops = ctx.postfixOp();
if (ops.length === 0) return null;
const memberInfo = TypeResolver.scopeMemberOperandTypeInfo(primary, ops);
return memberInfo ? memberInfo.baseType : null;
}
// #1303: `global.Scope.member`. The sentinel walk below resolves `global.X`
// as a single variable NAME, so a scope-qualified member under `global.`
// stopped at the scope and typed as nothing -- leaving the third spelling
// wrapping while `this.value` and `Counter.value` saturated.
//
// Tried first, and only when it answers: `global.plainVar` resolves here
// too (a one-part path is its own key), while `global.someStruct.field`
// does not and falls through to the struct handling below, unchanged.
if (current.baseType === TypeResolver.GLOBAL_SENTINEL) {
const globalOps = ctx.postfixOp();
Eif (globalOps.length > 0) {
const memberInfo = TypeResolver.scopeMemberOperandTypeInfo(
primary,
globalOps,
);
if (memberInfo) return memberInfo.baseType;
}
}
const suffixes = ctx.children?.slice(1) || [];
for (const suffix of suffixes) {
const result = TypeResolver.processPostfixSuffix(
suffix.getText(),
current,
);
if (result.stop) {
return result.type;
}
current = result.info;
}
return current.baseType;
}
/**
* Process a single postfix suffix and determine the resulting type.
* Returns { type, stop, info } where stop=true means return type immediately.
*/
private static processPostfixSuffix(
text: string,
current: InternalTypeInfo,
): SuffixResult {
if (text.startsWith(".")) {
return TypeResolver.processMemberSuffix(text.slice(1), current);
}
Eif (text.startsWith("[") && text.endsWith("]")) {
return TypeResolver.processIndexingSuffix(text, current);
}
return { stop: false, info: current };
}
/**
* Process a member access suffix (.name) and resolve the resulting type.
* Handles global/this sentinel values and regular struct member lookups.
*/
private static processMemberSuffix(
memberName: string,
current: InternalTypeInfo,
): SuffixResult {
// Handle global.X — resolve X as a global variable name
if (current.baseType === TypeResolver.GLOBAL_SENTINEL) {
return TypeResolver.resolveRegistryLookup(memberName);
}
// Handle this.X — resolve X as a scope member variable
if (
current.baseType === TypeResolver.THIS_SENTINEL &&
CodeGenState.currentScope
) {
const scopedName = QualifiedNameGenerator.forMember(
CodeGenState.currentScope,
memberName,
);
return TypeResolver.resolveRegistryLookup(scopedName);
}
const memberInfo = TypeResolver.getMemberTypeInfo(
current.baseType,
memberName,
);
if (!memberInfo) {
return { stop: true, type: null };
}
return {
stop: false,
info: { baseType: memberInfo.baseType, isArray: memberInfo.isArray },
};
}
/**
* Look up a variable name in the type registry and return a SuffixResult.
*/
private static resolveRegistryLookup(name: string): SuffixResult {
const typeInfo = CodeGenState.getVariableTypeInfo(name);
if (typeInfo) {
return {
stop: false,
info: { baseType: typeInfo.baseType, isArray: typeInfo.isArray },
};
}
return { stop: true, type: null };
}
/**
* Process array or bit indexing suffix.
* Checks isArray BEFORE isIntegerType to correctly distinguish
* array element access from bit indexing.
*/
private static processIndexingSuffix(
text: string,
current: InternalTypeInfo,
): SuffixResult {
const inner = text.slice(1, -1);
// Range indexing: [start, width] - always bit extraction
if (inner.includes(",")) {
return { stop: true, type: null };
}
// Array access: if current type is known to be an array, index yields element
if (current.isArray) {
return {
stop: false,
info: { baseType: current.baseType, isArray: false },
};
}
// Bit indexing on integer: single bit returns bool
if (TypeResolver.isIntegerType(current.baseType)) {
return { stop: true, type: "bool" };
}
// Unknown indexing - preserve current state
return { stop: false, info: current };
}
/**
* Get full InternalTypeInfo from a primary expression (preserves isArray).
*/
private static getPrimaryExpressionTypeInfo(
ctx: Parser.PrimaryExpressionContext,
): InternalTypeInfo | null {
const id = ctx.IDENTIFIER();
if (id) {
const name = id.getText();
const scopedName = CodeGenState.resolveIdentifier(name);
const typeInfo = CodeGenState.getVariableTypeInfo(scopedName);
if (typeInfo) {
return { baseType: typeInfo.baseType, isArray: typeInfo.isArray };
}
return null;
}
// Handle global.X and this.X — these are scope qualifiers, not types.
// The actual variable name is the first .suffix after the keyword.
// Return a sentinel so getPostfixExpressionType knows to consume one suffix.
if (ctx.GLOBAL()) {
return { baseType: TypeResolver.GLOBAL_SENTINEL, isArray: false };
}
if (ctx.THIS()) {
return { baseType: TypeResolver.THIS_SENTINEL, isArray: false };
}
const literal = ctx.literal();
if (literal) {
const litType = TypeResolver.getLiteralType(literal);
return litType ? { baseType: litType, isArray: false } : null;
}
const expr = ctx.expression();
if (expr) {
const exprType = TypeResolver.getExpressionType(expr);
return exprType ? { baseType: exprType, isArray: false } : null;
}
const cast = ctx.castExpression();
if (cast) {
return { baseType: cast.type().getText(), isArray: false };
}
return null;
}
/**
* ADR-024: Get the type of a primary expression (public API, returns baseType only).
*/
static getPrimaryExpressionType(
ctx: Parser.PrimaryExpressionContext,
): string | null {
const info = TypeResolver.getPrimaryExpressionTypeInfo(ctx);
return info?.baseType ?? null;
}
/**
* ADR-024: Get the type of a unary expression (for cast validation).
*/
static getUnaryExpressionType(
ctx: Parser.UnaryExpressionContext,
): string | null {
const postfix = ctx.postfixExpression();
if (postfix) {
return TypeResolver.getPostfixExpressionType(postfix);
}
const unary = ctx.unaryExpression();
if (unary) {
return TypeResolver.getUnaryExpressionType(unary);
}
return null;
}
/**
* ADR-024: Validate that a type conversion is allowed.
*/
static validateTypeConversion(
targetType: string,
sourceType: string | null,
): void {
if (!sourceType) return;
if (sourceType === targetType) return;
if (
!TypeResolver.isIntegerType(sourceType) ||
!TypeResolver.isIntegerType(targetType)
)
return;
if (TypeResolver.isNarrowingConversion(sourceType, targetType)) {
const targetWidth = TYPE_WIDTH[targetType] || 0;
throw new Error(
`Error: Cannot assign ${sourceType} to ${targetType} (narrowing). ` +
`Use bit indexing: value[0, ${targetWidth}]`,
);
}
if (TypeResolver.isSignConversion(sourceType, targetType)) {
const targetWidth = TYPE_WIDTH[targetType] || 0;
throw new Error(
`Error: Cannot assign ${sourceType} to ${targetType} (sign change). ` +
`Use bit indexing: value[0, ${targetWidth}]`,
);
}
}
/**
* Get type info for a struct member field.
* Issue #831: SymbolTable is the single source of truth for struct fields.
*/
static getMemberTypeInfo(
structType: string,
memberName: string,
): { isArray: boolean; baseType: string } | undefined {
const fieldInfo = CodeGenState.symbolTable?.getStructFieldInfo(
structType,
memberName,
);
if (!fieldInfo) return undefined;
return {
isArray:
fieldInfo.arrayDimensions !== undefined &&
fieldInfo.arrayDimensions.length > 0,
baseType: fieldInfo.type,
};
}
}
export default TypeResolver;
|