summary refs log tree commit diff stats
diff options
context:
space:
mode:
-rwxr-xr-xcompiler/ast.nim20
-rwxr-xr-xcompiler/ccgtypes.nim6
-rwxr-xr-xcompiler/lists.nim65
-rwxr-xr-xcompiler/ropes.nim4
-rwxr-xr-xcompiler/semexprs.nim2
-rwxr-xr-xcompiler/semtypinst.nim15
-rwxr-xr-xtests/accept/compile/tgenericrefs.nim2
-rw-r--r--tests/accept/run/teventemitter.nim31
-rw-r--r--tests/reject/tvarres2.nim2
-rwxr-xr-xtodo.txt1
10 files changed, 68 insertions, 80 deletions
diff --git a/compiler/ast.nim b/compiler/ast.nim
index f176f6eb1..58ef9f6c2 100755
--- a/compiler/ast.nim
+++ b/compiler/ast.nim
@@ -625,13 +625,11 @@ proc ValueToString*(a: PNode): string
 const 
   debugIds* = false
 
-proc registerID*(id: PIdObj)
-# implementation
+when debugIds:
+  var usedIds: TIntSet
 
-var usedIds: TIntSet
-
-proc registerID(id: PIdObj) = 
-  if debugIDs: 
+proc registerID*(id: PIdObj) = 
+  when debugIDs: 
     if (id.id == - 1) or ContainsOrIncl(usedIds, id.id): 
       InternalError("ID already used: " & $(id.id))
   
@@ -761,7 +759,7 @@ proc NewType(kind: TTypeKind, owner: PSym): PType =
   result.size = - 1
   result.align = 2            # default alignment
   result.id = getID()
-  if debugIds: 
+  when debugIds: 
     RegisterId(result)        
   #if result.id < 2000 then
   #  MessageOut(typeKindToStr[kind] & ' has id: ' & toString(result.id))
@@ -784,7 +782,7 @@ proc copyType(t: PType, owner: PSym, keepId: bool): PType =
     result.id = t.id
   else: 
     result.id = getID()
-    if debugIds: RegisterId(result)
+    when debugIds: RegisterId(result)
   result.sym = t.sym          # backend-info should not be copied
   
 proc copySym(s: PSym, keepId: bool = false): PSym = 
@@ -796,7 +794,7 @@ proc copySym(s: PSym, keepId: bool = false): PSym =
     result.id = s.id
   else: 
     result.id = getID()
-    if debugIds: RegisterId(result)
+    when debugIds: RegisterId(result)
   result.flags = s.flags
   result.magic = s.magic
   copyStrTable(result.tab, s.tab)
@@ -816,7 +814,7 @@ proc NewSym(symKind: TSymKind, Name: PIdent, owner: PSym): PSym =
   result.owner = owner
   result.offset = - 1
   result.id = getID()
-  if debugIds: 
+  when debugIds: 
     RegisterId(result)
   #if result.id < 2000:
   #  MessageOut(name.s & " has id: " & toString(result.id))
@@ -1005,4 +1003,4 @@ proc getStrOrChar*(a: PNode): string =
     internalError(a.info, "getStrOrChar")
     result = ""
   
-if debugIDs: usedIds = InitIntSet()
+when debugIDs: usedIds = InitIntSet()
diff --git a/compiler/ccgtypes.nim b/compiler/ccgtypes.nim
index ddaeed729..7237fec8b 100755
--- a/compiler/ccgtypes.nim
+++ b/compiler/ccgtypes.nim
@@ -152,10 +152,10 @@ proc getGlobalTempName(): PRope =
   inc(gId)
 
 proc ccgIntroducedPtr(s: PSym): bool = 
-  var pt = s.typ
+  var pt = skipTypes(s.typ, abstractInst)
   assert skResult != s.kind
   case pt.Kind
-  of tyObject: 
+  of tyObject:
     # XXX quick hack floatSize*2 for the pegs module under 64bit
     if (optByRef in s.options) or (getSize(pt) > platform.floatSize * 2): 
       result = true           # requested anyway
