Vm-dev October 2017

vm-dev@lists.squeakfoundation.org

29 participants
47 discussions

VM Maker: VMMaker.oscog-EstebanLorenzano.2272.mcz
by commits＠source.squeak.org 16 Oct '17

16 Oct '17

Esteban Lorenzano uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-EstebanLorenzano.2272.mcz ==================== Summary ==================== Name: VMMaker.oscog-EstebanLorenzano.2272 Author: EstebanLorenzano Time: 16 October 2017, 2:22:59.159369 pm UUID: e6b48d9d-a952-4f48-bec6-f5e9f9e92342 Ancestors: VMMaker.oscog-cb.2271 fix bug while passing parameter structures on FFI callouts: it skipping passing structures with size>16 =============== Diff against VMMaker.oscog-cb.2271 =============== Item was removed: - ----- Method: SistaCogitClone class>>methodZoneClass (in category 'accessing class hierarchy') ----- - methodZoneClass - ^SistaMethodZone! Item was removed: - ----- Method: SistaCogitClone>>defaultCogCodeSize (in category 'accessing') ----- - defaultCogCodeSize - "Return the default number of bytes to allocate for native code at startup. - The actual value can be set via vmParameterAt: and/or a preference in the ini file." - <api> - ^2 * backEnd getDefaultCogCodeSize! Item was removed: - ----- Method: SistaCogitClone>>genAtPutInlinePrimitive: (in category 'inline primitive generators') ----- - genAtPutInlinePrimitive: 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>>#trinaryInlinePrimitive:" - | ra1 ra2 rr adjust needsStoreCheck | - "The store check requires rr to be ReceiverResultReg" - needsStoreCheck := (objectRepresentation isUnannotatableConstant: self ssTop) not. - self - allocateRegForStackTopThreeEntriesInto: [:rTop :rNext :rThird | ra2 := rTop. ra1 := rNext. rr := rThird ] - thirdIsReceiver: (prim = 0 and: [ needsStoreCheck ]). - self assert: (rr ~= ra1 and: [rr ~= ra2 and: [ra1 ~= ra2]]). - self ssTop popToReg: ra2. - self ssPop: 1. - self ssTop popToReg: ra1. - self ssPop: 1. - self ssTop popToReg: rr. - self ssPop: 1. - objectRepresentation genConvertSmallIntegerToIntegerInReg: ra1. - "Now: ra is the variable object, rr is long, TempReg holds the value to store." - self flag: #TODO. "This is not really working as the immutability and store check needs to be present. " - prim caseOf: { - "0 - 1 pointerAt:put: and byteAt:Put:" - [0] -> [ adjust := (objectMemory baseHeaderSize >> objectMemory shiftForWord) - 1. "shift by baseHeaderSize and then move from 1 relative to zero relative" - adjust ~= 0 ifTrue: [ self AddCq: adjust R: ra1. ]. - self MoveR: ra2 Xwr: ra1 R: rr. - "I added needsStoreCheck so if you initialize an array with a Smi such as 0 or a boolean you don't need the store check" - needsStoreCheck ifTrue: - [ self assert: needsFrame. - objectRepresentation genStoreCheckReceiverReg: rr valueReg: ra2 scratchReg: TempReg inFrame: true] ]. - [1] -> [ objectRepresentation genConvertSmallIntegerToIntegerInReg: ra2. - adjust := objectMemory baseHeaderSize - 1. "shift by baseHeaderSize and then move from 1 relative to zero relative" - self AddCq: adjust R: ra1. - self MoveR: ra2 Xbr: ra1 R: rr. - objectRepresentation genConvertIntegerToSmallIntegerInReg: ra2. ]. - } - otherwise: [^EncounteredUnknownBytecode]. - self ssPushRegister: ra2. - ^0! Item was removed: - ----- Method: SistaCogitClone>>genByteEqualsInlinePrimitive: (in category 'inline primitive generators') ----- - genByteEqualsInlinePrimitive: prim - - "3021 Byte Object >> equals:length: - The receiver and the arguments are both byte objects and have both the same size (length in bytes). - The length argument is a smallinteger. - Answers true if all fields are equal, false if not. - Comparison is bulked to word comparison." - - "Overview: - 1. The primitive is called like that: [byteObj1 equals: byteObj2 length: length]. - In the worst case we use 5 registers including TempReg - and we produce a loop bulk comparing words. - 2. The common case is a comparison against a cst: [byteString = 'foo']. - which produces in Scorch [byteString equals: 'foo' length: 3]. - We try to generate fast code for this case with 3 heuristics: - - specific fast code if len is a constant - - unroll the loop if len < 2 * wordSize - - compile-time reads if str1 or str2 is a constant and loop is unrolled. - We use 3 registers including TempReg in the common case. - We could use 1 less reg if the loop is unrolled, the instr is followed by a branch - AND one operand is a constant, but this is complicated enough. - 3. We ignore the case where all operands are constants - (We assume Scorch simplifies it, it works but it is not optimised)" - - | str1Reg str2Reg lenReg extraReg jmp jmp2 needjmpZeroSize needLoop unroll jmpZeroSize instr lenCst mask | - <var: #jmp type: #'AbstractInstruction *'> - <var: #instr type: #'AbstractInstruction *'> - <var: #jmp2 type: #'AbstractInstruction *'> - <var: #jmpZeroSize type: #'AbstractInstruction *'> - - "--- quick path for empty string---" - "This path does not allocate registers and right shift on negative int later in the code. - Normally this is resolved by Scorch but we keep it for correctness and consistency" - self ssTop type = SSConstant ifTrue: - [ lenCst := objectMemory integerValueOf: self ssTop constant. - lenCst = 0 ifTrue: [ self ssPop: 3. self ssPushConstant: objectMemory trueObject. ^ 0 ] ]. - - "--- Allocating & loading registers --- " - needLoop := (self ssTop type = SSConstant and: [ lenCst <= (objectMemory wordSize * 2) ]) not. - unroll := needLoop not and: [lenCst > objectMemory wordSize ]. - needLoop - ifTrue: - [ str1Reg := self allocateRegForStackEntryAt: 1 notConflictingWith: self emptyRegisterMask. - str2Reg := self allocateRegForStackEntryAt: 2 notConflictingWith: (self registerMaskFor: str1Reg). - lenReg := self allocateRegForStackEntryAt: 0 notConflictingWith: (self registerMaskFor:str1Reg and: str2Reg). - (self ssValue: 1) popToReg: str1Reg. - (self ssValue: 2) popToReg: str2Reg. - extraReg := self allocateRegNotConflictingWith: (self registerMaskFor: str1Reg and: str2Reg and: lenReg)] - ifFalse: - [ mask := self emptyRegisterMask. - (self ssValue: 1) type = SSConstant ifFalse: - [ str1Reg := self allocateRegForStackEntryAt: 1 notConflictingWith: mask. - (self ssValue: 1) popToReg: str1Reg. - mask := mask bitOr: (self registerMaskFor: str1Reg) ]. - (self ssValue: 2) type = SSConstant ifFalse: - [ str2Reg := self allocateRegForStackEntryAt: 2 notConflictingWith: mask. - (self ssValue: 2) popToReg: str2Reg. - mask := mask bitOr: (self registerMaskFor: str2Reg) ]. - extraReg := self allocateRegNotConflictingWith: mask]. - - "--- Loading LenReg (or statically resolving it) --- " - "LenReg is loaded with (lenInBytes + objectMemory baseHeaderSize - 1 >> shiftForWord) - LenReg is the index for the last word to compare with MoveXwr:r:R:. - The loop iterates from LenReg to first word of ByteObj" - self ssTop type = SSConstant - ifTrue: "common case, str = 'foo'. We can precompute lenReg." - [ lenCst := lenCst + objectMemory baseHeaderSize - 1 >> objectMemory shiftForWord. - needLoop ifTrue: [self MoveCq: lenCst R: lenReg ]. - needjmpZeroSize := false] - ifFalse: "uncommon case, str = str2. lenReg in word computed at runtime." - [ self ssTop popToReg: lenReg. - objectRepresentation genConvertSmallIntegerToIntegerInReg: lenReg. - self CmpCq: 0 R: lenReg. - jmpZeroSize := self JumpZero: 0. - needjmpZeroSize := true. - self AddCq: objectMemory baseHeaderSize - 1 R: lenReg. - self ArithmeticShiftRightCq: objectMemory shiftForWord R: lenReg ]. - - "--- Comparing the strings --- " - "LenReg has the index of the last word to read (unless no loop). - We decrement it to adjust -1 (0 in 64 bits) while comparing" - needLoop - ifTrue: - [instr := self MoveXwr: lenReg R: str1Reg R: extraReg. - self MoveXwr: lenReg R: str2Reg R: TempReg. - self CmpR: extraReg R: TempReg. - jmp := self JumpNonZero: 0. "then string are not equal (jmp target)" - self AddCq: -1 R: lenReg. - self CmpCq: (objectMemory baseHeaderSize >> objectMemory shiftForWord) - 1 R: lenReg. "first word of ByteObj, stop looping." - self JumpNonZero: instr] - ifFalse: "Common case, only 1 or 2 word to check: no lenReg allocation, cst micro optimisations" - [self genByteEqualsInlinePrimitiveCmp: str1Reg with: str2Reg scratch1: extraReg scratch2: TempReg field: 0. - jmp := self JumpNonZero: 0. "then string are not equal (jmp target)" - unroll ifTrue: "unrolling more than twice generate more instructions than the loop so we don't do it" - [self genByteEqualsInlinePrimitiveCmp: str1Reg with: str2Reg scratch1: extraReg scratch2: TempReg field: 1. - jmp2 := self JumpNonZero: 0. "then string are not equal (jmp target)"]]. - needjmpZeroSize ifTrue: [ jmpZeroSize jmpTarget: self Label ]. - "fall through, strings are equal" - - "--- Pushing the result or pipelining a branch --- " - self ssPop: 3. - self genByteEqualsInlinePrimitiveResult: jmp returnReg: extraReg. - unroll ifTrue: [jmp2 jmpTarget: jmp getJmpTarget]. - ^0! Item was removed: - ----- Method: SistaCogitClone>>genByteEqualsInlinePrimitiveCmp:with:scratch1:scratch2:field: (in category 'inline primitive generators') ----- - genByteEqualsInlinePrimitiveCmp: str1Reg with: str2Reg scratch1: scratch1Reg scratch2: scratch2Reg field: index - | shift | - <inline: true> - shift := objectMemory baseHeaderSize + (index * objectMemory wordSize). - (self ssValue: 1) type = SSConstant - ifTrue: [self MoveCq: (objectMemory fetchPointer: index ofObject: (self ssValue: 1) constant) R: scratch1Reg] - ifFalse: [self MoveMw: shift r: str1Reg R: scratch1Reg]. - (self ssValue: 2) type = SSConstant - ifTrue: [self MoveCq: (objectMemory fetchPointer: index ofObject: (self ssValue: 2) constant) R: scratch2Reg] - ifFalse: [self MoveMw: shift r: str2Reg R: scratch2Reg]. - self CmpR: scratch1Reg R: scratch2Reg.! Item was removed: - ----- Method: SistaCogitClone>>genByteEqualsInlinePrimitiveResult:returnReg: (in category 'inline primitive generators') ----- - genByteEqualsInlinePrimitiveResult: jmp returnReg: reg - "Byte equal is falling through if the result is true, or jumping using jmp if the result is false. - The method is required to set the jump target of jmp. - We look ahead for a branch and pipeline the jumps if possible.. - ReturnReg is used only if not followed immediately by a branch." - | branchDescriptor nextPC postBranchPC targetBytecodePC localJump canElide | - <var: #localJump type: #'AbstractInstruction *'> - <var: #branchDescriptor type: #'BytecodeDescriptor *'> - self extractMaybeBranchDescriptorInto: [ :descr :next :postBranch :target | - branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetBytecodePC := target ]. - - "Case 1 - not followed by a branch" - (branchDescriptor isBranchTrue or: [branchDescriptor isBranchFalse]) - ifFalse: - [self genMoveTrueR: reg. - localJump := self Jump: 0. - jmp jmpTarget: (self genMoveFalseR: reg). - localJump jmpTarget: self Label. - self ssPushRegister: reg. - ^ 0]. - - "Case 2 - followed by a branch" - (self fixupAt: nextPC) notAFixup - ifTrue: "The next instruction is dead. we can skip it." - [deadCode := true. - self ensureFixupAt: targetBytecodePC. - self ensureFixupAt: postBranchPC ] - ifFalse: - [self ssPushConstant: objectMemory trueObject]. "dummy value" - "We can only elide the jump if the pc after nextPC is the same as postBranchPC. - Branch following means it may not be." - self nextDescriptorExtensionsAndNextPCInto: - [:iguana1 :iguana2 :iguana3 :followingPC| nextPC := followingPC]. - canElide := deadCode and: [nextPC = postBranchPC]. - branchDescriptor isBranchTrue - ifTrue: - [ self Jump: (self ensureNonMergeFixupAt: targetBytecodePC). - canElide - ifFalse: [ jmp jmpTarget: (self ensureNonMergeFixupAt: postBranchPC) ] - ifTrue: [ jmp jmpTarget: self Label ] ] - ifFalse: [ canElide ifFalse: [ self Jump: (self ensureNonMergeFixupAt: postBranchPC). - jmp jmpTarget: (self ensureNonMergeFixupAt: targetBytecodePC) ] ]. - ^0! Item was removed: - ----- Method: SistaCogitClone>>genQuaternaryInlinePrimitive: (in category 'inline primitive generators') ----- - genQuaternaryInlinePrimitive: prim - "Quaternary 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>>#quaternaryInlinePrimitive:" - | needStoreCheck sourceReg stopReg objReg adjust jmp cmp isStartCst isStopCst startCst stopCst iteratorReg | - <var: #jmp type: #'AbstractInstruction *'> - <var: #cmp type: #'AbstractInstruction *'> - prim = 0 ifFalse: [^EncounteredUnknownBytecode]. - - "4000 Pointer Object>> fillFrom:to:with: The receiver is a Pointer object. the middle two arguments are smallintegers. Last argument is any object. Fills the object in between the two indexes with last argument. Receiver is guaranteed to be mutable. The pointer accesses are raw (no inst var check). If ExtB is set to 1, no store check is present. Else a single store check is done for the bulk operation. Answers the receiver." - needStoreCheck := self sistaNeedsStoreCheck. - extB := numExtB := 0. - - "Allocate reg for src, objToStore, iterator and stop." - sourceReg := needStoreCheck - ifTrue: [ self ssAllocateRequiredReg: ReceiverResultReg. - self voidReceiverResultRegContainsSelf. - ReceiverResultReg ] - ifFalse: [ self allocateRegForStackEntryAt: 3 notConflictingWith: self emptyRegisterMask ]. - (self ssValue: 3) popToReg: sourceReg. - objReg := self allocateRegForStackEntryAt: 0 notConflictingWith: (self registerMaskFor: sourceReg). - self ssTop popToReg: objReg. - - "Set up iterator to first index to write and stop to last index to write" - adjust := (objectMemory baseHeaderSize >> objectMemory shiftForWord) - 1. "shift by baseHeaderSize and then move from 1 relative to zero relative" - isStartCst := (self ssValue: 2) type = SSConstant. - isStopCst := (self ssValue: 1) type = SSConstant. - isStartCst ifTrue: [startCst := adjust + (objectMemory integerValueOf: (self ssValue: 2) constant)]. - isStopCst ifTrue: [stopCst := adjust + (objectMemory integerValueOf: (self ssValue: 1) constant)]. - - (isStartCst - and: [isStopCst - and: [stopCst - startCst < 7 ]]) "The other path generates at least 7 instructions" - ifTrue: ["unroll" - startCst - to: stopCst - do: [ :i | self MoveMw: i r: sourceReg R: objReg ] ] - ifFalse: ["loop" - stopReg := self allocateRegNotConflictingWith: (self registerMaskFor: sourceReg and: objReg). - iteratorReg := self allocateRegNotConflictingWith: (self registerMaskFor: sourceReg and: objReg and: stopReg). - isStartCst - ifTrue: [ self MoveCq: startCst R: iteratorReg ] - ifFalse: [ (self ssValue: 2) popToReg: iteratorReg. - adjust ~= 0 ifTrue: [ self AddCq: adjust R: iteratorReg ] ]. - isStopCst - ifTrue: [ self MoveCq: stopCst R: stopReg ] - ifFalse: [ (self ssValue: 1) popToReg: stopReg. - adjust ~= 0 ifTrue: [ self AddCq: adjust R: stopReg ] ]. - cmp := self CmpR: stopReg R: iteratorReg. - jmp := self JumpAbove: 0. - self MoveR: objReg Xwr: iteratorReg R: sourceReg. - self AddCq: 1 R: iteratorReg. - self Jump: cmp. - jmp jmpTarget: self Label]. - - needStoreCheck ifTrue: [objectRepresentation genStoreCheckReceiverReg: sourceReg valueReg: objReg scratchReg: TempReg inFrame: true]. - - self ssPop: 4. - self ssPushRegister: sourceReg. - ^0! Item was removed: - ----- Method: SistaCogitClone>>genQuinaryInlinePrimitive: (in category 'inline primitive generators') ----- - genQuinaryInlinePrimitive: prim - "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>>#quaternaryInlinePrimitive:" - ^EncounteredUnknownBytecode! Item was removed: - ----- Method: SistaCogitClone>>isTrapAt: (in category 'simulation only') ----- - isTrapAt: retpc - "For stack depth checking." - <doNotGenerate> - ^(backEnd isCallPrecedingReturnPC: retpc) - and: [(backEnd callTargetFromReturnAddress: retpc) = ceTrapTrampoline]! Item was removed: - ----- Method: SistaCogitClone>>setCogCodeZoneThreshold: (in category 'accessing') ----- - setCogCodeZoneThreshold: threshold - <doNotGenerate> - ^methodZone setCogCodeZoneThreshold: threshold! Item was changed: ----- Method: ThreadedX64SysVFFIPlugin>>ffiPushStructure:ofSize:typeSpec:ofLength:in: (in category 'marshalling') ----- ffiPushStructure: pointer ofSize: structSize typeSpec: argSpec ofLength: argSpecSize in: calloutState <var: #pointer type: #'void *'> <var: #argSpec type: #'sqInt *'> <var: #calloutState type: #'CalloutState *'> <inline: true> | roundedSize doubleType floatType numDoubleRegisters numIntegerRegisters passField0InXmmReg passField1InXmmReg | structSize <= 16 ifTrue: ["See sec 3.2.3 of http://people.freebsd.org/~obrien/amd64-elf-abi.pdf. (dravft version 0.90). All of the folowing are passed in registers: typedef struct { long a; } s0; typedef struct { double a; } s1; typedef struct { long a; double b; } s2; typedef struct { int a; int b; double c; } s2a; typedef struct { short a; short b; short c; short d; double e; } s2b; typedef struct { long a; float b; } s2f; typedef struct { long a; float b; float c; } s2g; but not ones like this: typedef struct { int a; float b; int c; float d; } s2h;" doubleType := FFITypeDoubleFloat << FFIAtomicTypeShift + FFITypeDoubleFloat. floatType := FFITypeDoubleFloat << FFIAtomicTypeShift + FFITypeSingleFloat. passField0InXmmReg := doubleType = ((self cCoerce: argSpec to: #'int *') at: 1) "0th field is struct type and size" or: [floatType = ((self cCoerce: argSpec to: #'int *') at: 1) and: [floatType = ((self cCoerce: argSpec to: #'int *') at: 2)]]. structSize <= 8 ifTrue: [numDoubleRegisters := passField0InXmmReg ifTrue: [1] ifFalse: [0]. numIntegerRegisters := 1 - numDoubleRegisters] ifFalse: [passField1InXmmReg := doubleType = ((self cCoerce: argSpec to: #'int *') at: argSpecSize - 1) "Nth field is last field of struct" or: [floatType = ((self cCoerce: argSpec to: #'int *') at: argSpecSize - 2) and: [floatType = ((self cCoerce: argSpec to: #'int *') at: argSpecSize - 1)]]. numDoubleRegisters := (passField0InXmmReg ifTrue: [1] ifFalse: [0]) + (passField1InXmmReg ifTrue: [1] ifFalse: [0]). numIntegerRegisters := 2 - numDoubleRegisters]. (calloutState floatRegisterIndex + numDoubleRegisters <= NumFloatRegArgs and: [calloutState integerRegisterIndex + numIntegerRegisters <= NumIntRegArgs]) ifTrue: [passField0InXmmReg ifTrue: [self ffiPushDoubleFloat: ((self cCoerceSimple: pointer to: #'double *') at: 0) in: calloutState] ifFalse: [self ffiPushSignedLongLong: ((self cCoerceSimple: pointer to: #'long long *') at: 0) in: calloutState]. structSize > 8 ifTrue: [passField1InXmmReg ifTrue: [self ffiPushDoubleFloat: ((self cCoerceSimple: pointer to: #'double *') at: 1) in: calloutState] ifFalse: [self ffiPushSignedLongLong: ((self cCoerceSimple: pointer to: #'long long *') at: 1) in: calloutState]]. + ^0] ]. - ^0]. roundedSize := structSize + 7 bitClear: 7. calloutState currentArg + roundedSize > calloutState limit ifTrue: [^FFIErrorCallFrameTooBig]. self mem: calloutState currentArg cp: (self cCoerceSimple: pointer to: 'char *') y: structSize. + calloutState currentArg: calloutState currentArg + roundedSize. - calloutState currentArg: calloutState currentArg + roundedSize]. ^0!

