- Pharo-dev - lists.pharo.org

Some references to transcript should be changed into File stdout

by stepharo

Hi I have the impression that some references to Transcript should be rewritten as File stdout For example DummyUIManager>>unhandledErrorDefaultAction: anException Transcript show: '*** EXCEPTION ***'; cr. Transcript show: anException; cr. Transcript show: (thisContext stack first: (20 min: thisContext stack size)); cr. anException isResumable ifTrue: [ anException resume ] Stef

Sept. 23, 2015

Position for a PhD student on Hot software update

by Noury Bouraqadi

Hi, As part of the ongoing partnership between INRIA and Mines Douai, we have a funding for a PhD student to work on hot software update. You'll find below a description of the position. Best, Noury â Prof. Noury Bouraqadi Ecole des Mines de Douai http://car.mines-douai.fr/noury --- CONTACT Prof. S. Ducasse, stephane.ducasse AT inria.fr, INRIA, France Prof. N. Bouraqadi, noury.bouraqadi AT mines-douai.fr, Mines Douai, France Dr. M. Denker, marcus.denker AT inria.fr, INRIA, France Dr. L. Fabresse, luc.fabresse AT mines-douai.fr, Mines Douai, France CONTEXT Building next generation systems that can not be stopped is an interesting challenge for industry. Indded, when we need to replace current software for an upgrade or a bug fix, it is mandatory to stop the old running version, make the change and then restart the new version. However, there are situations where a such process is either impossible or at least undesirable because of the costs resulting from a shutdown (e.g production line, robot on mars, ...). We believe that software built with from the beginning the property to work indefinetly, will be by construction more robust to change, intrinsicly capable of evolution and more agile than traditional software. Dynamic languages such as CLOS, Ruby, Python, and Pharo provide a support for updates that only involve code change. Even if they are more advanced compared to other languages, their solutions ar mainly ad hoc and deserve being rethought. We believe it is important to have a mechanism and an infrastructure that allow adaptive and safe software updates. By "safe" we mean that this solution should support different conditions, such as a series of updates performed in the wrong sequence. In such situations, instances of changed classes should migrate in a satisfactory fashion. Safety also means verifying loaded changes. This means that changes should be checked and possibly rejected if they make the system instable or if they introduce errors. SCINTIFIC GOALS The questions we would like to target in this PhD are the following: - What is a good inftrastructure to support a dynamic and reliable code update? Do we need to analyse changes? - Does an infrastructure based on isolated environments is enough to ensure update safety? What atomicity level is required? - Which meta-object protocol is required to migrate objets? - Would it be interesting to have different version of a given class or package for the same software? BIBLIOGRAPHY . D. Duggan. Type-based hot swapping of running modules. In Intl. Conf. on Functional Programming, pages 62â73, 2001. . M. Denker, T. GÃ®rba, A. Lienhard, O. Nierstrasz, L. Renggli, and P. Zumkehr. Encapsulating and exploiting change with Changeboxes. In Proc. Int. Conference on Dynamic Languages, pages 25â49. ACM Digital Lib., 2007. . M. Dmitriev. Safe Class and Data Evolution in Large and Long-Lived Java Applications. PhD thesis, University of Glasgow, 2001. . M. Hicks and S. Nettles. Dynamic software updating. ACM Transactions on Programming Languages and Systems, 27(6):1049â1096, nov 2005. . J. Kephart. Research challenges of autonomic computing. In ICSE 2005, pages 15â22, may 2005. . G. Kniesel. Type-safe delegation for run-time component adaptation. In R. Guerraoui, editor, Proceedings ECOOP â99, volume 1628 of LNCS, pages 351â366, Lisbon, Portugal, June 1999. Springer-Verlag. . I. Neamtiu, M. W. Hicks, G. Stoyle, and M. Oriol. Practical dynamic software updating for c. In PLDI, pages 72â83, 2006. . G Polito, StÃ©phane Ducasse, N Bouraqadi, L Fabresse, M Mattone. Virtualization Support for Dynamic Core Library Update. Onward!, Oct 2015, Pittsburg, USA. . X. Ren, F. Shah, F. Tip, B. Ryder, and O. Chesley. Chianti: A tool for change impact analysis of Java programs. In Proceedings of OOPSLA 2004), pages 432â448, 2004.

Sept. 23, 2015

reviews needed (collection of rubric fixes)

by Nicolai Hess

Some reviews needed for latest fixes I added to Rubric repository: Issue 16622 Merge latest rubric fixes(and subcases). btw the monkey does not check the issue 16622 (all subcases are resolved and a configuration is provided, did I miss something?) nicolai

Sept. 23, 2015

- 250 * 1.5 is not the same as 250 * 1.5

by stepharo

Hi guys I think that this is quite bad that - 250 * 1.5 returns -2.25 while -250 * 1.5 return 375 stef

Sept. 23, 2015

