module.go 2.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115
  1. package module
  2. import (
  3. "fmt"
  4. "fw/cp/node"
  5. "fw/cp/object"
  6. "reflect"
  7. "ypk/assert"
  8. "ypk/halt"
  9. )
  10. type Import struct {
  11. Name string
  12. Objects []object.Object
  13. Types []object.ComplexType
  14. }
  15. type Module struct {
  16. Name string
  17. Enter node.Node
  18. Objects map[node.Node][]object.Object
  19. Nodes []node.Node
  20. Types map[node.Node][]object.ComplexType
  21. Imports map[string]Import
  22. }
  23. type named interface {
  24. Name() string
  25. }
  26. func (m *Module) ObjectByName(scope node.Node, name string) (rl []object.Object) {
  27. assert.For(name != "", 20)
  28. find := func(v []object.Object) (ret []object.Object) {
  29. for _, o := range v {
  30. if o.Name() == name {
  31. ret = append(ret, o)
  32. }
  33. //fmt.Println(o.Name(), name, o.Name() == name)
  34. }
  35. return ret
  36. }
  37. if scope == nil {
  38. for _, v := range m.Objects {
  39. rl = append(rl, find(v)...)
  40. }
  41. } else {
  42. rl = find(m.Objects[scope])
  43. }
  44. return rl
  45. }
  46. func (m *Module) TypeByName(scope node.Node, name string) (ret object.ComplexType) {
  47. assert.For(name != "", 20)
  48. for _, typ := range m.Types[scope] {
  49. fmt.Print(typ)
  50. if v, ok := typ.(named); ok && v.Name() == name {
  51. ret = typ
  52. break //стыд какой
  53. }
  54. }
  55. return ret
  56. }
  57. func (m *Module) ImportOf(obj object.Object) string {
  58. contains := func(v []object.Object) bool {
  59. for _, o := range v {
  60. if o == obj {
  61. return true
  62. }
  63. }
  64. return false
  65. }
  66. for _, v := range m.Imports {
  67. if contains(v.Objects) {
  68. return v.Name
  69. }
  70. }
  71. return ""
  72. }
  73. func (m *Module) NodeByObject(obj object.Object) (ret []node.Node) {
  74. assert.For(obj != nil, 20)
  75. for i := 0; (i < len(m.Nodes)) && (ret == nil); i++ {
  76. node := m.Nodes[i]
  77. if node.Object() == obj {
  78. ret = append(ret, node)
  79. }
  80. }
  81. return ret
  82. }
  83. func (m *Module) Init() {
  84. for k, s := range m.Types {
  85. q := ""
  86. if m.Enter.Adr() == k.Adr() {
  87. q = m.Name
  88. } else {
  89. switch e := k.(type) {
  90. case node.EnterNode:
  91. fmt.Println(e.Adr(), e.Enter())
  92. default:
  93. halt.As(100, reflect.TypeOf(e))
  94. }
  95. }
  96. for _, t := range s {
  97. t.Qualident(q)
  98. }
  99. }
  100. for i, s := range m.Imports {
  101. for _, t := range s.Types {
  102. fmt.Println(i, t)
  103. }
  104. }
  105. }