Squeak-dev June 2015

squeak-dev@lists.squeakfoundation.org

35 participants
162 discussions

The Trunk: Compiler.spur-eem.301.mcz
by commits＠source.squeak.org 19 Jun '15

19 Jun '15

Eliot Miranda uploaded a new version of Compiler to project The Trunk: http://source.squeak.org/trunk/Compiler.spur-eem.301.mcz ==================== Summary ==================== Name: Compiler.spur-eem.301 Author: eem Time: 19 June 2015, 12:42:21.36 pm UUID: 36fb91f1-929c-4d36-ba0b-49983331a34b Ancestors: Compiler-eem.301, Compiler.spur-eem.300 Compiler-eem.301 patched for Spur by SpurBootstrapMonticelloPackagePatcher Cog-eem.269 Fix pc range highlighting when at the #+ in the increment at the end of an optimized to:[by:]do: loop. =============== Diff against Compiler-eem.301 =============== Item was changed: ----- Method: BytecodeEncoder>>computeMethodHeaderForNumArgs:numTemps:numLits:primitive: (in category 'method generation') ----- computeMethodHeaderForNumArgs: numArgs numTemps: numTemps numLits: numLits primitive: primitiveIndex + numArgs > 15 ifTrue: + [^self error: 'Cannot compile -- too many arguments']. + numTemps > 63 ifTrue: + [^self error: 'Cannot compile -- too many temporary variables']. + numLits > 65535 ifTrue: + [^self error: 'Cannot compile -- too many literals']. + ^(CompiledMethod headerFlagForEncoder: self) + + (numArgs bitShift: 24) + + (numTemps bitShift: 18) + "+ (largeBit bitShift: 17)" "largeBit gets filled in later" + + (primitiveIndex > 0 ifTrue: [1 bitShift: 16] ifFalse: [0]) + + numLits! - "Compute the compiled method header that encodes the arguments - in the receiver's header format (see CompiledMehtod's class comment)." - self subclassResponsibility! Item was removed: - ----- Method: EncoderForV3>>computeMethodHeaderForNumArgs:numTemps:numLits:primitive: (in category 'method generation') ----- - computeMethodHeaderForNumArgs: numArgs numTemps: numTemps numLits: numLits primitive: primitiveIndex - | primBits | - numTemps > 63 ifTrue: - [^self error: 'Cannot compile -- too many temporary variables']. - numLits > 255 ifTrue: - [^self error: 'Cannot compile -- too many literals']. - primBits := primitiveIndex <= 16r1FF - ifTrue: [primitiveIndex] - ifFalse: "For now the high bit of primitive no. is in the 29th bit of header" - [primitiveIndex > 16r3FF ifTrue: [self error: 'prim num too large']. - (primitiveIndex bitAnd: 16r1FF) + ((primitiveIndex bitAnd: 16r200) bitShift: 19)]. - ^(numArgs bitShift: 24) - + (numTemps bitShift: 18) - "+ (largeBit bitShift: 17)" "largeBit gets filled in later" - + (numLits bitShift: 9) - + primBits! Item was changed: ----- Method: EncoderForV3PlusClosures class>>bytecodeSize: (in category 'instruction stream support') ----- bytecodeSize: bytecode "Answer the number of bytes in the bytecode." bytecode <= 125 ifTrue: [^1]. bytecode >= 176 ifTrue: [^1]. bytecode >= 160 ifTrue: "long jumps" [^2]. bytecode >= 144 ifTrue: "short jumps" [^1]. "extensions" bytecode >= 128 ifTrue: + [^#(2 2 2 2 3 2 2 1 1 1 2 3 3 3 3 4) at: bytecode - 127]. - [^#(2 2 2 2 3 2 2 1 1 1 2 nil 3 3 3 4) at: bytecode - 127]. ^nil! Item was added: + ----- Method: EncoderForV3PlusClosures class>>callPrimitiveCode (in category 'bytecode decoding') ----- + callPrimitiveCode + "139 11101111 iiiiiiii jjjjjjjj Call Primitive #iiiiiiii + (jjjjjjjj * 256)" + ^139! Item was added: + ----- Method: EncoderForV3PlusClosures>>genCallPrimitive: (in category 'bytecode generation') ----- + genCallPrimitive: primitiveIndex + "139 11101111 iiiiiiii jjjjjjjj Call Primitive #iiiiiiii + (jjjjjjjj * 256)" + (primitiveIndex < 1 or: [primitiveIndex > 65535]) ifTrue: + [self outOfRangeError: 'primitive index' index: primitiveIndex range: 1 to: 65535]. + stream + nextPut: 139; + nextPut: (primitiveIndex bitAnd: 255); + nextPut: (primitiveIndex bitShift: -8)! Item was changed: ----- Method: MethodNode>>generate:using: (in category 'code generation') ----- generate: trailer using: aCompiledMethodClass "The receiver is the root of a parse tree. Answer an instance of aCompiledMethodClass. The argument, trailer, is arbitrary but is typically either the reference to the source code that is stored with every CompiledMethod, or an encoding of the method's temporary names." + | primErrNode blkSize nLits locals literals stack header method | - | primErrNode blkSize nLits literals stack method | self generate: trailer using: aCompiledMethodClass ifQuick: [:m | encoder noteBlockExtent: (0 to: 2) hasLocals: arguments. m literalAt: 2 put: encoder associationForClass; properties: properties. ^m]. primErrNode := self primitiveErrorVariableName ifNotNil: [encoder fixTemp: self primitiveErrorVariableName]. + self ensureClosureAnalysisDone. + encoder rootNode: self. "this is for BlockNode>>sizeCodeForClosureValue:" - encoder supportsClosureOpcodes ifTrue: - [self ensureClosureAnalysisDone. - encoder rootNode: self. "this is for BlockNode>>sizeCodeForClosureValue:"]. blkSize := (block sizeCodeForEvaluatedValue: encoder) + + (primitive > 0 + ifTrue: [encoder sizeCallPrimitive: primitive] + ifFalse: [0]) + (primErrNode ifNil: [0] ifNotNil: [primErrNode index: arguments size + temporaries size; sizeCodeForStore: encoder "The VM relies on storeIntoTemp: (129)"]). + locals := arguments, temporaries, (primErrNode ifNil: [#()] ifNotNil: [{primErrNode}]). + encoder noteBlockExtent: block blockExtent hasLocals: locals. + header := encoder computeMethodHeaderForNumArgs: arguments size + numTemps: locals size + numLits: (nLits := (literals := encoder allLiterals) size) + primitive: primitive. + method := trailer + createMethod: blkSize + class: aCompiledMethodClass + header: header. - method := aCompiledMethodClass - newBytes: blkSize - trailerBytes: trailer - nArgs: arguments size - nTemps: (encoder supportsClosureOpcodes - ifTrue: [| locals | - locals := arguments, - temporaries, - (primErrNode - ifNil: [#()] - ifNotNil: [{primErrNode}]). - encoder - noteBlockExtent: block blockExtent - hasLocals: locals. - locals size] - ifFalse: [encoder maxTemp]) - nStack: 0 - nLits: (nLits := (literals := encoder allLiterals) size) - primitive: primitive. - nLits > 255 ifTrue: - [^self error: 'Too many literals referenced']. 1 to: nLits do: [:lit | method literalAt: lit put: (literals at: lit)]. encoder streamToMethod: method. stack := ParseStack new init. + primitive > 0 ifTrue: + [encoder genCallPrimitive: primitive. + primErrNode ifNotNil: + [primErrNode emitCodeForStore: stack encoder: encoder]]. - primErrNode ifNotNil: [primErrNode emitCodeForStore: stack encoder: encoder]. stack position: method numTemps. [block emitCodeForEvaluatedValue: stack encoder: encoder] on: Error "If an attempt is made to write too much code the method will be asked" do: [:ex| "to grow, and the grow attempt will fail in CompiledMethod class>>#new:" ex signalerContext sender method = (CompiledMethod class>>#new:) ifTrue: [^self error: 'Compiler code size discrepancy'] ifFalse: [ex pass]]. stack position ~= (method numTemps + 1) ifTrue: [^self error: 'Compiler stack discrepancy']. encoder methodStreamPosition ~= (method size - trailer size) ifTrue: [^self error: 'Compiler code size discrepancy']. method needsFrameSize: stack size - method numTemps. method properties: properties. ^method!

