do.go 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. package eval
  2. import (
  3. "fw/cp/constant/enter"
  4. "fw/cp/node"
  5. "fw/rt2"
  6. "fw/rt2/context"
  7. "fw/rt2/frame"
  8. "fw/rt2/scope"
  9. "reflect"
  10. "ypk/assert"
  11. )
  12. import (
  13. "ypk/halt"
  14. )
  15. func BeginExpression(in IN) (out OUT) {
  16. switch e := in.IR.(type) {
  17. case node.ConstantNode:
  18. out = Now(getConst)
  19. case node.DyadicNode:
  20. out = Now(getDop)
  21. case node.Designator:
  22. out = Now(BeginDesignator)
  23. default:
  24. halt.As(100, reflect.TypeOf(e))
  25. }
  26. return
  27. }
  28. func BeginDesignator(in IN) (out OUT) {
  29. switch e := in.IR.(type) {
  30. case node.VariableNode:
  31. out = Now(getVar)
  32. default:
  33. halt.As(100, reflect.TypeOf(e))
  34. }
  35. return
  36. }
  37. func GetExpression(in IN, key interface{}, expr node.Node, next Do) OUT {
  38. assert.For(expr != nil, 20)
  39. _, ok := expr.(node.Expression)
  40. assert.For(ok, 21, reflect.TypeOf(expr))
  41. assert.For(key != nil, 22)
  42. nf := rt2.New(expr)
  43. rt2.Push(nf, in.Frame)
  44. rt2.RegOf(in.Frame)[context.KEY] = key
  45. rt2.Assert(in.Frame, func(f frame.Frame) (bool, int) {
  46. v := rt2.RegOf(f)[key]
  47. return v != nil, 20
  48. })
  49. return Later(func(IN) OUT {
  50. return Now(next)
  51. })
  52. }
  53. func GetDesignator(in IN, key interface{}, design node.Node, next Do) OUT {
  54. assert.For(design != nil, 20)
  55. _, ok := design.(node.Designator)
  56. assert.For(ok, 21)
  57. assert.For(key != nil, 22)
  58. nf := rt2.New(design)
  59. rt2.Push(nf, in.Frame)
  60. rt2.RegOf(in.Frame)[context.KEY] = key
  61. rt2.Assert(in.Frame, func(f frame.Frame) (bool, int) {
  62. v := rt2.RegOf(f)[key]
  63. return v != nil, 20
  64. })
  65. return Later(func(IN) OUT {
  66. return Now(next)
  67. })
  68. }
  69. func BeginStatement(in IN) (out OUT) {
  70. switch n := in.IR.(type) {
  71. case node.EnterNode:
  72. var tail Do
  73. tail = func(in IN) OUT {
  74. q := in.Frame.Root().Queue()
  75. if q != nil {
  76. in.Frame.Root().PushFor(q, nil)
  77. return Later(tail)
  78. } else {
  79. return Now(doEnter)
  80. }
  81. }
  82. out = Now(tail)
  83. case node.AssignNode:
  84. out = Now(doAssign)
  85. case node.CallNode:
  86. out = Now(doCall)
  87. default:
  88. halt.As(100, reflect.TypeOf(n))
  89. }
  90. return
  91. }
  92. func EndStatement(in IN) (out OUT) {
  93. switch n := in.IR.(type) {
  94. case node.EnterNode:
  95. out = Now(func(in IN) OUT {
  96. if n.Enter() == enter.PROCEDURE {
  97. rt2.ThisScope(in.Frame).Target().(scope.ScopeAllocator).Dispose(n)
  98. }
  99. return End()
  100. })
  101. case node.AssignNode, node.CallNode:
  102. out = Now(func(in IN) OUT {
  103. next := n.Link()
  104. if next != nil {
  105. nf := rt2.New(next)
  106. if nf != nil {
  107. in.Frame.Root().PushFor(nf, in.Parent)
  108. }
  109. }
  110. return End()
  111. })
  112. default:
  113. halt.As(100, reflect.TypeOf(n))
  114. }
  115. return out.Do(in)
  116. }