Vm-dev October 2013

vm-dev@lists.squeakfoundation.org

30 participants
145 discussions

primitiveDisplayString is not always advancing destX
by Nicolas Cellier 29 Oct '13

29 Oct '13

I wonder why there is not a: "store destX back" interpreterProxy storeInteger: BBDestXIndex ofObject: bitBltOop withValue: destX. at the end of primitiveDisplayString (that is, only in case of success). That would properly advance the destX, and would avoid the guard in StrikeFont>>displayString:on:from:to:at:kern: Or did I miss something?

2 3

VM Maker: VMMaker.oscog-eem.481.mcz
by commits＠source.squeak.org 29 Oct '13

29 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.481.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.481 Author: eem Time: 29 October 2013, 12:43:06.4 pm UUID: aa1f9c6c-b888-4ef6-9ca2-8f765256b7f9 Ancestors: VMMaker.oscog-eem.480 Call a misfit a misfit. Just because it doesn't fit in doesn't mean it's a failure. =============== Diff against VMMaker.oscog-eem.480 =============== Item was changed: ----- Method: SpurMemoryManager>>exactFitCompact (in category 'compaction') ----- exactFitCompact "Compact all of memory above firstFreeChunk using exact-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects. Note that we don't actually move; we merely copy and forward. Eliminating forwarders will be done in a final pass. Leave the objects that don't fit exactly, and hence aren't moved, in highestObjects." <returnTypeC: #void> <inline: false> + | misfits first | + <var: #misfits type: #usqInt> - | failures first | - <var: #failures type: #usqInt> totalFreeOldSpace = 0 ifTrue: [^0]. + misfits := highestObjects last + self wordSize. - failures := highestObjects last + self wordSize. [statCompactPassCount := statCompactPassCount + 1. + highestObjects from: misfits - self wordSize reverseDo: - highestObjects from: failures - self wordSize reverseDo: [:o| | b | o < firstFreeChunk ifTrue: + [misfits = (highestObjects last + self wordSize) - [failures = (highestObjects last + self wordSize) ifTrue: [highestObjects resetAsEmpty] + ifFalse: [highestObjects first: misfits]. - ifFalse: [highestObjects first: failures]. ^self]. ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. (self allocateOldSpaceChunkOfExactlyBytes: b suchThat: [:f| f < o]) ifNil: + [misfits := misfits - self wordSize. + misfits < highestObjects start ifTrue: + [misfits := highestObjects limit]. + self longAt: misfits put: o] - [failures := failures - self wordSize. - failures < highestObjects start ifTrue: - [failures := highestObjects limit]. - self longAt: failures put: o] ifNotNil: [:f| self copyAndForward: o withBytes: b toFreeChunk: f]]]. + "now highestObjects contains only misfits, if any, from misfits to last. + set first to first failure and refill buffer. next cycle will add more misfits. - "now highestObjects contains only failures, if any, from failures to last. - set first to first failure and refill buffer. next cycle will add more failures. give up on exact-fit when half of the highest objects fail to fit." first := self longAt: highestObjects first. first > firstFreeChunk ifTrue: [| highestObjBytes failureBytes savedLimit | highestObjBytes := highestObjects limit - highestObjects start. + failureBytes := highestObjects last >= misfits + ifTrue: [highestObjects last - misfits] + ifFalse: [highestObjBytes - (misfits - highestObjects last)]. - failureBytes := highestObjects last >= failures - ifTrue: [highestObjects last - failures] - ifFalse: [highestObjBytes - (failures - highestObjects last)]. failureBytes >= (highestObjBytes // 2) ifTrue: + [highestObjects first: misfits. - [highestObjects first: failures. ^self]. + savedLimit := self moveMisfitsToTopOfHighestObjects: misfits. - savedLimit := self moveFailuresToTopOfHighestObjects: failures. self fillHighestObjectsWithMovableObjectsFrom: firstFreeChunk upTo: first. + misfits := self moveMisfitsInHighestObjectsBack: savedLimit]] repeat! - failures := self moveFailuresInHighestObjectsBack: savedLimit]] repeat! Item was removed: - ----- Method: SpurMemoryManager>>moveFailuresInHighestObjectsBack: (in category 'compaction') ----- - moveFailuresInHighestObjectsBack: savedLimit - "After refilling highestObjects move any failures back to being - adjacent with the new objects, reset the space's limit and - answer the pointer to the lowest failure to resume the scan." - - | newFailuresPosition | - savedLimit = highestObjects limit ifTrue: - [^highestObjects last]. - "simple; we didnt fill all the way; just move failures down." - (highestObjects first = highestObjects start - and: [highestObjects last < highestObjects limit]) ifTrue: - [newFailuresPosition := highestObjects limit. - self mem: newFailuresPosition - mo: highestObjects last + self wordSize - ve: savedLimit - newFailuresPosition. - highestObjects limit: savedLimit. - ^newFailuresPosition]. - "tricky to do unless we have last - start's worth of free space. - we *don't* want to rotate lots and lots of objects. We could push - failures onto the mark stack, if it is big enough. - limit: | failures hi <-> lo | lowest candidates | highest candidates | : start - ^ last" - self shouldBeImplemented. - ^newFailuresPosition! Item was removed: - ----- Method: SpurMemoryManager>>moveFailuresToTopOfHighestObjects: (in category 'compaction') ----- - moveFailuresToTopOfHighestObjects: failures - "After a cycle of exact-fit compaction highestObjects may contain some - number of mobile objects that fail to fit, and more objects may exist to - move. Move existing failures to top of highestObjects and temporarily - shrink highestObjects to refill it without overwriting failues. Answer the - old limit. moveFailuresInHighestObjectsBack: will undo the change." - - | oldLimit bytesToMove | - oldLimit := highestObjects limit. - failures = (highestObjects last + self wordSize) ifTrue: - [highestObjects resetAsEmpty. - ^oldLimit]. - failures <= highestObjects last ifTrue: - [bytesToMove := highestObjects last + self wordSize - failures. - self mem: highestObjects limit - bytesToMove - mo: failures - ve: bytesToMove. - highestObjects limit: failures - self wordSize. - ^oldLimit]. - "failures wrapped; move in two stages to preserve ordering" - bytesToMove := highestObjects last - highestObjects start. - self mem: failures - bytesToMove - mo: failures - ve: oldLimit - failures. - highestObjects limit: failures - bytesToMove. - self mem: oldLimit - bytesToMove - mo: highestObjects start - ve: bytesToMove. - ^oldLimit! Item was added: + ----- Method: SpurMemoryManager>>moveMisfitsInHighestObjectsBack: (in category 'compaction') ----- + moveMisfitsInHighestObjectsBack: savedLimit + "After refilling highestObjects move any misfits back to being + adjacent with the new objects, reset the space's limit and + answer the pointer to the lowest failure to resume the scan." + + | newMisfitsPosition | + savedLimit = highestObjects limit ifTrue: + [^highestObjects last]. + "simple; we didnt fill all the way; just move misfits down." + (highestObjects first = highestObjects start + and: [highestObjects last < highestObjects limit]) ifTrue: + [newMisfitsPosition := highestObjects limit. + self mem: newMisfitsPosition + mo: highestObjects last + self wordSize + ve: savedLimit - newMisfitsPosition. + highestObjects limit: savedLimit. + ^newMisfitsPosition]. + "tricky to do unless we have last - start's worth of free space. + we *don't* want to rotate lots and lots of objects. We could push + misfits onto the mark stack, if it is big enough. + limit: | misfits hi <-> lo | lowest candidates | highest candidates | : start + ^ last" + self shouldBeImplemented. + ^newMisfitsPosition! Item was added: + ----- Method: SpurMemoryManager>>moveMisfitsToTopOfHighestObjects: (in category 'compaction') ----- + moveMisfitsToTopOfHighestObjects: misfits + "After a cycle of exact-fit compaction highestObjects may contain some + number of mobile objects that fail to fit, and more objects may exist to + move. Move existing misfits to top of highestObjects and temporarily + shrink highestObjects to refill it without overwriting misfits. Answer the + old limit. moveMisfitsInHighestObjectsBack: will undo the change." + + | oldLimit bytesToMove | + oldLimit := highestObjects limit. + misfits = (highestObjects last + self wordSize) ifTrue: + [highestObjects resetAsEmpty. + ^oldLimit]. + misfits <= highestObjects last ifTrue: + [bytesToMove := highestObjects last + self wordSize - misfits. + self mem: highestObjects limit - bytesToMove + mo: misfits + ve: bytesToMove. + highestObjects limit: misfits - self wordSize. + ^oldLimit]. + "misfits wrapped; move in two stages to preserve ordering" + bytesToMove := highestObjects last - highestObjects start. + self mem: misfits - bytesToMove + mo: misfits + ve: oldLimit - misfits. + highestObjects limit: misfits - bytesToMove. + self mem: oldLimit - bytesToMove + mo: highestObjects start + ve: bytesToMove. + ^oldLimit!

1 0

VM Maker: VMMaker.oscog-eem.480.mcz
by commits＠source.squeak.org 29 Oct '13

29 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.480.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.480 Author: eem Time: 29 October 2013, 12:32:54.235 pm UUID: 4266bc01-d2d8-498a-875f-cb14d99cf5c1 Ancestors: VMMaker.oscog-eem.479 Fix freeListsMask maintennance in allocateOldSpaceChunkOfExactlyBytes:[suchThat:]. Fix determining new object address when copying and forwarding in exact/bestFitCompact. Refactor postBecomeScanClassTable so it can be used by the compaction phase if required. =============== Diff against VMMaker.oscog-eem.479 =============== Item was added: + ----- Method: Spur32BitMMLESimulator>>globalGarbageCollect (in category 'gc - global') ----- + globalGarbageCollect + self halt. + ^super globalGarbageCollect! Item was changed: ----- Method: SpurMemoryManager>>allocateOldSpaceChunkOfExactlyBytes: (in category 'free space') ----- allocateOldSpaceChunkOfExactlyBytes: chunkBytes "Answer a chunk of oldSpace from the free lists, if one of this size is available, otherwise answer nil. N.B. the chunk is simply a pointer, it has no valid header. The caller *must* fill in the header correctly." + | index node nodeBytes child | - | initialIndex node nodeBytes child | "for debugging:" "totalFreeOldSpace := self totalFreeListBytes" + index := chunkBytes / self allocationUnit. + index < self numFreeLists ifTrue: + [(freeListsMask anyMask: 1 << index) ifTrue: + [(node := freeLists at: index) ~= 0 ifTrue: - initialIndex := chunkBytes / self allocationUnit. - initialIndex < self numFreeLists ifTrue: - [1 << initialIndex <= freeListsMask ifTrue: - [(node := freeLists at: initialIndex) ~= 0 ifTrue: [self assert: node = (self startOfObject: node). self assert: (self isValidFreeObject: node). totalFreeOldSpace := totalFreeOldSpace - chunkBytes. + ^self unlinkFreeChunk: node atIndex: index]. + freeListsMask := freeListsMask - (1 << index)]. - ^self unlinkFreeChunk: node atIndex: initialIndex]. - freeListsMask := freeListsMask - (1 << initialIndex)]. ^nil]. "Large chunk. Search the large chunk list. Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks. When the search ends parent should hold the first chunk of the same size as chunkBytes, or 0 if none." node := 0. child := freeLists at: 0. [child ~= 0] whileTrue: [| childBytes | self assert: (self isValidFreeObject: child). childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; try to remove from list at node." [node := self fetchPointer: self freeChunkNextIndex ofFreeChunk: child. node ~= 0 ifTrue: [self assert: (self isValidFreeObject: node). self storePointer: self freeChunkNextIndex ofFreeChunk: child withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node). totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node]. node := child. nodeBytes := childBytes. child := 0] "break out of loop to remove interior node" ifFalse: [childBytes < chunkBytes ifTrue: "walk down the tree" [child := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: child] ifFalse: [nodeBytes := childBytes. child := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: child]]]. "if no chunk, there was no exact fit" node = 0 ifTrue: [^nil]. "self printFreeChunk: parent" self assert: nodeBytes = chunkBytes. self assert: (self bytesInObject: node) = chunkBytes. "can't be a list; would have removed and returned it above." self assert: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node) = 0. "no list; remove the interior node" self unlinkSolitaryFreeTreeNode: node. totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node! Item was changed: ----- Method: SpurMemoryManager>>allocateOldSpaceChunkOfExactlyBytes:suchThat: (in category 'free space') ----- allocateOldSpaceChunkOfExactlyBytes: chunkBytes suchThat: acceptanceBlock "Answer a chunk of oldSpace from the free lists that satisfies acceptanceBlock, if one of this size is available, otherwise answer nil. N.B. the chunk is simply a pointer, it has no valid header. The caller *must* fill in the header correctly." | index node next prev child childBytes | <inline: true> "must inline for acceptanceBlock" "for debugging:" "totalFreeOldSpace := self totalFreeListBytes" index := chunkBytes / self allocationUnit. index < self numFreeLists ifTrue: + [(freeListsMask anyMask: 1 << index) ifTrue: - [1 << index <= freeListsMask ifTrue: [(node := freeLists at: index) = 0 ifTrue: [freeListsMask := freeListsMask - (1 << index)] ifFalse: [prev := 0. [node ~= 0] whileTrue: [self assert: node = (self startOfObject: node). self assert: (self isValidFreeObject: node). next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. (acceptanceBlock value: node) ifTrue: [prev = 0 ifTrue: [freeLists at: index put: next] ifFalse: [self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: next]. totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^node]. node := next]]]. ^nil]. "Large chunk. Search the large chunk list. Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks. When the search ends parent should hold the first chunk of the same size as chunkBytes, or 0 if none." node := 0. child := freeLists at: 0. [child ~= 0] whileTrue: [self assert: (self isValidFreeObject: child). childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; try to remove from list at node first." [node := child. [prev := node. node := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. node ~= 0] whileTrue: [(acceptanceBlock value: node) ifTrue: [self assert: (self isValidFreeObject: node). self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node). totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node]]. node := child. child := 0] "break out of loop to remove interior node" ifFalse: "no size match; walk down the tree" [child := self fetchPointer: (childBytes < chunkBytes ifTrue: [self freeChunkLargerIndex] ifFalse: [self freeChunkSmallerIndex]) ofFreeChunk: child]]. "if no chunk, there was no exact fit" (node ~= 0 and: [acceptanceBlock value: node]) ifFalse: [^nil]. "self printFreeChunk: parent" self assert: (self bytesInObject: node) = chunkBytes. next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. next = 0 ifTrue: "no list; remove the interior node" [self unlinkSolitaryFreeTreeNode: node] ifFalse: "list; replace node with it" [self inFreeTreeReplace: node with: next]. totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node! Item was changed: ----- Method: SpurMemoryManager>>bestFitCompact (in category 'compaction') ----- bestFitCompact "Compact all of memory using best-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects." <returnTypeC: #void> <inline: false> | freePriorToExactFit | self checkFreeSpace. freePriorToExactFit := totalFreeOldSpace. self exactFitCompact. self checkFreeSpace. highestObjects isEmpty ifTrue: [^self]. "either no high objects, or no misfits." statCompactPassCount := statCompactPassCount + 1. highestObjects reverseDo: [:o| | b | self assert: ((self isForwarded: o) or: [self isPinned: o]) not. b := self bytesInObject: o. + (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: + [:f| self copyAndForward: o withBytes: b toFreeChunk: f]]. - (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: - [:f| - self mem: f - cp: o - y: ((self hasOverflowHeader: o) - ifTrue: [b - self baseHeaderSize] - ifFalse: [b]). - (self isRemembered: o) ifTrue: - [scavenger remember: f]. - self forward: o to: f]]. self checkFreeSpace. + self flag: 'this should perhaps be a loop, recharging highestObjects as per exactFitCompact, but for now we assume the number of misfits not in highestObjects is very small'. self allOldSpaceObjectsFrom: firstFreeChunk do: [:o| | b | ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. + (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: + [:f| self copyAndForward: o withBytes: b toFreeChunk: f]]]. - (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: - [:f| - self mem: f - cp: o - y: ((self hasOverflowHeader: o) - ifTrue: [b - self baseHeaderSize] - ifFalse: [b]). - (self isRemembered: o) ifTrue: - [scavenger remember: f]. - self forward: o to: f]]]. self checkFreeSpace. self touch: freePriorToExactFit! Item was added: + ----- Method: SpurMemoryManager>>copyAndForward:withBytes:toFreeChunk: (in category 'compaction') ----- + copyAndForward: objOop withBytes: bytes toFreeChunk: freeChunk + "Copy and forward objOop to freeChunk, the inner operation in + exact and best fit compact." + + <inline: true> + | startOfObj freeObj | + startOfObj := self startOfObject: objOop. + self mem: freeChunk cp: startOfObj y: bytes. + freeObj := freeChunk + (objOop - startOfObj). + "wait until the next scavenge to unremember o" + (self isRemembered: objOop) ifTrue: + [scavenger remember: freeObj]. + self forward: objOop to: freeObj! Item was changed: ----- Method: SpurMemoryManager>>exactFitCompact (in category 'compaction') ----- exactFitCompact "Compact all of memory above firstFreeChunk using exact-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects. Note that we don't actually move; we merely copy and forward. Eliminating forwarders will be done in a final pass. Leave the objects that don't fit exactly, and hence aren't moved, in highestObjects." <returnTypeC: #void> <inline: false> | failures first | <var: #failures type: #usqInt> totalFreeOldSpace = 0 ifTrue: [^0]. failures := highestObjects last + self wordSize. [statCompactPassCount := statCompactPassCount + 1. highestObjects from: failures - self wordSize reverseDo: [:o| | b | o < firstFreeChunk ifTrue: [failures = (highestObjects last + self wordSize) ifTrue: [highestObjects resetAsEmpty] ifFalse: [highestObjects first: failures]. ^self]. ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. (self allocateOldSpaceChunkOfExactlyBytes: b suchThat: [:f| f < o]) ifNil: [failures := failures - self wordSize. failures < highestObjects start ifTrue: [failures := highestObjects limit]. self longAt: failures put: o] ifNotNil: + [:f| self copyAndForward: o withBytes: b toFreeChunk: f]]]. - [:f| - self mem: f - cp: o - y: ((self hasOverflowHeader: o) - ifTrue: [b - self baseHeaderSize] - ifFalse: [b]). - "wait until the next scavenge to unremember o" - (self isRemembered: o) ifTrue: - [scavenger remember: f]. - self forward: o to: f]]]. "now highestObjects contains only failures, if any, from failures to last. set first to first failure and refill buffer. next cycle will add more failures. give up on exact-fit when half of the highest objects fail to fit." first := self longAt: highestObjects first. first > firstFreeChunk ifTrue: [| highestObjBytes failureBytes savedLimit | highestObjBytes := highestObjects limit - highestObjects start. failureBytes := highestObjects last >= failures ifTrue: [highestObjects last - failures] ifFalse: [highestObjBytes - (failures - highestObjects last)]. failureBytes >= (highestObjBytes // 2) ifTrue: [highestObjects first: failures. ^self]. savedLimit := self moveFailuresToTopOfHighestObjects: failures. self fillHighestObjectsWithMovableObjectsFrom: firstFreeChunk upTo: first. failures := self moveFailuresInHighestObjectsBack: savedLimit]] repeat! Item was added: + ----- Method: SpurMemoryManager>>postBecomeOrCompactScanClassTable: (in category 'become implementation') ----- + postBecomeOrCompactScanClassTable: effectsFlags + "Scan the class table post-become (iff a pointer object or compiled method was becommed), + or post-compact. + Note that one-way become can cause duplications in the class table. + When can these be eliminated? We use the classTableBitmap to mark classTable entries + (not the classes themselves, since marking a class doesn't help in knowing if its index is used). + On image load, and during incrememtal scan-mark and full GC, classIndices are marked. + We can somehow avoid following classes from the classTable until after this mark phase." + + self assert: self validClassTableRootPages. + + (effectsFlags anyMask: BecamePointerObjectFlag+BecameCompiledMethodFlag) ifFalse: [^self]. + + 0 to: numClassTablePages - 1 do: + [:i| | page | + page := self fetchPointer: i ofObject: hiddenRootsObj. + 0 to: (self numSlotsOf: page) - 1 do: + [:j| | classOrNil | + classOrNil := self fetchPointer: j ofObject: page. + classOrNil ~= nilObj ifTrue: + [(self isForwarded: classOrNil) ifTrue: + [classOrNil := self followForwarded: classOrNil. + self storePointer: j ofObject: page withValue: classOrNil]. + self scanClassPostBecome: classOrNil effects: effectsFlags]]]! Item was changed: ----- Method: SpurMemoryManager>>postBecomeScanClassTable (in category 'become implementation') ----- postBecomeScanClassTable "Scan the class table post-become (iff a pointer object or compiled method was becommed). Note that one-way become can cause duplications in the class table. When can these be eliminated? We use the classtableBitmap to mark classTable entries (not the classes themselves, since marking a class doesn't help in knowing if its index is used). On image load, and during incrememtal scan-mark and full GC, classIndices are marked. We can somehow avoid following classes from the classTable until after this mark phase." self assert: self validClassTableRootPages. (becomeEffectsFlags anyMask: BecamePointerObjectFlag+BecameCompiledMethodFlag) ifFalse: [^self]. + self postBecomeOrCompactScanClassTable: becomeEffectsFlags! - 0 to: numClassTablePages - 1 do: - [:i| | page | - page := self fetchPointer: i ofObject: hiddenRootsObj. - 0 to: (self numSlotsOf: page) - 1 do: - [:j| | classOrNil | - classOrNil := self fetchPointer: j ofObject: page. - classOrNil ~= nilObj ifTrue: - [(self isForwarded: classOrNil) ifTrue: - [classOrNil := self followForwarded: classOrNil. - self storePointer: j ofObject: page withValue: classOrNil]. - self scanClassPostBecome: classOrNil effects: becomeEffectsFlags]]]! Item was added: + ----- Method: SpurMemoryManager>>postCompactScanClassTable (in category 'become implementation') ----- + postCompactScanClassTable + "Scan the class table post-compact. Ensure all pages and + all classes are not forwarded." + + 0 to: numClassTablePages - 1 do: + [:i| | page | + page := self fetchPointer: i ofObject: hiddenRootsObj. + (self isForwarded: page) ifTrue: "this check is for eliminateAndFreeForwarders" + [page := self followForwarded: page. + self storePointer: i ofObject: hiddenRootsObj withValue: page]]. + self assert: self validClassTableRootPages. + self postBecomeOrCompactScanClassTable: BecamePointerObjectFlag!

1 0

[commit][2794] Update generated sources using a Squeak4.4-12327 image.
by commits＠squeakvm.org 27 Oct '13

27 Oct '13

Revision: 2794 Author: lewis Date: 2013-10-27 08:40:04 -0700 (Sun, 27 Oct 2013) Log Message: ----------- Update generated sources using a Squeak4.4-12327 image. ADPCMCodecPlugin is affected by Squeak image changes in ADPCMCodec. Modified Paths: -------------- trunk/src/ckformat.c trunk/src/plugins/ADPCMCodecPlugin/ADPCMCodecPlugin.c trunk/src/plugins/AioPlugin/AioPlugin.c trunk/src/plugins/AsynchFilePlugin/AsynchFilePlugin.c trunk/src/plugins/B2DPlugin/B2DPlugin.c trunk/src/plugins/B3DAcceleratorPlugin/B3DAcceleratorPlugin.c trunk/src/plugins/BMPReadWriterPlugin/BMPReadWriterPlugin.c trunk/src/plugins/BitBltPlugin/BitBltPlugin.c trunk/src/plugins/CameraPlugin/CameraPlugin.c trunk/src/plugins/ClipboardExtendedPlugin/ClipboardExtendedPlugin.c trunk/src/plugins/CroquetPlugin/CroquetPlugin.c trunk/src/plugins/DBusPlugin/DBusPlugin.c trunk/src/plugins/DSAPrims/DSAPrims.c trunk/src/plugins/DropPlugin/DropPlugin.c trunk/src/plugins/FFTPlugin/FFTPlugin.c trunk/src/plugins/FT2Plugin/FT2Plugin.c trunk/src/plugins/FileCopyPlugin/FileCopyPlugin.c trunk/src/plugins/FilePlugin/FilePlugin.c trunk/src/plugins/FloatArrayPlugin/FloatArrayPlugin.c trunk/src/plugins/FloatMathPlugin/FloatMathPlugin.c trunk/src/plugins/GeniePlugin/GeniePlugin.c trunk/src/plugins/HostWindowPlugin/HostWindowPlugin.c trunk/src/plugins/JPEGReadWriter2Plugin/JPEGReadWriter2Plugin.c trunk/src/plugins/JPEGReaderPlugin/JPEGReaderPlugin.c trunk/src/plugins/JoystickTabletPlugin/JoystickTabletPlugin.c trunk/src/plugins/Klatt/Klatt.c trunk/src/plugins/LargeIntegers/LargeIntegers.c trunk/src/plugins/LocalePlugin/LocalePlugin.c trunk/src/plugins/MIDIPlugin/MIDIPlugin.c trunk/src/plugins/Matrix2x3Plugin/Matrix2x3Plugin.c trunk/src/plugins/MiscPrimitivePlugin/MiscPrimitivePlugin.c trunk/src/plugins/Mpeg3Plugin/Mpeg3Plugin.c trunk/src/plugins/RePlugin/RePlugin.c trunk/src/plugins/RomePlugin/RomePlugin.c trunk/src/plugins/ScratchPlugin/ScratchPlugin.c trunk/src/plugins/SecurityPlugin/SecurityPlugin.c trunk/src/plugins/SerialPlugin/SerialPlugin.c trunk/src/plugins/SocketPlugin/SocketPlugin.c trunk/src/plugins/SoundCodecPrims/SoundCodecPrims.c trunk/src/plugins/SoundGenerationPlugin/SoundGenerationPlugin.c trunk/src/plugins/SoundPlugin/SoundPlugin.c trunk/src/plugins/Squeak3D/Squeak3D.c trunk/src/plugins/SqueakFFIPrims/SqueakFFIPrims.c trunk/src/plugins/SqueakSSL/SqueakSSL.c trunk/src/plugins/StarSqueakPlugin/StarSqueakPlugin.c trunk/src/plugins/UUIDPlugin/UUIDPlugin.c trunk/src/plugins/UnicodePlugin/UnicodePlugin.c trunk/src/plugins/UnixOSProcessPlugin/UnixOSProcessPlugin.c trunk/src/plugins/WeDoPlugin/WeDoPlugin.c trunk/src/plugins/XDisplayControlPlugin/XDisplayControlPlugin.c trunk/src/plugins/ZipPlugin/ZipPlugin.c trunk/src/vm/interp.c trunk/src/vm/interp.h trunk/src/vm/sqNamedPrims.h Modified: trunk/src/ckformat.c =================================================================== --- trunk/src/ckformat.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/ckformat.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -5,7 +5,7 @@ /* Usage: ckformat imageFileName */ /* --- DO NOT EDIT THIS FILE --- */ -/* --- Automatically generated from class ImageFormat 2013-05-08T08:26:54.8-05:00--- */ +/* --- Automatically generated from class ImageFormat 2013-10-27T11:14:02.135+01:00--- */ /* --- Source code is in package ImageFormat in the VMMaker repository --- */ /* --- DO NOT EDIT THIS FILE --- */ @@ -120,6 +120,34 @@ exit(0); } } + { + unsigned char b_6521_13[4]= { 0, 0, 25, 121}; + if (strncmp(buf, b_6521_13, 4) == 0) { + printf("%d\n", 6521); + exit(0); + } + } + { + unsigned char b_6521_14[4]= { 121, 25, 0, 0}; + if (strncmp(buf, b_6521_14, 4) == 0) { + printf("%d\n", 6521); + exit(0); + } + } + { + unsigned char b_68019_15[8]= { 0, 0, 0, 0, 0, 1, 9, 179}; + if (strncmp(buf, b_68019_15, 8) == 0) { + printf("%d\n", 68019); + exit(0); + } + } + { + unsigned char b_68019_16[8]= { 179, 9, 1, 0, 0, 0, 0, 0}; + if (strncmp(buf, b_68019_16, 8) == 0) { + printf("%d\n", 68019); + exit(0); + } + } if(fseek(f, 512L, SEEK_SET) != 0) { fprintf(stderr, "cannot go to pos %d in %s\n", 512, argv[1]); exit(3); @@ -212,6 +240,34 @@ exit(0); } } + { + unsigned char b_6521_13[4]= { 0, 0, 25, 121}; + if (strncmp(buf, b_6521_13, 4) == 0) { + printf("%d\n", 6521); + exit(0); + } + } + { + unsigned char b_6521_14[4]= { 121, 25, 0, 0}; + if (strncmp(buf, b_6521_14, 4) == 0) { + printf("%d\n", 6521); + exit(0); + } + } + { + unsigned char b_68019_15[8]= { 0, 0, 0, 0, 0, 1, 9, 179}; + if (strncmp(buf, b_68019_15, 8) == 0) { + printf("%d\n", 68019); + exit(0); + } + } + { + unsigned char b_68019_16[8]= { 179, 9, 1, 0, 0, 0, 0, 0}; + if (strncmp(buf, b_68019_16, 8) == 0) { + printf("%d\n", 68019); + exit(0); + } + } printf("0\n"); /* print an invalid format number */ exit (-1); /* not found, exit with error code */ } Modified: trunk/src/plugins/ADPCMCodecPlugin/ADPCMCodecPlugin.c =================================================================== --- trunk/src/plugins/ADPCMCodecPlugin/ADPCMCodecPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/ADPCMCodecPlugin/ADPCMCodecPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:37 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:37 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - ADPCMCodecPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + ADPCMCodecPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "ADPCMCodecPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "ADPCMCodecPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -70,9 +70,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "ADPCMCodecPlugin 8 May 2013 (i)" + "ADPCMCodecPlugin 27 October 2013 (i)" #else - "ADPCMCodecPlugin 8 May 2013 (e)" + "ADPCMCodecPlugin 27 October 2013 (e)" #endif ; @@ -170,15 +170,14 @@ remaining = 16; while(1) { shift = remaining - bitPosition; + result += ((shift < 0) ? ((usqInt) currentByte >> -shift) : ((usqInt) currentByte << shift)); if (shift > 0) { - result += currentByte << shift; remaining -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result += ((usqInt) currentByte) >> (0 - shift); bitPosition -= remaining; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); predicted = result; goto l1; } @@ -192,15 +191,14 @@ remaining1 = 6; while(1) { shift1 = remaining1 - bitPosition; + result1 += ((shift1 < 0) ? ((usqInt) currentByte >> -shift1) : ((usqInt) currentByte << shift1)); if (shift1 > 0) { - result1 += currentByte << shift1; remaining1 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result1 += ((usqInt) currentByte) >> (0 - shift1); bitPosition -= remaining1; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); index = result1; goto l2; } @@ -213,15 +211,14 @@ remaining2 = bitsPerSample; while(1) { shift2 = remaining2 - bitPosition; + result2 += ((shift2 < 0) ? ((usqInt) currentByte >> -shift2) : ((usqInt) currentByte << shift2)); if (shift2 > 0) { - result2 += currentByte << shift2; remaining2 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result2 += ((usqInt) currentByte) >> (0 - shift2); bitPosition -= remaining2; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); delta = result2; goto l3; } @@ -368,15 +365,14 @@ remaining = 16; while(1) { shift = remaining - bitPosition; + result += ((shift < 0) ? ((usqInt) currentByte >> -shift) : ((usqInt) currentByte << shift)); if (shift > 0) { - result += currentByte << shift; remaining -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result += ((usqInt) currentByte) >> (0 - shift); bitPosition -= remaining; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); predictedLeft = result; goto l1; } @@ -387,15 +383,14 @@ remaining1 = 6; while(1) { shift1 = remaining1 - bitPosition; + result1 += ((shift1 < 0) ? ((usqInt) currentByte >> -shift1) : ((usqInt) currentByte << shift1)); if (shift1 > 0) { - result1 += currentByte << shift1; remaining1 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result1 += ((usqInt) currentByte) >> (0 - shift1); bitPosition -= remaining1; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); indexLeft = result1; goto l2; } @@ -406,15 +401,14 @@ remaining2 = 16; while(1) { shift2 = remaining2 - bitPosition; + result2 += ((shift2 < 0) ? ((usqInt) currentByte >> -shift2) : ((usqInt) currentByte << shift2)); if (shift2 > 0) { - result2 += currentByte << shift2; remaining2 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result2 += ((usqInt) currentByte) >> (0 - shift2); bitPosition -= remaining2; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); predictedRight = result2; goto l3; } @@ -425,15 +419,14 @@ remaining3 = 6; while(1) { shift3 = remaining3 - bitPosition; + result3 += ((shift3 < 0) ? ((usqInt) currentByte >> -shift3) : ((usqInt) currentByte << shift3)); if (shift3 > 0) { - result3 += currentByte << shift3; remaining3 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result3 += ((usqInt) currentByte) >> (0 - shift3); bitPosition -= remaining3; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); indexRight = result3; goto l4; } @@ -453,15 +446,14 @@ remaining4 = bitsPerSample; while(1) { shift4 = remaining4 - bitPosition; + result4 += ((shift4 < 0) ? ((usqInt) currentByte >> -shift4) : ((usqInt) currentByte << shift4)); if (shift4 > 0) { - result4 += currentByte << shift4; remaining4 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result4 += ((usqInt) currentByte) >> (0 - shift4); bitPosition -= remaining4; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); deltaLeft = result4; goto l5; } @@ -472,15 +464,14 @@ remaining5 = bitsPerSample; while(1) { shift5 = remaining5 - bitPosition; + result5 += ((shift5 < 0) ? ((usqInt) currentByte >> -shift5) : ((usqInt) currentByte << shift5)); if (shift5 > 0) { - result5 += currentByte << shift5; remaining5 -= bitPosition; currentByte = encodedBytes[(byteIndex += 1)]; bitPosition = 8; } else { - result5 += ((usqInt) currentByte) >> (0 - shift5); bitPosition -= remaining5; - currentByte = currentByte & (((usqInt) 255) >> (8 - bitPosition)); + currentByte = currentByte & ((((bitPosition - 8) < 0) ? ((usqInt) 255 >> -(bitPosition - 8)) : ((usqInt) 255 << (bitPosition - 8)))); deltaRight = result5; goto l6; } @@ -638,15 +629,14 @@ while(1) { bitsAvailable = 8 - bitPosition; shift = bitsAvailable - bufBits; + currentByte += ((shift < 0) ? ((usqInt) buf >> -shift) : ((usqInt) buf << shift)); if (shift < 0) { - currentByte += ((usqInt) buf) >> (0 - shift); encodedBytes[(byteIndex += 1)] = currentByte; bitPosition = 0; currentByte = 0; - buf = buf & ((1 << (0 - shift)) - 1); + buf = buf & (((((0 - shift) < 0) ? ((usqInt) 1 >> -(0 - shift)) : ((usqInt) 1 << (0 - shift)))) - 1); bufBits -= bitsAvailable; } else { - currentByte += buf << shift; bitPosition += bufBits; goto l1; } @@ -674,15 +664,14 @@ while(1) { bitsAvailable1 = 8 - bitPosition; shift1 = bitsAvailable1 - bufBits1; + currentByte += ((shift1 < 0) ? ((usqInt) buf1 >> -shift1) : ((usqInt) buf1 << shift1)); if (shift1 < 0) { - currentByte += ((usqInt) buf1) >> (0 - shift1); encodedBytes[(byteIndex += 1)] = currentByte; bitPosition = 0; currentByte = 0; - buf1 = buf1 & ((1 << (0 - shift1)) - 1); + buf1 = buf1 & (((((0 - shift1) < 0) ? ((usqInt) 1 >> -(0 - shift1)) : ((usqInt) 1 << (0 - shift1)))) - 1); bufBits1 -= bitsAvailable1; } else { - currentByte += buf1 << shift1; bitPosition += bufBits1; goto l2; } @@ -744,15 +733,14 @@ while(1) { bitsAvailable2 = 8 - bitPosition; shift2 = bitsAvailable2 - bufBits2; + currentByte += ((shift2 < 0) ? ((usqInt) buf2 >> -shift2) : ((usqInt) buf2 << shift2)); if (shift2 < 0) { - currentByte += ((usqInt) buf2) >> (0 - shift2); encodedBytes[(byteIndex += 1)] = currentByte; bitPosition = 0; currentByte = 0; - buf2 = buf2 & ((1 << (0 - shift2)) - 1); + buf2 = buf2 & (((((0 - shift2) < 0) ? ((usqInt) 1 >> -(0 - shift2)) : ((usqInt) 1 << (0 - shift2)))) - 1); bufBits2 -= bitsAvailable2; } else { - currentByte += buf2 << shift2; bitPosition += bufBits2; goto l3; } Modified: trunk/src/plugins/AioPlugin/AioPlugin.c =================================================================== --- trunk/src/plugins/AioPlugin/AioPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/AioPlugin/AioPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,6 +1,6 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:53 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:14 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from UnixAioPlugin VMConstruction-Plugins-AioPlugin-eem.15 uuid: 0029df1c-3720-4b61-8579-4851417d24a7 */ @@ -88,9 +88,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "AioPlugin 8 May 2013 (i)" + "AioPlugin 27 October 2013 (i)" #else - "AioPlugin 8 May 2013 (e)" + "AioPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/AsynchFilePlugin/AsynchFilePlugin.c =================================================================== --- trunk/src/plugins/AsynchFilePlugin/AsynchFilePlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/AsynchFilePlugin/AsynchFilePlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:37 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:38 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - AsynchFilePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + AsynchFilePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "AsynchFilePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "AsynchFilePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -67,9 +67,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "AsynchFilePlugin 8 May 2013 (i)" + "AsynchFilePlugin 27 October 2013 (i)" #else - "AsynchFilePlugin 8 May 2013 (e)" + "AsynchFilePlugin 27 October 2013 (e)" #endif ; static void * sCOAFfn; Modified: trunk/src/plugins/B2DPlugin/B2DPlugin.c =================================================================== --- trunk/src/plugins/B2DPlugin/B2DPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/B2DPlugin/B2DPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:39 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:40 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - BalloonEnginePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + BalloonEnginePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "BalloonEnginePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "BalloonEnginePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -447,9 +447,9 @@ static void * loadBBFn; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "B2DPlugin 8 May 2013 (i)" + "B2DPlugin 27 October 2013 (i)" #else - "B2DPlugin 8 May 2013 (e)" + "B2DPlugin 27 October 2013 (e)" #endif ; static int* objBuffer; Modified: trunk/src/plugins/B3DAcceleratorPlugin/B3DAcceleratorPlugin.c =================================================================== --- trunk/src/plugins/B3DAcceleratorPlugin/B3DAcceleratorPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/B3DAcceleratorPlugin/B3DAcceleratorPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:46 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:51 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - B3DAcceleratorPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + B3DAcceleratorPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "B3DAcceleratorPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "B3DAcceleratorPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -107,9 +107,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "B3DAcceleratorPlugin 8 May 2013 (i)" + "B3DAcceleratorPlugin 27 October 2013 (i)" #else - "B3DAcceleratorPlugin 8 May 2013 (e)" + "B3DAcceleratorPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/BMPReadWriterPlugin/BMPReadWriterPlugin.c =================================================================== --- trunk/src/plugins/BMPReadWriterPlugin/BMPReadWriterPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/BMPReadWriterPlugin/BMPReadWriterPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:37 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:38 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - BMPReadWriterPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + BMPReadWriterPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "BMPReadWriterPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "BMPReadWriterPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -58,9 +58,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "BMPReadWriterPlugin 8 May 2013 (i)" + "BMPReadWriterPlugin 27 October 2013 (i)" #else - "BMPReadWriterPlugin 8 May 2013 (e)" + "BMPReadWriterPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/BitBltPlugin/BitBltPlugin.c =================================================================== --- trunk/src/plugins/BitBltPlugin/BitBltPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/BitBltPlugin/BitBltPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,4 +1,4 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.7 translated as C source on 19 October 2013 3:01:07 pm */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:42 am */ /* Automatically generated by SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from @@ -257,9 +257,9 @@ }; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "BitBltPlugin 19 October 2013 (i)" + "BitBltPlugin 27 October 2013 (i)" #else - "BitBltPlugin 19 October 2013 (e)" + "BitBltPlugin 27 October 2013 (e)" #endif ; static sqInt nWords; Modified: trunk/src/plugins/CameraPlugin/CameraPlugin.c =================================================================== --- trunk/src/plugins/CameraPlugin/CameraPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/CameraPlugin/CameraPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:47 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:52 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - CameraPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + CameraPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "CameraPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "CameraPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -64,9 +64,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "CameraPlugin 8 May 2013 (i)" + "CameraPlugin 27 October 2013 (i)" #else - "CameraPlugin 8 May 2013 (e)" + "CameraPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/ClipboardExtendedPlugin/ClipboardExtendedPlugin.c =================================================================== --- trunk/src/plugins/ClipboardExtendedPlugin/ClipboardExtendedPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/ClipboardExtendedPlugin/ClipboardExtendedPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:47 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:53 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - ClipboardExtendedPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + ClipboardExtendedPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "ClipboardExtendedPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "ClipboardExtendedPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -61,9 +61,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "ClipboardExtendedPlugin 8 May 2013 (i)" + "ClipboardExtendedPlugin 27 October 2013 (i)" #else - "ClipboardExtendedPlugin 8 May 2013 (e)" + "ClipboardExtendedPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/CroquetPlugin/CroquetPlugin.c =================================================================== --- trunk/src/plugins/CroquetPlugin/CroquetPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/CroquetPlugin/CroquetPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:41 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:42 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - CroquetPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + CroquetPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "CroquetPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "CroquetPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -73,9 +73,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "CroquetPlugin 8 May 2013 (i)" + "CroquetPlugin 27 October 2013 (i)" #else - "CroquetPlugin 8 May 2013 (e)" + "CroquetPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/DBusPlugin/DBusPlugin.c =================================================================== --- trunk/src/plugins/DBusPlugin/DBusPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/DBusPlugin/DBusPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,6 +1,6 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:48 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:53 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from DBusPlugin DBus-Plugin-dtl.35 uuid: 2ae30f08-4793-4acb-876b-c443a5f5e665 */ @@ -143,9 +143,9 @@ static DBusMessageIter messageIter[DBUS_MAXIMUM_TYPE_RECURSION_DEPTH]; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "DBusPlugin 8 May 2013 (i)" + "DBusPlugin 27 October 2013 (i)" #else - "DBusPlugin 8 May 2013 (e)" + "DBusPlugin 27 October 2013 (e)" #endif ; static DBusMessage* writeMessage; Modified: trunk/src/plugins/DSAPrims/DSAPrims.c =================================================================== --- trunk/src/plugins/DSAPrims/DSAPrims.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/DSAPrims/DSAPrims.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:41 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:43 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - DSAPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + DSAPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "DSAPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "DSAPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -67,9 +67,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "DSAPrims 8 May 2013 (i)" + "DSAPrims 27 October 2013 (i)" #else - "DSAPrims 8 May 2013 (e)" + "DSAPrims 27 October 2013 (e)" #endif ; static sqInt remainderDigitCount; Modified: trunk/src/plugins/DropPlugin/DropPlugin.c =================================================================== --- trunk/src/plugins/DropPlugin/DropPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/DropPlugin/DropPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:41 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:43 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - DropPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + DropPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "DropPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "DropPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -62,9 +62,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "DropPlugin 8 May 2013 (i)" + "DropPlugin 27 October 2013 (i)" #else - "DropPlugin 8 May 2013 (e)" + "DropPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/FFTPlugin/FFTPlugin.c =================================================================== --- trunk/src/plugins/FFTPlugin/FFTPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FFTPlugin/FFTPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:42 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:43 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - FFTPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + FFTPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "FFTPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "FFTPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -68,9 +68,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FFTPlugin 8 May 2013 (i)" + "FFTPlugin 27 October 2013 (i)" #else - "FFTPlugin 8 May 2013 (e)" + "FFTPlugin 27 October 2013 (e)" #endif ; static sqInt nu; Modified: trunk/src/plugins/FT2Plugin/FT2Plugin.c =================================================================== --- trunk/src/plugins/FT2Plugin/FT2Plugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FT2Plugin/FT2Plugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,4 +1,4 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 June 2013 11:46:33 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:43 am */ /* Automatically generated by FT2PluginCodeGenerator * FreeType-tween.435 uuid: 1866706e-ba6b-a742-b2fb-7854932b7596 from @@ -121,9 +121,9 @@ static FT_Library library; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FT2Plugin 8 June 2013 (i)" + "FT2Plugin 27 October 2013 (i)" #else - "FT2Plugin 8 June 2013 (e)" + "FT2Plugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/FileCopyPlugin/FileCopyPlugin.c =================================================================== --- trunk/src/plugins/FileCopyPlugin/FileCopyPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FileCopyPlugin/FileCopyPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:48 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:54 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - FileCopyPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + FileCopyPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "FileCopyPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "FileCopyPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -57,9 +57,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FileCopyPlugin 8 May 2013 (i)" + "FileCopyPlugin 27 October 2013 (i)" #else - "FileCopyPlugin 8 May 2013 (e)" + "FileCopyPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/FilePlugin/FilePlugin.c =================================================================== --- trunk/src/plugins/FilePlugin/FilePlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FilePlugin/FilePlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:42 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:44 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - FilePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + FilePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "FilePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "FilePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -100,9 +100,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FilePlugin 8 May 2013 (i)" + "FilePlugin 27 October 2013 (i)" #else - "FilePlugin 8 May 2013 (e)" + "FilePlugin 27 October 2013 (e)" #endif ; static void * sCCPfn; Modified: trunk/src/plugins/FloatArrayPlugin/FloatArrayPlugin.c =================================================================== --- trunk/src/plugins/FloatArrayPlugin/FloatArrayPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FloatArrayPlugin/FloatArrayPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:42 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:44 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - FloatArrayPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + FloatArrayPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "FloatArrayPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "FloatArrayPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -72,9 +72,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FloatArrayPlugin 8 May 2013 (i)" + "FloatArrayPlugin 27 October 2013 (i)" #else - "FloatArrayPlugin 8 May 2013 (e)" + "FloatArrayPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/FloatMathPlugin/FloatMathPlugin.c =================================================================== --- trunk/src/plugins/FloatMathPlugin/FloatMathPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/FloatMathPlugin/FloatMathPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:42 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:44 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - FloatMathPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + FloatMathPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "FloatMathPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "FloatMathPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -79,9 +79,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "FloatMathPlugin 8 May 2013 (i)" + "FloatMathPlugin 27 October 2013 (i)" #else - "FloatMathPlugin 8 May 2013 (e)" + "FloatMathPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/GeniePlugin/GeniePlugin.c =================================================================== --- trunk/src/plugins/GeniePlugin/GeniePlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/GeniePlugin/GeniePlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:43 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:45 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - GeniePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + GeniePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "GeniePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "GeniePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -61,9 +61,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "GeniePlugin v2.0 8 May 2013 (i)" + "GeniePlugin v2.0 27 October 2013 (i)" #else - "GeniePlugin v2.0 8 May 2013 (e)" + "GeniePlugin v2.0 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/HostWindowPlugin/HostWindowPlugin.c =================================================================== --- trunk/src/plugins/HostWindowPlugin/HostWindowPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/HostWindowPlugin/HostWindowPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:50 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:56 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - HostWindowPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + HostWindowPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "HostWindowPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "HostWindowPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -66,9 +66,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "HostWindowPlugin 8 May 2013 (i)" + "HostWindowPlugin 27 October 2013 (i)" #else - "HostWindowPlugin 8 May 2013 (e)" + "HostWindowPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/JPEGReadWriter2Plugin/JPEGReadWriter2Plugin.c =================================================================== --- trunk/src/plugins/JPEGReadWriter2Plugin/JPEGReadWriter2Plugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/JPEGReadWriter2Plugin/JPEGReadWriter2Plugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:43 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:45 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - JPEGReadWriter2Plugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + JPEGReadWriter2Plugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "JPEGReadWriter2Plugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "JPEGReadWriter2Plugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -68,9 +68,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "JPEGReadWriter2Plugin 8 May 2013 (i)" + "JPEGReadWriter2Plugin 27 October 2013 (i)" #else - "JPEGReadWriter2Plugin 8 May 2013 (e)" + "JPEGReadWriter2Plugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/JPEGReaderPlugin/JPEGReaderPlugin.c =================================================================== --- trunk/src/plugins/JPEGReaderPlugin/JPEGReaderPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/JPEGReaderPlugin/JPEGReaderPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:43 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:45 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - JPEGReaderPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + JPEGReaderPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "JPEGReaderPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "JPEGReaderPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -136,9 +136,9 @@ static sqInt jsReadLimit; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "JPEGReaderPlugin 8 May 2013 (i)" + "JPEGReaderPlugin 27 October 2013 (i)" #else - "JPEGReaderPlugin 8 May 2013 (e)" + "JPEGReaderPlugin 27 October 2013 (e)" #endif ; static int *residuals; Modified: trunk/src/plugins/JoystickTabletPlugin/JoystickTabletPlugin.c =================================================================== --- trunk/src/plugins/JoystickTabletPlugin/JoystickTabletPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/JoystickTabletPlugin/JoystickTabletPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:43 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:46 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - JoystickTabletPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + JoystickTabletPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "JoystickTabletPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "JoystickTabletPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -62,9 +62,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "JoystickTabletPlugin 8 May 2013 (i)" + "JoystickTabletPlugin 27 October 2013 (i)" #else - "JoystickTabletPlugin 8 May 2013 (e)" + "JoystickTabletPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/Klatt/Klatt.c =================================================================== --- trunk/src/plugins/Klatt/Klatt.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/Klatt/Klatt.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:43 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:46 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - KlattSynthesizerPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + KlattSynthesizerPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "KlattSynthesizerPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "KlattSynthesizerPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -155,9 +155,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "Klatt 8 May 2013 (i)" + "Klatt 27 October 2013 (i)" #else - "Klatt 8 May 2013 (e)" + "Klatt 27 October 2013 (e)" #endif ; static float nlast; Modified: trunk/src/plugins/LargeIntegers/LargeIntegers.c =================================================================== --- trunk/src/plugins/LargeIntegers/LargeIntegers.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/LargeIntegers/LargeIntegers.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:44 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:47 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - LargeIntegersPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + LargeIntegersPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "LargeIntegersPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "LargeIntegersPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; Modified: trunk/src/plugins/LocalePlugin/LocalePlugin.c =================================================================== --- trunk/src/plugins/LocalePlugin/LocalePlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/LocalePlugin/LocalePlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:44 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:47 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - LocalePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + LocalePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "LocalePlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "LocalePlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -71,9 +71,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "LocalePlugin 8 May 2013 (i)" + "LocalePlugin 27 October 2013 (i)" #else - "LocalePlugin 8 May 2013 (e)" + "LocalePlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/MIDIPlugin/MIDIPlugin.c =================================================================== --- trunk/src/plugins/MIDIPlugin/MIDIPlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/MIDIPlugin/MIDIPlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:51 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:58 am */ /* Automatically generated by - SmartSyntaxPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + SmartSyntaxPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - MIDIPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + MIDIPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "MIDIPlugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "MIDIPlugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -70,9 +70,9 @@ struct VirtualMachine* interpreterProxy; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "MIDIPlugin 8 May 2013 (i)" + "MIDIPlugin 27 October 2013 (i)" #else - "MIDIPlugin 8 May 2013 (e)" + "MIDIPlugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/Matrix2x3Plugin/Matrix2x3Plugin.c =================================================================== --- trunk/src/plugins/Matrix2x3Plugin/Matrix2x3Plugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/Matrix2x3Plugin/Matrix2x3Plugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:44 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:48 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + VMPluginCodeGenerator VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 from - Matrix2x3Plugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 + Matrix2x3Plugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 */ -static char __buildInfo[] = "Matrix2x3Plugin VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 " __DATE__ ; +static char __buildInfo[] = "Matrix2x3Plugin VMMaker-dtl.327 uuid: ba3104e6-7926-482f-9ef1-cdf59721acb8 " __DATE__ ; @@ -74,9 +74,9 @@ static double m23ResultY; static const char *moduleName = #ifdef SQUEAK_BUILTIN_PLUGIN - "Matrix2x3Plugin 8 May 2013 (i)" + "Matrix2x3Plugin 27 October 2013 (i)" #else - "Matrix2x3Plugin 8 May 2013 (e)" + "Matrix2x3Plugin 27 October 2013 (e)" #endif ; Modified: trunk/src/plugins/MiscPrimitivePlugin/MiscPrimitivePlugin.c =================================================================== --- trunk/src/plugins/MiscPrimitivePlugin/MiscPrimitivePlugin.c 2013-10-20 15:16:00 UTC (rev 2793) +++ trunk/src/plugins/MiscPrimitivePlugin/MiscPrimitivePlugin.c 2013-10-27 15:40:04 UTC (rev 2794) @@ -1,10 +1,10 @@ -/* Smalltalk from Squeak4.3 with VMMaker 4.12.4 translated as C source on 8 May 2013 8:26:45 am */ +/* Smalltalk from Squeak4.4 with VMMaker 4.12.7 translated as C source on 27 October 2013 11:13:48 am */ /* Automatically generated by - VMPluginCodeGenerator VMMaker-dtl.320 uuid: 22da50b8-8c42-4462-9635-e2f251916442 @@ Diff output truncated at 50000 characters. @@