1 0

The Trunk: Compiler-eem.301.mcz
by commits＠source.squeak.org 19 Jun '15

19 Jun '15

Eliot Miranda uploaded a new version of Compiler to project The Trunk: http://source.squeak.org/trunk/Compiler-eem.301.mcz ==================== Summary ==================== Name: Compiler-eem.301 Author: eem Time: 19 June 2015, 10:01:55.282 am UUID: 2e7f25b0-33b9-4efc-b492-27a58ff8d78f Ancestors: Compiler-eem.300 Fix pc range highlighting when at the #+ in the increment at the end of an optimized to:[by:]do: loop. =============== Diff against Compiler-eem.300 =============== Item was changed: ----- Method: MessageNode>>transformToDo: (in category 'macro transformations') ----- transformToDo: encoder + " var := rcvr. L1: [var <= arg1] Bfp(L2) [block body. var := var + inc] Jmp(L1) L2: " - " var := rcvr. L1: [var <= arg1] Bfp(L2) [block body. var := var + inc] - Jmp(L1) L2: " | limit increment block initStmt test incStmt limitInit blockVar myRange blockRange limitIsAssignedTo | + block := arguments last. "First check for valid arguments" + (block notNil + and: [block isBlockNode + and: [block numberOfArguments = 1 + and: [block firstArgument isVariableReference "As with debugger remote vars"]]]) ifFalse: - ((arguments last isMemberOf: BlockNode) - and: [arguments last numberOfArguments = 1 - and: [arguments last firstArgument isVariableReference "As with debugger remote vars"]]) ifFalse: [^false]. arguments size = 3 ifTrue: [increment := arguments at: 2. (increment isConstantNumber and: [increment literalValue ~= 0]) ifFalse: [^false]] ifFalse: [increment := encoder encodeLiteral: 1]. (limit := arguments at: 1) isVariableReference ifTrue: [limitIsAssignedTo := false. + block nodesDo: - arguments last nodesDo: [:node| (node isAssignmentNode and: [node variable = limit]) ifTrue: [limitIsAssignedTo := true]]. limitIsAssignedTo ifTrue: [^false]]. arguments size < 3 ifTrue: "transform to full form" [selector := SelectorNode new key: #to:by:do: code: #macro]. "Now generate auxiliary structures" myRange := encoder rawSourceRanges at: self ifAbsent: [1 to: 0]. - block := arguments last. blockRange := encoder rawSourceRanges at: block ifAbsent: [1 to: 0]. blockVar := block firstArgument. initStmt := AssignmentNode new variable: blockVar value: receiver. limit isVariableReference | limit isConstantNumber ifTrue: [limitInit := nil] ifFalse: "Need to store limit in a var" [limit := encoder bindBlockArg: blockVar key, 'LimiT' within: block. limit scope: -2. "Already done parsing block; flag so it won't print" block addArgument: limit. limitInit := AssignmentNode new variable: limit value: arguments first]. test := MessageNode new receiver: blockVar selector: (increment key > 0 ifTrue: [#<=] ifFalse: [#>=]) + arguments: {limit} + precedence: precedence + from: encoder - arguments: (Array with: limit) - precedence: precedence from: encoder sourceRange: (myRange first to: blockRange first). incStmt := AssignmentNode new variable: blockVar value: (MessageNode new receiver: blockVar selector: #+ + arguments: {increment} + precedence: precedence + from: encoder + sourceRange: (myRange last to: (myRange last max: blockRange last))) - arguments: (Array with: increment) - precedence: precedence from: encoder) from: encoder + sourceRange: (myRange last to: (myRange last max: blockRange last)). + arguments := {limit. increment. block. initStmt. test. incStmt. limitInit}. - sourceRange: (myRange last to: myRange last). - arguments := (Array with: limit with: increment with: block), - (Array with: initStmt with: test with: incStmt with: limitInit). block noteOptimizedIn: self. ^true!

