June 2012 - Pharo-dev - lists.pharo.org

Re: [Pharo-project] Worskpace question

by Sean P. DeNigris

Hilaire Fernandes wrote > > To get the animation, you have to enclose the loop in a forked process, > but it is inelegant: > ... > [1 to: 300 do: [:x | > m extent: x@300. > (Delay forMilliseconds: 10) wait. > ]. > m delete] fork. > Hilaire, why don't you like this? It seems very straightforward. You're doing a long-running operation and you want another thread to run concurrently. Fork seems like the natural choice. The only other issue is #addDeferredUIMessage: which Guille mentioned. I'm unclear exactly what kinds of Morphic interaction require it and haven't been able to get a clear answer. Your sample block doesn't seem to hurt morphic, but if you experience weirdness (like red X's), that's probably where to look. Sean -- View this message in context: http://forum.world.st/Worskpace-question-tp4635656p4635943.html Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

June 21, 2012

[Pharo-project] Pharo-2.0-Tests Â» 32,win - Build # 143 - Still Failing!

by jenkins-pharo.ci.inria.fr＠jenkins-server.lille.inria.fr

June 21, 2012

Re: [Pharo-project] badDirectoryPath

by Camillo Bruni

I would assume mostly due to performance.... this #badDirectoryPath happens quite often, hence it is much faster to do a simple check On 2012-06-21, at 16:32, Esteban Lorenzano wrote: > that was changed not much time ago, and... while I don't remember exactly while it was like that, I remember there was a good reason for that > > On Jun 21, 2012, at 4:16 PM, Sean P. DeNigris wrote: > >> lookupDirectory: fullPath filename: fileName >> <primitive: 'primitiveDirectoryEntry' module: 'FilePlugin'> >> ^ #badDirectoryPath >> >> Why are we returning #badDirectoryPath instead of signaling an exception, >> maybe FileDoesNotExist? >> >> -- >> View this message in context: http://forum.world.st/badDirectoryPath-tp4635913.html >> Sent from the Pharo Smalltalk mailing list archive at Nabble.com. >> > >

June 21, 2012

Re: [Pharo-project] red cross during updates

by Sean P. DeNigris

I think I fixed it. See Issue 6099: Deprecate #value: for system progress (was red cross during updates) http://code.google.com/p/pharo/issues/detail?id=6099 -- View this message in context: http://forum.world.st/red-cross-during-updates-tp4635739p4635939.html Sent from the Pharo Smalltalk mailing list archive at Nabble.com.

June 21, 2012

[Pharo-project] Pharo-2.0-Tests Â» 32,win - Build # 142 - Still Failing!

by jenkins-pharo.ci.inria.fr＠jenkins-server.lille.inria.fr

June 21, 2012

[Pharo-project] Pharo-2.0-Tests Â» 32,win - Build # 141 - Still Failing!

by jenkins-pharo.ci.inria.fr＠jenkins-server.lille.inria.fr

June 21, 2012

Re: [Pharo-project] Fastest utf-8 encoder contest

by Igor Stasenko

On 21 June 2012 16:59, Henrik Sperre Johansen <henrik.s.johansen(a)veloxit.no> wrote: > Btw, if you want to optimize for shorter-encodings, couldn't you do > asm > Â Â cmp: asm EAX with: 16r80; > Â Â jl: oneByte; > Â Â cmp: asm EAX with: 16r800; > Â Â jl: twoBytes; > Â Â cmp: asm EAX with:16r1000; > Â Â jl: threeBytes; > Â Â label: fourBytes; > Â Â ... > Â Â jmp end; > Â Â label: threeBytes; > Â Â ... > Â Â jmp end; > Â Â label: twoBytes; > Â Â ... > Â Â jmp: end; > Â Â label: oneByte; > > Â Â label: end > > ie only one cmp/jmp for 1-byte chars (1 less jump than current), > and n cmp/2 jmp's for n > 1. > Haha, nice trick. > Or do the conditional jumps relying on last instruction stall enough that it > doesn't really matter? > Can't say.. benchmarks should demonstrate that, but guess 1 less jump speedup will be at the level of noise. I'm not even sure that doing 4-byte aligned memory writes will get over noise level :) > Cheers, > Henry > -- Best regards, Igor Stasenko.

June 21, 2012

[Pharo-project] Pharo-2.0-Tests Â» 32,win - Build # 140 - Failure!