1 0

VM Maker: VMMaker.oscog-eem.479.mcz
by commits＠source.squeak.org 26 Oct '13

26 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.479.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.479 Author: eem Time: 25 October 2013, 9:22:02.442 pm UUID: fa519ded-1bce-42c3-87b0-3cd3b14c1dd8 Ancestors: VMMaker.oscog-eem.478 Fix bugs in allocateOldSpaceChunkOfBytes: & allocateOldSpaceChunkOfBytes:suchThat: (incorrect freeListsMask maintennance). Make sure eliminateAndFreeForwarders follows specialObjectsOop. Fix slips in sortFreeListAt: & unlinkSolitaryFreeTreeNode: (ofObject: => ofFreeChunk:). markAndTraceStackPage: should use isImmediate: not isIntegerObject: =============== Diff against VMMaker.oscog-eem.478 =============== Item was changed: ----- Method: Spur32BitMMLESimulator>>isIntegerObject: (in category 'object testing') ----- isIntegerObject: oop "This list records the valid senders of isIntegerObject: as we replace uses of isIntegerObject: by isImmediate: where appropriate." | sel | sel := thisContext sender method selector. (#( DoIt DoItIn: on:do: "from the debugger" makeBaseFrameFor: quickFetchInteger:ofObject: frameOfMarriedContext: objCouldBeClassObj: isMarriedOrWidowedContext: shortPrint: bytecodePrimAt bytecodePrimAtPut commonAt: commonAtPut: loadFloatOrIntFrom: positive32BitValueOf: primitiveExternalCall checkedIntegerValueOf: bytecodePrimAtPut commonAtPut: primitiveVMParameter checkIsStillMarriedContext:currentFP: displayBitsOf:Left:Top:Right:Bottom: fetchStackPointerOf: primitiveContextAt primitiveContextAtPut subscript:with:storing:format: printContext: compare31or32Bits:equal: signed64BitValueOf: primDigitMultiply:negative: digitLength: isNegativeIntegerValueOf: magnitude64BitValueOf: primitiveMakePoint primitiveAsCharacter primitiveInputSemaphore baseFrameReturn primitiveExternalCall primDigitCompare: isLiveContext: numPointerSlotsOf: fileValueOf: loadBitBltDestForm fetchIntOrFloat:ofObject:ifNil: fetchIntOrFloat:ofObject: loadBitBltSourceForm loadPoint:from: primDigitAdd: primDigitSubtract: positive64BitValueOf: digitBitLogic:with:opIndex: signed32BitValueOf: isNormalized: primDigitDiv:negative: bytesOrInt:growTo: primitiveNewMethod isCogMethodReference: functionForPrimitiveExternalCall: genSpecialSelectorArithmetic genSpecialSelectorComparison ensureContextHasBytecodePC: instVar:ofContext: ceBaseFrameReturn: inlineCacheTagForInstance: primitiveObjectAtPut commonVariable:at:put:cacheIndex: primDigitBitShiftMagnitude: externalInstVar:ofContext: + primitiveGrowMemoryByAtLeast + primitiveFileSetPosition) includes: sel) ifFalse: - primitiveGrowMemoryByAtLeast) includes: sel) ifFalse: [self halt]. ^super isIntegerObject: oop! Item was changed: ----- Method: SpurMemoryManager>>addToFreeTree:bytes: (in category 'free space') ----- addToFreeTree: freeChunk bytes: chunkBytes "Add freeChunk to the large free chunk tree. For the benefit of sortedFreeObject:, answer the treeNode it is added to, if it is added to the next list of a freeTreeNode, otherwise answer 0." | childBytes parent child | self assert: chunkBytes = (self bytesInObject: freeChunk). self assert: chunkBytes / self allocationUnit >= self numFreeLists. self storePointer: self freeChunkNextIndex ofFreeChunk: freeChunk withValue: 0; storePointer: self freeChunkParentIndex ofFreeChunk: freeChunk withValue: 0; storePointer: self freeChunkSmallerIndex ofFreeChunk: freeChunk withValue: 0; storePointer: self freeChunkLargerIndex ofFreeChunk: freeChunk withValue: 0. "Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks." parent := 0. child := freeLists at: 0. [child ~= 0] whileTrue: [childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; add to list at node." [self storePointer: self freeChunkNextIndex ofFreeChunk: freeChunk withValue: (self fetchPointer: self freeChunkNextIndex ofObject: child); storePointer: self freeChunkNextIndex ofFreeChunk: child withValue: freeChunk. ^child]. "walk down the tree" parent := child. child := self fetchPointer: (childBytes > chunkBytes ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofObject: child]. parent = 0 ifTrue: [self assert: (freeLists at: 0) = 0. freeLists at: 0 put: freeChunk. freeListsMask := freeListsMask bitOr: 1. ^0]. + self assert: (freeListsMask anyMask: 1). "insert in tree" self storePointer: self freeChunkParentIndex ofFreeChunk: freeChunk withValue: parent. self storePointer: (childBytes > chunkBytes ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofFreeChunk: parent withValue: freeChunk. ^0! Item was changed: ----- Method: SpurMemoryManager>>allocateOldSpaceChunkOfBytes: (in category 'free space') ----- allocateOldSpaceChunkOfBytes: chunkBytes "Answer a chunk of oldSpace from the free lists, if available, otherwise answer nil. Break up a larger chunk if one of the exact size does not exist. N.B. the chunk is simply a pointer, it has no valid header. The caller *must* fill in the header correctly." | initialIndex chunk index nodeBytes parent child | "for debugging:" "totalFreeOldSpace := self totalFreeListBytes" totalFreeOldSpace := totalFreeOldSpace - chunkBytes. "be optimistic (& don't wait for the write)" initialIndex := chunkBytes / self allocationUnit. (initialIndex < self numFreeLists and: [1 << initialIndex <= freeListsMask]) ifTrue: [(freeListsMask anyMask: 1 << initialIndex) ifTrue: [(chunk := freeLists at: initialIndex) ~= 0 ifTrue: [self assert: chunk = (self startOfObject: chunk). self assert: (self isValidFreeObject: chunk). ^self unlinkFreeChunk: chunk atIndex: initialIndex]. freeListsMask := freeListsMask - (1 << initialIndex)]. "first search for free chunks of a multiple of chunkBytes in size" index := initialIndex. [(index := index + index) < self numFreeLists and: [1 << index <= freeListsMask]] whileTrue: + [(freeListsMask anyMask: 1 << index) ifTrue: + [(chunk := freeLists at: index) ~= 0 ifTrue: + [self assert: chunk = (self startOfObject: chunk). + self assert: (self isValidFreeObject: chunk). + self unlinkFreeChunk: chunk atIndex: index. + self assert: (self bytesInObject: chunk) = (index * self allocationUnit). + self freeChunkWithBytes: index * self allocationUnit - chunkBytes + at: (self startOfObject: chunk) + chunkBytes. + ^chunk]. + freeListsMask := freeListsMask - (1 << index)]]. - [((freeListsMask anyMask: 1 << index) - and: [(chunk := freeLists at: index) ~= 0]) ifTrue: - [self assert: chunk = (self startOfObject: chunk). - self assert: (self isValidFreeObject: chunk). - self unlinkFreeChunk: chunk atIndex: index. - self assert: (self bytesInObject: chunk) = (index * self allocationUnit). - self freeChunkWithBytes: index * self allocationUnit - chunkBytes - at: (self startOfObject: chunk) + chunkBytes. - ^chunk]]. "now get desperate and use the first that'll fit. Note that because the minimum free size is 16 bytes (2 * allocationUnit), to leave room for the forwarding pointer/next free link, we can only break chunks that are at least 16 bytes larger, hence start at initialIndex + 2." index := initialIndex + 1. [(index := index + 1) < self numFreeLists and: [1 << index <= freeListsMask]] whileTrue: [(freeListsMask anyMask: 1 << index) ifTrue: [(chunk := freeLists at: index) ~= 0 ifTrue: [self assert: chunk = (self startOfObject: chunk). self assert: (self isValidFreeObject: chunk). self unlinkFreeChunk: chunk atIndex: index. self assert: (self bytesInObject: chunk) = (index * self allocationUnit). self freeChunkWithBytes: index * self allocationUnit - chunkBytes at: (self startOfObject: chunk) + chunkBytes. ^chunk]. freeListsMask := freeListsMask - (1 << index)]]]. "Large chunk, or no space on small free lists. Search the large chunk list. Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks. When the search ends parent should hold the smallest chunk at least as large as chunkBytes, or 0 if none." parent := 0. child := freeLists at: 0. [child ~= 0] whileTrue: [| childBytes | self assert: (self isValidFreeObject: child). childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; try to remove from list at node." [chunk := self fetchPointer: self freeChunkNextIndex ofFreeChunk: child. chunk ~= 0 ifTrue: [self assert: (self isValidFreeObject: chunk). self storePointer: self freeChunkNextIndex ofFreeChunk: child withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: chunk). ^self startOfObject: chunk]. child := 0] "break out of loop to remove interior node" ifFalse: ["Note that because the minimum free size is 16 bytes (2 * allocationUnit), to leave room for the forwarding pointer/next free link, we can only break chunks that are at least 16 bytes larger, hence reject chunks < 2 * allocationUnit larger." childBytes <= (chunkBytes + self allocationUnit) ifTrue: "node too small; walk down the larger size of the tree" [child := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: child] ifFalse: [parent := child. "parent will be smallest node >= chunkBytes + allocationUnit" nodeBytes := childBytes. child := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: child]]]. parent = 0 ifTrue: [totalFreeOldSpace := totalFreeOldSpace + chunkBytes. "optimism was unfounded" ^nil]. "self printFreeChunk: parent" self assert: (nodeBytes = chunkBytes or: [nodeBytes >= (chunkBytes + (2 * self allocationUnit))]). self assert: (self bytesInObject: parent) = nodeBytes. "attempt to remove from list" chunk := self fetchPointer: self freeChunkNextIndex ofFreeChunk: parent. chunk ~= 0 ifTrue: [self assert: (chunkBytes = nodeBytes or: [chunkBytes + self allocationUnit < nodeBytes]). self storePointer: self freeChunkNextIndex ofFreeChunk: parent withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: chunk). chunkBytes ~= nodeBytes ifTrue: [self freeChunkWithBytes: nodeBytes - chunkBytes at: (self startOfObject: chunk) + chunkBytes]. ^self startOfObject: chunk]. "no list; remove the interior node" chunk := parent. self unlinkSolitaryFreeTreeNode: chunk. "if there's space left over, add the fragment back." chunkBytes ~= nodeBytes ifTrue: [self freeChunkWithBytes: nodeBytes - chunkBytes at: (self startOfObject: chunk) + chunkBytes]. ^self startOfObject: chunk! Item was changed: ----- Method: SpurMemoryManager>>allocateOldSpaceChunkOfBytes:suchThat: (in category 'free space') ----- allocateOldSpaceChunkOfBytes: chunkBytes suchThat: acceptanceBlock "Answer a chunk of oldSpace from the free lists that satisfies acceptanceBlock, if available, otherwise answer nil. Break up a larger chunk if one of the exact size cannot be found. N.B. the chunk is simply a pointer, it has no valid header. The caller *must* fill in the header correctly." | initialIndex node next prev index child acceptedChunk acceptedNode | <inline: true> "must inline for acceptanceBlock" "for debugging:" "totalFreeOldSpace := self totalFreeListBytes" totalFreeOldSpace := totalFreeOldSpace - chunkBytes. "be optimistic (& don't wait for the write)" initialIndex := chunkBytes / self allocationUnit. (initialIndex < self numFreeLists and: [1 << initialIndex <= freeListsMask]) ifTrue: [(freeListsMask anyMask: 1 << initialIndex) ifTrue: [(node := freeLists at: initialIndex) = 0 + ifTrue: [freeListsMask := freeListsMask - (1 << initialIndex)] - ifTrue: [freeListsMask := freeListsMask - (1 << index)] ifFalse: [prev := 0. [node ~= 0] whileTrue: [self assert: node = (self startOfObject: node). self assert: (self isValidFreeObject: node). next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. (acceptanceBlock value: node) ifTrue: [prev = 0 + ifTrue: [freeLists at: initialIndex put: next] - ifTrue: [freeLists at: index put: next] ifFalse: [self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: next]. ^node]. + prev := node. node := next]]]. "first search for free chunks of a multiple of chunkBytes in size" index := initialIndex. [(index := index + initialIndex) < self numFreeLists and: [1 << index <= freeListsMask]] whileTrue: [(freeListsMask anyMask: 1 << index) ifTrue: [(node := freeLists at: index) = 0 ifTrue: [freeListsMask := freeListsMask - (1 << index)] ifFalse: [prev := 0. [node ~= 0] whileTrue: [self assert: node = (self startOfObject: node). self assert: (self isValidFreeObject: node). next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. (acceptanceBlock value: node) ifTrue: [prev = 0 ifTrue: [freeLists at: index put: next] ifFalse: [self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: next]. self freeChunkWithBytes: index * self allocationUnit - chunkBytes at: (self startOfObject: node) + chunkBytes. ^node]. + prev := node. + node := next]]]]. - node := next]. - self assert: node = (self startOfObject: node). - self assert: (self isValidFreeObject: node). - self unlinkFreeChunk: node atIndex: index. - self assert: (self bytesInObject: node) = (index * self allocationUnit). - self freeChunkWithBytes: index * self allocationUnit - chunkBytes - at: (self startOfObject: node) + chunkBytes. - ^node]]]. "now get desperate and use the first that'll fit. Note that because the minimum free size is 16 bytes (2 * allocationUnit), to leave room for the forwarding pointer/next free link, we can only break chunks that are at least 16 bytes larger, hence start at initialIndex + 2." index := initialIndex + 1. [(index := index + 1) < self numFreeLists and: [1 << index <= freeListsMask]] whileTrue: [(freeListsMask anyMask: 1 << index) ifTrue: [(node := freeLists at: index) = 0 ifTrue: [freeListsMask := freeListsMask - (1 << index)] ifFalse: [prev := 0. [node ~= 0] whileTrue: [self assert: node = (self startOfObject: node). self assert: (self isValidFreeObject: node). next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. (acceptanceBlock value: node) ifTrue: [prev = 0 ifTrue: [freeLists at: index put: next] ifFalse: [self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: next]. self freeChunkWithBytes: index * self allocationUnit - chunkBytes at: (self startOfObject: node) + chunkBytes. ^node]. + prev := node. + node := next]]]]]. - node := next]. - self assert: node = (self startOfObject: node). - self assert: (self isValidFreeObject: node). - self unlinkFreeChunk: node atIndex: index. - self assert: (self bytesInObject: node) = (index * self allocationUnit). - self freeChunkWithBytes: index * self allocationUnit - chunkBytes - at: (self startOfObject: node) + chunkBytes. - ^node]]]]. "Large chunk, or no space on small free lists. Search the large chunk list. Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks. When the search ends parent should hold the smallest chunk at least as large as chunkBytes, or 0 if none. acceptedChunk and acceptedNode save us from having to back-up when the acceptanceBlock filters-out all nodes of the right size, but there are nodes of the wrong size it does accept." child := freeLists at: 0. + acceptedChunk := acceptedNode := 0. [child ~= 0] whileTrue: [| childBytes | self assert: (self isValidFreeObject: child). childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; try to remove from list at node." [node := child. [prev := node. node := self fetchPointer: self freeChunkNextIndex ofFreeChunk: node. node ~= 0] whileTrue: [(acceptanceBlock value: node) ifTrue: [self assert: (self isValidFreeObject: node). self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node). ^self startOfObject: node]]. (acceptanceBlock value: node) ifTrue: [node := child. child := 0]]. "break out of loop to remove interior node" child ~= 0 ifTrue: ["Note that because the minimum free size is 16 bytes (2 * allocationUnit), to leave room for the forwarding pointer/next free link, we can only break chunks that are at least 16 bytes larger, hence reject chunks < 2 * allocationUnit larger." childBytes <= (chunkBytes + self allocationUnit) ifTrue: "node too small; walk down the larger size of the tree" [child := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: child] ifFalse: [acceptedNode = 0 ifTrue: [acceptedChunk := child. "first search the list." [acceptedChunk := self fetchPointer: self freeChunkNextIndex ofFreeChunk: acceptedChunk. + (acceptedChunk ~= 0 and: [acceptanceBlock value: acceptedChunk]) ifTrue: + [acceptedNode := child]. + acceptedChunk ~= 0 and: [acceptedNode = 0]] whileTrue. - acceptedChunk ~= 0 and: [acceptedNode = 0]] whileTrue: - [(acceptanceBlock value: acceptedChunk) ifTrue: - [acceptedNode := child]. "nothing on the list; will the node do? This prefers acceptable nodes higher up the tree over acceptable list elements further down, but we haven't got all day..." (acceptedNode = 0 and: [acceptanceBlock value: child]) ifTrue: [acceptedNode := child]]. + child := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: child]]]. - child := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: child]]]]. acceptedNode ~= 0 ifTrue: [acceptedChunk ~= 0 ifTrue: [self assert: (self bytesInObject: acceptedChunk) >= (chunkBytes + self allocationUnit). [next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: acceptedNode. next ~= acceptedChunk] whileTrue: [acceptedNode := next]. self storePointer: self freeChunkNextIndex ofFreeChunk: acceptedNode withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: acceptedChunk). self freeChunkWithBytes: (self bytesInObject: acceptedChunk) - chunkBytes at: (self startOfObject: acceptedChunk) + chunkBytes. ^self startOfObject: acceptedChunk]. next := self fetchPointer: self freeChunkNextIndex ofFreeChunk: acceptedNode. next = 0 ifTrue: "no list; remove the interior node" [self unlinkSolitaryFreeTreeNode: acceptedNode] ifFalse: "list; replace node with it" [self inFreeTreeReplace: acceptedNode with: next]. self assert: (self bytesInObject: acceptedNode) >= (chunkBytes + self allocationUnit). self freeChunkWithBytes: (self bytesInObject: acceptedNode) - chunkBytes at: (self startOfObject: acceptedNode) + chunkBytes. ^self startOfObject: acceptedNode]. totalFreeOldSpace := totalFreeOldSpace + chunkBytes. "optimism was unfounded" ^nil! Item was changed: ----- Method: SpurMemoryManager>>allocateOldSpaceChunkOfExactlyBytes: (in category 'free space') ----- allocateOldSpaceChunkOfExactlyBytes: chunkBytes "Answer a chunk of oldSpace from the free lists, if one of this size is available, otherwise answer nil. N.B. the chunk is simply a pointer, it has no valid header. The caller *must* fill in the header correctly." | initialIndex node nodeBytes child | "for debugging:" "totalFreeOldSpace := self totalFreeListBytes" initialIndex := chunkBytes / self allocationUnit. initialIndex < self numFreeLists ifTrue: + [1 << initialIndex <= freeListsMask ifTrue: + [(node := freeLists at: initialIndex) ~= 0 ifTrue: + [self assert: node = (self startOfObject: node). + self assert: (self isValidFreeObject: node). + totalFreeOldSpace := totalFreeOldSpace - chunkBytes. + ^self unlinkFreeChunk: node atIndex: initialIndex]. + freeListsMask := freeListsMask - (1 << initialIndex)]. - [(1 << initialIndex <= freeListsMask - and: [(node := freeLists at: initialIndex) ~= 0]) ifTrue: - [self assert: node = (self startOfObject: node). - self assert: (self isValidFreeObject: node). - totalFreeOldSpace := totalFreeOldSpace - chunkBytes. - ^self unlinkFreeChunk: node atIndex: initialIndex]. ^nil]. "Large chunk. Search the large chunk list. Large chunk list organized as a tree, each node of which is a list of chunks of the same size. Beneath the node are smaller and larger blocks. When the search ends parent should hold the first chunk of the same size as chunkBytes, or 0 if none." node := 0. child := freeLists at: 0. [child ~= 0] whileTrue: [| childBytes | self assert: (self isValidFreeObject: child). childBytes := self bytesInObject: child. childBytes = chunkBytes ifTrue: "size match; try to remove from list at node." [node := self fetchPointer: self freeChunkNextIndex ofFreeChunk: child. node ~= 0 ifTrue: [self assert: (self isValidFreeObject: node). self storePointer: self freeChunkNextIndex ofFreeChunk: child withValue: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node). totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node]. node := child. nodeBytes := childBytes. child := 0] "break out of loop to remove interior node" ifFalse: [childBytes < chunkBytes ifTrue: "walk down the tree" [child := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: child] ifFalse: [nodeBytes := childBytes. child := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: child]]]. "if no chunk, there was no exact fit" node = 0 ifTrue: [^nil]. "self printFreeChunk: parent" self assert: nodeBytes = chunkBytes. self assert: (self bytesInObject: node) = chunkBytes. "can't be a list; would have removed and returned it above." self assert: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: node) = 0. "no list; remove the interior node" self unlinkSolitaryFreeTreeNode: node. totalFreeOldSpace := totalFreeOldSpace - chunkBytes. ^self startOfObject: node! Item was changed: ----- Method: SpurMemoryManager>>bestFitCompact (in category 'compaction') ----- bestFitCompact "Compact all of memory using best-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects." <returnTypeC: #void> <inline: false> | freePriorToExactFit | + self checkFreeSpace. freePriorToExactFit := totalFreeOldSpace. self exactFitCompact. + self checkFreeSpace. highestObjects isEmpty ifTrue: [^self]. "either no high objects, or no misfits." statCompactPassCount := statCompactPassCount + 1. highestObjects reverseDo: [:o| | b | self assert: ((self isForwarded: o) or: [self isPinned: o]) not. b := self bytesInObject: o. (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: [:f| self mem: f cp: o y: ((self hasOverflowHeader: o) ifTrue: [b - self baseHeaderSize] ifFalse: [b]). (self isRemembered: o) ifTrue: [scavenger remember: f]. self forward: o to: f]]. + self checkFreeSpace. self allOldSpaceObjectsFrom: firstFreeChunk do: [:o| | b | ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: [:f| self mem: f cp: o y: ((self hasOverflowHeader: o) ifTrue: [b - self baseHeaderSize] ifFalse: [b]). (self isRemembered: o) ifTrue: [scavenger remember: f]. self forward: o to: f]]]. + self checkFreeSpace. - self checkFreeSpace self touch: freePriorToExactFit! Item was changed: ----- Method: SpurMemoryManager>>eliminateAndFreeForwarders (in category 'gc - global') ----- eliminateAndFreeForwarders "As the final phase of global garbage collect, sweep the heap to follow forwarders, then free forwarders" | lowestForwarded firstForwarded lastForwarded | + self assert: (self isForwarded: nilObj) not. + self assert: (self isForwarded: falseObj) not. + self assert: (self isForwarded: trueObj) not. + self assert: (self isForwarded: hiddenRootsObj) not. + (self isForwarded: specialObjectsOop) ifTrue: + [specialObjectsOop := self followForwarded: specialObjectsOop]. lowestForwarded := 0. self allOldSpaceObjectsDo: [:o| (self isForwarded: o) ifTrue: [lowestForwarded = 0 ifTrue: [lowestForwarded := o]] ifFalse: [0 to: (self numPointerSlotsOf: o) - 1 do: [:i| | f | f := self fetchPointer: i ofObject: o. (self isOopForwarded: f) ifTrue: [f := self followForwarded: f. self assert: ((self isImmediate: f) or: [self isYoung: f]) not. self storePointerUnchecked: i ofObject: o withValue: f]]]]. firstForwarded := lastForwarded := 0. self allOldSpaceObjectsFrom: lowestForwarded do: [:o| (self isForwarded: o) ifTrue: [firstForwarded = 0 ifTrue: [firstForwarded := o]. lastForwarded := o] ifFalse: [firstForwarded ~= 0 ifTrue: [| start bytes | start := self startOfObject: firstForwarded. bytes := (self addressAfter: lastForwarded) - start. self addFreeChunkWithBytes: bytes at: start]. firstForwarded := 0]]! Item was changed: ----- Method: SpurMemoryManager>>ensureAllMarkBitsAreZero (in category 'gc - incremental') ----- ensureAllMarkBitsAreZero "If the incremental collector is running mark bits may be set; stop it and clear them if necessary." + self flag: 'need to implement the inc GC first...'! - self shouldBeImplemented! Item was changed: ----- Method: SpurMemoryManager>>fullGC (in category 'gc - global') ----- fullGC + <inline: false> needGCFlag := false. gcStartUsecs := self ioUTCMicrosecondsNow. statMarkCount := 0. + coInterpreter preGCAction: GCModeFull. - self preGCAction: GCModeFull. self globalGarbageCollect. + coInterpreter postGCAction: GCModeFull. - self postGCAction: GCModeFull. statFullGCs := statFullGCs + 1. statGCEndUsecs := self ioUTCMicrosecondsNow. statFullGCUsecs := statFullGCUsecs + (statGCEndUsecs - gcStartUsecs).! Item was added: + ----- Method: SpurMemoryManager>>ioUTCMicrosecondsNow (in category 'simulation only') ----- + ioUTCMicrosecondsNow + "hack around the CoInterpreter/ObjectMemory split refactoring" + <doNotGenerate> + ^coInterpreter ioUTCMicrosecondsNow! Item was changed: ----- Method: SpurMemoryManager>>printFreeChunk: (in category 'debug printing') ----- printFreeChunk: freeChunk + <api> - <doNotGenerate> | numBytes | numBytes := self bytesInObject: freeChunk. coInterpreter print: 'freeChunk '; printHexPtrnp: freeChunk; print: ' bytes '; printNum: numBytes; print: ' next '; printHexPtrnp: (self fetchPointer: self freeChunkNextIndex ofFreeChunk: freeChunk). numBytes / self allocationUnit > self numFreeLists ifTrue: [coInterpreter print: ' ^ '; printHexPtrnp: (self fetchPointer: self freeChunkParentIndex ofFreeChunk: freeChunk); print: ' < '; printHexPtrnp: (self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: freeChunk); print: ' > '; printHexPtrnp: (self fetchPointer: self freeChunkLargerIndex ofFreeChunk: freeChunk)]. coInterpreter cr! Item was changed: ----- Method: SpurMemoryManager>>sortFreeListAt: (in category 'free space') ----- sortFreeListAt: i "Sort the individual free list i so that the lowest address is at the head of the list. Use an insertion sort with a scan for initially sorted elements." | list next head | list := freeLists at: i. "list of objects to be inserted" list = 0 ifTrue: "empty list; we're done" [^self]. head := list. "scan list to find find first out-of-order element" [(next := self fetchPointer: self freeChunkNextIndex ofObject: list) > list] whileTrue: [list := next]. "no out-of-order elements; list was already sorted; we're done" next = 0 ifTrue: [^self]. "detatch already sorted list" + self storePointer: self freeChunkNextIndex ofFreeChunk: list withValue: 0. - self storePointer: self freeChunkNextIndex ofObject: list withValue: 0. list := next. [list ~= 0] whileTrue: [| node prev | "grab next node to be inserted" next := self fetchPointer: self freeChunkNextIndex ofObject: list. "search sorted list for insertion point" prev := 0. "prev node for insertion sort" node := head. "current node for insertion sort" [node ~= 0 and: [node < list]] whileTrue: [prev := node. node := self fetchPointer: self freeChunkNextIndex ofObject: node]. "insert the node into the sorted list" self assert: (node = 0 or: [node > list]). prev = 0 ifTrue: [head := list] ifFalse: [self storePointer: self freeChunkNextIndex ofFreeChunk: prev withValue: list]. self storePointer: self freeChunkNextIndex ofFreeChunk: list withValue: node. list := next]. "replace the list with the sorted list" freeLists at: i put: head! Item was changed: ----- Method: SpurMemoryManager>>unlinkSolitaryFreeTreeNode: (in category 'free space') ----- unlinkSolitaryFreeTreeNode: freeTreeNode "Unlink a freeTreeNode. Assumes the node has no list (null next link)." | parent smaller larger | self assert: (self fetchPointer: self freeChunkNextIndex ofObject: freeTreeNode) = 0. "case 1. interior node has one child, P = parent, N = node, S = subtree (mirrored for large vs small) ___ ___ | P | | P | _/_ _/_ | N | => | S | _/_ | S | case 2: interior node has two children, , P = parent, N = node, L = smaller, left subtree, R = larger, right subtree. add the left subtree to the bottom left of the right subtree (mirrored for large vs small) ___ ___ | P | | P | _/_ _/_ | N | => | R | _/_ _\_ _/_ | L | | R | | L |" smaller := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: freeTreeNode. larger := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: freeTreeNode. parent := self fetchPointer: self freeChunkParentIndex ofFreeChunk: freeTreeNode. parent = 0 ifTrue: "no parent; stitch the subnodes back into the root" [smaller = 0 ifTrue: [self storePointer: self freeChunkParentIndex ofFreeChunk: larger withValue: 0. freeLists at: 0 put: larger] ifFalse: [self storePointer: self freeChunkParentIndex ofFreeChunk: smaller withValue: 0. freeLists at: 0 put: smaller. larger ~= 0 ifTrue: [self addFreeSubTree: larger]]] ifFalse: "parent; stitch back into appropriate side of parent." [smaller = 0 ifTrue: [self storePointer: (freeTreeNode = (self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: parent) ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofFreeChunk: parent withValue: larger. larger ~= 0 ifTrue: [self storePointer: self freeChunkParentIndex + ofFreeChunk: larger - ofObject: larger withValue: parent]] ifFalse: [self storePointer: (freeTreeNode = (self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: parent) ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofFreeChunk: parent withValue: smaller. self storePointer: self freeChunkParentIndex + ofFreeChunk: smaller - ofObject: smaller withValue: parent. larger ~= 0 ifTrue: [self addFreeSubTree: larger]]]! Item was changed: ----- Method: StackInterpreter>>markAndTraceStackPage: (in category 'object memory support') ----- markAndTraceStackPage: thePage | theSP theFP frameRcvrOffset callerFP oop | <var: #thePage type: #'StackPage *'> <var: #theSP type: #'char *'> <var: #theFP type: #'char *'> <var: #frameRcvrOffset type: #'char *'> <var: #callerFP type: #'char *'> <inline: false> self assert: (stackPages isFree: thePage) not. theSP := thePage headSP. theFP := thePage headFP. "Skip the instruction pointer on top of stack of inactive pages." thePage = stackPage ifFalse: [theSP := theSP + BytesPerWord]. [frameRcvrOffset := self frameReceiverOffset: theFP. [theSP <= frameRcvrOffset] whileTrue: [oop := stackPages longAt: theSP. + (objectMemory isImmediate: oop) ifFalse: - (objectMemory isIntegerObject: oop) ifFalse: [objectMemory markAndTrace: oop]. theSP := theSP + BytesPerWord]. (self frameHasContext: theFP) ifTrue: [self assert: (objectMemory isContext: (self frameContext: theFP)). objectMemory markAndTrace: (self frameContext: theFP)]. objectMemory markAndTrace: (self iframeMethod: theFP). (callerFP := self frameCallerFP: theFP) ~= 0] whileTrue: [theSP := theFP + FoxCallerSavedIP + BytesPerWord. theFP := callerFP]. theSP := theFP + FoxCallerSavedIP. "caller ip is frameCallerContext in a base frame" [theSP <= thePage baseAddress] whileTrue: [oop := stackPages longAt: theSP. + (objectMemory isImmediate: oop) ifFalse: - (objectMemory isIntegerObject: oop) ifFalse: [objectMemory markAndTrace: oop]. theSP := theSP + BytesPerWord]!

1 0

VM Maker: VMMaker.oscog-eem.478.mcz
by commits＠source.squeak.org 26 Oct '13

26 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.478.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.478 Author: eem Time: 25 October 2013, 7:31:06.556 pm UUID: 15a1d83f-0c88-4af2-afce-eed621d27ac6 Ancestors: VMMaker.oscog-eem.477 Fix bad bug in Slang translation of ifNil: which was outputting 0 for the non-nil side instead of the receiver. Implement some missing nodesDo:parent:'s. Make some of the methods in the scavenger <inline: false> for debug. Count tenures in the scavenger (move statTenures there from SMM). Move initialization of tenuringProportion to where it'll be executed in C. Move asserts from addTo[Weak|Ephemeron]List: into setCorpseOffsetOf:to:. Fix ancilliaryClass collection for CoInterpreter but introducing isAcceptableAncilliaryClass: hack. Move defs of GCModes to StackInterpreter class and add a GCModeScavenge. Use this to avoid attempting to shrink memory after a scavenge. Rename all postGCAction imps to postGCAction:. Fix vmProxyMinorVersion to bump to 13 with Spur. Restore the scavengeInProgress and: [self isInFutureSpace: address] clause to addressCouldBeObj: so we can print objects during scavenge. Hard to debug otherwise. Make the space determiners (isInNewSpace: et al) use oop:isGreaterThanOrEqualTo:andLessThan:. Count compaction passes in best/exactFitCompact. Answer this as statCompMoveCount. Eliminate some stats that are never going to be counted in Spur. Collect relevant stats in fullGC. Mark some methods as <api> for the VM proxy when minor ver = 13. Filter-out primitives with <option:> pragmas that evaluate to false. Modify primitiveVMParameter to answer scavenge stats for params 9 & 10 (inc GCs & inc GC ms) in Spur. =============== Diff against VMMaker.oscog-eem.477 =============== Item was changed: ----- Method: CCodeGenerator>>generateIfNil:on:indent: (in category 'C translation') ----- generateIfNil: msgNode on: aStream indent: level "Generate the C code for this message onto the given stream." (self isNilConstantReceiverOf: msgNode) ifFalse: [aStream nextPutAll: 'if (!!('. + msgNode receiver emitCCodeAsExpressionOn: aStream level: level + 1 generator: self. + aStream nextPutAll: ')) {'; cr. + msgNode args last emitCCodeOn: aStream level: level + 1 generator: self. + aStream tab: level; nextPut: $}] - msgNode receiver emitCCodeAsExpressionOn: aStream level: level + 1 generator: self. - aStream nextPutAll: ')) {'; cr. - msgNode args last emitCCodeOn: aStream level: level + 1 generator: self. - level timesRepeat: [aStream tab]. - aStream nextPut: $}] ifTrue: [msgNode args first emitCCodeOn: aStream level: level generator: self]! Item was changed: ----- Method: CCodeGenerator>>generateIfNilAsArgument:on:indent: (in category 'C translation') ----- generateIfNilAsArgument: msgNode on: aStream indent: level "Generate the C code for this message onto the given stream." (self isNilConstantReceiverOf: msgNode) ifFalse: [aStream nextPutAll: '(!!('. msgNode receiver emitCCodeAsArgumentOn: aStream level: 0 generator: self. + aStream nextPut: $); crtab: level + 1; nextPut: $?; space. + msgNode args last emitCCodeAsArgumentOn: aStream level: level + 2 generator: self. + aStream crtab: level + 1; nextPut: $:; space. + msgNode receiver emitCCodeAsArgumentOn: aStream level: 0 generator: self. + msgNode receiver isLeaf ifFalse: + [logger cr; nextPutAll: 'sending ifNil: to non-leaf in '; nextPutAll: currentMethod selector]. + aStream nextPut: $)] - aStream nextPut: $); crtab: level + 1; nextPut: $?; space. - msgNode args last emitCCodeAsArgumentOn: aStream level: level + 2 generator: self. - aStream crtab: level + 1; nextPutAll: ': 0)'] ifTrue: [msgNode args first emitCCodeAsArgumentOn: aStream level: level generator: self]! Item was changed: ----- Method: CCodeGenerator>>nonStructClassesForTranslationClasses: (in category 'utilities') ----- nonStructClassesForTranslationClasses: classes "Answer in superclass order (any superclass precedes any subclass) the ancilliaryClasses that are not struct classes for all the given classes." | nonStructClasses | nonStructClasses := OrderedCollection new. classes do: [:aTranslationClass| ([aTranslationClass ancilliaryClasses: self options] on: MessageNotUnderstood do: [:ex| ex message selector == #ancilliaryClasses: ifTrue: [#()] ifFalse: [ex pass]]) do: [:class| + (vmClass isNil or: [vmClass isAcceptableAncilliaryClass: class]) ifTrue: + [(class isStructClass + or: [(nonStructClasses includes: class) + or: [classes includes: class]]) ifFalse: + [nonStructClasses addLast: class]]]]. - (class isStructClass - or: [(nonStructClasses includes: class) - or: [classes includes: class]]) ifFalse: - [nonStructClasses addLast: class]]]. ^ChangeSet superclassOrder: nonStructClasses! Item was changed: ----- Method: CCodeGenerator>>structClassesForTranslationClasses: (in category 'utilities') ----- structClassesForTranslationClasses: classes "Answer in superclass order (any superclass precedes any subclass) the ancilliaryClasses that are struct classes for all the given classes." | structClasses | structClasses := OrderedCollection new. classes do: [:aTranslationClass| ([aTranslationClass ancilliaryClasses: self options] on: MessageNotUnderstood do: [:ex| ex message selector == #ancilliaryClasses: ifTrue: [#()] ifFalse: [ex pass]]) do: [:class| (class isStructClass + and: [(vmClass isNil or: [vmClass isAcceptableAncilliaryClass: class]) + and: [(structClasses includes: class) not]]) ifTrue: - and: [(structClasses includes: class) not]) ifTrue: [structClasses addLast: class]]]. ^ChangeSet superclassOrder: structClasses! Item was changed: ----- Method: CoInterpreter class>>initializeMiscConstants (in category 'initialization') ----- initializeMiscConstants super initializeMiscConstants. COGVM := true. MinBackwardJumpCountForCompile := 10. MaxNumArgs := 15. PrimCallNeedsNewMethod := 1. PrimCallNeedsPrimitiveFunction := 2. PrimCallMayCallBack := 4. PrimCallCollectsProfileSamples := 8. ReturnToInterpreter := 1. "setjmp/longjmp code." - GCModeFull := 1. - GCModeIncr := 2. - GCModeBecome := 3. - PrimTraceLogSize := 256. "Room for 256 selectors. Must be 256 because we use a byte to hold the index" TraceBufferSize := 256 * 3. "Room for 256 events" TraceContextSwitch := self objectMemoryClass basicNew integerObjectOf: 1. TraceBlockActivation := self objectMemoryClass basicNew integerObjectOf: 2. TraceBlockCreation := self objectMemoryClass basicNew integerObjectOf: 3. TraceIncrementalGC := self objectMemoryClass basicNew integerObjectOf: 4. TraceFullGC := self objectMemoryClass basicNew integerObjectOf: 5. TraceCodeCompaction := self objectMemoryClass basicNew integerObjectOf: 6. TraceOwnVM := self objectMemoryClass basicNew integerObjectOf: 7. TraceDisownVM := self objectMemoryClass basicNew integerObjectOf: 8. TraceThreadSwitch := self objectMemoryClass basicNew integerObjectOf: 9. TracePreemptDisowningThread := self objectMemoryClass basicNew integerObjectOf: 10. TraceVMCallback := self objectMemoryClass basicNew integerObjectOf: 11. TraceVMCallbackReturn := self objectMemoryClass basicNew integerObjectOf: 12. TraceStackOverflow := self objectMemoryClass basicNew integerObjectOf: 13. TraceIsFromMachineCode := 1. TraceIsFromInterpreter := 2. CSCallbackEnter := 3. CSCallbackLeave := 4. CSEnterCriticalSection := 5. CSExitCriticalSection := 6. CSResume := 7. CSSignal := 8. CSSuspend := 9. CSWait := 10. CSYield := 11. CSCheckEvents := 12. CSThreadSchedulingLoop := 13. CSOwnVM := 14. CSThreadBind := 15. CSSwitchIfNeccessary := 16. TraceSources := CArrayAccessor on: #('?' 'm' 'i' 'callbackEnter' 'callbackLeave' 'enterCritical' 'exitCritical' 'resume' 'signal' 'suspend' 'wait' 'yield' 'eventcheck' 'threadsched' 'ownVM' 'bindToThread' 'switchIfNecessary'). "this is simulation only" RumpCStackSize := 4096! Item was added: + ----- Method: CoInterpreter class>>isAcceptableAncilliaryClass: (in category 'translation') ----- + isAcceptableAncilliaryClass: aClass + ^aClass ~~ InterpreterStackPages! Item was added: + ----- Method: CoInterpreter>>gcMode (in category 'object memory support') ----- + gcMode + ^gcMode! Item was removed: - ----- Method: CoInterpreter>>isReallyYoungObject: (in category 'cog jit support') ----- - isReallyYoungObject: obj - <api> - "For machine code assertion checking. Answer true if not in a fullGC and obj is young." - ^gcMode ~= GCModeFull - and: [self oop: obj isGreaterThanOrEqualTo: objectMemory youngStart]! Item was removed: - ----- Method: CoInterpreter>>postGCAction (in category 'object memory support') ----- - postGCAction - "Shrink free memory, signal the gc semaphore and let the Cogit do its post GC thang" - | freeSizeNow | - - freeSizeNow := objectMemory freeSize. - (freeSizeNow > objectMemory shrinkThreshold - and: [freeSizeNow > objectMemory growHeadroom]) ifTrue: - ["Attempt to shrink memory after successfully reclaiming lots of memory" - objectMemory shrinkObjectMemory: freeSizeNow - objectMemory growHeadroom]. - - cogit cogitPostGCAction: gcMode. - - self signalSemaphoreWithIndex: gcSemaphoreIndex. - - lastCoggableInterpretedBlockMethod := lastUncoggableInterpretedBlockMethod := nil. - - gcMode := 0! Item was added: + ----- Method: CoInterpreter>>postGCAction: (in category 'object memory support') ----- + postGCAction: gcModeArg + "Attempt to shrink free memory, signal the gc semaphore and let the Cogit do its post GC thang" + self assert: gcModeArg = gcMode. + super postGCAction: gcModeArg. + cogit cogitPostGCAction: gcModeArg. + lastCoggableInterpretedBlockMethod := lastUncoggableInterpretedBlockMethod := nil. + gcMode := 0! Item was added: + ----- Method: CogObjectRepresentation>>isImmediate: (in category 'testing') ----- + isImmediate: oop + <doNotGenerate> + ^objectMemory isImmediate: oop! Item was removed: - ----- Method: CogObjectRepresentationForSpur>>isImmediate: (in category 'object representation') ----- - isImmediate: oop - ^objectMemory isImmediate: oop! Item was removed: - ----- Method: CogObjectRepresentationForSqueakV3>>isImmediate: (in category 'object representation') ----- - isImmediate: anOop - ^objectMemory isIntegerObject: anOop! Item was changed: ----- Method: Cogit>>checkIfValidObjectRefAndTarget:pc:cogMethod: (in category 'garbage collection') ----- checkIfValidObjectRefAndTarget: annotation pc: mcpc cogMethod: cogMethod <var: #mcpc type: #'char *'> | literal cacheTag entryPoint offset targetMethod | <var: #targetMethod type: #'CogMethod *'> annotation = IsObjectReference ifTrue: [literal := backEnd literalBeforeFollowingAddress: mcpc asInteger. (self asserta: (objectRepresentation checkValidObjectReference: literal)) ifFalse: [^1]. ((objectRepresentation couldBeObject: literal) + and: [objectMemory isReallyYoungObject: literal]) ifTrue: - and: [coInterpreter isReallyYoungObject: literal]) ifTrue: [(self asserta: (self cCoerceSimple: cogMethod to: #'CogMethod *') cmRefersToYoung) ifFalse: [^2]]]. (self isSendAnnotation: annotation) ifTrue: [(self asserta: (self cCoerceSimple: cogMethod to: #'CogMethod *') cmType = CMMethod) ifFalse: [^3]. cacheTag := backEnd inlineCacheTagAt: mcpc asInteger. (self asserta: (objectRepresentation checkValidInlineCacheTag: cacheTag)) ifFalse: [^4]. ((objectRepresentation couldBeObject: cacheTag) and: [coInterpreter isReallyYoungObject: cacheTag]) ifTrue: [(self asserta: (self cCoerceSimple: cogMethod to: #'CogMethod *') cmRefersToYoung) ifFalse: [^5]]. entryPoint := backEnd callTargetFromReturnAddress: mcpc asInteger. entryPoint > methodZoneBase ifTrue: ["It's a linked send; find which kind." self offsetAndSendTableFor: entryPoint annotation: annotation into: [:off :table| offset := off]. targetMethod := self cCoerceSimple: entryPoint - offset to: #'CogMethod *'. (self asserta: (targetMethod cmType = CMMethod or: [targetMethod cmType = CMClosedPIC or: [targetMethod cmType = CMOpenPIC]])) ifFalse: [^6]]]. ^0 "keep scanning"! Item was changed: ----- Method: Cogit>>mapObjectReferencesInMachineCode: (in category 'jit - api') ----- mapObjectReferencesInMachineCode: gcMode <api> "Update all references to objects in machine code." gcMode caseOf: { + [GCModeScavenge] -> [self mapObjectReferencesInMachineCodeForIncrementalGC]. + [GCModeIncr] -> [self mapObjectReferencesInMachineCodeForScavenge]. + [GCModeFull] -> [self mapObjectReferencesInMachineCodeForFullGC]. + [GCModeBecome] -> [self mapObjectReferencesInMachineCodeForBecome] }. - [GCModeIncr] -> [self mapObjectReferencesInMachineCodeForIncrementalGC]. - [GCModeFull] -> [self mapObjectReferencesInMachineCodeForFullGC]. - [GCModeBecome] -> [self mapObjectReferencesInMachineCodeForBecome] }. (self asserta: methodZone freeStart <= methodZone youngReferrers) ifFalse: [self error: 'youngReferrers list overflowed']! Item was changed: ----- Method: FilePlugin>>primitiveFileSetPosition (in category 'file primitives') ----- primitiveFileSetPosition + | newPosition file | - | newPosition file sz | <var: 'file' type: 'SQFile *'> <var: 'newPosition' type: 'squeakFileOffsetType'> <export: true> + (interpreterProxy isIntegerObject: (interpreterProxy stackValue: 0)) ifFalse: + [(interpreterProxy byteSizeOf: (interpreterProxy stackValue: 0)) ~= (self sizeof: #squeakFileOffsetType) ifTrue: + [^interpreterProxy primitiveFail]]. - (interpreterProxy isImmediate: (interpreterProxy stackValue: 0)) ifFalse: - [sz := self cCode: 'sizeof(squeakFileOffsetType)'. - (interpreterProxy byteSizeOf: (interpreterProxy stackValue: 0)) > sz - ifTrue: [^interpreterProxy primitiveFail]]. newPosition := interpreterProxy positive64BitValueOf: (interpreterProxy stackValue: 0). file := self fileValueOf: (interpreterProxy stackValue: 1). + interpreterProxy failed ifFalse: + [self sqFile: file SetPosition: newPosition ]. + interpreterProxy failed ifFalse: + [interpreterProxy pop: 2] "pop position, file; leave rcvr on stack"! - interpreterProxy failed ifFalse:[ - self sqFile: file SetPosition: newPosition ]. - interpreterProxy failed ifFalse:[ - interpreterProxy pop: 2 "pop position, file; leave rcvr on stack" ].! Item was removed: - ----- Method: Interpreter>>postGCAction (in category 'object memory support') ----- - postGCAction - "Mark the active and home contexts as roots if old. This - allows the interpreter to use storePointerUnchecked to - store into them." - - compilerInitialized - ifTrue: [self compilerPostGC] - ifFalse: [(self oop: activeContext isLessThan: youngStart) - ifTrue: [self beRootIfOld: activeContext]. - (self oop: theHomeContext isLessThan: youngStart) - ifTrue: [self beRootIfOld: theHomeContext]]. - (self sizeOfFree: freeBlock) > shrinkThreshold - ifTrue: ["Attempt to shrink memory after successfully - reclaiming lots of memory" - self shrinkObjectMemory: (self sizeOfFree: freeBlock) - growHeadroom]. - - self signalSemaphoreWithIndex: gcSemaphoreIndex. - ! Item was added: + ----- Method: Interpreter>>postGCAction: (in category 'object memory support') ----- + postGCAction: gcModeArg + "Mark the active and home contexts as roots if old. This + allows the interpreter to use storePointerUnchecked to + store into them." + + compilerInitialized + ifTrue: [self compilerPostGC] + ifFalse: [(self oop: activeContext isLessThan: youngStart) + ifTrue: [self beRootIfOld: activeContext]. + (self oop: theHomeContext isLessThan: youngStart) + ifTrue: [self beRootIfOld: theHomeContext]]. + (self sizeOfFree: freeBlock) > shrinkThreshold + ifTrue: ["Attempt to shrink memory after successfully + reclaiming lots of memory" + self shrinkObjectMemory: (self sizeOfFree: freeBlock) - growHeadroom]. + + self signalSemaphoreWithIndex: gcSemaphoreIndex. + ! Item was added: + ----- Method: NewCoObjectMemory>>isReallyYoungObject: (in category 'cog jit support') ----- + isReallyYoungObject: obj + <api> + "For machine code assertion checking. Answer true if not in a fullGC and obj is young." + ^coInterpreter gcMode ~= GCModeFull + and: [self oop: obj isGreaterThanOrEqualTo: self youngStart]! Item was removed: - ----- Method: NewCoObjectMemorySimulator>>postGCAction (in category 'simulation only') ----- - postGCAction - "hack around the CoInterpreter/ObjectMemory split refactoring" - ^coInterpreter postGCAction! Item was added: + ----- Method: NewCoObjectMemorySimulator>>postGCAction: (in category 'simulation only') ----- + postGCAction: gcMode + "hack around the CoInterpreter/ObjectMemory split refactoring" + ^coInterpreter postGCAction: gcMode! Item was changed: ----- Method: NewObjectMemory>>fullGC (in category 'garbage collection') ----- fullGC "Do a mark/sweep garbage collection of the entire object memory. Free inaccessible objects but do not move them." <inline: false> fullGCLock > 0 ifTrue: [self warning: 'aborting fullGC because fullGCLock > 0'. ^self]. self runLeakCheckerForFullGC: true. self preGCAction: GCModeFull. needGCFlag := false. gcStartUsecs := self ioUTCMicrosecondsNow. statSweepCount := statMarkCount := statMkFwdCount := statCompMoveCount := 0. self clearRootsTable. self initWeakTableForIncrementalGC: false. youngStart := self startOfMemory. "process all of memory" self markPhase: true. "Sweep phase returns the number of survivors. Use the up-to-date version instead the one from startup." totalObjectCount := self sweepPhaseForFullGC. self runLeakCheckerForFullGC: true. self fullCompaction. statFullGCs := statFullGCs + 1. statGCEndUsecs := self ioUTCMicrosecondsNow. statFullGCUsecs := statFullGCUsecs + (statGCEndUsecs - gcStartUsecs). self capturePendingFinalizationSignals. youngStart := freeStart. "reset the young object boundary" + self postGCAction: GCModeFull. - self postGCAction. self runLeakCheckerForFullGC: true! Item was changed: ----- Method: NewObjectMemory>>incrementalGC (in category 'garbage collection') ----- incrementalGC "Do a mark/sweep garbage collection of just the young object area of object memory (i.e., objects above youngStart), using the root table to identify objects containing pointers to young objects from the old object area." | survivorCount weDidGrow | <inline: false> rootTableOverflowed ifTrue: ["root table overflow; cannot do an incremental GC because some roots are missing. (this should be very rare)" statRootTableOverflows := statRootTableOverflows + 1. ^self fullGC]. self runLeakCheckerForFullGC: false. coInterpreter preGCAction: GCModeIncr. needGCFlag := false. gcStartUsecs := self ioUTCMicrosecondsNow. statSweepCount := statMarkCount := statMkFwdCount := statCompMoveCount := 0. self initWeakTableForIncrementalGC: true. "implicitly process memory from youngStart to freeStart" self markPhase: false. self assert: weakRootCount <= WeakRootTableSize. 1 to: weakRootCount do: [:i| self finalizeReference: (weakRoots at: i)]. survivorCount := self sweepPhase. self runLeakCheckerForFullGC: false. self incrementalCompaction. statIncrGCs := statIncrGCs + 1. statGCEndUsecs := self ioUTCMicrosecondsNow. statIGCDeltaUsecs := statGCEndUsecs - gcStartUsecs. statIncrGCUsecs := statIncrGCUsecs + statIGCDeltaUsecs. self capturePendingFinalizationSignals. statRootTableCount := rootTableCount. statSurvivorCount := survivorCount. weDidGrow := false. (((survivorCount > tenuringThreshold) or: [rootTableCount >= RootTableRedZone]) or: [forceTenureFlag == true]) ifTrue: ["move up the young space boundary if * there are too many survivors: this limits the number of objects that must be processed on future incremental GC's * we're about to overflow the roots table: this limits the number of full GCs that may be caused by root table overflows in the near future" forceTenureFlag := false. statTenures := statTenures + 1. self clearRootsTable. ((self freeSize < growHeadroom) and: [gcBiasToGrow > 0]) ifTrue: [self biasToGrow. weDidGrow := true]. youngStart := freeStart]. + coInterpreter postGCAction: GCModeIncr. - coInterpreter postGCAction. self runLeakCheckerForFullGC: false. weDidGrow ifTrue: [self biasToGrowCheckGCLimit]! Item was removed: - ----- Method: NewObjectMemorySimulator>>postGCAction (in category 'simulation only') ----- - postGCAction - "hack around the CoInterpreter/ObjectMemory split refactoring" - ^coInterpreter postGCAction! Item was added: + ----- Method: NewObjectMemorySimulator>>postGCAction: (in category 'simulation only') ----- + postGCAction: gcMode + "hack around the CoInterpreter/ObjectMemory split refactoring" + ^coInterpreter postGCAction: gcMode! Item was removed: - ----- Method: NewspeakInterpreter>>postGCAction (in category 'object memory support') ----- - postGCAction - "Mark the active and home contexts as roots if old. This - allows the interpreter to use storePointerUnchecked to - store into them." - - activeContext < youngStart ifTrue: - [self beRootIfOld: activeContext]. - theHomeContext < youngStart ifTrue: - [self beRootIfOld: theHomeContext]. - (self sizeOfFree: freeBlock) > shrinkThreshold ifTrue: - ["Attempt to shrink memory after successfully reclaiming lots of memory" - self shrinkObjectMemory: (self sizeOfFree: freeBlock) - growHeadroom]. - - self signalSemaphoreWithIndex: gcSemaphoreIndex! Item was added: + ----- Method: NewspeakInterpreter>>postGCAction: (in category 'object memory support') ----- + postGCAction: gcModeArg + "Mark the active and home contexts as roots if old. This + allows the interpreter to use storePointerUnchecked to + store into them." + + activeContext < youngStart ifTrue: + [self beRootIfOld: activeContext]. + theHomeContext < youngStart ifTrue: + [self beRootIfOld: theHomeContext]. + (self sizeOfFree: freeBlock) > shrinkThreshold ifTrue: + ["Attempt to shrink memory after successfully reclaiming lots of memory" + self shrinkObjectMemory: (self sizeOfFree: freeBlock) - growHeadroom]. + + self signalSemaphoreWithIndex: gcSemaphoreIndex! Item was changed: ----- Method: ObjectMemory>>fullGC (in category 'garbage collection') ----- fullGC "Do a mark/sweep garbage collection of the entire object memory. Free inaccessible objects but do not move them." <inline: false> DoAssertionChecks ifTrue: [self reverseDisplayFrom: 0 to: 7. self clearLeakMapAndMapAccessibleObjects. self checkHeapIntegrity]. self preGCAction: GCModeFull. gcStartUsecs := self ioUTCMicrosecondsNow. statSweepCount := statMarkCount := statMkFwdCount := statCompMoveCount := 0. self clearRootsTable. self initWeakTableForIncrementalGC: false. youngStart := self startOfMemory. "process all of memory" self markPhase. "Sweep phase returns the number of survivors. Use the up-to-date version instead the one from startup." totalObjectCount := self sweepPhase. self fullCompaction. allocationCount := 0. statFullGCs := statFullGCs + 1. statGCEndTime := self ioMicroMSecs. statFullGCUsecs := statFullGCUsecs + (self ioUTCMicrosecondsNow - gcStartUsecs). self capturePendingFinalizationSignals. youngStart := freeBlock. "reset the young object boundary" + self postGCAction: GCModeFull. - self postGCAction. DoAssertionChecks ifTrue: [self clearLeakMapAndMapAccessibleObjects. self checkHeapIntegrity. self reverseDisplayFrom: 0 to: 7]! Item was changed: ----- Method: ObjectMemory>>incrementalGC (in category 'garbage collection') ----- incrementalGC "Do a mark/sweep garbage collection of just the young object area of object memory (i.e., objects above youngStart), using the root table to identify objects containing pointers to young objects from the old object area." | survivorCount weDidGrow | <inline: false> rootTableOverflowed ifTrue: ["root table overflow; cannot do an incremental GC because some roots are missing. (this should be very rare)" statRootTableOverflows := statRootTableOverflows + 1. ^self fullGC]. DoAssertionChecks ifTrue: [self reverseDisplayFrom: 8 to: 15. self checkHeapIntegrity. self checkInterpreterIntegrity. self validate]. self preGCAction: GCModeIncr. "incremental GC and compaction" gcStartUsecs := self ioUTCMicrosecondsNow. statSweepCount := statMarkCount := statMkFwdCount := statCompMoveCount := 0. self initWeakTableForIncrementalGC: true. self markPhase. self assert: weakRootCount <= WeakRootTableSize. 1 to: weakRootCount do:[:i| self finalizeReference: (weakRoots at: i)]. survivorCount := self sweepPhase. self incrementalCompaction. statAllocationCount := allocationCount. allocationCount := 0. statIncrGCs := statIncrGCs + 1. statGCEndTime := self ioMicroMSecs. statIGCDeltaUsecs := self ioUTCMicrosecondsNow - gcStartUsecs. statIncrGCUsecs := statIncrGCUsecs + statIGCDeltaUsecs. self capturePendingFinalizationSignals. self forceInterruptCheck. "Force an an interrupt check ASAP.We could choose to be clever here and only do this under certain time conditions. Keep it simple for now" statRootTableCount := rootTableCount. statSurvivorCount := survivorCount. weDidGrow := false. (((survivorCount > tenuringThreshold) or: [rootTableCount >= RootTableRedZone]) or: [forceTenureFlag == true]) ifTrue: ["move up the young space boundary if * there are too many survivors: this limits the number of objects that must be processed on future incremental GC's * we're about to overflow the roots table this limits the number of full GCs that may be caused by root table overflows in the near future" forceTenureFlag := false. statTenures := statTenures + 1. self clearRootsTable. (((self sizeOfFree: freeBlock) < growHeadroom) and: [gcBiasToGrow > 0]) ifTrue: [self biasToGrow. weDidGrow := true]. youngStart := freeBlock]. + self postGCAction: GCModeIncr. - self postGCAction. DoAssertionChecks ifTrue: [self validate. self checkHeapIntegrity. self checkInterpreterIntegrity. self reverseDisplayFrom: 8 to: 15]. weDidGrow ifTrue: [self biasToGrowCheckGCLimit]! Item was changed: ----- Method: ObjectMemory>>isImmediate: (in category 'interpreter access') ----- isImmediate: anOop + <api> ^self isIntegerObject: anOop! Item was changed: CogClass subclass: #SpurGenerationScavenger + instanceVariableNames: 'coInterpreter manager eden futureSpace pastSpace futureSurvivorStart rememberedSet rememberedSetSize previousRememberedSetSize weakList ephemeronList tenureCriterion tenureThreshold tenuringClassIndex tenuringProportion numRememberedEphemerons statTenures' - instanceVariableNames: 'coInterpreter manager eden futureSpace pastSpace futureSurvivorStart rememberedSet rememberedSetSize previousRememberedSetSize weakList ephemeronList tenureCriterion tenureThreshold tenuringClassIndex tenuringProportion numRememberedEphemerons' classVariableNames: 'RememberedSetLimit RememberedSetRedZone' poolDictionaries: 'SpurMemoryManagementConstants' category: 'VMMaker-SpurMemoryManager'! !SpurGenerationScavenger commentStamp: 'eem 9/30/2013 11:05' prior: 0! SpurGenerationScavenger is an implementation of David Ungar's Generation Scavenging garbage collection algorithm. See Generation Scavenging, A Non-disruptive, High-Performance Storage Reclamation Algorithm David Ungar Proceeding SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments Pages 157 - 167 ACM New York, NY, USA ©1984 Also relevant are An adaptive tenuring policy for generation scavengers David Ungar & Frank Jackson ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive Volume 14 Issue 1, Jan. 1992 Pages 1 - 27 ACM New York, NY, USA ©1992 and Ephemerons: a new finalization mechanism Barry Hayes Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications Pages 176-183 ACM New York, NY, USA ©1997 See text below the variable definitions and explanation below for a full explanation of weak and ephemeron processing. Instance Variables coInterpreter: <StackInterpreterSimulator|CogVMSimulator> eden: <SpurNewSpaceSpace> ephemeronList: <Integer|nil> futureSpace: <SpurNewSpaceSpace> futureSurvivorStart: <Integer address> manager: <SpurMemoryManager|Spur32BitMMLESimulator et al> numRememberedEphemerons: <Integer> pastSpace: <SpurNewSpaceSpace> previousRememberedSetSize: <Integer> rememberedSet: <CArrayAccessor on: Array> rememberedSetSize: <Integer> tenuringProportion: <Float> tenuringThreshold: <Integer address> weakList: <Integer|nil> coInterpreter - the interpreter/vm, in this context, the mutator manager - the Spur memory manager eden - the space containing newly created objects futureSpace - the space to which surviving objects are copied during a scavenge futureSurvivorStart - the allocation pointer into futureSpace pastSpace - the space surviving objects live in until the next scavenge rememberedSet - the root old space objects that refer to objects in new space; a scavenge starts form these roots and the interpreter's stack rememberedSetSize - the size of the remembered set, also the first unused index in the rememberedSet previousRememberedSetSize: - the size of the remembered set before scavenging objects in future space. numRememberedEphemerons - the number of unscavenged ephemerons at the front of the rememberedSet. ephemeronList - the head of the list of corpses of unscavenged ephemerons reached in the current phase weakList - the head of the list of corpses of weak arrays reached during the scavenge. tenuringProportion - the amount of pastSpace below which the system will not tenure unless futureSpace fills up, and above which it will eagerly tenure tenuringThreshold - the pointer into pastSpace below which objects will be tenured Weakness and Ephemerality in the Scavenger. Weak arrays should not hold onto their referents (except from their strong fileds, their named inst vars). Ephemerons are objects that implement instance-based finalization; attaching an ephemeron to an object keeps that object alive and causes the ephemeron to "fire" when the object is only reachable from the ephemeron (or other ephemerons & weak arrays). They are a special kind of Associations that detect when their keys are about to die, i.e. when an ephemeron's key is not reachable from the roots except from weak arrays and other ephemerons with about-to-die keys. Note that if an ephemeron's key is not about to die then references from the rest of the ephemeron can indeed prevent ephemeron keys from dying. The scavenger is concerned with collecting objects in new space, therefore it ony deals with weak arrays and ephemerons that are either in the remembered set or in new space. By deferring scanning these objects until other reachable objects have been scavenged, the scavenger can detect dead or dying references. Weak Array Processing In the case of weak arrays this is simple. The scavenger refuses to scavenge the referents of weak arrays in scavengeReferentsOf: until the entire scavenge is over. It then scans the weak arrays in the remembered set and in future space and nils all fields in them that are referring to unforwarded objects in eden and past space, because these objects have not survived the scavenge. The root weak arrays remaining to be scavenged are in the remembered table. Surviving weak arrays in future space are collected on a list. The list is threaded through the corpses of weak arrays in eden and/or past space. weakList holds the slot offset of the first weak array found in eden and/or past space. The next offset is stored in the weak array corpse's identityHash and format fields (22 bits & 5 bits of allocationUnits, for a max new space size of 2^28 bytes, 256Mb). The list is threaded throguh corpses, but the surviving arrays are pointed to by the corpses' forwarding pointers. Ephemeron Processing The case of ephemerons is a little more complicated because an ephemeron's key should survive. The scavenger is cyclical. It scavenges the remembered set, which may copy and forward surviving objects in past and/or eden spaces to future space. It then scavenges those promoted objects in future space until no more are promoted, which may in turn remember more objects. The cycles continue until no more objects get promoted to future space and no more objects get remembered. At this point all surviving objecta are in futureSpace. So if the scavenger does not scan ephemerons in the remembered set or in future space until the scavenger finishes cycling, it can detect ephemerons whose keys are about to die because these will be unforwarded objects in eden and/or past space. Ephemerons encountered in the remembered set are either processed like ordinary objects if their keys have been promoted to futureSpace, or are moved to the front of the rememberedSet (because, dear reader, it is a sequence) if their keys have not been promoted. Ephemerons encountered in scavengeReferentsOf: are either scanned like normal objects if their keys have been promoted, or added to the ephemeronList, organized identically to the weakList, if their keys are yet to be promoted. Since references from other ephemerons with surviving keys to ephemeron keys can and should prevent the ephemerons whose keys they are from firing the scavenger does not fire ephemerons unless all unscavenged ephemerons have unscavenged keys. So the unscavenged ephemerons (the will be at the beginning of the remembered set and on the ephemeronList) are scanned and any that have promoted keys are scavenged. But if no unscavenged ephemerons have surviving keys then all the unscavenged ephemerons are fired and then scavenged. This in turn may remember more objects and promote more objects to future space, and encounter more unscavenged ephemerons. So the scavenger continues until no more objects are remembered, no more objects are promoted to future space and no more unscavenged ephemerons exist.! Item was changed: ----- Method: SpurGenerationScavenger>>addToEphemeronList: (in category 'weakness and ephemerality') ----- addToEphemeronList: ephemeronCorpse "ephemeronCorpse is the corpse of an ephemeron that was copied and forwarded. Later on its surviving copy must be scanned to nil weak references. Thread the corpse onto the weakList. Later, the weakList can be followed, and the forwarding pointer followed to locate the survivor." <inline: false> | ephemeronListOffset | - self assert: (manager isYoung: ephemeronCorpse). - self assert: (manager isForwarded: ephemeronCorpse). self assert: (self isScavengeSurvivor: (manager keyOfEphemeron: (manager followForwarded: ephemeronCorpse))) not. ephemeronListOffset := ephemeronList ifNil: 0. self setCorpseOffsetOf: ephemeronCorpse to: ephemeronListOffset. ephemeronList := self corpseOffsetOf: ephemeronCorpse. self assert: (self firstCorpse: ephemeronList) = ephemeronCorpse! Item was changed: ----- Method: SpurGenerationScavenger>>addToWeakList: (in category 'weakness and ephemerality') ----- addToWeakList: weakCorpse "weakCorpse is the corpse of a weak array that was copied and forwarded. Later on its surviving copy must be scanned to nil weak references. Thread the corpse onto the weakList. Later, the weakList can be followed, and the forwarding pointer followed to locate the survivor." <inline: false> | weakListOffset | - self assert: (manager isYoung: weakCorpse). - self assert: (manager isForwarded: weakCorpse). weakListOffset := weakList ifNil: 0. self setCorpseOffsetOf: weakCorpse to: weakListOffset. weakList := self corpseOffsetOf: weakCorpse. self assert: (self firstCorpse: weakList) = weakCorpse! Item was changed: ----- Method: SpurGenerationScavenger>>copyToOldSpace: (in category 'scavenger') ----- copyToOldSpace: survivor "Copy survivor to oldSpace. Answer the new oop of the object." <inline: true> | numSlots newOop | + statTenures := statTenures + 1. self flag: 'why not just pass header??'. numSlots := manager numSlotsOf: survivor. newOop := manager allocateSlotsInOldSpace: numSlots format: (manager formatOf: survivor) classIndex: (manager classIndexOf: survivor). newOop ifNil: [self error: 'out of memory']. manager mem: newOop + manager baseHeaderSize cp: survivor + manager baseHeaderSize y: numSlots * manager wordSize. self remember: newOop. manager setIsRememberedOf: newOop to: true. ^newOop! Item was changed: ----- Method: SpurGenerationScavenger>>initialize (in category 'initialization') ----- initialize pastSpace := SpurNewSpaceSpace new. futureSpace := SpurNewSpaceSpace new. eden := SpurNewSpaceSpace new. rememberedSet := CArrayAccessor on: (Array new: RememberedSetLimit). rememberedSetSize := 0. tenureThreshold := 0. + statTenures := 0! - tenuringProportion := 0.9! Item was changed: ----- Method: SpurGenerationScavenger>>newSpaceStart:newSpaceBytes:edenBytes: (in category 'initialization') ----- newSpaceStart: startAddress newSpaceBytes: totalBytes edenBytes: requestedEdenBytes | actualEdenBytes survivorBytes | actualEdenBytes := requestedEdenBytes. survivorBytes := totalBytes - actualEdenBytes // 2 truncateTo: manager allocationUnit. actualEdenBytes := totalBytes - survivorBytes - survivorBytes truncateTo: manager allocationUnit. self assert: totalBytes - actualEdenBytes - survivorBytes - survivorBytes < manager allocationUnit. "for tenuring we require older objects below younger objects. since allocation grows up this means that the survivor spaces must preceed eden." pastSpace start: startAddress; limit: startAddress + survivorBytes. futureSpace start: pastSpace limit; limit: pastSpace limit + survivorBytes. eden start: futureSpace limit; limit: futureSpace limit + actualEdenBytes. self assert: futureSpace limit <= (startAddress + totalBytes). self assert: eden start \\ manager allocationUnit + (eden limit \\ manager allocationUnit) = 0. self assert: pastSpace start \\ manager allocationUnit + (pastSpace limit \\ manager allocationUnit) = 0. self assert: futureSpace start \\ manager allocationUnit + (futureSpace limit \\ manager allocationUnit) = 0. self initFutureSpaceStart. + manager initSpaceForAllocationCheck: (self addressOf: eden). + + tenuringProportion := 0.9! - manager initSpaceForAllocationCheck: (self addressOf: eden)! Item was changed: ----- Method: SpurGenerationScavenger>>processEphemerons (in category 'weakness and ephemerality') ----- processEphemerons "There are ephemerons to be scavenged. Scavenge them and fire any whose keys are still in pastSpace and/or eden. The unscavenged ephemerons in this cycle can only be fired if all the unscavenged ephemerons in this cycle are firable, because references to ephemeron keys from unfired ephemerons should prevent the ephemerons with those keys from firing. So scavenge ephemerons with surviving keys, and only if none are found, fire ephemerons with unreferenced keys, and scavenge them. Read the class comment for a more in-depth description of the algorithm." + <inline: false> | unfiredEphemeronsScavenged | unfiredEphemeronsScavenged := self scavengeUnfiredEphemeronsInRememberedSet. self scavengeUnfiredEphemeronsOnEphemeronList ifTrue: [unfiredEphemeronsScavenged := true]. unfiredEphemeronsScavenged ifFalse: [self fireEphemeronsInRememberedSet. self fireEphemeronsOnEphemeronList]! Item was changed: ----- Method: SpurGenerationScavenger>>processWeaklings (in category 'weakness and ephemerality') ----- processWeaklings "Go through the remembered set and the weak list, nilling references to any objects that didn't survive the scavenge. Read the class comment for a more in-depth description of the algorithm." + <inline: false> | i rootObj weakCorpse weakObj | i := 0. [i < rememberedSetSize] whileTrue: [rootObj := rememberedSet at: i. (manager isWeakNonImm: rootObj) ifTrue: [self processWeakSurvivor: rootObj. "If no more referents, remove by overwriting with the last element in the set." (manager hasYoungReferents: rootObj) ifFalse: [manager setIsRememberedOf: rootObj to: false. i + 1 < rememberedSetSize ifTrue: [rememberedSet at: i put: (rememberedSet at: rememberedSetSize - 1)]. rememberedSetSize := rememberedSetSize - 1] ifTrue: [i := i + 1]] ifFalse: [i := i + 1]]. weakList ifNotNil: [weakCorpse := self firstCorpse: weakList. [weakCorpse notNil] whileTrue: [self assert: (manager isForwarded: weakCorpse). weakObj := manager followForwarded: weakCorpse. self processWeakSurvivor: weakObj. weakCorpse := self nextCorpseOrNil: weakCorpse]. weakList := nil]! Item was changed: ----- Method: SpurGenerationScavenger>>scavengeFutureSurvivorSpaceStartingAt: (in category 'scavenger') ----- scavengeFutureSurvivorSpaceStartingAt: initialAddress "scavengeFutureSurvivorSpaceStartingAt: does a depth-first traversal of the new objects starting at the one at initialAddress in futureSurvivorSpace." + <inline: false> | ptr obj | ptr := initialAddress. [ptr < futureSurvivorStart] whileTrue: [obj := manager objectStartingAt: ptr. ptr := manager addressAfter: obj. self cCoerceSimple: (self scavengeReferentsOf: obj) to: #void]! Item was changed: ----- Method: SpurGenerationScavenger>>scavengeLoop (in category 'scavenger') ----- scavengeLoop "This is the inner loop of the main routine, scavenge. It first scavenges the new objects immediately reachable from old ones. Then it scavenges those that are transitively reachable. If this results in a promotion, the promotee gets remembered, and it first scavenges objects adjacent to the promotee, then scavenges the ones reachable from the promoted. This loop continues until no more reachable objects are left. At that point, pastSurvivorSpace is exchanged with futureSurvivorSpace. Notice that each pointer in a live object is inspected once and only once. The previousRememberedSetSize and previousFutureSurvivorSpaceLimit variables ensure that no object is scanned twice, as well as detecting closure. If this were not true, some pointers might get forwarded twice. An extension of the algorithm presented in David's original paper is to handle weak arrays and ephemerons. Weak arrays should not have their weak referents scavenged unless there are strong references to them. Ephemerons should fire if their key is not reachable other than from ephemerons and weak arrays. Handle this by maintaining a list for weak arrays and a list for ephemerons, which allow scavenging these objects once all other objects in new space have been scavenged, hence allowing the scavenger to detect which referents in new space of weak arrays are dead and of ephemeron keys are only live due to ephemerons. Read the class comment for a more in-depth description of the algorithm." + <inline: false> + <returnTypeC: #void> - | previousFutureSurvivorStart firstTime | self assert: futureSurvivorStart = futureSpace start. "future space should be empty at the start" weakList := ephemeronList := nil. numRememberedEphemerons := 0. firstTime := true. previousRememberedSetSize := 0. previousFutureSurvivorStart := futureSurvivorStart. [self scavengeRememberedSetStartingAt: previousRememberedSetSize. previousRememberedSetSize := rememberedSetSize. firstTime ifTrue: [coInterpreter mapInterpreterOops. manager mapExtraRoots. firstTime := false]. "if nothing more copied and forwarded (or remembered by mapInterpreterOops) to scavenge, and no ephemerons to process, scavenge is done." (previousRememberedSetSize = rememberedSetSize and: [previousFutureSurvivorStart = futureSurvivorStart and: [numRememberedEphemerons = 0 and: [ephemeronList isNil]]]) ifTrue: [^self]. self scavengeFutureSurvivorSpaceStartingAt: previousFutureSurvivorStart. previousFutureSurvivorStart := futureSurvivorStart. "no more roots created to scavenge..." previousRememberedSetSize = rememberedSetSize ifTrue: [(numRememberedEphemerons = 0 and: [ephemeronList isNil]) ifTrue: [^self]. "no ephemerons to process, scavenge is done." "all reachable objects in this cycle have been promoted to futureSpace. ephemerons can now be processed." self processEphemerons]] repeat! Item was changed: ----- Method: SpurGenerationScavenger>>scavengeRememberedSetStartingAt: (in category 'scavenger') ----- scavengeRememberedSetStartingAt: n "scavengeRememberedSetStartingAt: n traverses objects in the remembered set starting at the nth one. If the object does not refer to any new objects, it is removed from the set. Otherwise, its new referents are scavenged. Defer scavenging ephemerons until after a complete scavenge has been performed, so that triggered ephemerons can be fired. Move them to the front of the set and count them in numRememberedEphemerons for later scanning." + <inline: false> | destIndex sourceIndex referrer | sourceIndex := destIndex := n. [sourceIndex < rememberedSetSize] whileTrue: ["*Don't* follow forwarding pointers here. oldSpace objects may refer to these roots, and so they can't be removed in the scavenge." referrer := rememberedSet at: sourceIndex. "Any potential firing ephemerons should not be scanned yet. Move any to the front of the set to save time in later scanning." ((manager isEphemeron: referrer) and: [(self isScavengeSurvivor: ((manager keyOfEphemeron: referrer))) not]) ifTrue: [self assert: destIndex >= numRememberedEphemerons. rememberedSet at: destIndex put: (rememberedSet at: numRememberedEphemerons); at: numRememberedEphemerons put: referrer. numRememberedEphemerons := numRememberedEphemerons + 1. destIndex := destIndex + 1] ifFalse: [(self scavengeReferentsOf: referrer) ifTrue: [rememberedSet at: destIndex put: referrer. destIndex := destIndex + 1] ifFalse: [manager setIsRememberedOf: referrer to: false]]. sourceIndex := sourceIndex + 1]. rememberedSetSize := destIndex. self assert: self noUnfiredEphemeronsAtEndOfRememberedSet! Item was changed: ----- Method: SpurGenerationScavenger>>setCorpseOffsetOf:to: (in category 'weakness and ephemerality') ----- setCorpseOffsetOf: corpse to: offset "Set the offset of the corpse's next corpse to offset. Use the identityHash and format fields to construct a 27 bit offset through non-future newSpace and use this to implement the list. 27 bits of 8 byte allocationUnits units is 2 ^ 30 bytes or 1Gb, big enough for newSpace for a good few years yet." + + self assert: (manager isYoung: corpse). + self assert: (manager isForwarded: corpse). manager setHashBitsOf: corpse to: offset >> manager formatFieldWidthShift; setFormatOf: corpse to: (offset bitAnd: manager formatMask)! Item was added: + ----- Method: SpurGenerationScavenger>>statTenures (in category 'accessing') ----- + statTenures + ^statTenures! Item was changed: CogClass subclass: #SpurMemoryManager (excessive size, no diff calculated) Item was changed: ----- Method: SpurMemoryManager>>addressCouldBeObj: (in category 'debug support') ----- addressCouldBeObj: address <api> + <inline: false> ^(address bitAnd: self baseHeaderSize - 1) = 0 and: [(self isInOldSpace: address) or: [(self isInEden: address) or: [(self isInSurvivorSpace: address) + or: [scavengeInProgress and: [self isInFutureSpace: address]]]]]! - "or: [scavengeInProgress and: [self isInFutureSpace: address]"]]]! Item was changed: ----- Method: SpurMemoryManager>>bestFitCompact (in category 'compaction') ----- bestFitCompact "Compact all of memory using best-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects." <returnTypeC: #void> <inline: false> | freePriorToExactFit | freePriorToExactFit := totalFreeOldSpace. self exactFitCompact. highestObjects isEmpty ifTrue: [^self]. "either no high objects, or no misfits." + statCompactPassCount := statCompactPassCount + 1. highestObjects reverseDo: [:o| | b | self assert: ((self isForwarded: o) or: [self isPinned: o]) not. b := self bytesInObject: o. (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: [:f| self mem: f cp: o y: ((self hasOverflowHeader: o) ifTrue: [b - self baseHeaderSize] ifFalse: [b]). (self isRemembered: o) ifTrue: [scavenger remember: f]. self forward: o to: f]]. self allOldSpaceObjectsFrom: firstFreeChunk do: [:o| | b | ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. (self allocateOldSpaceChunkOfBytes: b suchThat: [:f| f < o]) ifNotNil: [:f| self mem: f cp: o y: ((self hasOverflowHeader: o) ifTrue: [b - self baseHeaderSize] ifFalse: [b]). (self isRemembered: o) ifTrue: [scavenger remember: f]. self forward: o to: f]]]. self checkFreeSpace self touch: freePriorToExactFit! Item was changed: ----- Method: SpurMemoryManager>>characterObjectOf: (in category 'object access') ----- + characterObjectOf: characterCode + <api> - characterObjectOf: characterCode ^characterCode << self numTagBits + self characterTag! Item was changed: ----- Method: SpurMemoryManager>>exactFitCompact (in category 'compaction') ----- exactFitCompact "Compact all of memory above firstFreeChunk using exact-fit, assuming free space is sorted and that the highest objects are recorded in highestObjects. Note that we don't actually move; we merely copy and forward. Eliminating forwarders will be done in a final pass. Leave the objects that don't fit exactly, and hence aren't moved, in highestObjects." <returnTypeC: #void> <inline: false> | failures first | <var: #failures type: #usqInt> totalFreeOldSpace = 0 ifTrue: [^0]. failures := highestObjects last + self wordSize. + [statCompactPassCount := statCompactPassCount + 1. + highestObjects from: failures - self wordSize reverseDo: - [highestObjects from: failures - self wordSize reverseDo: [:o| | b | o < firstFreeChunk ifTrue: [failures = (highestObjects last + self wordSize) ifTrue: [highestObjects resetAsEmpty] ifFalse: [highestObjects first: failures]. ^self]. ((self isForwarded: o) or: [self isPinned: o]) ifFalse: [b := self bytesInObject: o. (self allocateOldSpaceChunkOfExactlyBytes: b suchThat: [:f| f < o]) ifNil: [failures := failures - self wordSize. failures < highestObjects start ifTrue: [failures := highestObjects limit]. self longAt: failures put: o] ifNotNil: [:f| self mem: f cp: o y: ((self hasOverflowHeader: o) ifTrue: [b - self baseHeaderSize] ifFalse: [b]). "wait until the next scavenge to unremember o" (self isRemembered: o) ifTrue: [scavenger remember: f]. self forward: o to: f]]]. "now highestObjects contains only failures, if any, from failures to last. set first to first failure and refill buffer. next cycle will add more failures. give up on exact-fit when half of the highest objects fail to fit." first := self longAt: highestObjects first. first > firstFreeChunk ifTrue: [| highestObjBytes failureBytes savedLimit | highestObjBytes := highestObjects limit - highestObjects start. failureBytes := highestObjects last >= failures ifTrue: [highestObjects last - failures] ifFalse: [highestObjBytes - (failures - highestObjects last)]. failureBytes >= (highestObjBytes // 2) ifTrue: [highestObjects first: failures. ^self]. savedLimit := self moveFailuresToTopOfHighestObjects: failures. self fillHighestObjectsWithMovableObjectsFrom: firstFreeChunk upTo: first. failures := self moveFailuresInHighestObjectsBack: savedLimit]] repeat! Item was changed: ----- Method: SpurMemoryManager>>forwardSurvivor:to: (in category 'become implementation') ----- forwardSurvivor: obj1 to: obj2 self assert: (self isInNewSpace: obj1). + self assert: (self isInFutureSpace: obj2). self storePointerUnchecked: 0 ofObject: obj1 withValue: obj2. self setFormatOf: obj1 to: self forwardedFormat. self setClassIndexOf: obj1 to: self isForwardedObjectClassIndexPun! Item was changed: ----- Method: SpurMemoryManager>>fullGC (in category 'gc - global') ----- fullGC + needGCFlag := false. + gcStartUsecs := self ioUTCMicrosecondsNow. + statMarkCount := 0. + self preGCAction: GCModeFull. + self globalGarbageCollect. + self postGCAction: GCModeFull. + statFullGCs := statFullGCs + 1. + statGCEndUsecs := self ioUTCMicrosecondsNow. + statFullGCUsecs := statFullGCUsecs + (statGCEndUsecs - gcStartUsecs).! - ^self globalGarbageCollect! Item was changed: ----- Method: SpurMemoryManager>>initialize (in category 'initialization') ----- initialize "We can put all initializations that set something to 0 or to false here. In C all global variables are initialized to 0, and 0 is false." remapBuffer := Array new: RemapBufferSize. remapBufferCount := extraRootCount := 0. "see below" freeListsMask := totalFreeOldSpace := lowSpaceThreshold := 0. checkForLeaks := 0. needGCFlag := signalLowSpace := scavengeInProgress := marking := false. becomeEffectsFlags := 0. statScavenges := statIncrGCs := statFullGCs := 0. statScavengeGCUsecs := statIncrGCUsecs := statFullGCUsecs := statGCEndUsecs := 0. statSGCDeltaUsecs := statIGCDeltaUsecs := statFGCDeltaUsecs := 0. + statGrowMemory := statShrinkMemory := statRootTableCount := statSurvivorCount := 0. + statRootTableOverflows := statMarkCount := statSpecialMarkCount := statCompactPassCount := statCoalesces := 0. - statGrowMemory := statShrinkMemory := statRootTableCount := statTenures := statSurvivorCount := 0. - statRootTableOverflows := statSweepCount := statMarkCount := statSpecialMarkCount := statMkFwdCount := 0. - statCoalesces := 0. "We can initialize things that are allocated but are lazily initialized." unscannedEphemerons := SpurContiguousObjStack new. highestObjects := SpurCircularBuffer new manager: self; yourself. "we can initialize things that are virtual in C." scavenger := SpurGenerationScavengerSimulator new manager: self; yourself. segmentManager := SpurSegmentManager new manager: self; yourself. "We can also initialize here anything that is only for simulation." heapMap := self wordSize = 4 ifTrue: [CogCheck32BitHeapMap new]. "N.B. We *don't* initialize extraRoots because we don't simulate it."! Item was changed: ----- Method: SpurMemoryManager>>isImmediate: (in category 'object testing') ----- + isImmediate: oop + <api> - isImmediate: oop ^(oop bitAnd: self tagMask) ~= 0! Item was changed: ----- Method: SpurMemoryManager>>isInEden: (in category 'object testing') ----- isInEden: objOop + ^self + oop: objOop + isGreaterThanOrEqualTo: scavenger eden start + andLessThan: freeStart! - ^objOop >= scavenger eden start - and: [objOop < freeStart]! Item was changed: ----- Method: SpurMemoryManager>>isInFutureSpace: (in category 'object testing') ----- + isInFutureSpace: address + ^self + oop: address + isGreaterThanOrEqualTo: scavenger futureSpace start + andLessThan: scavenger futureSurvivorStart! - isInFutureSpace: objOop - ^objOop >= scavenger futureSpace start - and: [objOop < scavenger futureSurvivorStart]! Item was changed: ----- Method: SpurMemoryManager>>isInOldSpace: (in category 'object testing') ----- + isInOldSpace: address + ^self + oop: address + isGreaterThanOrEqualTo: newSpaceLimit + andLessThan: freeOldSpaceStart! - isInOldSpace: address - ^address between: newSpaceLimit and: freeOldSpaceStart! Item was changed: ----- Method: SpurMemoryManager>>isInSurvivorSpace: (in category 'object testing') ----- + isInSurvivorSpace: address + ^self + oop: address + isGreaterThanOrEqualTo: scavenger pastSpace start + andLessThan: pastSpaceStart! - isInSurvivorSpace: objOop - ^objOop >= scavenger pastSpace start - and: [objOop < pastSpaceStart]! Item was changed: ----- Method: SpurMemoryManager>>isPinned: (in category 'header access') ----- isPinned: objOop + <api> ^((self longAt: objOop) >> self pinnedBitShift bitAnd: 1) ~= 0! Item was added: + ----- Method: SpurMemoryManager>>pinObject: (in category 'primitive support') ----- + pinObject: objOop + <api> + self shouldBeImplemented! Item was changed: ----- Method: SpurMemoryManager>>scavengingGCTenuringIf: (in category 'gc - scavenging') ----- scavengingGCTenuringIf: tenuringCriterion "Run the scavenger." self assert: remapBufferCount = 0. self assert: (segmentManager numSegments = 0 "true in the spur image bootstrap" or: [scavenger eden limit - freeStart > coInterpreter interpreterAllocationReserveBytes]). self checkFreeSpace. "coInterpreter printCallStackFP: coInterpreter framePointer" self runLeakCheckerForFullGC: false. coInterpreter + preGCAction: GCModeScavenge; - preGCAction: GCModeIncr; "would prefer this to be in mapInterpreterOops, but compatibility with ObjectMemory dictates it goes here." flushMethodCacheFrom: startOfMemory to: newSpaceLimit. needGCFlag := false. gcStartUsecs := coInterpreter ioUTCMicrosecondsNow. scavengeInProgress := true. pastSpaceStart := scavenger scavenge: tenuringCriterion. self assert: (self oop: pastSpaceStart isGreaterThanOrEqualTo: scavenger pastSpace start andLessThanOrEqualTo: scavenger pastSpace limit). freeStart := scavenger eden start. self initSpaceForAllocationCheck: (self addressOf: scavenger eden). scavengeInProgress := false. statScavenges := statScavenges + 1. statGCEndUsecs := coInterpreter ioUTCMicrosecondsNow. statSGCDeltaUsecs := statGCEndUsecs - gcStartUsecs. statScavengeGCUsecs := statScavengeGCUsecs + statSGCDeltaUsecs. statRootTableCount := scavenger rememberedSetSize. + coInterpreter postGCAction: GCModeScavenge. - coInterpreter postGCAction. self runLeakCheckerForFullGC: false. self checkFreeSpace! Item was changed: ----- Method: SpurMemoryManager>>statCompMoveCount (in category 'accessing') ----- statCompMoveCount + "Spur never compacts by moving; but it does make compaction passes." + ^statCompactPassCount! - "Spur never compacts by moving" - ^0! Item was changed: ----- Method: SpurMemoryManager>>statMkFwdCount (in category 'accessing') ----- statMkFwdCount + ^0! - ^statMkFwdCount! Item was changed: ----- Method: SpurMemoryManager>>statSweepCount (in category 'accessing') ----- statSweepCount + ^0! - ^statSweepCount! Item was changed: ----- Method: SpurMemoryManager>>statTenures (in category 'accessing') ----- statTenures + <doNotGenerate> + ^scavenger statTenures! - ^statTenures! Item was changed: ----- Method: StackInterpreter class>>initializeMiscConstants (in category 'initialization') ----- initializeMiscConstants super initializeMiscConstants. STACKVM := true. + GCModeFull := 1. + GCModeIncr := 2. + GCModeScavenge := 3. + GCModeBecome := 4. + DumpStackOnLowSpace := 0. PrimitiveExternalCallIndex := 117. "Primitive index for #primitiveExternalCall" MillisecondClockMask := 16r1FFFFFFF. "Note: The external primitive table should actually be dynamically sized but for the sake of inferior platforms (e.g., Mac :-) who cannot allocate memory in any reasonable way, we keep it static (and cross our fingers...)" MaxExternalPrimitiveTableSize := 4096. "entries" MaxJumpBuf := 32. "max. callback depth" FailImbalancedPrimitives := true! Item was changed: ----- Method: StackInterpreter class>>table:from: (in category 'initialization') ----- table: anArray from: specArray "SpecArray is an array of one of (index selector) or (index1 index2 selector) or (index nil) or (index1 index2 nil). If selector then the entry is the selector, but if nil the entry is the index." | contiguous | contiguous := 0. specArray do: [:spec | (spec at: 1) = contiguous ifFalse: [self error: 'Non-contiguous table entry']. spec size = 2 ifTrue: [anArray at: (spec at: 1) + 1 put: ((spec at: 2) ifNil: [spec at: 1] ifNotNil: [:sym| sym]). contiguous := contiguous + 1] ifFalse: [(spec at: 1) to: (spec at: 2) do: [:i | anArray at: i + 1 put: ((spec at: 3) ifNil: [i] ifNotNil: [:sym| sym])]. contiguous := contiguous + ((spec at: 2) - (spec at: 1)) + 1]]. anArray doWithIndex: [:entry :index| + entry isSymbol ifTrue: + [(self whichClassIncludesSelector: entry) ifNotNil: + [:c| | m | + m := c >> entry. + (m pragmaAt: #option:) ifNotNil: + [:pragma| + (initializationOptions at: (pragma arguments first) ifAbsent: [true]) ifFalse: + [anArray at: index put: 0]]]]]! - (self whichClassIncludesSelector: entry) ifNotNil: - [:c| | m | - m := c >> entry. - (m pragmaAt: #option:) ifNotNil: - [:pragma| - (initializationOptions at: (pragma arguments first) ifAbsent: [true]) ifFalse: - [anArray at: index put: 0]]]]! Item was changed: ----- Method: StackInterpreter class>>vmProxyMinorVersion (in category 'api version') ----- vmProxyMinorVersion "Define the VM_PROXY_MINOR version for this VM as used to define the api in platforms/Cross/vm/sqVirtualMachine.[ch]" + ^(initializationOptions at: #SpurObjectMemory ifAbsent: [false]) + ifTrue: [13] + ifFalse: [12]! - ^12! Item was changed: ----- Method: StackInterpreter>>lookupMethodInClass: (in category 'message sending') ----- lookupMethodInClass: class | currentClass dictionary found | <inline: false> + self assert: (self addressCouldBeClassObj: class). - self assert: class ~= objectMemory nilObject. currentClass := class. [currentClass ~= objectMemory nilObject] whileTrue: [dictionary := objectMemory fetchPointer: MethodDictionaryIndex ofObject: currentClass. dictionary = objectMemory nilObject ifTrue: ["MethodDict pointer is nil (hopefully due a swapped out stub) -- raise exception #cannotInterpret:." self createActualMessageTo: class. messageSelector := objectMemory splObj: SelectorCannotInterpret. self sendBreakpoint: messageSelector receiver: nil. ^self lookupMethodInClass: (self superclassOf: currentClass)]. found := self lookupMethodInDictionary: dictionary. found ifTrue: [^currentClass]. currentClass := self superclassOf: currentClass]. "Could not find #doesNotUnderstand: -- unrecoverable error." messageSelector = (objectMemory splObj: SelectorDoesNotUnderstand) ifTrue: [self error: 'Recursive not understood error encountered']. "Cound not find a normal message -- raise exception #doesNotUnderstand:" self createActualMessageTo: class. messageSelector := objectMemory splObj: SelectorDoesNotUnderstand. self sendBreak: messageSelector + BaseHeaderSize point: (objectMemory lengthOf: messageSelector) receiver: nil. ^self lookupMethodInClass: class! Item was changed: ----- Method: StackInterpreter>>mapInterpreterOops (in category 'object memory support') ----- mapInterpreterOops "Map all oops in the interpreter's state to their new values during garbage collection or a become: operation." "Assume: All traced variables contain valid oops." + <inline: false> self mapStackPages. self mapMachineCode. self mapTraceLogs. self mapVMRegisters. self mapProfileState. self remapCallbackState. (tempOop ~= 0 and: [objectMemory shouldRemapOop: tempOop]) ifTrue: [tempOop := objectMemory remapObj: tempOop]! Item was removed: - ----- Method: StackInterpreter>>postGCAction (in category 'object memory support') ----- - postGCAction - "Shrink free memory and signal the gc semaphore" - | freeSizeNow | - - freeSizeNow := objectMemory freeSize. - (freeSizeNow > objectMemory shrinkThreshold - and: [freeSizeNow > objectMemory growHeadroom]) ifTrue: - ["Attempt to shrink memory after successfully reclaiming lots of memory" - objectMemory shrinkObjectMemory: freeSizeNow - objectMemory growHeadroom]. - - self signalSemaphoreWithIndex: gcSemaphoreIndex! Item was added: + ----- Method: StackInterpreter>>postGCAction: (in category 'object memory support') ----- + postGCAction: gcModeArg + "Shrink free memory and signal the gc semaphore" + + (gcModeArg = GCModeFull or: [gcModeArg = GCModeIncr]) ifTrue:"but *not* become and *not* scavenge" + [| freeSizeNow | + freeSizeNow := objectMemory freeSize. + (freeSizeNow > objectMemory shrinkThreshold + and: [freeSizeNow > objectMemory growHeadroom]) ifTrue: + ["Attempt to shrink memory after successfully reclaiming lots of memory" + objectMemory shrinkObjectMemory: freeSizeNow - objectMemory growHeadroom]]. + + self signalSemaphoreWithIndex: gcSemaphoreIndex! Item was changed: ----- Method: StackInterpreterPrimitives>>primitiveVMParameter (in category 'system control primitives') ----- (excessive size, no diff calculated) Item was added: + ----- Method: TGoToNode>>nodesDo:parent: (in category 'enumerating') ----- + nodesDo: aBlock parent: parent + aBlock value: self value: parent! Item was added: + ----- Method: TLabeledCommentNode>>nodesDo:parent: (in category 'enumerating') ----- + nodesDo: aBlock parent: parent + aBlock value: self value: parent! Item was changed: SharedPool subclass: #VMBasicConstants instanceVariableNames: '' + classVariableNames: 'BaseHeaderSize Byte0Mask Byte0Shift Byte1Mask Byte1Shift Byte1ShiftNegated Byte2Mask Byte2Shift Byte3Mask Byte3Shift Byte3ShiftNegated Byte4Mask Byte4Shift Byte4ShiftNegated Byte5Mask Byte5Shift Byte5ShiftNegated Byte6Mask Byte6Shift Byte7Mask Byte7Shift Byte7ShiftNegated Bytes3to0Mask Bytes7to4Mask BytesPerOop BytesPerWord COGMTVM COGVM DisownVMLockOutFullGC DoAssertionChecks DoExpensiveAssertionChecks GCModeBecome GCModeFull GCModeIncr GCModeScavenge IMMUTABILITY MULTIPLEBYTECODESETS NewspeakVM PrimErrBadArgument PrimErrBadIndex PrimErrBadMethod PrimErrBadNumArgs PrimErrBadReceiver PrimErrGenericFailure PrimErrInappropriate PrimErrLimitExceeded PrimErrNamedInternal PrimErrNoCMemory PrimErrNoMemory PrimErrNoModification PrimErrNotFound PrimErrObjectIsPinned PrimErrObjectMayMove PrimErrUnsupported PrimNoErr STACKVM ShiftForWord VMBIGENDIAN' - classVariableNames: 'BaseHeaderSize Byte0Mask Byte0Shift Byte1Mask Byte1Shift Byte1ShiftNegated Byte2Mask Byte2Shift Byte3Mask Byte3Shift Byte3ShiftNegated Byte4Mask Byte4Shift Byte4ShiftNegated Byte5Mask Byte5Shift Byte5ShiftNegated Byte6Mask Byte6Shift Byte7Mask Byte7Shift Byte7ShiftNegated Bytes3to0Mask Bytes7to4Mask BytesPerOop BytesPerWord COGMTVM COGVM DisownVMLockOutFullGC DoAssertionChecks DoExpensiveAssertionChecks GCModeBecome GCModeFull GCModeIncr IMMUTABILITY MULTIPLEBYTECODESETS NewspeakVM PrimErrBadArgument PrimErrBadIndex PrimErrBadMethod PrimErrBadNumArgs PrimErrBadReceiver PrimErrGenericFailure PrimErrInappropriate PrimErrLimitExceeded PrimErrNamedInternal PrimErrNoCMemory PrimErrNoMemory PrimErrNoModification PrimErrNotFound PrimErrObjectIsPinned PrimErrObjectMayMove PrimErrUnsupported PrimNoErr STACKVM ShiftForWord VMBIGENDIAN' poolDictionaries: '' category: 'VMMaker-Interpreter'! !VMBasicConstants commentStamp: '<historical>' prior: 0! I am a shared pool for basic constants upon which the VM as a whole depends. self ensureClassPool. self classPool declare: #BytesPerWord from: VMSqueakV3ObjectRepresentationConstants classPool. self classPool declare: #BaseHeaderSize from: VMSqueakV3ObjectRepresentationConstants classPool (ObjectMemory classPool keys select: [:k| k beginsWith: 'Byte']) do: [:k| self classPool declare: k from: ObjectMemory classPool]! Item was added: + ----- Method: VMClass class>>isAcceptableAncilliaryClass: (in category 'translation') ----- + isAcceptableAncilliaryClass: aClass + ^true!

1 0

VM Maker: VMMaker.oscog-eem.477.mcz
by commits＠source.squeak.org 25 Oct '13

25 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.477.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.477 Author: eem Time: 25 October 2013, 12:57:49.906 pm UUID: b29f70be-1ead-4893-8f3c-f39b3d189a87 Ancestors: VMMaker.oscog-eem.476 Fix shift in headerForSlots:format:classIndex:; needs to be long long. Make a few vitals inlined. Fix off-by-one in printOopShortInner:. Relax restriction in isFunctional of return type being sqInt to being any of sqInt, usqInt, sqLong or usqLong. C Spur VM runs up to the end of the first scavenge, when it tries to shrink memory. =============== Diff against VMMaker.oscog-eem.476 =============== Item was changed: ----- Method: CogClass>>cCoerceSimple:to: (in category 'translation support') ----- cCoerceSimple: value to: cTypeString "Type coercion for translation and simulation. For simulation answer a suitable surrogate for the struct types" ^cTypeString caseOf: { [#'unsigned long'] -> [value]. [#sqInt] -> [value]. [#usqInt] -> [value]. + [#sqLong] -> [value]. + [#usqLong] -> [value]. [#'AbstractInstruction *'] -> [value]. [#'BytecodeFixup *'] -> [value]. [#'CogMethod *'] -> [value]. [#'char *'] -> [value]. [#'sqInt *'] -> [value]. [#'void *'] -> [value]. [#void] -> [value]. [#'void (*)()'] -> [value]. [#'void (*)(void)'] -> [value]. [#'unsigned long (*)(void)'] -> [value]. [#'void (*)(unsigned long,unsigned long)'] -> [value] }! Item was changed: ----- Method: Spur32BitMemoryManager>>fillObj:numSlots:with: (in category 'instantiation') ----- fillObj: objOop numSlots: numSlots with: fillValue + <inline: true> self assert: (objOop + self baseHeaderSize + (numSlots * self bytesPerOop) - 1) < (self addressAfter: objOop). objOop + self baseHeaderSize to: objOop + self baseHeaderSize + (numSlots * self wordSize) - 1 by: self allocationUnit do: [:p| self longAt: p put: fillValue; longAt: p + 4 put: fillValue]! Item was changed: ----- Method: Spur64BitMemoryManager>>fillObj:numSlots:with: (in category 'instantiation') ----- fillObj: objOop numSlots: numSlots with: fillValue + <inline: true> self assert: (objOop + self baseHeaderSize + (numSlots * self bytesPerOop) - 1) < (self addressAfter: objOop). objOop + self baseHeaderSize to: objOop + self baseHeaderSize + (numSlots * self bytesPerOop) - 1 by: self allocationUnit do: [:p| self longAt: p put: fillValue]! Item was changed: ----- Method: SpurMemoryManager>>checkedLongAt: (in category 'memory access') ----- checkedLongAt: byteAddress "Assumes zero-based array indexing." <api> + (byteAddress asUnsignedInteger < self startOfMemory + or: [byteAddress asUnsignedInteger > endOfMemory + or: [byteAddress asUnsignedInteger > newSpaceLimit + and: [(segmentManager isInSegments: byteAddress asUnsignedInteger) not]]]) ifTrue: - (self addressCouldBeObj: byteAddress) ifFalse: [self warning: 'checkedLongAt bad address'. coInterpreter primitiveFail]. ^self longAt: byteAddress! Item was changed: ----- Method: SpurMemoryManager>>headerForSlots:format:classIndex: (in category 'header format') ----- headerForSlots: numSlots format: formatField classIndex: classIndex "The header format in LSB is MSB: | 8: numSlots | (on a byte boundary) | 2 bits | (msb,lsb = {isMarked,?}) | 22: identityHash | (on a word boundary) | 3 bits | (msb <-> lsb = {isGrey,isPinned,isRemembered} | 5: format | (on a byte boundary) | 2 bits | (msb,lsb = {isImmutable,?}) | 22: classIndex | (on a word boundary) : LSB The remaining bits (7) are used for isImmutable (bit 23) isRemembered (bit 29) isPinned (bit 30) isGrey (bit 31) isMarked (bit 55) leaving 2 unused bits, each next to a 22-bit field, allowing those fields to be expanded to 23 bits.. The three bit field { isGrey, isPinned, isRemembered } is for bits that are never set in young objects. This allows the remembered table to be pruned when full by using these bits as a reference count of newSpace objects from the remembered table. Objects with a high count should be tenured to prune the remembered table." <returnTypeC: #usqLong> + <inline: true> + ^ ((self cCoerceSimple: numSlots to: #usqLong) << self numSlotsFullShift) - ^ (numSlots << self numSlotsFullShift) + (formatField << self formatShift) + classIndex! Item was changed: ----- Method: SpurMemoryManager>>unlinkSolitaryFreeTreeNode: (in category 'free space') ----- unlinkSolitaryFreeTreeNode: freeTreeNode "Unlink a freeTreeNode. Assumes the node has no list (null next link)." | parent smaller larger | self assert: (self fetchPointer: self freeChunkNextIndex ofObject: freeTreeNode) = 0. "case 1. interior node has one child, P = parent, N = node, S = subtree (mirrored for large vs small) ___ ___ | P | | P | _/_ _/_ | N | => | S | _/_ | S | case 2: interior node has two children, , P = parent, N = node, L = smaller, left subtree, R = larger, right subtree. add the left subtree to the bottom left of the right subtree (mirrored for large vs small) ___ ___ | P | | P | _/_ _/_ | N | => | R | _/_ _\_ _/_ | L | | R | | L |" smaller := self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: freeTreeNode. larger := self fetchPointer: self freeChunkLargerIndex ofFreeChunk: freeTreeNode. parent := self fetchPointer: self freeChunkParentIndex ofFreeChunk: freeTreeNode. parent = 0 ifTrue: "no parent; stitch the subnodes back into the root" [smaller = 0 ifTrue: [self storePointer: self freeChunkParentIndex ofFreeChunk: larger withValue: 0. freeLists at: 0 put: larger] ifFalse: [self storePointer: self freeChunkParentIndex ofFreeChunk: smaller withValue: 0. freeLists at: 0 put: smaller. larger ~= 0 ifTrue: [self addFreeSubTree: larger]]] ifFalse: "parent; stitch back into appropriate side of parent." [smaller = 0 ifTrue: [self storePointer: (freeTreeNode = (self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: parent) ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofFreeChunk: parent withValue: larger. + larger ~= 0 ifTrue: + [self storePointer: self freeChunkParentIndex + ofObject: larger + withValue: parent]] - self storePointer: self freeChunkParentIndex - ofObject: larger - withValue: parent] ifFalse: [self storePointer: (freeTreeNode = (self fetchPointer: self freeChunkSmallerIndex ofFreeChunk: parent) ifTrue: [self freeChunkSmallerIndex] ifFalse: [self freeChunkLargerIndex]) ofFreeChunk: parent withValue: smaller. self storePointer: self freeChunkParentIndex ofObject: smaller withValue: parent. larger ~= 0 ifTrue: [self addFreeSubTree: larger]]]! Item was changed: ----- Method: SpurSegmentManager>>isInSegments: (in category 'testing') ----- isInSegments: address + <var: #address type: #usqInt> 0 to: numSegments - 1 do: [:i| address < (segments at: i) segStart ifTrue: [^false]. address < ((segments at: i) segStart + (segments at: i) segSize) ifTrue: [^true]]. ^false! Item was changed: ----- Method: StackInterpreter>>nameOfClass: (in category 'debug printing') ----- nameOfClass: classOop "Brain-damaged nameOfClass: for C VM. Does *not* answer Foo class for metaclasses. Use e.g. classIsMeta: to avoid being fooled." <inline: false> <returnTypeC: 'char *'> | numSlots | numSlots := objectMemory numSlotsOf: classOop. numSlots = metaclassNumSlots ifTrue: [^self nameOfClass: (objectMemory fetchPointer: thisClassIndex ofObject: classOop)]. numSlots <= classNameIndex ifTrue: [^'bad class']. + ^objectMemory firstIndexableField: (objectMemory fetchPointer: classNameIndex ofObject: classOop)! - ^objectMemory firstFixedField: (objectMemory fetchPointer: classNameIndex ofObject: classOop)! Item was changed: ----- Method: StackInterpreter>>printOopShortInner: (in category 'debug printing') ----- printOopShortInner: oop | classOop name nameLen | <var: #name type: #'char *'> <inline: true> (objectMemory isImmediate: oop) ifTrue: [(objectMemory isImmediateCharacter: oop) ifTrue: [self printChar: $$; printChar: (objectMemory characterValueOf: oop); printChar: $(; printHex: (objectMemory integerValueOf: oop); printChar: $). ^nil]. self printNum: (objectMemory integerValueOf: oop); printChar: $(; printHex: (objectMemory integerValueOf: oop); printChar: $). ^nil]. (objectMemory addressCouldBeObj: oop) ifFalse: [self print: ((oop bitAnd: objectMemory allocationUnit - 1) ~= 0 ifTrue: [' is misaligned'] ifFalse: [' is not on the heap']); cr. ^nil]. (self isFloatObject: oop) ifTrue: [self printFloat: (self dbgFloatValueOf: oop). ^nil]. classOop := objectMemory fetchClassOfNonImm: oop. (objectMemory addressCouldBeObj: classOop) ifFalse: [self print: 'a ??'. ^nil]. (objectMemory numSlotsOf: classOop) = metaclassNumSlots ifTrue: [self printNameOfClass: oop count: 5. ^nil]. oop = objectMemory nilObject ifTrue: [self print: 'nil'. ^nil]. oop = objectMemory trueObject ifTrue: [self print: 'true'. ^nil]. oop = objectMemory falseObject ifTrue: [self print: 'false'. ^nil]. nameLen := self lengthOfNameOfClass: classOop. nameLen = 0 ifTrue: [self print: 'a ??'. ^nil]. name := self nameOfClass: classOop. nameLen = 10 ifTrue: [(self str: name n: 'ByteString' cmp: 10) not "strncmp is weird" ifTrue: [self printChar: $'; printStringOf: oop; printChar: $'. ^nil]. (self str: name n: 'ByteSymbol' cmp: 10) not "strncmp is weird" ifTrue: [self printChar: $#; printStringOf: oop. ^nil]]. (nameLen = 9 and: [(self str: name n: 'Character' cmp: 9) not]) ifTrue: [self printChar: $$; printChar: (objectMemory integerValueOf: (objectMemory fetchPointer: 0 ofObject: oop)). ^nil]. self print: 'a(n) '. + 0 to: nameLen - 1 do: [:i| self printChar: (name at: i)]. - 1 to: nameLen do: [:i| self printChar: (name at: i)]. "Try to spot association-like things; they're all subclasses of LookupKey" ((objectMemory instanceSizeOf: classOop) = (ValueIndex + 1) and: [(self superclassOf: classOop) = (self superclassOf: (objectMemory fetchClassOfNonImm: (objectMemory splObj: SchedulerAssociation))) and: [objectMemory isBytes: (objectMemory fetchPointer: KeyIndex ofObject: oop)]]) ifTrue: [self space; printOopShort: (objectMemory fetchPointer: KeyIndex ofObject: oop); print: ' -> '; printHex: (objectMemory fetchPointer: ValueIndex ofObject: oop)]! Item was changed: ----- Method: TMethod>>isFunctional (in category 'inlining') ----- isFunctional "Answer true if the receiver is a functional method. That is, if it consists of a single return statement of an expression that contains no other returns. + Answer false for methods with return types other than the simple + integer types to work around bugs in the inliner." - Answer false for methods with return types other than #sqInt to work - around bugs in the inliner." (parseTree statements size = 1 and: [parseTree statements last isReturn]) ifFalse: [ ^false ]. parseTree statements last expression nodesDo: [ :n | n isReturn ifTrue: [ ^false ]]. + ^#(sqInt usqInt sqLong usqLong) includes: returnType! - returnType = #sqInt ifFalse:[^false]. - ^true! Item was changed: ----- Method: TMethod>>maybeBreakFor:in: (in category 'inlining') ----- maybeBreakFor: aNode in: aCodeGen "convenient for debugging..." (aNode isSend and: [(aCodeGen breakSrcInlineSelector notNil or: [aCodeGen breakDestInlineSelector notNil]) and: [(aCodeGen breakSrcInlineSelector ifNil: [true] ifNotNil: [:srcSel| srcSel = aNode selector]) and: [aCodeGen breakDestInlineSelector ifNil: [true] ifNotNil: [:dstSel| dstSel = selector]]]]) ifTrue: + [self halt: selector]! - [self halt]!

1 0

VM Maker: VMMaker.oscog-eem.476.mcz
by commits＠source.squeak.org 25 Oct '13

25 Oct '13

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.476.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.476 Author: eem Time: 25 October 2013, 10:50:52.165 am UUID: b85d6f3c-f210-480d-883f-fbcc1be321d5 Ancestors: VMMaker.oscog-eem.475 Fix cascades to structs. Can't copy a struct and update the copy. Must take the address of the struct and indirect through it. This was causing C not to update the first segment's segStart. Fix SpurMemoryManager>>startOfMemory for C regime. Make a few methods non-inline for C-level debugging, etc. Make the primitive table creation code filter-out option: primitives with the wrong option:. Fix renaming of declarations and hence don't remove methods with declarations from the inlinable methods. =============== Diff against VMMaker.oscog-eem.475 =============== Item was changed: ----- Method: CoInterpreter>>readImageFromFile:HeapSize:StartingAt: (in category 'image save/restore') ----- readImageFromFile: f HeapSize: desiredHeapSize StartingAt: imageOffset "Read an image from the given file stream, allocating the given amount of memory to its object heap. Fail if the image has an unknown format or requires more than the given amount of memory." "Details: This method detects when the image was stored on a machine with the opposite byte ordering from this machine and swaps the bytes automatically. Furthermore, it allows the header information to start 512 bytes into the file, since some file transfer programs for the Macintosh apparently prepend a Mac-specific header of this size. Note that this same 512 bytes of prefix area could also be used to store an exec command on Unix systems, allowing one to launch Smalltalk by invoking the image name as a command." "This code is based on C code by Ian Piumarta and Smalltalk code by Tim Rowledge. Many thanks to both of you!!!!" | swapBytes headerStart headerSize dataSize oldBaseAddr minimumMemory heapSize bytesRead bytesToShift hdrNumStackPages hdrEdenBytes hdrCogCodeSize headerFlags hdrMaxExtSemTabSize firstSegSize | <var: #f type: 'sqImageFile '> <var: #memStart type: 'usqInt'> <var: #desiredHeapSize type: 'usqInt'> <var: #headerStart type: 'squeakFileOffsetType '> <var: #dataSize type: 'size_t '> <var: #imageOffset type: 'squeakFileOffsetType '> metaclassNumSlots := 6. "guess Metaclass instSize" + classNameIndex := 6. "guess (Class instVarIndexFor: 'name' ifAbsent: []) - 1" swapBytes := self checkImageVersionFrom: f startingAt: imageOffset. headerStart := (self sqImageFilePosition: f) - BytesPerWord. "record header start position" headerSize := self getLongFromFile: f swap: swapBytes. dataSize := self getLongFromFile: f swap: swapBytes. oldBaseAddr := self getLongFromFile: f swap: swapBytes. objectMemory specialObjectsOop: (self getLongFromFile: f swap: swapBytes). objectMemory lastHash: (self getLongFromFile: f swap: swapBytes). "N.B. not used." savedWindowSize := self getLongFromFile: f swap: swapBytes. headerFlags := self getLongFromFile: f swap: swapBytes. self setImageHeaderFlagsFrom: headerFlags. extraVMMemory := self getLongFromFile: f swap: swapBytes. "N.B. not used." hdrNumStackPages := self getShortFromFile: f swap: swapBytes. "4 stack pages is small. Should be able to run with as few as three. 4 should be comfortable but slow. 8 is a reasonable default. Can be changed via vmParameterAt: 43 put: n. Can be set as a preference (Info.plist, VM.ini, command line etc). If desiredNumStackPages is already non-zero then it has been set as a preference. Ignore (but preserve) the header's default." numStackPages := desiredNumStackPages ~= 0 ifTrue: [desiredNumStackPages] ifFalse: [hdrNumStackPages = 0 ifTrue: [self defaultNumStackPages] ifFalse: [hdrNumStackPages]]. desiredNumStackPages := hdrNumStackPages. "This slot holds the size of the native method zone in 1k units. (pad to word boundary)." hdrCogCodeSize := (self getShortFromFile: f swap: swapBytes) * 1024. cogCodeSize := desiredCogCodeSize ~= 0 ifTrue: [desiredCogCodeSize] ifFalse: [hdrCogCodeSize = 0 ifTrue: [self defaultCogCodeSize] ifFalse: [hdrCogCodeSize]]. hdrEdenBytes := self getLongFromFile: f swap: swapBytes. objectMemory edenBytes: (desiredEdenBytes ~= 0 ifTrue: [desiredEdenBytes] ifFalse: [hdrEdenBytes = 0 ifTrue: [objectMemory defaultEdenBytes] ifFalse: [hdrEdenBytes]]). desiredEdenBytes := hdrEdenBytes. hdrMaxExtSemTabSize := self getShortFromFile: f swap: swapBytes. hdrMaxExtSemTabSize ~= 0 ifTrue: [self setMaxExtSemSizeTo: hdrMaxExtSemTabSize]. "pad to word boundary. This slot can be used for anything else that will fit in 16 bits. Preserve it to be polite to other VMs." the2ndUnknownShort := self getShortFromFile: f swap: swapBytes. firstSegSize := self getLongFromFile: f swap: swapBytes. objectMemory firstSegmentSize: firstSegSize. "compare memory requirements with availability" minimumMemory := cogCodeSize "no need to include the stackZone; this is alloca'ed" + dataSize + objectMemory newSpaceBytes + self interpreterAllocationReserveBytes. heapSize := cogCodeSize "no need to include the stackZone; this is alloca'ed" + desiredHeapSize "+ edenBytes" "don't include edenBytes; this is part of the heap and so part of desiredHeapSize" + self interpreterAllocationReserveBytes. heapSize < minimumMemory ifTrue: [self insufficientMemorySpecifiedError]. "allocate a contiguous block of memory for the Squeak heap and ancilliary data structures" objectMemory memory: (self allocateMemory: heapSize minimum: minimumMemory imageFile: f headerSize: headerSize) asUnsignedInteger. objectMemory memory = nil ifTrue: [self insufficientMemoryAvailableError]. heapBase := objectMemory memory + cogCodeSize. self assert: objectMemory startOfMemory = heapBase. objectMemory setHeapBase: heapBase memoryLimit: objectMemory memory + heapSize - 24 "decrease memoryLimit a tad for safety (?!!?!!? eem eem 10/9/2013 15:15)" endOfMemory: heapBase + dataSize. "position file after the header" self sqImageFile: f Seek: headerStart + headerSize. "read in the image in bulk, then swap the bytes if necessary" bytesRead := objectMemory readHeapFromImageFile: f dataBytes: dataSize. bytesRead ~= dataSize ifTrue: [self unableToReadImageError]. self ensureImageFormatIsUpToDate: swapBytes. "compute difference between old and new memory base addresses" bytesToShift := objectMemory memoryBaseForImageRead - oldBaseAddr. self initializeInterpreter: bytesToShift. "adjusts all oops to new location" self initializeCodeGenerator. ^dataSize! Item was changed: ----- Method: ObjectMemory>>followForwardedObjectFields:toDepth: (in category 'spur compatibility') ----- followForwardedObjectFields: objOop toDepth: depth + <inline: false> self shouldNotImplement! Item was added: + ----- Method: Spur32BitCoMemoryManager>>startOfMemory (in category 'accessing') ----- + startOfMemory + "Return the start of object memory. This is immediately after the native code zone. + N.B. the stack zone is alloca'ed. Use a macro so as not to punish the debug VM." + <cmacro: '() heapBase'> + <returnTypeC: #usqInt> + ^coInterpreter heapBase! Item was changed: ----- Method: SpurMemoryManager>>startOfMemory (in category 'accessing') ----- startOfMemory + "Return the start of object memory. Use a macro so as not to punish the debug VM." + <cmacro: '() memory'> - "Return the start of object memory. This is immediately after the native code zone." <returnTypeC: #usqInt> + ^0! - <cmacro: '() GIV(startOfMemory)'> - ^startOfMemory ifNil: [0]! Item was changed: ----- Method: SpurSegmentManager>>adjustSegmentSwizzlesBy: (in category 'snapshot') ----- adjustSegmentSwizzlesBy: firstSegmentShift + "Adjust swizzles by firstSegmentShift. Also computes segStarts as + they were in the image when it was written, so that oops' segments + can be determined and hence oops correctly swizzled." + <inline: false> - "Adjust swizzles by firstSegmentShift." <var: 'segInfo' type: 'SpurSegmentInfo *'> | oldBaseAddr | oldBaseAddr := manager memoryBaseForImageRead - firstSegmentShift. 0 to: numSegments - 1 do: [:i| | segInfo | segInfo := self addressOf: (segments at: i). segInfo segStart: segInfo segStart + oldBaseAddr; swizzle: segInfo swizzle - oldBaseAddr]. canSwizzle := true! Item was changed: ----- Method: SpurSegmentManager>>collapseSegmentsPostSwizzle (in category 'snapshot') ----- collapseSegmentsPostSwizzle + "The image has been loaded, old segments reconstructed, and the heap + swizzled into a single contiguous segment. Collapse the segments into one." + <inline: false> - "The image has been loaded, old segments reconstructed, and the - loaded image swizzled into a single contiguous segment. Collapse - the segments intio one." | bridge | canSwizzle := false. firstSegmentSize ifNil: "true when used by SpurBootstrap to transform an image" + [^nil]. - [^self]. numSegments := 1. (segments at: 0) segStart: manager newSpaceLimit; segSize: manager endOfMemory - manager newSpaceLimit. "finally plant a bridge at the end of the coalesced segment and cut back the manager's notion of the end of memory to immediately before the bridge." bridge := manager endOfMemory - manager bridgeSize. self assert: bridge = ((segments at: 0) segStart + (segments at: 0) segSize + - manager bridgeSize). - - (manager bridgeSize)). manager initSegmentBridgeWithBytes: manager bridgeSize at: bridge; setEndOfMemory: bridge! Item was changed: ----- Method: SpurSegmentManager>>readHeapFromImageFile:dataBytes: (in category 'snapshot') ----- readHeapFromImageFile: f dataBytes: numBytes "Read numBytes of image data from f into memory at memoryBaseForImageRead. Answer the number of bytes written. In addition, read each segment, build up the segment info, while eliminating the bridge objects that end each segment and give the size of the subsequent segment." + <inline: false> | bytesRead totalBytesRead bridge nextSegmentSize oldBase newBase segInfo bridgeSpan | <var: 'segInfo' type: 'SpurSegmentInfo *'> self allocateOrExtendSegmentInfos. "segment sizes include the two-header-word bridge at the end of each segment." numSegments := totalBytesRead := 0. oldBase := 0. "N.B. still must be adjusted by oldBaseAddr." newBase := manager newSpaceLimit. nextSegmentSize := firstSegmentSize. bridge := firstSegmentSize + manager newSpaceLimit - manager baseHeaderSize. [segInfo := self addressOf: (segments at: numSegments). segInfo segStart: oldBase; "N.B. still must be adjusted by oldBaseAddr." segSize: nextSegmentSize; swizzle: newBase - oldBase. "N.B. still must be adjusted by oldBaseAddr." bytesRead := self readHeapFrom: f at: newBase dataBytes: nextSegmentSize. bytesRead > 0 ifTrue: [totalBytesRead := totalBytesRead + bytesRead]. bytesRead ~= nextSegmentSize ifTrue: [^totalBytesRead]. numSegments := numSegments + 1. bridgeSpan := manager bytesPerSlot * (manager rawOverflowSlotsOf: bridge). oldBase := oldBase + nextSegmentSize + bridgeSpan. newBase := newBase + nextSegmentSize - manager bridgeSize. nextSegmentSize := manager longLongAt: bridge. nextSegmentSize ~= 0] whileTrue: [bridge := bridge - manager bridgeSize + nextSegmentSize]. "newBase should point just past the last bridge. all others should have been eliminated." self assert: newBase - manager newSpaceLimit = (totalBytesRead - (numSegments * manager bridgeSize)). "set freeOldSpaceStart now for adjustAllOopsBy:" manager setFreeOldSpaceStart: newBase. ^totalBytesRead! Item was changed: ----- Method: StackInterpreter class>>table:from: (in category 'initialization') ----- table: anArray from: specArray "SpecArray is an array of one of (index selector) or (index1 index2 selector) or (index nil) or (index1 index2 nil). If selector then the entry is the selector, but if nil the entry is the index." | contiguous | contiguous := 0. specArray do: [:spec | (spec at: 1) = contiguous ifFalse: [self error: 'Non-contiguous table entry']. spec size = 2 ifTrue: [anArray at: (spec at: 1) + 1 put: ((spec at: 2) ifNil: [spec at: 1] ifNotNil: [:sym| sym]). contiguous := contiguous + 1] ifFalse: [(spec at: 1) to: (spec at: 2) do: [:i | anArray at: i + 1 put: ((spec at: 3) ifNil: [i] ifNotNil: [:sym| sym])]. + contiguous := contiguous + ((spec at: 2) - (spec at: 1)) + 1]]. + anArray doWithIndex: + [:entry :index| + (self whichClassIncludesSelector: entry) ifNotNil: + [:c| | m | + m := c >> entry. + (m pragmaAt: #option:) ifNotNil: + [:pragma| + (initializationOptions at: (pragma arguments first) ifAbsent: [true]) ifFalse: + [anArray at: index put: 0]]]]! - contiguous := contiguous + ((spec at: 2) - (spec at: 1)) + 1]]! Item was changed: ----- Method: StackInterpreter>>checkImageVersionFrom:startingAt: (in category 'image save/restore') ----- checkImageVersionFrom: f startingAt: imageOffset "Read and verify the image file version number and return true if the the given image file needs to be byte-swapped. As a side effect, position the file stream just after the version number of the image header. This code prints a warning and does a hard-exit if it cannot find a valid version number." "This code is based on C code by Ian Piumarta." + <inline: false> | version firstVersion | <var: #f type: 'sqImageFile '> <var: #imageOffset type: 'squeakFileOffsetType '> "check the version number" self sqImageFile: f Seek: imageOffset. version := firstVersion := self getLongFromFile: f swap: false. (self readableFormat: version) ifTrue: [^ false]. "try with bytes reversed" self sqImageFile: f Seek: imageOffset. version := self getLongFromFile: f swap: true. (self readableFormat: version) ifTrue: [^ true]. "Note: The following is only meaningful if not reading an embedded image" imageOffset = 0 ifTrue:[ "try skipping the first 512 bytes (prepended by certain Mac file transfer utilities)" self sqImageFile: f Seek: 512. version := self getLongFromFile: f swap: false. (self readableFormat: version) ifTrue: [^ false]. "try skipping the first 512 bytes with bytes reversed" self sqImageFile: f Seek: 512. version := self getLongFromFile: f swap: true. (self readableFormat: version) ifTrue: [^ true]]. "hard failure; abort" self print: 'This interpreter (vers. '. self printNum: self imageFormatVersion. self print: ') cannot read image file (vers. '. self printNum: firstVersion. self print: ').'. self cr. self print: 'Press CR to quit...'. self getchar. self ioExitWithErrorCode: 1. ^false! Item was changed: ----- Method: StackInterpreter>>handleForwardedSelectorFaultFor: (in category 'message sending') ----- handleForwardedSelectorFaultFor: selectorOop "Handle a send fault that is due to a send using a forwarded selector. Unforward the selector and follow the current method and special selectors array to unforward the source of the forwarded selector." + <inline: false> self assert: (objectMemory isOopForwarded: selectorOop). objectMemory followForwardedObjectFields: method toDepth: 0; followForwardedObjectFields: (objectMemory splObj: SpecialSelectors) toDepth: 0. ^objectMemory followForwarded: selectorOop! Item was changed: ----- Method: StackInterpreter>>longPrintOop: (in category 'debug printing') ----- longPrintOop: oop <api> + | fmt lastIndex startIP bytecodesPerLine column | - | class fmt lastIndex startIP bytecodesPerLine column | ((objectMemory isImmediate: oop) or: [(objectMemory addressCouldBeObj: oop) not or: [(oop bitAnd: objectMemory allocationUnit - 1) ~= 0 or: [(objectMemory isFreeObject: oop) or: [objectMemory isForwarded: oop]]]]) ifTrue: [^self printOop: oop]. + self printHex: oop. + (objectMemory fetchClassOfNonImm: oop) + ifNil: [self print: ' has a nil class!!!!'] + ifNotNil: [:class| + self print: ': a(n) '; printNameOfClass: class count: 5; + print: ' ('; printHex: class; print: ')']. - class := objectMemory fetchClassOfNonImm: oop. - self printHex: oop; - print: ': a(n) '; printNameOfClass: class count: 5; - print: ' ('; printHex: class; print: ')'. fmt := objectMemory formatOf: oop. self print: ' format '; printHexnp: fmt. fmt > objectMemory lastPointerFormat ifTrue: [self print: ' nbytes '; printNum: (objectMemory byteLengthOf: oop)] ifFalse: [(objectMemory isIndexableFormat: fmt) ifTrue: [| len | len := objectMemory lengthOf: oop. self print: ' size '; printNum: len - (objectMemory fixedFieldsOf: oop format: fmt length: len)]]. objectMemory printHeaderTypeOf: oop. self print: ' hash '; printHexnp: (objectMemory rawHashBitsOf: oop). self cr. (fmt between: objectMemory firstLongFormat and: objectMemory firstCompiledMethodFormat - 1) ifTrue: [^self]. "this is nonsense. apologies." startIP := (objectMemory lastPointerOf: oop) + BytesPerOop - objectMemory baseHeaderSize / BytesPerOop. lastIndex := 256 min: startIP. lastIndex > 0 ifTrue: [1 to: lastIndex do: [:i| | fieldOop | fieldOop := objectMemory fetchPointer: i - 1 ofObject: oop. self space; printNum: i - 1; space; printHex: fieldOop; space. (i = 1 and: [objectMemory isCompiledMethod: oop]) ifTrue: [self printMethodHeaderOop: fieldOop] ifFalse: [self cCode: [self printOopShort: fieldOop] inSmalltalk: [self print: (self shortPrint: fieldOop)]]. self cr]]. (objectMemory isCompiledMethod: oop) ifFalse: [startIP > 64 ifTrue: [self print: '...'; cr]] ifTrue: [startIP := startIP * BytesPerWord + 1. lastIndex := objectMemory lengthOf: oop. lastIndex - startIP > 100 ifTrue: [lastIndex := startIP + 100]. bytecodesPerLine := 8. column := 1. startIP to: lastIndex do: [:index| | byte | column = 1 ifTrue: [self cCode: 'printf("0x%08x: ", oop+BaseHeaderSize+index-1)' inSmalltalk: [self print: (oop+BaseHeaderSize+index-1) hex; print: ': ']]. byte := objectMemory fetchByte: index - 1 ofObject: oop. self cCode: 'printf(" %02x/%-3d", byte,byte)' inSmalltalk: [self space; print: (byte radix: 16); printChar: $/; printNum: byte]. column := column + 1. column > bytecodesPerLine ifTrue: [column := 1. self cr]]. column = 1 ifFalse: [self cr]]! Item was changed: ----- Method: StackInterpreter>>readImageFromFile:HeapSize:StartingAt: (in category 'image save/restore') ----- readImageFromFile: f HeapSize: desiredHeapSize StartingAt: imageOffset "Read an image from the given file stream, allocating the given amount of memory to its object heap. Fail if the image has an unknown format or requires more than the given amount of memory." "Details: This method detects when the image was stored on a machine with the opposite byte ordering from this machine and swaps the bytes automatically. Furthermore, it allows the header information to start 512 bytes into the file, since some file transfer programs for the Macintosh apparently prepend a Mac-specific header of this size. Note that this same 512 bytes of prefix area could also be used to store an exec command on Unix systems, allowing one to launch Smalltalk by invoking the image name as a command." "This code is based on C code by Ian Piumarta and Smalltalk code by Tim Rowledge. Many thanks to both of you!!!!" | swapBytes headerStart headerSize dataSize oldBaseAddr hdrNumStackPages minimumMemory heapBase bytesRead bytesToShift heapSize hdrEdenBytes headerFlags hdrMaxExtSemTabSize firstSegSize | <var: #f type: 'sqImageFile '> <var: #heapBase type: 'usqInt'> <var: #desiredHeapSize type: 'usqInt'> <var: #headerStart type: 'squeakFileOffsetType '> <var: #dataSize type: 'size_t '> <var: #imageOffset type: 'squeakFileOffsetType '> metaclassNumSlots := 6. "guess Metaclass instSize" + classNameIndex := 6. "guess (Class instVarIndexFor: 'name' ifAbsent: []) - 1" swapBytes := self checkImageVersionFrom: f startingAt: imageOffset. headerStart := (self sqImageFilePosition: f) - BytesPerWord. "record header start position" headerSize := self getLongFromFile: f swap: swapBytes. dataSize := self getLongFromFile: f swap: swapBytes. oldBaseAddr := self getLongFromFile: f swap: swapBytes. objectMemory specialObjectsOop: (self getLongFromFile: f swap: swapBytes). objectMemory lastHash: (self getLongFromFile: f swap: swapBytes). "N.B. not used." savedWindowSize := self getLongFromFile: f swap: swapBytes. headerFlags := self getLongFromFile: f swap: swapBytes. self setImageHeaderFlagsFrom: headerFlags. extraVMMemory := self getLongFromFile: f swap: swapBytes. hdrNumStackPages := self getShortFromFile: f swap: swapBytes. "4 stack pages is small. Should be able to run with as few as three. 4 should be comfortable but slow. 8 is a reasonable default. Can be changed via vmParameterAt: 43 put: n. Can be set as a preference (Info.plist, VM.ini, command line etc). If desiredNumStackPages is already non-zero then it has been set as a preference. Ignore (but preserve) the header's default." numStackPages := desiredNumStackPages ~= 0 ifTrue: [desiredNumStackPages] ifFalse: [hdrNumStackPages = 0 ifTrue: [self defaultNumStackPages] ifFalse: [hdrNumStackPages]]. desiredNumStackPages := hdrNumStackPages. "pad to word boundary. This slot can be used for anything else that will fit in 16 bits. It is used for the cog code size in Cog. Preserve it to be polite to other VMs." theUnknownShort := self getShortFromFile: f swap: swapBytes. hdrEdenBytes := self getLongFromFile: f swap: swapBytes. objectMemory edenBytes: (desiredEdenBytes ~= 0 ifTrue: [desiredEdenBytes] ifFalse: [hdrEdenBytes = 0 ifTrue: [objectMemory defaultEdenBytes] ifFalse: [hdrEdenBytes]]). desiredEdenBytes := hdrEdenBytes. hdrMaxExtSemTabSize := self getShortFromFile: f swap: swapBytes. hdrMaxExtSemTabSize ~= 0 ifTrue: [self setMaxExtSemSizeTo: hdrMaxExtSemTabSize]. "pad to word boundary. This slot can be used for anything else that will fit in 16 bits. Preserve it to be polite to other VMs." the2ndUnknownShort := self getShortFromFile: f swap: swapBytes. firstSegSize := self getLongFromFile: f swap: swapBytes. objectMemory firstSegmentSize: firstSegSize. "decrease Squeak object heap to leave extra memory for the VM" heapSize := self cCode: 'reserveExtraCHeapBytes(desiredHeapSize, extraVMMemory)'. "compare memory requirements with availability". minimumMemory := dataSize + objectMemory newSpaceBytes + self interpreterAllocationReserveBytes. heapSize < minimumMemory ifTrue: [self insufficientMemorySpecifiedError]. "allocate a contiguous block of memory for the Squeak heap" objectMemory memory: (self allocateMemory: heapSize minimum: minimumMemory imageFile: f headerSize: headerSize) asUnsignedInteger. objectMemory memory = nil ifTrue: [self insufficientMemoryAvailableError]. + heapBase := objectMemory memory. - heapBase := objectMemory startOfMemory. objectMemory setHeapBase: heapBase memoryLimit: (heapBase + heapSize) - 24 "decrease memoryLimit a tad for safety" endOfMemory: heapBase + dataSize. "position file after the header" self sqImageFile: f Seek: headerStart + headerSize. "read in the image in bulk, then swap the bytes if necessary" bytesRead := objectMemory readHeapFromImageFile: f dataBytes: dataSize. bytesRead ~= dataSize ifTrue: [self unableToReadImageError]. self ensureImageFormatIsUpToDate: swapBytes. "compute difference between old and new memory base addresses" bytesToShift := objectMemory memoryBaseForImageRead - oldBaseAddr. self initializeInterpreter: bytesToShift. "adjusts all oops to new location" ^dataSize! Item was changed: ----- Method: StackInterpreterSimulator>>shortPrint: (in category 'debug support') ----- shortPrint: oop | name classOop | (objectMemory isImmediate: oop) ifTrue: [(objectMemory isImmediateCharacter: oop) ifTrue: [^ '=$' , (objectMemory characterValueOf: oop) printString , ' (' , (String with: (Character value: (objectMemory characterValueOf: oop))) , ')']. (objectMemory isIntegerObject: oop) ifTrue: [^ '=' , (objectMemory integerValueOf: oop) printString , ' (' , (objectMemory integerValueOf: oop) hex , ')']. ^'= UNKNOWN IMMEDIATE', ' (' , (objectMemory integerValueOf: oop) hex , ')']. (objectMemory addressCouldBeObj: oop) ifFalse: [^(oop bitAnd: objectMemory allocationUnit - 1) ~= 0 ifTrue: [' is misaligned'] ifFalse: [' is not on the heap']]. (objectMemory isFreeObject: oop) ifTrue: [^' is a free chunk of size ', (objectMemory sizeOfFree: oop) printString]. (objectMemory isForwarded: oop) ifTrue: [^' is a forwarded object to ', (objectMemory followForwarded: oop) hex, ' of slot size ', (objectMemory numSlotsOfAny: oop) printString]. classOop := objectMemory fetchClassOfNonImm: oop. + classOop ifNil: [^' has a nil class!!!!']. (objectMemory numSlotsOf: classOop) = metaclassNumSlots ifTrue: [^'class ' , (self nameOfClass: oop)]. name := self nameOfClass: classOop. name size = 0 ifTrue: [name := '??']. name = 'String' ifTrue: [^ (self stringOf: oop) printString]. name = 'ByteString' ifTrue: [^ (self stringOf: oop) printString]. name = 'Symbol' ifTrue: [^ '#' , (self stringOf: oop)]. name = 'ByteSymbol' ifTrue: [^ '#' , (self stringOf: oop)]. name = 'Character' ifTrue: "SpurMemoryManager has immediate Characters; ObjectMemory does not" [^ '=' , (Character value: (objectMemory integerValueOf: (objectMemory fetchPointer: 0 ofObject: oop))) printString]. name = 'UndefinedObject' ifTrue: [^ 'nil']. name = 'False' ifTrue: [^ 'false']. name = 'True' ifTrue: [^ 'true']. name = 'Float' ifTrue: [^ '=' , (self dbgFloatValueOf: oop) printString]. (#('Association' 'ReadOnlyVariableBinding' 'VariableBinding') includes: name) ifTrue: [^ '(' , (self shortPrint: (self longAt: oop + BaseHeaderSize)) , ' -> ' , (self longAt: oop + BaseHeaderSize + BytesPerWord) hex8 , ')']. ^(('AEIOU' includes: name first) ifTrue: ['an '] ifFalse: ['a ']), name! Item was added: + ----- Method: String>>indexOfWord: (in category '*VMMaker-translation support') ----- + indexOfWord: aSubString + ^self indexOfWord: aSubString startingAt: 1! Item was added: + ----- Method: String>>indexOfWord:startingAt: (in category '*VMMaker-translation support') ----- + indexOfWord: aSubString startingAt: startIndex + | index | + index := startIndex. + [index <= self size] whileTrue: + [index := self indexOfSubCollection: aSubString startingAt: index ifAbsent: [^0]. + ((index = 1 or: [(self at: index - 1) isLetter not]) + and: [index + aSubString size > self size + or: [(self at: index + aSubString size) isAlphaNumeric not]]) ifTrue: + [^index]. + index := index + 1]. + ^0! Item was added: + ----- Method: TAssignmentNode>>setExpression: (in category 'accessing') ----- + setExpression: expressionNode + + expression := expressionNode! Item was changed: ----- Method: TMethod>>hasUnrenamableCCode (in category 'utilities') ----- hasUnrenamableCCode + "Answer true if the receiver uses inlined C which + is not currently renamed properly by the the inliner." - "Answer true if the receiver uses inlined C or complex C declarations, - which are not currently renamed properly by the the inliner." + ^parseTree anySatisfy: + [:node| node isNonNullCCode]! - declarations keysAndValuesDo: - [:name :value| - ((value endsWith: name) - or: [value == #implicit]) ifFalse: - [^true]]. - - parseTree nodesDo: - [:node| - (node isSend - and: [node isNonNullCCode]) ifTrue: - [^true]]. - ^false! Item was changed: ----- Method: TMethod>>newCascadeTempFor: (in category 'initialization') ----- newCascadeTempFor: aTParseNode + | varName varNode | + varName := self extraVariableName: 'cascade'. + varNode := TVariableNode new setName: varName. - | varNode | - varNode := TVariableNode new setName: (self extraVariableName: 'cascade'). aTParseNode isLeaf ifFalse: [declarations + at: varName + put: [:tm :cg| | type | + type := tm determineTypeFor: aTParseNode in: cg. + (VMStructType structTargetKindForType: type) == #struct ifTrue: + ["can't copy structs into cascade temps; the struct is not updated. + must change to a pointer." + type := type, ' *'. + parseTree nodesDo: + [:node| + (node isAssignment + and: [node variable name = varName]) ifTrue: + [node setExpression: (TSendNode new + setSelector: #addressOf: + receiver: (TVariableNode new setName: 'self') + arguments: {node expression})]]]. + type]]. - at: varNode name - put: [:tm :cg| tm determineTypeFor: aTParseNode in: cg]]. ^varNode! Item was changed: ----- Method: TMethod>>renameVariablesUsing: (in category 'inlining support') ----- renameVariablesUsing: aDictionary "Rename all variables according to old->new mappings of the given dictionary." | newDecls | "map args and locals" args := args collect: [ :arg | aDictionary at: arg ifAbsent: [ arg ]]. locals := locals collect: [ :v | aDictionary at: v ifAbsent: [ v ]]. "map declarations" newDecls := declarations species new. declarations keysAndValuesDo: + [:oldName :decl| - [ :oldName :decl| (aDictionary at: oldName ifAbsent: nil) + ifNotNil: + [:newName| | index | + index := decl indexOfWord: oldName. + newDecls + at: newName + put: (index ~= 0 + ifTrue: [decl copyReplaceFrom: index to: index + oldName size - 1 with: newName] + ifFalse: [decl])] + ifNil: [newDecls at: oldName put: decl]]. - ifNotNil: [:newName| - newDecls - at: newName - put: ((decl endsWith: oldName) - ifTrue: [(decl allButLast: oldName size), newName] - ifFalse: - [Transcript cr; show: 'suspicious renaming ', oldName, ' -> ', newName, ' ', decl, ' in ', selector. - decl])] - ifNil: [ newDecls at: oldName put: decl ]]. self newDeclarations: newDecls. "map variable names in parse tree" + parseTree nodesDo: + [ :node | - parseTree nodesDo: [ :node | (node isVariable and: [aDictionary includesKey: node name]) ifTrue: [node setName: (aDictionary at: node name)]. (node isStmtList and: [node args size > 0]) ifTrue: [node setArguments: (node args collect: [ :arg | aDictionary at: arg ifAbsent: [ arg ]])]]! Item was added: + ----- Method: TParseNode>>isNonNullCCode (in category 'testing') ----- + isNonNullCCode + "overridden in TSendNode" + ^false! Item was changed: ----- Method: VMStructType class>>structTargetKindForType: (in category 'translation') ----- structTargetKindForType: type - | index | StructTypeNameCache ifNil: [StructTypeNameCache := Set new. self allSubclassesDo: [:sc| StructTypeNameCache add: sc name; add: sc structTypeName ]]. ^(type notNil and: [StructTypeNameCache anySatisfy: [:structType| (type beginsWith: structType) + and: [type size = structType size + or: [(type at: structType size + 1) isAlphaNumeric not]]]]) ifTrue: + [(type includes: $*) - and: [index > structType size]]]) ifTrue: - [(index := type indexOf: $*) > 0 ifTrue: [#pointer] ifFalse: [#struct]]!

1 0

Android vm status?
by tim Rowledge 25 Oct '13

25 Oct '13

I got a query about getting Scratch to run on Android and I have to confess to knowing nothing at all about the status of any Android ruinable vm. Is there one? Is it up to date? Where can it be downloaded? Does it come with chocolate? tim -- tim Rowledge; tim(a)rowledge.org; http://www.rowledge.org/tim Strange OpCodes: XER: Exclusive ERror

5 6

OS X Mavericks & cog tickers
by tim Rowledge 25 Oct '13

25 Oct '13

Looking through some of the low-level changes in Mavericks I noticed stuff about timer consolidation. I *think* that it is something that you can offer to allow, rather than something done unto you code, but almost certainly it will have some sort of impact on the heartbeat ticker type of code used in stackvm/cog. Where is a skilled Mac vm maintainer when you need one? tim -- tim Rowledge; tim(a)rowledge.org; http://www.rowledge.org/tim "bOtHeR" said Pooh, mistaking the LSD tablet for aspirin

6 24

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Vm-dev October 2013