openalgo-script 0.1.0-alpha.1 → 0.2.0

package/src/core/emit/code.ts

@@ -0,0 +1,155 @@
+/**
+ * An instruction list under construction, with its source positions.
+ *
+ * Two things live here rather than in the passes that emit code, because both
+ * are easy to get subtly wrong in a hundred places and right in one.
+ *
+ * **Positions.** `compiled-program.md` 2.15 stores one triple per change of
+ * position, and the position of any instruction is the triple with the greatest
+ * index at or below it. So the builder is told where it is and works out which
+ * triples to keep; a pass that appended a triple per instruction would produce a
+ * correct program and a debug table four times the size of the code.
+ *
+ * **Stack depth.** Section 3.5 check 5 is the verifier's, and a compiler that
+ * cannot compute the same number cannot know it emitted a loadable program. The
+ * builder walks its own list on demand, so an emitter can assert the depth is
+ * zero where the language says a statement has finished.
+ */
+import type { Span } from '../span/index.js';
+import type { Instruction, Position } from './program.js';
+import type { Opcode } from './opcodes.js';
+import { depthChange, operandCount, targetPositions } from './opcodes.js';
+
+export class CodeBuilder {
+  private readonly instructions: Instruction[] = [];
+  private readonly positions: Position[] = [];
+  private line = 0;
+  private column = 0;
+
+  /** Where the instructions pushed after this call came from. */
+  at(span: Span): void {
+    this.line = span.line;
+    this.column = span.column;
+  }
+
+  /** The index the next instruction will take, which is what a jump targets. */
+  get here(): number {
+    return this.instructions.length;
+  }
+
+  /**
+   * Appends one instruction and returns its index.
+   *
+   * The operand count is checked here because an instruction with the wrong
+   * number of operands is a program an engine refuses at load with one code and
+   * no line (3.5 check 2), and this is the last place that still knows the line.
+   */
+  push(opcode: Opcode, ...operands: number[]): number {
+    if (operands.length !== operandCount(opcode)) {
+      throw new Error(
+        `${opcode} takes ${operandCount(opcode)} operands and was given ${operands.length}`,
+      );
+    }
+    const index = this.instructions.length;
+    const last = this.positions[this.positions.length - 1];
+    if (last === undefined || last[1] !== this.line || last[2] !== this.column) {
+      this.positions.push([index, this.line, this.column]);
+    }
+    this.instructions.push([opcode, ...operands] as Instruction);
+    return index;
+  }
+
+  /** Fills in a jump whose target was not known when it was emitted. */
+  patch(index: number, operand: number, target: number): void {
+    const instruction = this.instructions[index];
+    if (instruction === undefined) throw new Error(`no instruction at ${index}`);
+    const operands = instruction.slice(1) as number[];
+    operands[operand] = target;
+    this.instructions[index] = [instruction[0], ...operands] as Instruction;
+  }
+
+  get code(): readonly Instruction[] {
+    return this.instructions;
+  }
+
+  get pos(): readonly Position[] {
+    return this.positions;
+  }
+}
+
+/** What walking an instruction list found, or the first place it stopped making sense. */
+export interface Walk {
+  /** The depth at each instruction, before it executes. */
+  readonly depths: readonly number[];
+  /** The first instruction whose depth two paths disagreed about, or nothing. */
+  readonly conflict: number | undefined;
+  /** The first instruction the walk reached with a negative depth, or nothing. */
+  readonly underflow: number | undefined;
+  /**
+   * The first `RET` or `HALT` the stack is not empty at, or nothing.
+   *
+   * Section 3.5 check 5 is three sentences and this is the third: the depth
+   * agrees on every path, it never goes below zero, and **it is zero at the
+   * terminator**. Only the first two were walked here, and the difference is
+   * not academic. A `RET` reaches nothing after it, so an expression that left
+   * the stack one short took it to minus one exactly at the `RET`, where
+   * nothing was ever asked; the walk finished clean and a body whose stack does
+   * not add up was emitted, for an engine to refuse at load with a code about
+   * the compiler. Every `RET` is checked rather than the last one, because an
+   * early `return` is a terminator too and owes the same debt.
+   */
+  readonly terminal: number | undefined;
+}
+
+/**
+ * The stack depth at every instruction, computed exactly as section 3.5 does.
+ *
+ * A forward pass is enough because every backward jump in a program this
+ * compiler emits targets a `TICK` at a loop header, and a loop body leaves the
+ * stack as it found it. The walk still records a disagreement rather than
+ * assuming one, so a bug in a pass shows up here and not in an engine.
+ */
+export function walkDepths(
+  code: readonly Instruction[],
+  argcOf: (site: number) => number,
+): Walk {
+  const depths: (number | undefined)[] = new Array<number | undefined>(code.length).fill(undefined);
+  let conflict: number | undefined;
+  let underflow: number | undefined;
+  let terminal: number | undefined;
+
+  const reach = (index: number, depth: number): void => {
+    if (index < 0 || index > code.length) return;
+    if (depth < 0 && underflow === undefined) underflow = index;
+    const known = depths[index];
+    if (known === undefined) depths[index] = depth;
+    else if (known !== depth && conflict === undefined) conflict = index;
+  };
+
+  reach(0, 0);
+  for (let i = 0; i < code.length; i += 1) {
+    const instruction = code[i];
+    const depth = depths[i];
+    if (instruction === undefined || depth === undefined) continue;
+    const opcode = instruction[0] as Opcode;
+    const operands = instruction.slice(1) as number[];
+    const after = depth + depthChange(opcode, operands, argcOf);
+
+    if (opcode === 'RET' || opcode === 'HALT') {
+      if (after !== 0 && terminal === undefined) terminal = i;
+      continue;
+    }
+    for (const position of targetPositions(opcode)) {
+      const target = operands[position];
+      if (target !== undefined) reach(target, after);
+    }
+    if (opcode !== 'JUMP') reach(i + 1, after);
+  }
+
+  return {
+    depths: depths.map((one) => one ?? 0),
+    conflict,
+    underflow,
+    terminal,
+  };
+}

