Squeak-dev July 2020

squeak-dev@lists.squeakfoundation.org

47 participants
165 discussions

The Trunk: SystemReporter-eem.43.mcz
by commits＠source.squeak.org 27 Jul '20

27 Jul '20

Eliot Miranda uploaded a new version of SystemReporter to project The Trunk: http://source.squeak.org/trunk/SystemReporter-eem.43.mcz ==================== Summary ==================== Name: SystemReporter-eem.43 Author: eem Time: 27 July 2020, 12:28:19.766033 pm UUID: 07d625b9-43e4-47c4-9bd2-afc14f912602 Ancestors: SystemReporter-mt.42 Make accurate the label for desired code code size. =============== Diff against SystemReporter-mt.42 =============== Item was changed: ----- Method: SystemReporter>>reportVMParameters: (in category 'reporting') ----- reportVMParameters: aStream | vmParameters isStack isCog isSpur | self header: 'Virtual Machine Parameters' on: aStream. vmParameters := Smalltalk vm getVMParameters. isStack := (vmParameters at: 42 ifAbsent: [0]) ~= 0. "42 = number of stack pages available" isCog := isStack and: [(vmParameters at: 46) ~= 0]. "46 is machine code zone size" isSpur := isStack and: [(vmParameters at: 41) anyMask: 2r10000]. "41 is imageFormatVersion for the VM; bit 16 is the Spur bit" (isSpur ifFalse: [#( 1 'size of old space' 2 'size of young+old space' 3 'size of memory' 4 'allocationCount' 5 'allocations between GCs' 6 'survivor count tenuring threshold')] ifTrue: [#( 1 'size of old space' 2 'used bytes in new space (used eden + used past space)' 3 'size of heap')]), #( 7 'full GCs since startup' 8 'total milliseconds in full GCs since startup'), (isSpur ifFalse: [#( 9 'incremental GCs since startup' 10 'total milliseconds in incremental GCs since startup' 11 'tenures of surving objects since startup'), {12 to: 19. 'specific to the translating VM'}] ifTrue: [#( 9 'scavenging GCs since startup' 10 'total milliseconds in scavenging GCs since startup' 11 'tenures of surving objects since startup'), {12 to: 15. 'reserved for future use'}, #( 16 'total microseconds in idle since startup' 17 'proportion of code zone available for use (Sista VMs only; read-write)' 18 'total milliseconds in full GC compaction since startup (a portion of parameter 8)' 19 'scavenge threshold; the effective size of eden')]), #( 20 'utc microseconds at startup (if non-zero)' 21 'root/remembered table size (occupancy)' 22 'root/remembered table overflows since startup' 23 'bytes of extra memory to reserve for VM buffers, plugins, etc.' 24 'free memory threshold above which object memory will be shrunk' 25 'memory headroom when growing object memory'), (isStack ifFalse: [#( 26 'interruptChecksEveryNms - force an ioProcessEvents every N milliseconds, in case the image is not calling getNextEvent often')] ifTrue: [#( 26 'heartbeat period (ms; see #58)')]), (isSpur ifFalse: [#( 27 'number of times mark loop iterated for current IGC/FGC includes ALL marking' 28 'number of times sweep loop iterated for current IGC/FGC' 29 'number of times make forward loop iterated for current IGC/FGC' 30 'number of times compact move loop iterated for current IGC/FGC')] ifTrue: [#()]), #( 31 'number of grow memory requests' 32 'number of shrink memory requests'), (isSpur ifFalse: [#( 33 'number of root table entries used for current IGC/FGC' 34 'number of allocations done before current IGC/FGC' 35 'number of survivor objects after current IGC/FGC' 36 'millisecond clock when current IGC/FGC completed' 37 'number of marked objects for Roots of the world, not including Root Table entries for current IGC/FGC' 38 'milliseconds taken by current IGC' 39 'Number of finalization signals for Weak Objects pending when current IGC/FGC completed')] ifTrue: [#( 33 'number of root table entries at last scavenge' 35 'number of survivor objects at last scavenge (if non-zero)' 36 'millisecond clock when current scavenge completed' 38 'milliseconds taken by current scavenge' 39 'Number of finalization signals for Weak Objects pending when current SGC/FGC completed')]), #( 40 'VM word size - 4 or 8'), (isStack ifTrue: [#( 41 'imageFormatVersion for the VM' 42 'number of stack pages available' 43 'desired number of stack pages (stored in image file header, max 65535)' 44 'size of eden, in bytes' 45 'desired size of eden, in bytes (stored in image file header)' 46 'machine code zone size, in bytes (0 in Stack VM)' + 47 'desired machine code zone size (0 => default 1Mb to 2Mb depending on processor)' - 47 'desired machine code zone size (0 => default 1Mb)' 48 'various persistent image header flags. See getCogVMFlags in the VM source.' 49 'max size the image promises to grow the external semaphore table to'), (isSpur ifFalse: [{ 50 to: 51. 'reserved for VM parameters that persist in the image (such as size of eden above)'. 52 to: 56. 'specific to Spur' }] ifTrue: [{ 50 to: 51. 'reserved for VM parameters that persist in the image (such as size of eden above)' }, #( 52 'root/remembered table capacity' 53 'number of old space segments' 54 'total free old space' 55 'ratio of growth and image size at or above which a GC will be performed post scavenge')]), #( 56 'number of process switches since startup' 57 'number of ioProcessEvents calls since startup' 58 'number of forceInterruptCheck calls since startup' 59 'number of check event calls since startup' 60 'number of stack page overflows since startup' 61 'number of stack page divorces since startup' 62 'compiled code compactions since startup'), (isCog ifFalse: [#()] ifTrue: [#( 63 'total milliseconds in compiled code compactions since startup' 64 'the number of methods that currently have jitted machine-code')]), { 65. 'Cog feature flags\ bit 0: set if the VM supports MULTIPLE_BYTECODE_SETS.\ bit 1: set if the VM supports read-only objects.\ bit 2: set if the VM has an ITIMER_HEARTBEAT' withCRs. 66. 'the byte size of a stack page'.}, (isSpur ifFalse: [{ 67 to: 69. 'reserved for more Cog-related info' }] ifTrue: [#( 67 'the maximum allowed size of old space (if zero there is no limit)' 68 'the average number of live stack pages when scanned by scavenge/gc/become' 69 'the maximum number of live stack pages when scanned by scavenge/gc/become')]), #( 70 'the vmProxyMajorVersion (the interpreterProxy VM_MAJOR_VERSION)' 71 'the vmProxyMinorVersion (the interpreterProxy VM_MINOR_VERSION)')] ifFalse: [#()]) pairsDo: [:idx :desc | | value values | aStream nextPut: $#. idx isInteger ifTrue: [value := vmParameters at: idx. aStream print: idx; tab: (idx < 10 ifTrue: [2] ifFalse: [1]); nextPutAll: ((value isInteger and: [idx ~= 41]) ifTrue: [value asStringWithCommas] ifFalse: [value printString])] ifFalse: [value := vmParameters at: idx first. aStream print: idx first; next: 2 put: $.; print: idx last; tab. values := idx collect: [:i| vmParameters at: i]. values asSet size = 1 ifTrue: [aStream print: value] ifFalse: [values do: [:v| aStream print: v] separatedBy: [aStream nextPutAll: ', ']]]. aStream tab; nextPutAll: desc; cr]!

