ml.go 8.3 KB

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