{"id":56,"date":"2010-11-30T22:39:09","date_gmt":"2010-12-01T06:39:09","guid":{"rendered":"http:\/\/www.mirandabanda.org\/cogblog\/?p=56"},"modified":"2010-11-30T22:39:09","modified_gmt":"2010-12-01T06:39:09","slug":"sometimes-smalltalk-is-truly-awesome-1","status":"publish","type":"post","link":"http:\/\/www.mirandabanda.org\/cogblog\/2010\/11\/30\/sometimes-smalltalk-is-truly-awesome-1\/","title":{"rendered":"Sometimes Smalltalk is truly awesome #1"},"content":{"rendered":"
<\/head>Occasionally I find myself able to do something in Smalltalk that I think is truly fabulous, not because I’m a fabulous Smalltalk programmer, but because a live reflective pure object system provides such fabulous ease. Today was one such example. I’m working on a new code generator for the Cog VM and it (cough) has a few bugs. In debugging it I needed to see what the correct execution of the following method is for a particular input:<\/p>\n
    Bitmap methods for filing<\/i>\r\n    decompress:<\/b> <\/font>bm<\/font> <\/font>fromByteArray:<\/b> <\/font>ba<\/font> <\/font>at:<\/b> <\/font>index<\/font>\r\n        "Decompress the body of a byteArray encoded by compressToByteArray (qv)...<\/font>\r\n        The format is simply a sequence of run-coded pairs, {N D}*.<\/font>\r\n            N is a run-length * 4 + data code.<\/font>\r\n            D, the data, depends on the data code...<\/font>\r\n                0<\/font>    skip N words, D is absent<\/font>\r\n                    (could be used to skip from one raster line to the next)<\/font>\r\n                1<\/font>    N words with all 4 bytes = D (1 byte)<\/font>\r\n                2<\/font>    N words all = D (4 bytes)<\/font>\r\n                3<\/font>    N words follow in D (4N bytes)<\/font>\r\n            S and N are encoded as follows (see decodeIntFrom:)...<\/font>\r\n                0-223<\/font>    0-223<\/font>\r\n                224-254<\/font>    (0-30)*256 + next byte (0-7935)<\/font>\r\n                255<\/font>        next 4 bytes"<\/font>    \r\n        "NOTE:  If fed with garbage, this routine could read past the end of ba, but it should fail before writing past the ned of bm."<\/font>\r\n        |<\/font> <\/font>i<\/font> <\/font>code<\/font> <\/font>n<\/font> <\/font>anInt<\/font> <\/font>data<\/font> <\/font>end<\/font> <\/font>k<\/font> <\/font>pastEnd<\/font> <\/font>|<\/font>\r\n        <<\/font>primitive:<\/b><\/font> <\/font>'primitiveDecompressFromByteArray'<\/font> <\/font>module:<\/b><\/font> <\/font>'MiscPrimitivePlugin'<\/font>><\/font>\r\n        <<\/font>var:<\/b><\/font> <\/font>#bm<\/font> <\/font>declareC:<\/b><\/font> <\/font>'int *bm'<\/font>><\/font>\r\n        <<\/font>var:<\/b><\/font> <\/font>#ba<\/font> <\/font>declareC:<\/b><\/font> <\/font>'unsigned char *ba'<\/font>><\/font>\r\n        i<\/font> <\/font>:=<\/b> <\/font>index<\/font>.<\/font>  <\/font>"byteArray read index"<\/font>\r\n        end<\/font> <\/font>:=<\/b> <\/font>ba<\/font> <\/font>size<\/font>.<\/font>\r\n        k<\/font> <\/font>:=<\/b> <\/font>1<\/font>.<\/font>  <\/font>"bitmap write index"<\/font>\r\n        pastEnd<\/font> <\/font>:=<\/b> <\/font>bm<\/font> <\/font>size<\/font> <\/font>+<\/font> <\/font>1<\/font>.<\/font>\r\n        [<\/font>i<\/font> <\/font><=<\/font> <\/font>end<\/font>]<\/font> <\/font>whileTrue:<\/font>\r\n            [<\/font>"Decode next run start N"<\/font>\r\n            anInt<\/font> <\/font>:=<\/b> <\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>.<\/font>\r\n            anInt<\/font> <\/font><=<\/font> <\/font>223<\/font> <\/font>ifFalse:<\/font>\r\n                [<\/font>anInt<\/font> <\/font><=<\/font> <\/font>254<\/font>\r\n                    ifTrue:<\/font> <\/font>[<\/font>anInt<\/font> <\/font>:=<\/b> <\/font>(<\/font>anInt<\/font>-<\/font>224<\/font>)<\/font>*<\/font>256<\/font> <\/font>+<\/font> <\/font>(<\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>)<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>]<\/font>\r\n                    ifFalse:<\/font> <\/font>[<\/font>anInt<\/font> <\/font>:=<\/b> <\/font>0<\/font>.<\/font>\r\n                            1<\/font> <\/font>to:<\/font> <\/font>4<\/font> <\/font>do:<\/font> <\/font>[<\/font>:<\/font>j<\/font> <\/font>|<\/font> <\/font>anInt<\/font> <\/font>:=<\/b> <\/font>(<\/font>anInt<\/font> <\/font>bitShift:<\/font> <\/font>8<\/font>)<\/font> <\/font>+<\/font> <\/font>(<\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>)<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>]<\/font>]<\/font>]<\/font>.<\/font>\r\n            n<\/font> <\/font>:=<\/b> <\/font>anInt<\/font> <\/font>>><\/font> <\/font>2<\/font>.<\/font>\r\n            (<\/font>k<\/font> <\/font>+<\/font> <\/font>n<\/font>)<\/font> <\/font>><\/font> <\/font>pastEnd<\/font> <\/font>ifTrue:<\/font> <\/font>[<\/font>^<\/font> <\/font>self<\/font> <\/font>primitiveFail<\/font>]<\/font>.<\/font>\r\n            code<\/font> <\/font>:=<\/b> <\/font>anInt<\/font> <\/font>bitAnd:<\/font> <\/font>3<\/font>.<\/font>\r\n            code<\/font> <\/font>=<\/font> <\/font>0<\/font> <\/font>ifTrue:<\/font> <\/font>[<\/font>"skip"<\/font>]<\/font>.<\/font>\r\n            code<\/font> <\/font>=<\/font> <\/font>1<\/font> <\/font>ifTrue:<\/font> <\/font>[<\/font>"n consecutive words of 4 bytes = the following byte"<\/font>\r\n                            data<\/font> <\/font>:=<\/b> <\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>.<\/font>\r\n                            data<\/font> <\/font>:=<\/b> <\/font>data<\/font> <\/font>bitOr:<\/font> <\/font>(<\/font>data<\/font> <\/font>bitShift:<\/font> <\/font>8<\/font>)<\/font>.<\/font>\r\n                            data<\/font> <\/font>:=<\/b> <\/font>data<\/font> <\/font>bitOr:<\/font> <\/font>(<\/font>data<\/font> <\/font>bitShift:<\/font> <\/font>16<\/font>)<\/font>.<\/font>\r\n                            1<\/font> <\/font>to:<\/font> <\/font>n<\/font> <\/font>do:<\/font> <\/font>[<\/font>:<\/font>j<\/font> <\/font>|<\/font> <\/font>bm<\/font> <\/font>at:<\/font> <\/font>k<\/font> <\/font>put:<\/font> <\/font>data<\/font>.<\/font>  <\/font>k<\/font> <\/font>:=<\/b> <\/font>k<\/font>+<\/font>1<\/font>]<\/font>]<\/font>.<\/font>\r\n            code<\/font> <\/font>=<\/font> <\/font>2<\/font> <\/font>ifTrue:<\/font> <\/font>[<\/font>"n consecutive words = 4 following bytes"<\/font>\r\n                            data<\/font> <\/font>:=<\/b> <\/font>0<\/font>.<\/font>\r\n                            1<\/font> <\/font>to:<\/font> <\/font>4<\/font> <\/font>do:<\/font> <\/font>[<\/font>:<\/font>j<\/font> <\/font>|<\/font> <\/font>data<\/font> <\/font>:=<\/b> <\/font>(<\/font>data<\/font> <\/font>bitShift:<\/font> <\/font>8<\/font>)<\/font> <\/font>bitOr:<\/font> <\/font>(<\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>)<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>]<\/font>.<\/font>\r\n                            1<\/font> <\/font>to:<\/font> <\/font>n<\/font> <\/font>do:<\/font> <\/font>[<\/font>:<\/font>j<\/font> <\/font>|<\/font> <\/font>bm<\/font> <\/font>at:<\/font> <\/font>k<\/font> <\/font>put:<\/font> <\/font>data<\/font>.<\/font>  <\/font>k<\/font> <\/font>:=<\/b> <\/font>k<\/font>+<\/font>1<\/font>]<\/font>]<\/font>.<\/font>\r\n            code<\/font> <\/font>=<\/font> <\/font>3<\/font> <\/font>ifTrue:<\/font> <\/font>[<\/font>"n consecutive words from the data..."<\/font>\r\n                            1<\/font> <\/font>to:<\/font> <\/font>n<\/font> <\/font>do:<\/font>\r\n                                [<\/font>:<\/font>m<\/font> <\/font>|<\/font> <\/font>data<\/font> <\/font>:=<\/b> <\/font>0<\/font>.<\/font>\r\n                                1<\/font> <\/font>to:<\/font> <\/font>4<\/font> <\/font>do:<\/font> <\/font>[<\/font>:<\/font>j<\/font> <\/font>|<\/font> <\/font>data<\/font> <\/font>:=<\/b> <\/font>(<\/font>data<\/font> <\/font>bitShift:<\/font> <\/font>8<\/font>)<\/font> <\/font>bitOr:<\/font> <\/font>(<\/font>ba<\/font> <\/font>at:<\/font> <\/font>i<\/font>)<\/font>.<\/font>  <\/font>i<\/font> <\/font>:=<\/b> <\/font>i<\/font>+<\/font>1<\/font>]<\/font>.<\/font>\r\n                                bm<\/font> <\/font>at:<\/font> <\/font>k<\/font> <\/font>put:<\/font> <\/font>data<\/font>.<\/font>  <\/font>k<\/font> <\/font>:=<\/b> <\/font>k<\/font>+<\/font>1<\/font>]<\/font>]<\/font>]<\/font><\/pre>\nFrom my VM simulator I printed out the ByteArray that was being decompressed incorrectly by the jitted code generated by my new code generator (the new code was invoking primitiveFail in the above).  So now I wanted to trace through execution of the above in the debugger so I could see what the values of local variables should be in a correct execution to identify the location of the error as opposed to the location of its symptom.  So I naïvely debug evaluated the following:<\/p>\n
    Bitmap decompressFromByteArray: #[ 16r10 16r27 16rC0 16r0 16r0 16r0 16rE0 16r0 16r0 16r0 16rF0 16r0 16r0 16r0 16rF8 16r0\r\n\t        16r0 16r0 16rFC 16r0 16r0 16r0 16rFE 16r0 16r0 16r0 16rFF 16r0 16r0 16r0 16rFF 16r80\r\n\t        16r0 16r0 16rFF 16r0 16r0 16r0 16rA 16rFE 16r0 16r0 16r0 16rB 16rCF 16r0 16r0 16r0\r\n\t        16rF 16r0 16r0 16r0 16rA 16r7 16r80 16r0 16r0 16r7 16r3 16r0 16r0 16r0]<\/pre>\nand stepped into the activation of the following method:<\/p>\n
    Bitmap class methods for instance creation<\/i>\r\n<\/b>    decompressFromByteArray:<\/b> <\/font>byteArray<\/font>\r\n<\/font>        |<\/font> <\/font>s<\/font> <\/font>bitmap<\/font> <\/font>size<\/font> <\/font>|<\/font>\r\n<\/font>        s<\/font> <\/font>:=<\/b> <\/font>ReadStream<\/font> <\/font>on:<\/font> <\/font>byteArray<\/font>.<\/font>\r\n<\/font>        size<\/font> <\/font>:=<\/b> <\/font>self<\/font> <\/font>decodeIntFrom:<\/font> <\/font>s<\/font>.<\/font>\r\n<\/font>        bitmap<\/font> <\/font>:=<\/b> <\/font>self<\/font> <\/font>new:<\/font> <\/font>size<\/font>.<\/font>\r\n<\/font>        bitmap<\/font> <\/font>decompress:<\/font> <\/font>bitmap<\/font> <\/font>fromByteArray:<\/font> <\/font>byteArray<\/font> <\/font>at:<\/font> <\/font>s<\/font> <\/font>position<\/font>+<\/font>1<\/font>.<\/font>\r\n<\/font>        ^<\/font> <\/font>bitmap<\/font><\/pre>\n
\n<\/font>
\nSo far so good.  But when I tried to step into the Bitmap>>#decompress:fromByteArray:at: method the debugger of course evaluated the primitive that is in the VM, primitiveDecompressFromByteArray (which just happens to get generated from the above by the VMMaker, but that’s a different story).  What the debugger didn’t do, quite correctly, is evaluate the non-primitive method, starting at  i<\/font> <\/font>:=<\/b> <\/font>index<\/font>.<\/font>  <\/font>"byteArray read index"<\/font>, the actual Smalltalk code whose execution I wanted to observe.<\/p>\n
This is where things turn awesome.  Since Smalltalk has first-class activation records I can actually create an activation of the above method poised to start execution at the first bytecode, hence after<\/i> the evaluation of the primitive.  Here’s how.  In the debugger window I evaluated<\/p>\n
    thisContext swapSender: (MethodContext\r\n                                            sender: ThisContext\r\n                                            receiver: bitmap\r\n                                            method: (Bitmap>>#decompress:fromByteArray:at:)\r\n                                            arguments: {bitmap. byteArray. s position + 1 }).\r\n    self halt<\/pre>\nWhat’s going on here?  First, the debugger allows me to access the local variables of the activation I’m debugging, from within a script evaluated in the debugger (neat!).   If you look at the script in the debugger you see it translated into:<\/p>\n
    DoItIn:<\/b> <\/font>ThisContext<\/font> <\/font>\r\n        thisContext<\/font>\r\n            swapSender:<\/font> <\/font>(<\/font>MethodContext<\/font>\r\n                    sender:<\/font> <\/font>ThisContext<\/font>\r\n                    receiver:<\/font> <\/font>(<\/font>ThisContext<\/font> <\/font>namedTempAt:<\/font> <\/font>3<\/font>)<\/font>\r\n                    method:<\/font> <\/font>Bitmap<\/font> <\/font>>><\/font> <\/font>#decompress:fromByteArray:at:<\/font>\r\n                    arguments:<\/font> <\/font>{<\/font>ThisContext<\/font> <\/font>namedTempAt:<\/font> <\/font>3<\/font>.<\/font> <\/font>ThisContext<\/font> <\/font>namedTempAt:<\/font> <\/font>1<\/font>.<\/font> <\/font>(<\/font>ThisContext<\/font> <\/font>namedTempAt:<\/font> <\/font>2<\/font>)<\/font> <\/font>position<\/font> <\/font>+<\/font> <\/font>1<\/font>}<\/font>)<\/font>.<\/font>\r\n        ^<\/font> <\/font>self<\/font> <\/font>halt<\/font><\/pre>\nBut the clever bit is what the script does<\/i>.  ThisContext with capitals is the debugger’s name for the activation of decompressFromByteArray: I had stepped into; its simply the argument to the DoItIn:<\/b> method created to run my script.  thisContext without capitals is the name for the current activation (any activation) and so refers to the activation of DoItIn:<\/b>.  The (MethodContext sender:…) expression creates an activation record on the method (Bitmap>>#decompress:fromByteArray:at:), and initializes the activation at the start of the bytecodes for the method, effectively after<\/i> the primitive it contains.  The thisContext swapSender: … expression substitutes this activation as the one to return to from thisContext.  i.e. my script "thisContext swapSender: (MethodContext…" etc will now return into the activation of (Bitmap>>#decompress:fromByteArray:at:) I just created instead of back to the compiler that compiled and evaluated the script.  The "self halt." brings up the debugger.  So now I simply step out of the halt, into my script, stepping until it returns into the method I wanted to evaluate.  Awesome!<\/body><\/html><\/p>\n
 \t \t\t \t\t<\/a> \t\t  <\/span> \t\tSend article as PDF<\/span> \t\t  <\/span> \t\t \t\t \t<\/form> <\/div>","protected":false},"excerpt":{"rendered":"Occasionally I find myself able to do something in Smalltalk that I think is truly fabulous, not because I’m a fabulous Smalltalk programmer, but because a live reflective pure object system provides such fabulous ease. Today was one such example. I’m working on a new code generator for the Cog VM and it (cough) has […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[3],"tags":[],"_links":{"self":[{"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/posts\/56"}],"collection":[{"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/comments?post=56"}],"version-history":[{"count":27,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/posts\/56\/revisions"}],"predecessor-version":[{"id":83,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/posts\/56\/revisions\/83"}],"wp:attachment":[{"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/media?parent=56"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/categories?post=56"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.mirandabanda.org\/cogblog\/wp-json\/wp\/v2\/tags?post=56"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}