1 0

Updating Squeak 4.6 stopped working
by marcel.taeumel 18 Jun '15

18 Jun '15

Hi, there! Until recently, source.squeak.org/squeak46 was a redirection to trunk. Now it isn't anymore and my Squeak quits the updating process with a "Unable to retrieve updates from a remote repository." Is it a cache thingy? How to fix it? Best, Marcel -- View this message in context: http://forum.world.st/Updating-Squeak-4-6-stopped-working-tp4832386.html Sent from the Squeak - Dev mailing list archive at Nabble.com.

6 15

Raspberry - GPIO - telephone caller id - Squeak
by Louis LaBrunda 16 Jun '15

16 Jun '15

Hi All, It is my understanding that one can use the GPIO pin(s) of a Raspberry Pi to detect the caller id information of an incoming phone call. Does anyone have any experience with this? Can you give me any pointers? I started out trying to use a modem but the inexpensive USB modems don't work with the current level of caller id info used here in the US. So I would like to do this without a modem. Adding an inexpensive chip or no chip would be great. Thanks in advance. Lou ----------------------------------------------------------- Louis LaBrunda Keystone Software Corp. SkypeMe callto://PhotonDemon mailto:Lou@Keystone-Software.com http://www.Keystone-Software.com

3 12

how to run Cog 3370 on a new Ubuntu 14.04 installation?
by Chris Muller 16 Jun '15