Re: [Pharo-dev] ConfigurationOfRoassal2 broken

by Alexandre Bergel

> Can anyone explain ConfigurationOfRoassal2? Not me :-) > Where does that work? I have just added: development: spec <symbolicVersion: #'development'> spec for: #'common' version: '1.4-baseline'. spec for: #'pharo4.x' version: '1.5-baseline'. spec for: #'pharo5.x' version: '1.6-baselineâ. stable: spec <symbolicVersion: #'stable'> spec for: #'common' version: '1.11'. spec for: #'pharo4.x' version: '1.13'. spec for: #'pharo3.x' version: '1.6'. spec for: #'pharo5.x' version: '1.16'. I have no idea whether this is sufficient or not. Alexandre > > stable: spec > <symbolicVersion: #'stable'> > > spec for: #'common' version: '1.11'. > spec for: #'pharo4.x' version: '1.13'. > spec for: #'pharo3.x' version: '1.6'. > > development: spec > <symbolicVersion: #'development'> > > spec for: #'common' version: '1.4-baseline'. > spec for: #'pharo4.x' version: '1.5-baseline'. > > > > -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

Sept. 22, 2015

Re: [Pharo-dev] Help with RBTransformationRule needed!

by Thierry Goubier

Le 22/09/2015 19:14, Jan Vrany a Ã©crit : > >> RBTransformationRule (you need to activate that verificationBlock >> when >> you create your rewriter). > > Yes, and this is the tricky bit :-) Because there's no guarantee that > this block is functional. For example, it may access context ivar > which, by the time UI is retrieving intervals is already nilled out > or even filled again with some other unrelated context if you're > reusing rule instances (but if not, you may run into performance > problems...) I'm not sure I see the issue. That block is evaluated just when you match, before the rewrite. So, at that point, everything is valid. You're right, the node may not be valid anymore after the rewrite if I record the node. But if I record a copy of that source and the index (you ask complete source to that node and startPosition / stopPosition) then you're set for highlighting. Thierry

Sept. 22, 2015

Re: [Pharo-dev] [Reflectivity] Slides ESUG talk

by Marcus Denker

> On 22 Sep 2015, at 17:23, roberto.minelli(a)usi.ch wrote: > > Hi Marcus, > > I am finally playing with Reflectivity. In the first place, thanks a lot for this contribution! > > I am wondering what is the âcorrectâ way to âremoveâ a MetaLink. Is it enough to call #uninstall on the MetaLink Yes! > or should I also recompile the class/method where the link is installed? If you recompile, you remove all links. (even the ones others installed). In the tests I do that often to be sure everything is clean. > I spotted a problem with the control #after. If you try to pass #arguments to the meta, an error is returned. To reproduce: http://ws.stfx.eu/ONC4K9KQRTNQ > > Is this behavior somewhat desired, or is a bug? > Bug, I will fix it... > Dictionary>>errorKeyNotFound: > [ self errorKeyNotFound: key ] in Dictionary>>at: in Block: [ self errorKeyNotFound: key ] > Dictionary>>at:ifAbsent: > Dictionary>>at: > IRPushClosureCopy>>indexForVarNamed: > IRTranslatorV2>>visitPushTemp: > IRPushTemp>>accept: > IRTranslatorV2(IRVisitor)>>visitNode: > IRTranslatorV2>>visitInstruction: > [ :instr | self visitInstruction: instr ] in IRTranslatorV2(IRVisitor)>>visitSequence: in Block: [ :instr | self visitInstruction: instr ] > OrderedCollection>>do: > IRSequence>>do: > IRTranslatorV2(IRVisitor)>>visitSequence: > IRTranslatorV2>>visitSequence: > IRSequence>>accept: > IRTranslatorV2(IRVisitor)>>visitNode: > [ :each | self visitNode: each ] in IRTranslatorV2(IRVisitor)>>visitNodes: in Block: [ :each | self visitNode: each ] > SortedCollection(OrderedCollection)>>do: > IRTranslatorV2(IRVisitor)>>visitNodes: > IRTranslatorV2>>visitSequences: > IRTranslatorV2>>visitMethod: > IRMethod>>accept: > IRTranslatorV2(IRVisitor)>>visitNode: > IRMethod>>generate: > IRMethod>>compiledMethodWith: > RBMethodNode>>generate: > ReflectiveMethod>>recompileAST > ReflectiveMethod>>compileAndInstallCompiledMethod > ReflectiveMethod>>run:with:in: > UndefinedObject>>DoIt > > Cheers, > Roberto > >> On 04 Sep 2015, at 14:16, Marcus Denker <marcus.denker(a)inria.fr> wrote: >> >> Hi Roberto, >> >> Very good! I am now working on #after for methods+sequence. *And* primitives... this should all be committed early next week. >> >> After that, I need to actually use it to find remaining problems, so this is very good that you will start now. >> >> Marcus >> >> On Thu, Sep 3, 2015 at 2:50 PM, roberto.minelli(a)usi.ch <roberto.minelli(a)usi.ch> wrote: >> Very good talk Marcus. >> >> In the next weeks I will finally have some time to try Reflectivity out! >> >> Thanks a lot for all your effort! >> >> Cheers, >> Roberto >> >>> On 31 Jul 2015, at 13:23, Marcus Denker <marcus.denker(a)inria.fr> wrote: >>> >>> >>>> On 15 Jul 2015, at 10:15, Marcus Denker <marcus.denker(a)inria.fr> wrote: >>>> >>>> Hi, >>>> >>>> the slides for my ESUG talk are online: >>>> >>>> http://www.slideshare.net/MarcusDenker/reflection-in-pharo5 >>>> >>>> >>> >>> Video is online, too: >>> >>> https://www.youtube.com/watch?v=Ik539CtjtTI >>> >>> >>> >>> Marcus >>> >> >> >> >> >> -- >> -- >> Marcus Denker -- denker(a)acm.org >> http://www.marcusdenker.de >

