-
Notifications
You must be signed in to change notification settings - Fork 68
/
VMSpurTreeAllocationStrategyForSmallTreeTest.class.st
348 lines (245 loc) · 15.2 KB
/
VMSpurTreeAllocationStrategyForSmallTreeTest.class.st
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
Class {
#name : #VMSpurTreeAllocationStrategyForSmallTreeTest,
#superclass : #VMSpurInitializedOldSpaceTest,
#instVars : [
'sizesInBreadthFirstOrder',
'chunkAddresses'
],
#category : #'VMMakerTests-MemoryTests'
}
{ #category : #accessing }
VMSpurTreeAllocationStrategyForSmallTreeTest >> addressOfChunkOf: aSize [
^ chunkAddresses at: aSize
]
{ #category : #running }
VMSpurTreeAllocationStrategyForSmallTreeTest >> setUp [
super setUp.
self setUpTree.
]
{ #category : #running }
VMSpurTreeAllocationStrategyForSmallTreeTest >> setUpTree [
" 560
/ \
528 592
/ \ / \
512 544 576 608
"
| parent childNumber |
chunkAddresses := Dictionary new.
512 to: 608 by: 16 do: [ :size |
chunkAddresses at: size put: (memory allocateOldSpaceChunkOfBytes: size)
].
"Allocate the rest of the memory so it does not bother our test."
memory allocateOldSpaceChunkOfBytes: memory totalFreeListBytes.
sizesInBreadthFirstOrder := #( 560 528 592 512 544 576 608).
sizesInBreadthFirstOrder do: [ :e |
memory freeChunkWithBytes: e at: (chunkAddresses at: e) ].
parent := self freeTreeRootOop.
childNumber := 1.
self assert: (memory bytesInObject: parent) equals: (sizesInBreadthFirstOrder at: childNumber).
self assert: (memory bytesInObject: (self smallerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2).
self assert: (memory bytesInObject: (self largerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2 + 1).
parent := self smallerNodeOf: self freeTreeRootOop.
childNumber := 2.
self assert: (memory bytesInObject: (self smallerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2).
self assert: (memory bytesInObject: (self largerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2 + 1).
parent := self largerNodeOf: self freeTreeRootOop.
childNumber := 3.
self assert: (memory bytesInObject: (self smallerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2).
self assert: (memory bytesInObject: (self largerNodeOf: parent)) equals: (sizesInBreadthFirstOrder at: childNumber * 2 + 1).
]
{ #category : #accessing }
VMSpurTreeAllocationStrategyForSmallTreeTest >> sizeOfChildInBreadthFirstOrder: anInteger [
^ sizesInBreadthFirstOrder at: anInteger
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test01AllocateExactTreeRootWithChildrenShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1).
self assert: (memory bytesInObject: self freeTreeRootOop) equals: (self sizeOfChildInBreadthFirstOrder: 2)
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test01AllocateSmallerThanLiliputianDiffFromTreeRootWithChildrenShouldUseLargerThanRoot [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 8.
"Reuse node of 1152 bytes"
self assert: (self smallerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test02AllocateExactTreeRootWithChildrenShouldReInsertSmallerLargerChildFromRoot [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1).
self assert: (memory bytesInObject: (self largerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 5)
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test02AllocateSmallerThanLiliputianDiffFromTreeRootWithChildrenShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 1) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1152 bytes to allocate 1112, leaving 40 left over bytes in free tree"
self denyFreeListEmpty: (self freeListForSize: 1152 - allocatedSize).
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test03AllocateExactTreeRootWithChildrenShouldReplaceSmallerChildWithSmallerSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1).
self assert: (memory bytesInObject: (self smallerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 4)
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test03AllocateSmallerThanLiliputianDiffFromTreeRootWithChildrenShouldUseLargerThanRootAddress [
| desiredAddress allocatedAddress |
desiredAddress := self addressOfChunkOf: (self sizeOfChildInBreadthFirstOrder: 6).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 8.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test04AllocateExactSmallerTreeNodeShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2).
self assert: (memory bytesInObject: (self smallerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 4)
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test04AllocateSmallerThanLiliputianDiffFromSmallerWithChildrenShouldUseLargestSmallerThanRoot [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2) - 8.
"Reuse node of 1088 bytes"
self assert: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test05AllocateExactSmallerTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self smallerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test05AllocateSmallerThanLiliputianDiffFromSmallerWithChildrenShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 2) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1088 bytes to allocate 1048, leaving 40 left over bytes in free tree"
self denyFreeListEmpty: (self freeListForSize: 1088 - allocatedSize)
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test06AllocateExactBiggerTreeNodeShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3).
self assert: (memory bytesInObject: (self largerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 6)
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test06AllocateSmallerThanLiliputianDiffFromSmallerWithChildrenShouldUseSmallerThanRootAddress [
| desiredAddress allocatedAddress |
desiredAddress := self addressOfChunkOf: (self sizeOfChildInBreadthFirstOrder: 5).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2) - 8.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test07AllocateExactBiggerTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test07AllocateSmallerThanLiliputianDiffFromSmallerLeafShouldUseIntermediateNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4) - 8.
"Reuse node 2, move the node 4 up, and reinsert the node 5"
self assert: (memory bytesInObject: (self smallerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 4).
self assert: (memory bytesInObject: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop))) equals: (self sizeOfChildInBreadthFirstOrder: 5)
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test08AllocateExactSmallerOfSmallerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4).
self assert: (self smallerNodeOf: (self smallerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test08AllocateSmallerThanLiliputianDiffFromSmallerLeafShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 4) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1056 bytes to allocate 1016, leaving 40 left over bytes in free tree"
self denyFreeListEmpty: (self freeListForSize: 1056 - allocatedSize).
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test09AllocateExactSmallerOfSmallerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := self smallerNodeOf: (self smallerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test09AllocateSecondSmallerThanLiliputianDiffFromSmallerLeafShouldUseRootNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5) - 8.
"Reuse node 1, move the node of 2 up as root, and reinsert the node 3 on the right"
self assert: (memory bytesInObject: self freeTreeRootOop) equals: (self sizeOfChildInBreadthFirstOrder: 2).
self assert: (memory bytesInObject: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop))) equals: (self sizeOfChildInBreadthFirstOrder: 3)
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test10AllocateExactLargerOfSmallerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5).
self assert: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test10AllocateSecondSmallerThanLiliputianDiffFromSmallerLeafShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 5) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1120 bytes to allocate 1080, leaving 40 left over bytes in free tree"
self denyFreeListEmpty: (self freeListForSize: 1120 - allocatedSize).
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test11AllocateExactLargerOfSmallerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test11AllocateSmallerThanLiliputianDiffFromLargerWithChildrenShouldUseLargestLeafNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3) - 8.
"Reuse node of 1216 bytes to allocate 1176, removing it from the tree"
self assert: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test12AllocateExactSmallerOfLargerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6).
self assert: (self smallerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test12AllocateSmallerThanLiliputianDiffFromLargerWithChildrenShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 3) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1216 bytes to allocate 1176, leaving 40 left over bytes in free tree"
self denyFreeListEmpty: (self freeListForSize: 1216 - allocatedSize).
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test13AllocateExactSmallerOfLargerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self smallerNodeOf: (self largerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test13AllocateSmallerThanLiliputianDiffFromSmallerLeafInLargerSideShouldUseIntermediateLargerNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6) - 8.
"Reuse node 3, moving up the child 6"
self assert: (memory bytesInObject: (self largerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 6)
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test14AllocateExactLargerOfLargerLeafTreeNodeShouldRemoveChildNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7).
self assert: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test14AllocateSmallerThanLiliputianDiffFromSmallerLeafInLargerSideShouldInsertLeftOverInFreeList [
| allocatedSize |
allocatedSize := (self sizeOfChildInBreadthFirstOrder: 6) - 8.
memory allocateOldSpaceChunkOfBytes: allocatedSize.
"Reuse node of 1184 bytes to allocate 1144, moving up the child of 1152"
self denyFreeListEmpty: (self freeListForSize: 1184 - allocatedSize).
]
{ #category : #'tests-09-exact-fit' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test15AllocateExactLargerOfLargerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7).
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-11-bestfit-smaller-than-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForSmallTreeTest >> test15AllocateSmallerThanLiliputianDiffFromLargestLeaShouldFindNoMemory [
self assert: (memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7) - 8) equals: nil
]