Vm-dev January 2017

vm-dev@lists.squeakfoundation.org

30 participants
136 discussions

VM Maker: VMMaker.oscog-eem.2078.mcz
by commits＠source.squeak.org 09 Jan '17

09 Jan '17

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.2078.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.2078 Author: eem Time: 9 January 2017, 9:40:09.059257 am UUID: 2b2c29ff-6832-4346-b22a-9bc1adc3d9e7 Ancestors: VMMaker.oscog-rsf.2077 Slang: Add support for constant reduction of const ifTrue: [bool] ifFalse: [statements] => bool to reduce isVanillaBlockClosure: to true when not using SistaV1BytecodeSet, and hence rescue C compilation of the non-Sista sources (ensureMethodIsCoggeds: needs this). =============== Diff against VMMaker.oscog-rsf.2077 =============== Item was changed: ----- Method: CCodeGenerator>>nilOrBooleanConstantReceiverOf: (in category 'utilities') ----- nilOrBooleanConstantReceiverOf: aNode "Answer nil or the boolean constant that is the receiver of the given message send. Used to suppress conditional code when the condition is a translation-time constant." + | val receiver argument arms | - | val receiver argument | generateDeadCode ifTrue:[^nil]. ((self isConstantNode: aNode valueInto: [:v| val := v]) and: [#(true false) includes: val]) ifTrue: [^val]. aNode isSend ifTrue: [aNode selector == #not ifTrue: [(self nilOrBooleanConstantReceiverOf: aNode receiver) ifNotNil: [:bool| ^bool not]]. ((#(isNil notNil) includes: aNode selector) and: [self isNilConstantReceiverOf: aNode]) ifTrue: [^aNode selector == #isNil]. ((#(or: and:) includes: aNode selector) and: [aNode args last isStmtList and: [aNode args last statements size = 1]]) ifTrue: [(self nilOrBooleanConstantReceiverOf: aNode receiver) ifNotNil: [:rcvr| ((rcvr == false and: [aNode selector == #and:]) or: [rcvr == true and: [aNode selector == #or:]]) ifTrue: [^rcvr]. (self nilOrBooleanConstantReceiverOf: aNode args last statements first) ifNotNil: [:arg| ^rcvr perform: aNode selector with: [arg]]]. "We can also eliminate expr and: [false], but only if expr is side-effect free. This is a weak test; we don't traverse calls. Caveat emptor!!" (aNode selector == #and: and: [(aNode receiver noneSatisfy: [:node| node isAssignment]) "No side-effects in the elided expression" and: [aNode args last statements size = 1]]) ifTrue: [(self nilOrBooleanConstantReceiverOf: aNode args last statements first) ifNotNil: [:arg| arg ifFalse: [^arg]]]]. + "Look for Const ifTrue: [self foo] ifFalse: [false] => false" + ((#(ifTrue:ifFalse: ifFalse:ifTrue:) includes: aNode selector) + and: [(self isConstantNode: aNode receiver valueInto: [:v| val := v]) + and: [(#(true false) includes: val) + and: [arms := aNode args collect: + [:altBlock| | bval | + (altBlock statements size = 1 + and: [(self isConstantNode: altBlock statements last valueInto: [:v| bval := v]) + and: [#(true false) includes: bval]]) ifTrue: + [bval]]. + arms asArray ~= #(nil nil)]]]) ifTrue: + [| arm | + arm := aNode selector == #ifTrue:ifFalse: == val + ifTrue: [arms first] + ifFalse: [arms last]. + (#(true false) includes: arm) ifTrue: + [^arm]]. ((#(= ~= < > <= >=) includes: aNode selector) and: [(self isConstantNode: aNode receiver valueInto: [:v| receiver := v]) and: [receiver isInteger and: [(self isConstantNode: aNode args first valueInto: [:v| argument := v]) and: [argument isInteger]]]]) ifTrue: [^receiver perform: aNode selector with: argument]. "Inlining for e.g. CharacterTable ifNil: [...] ifNotNil: [...]], which compiles to CharacterTable == nil ifTrue: [...] ifFalse: [...]" + (aNode selector == #== - ( aNode selector == #== and: [aNode args first isVariable and: [aNode args first name = 'nil' and: [aNode receiver isConstant and: [aNode receiver value == nil]]]]) ifTrue: [^true]]. ^nil!

1 0

does anyone actually tested FFI under 64bits?
by Esteban Lorenzano 09 Jan '17

09 Jan '17

Hi, I’m asking because, for example: ExternalType long byteSize “4”. and of course, nothing works using structures :) cheers, Esteban

1 1

VM Maker: VMMaker.oscog-rsf.2077.mcz
by commits＠source.squeak.org 09 Jan '17

09 Jan '17

Ronie Salgado Faila uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-rsf.2077.mcz ==================== Summary ==================== Name: VMMaker.oscog-rsf.2077 Author: rsf Time: 8 January 2017, 5:41:56.129158 pm UUID: d009eb6f-01c9-4fb4-b022-2f73c6e8ca5c Ancestors: VMMaker.oscog-eem.2076 ExtB 00000000 1xxxxxxx constant decoding bug fix. =============== Diff against VMMaker.oscog-eem.2076 =============== Item was changed: CogClass subclass: #Cogit + instanceVariableNames: 'coInterpreter objectMemory objectRepresentation processor threadManager methodZone methodZoneBase codeBase minValidCallAddress lastNInstructions simulatedAddresses simulatedTrampolines simulatedVariableGetters simulatedVariableSetters printRegisters printInstructions compilationTrace clickConfirm breakPC breakBlock singleStep guardPageSize traceFlags traceStores breakMethod methodObj enumeratingCogMethod methodHeader initialPC endPC methodOrBlockNumArgs inBlock needsFrame hasYoungReferent primitiveIndex backEnd literalsManager postCompileHook methodLabel stackCheckLabel blockEntryLabel blockEntryNoContextSwitch blockNoContextSwitchOffset stackOverflowCall sendMiss missOffset entryPointMask checkedEntryAlignment uncheckedEntryAlignment cmEntryOffset entry cmNoCheckEntryOffset noCheckEntry fullBlockEntry cbEntryOffset fullBlockNoContextSwitchEntry cbNoSwitchEntryOffset picMNUAbort picInterpretAbort endCPICCase0 endCPICCase1 firstCPICCaseOffset cPICCaseSize cP ICEndSize closedPICSize openPICSize fixups abstractOpcodes generatorTable byte0 byte1 byte2 byte3 bytecodePC bytecodeSetOffset opcodeIndex numAbstractOpcodes blockStarts blockCount labelCounter cStackAlignment expectedSPAlignment expectedFPAlignment codeModified maxLitIndex ceMethodAbortTrampoline cePICAbortTrampoline ceCheckForInterruptTrampoline ceCPICMissTrampoline ceReturnToInterpreterTrampoline ceBaseFrameReturnTrampoline ceSendMustBeBooleanAddTrueTrampoline ceSendMustBeBooleanAddFalseTrampoline ceCannotResumeTrampoline ceEnterCogCodePopReceiverReg ceCallCogCodePopReceiverReg ceCallCogCodePopReceiverAndClassRegs cePrimReturnEnterCogCode cePrimReturnEnterCogCodeProfiling ceNonLocalReturnTrampoline ceFetchContextInstVarTrampoline ceStoreContextInstVarTrampoline ceEnclosingObjectTrampoline ceFlushICache ceCheckFeaturesFunction ceTraceLinkedSendTrampoline ceTraceBlockActivationTrampoline ceTraceStoreTrampoline ceGetFP ceGetSP ceCaptureCStackPointers ordinarySendTrampolines superSen dTrampolines directedSuperSendTrampolines dynamicSuperSendTrampolines outerSendTrampolines selfSendTrampolines firstSend lastSend realCEEnterCogCodePopReceiverReg realCECallCogCodePopReceiverReg realCECallCogCodePopReceiverAndClassRegs trampolineTableIndex trampolineAddresses objectReferencesInRuntime runtimeObjectRefIndex cFramePointerInUse debugPrimCallStackOffset ceTryLockVMOwner ceUnlockVMOwner extA extB numExtB tempOop numIRCs indexOfIRC theIRCs implicitReceiverSendTrampolines cogMethodSurrogateClass cogBlockMethodSurrogateClass nsSendCacheSurrogateClass CStackPointer CFramePointer cPICPrototype cPICEndOfCodeOffset cPICEndOfCodeLabel maxCPICCases debugBytecodePointers debugOpcodeIndices disassemblingMethod ceMallocTrampoline ceFreeTrampoline ceFFICalloutTrampoline' - instanceVariableNames: 'coInterpreter objectMemory objectRepresentation processor threadManager methodZone methodZoneBase codeBase minValidCallAddress lastNInstructions simulatedAddresses simulatedTrampolines simulatedVariableGetters simulatedVariableSetters printRegisters printInstructions compilationTrace clickConfirm breakPC breakBlock singleStep guardPageSize traceFlags traceStores breakMethod methodObj enumeratingCogMethod methodHeader initialPC endPC methodOrBlockNumArgs inBlock needsFrame hasYoungReferent primitiveIndex backEnd literalsManager postCompileHook methodLabel stackCheckLabel blockEntryLabel blockEntryNoContextSwitch blockNoContextSwitchOffset stackOverflowCall sendMiss missOffset entryPointMask checkedEntryAlignment uncheckedEntryAlignment cmEntryOffset entry cmNoCheckEntryOffset noCheckEntry fullBlockEntry cbEntryOffset fullBlockNoContextSwitchEntry cbNoSwitchEntryOffset picMNUAbort picInterpretAbort endCPICCase0 endCPICCase1 firstCPICCaseOffset cPICCaseSize cP ICEndSize closedPICSize openPICSize fixups abstractOpcodes generatorTable byte0 byte1 byte2 byte3 bytecodePC bytecodeSetOffset opcodeIndex numAbstractOpcodes blockStarts blockCount labelCounter cStackAlignment expectedSPAlignment expectedFPAlignment codeModified maxLitIndex ceMethodAbortTrampoline cePICAbortTrampoline ceCheckForInterruptTrampoline ceCPICMissTrampoline ceReturnToInterpreterTrampoline ceBaseFrameReturnTrampoline ceSendMustBeBooleanAddTrueTrampoline ceSendMustBeBooleanAddFalseTrampoline ceCannotResumeTrampoline ceEnterCogCodePopReceiverReg ceCallCogCodePopReceiverReg ceCallCogCodePopReceiverAndClassRegs cePrimReturnEnterCogCode cePrimReturnEnterCogCodeProfiling ceNonLocalReturnTrampoline ceFetchContextInstVarTrampoline ceStoreContextInstVarTrampoline ceEnclosingObjectTrampoline ceFlushICache ceCheckFeaturesFunction ceTraceLinkedSendTrampoline ceTraceBlockActivationTrampoline ceTraceStoreTrampoline ceGetFP ceGetSP ceCaptureCStackPointers ordinarySendTrampolines superSen dTrampolines directedSuperSendTrampolines dynamicSuperSendTrampolines outerSendTrampolines selfSendTrampolines firstSend lastSend realCEEnterCogCodePopReceiverReg realCECallCogCodePopReceiverReg realCECallCogCodePopReceiverAndClassRegs trampolineTableIndex trampolineAddresses objectReferencesInRuntime runtimeObjectRefIndex cFramePointerInUse debugPrimCallStackOffset ceTryLockVMOwner ceUnlockVMOwner extA extB tempOop numIRCs indexOfIRC theIRCs implicitReceiverSendTrampolines cogMethodSurrogateClass cogBlockMethodSurrogateClass nsSendCacheSurrogateClass CStackPointer CFramePointer cPICPrototype cPICEndOfCodeOffset cPICEndOfCodeLabel maxCPICCases debugBytecodePointers debugOpcodeIndices disassemblingMethod ceMallocTrampoline ceFreeTrampoline ceFFICalloutTrampoline' classVariableNames: 'AltBlockCreationBytecodeSize AltFirstSpecialSelector AltNSSendIsPCAnnotated AltNumSpecialSelectors AnnotationConstantNames AnnotationShift AnnotationsWithBytecodePCs BlockCreationBytecodeSize Debug DisplacementMask DisplacementX2N EagerInstructionDecoration FirstAnnotation FirstSpecialSelector HasBytecodePC IsAbsPCReference IsAnnotationExtension IsDirectedSuperSend IsDisplacementX2N IsNSDynamicSuperSend IsNSImplicitReceiverSend IsNSSelfSend IsNSSendCall IsObjectReference IsRelativeCall IsSendCall IsSuperSend MapEnd MaxCPICCases MaxCompiledPrimitiveIndex MaxStackAllocSize MaxX2NDisplacement NSCClassTagIndex NSCEnclosingObjectIndex NSCNumArgsIndex NSCSelectorIndex NSCTargetIndex NSSendIsPCAnnotated NeedsFixupFlag NumObjRefsInRuntime NumOopsPerNSC NumSpecialSelectors NumTrampolines ProcessorClass RRRName' poolDictionaries: 'CogAbstractRegisters CogCompilationConstants CogMethodConstants CogRTLOpcodes VMBasicConstants VMBytecodeConstants VMObjectIndices VMStackFrameOffsets' category: 'VMMaker-JIT'! Cogit class instanceVariableNames: 'generatorTable primitiveTable'! !Cogit commentStamp: 'eem 4/6/2015 15:56' prior: 0! I am the code generator for the Cog VM. My job is to produce machine code versions of methods for faster execution and to manage inline caches for faster send performance. I can be tested in the current image using my class-side in-image compilation facilities. e.g. try StackToRegisterMappingCogit genAndDis: (Integer >> #benchFib) I have concrete subclasses that implement different levels of optimization: SimpleStackBasedCogit is the simplest code generator. StackToRegisterMappingCogit is the current production code generator It defers pushing operands to the stack until necessary and implements a register-based calling convention for low-arity sends. StackToRegisterMappingCogit is an experimental code generator with support for counting conditional branches, intended to support adaptive optimization. coInterpreter <CoInterpreterSimulator> the VM's interpreter with which I cooperate methodZoneManager <CogMethodZoneManager> the manager of the machine code zone objectRepresentation <CogObjectRepresentation> the object used to generate object accesses processor <BochsIA32Alien|?> the simulator that executes the IA32/x86 machine code I generate when simulating execution in Smalltalk simulatedTrampolines <Dictionary of Integer -> MessageSend> the dictionary mapping trap jump addresses to run-time routines used to warp from simulated machine code in to the Smalltalk run-time. simulatedVariableGetters <Dictionary of Integer -> MessageSend> the dictionary mapping trap read addresses to variables in run-time objects used to allow simulated machine code to read variables in the Smalltalk run-time. simulatedVariableSetters <Dictionary of Integer -> MessageSend> the dictionary mapping trap write addresses to variables in run-time objects used to allow simulated machine code to write variables in the Smalltalk run-time. printRegisters printInstructions clickConfirm <Boolean> flags controlling debug printing and code simulation breakPC <Integer> machine code pc breakpoint cFramePointer cStackPointer <Integer> the variables representing the C stack & frame pointers, which must change on FFI callback and return selectorOop <sqInt> the oop of the methodObj being compiled methodObj <sqInt> the bytecode method being compiled initialPC endPC <Integer> the start and end pcs of the methodObj being compiled methodOrBlockNumArgs <Integer> argument count of current method or block being compiled needsFrame <Boolean> whether methodObj or block needs a frame to execute primitiveIndex <Integer> primitive index of current method being compiled methodLabel <CogAbstractOpcode> label for the method header blockEntryLabel <CogAbstractOpcode> label for the start of the block dispatch code stackOverflowCall <CogAbstractOpcode> label for the call of ceStackOverflow in the method prolog sendMissCall <CogAbstractOpcode> label for the call of ceSICMiss in the method prolog entryOffset <Integer> offset of method entry code from start (header) of method entry <CogAbstractOpcode> label for the first instruction of the method entry code noCheckEntryOffset <Integer> offset of the start of a method proper (after the method entry code) from start (header) of method noCheckEntry <CogAbstractOpcode> label for the first instruction of start of a method proper fixups <Array of <AbstractOpcode Label | nil>> the labels for forward jumps that will be fixed up when reaching the relevant bytecode. fixup shas one element per byte in methodObj's bytecode abstractOpcodes <Array of <AbstractOpcode>> the code generated when compiling methodObj byte0 byte1 byte2 byte3 <Integer> individual bytes of current bytecode being compiled in methodObj bytecodePointer <Integer> bytecode pc (same as Smalltalk) of the current bytecode being compiled opcodeIndex <Integer> the index of the next free entry in abstractOpcodes (this code is translated into C where OrderedCollection et al do not exist) numAbstractOpcodes <Integer> the number of elements in abstractOpcocdes blockStarts <Array of <BlockStart>> the starts of blocks in the current method blockCount the index into blockStarts as they are being noted, and hence eventually the total number of blocks in the current method labelCounter <Integer> a nicety for numbering labels not needed in the production system but probably not expensive enough to worry about ceStackOverflowTrampoline <Integer> ceSend0ArgsTrampoline <Integer> ceSend1ArgsTrampoline <Integer> ceSend2ArgsTrampoline <Integer> ceSendNArgsTrampoline <Integer> ceSendSuper0ArgsTrampoline <Integer> ceSendSuper1ArgsTrampoline <Integer> ceSendSuper2ArgsTrampoline <Integer> ceSendSuperNArgsTrampoline <Integer> ceSICMissTrampoline <Integer> ceCPICMissTrampoline <Integer> ceStoreCheckTrampoline <Integer> ceReturnToInterpreterTrampoline <Integer> ceBaseFrameReturnTrampoline <Integer> ceSendMustBeBooleanTrampoline <Integer> ceClosureCopyTrampoline <Integer> the various trampolines (system-call-like jumps from machine code to the run-time). See Cogit>>generateTrampolines for the mapping from trampoline to run-time routine and then read the run-time routine for a funcitonal description. ceEnterCogCodePopReceiverReg <Integer> the enilopmart (jump from run-time to machine-code) methodZoneBase <Integer> ! Cogit class instanceVariableNames: 'generatorTable primitiveTable'! Item was changed: ----- Method: Cogit>>assertExtsAreConsumed: (in category 'compile abstract instructions') ----- assertExtsAreConsumed: descriptor "extended bytecodes must consume their extensions" <inline: true> descriptor isExtension ifFalse: + [self assert: (extA = 0 and: [extB = 0 and: [numExtB = 0]])].! - [self assert: (extA = 0 and: [extB = 0])].! Item was changed: ----- Method: Cogit>>extBBytecode (in category 'bytecode generators') ----- extBBytecode "225 11100001 sbbbbbbb Extend B (Ext B = Ext B prev * 256 + Ext B)" + extB := (numExtB = 0 and: [byte1 > 127]) - extB := (extB = 0 and: [byte1 > 127]) ifTrue: [byte1 - 256] ifFalse: [(extB bitShift: 8) + byte1]. + numExtB := numExtB + 1. ^0! Item was changed: ----- Method: Cogit>>nextDescriptorAndExtensionsInto: (in category 'bytecode generator support') ----- nextDescriptorAndExtensionsInto: aTrinaryBlock "Peek ahead and deliver the next descriptor plus extension bytes." <inline: true> + | savedB0 savedB1 savedB2 savedB3 savedEA savedEB savedNEB descriptor bcpc | - | savedB0 savedB1 savedB2 savedB3 savedEA savedEB descriptor bcpc | <var: #descriptor type: #'BytecodeDescriptor *'> descriptor := self generatorAt: byte0. savedB0 := byte0. savedB1 := byte1. savedB2 := byte2. savedB3 := byte3. + savedEA := extA. savedEB := extB. savedNEB := numExtB. - savedEA := extA. savedEB := extB. bcpc := bytecodePC + descriptor numBytes. [bcpc > endPC ifTrue: [^aTrinaryBlock value: nil value: 0 value: 0]. byte0 := (objectMemory fetchByte: bcpc ofObject: methodObj) + bytecodeSetOffset. descriptor := self generatorAt: byte0. self loadSubsequentBytesForDescriptor: descriptor at: bcpc. descriptor isExtension ifFalse: [| eA eB | eA := extA. eB := extB. + extA := savedEA. extB := savedEB. numExtB := savedNEB. - extA := savedEA. extB := savedEB. byte0 := savedB0. byte1 := savedB1. byte2 := savedB2. byte3 := savedB3. ^aTrinaryBlock value: descriptor value: eA value: eB]. self perform: descriptor generator. bcpc := bcpc + descriptor numBytes. true] whileTrue! Item was changed: ----- Method: Cogit>>scanBlock: (in category 'compile abstract instructions') ----- scanBlock: blockStart "Scan the block to determine if the block needs a frame or not" | descriptor pc end framelessStackDelta nExts | <var: #blockStart type: #'BlockStart *'> <var: #descriptor type: #'BytecodeDescriptor *'> needsFrame := false. methodOrBlockNumArgs := blockStart numArgs. inBlock := InVanillaBlock. pc := blockStart startpc. end := blockStart startpc + blockStart span. + framelessStackDelta := nExts := extA := numExtB := extB := 0. - framelessStackDelta := nExts := extA := extB := 0. [pc < end] whileTrue: [byte0 := (objectMemory fetchByte: pc ofObject: methodObj) + bytecodeSetOffset. descriptor := self generatorAt: byte0. descriptor isExtension ifTrue: [self loadSubsequentBytesForDescriptor: descriptor at: pc. self perform: descriptor generator]. needsFrame ifFalse: [(descriptor needsFrameFunction isNil or: [self perform: descriptor needsFrameFunction with: framelessStackDelta]) ifTrue: [needsFrame := true] ifFalse: [framelessStackDelta := framelessStackDelta + descriptor stackDelta]]. objectRepresentation maybeNoteDescriptor: descriptor blockStart: blockStart. pc := self nextBytecodePCFor: descriptor at: pc exts: nExts in: methodObj. descriptor isExtension ifTrue: [nExts := nExts + 1] + ifFalse: [nExts := extA := numExtB := 0. extB := 0]]. - ifFalse: [nExts := extA := extB := 0]]. needsFrame ifFalse: [framelessStackDelta < 0 ifTrue: [self error: 'negative stack delta in block; block contains bogus code or internal error']. [framelessStackDelta > 0] whileTrue: [descriptor := self generatorAt: (objectMemory fetchByte: blockStart startpc ofObject: methodObj) + bytecodeSetOffset. descriptor generator ~~ #genPushConstantNilBytecode ifTrue: [self error: 'frameless block doesn''t start with enough pushNils']. blockStart startpc: blockStart startpc + descriptor numBytes; span: blockStart span - descriptor numBytes. framelessStackDelta := framelessStackDelta - 1]]. ^0! Item was changed: ----- Method: Cogit>>scanMethod (in category 'compile abstract instructions') ----- scanMethod "Scan the method (and all embedded blocks) to determine - what the last bytecode is; extra bytes at the end of a method are used to encode things like source pointers or temp names - if the method needs a frame or not - what are the targets of any backward branches. - how many blocks it creates - if it contans an unknown bytecode Answer the block count or on error a negative error code" | latestContinuation nExts descriptor pc numBlocks distance targetPC framelessStackDelta | <var: #descriptor type: #'BytecodeDescriptor *'> needsFrame := false. NewspeakVM ifTrue: [numIRCs := 0]. (primitiveIndex > 0 and: [coInterpreter isQuickPrimitiveIndex: primitiveIndex]) ifTrue: [^0]. pc := latestContinuation := initialPC. + numBlocks := framelessStackDelta := nExts := extA := numExtB := extB := 0. - numBlocks := framelessStackDelta := nExts := extA := extB := 0. [pc <= endPC] whileTrue: [byte0 := (objectMemory fetchByte: pc ofObject: methodObj) + bytecodeSetOffset. descriptor := self generatorAt: byte0. descriptor isExtension ifTrue: [descriptor opcode = Nop ifTrue: "unknown bytecode tag; see Cogit class>>#generatorTableFrom:" [^EncounteredUnknownBytecode]. self loadSubsequentBytesForDescriptor: descriptor at: pc. self perform: descriptor generator]. (descriptor isReturn and: [pc >= latestContinuation]) ifTrue: [endPC := pc]. needsFrame ifFalse: [(descriptor needsFrameFunction isNil or: [self perform: descriptor needsFrameFunction with: framelessStackDelta]) ifTrue: [needsFrame := true] ifFalse: [framelessStackDelta := framelessStackDelta + descriptor stackDelta]]. descriptor isBranch ifTrue: [distance := self spanFor: descriptor at: pc exts: nExts in: methodObj. targetPC := pc + descriptor numBytes + distance. (self isBackwardBranch: descriptor at: pc exts: nExts in: methodObj) ifTrue: [self initializeFixupAt: targetPC - initialPC] ifFalse: [latestContinuation := latestContinuation max: targetPC]]. descriptor isBlockCreation ifTrue: [numBlocks := numBlocks + 1. distance := self spanFor: descriptor at: pc exts: nExts in: methodObj. targetPC := pc + descriptor numBytes + distance. latestContinuation := latestContinuation max: targetPC]. NewspeakVM ifTrue: [descriptor hasIRC ifTrue: [numIRCs := numIRCs + 1]]. pc := pc + descriptor numBytes. descriptor isExtension ifTrue: [nExts := nExts + 1] + ifFalse: [nExts := extA := numExtB := extB := 0]]. - ifFalse: [nExts := extA := extB := 0]]. ^numBlocks! Item was changed: ----- Method: Cogit>>setInterpreter: (in category 'initialization') ----- setInterpreter: aCoInterpreter "Initialization of the code generator in the simulator. These objects already exist in the generated C VM or are used only in the simulation." <doNotGenerate> coInterpreter := aCoInterpreter. objectMemory := aCoInterpreter objectMemory. threadManager := aCoInterpreter threadManager. "N.B. may be nil" methodZone := CogMethodZone new. objectRepresentation := objectMemory objectRepresentationClass forCogit: self methodZone: methodZone. methodZone setInterpreter: aCoInterpreter objectRepresentation: objectRepresentation cogit: self. generatorTable := self class generatorTable. processor := ProcessorClass new. simulatedAddresses := Dictionary new. simulatedTrampolines := Dictionary new. simulatedVariableGetters := Dictionary new. simulatedVariableSetters := Dictionary new. traceStores := 0. traceFlags := (self class initializationOptions at: #recordPrimTrace ifAbsent: [true]) ifTrue: [8] "record prim trace on by default (see Cogit class>>decareCVarsIn:)" ifFalse: [0]. debugPrimCallStackOffset := 0. singleStep := printRegisters := printInstructions := clickConfirm := false. backEnd := CogCompilerClass for: self. methodLabel := CogCompilerClass for: self. (literalsManager := backEnd class literalsManagerClass new) cogit: self. ordinarySendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines). superSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines). BytecodeSetHasDirectedSuperSend ifTrue: [directedSuperSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines)]. NewspeakVM ifTrue: [selfSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines). dynamicSuperSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines). implicitReceiverSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines). outerSendTrampolines := CArrayAccessor on: (Array new: NumSendTrampolines)]. "debug metadata" objectReferencesInRuntime := CArrayAccessor on: (Array new: NumObjRefsInRuntime). runtimeObjectRefIndex := 0. "debug metadata" trampolineAddresses := CArrayAccessor on: (Array new: NumTrampolines * 2). trampolineTableIndex := 0. + extA := numExtB := extB := 0. - extA := extB := 0. compilationTrace ifNil: [compilationTrace := self class initializationOptions at: #compilationTrace ifAbsent: [0]]. debugOpcodeIndices := self class initializationOptions at: #debugOpcodeIndices ifAbsent: [Set new]. debugBytecodePointers := self class initializationOptions at: #debugBytecodePointers ifAbsent: [Set new]! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtJumpIfFalse (in category 'bytecode generators') ----- genExtJumpIfFalse "244 11110100 i i i i i i i i Pop and Jump 0n False i i i i i i i i (+ Extend B * 256, where Extend B >= 0)" | distance target | distance := byte1 + (extB << 8). self assert: distance = (self v4: (self generatorAt: byte0) LongForward: bytecodePC Branch: (extA ~= 0 ifTrue: [1] ifFalse: [0]) + (extB ~= 0 ifTrue: [1] ifFalse: [0]) Distance: methodObj). extB := 0. + numExtB := 0. target := distance + 2 + bytecodePC. ^self genJumpIf: objectMemory falseObject to: target! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtJumpIfTrue (in category 'bytecode generators') ----- genExtJumpIfTrue "243 11110011 i i i i i i i i Pop and Jump 0n True i i i i i i i i (+ Extend B * 256, where Extend B >= 0)" | distance target | distance := byte1 + (extB << 8). self assert: distance = (self v4: (self generatorAt: byte0) LongForward: bytecodePC Branch: (extA ~= 0 ifTrue: [1] ifFalse: [0]) + (extB ~= 0 ifTrue: [1] ifFalse: [0]) Distance: methodObj). extB := 0. + numExtB := 0. target := distance + 2 + bytecodePC. ^self genJumpIf: objectMemory trueObject to: target! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtNopBytecode (in category 'bytecode generators') ----- genExtNopBytecode "NewspeakV4: 221 11011101 Nop" "SistaV1: 91 01011011' Nop" + extA := numExtB := extB := 0. - extA := extB := 0. ^0! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushCharacterBytecode (in category 'bytecode generators') ----- genExtPushCharacterBytecode "SistaV1: 233 11101001 iiiiiiii Push Character #iiiiiiii (+ Extend B * 256)" | value | value := byte1 + (extB << 8). extB := 0. + numExtB := 0. ^self genPushLiteral: (objectMemory characterObjectOf: value)! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushClosureBytecode (in category 'bytecode generators') ----- genExtPushClosureBytecode "Block compilation. At this point in the method create the block. Note its start and defer generating code for it until after the method and any other preceding blocks. The block's actual code will be compiled later." "253 11111101 eei i i kkk jjjjjjjj Push Closure Num Copied iii (+ Ext A // 16 * 8) Num Args kkk (+ Ext A \\ 16 * 8) BlockSize jjjjjjjj (+ Ext B * 256). ee = num extensions" | numArgs numCopied | self assert: needsFrame. self addBlockStartAt: bytecodePC + 3 "0 relative" numArgs: (numArgs := (byte1 bitAnd: 16r7) + (extA \\ 16 * 8)) numCopied: (numCopied := ((byte1 >> 3) bitAnd: 7) + (extA // 16 * 8)) span: byte2 + (extB << 8). + extA := numExtB := extB := 0. - extA := extB := 0. objectRepresentation genCreateClosureAt: bytecodePC + 4 "1 relative" numArgs: numArgs numCopied: numCopied contextNumArgs: methodOrBlockNumArgs large: (coInterpreter methodNeedsLargeContext: methodObj) inBlock: inBlock. self PushR: ReceiverResultReg. ^0! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushIntegerBytecode (in category 'bytecode generators') ----- genExtPushIntegerBytecode "NewsqueakV4: 229 11100101 iiiiiiii Push Integer #iiiiiiii (+ Extend B * 256, where bbbbbbbb = sddddddd, e.g. -32768 = i=0, a=0, s=1) SistaV1: 232 11101000 iiiiiiii Push Integer #iiiiiiii (+ Extend B * 256, where bbbbbbbb = sddddddd, e.g. -32768 = i=0, a=0, s=1)" | value | value := byte1 + (extB << 8). extB := 0. + numExtB := 0. ^self genPushLiteral: (objectMemory integerObjectOf: value)! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushPseudoVariable (in category 'bytecode generators') ----- genExtPushPseudoVariable "SistaV1: * 82 01010010 Push thisContext, (then Extend B = 1 => push thisProcess)" | ext | ext := extB. extB := 0. + numExtB := 0. ext caseOf: { [0] -> [^self genPushActiveContextBytecode]. } otherwise: [^self unknownBytecode]. ^0! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushPseudoVariableOrOuterBytecode (in category 'bytecode generators') ----- genExtPushPseudoVariableOrOuterBytecode "77 01001101 Push false [* 1:true, 2:nil, 3:thisContext, ..., -N: pushEnclosingObjectAt: N, N = Extend B]" | ext | ext := extB. extB := 0. + numExtB := 0. ext caseOf: { [0] -> [^self genPushLiteral: objectMemory falseObject]. [1] -> [^self genPushLiteral: objectMemory trueObject]. [2] -> [^self genPushLiteral: objectMemory nilObject]. [3] -> [^self genPushActiveContextBytecode] } otherwise: [ext < 0 ifTrue: [^self genPushEnclosingObjectAt: 0 - ext]. self warning: 'undefined extension for extPushPseudoVariableOrOuter'. ^self unknownBytecode]. ^0! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtPushRemoteTempOrInstVarLongBytecode (in category 'bytecode generators') ----- genExtPushRemoteTempOrInstVarLongBytecode | index | ^ (byte2 noMask: coInterpreter remoteIsInstVarAccess) ifTrue: [ self genPushRemoteTempLongBytecode ] ifFalse: [ index := byte1 + (extA << 8). extA := 0. extB := 0. "don't use flags in the simple cogit" + numExtB := 0. (coInterpreter isReadMediatedContextInstVarIndex: index) ifTrue: [self genPushMaybeContextRemoteInstVar: index inObjectAt: byte2 - coInterpreter remoteIsInstVarAccess] ifFalse: [self genPushRemoteInstVar: index inObjectAt: byte2 - coInterpreter remoteIsInstVarAccess]]! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendAbsentDynamicSuperBytecode (in category 'bytecode generators') ----- genExtSendAbsentDynamicSuperBytecode "241 11110001 i i i i i j j j Send To Absent Dynamic Superclass Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | litIndex nArgs | litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. ^self genSendAbsentDynamicSuper: litIndex numArgs: nArgs! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendAbsentImplicitBytecode (in category 'bytecode generators') ----- genExtSendAbsentImplicitBytecode "240 11110000 i i i i i j j j Send To Absent Implicit Receiver Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | litIndex nArgs | litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. ^self genSendAbsentImplicit: litIndex numArgs: nArgs! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendAbsentOuterBytecode (in category 'bytecode generators') ----- genExtSendAbsentOuterBytecode "254 11111110 i i i i i j j j kkkkkkkk Send To Absent Outer Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments at Depth kkkkkkkk " | litIndex nArgs depth | litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. depth := byte2. ^self genSendAbsentOuter: litIndex numArgs: nArgs depth: depth ! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendAbsentSelfBytecode (in category 'bytecode generators') ----- genExtSendAbsentSelfBytecode "245 11110101 i i i i i j j j Send To Absent Self Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | litIndex nArgs | litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. ^self genSendAbsentSelf: litIndex numArgs: nArgs! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendBytecode (in category 'bytecode generators') ----- genExtSendBytecode "238 11101110 i i i i i j j j Send Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | litIndex nArgs | litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. ^self genSend: litIndex numArgs: nArgs! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtSendSuperBytecode (in category 'bytecode generators') ----- genExtSendSuperBytecode "239 11101111 i i i i i j j j Send To Superclass Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | isDirected litIndex nArgs | (isDirected := extB >= 64) ifTrue: [extB := extB bitAnd: 63]. litIndex := (byte1 >> 3) + (extA << 5). extA := 0. nArgs := (byte1 bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. ^isDirected ifTrue: [self genSendDirectedSuper: litIndex numArgs: nArgs] ifFalse: [self genSendSuper: litIndex numArgs: nArgs]! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtStorePopRemoteTempOrInstVarLongBytecodePopBoolean: (in category 'bytecode generators') ----- genExtStorePopRemoteTempOrInstVarLongBytecodePopBoolean: popBoolean | index | extB := 0. "simple cogit don't use the extra flag" + numExtB := 0. (byte2 noMask: coInterpreter remoteIsInstVarAccess) ifTrue: [ self genStorePop: popBoolean RemoteTemp: byte1 At: byte2. self cppIf: IMMUTABILITY ifTrue: [ self annotateBytecode: self Label ] ] ifFalse: [ index := byte1 + (extA << 8). extA := 0. (coInterpreter isWriteMediatedContextInstVarIndex: index) ifTrue: [ self genStorePop: popBoolean MaybeContextRemoteInstVar: index ofObjectAt: byte2 - coInterpreter remoteIsInstVarAccess ] ifFalse: [ self genStorePop: popBoolean RemoteInstVar: index ofObjectAt: byte2 - coInterpreter remoteIsInstVarAccess ] ]. ^ 0! Item was changed: ----- Method: SimpleStackBasedCogit>>genExtUnconditionalJump (in category 'bytecode generators') ----- genExtUnconditionalJump "242 11110010 i i i i i i i i Jump i i i i i i i i (+ Extend B * 256, where bbbbbbbb = sddddddd, e.g. -32768 = i=0, a=0, s=1)" | distance target | distance := byte1 + (extB << 8). self assert: distance = (self v4: (self generatorAt: byte0) Long: bytecodePC Branch: (extA ~= 0 ifTrue: [1] ifFalse: [0]) + (extB ~= 0 ifTrue: [1] ifFalse: [0]) Distance: methodObj). extB := 0. + numExtB := 0. target := distance + 2 + bytecodePC. distance < 0 ifTrue: [^self genJumpBackTo: target]. self genJumpTo: target. "The bytecode must be mapped since it can be either forward or backward, and backwards branches must be mapped. So if forward, we need to map." self annotateBytecode: self lastOpcode. ^0! Item was changed: ----- Method: SimpleStackBasedCogit>>genSistaExtStoreAndPopReceiverVariableBytecodePopBoolean: (in category 'bytecode generators') ----- genSistaExtStoreAndPopReceiverVariableBytecodePopBoolean: boolean | index | extB := 0. "Simple cogit don't use the extra flags" + numExtB := 0. index := byte1 + (extA << 8). extA := 0. ^(coInterpreter isWriteMediatedContextInstVarIndex: index) ifTrue: [self genStorePop: boolean MaybeContextReceiverVariable: index ] ifFalse: [self genStorePop: boolean ReceiverVariable: index ]! Item was changed: ----- Method: SimpleStackBasedCogit>>genSistaExtStoreLiteralVariableBytecodePopBoolean: (in category 'bytecode generators') ----- genSistaExtStoreLiteralVariableBytecodePopBoolean: boolean | index | extB := 0. "SimpleCogit don't use the extra flags" + numExtB := 0. index := byte1 + (extA << 8). extA := 0. ^ self genStorePop: boolean LiteralVariable: index! Item was changed: ----- Method: SistaCogit>>genExtJumpIfNotInstanceOfBehaviorsBytecode (in category 'bytecode generators') ----- genExtJumpIfNotInstanceOfBehaviorsBytecode "SistaV1: * 254 11111110 kkkkkkkk jjjjjjjj branch If Not Instance Of Behavior/Array Of Behavior kkkkkkkk (+ Extend A * 256, where Extend A >= 0) distance jjjjjjjj (+ Extend B * 256, where Extend B >= 0)" | reg literal distance targetFixUp inverse | "We loose the information of in which register is stack top when jitting the branch target so we need to flush everything. We could use a fixed register here...." reg := self allocateRegForStackEntryAt: 0. self ssTop popToReg: reg. self ssFlushTo: simStackPtr. "flushed but the value is still in reg" self genPopStackBytecode. literal := self getLiteral: (extA * 256 + byte1). extA := 0. extB < 0 ifTrue: [extB := extB + 128. inverse := true] ifFalse: [inverse := false]. distance := extB * 256 + byte2. extB := 0. + numExtB := 0. targetFixUp := self cCoerceSimple: (self ensureFixupAt: bytecodePC + 3 + distance - initialPC) to: #'AbstractInstruction *'. inverse ifFalse: [(objectMemory isArrayNonImm: literal) ifTrue: [objectRepresentation branchIf: reg notInstanceOfBehaviors: literal target: targetFixUp] ifFalse: [objectRepresentation branchIf: reg notInstanceOfBehavior: literal target: targetFixUp] ] ifTrue: [(objectMemory isArrayNonImm: literal) ifTrue: [objectRepresentation branchIf: reg instanceOfBehaviors: literal target: targetFixUp] ifFalse: [objectRepresentation branchIf: reg instanceOfBehavior: literal target: targetFixUp]]. ^0! Item was changed: ----- Method: SistaCogit>>genUnaryInlinePrimitive: (in category 'inline primitive generators') ----- genUnaryInlinePrimitive: prim "Unary inline primitives." "SistaV1: 248 11111000 iiiiiiii mjjjjjjj Call Primitive #iiiiiiii + (jjjjjjj * 256) m=1 means inlined primitive, no hard return after execution. See EncoderForSistaV1's class comment and StackInterpreter>>#unaryInlinePrimitive:" | rcvrReg resultReg | rcvrReg := self allocateRegForStackEntryAt: 0. resultReg := self allocateRegNotConflictingWith: (self registerMaskFor: rcvrReg). prim caseOf: { "00 unchecked class" [1] -> "01 unchecked pointer numSlots" [self ssTop popToReg: rcvrReg. self ssPop: 1. objectRepresentation genGetNumSlotsOf: rcvrReg into: resultReg; genConvertIntegerToSmallIntegerInReg: resultReg]. "02 unchecked pointer basicSize" [3] -> "03 unchecked byte numBytes" [self ssTop popToReg: rcvrReg. self ssPop: 1. objectRepresentation genGetNumBytesOf: rcvrReg into: resultReg; genConvertIntegerToSmallIntegerInReg: resultReg]. "04 unchecked short16Type format numShorts" "05 unchecked word32Type format numWords" "06 unchecked doubleWord64Type format numDoubleWords" [11] -> "11 unchecked fixed pointer basicNew" [self ssTop type ~= SSConstant ifTrue: [^EncounteredUnknownBytecode]. (objectRepresentation genGetInstanceOf: self ssTop constant into: resultReg initializingIf: self extBSpecifiesInitializeInstance) ~= 0 ifTrue: [^ShouldNotJIT]. "e.g. bad class" self ssPop: 1] . [20] -> "20 identityHash" [self ssTop popToReg: rcvrReg. objectRepresentation genGetHashFieldNonImmOf: rcvrReg asSmallIntegerInto: resultReg. self ssPop: 1] "21 identityHash (SmallInteger)" "22 identityHash (Character)" "23 identityHash (SmallFloat64)" "24 identityHash (Behavior)" } otherwise: [^EncounteredUnknownBytecode]. extB := 0. + numExtB := 0. self ssPushRegister: resultReg. ^0! Item was changed: ----- Method: SistaCogitClone>>genExtJumpIfNotInstanceOfBehaviorsBytecode (in category 'bytecode generators') ----- genExtJumpIfNotInstanceOfBehaviorsBytecode "SistaV1: * 254 11111110 kkkkkkkk jjjjjjjj branch If Not Instance Of Behavior/Array Of Behavior kkkkkkkk (+ Extend A * 256, where Extend A >= 0) distance jjjjjjjj (+ Extend B * 256, where Extend B >= 0)" | reg literal distance targetFixUp inverse | "We loose the information of in which register is stack top when jitting the branch target so we need to flush everything. We could use a fixed register here...." reg := self allocateRegForStackEntryAt: 0. self ssTop popToReg: reg. self ssFlushTo: simStackPtr. "flushed but the value is still in reg" self genPopStackBytecode. literal := self getLiteral: (extA * 256 + byte1). extA := 0. extB < 0 ifTrue: [extB := extB + 128. inverse := true] ifFalse: [inverse := false]. distance := extB * 256 + byte2. extB := 0. + numExtB := 0. targetFixUp := self cCoerceSimple: (self ensureFixupAt: bytecodePC + 3 + distance - initialPC) to: #'AbstractInstruction *'. inverse ifFalse: [(objectMemory isArrayNonImm: literal) ifTrue: [objectRepresentation branchIf: reg notInstanceOfBehaviors: literal target: targetFixUp] ifFalse: [objectRepresentation branchIf: reg notInstanceOfBehavior: literal target: targetFixUp] ] ifTrue: [(objectMemory isArrayNonImm: literal) ifTrue: [objectRepresentation branchIf: reg instanceOfBehaviors: literal target: targetFixUp] ifFalse: [objectRepresentation branchIf: reg instanceOfBehavior: literal target: targetFixUp]]. ^0! Item was changed: ----- Method: SistaCogitClone>>genUnaryInlinePrimitive: (in category 'inline primitive generators') ----- genUnaryInlinePrimitive: prim "Unary inline primitives." "SistaV1: 248 11111000 iiiiiiii mjjjjjjj Call Primitive #iiiiiiii + (jjjjjjj * 256) m=1 means inlined primitive, no hard return after execution. See EncoderForSistaV1's class comment and StackInterpreter>>#unaryInlinePrimitive:" | rcvrReg resultReg | rcvrReg := self allocateRegForStackEntryAt: 0. resultReg := self allocateRegNotConflictingWith: (self registerMaskFor: rcvrReg). prim caseOf: { "00 unchecked class" [1] -> "01 unchecked pointer numSlots" [self ssTop popToReg: rcvrReg. self ssPop: 1. objectRepresentation genGetNumSlotsOf: rcvrReg into: resultReg; genConvertIntegerToSmallIntegerInReg: resultReg]. "02 unchecked pointer basicSize" [3] -> "03 unchecked byte numBytes" [self ssTop popToReg: rcvrReg. self ssPop: 1. objectRepresentation genGetNumBytesOf: rcvrReg into: resultReg; genConvertIntegerToSmallIntegerInReg: resultReg]. "04 unchecked short16Type format numShorts" "05 unchecked word32Type format numWords" "06 unchecked doubleWord64Type format numDoubleWords" [11] -> "11 unchecked fixed pointer basicNew" [self ssTop type ~= SSConstant ifTrue: [^EncounteredUnknownBytecode]. (objectRepresentation genGetInstanceOf: self ssTop constant into: resultReg initializingIf: self extBSpecifiesInitializeInstance) ~= 0 ifTrue: [^ShouldNotJIT]. "e.g. bad class" self ssPop: 1] } otherwise: [^EncounteredUnknownBytecode]. extB := 0. + numExtB := 0. self ssPushRegister: resultReg. ^0! Item was changed: InterpreterPrimitives subclass: #StackInterpreter + instanceVariableNames: 'currentBytecode bytecodeSetSelector localFP localIP localSP stackLimit stackPage stackPages method instructionPointer stackPointer framePointer localReturnValue localAbsentReceiver localAbsentReceiverOrZero extA extB numExtB primitiveFunctionPointer methodCache nsMethodCache atCache lkupClassTag lkupClass methodDictLinearSearchLimit highestRunnableProcessPriority nextWakeupUsecs nextPollUsecs inIOProcessEvents interruptKeycode interruptPending savedWindowSize imageHeaderFlags fullScreenFlag deferDisplayUpdates pendingFinalizationSignals extraVMMemory interpreterProxy showSurfaceFn primitiveTable primitiveAccessorDepthTable externalPrimitiveTable externalPrimitiveTableFirstFreeIndex overflowedPage extraFramesToMoveOnOverflow globalSessionID jmpBuf jmpDepth suspendedCallbacks suspendedMethods numStackPages desiredNumStackPages desiredEdenBytes classNameIndex thisClassIndex metaclassNumSlots interruptCheckChain suppressHeartbeatFlag breakSelector breakSelector Length longRunningPrimitiveCheckMethod longRunningPrimitiveCheckSemaphore longRunningPrimitiveStartUsecs longRunningPrimitiveStopUsecs longRunningPrimitiveGCUsecs longRunningPrimitiveCheckSequenceNumber longRunningPrimitiveSignalUndelivered checkAllocFiller tempOop tempOop2 tempOop3 theUnknownShort the2ndUnknownShort imageFloatsBigEndian maxExtSemTabSizeSet lastMethodCacheProbeWrite gcSemaphoreIndex classByteArrayCompactIndex checkedPluginName statForceInterruptCheck statStackOverflow statStackPageDivorce statCheckForEvents statProcessSwitch statIOProcessEvents statPendingFinalizationSignals nativeSP nativeStackPointer lowcodeCalloutState shadowCallStackPointer' - instanceVariableNames: 'currentBytecode bytecodeSetSelector localFP localIP localSP stackLimit stackPage stackPages method instructionPointer stackPointer framePointer localReturnValue localAbsentReceiver localAbsentReceiverOrZero extA extB primitiveFunctionPointer methodCache nsMethodCache atCache lkupClassTag lkupClass methodDictLinearSearchLimit highestRunnableProcessPriority nextWakeupUsecs nextPollUsecs inIOProcessEvents interruptKeycode interruptPending savedWindowSize imageHeaderFlags fullScreenFlag deferDisplayUpdates pendingFinalizationSignals extraVMMemory interpreterProxy showSurfaceFn primitiveTable primitiveAccessorDepthTable externalPrimitiveTable externalPrimitiveTableFirstFreeIndex overflowedPage extraFramesToMoveOnOverflow globalSessionID jmpBuf jmpDepth suspendedCallbacks suspendedMethods numStackPages desiredNumStackPages desiredEdenBytes classNameIndex thisClassIndex metaclassNumSlots interruptCheckChain suppressHeartbeatFlag breakSelector breakSelectorLength l ongRunningPrimitiveCheckMethod longRunningPrimitiveCheckSemaphore longRunningPrimitiveStartUsecs longRunningPrimitiveStopUsecs longRunningPrimitiveGCUsecs longRunningPrimitiveCheckSequenceNumber longRunningPrimitiveSignalUndelivered checkAllocFiller tempOop tempOop2 tempOop3 theUnknownShort the2ndUnknownShort imageFloatsBigEndian maxExtSemTabSizeSet lastMethodCacheProbeWrite gcSemaphoreIndex classByteArrayCompactIndex checkedPluginName statForceInterruptCheck statStackOverflow statStackPageDivorce statCheckForEvents statProcessSwitch statIOProcessEvents statPendingFinalizationSignals nativeSP nativeStackPointer lowcodeCalloutState shadowCallStackPointer' classVariableNames: 'AccessModifierPrivate AccessModifierProtected AccessModifierPublic AltBytecodeEncoderClassName AltLongStoreBytecode AlternateHeaderHasPrimFlag AlternateHeaderIsOptimizedFlag AlternateHeaderNumLiteralsMask AtCacheFixedFields AtCacheFmt AtCacheMask AtCacheOop AtCacheSize AtCacheTotalSize AtPutBase BytecodeEncoderClassName BytecodeTable CacheProbeMax DirBadPath DirEntryFound DirNoMoreEntries DumpStackOnLowSpace EnclosingMixinIndex EnclosingObjectIndex EnforceAccessControl FailImbalancedPrimitives LongStoreBytecode MaxExternalPrimitiveTableSize MaxJumpBuf MaxPrimitiveIndex MaxQuickPrimitiveIndex MethodHeaderArgCountShift MethodHeaderFlagBitPosition MethodHeaderTempCountShift MixinIndex PrimNumberDoExternalCall PrimNumberExternalCall PrimNumberFFICall PrimitiveExternalCallIndex PrimitiveTable StackPageReachedButUntraced StackPageTraceInvalid StackPageTraced StackPageUnreached V3PrimitiveBitsMask' poolDictionaries: 'VMBasicConstants VMBytecodeConstants VMMethodCacheConstants VMObjectIndices VMSpurObjectRepresentationConstants VMSqueakClassIndices VMStackFrameOffsets' category: 'VMMaker-Interpreter'! !StackInterpreter commentStamp: 'eem 12/5/2014 11:32' prior: 0! This class is a complete implementation of the Smalltalk-80 virtual machine, derived originally from the Blue Book specification but quite different in some areas. This VM supports Closures but *not* old-style BlockContexts. It has been modernized with 32-bit pointers, better management of Contexts (see next item), and attention to variable use that allows the CCodeGenerator (qv) to keep, eg, the instruction pointer and stack pointer in registers as well as keeping most simple variables in a global array that seems to improve performance for most platforms. The VM does not use Contexts directly. Instead Contexts serve as proxies for a more conventional stack format that is invisible to the image. There is considerable explanation at http://www.mirandabanda.org/cogblog/2009/01/14/under-cover-contexts-and-the…. The VM maintains a fixed-size stack zone divided into pages, each page being capable of holding several method/block activations. A send establishes a new frame in the current stack page, a return returns to the previous frame. This eliminates allocation/deallocation of contexts and the moving of receiver and arguments from caller to callee on each send/return. Contexts are created lazily when an activation needs a context (creating a block, explicit use of thisContext, access to sender when sender is a frame, or linking of stack pages together). Contexts are either conventional and heap-resident ("single") or "married" and serve as proxies for their corresponding frame or "widowed", meaning that their spouse f rame has been returned from (died). A married context is specially marked (more details in the code) and refers to its frame. Likewise a married frame is specially marked and refers to its context. In addition to SmallInteger arithmetic and Floats, the VM supports logic on 32-bit PositiveLargeIntegers, thus allowing it to simulate itself much more effectively than would otherwise be the case. StackInterpreter and subclasses support multiple memory managers. Currently there are two. NewMemoryManager is a slightly refined version of ObjectMemory, and is the memory manager and garbage collector for the original Squeak object representation as described in "Back to the Future The Story of Squeak, A Practical Smalltalk Written in Itself", see http://ftp.squeak.org/docs/OOPSLA.Squeak.html. Spur is a faster, more regular object representation that is designed for more performance and functionality, and to have a common header format for both 32-bit and 64-bit versions. You can read about it in SpurMemoryManager's class comment. There is also a video of a presentation at ESUG 2014 (https://www.youtube.com/watch?v=k0nBNS1aHZ4), along with slides (http://www.slideshare.net/esug/spur-a-new-object-representation-for-cog?rel…).! Item was changed: ----- Method: StackInterpreter>>extBBytecode (in category 'miscellaneous bytecodes') ----- extBBytecode "225 11100001 sbbbbbbb Extend B (Ext B = Ext B prev * 256 + Ext B)" | byte | byte := self fetchByte. self fetchNextBytecode. + extB := (numExtB = 0 and: [byte > 127]) - extB := (extB = 0 and: [byte > 127]) ifTrue: [byte - 256] + ifFalse: [(extB bitShift: 8) + byte]. + numExtB := numExtB + 1! - ifFalse: [(extB bitShift: 8) + byte]! Item was changed: ----- Method: StackInterpreter>>extJumpIfFalse (in category 'jump bytecodes') ----- extJumpIfFalse "244 11110100 i i i i i i i i Pop and Jump 0n False i i i i i i i i (+ Extend B * 256, where Extend B >= 0)" | byte offset | byte := self fetchByte. offset := byte + (extB << 8). + numExtB := extB := extA := 0. - extB := extA := 0. self jumplfFalseBy: offset! Item was changed: ----- Method: StackInterpreter>>extJumpIfNotInstanceOfBehaviorsBytecode (in category 'sista bytecodes') ----- extJumpIfNotInstanceOfBehaviorsBytecode "254 11111110 kkkkkkkk jjjjjjjj branch If Not Instance Of Behavior/Array Of Behavior kkkkkkkk (+ Extend A * 256, where Extend A >= 0) distance jjjjjjjj (+ Extend B * 256, where Extend B >= 0)" | tosClassTag literal distance inverse | SistaVM ifFalse: [^self respondToUnknownBytecode]. extB < 0 ifTrue: [extB := extB + 128. inverse := true] ifFalse: [inverse := false]. tosClassTag := objectMemory fetchClassTagOf: self internalPopStack. literal := self literal: extA << 8 + self fetchByte. distance := extB << 8 + self fetchByte. extA := 0. extB := 0. + numExtB := 0. (objectMemory isArrayNonImm: literal) ifTrue: [0 to: (objectMemory numSlotsOf: literal) asInteger - 1 do: [:i | tosClassTag = (objectMemory rawClassTagForClass: (objectMemory fetchPointer: i ofObject: literal)) ifTrue: [ inverse ifTrue: [ localIP := localIP + distance ]. ^ self fetchNextBytecode ] ]. inverse ifFalse: [localIP := localIP + distance]. ^ self fetchNextBytecode] ifFalse: [tosClassTag ~= (objectMemory rawClassTagForClass: literal) ifTrue: [inverse ifFalse: [localIP := localIP + distance]. ^ self fetchNextBytecode]]. inverse ifTrue: [localIP := localIP + distance]. self fetchNextBytecode! Item was changed: ----- Method: StackInterpreter>>extJumpIfTrue (in category 'jump bytecodes') ----- extJumpIfTrue "243 11110011 i i i i i i i i Pop and Jump 0n True i i i i i i i i (+ Extend B * 256, where Extend B >= 0)" | byte offset | byte := self fetchByte. offset := byte + (extB << 8). + numExtB := extB := extA := 0. - extB := extA := 0. self jumplfTrueBy: offset! Item was changed: ----- Method: StackInterpreter>>extNopBytecode (in category 'miscellaneous bytecodes') ----- extNopBytecode "SistaV1 94 01011111 Nop" "NewspeakV4: 221 11011101 Nop" self fetchNextBytecode. + numExtB := extA := extB := 0! - extA := extB := 0! Item was changed: ----- Method: StackInterpreter>>extPushCharacterBytecode (in category 'stack bytecodes') ----- extPushCharacterBytecode "SistaV1: * 233 11101001 iiiiiiii Push Character #iiiiiiii (+ Extend B * 256)" | value | value := self fetchByte + (extB << 8). self fetchNextBytecode. self internalPush: (objectMemory characterObjectOf: value). + numExtB := extB := 0! - extB := 0! Item was changed: ----- Method: StackInterpreter>>extPushClosureBytecode (in category 'stack bytecodes') ----- extPushClosureBytecode "253 11111101 eei i i kkk jjjjjjjj Push Closure Num Copied iii (+ Ext A // 16 * 8) Num Args kkk (+ Ext A \\ 16 * 8) BlockSize jjjjjjjj (+ Ext B * 256). ee = num extensions. The compiler has pushed the values to be copied, if any. Find numArgs and numCopied in the byte following. Create a Closure with space for the copiedValues and pop numCopied values off the stack into the closure. Set numArgs as specified, and set startpc to the pc following the block size and jump over that code." | byte numArgs numCopied blockSize | byte := self fetchByte. numArgs := (byte bitAnd: 7) + (extA \\ 16 * 8). numCopied := ((byte >> 3) bitAnd: 7) + (extA // 16 * 8). extA := 0. blockSize := self fetchByte + (extB << 8). + numExtB := extB := 0. - extB := 0. self pushClosureNumArgs: numArgs copiedValues: numCopied blockSize: blockSize! Item was changed: ----- Method: StackInterpreter>>extPushIntegerBytecode (in category 'stack bytecodes') ----- extPushIntegerBytecode "229 11100101 i i i i i i i i Push Integer #iiiiiiii (+ Extend B * 256, where bbbbbbbb = sddddddd, e.g. -32768 = i=0, a=0, s=1)" | value | value := self fetchByte + (extB << 8). self fetchNextBytecode. extB := 0. + numExtB := 0. self internalPush: (objectMemory integerObjectOf: value)! Item was changed: ----- Method: StackInterpreter>>extPushPseudoVariable (in category 'stack bytecodes') ----- extPushPseudoVariable "SistaV1: * 82 01010010 Push thisContext, (then e.g. Extend B 1 = push thisProcess)" | theThingToPush | extB caseOf: { [0] -> [theThingToPush := self ensureFrameIsMarried: localFP SP: localSP]. [1] -> [theThingToPush := self activeProcess] } otherwise: [self respondToUnknownBytecode]. self fetchNextBytecode. self internalPush: theThingToPush. + extB := 0. + numExtB := 0.! - extB := 0! Item was changed: ----- Method: StackInterpreter>>extPushPseudoVariableOrOuterBytecode (in category 'stack bytecodes') ----- extPushPseudoVariableOrOuterBytecode "77 01001101 Push false [* 1:true, 2:nil, 3:thisContext, ..., -N: pushExplicitOuter: N, N = Extend B]" | thing | self fetchNextBytecode. thing := extB caseOf: { [0] -> [^self internalPush: objectMemory falseObject]. [1] -> [objectMemory trueObject]. [2] -> [objectMemory nilObject]. [3] -> [| context | context := self ensureFrameIsMarried: localFP SP: localSP. context] } otherwise: [extB < 0 ifTrue: [self enclosingObjectAt: 0 - extB withObject: self receiver withMixin: (self methodClassOf: method)] ifFalse: [self error: 'undefined extension for extPushPseudoVariableOrOuter'. objectMemory nilObject]]. extB := 0. + numExtB := 0. self internalPush: thing! Item was changed: ----- Method: StackInterpreter>>extPushRemoteTempOrInstVarLongBytecode (in category 'stack bytecodes') ----- extPushRemoteTempOrInstVarLongBytecode | slotIndex tempIndex object | slotIndex := self fetchByte. tempIndex := self fetchByte. self fetchNextBytecode. (tempIndex noMask: self remoteIsInstVarAccess) ifTrue: [self pushRemoteTemp: slotIndex inVectorAt: tempIndex] ifFalse: [ slotIndex := slotIndex + (extA << 8). tempIndex := tempIndex - self remoteIsInstVarAccess. + numExtB := extA := extB := 0. - extA := extB := 0. object := self temporary: tempIndex in: localFP. self pushMaybeContext: object receiverVariable: slotIndex ]! Item was changed: ----- Method: StackInterpreter>>extSendAbsentDynamicSuperBytecode (in category 'send bytecodes') ----- extSendAbsentDynamicSuperBytecode "241 11110001 i i i i i j j j Send To Dynamic Superclass Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | byte | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. self commonSendDynamicSuper! Item was changed: ----- Method: StackInterpreter>>extSendAbsentImplicitBytecode (in category 'send bytecodes') ----- extSendAbsentImplicitBytecode "240 11110000 i i i i i j j j Send To Absent Implicit Receiver Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | byte | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. self commonSendImplicitReceiver.! Item was changed: ----- Method: StackInterpreter>>extSendAbsentOuterBytecode (in category 'send bytecodes') ----- extSendAbsentOuterBytecode "254 11111110 i i i i i j j j kkkkkkkk Send To Enclosing Object at Depth kkkkkkkk Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | byte depth | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. depth := self fetchByte. self commonSendOuter: depth! Item was changed: ----- Method: StackInterpreter>>extSendAbsentSelfBytecode (in category 'send bytecodes') ----- extSendAbsentSelfBytecode "245 11110101 i i i i i j j j Send To Self Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | byte | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. self commonSendOuter: 0! Item was changed: ----- Method: StackInterpreter>>extSendBytecode (in category 'send bytecodes') ----- extSendBytecode "238 11101110 i i i i i j j j Send Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments" | byte rcvr | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. rcvr := self internalStackValue: argumentCount. lkupClassTag := objectMemory fetchClassTagOf: rcvr. self commonSendOrdinary! Item was changed: ----- Method: StackInterpreter>>extSendSuperBytecode (in category 'send bytecodes') ----- extSendSuperBytecode "239 11101111 i i i i i j j j ExtendB < 64 ifTrue: [Send To Superclass Literal Selector #iiiii (+ Extend A * 32) with jjj (+ Extend B * 8) Arguments] ifFalse: [Send To Superclass of Stacked Class Literal Selector #iiiii (+ Extend A * 32) with jjj (+ (Extend B bitAnd: 63) * 8) Arguments]" | byte | byte := self fetchByte. messageSelector := self literal: (byte >> 3) + (extA << 5). extA := 0. BytecodeSetHasDirectedSuperSend ifTrue: [extB >= 64 ifTrue: [argumentCount := (byte bitAnd: 7) + (extB - 64 << 3). extB := 0. ^self directedSuperclassSend]]. argumentCount := (byte bitAnd: 7) + (extB << 3). extB := 0. + numExtB := 0. self superclassSend! Item was changed: ----- Method: StackInterpreter>>extSistaStoreAndPopLiteralVariableBytecode (in category 'stack bytecodes') ----- extSistaStoreAndPopLiteralVariableBytecode "236 11101100 i i i i i i i i Pop and Store Literal Variable #iiiiiiii (+ Extend A * 256) (3) ExtB lowest bit implies no store check is needed, ExtB next bit implies the object may be a context, other bits in the extension are unused." | variableIndex value | variableIndex := self fetchByte + (extA << 8). value := self internalStackTop. self internalPop: 1. + extA := numExtB := extB := 0. - extA := extB := 0.. self storeLiteralVariable: variableIndex withValue: value. self fetchNextBytecode.! Item was changed: ----- Method: StackInterpreter>>extSistaStoreAndPopReceiverVariableBytecode (in category 'stack bytecodes') ----- extSistaStoreAndPopReceiverVariableBytecode "235 11101011 i i i i i i i i Pop and Store Receiver Variable #iiiiiii (+ Extend A * 256) (3) ExtB lowest bit implies no store check is needed, ExtB next bit implies the object may be a context, other bits in the extension are unused." | variableIndex value | variableIndex := self fetchByte + (extA << 8). + extA := numExtB := extB := 0. - extA := extB := 0. value := self internalStackTop. self internalPop: 1. self storeMaybeContextReceiverVariable: variableIndex withValue: value. self fetchNextBytecode.! Item was changed: ----- Method: StackInterpreter>>extSistaStoreLiteralVariableBytecode (in category 'stack bytecodes') ----- extSistaStoreLiteralVariableBytecode "233 11101001 i i i i i i i i Store Literal Variable #iiiiiiii (+ Extend A * 256) (3) ExtB lowest bit implies no store check is needed, ExtB next bit implies the object may be a context, other bits in the extension are unused." | variableIndex | variableIndex := self fetchByte + (extA << 8). + extA := numExtB := extB := 0. - extA := extB := 0. self storeLiteralVariable: variableIndex withValue: self internalStackTop. self fetchNextBytecode.! Item was changed: ----- Method: StackInterpreter>>extSistaStoreReceiverVariableBytecode (in category 'stack bytecodes') ----- extSistaStoreReceiverVariableBytecode "232 11101000 i i i i i i i i Store Receiver Variable #iiiiiii (+ Extend A * 256) (3) ExtB lowest bit implies no store check is needed, ExtB next bit implies the object may be a context, other bits in the extension are unused." | variableIndex | variableIndex := self fetchByte + (extA << 8). + extA := numExtB := extB := 0. - extA := extB := 0. self storeMaybeContextReceiverVariable: variableIndex withValue: self internalStackTop. self fetchNextBytecode.! Item was changed: ----- Method: StackInterpreter>>extStoreRemoteTempOrInstVarLongBytecode (in category 'stack bytecodes') ----- extStoreRemoteTempOrInstVarLongBytecode <inline: true> | slotIndex tempIndex object | slotIndex := self fetchByte. tempIndex := self fetchByte. self fetchNextBytecode. (tempIndex noMask: self remoteIsInstVarAccess) ifTrue: [self storeRemoteTemp: slotIndex inVectorAt: tempIndex] ifFalse: [ slotIndex := slotIndex + (extA << 8). tempIndex := tempIndex - self remoteIsInstVarAccess. + extA := numExtB := extB := 0. - extA := extB := 0. object := self temporary: tempIndex in: localFP. self storeMaybeContext: object receiverVariable: slotIndex withValue: self internalStackTop ]! Item was changed: ----- Method: StackInterpreter>>extUnconditionalJump (in category 'jump bytecodes') ----- extUnconditionalJump "242 11110010 i i i i i i i i Jump i i i i i i i i (+ Extend B * 256, where bbbbbbbb = sddddddd, e.g. -32768 = i=0, a=0, s=1)" | byte offset | byte := self fetchByte. offset := byte + (extB << 8). extB := 0. + numExtB := 0. localIP := localIP + offset. self ifBackwardsCheckForEvents: offset. self fetchNextBytecode! Item was changed: ----- Method: StackInterpreter>>initExtensions (in category 'simulation support') ----- initExtensions <inline: true> + BytecodeSetHasExtensions ifTrue: [extA := numExtB := extB := 0]! - BytecodeSetHasExtensions ifTrue: [extA := extB := 0]! Item was changed: ----- Method: StackInterpreter>>lowcodePrimitivePerformCallStructure (in category 'inline primitive generated code') ----- lowcodePrimitivePerformCallStructure <option: #LowcodeVM> "Lowcode instruction generator" | resultPointer result function structureSize | <var: #resultPointer type: #'char*' > <var: #result type: #'char*' > function := extA. structureSize := extB. result := self internalPopStackPointer. self internalPushShadowCallStackPointer: result. resultPointer := self lowcodeCalloutPointerResult: (self cCoerce: function to: #'char*'). self internalPushPointer: resultPointer. extA := 0. extB := 0. + numExtB := 0. - ! Item was changed: ----- Method: StackInterpreter>>lowcodePrimitivePointerAddConstantOffset (in category 'inline primitive generated code') ----- lowcodePrimitivePointerAddConstantOffset <option: #LowcodeVM> "Lowcode instruction generator" | base offset result | <var: #base type: #'char*' > <var: #result type: #'char*' > offset := extB. base := self internalPopStackPointer. result := base + offset. self internalPushPointer: result. extB := 0. + numExtB := 0. ! Item was changed: ----- Method: StackInterpreter>>unaryInlinePrimitive: (in category 'miscellaneous bytecodes') ----- unaryInlinePrimitive: primIndex "SistaV1: 248 11111000 iiiiiiii mjjjjjjj Call Primitive #iiiiiiii + (jjjjjjj * 256) m=1 means inlined primitive, no hard return after execution." <option: #SistaVM> | result | primIndex caseOf: { "1000 unchecked class" [0] -> [result := objectMemory fetchClassOf: self internalStackTop. self internalStackTopPut: result]. "1001 unchecked pointer numSlots" [1] -> [result := objectMemory numSlotsOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1002 unchecked pointer basicSize" [2] -> [result := (objectMemory numSlotsOf: self internalStackTop) - (objectMemory fixedFieldsOfClass: (objectMemory fetchClassOfNonImm: self internalStackTop)). self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1003 unchecked byte8Type format numBytes (includes CompiledMethod)" [3] -> [result := objectMemory numBytesOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1004 unchecked short16Type format numShorts" [4] -> [result := objectMemory num16BitUnitsOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1005 unchecked word32Type format numWords" [5] -> [result := objectMemory num32BitUnitsOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1006 unchecked doubleWord64Type format numDoubleWords" [6] -> [result := objectMemory num64BitUnitsOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)]. "1011 unchecked fixed pointer basicNew" [11] -> [| classObj numSlots | classObj := self internalStackTop. numSlots := objectMemory instanceSizeOf: classObj. result := objectMemory eeInstantiateSmallClass: classObj numSlots: numSlots. (extB noMask: 1) ifTrue: [0 to: numSlots - 1 do: [:i| objectMemory storePointerUnchecked: i ofObject: result withValue: objectMemory nilObject]]. extB := 0. + numExtB := 0. self internalStackTopPut: result]. "1020 identityHash" [20] -> [result := objectMemory hashBitsOf: self internalStackTop. self internalStackTopPut: (objectMemory integerObjectOf: result)] "1021 identityHash (SmallInteger)" "1022 identityHash (Character)" "1023 identityHash (SmallFloat64)" "1024 identityHash (Behavior)" } otherwise: [localIP := localIP - 3. self respondToUnknownBytecode]! Item was changed: ----- Method: StackToRegisterMappingCogit>>genExtJumpIfNotInstanceOfBehaviorsOrPopBytecode (in category 'bytecode generators') ----- genExtJumpIfNotInstanceOfBehaviorsOrPopBytecode "SistaV1: * 254 11111110 kkkkkkkk jjjjjjjj branch If Not Instance Of Behavior/Array Of Behavior kkkkkkkk (+ Extend A * 256, where Extend A >= 0) distance jjjjjjjj (+ Extend B * 256, where Extend B >= 0)" | reg literal distance targetFixUp | "We loose the information of in which register is stack top when jitting the branch target so we need to flush everything. We could use a fixed register here...." reg := self allocateRegForStackEntryAt: 0. self ssTop popToReg: reg. self ssFlushTo: simStackPtr. "flushed but the value is still in reg" literal := self getLiteral: (extA * 256 + byte1). extA := 0. distance := extB * 256 + byte2. extB := 0. + numExtB := 0. targetFixUp := self cCoerceSimple: (self ensureFixupAt: bytecodePC + 3 + distance - initialPC) to: #'AbstractInstruction *'. (objectMemory isArrayNonImm: literal) ifTrue: [objectRepresentation branchIf: reg notInstanceOfBehaviors: literal target: targetFixUp] ifFalse: [objectRepresentation branchIf: reg notInstanceOfBehavior: literal target: targetFixUp]. self genPopStackBytecode. ^0! Item was changed: ----- Method: StackToRegisterMappingCogit>>genExtPushClosureBytecode (in category 'bytecode generators') ----- genExtPushClosureBytecode "Block compilation. At this point in the method create the block. Note its start and defer generating code for it until after the method and any other preceding blocks. The block's actual code will be compiled later." "253 11111101 eei i i kkk jjjjjjjj Push Closure Num Copied iii (+ Ext A // 16 * 8) Num Args kkk (+ Ext A \\ 16 * 8) BlockSize jjjjjjjj (+ Ext B * 256). ee = num extensions" | startpc numArgs numCopied | self assert: needsFrame. startpc := bytecodePC + (self generatorAt: byte0) numBytes. self addBlockStartAt: startpc "0 relative" numArgs: (numArgs := (byte1 bitAnd: 16r7) + (extA \\ 16 * 8)) numCopied: (numCopied := ((byte1 >> 3) bitAnd: 7) + (extA // 16 * 8)) span: byte2 + (extB << 8). + extA := numExtB := extB := 0. - extA := extB := 0. objectRepresentation createsClosuresInline ifTrue: [ self genInlineClosure: startpc numArgs: numArgs numCopied: numCopied ] ifFalse: [ self genOutlineClosure: startpc numArgs: numArgs numCopied: numCopied ]. ^ 0! Item was changed: ----- Method: StackToRegisterMappingCogit>>genExtPushRemoteTempOrInstVarLongBytecode (in category 'bytecode generators') ----- genExtPushRemoteTempOrInstVarLongBytecode | index maybeContext | ^ (byte2 noMask: coInterpreter remoteIsInstVarAccess) ifTrue: [ self genPushRemoteTempLongBytecode ] ifFalse: [ maybeContext := self extBSpecifiesMaybeContext. index := byte1 + (extA << 8). extA := 0. extB := 0. + numExtB := 0. ((coInterpreter isReadMediatedContextInstVarIndex: index) and: [ maybeContext ]) ifTrue: [ self genPushMaybeContextRemoteInstVar: index inObjectAt: byte2 - coInterpreter remoteIsInstVarAccess ] ifFalse: [ self genPushRemoteInstVar: index inObjectAt: byte2 - coInterpreter remoteIsInstVarAccess ] ]! Item was changed: ----- Method: StackToRegisterMappingCogit>>genExtStorePopRemoteTempOrInstVarLongBytecodePopBoolean: (in category 'bytecode generators') ----- genExtStorePopRemoteTempOrInstVarLongBytecodePopBoolean: boolean | index maybeContext needsStoreCheck needsImmCheck | needsStoreCheck := self sistaNeedsStoreCheck. maybeContext := self extBSpecifiesMaybeContext. needsImmCheck := self extBSpecifiesImmCheck. extB := 0. + numExtB := 0. (byte2 noMask: coInterpreter remoteIsInstVarAccess) ifTrue: [ self genStorePop: boolean RemoteTemp: byte1 At: byte2 needsStoreCheck: needsStoreCheck. self cppIf: IMMUTABILITY ifTrue: [ self annotateBytecode: self Label ] ] ifFalse: [index := byte1 + (extA << 8). extA := 0. ((coInterpreter isWriteMediatedContextInstVarIndex: index) and: [ maybeContext ]) ifTrue: [self genStorePop: boolean MaybeContextRemoteInstVar: index ofObjectAt: byte2 - coInterpreter remoteIsInstVarAccess needsStoreCheck: needsStoreCheck needsImmutabilityCheck: needsImmCheck ] ifFalse: [self genStorePop: boolean RemoteInstVar: index ofObjectAt: byte2 - coInterpreter remoteIsInstVarAccess needsStoreCheck: needsStoreCheck needsImmutabilityCheck: needsImmCheck ] ]. ^ 0! Item was changed: ----- Method: StackToRegisterMappingCogit>>genLowcodePerformCallStructure (in category 'inline primitive generators generated code') ----- genLowcodePerformCallStructure <option: #LowcodeVM> "Lowcode instruction generator" "Push the result space" self ssNativeTop nativeStackPopToReg: TempReg. self ssNativePop: 1. self PushR: TempReg. "Call the function" self callSwitchToCStack. self MoveCw: extA R: TempReg. self CallRT: ceFFICalloutTrampoline. "Fetch the result" self MoveR: backEnd cResultRegister R: ReceiverResultReg. self ssPushNativeRegister: ReceiverResultReg. extA := 0. extB := 0. + numExtB := 0. ^ 0 ! Item was changed: ----- Method: StackToRegisterMappingCogit>>genLowcodePointerAddConstantOffset (in category 'inline primitive generators generated code') ----- genLowcodePointerAddConstantOffset <option: #LowcodeVM> "Lowcode instruction generator" | base offset | offset := extB. (base := backEnd availableRegisterOrNoneFor: self liveRegisters) = NoReg ifTrue: [self ssAllocateRequiredReg: (base := optStatus isReceiverResultRegLive ifTrue: [Arg0Reg] ifFalse: [ReceiverResultReg])]. base = ReceiverResultReg ifTrue: [ optStatus isReceiverResultRegLive: false ]. self ssNativeTop nativePopToReg: base. self ssNativePop: 1. self AddCq: offset R: base. self ssPushNativeRegister: base. extB := 0. + numExtB := 0. ^ 0 ! Item was changed: ----- Method: StackToRegisterMappingCogit>>genSistaExtStoreAndPopReceiverVariableBytecodePopBoolean: (in category 'bytecode generators') ----- genSistaExtStoreAndPopReceiverVariableBytecodePopBoolean: popBoolean <inline: true> | index needsStoreCheck needsImmCheck maybeContext | needsStoreCheck := self sistaNeedsStoreCheck. needsImmCheck := self extBSpecifiesImmCheck. "Long form and short form exist for popInto. Only the long form exists for store. Store have an explicit flag to mark context accessing, while popInto context accessing are done through the long form, hence generate the context form if the flag is set or if this is a popInto." maybeContext := popBoolean or: [self extBSpecifiesMaybeContext]. extB := 0. + numExtB := 0. index := byte1 + (extA << 8). extA := 0. ^((coInterpreter isWriteMediatedContextInstVarIndex: index) and: [maybeContext]) ifTrue: [self genStorePop: popBoolean MaybeContextReceiverVariable: index needsStoreCheck: needsStoreCheck needsImmutabilityCheck: needsImmCheck] ifFalse: [self genStorePop: popBoolean ReceiverVariable: index needsStoreCheck: needsStoreCheck needsImmutabilityCheck: needsImmCheck]! Item was changed: ----- Method: StackToRegisterMappingCogit>>genSistaExtStoreLiteralVariableBytecodePopBoolean: (in category 'bytecode generators') ----- genSistaExtStoreLiteralVariableBytecodePopBoolean: boolean <inline: true> | index needsStoreCheck needsImmCheck | needsStoreCheck := self sistaNeedsStoreCheck. needsImmCheck := self extBSpecifiesImmCheck. index := byte1 + (extA << 8). + extA := numExtB := extB := 0. - extA := extB := 0. ^self genStorePop: boolean LiteralVariable: index needsStoreCheck: needsStoreCheck needsImmutabilityCheck: needsImmCheck! Item was changed: ----- Method: StackToRegisterMappingCogit>>scanBlock: (in category 'compile abstract instructions') ----- scanBlock: blockStart "Scan the block to determine if the block needs a frame or not" | descriptor pc end framelessStackDelta nExts pushingNils numPushNils | <var: #blockStart type: #'BlockStart *'> <var: #descriptor type: #'BytecodeDescriptor *'> needsFrame := false. LowcodeVM ifTrue: [ hasNativeFrame := false ]. prevBCDescriptor := nil. methodOrBlockNumArgs := blockStart numArgs. inBlock := InVanillaBlock. pc := blockStart startpc. end := blockStart startpc + blockStart span. + framelessStackDelta := nExts := extA := numExtB := extB := 0. - framelessStackDelta := nExts := extA := extB := 0. pushingNils := true. [pc < end] whileTrue: [byte0 := (objectMemory fetchByte: pc ofObject: methodObj) + bytecodeSetOffset. descriptor := self generatorAt: byte0. descriptor isExtension ifTrue: [self loadSubsequentBytesForDescriptor: descriptor at: pc. self perform: descriptor generator]. needsFrame ifFalse: [(descriptor needsFrameFunction isNil or: [self perform: descriptor needsFrameFunction with: framelessStackDelta]) ifTrue: [needsFrame := true] ifFalse: [framelessStackDelta := framelessStackDelta + descriptor stackDelta]]. objectRepresentation maybeNoteDescriptor: descriptor blockStart: blockStart. (pushingNils and: [descriptor isExtension not]) ifTrue: ["Count the initial number of pushed nils acting as temp initializers. We can't tell whether an initial pushNil is an operand reference or a temp initializer, except when the pushNil is a jump target (has a fixup), which never happens: self systemNavigation browseAllSelect: [:m| | ebc | (ebc := m embeddedBlockClosures select: [:ea| ea decompile statements first isMessage] thenCollect: [:ea| ea decompile statements first selector]) notEmpty and: [(#(whileTrue whileFalse whileTrue: whileFalse:) intersection: ebc) notEmpty]] or if the bytecode set has a push multiple nils bytecode. We simply count initial nils. Rarely we may end up over-estimating. We will correct by checking the stack depth at the end of the block in compileBlockBodies." (numPushNils := self numPushNils: descriptor pc: pc nExts: nExts method: methodObj) > 0 ifTrue: [self assert: (descriptor numBytes = 1 or: [descriptor generator == #genPushClosureTempsBytecode]). blockStart numInitialNils: blockStart numInitialNils + numPushNils] ifFalse: [pushingNils := false]]. pc := self nextBytecodePCFor: descriptor at: pc exts: nExts in: methodObj. descriptor isExtension ifTrue: [nExts := nExts + 1] + ifFalse: [nExts := extA := numExtB := extB := 0]. - ifFalse: [nExts := extA := extB := 0]. prevBCDescriptor := descriptor]. "It would be nice of this wasn't necessary but alas we need to do the eager scan for frameless methods so that we don't end up popping too much off the simulated stack, e.g. for pushNil; returnTopFromBlock methods." needsFrame ifFalse: [self assert: (framelessStackDelta >= 0 and: [blockStart numInitialNils >= framelessStackDelta]). blockStart numInitialNils: blockStart numInitialNils - framelessStackDelta]. ^0! Item was changed: ----- Method: StackToRegisterMappingCogit>>scanMethod (in category 'compile abstract instructions') ----- scanMethod "Scan the method (and all embedded blocks) to determine - what the last bytecode is; extra bytes at the end of a method are used to encode things like source pointers or temp names - if the method needs a frame or not - what are the targets of any backward branches. - how many blocks it creates Answer the block count or on error a negative error code" | latestContinuation nExts descriptor pc numBlocks distance targetPC framelessStackDelta seenInstVarStore | <var: #descriptor type: #'BytecodeDescriptor *'> needsFrame := useTwoPaths := seenInstVarStore := false. LowcodeVM ifTrue: [ hasNativeFrame := false ]. self maybeInitNumFixups. self maybeInitNumCounters. prevBCDescriptor := nil. NewspeakVM ifTrue: [numIRCs := 0]. (primitiveIndex > 0 and: [coInterpreter isQuickPrimitiveIndex: primitiveIndex]) ifTrue: [^0]. pc := latestContinuation := initialPC. + numBlocks := framelessStackDelta := nExts := extA := numExtB := extB := 0. - numBlocks := framelessStackDelta := nExts := extA := extB := 0. [pc <= endPC] whileTrue: [byte0 := (objectMemory fetchByte: pc ofObject: methodObj) + bytecodeSetOffset. descriptor := self generatorAt: byte0. descriptor isExtension ifTrue: [descriptor opcode = Nop ifTrue: "unknown bytecode tag; see Cogit class>>#generatorTableFrom:" [^EncounteredUnknownBytecode]. self loadSubsequentBytesForDescriptor: descriptor at: pc. self perform: descriptor generator]. (descriptor isReturn and: [pc >= latestContinuation]) ifTrue: [endPC := pc]. needsFrame ifFalse: [(descriptor needsFrameFunction isNil or: [self perform: descriptor needsFrameFunction with: framelessStackDelta]) ifTrue: ["With immutability we win simply by avoiding a frame build if the receiver is young and not immutable." self cppIf: IMMUTABILITY ifTrue: [descriptor is1ByteInstVarStore ifTrue: [useTwoPaths := true] ifFalse: [needsFrame := true. useTwoPaths := false]] ifFalse: [needsFrame := true. useTwoPaths := false]] ifFalse: [framelessStackDelta := framelessStackDelta + descriptor stackDelta. "Without immutability we win if there are two or more stores and the receiver is new." self cppIf: IMMUTABILITY ifTrue: [] ifFalse: [descriptor is1ByteInstVarStore ifTrue: [seenInstVarStore ifTrue: [useTwoPaths := true] ifFalse: [seenInstVarStore := true]]]]]. descriptor isBranch ifTrue: [distance := self spanFor: descriptor at: pc exts: nExts in: methodObj. targetPC := pc + descriptor numBytes + distance. self maybeCountFixup: descriptor. (self isBackwardBranch: descriptor at: pc exts: nExts in: methodObj) ifTrue: [self initializeFixupAt: targetPC - initialPC] ifFalse: [latestContinuation := latestContinuation max: targetPC. self maybeCountCounter]]. descriptor isBlockCreation ifTrue: [numBlocks := numBlocks + 1. distance := self spanFor: descriptor at: pc exts: nExts in: methodObj. targetPC := pc + descriptor numBytes + distance. latestContinuation := latestContinuation max: targetPC. self maybeCountFixup: descriptor]. NewspeakVM ifTrue: [descriptor hasIRC ifTrue: [numIRCs := numIRCs + 1]]. pc := pc + descriptor numBytes. + nExts := descriptor isExtension ifTrue: [nExts + 1] ifFalse: [extA := numExtB := extB := 0]. - nExts := descriptor isExtension ifTrue: [nExts + 1] ifFalse: [extA := extB := 0]. prevBCDescriptor := descriptor]. ^numBlocks!

3 2

VM Maker: VMMaker.oscog-eem.2076.mcz
by commits＠source.squeak.org 07 Jan '17

07 Jan '17

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.2076.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.2076 Author: eem Time: 6 January 2017, 4:58:37.437473 pm UUID: 6da05305-9e5a-43eb-9eb1-3a893606256f Ancestors: VMMaker.oscog-eem.2075 SpurPlanningCompactor: Fix stupid slip in seeing if enough space to move an object below previous pin. Never inline the three phases for ease of debugging (so objOop, prevOpb et al don't get renamed due to multiple copies of the object enumeration loop) as much as for performance measurment. =============== Diff against VMMaker.oscog-eem.2075 =============== Item was changed: ----- Method: SpurPlanningCompactor>>copyAndUnmark: (in category 'compaction') ----- copyAndUnmark: firstPass "Sweep the heap, unmarking all objects and moving mobile objects to their correct positions, restoring their savedFirstFields." + <inline: #never> | onePass | self logPhase: 'copying and unmarking...'. firstPass ifTrue: [self unmarkInitialImmobileObjects]. "If savedFirstFieldsSpace is empty there is nothing to move, and no second pass." savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [self assert: (self oop: firstMobileObject isGreaterThanOrEqualTo: manager endOfMemory). ^self]. onePass := self copyAndUnmarkMobileObjects. (onePass not and: [biasForGC]) ifTrue: "only ever one pass if biasForGC is true." [self unmarkObjectsAfterLastMobileObject]! Item was changed: ----- Method: SpurPlanningCompactor>>copyAndUnmarkMobileObjects (in category 'compaction') ----- copyAndUnmarkMobileObjects "Sweep the mobile portion of the heap, moving objects to their eventual locations, and clearing their marked bits. Remember to update the savedFirstFields of pointer objects, as these have been forwarded. Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). This enumeration matches those in planCompactSavingForwarders and updatePointersInMobileObjects." + <inline: #never> | toFinger top previousPin | <var: 'top' type: #usqInt> <var: 'toFinger' type: #usqInt> self deny: (manager isMarked: firstFreeObject). toFinger := manager startOfObject: firstFreeObject. top := savedFirstFieldsSpace start. manager allOldSpaceEntitiesForCompactingFrom: firstFreeObject do: [:o :n| self check: o. self assert: (previousPin ifNil: [toFinger <= (manager startOfObject: o)] ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). self assert: (savedFirstFieldsSpaceWasAllocated or: [savedFirstFieldsSpace limit <= manager firstObject asUnsignedInteger or: [toFinger < top]]). (manager isMarked: o) ifTrue: [(manager isPinned: o) ifTrue: [(manager isSegmentBridge: o) ifFalse: [manager setIsMarkedOf: o to: false. manager segmentManager notePinned: o]. previousPin ifNotNil: [| limit | limit := manager startOfObject: previousPin. manager addFreeChunkWithBytes: limit - toFinger at: toFinger. toFinger := manager addressAfter: previousPin. self assert: toFinger <= (manager startOfObject: o)]. previousPin := o] ifFalse: [| availableSpace bytes next | [previousPin notNil and: [availableSpace := (manager startOfObject: previousPin) - toFinger. bytes := manager bytesInObject: o. bytes ~= availableSpace + and: [bytes + (2 * manager allocationUnit) > availableSpace]]] whileTrue: - and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: ["The object does not fit in the space between toFinger and previousPin. Move toFinger beyond previousPin and update previousPin appropriately." availableSpace > 0 ifTrue: [manager addFreeChunkWithBytes: availableSpace at: toFinger]. toFinger := manager addressAfter: previousPin. next := manager objectStartingAt: toFinger. previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. toFinger := self copyAndUnmarkObject: o to: toFinger firstField: (manager longAt: top). (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: [| done | self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). done := self noMobileObjectsAfter: n. done ifTrue: [self freeAllUnpinnedObjectsFromObject: (previousPin ifNil: [n]) toFinger: toFinger] ifFalse: [self freeFrom: toFinger upTo: (manager startOfObject: n) previousPin: previousPin]. ^done]]]]. self freeFrom: toFinger upTo: manager endOfMemory previousPin: previousPin. ^true! Item was changed: ----- Method: SpurPlanningCompactor>>findHighestSuitableFreeBlock: (in category 'space management') ----- findHighestSuitableFreeBlock: spaceEstimate "If a freeBlock of size at least spaceEstimate exists high enough in the heap, choose it. Ignoring pinned objects for now, the total ammount of shrinkage is expected to be at least totalFreeOldSpace (because of collected objects). So any free chunk which is at or above endOfMemory - totalFreeOldSpace should not be corrupted during compaction. Let's play with this for a while and see how we get on." <inline: true> manager findLargestFreeChunk ifNotNil: [:largestFreeChunk| ((manager bytesInObject: largestFreeChunk) >= spaceEstimate + and: [largestFreeChunk asUnsignedInteger > (manager endOfMemory - manager freeSize) asUnsignedInteger]) ifTrue: - and: [largestFreeChunk asUnsignedInteger > (manager endOfMemory - manager totalFreeOldSpace) asUnsignedInteger]) ifTrue: [^largestFreeChunk]]. ^nil! Item was changed: ----- Method: SpurPlanningCompactor>>planCompactSavingForwarders (in category 'compaction') ----- planCompactSavingForwarders "Sweep the heap from firstFreeObject forwarding marked objects to where they can be moved to, saving their forwarding pointer in savedFirstFieldsSpace. Continue until either the end of the heap is reached or savedFirstFieldsSpace is full. Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). This enumeration matches those in updatePointersInMobileObjects and copyAndUnmarkMobileObjects." + <inline: #never> - | toFinger top previousPin | <var: 'top' type: #usqInt> <var: 'toFinger' type: #usqInt> savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [self logPhase: 'planning...']. self deny: (manager isMarked: firstFreeObject). toFinger := manager startOfObject: firstFreeObject. top := savedFirstFieldsSpace start. manager allOldSpaceEntitiesFrom: firstFreeObject do: [:o| self check: o. self assert: (previousPin ifNil: [toFinger <= (manager startOfObject: o)] ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). self assert: (savedFirstFieldsSpaceWasAllocated or: [savedFirstFieldsSpace limit <= manager firstObject asUnsignedInteger or: [toFinger < top]]). (manager isMarked: o) ifTrue: [(manager isPinned: o) ifTrue: "The empty gaps between two adjacent pinned objects (when not filled below) are freed." [previousPin ifNotNil: [self assert: (manager startOfObject: previousPin) - toFinger >= (manager allocationUnit * 2). toFinger := manager addressAfter: previousPin. self assert: toFinger <= (manager startOfObject: o)]. previousPin := o] ifFalse: [| availableSpace bytes next | [previousPin notNil and: [availableSpace := (manager startOfObject: previousPin) - toFinger. bytes := manager bytesInObject: o. bytes ~= availableSpace + and: [bytes + (2 * manager allocationUnit) > availableSpace]]] whileTrue: - and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: ["The object does not fit in the space between toFinger and previousPin. Move toFinger beyond previousPin and update previousPin appropriately." toFinger := manager addressAfter: previousPin. next := manager objectStartingAt: toFinger. previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. toFinger := self forwardMobileObject: o to: toFinger savedFirstFieldPtr: top. (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: [savedFirstFieldsSpace top: top - manager bytesPerOop. ^self noMobileObjectsAfter: o]]]]. savedFirstFieldsSpace top: top - manager bytesPerOop. ^true! Item was changed: ----- Method: SpurPlanningCompactor>>updatePointers (in category 'compaction') ----- updatePointers "Sweep the heap, updating all objects to their eventual locations. Remember to update the savedFirstFields of pointer objects, as these have been forwarded." + <inline: #never> | onePass | self logPhase: 'updating pointers...'. "If savedFirstFieldsSpace is empty there is nothing to do." savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [^self]. self assert: (manager startOfObject: firstFreeObject) = mobileStart. coInterpreter mapInterpreterOops. manager mapExtraRoots. self updatePointersInManagerHeapEntities. self updatePointersInSurvivingObjects. self updatePointersInInitialImmobileObjects. onePass := self updatePointersInMobileObjects. onePass ifFalse: [self updatePointersInObjectsOverflowingSavedFirstFieldsSpace]! Item was changed: ----- Method: SpurPlanningCompactor>>updatePointersInMobileObjects (in category 'compaction') ----- updatePointersInMobileObjects "Sweep the mobile portion of the heap, updating all references to objects to their eventual locations. Remember to update the savedFirstFields of pointer objects, as these have been forwarded. Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). This enumeration matches that in planCompactSavingForwarders and copyAndUnmarkMobileObjects." | toFinger top previousPin | <var: 'top' type: #usqInt> <var: 'toFinger' type: #usqInt> self deny: (manager isMarked: firstFreeObject). toFinger := manager startOfObject: firstFreeObject. top := savedFirstFieldsSpace start. manager allOldSpaceEntitiesFrom: firstFreeObject do: [:o| self check: o. self assert: (previousPin ifNil: [toFinger <= (manager startOfObject: o)] ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). (manager isMarked: o) ifTrue: [(manager isPinned: o) ifTrue: "The empty gaps between two adjacent pinned objects (when not filled below) are freed." [self updatePointersIn: o. previousPin ifNotNil: [toFinger := manager addressAfter: previousPin]. previousPin := o] ifFalse: [| availableSpace bytes next | [previousPin notNil and: [availableSpace := (manager startOfObject: previousPin) - toFinger. bytes := manager bytesInObject: o. bytes ~= availableSpace + and: [bytes + (2 * manager allocationUnit) > availableSpace]]] whileTrue: - and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: ["The object does not fit in the space between toFinger and previousPin. Move toFinger beyond previousPin and update previousPin appropriately." toFinger := manager addressAfter: previousPin. next := manager objectStartingAt: toFinger. previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. self updatePointersIn: o savedFirstFieldPointer: top. toFinger := toFinger + (manager bytesInObject: o). (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: [self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). ^self noMobileObjectsAfter: o]]]]. self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). ^true!

