123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124 |
- package eval
- import (
- "fw/cp/constant/enter"
- "fw/cp/node"
- "fw/rt2"
- "fw/rt2/context"
- "fw/rt2/frame"
- "fw/rt2/scope"
- "reflect"
- "ypk/assert"
- )
- import (
- "ypk/halt"
- )
- func BeginExpression(in IN) (out OUT) {
- switch e := in.IR.(type) {
- case node.ConstantNode:
- out = Now(getConst)
- case node.DyadicNode:
- out = Now(getDop)
- case node.Designator:
- out = Now(BeginDesignator)
- default:
- halt.As(100, reflect.TypeOf(e))
- }
- return
- }
- func BeginDesignator(in IN) (out OUT) {
- switch e := in.IR.(type) {
- case node.VariableNode:
- out = Now(getVar)
- default:
- halt.As(100, reflect.TypeOf(e))
- }
- return
- }
- func GetExpression(in IN, key interface{}, expr node.Node, next Do) OUT {
- assert.For(expr != nil, 20)
- _, ok := expr.(node.Expression)
- assert.For(ok, 21, reflect.TypeOf(expr))
- assert.For(key != nil, 22)
- nf := rt2.New(expr)
- rt2.Push(nf, in.Frame)
- rt2.RegOf(in.Frame)[context.KEY] = key
- rt2.Assert(in.Frame, func(f frame.Frame) (bool, int) {
- v := rt2.RegOf(f)[key]
- return v != nil, 20
- })
- return Later(func(IN) OUT {
- return Now(next)
- })
- }
- func GetDesignator(in IN, key interface{}, design node.Node, next Do) OUT {
- assert.For(design != nil, 20)
- _, ok := design.(node.Designator)
- assert.For(ok, 21)
- assert.For(key != nil, 22)
- nf := rt2.New(design)
- rt2.Push(nf, in.Frame)
- rt2.RegOf(in.Frame)[context.KEY] = key
- rt2.Assert(in.Frame, func(f frame.Frame) (bool, int) {
- v := rt2.RegOf(f)[key]
- return v != nil, 20
- })
- return Later(func(IN) OUT {
- return Now(next)
- })
- }
- func BeginStatement(in IN) (out OUT) {
- switch n := in.IR.(type) {
- case node.EnterNode:
- var tail Do
- tail = func(in IN) OUT {
- q := in.Frame.Root().Queue()
- if q != nil {
- in.Frame.Root().PushFor(q, nil)
- return Later(tail)
- } else {
- return Now(doEnter)
- }
- }
- out = Now(tail)
- case node.AssignNode:
- out = Now(doAssign)
- case node.CallNode:
- out = Now(doCall)
- default:
- halt.As(100, reflect.TypeOf(n))
- }
- return
- }
- func EndStatement(in IN) (out OUT) {
- switch n := in.IR.(type) {
- case node.EnterNode:
- out = Now(func(in IN) OUT {
- if n.Enter() == enter.PROCEDURE {
- rt2.ThisScope(in.Frame).Target().(scope.ScopeAllocator).Dispose(n)
- }
- return End()
- })
- case node.AssignNode, node.CallNode:
- out = Now(func(in IN) OUT {
- next := n.Link()
- if next != nil {
- nf := rt2.New(next)
- if nf != nil {
- in.Frame.Root().PushFor(nf, in.Parent)
- }
- }
- return End()
- })
- default:
- halt.As(100, reflect.TypeOf(n))
- }
- return out.Do(in)
- }
|