by jenkins-pharo.ci.inria.fr＠jenkins-server.lille.inria.fr

June 21, 2012

[Pharo-project] SimplifiedChineseEnvironment>>leadingChar

by Hilaire Fernandes

Hello, I am curious to know what is the right fix to this issue when the locale is chinese: http://code.google.com/p/pharo/issues/detail?id=6117 Thanks Hilaire -- Dr. Geo -- http://www.drgeo.eu

June 21, 2012

Re: [Pharo-project] Fastest utf-8 encoder contest

by Henrik Sperre Johansen

Btw, if you want to optimize for shorter-encodings, couldn't you do asm cmp: asm EAX with: 16r80; jl: oneByte; cmp: asm EAX with: 16r800; jl: twoBytes; cmp: asm EAX with:16r1000; jl: threeBytes; label: fourBytes; ... jmp end; label: threeBytes; ... jmp end; label: twoBytes; ... jmp: end; label: oneByte; label: end ie only one cmp/jmp for 1-byte chars (1 less jump than current), and n cmp/2 jmp's for n > 1. Or do the conditional jumps relying on last instruction stall enough that it doesn't really matter? Cheers, Henry On 13.06.2012 04:44, Igor Stasenko wrote: > Hi, hardcore hackers. > please take a look at the code and tell if it can be improved. > > The AsmJit snippet below transforms an unicode integer value > to 1..4-byte sequence of utf-8 > > then the outer piece of code (which is not yet written) will > accumulate the results of this snippet > to do a memory-aligned (4byte) writes.. > like that, if 4 unicode characters can be encoded into 4 utf-8 bytes > (which mostly the case for latin-1 char range), then there will be > 4 memory reads (to read four 32-bit unicode values) but only single > memory write (to write four 8-bit utf-8 encoded values). > > The idea is to make utf-8 encoding speed close to memory copying speed :) > > convertUnicode: asm > " > input: > - EAX 32-bit unicode value to convert > > output: > - EAX - utf-8 encoded character (in little-endian byte order) max 4 bytes > - EDX - number of encoded bytes > " > | moreThanOne moreThanTwo moreThanThree end | > > moreThanOne := asm uniqueLabelName: 'moreThanOne'. > moreThanTwo := asm uniqueLabelName: 'moreThanTwo'. > moreThanThree := asm uniqueLabelName: 'moreThanThree'. > end := asm uniqueLabelName: 'end'. > > asm > cmp: asm EAX with: 16r7F; > jg: moreThanOne; > "one byte" > mov: 1 to: asm EDX; > jmp: end; > label: moreThanOne; > cmp: asm EAX with: 16r7FF; > jg: moreThanTwo; > "two bytes 80 .. 7FF" > " AH AL " > "00000aaa aabbbbbb" > > "110aaaaa 10bbbbbb > AL AH (little endian order) > " > shr: asm EAX with: 2; > shl: asm AL with: 2; > or: asm AX with: 2r1100000010000000; > xchg: asm AL with: asm AH; > mov: 2 to: asm EDX; > jmp: end; > label: moreThanTwo; > cmp: asm EAX with: 16rFFFF; > jg: moreThanThree; > "three bytes 800 ... FFFF" > " AH AL " > "aaaabbbb bbcccccc" > " => 1110aaaa 10bbbbbb 10cccccc" > shl: asm EAX with: 4; > shr: asm AX with: 2; > shr: asm AL with: 2; > " EAX = ...aaaa xxbbbbbb xxcccccc " > or: asm EAX with: 2r111000001000000010000000; "16rE08080" > shl: asm EAX with: 8; > bswap: asm EAX; > mov: 3 to: asm EDX; > jmp: end; > "four bytes 1000 ... 10FFFF" > " AH AL " > "000aaabb bbbbcccc ccdddddd" > "=> 11110aaa 10bbbbbb 10cccccc 10dddddd" > mov: asm EAX to: asm EDX; > shl: asm EAX with: 4; > shr: asm AX with: 2; > shr: asm AL with: 2; > " EAX = 0000000a aabbbbbb xxcccccc xxdddddd " > and: asm EAX with: 16r3F3F3F; > bswap: asm EAX; > shr: asm EDX with: 18; "6*3" > or: asm DL with: 16r11110000; > mov: asm DL to: asm AL; > mov: 4 to: asm EDX; > label: end > >

June 21, 2012