1 0

VM Maker: VMMaker-dtl.391.mcz
by commits＠source.squeak.org 06 Jan '17

06 Jan '17

David T. Lewis uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker-dtl.391.mcz ==================== Summary ==================== Name: VMMaker-dtl.391 Author: dtl Time: 5 January 2017, 7:35:14.1 pm UUID: eb3fd060-b323-4a7d-9b06-b4b23f599fc8 Ancestors: VMMaker-dtl.390 VMMaker 4.16.2 Old image support: Rescue five sound primitive assignments for updatePrimitiveTable for primitives that should be loaded from SouondGenerationPlugin, not from SoundPlugin. The following ancient primitives are still not loadable into the primitiive table for old image support: #primWaveTableSoundmixSampleCountintostartingAtpan #primFMSoundmixSampleCountintostartingAtpan #primPluckedSoundmixSampleCountintostartingAtpan #primSampledSoundmixSampleCountintostartingAtpan #oldprimSampledSoundmixSampleCountintostartingAtleftVolrightVol In addition #primitiveReadJoystick does not load from JoystickTabletPlugin when running on Linux, but this is confirmed to be an artifact of the function loader, which abandons the attempt to load a module if #initialiseModule answers false, as is the case in the Unix stub code implementation (so it should work on platforms that do support the joystick plugin). =============== Diff against VMMaker-dtl.390 =============== Item was changed: ----- Method: InterpreterPrimitives>>updatePrimitiveTable (in category 'primitive table') ----- updatePrimitiveTable "Make any run time updates to the primitive table that may be required for supporting the current running image. May be called by an interpreter that determines at run time that it needs to provide support for an older image. References: The SqueakJS dispatch table, which is known to run the full range of Squeak images, is used as a reference, along with comparison to the Squeak VM table as of January 2005 from VMMaker-tpr.22, which was the last version prior to converting images to support full closures (dtl Dec 2016)" | primitiveTableUpdated | <inline: false> <var: #primitiveTableUpdated type: 'static int'> primitiveTableUpdated == true ifFalse: [ primitiveTableUpdated := true. self useOldPrimitives ifTrue: [ self installPrimitive: #primitiveNext at: 65. self installPrimitive: #primitiveNextPut at: 66. self installPrimitive: #primitiveAtEnd at: 67. self installPrimitive: #primitiveBlockCopy at: 80. self installPrimitive: #primitiveValue at: 81. self installPrimitive: #primitiveValueWithArgs at: 82. self installPrimitive: 'primitiveCopyBits' from: 'BitBltPlugin' at: 96. self installPrimitive: #primitiveValueUninterruptably at: 123. self installPrimitive: 'primitiveReadJoystick' from: 'JoystickTabletPlugin' at: 146. self installPrimitive: 'primitiveWarpBits' from: 'BitBltPlugin' at: 147. self installPrimitive: 'primitiveFileAtEnd' from: 'FilePlugin' at: 150. self installPrimitive: 'primitiveFileClose' from: 'FilePlugin' at: 151. self installPrimitive: 'primitiveFileGetPosition' from: 'FilePlugin' at: 152. self installPrimitive: 'primitiveFileOpen' from: 'FilePlugin' at: 153. self installPrimitive: 'primitiveFileRead' from: 'FilePlugin' at: 154. self installPrimitive: 'primitiveFileSetPosition' from: 'FilePlugin' at: 155. self installPrimitive: 'primitiveFileDelete' from: 'FilePlugin' at: 156. self installPrimitive: 'primitiveFileSize' from: 'FilePlugin' at: 157. self installPrimitive: 'primitiveFileWrite' from: 'FilePlugin' at: 158. self installPrimitive: 'primitiveFileRename' from: 'FilePlugin' at: 159. self installPrimitive: 'primitiveDirectoryCreate' from: 'FilePlugin' at: 160. self installPrimitive: 'primitiveDirectoryDelimitor' from: 'FilePlugin'at: 161. self installPrimitive: 'primitiveDirectoryLookup' from: 'FilePlugin' at: 162. self installPrimitive: 'primitiveDirectoryDelete' from: 'FilePlugin' at: 163. self installPrimitive: 'primitiveDirectorySetMacTypeAndCreator' from: 'FilePlugin' at: 169. self installPrimitive: 'primitiveSoundStart' from: 'SoundPlugin' at: 170. self installPrimitive: 'primitiveSoundStartWithSemaphore' from: 'SoundPlugin' at: 171. self installPrimitive: 'primitiveSoundStop' from: 'SoundPlugin' at: 172. self installPrimitive: 'primitiveSoundAvailableSpace' from: 'SoundPlugin' at: 173. self installPrimitive: 'primitiveSoundPlaySamples' from: 'SoundPlugin' at: 174. self installPrimitive: 'primitiveSoundPlaySilence' from: 'SoundPlugin' at: 175. + self installPrimitive: 'primWaveTableSoundmixSampleCountintostartingAtpan' from: 'SoundGenerationPlugin' at: 176. + self installPrimitive: 'primFMSoundmixSampleCountintostartingAtpan' from: 'SoundGenerationPlugin' at: 177. + self installPrimitive: 'primPluckedSoundmixSampleCountintostartingAtpan' from: 'SoundGenerationPlugin' at: 178. + self installPrimitive: 'primSampledSoundmixSampleCountintostartingAtpan' from: 'SoundGenerationPlugin' at: 179. + self installPrimitive: 'primitiveMixFMSound' from: 'SoundGenerationPlugin' at: 180. + self installPrimitive: 'primitiveMixPluckedSound' from: 'SoundGenerationPlugin' at: 181. + self installPrimitive: 'oldprimSampledSoundmixSampleCountintostartingAtleftVolrightVol' from: 'SoundGenerationPlugin' at: 182. + self installPrimitive: 'primitiveApplyReverb' from: 'SoundGenerationPlugin' at: 183. + self installPrimitive: 'primitiveMixLoopedSampledSound' from: 'SoundGenerationPlugin' at: 184. + self installPrimitive: 'primitiveMixSampledSound' from: 'SoundGenerationPlugin' at: 185. - self installPrimitive: 'primWaveTableSoundmixSampleCountintostartingAtpan' from: 'SoundPlugin' at: 176. - self installPrimitive: 'primFMSoundmixSampleCountintostartingAtpan' from: 'SoundPlugin' at: 177. - self installPrimitive: 'primPluckedSoundmixSampleCountintostartingAtpan' from: 'SoundPlugin' at: 178. - self installPrimitive: 'primSampledSoundmixSampleCountintostartingAtpan' from: 'SoundPlugin' at: 179. - self installPrimitive: 'primitiveMixFMSound' from: 'SoundPlugin' at: 180. - self installPrimitive: 'primitiveMixPluckedSound' from: 'SoundPlugin' at: 181. - self installPrimitive: 'oldprimSampledSoundmixSampleCountintostartingAtleftVolrightVol' from: 'SoundPlugin' at: 182. - self installPrimitive: 'primitiveApplyReverb' from: 'SoundPlugin' at: 183. - self installPrimitive: 'primitiveMixLoopedSampledSound' from: 'SoundPlugin' at: 184. - self installPrimitive: 'primitiveMixSampledSound' from: 'SoundPlugin' at: 185. self installPrimitive: 'primitiveSoundInsertSamples' from: 'SoundPlugin' at: 189. self installPrimitive: 'primitiveSoundStopRecording' from: 'SoundPlugin' at: 191. self installPrimitive: 'primitiveSoundGetRecordingSampleRate' from: 'SoundPlugin' at: 192. self installPrimitive: 'primitiveSoundRecordSamples' from: 'SoundPlugin' at: 193. self installPrimitive: 'primitiveSoundSetRecordLevel' from: 'SoundPlugin' at: 194. self installPrimitive: 'primitiveInitializeNetwork' from: 'SocketPlugin' at: 200. self installPrimitive: 'primitiveResolverStartNameLookup' from: 'SocketPlugin' at: 201. self installPrimitive: 'primitiveResolverNameLookupResult' from: 'SocketPlugin' at: 202. self installPrimitive: 'primitiveResolverStartAddressLookup' from: 'SocketPlugin' at: 203. self installPrimitive: 'primitiveResolverAddressLookupResult' from: 'SocketPlugin' at: 204. self installPrimitive: 'primitiveResolverAbortLookup' from: 'SocketPlugin' at: 205. self installPrimitive: 'primitiveResolverLocalAddress' from: 'SocketPlugin' at: 206. self installPrimitive: 'primitiveResolverStatus' from: 'SocketPlugin' at: 207. self installPrimitive: 'primitiveResolverError' from: 'SocketPlugin' at: 208. self installPrimitive: 'primitiveSocketCreate' from: 'SocketPlugin' at: 209. self installPrimitive: 'primitiveSocketDestroy' from: 'SocketPlugin' at: 210. self installPrimitive: 'primitiveSocketConnectionStatus' from: 'SocketPlugin' at: 211. self installPrimitive: 'primitiveSocketError' from: 'SocketPlugin' at: 212. self installPrimitive: 'primitiveSocketLocalAddress' from: 'SocketPlugin' at: 213. self installPrimitive: 'primitiveSocketLocalPort' from: 'SocketPlugin' at: 214. self installPrimitive: 'primitiveSocketRemoteAddress' from: 'SocketPlugin' at: 215. self installPrimitive: 'primitiveSocketRemotePort' from: 'SocketPlugin' at: 216. self installPrimitive: 'primitiveSocketConnectToPort' from: 'SocketPlugin' at: 217. self installPrimitive: 'primitiveSocketListenOnPort' from: 'SocketPlugin' at: 218. self installPrimitive: 'primitiveSocketCloseConnection' from: 'SocketPlugin' at: 219. self installPrimitive: 'primitiveSocketAbortConnection' from: 'SocketPlugin' at: 220. self installPrimitive: 'primitiveSocketReceiveDataBufCount' from: 'SocketPlugin' at: 221. self installPrimitive: 'primitiveSocketReceiveDataAvailable' from: 'SocketPlugin' at: 222. self installPrimitive: 'primitiveSocketSendDataBufCount' from: 'SocketPlugin' at: 223. self installPrimitive: 'primitiveSocketSendDone' from: 'SocketPlugin' at: 224. self installPrimitive: 'primitiveDecompressFromByteArray' from: 'MiscPrimitivePlugin' at: 234. self installPrimitive: 'primitiveCompareString' from: 'MiscPrimitivePlugin' at: 235. self installPrimitive: 'primitiveConvert8BitSigned' from: 'MiscPrimitivePlugin' at: 236. self installPrimitive: 'primitiveCompressToByteArray' from: 'MiscPrimitivePlugin' at: 237. self installPrimitive: 'primitiveSerialPortOpen' from: 'SerialPlugin' at: 238. self installPrimitive: 'primitiveSerialPortClose' from: 'SerialPlugin' at: 239. self installPrimitive: 'primitiveSerialPortWrite' from: 'SerialPlugin' at: 240. self installPrimitive: 'primitiveSerialPortRead' from: 'SerialPlugin' at: 241. self installPrimitive: 'primitiveTranslateStringWithTable' from: 'MiscPrimitivePlugin' at: 243. self installPrimitive: 'primitiveFindFirstInString' from: 'MiscPrimitivePlugin' at: 244. self installPrimitive: 'primitiveIndexOfAsciiInString' from: 'MiscPrimitivePlugin' at: 245. self installPrimitive: 'primitiveFindSubstring' from: 'MiscPrimitivePlugin' at: 246. ] ] ! Item was changed: ----- Method: VMMaker class>>versionString (in category 'version testing') ----- versionString "VMMaker versionString" + ^'4.16.2'! - ^'4.16.1'!

