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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 3x 3x 3x 3x 3x 1x 1x 3x 3x 3x 1x 1x 3x 3x 3x 1x 1x 2x 1x | import * as Expressions from "../../2_statements/expressions";
import {StatementNode} from "../../nodes";
import {CurrentScope} from "../_current_scope";
import {Source} from "../expressions/source";
import {Target} from "../expressions/target";
import {FieldChain} from "../expressions/field_chain";
import {ReferenceType} from "../_reference";
import {StatementSyntax} from "../_statement_syntax";
export class CallFunction implements StatementSyntax {
public runSyntax(node: StatementNode, scope: CurrentScope, filename: string): void {
// todo, lots of work here, similar to receive.ts
const name = node.findFirstExpression(Expressions.FunctionName);
const chain = name?.findFirstExpression(Expressions.FieldChain);
if (chain) {
new FieldChain().runSyntax(chain, scope, filename, ReferenceType.DataReadReference);
}
// just recurse
for (const s of node.findAllExpressions(Expressions.Source)) {
new Source().runSyntax(s, scope, filename);
}
for (const s of node.findAllExpressions(Expressions.SimpleSource3)) {
new Source().runSyntax(s, scope, filename);
}
for (const t of node.findAllExpressions(Expressions.Target)) {
new Target().runSyntax(t, scope, filename);
}
for (const s of node.findDirectExpressions(Expressions.SimpleSource2)) {
new Source().runSyntax(s, scope, filename);
}
}
} |