-
Notifications
You must be signed in to change notification settings - Fork 65
/
VMSpurTreeAllocationStrategyForLargeTreeTest.class.st
240 lines (164 loc) · 10.3 KB
/
VMSpurTreeAllocationStrategyForLargeTreeTest.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
Class {
#name : #VMSpurTreeAllocationStrategyForLargeTreeTest,
#superclass : #VMSpurTreeAllocationStrategyForSmallTreeTest,
#category : #'VMMakerTests-MemoryTests'
}
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest class >> shouldInheritSelectors [
^ true
]
{ #category : #running }
VMSpurTreeAllocationStrategyForLargeTreeTest >> setUpTree [
" 1120
/ \
1056 1184
/ \ / \
1024 1088 1152 1216
"
| parent childNumber |
chunkAddresses := Dictionary new.
1024 to: 1216 by: 32 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 := #( 1120 1056 1184 1024 1088 1152 1216 ).
sizesInBreadthFirstOrder do: [ :e |
memory freeChunkWithBytes: e at: (chunkAddresses at: e) ].
parent := self freeTreeRootOop.
"check that the structure of the tree is as expected"
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 : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test01AllocateBestFitTreeRootWithChildrenShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 16.
self assert: (memory bytesInObject: self freeTreeRootOop) equals: (self sizeOfChildInBreadthFirstOrder: 2)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test02AllocateBestFitTreeRootWithChildrenShouldReInsertSmallerLargerChildFromRoot [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 16.
self assert: (memory bytesInObject: (self largerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 5)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test03AllocateBestFitTreeRootWithChildrenShouldReplaceSmallerChildWithSmallerSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 16.
self assert: (memory bytesInObject: (self smallerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 4)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test04AllocateBestFitTreeRootWithChildrenShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 1) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test05AllocateBestFitSmallerTreeNodeShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2) - 16.
self assert: (memory bytesInObject: (self smallerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 4)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test06AllocateBestFitSmallerTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self smallerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test07AllocateBestFitSmallerTreeNodeShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 2) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test15AllocateBestFitBiggerTreeNodeShouldReplaceNodeWithSmaller [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3) - 16.
self assert: (memory bytesInObject: (self largerNodeOf: self freeTreeRootOop)) equals: (self sizeOfChildInBreadthFirstOrder: 6)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test16AllocateBestFitBiggerTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test17AllocateBestFitLargerTreeNodeShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 3) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test20AllocateBestFitSmallerOfSmallerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4) - 16.
self assert: (self smallerNodeOf: (self smallerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test21AllocateBestFitSmallerOfSmallerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := self smallerNodeOf: (self smallerNodeOf: self freeTreeRootOop).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test22AllocateBestFitSmallerOfSmallerLeafTreeNodeShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 4) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test25AllocateBestFitLargerOfSmallerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5) - 16.
self assert: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test26AllocateBestFitLargerOfSmallerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: (self smallerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test27AllocateBestFitLargerOfSmallerLeafTreeNodeShouldShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 5) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test30AllocateBestFitSmallerOfLargerLeafTreeNodeShouldRemoveNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6) - 16.
self assert: (self smallerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test31AllocateBestFitSmallerOfLargerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self smallerNodeOf: (self largerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test32AllocateBestFitSmallerOfLargerLeafTreeNodeShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 6) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test35AllocateBestFitLargerOfLargerLeafTreeNodeShouldRemoveChildNode [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7) - 16.
self assert: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop)) equals: 0
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test36AllocateBestFitLargerOfLargerLeafTreeNodeShouldReuseNodeAddress [
| desiredAddress allocatedAddress |
desiredAddress := memory startOfObject: (self largerNodeOf: (self largerNodeOf: self freeTreeRootOop)).
allocatedAddress := memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7) - 16.
self assert: allocatedAddress equals: desiredAddress
]
{ #category : #'tests-10-bestfit-liliputian-leftovers' }
VMSpurTreeAllocationStrategyForLargeTreeTest >> test37AllocateBestFitLargerOfLargerLeafTreeNodeShouldInsertLiliputianInFreeList [
memory allocateOldSpaceChunkOfBytes: (self sizeOfChildInBreadthFirstOrder: 7) - 16.
self denyFreeListEmpty: (self freeListForSize: 16)
]