package/src/core/emit/colours.ts

@@ -0,0 +1,75 @@
+/**
+ * The nineteen named colours, as channel values.
+ *
+ * **This table is standing in for something that does not exist yet, and it
+ * should move the moment it does.** `stdlib.md` 11.1 says the exact channel
+ * values of the named colours are fixed in the library manifest and are part of
+ * the conformance suite. There is no library manifest in this repository, so an
+ * emitter that has to write `["c", [r, g, b, a]]` into a plot's `color` field
+ * has nowhere to read them from.
+ *
+ * The alternative was to give every named colour a per-bar channel and let the
+ * engine's own manifest supply the value, which is a legal representation and
+ * is what `colorChannel` is for. It does not work: a level's colour, a table's
+ * `textColor` and a marker's `color` are declaration fields with no channel
+ * beside them, so there are three places in the format where a named colour has
+ * to be a value before bar 0 or it cannot be carried at all.
+ *
+ * The values are the long-standing web colour keywords of the same names, which
+ * is what `language.md` 3.8's list is drawn from. They are written here rather
+ * than guessed at three call sites, and `emit()` reports them as a gap so that
+ * nobody mistakes this file for the authority it is standing in for.
+ */
+import type { Colour } from './program.js';
+
+const OPAQUE = 1;
+
+const CHANNELS: Readonly<Record<string, readonly [number, number, number]>> = {
+  aqua: [0, 255, 255],
+  black: [0, 0, 0],
+  blue: [0, 0, 255],
+  brown: [165, 42, 42],
+  fuchsia: [255, 0, 255],
+  gray: [128, 128, 128],
+  green: [0, 128, 0],
+  lime: [0, 255, 0],
+  maroon: [128, 0, 0],
+  navy: [0, 0, 128],
+  olive: [128, 128, 0],
+  orange: [255, 165, 0],
+  pink: [255, 192, 203],
+  purple: [128, 0, 128],
+  red: [255, 0, 0],
+  silver: [192, 192, 192],
+  teal: [0, 128, 128],
+  white: [255, 255, 255],
+  yellow: [255, 255, 0],
+};
+
+export function isColourName(name: string): boolean {
+  return Object.prototype.hasOwnProperty.call(CHANNELS, name);
+}
+
+/** The colour a name denotes, at full opacity, or nothing if it is not one. */
+export function namedColour(name: string): Colour | undefined {
+  const channels = CHANNELS[name];
+  return channels === undefined
+    ? undefined
+    : [channels[0], channels[1], channels[2], OPAQUE];
+}
+
+/**
+ * A `#rrggbb` or `#rrggbbaa` literal, `language.md` 3.8.
+ *
+ * The alpha byte is divided by 255 here rather than left to an engine, because
+ * `compiled-program.md` 2.9 requires the pool to carry the divided number: two
+ * engines dividing separately is a place they can differ by one part in 255.
+ */
+export function hexColour(text: string): Colour | undefined {
+  const digits = text.startsWith('#') ? text.slice(1) : text;
+  if (digits.length !== 6 && digits.length !== 8) return undefined;
+  if (!/^[0-9a-fA-F]+$/.test(digits)) return undefined;
+  const byte = (at: number): number => Number.parseInt(digits.slice(at, at + 2), 16);
+  const alpha = digits.length === 8 ? byte(6) / 255 : OPAQUE;
+  return [byte(0), byte(2), byte(4), alpha];
+}

package/src/core/emit/context.ts

@@ -0,0 +1,461 @@
+/**
+ * The state one compile of one file shares, and the small answers every pass
+ * asks of it.
+ *
+ * The passes that emit code are ordinary functions taking this and a node, on
+ * the same arrangement the checker uses, so a reader can follow one expression
+ * from its syntax to its instructions without holding a class hierarchy in
+ * their head. Everything mutable is here and nowhere else.
+ */
+import type { Argument, Call, Expression, Name, NameReference } from '../ast/index.js';
+import { withoutGrouping } from '../ast/index.js';
+import type {
+  Binding,
+  CheckedCall,
+  CheckedInput,
+  CheckedScript,
+  LibraryEntry,
+} from '../check/index.js';
+import { inputHeldBy } from '../check/index.js';
+import type { RequestScope } from './request-scope.js';
+import type { DiagnosticSink } from '../diagnostics/index.js';
+import type { SourceFile } from '../source/index.js';
+import type { Span } from '../span/index.js';
+import { CodeBuilder } from './code.js';
+import { GapLog } from './gaps.js';
+import { FrameLayout, Layout } from './layout.js';
+import { ConstantPool } from './pool.js';
+import type {
+  Alert,
+  Band,
+  CompiledFunction,
+  CompiledInput,
+  Grid,
+  LibraryFunction,
+  Level,
+  Loop,
+  Marker,
+  Paint,
+  Plot,
+  Request,
+} from './program.js';
+import { fold } from './values.js';
+import type { FoldEnvironment, Value } from './values.js';
+
+/**
+ * The calls that declare part of the file's fixed shape and compile to no
+ * `CALL_LIB` at all.
+ *
+ * This is the split the format turns on. A `plot` call is an entry in
+ * `outputs.plots` plus one `EMIT` per bar; `input` is a row of the settings
+ * dialog and an engine writing a slot at step 5; `table` is a declared grid.
+ * None of them is a function an engine calls, so none of them belongs in
+ * `lib.functions`, whose only purpose is to be named by a `CALL_LIB` (2.5).
+ */
+/**
+ * The calls that declare part of the file rather than computing anything.
+ *
+ * None of them is a `CALL_LIB`, so none of them is in the engine's library
+ * manifest and none of them can be looked for there. The list is exported so a
+ * test that asks which names an engine has to implement can subtract these
+ * rather than carry a second copy of them.
+ */
+export const DECLARATION_CALLS: ReadonlySet<string> = new Set([
+  'plot',
+  'plotCandles',
+  'fill',
+  'level',
+  'table',
+  'input',
+  'signal',
+  'alert',
+  'barColor',
+  'background',
+]);
+
+export interface EmitOptions {
+  /** The library manifest version, tied to `openscript.language` (2.5). */
+  readonly manifest?: number;
+  /** The engine's declared state region count, for OS5004. */
+  readonly maxStates?: number;
+  /** The engine's instruction ceiling, for OS5009. */
+  readonly maxInstructions?: number;
+  /** Give every top-level name a register, which is `debug.retain` (2.10). */
+  readonly retain?: boolean;
+}
+
+/** One call site under construction; its bases are filled once totals are known. */
+export interface Site {
+  readonly index: number;
+  fn: number;
+  argc: number;
+  cellBase: number;
+  stateBase: number;
+  series: number[];
+  /** The body this site's `fn` entry was built from, for the base walk. */
+  frame: FrameLayout | undefined;
+  /** Sites reached from inside that body, so bases nest without overlapping. */
+  children: number[];
+}
+
+/** A loop being emitted, and where `break` and `continue` jump to. */
+export interface LoopFrame {
+  readonly id: number;
+  readonly breaks: number[];
+  readonly continues: number[];
+}
+
+/** The frame a pass is emitting into: the top level, or one function body. */
+export class Frame {
+  readonly layout = new FrameLayout();
+  readonly builder = new CodeBuilder();
+  readonly loops: LoopFrame[] = [];
+  /** Sites created while emitting this frame, in the order they were created. */
+  readonly sites: number[] = [];
+  /** A parameter's position, for `HISTP`, by the binding that declared it. */
+  readonly parameters = new Map<number, number>();
+  readonly topLevel: boolean;
+
+  constructor(topLevel: boolean) {
+    this.topLevel = topLevel;
+  }
+}
+
+export class Emitter {
+  readonly pool: ConstantPool;
+  readonly layout = new Layout();
+  readonly gaps: GapLog;
+  readonly libraryFunctions: LibraryFunction[];
+  /** The signature behind each entry, which is what `requires` is derived from. */
+  readonly calledEntries: LibraryEntry[];
+  readonly sites: Site[] = [];
+  readonly functions: CompiledFunction[] = [];
+  readonly functionPos: (readonly [number, readonly (readonly [number, number, number])[]])[] = [];
+  readonly loops: Loop[] = [];
+  /** A frame per emitted function entry, for the cell and state base walk. */
+  readonly functionFrames: FrameLayout[] = [];
+  /**
+   * File-scope names given a register although nothing reads their history.
+   *
+   * A slot belongs to one frame, so a name a function body reads has to live
+   * somewhere every frame can address; `registers.ts` is where that is decided.
+   */
+  readonly promoted = new Set<number>();
+  /** Cells and input slots carrying a register beside them, kept in step per bar. */
+  readonly shadowed = new Set<number>();
+  /**
+   * Cells a function body reads, whose register is kept in step within the bar.
+   *
+   * A cell operand is relative to its own frame (2.11, 3.3), so a body has no
+   * instruction that reaches a file-scope `var`. A register is addressed the
+   * same way from every frame, so the value goes in one beside the cell: read
+   * from the cell at the start of the bar, written again at every assignment,
+   * so a body called at any point in the bar reads what the cell holds then.
+   */
+  readonly carried = new Set<number>();
+  /** Bodies being emitted, so a call graph with a cycle in it stops (11.4). */
+  readonly emitting = new Set<number>();
+
+  /**
+   * The file's fixed shape, filled in source order as the declarations are met.
+   *
+   * Source order is declaration order is legend order, so nothing sorts these
+   * afterwards: the script already decided, and a second decision here would be
+   * a second answer (2.8).
+   */
+  readonly plots: Plot[] = [];
+  readonly fills: Band[] = [];
+  readonly levels: Level[] = [];
+  readonly markers: Marker[] = [];
+  readonly tables: Grid[] = [];
+  readonly alerts: Alert[] = [];
+  readonly inputs: CompiledInput[] = [];
+  barColor: Paint | null = null;
+  background: Paint | null = null;
+  /** The plot key a declaration handle holds, so `fill` can name two of them. */
+  readonly handleKeys = new Map<number, string>();
+  /** Names holding a declaration handle, which lives where the declaration put it. */
+  readonly handles = new Set<number>();
+  /** The reads of 2.16, and the request a name holding one came from. */
+  readonly requests: Request[] = [];
+  readonly requestOf = new Map<number, number>();
+  /** The register one read's value lands in, so one call asks one question. */
+  readonly requestSeries = new Map<number, number>();
+  /**
+   * The read whose expression is being emitted, when this emitter is one.
+   *
+   * An expression inside a read is compiled over other bars, so it gets an
+   * emitter of its own rather than a flag on a frame: its registers, its cells
+   * and its state regions are counted from zero on the requested bars, and a
+   * pass that read the parent's would emit a program that computes this
+   * chart's numbers under another chart's name.
+   */
+  readonly request: RequestScope | undefined;
+
+  private readonly libraryIndex: Map<string, number>;
+  /** A leaf body, which calls no user function, is shared by every call site. */
+  private readonly sharedBodies = new Map<number, number>();
+
+  readonly file: SourceFile;
+  readonly checked: CheckedScript;
+  readonly sink: DiagnosticSink;
+  readonly options: EmitOptions;
+
+  constructor(
+    file: SourceFile,
+    checked: CheckedScript,
+    sink: DiagnosticSink,
+    options: EmitOptions,
+    parent?: Emitter,
+    request?: RequestScope,
+  ) {
+    this.file = file;
+    this.checked = checked;
+    this.sink = sink;
+    this.options = options;
+    // A read's body shares the constant pool and the library manifest, because
+    // neither holds anything that depends on a bar, and one of each is one
+    // table for an engine to verify rather than one per read (2.16).
+    this.pool = parent?.pool ?? new ConstantPool();
+    this.gaps = parent?.gaps ?? new GapLog();
+    this.libraryFunctions = parent?.libraryFunctions ?? [];
+    this.calledEntries = parent?.calledEntries ?? [];
+    this.libraryIndex = parent?.libraryIndex ?? new Map<string, number>();
+    this.request = request;
+  }
+
+  /** An emitter for one read's expression, sharing what does not depend on a bar. */
+  forRequest(request: RequestScope): Emitter {
+    return new Emitter(this.file, this.checked, this.sink, this.options, this, request);
+  }
+
+  /** The checker's answer for one call, which the emitter never re-derives. */
+  callAt(call: Call): CheckedCall | undefined {
+    return this.checked.callSites.get(call);
+  }
+
+  /** The declaration a name means, from the checker's own resolution. */
+  bindingAt(reference: NameReference): Binding | undefined {
+    return this.checked.references.get(reference);
+  }
+
+  /** The input one `input()` call declares, from the checker's own table. */
+  inputAt(call: Call): CheckedInput | undefined {
+    return this.checked.inputs.find((one) => one.call === call);
+  }
+
+  /** Whether a call is a declaration rather than something an engine calls. */
+  isDeclaration(name: string): boolean {
+    return DECLARATION_CALLS.has(name);
+  }
+
+  /**
+   * The index of a library function in `lib.functions`, adding it on first use.
+   *
+   * `state` and `effect` are recorded beside the name because 2.5 requires them
+   * and because they are facts an engine already knows: they are there to be
+   * disagreed with at load, which is how a program compiled against a newer
+   * library is caught before it computes a wrong number.
+   */
+  libraryFunction(entry: LibraryEntry): number {
+    // Keyed by name and arity, because a name may carry two signatures: `clear`
+    // empties an array or a grid and the two are separate entries (stdlib 2.2).
+    const key = `${entry.name}/${entry.parameters.length}`;
+    const found = this.libraryIndex.get(key);
+    if (found !== undefined) return found;
+    const index = this.libraryFunctions.length;
+    this.libraryFunctions.push({
+      name: entry.name,
+      arity: arityOf(entry),
+      state: entry.stateful,
+      effect: effectOf(entry),
+    });
+    this.calledEntries.push(entry);
+    this.libraryIndex.set(key, index);
+    return index;
+  }
+
+  newSite(fn: number, argc: number): Site {
+    const site: Site = {
+      index: this.sites.length,
+      fn,
+      argc,
+      cellBase: 0,
+      stateBase: 0,
+      series: [],
+      frame: undefined,
+      children: [],
+    };
+    this.sites.push(site);
+    return site;
+  }
+
+  newLoop(kind: Loop['kind'], span: Span): number {
+    const id = this.loops.length;
+    this.loops.push({ id, kind, line: span.line, col: span.column });
+    return id;
+  }
+
+  /** A body that calls no user function is one entry however many sites reach it. */
+  shareableBody(checkedFunction: number): number | undefined {
+    return this.sharedBodies.get(checkedFunction);
+  }
+
+  rememberShareableBody(checkedFunction: number, emitted: number): void {
+    this.sharedBodies.set(checkedFunction, emitted);
+  }
+
+  gap(what: string, specification: string, span: Span | undefined, blocking: boolean): void {
+    this.gaps.add({ what, specification, span, blocking });
+  }
+
+  /**
+   * The value an expression has before bar 0, or nothing when it has none.
+   *
+   * The environment is built here because folding needs two answers only the
+   * checker has: which declaration a name means, and which signature a call
+   * resolved to with its arguments already in parameter order.
+   */
+  fold(expression: Expression): Value | undefined {
+    return fold(expression, this.foldEnvironment());
+  }
+
+  private foldEnvironment(): FoldEnvironment {
+    return {
+      name: (reference: NameReference): Value | undefined => {
+        const binding = this.bindingAt(reference);
+        if (binding === undefined) return undefined;
+        const held = inputHeldBy(binding);
+        if (held === undefined) return undefined;
+        const input = this.checked.inputs[held];
+        return input === undefined ? undefined : { kind: 'input', key: inputKey(input) };
+      },
+      call: (call: Call) => {
+        const checked = this.callAt(call);
+        if (checked === undefined || checked.target !== 'library') return undefined;
+        return { name: checked.name, args: checked.arguments };
+      },
+      input: (call: Call): Value | undefined => {
+        const input = this.inputAt(call);
+        return input === undefined ? undefined : { kind: 'input', key: inputKey(input) };
+      },
+    };
+  }
+}
+
+/**
+ * The key one input is known by: `inputs[].key`, and what a `{ "input": key }`
+ * field names (2.3 and 2.6).
+ *
+ * Here rather than beside the table it keys, because three places name an
+ * input by key and a second spelling of this would be a field that points at
+ * no row.
+ *
+ * **Never the input's position.** `host-interface.md` 8.1 promises a key
+ * "survives every edit that does not rename it", and a positional key keeps
+ * that promise for no edit at all: inserting one tunable above another moves
+ * every key below it, and a value a user stored against the third row lands on
+ * the fourth, silently, because both are numbers and 8.3 has nothing to refuse.
+ * An input written where a value belongs is assigned to no name, so its key is
+ * its title, which is what the user sees and what changing is the rename 8.1
+ * allows to lose a value. The two cannot collide: two inputs sharing a title
+ * are OS3017, a title spelling another input's name is OS3022, and a title
+ * that is not there at all is OS3021, so a key of `""` here is a program the
+ * checker has already refused.
+ */
+export function inputKey(input: CheckedInput): string {
+  return input.name === '' ? input.title : input.name;
+}
+
+/**
+ * Which of the five effects a library call carries, `compiled-program.md` 2.5
+ * and 5.4.
+ *
+ * The rule an entry is read by rather than a list of names, because a list in a
+ * second place is a list that drifts. A call with an effect does not perform it
+ * when it executes: it appends a record and **pushes absent as its result**. So
+ * a call whose result a script uses cannot carry one, and that single sentence
+ * settles every case in version 1.
+ *
+ * `order` is every call that spends money: `strategyOnly`, written with
+ * brackets, and returning nothing. A `pos.*` reading is not one, because it is
+ * read bare; `order.qtyForRisk` is not one, because it returns a number the
+ * script goes on to size an order with.
+ *
+ * `log` is `print`, which reaches a log outside the machine.
+ *
+ * `draw` and `signal` are not reachable in version 1 and the emitter says so
+ * rather than guessing. A drawing object lives in the object heap, which rolls
+ * back with everything else (6.1), so a drawing needs no deferral to be
+ * idempotent on a moving bar; a table cell is written to a per-bar output
+ * buffer that is committed with the columns (2.8); and a marker and an alert
+ * reach the host through a channel declared `defer`, not through a call.
+ */
+export function effectOf(entry: LibraryEntry): LibraryFunction['effect'] {
+  if (entry.name === 'print') return 'log';
+  if (entry.strategyOnly && entry.callable && entry.returns.kind === 'nothing') return 'order';
+  return 'none';
+}
+
+/**
+ * The arguments a `CALL_LIB` pushes for one entry, which is its `arity` (2.5).
+ *
+ * The same for every entry but the order functions, which carry one argument
+ * more than the language surface shows: the names of the arguments the script
+ * wrote. `calls.ts` says why an order call needs it and no other call does.
+ *
+ * Stated here rather than at the two places that need it, because the count the
+ * program records and the count the instruction pushes disagreeing is a program
+ * no engine will load.
+ */
+export function arityOf(entry: LibraryEntry): number {
+  return entry.parameters.length + (effectOf(entry) === 'order' ? 1 : 0);
+}
+
+/** The argument written for one parameter of a resolved call, or nothing. */
+export function argumentAt(
+  checked: CheckedCall,
+  entry: LibraryEntry,
+  name: string,
+): Argument | undefined {
+  const index = entry.parameters.findIndex((one) => one.name === name);
+  return index < 0 ? undefined : checked.arguments[index];
+}
+
+/**
+ * Every top-level name and the expression it is given, in source order.
+ *
+ * Two passes need it before any instruction is emitted: one to find the names
+ * that hold a declaration handle, and one to find the names that hold a read.
+ * Both have to answer about a name written below the line that asks, so both
+ * run over the file rather than over what has been emitted so far.
+ */
+export function declaredNames(e: Emitter): readonly DeclaredName[] {
+  const found: DeclaredName[] = [];
+  for (const item of e.checked.script.items) {
+    if (item.kind === 'assignment') {
+      found.push({ name: item.target, value: item.value, persistent: false });
+    } else if (item.kind === 'varDeclaration') {
+      found.push({ name: item.name, value: item.initialiser, persistent: true });
+    }
+  }
+  return found;
+}
+
+/** One of those names, and whether `var` was written in front of it. */
+export interface DeclaredName {
+  readonly name: Name;
+  readonly value: Expression;
+  readonly persistent: boolean;
+}
+
+/** The dotted name a callee spells, for a call the checker did not resolve. */
+export function calleeText(expression: Expression): string {
+  const inner = withoutGrouping(expression);
+  if (inner.kind === 'nameReference') return inner.name;
+  if (inner.kind === 'member') {
+    const object = withoutGrouping(inner.object);
+    if (object.kind === 'nameReference') return `${object.name}.${inner.member.text}`;
+  }
+  return '';
+}