Sept. 22, 2015

Re: [Pharo-dev] Help with RBTransformationRule needed!

by Jan Vrany

> RBTransformationRule (you need to activate that verificationBlock > when > you create your rewriter). Yes, and this is the tricky bit :-) Because there's no guarantee that this block is functional. For example, it may access context ivar which, by the time UI is retrieving intervals is already nilled out or even filled again with some other unrelated context if you're reusing rule instances (but if not, you may run into performance problems...)

Sept. 22, 2015

Re: [Pharo-dev] Help with RBTransformationRule needed!

by Thierry Goubier

Le 22/09/2015 17:56, Yuriy Tymchuk a Ã©crit : > Hi everyone, > > I need someone who knows how RBParseTreeRewriter & co. work. May of > quality rules are implemented as rewrite rules which is cool. But > they donât report the interval in source code which can be > highlighted to help with understanding of the issue. > > Nowâ¦ the check happens in RBTransformationRule>>#checkMethod:. Is it > possible to obtain the matched string there? Because in that case we > can get highlighting working which will be very useful. Silly me. It's so simple: | rw | rw := RBParseTreeRewriter new. rw replace: ' `#a `{:aNode | aNode value isCharacter}' with: '`#a newMessage' when: [:n | n logCr. false]. Use the when: block argument to trace all the matched nodes. Once you have the nodes, you can highlight them. Thierry > Cheers! Uko >

Sept. 22, 2015

Re: [Pharo-dev] Help with RBTransformationRule needed!

by Thierry Goubier

Le 22/09/2015 18:26, Jan Vrany a Ã©crit : > Yeah, I remember this is a pain. When I did years ago what > you're doing now with QA, I ended up practicing black magic, > sacrificing chickens and other things you'd better not to know. > > IIRC, the trick is to turn rewrite rules in ParseTreeEnvironment > into search rules and then run the searches. Now this is tricky > as these rules quite often refers to blocks, which then refers to outer > contexts and you need these blocks do something different now (report > nodes rather then transform stuff). This is the main problem. I think what you can simply do is trap the place where the rewrites are done, in RBStringReplaceRule. There is a verificationBlock instance variable which sees every match node, as far as I can read through the code, and this would change a bit the interface to call the rewrites in RBTransformationRule (you need to activate that verificationBlock when you create your rewriter). As far as I can see, if verificationBlock print its argument to the Transcript and returns false, your rewriter becomes a searcher which print every match to the transcript. Thierry > If you have the guts, you may find the code here: > > https://bitbucket.org/janvrany/stx-goodies-smallsense > and here: > http://swing.fit.cvut.cz/hg/stx.goodies.refactoryBrowser/ > > (alternatively, downlaod https://swing.fit.cvut.cz/projects/stx-jv/ > and browse the code in Smalltalk browser). > > You may want to trace the code starting from > ParseTreeEnvironment>>selectionIntervalsForSource:tree:do: > RBParseTreeRule>>copyMatchDo: and implementors is also > worth mentioning. > > After doing this, I concluded that SmallLint as it's now is not > well designed for this task and it would need a significant > refactoring. However, as always, I was never given time to do it. > > HTH, Jan > > > On Tue, 2015-09-22 at 17:56 +0200, Yuriy Tymchuk wrote: >> Hi everyone, >> >> I need someone who knows how RBParseTreeRewriter & co. work. May of >> quality rules are implemented as rewrite rules which is cool. But >> they donât report the interval in source code which can be >> highlighted to help with understanding of the issue. >> >> Nowâ¦ the check happens in RBTransformationRule>>#checkMethod:. Is it >> possible to obtain the matched string there? Because in that case we >> can get highlighting working which will be very useful. >> >> Cheers! >> Uko >> > >

Sept. 22, 2015