Will Hawkins
827 lines
30 KiB
Swift
827 lines
30 KiB
Swift
// p4rse, Copyright 2026, Will Hawkins
|
|
//
|
|
// This file is part of p4rse.
|
|
//
|
|
// This file is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
import Common
|
|
import P4Lang
|
|
import P4Runtime
|
|
import SwiftTreeSitter
|
|
import TreeSitterP4
|
|
|
|
protocol CompilableExpression {
|
|
static func compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?>
|
|
}
|
|
|
|
protocol CompilableLValueExpression {
|
|
static func compile_as_lvalue(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableLValueExpression?>
|
|
}
|
|
|
|
extension TypedIdentifier: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
|
|
let node = node.child(at: 0)!
|
|
#SkipUnlessNodeType<SwiftTreeSitter.Node>(
|
|
node: node, type: "identifier")
|
|
|
|
guard
|
|
case Result.Ok(let type) = context.instances.lookup(
|
|
identifier: Common.Identifier(name: node.text!))
|
|
else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Cannot find \(node.text!) in scope"))
|
|
}
|
|
|
|
return .Ok(TypedIdentifier(name: node.text!, withType: type))
|
|
}
|
|
}
|
|
|
|
extension TypedIdentifier: CompilableLValueExpression {
|
|
static func compile_as_lvalue(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableLValueExpression?> {
|
|
|
|
let expression = node.child(at: 0)!
|
|
#SkipUnlessNodeType<SwiftTreeSitter.Node>(
|
|
node: expression, type: "identifier")
|
|
|
|
let maybe_parsed_expression = TypedIdentifier.compile(node: node, withContext: context)
|
|
guard case .Ok(let maybe_typed_identifier) = maybe_parsed_expression else {
|
|
return .Error(maybe_parsed_expression.error()!)
|
|
}
|
|
|
|
let typed_identifier_expression = maybe_typed_identifier as! TypedIdentifier
|
|
|
|
return Result.Ok(typed_identifier_expression)
|
|
}
|
|
}
|
|
|
|
extension P4BooleanValue: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
let node = node.child(at: 0)!
|
|
#SkipUnlessNodeType<SwiftTreeSitter.Node>(
|
|
node: node, type: "booleanLiteralExpression")
|
|
|
|
if node.text == "false" {
|
|
return .Ok(P4Value(P4BooleanValue(withValue: false)))
|
|
} else if node.text == "true" {
|
|
return .Ok(P4Value(P4BooleanValue(withValue: true)))
|
|
}
|
|
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Failed to parse boolean literal: \(node.text!)"))
|
|
}
|
|
}
|
|
|
|
extension P4IntValue: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
let node = node.child(at: 0)!
|
|
|
|
#SkipUnlessNodesTypes<SwiftTreeSitter.Node>(
|
|
node: node, types: ["integer", "integer_elaborated"])
|
|
|
|
var bit_width: BitWidth = BitWidth.Infinite
|
|
let value_source: String
|
|
if node.nodeType == "integer_elaborated" {
|
|
let re = /([0-9]+)([ws])([\-0-9]+)/
|
|
let integer_components = node.text!.matches(of: re)
|
|
|
|
if integer_components.isEmpty || integer_components.count > 1 {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Failed to parse elaborated integer: \(node.text!)"))
|
|
}
|
|
|
|
let width_source = "\(integer_components[0].1)"
|
|
guard let width = Int(width_source) else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Failed to parse width from elaborated integer: \(width_source)"))
|
|
}
|
|
|
|
/// TODO: Handle signed vs. unsigned.
|
|
|
|
bit_width = BitWidth.Width(width)
|
|
value_source = "\(integer_components[0].3)"
|
|
} else {
|
|
value_source = node.text!
|
|
}
|
|
|
|
if let parsed_int = Int(value_source) {
|
|
return .Ok(P4Value(P4IntValue(withValue: parsed_int, andWidth: bit_width)))
|
|
} else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Failed to parse integer: \(node.text!)"))
|
|
}
|
|
}
|
|
}
|
|
|
|
extension P4StringValue: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext scopes: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
let node = node.child(at: 0)!
|
|
#SkipUnlessNodeType<SwiftTreeSitter.Node>(
|
|
node: node, type: "string_literal")
|
|
return .Ok(P4Value(P4StringValue(withValue: node.text!)))
|
|
}
|
|
}
|
|
|
|
extension KeysetExpression: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Common.Result<(any Common.EvaluatableExpression)?> {
|
|
let keyset_expression_node = node.child(at: 0)!
|
|
|
|
#RequireNodesType<Node, EvaluatableExpression>(
|
|
nodes: keyset_expression_node, type: ["expression", "default_keyset"],
|
|
nice_type_names: ["expression", "default keyset"])
|
|
|
|
// If there is a default keyset, that's easy!
|
|
if keyset_expression_node.nodeType == "default_keyset" {
|
|
return .Ok(KeysetExpression(P4Value(P4SetDefaultValue(withType: context.expected_type!))))
|
|
}
|
|
|
|
// Compile the expression:
|
|
let maybe_compiled_set_expression = Expression.Compile(
|
|
node: keyset_expression_node, withContext: context)
|
|
guard case .Ok(let compiled_expression) = maybe_compiled_set_expression else {
|
|
return .Error(maybe_compiled_set_expression.error()!)
|
|
}
|
|
|
|
return .Ok(KeysetExpression(compiled_expression))
|
|
}
|
|
}
|
|
|
|
struct Expression {
|
|
public static func Compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression> {
|
|
#RequireNodeType<Node, EvaluatableExpression>(
|
|
node: node, type: "expression", nice_type_name: "expression")
|
|
|
|
let expression_node = node.child(at: 0)!
|
|
#RequireNodesType<Node, EvaluatableExpression>(
|
|
nodes: expression_node, type: ["grouped_expression", "simple_expression"],
|
|
nice_type_names: ["grouped expression", "simple expression"])
|
|
|
|
// If this is a grouped expression, recurse!
|
|
if expression_node.nodeType == "grouped_expression" {
|
|
return Expression.Compile(node: expression_node.child(at: 1)!, withContext: context)
|
|
}
|
|
|
|
let expression_parsers: [CompilableExpression.Type] = [
|
|
P4BooleanValue.self, P4StringValue.self, P4IntValue.self, TypedIdentifier.self,
|
|
BinaryOperatorExpression.self, ArrayAccessExpression.self, FieldAccessExpression.self,
|
|
FunctionCall.self,
|
|
]
|
|
|
|
for candidate_expression_parser in expression_parsers {
|
|
switch candidate_expression_parser.compile(
|
|
node: expression_node, withContext: context)
|
|
{
|
|
case .Ok(.some(let parsed)): return .Ok(parsed)
|
|
case .Error(let e): return .Error(e)
|
|
default: continue
|
|
}
|
|
}
|
|
|
|
return Result.Error(Error(withMessage: "\(node.range): Could not parse into expression"))
|
|
}
|
|
}
|
|
|
|
struct LValue {
|
|
public static func Compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableLValueExpression> {
|
|
#RequireNodeType<Node, EvaluatableExpression>(
|
|
node: node, type: "expression", nice_type_name: "expression")
|
|
|
|
let expression_node = node.child(at: 0)!
|
|
#RequireNodesType<Node, EvaluatableExpression>(
|
|
nodes: expression_node, type: ["grouped_expression", "simple_expression"],
|
|
nice_type_names: ["grouped expression", "simple expression"])
|
|
|
|
// If this is a grouped expression, recurse!
|
|
if expression_node.nodeType == "grouped_expression" {
|
|
return LValue.Compile(node: expression_node.child(at: 1)!, withContext: context)
|
|
}
|
|
|
|
let lvalue_parsers: [CompilableLValueExpression.Type] = [
|
|
TypedIdentifier.self, FieldAccessExpression.self, ArrayAccessExpression.self,
|
|
]
|
|
|
|
for candidate_lvalue_parser in lvalue_parsers {
|
|
switch candidate_lvalue_parser.compile_as_lvalue(
|
|
node: expression_node, withContext: context)
|
|
{
|
|
case .Ok(.some(let parsed)): return .Ok(parsed)
|
|
case .Error(let e): return .Error(e)
|
|
default: continue
|
|
}
|
|
}
|
|
|
|
return Result.Error(Error(withMessage: "\(node.range): Could not parse into expression"))
|
|
}
|
|
}
|
|
|
|
struct Identifier {
|
|
public static func Compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<Common.Identifier> {
|
|
return if let node_text_value = node.text {
|
|
.Ok(Common.Identifier(name: node_text_value))
|
|
} else {
|
|
.Error(Error(withMessage: "Could not parse an identifier from \(node)"))
|
|
}
|
|
}
|
|
}
|
|
|
|
extension SelectExpression: CompilableExpression {
|
|
static func compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
#RequireNodeType<Node, (SelectExpression, CompilerContext)>(
|
|
node: node, type: "selectExpression", nice_type_name: "parser select expression")
|
|
|
|
guard let selector_node = node.child(at: 2),
|
|
selector_node.nodeType == "expression"
|
|
else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Could not find selector expression"))
|
|
}
|
|
|
|
guard let select_body_node = node.child(at: 5),
|
|
select_body_node.nodeType == "selectBody"
|
|
else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Could not find select expression body"))
|
|
}
|
|
|
|
let maybe_selector = Expression.Compile(node: selector_node, withContext: context)
|
|
guard case .Ok(let selector) = maybe_selector else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: selector_node.toSourceLocation(),
|
|
withError:
|
|
"Could not parse transition select expression selector expression: \(maybe_selector.error()!)"
|
|
))
|
|
}
|
|
|
|
var sces: [SelectCaseExpression] = Array()
|
|
var sces_errors: (any Errorable)? = .none
|
|
|
|
select_body_node.enumerateNamedChildren { current_node in
|
|
let maybe_parsed_cse = SelectCaseExpression.compile(
|
|
node: current_node, withContext: context.update(newExpectation: selector.type()))
|
|
switch maybe_parsed_cse {
|
|
case .Ok(let parsed_cse): sces.append(parsed_cse as! SelectCaseExpression)
|
|
case .Error(let e):
|
|
sces_errors =
|
|
if let sces_errors = sces_errors {
|
|
sces_errors.append(error: Error(withMessage: "\(maybe_parsed_cse.error()!)"))
|
|
} else {
|
|
e
|
|
}
|
|
}
|
|
}
|
|
|
|
if let sces_errors = sces_errors {
|
|
return .Error(ErrorWithLabel("Error(s) parsing select cases", sces_errors))
|
|
}
|
|
|
|
return .Ok(
|
|
SelectExpression(withSelector: selector, withSelectCaseExpressions: sces),
|
|
)
|
|
}
|
|
}
|
|
|
|
extension SelectCaseExpression: CompilableExpression {
|
|
static func compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
if node.nodeType != "selectCase" {
|
|
return Result.Error(Error(withMessage: "Expected select case not found"))
|
|
}
|
|
|
|
guard let keysetexpression_node = node.child(at: 0),
|
|
keysetexpression_node.nodeType == "keysetExpression"
|
|
else {
|
|
return Result.Error(Error(withMessage: "Missing keyset expression in select case"))
|
|
}
|
|
|
|
guard let targetstate_node = node.child(at: 2),
|
|
targetstate_node.nodeType == "identifier"
|
|
else {
|
|
return Result.Error(Error(withMessage: "Missing target state in select case"))
|
|
}
|
|
|
|
let maybe_parsed_keysetexpression = KeysetExpression.compile(
|
|
node: keysetexpression_node, withContext: context)
|
|
guard case Result.Ok(let maybe_keysetexpression) = maybe_parsed_keysetexpression else {
|
|
return Result.Error(maybe_parsed_keysetexpression.error()!)
|
|
}
|
|
|
|
guard let maybe_keysetexpression = maybe_keysetexpression else {
|
|
return Result.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: keysetexpression_node.toSourceLocation(),
|
|
withError: "Missing expected keyset expression"))
|
|
}
|
|
|
|
let keysetexpression = maybe_keysetexpression as! KeysetExpression
|
|
|
|
if case .Error(let e) = keysetexpression.compatible(type: context.expected_type!) {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: keysetexpression_node.toSourceLocation(), withError: e.msg()))
|
|
}
|
|
|
|
let maybe_parsed_targetstate = Identifier.Compile(
|
|
node: targetstate_node, withContext: context)
|
|
guard case .Ok(let targetstate) = maybe_parsed_targetstate else {
|
|
return Result.Error(maybe_parsed_targetstate.error()!)
|
|
}
|
|
|
|
return .Ok(
|
|
SelectCaseExpression(
|
|
withKey: keysetexpression, withNextState: targetstate)
|
|
)
|
|
}
|
|
}
|
|
|
|
extension BinaryOperatorExpression: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<(EvaluatableExpression)?> {
|
|
let expression = node.child(at: 0)!
|
|
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "binaryOperatorExpression")
|
|
|
|
let binary_operator_expression_node = expression.child(at: 0)!
|
|
var walker = Walker(node: binary_operator_expression_node)
|
|
|
|
var current_node: Node? = .none
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Malformed binary operator expression"
|
|
)))
|
|
|
|
/// TODO: This macro cannot handle new lines in the arrays
|
|
// swift-format-ignore
|
|
#RequireNodesType<Node, EvaluatableExpression?>(
|
|
nodes: binary_operator_expression_node,
|
|
type: ["binaryEqualOperatorExpression", "binaryLessThanOperatorExpression", "binaryLessThanEqualOperatorExpression", "binaryGreaterThanOperatorExpression", "binaryGreaterThanEqualOperatorExpression", "binaryAndOperatorExpression", "binaryOrOperatorExpression", "binaryAddOperatorExpression", "binarySubtractOperatorExpression", "binaryMultiplyOperatorExpression", "binaryDivideOperatorExpression"],
|
|
nice_type_names: [ "binary equal operator", "binary less than operator", "binary less than or equal to operator", "binary greater than operator", "binary greater than or equal to operator", "binary and operator", "binary or operator", "binary add operator", "binary subtract operator", "binary multiply operator", "binary divide operator"])
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing LHS for binary operator expression")))
|
|
|
|
let left_hand_side_raw = current_node!
|
|
|
|
walker.next()
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing binary operator for binary operator expression")))
|
|
|
|
walker.next()
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing RHS for binary operator expression")))
|
|
|
|
let right_hand_side_raw = current_node!
|
|
|
|
let maybe_left_hand_side = Expression.Compile(node: left_hand_side_raw, withContext: context)
|
|
guard case Result.Ok(let left_hand_side) = maybe_left_hand_side else {
|
|
return Result.Error(maybe_left_hand_side.error()!)
|
|
}
|
|
|
|
let maybe_right_hand_side = Expression.Compile(node: right_hand_side_raw, withContext: context)
|
|
guard case Result.Ok(let right_hand_side) = maybe_right_hand_side else {
|
|
return Result.Error(maybe_right_hand_side.error()!)
|
|
}
|
|
|
|
let evaluators:
|
|
[String: (String, P4QualifiedType, BinaryOperatorChecker?, BinaryOperatorEvaluator)] = [
|
|
"binaryEqualOperatorExpression": (
|
|
"Binary Equal", P4QualifiedType(P4Boolean()), Optional<BinaryOperatorChecker>.none,
|
|
binary_equal_operator_evaluator
|
|
),
|
|
"binaryLessThanOperatorExpression": (
|
|
"Binary Less Than", P4QualifiedType(P4Boolean()), Optional<BinaryOperatorChecker>.none,
|
|
binary_lt_operator_evaluator
|
|
),
|
|
"binaryLessThanEqualOperatorExpression": (
|
|
"Binary Less Than Or Equal", P4QualifiedType(P4Boolean()),
|
|
Optional<BinaryOperatorChecker>.none,
|
|
binary_lte_operator_evaluator
|
|
),
|
|
"binaryGreaterThanOperatorExpression": (
|
|
"Binary Greater Than", P4QualifiedType(P4Boolean()), Optional<BinaryOperatorChecker>.none,
|
|
binary_gt_operator_evaluator
|
|
),
|
|
"binaryGreaterThanEqualOperatorExpression": (
|
|
"Binary Greater Than Or Equal", P4QualifiedType(P4Boolean()),
|
|
Optional<BinaryOperatorChecker>.none,
|
|
binary_gte_operator_evaluator
|
|
),
|
|
"binaryAndOperatorExpression": (
|
|
"Binary Or", P4QualifiedType(P4Boolean()), binary_and_or_operator_checker,
|
|
binary_and_operator_evaluator
|
|
),
|
|
"binaryOrOperatorExpression": (
|
|
"Binary And", P4QualifiedType(P4Boolean()), binary_and_or_operator_checker,
|
|
binary_or_operator_evaluator
|
|
),
|
|
"binaryAddOperatorExpression": (
|
|
"Binary Add", P4QualifiedType(P4Int()), binary_int_math_operator_checker,
|
|
binary_add_operator_evaluator
|
|
),
|
|
"binarySubtractOperatorExpression": (
|
|
"Binary Subtract", P4QualifiedType(P4Int()), binary_int_math_operator_checker,
|
|
binary_subtract_operator_evaluator
|
|
),
|
|
"binaryMultiplyOperatorExpression": (
|
|
"Binary Multiply", P4QualifiedType(P4Int()), binary_int_math_operator_checker,
|
|
binary_multiply_operator_evaluator
|
|
),
|
|
"binaryDivideOperatorExpression": (
|
|
"Binary Divide", P4QualifiedType(P4Int()), binary_int_math_operator_checker,
|
|
binary_divide_operator_evaluator
|
|
),
|
|
]
|
|
|
|
if !left_hand_side.type().eq(right_hand_side.type()) {
|
|
return Result.Error(
|
|
Error(withMessage: "Types of values used with binary expression are not the same"))
|
|
}
|
|
|
|
guard let selected_evaluator = evaluators[binary_operator_expression_node.nodeType!] else {
|
|
return Result.Error(
|
|
Error(withMessage: "No evaluator for \(binary_operator_expression_node.nodeType!)"))
|
|
}
|
|
|
|
if let checker = selected_evaluator.2,
|
|
case .Error(let e) = checker(left_hand_side, right_hand_side)
|
|
{
|
|
return Result.Error(e)
|
|
}
|
|
|
|
return .Ok(
|
|
BinaryOperatorExpression(
|
|
withEvaluator: (selected_evaluator.0, selected_evaluator.1, selected_evaluator.3),
|
|
withLhs: left_hand_side, withRhs: right_hand_side))
|
|
}
|
|
}
|
|
|
|
extension ArrayAccessExpression: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Common.Result<EvaluatableExpression?> {
|
|
let expression = node.child(at: 0)!
|
|
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "arrayAccessExpression")
|
|
|
|
let array_access_expression_node = expression
|
|
|
|
var walker = Walker(node: array_access_expression_node)
|
|
var current_node: Node? = .none
|
|
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Malformed array access expression")))
|
|
|
|
#RequireNodeType<Node, EvaluatableExpression?>(
|
|
node: current_node!, type: "expression",
|
|
nice_type_name: "array identifier expression")
|
|
let array_access_identifier_node = current_node!
|
|
|
|
walker.next()
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing [ for array access expression")))
|
|
|
|
walker.next()
|
|
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing indexor expression for array access expression")))
|
|
|
|
#RequireNodeType<Node, EvaluatableExpression?>(
|
|
node: current_node!, type: "expression",
|
|
nice_type_name: "array indexor expression")
|
|
|
|
let array_access_indexor_node = current_node!
|
|
|
|
let maybe_array_identifier = Expression.Compile(
|
|
node: array_access_identifier_node, withContext: context)
|
|
guard case Result.Ok(let array_identifier) = maybe_array_identifier else {
|
|
return Result.Error(maybe_array_identifier.error()!)
|
|
}
|
|
|
|
let maybe_array_type = array_identifier.type()
|
|
guard let array_type = maybe_array_type.baseType() as? P4Array else {
|
|
return Result.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: array_access_identifier_node.toSourceLocation(),
|
|
withError: "\(array_identifier) does not name an array type")
|
|
)
|
|
}
|
|
|
|
let maybe_array_indexor = Expression.Compile(
|
|
node: array_access_indexor_node, withContext: context)
|
|
guard case Result.Ok(let array_indexor) = maybe_array_indexor else {
|
|
return Result.Error(maybe_array_indexor.error()!)
|
|
}
|
|
|
|
return .Ok(
|
|
ArrayAccessExpression(
|
|
withName: array_identifier, withType: array_type, withIndexor: array_indexor))
|
|
}
|
|
}
|
|
|
|
extension FieldAccessExpression: CompilableExpression {
|
|
static func compile(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Common.Result<(any Common.EvaluatableExpression)?> {
|
|
let expression = node.child(at: 0)!
|
|
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "fieldAccessExpression")
|
|
|
|
let field_access_expression_node = expression
|
|
|
|
var walker = Walker(node: field_access_expression_node)
|
|
var current_node: Node? = .none
|
|
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Malformed field access expression")))
|
|
|
|
#RequireNodeType<Node, EvaluatableExpression?>(
|
|
node: current_node!, type: "expression",
|
|
nice_type_name: "struct identifier expression")
|
|
let struct_identifier_node = current_node!
|
|
|
|
walker.next()
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing . for field access expression")))
|
|
|
|
walker.next()
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Missing field name for field access expression")))
|
|
|
|
#RequireNodeType<Node, EvaluatableExpression?>(
|
|
node: current_node!, type: "identifier",
|
|
nice_type_name: "field name")
|
|
|
|
let field_name_node = current_node!
|
|
|
|
// Make sure that the identifier really identifies a struct.
|
|
let maybe_struct_identifier = Expression.Compile(
|
|
node: struct_identifier_node, withContext: context)
|
|
guard case Result.Ok(let struct_identifier) = maybe_struct_identifier else {
|
|
return Result.Error(maybe_struct_identifier.error()!)
|
|
}
|
|
guard let struct_type = struct_identifier.type().baseType() as? P4Struct else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: struct_identifier_node.toSourceLocation(),
|
|
withError: "\(struct_identifier_node.text!) does not have struct type"))
|
|
}
|
|
|
|
let maybe_field_name = Identifier.Compile(
|
|
node: field_name_node, withContext: context)
|
|
guard case Result.Ok(let field_name) = maybe_field_name else {
|
|
return Result.Error(maybe_field_name.error()!)
|
|
}
|
|
|
|
// Make sure that the field is valid for the struct type.
|
|
let maybe_field_type = struct_type.fields.get_field_type(field_name)
|
|
guard let field_type = maybe_field_type else {
|
|
return .Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: field_name_node.toSourceLocation(),
|
|
withError: "\(field_name) is not a valid field for struct with type \(struct_type)"))
|
|
}
|
|
|
|
return .Ok(
|
|
FieldAccessExpression(
|
|
withStruct: struct_identifier,
|
|
withField: P4StructFieldIdentifier(id: field_name, withType: field_type)))
|
|
}
|
|
}
|
|
|
|
extension FieldAccessExpression: CompilableLValueExpression {
|
|
static func compile_as_lvalue(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableLValueExpression?> {
|
|
let expression = node.child(at: 0)!
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "fieldAccessExpression")
|
|
|
|
let maybe_parsed_expression = FieldAccessExpression.compile(node: node, withContext: context)
|
|
guard case .Ok(let maybe_field_access_expression) = maybe_parsed_expression else {
|
|
return .Error(maybe_parsed_expression.error()!)
|
|
}
|
|
|
|
let field_access_expression = maybe_field_access_expression as! FieldAccessExpression
|
|
|
|
return Result.Ok(field_access_expression)
|
|
}
|
|
}
|
|
|
|
extension ArrayAccessExpression: CompilableLValueExpression {
|
|
static func compile_as_lvalue(
|
|
node: SwiftTreeSitter.Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableLValueExpression?> {
|
|
let expression = node.child(at: 0)!
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "arrayAccessExpression")
|
|
|
|
let maybe_parsed_expression = ArrayAccessExpression.compile(node: node, withContext: context)
|
|
guard case .Ok(let maybe_array_access_expression) = maybe_parsed_expression else {
|
|
return .Error(maybe_parsed_expression.error()!)
|
|
}
|
|
|
|
let array_access_expression = maybe_array_access_expression as! ArrayAccessExpression
|
|
|
|
return Result.Ok(array_access_expression)
|
|
}
|
|
}
|
|
|
|
extension FunctionCall: CompilableExpression {
|
|
static func compile(
|
|
node: Node, withContext context: CompilerContext
|
|
) -> Result<EvaluatableExpression?> {
|
|
|
|
let expression = node.child(at: 0)!
|
|
#SkipUnlessNodeType<Node>(
|
|
node: expression, type: "function_call")
|
|
|
|
var walker = Walker(node: expression)
|
|
var current_node: Node? = .none
|
|
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Missing function call component")))
|
|
|
|
let maybe_callee_name = Identifier.Compile(
|
|
node: current_node!, withContext: context)
|
|
guard case .Ok(let callee_name) = maybe_callee_name else {
|
|
return Result.Error(maybe_callee_name.error()!)
|
|
}
|
|
|
|
var maybe_callee: Result<(FunctionDeclaration?, Declaration?)> =
|
|
switch context.types.lookup(identifier: callee_name) {
|
|
case .Ok(let looked_up):
|
|
switch looked_up {
|
|
case let callee as FunctionDeclaration:
|
|
Result<(FunctionDeclaration?, Declaration?)>.Ok((callee, .none)) // What we found is actually a function declaration
|
|
default:
|
|
Result<(FunctionDeclaration?, Declaration?)>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: current_node!.toSourceLocation(),
|
|
withError: "\(callee_name) is not a function"))
|
|
}
|
|
case .Error(let e): Result<(FunctionDeclaration?, Declaration?)>.Error(e)
|
|
}
|
|
|
|
maybe_callee =
|
|
if case .Error(let e) = maybe_callee {
|
|
switch context.externs.lookup(identifier: callee_name) {
|
|
case .Ok(let callee as Declaration):
|
|
// Now, make sure that it is a function declaration!
|
|
switch callee.identifier.type.baseType() {
|
|
case is FunctionDeclaration: Result.Ok((.none, callee))
|
|
default:
|
|
.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: current_node!.toSourceLocation(),
|
|
withError: "\(callee_name) is not a function"))
|
|
}
|
|
default: .Error(e)
|
|
}
|
|
} else {
|
|
maybe_callee
|
|
}
|
|
|
|
guard case .Ok(let callee) = maybe_callee else {
|
|
return .Error(maybe_callee.error()!)
|
|
}
|
|
|
|
walker.next()
|
|
|
|
#MustOr(
|
|
result: current_node, thing: walker.getNext(),
|
|
or: Result<EvaluatableExpression?>.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(), withError: "Missing function call component")))
|
|
|
|
let maybe_argument_list = ArgumentList.Compile(node: current_node!, withContext: context)
|
|
|
|
guard case .Ok((let arguments, _)) = maybe_argument_list else {
|
|
return .Error(maybe_argument_list.error()!)
|
|
}
|
|
|
|
// Now, compare the arguments with the parameters:
|
|
|
|
let params =
|
|
switch callee {
|
|
case (.some(let callee), .none): Optional<ParameterList>.some(callee.params)
|
|
case (.none, .some(let callee)):
|
|
Optional<ParameterList>.some((callee.ffi!.type().baseType() as! FunctionDeclaration).params)
|
|
default: Optional<ParameterList>.none
|
|
}
|
|
|
|
guard case .some(let params) = params else {
|
|
return Result.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Could not lookup the parameters for the called function (\(callee_name))"))
|
|
}
|
|
|
|
if case .Error(let e) = arguments.compatible(params) {
|
|
return .Error(e)
|
|
}
|
|
|
|
// All good!
|
|
|
|
return switch callee {
|
|
case (.some(let callee), .none): .Ok(FunctionCall(callee, withArguments: arguments))
|
|
case (.none, .some(let callee)): .Ok(FunctionCall(callee.ffi!, withArguments: arguments))
|
|
default:
|
|
Result.Error(
|
|
ErrorWithLocation(
|
|
sourceLocation: node.toSourceLocation(),
|
|
withError: "Unexpected error occurred calling function named (\(callee_name))"
|
|
))
|
|
}
|
|
}
|
|
}
|