1 0

The Trunk: CollectionsTests-ul.341.mcz
by commits＠source.squeak.org 27 Jul '20

27 Jul '20

Eliot Miranda uploaded a new version of CollectionsTests to project The Trunk: http://source.squeak.org/trunk/CollectionsTests-ul.341.mcz ==================== Summary ==================== Name: CollectionsTests-ul.341 Author: eem Time: 25 July 2020, 8:44:46.338509 pm UUID: 1b22fd11-c092-46ba-bd26-526080294ab8 Ancestors: CollectionsTests-ul.340 Fix an old spelling error. Using Levente's initials for the package version and the change stamp because this is his code. I only noticed and fixed the speeling error. No other changes. eem 7/25/2020. I beg forgiveness if this is in any way offensive. =============== Diff against CollectionsTests-ul.340 =============== Item was added: + ----- Method: ByteArrayTest>>testPlatformIndependentIntegerAccessorsAtBitBorders (in category 'tests - platform independent access') ----- + testPlatformIndependentIntegerAccessorsAtBitBorders + + #( + shortAt:put:bigEndian: shortAt:bigEndian: false 16 + longAt:put:bigEndian: longAt:bigEndian: false 32 + long64At:put:bigEndian: long64At:bigEndian: false 64 + unsignedShortAt:put:bigEndian: unsignedShortAt:bigEndian: true 16 + unsignedLongAt:put:bigEndian: unsignedLongAt:bigEndian: true 32 + unsignedLong64At:put:bigEndian: unsignedLong64At:bigEndian: true 64 + ) groupsDo: [ :setter :getter :unsigned :storageBits | + self + verifyPlatformIndependentIntegerAccessorsAtBitBordersSetter: setter + getter: getter + unsigned: unsigned + storageBits: storageBits ]! Item was added: + ----- Method: ByteArrayTest>>testPlatformIndependentIntegerAccessorsWithRandomValues (in category 'tests - platform independent access') ----- + testPlatformIndependentIntegerAccessorsWithRandomValues + + | random | + random := Random seed: 36rSqueak. + #( + shortAt:put:bigEndian: shortAt:bigEndian: false 16 + longAt:put:bigEndian: longAt:bigEndian: false 32 + long64At:put:bigEndian: long64At:bigEndian: false 64 + unsignedShortAt:put:bigEndian: unsignedShortAt:bigEndian: true 16 + unsignedLongAt:put:bigEndian: unsignedLongAt:bigEndian: true 32 + unsignedLong64At:put:bigEndian: unsignedLong64At:bigEndian: true 64 + ) groupsDo: [ :setter :getter :unsigned :storageBits | + self + verifyPlatformIndependentIntegerAccessorsWithRandomValuesSetter: setter + getter: getter + unsigned: unsigned + storageBits: storageBits + random: random ]! Item was removed: - ----- Method: ByteArrayTest>>testPlatformIndepentendIntegerAccessorsAtBitBorders (in category 'tests - platform independent access') ----- - testPlatformIndepentendIntegerAccessorsAtBitBorders - - #( - shortAt:put:bigEndian: shortAt:bigEndian: false 16 - longAt:put:bigEndian: longAt:bigEndian: false 32 - long64At:put:bigEndian: long64At:bigEndian: false 64 - unsignedShortAt:put:bigEndian: unsignedShortAt:bigEndian: true 16 - unsignedLongAt:put:bigEndian: unsignedLongAt:bigEndian: true 32 - unsignedLong64At:put:bigEndian: unsignedLong64At:bigEndian: true 64 - ) groupsDo: [ :setter :getter :unsigned :storageBits | - self - verifyPlatformIndepentendIntegerAccessorsAtBitBordersSetter: setter - getter: getter - unsigned: unsigned - storageBits: storageBits ]! Item was removed: - ----- Method: ByteArrayTest>>testPlatformIndepentendIntegerAccessorsWithRandomValues (in category 'tests - platform independent access') ----- - testPlatformIndepentendIntegerAccessorsWithRandomValues - - | random | - random := Random seed: 36rSqueak. - #( - shortAt:put:bigEndian: shortAt:bigEndian: false 16 - longAt:put:bigEndian: longAt:bigEndian: false 32 - long64At:put:bigEndian: long64At:bigEndian: false 64 - unsignedShortAt:put:bigEndian: unsignedShortAt:bigEndian: true 16 - unsignedLongAt:put:bigEndian: unsignedLongAt:bigEndian: true 32 - unsignedLong64At:put:bigEndian: unsignedLong64At:bigEndian: true 64 - ) groupsDo: [ :setter :getter :unsigned :storageBits | - self - verifyPlatformIndepentendIntegerAccessorsWithRandomValuesSetter: setter - getter: getter - unsigned: unsigned - storageBits: storageBits - random: random ]! Item was added: + ----- Method: ByteArrayTest>>verifyPlatformIndependentIntegerAccessorsAtBitBordersSetter:getter:unsigned:storageBits: (in category 'tests - platform independent access') ----- + verifyPlatformIndependentIntegerAccessorsAtBitBordersSetter: setter getter: getter unsigned: unsigned storageBits: storageBits + + | byteArray minValue maxValue baseValues | + byteArray := ByteArray new: storageBits // 8 * 2. + unsigned + ifTrue: [ + minValue := 0. + maxValue := 1 << storageBits - 1. + baseValues := #(0 1) ] + ifFalse: [ + minValue := -1 << (storageBits - 1). + maxValue := 1 << (storageBits - 1) - 1. + baseValues := #(-1 0 1) ]. + #(true false) do: [ :bigEndian | + 0 to: storageBits - 1 do: [ :bits | + baseValues do: [ :baseValue | + | centerValue | + centerValue := baseValue << bits. + centerValue - 1 to: centerValue + 1 do: [ :value | + (value between: minValue and: maxValue) ifTrue: [ + self + verifyPlatformIndependentIntegerAccessorsMatch: byteArray + for: value + setter: setter + getter: getter + storageBits: storageBits + bigEndian: bigEndian ] ] ] ] ] + ! Item was added: + ----- Method: ByteArrayTest>>verifyPlatformIndependentIntegerAccessorsMatch:for:setter:getter:storageBits:bigEndian: (in category 'tests - platform independent access') ----- + verifyPlatformIndependentIntegerAccessorsMatch: byteArray for: value setter: setter getter: getter storageBits: storageBits bigEndian: bigEndian + + | expectedSetterResult getterResult bytes | + expectedSetterResult := self byteArrayFor: value bits: storageBits bigEndian: bigEndian. + bytes := storageBits // 8. + 1 to: byteArray size - bytes + 1 do: [ :index | + byteArray + perform: setter + with: index + with: value + with: bigEndian. + 1 to: bytes do: [ :byteIndex | + self + assert: (expectedSetterResult at: byteIndex) + equals: (byteArray at: index + byteIndex - 1) ]. + getterResult := byteArray + perform: getter + with: index + with: bigEndian. + self assert: value equals: getterResult ]! Item was added: + ----- Method: ByteArrayTest>>verifyPlatformIndependentIntegerAccessorsWithRandomValuesSetter:getter:unsigned:storageBits:random: (in category 'tests - platform independent access') ----- + verifyPlatformIndependentIntegerAccessorsWithRandomValuesSetter: setter getter: getter unsigned: unsigned storageBits: storageBits random: random + + | byteArray randomMax randomOffset | + byteArray := ByteArray new: storageBits // 8 * 2. + randomMax := 1 << storageBits. + randomOffset := unsigned + ifTrue: [ -1 ] + ifFalse: [ -1 << (storageBits - 1) - 1 ]. + 10000 timesRepeat: [ + | value | + value := (random nextInt: randomMax) + randomOffset. + #(true false) do: [ :bigEndian | + self + verifyPlatformIndependentIntegerAccessorsMatch: byteArray + for: value + setter: setter + getter: getter + storageBits: storageBits + bigEndian: bigEndian ] ]! Item was removed: - ----- Method: ByteArrayTest>>verifyPlatformIndepentendIntegerAccessorsAtBitBordersSetter:getter:unsigned:storageBits: (in category 'tests - platform independent access') ----- - verifyPlatformIndepentendIntegerAccessorsAtBitBordersSetter: setter getter: getter unsigned: unsigned storageBits: storageBits - - | byteArray minValue maxValue baseValues | - byteArray := ByteArray new: storageBits // 8 * 2. - unsigned - ifTrue: [ - minValue := 0. - maxValue := 1 << storageBits - 1. - baseValues := #(0 1) ] - ifFalse: [ - minValue := -1 << (storageBits - 1). - maxValue := 1 << (storageBits - 1) - 1. - baseValues := #(-1 0 1) ]. - #(true false) do: [ :bigEndian | - 0 to: storageBits - 1 do: [ :bits | - baseValues do: [ :baseValue | - | centerValue | - centerValue := baseValue << bits. - centerValue - 1 to: centerValue + 1 do: [ :value | - (value between: minValue and: maxValue) ifTrue: [ - self - verifyPlatformIndepentendIntegerAccessorsMatch: byteArray - for: value - setter: setter - getter: getter - storageBits: storageBits - bigEndian: bigEndian ] ] ] ] ] - ! Item was removed: - ----- Method: ByteArrayTest>>verifyPlatformIndepentendIntegerAccessorsMatch:for:setter:getter:storageBits:bigEndian: (in category 'tests - platform independent access') ----- - verifyPlatformIndepentendIntegerAccessorsMatch: byteArray for: value setter: setter getter: getter storageBits: storageBits bigEndian: bigEndian - - | expectedSetterResult getterResult bytes | - expectedSetterResult := self byteArrayFor: value bits: storageBits bigEndian: bigEndian. - bytes := storageBits // 8. - 1 to: byteArray size - bytes + 1 do: [ :index | - byteArray - perform: setter - with: index - with: value - with: bigEndian. - 1 to: bytes do: [ :byteIndex | - self - assert: (expectedSetterResult at: byteIndex) - equals: (byteArray at: index + byteIndex - 1) ]. - getterResult := byteArray - perform: getter - with: index - with: bigEndian. - self assert: value equals: getterResult ]! Item was removed: - ----- Method: ByteArrayTest>>verifyPlatformIndepentendIntegerAccessorsWithRandomValuesSetter:getter:unsigned:storageBits:random: (in category 'tests - platform independent access') ----- - verifyPlatformIndepentendIntegerAccessorsWithRandomValuesSetter: setter getter: getter unsigned: unsigned storageBits: storageBits random: random - - | byteArray randomMax randomOffset | - byteArray := ByteArray new: storageBits // 8 * 2. - randomMax := 1 << storageBits. - randomOffset := unsigned - ifTrue: [ -1 ] - ifFalse: [ -1 << (storageBits - 1) - 1 ]. - 10000 timesRepeat: [ - | value | - value := (random nextInt: randomMax) + randomOffset. - #(true false) do: [ :bigEndian | - self - verifyPlatformIndepentendIntegerAccessorsMatch: byteArray - for: value - setter: setter - getter: getter - storageBits: storageBits - bigEndian: bigEndian ] ]!