2 1

Recreating live coding in CPython 3.5
by Dimitris Chloupis 14 Oct '17

14 Oct '17

Hey there as it says in the title I am trying to recreat live coding Pharo chracteristics in Python . One of the issues I have is live replacing of a method to an existing instance. I know how to do this in Python but that shown me I would benefit greatily from a more deeper understanding of Pharo live coding internals than I have at the moment which is only at the user level. This will help me avoid common pitfalls in a field that I am not experienced with. Have you guys written any paper , article or blog post in this area, explaining the internals of the VM to that regard ? I am also interested in time machine livde coding, meaning live coding that does not keeps you in the present but also can send you back in the past restoring the live state of old object instances in a specific time moment. Generally any guidance on the art of implementing live coding will be greatly appreciated. I don't care how this can be done in Python because I have already recreated a very basic live coding enviroment in Python and there is a lot of documentation about Python overall what I am interested only is the Smalltalk way of doing live coding but from the perspective of the implementors not the mere users.

9 28

About SQFile's fileSize field
by Levente Uzonyi 12 Oct '17

12 Oct '17

Hi All, The SQFile struct[1] has a field named fileSize, which is used to cache[2] the size of the file when such property makes sense. This caching behavior seems unnecessary, and it causes synchronization problems between multiple SQFile structures of a single file. The latter could be worked around by updating the cached value more often, but I was wondering why is the value cached at all. Does anyone know? Levente [1] https://github.com/OpenSmalltalk/opensmalltalk-vm/blob/Cog/platforms/Cross/… [2] https://github.com/OpenSmalltalk/opensmalltalk-vm/blob/Cog/platforms/Cross/…

