stdScope.go 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. package scope
  2. import (
  3. "container/list"
  4. "cp/node"
  5. "cp/object"
  6. "fmt"
  7. "reflect"
  8. "rt2/context"
  9. rt_mod "rt2/module"
  10. "ypk/assert"
  11. )
  12. func This(i interface{}) Manager {
  13. assert.For(i != nil, 20)
  14. return i.(Manager)
  15. }
  16. func New() Manager {
  17. return new(manager).init()
  18. }
  19. type manager struct {
  20. d context.Domain
  21. areas *list.List
  22. }
  23. type area struct {
  24. heap map[object.Object]interface{}
  25. root node.Node
  26. }
  27. type undefined struct{}
  28. type param struct{}
  29. var undef *undefined = new(undefined)
  30. var par *param = new(param)
  31. func (m *manager) init() *manager {
  32. m.areas = list.New()
  33. return m
  34. }
  35. func (m *manager) Allocate(n node.Node) {
  36. mod := rt_mod.DomainModule(m.Domain())
  37. h := new(area)
  38. h.heap = make(map[object.Object]interface{})
  39. h.root = n
  40. for _, o := range mod.Objects[n] {
  41. //fmt.Println(reflect.TypeOf(o))
  42. switch o.(type) {
  43. case object.VariableObject:
  44. h.heap[o] = undef
  45. case object.ParameterObject:
  46. h.heap[o] = par
  47. }
  48. }
  49. m.areas.PushFront(h)
  50. fmt.Println("allocate", len(h.heap), "obj")
  51. }
  52. func (m *manager) set(a *area, o object.Object, val node.Node) {
  53. switch val.(type) {
  54. case node.ConstantNode:
  55. m.Update(o, func(old interface{}) interface{} {
  56. return val.(node.ConstantNode).Data()
  57. })
  58. case node.VariableNode, node.ParameterNode:
  59. m.Update(o, func(old interface{}) interface{} {
  60. return m.Select(val.Object())
  61. })
  62. default:
  63. panic("unknown value")
  64. }
  65. }
  66. func (m *manager) Initialize(n node.Node, o object.Object, _val node.Node) {
  67. e := m.areas.Front()
  68. assert.For(e != nil, 20)
  69. h := e.Value.(*area)
  70. assert.For(h.root == n, 21)
  71. val := _val
  72. for next := o; next != nil; next = next.Link() {
  73. assert.For(val != nil, 40)
  74. fmt.Println(reflect.TypeOf(next), next.Name(), ":", next.Type())
  75. fmt.Println(reflect.TypeOf(val))
  76. m.set(h, next, val)
  77. val = val.Link()
  78. }
  79. }
  80. func (m *manager) Dispose(n node.Node) {
  81. e := m.areas.Front()
  82. assert.For(e != nil, 20)
  83. h := e.Value.(*area)
  84. assert.For(h.root == n, 21)
  85. m.areas.Remove(e)
  86. fmt.Println("dispose")
  87. }
  88. func (m *manager) Select(o object.Object) (ret interface{}) {
  89. assert.For(o != nil, 20)
  90. for e := m.areas.Front(); (e != nil) && (ret == nil); e = e.Next() {
  91. h := e.Value.(*area)
  92. ret = h.heap[o]
  93. }
  94. assert.For(ret != nil, 40)
  95. if ret == undef {
  96. ret = nil
  97. } else if ret == par {
  98. panic("")
  99. }
  100. return ret
  101. }
  102. func (m *manager) Update(o object.Object, val Value) {
  103. assert.For(o != nil, 20)
  104. assert.For(val != nil, 21)
  105. var x *area
  106. for e := m.areas.Front(); (e != nil) && (x == nil); e = e.Next() {
  107. h := e.Value.(*area)
  108. if h.heap[o] != nil {
  109. x = h
  110. }
  111. }
  112. assert.For(x != nil, 40)
  113. tmp := x.heap[o]
  114. if tmp == undef {
  115. tmp = val(nil)
  116. } else {
  117. tmp = val(tmp)
  118. }
  119. if tmp == nil {
  120. tmp = undef
  121. }
  122. x.heap[o] = tmp
  123. fmt.Println("set", x.heap[o], reflect.TypeOf(x.heap[o]))
  124. }
  125. func (m *manager) Init(d context.Domain) {
  126. m.d = d
  127. }
  128. func (m *manager) Domain() context.Domain {
  129. return m.d
  130. }
  131. func (m *manager) Handle(msg interface{}) {}