16 Jun '15

I'm embarassed to say, I can't seem to remember how to install 32-bit Squeak on a fresh Ubuntu 14.04 install. Installing the original interpreter VM "squeak-vm" from apt works fine but obviously I need to run Cog and Spur too. Simply untarring them to /usr or /usr/local reports 32-bit libraries are missing. In earlier Ubuntu's, this meant installing ia32-libs, but 14.04 reports that package has been replaced by #(lib32z1 lib32ncurses5 lib32bz2-1.0). But after installing those spur -version reports ----------- /usr/local/bin/../lib/squeak/5.0-3370/squeak: error while loading shared libraries: libuuid.so.1: cannot open shared object file: No such file or directory ----------- Found some complex VM discussions in the list archives with that search string, but not clearly related. Any help is appreciated and I will get it recorded in a wiki page.

2 1

Off topic: An experimental language...
by Göran Krampe 14 Jun '15

14 Jun '15

Hi guys! I recently discovered Rebol (!) and just for fun I started implementing a little experimental language that takes ideas from Rebol and mixes it with Smalltalk and Nim. I call the language Ni - as in "smaller than Nim" and of course with a reference to Monty Python. Its not a very good name, it could be called Smallbol, Nimbol, Rebnitalk or whatever :) Why this post? Because... I want to bounce around the language and its ideas with Smalltalkers that possibly even know Rebol. So I simply want feedback and thoughts - but remember, this is a very early stage :) There is no point in saying "but, I can't even open a file..." - I know you can't, that's just library stuff - I want ideas about the language itself. What is it? The idea is implementing a live language as in the Smalltalk tradition but based on some of the core ideas in Rebol (free form Forth-ish syntax, homoiconic, blocks and series etc) mixed with an object model that feels more realistic for a Smalltalker. And... well, I am not sure where it will go :). So no, its not *a Smalltalk* - but it can probably turn into a language that feels Smalltalkish. But why? Well, the Nim ecosystem is very strong in most areas. Its a nice language to code in (compared to alternatives with similar properties) and you can very easily reuse most everything from the C/C++ eco system. BUT... its not live. Its still in an edit-compile-run-cycle and its statically typed. Ni explores what would happen if we could easily have a fully live dynamically typed homoiconic language embedded in Nim able to mix relatively easily with Nim code. Ni could become a live Smalltalk-like language that finally plays well in the native arena so it can: - Do real multicore native threads - Use C/C++ libraries easily - Run anywhere Nim runs, which is anywhere C compiles - ...and much more. This means its a very *practical* language. Very soon it should be able to do all these things, and quite easily too. There is also a very interesting field of further evolution since Nim offers very interesting opportunities to actually *compile* Ni code into Nim code, and not just interpret. Status I am implementing Ni very simply as a plain recursive descent parser (niparser.nim) in about 350 lines of code, that produces an AST. The AST nodes also double as the core objects of both code and data in Ni. Then it runs in an Interpreter (ni.nim) which is a bit of a work in progress, its about 700 lines of code right now. The interpreter executes the AST directly. The language is an experimental Rebol-ish language but the intention is to push it towards Smalltalk-isms on the higher levels. It also tries to play nice with Nim ideas. Currently Ni is not very useful, its more of a "spike". I haven't added objects yet either, its thus currently a prototype of a functional language. However objects are brewing in my head and the model for them will most likely be a prototype based model with some kind of mechanism for delegation to mixins/traits (objects containing methods only). For code samples there is: https://github.com/gokr/ni/blob/master/hello.ni https://github.com/gokr/ni/blob/master/sample.ni https://github.com/gokr/ni/blob/master/factorial2.ni ..and some tests: https://github.com/gokr/ni/blob/master/nitest.nim Is it fast? Well, before I screwed it all up by trying to make the funcs proper closures (not fully there yet, almost) it could run factorial recursively almost the same speed as Rebol3 which is about 5x slower than Squeak/Cog. That's pretty nippy for a plain AST interpreter. Now its slower though, since I am fiddling with contexts :) but speed isn't a big concern. regards, Göran PS. If you wish to chat with me about Ni, I hang around on IRC as gokr, typocally in #pharo, #squeak and #nim.