2 1

Squeak on Solaris 11.4
by stes＠PANDORA.BE 26 Jul '20

26 Jul '20

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Hi, To continue the work that was done in the past (see http://squeakvm.org) on a Solaris (UNIX) version of Squeak, there's now a SourceForge (SF) project: https://sourceforge.net/projects/solaris-squeak/ The older versions of squeakvm.org were for older versions of Solaris (for both SPARC and Intel). The new site is currently for Solaris 11.3 and Solaris 11.4 Intel only (no SPARC yet, for the moment). Specifically there are some notes on installing Squeak on Solaris 11: https://sourceforge.net/p/solaris-squeak/wiki/Home/ Also there is a package "squeak-4" which can run Squeak V4 images. The squeak-4 package was compiled from squeakvm.org sources (subversion). And a package "squeak-5" (Stack Spur and Cog Spur) : 5.0-202007210625 Sun Jul 26 08:22:09 CEST 2020 cc [Production Spur 64-bit VM] StackInterpreter VMMaker.oscog-eem.2778 uuid: b747c434-29c0-4abf-9e8b-3787a02c06ea Jul 26 2020 This is a (very recent) VM which includes again (the old) DES,MD5,SHA2 plugins, that VM was compiled from the recent Cog opensmalltalk sources as of July 26. In case anyone is using Squeak on Solaris, feel free to visit this SF project. Regards, David Stes -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBCAAGBQJfHU8uAAoJEAwpOKXMq1MazCAH/3ae7QoIANYk0TWUMhZDZZag S1hngP3coPQExsmDDWFOWHp7N1TbCF0ZohZslZW30Ycn3JaVfoxbcIXuGUrQe2mK BaB1ik85h8z2/WSKTIcjtiftND5qv4UO1TLoynI8B9m/jqo7L5Pm52BTgwtlHPjS dIpzNj/uTGKVaXlu2x0Xa3tHtbIJ5frL6n9EqDU5nVAUyFQGbEC0JaJi8nQOoTS1 H5qRGNcJA5OGTti4KnT29DmScV4QJIPYq2wEf8iWficqObB7rnx2OvPfiChPsh2W 4uaPNGYF5d2zRXpqkZzne3VHTGtjn9mlbGFLR+Q1XfQOESLQ64sxsVCmvLhrl5k= =HwYy -----END PGP SIGNATURE-----

1 0

A big thank you to whoever made the tree in FileList display in alphabetical order
by gettimothy 24 Jul '20

24 Jul '20

6 11

Flash morphic
by Bruce O'Neel 24 Jul '20

24 Jul '20

Hi, Long time ago I think Andreas wrote a mostly done flash player in Morphic. Does anyone else remember this or is my mind going? Is the code still around? I ask because flash is going away at the end of the year and I might have a need to continue to use it. An example of reading and displaying a SWF file could be quite useful. Thanks. bruce

2 1

The Trunk: EToys-eem.400.mcz
by commits＠source.squeak.org 24 Jul '20

24 Jul '20

Eliot Miranda uploaded a new version of EToys to project The Trunk: http://source.squeak.org/trunk/EToys-eem.400.mcz ==================== Summary ==================== Name: EToys-eem.400 Author: eem Time: 23 July 2020, 4:06:39.960265 pm UUID: cd372e46-6184-4c26-9528-da5309945631 Ancestors: EToys-eem.399 Allow the webcam resolution to be set before opening a WebCamMorph. =============== Diff against EToys-eem.399 =============== Item was changed: ----- Method: WebCamMorph>>setWebCamResolution: (in category 'e-toy - settings') ----- setWebCamResolution: aSymbol | wasOn | + "Failing silently here is awful; but that's what the code did :-(" + (WebCamResolution resolutions includes: aSymbol) ifFalse: [^ self]. - - ((WebCamResolution resolutions) includes: aSymbol) ifFalse: [^ self]. resolution := aSymbol. (wasOn := camIsOn) ifTrue: [self off]. frameExtent := self class resolutionFor: aSymbol. + displayForm ifNotNil: + [displayForm := displayForm scaledToSize: frameExtent]. - displayForm := displayForm scaledToSize: frameExtent. self updateDisplay. + wasOn ifTrue: [self on] - wasOn ifTrue: [self on]. - - !

1 0

trunk and new vm etiquette
by Eliot Miranda 22 Jul '20

22 Jul '20

Hi All, I've just found and fixed a VM bug in an as-yet-unpublished pair of primitives that replace FloatArrayPlugin>>primitiveAt[Put] and Float64ArrayPlugin>>primitiveAt[Put]. The new replacement, which allows two methods (at:[put:]) in FloatArray to relace four methods (Float32Array>>at:[put:] & Float64Array>>at:[put:]) are some 5 to 10 times faster than the plugin methods. The issue is when to publish the corrections to trunk. Since the existing VM is broken I don't want to simply push to trunk and have people inconvenienced by a sudden emergence of failures in the FoatArrayTests. However, I do want to push the corrections soon, because they're a substantial improvement. So the question is how long should I wait? Is it OK if I push the fixes to FloatArray and subclasses in a week? Do people using trunk keep an eye on the CI builds and upgrade, or would they appreciate a heads up? If so, as soon as the AppVeyor builds succeed for CogVM source as per VMMaker.oscog-eem.2778, I'll let you know and ask that you upgrade your VM. _,,,^..^,,,_ best, Eliot

6 9

MNU for ifNil: to preserve quick returns? :-)
by Marcel Taeumel 22 Jul '20