4 6

[VM CRASH, 201710061559, Cog/Spur, Win32] Cannot step-over using object-as-method
by Marcel Taeumel 11 Oct '17

11 Oct '17

Hi, there. There seems to be a bug in the VM that occurs when stepping over a call that is actually a regular object in a method dictionary. The VM crashes in the primitive 76. To reproduce the bug load the attached change set and run the following code to install the "fake" method: Blubb methodDict at: #fake put: (BlubbMethod new original: (Blubb >> #original)). Now do this in the workspace: self halt. Blubb new fake. Then "step over" a few times. The VM crashes. This is not a new bug. The VM crashes also in: Squeak 4.6, VM 3397 (Cog V3) Squeak 4.5, VM 2776 (Cog V3) Squeak 4.3, VM Squeak 4.1.1 (no Cog, Stack VM) In Squeak 4.4 (VM 2776, Cog V3), I get a "SmallInteger DNU 137504030". No VM crash. :) In Squeak 3.8 (InterpreterVM?), I get a "Where is the jump??" error raised in MethodContext(InstructionStream) >> #skipBackBeforeJump. No VM crash. :) Best, Marcel

2 2

[OpenSmalltalk/opensmalltalk-vm] 47390d: Update libpng to 1.6.34 for windows
by GitHub 10 Oct '17

10 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: 47390dc0e138c430b1e3db383dd2df736ea0b3f6 https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/47390dc0e138c430b1… Author: Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> Date: 2017-10-10 (Tue, 10 Oct 2017) Changed paths: M third-party/libpng.spec.win Log Message: ----------- Update libpng to 1.6.34 for windows

1 0

[OpenSmalltalk/opensmalltalk-vm] f42120: openssl: Upgrade to minor release "l" to address m...
by GitHub 10 Oct '17

10 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: f42120808162059f197674752068391a66b96102 https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/f42120808162059f19… Author: Holger Hans Peter Freyther <holger(a)moiji-mobile.com> Date: 2017-10-10 (Tue, 10 Oct 2017) Changed paths: M third-party/openssl.spec Log Message: ----------- openssl: Upgrade to minor release "l" to address multiple issues According to https://www.openssl.org/news/vulnerabilities.html#y2017 this should fix: CVE-2017-3731, CVE-2017-3732, CVE-2016-7055. The download should have the sha256sum of: ce07195b659e75f4e1db43552860070061f156a98bb37b672b101ba6e3ddf30c Commit: f1153eb515ad9350df0284a2a7695fa9e6ce3895 https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/f1153eb515ad9350df… Author: Nicolas Cellier <nicolas.cellier.aka.nice(a)gmail.com> Date: 2017-10-10 (Tue, 10 Oct 2017) Changed paths: M third-party/openssl.spec Log Message: ----------- Merge pull request #156 from zecke/openssl openssl: Upgrade to minor release "l" to address multiple issues Compare: https://github.com/OpenSmalltalk/opensmalltalk-vm/compare/4ce6d87e17fa...f1…

1 0

[OpenSmalltalk/opensmalltalk-vm] 4ce6d8: fix a dependency
by GitHub 10 Oct '17

10 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: 4ce6d87e17fa66aa7e4c4be048af6067eaf5517b https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/4ce6d87e17fa66aa7e… Author: Tobias Pape <tobias(a)netshed.de> Date: 2017-10-10 (Tue, 10 Oct 2017) Changed paths: M .travis_install.sh Log Message: ----------- fix a dependency

1 0

[OpenSmalltalk/opensmalltalk-vm] 203de2: Fix CameraPlugin for 64bit unix
by GitHub 06 Oct '17

06 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: 203de239312943d2d8be86ecec306a6f9971f49e https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/203de239312943d2d8… Author: Tobias Pape <tobias(a)netshed.de> Date: 2017-10-06 (Fri, 06 Oct 2017) Changed paths: M platforms/unix/plugins/CameraPlugin/sqCamera-linux.c Log Message: ----------- Fix CameraPlugin for 64bit unix

1 0

[OpenSmalltalk/opensmalltalk-vm] ada103: more sqInts
by GitHub 06 Oct '17

06 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: ada1032d18f19d18587fa02e8f4e7bff53eb0b8e https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/ada1032d18f19d1858… Author: Tobias Pape <tobias(a)netshed.de> Date: 2017-10-06 (Fri, 06 Oct 2017) Changed paths: M platforms/unix/plugins/CameraPlugin/sqCamera-linux.c Log Message: ----------- more sqInts [ci skip]

1 0

[OpenSmalltalk/opensmalltalk-vm] 0c216b: Fix sqInts for CameraPlugin
by GitHub 06 Oct '17

06 Oct '17

Branch: refs/heads/Cog Home: https://github.com/OpenSmalltalk/opensmalltalk-vm Commit: 0c216bdc60a7e85d05fa64f15164c8b78774f2d8 https://github.com/OpenSmalltalk/opensmalltalk-vm/commit/0c216bdc60a7e85d05… Author: Tobias Pape <tobias(a)netshed.de> Date: 2017-10-06 (Fri, 06 Oct 2017) Changed paths: M platforms/Cross/plugins/CameraPlugin/CameraPlugin.h A platforms/Cross/vm/sq.h.orig M platforms/iOS/plugins/CameraPlugin/AVFoundationVideoGrabber.m M platforms/unix/plugins/CameraPlugin/sqCamera-linux.c Log Message: ----------- Fix sqInts for CameraPlugin also, bit cleanup for iOS [ci skip]

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Vm-dev October 2017