ml.go 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. package module
  2. import (
  3. "fmt"
  4. "fw/cp"
  5. mod "fw/cp/module"
  6. "fw/cp/node"
  7. "fw/cp/object"
  8. "fw/rt2/context"
  9. "fw/xev"
  10. "os"
  11. "reflect"
  12. "ypk/assert"
  13. "ypk/halt"
  14. )
  15. type Loader func(*mod.Module)
  16. type List interface {
  17. context.ContextAware
  18. AsList() []*mod.Module
  19. Load(string, ...Loader) (*mod.Module, error)
  20. Loaded(string) *mod.Module
  21. NewTypeCalc() TypeCalc
  22. }
  23. func New() List {
  24. return new(list).init()
  25. }
  26. type list struct {
  27. inner map[string]*mod.Module
  28. d context.Domain
  29. }
  30. func (l *list) init() *list {
  31. l.inner = make(map[string]*mod.Module)
  32. return l
  33. }
  34. func (l *list) AsList() (ret []*mod.Module) {
  35. if len(l.inner) > 0 {
  36. ret = make([]*mod.Module, 0)
  37. }
  38. for _, v := range l.inner {
  39. ret = append(ret, v)
  40. }
  41. return ret
  42. }
  43. func (l *list) Domain() context.Domain {
  44. return l.d
  45. }
  46. func (l *list) Init(d context.Domain) {
  47. l.d = d
  48. }
  49. func (l *list) Handle(msg interface{}) {}
  50. func (l *list) Load(name string, ldr ...Loader) (ret *mod.Module, err error) {
  51. assert.For(name != "", 20)
  52. //fmt.Println("loading", name, "loaded", l.Loaded(name) != nil)
  53. ret = l.Loaded(name)
  54. var loader Loader = func(m *mod.Module) {}
  55. if len(ldr) > 0 {
  56. loader = ldr[0]
  57. }
  58. if ret == nil {
  59. path, _ := os.Getwd()
  60. ret = xev.Load(path, name+".oz")
  61. ret.Name = name
  62. for _, imp := range ret.Imports {
  63. //fmt.Println("imports", imp.Name, "loaded", l.Loaded(imp.Name) != nil)
  64. _, err = l.Load(imp.Name, loader)
  65. }
  66. if err == nil {
  67. ret.Init()
  68. l.inner[name] = ret
  69. loader(ret)
  70. //fmt.Println("loaded", name)
  71. }
  72. }
  73. return ret, err
  74. }
  75. func (l *list) Loaded(name string) *mod.Module {
  76. assert.For(name != "", 20)
  77. return l.inner[name]
  78. }
  79. func (l *list) NewTypeCalc() TypeCalc {
  80. return &tc{ml: l}
  81. }
  82. func ModuleDomain(d context.Domain, name string) context.Domain {
  83. uni := d.Discover(context.UNIVERSE).(context.Domain)
  84. return uni.Discover(name).(context.Domain)
  85. }
  86. func Module(d context.Domain, name string) *mod.Module {
  87. uni := d.Discover(context.UNIVERSE).(context.Domain)
  88. return uni.Discover(context.MOD).(List).Loaded(name)
  89. }
  90. func DomainModule(d context.Domain) *mod.Module {
  91. uni := d.Discover(context.UNIVERSE).(context.Domain)
  92. name := uni.Id(d)
  93. assert.For(name != "", 40)
  94. ml := uni.Discover(context.MOD).(List)
  95. return ml.Loaded(name)
  96. }
  97. func ModuleOfNode(d context.Domain, x node.Node) *mod.Module {
  98. uni := d.Discover(context.UNIVERSE).(context.Domain)
  99. ml := uni.Discover(context.MOD).(List)
  100. for _, m := range ml.AsList() {
  101. for _, n := range m.Nodes {
  102. if n == x {
  103. return m
  104. }
  105. }
  106. }
  107. return nil
  108. }
  109. func ModuleOfObject(d context.Domain, x object.Object) *mod.Module {
  110. assert.For(x != nil, 20)
  111. uni := d.Discover(context.UNIVERSE).(context.Domain)
  112. ml := uni.Discover(context.MOD).(List)
  113. for _, m := range ml.AsList() {
  114. for _, v := range m.Objects {
  115. for _, o := range v {
  116. if o == x {
  117. return m
  118. }
  119. }
  120. }
  121. for _, i := range m.Imports {
  122. for _, o := range i.Objects {
  123. if o == x {
  124. return m
  125. }
  126. }
  127. }
  128. }
  129. return nil
  130. }
  131. func ModuleOfType(d context.Domain, x object.ComplexType) *mod.Module {
  132. uni := d.Discover(context.UNIVERSE).(context.Domain)
  133. ml := uni.Discover(context.MOD).(List)
  134. for _, m := range ml.AsList() {
  135. for _, v := range m.Types {
  136. for _, o := range v {
  137. if o.Adr() == x.Adr() { //сравнение по конкретному типу
  138. return m
  139. }
  140. }
  141. }
  142. }
  143. return nil
  144. }
  145. func MapImportType(d context.Domain, imp string, t object.ComplexType) object.ComplexType {
  146. uni := d.Discover(context.UNIVERSE).(context.Domain)
  147. ml := uni.Discover(context.MOD).(List)
  148. m := ml.Loaded(imp)
  149. for _, v := range m.Types[m.Enter] {
  150. if v.Equals(t) {
  151. return v
  152. }
  153. }
  154. return nil
  155. }
  156. func MapImportObject(d context.Domain, t object.Object) object.Object {
  157. if t.Imp() == "" {
  158. return t
  159. }
  160. imp := t.Imp()
  161. uni := d.Discover(context.UNIVERSE).(context.Domain)
  162. ml := uni.Discover(context.MOD).(List)
  163. m := ml.Loaded(imp)
  164. for _, v := range m.Objects[m.Enter] {
  165. if v.Name() == t.Name() {
  166. if v.Type() == t.Type() {
  167. return v
  168. }
  169. }
  170. }
  171. panic(0)
  172. }
  173. type TypeCalc interface {
  174. ConnectTo(interface{})
  175. MethodList() map[int][]Method
  176. ForeignBase() (*mod.Module, object.ComplexType)
  177. }
  178. type Method struct {
  179. Enter node.EnterNode
  180. Obj object.Object
  181. Mod *mod.Module
  182. }
  183. type tc struct {
  184. ml List
  185. m *mod.Module
  186. typ object.ComplexType
  187. TypeCalc
  188. }
  189. type Inherited interface {
  190. Complex(...object.ComplexType) object.ComplexType
  191. }
  192. func (c *tc) ConnectTo(x interface{}) {
  193. switch t := x.(type) {
  194. case object.ComplexType:
  195. c.typ = t
  196. case object.TypeObject:
  197. c.typ = t.Complex()
  198. default:
  199. halt.As(100, reflect.TypeOf(t))
  200. }
  201. c.m = ModuleOfType(c.ml.Domain(), c.typ)
  202. assert.For(c.m != nil, 60)
  203. }
  204. func (c *tc) MethodList() (ret map[int][]Method) {
  205. type mid struct {
  206. id cp.ID
  207. name string
  208. }
  209. ret = make(map[int][]Method, 0)
  210. tmp := make(map[mid]object.Object, 0)
  211. depth := -1
  212. var deep func(*mod.Module, object.ComplexType)
  213. list := func(m *mod.Module, t object.ComplexType) {
  214. ol := m.Objects[m.Enter]
  215. for _, _po := range ol {
  216. switch po := _po.(type) {
  217. case object.ProcedureObject:
  218. var et node.EnterNode
  219. proc := m.NodeByObject(po)
  220. local := false
  221. for i := range proc {
  222. if e, ok := proc[i].(node.EnterNode); ok {
  223. local = true
  224. et = e
  225. }
  226. }
  227. if local && po.Link() != nil {
  228. for pt := po.Link().Complex(); pt != nil; {
  229. if t.Equals(pt) && tmp[mid{id: po.Adr(), name: po.Name()}] == nil {
  230. //fmt.Println("method", m.Name, pt.Qualident(), po.Name(), po.Adr(), local)
  231. tmp[mid{id: po.Adr(), name: po.Name()}] = po
  232. ret[depth] = append(ret[depth], Method{Enter: et, Obj: po, Mod: m})
  233. break
  234. } else if t.Equals(pt) {
  235. //fmt.Println("double ", pt.Qualident(), po.Name(), po.Adr())
  236. }
  237. if _, ok := pt.(Inherited); ok {
  238. pt = pt.(Inherited).Complex()
  239. } else {
  240. pt = nil
  241. }
  242. }
  243. }
  244. }
  245. }
  246. }
  247. foreign := func(t object.ComplexType) {
  248. for _, n := range c.m.Imports {
  249. for _, _it := range n.Objects {
  250. switch it := _it.(type) {
  251. case object.TypeObject:
  252. if it.Complex().Adr() == t.Adr() {
  253. nm := c.ml.Loaded(n.Name)
  254. nt := nm.TypeByName(nm.Enter, it.Name())
  255. deep(nm, nt)
  256. }
  257. }
  258. }
  259. }
  260. }
  261. deep = func(m *mod.Module, x object.ComplexType) {
  262. depth++
  263. tmp = make(map[mid]object.Object, 0)
  264. for t := x; t != nil; {
  265. list(m, t)
  266. z := t.(Inherited).Complex()
  267. if z != nil {
  268. t = z
  269. } else {
  270. foreign(t)
  271. t = nil
  272. }
  273. }
  274. }
  275. deep(c.m, c.typ)
  276. return
  277. }
  278. func (c *tc) ForeignBase() (*mod.Module, object.ComplexType) {
  279. for _, n := range c.m.Imports {
  280. for _, _it := range n.Objects {
  281. switch it := _it.(type) {
  282. case object.TypeObject:
  283. if it.Complex().Adr() == c.typ.Adr() {
  284. nm := c.ml.Loaded(n.Name)
  285. nt := nm.TypeByName(nm.Enter, it.Name())
  286. return nm, nt
  287. }
  288. }
  289. }
  290. }
  291. return nil, nil
  292. }
  293. func (c *tc) String() (ret string) {
  294. foreign := func(t object.ComplexType) {
  295. for _, n := range c.m.Imports {
  296. for _, _it := range n.Objects {
  297. switch it := _it.(type) {
  298. case object.TypeObject:
  299. if it.Complex().Adr() == t.Adr() {
  300. nm := c.ml.Loaded(n.Name)
  301. nt := nm.TypeByName(nm.Enter, it.Name())
  302. other := c.ml.NewTypeCalc()
  303. other.ConnectTo(nt)
  304. ret = fmt.Sprintln(ret, "foreign", other)
  305. }
  306. }
  307. }
  308. }
  309. }
  310. for t := c.typ; t != nil; {
  311. ret = fmt.Sprintln(ret, t.Qualident())
  312. ol := c.m.Objects[c.m.Enter]
  313. for _, _po := range ol {
  314. switch po := _po.(type) {
  315. case object.ProcedureObject:
  316. proc := c.m.NodeByObject(po)
  317. local := false
  318. for i := range proc {
  319. if _, ok := proc[i].(node.EnterNode); ok {
  320. local = true
  321. }
  322. }
  323. if po.Link() != nil {
  324. pt := po.Link().Complex()
  325. var pb object.ComplexType
  326. if _, ok := pt.(Inherited); ok {
  327. pb = pt.(Inherited).Complex()
  328. }
  329. if t.Equals(pt) || t.Equals(pb) {
  330. ret = fmt.Sprintln(ret, po.Name(), local)
  331. }
  332. }
  333. }
  334. }
  335. switch z := t.(type) {
  336. case object.PointerType:
  337. if z.Complex() != nil {
  338. t = z.Complex()
  339. } else {
  340. foreign(t)
  341. t = nil
  342. }
  343. case object.RecordType:
  344. if z.Complex() != nil {
  345. t = z.Complex()
  346. } else {
  347. foreign(t)
  348. t = nil
  349. }
  350. default:
  351. halt.As(0, reflect.TypeOf(t))
  352. }
  353. }
  354. return
  355. }