1 1

Squeak in Bloomberg's "What is Code?"
by Bert Freudenberg 12 Jun '15

12 Jun '15

"Smalltalk is a vision of the computer as its own, native medium. The whole system can be modified, by anyone. The dominant version is called Squeak (logo: cute mouse), and a modernized version is called Pharo (logo: lighthouse). Both are free and easy to download." They even got a Squeak screenshot: http://www.bloomberg.com/graphics/2015-paul-ford-what-is-code Excellent essay all around! - Bert -

2 1

Re: Mac Squeak binary virtual machine for Squeak 3.10.2
by Trygve Reenskaug 11 Jun '15

11 Jun '15

Hi Chris, I'm sorry to say that your advice didn't work. Worse: The Squeak community has lost a valuable contributor, a prime mover in the patterns and agile communities and the author of several books on OO. My friend wrote: " /I still can’t find a version of Squeak for my Mac that will run Trygve’s current BabyIDE. At this point, even if one appears, it is obvious that my dependence on “the introvert Squeak community” will put me in a much more fragile position than with any of my other concept proofs. It will be extremely difficult to build a future on such fragile foundations./" I came to Xerox PARC and Smalltalk in 1978 where I made my contributions to Smalltalk-80. Since then, I have been working almost exclusively with Smalltalk. My company invested in a VW class library of more than 100,000 lines of Smalltalk code and used it in our consulting. A strong selling point was that our tenders were accompanied by a demo version of the program we offered to deliver. Our library and applications were repeatedly threatened by new versions of VW. The code is now dead; there is no VM that will run our old images. The investment is lost. I hoped Squeak would be better. It isn't. Squeak is less stable than VW ever was. My new programming paradigm, DCI, is supported by BabyIDE that runs under Squeak 3.10. I have ported BabyIDE to 4.5, but there are new bugs caused by differences between 3.10 and 4.5. The result is that I have reverted to 3.10 because it's too much hassle to run after the stream of Squeak releases. I thought Pharo would be better, but their mailing list conversations indicate that they do not understand that developers need a stable foundation for their work. The result is that I too leave Smalltalk and concentrate on other environments. A pity, because I still believe Smalltalk has the potential to become a superior environment for non-professional programmers. I am particularly thinking of children and experts such as computational chemists who use computers in their work. It's very painful, but I am now terminating development work in Squeak leave the Squeak and Pharo mailing lists. I will continue my work in some mainstream language. I have just done some work in Java with Netbeans and I am buying a book on JavaScript. It's heavy going, but better that working for the dustbin. Cheers --Trygve On 31.05.2015 16:52, Trygve Reenskaug wrote: Hi, A friend of mine is doing some experiments using a Mac and my program Baby IDE. BabyIDE is works under Squeak 3.10.2. Is there a binary virtual machine for a current Mac that he can use? On 31.05.2015 17:00, Chris Cunnington wrote: > You need a non-Cog vm. I usually download any Etoys vm. [1] > From there, drag it onto the vm or right click, choose “Open With” and > choose Etoys. > > Chris > > [1] http://squeakland.org/download/

9 11

Daily Commit Log
by commits＠source.squeak.org 10 Jun '15

10 Jun '15

Changes to Trunk (http://source.squeak.org/trunk.html) in the last 24 hours: http://lists.squeakfoundation.org/pipermail/packages/2015-June/008746.html Name: Morphic-cmm.988 Ancestors: Morphic-mt.987 Remove duplicate check. =============================================

1 0

[OT] Bulle qui rulle
by Stéphane Rollandin 10 Jun '15

10 Jun '15

Hello, Here is yet another piece of music entirely composed with Musical Objects for Squeak, aka µO: http://www.zogotounga.net/zik/Bulle%20qui%20rulle.ogg I have uploaded an uninformative but rather cool screenshot of some of the editors used for this project: http://www.zogotounga.net/zik/brworld.png The whole composition is computed from the lower graph. The editor displayed at the top of the world shows the very end of the piece. Stef

4 5

← Newer
1
...
5
6
7
8
9
10
11
...
17
Older →

Jump to page: