summary refs log tree commit diff stats
path: root/tests/arc/torc_basic_test.nim
blob: 73039fad749b927cfbdc30a68ff986a7a84495d3 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
discard """
  output: "MEM 0"
  cmd: "nim c --gc:orc $file"
"""

type
  Node = ref object
    name: char
    sccId: int
    #a: array[3, Node]
    a0, a1, a2: Node
    rc: int

proc edge(a, b: Node) =
  inc b.rc
  if a.a0 == nil: a.a0 = b
  elif a.a1 == nil: a.a1 = b
  else: a.a2 = b
  when false:
    var i = 0
    while a.a[i] != nil: inc i
    a.a[i] = b

proc createNode(name: char): Node =
  new result
  result.name = name

#[

     +--------------------------------+
     v                                |
+---------+      +------+             |
|         |      |      |             |
|  A      +----->+      |      +------+------+
+--+------+      |      |      |             |
   |             |      |      |     C       ------------>  G  <--|
   |             |  R   |      |             |
+--v------+      |      |      +-------------+
|         |      |      |        ^
|   B     <------+      |        |
|         |      |      +--------+
+---------+      |      |
                 +------+

]#
proc use(x: Node) = discard

proc main =
  let a = createNode('A')
  let b = createNode('B')
  let r = createNode('R')
  let c = createNode('C')

  a.edge b
  a.edge r

  r.edge b
  r.edge c

  let g = createNode('G')
  g.edge g
  g.edge g

  c.edge g
  c.edge a

  use g
  use b

proc buildComplexGraph: Node =
  # see https://en.wikipedia.org/wiki/Strongly_connected_component for the
  # graph:
  let a = createNode('a')
  let b = createNode('b')
  let c = createNode('c')
  let d = createNode('d')
  let e = createNode('e')

  a.edge c
  c.edge b
  c.edge e
  b.edge a
  d.edge c
  e.edge d


  let f = createNode('f')
  b.edge f
  e.edge f

  let g = createNode('g')
  let h = createNode('h')
  let i = createNode('i')

  f.edge g
  f.edge i
  g.edge h
  h.edge i
  i.edge g

  let j = createNode('j')

  h.edge j
  i.edge j

  let k = createNode('k')
  let l = createNode('l')

  f.edge k
  k.edge l
  l.edge k
  k.edge j

  let m = createNode('m')
  let n = createNode('n')
  let p = createNode('p')
  let q = createNode('q')

  m.edge n
  n.edge p
  n.edge q
  q.edge p
  p.edge m

  q.edge k

  d.edge m
  e.edge n

  result = a

proc main2 =
  let g = buildComplexGraph()

main()
main2()
GC_fullCollect()
echo "MEM ", getOccupiedMem()