1 0

VM Maker: VMMaker.oscog-eem.2075.mcz
by commits＠source.squeak.org 05 Jan '17

05 Jan '17

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.2075.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.2075 Author: eem Time: 5 January 2017, 2:58:19.533102 pm UUID: d1a62f7b-baf5-4077-b797-fee2139868a3 Ancestors: VMMaker.oscog-eem.2074 SpurPlanningCompactor: Enjoy a moment of clarity and eliminate the continue... nonsense. The enumerators can simply continue with toFinger in lock-step with the current object while pinned objects prevent movement. To help debug the previous state of SPC change checkInterpreterIntegrity to answer 0 if ok, and a set of problem-identifying flags if not. Hence remember to send mapExtraRoots in updatePointers. Select fthe highest suitable free block properly. The CoInterpreter now appears to work. =============== Diff against VMMaker.oscog-eem.2074 =============== Item was changed: ----- Method: Interpreter>>checkInterpreterIntegrity (in category 'object memory support') ----- checkInterpreterIntegrity "Perform an integrity/leak check using the heapMap. Assume clearLeakMapAndMapAccessibleObjects has set a bit at each object's header. Check that all oops in the interpreter's state + points to a header. Answer 0 if all checks pass." + | flags | + flags := 0. - points to a header. Answer if all checks pass." - | ok | - ok := true. (self checkOopIntegrity: specialObjectsOop named: 'specialObjectsOop')ifFalse: + [flags := 1]. - [ok := false]. compilerInitialized ifTrue: [(self checkOopIntegrity: receiver named: 'receiver')ifFalse: + [flags := 2]. - [ok := false]. (self checkOopIntegrity: method named: 'method')ifFalse: + [flags := 4]] - [ok := false]] ifFalse: [(self checkOopIntegrity: activeContext named: 'activeContext') ifFalse: + [flags := 8]]. - [ok := false]]. (self checkOopIntegrity: messageSelector named: 'messageSelector')ifFalse: + [flags := 16]. - [ok := false]. (self checkOopIntegrity: newMethod named: 'newMethod')ifFalse: + [flags := 32]. - [ok := false]. (self checkOopIntegrity: lkupClass named: 'lkupClass')ifFalse: + [flags := 64]. - [ok := false]. (self checkOopIntegrity: receiverClass named: 'receiverClass')ifFalse: + [flags := 128]. - [ok := false]. (self checkOopIntegrity: profileProcess named: 'profileProcess')ifFalse: + [flags := 256]. - [ok := false]. (self checkOopIntegrity: profileMethod named: 'profileMethod')ifFalse: + [flags := 512]. - [ok := false]. (self checkOopIntegrity: profileSemaphore named: 'profileSemaphore')ifFalse: + [flags := 1024]. - [ok := false]. "Callback support - check suspended callback list" 1 to: jmpDepth do: [:i| (self checkOopIntegrity: (suspendedCallbacks at: i) named: 'suspendedCallbacks' index: i) ifFalse: + [flags := 2048]. - [ok := false]. (self checkOopIntegrity: (suspendedMethods at: i) named: 'suspendedMethods' index: i) ifFalse: + [flags := 4096]]. + ^flags! - [ok := false]]. - ^ok! Item was changed: ----- Method: NewObjectMemory>>runLeakCheckerFor: (in category 'debug support') ----- runLeakCheckerFor: gcModes <inline: false> (gcModes anyMask: checkForLeaks) ifTrue: [(gcModes anyMask: GCModeFull) ifTrue: [coInterpreter reverseDisplayFrom: 0 to: 7] ifFalse: [coInterpreter reverseDisplayFrom: 8 to: 15]. self clearLeakMapAndMapAccessibleObjects. self assert: self checkHeapIntegrity. + self assert: coInterpreter checkInterpreterIntegrity = 0. - self assert: coInterpreter checkInterpreterIntegrity. self assert: coInterpreter checkStackIntegrity. self assert: (coInterpreter checkCodeIntegrity: gcModes). self validate "simulation only"]! Item was changed: ----- Method: SpurMemoryManager>>allOldSpaceEntitiesForCompactingFrom:do: (in category 'object enumeration') ----- allOldSpaceEntitiesForCompactingFrom: initialObject do: aBlock <inline: true> | prevObj prevPrevObj objOop nextObj | self assert: (self isOldObject: initialObject). prevPrevObj := prevObj := nil. objOop := initialObject. [self assert: objOop \\ self allocationUnit = 0. self oop: objOop isLessThan: endOfMemory] whileTrue: [self assert: (self long64At: objOop) ~= 0. nextObj := self objectAfter: objOop limit: endOfMemory. + aBlock value: objOop value: nextObj. - aBlock value: objOop. prevPrevObj := prevObj. prevObj := objOop. objOop := nextObj]. self touch: prevPrevObj. self touch: prevObj! Item was changed: ----- Method: SpurMemoryManager>>inLineRunLeakCheckerFor:excludeUnmarkedObjs:classIndicesShouldBeValid: (in category 'debug support') ----- inLineRunLeakCheckerFor: gcModes excludeUnmarkedObjs: excludeUnmarkedObjs classIndicesShouldBeValid: classIndicesShouldBeValid <inline: true> (gcModes anyMask: checkForLeaks) ifTrue: [(gcModes anyMask: GCModeFull) ifTrue: [coInterpreter reverseDisplayFrom: 0 to: 7] ifFalse: [coInterpreter reverseDisplayFrom: 8 to: 15]. self clearLeakMapAndMapAccessibleObjects. self asserta: (self checkHeapIntegrity: excludeUnmarkedObjs classIndicesShouldBeValid: classIndicesShouldBeValid). + self asserta: coInterpreter checkInterpreterIntegrity = 0. - self asserta: coInterpreter checkInterpreterIntegrity. self asserta: coInterpreter checkStackIntegrity. self asserta: (coInterpreter checkCodeIntegrity: gcModes)]! Item was removed: - ----- Method: SpurPlanningCompactor>>continueCopyAndUnmarkMobileObjectsFrom:withTop: (in category 'compaction') ----- - continueCopyAndUnmarkMobileObjectsFrom: anUnpinnedEntity withTop: initialTop - "copyAndUnmarkMobileObjects has encountered a run of pinned objects around which - it cannot compact, but savedFirstFieldsSpace is still not full. Continue the pass with a - new firstFreeObject, resetting it before continuing. - Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed)." - <var: 'initialTop' type: #usqInt> - | result top savedFirstFreeObject savedFirstMobileObject nextFreeObject | - <var: 'top' type: #usqInt> - self assert: (self oop: anUnpinnedEntity isLessThan: manager endOfMemory). - self deny: (manager isPinned: anUnpinnedEntity). - savedFirstMobileObject := firstMobileObject. - nextFreeObject := self scanForFirstFreeAndFirstMobileObjectFrom: anUnpinnedEntity. - top := initialTop. - "Copy and unmark the run of immobile objects to match the enumeration in continuePlanCompactSavingForwardersFrom:toFinger:." - manager allOldSpaceEntitiesFrom: anUnpinnedEntity to: firstMobileObject do: - [:o| - ((self oop: o isLessThan: firstMobileObject) - and: [manager isMarked: o]) ifTrue: - [(manager isPinned: o) - ifTrue: - [(manager isSegmentBridge: o) ifFalse: - [manager setIsMarkedOf: o to: false. - manager segmentManager notePinned: o]] - ifFalse: - [(top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [^false]. - self assert: o = (manager fetchPointer: 0 ofObject: o). - manager - setIsMarkedOf: o to: false; - storePointerUnchecked: 0 ofObject: o withValue: (manager longAt: top)]]]. - firstMobileObject := savedFirstMobileObject. - nextFreeObject ifNil: - [^true]. - savedFirstFreeObject := firstFreeObject. - firstFreeObject := nextFreeObject. - result := self copyAndUnmarkMobileObjectsWithTop: top. - firstFreeObject := savedFirstFreeObject. - ^result! Item was removed: - ----- Method: SpurPlanningCompactor>>continuePlanCompactSavingForwardersFrom:toFinger: (in category 'compaction') ----- - continuePlanCompactSavingForwardersFrom: anUnpinnedEntity toFinger: initialToFinger - "planCompactSavingForwarders has encountered a run of pinned objects around which - it cannot compact, but savedFirstFieldsSpace is still not full. Continue the pass with a - new firstFreeObject, resetting it before continuing. - Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed)." - <var: 'initialToFinger' type: #usqInt> - | result toFinger savedFirstMobileObject savedFirstFreeObject nextFreeObject | - <var: 'toFinger' type: #usqInt> - self assert: (self oop: anUnpinnedEntity isLessThan: manager endOfMemory). - self deny: (manager isPinned: anUnpinnedEntity). - toFinger := initialToFinger. - savedFirstMobileObject := firstMobileObject. - nextFreeObject := self scanForFirstFreeAndFirstMobileObjectFrom: anUnpinnedEntity. - "Forward the run of immobile objects since all unpinned objects between firstMobileObject - and lastMobileObject must be forwarded. Return if savedFirstFieldsSpace fills up." - manager allOldSpaceEntitiesFrom: anUnpinnedEntity to: firstMobileObject do: - [:o| | newTop | - ((self oop: o isLessThan: firstMobileObject) - and: [manager isMarked: o]) ifTrue: - [(manager isPinned: o) - ifTrue: [self assert: (manager addressAfter: o) <= initialToFinger] - ifFalse: - [(newTop := savedFirstFieldsSpace top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [firstMobileObject := savedFirstMobileObject. - ^false]]. - self assert: (manager startOfObject: o) >= toFinger. - toFinger := self forwardMobileObject: o to: toFinger savedFirstFieldPtr: newTop. - savedFirstFieldsSpace top: newTop]]. - firstMobileObject := savedFirstMobileObject. - nextFreeObject ifNil: - [^true]. - self assert: (self oop: nextFreeObject isGreaterThan: lastMobileObject). - manager allOldSpaceEntitiesFrom: (manager objectAfter: lastMobileObject) to: nextFreeObject do: - [:o| - self deny: ((manager isMarked: o) and: [(manager isPinned: o) not])]. - savedFirstFreeObject := firstFreeObject. - firstFreeObject := nextFreeObject. - result := self planCompactSavingForwarders. - firstFreeObject := savedFirstFreeObject. - ^result! Item was removed: - ----- Method: SpurPlanningCompactor>>continueUpdatePointersInMobileObjectsFrom:withTop: (in category 'compaction') ----- - continueUpdatePointersInMobileObjectsFrom: anUnpinnedEntity withTop: initialTop - "updatePointersInMobileObjects has encountered a run of pinned objects around which - planCompactSavingForwarders cannot compact, but savedFirstFieldsSpace is still not full. - Continue the pass with a new firstFreeObject , resetting it before continuing. - Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed)." - <var: 'initialTop' type: #usqInt> - | result top savedFirstFreeObject savedFirstMobileObject nextFreeObject | - <var: 'top' type: #usqInt> - self assert: (self oop: anUnpinnedEntity isLessThan: manager endOfMemory). - self deny: (manager isPinned: anUnpinnedEntity). - savedFirstMobileObject := firstMobileObject. - nextFreeObject := self scanForFirstFreeAndFirstMobileObjectFrom: anUnpinnedEntity. - top := initialTop. - "Update the run of immobile objects to match the enumeration in continuePlanCompactSavingForwardersFrom:toFinger:." - manager allOldSpaceEntitiesFrom: anUnpinnedEntity to: firstMobileObject do: - [:o| - ((self oop: o isLessThan: firstMobileObject) - and: [manager isMarked: o]) ifTrue: - [(manager isPinned: o) - ifTrue: [self updatePointersIn: o] - ifFalse: - [(top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [^false]. - self updatePointersIn: o savedFirstFieldPointer: top]]]. - firstMobileObject := savedFirstMobileObject. - nextFreeObject ifNil: - [^true]. - savedFirstFreeObject := firstFreeObject. - firstFreeObject := nextFreeObject. - result := self updatePointersInMobileObjectsWithTop: top. - firstFreeObject := savedFirstFreeObject. - ^result! Item was changed: ----- Method: SpurPlanningCompactor>>copyAndUnmark: (in category 'compaction') ----- copyAndUnmark: firstPass "Sweep the heap, unmarking all objects and moving mobile objects to their correct positions, restoring their savedFirstFields." | onePass | self logPhase: 'copying and unmarking...'. firstPass ifTrue: [self unmarkInitialImmobileObjects]. "If savedFirstFieldsSpace is empty there is nothing to move, and no second pass." savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [self assert: (self oop: firstMobileObject isGreaterThanOrEqualTo: manager endOfMemory). ^self]. + onePass := self copyAndUnmarkMobileObjects. - onePass := self copyAndUnmarkMobileObjectsWithTop: savedFirstFieldsSpace start - manager bytesPerOop. (onePass not and: [biasForGC]) ifTrue: "only ever one pass if biasForGC is true." [self unmarkObjectsAfterLastMobileObject]! Item was added: + ----- Method: SpurPlanningCompactor>>copyAndUnmarkMobileObjects (in category 'compaction') ----- + copyAndUnmarkMobileObjects + "Sweep the mobile portion of the heap, moving objects to their eventual locations, and clearing their marked bits. + Remember to update the savedFirstFields of pointer objects, as these have been forwarded. + Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). + + This enumeration matches those in planCompactSavingForwarders and updatePointersInMobileObjects." + | toFinger top previousPin | + <var: 'top' type: #usqInt> + <var: 'toFinger' type: #usqInt> + self deny: (manager isMarked: firstFreeObject). + toFinger := manager startOfObject: firstFreeObject. + top := savedFirstFieldsSpace start. + manager allOldSpaceEntitiesForCompactingFrom: firstFreeObject do: + [:o :n| + self check: o. + self assert: (previousPin + ifNil: [toFinger <= (manager startOfObject: o)] + ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). + self assert: (savedFirstFieldsSpaceWasAllocated + or: [savedFirstFieldsSpace limit <= manager firstObject asUnsignedInteger + or: [toFinger < top]]). + (manager isMarked: o) ifTrue: + [(manager isPinned: o) + ifTrue: + [(manager isSegmentBridge: o) ifFalse: + [manager setIsMarkedOf: o to: false. + manager segmentManager notePinned: o]. + previousPin ifNotNil: + [| limit | + limit := manager startOfObject: previousPin. + manager addFreeChunkWithBytes: limit - toFinger at: toFinger. + toFinger := manager addressAfter: previousPin. + self assert: toFinger <= (manager startOfObject: o)]. + previousPin := o] + ifFalse: + [| availableSpace bytes next | + [previousPin notNil + and: [availableSpace := (manager startOfObject: previousPin) - toFinger. + bytes := manager bytesInObject: o. + bytes ~= availableSpace + and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: + ["The object does not fit in the space between toFinger and previousPin. + Move toFinger beyond previousPin and update previousPin appropriately." + availableSpace > 0 ifTrue: + [manager addFreeChunkWithBytes: availableSpace at: toFinger]. + toFinger := manager addressAfter: previousPin. + next := manager objectStartingAt: toFinger. + previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. + toFinger := self copyAndUnmarkObject: o to: toFinger firstField: (manager longAt: top). + (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: + [| done | + self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). + done := self noMobileObjectsAfter: n. + done + ifTrue: [self freeAllUnpinnedObjectsFromObject: (previousPin ifNil: [n]) toFinger: toFinger] + ifFalse: [self freeFrom: toFinger upTo: (manager startOfObject: n) previousPin: previousPin]. + ^done]]]]. + self freeFrom: toFinger upTo: manager endOfMemory previousPin: previousPin. + ^true! Item was removed: - ----- Method: SpurPlanningCompactor>>copyAndUnmarkMobileObjectsWithTop: (in category 'compaction') ----- - copyAndUnmarkMobileObjectsWithTop: initialTop - "Sweep the mobile portion of the heap, moving objects to their eventual locations, and clearing their marked bits. - Remember to update the savedFirstFields of pointer objects, as these have been forwarded. - This enumeration matches those in planCompactSavingForwarders and updatePointersInMobileObjects." - <var: 'initialTop' type: #usqInt> - | toFinger top previousPin | - <var: 'top' type: #usqInt> - <var: 'toFinger' type: #usqInt> - toFinger := manager startOfObject: firstFreeObject. - top := initialTop. - self deny: (manager isMarked: firstFreeObject). - manager allOldSpaceEntitiesForCompactingFrom: firstFreeObject do: - [:o| - self check: o. - self assert: (previousPin isNil or: [(manager isMarked: previousPin) and: [toFinger <= previousPin]]). - self assert: (savedFirstFieldsSpaceWasAllocated - or: [savedFirstFieldsSpace limit <= manager firstObject asUnsignedInteger - or: [toFinger < top]]). - (manager isMarked: o) ifTrue: - [(manager isPinned: o) - ifTrue: - [(manager isSegmentBridge: o) ifFalse: - [manager setIsMarkedOf: o to: false. - manager segmentManager notePinned: o]. - previousPin ifNotNil: - [| limit | - limit := manager startOfObject: previousPin. - manager addFreeChunkWithBytes: limit - toFinger at: toFinger. - toFinger := manager addressAfter: previousPin. - self assert: toFinger <= (manager startOfObject: o)]. - previousPin := o] - ifFalse: - [| availableSpace bytes next | - (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [self freeFrom: toFinger upTo: (manager startOfObject: o) previousPin: previousPin. - ^false]. - [previousPin notNil - and: [availableSpace := (manager startOfObject: previousPin) - toFinger. - bytes := manager bytesInObject: o. - bytes ~= availableSpace - and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: - ["The object does not fit in the space between toFinger and previousPin. - Move toFinger beyond previousPin and update previousPin appropriately." - availableSpace > 0 ifTrue: - [manager addFreeChunkWithBytes: availableSpace at: toFinger]. - toFinger := manager addressAfter: previousPin. - next := manager objectStartingAt: toFinger. - (self oop: next isGreaterThanOrEqualTo: o) ifTrue: - [^self continueCopyAndUnmarkMobileObjectsFrom: o withTop: top - manager bytesPerOop]. - previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. - toFinger := self copyAndUnmarkObject: o to: toFinger firstField: (manager longAt: top)]]]. - self freeFrom: toFinger upTo: manager endOfMemory previousPin: previousPin. - ^true! Item was changed: ----- Method: SpurPlanningCompactor>>findHighestSuitableFreeBlock: (in category 'space management') ----- findHighestSuitableFreeBlock: spaceEstimate + "If a freeBlock of size at least spaceEstimate exists high enough in the heap, choose it. + Ignoring pinned objects for now, the total ammount of shrinkage is expected to be + at least totalFreeOldSpace (because of collected objects). So any free chunk which is + at or above endOfMemory - totalFreeOldSpace should not be corrupted during compaction. + Let's play with this for a while and see how we get on." - "If a freeBlock of size at least spaceEstimate exists high enough in the heap, choose it." <inline: true> manager findLargestFreeChunk ifNotNil: [:largestFreeChunk| + ((manager bytesInObject: largestFreeChunk) >= spaceEstimate + and: [largestFreeChunk asUnsignedInteger > (manager endOfMemory - manager totalFreeOldSpace) asUnsignedInteger]) ifTrue: - (manager bytesInObject: largestFreeChunk) >= spaceEstimate ifTrue: [^largestFreeChunk]]. ^nil! Item was added: + ----- Method: SpurPlanningCompactor>>freeAllUnpinnedObjectsFromObject:toFinger: (in category 'private') ----- + freeAllUnpinnedObjectsFromObject: nextObj toFinger: initialToFinger + "Free all space from toFinger up, preserving only marked pinned objects." + | toFinger nextPinnedObj | + <var: 'toFinger' type: #usqInt> + <var: 'nextPinnedObj' type: #usqInt> + toFinger := initialToFinger. + nextPinnedObj := nextObj. + [[nextPinnedObj >= manager endOfMemory + or: [(manager isMarked: nextPinnedObj) + and: [(manager isPinned: nextPinnedObj)]]] whileFalse: + [nextPinnedObj := manager objectAfter: nextPinnedObj]. + nextPinnedObj < manager endOfMemory] whileTrue: + [toFinger < (manager startOfObject: nextPinnedObj) ifTrue: + [manager addFreeChunkWithBytes: (manager startOfObject: nextPinnedObj) - toFinger at: toFinger]. + toFinger := manager addressAfter: nextPinnedObj. + nextPinnedObj := manager objectAfter: nextPinnedObj]. + toFinger < manager endOfMemory ifTrue: + [manager addFreeChunkWithBytes: manager endOfMemory - toFinger at: toFinger]! Item was added: + ----- Method: SpurPlanningCompactor>>noMobileObjectsAfter: (in category 'private') ----- + noMobileObjectsAfter: mobileObj + self assert: ((manager isMarked: mobileObj) and: [(manager isPinned: mobileObj) not]). + manager allOldSpaceEntitiesFrom: mobileObj do: + [:o| + ((manager isMarked: o) and: [(manager isPinned: o) not]) ifTrue: + [^false]]. + ^true! Item was changed: ----- Method: SpurPlanningCompactor>>planCompactSavingForwarders (in category 'compaction') ----- planCompactSavingForwarders "Sweep the heap from firstFreeObject forwarding marked objects to where they can be moved to, saving their forwarding pointer in savedFirstFieldsSpace. Continue until either the end of the heap is reached or savedFirstFieldsSpace is full. Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). - Note that this method is potentially recursive. If skipping a run of pinned objects - causes the the algorithm to encounter another run of immobile objects it will - recurse via continuePlanCompactSavingForwardersFrom:. - This enumeration matches those in updatePointersInMobileObjects and copyAndUnmarkMobileObjects." | toFinger top previousPin | <var: 'top' type: #usqInt> <var: 'toFinger' type: #usqInt> savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [self logPhase: 'planning...']. - toFinger := manager startOfObject: firstFreeObject. - top := savedFirstFieldsSpace top. self deny: (manager isMarked: firstFreeObject). + toFinger := manager startOfObject: firstFreeObject. + top := savedFirstFieldsSpace start. manager allOldSpaceEntitiesFrom: firstFreeObject do: [:o| self check: o. + self assert: (previousPin + ifNil: [toFinger <= (manager startOfObject: o)] + ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). - self assert: (previousPin isNil or: [(manager isMarked: previousPin) and: [toFinger <= previousPin]]). self assert: (savedFirstFieldsSpaceWasAllocated or: [savedFirstFieldsSpace limit <= manager firstObject asUnsignedInteger or: [toFinger < top]]). (manager isMarked: o) ifTrue: [(manager isPinned: o) ifTrue: "The empty gaps between two adjacent pinned objects (when not filled below) are freed." [previousPin ifNotNil: [self assert: (manager startOfObject: previousPin) - toFinger >= (manager allocationUnit * 2). toFinger := manager addressAfter: previousPin. self assert: toFinger <= (manager startOfObject: o)]. previousPin := o] ifFalse: [| availableSpace bytes next | - (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [savedFirstFieldsSpace top: top - manager bytesPerOop. - ^false]. [previousPin notNil and: [availableSpace := (manager startOfObject: previousPin) - toFinger. bytes := manager bytesInObject: o. bytes ~= availableSpace and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: ["The object does not fit in the space between toFinger and previousPin. Move toFinger beyond previousPin and update previousPin appropriately." toFinger := manager addressAfter: previousPin. next := manager objectStartingAt: toFinger. - (self oop: next isGreaterThanOrEqualTo: o) ifTrue: - [savedFirstFieldsSpace top: top - manager bytesPerOop. - ^self continuePlanCompactSavingForwardersFrom: o toFinger: toFinger]. previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. + toFinger := self forwardMobileObject: o to: toFinger savedFirstFieldPtr: top. + (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: + [savedFirstFieldsSpace top: top - manager bytesPerOop. + ^self noMobileObjectsAfter: o]]]]. + savedFirstFieldsSpace top: top - manager bytesPerOop. - toFinger := self forwardMobileObject: o to: toFinger savedFirstFieldPtr: top]]]. - savedFirstFieldsSpace top: top. ^true! Item was changed: ----- Method: SpurPlanningCompactor>>selectSavedFirstFieldsSpace (in category 'space management') ----- selectSavedFirstFieldsSpace "To compact the heap the algorithm must save the first field (used for the forwarding pointer) of all moved objects. This is done in savedFirstFieldsSpace, a contiguous block of memory borrowed for the duration of compaction. In a 32-bit system a typical upper bound on the space needed is about 1/40 of the heap size. The default new space size of 4Mb provides an eden of about 3.6 Mb, which would serve the needs of a 144 Mb heap. The default segment increment of 16 Mb would serve the needs of a 640 Mb heap. Make an estimate of the size needed, and either use eden, a large free chunk, or a newly-allocated segment, falling back on eden if the alternatives can't be had." <inline: true> | spaceEstimate sizeOfEden | spaceEstimate := manager endOfMemory - manager firstObject // 40. sizeOfEden := scavenger eden limit - scavenger eden start. spaceEstimate > sizeOfEden ifTrue: [(self findHighestSuitableFreeBlock: spaceEstimate) ifNotNil: [:highestSuitableFreeBlock| (spaceEstimate > (manager sizeOfFree: highestSuitableFreeBlock) and: [self useSegmentForSavedFirstFieldsSpace: spaceEstimate]) ifTrue: [^self]. (manager sizeOfFree: highestSuitableFreeBlock) > sizeOfEden ifTrue: [self useFreeChunkForSavedFirstFieldsSpace: highestSuitableFreeBlock. + ^self]]. + (self useSegmentForSavedFirstFieldsSpace: spaceEstimate) ifTrue: + [^self]]. - ^self]]]. self useEdenForSavedFirstFieldsSpace! Item was changed: ----- Method: SpurPlanningCompactor>>updatePointers (in category 'compaction') ----- updatePointers "Sweep the heap, updating all objects to their eventual locations. Remember to update the savedFirstFields of pointer objects, as these have been forwarded." | onePass | self logPhase: 'updating pointers...'. "If savedFirstFieldsSpace is empty there is nothing to do." savedFirstFieldsSpace top < savedFirstFieldsSpace start ifTrue: [^self]. self assert: (manager startOfObject: firstFreeObject) = mobileStart. coInterpreter mapInterpreterOops. + manager mapExtraRoots. self updatePointersInManagerHeapEntities. self updatePointersInSurvivingObjects. self updatePointersInInitialImmobileObjects. + onePass := self updatePointersInMobileObjects. - onePass := self updatePointersInMobileObjectsWithTop: savedFirstFieldsSpace start - manager bytesPerOop. onePass ifFalse: [self updatePointersInObjectsOverflowingSavedFirstFieldsSpace]! Item was added: + ----- Method: SpurPlanningCompactor>>updatePointersInMobileObjects (in category 'compaction') ----- + updatePointersInMobileObjects + "Sweep the mobile portion of the heap, updating all references to objects to their eventual locations. + Remember to update the savedFirstFields of pointer objects, as these have been forwarded. + Answer if the end of the heap was reached (savedFirstFieldsSpace has not overflowed). + + This enumeration matches that in planCompactSavingForwarders and copyAndUnmarkMobileObjects." + | toFinger top previousPin | + <var: 'top' type: #usqInt> + <var: 'toFinger' type: #usqInt> + self deny: (manager isMarked: firstFreeObject). + toFinger := manager startOfObject: firstFreeObject. + top := savedFirstFieldsSpace start. + manager allOldSpaceEntitiesFrom: firstFreeObject do: + [:o| + self check: o. + self assert: (previousPin + ifNil: [toFinger <= (manager startOfObject: o)] + ifNotNil: [(manager isMarked: previousPin) and: [toFinger <= (manager startOfObject: previousPin)]]). + (manager isMarked: o) ifTrue: + [(manager isPinned: o) + ifTrue: "The empty gaps between two adjacent pinned objects (when not filled below) are freed." + [self updatePointersIn: o. + previousPin ifNotNil: + [toFinger := manager addressAfter: previousPin]. + previousPin := o] + ifFalse: + [| availableSpace bytes next | + [previousPin notNil + and: [availableSpace := (manager startOfObject: previousPin) - toFinger. + bytes := manager bytesInObject: o. + bytes ~= availableSpace + and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: + ["The object does not fit in the space between toFinger and previousPin. + Move toFinger beyond previousPin and update previousPin appropriately." + toFinger := manager addressAfter: previousPin. + next := manager objectStartingAt: toFinger. + previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. + self updatePointersIn: o savedFirstFieldPointer: top. + toFinger := toFinger + (manager bytesInObject: o). + (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: + [self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). + ^self noMobileObjectsAfter: o]]]]. + self assert: savedFirstFieldsSpace top = (top - manager bytesPerOop). + ^true! Item was removed: - ----- Method: SpurPlanningCompactor>>updatePointersInMobileObjectsWithTop: (in category 'compaction') ----- - updatePointersInMobileObjectsWithTop: initialTop - "Sweep the mobile portion of the heap, updating all references to objects to their eventual locations. - Remember to update the savedFirstFields of pointer objects, as these have been forwarded. - This enumeration matches that in planCompactSavingForwarders and copyAndUnmarkMobileObjects." - <var: 'initialTop' type: #usqInt> - | toFinger top previousPin | - <var: 'top' type: #usqInt> - <var: 'toFinger' type: #usqInt> - toFinger := manager startOfObject: firstFreeObject. - top := initialTop. - self deny: (manager isMarked: firstFreeObject). - manager allOldSpaceEntitiesFrom: firstFreeObject do: - [:o| - self check: o. - self assert: (previousPin isNil or: [(manager isMarked: previousPin) and: [toFinger <= previousPin]]). - (manager isMarked: o) ifTrue: - [(manager isPinned: o) - ifTrue: "The empty gaps between two adjacent pinned objects (when not filled below) are freed." - [self updatePointersIn: o. - previousPin ifNotNil: - [toFinger := manager addressAfter: previousPin]. - previousPin := o] - ifFalse: - [| availableSpace bytes next | - (top := top + manager bytesPerOop) >= savedFirstFieldsSpace limit ifTrue: - [^false]. - [previousPin notNil - and: [availableSpace := (manager startOfObject: previousPin) - toFinger. - bytes := manager bytesInObject: o. - bytes ~= availableSpace - and: [bytes + (2 * manager allocationUnit) < availableSpace]]] whileTrue: - ["The object does not fit in the space between toFinger and previousPin. - Move toFinger beyond previousPin and update previousPin appropriately." - toFinger := manager addressAfter: previousPin. - next := manager objectStartingAt: toFinger. - (self oop: next isGreaterThanOrEqualTo: o) ifTrue: - [^self continueUpdatePointersInMobileObjectsFrom: o withTop: top - manager bytesPerOop]. - previousPin := ((manager isMarked: next) and: [manager isPinned: next]) ifTrue: [next]]. - self updatePointersIn: o savedFirstFieldPointer: top. - toFinger := toFinger + (manager bytesInObject: o)]]]. - ^true! Item was changed: ----- Method: StackInterpreter>>checkInterpreterIntegrity (in category 'object memory support') ----- checkInterpreterIntegrity "Perform an integrity/leak check using the heapMap. Assume clearLeakMapAndMapAccessibleObjects has set a bit at each object's header. Check that all oops in the interpreter's state + points to a header. Answer 0 if all checks pass." + | flags | + flags := 0. - points to a header. Answer if all checks pass." - | ok | - ok := true. (objectMemory checkOopIntegrity: objectMemory specialObjectsOop named: 'specialObjectsOop')ifFalse: + [flags := 1]. - [ok := false]. "No longer check messageSelector; it is ephemeral, not living beyond message lookup. (objectMemory isNonImmediate: messageSelector) ifTrue: [(objectMemory checkOopIntegrity: messageSelector named: 'messageSelector')ifFalse: [ok := false]]." (objectMemory checkOopIntegrity: newMethod named: 'newMethod')ifFalse: + [flags := flags + 2]. - [ok := false]. "No longer check lkupClass; it is ephemeral, not living beyond message lookup. (objectMemory checkOopIntegrity: lkupClass named: 'lkupClass')ifFalse: [ok := false]." (objectMemory checkOopIntegrity: profileProcess named: 'profileProcess')ifFalse: + [flags := flags + 4]. - [ok := false]. (objectMemory checkOopIntegrity: profileMethod named: 'profileMethod')ifFalse: + [flags := flags + 8]. - [ok := false]. (objectMemory checkOopIntegrity: profileSemaphore named: 'profileSemaphore')ifFalse: + [flags := flags + 16]. - [ok := false]. tempOop = 0 ifFalse: [(objectMemory checkOopIntegrity: tempOop named: 'tempOop')ifFalse: + [flags := flags + 32]]. - [ok := false]]. tempOop2 = 0 ifFalse: [(objectMemory checkOopIntegrity: tempOop2 named: 'tempOop2')ifFalse: + [flags := flags + 64]]. - [ok := false]]. tempOop3 = 0 ifFalse: [(objectMemory checkOopIntegrity: tempOop3 named: 'tempOop3')ifFalse: + [flags := flags + 128]]. - [ok := false]]. "Callback support - check suspended callback list" 1 to: jmpDepth do: [:i| (objectMemory checkOopIntegrity: (suspendedCallbacks at: i) named: 'suspendedCallbacks' index: i) ifFalse: + [flags := flags + 256]. - [ok := false]. (objectMemory checkOopIntegrity: (suspendedMethods at: i) named: 'suspendedMethods' index: i) ifFalse: + [flags := flags + 512]]. - [ok := false]]. self checkLogIntegrity ifFalse: + [flags := flags + 1024]. - [ok := false]. + ^flags! - ^ok!