22 Jul '20

Hi all! I can choose to initialize an instVar eagerly in #initialize or lazily in its accessor via #ifNil:. Yet, the latter requires me to change that accessor to something not being a quick return. Could there be a simple way to initialize an instVar on its first read access? Like a #notYetInitialized: callback to the instVar-holding receiver. Instead, we get an MNU on UndefiniedObject ... (Why? Performance reasons for a little project of mine.) Best, Marcel

5 6

The Trunk: Kernel-eem.1335.mcz
by commits＠source.squeak.org 21 Jul '20

21 Jul '20

Eliot Miranda uploaded a new version of Kernel to project The Trunk: http://source.squeak.org/trunk/Kernel-eem.1335.mcz ==================== Summary ==================== Name: Kernel-eem.1335 Author: eem Time: 21 July 2020, 12:33:42.401688 pm UUID: 829e7c17-0cb2-4269-a6ca-d85bef9ecc2a Ancestors: Kernel-mt.1334 Support for FloatArray; add 64-bit duals of the 32-bit float converters, so along side Float>>asIEEE32BitWord & Float class>>fromIEEE32Bit: we have Float>>asIEEE64BitWord & Float class>>fromIEEE64Bit:. =============== Diff against Kernel-mt.1334 =============== Item was added: + ----- Method: Float class>>fromIEEE64Bit: (in category 'instance creation') ----- + fromIEEE64Bit: anInteger + "Convert the given 64 bit word (which is supposed to be a positive 64-bit value) from + a 64 bit IEEE floating point representation into an actual Squeak float object (being + 64 bits wide). Should only be used for conversion in FloatArrays or likewise objects." + | value | + value := self basicNew: 2. + value + basicAt: 1 put: (anInteger bitShift: -32); + basicAt: 2 put: (anInteger bitAnd: 16rFFFFFFFF). + ^value isFinite + ifTrue: [value * 1.0] "reduce to SmallFloat64 if possible" + ifFalse: [value]! Item was changed: ----- Method: Float>>asIEEE32BitWord (in category 'converting') ----- asIEEE32BitWord "Convert the receiver into a 32 bit Integer value representing the same number in IEEE 32 bit format. + Used for conversion in FloatArrays." - Used for conversion in FloatArrays only." + | word1 word2 sign mantissa exponent truncatedBits mask roundToUpper | - | word1 word2 sign mantissa exponent destWord truncatedBits mask roundToUpper | "skip fast positive and nnegative zero" self = 0.0 ifTrue: [^self basicAt: 1]. "retrieve 64 bits of IEEE 754 double" word1 := self basicAt: 1. word2 := self basicAt: 2. "prepare sign exponent and mantissa of 32 bits float" sign := word1 bitAnd: 16r80000000. exponent := ((word1 bitShift: -20) bitAnd: 16r7FF) - 1023 + 127. mantissa := (word2 bitShift: -29) + ((word1 bitAnd: 16rFFFFF) bitShift: 3). truncatedBits := (word2 bitAnd: 16r1FFFFFFF). "We must now honour default IEEE rounding mode (round to nearest even)" "we are below gradual underflow, even if rounded to upper mantissa" + exponent < -24 ifTrue: [^sign]. "this can be negative zero" - exponent < -24 ifTrue: [^sign "this can be negative zero"]. "BEWARE: rounding occurs on less than 23bits when gradual underflow" exponent <= 0 ifTrue: [mask := 1 bitShift: exponent negated. mantissa := mantissa bitOr: 16r800000. roundToUpper := (mantissa bitAnd: mask) isZero not and: [truncatedBits isZero not or: [(mantissa bitAnd: mask - 1) isZero not or: [(mantissa bitAnd: mask*2) isZero not]]]. mantissa := mantissa bitShift: exponent - 1. "exponent := exponent + 1"] ifFalse: [roundToUpper := (truncatedBits bitAnd: 16r10000000) isZero not and: [(mantissa bitAnd: 16r1) isZero not + or: [(truncatedBits bitAnd: 16r0FFFFFFF) isZero not]]]. - or: [(truncatedBits bitAnd: 16r0FFFFFFF) isZero not]] - ]. "adjust mantissa and exponent due to IEEE rounding mode" + roundToUpper ifTrue: + [mantissa := mantissa + 1. + mantissa > 16r7FFFFF ifTrue: + [mantissa := 0. + exponent := exponent+1]]. - roundToUpper - ifTrue: - [mantissa := mantissa + 1. - mantissa > 16r7FFFFF - ifTrue: - [mantissa := 0. - exponent := exponent+1]]. + exponent > 254 ifTrue: "Overflow" + [exponent := 255. - exponent > 254 ifTrue: ["Overflow" - exponent := 255. self isNaN ifTrue: [mantissa isZero ifTrue: ["BEWARE: do not convert a NaN to infinity due to truncatedBits" mantissa := 1]] ifFalse: [mantissa := 0]]. "Encode the word" + ^(sign bitOr: ((exponent max: 0) bitShift: 23)) bitOr: mantissa! - destWord := (sign bitOr: ((exponent max: 0) bitShift: 23)) bitOr: mantissa. - ^ destWord! Item was added: + ----- Method: Float>>asIEEE64BitWord (in category 'converting') ----- + asIEEE64BitWord + "Convert the receiver into a 64 bit Integer value representing the same number in IEEE 64 bit format. + Used for conversion in FloatArrays." + + ^((self basicAt: 1) bitShift: 32) + (self basicAt: 2)!