@@ -352,7 +352,7 @@ proc getRecordDesc(m: BModule, typ: PType, name: PRope,
   var hasField = false
   if typ.kind == tyObject: 
     if typ.sons[0] == nil: 
-      if typ.sym != nil and sfPure in typ.sym.flags or tfFinal in typ.flags: 
+      if (typ.sym != nil and sfPure in typ.sym.flags) or tfFinal in typ.flags: 
         result = ropecg(m, "struct $1 {$n", [name])
       else: 
         result = ropecg(m, "struct $1 {$n#TNimType* m_type;$n", [name])
diff --git a/compiler/lists.nim b/compiler/lists.nim
index b4610ab2f..b23dfd071 100755
--- a/compiler/lists.nim
+++ b/compiler/lists.nim
@@ -24,23 +24,12 @@ type
 
   TCompareProc* = proc (entry: PListEntry, closure: Pointer): bool
 
-proc InitLinkedList*(list: var TLinkedList)
-proc Append*(list: var TLinkedList, entry: PListEntry)
-proc Prepend*(list: var TLinkedList, entry: PListEntry)
-proc Remove*(list: var TLinkedList, entry: PListEntry)
-proc InsertBefore*(list: var TLinkedList, pos, entry: PListEntry)
-proc Find*(list: TLinkedList, fn: TCompareProc, closure: Pointer): PListEntry
-proc AppendStr*(list: var TLinkedList, data: string)
-proc IncludeStr*(list: var TLinkedList, data: string): bool
-proc PrependStr*(list: var TLinkedList, data: string)
-# implementation
-
-proc InitLinkedList(list: var TLinkedList) = 
+proc InitLinkedList*(list: var TLinkedList) = 
   list.Counter = 0
   list.head = nil
   list.tail = nil
 
-proc Append(list: var TLinkedList, entry: PListEntry) = 
+proc Append*(list: var TLinkedList, entry: PListEntry) = 
   Inc(list.counter)
   entry.next = nil
   entry.prev = list.tail
@@ -50,28 +39,38 @@ proc Append(list: var TLinkedList, entry: PListEntry) =
   list.tail = entry
   if list.head == nil: list.head = entry
   
-proc newStrEntry(data: string): PStrEntry = 
-  new(result)
-  result.data = data
-
-proc AppendStr(list: var TLinkedList, data: string) = 
-  append(list, newStrEntry(data))
-
-proc PrependStr(list: var TLinkedList, data: string) = 
-  prepend(list, newStrEntry(data))
-
 proc Contains*(list: TLinkedList, data: string): bool = 
   var it = list.head
   while it != nil: 
     if PStrEntry(it).data == data: 
       return true
     it = it.next
+  
+proc newStrEntry(data: string): PStrEntry = 
+  new(result)
+  result.data = data
 
-proc IncludeStr(list: var TLinkedList, data: string): bool = 
+proc AppendStr*(list: var TLinkedList, data: string) = 
+  append(list, newStrEntry(data))
+
+proc IncludeStr*(list: var TLinkedList, data: string): bool = 
   if Contains(list, data): return true
   AppendStr(list, data)       # else: add to list
 
-proc InsertBefore(list: var TLinkedList, pos, entry: PListEntry) = 
+proc Prepend*(list: var TLinkedList, entry: PListEntry) = 
+  Inc(list.counter)
+  entry.prev = nil
+  entry.next = list.head
+  if list.head != nil: 
+    assert(list.head.prev == nil)
+    list.head.prev = entry
+  list.head = entry
+  if list.tail == nil: list.tail = entry
+
+proc PrependStr*(list: var TLinkedList, data: string) = 
+  prepend(list, newStrEntry(data))
+
+proc InsertBefore*(list: var TLinkedList, pos, entry: PListEntry) = 
   assert(pos != nil)
   if pos == list.head: 
     prepend(list, entry)
@@ -81,18 +80,8 @@ proc InsertBefore(list: var TLinkedList, pos, entry: PListEntry) =
     entry.prev = pos.prev
     if pos.prev != nil: pos.prev.next = entry
     pos.prev = entry
-
-proc Prepend(list: var TLinkedList, entry: PListEntry) = 
-  Inc(list.counter)
-  entry.prev = nil
-  entry.next = list.head
-  if list.head != nil: 
-    assert(list.head.prev == nil)
-    list.head.prev = entry
-  list.head = entry
-  if list.tail == nil: list.tail = entry
-  
-proc Remove(list: var TLinkedList, entry: PListEntry) = 
+ 
+proc Remove*(list: var TLinkedList, entry: PListEntry) = 
   Dec(list.counter)
   if entry == list.tail: 
     list.tail = entry.prev
@@ -101,7 +90,7 @@ proc Remove(list: var TLinkedList, entry: PListEntry) =
   if entry.next != nil: entry.next.prev = entry.prev
   if entry.prev != nil: entry.prev.next = entry.next
   
-proc Find(list: TLinkedList, fn: TCompareProc, closure: Pointer): PListEntry = 
+proc Find*(list: TLinkedList, fn: TCompareProc, closure: Pointer): PListEntry = 
   result = list.head
   while result != nil: 
     if fn(result, closure): return 
diff --git a/compiler/ropes.nim b/compiler/ropes.nim
index 36ac3ecf7..9b8a8466c 100755
--- a/compiler/ropes.nim
+++ b/compiler/ropes.nim
@@ -49,8 +49,8 @@
 #  The 'con' operator is associative! This does not matter however for
 #  the algorithms we use for ropes.
 #
-#  Note that the left and right pointers are not needed for leafs.
-#  Leafs have relatively high memory overhead (~30 bytes on a 32
+#  Note that the left and right pointers are not needed for leaves.
+#  Leaves have relatively high memory overhead (~30 bytes on a 32
 #  bit machines) and we produce many of them. This is why we cache and
 #  share leaves accross different rope trees.
 #  To cache them they are inserted in another tree, a splay tree for best
diff --git a/compiler/semexprs.nim b/compiler/semexprs.nim
index 959a48267..28076754f 100755
--- a/compiler/semexprs.nim
+++ b/compiler/semexprs.nim
@@ -480,7 +480,7 @@ proc semIndirectOp(c: PContext, n: PNode, flags: TExprFlags): PNode =
     # we assume that a procedure that calls something indirectly 
     # has side-effects:
     if tfNoSideEffect notin t.flags: incl(c.p.owner.flags, sfSideEffect)
-  else: 
+  else:
     result = overloadedCallOpr(c, n)
     # Now that nkSym does not imply an iteration over the proc/iterator space,
     # the old ``prc`` (which is likely an nkIdent) has to be restored:
diff --git a/compiler/semtypinst.nim b/compiler/semtypinst.nim
index e5f573248..fe45e7517 100755
--- a/compiler/semtypinst.nim
+++ b/compiler/semtypinst.nim
@@ -7,7 +7,7 @@
 #    distribution, for details about the copyright.
 #
 
-# This module does the instantiation of generic procs and types.
+# This module does the instantiation of generic types.
 
 import ast, astalgo, msgs, types, semdata
 
@@ -92,24 +92,24 @@ proc lookupTypeVar(cl: TReplTypeVars, t: PType): PType =
     InternalError(cl.info, "substitution with generic parameter")
   
 proc ReplaceTypeVarsT*(cl: var TReplTypeVars, t: PType): PType = 
-  var body, newbody, x, header: PType
   result = t
   if t == nil: return 
   case t.kind
   of tyGenericParam: 
     result = lookupTypeVar(cl, t)
   of tyGenericInvokation: 
-    body = t.sons[0]
+    var body = t.sons[0]
     if body.kind != tyGenericBody: InternalError(cl.info, "no generic body")
-    header = nil
-    for i in countup(1, sonsLen(t) - 1): 
+    var header: PType = nil
+    for i in countup(1, sonsLen(t) - 1):
+      var x: PType
       if t.sons[i].kind == tyGenericParam: 
         x = lookupTypeVar(cl, t.sons[i])
         if header == nil: header = copyType(t, t.owner, false)
         header.sons[i] = x
       else: 
         x = t.sons[i]
-      idTablePut(cl.typeMap, body.sons[i - 1], x)
+      idTablePut(cl.typeMap, body.sons[i-1], x)
     if header == nil: header = t
     result = searchInstTypes(gInstTypes, header)
     if result != nil: return 
@@ -119,7 +119,8 @@ proc ReplaceTypeVarsT*(cl: var TReplTypeVars, t: PType): PType =
       # but we already raised an error!
       addSon(result, header.sons[i])
     idTablePut(gInstTypes, header, result)
-    newbody = ReplaceTypeVarsT(cl, lastSon(body))
+    var newbody = ReplaceTypeVarsT(cl, lastSon(body))
+    newbody.flags = newbody.flags + t.flags + body.flags
     newbody.n = ReplaceTypeVarsN(cl, lastSon(body).n)
     addSon(result, newbody)   
     #writeln(output, ropeToStr(Typetoyaml(newbody)));
diff --git a/tests/accept/compile/tgenericrefs.nim b/tests/accept/compile/tgenericrefs.nim
index 2a3de7edd..3b7940098 100755
--- a/tests/accept/compile/tgenericrefs.nim
+++ b/tests/accept/compile/tgenericrefs.nim
@@ -15,7 +15,7 @@ type
   TA[T] = object
 
 
-# Cannot instanciate:
+# Cannot instantiate:
 type 
   TA[T] = object
     a: PA[T]
diff --git a/tests/accept/run/teventemitter.nim b/tests/accept/run/teventemitter.nim
index 6ebe994b1..166a0cb30 100644
--- a/tests/accept/run/teventemitter.nim
+++ b/tests/accept/run/teventemitter.nim
@@ -1,23 +1,24 @@
 import tables
 import lists
 type
-    TEventArgs = object of TObject
+  TEventArgs = object of TObject
 type
-    TEventEmitter = object of TObject
-        events*: TTable[string, TDoublyLinkedList[proc(e : TEventArgs)]]
-proc on*(emitter : var TEventEmitter, event : string, func : proc(e : TEventArgs)) =
-    if hasKey(emitter.events, event) == false:
-        var list: TDoublyLinkedList[proc(e : TEventArgs)]
-        add(emitter.events,event,list) #if not, add it.
-    append(emitter.events[event], func) #adds the function to the event's list. I get a error here too.
+  TEventEmitter = object of TObject
+    events*: TTable[string, TDoublyLinkedList[proc(e : TEventArgs)]]
+proc on*(emitter: var TEventEmitter, event: string, func: proc(e: TEventArgs)) =
+  if not hasKey(emitter.events, event):
+    var list: TDoublyLinkedList[proc(e: TEventArgs)]
+    add(emitter.events,event,list) #if not, add it.
+  #append(emitter.events[event], func)
+  #adds the function to the event's list. I get a error here too.
         
-proc emit*(emitter : TEventEmitter, event : string, args : TEventArgs) =
-    for func in items(emitter.events[event]):
-        func(args) #call function with args.
-proc initEmitter(emitter : TEventEmitter) =
-     emitter.events = initTable[string, TSinglyLinkedList[TObject]]()
+proc emit*(emitter: TEventEmitter, event: string, args: TEventArgs) =
+  for func in nodes(emitter.events[event]):
+    func.value(args) #call function with args.
+proc initEmitter(emitter: TEventEmitter) =
+  emitter.events = initTable[string, TDoublyLinkedList[proc(e: TEventArgs)]]()
 
-var ee : TEventEmitter
-ee.on("print", proc(e : TEventArgs) = echo("pie"))
+var ee: TEventEmitter
+ee.on("print", proc(e: TEventArgs) = echo("pie"))
 ee.emit("print")
 
diff --git a/tests/reject/tvarres2.nim b/tests/reject/tvarres2.nim
index 6bda844fc..165e4a36e 100644
--- a/tests/reject/tvarres2.nim
+++ b/tests/reject/tvarres2.nim
@@ -1,5 +1,5 @@
 discard """
-  file: "tvarres1.nim"
+  file: "tvarres2.nim"
   line: 11
   errormsg: "expression has no address"
 """
diff --git a/todo.txt b/todo.txt
index 45b7e47b3..69b0b40e2 100755
--- a/todo.txt
+++ b/todo.txt
@@ -18,7 +18,6 @@ version 0.9.0
 =============
 
 - add --deadlock_prevention:on|off switch? timeout for locks?
-- bug: tfFinal not passed to generic
 - bug: forward proc for generic seems broken
 - warning for implicit openArray -> varargs convention
 - implement explicit varargs
artik K. Agaram <vc@akkartik.com> 2017-10-12 23:07:11 -0700 committer Kartik K. Agaram <vc@akkartik.com> 2017-10-12 23:17:46 -0700 4049' href='/akkartik/mu/commit/subx/013immediate_addressing.cc?h=hlt&id=159af423673c96a35947e85a788689d216f6e2fb'>159af423 ^
0cb988d0 ^

069ed1c8 ^
0cb988d0 ^



159af423 ^

f829120a ^
c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
159af423 ^


280f5115 ^

0ca791cd ^
3f4bbe9e ^
0ca791cd ^
280f5115 ^

1f56ac64 ^
280f5115 ^
3ecd66fb ^

280f5115 ^



1a62e61d ^
069ed1c8 ^
280f5115 ^






ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
280f5115 ^


0cb988d0 ^

069ed1c8 ^
0cb988d0 ^



280f5115 ^


c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
280f5115 ^


ce315187 ^

0ca791cd ^
3f4bbe9e ^
0ca791cd ^
ce315187 ^

1f56ac64 ^
ce315187 ^
3ecd66fb ^

ce315187 ^



1a62e61d ^
069ed1c8 ^
ce315187 ^






ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
ce315187 ^


cb4be511 ^

069ed1c8 ^
cb4be511 ^


ce315187 ^

c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
ce315187 ^


8745e745 ^

0ca791cd ^
3f4bbe9e ^
0ca791cd ^
8745e745 ^

1f56ac64 ^
8745e745 ^
3ecd66fb ^

8745e745 ^



1a62e61d ^
069ed1c8 ^
8745e745 ^






ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
8745e745 ^


cb4be511 ^

069ed1c8 ^
cb4be511 ^


8745e745 ^

c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
8745e745 ^


125bea47 ^
c67ca4b9 ^
0ca791cd ^
0a7b0372 ^
0ca791cd ^
c67ca4b9 ^
c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^

c67ca4b9 ^


2903607a ^
c67ca4b9 ^
1a62e61d ^
069ed1c8 ^
c67ca4b9 ^




069ed1c8 ^
c67ca4b9 ^



c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^

c67ca4b9 ^


c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^

c67ca4b9 ^




c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
c67ca4b9 ^



069ed1c8 ^
c67ca4b9 ^




069ed1c8 ^
c67ca4b9 ^



c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
c67ca4b9 ^


c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
c67ca4b9 ^


ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
c67ca4b9 ^


ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
c67ca4b9 ^


c8c50658 ^
ca00f6b9 ^
39c0d1b1 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
ca00f6b9 ^
39c0d1b1 ^
e07a3f28 ^
ca00f6b9 ^
e07a3f28 ^
c67ca4b9 ^
125bea47 ^


0ca791cd ^
3f4bbe9e ^







0ca791cd ^
125bea47 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^

125bea47 ^

9ecbcc55 ^








1a62e61d ^
069ed1c8 ^
125bea47 ^




9e45873f ^
0ca791cd ^
3f4bbe9e ^
0ca791cd ^
125bea47 ^
c8c50658 ^
1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
0cb988d0 ^
e07a3f28 ^
871ea368 ^
e07a3f28 ^
125bea47 ^



e07a3f28 ^
125bea47 ^
1a62e61d ^
e07a3f28 ^
125bea47 ^


9e45873f ^


0ca791cd ^
3f4bbe9e ^
0ca791cd ^
9e45873f ^

1f56ac64 ^
0cb988d0 ^
3ecd66fb ^
9e45873f ^





1a62e61d ^
069ed1c8 ^
62c6d163 ^
d98cc38e ^
069ed1c8 ^

9e45873f ^

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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496