1 0

VM Maker: VMMaker.oscog-eem.2074.mcz
by commits＠source.squeak.org 05 Jan '17

05 Jan '17

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.2074.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.2074 Author: eem Time: 5 January 2017, 1:04:01.289587 pm UUID: 37096fe1-c17e-4eb5-af1a-2263ca85ca64 Ancestors: VMMaker.oscog-nice.2073 Fix the NumTrampolines issue, albeit in an ugly way. Revert some timestamps of unchanged methods. =============== Diff against VMMaker.oscog-nice.2073 =============== Item was changed: ----- Method: CCodeGenerator>>emitCConstants:on: (in category 'C code generator') ----- emitCConstants: constList on: aStream "Store the global variable declarations on the given stream." constList isEmpty ifTrue: [^self]. aStream cr; nextPutAll: '/*** Constants ***/'; cr. (self sortStrings: constList) do: [:varName| | node default value conditional | node := constants at: varName. node name isEmpty ifFalse: + ["If the definition includes a C comment, or looks like a conditional, take it as is, otherwise convert + the value from Smalltalk to C. - ["If the definition includes a C comment, take it as is, otherwise convert the value from Smalltalk to C. Allow the class to provide an alternative definition, either of just the value or the whole shebang." + default := (node value isString + and: [(node value includesSubString: '/*') + or: [(node value includesSubString: ' ? ') and: [node value includesSubString: ' : ']]]) - default := (node value isString and: [node value includesSubString: '/*']) ifTrue: [node value] ifFalse: [self cLiteralFor: node value name: varName]. default = #undefined ifTrue: [aStream nextPutAll: '#undef '; nextPutAll: node name; cr] ifFalse: [conditional := (vmClass ifNil: VMBasicConstants) defineAtCompileTime: node name. conditional ifTrue: [aStream nextPutAll: '#if !!defined('; nextPutAll: node name; nextPutAll: ') /* Allow this to be overridden on the compiler command line */'; cr]. value := vmClass ifNotNil: [(vmClass specialValueForConstant: node name default: default) ifNotNil: [:specialDef| specialDef] ifNil: [default]] ifNil: [default]. value first ~= $# ifTrue: [aStream nextPutAll: (conditional ifTrue: ['# define '] ifFalse: ['#define ']); nextPutAll: node name; space]. aStream nextPutAll: value; cr. conditional ifTrue: [aStream nextPutAll: '#endif'; cr]]]]. aStream cr! Item was changed: ----- Method: CogObjectRepresentationForSpur class>>declareCVarsIn: (in category 'translation') ----- declareCVarsIn: aCodeGen + "Deal wuth the fact that the number of trampolines depends on IMMUTABILITY + and that IMMUTABILITY can be defined at compile time. Yes, this is a mess." + | current values | + self assert: (CogObjectRepresentationForSpur allSubclasses allSatisfy: + [:sc| + CogObjectRepresentationForSpur initializationOptions == sc initializationOptions]). + current := initializationOptions at: #IMMUTABILITY ifAbsent: nil. + values := #(true false) collect: + [:bool| + initializationOptions at: #IMMUTABILITY put: bool. + self cogitClass initializeNumTrampolines. + (Cogit classPool at: #NumTrampolines) printString]. + current + ifNil: [initializationOptions removeKey: #IMMUTABILITY] + ifNotNil: [initializationOptions at: #IMMUTABILITY put: current]. + values first ~= values last ifTrue: + [aCodeGen addConstantForBinding: #NumTrampolines -> ('(IMMUTABILITY ? ' , values first , ' : ' , values last , ')')]. aCodeGen var: #ceStoreTrampolines declareC: ('#if IMMUTABILITY\sqInt ceStoreTrampolines[', NumStoreTrampolines printString, '];\#endif') withCRs! Item was changed: ----- Method: CogObjectRepresentationForSpur class>>numTrampolines (in category 'accessing') ----- numTrampolines ^super numTrampolines + (SistaV1BytecodeSet ifTrue: [8] "(small,large)x(method,block,fullBlock) context creation, ceStoreCheckContextReceiverTrampoline and ceScheduleScavengeTrampoline" ifFalse: [6] "(small,large)x(method,block) context creation, ceStoreCheckContextReceiverTrampoline and ceScheduleScavengeTrampoline") + + ((initializationOptions at: #IMMUTABILITY ifAbsent: [false]) - + NumStoreTrampolines "FIXME: the generated C code does not take into account whether IMMUTABILITY is defined to one or zero" - "((initializationOptions at: #IMMUTABILITY ifAbsent: [false]) ifTrue: [NumStoreTrampolines] + ifFalse: [0])! - ifFalse: [0])"! Item was changed: ----- Method: CogObjectRepresentationForSpur>>generateObjectRepresentationTrampolines (in category 'initialization') ----- generateObjectRepresentationTrampolines "Do the store check. Answer the argument for the benefit of the code generator; ReceiverResultReg may be caller-saved and hence smashed by this call. Answering it allows the code generator to reload ReceiverResultReg cheaply. In Spur the only thing we leave to the run-time is adding the receiver to the remembered set and setting its isRemembered bit." self cppIf: IMMUTABILITY ifTrue: [self cCode: [] inSmalltalk: [ceStoreTrampolines := CArrayAccessor on: (Array new: NumStoreTrampolines)]. 0 to: NumStoreTrampolines - 1 do: [:instVarIndex | ceStoreTrampolines at: instVarIndex put: (self genStoreTrampolineCalled: (cogit trampolineName: 'ceStoreTrampoline' numArgs: instVarIndex limit: NumStoreTrampolines - 2) instVarIndex: instVarIndex)]]. ceStoreCheckTrampoline := self genStoreCheckTrampoline. ceStoreCheckContextReceiverTrampoline := self genStoreCheckContextReceiverTrampoline. ceScheduleScavengeTrampoline := cogit genTrampolineFor: #ceScheduleScavenge called: 'ceScheduleScavengeTrampoline' regsToSave: CallerSavedRegisterMask. ceSmallActiveContextInMethodTrampoline := self genActiveContextTrampolineLarge: false inBlock: 0 called: 'ceSmallMethodContext'. ceSmallActiveContextInBlockTrampoline := self genActiveContextTrampolineLarge: false inBlock: InVanillaBlock called: 'ceSmallBlockContext'. SistaV1BytecodeSet ifTrue: [ceSmallActiveContextInFullBlockTrampoline := self genActiveContextTrampolineLarge: false inBlock: InFullBlock called: 'ceSmallFullBlockContext']. ceLargeActiveContextInMethodTrampoline := self genActiveContextTrampolineLarge: true inBlock: 0 called: 'ceLargeMethodContext'. ceLargeActiveContextInBlockTrampoline := self genActiveContextTrampolineLarge: true inBlock: InVanillaBlock called: 'ceLargeBlockContext'. SistaV1BytecodeSet ifTrue: [ceLargeActiveContextInFullBlockTrampoline := self genActiveContextTrampolineLarge: true inBlock: InFullBlock called: 'ceLargeFullBlockContext']. LowcodeVM ifTrue: [ self generateLowcodeObjectTrampolines ]! Item was changed: ----- Method: Cogit>>generateRunTimeTrampolines (in category 'initialization') ----- generateRunTimeTrampolines "Generate the run-time entries at the base of the native code zone and update the base." ceSendMustBeBooleanAddFalseTrampoline := self genMustBeBooleanTrampolineFor: objectMemory falseObject called: 'ceSendMustBeBooleanAddFalseTrampoline'. ceSendMustBeBooleanAddTrueTrampoline := self genMustBeBooleanTrampolineFor: objectMemory trueObject called: 'ceSendMustBeBooleanAddTrueTrampoline'. ceNonLocalReturnTrampoline := self genNonLocalReturnTrampoline. ceCheckForInterruptTrampoline := self genCheckForInterruptsTrampoline. "Neither of the context inst var access trampolines save registers. Their operation could cause arbitrary update of stack frames, so the assumption is that callers flush the stack before calling the context inst var access trampolines, and that everything except the result is dead afterwards." ceFetchContextInstVarTrampoline := self genTrampolineFor: #ceContext:instVar: called: 'ceFetchContextInstVarTrampoline' arg: ReceiverResultReg arg: SendNumArgsReg result: SendNumArgsReg. ceStoreContextInstVarTrampoline := self genTrampolineFor: #ceContext:instVar:value: called: 'ceStoreContextInstVarTrampoline' arg: ReceiverResultReg arg: SendNumArgsReg arg: ClassReg result: ReceiverResultReg. "to keep ReceiverResultReg live.". ceCannotResumeTrampoline := self genTrampolineFor: #ceCannotResume called: 'ceCannotResumeTrampoline'. "These two are unusual; they are reached by return instructions." ceBaseFrameReturnTrampoline := self genReturnTrampolineFor: #ceBaseFrameReturn: called: 'ceBaseFrameReturnTrampoline' arg: ReceiverResultReg. ceReturnToInterpreterTrampoline := self genReturnTrampolineFor: #ceReturnToInterpreter: called: 'ceReturnToInterpreterTrampoline' arg: ReceiverResultReg. ceMallocTrampoline := self genTrampolineFor: #ceMalloc: called: 'ceMallocTrampoline' arg: ReceiverResultReg result: TempReg. ceFreeTrampoline := self genTrampolineFor: #ceFree: called: 'ceFreeTrampoline' arg: ReceiverResultReg. LowcodeVM ifTrue: [ ceFFICalloutTrampoline := self genFFICalloutTrampoline. ]! Item was changed: ----- Method: VMMaker class>>generateSqueakSpurLowcodeCogVM (in category 'configurations') ----- generateSqueakSpurLowcodeCogVM "No primitives since we can use those for the Cog VM" ^VMMaker generate: CoInterpreter and: StackToRegisterMappingCogit with: #(ObjectMemory Spur32BitCoMemoryManager SistaVM true LowcodeVM true MULTIPLEBYTECODESETS true bytecodeTableInitializer initializeBytecodeTableForSqueakV3PlusClosuresSistaV1Hybrid) to: (FileDirectory default pathFromURI: self sourceTree, '/spurlowcodesrc') platformDir: (FileDirectory default pathFromURI: self sourceTree, '/platforms') including:#()!

1 0

[OpenSmalltalk/opensmalltalk-vm] 4b8a95: Undo some spurious s/int/long/ in comments
by GitHub 05 Jan '17

05 Jan '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: 4b8a95589cf70f36b0d820cf517cc4d90910efba https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/4b8a95589cf70f36b0… Author: Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> Date: 2017-01-05 (Thu, 05 Jan 2017) Changed paths: M platforms/Cross/plugins/BochsIA32Plugin/BochsIA32Plugin.h Log Message: ----------- Undo some spurious s/int/long/ in comments It's only cosmetic, but it was unnecessary noise when I wanted to compare Bochs32 vs Bochs64 to try and understand how to make the plugin simulate X64Win64 ABI

1 0

VM Maker: VMMaker.oscog-nice.2073.mcz
by commits＠source.squeak.org 05 Jan '17

05 Jan '17

Nicolas Cellier uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-nice.2073.mcz ==================== Summary ==================== Name: VMMaker.oscog-nice.2073 Author: nice Time: 5 January 2017, 8:59:38.809001 pm UUID: ea25b651-c0f2-46a4-aae0-8acd00e7c6c2 Ancestors: VMMaker.oscog-rsf.2072 Fix access to 64 bits int from 32 bit VM in primitiveFFIIntegerAtPut =============== Diff against VMMaker.oscog-rsf.2072 =============== Item was changed: ----- Method: ThreadedFFIPlugin>>primitiveFFIIntegerAtPut (in category 'primitives') ----- primitiveFFIIntegerAtPut "Store a (signed or unsigned) n byte integer at the given byte offset in the receiver, using the platform's endianness." | isSigned byteSize byteOffset rcvr addr value max valueOop | <var: 'value' type: #sqLong> <var: 'max' type: #sqLong> <export: true> <inline: false> isSigned := interpreterProxy booleanValueOf: (interpreterProxy stackValue: 0). byteSize := interpreterProxy stackIntegerValue: 1. valueOop := interpreterProxy stackValue: 2. byteOffset := interpreterProxy stackIntegerValue: 3. rcvr := interpreterProxy stackObjectValue: 4. interpreterProxy failed ifTrue:[^0]. (byteOffset > 0 and: [(byteSize between: 1 and: 8) and: [(byteSize bitAnd: byteSize - 1) = 0 "a.k.a. isPowerOfTwo"]]) ifFalse: [^interpreterProxy primitiveFail]. addr := self ffiAddressOf: rcvr startingAt: byteOffset size: byteSize. interpreterProxy failed ifTrue:[^0]. isSigned + ifTrue:[value := interpreterProxy signed64BitValueOf: valueOop] + ifFalse:[value := interpreterProxy positive64BitValueOf: valueOop]. - ifTrue:[value := interpreterProxy signedMachineIntegerValueOf: valueOop] - ifFalse:[value := interpreterProxy positiveMachineIntegerValueOf: valueOop]. interpreterProxy failed ifTrue:[^0]. + byteSize < 8 ifTrue: - byteSize < BytesPerWord ifTrue: [isSigned ifTrue: [max := 1 asUnsignedLongLong << (8 * byteSize - 1). (value >= (0 - max) and: [value < max]) ifFalse: [^interpreterProxy primitiveFail]] ifFalse: [value asUnsignedLongLong < (1 asUnsignedLongLong << (8 * byteSize)) ifFalse: [^interpreterProxy primitiveFail]]]. byteSize <= 2 ifTrue: [byteSize = 1 ifTrue: [interpreterProxy byteAt: addr put: value] ifFalse: [interpreterProxy shortAt: addr put: value]] ifFalse: [byteSize = 4 ifTrue: [interpreterProxy long32At: addr put: value] ifFalse: [interpreterProxy long64At: addr put: value]]. ^interpreterProxy pop: 5 thenPush: valueOop!

1 0

changes in FFI-Kernel-eem.43 break 32bits version (at least for me)
by Esteban Lorenzano 05 Jan '17

05 Jan '17

Hi, I found that this change: unsignedLongLongAt: byteOffset "Answer a 64-bit integer in Smalltalk order (little-endian)." ^self integerAt: byteOffset size: 8 signed: false unsignedLongLongAt: byteOffset put: value "I store 64-bit integers in Smalltalk (little-endian) order." ^self integerAt: byteOffset put: value size: 8 signed: false … which makes sense at fist sight does not work at least for me. In 32bits scenario, this test will fail: { -9223372036854775808. -9223372036854775807. -2147483649. -2147483648. -2147483647. -32769. -32768. -32767. -129. -128. -127. 0. 126. 127. 128. 254. 255. 256. 32766. 32767. 32768. 65534. 65535. 65536. 2147483646. 2147483647. 2147483648. 9223372036854775806. 9223372036854775807 } do: [ :int | |ref| ref := ByteArray new: 8. ref signedLongLongAt: 1 put: int. self assert: (ref signedLongLongAt: 1) = int ] can you confirm it? cheers, Esteban

2 1

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 January 2017