1 0

[2nd CfP] MPLR 2020 - 17th International Conference on Managed Programming Languages & Runtimes
by Stefan Marr 21 Jul '20

21 Jul '20

======================================================================== Call for Papers MPLR 2020 - 17th International Conference on Managed Programming Languages & Runtimes November 4-6, 2020 in Manchester, United Kingdom https://mplr2020.cs.manchester.ac.uk/ Follow us @MPLR_Conf ======================================================================== The 17th International Conference on Managed Programming Languages & Runtimes (MPLR, formerly ManLang) is a premier forum for presenting and discussing novel results in all aspects of managed programming languages and runtime systems, which serve as building blocks for some of the most important computing systems in use, ranging from small-scale (embedded and real-time systems) to large-scale (cloud-computing and big-data platforms) and anything in between (desktop, mobile, IoT, and wearable applications). This year, MPLR will be held virtually. Registration and participation will be free. For up-to-date details, check out the conference website: https://mplr2020.cs.manchester.ac.uk/ and follow us on Twitter @MPLR_Conf. The areas of interest include but are not limited to: * Languages and Compilers - Managed languages (e.g., Java, Scala, JavaScript, Python, Ruby, C#, F#, Clojure, Groovy, Kotlin, R, Smalltalk, Racket, Rust, Go, etc.) - Domain-specific languages - Language design - Compilers and interpreters - Type systems and program logics - Language interoperability - Parallelism, distribution, and concurrency * Virtual Machines - Managed runtime systems (e.g., JVM, Android Runtime (ART), V8, LLVM, .NET CLR, RPython, GraalVM, etc.) - VM design and optimization - VMs for mobile and embedded devices - VMs for real-time applications - Memory management and garbage collection - Hardware/software co-design * Techniques, Tools, and Applications - Static and dynamic program analysis - Testing and debugging - Refactoring - Program understanding - Program synthesis - Security and privacy - Performance analysis and monitoring - Compiler and program verification Submission Categories --------------------- MPLR accepts four types of submissions: 1. Regular research papers describing novel contributions involving managed language platforms. Research papers will be evaluated based on their relevance, novelty, technical rigor, and contribution to the state-of-the-art. Format: up to 12 pages, excluding bibliography and appendix 2. Work-in-progress research papers describing promising new ideas, with perhaps less maturity than full Papers. Work-in-progress papers will be evaluated with an emphasis on novelty and the potential of the new ideas instead of technical rigor and experimental results. Format: up to 6 pages, excluding bibliography and appendix 3. Industry and tool papers presenting technical challenges and solutions for managed language platforms in the context of deployed applications and systems. Industry and tool papers will be evaluated on their relevance, usefulness, and results. Suitability for demonstration and availability will also be considered for tool papers. Format: up to 6 pages, excluding bibliography and appendix 4. Posters They will be evaluated similarly to work-in-progress papers. Posters can accompany any submission as a way to provide additional demonstration and discussion opportunities. Format: poster and 1-page abstract MPLR 2020 submissions must conform to the ACM Policy on Prior Publication and Simultaneous Submissions and to the SIGPLAN Republication Policy. See http://www.sigplan.org/Resources/Policies/Republication/ Author Instructions ------------------- Submissions need to use the ACM `acmart` format with the `sigconf` style: https://www.acm.org/publications/proceedings-template If you are using LaTeX, submissions need to use the 'acmart' document class with the 'sigconf' option. For reviewing, please include page numbers in your submission using the LaTeX command `\settopmatter{printfolios=true}`. The standard settings of a 9 point font size and the Libertine/Biolinum font family are to be kept. All submissions need to be in PDF format. MPLR uses single-blind reviewing, i.e., author names are generally included in submissions. Please also ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes are legible. Submission Site: https://mplr2020.cs.manchester.ac.uk/submissions/ Important Dates --------------- Submission Deadline: 12 August 2020 Author Notification: 14 September 2020 Camera Ready: 05 October 2020 Conference Dates: 04-06 November 2020 All deadlines are 23:59 AoE (UTC-12h). AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. COVID-19 -------- MPLR will be held virtual to avoid any health risks to attendees and avoid uncertainties around traveling. Organization ------------ Program Committee: Lubomír Bulej, Charles University, Czech Republic Jeronimo Castrillon, TU Dresden, Germany Shigeru Chiba, University of Tokyo, Japan Irene Finocchi, LUISS Guido Carli University, Italy Juliana Franco, Microsoft Research, UK Elisa Gonzalez Boix, Vrije Universiteit Brussel, Belgium Robert Hirschfeld, Hasso Plattner Institute, Germany Roberto Ierusalimschy, PUC-Rio, Brazil Georgia Kouveli, ARM, UK Burcu Külahçıoğlu Özkan, MPI-SWS, Germany Doug Lea, SUNY Oswego, USA Daryl Maier, IBM, Canada Mark Marron, Microsoft Research, USA Hidehiko Masuhara, Tokyo Institute of Technology, Japan Hanspeter Mössenböck, JKU Linz, Austria Hannes Payer, Google, Germany Julien Ponge, Red Hat, France Aleksandar Prokopec, Oracle Labs, Switzerland Manuel Rigger, ETH Zurich, Switzerland Andrea Rosa, USI, Switzerland Jeremy Singer, University of Glasgow, UK Eli Tilevich, Virginia Tech, USA Sam Tobin-Hochstadt, Indiana University, USA Tobias Wrigstad, Uppsala University, Sweden General Chair: Christos Kotselidis, University of Manchester, UK Program Chair: Stefan Marr, University of Kent, UK If you are unsure whether a particular topic falls within the scope of MPRL’20 or if you have any other questions, please do not hesitate to contact the Program Chair (s.marr(a)kent.ac.uk). -- Stefan Marr School of Computing, University of Kent https://stefan-marr.de/research/

1 0

← Newer
1
...
7
8
9
10
11
12
13
...
17
Older →

Jump to page: