Vm-dev February 2017

vm-dev@lists.squeakfoundation.org

24 participants
79 discussions

StackInterp/Cog>>transferTo: - assertValidExecutionPointe:r:s differences
by Ben Coman 06 May '18

06 May '18

Just curious about the difference in instructionPointer between these two... StackInterpreter>>transferTo: self assertValidExecutionPointe: instructionPointer + 1 r: framePointer s: stackPointer. CoIntepreter>>transferTo:from: self assertValidExecutionPointe: instructionPointer r: framePointer s: stackPointer. cheers -ben

3 8

Re: [Vm-dev] Freeze after Morph Activity
by Dan Norton 15 May '17

15 May '17

Hi Levente, I directed stdout to a file and prior to the freeze, did: pkill -USR1 -n -x squeak a few times and noticed "stack overflow" mentioned twice. After the freeze, pkill sent nothing else to stdout. Maybe something in stderr? I'll try again and concatenate stderr to the end of stdout. Meanwhile, the file with the stack overflows is attached. Thanks for the help. - Dan On Sat, 28 Jan 2017,*Levente Uzonyi* wrote: >Hi Dan, >You can send the USR1 signal to the VM process to make it write some debug >information to the console. With this information you can easily tell >what's happening. I suspect it's stuck in a long GC. >Levente >On Fri, 27 Jan 2017, Dan Norton wrote: >>//>>/On Debian8, CogSpur64 5.0-201612221637, Cuis 5.0 3043... />>//>>/after lots of user interaction, views opening and closing, and />>/animation, the image becomes unresponsive. Cmd+. does nothing and the />>/clock in the Cuis taskbar no longer updates. The length of time to />>/produce this varies from 5 to 20 minutes. />>//>>/There seems to be no dump and no log. 'Smalltalk garbageCollectMost' />>/reports 25550736 to 30517872 over 34 samples. />>//>>/Sorry to be so vague. This has occurred with several images - sometimes />>/scrolling through a senders list, or stepping through a debugger, but />>/repeatably with one of my images. I can supply this image, warmed up so />>/that it might not take so long to reproduce the problem if you would />>/like. Or give me a hint as to how to narrow down the problem /

10 65

Amazing ARM simulator experience
by Eliot Miranda 03 May '17

03 May '17

Hi All, just had to tell people about this morning's experience using the ARM simulator. I've been building Smalltalk VMs since 1983, so 33 years. My first on the Three Rivers PERQ was dog slow. My undergraduate project was done the the National Semiconductor 32016 based Whitechapel Computer Works workstation and its and 32032-based successor. This morning I was revamping register management in Cog's ARMv5/v6 back end, making more registers available by using two of the C argument registers for two of registers the Cogit assigns to various fixed tasks, and using store and load multiple instructions to save and restore concisely the registers around calls into the runtime. Remember the architecture here. The simulator generates ARM machine code into the ByteArray that re[resents the address space, holding all of generated machine code, a small C stack, and the Smalltalk heap. A plugin, derived from Gdb's ARM simulator written in C, interprets that machine code, running for a couple of milliseconds at a time in a loop, applying breakpoint calculations, and asserts on every call into the run-time, and that calls into the run-time and accesses of variables in the simulator is done by using illegal addresses in the generated machine code. Each illegal access causes the Gdb-derived machine code interpreter to return with an error, this error is turned into an exception, the handler for which maps the specific illegal address into a variable or message selector, accesses the variable or activates the message selector, providing the result, and allowing the execution to continue. In changing the register management I had a test case that worked, an image that prompted for an expression ands evaluated it, which worked both in the simulator and with the generated VM. But the real VM, crashed when used on a proper image. So to debug I started launching the real interactive image in the simulator. Well, the amazing experience is that that image, whose machine code is being _interpreted by a C program_ feels /faster/ than my 32016 based implementation back in 1984-ish. Quite amazing. I can open windows, type text, access source code (was playing with Message Names) etc. It's sluggish, but usable. Amazing how fast modern machines are. All on my 2012 vintage 2.2 Ghz Core i7 MacBook Pro. I'm blown away :-) _,,,^..^,,,_ best, Eliot

5 7

Unix heartbeat thread vs itimer
by Guillermo Polito 12 Apr '17

12 Apr '17

Hi, I was checking the code in sqUnixHeartbeat.c to see how the heartbeat thread/itimer worked. It somehow bothers me that there are different compiled artifacts, one per option. What do you think about having a VM that manages that as an argument provided when we launch the VM? This would add some flexibility that we don't have right now because we make the decision at compile time. The code in sqUnixHeartbeat.c is not a lot nor very complex, it should not be difficult to do... Also, what would be the drawbacks besides an increase on the vm size? Guille

11 35

Re: [Vm-dev] [Pharo-dev] Problem with OSSubprocess / signals / heartbeat ?
by Guille Polito 02 Apr '17

02 Apr '17

Ok, so following a bit on this. I'll summarize some of our findings, some of them maybe obvious for some people in this list. I saw that there are actually two different kind of VMs for *nix [1] : - threaded heartbeat - itimer + signal heartbeat Specially, I'd like to cite the following paragraph for the lazy: A distinction on linux is between VMs with an itimer hearbeat or a threaded heartbeat. VMs with an itimer hearbeat use setitimer to deliver a SIGALRM signal at regular intervals to interrupt the VM to check for events. These signals can be troublesome, interrupting foreign code that cannot cope with such signals. VMs with a threaded heartbeat use a high-priority thread that loops, blocking on nanosleep and then interrupting the VM, performing the same function as the itimer heartbeat but without using signals. These VMs are to be preferred but suport for multiple thread priorities in user-level processes has only been available on linux in kernels later than 2.6.12. So, I downloaded the heartbeat squeak VM from bintray [2]. This VM requires so deploy some configuration files in /etc/security [2]. Under this configuration OSSubprocess worked like a charm (or I did not found the issue again so far). Now, this heartbeat threaded VM is the recommended in the README file, and we see that OSSubprocess generates the exact issue stated. The main problem remains for the moment since Pharo's default download includes not this VM but the itimer one. I talked with Esteban about it and he was aware of these two VM flavours, and the reason why we are using the itimer one is the need to deploy those permission files in /etc, which makes installation a bit less automatic. Cheers, Guille [1] https://github.com/OpenSmalltalk/opensmalltalk-vm/blob/e17db79411cfec767e04… [2] https://bintray.com/opensmalltalk/vm/download_file?file_path=cog_linux32x86… [3] https://github.com/OpenSmalltalk/opensmalltalk-vm/releases/tag/r3732#linux -------- Original Message -------- > > >> I asked Santa an OSSubprocess that won't hang :) >> > > > I really appreciate to see such not so small polar elfves helping santa :) > > > > Stef > > > > > > > >> Thanks, >> >> Guille >> >> >> >> >> >> -------- Original Message -------- >> >>> >>> >>>> On 19 Dec 2016, at 14:41, Mariano Martinez Peck >>>> <marianopeck(a)gmail.com> wrote: >>>> >>>> >>>> >>>> Hi guys, >>>> >>>> >>>> >>>> Guille Polito kept one of these images if someone can give us a >>>> hand. He also proposed the great idea of using `strace` to see what >>>> was going on. He (together with Pable Tesone) suspected that the >>>> heartbeat could be interrupting the `clone()` function which is (I >>>> think) called internally by the 'posix_spawn()' which is the one >>>> used by OSSubprocess. >>>> >>>> >>>> >>>> When these images are "hung" they found at a infinitive loop like this: >>>> >>> Okay, how many child processes do you have at that point? How many >>> processes does the system have? >>> >>> >>> >>> >>> >>>> [pid 17477] --- SIGALRM {si_signo=SIGALRM, si_code=SI_KERNEL} --- >>>> >>>> [pid 17477] gettimeofday({1482152630, 593498}, NULL) = 0 >>>> >>>> [pid 17477] sigreturn() (mask []) = 120 >>>> >>>> [pid 17477] clone(child_stack=0, >>>> flags=CLONE_CHILD_CLEARTID|CLONE_CHILD_SETTID|SIGCHLD, >>>> child_tidptr=0xf7578768) = ? ERESTARTNOINTR (To be restarted) >>>> >>>> [pid 17477] --- SIGALRM {si_signo=SIGALRM, si_code=SI_KERNEL} --- >>>> >>>> [pid 17477] gettimeofday({1482152630, 600126}, NULL) = 0 >>>> >>>> [pid 17477] sigreturn() (mask []) = 120 >>>> >>>> [pid 17477] clone(child_stack=0, >>>> flags=CLONE_CHILD_CLEARTID|CLONE_CHILD_SETTID|SIGCHLD, >>>> child_tidptr=0xf7578768) = ? ERESTARTNOINTR (To be restarted) >>>> >>> so above.. 7ms between the two gettimeofday calls? Nothing else? Set >>> a breakpoint on clone/fork in gdb and look at the c-stack at this >>> point? Could you strace with timestamps to see how much time is >>> spent? Is the process suspicious in other ways? >>> >>> >>> >>> So yes.. sounds like clone doesn't complete.. the question is why? >>> Is it out of resources? Is something in the VM blocking longer than >>> the heartbeat, is the heartbeat more frequent than expected? >>> >>> >>> >>> >>> >>>> As you can see, there is a SIGALARM involved. It also looks like >>>> the `gettimeofday` is used by the heartbeat ? Could it be that >>>> someone the heartbeat is interrupting the `clone()` ? >>>> >>>> >>>> >>>> Guille also showed me the `strace` output with a regular / working >>>> image: >>>> >>>> >>>> >>>> >>>> >>>> [pid 18647] --- SIGALRM {si_signo=SIGALRM, si_code=SI_KERNEL} --- >>>> >>>> [pid 18647] gettimeofday({1482152829, 481014}, NULL) = 0 >>>> >>>> [pid 18647] sigreturn() (mask []) = -1 EINTR (Interrupted >>>> system call) >>>> >>>> [pid 18647] getitimer(ITIMER_REAL, {it_interval={0, 2000}, >>>> it_value={0, 1917}}) = 0 >>>> >>>> [pid 18647] recvmsg(3, 0xff7b0734, 0) = -1 EAGAIN (Resource >>>> temporarily unavailable) >>>> >>>> [pid 18647] select(4, [3], [], [3], {0, 1000}) = 0 (Timeout) >>>> >>>> [pid 18647] getitimer(ITIMER_REAL, {it_interval={0, 2000}, >>>> it_value={0, 797}}) = 0 >>>> >>>> [pid 18647] recvmsg(3, 0xff7b0734, 0) = -1 EAGAIN (Resource >>>> temporarily unavailable) >>>> >>>> [pid 18647] select(4, [3], [], [3], {0, 1000}) = ? ERESTARTNOHAND >>>> (To be restarted if no handler) >>>> >>>> [pid 18647] --- SIGALRM {si_signo=SIGALRM, si_code=SI_KERNEL} --- >>>> >>>> >>>> >>>> >>>> >>>> Does anyone have any hint here? >>>> >>> Get timestamps in there. How long does it take to fail/end in this >>> situation? >>> >>> >>> >>> holger >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> >> >> >> >> >> >> > > > > > >

7 18

Ideas on cheap multi-threading for Squeak / Pharo ? (from Tim's article)
by Clément Bera 15 Mar '17

15 Mar '17

Hi all, Tim's just shared this lovely article with a 10,000+ core ARM machine. With this kind of machines, it's a bit stupid to use only 1 core when you have 10,000+. I believe we have to find a way to introduce multi-threading in Squeak / Pharo. For co-processors like the Xeon Phi or the graphic cards, I guess it's ok not to use them because their not general purpose processors while the VM is general purpose, but all those 10,000 cores... For parallel programming, we could consider doing something cheap like the parallel C# loops (Parallel.for and co). The Smalltalk programmer would then explicitly write "collection parallelDo: aBlock" instead of "collection do: aBlock", and if the block is long enough to execute, the cost of parallelisation becomes negligible compared to the performance boost of parallelisation. The block has to perform independent tasks, and if multiple blocks executed in parallel read/write the same memory location, as in C#, the behavior is undefined leading to freezes / crashes. It's the responsibility of the programmer to find out if loop iterations are independent or not (and it's not obvious). For concurrent programming, there's this design from E where we could have an actor model in Smalltalk where each actor is completely independent from each other, one native thread per actor, and all the common objects (including what's necessary for look-up such as method dictionaries) could be shared as long as they're read-only or immutable. Mutating a shared object such as installing a method in a method dictionary would be detected because such objects are read-only and we can stop all the threads sharing such object to mutate it. The programmer has to keep uncommon the mutation of shared objects to have good performance. Both design have different goals using multiple cores (parallel and concurrent programming), but in both cases we don't need to rewrite any library to make Squeak / Pharo multi-threaded like they did in Java. What do you think ? Is there anybody on the mailing list having ideas on how to introduce threads in Squeak / Pharo in a cheap way that does not require rewriting all core/collection libraries ? I'm not really into multi-threading myself but I believe the Cog VM will die in 10 years from now if we don't add something to support multi-threading, so I would like to hear suggestions. Best, Clement Phd Student Bâtiment B 40, avenue Halley 59650 *Villeneuve d'Ascq*

9 17

VM Maker: VMMaker.oscog-eem.2138.mcz
by commits＠source.squeak.org 02 Mar '17

02 Mar '17

Eliot Miranda uploaded a new version of VMMaker to project VM Maker: http://source.squeak.org/VMMaker/VMMaker.oscog-eem.2138.mcz ==================== Summary ==================== Name: VMMaker.oscog-eem.2138 Author: eem Time: 24 February 2017, 12:31:35.781791 pm UUID: 8b98184c-9061-45e1-b4ce-bd9b8bc8c802 Ancestors: VMMaker.oscog-eem.2137 StackToRegisterMappingCogit: Reimplement mclassIsSmallInteger in terms of receiverTags, providing more generality at cheaper cost (receiverTags is computed during set-up for compiling a method). Improve special-selector comparison and arithmetic based on this if the receiver or argument is self and known to be a SmallInteger. Also improve the tag checking to avoid the spurious copy to TempReg unless both receiver and argument need to be tested. These improve code quality in methods such as SmallInteger>>digitLength:. Use anyMask: in ssAllocateRequiredRegMask:upThrough:upThroughNative: instead of bitAnd:...~= 0. RegisterAllocatingCogit: Override ssAllocateRequiredRegMask:upThrough:upThroughNative: to void optStatus and simStack entries that refer to the allocated register. Simulator: Aim stdio at the coInterpreter's transcript rather than Transcript. Fix some tag-related bugs in the CurrentImageCoInterpreterFacade hierarchy. =============== Diff against VMMaker.oscog-eem.2137 =============== Item was added: + ----- Method: CogObjectRepresentation>>genJumpNotSmallIntegersIn:and:scratch: (in category 'compile abstract instructions') ----- + genJumpNotSmallIntegersIn: aRegister and: bRegister scratch: scratchRegister + "Generate a compare and branch to test if aRegister and bRegister contains other than SmallIntegers, + i.e. don't branch if both aRegister and bRegister contain SmallIntegers. + Answer the jump. Destroy scratchRegister if required." + <returnTypeC: #'AbstractInstruction *'> + ^self subclassResponsibility! Item was removed: - ----- Method: CogObjectRepresentation>>genJumpNotSmallIntegersIn:andScratch:scratch: (in category 'compile abstract instructions') ----- - genJumpNotSmallIntegersIn: aRegister andScratch: scratchA scratch: scratchB - "Generate a compare and branch to test if aRegister and scratchA contains other than SmallIntegers, - i.e. don't branch if both aRegister and scratchA contain SmallIntegers. - Answer the jump. Destroy scratchA and scratchB if required." - <returnTypeC: #'AbstractInstruction *'> - ^self subclassResponsibility! Item was removed: - ----- Method: CogObjectRepresentationFor32BitSpur>>genJumpNotSmallIntegersIn:andScratch:scratch: (in category 'compile abstract instructions') ----- - genJumpNotSmallIntegersIn: aRegister andScratch: scratchA scratch: scratchB - "Generate a compare and branch to test if aRegister and scratchA contains other than SmallIntegers, - i.e. don't branch if both aRegister and scratchA contain SmallIntegers. - Answer the jump. Destroy scratchA and scratchB if required." - <returnTypeC: #'AbstractInstruction *'> - <inline: true> - cogit AndR: aRegister R: scratchA. - ^self genJumpNotSmallIntegerInScratchReg: scratchA! Item was removed: - ----- Method: CogObjectRepresentationFor64BitSpur>>genJumpNotSmallIntegersIn:andScratch:scratch: (in category 'compile abstract instructions') ----- - genJumpNotSmallIntegersIn: aRegister andScratch: scratchA scratch: scratchB - "Generate a compare and branch to test if aRegister and scratchA contains other than SmallIntegers, - i.e. don't branch if both aRegister and scratchA contain SmallIntegers. - Answer the jump. Destroy scratchA and scratchB if required." - <returnTypeC: #'AbstractInstruction *'> - <inline: true> - cogit AndR: aRegister R: scratchA. - ^self genJumpNotSmallIntegerInScratchReg: scratchA! Item was added: + ----- Method: CogObjectRepresentationForSpur>>genJumpNotSmallIntegersIn:and:scratch: (in category 'compile abstract instructions') ----- + genJumpNotSmallIntegersIn: aRegister and: bRegister scratch: scratchRegister + "Generate a compare and branch to test if aRegister and bRegister contains other than SmallIntegers, + i.e. don't branch if both aRegister and bRegister contain SmallIntegers. + Answer the jump. Destroy scratchRegister if required." + <returnTypeC: #'AbstractInstruction *'> + <returnTypeC: #'AbstractInstruction *'> + <inline: true> + cogit + MoveR: aRegister R: scratchRegister; + AndR: bRegister R: scratchRegister. + ^self genJumpNotSmallIntegerInScratchReg: scratchRegister! Item was removed: - ----- Method: CogObjectRepresentationForSqueakV3>>genJumpNotSmallIntegersIn:andScratch:scratch: (in category 'compile abstract instructions') ----- - genJumpNotSmallIntegersIn: aRegister andScratch: scratchA scratch: scratchB - "Generate a compare and branch to test if aRegister and scratchA contains other than SmallIntegers, - i.e. don't branch if both aRegister and scratchA contain SmallIntegers. - Answer the jump. Destroy scratchA and scratchB if required." - <returnTypeC: #'AbstractInstruction *'> - <inline: true> - cogit AndR: aRegister R: scratchA. - ^self genJumpNotSmallIntegerInScratchReg: scratchA! Item was removed: - ----- Method: CogRegisterAllocatingSimStackEntry>>complicatedIsMergedWithTargetEntry: (in category 'comparing') ----- - complicatedIsMergedWithTargetEntry: targetEntry - "The receiver is a simStackEntry at a jump to the corresponding simStackEntry at the jump's target. - Answer if no merge is required for the jump." - <var: 'ssEntry' type: #'CogSimStackEntry *'> - spilled ~= targetEntry spilled ifTrue: "push or pop required" - [^false]. - (liveRegister = NoReg and: [targetEntry liveRegister ~= NoReg]) ifTrue: "register load required" - [^false]. - (liveRegister ~= NoReg - and: [liveRegister = targetEntry liveRegister - and: [type = targetEntry type - and: [type = SSConstant or: [type = SSRegister and: [register = targetEntry register]]]]]) ifTrue: - [^true]. - ((type = SSBaseOffset or: [type == SSSpill]) - and: [(targetEntry type = SSBaseOffset or: [targetEntry type == SSSpill]) - and: [offset = targetEntry offset and: [register = targetEntry register]]]) ifTrue: - [^true]. - "self: const =1 (16r1) (live: Extra4Reg) {172} vs reg ReceiverResultReg {127}" - "self: reg ReceiverResultReg {95} vs reg Extra5Reg {85}" - ((type = SSConstant and: [targetEntry type = SSRegister and: [liveRegister ~= targetEntry registerOrNone]]) - or: [type = SSRegister and: [targetEntry type = SSRegister and: [register ~= targetEntry registerOrNone]]]) ifFalse: - [self halt: 'comment the incompatible pair please']. - ^false! Item was removed: - ----- Method: CogRegisterAllocatingSimStackEntry>>isSameEntryAs: (in category 'comparing') ----- - isSameEntryAs: ssEntry - <var: 'ssEntry' type: #'CogSimStackEntry *'> - ^type = ssEntry type - and: [((type = SSBaseOffset or: [type == SSSpill]) and: [offset = ssEntry offset and: [register = ssEntry register]]) - or: [(type = SSRegister and: [register = ssEntry register]) - or: [(type = SSConstant and: [constant = ssEntry constant])]]]! Item was removed: - ----- Method: CogRegisterAllocatingSimStackEntry>>simplifiedIsMergedWithTargetEntry: (in category 'comparing') ----- - simplifiedIsMergedWithTargetEntry: targetEntry - "The receiver is a simStackEntry at a jump to the corresponding simStackEntry at the jump's target. - Answer if no merge is required for the jump." - <var: 'ssEntry' type: #'CogSimStackEntry *'> - spilled ~= targetEntry spilled ifTrue: "push or pop required" - [^false]. - (liveRegister = NoReg and: [targetEntry liveRegister ~= NoReg]) ifTrue: "register load required" - [^false]. - (self isSameEntryAs: targetEntry) ifTrue: - [^liveRegister = targetEntry liveRegister]. - (type = SSConstant and: [targetEntry type = SSRegister and: [liveRegister = targetEntry register]]) ifTrue: - [^true]. - "self: const =1 (16r1) (live: Extra4Reg) {172} vs reg ReceiverResultReg {127}" - "self: reg ReceiverResultReg {95} vs reg Extra5Reg {85}" - "(bo ReceiverResultReg+296 (live: Extra5Reg) {88} vs reg ReceiverResultReg {84}" - ((type = SSConstant and: [targetEntry type = SSRegister and: [liveRegister ~= targetEntry registerOrNone]]) - or: [(type = SSRegister and: [targetEntry type = SSRegister and: [register ~= targetEntry registerOrNone]]) - or: [type = SSBaseOffset and: [register = ReceiverResultReg and: [targetEntry type = SSRegister]]]]) ifFalse: - [self halt: 'comment the incompatible pair please']. - ^false! Item was added: + ----- Method: CogSimStackEntry>>isSameEntryAs: (in category 'comparing') ----- + isSameEntryAs: ssEntry + <var: 'ssEntry' type: #'CogSimStackEntry *'> + ^type = ssEntry type + and: [((type = SSBaseOffset or: [type == SSSpill]) and: [offset = ssEntry offset and: [register = ssEntry register]]) + or: [(type = SSRegister and: [register = ssEntry register]) + or: [(type = SSConstant and: [constant = ssEntry constant])]]]! Item was changed: CogClass subclass: #Cogit + instanceVariableNames: 'coInterpreter objectMemory objectRepresentation processor threadManager methodZone methodZoneBase codeBase minValidCallAddress lastNInstructions simulatedAddresses simulatedTrampolines simulatedVariableGetters simulatedVariableSetters printRegisters printInstructions compilationTrace clickConfirm breakPC breakBlock singleStep guardPageSize traceFlags traceStores breakMethod methodObj enumeratingCogMethod methodHeader initialPC endPC methodOrBlockNumArgs inBlock needsFrame hasYoungReferent primitiveIndex backEnd literalsManager postCompileHook methodLabel stackCheckLabel blockEntryLabel blockEntryNoContextSwitch blockNoContextSwitchOffset stackOverflowCall sendMiss missOffset entryPointMask checkedEntryAlignment uncheckedEntryAlignment cmEntryOffset entry cmNoCheckEntryOffset noCheckEntry fullBlockEntry cbEntryOffset fullBlockNoContextSwitchEntry cbNoSwitchEntryOffset picMNUAbort picInterpretAbort endCPICCase0 endCPICCase1 firstCPICCaseOffset cPICCaseSize cP ICEndSize closedPICSize openPICSize fixups abstractOpcodes generatorTable byte0 byte1 byte2 byte3 bytecodePC bytecodeSetOffset opcodeIndex numAbstractOpcodes blockStarts blockCount labelCounter cStackAlignment expectedSPAlignment expectedFPAlignment codeModified maxLitIndex ceMethodAbortTrampoline cePICAbortTrampoline ceCheckForInterruptTrampoline ceCPICMissTrampoline ceReturnToInterpreterTrampoline ceBaseFrameReturnTrampoline ceSendMustBeBooleanAddTrueTrampoline ceSendMustBeBooleanAddFalseTrampoline ceCannotResumeTrampoline ceEnterCogCodePopReceiverReg ceCallCogCodePopReceiverReg ceCallCogCodePopReceiverAndClassRegs cePrimReturnEnterCogCode cePrimReturnEnterCogCodeProfiling ceNonLocalReturnTrampoline ceFetchContextInstVarTrampoline ceStoreContextInstVarTrampoline ceEnclosingObjectTrampoline ceFlushICache ceCheckFeaturesFunction ceTraceLinkedSendTrampoline ceTraceBlockActivationTrampoline ceTraceStoreTrampoline ceGetFP ceGetSP ceCaptureCStackPointers ordinarySendTrampolines superSen dTrampolines directedSuperSendTrampolines dynamicSuperSendTrampolines outerSendTrampolines selfSendTrampolines firstSend lastSend realCEEnterCogCodePopReceiverReg realCECallCogCodePopReceiverReg realCECallCogCodePopReceiverAndClassRegs trampolineTableIndex trampolineAddresses objectReferencesInRuntime runtimeObjectRefIndex cFramePointerInUse debugPrimCallStackOffset ceTryLockVMOwner ceUnlockVMOwner extA extB numExtB tempOop numIRCs indexOfIRC theIRCs receiverTags implicitReceiverSendTrampolines cogMethodSurrogateClass cogBlockMethodSurrogateClass nsSendCacheSurrogateClass CStackPointer CFramePointer cPICPrototype cPICEndOfCodeOffset cPICEndOfCodeLabel maxCPICCases debugBytecodePointers debugOpcodeIndices disassemblingMethod ceMallocTrampoline ceFreeTrampoline ceFFICalloutTrampoline' - instanceVariableNames: 'coInterpreter objectMemory objectRepresentation processor threadManager methodZone methodZoneBase codeBase minValidCallAddress lastNInstructions simulatedAddresses simulatedTrampolines simulatedVariableGetters simulatedVariableSetters printRegisters printInstructions compilationTrace clickConfirm breakPC breakBlock singleStep guardPageSize traceFlags traceStores breakMethod methodObj enumeratingCogMethod methodHeader initialPC endPC methodOrBlockNumArgs inBlock needsFrame hasYoungReferent primitiveIndex backEnd literalsManager postCompileHook methodLabel stackCheckLabel blockEntryLabel blockEntryNoContextSwitch blockNoContextSwitchOffset stackOverflowCall sendMiss missOffset entryPointMask checkedEntryAlignment uncheckedEntryAlignment cmEntryOffset entry cmNoCheckEntryOffset noCheckEntry fullBlockEntry cbEntryOffset fullBlockNoContextSwitchEntry cbNoSwitchEntryOffset picMNUAbort picInterpretAbort endCPICCase0 endCPICCase1 firstCPICCaseOffset cPICCaseSize cP ICEndSize closedPICSize openPICSize fixups abstractOpcodes generatorTable byte0 byte1 byte2 byte3 bytecodePC bytecodeSetOffset opcodeIndex numAbstractOpcodes blockStarts blockCount labelCounter cStackAlignment expectedSPAlignment expectedFPAlignment codeModified maxLitIndex ceMethodAbortTrampoline cePICAbortTrampoline ceCheckForInterruptTrampoline ceCPICMissTrampoline ceReturnToInterpreterTrampoline ceBaseFrameReturnTrampoline ceSendMustBeBooleanAddTrueTrampoline ceSendMustBeBooleanAddFalseTrampoline ceCannotResumeTrampoline ceEnterCogCodePopReceiverReg ceCallCogCodePopReceiverReg ceCallCogCodePopReceiverAndClassRegs cePrimReturnEnterCogCode cePrimReturnEnterCogCodeProfiling ceNonLocalReturnTrampoline ceFetchContextInstVarTrampoline ceStoreContextInstVarTrampoline ceEnclosingObjectTrampoline ceFlushICache ceCheckFeaturesFunction ceTraceLinkedSendTrampoline ceTraceBlockActivationTrampoline ceTraceStoreTrampoline ceGetFP ceGetSP ceCaptureCStackPointers ordinarySendTrampolines superSen dTrampolines directedSuperSendTrampolines dynamicSuperSendTrampolines outerSendTrampolines selfSendTrampolines firstSend lastSend realCEEnterCogCodePopReceiverReg realCECallCogCodePopReceiverReg realCECallCogCodePopReceiverAndClassRegs trampolineTableIndex trampolineAddresses objectReferencesInRuntime runtimeObjectRefIndex cFramePointerInUse debugPrimCallStackOffset ceTryLockVMOwner ceUnlockVMOwner extA extB numExtB tempOop numIRCs indexOfIRC theIRCs implicitReceiverSendTrampolines cogMethodSurrogateClass cogBlockMethodSurrogateClass nsSendCacheSurrogateClass CStackPointer CFramePointer cPICPrototype cPICEndOfCodeOffset cPICEndOfCodeLabel maxCPICCases debugBytecodePointers debugOpcodeIndices disassemblingMethod ceMallocTrampoline ceFreeTrampoline ceFFICalloutTrampoline' classVariableNames: 'AltBlockCreationBytecodeSize AltFirstSpecialSelector AltNSSendIsPCAnnotated AltNumSpecialSelectors AnnotationConstantNames AnnotationShift AnnotationsWithBytecodePCs BlockCreationBytecodeSize Debug DisplacementMask DisplacementX2N EagerInstructionDecoration FirstAnnotation FirstSpecialSelector HasBytecodePC IsAbsPCReference IsAnnotationExtension IsDirectedSuperSend IsDisplacementX2N IsNSDynamicSuperSend IsNSImplicitReceiverSend IsNSSelfSend IsNSSendCall IsObjectReference IsRelativeCall IsSendCall IsSuperSend MapEnd MaxCPICCases MaxCompiledPrimitiveIndex MaxStackAllocSize MaxX2NDisplacement NSCClassTagIndex NSCEnclosingObjectIndex NSCNumArgsIndex NSCSelectorIndex NSCTargetIndex NSSendIsPCAnnotated NeedsFixupFlag NumObjRefsInRuntime NumOopsPerNSC NumSpecialSelectors NumTrampolines ProcessorClass RRRName' poolDictionaries: 'CogAbstractRegisters CogCompilationConstants CogMethodConstants CogRTLOpcodes VMBasicConstants VMBytecodeConstants VMObjectIndices VMStackFrameOffsets' category: 'VMMaker-JIT'! Cogit class instanceVariableNames: 'generatorTable primitiveTable'! !Cogit commentStamp: 'eem 2/9/2017 10:01' prior: 0! I am the code generator for the Cog VM. My job is to produce machine code versions of methods for faster execution and to manage inline caches for faster send performance. I can be tested in the current image using my class-side in-image compilation facilities. e.g. try StackToRegisterMappingCogit genAndDis: (Integer >> #benchFib) I have concrete subclasses that implement different levels of optimization: SimpleStackBasedCogit is the simplest code generator. StackToRegisterMappingCogit is the current production code generator It defers pushing operands to the stack until necessary and implements a register-based calling convention for low-arity sends. StackToRegisterMappingCogit is an experimental code generator with support for counting conditional branches, intended to support adaptive optimization. coInterpreter <CoInterpreterSimulator> the VM's interpreter with which I cooperate methodZoneManager <CogMethodZoneManager> the manager of the machine code zone objectRepresentation <CogObjectRepresentation> the object used to generate object accesses processor <BochsIA32Alien|?> the simulator that executes the IA32/x86 machine code I generate when simulating execution in Smalltalk simulatedTrampolines <Dictionary of Integer -> MessageSend> the dictionary mapping trap jump addresses to run-time routines used to warp from simulated machine code in to the Smalltalk run-time. simulatedVariableGetters <Dictionary of Integer -> MessageSend> the dictionary mapping trap read addresses to variables in run-time objects used to allow simulated machine code to read variables in the Smalltalk run-time. simulatedVariableSetters <Dictionary of Integer -> MessageSend> the dictionary mapping trap write addresses to variables in run-time objects used to allow simulated machine code to write variables in the Smalltalk run-time. printRegisters printInstructions clickConfirm <Boolean> flags controlling debug printing and code simulation breakPC <Integer> machine code pc breakpoint cFramePointer cStackPointer <Integer> the variables representing the C stack & frame pointers, which must change on FFI callback and return selectorOop <sqInt> the oop of the methodObj being compiled methodObj <sqInt> the bytecode method being compiled initialPC endPC <Integer> the start and end pcs of the methodObj being compiled methodOrBlockNumArgs <Integer> argument count of current method or block being compiled needsFrame <Boolean> whether methodObj or block needs a frame to execute primitiveIndex <Integer> primitive index of current method being compiled methodLabel <CogAbstractOpcode> label for the method header blockEntryLabel <CogAbstractOpcode> label for the start of the block dispatch code stackOverflowCall <CogAbstractOpcode> label for the call of ceStackOverflow in the method prolog sendMissCall <CogAbstractOpcode> label for the call of ceSICMiss in the method prolog entryOffset <Integer> offset of method entry code from start (header) of method entry <CogAbstractOpcode> label for the first instruction of the method entry code noCheckEntryOffset <Integer> offset of the start of a method proper (after the method entry code) from start (header) of method noCheckEntry <CogAbstractOpcode> label for the first instruction of start of a method proper fixups <Array of <AbstractOpcode Label | nil>> the labels for forward jumps that will be fixed up when reaching the relevant bytecode. fixups has one element per byte in methodObj's bytecode; initialPC maps to fixups[0]. abstractOpcodes <Array of <AbstractOpcode>> the code generated when compiling methodObj byte0 byte1 byte2 byte3 <Integer> individual bytes of current bytecode being compiled in methodObj bytecodePointer <Integer> bytecode pc (same as Smalltalk) of the current bytecode being compiled opcodeIndex <Integer> the index of the next free entry in abstractOpcodes (this code is translated into C where OrderedCollection et al do not exist) numAbstractOpcodes <Integer> the number of elements in abstractOpcocdes blockStarts <Array of <BlockStart>> the starts of blocks in the current method blockCount the index into blockStarts as they are being noted, and hence eventually the total number of blocks in the current method labelCounter <Integer> a nicety for numbering labels not needed in the production system but probably not expensive enough to worry about ceStackOverflowTrampoline <Integer> ceSend0ArgsTrampoline <Integer> ceSend1ArgsTrampoline <Integer> ceSend2ArgsTrampoline <Integer> ceSendNArgsTrampoline <Integer> ceSendSuper0ArgsTrampoline <Integer> ceSendSuper1ArgsTrampoline <Integer> ceSendSuper2ArgsTrampoline <Integer> ceSendSuperNArgsTrampoline <Integer> ceSICMissTrampoline <Integer> ceCPICMissTrampoline <Integer> ceStoreCheckTrampoline <Integer> ceReturnToInterpreterTrampoline <Integer> ceBaseFrameReturnTrampoline <Integer> ceSendMustBeBooleanTrampoline <Integer> ceClosureCopyTrampoline <Integer> the various trampolines (system-call-like jumps from machine code to the run-time). See Cogit>>generateTrampolines for the mapping from trampoline to run-time routine and then read the run-time routine for a funcitonal description. ceEnterCogCodePopReceiverReg <Integer> the enilopmart (jump from run-time to machine-code) methodZoneBase <Integer> ! Cogit class instanceVariableNames: 'generatorTable primitiveTable'! Item was changed: ----- Method: Cogit>>cog:selector: (in category 'jit - api') ----- cog: aMethodObj selector: aSelectorOop "Attempt to produce a machine code method for the bytecode method object aMethodObj. N.B. If there is no code memory available do *NOT* attempt to reclaim the method zone. Certain clients (e.g. ceSICMiss:) depend on the zone remaining constant across method generation." <api> <returnTypeC: #'CogMethod *'> | cogMethod | <var: #cogMethod type: #'CogMethod *'> (self exclude: aMethodObj selector: aSelectorOop) ifTrue: [^nil]. "In Newspeak we support anonymous accessors and hence tolerate the same method being cogged multiple times. But only if the method class association is nil." NewspeakVM ifTrue: [(coInterpreter methodHasCogMethod: aMethodObj) ifTrue: [cogMethod := coInterpreter cogMethodOf: aMethodObj. self deny: cogMethod selector = aSelectorOop. cogMethod selector = aSelectorOop ifTrue: [^cogMethod]. (coInterpreter methodClassAssociationOf: aMethodObj) ~= objectMemory nilObject ifTrue: [self cCode: 'extern void *firstIndexableField(sqInt)'. "Slang, au natural" self warnMultiple: cogMethod selectors: aSelectorOop. ^nil]]] ifFalse: [self deny: (coInterpreter methodHasCogMethod: aMethodObj)]. self deny: (objectMemory isOopCompiledMethod: (coInterpreter ultimateLiteralOf: aMethodObj)). "coInterpreter stringOf: aSelectorOop" coInterpreter compilationBreak: aSelectorOop point: (objectMemory lengthOf: aSelectorOop) isMNUCase: false. aMethodObj = breakMethod ifTrue: [self halt: 'Compilation of breakMethod']. NewspeakVM ifTrue: [cogMethod := methodZone findPreviouslyCompiledVersionOf: aMethodObj with: aSelectorOop. cogMethod ifNotNil: [(coInterpreter methodHasCogMethod: aMethodObj) not ifTrue: [self assert: (coInterpreter rawHeaderOf: aMethodObj) = cogMethod methodHeader. cogMethod methodObject: aMethodObj. coInterpreter rawHeaderOf: aMethodObj put: cogMethod asInteger]. ^cogMethod]]. "If the generators for the alternate bytecode set are missing then interpret." (coInterpreter methodUsesAlternateBytecodeSet: aMethodObj) ifTrue: [(self numElementsIn: generatorTable) <= 256 ifTrue: [^nil]. bytecodeSetOffset := 256] ifFalse: [bytecodeSetOffset := 0]. objectRepresentation ensureNoForwardedLiteralsIn: aMethodObj. methodObj := aMethodObj. methodHeader := objectMemory methodHeaderOf: aMethodObj. + receiverTags := objectMemory receiverTagBitsForMethod: methodObj. cogMethod := self compileCogMethod: aSelectorOop. (cogMethod asInteger between: MaxNegativeErrorCode and: -1) ifTrue: [cogMethod asInteger = InsufficientCodeSpace ifTrue: [coInterpreter callForCogCompiledCodeCompaction]. self maybeFreeCounters. "Right now no errors should be reported, so nothing more to do." "self reportError: (self cCoerceSimple: cogMethod to: #sqInt)." ^nil]. "self cCode: '' inSmalltalk: [coInterpreter printCogMethod: cogMethod. ""coInterpreter symbolicMethod: aMethodObj."" self assertValidMethodMap: cogMethod." "self disassembleMethod: cogMethod." "printInstructions := clickConfirm := true""]." ^cogMethod! Item was changed: ----- Method: Cogit>>cogFullBlockMethod:numCopied: (in category 'jit - api') ----- cogFullBlockMethod: aMethodObj numCopied: numCopied "Attempt to produce a machine code method for the bytecode method object aMethodObj. N.B. If there is no code memory available do *NOT* attempt to reclaim the method zone. Certain clients (e.g. ceSICMiss:) depend on the zone remaining constant across method generation." <api> <option: #SistaV1BytecodeSet> <returnTypeC: #'CogMethod *'> | cogMethod | <var: #cogMethod type: #'CogMethod *'> (self exclude: aMethodObj) ifTrue: [^nil]. self deny: (coInterpreter methodHasCogMethod: aMethodObj). self assert: (objectMemory isOopCompiledMethod: (coInterpreter ultimateLiteralOf: aMethodObj)). aMethodObj = breakMethod ifTrue: [self halt: 'Compilation of breakMethod']. "If the generators for the alternate bytecode set are missing then interpret." (coInterpreter methodUsesAlternateBytecodeSet: aMethodObj) ifTrue: [(self numElementsIn: generatorTable) <= 256 ifTrue: [^nil]. bytecodeSetOffset := 256] ifFalse: [bytecodeSetOffset := 0]. objectRepresentation ensureNoForwardedLiteralsIn: aMethodObj. methodObj := aMethodObj. methodHeader := objectMemory methodHeaderOf: aMethodObj. + receiverTags := objectMemory receiverTagBitsForMethod: methodObj. cogMethod := self compileCogFullBlockMethod: numCopied. (cogMethod asInteger between: MaxNegativeErrorCode and: -1) ifTrue: [cogMethod asInteger = InsufficientCodeSpace ifTrue: [coInterpreter callForCogCompiledCodeCompaction]. self maybeFreeCounters. "Right now no errors should be reported, so nothing more to do." "self reportError: (self cCoerceSimple: cogMethod to: #sqInt)." ^nil]. "self cCode: '' inSmalltalk: [coInterpreter printCogMethod: cogMethod. ""coInterpreter symbolicMethod: aMethodObj."" self assertValidMethodMap: cogMethod." "self disassembleMethod: cogMethod." "printInstructions := clickConfirm := true""]." ^cogMethod! Item was changed: ----- Method: Cogit>>mclassIsSmallInteger (in category 'initialization') ----- mclassIsSmallInteger + ^objectMemory isIntegerObject: receiverTags! - ^(coInterpreter methodClassOf: methodObj) = objectMemory classSmallInteger! Item was added: + ----- Method: CurrentImageCoInterpreterFacade>>classCharacter (in category 'accessing') ----- + classCharacter + ^self oopForObject: Character! Item was added: + ----- Method: CurrentImageCoInterpreterFacade>>lookupOrdinary:receiver: (in category 'cog jit support') ----- + lookupOrdinary: selectorOop receiver: receiverOop + | rcvr selector | + rcvr := self objectForOop: receiverOop. + selector := self objectForOop: selectorOop. + (rcvr class canUnderstand: selector) ifTrue: + [^self oopForObject: ((rcvr class whichClassIncludesSelector: selector) + compiledMethodAt: selector)]. + ^SelectorDoesNotUnderstand! Item was added: + ----- Method: CurrentImageCoInterpreterFacade>>maxLookupNoMNUErrorCode (in category 'accessing') ----- + maxLookupNoMNUErrorCode + ^coInterpreter maxLookupNoMNUErrorCode! Item was changed: ----- Method: CurrentImageCoInterpreterFacade>>objectForOop: (in category 'private-cacheing') ----- objectForOop: anOop "This is a keyAtValue: search and so needs speeding up either by a reverse map or a simple cache." + self subclassResponsibility! - ^(anOop bitAnd: 3) caseOf: { - [0] -> [anOop = cachedOop - ifTrue: [cachedObject] - ifFalse: [cachedObject := objectMap keyAtValue: anOop. "may raise Error" - cachedOop := anOop. "Dom't assign until accessed without error" - cachedObject]]. - [1] -> [anOop signedIntFromLong >> 1]. - [3] -> [anOop signedIntFromLong >> 1] }! Item was changed: ----- Method: CurrentImageCoInterpreterFacade>>stringOf: (in category 'accessing') ----- stringOf: anOop + | thing | + thing := objectMap + keyAtValue: anOop + ifAbsent: + [variables + keyAtValue: anOop + ifAbsent: [^nil]]. + ^((thing isLiteral and: [thing isSymbol not]) + ifTrue: [thing storeString] + ifFalse: [thing asString]) contractTo: 64! - ^(self lookupAddress: anOop) asString! Item was changed: ----- Method: CurrentImageCoInterpreterFacadeFor64BitSpurObjectRepresentation>>objectForOop: (in category 'private-cacheing') ----- objectForOop: anOop "This is a keyAtValue: search and so needs speeding up either by a reverse map or a simple cache." + ^(anOop bitAnd: 7) caseOf: { - ^(anOop bitAnd: 3) caseOf: { [0] -> [anOop = cachedOop ifTrue: [cachedObject] ifFalse: [cachedObject := objectMap keyAtValue: anOop. "may raise Error" cachedOop := anOop. "Dom't assign until accessed without error" cachedObject]]. [1] -> [anOop signedIntFromLong64 >> 3]. [2] -> [Character value: anOop >> 3]. + [4] -> [objectMemory smallFloatValueOf: anOop] }! - [3] -> [objectMemory smallFloatValueOf: anOop] }! Item was added: + ----- Method: CurrentImageCoInterpreterFacadeForSpurObjectRepresentation>>objectForOop: (in category 'private-cacheing') ----- + objectForOop: anOop + "This is a keyAtValue: search and so needs speeding up either by a reverse map or a simple cache." + ^(anOop bitAnd: 3) caseOf: { + [0] -> [anOop = cachedOop + ifTrue: [cachedObject] + ifFalse: [cachedObject := objectMap keyAtValue: anOop. "may raise Error" + cachedOop := anOop. "Dom't assign until accessed without error" + cachedObject]]. + [1] -> [anOop signedIntFromLong >> 1]. + [2] -> [Character value: anOop >> 2]. + [3] -> [anOop signedIntFromLong >> 1] }! Item was added: + ----- Method: CurrentImageCoInterpreterFacadeForSqueakV3ObjectRepresentation>>objectForOop: (in category 'private-cacheing') ----- + objectForOop: anOop + "This is a keyAtValue: search and so needs speeding up either by a reverse map or a simple cache." + ^(anOop bitAnd: 3) caseOf: { + [0] -> [anOop = cachedOop + ifTrue: [cachedObject] + ifFalse: [cachedObject := objectMap keyAtValue: anOop. "may raise Error" + cachedOop := anOop. "Dom't assign until accessed without error" + cachedObject]]. + [1] -> [anOop signedIntFromLong >> 1]. + [3] -> [anOop signedIntFromLong >> 1] }! Item was changed: ----- Method: FilePluginSimulator>>initialiseModule (in category 'initialize-release') ----- initialiseModule "See FilePluginSimulator>>sqFileStdioHandlesInto:" (openFiles := Dictionary new) at: 0 put: (FakeStdinStream for: interpreterProxy interpreter); "stdin" + at: 1 put: interpreterProxy interpreter transcript; "stdout" + at: 2 put: interpreterProxy interpreter transcript. "stderr" - at: 1 put: Transcript; "stdout" - at: 2 put: Transcript. "stderr" states := IdentityDictionary new. maxOpenFiles := VMClass initializationOptions at: #MaxFileDescriptors ifAbsent: [1024]. ^super initialiseModule! Item was added: + ----- Method: NewCoObjectMemory>>receiverTagBitsForMethod: (in category 'cog jit support') ----- + receiverTagBitsForMethod: aMethodObj + "Answer the tag bits for the receiver based on the method's methodClass, if any." + <api> + ^(coInterpreter methodClassOf: aMethodObj) = self classSmallInteger + ifTrue: [self smallIntegerTag] + ifFalse: [0]! Item was changed: ----- Method: RegisterAllocatingCogit>>genSpecialSelectorArithmetic (in category 'bytecode generators') ----- genSpecialSelectorArithmetic | primDescriptor rcvrIsConst argIsConst rcvrIsInt argIsInt rcvrInt argInt destReg jumpNotSmallInts jumpContinue jumpOverflow index rcvrReg argReg regMask | <var: #jumpOverflow type: #'AbstractInstruction *'> <var: #jumpContinue type: #'AbstractInstruction *'> <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> primDescriptor := self generatorAt: byte0. argIsInt := (argIsConst := self ssTop type = SSConstant) and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject: (rcvrInt := (self ssValue: 1) constant)]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: (self addressOf: simSelf)]]. - rcvrIsInt := (rcvrIsConst := (self ssValue: 1) type = SSConstant) - and: [objectMemory isIntegerObject: (rcvrInt := (self ssValue: 1) constant)]. + (argIsInt and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [| result | rcvrInt := objectMemory integerValueOf: rcvrInt. argInt := objectMemory integerValueOf: argInt. primDescriptor opcode caseOf: { [AddRR] -> [result := rcvrInt + argInt]. [SubRR] -> [result := rcvrInt - argInt]. [AndRR] -> [result := rcvrInt bitAnd: argInt]. [OrRR] -> [result := rcvrInt bitOr: argInt] }. (objectMemory isIntegerValue: result) ifTrue: ["Must annotate the bytecode for correct pc mapping." ^self ssPop: 2; ssPushAnnotatedConstant: (objectMemory integerObjectOf: result)]. ^self genSpecialSelectorSend]. "If there's any constant involved other than a SmallInteger don't attempt to inline." ((rcvrIsConst and: [rcvrIsInt not]) or: [argIsConst and: [argIsInt not]]) ifTrue: [^self genSpecialSelectorSend]. "If we know nothing about the types then better not to inline as the inline cache and primitive code is not terribly slow so wasting time on duplicating tag tests is pointless." (argIsInt or: [rcvrIsInt]) ifFalse: [^self genSpecialSelectorSend]. "Since one or other of the arguments is an integer we can very likely profit from inlining. But if the other type is not SmallInteger or if the operation overflows then we will need to do a send. Since we're allocating values in registers we would like to keep those registers live on the inlined path and reload registers along the non-inlined send path. See reconcileRegisterStateForJoinAfterSpecialSelectorSend below." argIsInt ifTrue: [rcvrReg := self allocateRegForStackEntryAt: 1. (self ssValue: 1) popToReg: rcvrReg. - self MoveR: rcvrReg R: TempReg. regMask := self registerMaskFor: rcvrReg] ifFalse: [self allocateRegForStackTopTwoEntriesInto: [:rTop :rNext| argReg := rTop. rcvrReg := rNext]. self ssTop popToReg: argReg. (self ssValue: 1) popToReg: rcvrReg. - self MoveR: argReg R: TempReg. regMask := self registerMaskFor: rcvrReg and: argReg]. "rcvrReg can be reused for the result iff the receiver is a constant or is an SSRegister that is not used elsewhere." + destReg := ((rcvrIsInt and: [rcvrIsConst]) - destReg := (rcvrIsInt or: [(self ssValue: 1) type = SSRegister and: [(self anyReferencesToRegister: rcvrReg inAllButTopNItems: 2) not]]) ifTrue: [rcvrReg] ifFalse: [self allocateRegNotConflictingWith: regMask]. self ssPop: 2. + jumpNotSmallInts := (rcvrIsInt and: [argIsInt]) ifFalse: + [argIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: rcvrReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: argReg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: rcvrReg and: argReg scratch: TempReg]]]. - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifTrue: [objectRepresentation genJumpNotSmallIntegerInScratchReg: TempReg] - ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: rcvrReg andScratch: TempReg scratch: ClassReg]. rcvrReg ~= destReg ifTrue: [self MoveR: rcvrReg R: destReg]. primDescriptor opcode caseOf: { [AddRR] -> [argIsInt ifTrue: [self AddCq: argInt - ConstZero R: destReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before doing send" rcvrReg = destReg ifTrue: [self SubCq: argInt - ConstZero R: rcvrReg]] ifFalse: [objectRepresentation genRemoveSmallIntegerTagsInScratchReg: destReg. self AddR: argReg R: destReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before doing send" destReg = rcvrReg ifTrue: + [(rcvrIsInt and: [rcvrIsConst]) - [rcvrIsInt ifTrue: [self MoveCq: rcvrInt R: rcvrReg] ifFalse: [self SubR: argReg R: rcvrReg. objectRepresentation genSetSmallIntegerTagsIn: rcvrReg]]]]. [SubRR] -> [argIsInt ifTrue: [self SubCq: argInt - ConstZero R: destReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before doing send" rcvrReg = destReg ifTrue: [self AddCq: argInt - ConstZero R: rcvrReg]] ifFalse: [(self anyReferencesToRegister: argReg inAllButTopNItems: 0) ifTrue: "argReg is live; cannot strip tags and continue on no overflow without restoring tags" [objectRepresentation genRemoveSmallIntegerTagsInScratchReg: argReg. self SubR: argReg R: destReg. jumpOverflow := self JumpOverflow: 0. "no overflow; must undo the damage before continuing" objectRepresentation genSetSmallIntegerTagsIn: argReg. jumpContinue := self Jump: 0. jumpOverflow jmpTarget: self Label. "overflow; must undo the damage before doing send" + ((rcvrIsInt and: [rcvrIsConst]) or: [destReg ~= rcvrReg]) ifFalse: - (rcvrIsInt or: [destReg ~= rcvrReg]) ifFalse: [self AddR: argReg R: destReg]. objectRepresentation genSetSmallIntegerTagsIn: argReg] ifFalse: [objectRepresentation genRemoveSmallIntegerTagsInScratchReg: argReg. self SubR: argReg R: destReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before doing send" + ((rcvrIsInt and: [rcvrIsConst]) or: [destReg ~= rcvrReg]) ifFalse: - (rcvrIsInt or: [destReg ~= rcvrReg]) ifFalse: [self AddR: argReg R: rcvrReg]. objectRepresentation genSetSmallIntegerTagsIn: argReg]]]. [AndRR] -> [argIsInt ifTrue: [self AndCq: argInt R: destReg] ifFalse: [self AndR: argReg R: destReg]. jumpContinue := self Jump: 0]. [OrRR] -> [argIsInt ifTrue: [self OrCq: argInt R: destReg] ifFalse: [self OrR: argReg R: destReg]. jumpContinue := self Jump: 0] }. jumpNotSmallInts jmpTarget: self Label. self ssPushRegister: destReg. self copySimStackToScratch: (simSpillBase min: simStackPtr - 1). self ssPop: 1. self ssFlushTo: simStackPtr. + rcvrReg = Arg0Reg + ifTrue: + [argReg = ReceiverResultReg + ifTrue: [self SwapR: Arg0Reg R: Arg0Reg Scratch: TempReg. argReg := Arg0Reg] + ifFalse: [self MoveR: rcvrReg R: ReceiverResultReg]. + rcvrReg := ReceiverResultReg]. - self deny: rcvrReg = Arg0Reg. argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg] ifFalse: [argReg ~= Arg0Reg ifTrue: [self MoveR: argReg R: Arg0Reg]]. rcvrReg ~= ReceiverResultReg ifTrue: [self MoveR: rcvrReg R: ReceiverResultReg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines. self reconcileRegisterStateForJoinAfterSpecialSelectorSend. jumpContinue jmpTarget: self Label. ^0! Item was changed: ----- Method: RegisterAllocatingCogit>>genSpecialSelectorComparison (in category 'bytecode generators') ----- genSpecialSelectorComparison | nextPC postBranchPC targetPC primDescriptor branchDescriptor + rcvrIsInt rcvrIsConst argIsIntConst argInt jumpNotSmallInts inlineCAB index rcvrReg argReg branchToTarget needMergeToContinue needMergeToTarget | - rcvrIsInt argIsInt argInt jumpNotSmallInts inlineCAB index rcvrReg argReg branchToTarget needMergeToContinue needMergeToTarget | <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #branchDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> primDescriptor := self generatorAt: byte0. + argIsIntConst := self ssTop type = SSConstant - argIsInt := self ssTop type = SSConstant and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject: (self ssValue: 1) constant]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: (self addressOf: simSelf)]]. - rcvrIsInt := (self ssValue: 1) type = SSConstant - and: [objectMemory isIntegerObject: (self ssValue: 1) constant]. + (argIsIntConst and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [^self genStaticallyResolvedSpecialSelectorComparison]. self extractMaybeBranchDescriptorInto: [ :descr :next :postBranch :target | branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetPC := target ]. "Only interested in inlining if followed by a conditional branch." inlineCAB := branchDescriptor isBranchTrue or: [branchDescriptor isBranchFalse]. "Further, only interested in inlining = and ~= if there's a SmallInteger constant involved. The relational operators successfully statically predict SmallIntegers; the equality operators do not." (inlineCAB and: [primDescriptor opcode = JumpZero or: [primDescriptor opcode = JumpNonZero]]) ifTrue: + [inlineCAB := argIsIntConst or: [rcvrIsInt]]. - [inlineCAB := argIsInt or: [rcvrIsInt]]. inlineCAB ifFalse: [^self genSpecialSelectorSend]. "In-line the comparison and the jump, but if the types are not SmallInteger then we will need to do a send and fall through to the following conditional branch. Since we're allocating values in registers we would like to keep those registers live on the inlined path and reload registers along the non-inlined send path. The merge logic at the branch destinations handles this." + argIsIntConst - argIsInt ifTrue: [rcvrReg := self allocateRegForStackEntryAt: 1. + (self ssValue: 1) popToReg: rcvrReg. + argReg := NoReg] - (self ssValue: 1) popToReg: rcvrReg] ifFalse: [self allocateRegForStackTopTwoEntriesInto: [:rTop :rNext| argReg := rTop. rcvrReg := rNext]. rcvrReg = Arg0Reg ifTrue: [rcvrReg := argReg. argReg := Arg0Reg]. self ssTop popToReg: argReg. + (self ssValue: 1) popToReg: rcvrReg]. - (self ssValue: 1) popToReg: rcvrReg. - rcvrIsInt ifFalse: - [self MoveR: argReg R: TempReg]]. self ssPop: 2. + jumpNotSmallInts := (rcvrIsInt and: [argIsIntConst]) ifFalse: + [argIsIntConst + ifTrue: [objectRepresentation genJumpNotSmallInteger: rcvrReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: argReg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: rcvrReg and: argReg scratch: TempReg]]]. + argIsIntConst - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifFalse: "Neither known to be ints; and them together for the test..." - [objectRepresentation genJumpNotSmallIntegersIn: rcvrReg andScratch: TempReg scratch: ClassReg] - ifTrue: "One known; in-place single-bit test for the other" - [objectRepresentation genJumpNotSmallInteger: (rcvrIsInt ifTrue: [argReg] ifFalse: [rcvrReg])]. - argIsInt ifTrue: [self CmpCq: argInt R: rcvrReg] ifFalse: [self CmpR: argReg R: rcvrReg]. "self printSimStack; printSimStack: (self fixupAt: postBranchPC) mergeSimStack; printSimStack: (self fixupAt: targetPC) mergeSimStack" "If there are merges to be performed on the forward branches we have to execute the merge code only along the path requiring that merge, and exactly once." needMergeToTarget := self mergeRequiredForJumpTo: targetPC. needMergeToContinue := self mergeRequiredForJumpTo: postBranchPC. "Cmp is weird/backwards so invert the comparison." (needMergeToTarget and: [needMergeToContinue]) ifTrue: [branchToTarget := self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) operand: 0. self Jump: (self ensureFixupAt: postBranchPC). branchToTarget jmpTarget: self Label. self Jump: (self ensureFixupAt: targetPC)]. (needMergeToTarget and: [needMergeToContinue not]) ifTrue: [self genConditionalBranch: (branchDescriptor isBranchFalse ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) operand: (self ensureFixupAt: postBranchPC) asUnsignedInteger. self Jump: (self ensureFixupAt: targetPC)]. (needMergeToTarget not and: [needMergeToContinue]) ifTrue: [self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) operand: (self ensureFixupAt: targetPC) asUnsignedInteger. self Jump: (self ensureFixupAt: postBranchPC)]. (needMergeToTarget or: [needMergeToContinue]) ifFalse: [self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) operand: (self ensureFixupAt: targetPC) asUnsignedInteger. self Jump: (self ensureFixupAt: postBranchPC)]. + jumpNotSmallInts ifNil: + [self annotateInstructionForBytecode. + deadCode := true. + ^0]. jumpNotSmallInts jmpTarget: self Label. self ssFlushTo: simStackPtr. + rcvrReg = Arg0Reg + ifTrue: + [argReg = ReceiverResultReg + ifTrue: [self SwapR: Arg0Reg R: Arg0Reg Scratch: TempReg. argReg := Arg0Reg] + ifFalse: [self MoveR: rcvrReg R: ReceiverResultReg]. + rcvrReg := ReceiverResultReg]. + argIsIntConst - self deny: rcvrReg = Arg0Reg. - argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg] ifFalse: [argReg ~= Arg0Reg ifTrue: [self MoveR: argReg R: Arg0Reg]]. rcvrReg ~= ReceiverResultReg ifTrue: [self MoveR: rcvrReg R: ReceiverResultReg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. ^self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines! Item was changed: ----- Method: RegisterAllocatingCogit>>mergeCurrentSimStackWith:forwards: (in category 'bytecode generator support') ----- mergeCurrentSimStackWith: fixup forwards: forwards "At a merge point the cogit expects the stack to be in the same state as mergeSimStack. mergeSimStack is the state as of some jump forward or backward to this point. So make simStack agree with mergeSimStack (it is, um, problematic to plant code at the jump). Values may have to be assigned to registers. Registers may have to be swapped. The state of optStatus must agree. Generate code to merge the current simStack with that of the target fixup, the goal being to keep as many registers live as possible. If the merge is forwards registers can be deassigned (since registers are always written to temp vars). But if backwards, nothing can be deassigned, and the state /must/ reflect the target." "self printSimStack; printSimStack: fixup mergeSimStack" + "abstractOpcodes object copyFrom: startIndex to: opcodeIndex" <var: #fixup type: #'BytecodeFixup *'> | startIndex mergeSimStack currentEntry targetEntry writtenToRegisters | <var: #mergeSimStack type: #'SimStackEntry *'> <var: #targetEntry type: #'SimStackEntry *'> <var: #currentEntry type: #'SimStackEntry *'> (mergeSimStack := fixup mergeSimStack) ifNil: [^self]. startIndex := opcodeIndex. "for debugging" "Assignments amongst the registers must be made in order to avoid overwriting. If necessary exchange registers amongst simStack's entries to resolve any conflicts." self resolveRegisterOrderConflictsBetweenCurrentSimStackAnd: mergeSimStack. (self asserta: (self conflictsResolvedBetweenSimStackAnd: mergeSimStack)) ifFalse: [Notification new tag: #failedMerge; signal]. writtenToRegisters := 0. (self pushForMergeWith: mergeSimStack) ifTrue: [methodOrBlockNumArgs to: simStackPtr do: [:i| currentEntry := self simStack: simStack at: i. targetEntry := self simStack: mergeSimStack at: i. writtenToRegisters := writtenToRegisters bitOr: targetEntry registerMask. (currentEntry reconcileForwardsWith: targetEntry) ifTrue: [self assert: i >= methodOrBlockNumArgs. self deassignRegisterForTempVar: targetEntry in: mergeSimStack]. "Note, we could update the simStack and spillBase here but that is done in restoreSimStackAtMergePoint: spilled ifFalse: [simSpillBase := i - 1]. simStack at: i put: (self cCode: [mergeSimStack at: i] inSmalltalk: [(mergeSimStack at: i) copy])"]] ifFalse: [simStackPtr to: methodOrBlockNumArgs by: -1 do: [:i| currentEntry := self simStack: simStack at: i. targetEntry := self simStack: mergeSimStack at: i. writtenToRegisters := writtenToRegisters bitOr: targetEntry registerMask. (currentEntry reconcileForwardsWith: targetEntry) ifTrue: [self assert: i >= methodOrBlockNumArgs. self deassignRegisterForTempVar: targetEntry in: mergeSimStack]. "Note, we could update the simStack and spillBase here but that is done in restoreSimStackAtMergePoint: spilled ifFalse: [simSpillBase := i - 1]. simStack at: i put: (self cCode: [mergeSimStack at: i] inSmalltalk: [(mergeSimStack at: i) copy])"]]. methodOrBlockNumArgs - 1 to: 0 by: -1 do: [:i| targetEntry := self simStack: mergeSimStack at: i. (targetEntry registerMask noMask: writtenToRegisters) ifTrue: [currentEntry := self simStack: simStack at: i. writtenToRegisters := writtenToRegisters bitOr: targetEntry registerMask. (currentEntry reconcileForwardsWith: targetEntry) ifTrue: [self assert: i >= methodOrBlockNumArgs. self deassignRegisterForTempVar: targetEntry in: mergeSimStack]]]. optStatus isReceiverResultRegLive ifFalse: [forwards ifTrue: "a.k.a. fixup isReceiverResultRegSelf: (fixup isReceiverResultRegSelf and: [optStatus isReceiverResultRegLive])" [fixup isReceiverResultRegSelf: false] ifFalse: [fixup isReceiverResultRegSelf ifTrue: [self putSelfInReceiverResultReg]]]! Item was added: + ----- Method: RegisterAllocatingCogit>>ssAllocateRequiredRegMask:upThrough:upThroughNative: (in category 'simulation stack') ----- + ssAllocateRequiredRegMask: requiredRegsMask upThrough: stackPtr upThroughNative: nativeStackPtr + "Override to void any required registers in temp vars." + (requiredRegsMask anyMask: (self registerMaskFor: ReceiverResultReg)) ifTrue: + [optStatus isReceiverResultRegLive: false. + optStatus ssEntry liveRegister: NoReg]. + 0 to: methodOrBlockNumTemps - 1 do: + [:i| + ((self simStackAt: i) registerMask anyMask: requiredRegsMask) ifTrue: + [(self simStackAt: i) liveRegister: 0]]. + super ssAllocateRequiredRegMask: requiredRegsMask upThrough: stackPtr upThroughNative: nativeStackPtr! Item was changed: ----- Method: SimpleStackBasedCogit>>genLongUnconditionalBackwardJump (in category 'bytecode generators') ----- genLongUnconditionalBackwardJump + | distance | - | distance targetpc | distance := self v3: (self generatorAt: byte0) Long: bytecodePC Branch: 0 Distance: methodObj. self assert: distance < 0. + ^self genJumpBackTo: distance + 2 + bytecodePC! - targetpc := distance + 2 + bytecodePC. - ^self genJumpBackTo: targetpc! Item was changed: ----- Method: SistaCogit>>genSpecialSelectorComparison (in category 'bytecode generators') ----- genSpecialSelectorComparison "Override to count inlined branches if followed by a conditional branch. We borrow the following conditional branch's counter and when about to inline the comparison we decrement the counter (without writing it back) and if it trips simply abort the inlining, falling back to the normal send which will then continue to the conditional branch which will trip and enter the abort." + | nextPC postBranchPC targetPC primDescriptor branchDescriptor + rcvrIsInt rcvrIsConst argIsIntConst argInt jumpNotSmallInts inlineCAB - | nextPC postBranchPC targetBytecodePC primDescriptor branchDescriptor - rcvrIsInt argIsInt argInt jumpNotSmallInts inlineCAB counterAddress countTripped counterReg index | <var: #countTripped type: #'AbstractInstruction *'> <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> <var: #branchDescriptor type: #'BytecodeDescriptor *'> (coInterpreter isOptimizedMethod: methodObj) ifTrue: [ ^ self genSpecialSelectorComparisonWithoutCounters ]. self ssFlushTo: simStackPtr - 2. primDescriptor := self generatorAt: byte0. + argIsIntConst := self ssTop type = SSConstant - argIsInt := self ssTop type = SSConstant and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject:(self ssValue: 1) constant]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: simSelf]]. - rcvrIsInt := (self ssValue: 1) type = SSConstant - and: [objectMemory isIntegerObject: (self ssValue: 1) constant]. "short-cut the jump if operands are SmallInteger constants." + (argIsIntConst and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [^ self genStaticallyResolvedSpecialSelectorComparison]. self extractMaybeBranchDescriptorInto: [ :descr :next :postBranch :target | + branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetPC := target ]. - branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetBytecodePC := target ]. "Only interested in inlining if followed by a conditional branch." inlineCAB := branchDescriptor isBranchTrue or: [branchDescriptor isBranchFalse]. "Further, only interested in inlining = and ~= if there's a SmallInteger constant involved. The relational operators successfully statically predict SmallIntegers; the equality operators do not." (inlineCAB and: [primDescriptor opcode = JumpZero or: [primDescriptor opcode = JumpNonZero]]) ifTrue: + [inlineCAB := argIsIntConst or: [rcvrIsInt]]. - [inlineCAB := argIsInt or: [rcvrIsInt]]. inlineCAB ifFalse: [^self genSpecialSelectorSend]. + argIsIntConst - argIsInt ifTrue: [(self ssValue: 1) popToReg: ReceiverResultReg. + self ssPop: 2] - self ssPop: 2. - self MoveR: ReceiverResultReg R: TempReg] ifFalse: + [self marshallSendArguments: 1]. + jumpNotSmallInts := (rcvrIsInt and: [argIsIntConst]) ifFalse: + [argIsIntConst + ifTrue: [objectRepresentation genJumpNotSmallInteger: ReceiverResultReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: Arg0Reg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg and: Arg0Reg scratch: TempReg]]]. - [self marshallSendArguments: 1. - self MoveR: Arg0Reg R: TempReg]. - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifTrue: [objectRepresentation genJumpNotSmallIntegerInScratchReg: TempReg] - ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg andScratch: TempReg scratch: ClassReg]. counterReg := self allocateRegNotConflictingWith: (self registerMaskFor: ReceiverResultReg and: Arg0Reg). self genExecutionCountLogicInto: [ :cAddress :countTripBranch | counterAddress := cAddress. countTripped := countTripBranch ] counterReg: counterReg. + argIsIntConst - argIsInt ifTrue: [self CmpCq: argInt R: ReceiverResultReg] ifFalse: [self CmpR: Arg0Reg R: ReceiverResultReg]. "Cmp is weird/backwards so invert the comparison. Further since there is a following conditional jump bytecode define non-merge fixups and leave the cond bytecode to set the mergeness." self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) + operand: (self ensureNonMergeFixupAt: targetPC) asUnsignedInteger. - operand: (self ensureNonMergeFixupAt: targetBytecodePC) asUnsignedInteger. self genFallsThroughCountLogicCounterReg: counterReg counterAddress: counterAddress. self Jump: (self ensureNonMergeFixupAt: postBranchPC). + countTripped jmpTarget: self Label. + jumpNotSmallInts ifNil: + [self annotateInstructionForBytecode. + self ensureFixupAt: postBranchPC. + self ensureFixupAt: targetPC. + deadCode := true. + ^0]. + jumpNotSmallInts jmpTarget: countTripped getJmpTarget. - countTripped jmpTarget: (jumpNotSmallInts jmpTarget: self Label). + argIsIntConst ifTrue: - argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. ^self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines! Item was changed: ----- Method: SistaRegisterAllocatingCogit>>genSpecialSelectorComparison (in category 'bytecode generators') ----- genSpecialSelectorComparison "Override to count inlined branches if followed by a conditional branch. We borrow the following conditional branch's counter and when about to inline the comparison we decrement the counter (without writing it back) and if it trips simply abort the inlining, falling back to the normal send which will then continue to the conditional branch which will trip and enter the abort." + | nextPC postBranchPC targetPC primDescriptor branchDescriptor + rcvrIsInt rcvrIsConst argIsIntConst argInt jumpNotSmallInts inlineCAB - | nextPC postBranchPC targetBytecodePC primDescriptor branchDescriptor - rcvrIsInt argIsInt argInt jumpNotSmallInts inlineCAB counterAddress countTripped counterReg index rcvrReg argReg | <var: #countTripped type: #'AbstractInstruction *'> <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> <var: #branchDescriptor type: #'BytecodeDescriptor *'> (coInterpreter isOptimizedMethod: methodObj) ifTrue: [^self genSpecialSelectorComparisonWithoutCounters]. primDescriptor := self generatorAt: byte0. + argIsIntConst := self ssTop type = SSConstant - argIsInt := self ssTop type = SSConstant and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject: (self ssValue: 1) constant]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: (self addressOf: simSelf)]]. - rcvrIsInt := (self ssValue: 1) type = SSConstant - and: [objectMemory isIntegerObject: (self ssValue: 1) constant]. "short-cut the jump if operands are SmallInteger constants." + (argIsIntConst and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [^ self genStaticallyResolvedSpecialSelectorComparison]. self extractMaybeBranchDescriptorInto: [ :descr :next :postBranch :target | + branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetPC := target ]. - branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetBytecodePC := target ]. "Only interested in inlining if followed by a conditional branch." inlineCAB := branchDescriptor isBranchTrue or: [branchDescriptor isBranchFalse]. "Further, only interested in inlining = and ~= if there's a SmallInteger constant involved. The relational operators successfully statically predict SmallIntegers; the equality operators do not." (inlineCAB and: [primDescriptor opcode = JumpZero or: [primDescriptor opcode = JumpNonZero]]) ifTrue: + [inlineCAB := argIsIntConst or: [rcvrIsInt]]. - [inlineCAB := argIsInt or: [rcvrIsInt]]. inlineCAB ifFalse: [^self genSpecialSelectorSend]. "In-line the comparison and the jump, but if the types are not SmallInteger then we will need to do a send and fall through to the following conditional branch. Since we're allocating values in registers we would like to keep those registers live on the inlined path and reload registers along the non-inlined send path. The merge logic at the branch destinations handles this." + argIsIntConst - argIsInt ifTrue: [rcvrReg := self allocateRegForStackEntryAt: 1. (self ssValue: 1) popToReg: rcvrReg. - self MoveR: rcvrReg R: TempReg. counterReg := self allocateRegNotConflictingWith: (self registerMaskFor: rcvrReg)] ifFalse: [self allocateRegForStackTopTwoEntriesInto: [:rTop :rNext| argReg := rTop. rcvrReg := rNext]. rcvrReg = Arg0Reg ifTrue: [rcvrReg := argReg. argReg := Arg0Reg]. self ssTop popToReg: argReg. (self ssValue: 1) popToReg: rcvrReg. - self MoveR: argReg R: TempReg. counterReg := self allocateRegNotConflictingWith: (self registerMaskFor: rcvrReg and: argReg)]. + jumpNotSmallInts := (rcvrIsInt and: [argIsIntConst]) ifFalse: + [argIsIntConst + ifTrue: [objectRepresentation genJumpNotSmallInteger: ReceiverResultReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: Arg0Reg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg and: Arg0Reg scratch: TempReg]]]. - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifTrue: [objectRepresentation genJumpNotSmallIntegerInScratchReg: TempReg] - ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: rcvrReg andScratch: TempReg scratch: ClassReg]. self genExecutionCountLogicInto: [ :cAddress :countTripBranch | counterAddress := cAddress. countTripped := countTripBranch ] counterReg: counterReg. + argIsIntConst - argIsInt ifTrue: [self CmpCq: argInt R: rcvrReg] ifFalse: [self CmpR: argReg R: rcvrReg]. "Cmp is weird/backwards so invert the comparison. Further since there is a following conditional jump bytecode define non-merge fixups and leave the cond bytecode to set the mergeness." self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) + operand: (self ensureFixupAt: targetPC) asUnsignedInteger. - operand: (self ensureFixupAt: targetBytecodePC) asUnsignedInteger. self genFallsThroughCountLogicCounterReg: counterReg counterAddress: counterAddress. self Jump: (self ensureFixupAt: postBranchPC). + countTripped jmpTarget: self Label. + jumpNotSmallInts ifNil: + [self annotateInstructionForBytecode. + deadCode := true. + ^0]. + jumpNotSmallInts jmpTarget: countTripped getJmpTarget. - countTripped jmpTarget: (jumpNotSmallInts jmpTarget: self Label). self ssFlushTo: simStackPtr. self deny: rcvrReg = Arg0Reg. + argIsIntConst - argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg] ifFalse: [argReg ~= Arg0Reg ifTrue: [self MoveR: argReg R: Arg0Reg]]. rcvrReg ~= ReceiverResultReg ifTrue: [self MoveR: rcvrReg R: ReceiverResultReg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. ^self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines! Item was added: + ----- Method: Spur32BitCoMemoryManager>>receiverTagBitsForMethod: (in category 'cog jit support') ----- + receiverTagBitsForMethod: aMethodObj + "Answer the tag bits for the receiver based on the method's methodClass, if any." + <api> + | methodClass | + methodClass := coInterpreter methodClassOf: aMethodObj. + (self instSpecOfClass: methodClass) ~= self forwardedFormat ifTrue: + [^0]. + ^methodClass = (self fetchPointer: self smallIntegerTag ofObject: classTableFirstPage) + ifTrue: [self smallIntegerTag] + ifFalse: [self assert: methodClass = (self fetchPointer: self characterTag ofObject: classTableFirstPage). + self characterTag]! Item was added: + ----- Method: Spur64BitCoMemoryManager>>classSmallFloat (in category 'accessing') ----- + classSmallFloat + <api> + ^self fetchPointer: self smallFloatTag ofObject: classTableFirstPage! Item was added: + ----- Method: Spur64BitCoMemoryManager>>receiverTagBitsForMethod: (in category 'cog jit support') ----- + receiverTagBitsForMethod: aMethodObj + "Answer the tag bits for the receiver based on the method's methodClass, if any." + <api> + | methodClass | + methodClass := coInterpreter methodClassOf: aMethodObj. + (self instSpecOfClass: methodClass) ~= self forwardedFormat ifTrue: + [^0]. + methodClass = (self fetchPointer: self smallIntegerTag ofObject: classTableFirstPage) ifTrue: + [^self smallIntegerTag]. + methodClass = (self fetchPointer: self characterTag ofObject: classTableFirstPage) ifTrue: + [^self characterTag]. + self assert: methodClass = (self fetchPointer: self smallFloatTag ofObject: classTableFirstPage). + ^self smallFloatTag! Item was removed: - ----- Method: Spur64BitCoMemoryManager>>smallIntegerTag (in category 'cog jit support') ----- - smallIntegerTag - <api> - <cmacro> - ^1! Item was removed: - ----- Method: Spur64BitMemoryManager>>smallIntegerTag (in category 'cog jit support') ----- - smallIntegerTag - <cmacro> - ^1! Item was changed: ----- Method: SpurMemoryManager>>smallIntegerTag (in category 'cog jit support') ----- smallIntegerTag + <api> + <cmacro> + ^1! - ^self subclassResponsibility! Item was changed: ----- Method: StackInterpreter>>lookupSelector:inClass: (in category 'debug support') ----- lookupSelector: selector inClass: class + "Lookup selector in class. Answer the method or nil. This is a debugging routine. + It does /not/ side-effect lookupClass or newMethod." - "Lookup selector in class. Answer the method or nil. This is a debugging routine." | currentClass dictionary | <api> currentClass := class. [currentClass ~= objectMemory nilObject] whileTrue: [dictionary := objectMemory followObjField: MethodDictionaryIndex ofObject: currentClass. dictionary = objectMemory nilObject ifTrue: [^nil]. (self lookupMethodFor: selector InDictionary: dictionary) ifNotNil: [:meth| ^meth]. currentClass := self superclassOf: currentClass]. ^nil! Item was changed: ----- Method: StackToRegisterMappingCogit>>genSpecialSelectorArithmetic (in category 'bytecode generators') ----- genSpecialSelectorArithmetic | primDescriptor rcvrIsConst argIsConst rcvrIsInt argIsInt rcvrInt argInt result jumpNotSmallInts jumpContinue index | <var: #jumpContinue type: #'AbstractInstruction *'> <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> primDescriptor := self generatorAt: byte0. argIsInt := (argIsConst := self ssTop type = SSConstant) and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject: (rcvrInt := (self ssValue: 1) constant)]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: (self addressOf: simSelf)]]. - rcvrIsInt := (rcvrIsConst := (self ssValue: 1) type = SSConstant) - and: [objectMemory isIntegerObject: (rcvrInt := (self ssValue: 1) constant)]. + (argIsInt and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [rcvrInt := objectMemory integerValueOf: rcvrInt. argInt := objectMemory integerValueOf: argInt. primDescriptor opcode caseOf: { [AddRR] -> [result := rcvrInt + argInt]. [SubRR] -> [result := rcvrInt - argInt]. [AndRR] -> [result := rcvrInt bitAnd: argInt]. [OrRR] -> [result := rcvrInt bitOr: argInt] }. (objectMemory isIntegerValue: result) ifTrue: ["Must annotate the bytecode for correct pc mapping." ^self ssPop: 2; ssPushAnnotatedConstant: (objectMemory integerObjectOf: result)]. ^self genSpecialSelectorSend]. "If there's any constant involved other than a SmallInteger don't attempt to inline." ((rcvrIsConst and: [rcvrIsInt not]) or: [argIsConst and: [argIsInt not]]) ifTrue: [^self genSpecialSelectorSend]. "If we know nothing about the types then better not to inline as the inline cache and primitive code is not terribly slow so wasting time on duplicating tag tests is pointless." (argIsInt or: [rcvrIsInt]) ifFalse: [^self genSpecialSelectorSend]. argIsInt ifTrue: [self ssFlushTo: simStackPtr - 2. (self ssValue: 1) popToReg: ReceiverResultReg. + self ssPop: 2] - self ssPop: 2. - self MoveR: ReceiverResultReg R: TempReg] ifFalse: + [self marshallSendArguments: 1]. + jumpNotSmallInts := (rcvrIsInt and: [argIsInt]) ifFalse: + [argIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: ReceiverResultReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: Arg0Reg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg and: Arg0Reg scratch: TempReg]]]. - [self marshallSendArguments: 1. - self MoveR: Arg0Reg R: TempReg]. - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifTrue: [objectRepresentation genJumpNotSmallIntegerInScratchReg: TempReg] - ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg andScratch: TempReg scratch: ClassReg]. primDescriptor opcode caseOf: { [AddRR] -> [argIsInt ifTrue: [self AddCq: argInt - ConstZero R: ReceiverResultReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before continuing" self SubCq: argInt - ConstZero R: ReceiverResultReg] ifFalse: [objectRepresentation genRemoveSmallIntegerTagsInScratchReg: ReceiverResultReg. self AddR: Arg0Reg R: ReceiverResultReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before continuing" + (rcvrIsInt and: [rcvrIsConst]) - rcvrIsInt ifTrue: [self MoveCq: rcvrInt R: ReceiverResultReg] ifFalse: [self SubR: Arg0Reg R: ReceiverResultReg. objectRepresentation genSetSmallIntegerTagsIn: ReceiverResultReg]]]. [SubRR] -> [argIsInt ifTrue: [self SubCq: argInt - ConstZero R: ReceiverResultReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before continuing" self AddCq: argInt - ConstZero R: ReceiverResultReg] ifFalse: [objectRepresentation genRemoveSmallIntegerTagsInScratchReg: Arg0Reg. self SubR: Arg0Reg R: ReceiverResultReg. jumpContinue := self JumpNoOverflow: 0. "overflow; must undo the damage before continuing" self AddR: Arg0Reg R: ReceiverResultReg. objectRepresentation genSetSmallIntegerTagsIn: Arg0Reg]]. [AndRR] -> [argIsInt ifTrue: [self AndCq: argInt R: ReceiverResultReg] ifFalse: [self AndR: Arg0Reg R: ReceiverResultReg]. + jumpContinue := jumpNotSmallInts ifNotNil: [self Jump: 0]]. - jumpContinue := self Jump: 0]. [OrRR] -> [argIsInt ifTrue: [self OrCq: argInt R: ReceiverResultReg] ifFalse: [self OrR: Arg0Reg R: ReceiverResultReg]. + jumpContinue := jumpNotSmallInts ifNotNil: [self Jump: 0]] }. + jumpNotSmallInts + ifNil: [jumpContinue ifNil: "overflow cannot happen" + [self annotateInstructionForBytecode. + self ssPushRegister: ReceiverResultReg. + ^0]] + ifNotNil: + [jumpNotSmallInts jmpTarget: self Label]. - jumpContinue := self Jump: 0] }. - jumpNotSmallInts jmpTarget: self Label. argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines. jumpContinue jmpTarget: self Label. ^0! Item was changed: ----- Method: StackToRegisterMappingCogit>>genSpecialSelectorComparison (in category 'bytecode generators') ----- genSpecialSelectorComparison + | nextPC postBranchPC targetPC primDescriptor branchDescriptor + rcvrIsInt rcvrIsConst argIsIntConst argInt jumpNotSmallInts inlineCAB index | - | nextPC postBranchPC targetBytecodePC primDescriptor branchDescriptor - rcvrIsInt argIsInt argInt jumpNotSmallInts inlineCAB index | <var: #primDescriptor type: #'BytecodeDescriptor *'> <var: #branchDescriptor type: #'BytecodeDescriptor *'> <var: #jumpNotSmallInts type: #'AbstractInstruction *'> self ssFlushTo: simStackPtr - 2. primDescriptor := self generatorAt: byte0. + argIsIntConst := self ssTop type = SSConstant - argIsInt := self ssTop type = SSConstant and: [objectMemory isIntegerObject: (argInt := self ssTop constant)]. + rcvrIsInt := ((rcvrIsConst := (self ssValue: 1) type = SSConstant) + and: [objectMemory isIntegerObject: (self ssValue: 1) constant]) + or: [self mclassIsSmallInteger and: [(self ssValue: 1) isSameEntryAs: (self addressOf: simSelf)]]. - rcvrIsInt := (self ssValue: 1) type = SSConstant - and: [objectMemory isIntegerObject: (self ssValue: 1) constant]. + (argIsIntConst and: [rcvrIsInt and: [rcvrIsConst]]) ifTrue: - (argIsInt and: [rcvrIsInt]) ifTrue: [^ self genStaticallyResolvedSpecialSelectorComparison]. self extractMaybeBranchDescriptorInto: [ :descr :next :postBranch :target | + branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetPC := target ]. - branchDescriptor := descr. nextPC := next. postBranchPC := postBranch. targetBytecodePC := target ]. "Only interested in inlining if followed by a conditional branch." inlineCAB := branchDescriptor isBranchTrue or: [branchDescriptor isBranchFalse]. "Further, only interested in inlining = and ~= if there's a SmallInteger constant involved. The relational operators successfully statically predict SmallIntegers; the equality operators do not." (inlineCAB and: [primDescriptor opcode = JumpZero or: [primDescriptor opcode = JumpNonZero]]) ifTrue: + [inlineCAB := argIsIntConst or: [rcvrIsInt]]. - [inlineCAB := argIsInt or: [rcvrIsInt]]. inlineCAB ifFalse: [^self genSpecialSelectorSend]. + argIsIntConst - argIsInt ifTrue: [(self ssValue: 1) popToReg: ReceiverResultReg. self ssPop: 2] ifFalse: + [self marshallSendArguments: 1]. + jumpNotSmallInts := (rcvrIsInt and: [argIsIntConst]) ifFalse: + [argIsIntConst + ifTrue: [objectRepresentation genJumpNotSmallInteger: ReceiverResultReg] + ifFalse: + [rcvrIsInt + ifTrue: [objectRepresentation genJumpNotSmallInteger: Arg0Reg] + ifFalse: [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg and: Arg0Reg scratch: TempReg]]]. + argIsIntConst - [self marshallSendArguments: 1. - rcvrIsInt ifFalse: - [self MoveR: Arg0Reg R: TempReg]]. - jumpNotSmallInts := (argIsInt or: [rcvrIsInt]) - ifFalse: "Neither known to be ints; and them together for the test..." - [objectRepresentation genJumpNotSmallIntegersIn: ReceiverResultReg andScratch: TempReg scratch: ClassReg] - ifTrue: "One known; in-place single-bit test for the other" - [objectRepresentation genJumpNotSmallInteger: (rcvrIsInt ifTrue: [Arg0Reg] ifFalse: [ReceiverResultReg])]. - argIsInt ifTrue: [self CmpCq: argInt R: ReceiverResultReg] ifFalse: [self CmpR: Arg0Reg R: ReceiverResultReg]. "Cmp is weird/backwards so invert the comparison. Further since there is a following conditional jump bytecode define non-merge fixups and leave the cond bytecode to set the mergeness." self genConditionalBranch: (branchDescriptor isBranchTrue ifTrue: [primDescriptor opcode] ifFalse: [self inverseBranchFor: primDescriptor opcode]) + operand: (self ensureNonMergeFixupAt: targetPC) asUnsignedInteger. - operand: (self ensureNonMergeFixupAt: targetBytecodePC) asUnsignedInteger. self Jump: (self ensureNonMergeFixupAt: postBranchPC). + jumpNotSmallInts ifNil: + [self annotateInstructionForBytecode. + self ensureFixupAt: postBranchPC. + self ensureFixupAt: targetPC. + deadCode := true. + ^0]. jumpNotSmallInts jmpTarget: self Label. + argIsIntConst ifTrue: - argIsInt ifTrue: [self MoveCq: argInt R: Arg0Reg]. index := byte0 - self firstSpecialSelectorBytecodeOffset. ^self genMarshalledSend: index negated - 1 numArgs: 1 sendTable: ordinarySendTrampolines! Item was added: + ----- Method: StackToRegisterMappingCogit>>simSelf (in category 'accessing') ----- + simSelf + ^simSelf! Item was changed: ----- Method: StackToRegisterMappingCogit>>ssAllocateRequiredRegMask:upThrough:upThroughNative: (in category 'simulation stack') ----- ssAllocateRequiredRegMask: requiredRegsMask upThrough: stackPtr upThroughNative: nativeStackPtr | lastRequired lastRequiredNative liveRegs | lastRequired := -1. lastRequiredNative := -1. "compute live regs while noting the last occurrence of required regs. If these are not free we must spill from simSpillBase to last occurrence. Note we are conservative here; we could allocate FPReg in frameless methods." liveRegs := self registerMaskFor: FPReg and: SPReg. (simSpillBase max: 0) to: stackPtr do: [:i| liveRegs := liveRegs bitOr: (self simStackAt: i) registerMask. ((self simStackAt: i) registerMask bitAnd: requiredRegsMask) ~= 0 ifTrue: [lastRequired := i]]. + LowcodeVM ifTrue: + [(simNativeSpillBase max: 0) to: nativeStackPtr do: - LowcodeVM ifTrue: [ - (simNativeSpillBase max: 0) to: nativeStackPtr do: [:i| liveRegs := liveRegs bitOr: (self simNativeStackAt: i) nativeRegisterMask. + ((self simNativeStackAt: i) nativeRegisterMask anyMask: requiredRegsMask) ifTrue: + [lastRequiredNative := i]]]. - ((self simNativeStackAt: i) nativeRegisterMask bitAnd: requiredRegsMask) ~= 0 ifTrue: - [lastRequiredNative := i]]. - ]. "If any of requiredRegsMask are live we must spill." + (liveRegs anyMask: requiredRegsMask) ifTrue: + [self ssFlushTo: lastRequired nativeFlushTo: lastRequiredNative. - (liveRegs bitAnd: requiredRegsMask) = 0 ifFalse: - ["Some live, must spill" - self ssFlushTo: lastRequired nativeFlushTo: lastRequiredNative. self assert: (self liveRegisters bitAnd: requiredRegsMask) = 0]!

2 1

Compactor not working > News?
by phil＠highoctane.be 02 Mar '17

02 Mar '17

I have been trying the latest Pharo VM since there was compaction support brought in. But it doesn't seem to work as advertised. Any status update on this? Phil

3 3

Re: [Vm-dev] [Pharo-dev] shallowCopy problem on 64 bit Pharo ?
by Clément Bera 01 Mar '17

01 Mar '17

I remember there was a discussion about that somewhere but I can't find it. I cc vm-dev they may have a clue. When copying a pointer object in 64 bits instead of 32 bits, you need to copy twice many data, so it is going to be slower in any case. 2.63 times slower seems to be too much however. The latest Pharo 64 bits image can be found here: https://ci.inria.fr/pharo/job/Pharo-6.0-Update-Step-3.1-64bits/ The latest Pharo 64 bits VM can be found here: https://bintray.com/opensmalltalk/vm/cog Best, On Sun, Feb 5, 2017 at 1:27 PM, Ciprian Teodorov <ciprian.teodorov(a)gmail.com > wrote: > Hi all, > > I'm very happy to see that the 64 bit Pharo vm is progressing. > I've even managed to get a ~6.85 GB heap allocated (see > http://bit.ly/2lbp8n6). > This is great! > > There seems however to be a small problem with the #shallowCopy message, > which is 2.63 times slower on the 64bit VM (image/vm details bellow). > > The bench that I used is a simple random graph analysis tool that is > intended to do a lot of random memory accesses on big heaps, which is > accessible at http://www.smalltalkhub.com/#!/~CipT/PlugMC > In this case I expect the execution time to be dominated by the Set > implementation (which is the case with pharo 5 -- see > http://bit.ly/2lbzJhd), and not by the array copy (see > http://bit.ly/2kvbqvy). > > Is this a 64bit limitation, or only a feature "not yet available" ? > Where can I access the latests versions of 64 bit pharo image and vm ? > > Image > ----- > /Users/ciprian/Downloads/Pharo64/60371-64/Pharo64-60371.image > Pharo6.0 > Latest update: #60371 > Unnamed > > Virtual Machine > --------------- > /Users/ciprian/Downloads/Pharo64/Pharo 4.app/Contents/MacOS/Pharo > CoInterpreter * VMMaker.oscog-eem.2111 uuid: 7c02b557-bdcc-4a91-92b1-7fc15f1e8605 > Jan 27 2017 > StackToRegisterMappingCogit * VMMaker.oscog-eem.2111 uuid: > 7c02b557-bdcc-4a91-92b1-7fc15f1e8605 Jan 27 2017 > VM: 201701271449 https://github.com/pharo-project/pharo-vm.git $ Date: > Fri Jan 27 15:49:20 2017 +0100 $ Plugins: 201701271449 https://github. > com/pharo-project/pharo-vm.git $ > > Mac OS X built on Jan 27 2017 15:28:14 UTC Compiler: 4.2.1 Compatible > Apple LLVM 7.3.0 (clang-703.0.31) > VMMaker versionString VM: 201701271449 https://github. > com/pharo-project/pharo-vm.git $ Date: Fri Jan 27 15:49:20 2017 +0100 $ > Plugins: 201701271449 https://github.com/pharo-project/pharo-vm.git $ > CoInterpreter * VMMaker.oscog-eem.2111 uuid: 7c02b557-bdcc-4a91-92b1-7fc15f1e8605 > Jan 27 2017 > StackToRegisterMappingCogit * VMMaker.oscog-eem.2111 uuid: > 7c02b557-bdcc-4a91-92b1-7fc15f1e8605 Jan 27 2017 > > > Cheers, > -- > Dr. Ciprian TEODOROV > Enseignant-chercheur > ENSTA Bretagne > > tél : 06 08 54 73 48 > mail : ciprian.teodorov(a)gmail.com > www.teodorov.ro >

6 11

Squeak COG v3 hangs during startup
by Nicolas Cellier 28 Feb '17

28 Feb '17

Hi, I can't open an image with recent squeak.cog.v3 builds (at least on macosx). The VM hangs in a sort of infinite loop with 100% CPU before the window open If I sample the application I get something like Call graph: 2451 Thread_2029969 DispatchQueue_1: com.apple.main-thread (serial) + 2445 start (in libdyld.dylib) + 1 [0x9ea6c6ad] + ! 2445 NSApplicationMain (in AppKit) + 1630 [0x9b8f9469] + ! 2445 -[NSApplication run] (in AppKit) + 1063 [0x9b932b47] + ! 2445 -[NSApplication nextEventMatchingMask:untilDate:inMode:dequeue:] (in AppKit) + 121 [0x9b93f432] + ! 2445 -[NSApplication _nextEventMatchingEventMask:untilDate:inMode:dequeue:] (in AppKit) + 1057 [0x9b93f85b] + ! 2445 _DPSNextEvent (in AppKit) + 1053 [0x9b9402e2] + ! 2445 _BlockUntilNextEventMatchingListInModeWithFilter (in HIToolbox) + 99 [0x93703eec] + ! 2445 ReceiveNextEventCommon (in HIToolbox) + 201 [0x93703fc5] + ! 2445 RunCurrentEventLoopInMode (in HIToolbox) + 267 [0x937042f1] + ! 2445 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] + ! 2445 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] + ! 2445 __CFRunLoopRun (in CoreFoundation) + 946 [0x9b4dbee2] + ! 2445 __CFRunLoopDoObservers (in CoreFoundation) + 398 [0x9b4fe7be] + ! 2445 __CFRUNLOOP_IS_CALLING_OUT_TO_ AN_OBSERVER_CALLBACK_FUNCTION__ (in CoreFoundation) + 30 [0x9b4fe85e] + ! 2445 __NSFirePerformWithOrder (in Foundation) + 416 [0x9e33e619] + ! 2445 -[sqSqueakMainApplication runSqueak] (in Squeak) + 439 [0x1518f9] sqSqueakMainApplication.m:201 + ! 2445 interpret (in Squeak) + 641 [0xfcbd5] gcc3x-cointerp.c:2274 + ! 2344 ??? (in <unknown binary>) [0x1f406c51] + ! : 2342 primitiveFindHandlerContext (in Squeak) + 62 [0x12632e] gcc3x-cointerp.c:52399 + ! : | 1530 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 43,48 [0x12a3a1,0x12a3a6] gcc3x-cointerp.c:42898 + ! : | 217 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 78,40,... [0x12a3c4,0x12a39e,...] sqMemoryAccess.h:141 + ! : | 157 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 84,244 [0x12a3ca,0x12a46a] gcc3x-cointerp.c:30947 + ! : | 153 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 91 [0x12a3d1] gcc3x-cointerp.c:46233 + ! : | 98 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 109,93,... [0x12a3e3,0x12a3d3,...] gcc3x-cointerp.c:46234 + ! : | 59 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 59,63 [0x12a3b1,0x12a3b5] gcc3x-cointerp.c:42899 + ! : | 42 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 114,111,... [0x12a3e8,0x12a3e5,...] gcc3x-cointerp.c:42905 + ! : | 36 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 347,349,... [0x12a4d1,0x12a4d3,...] gcc3x-cointerp.c:42895 + ! : | 21 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 88 [0x12a3ce] gcc3x-cointerp.c:30951 + ! : | 10 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 69,72 [0x12a3bb,0x12a3be] gcc3x-cointerp.c:42902 + ! : | 10 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 134 [0x12a3fc] gcc3x-cointerp.c:42911 + ! : | + 7 isWidowedContext (in Squeak) + 61 [0x103c3c] sqMemoryAccess.h:141 + ! : | + 2 isWidowedContext (in Squeak) + 45 [0x103c2c] gcc3x-cointerp.c:8819 + ! : | + 1 isWidowedContext (in Squeak) + 114 [0x103c71] gcc3x-cointerp.c:44170 + ! : | 5 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 167 [0x12a41d] gcc3x-cointerp.c:42926 + ! : | 4 findMethodWithPrimitiveFromContextUpToContext (in Squeak) + 324 [0x12a4ba] gcc3x-cointerp.c:42969 + ! : 2 primitiveFindHandlerContext (in Squeak) + 77 [0x12633d] sqMemoryAccess.h:142 + ! 88 ??? (in <unknown binary>) [0x1f4027f7] + ! : 88 primitiveNewWithArg (in Squeak) + 260 [0x12043b] gcc3x-cointerp.c:26639 + ! : 80 sufficientSpaceAfterGC (in Squeak) + 64 [0x117793] gcc3x-cointerp.c:35969 + ! : | 39 fullGC (in Squeak) + 172 [0x112d0a] gcc3x-cointerp.c:32931 + ! : | + 39 markPhase (in Squeak) + 23 [0x11310c] gcc3x-cointerp.c:34292 + ! : | + 39 markAndTraceInterpreterOops (in Squeak) + 105 [0x129a17] gcc3x-cointerp.c:45375 + ! : | + 25 markAndTraceStackPage (in Squeak) + 89 [0x129efe] gcc3x-cointerp.c:13328 + ! : | + ! 9 markAndTrace (in Squeak) + 457,461 [0x117e06,0x117e0a] gcc3x-cointerp.c:39020 + ! : | + ! 6 markAndTrace (in Squeak) + 368,379,... [0x117dad,0x117db8,...] sqMemoryAccess.h:141 + ! : | + ! 3 markAndTrace (in Squeak) + 381 [0x117dba] gcc3x-cointerp.c:38976 + ! : | + ! 2 markAndTrace (in Squeak) + 593,430 [0x117e8e,0x117deb] sqMemoryAccess.h:142 + ! : | + ! 1 markAndTrace (in Squeak) + 387 [0x117dc0] gcc3x-cointerp.c:38973 + ! : | + ! 1 markAndTrace (in Squeak) + 436 [0x117df1] gcc3x-cointerp.c:39008 + ! : | + ! 1 markAndTrace (in Squeak) + 464 [0x117e0d] gcc3x-cointerp.c:39030 + ! : | + ! 1 markAndTrace (in Squeak) + 377 [0x117db6] gcc3x-cointerp.c:39126 + ! : | + ! 1 markAndTrace (in Squeak) + 811 [0x117f68] gcc3x-cointerp.c:39137 + ! : | + 14 markAndTraceStackPage (in Squeak) + 131 [0x129f28] gcc3x-cointerp.c:13336 + ! : | + 5 markAndTrace (in Squeak) + 457 [0x117e06] gcc3x-cointerp.c:39020 + ! : | + 3 markAndTrace (in Squeak) + 455,536 [0x117e04,0x117e55] sqMemoryAccess.h:141 + ! : | + 2 markAndTrace (in Squeak) + 370 [0x117daf] sqMemoryAccess.h:142 + ! : | + 1 markAndTrace (in Squeak) + 387 [0x117dc0] gcc3x-cointerp.c:38973 + ! : | + 1 markAndTrace (in Squeak) + 446 [0x117dfb] gcc3x-cointerp.c:39012 + ! : | + 1 markAndTrace (in Squeak) + 671 [0x117edc] gcc3x-cointerp.c:39049 + ! : | + 1 markAndTrace (in Squeak) + 683 [0x117ee8] gcc3x-cointerp.c:39050 + ! : | 27 fullGC (in Squeak) + 691 [0x112f11] gcc3x-cointerp.c:32961 + ! : | + 26 incCompBody (in Squeak) + 354 [0x113375] gcc3x-cointerp.c:33087 + ! : | + ! 10 mapPointersInObjectsFromto (in Squeak) + 1750 [0x12af9a] gcc3x-cointerp.c:40121 + ! : | + ! 4 mapPointersInObjectsFromto (in Squeak) + 1741,1802 [0x12af91,0x12afce] sqMemoryAccess.h:141 + ! : | + ! 2 mapPointersInObjectsFromto (in Squeak) + 1591,1594 [0x12aefb,0x12aefe] gcc3x-cointerp.c:40070 + ! : | + ! 2 mapPointersInObjectsFromto (in Squeak) + 1794 [0x12afc6] gcc3x-cointerp.c:40137 + ! : | + ! 2 mapPointersInObjectsFromto (in Squeak) + 1943 [0x12b05b] gcc3x-cointerp.c:40191 + ! : | + ! 2 mapPointersInObjectsFromto (in Squeak) + 1956 [0x12b068] gcc3x-cointerp.c:40193 + ! : | + ! 1 mapPointersInObjectsFromto (in Squeak) + 1972 [0x12b078] gcc3x-cointerp.c:40058 + ! : | + ! 1 mapPointersInObjectsFromto (in Squeak) + 1628 [0x12af20] gcc3x-cointerp.c:40078 + ! : | + ! 1 mapPointersInObjectsFromto (in Squeak) + 1744 [0x12af94] gcc3x-cointerp.c:40122 + ! : | + ! 1 mapPointersInObjectsFromto (in Squeak) + 150 [0x12a95a] gcc3x-cointerp.c:45134 + ! : | + ! 1 mapStackPages (in Squeak) + 281 [0x12b1a3] sqMemoryAccess.h:142 + ! : | + 1 incCompBody (in Squeak) + 557 [0x113440] gcc3x-cointerp.c:33284 + ! : | 4 fullGC (in Squeak) + 415 [0x112dfd] gcc3x-cointerp.c:36238 + ! : | 3 fullGC (in Squeak) + 251 [0x112d59] gcc3x-cointerp.c:36184 + ! : | 2 fullGC (in Squeak) + 376 [0x112dd6] gcc3x-cointerp.c:36236 + ! : | 1 fullGC (in Squeak) + 428 [0x112e0a] gcc3x-cointerp.c:36179 + ! : | 1 fullGC (in Squeak) + 256 [0x112d5e] gcc3x-cointerp.c:36186 + ! : | 1 fullGC (in Squeak) + 336 [0x112dae] gcc3x-cointerp.c:36227 + ! : | 1 fullGC (in Squeak) + 353 [0x112dbf] gcc3x-cointerp.c:36228 + ! : | + 1 finalizeReference (in Squeak) + 246 [0x113a6f] gcc3x-cointerp.c:37583 + ! : | 1 fullGC (in Squeak) + 412 [0x112dfa] sqMemoryAccess.h:141 + ! : 8 sufficientSpaceAfterGC (in Squeak) + 22 [0x117769] gcc3x-cointerp.c:35962 + ! : 5 incrementalGC (in Squeak) + 134 [0x113594] gcc3x-cointerp.c:33373 + ! : + 5 markPhase (in Squeak) + 23 [0x11310c] gcc3x-cointerp.c:34292 + ! : + 5 markAndTraceInterpreterOops (in Squeak) + 245 [0x129aa3] gcc3x-cointerp.c:45365 + ! : + 5 markAndTraceStackPage (in Squeak) + 89 [0x129efe] gcc3x-cointerp.c:13328 + ! : + 1 markAndTrace (in Squeak) + 14 [0x117c4b] gcc3x-cointerp.c:38821 + ! : + 1 markAndTrace (in Squeak) + 389 [0x117dc2] gcc3x-cointerp.c:38979 + ! : + 1 markAndTrace (in Squeak) + 450 [0x117dff] gcc3x-cointerp.c:39019 + ! : + 1 markAndTrace (in Squeak) + 457 [0x117e06] gcc3x-cointerp.c:39020 + ! : + 1 markAndTrace (in Squeak) + 818 [0x117f6f] gcc3x-cointerp.c:39140 + ! : 2 incrementalGC (in Squeak) + 573 [0x11374b] gcc3x-cointerp.c:33389 + ! : + 2 incCompBody (in Squeak) + 354 [0x113375] gcc3x-cointerp.c:33087 + ! : + 1 mapPointersInObjectsFromto (in Squeak) + 1750 [0x12af9a] gcc3x-cointerp.c:40121 + ! : + 1 mapPointersInObjectsFromto (in Squeak) + 150 [0x12a95a] gcc3x-cointerp.c:45134 + ! : + 1 mapStackPages (in Squeak) + 281 [0x12b1a3] sqMemoryAccess.h:142 + ! : 1 incrementalGC (in Squeak) + 83 [0x113561] gcc3x-cointerp.c:33369 + ! : 1 ioUTCMicrosecondsNow (in Squeak) + 0 [0x15324f] sqUnixHeartbeat.c:198 + ! 11 ??? (in <unknown binary>) [0x1f4002b6] + ! : 11 ceStackOverflow (in Squeak) + 105 [0x10869b] gcc3x-cointerp.c:11069 + ! : 10 checkForEventsMayContextSwitch (in Squeak) + 577 [0x10566d] gcc3x-cointerp.c:40834 + ! : | 10 ioProcessEvents (in Squeak) + 35 [0x14f12b] sqSqueakEventsAPI.m:84 + ! : | 10 nativeIoProcessEvents (in Squeak) + 190 [0x14f0da] sqSqueakEventsAPI.m:67 + ! : | 8 -[sqSqueakOSXApplication(events) pumpRunLoop] (in Squeak) + 47 [0x147d2d] sqSqueakOSXApplication+events.m:126 + ! : | + 8 -[sqSqueakMainApplication(events) pumpRunLoop] (in Squeak) + 85 [0x1510dd] sqSqueakMainApplication+events.m:61 + ! : | + 6 -[NSRunLoop(NSRunLoop) runMode:beforeDate:] (in Foundation) + 296 [0x9e271c9c] + ! : | + ! 6 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] + ! : | + ! 6 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] + ! : | + ! 2 __CFRunLoopRun (in CoreFoundation) + 994 [0x9b4dbf12] + ! : | + ! : 2 __CFRunLoopDoSources0 (in CoreFoundation) + 112 [0x9b4dc950] + ! : | + ! : 2 CFSetApplyFunction (in CoreFoundation) + 169 [0x9b4a9e69] + ! : | + ! : 1 CFBasicHashApply (in CoreFoundation) + 89 [0x9b494799] + ! : | + ! : | 1 CFBasicHashGetBucket (in CoreFoundation) + 0 [0x9b47e340] + ! : | + ! : 1 CFBasicHashApply (in CoreFoundation) + 130 [0x9b4947c2] + ! : | + ! : 1 __CFSetApplyFunction_block_invoke (in CoreFoundation) + 25 [0x9b4a9ec9] + ! : | + ! : 1 __CFRunLoopCollectSources0 (in CoreFoundation) + 22 [0x9b4dcb66] + ! : | + ! 2 __CFRunLoopRun (in CoreFoundation) + 1217 [0x9b4dbff1] + ! : | + ! : 2 mach_port_insert_member (in libsystem_kernel.dylib) + 31 [0x943dcc1f] + ! : | + ! : 2 _kernelrpc_mach_port_insert_member_trap (in libsystem_kernel.dylib) + 10 [0x943d743a] + ! : | + ! 1 __CFRunLoopRun (in CoreFoundation) + 1521 [0x9b4dc121] + ! : | + ! : 1 __CFRunLoopServiceMachPort (in CoreFoundation) + 214 [0x9b4dcd16] + ! : | + ! : 1 mach_msg (in libsystem_kernel.dylib) + 68 [0x943d6884] + ! : | + ! : 1 mach_msg_trap (in libsystem_kernel.dylib) + 10 [0x943d749a] + ! : | + ! 1 __CFRunLoopRun (in CoreFoundation) + 1729 [0x9b4dc1f1] + ! : | + ! 1 mach_port_extract_member (in libsystem_kernel.dylib) + 31 [0x943dcc50] + ! : | + ! 1 _kernelrpc_mach_port_extract_member_trap (in libsystem_kernel.dylib) + 10 [0x943d7446] + ! : | + 1 -[NSRunLoop(NSRunLoop) runMode:beforeDate:] (in Foundation) + 191 [0x9e271c33] + ! : | + ! 1 _CFRunLoopFinished (in CoreFoundation) + 73 [0x9b50d579] + ! : | + ! 1 __CFRunLoopFindMode (in CoreFoundation) + 174 [0x9b4a907e] + ! : | + ! 1 CFSetGetValue (in CoreFoundation) + 123 [0x9b4a961b] + ! : | + ! 1 CFBasicHashFindBucket (in CoreFoundation) + 514 [0x9b458e72] + ! : | + ! 1 __CFRunLoopModeHash (in CoreFoundation) + 20 [0x9b4a9684] + ! : | + ! 1 CFHash (in CoreFoundation) + 85 [0x9b455f25] + ! : | + 1 -[NSRunLoop(NSRunLoop) runMode:beforeDate:] (in Foundation) + 261 [0x9e271c79] + ! : | + 1 CFAbsoluteTimeGetCurrent (in CoreFoundation) + 0 [0x9b4aeff0] + ! : | 2 -[sqSqueakOSXApplication(events) pumpRunLoop] (in Squeak) + 67 [0x147d41] sqSqueakOSXApplication+events.m:127 + ! : | 2 -[sqSqueakOSXApplication(events) pumpRunLoopEventSendAndSignal:] (in Squeak) + 54 [0x147c61] sqSqueakOSXApplication+events.m:112 + ! : | 2 -[NSApplication nextEventMatchingMask:untilDate:inMode:dequeue:] (in AppKit) + 121 [0x9b93f432] + ! : | 2 -[NSApplication _nextEventMatchingEventMask:untilDate:inMode:dequeue:] (in AppKit) + 1057 [0x9b93f85b] + ! : | 2 _DPSNextEvent (in AppKit) + 1053 [0x9b9402e2] + ! : | 2 _ BlockUntilNextEventMatchingListInModeWithFilter (in HIToolbox) + 99 [0x93703eec] + ! : | 1 ReceiveNextEventCommon (in HIToolbox) + 201 [0x93703fc5] + ! : | ! 1 RunCurrentEventLoopInMode (in HIToolbox) + 217 [0x937042bf] + ! : | ! 1 _CFRunLoopSetCurrent (in CoreFoundation) + 0 [0x9b4fe520] + ! : | 1 ReceiveNextEventCommon (in HIToolbox) + 225 [0x93703fdd] + ! : | 1 GetCurrentEventQueue (in HIToolbox) + 90 [0x93703e39] + ! : | 1 GetMainEventQueue (in HIToolbox) + 26 [0x936edc52] + ! : | 1 _EventThreadLock (in HIToolbox) + 37 [0x936dab07] + ! : | 1 pthread_once (in libsystem_pthread.dylib) + 0 [0x9a9f8927] + ! : 1 checkForEventsMayContextSwitch (in Squeak) + 530 [0x10563e] gcc3x-cointerp.c:40832 + ! : 1 ioUTCMicroseconds (in Squeak) + 12 [0x1531ea] sqUnixHeartbeat.c:186 + ! 1 ??? (in <unknown binary>) [0x1f40023e] + ! : 1 ceStackOverflow (in Squeak) + 105 [0x10869b] gcc3x-cointerp.c:11069 + ! : 1 checkForEventsMayContextSwitch (in Squeak) + 577 [0x10566d] gcc3x-cointerp.c:40834 + ! : 1 ioProcessEvents (in Squeak) + 35 [0x14f12b] sqSqueakEventsAPI.m:84 + ! : 1 nativeIoProcessEvents (in Squeak) + 190 [0x14f0da] sqSqueakEventsAPI.m:67 + ! : 1 -[sqSqueakOSXApplication(events) pumpRunLoop] (in Squeak) + 47 [0x147d2d] sqSqueakOSXApplication+events.m:126 + ! : 1 -[sqSqueakMainApplication(events) pumpRunLoop] (in Squeak) + 85 [0x1510dd] sqSqueakMainApplication+events.m:61 + ! : 1 -[NSRunLoop(NSRunLoop) runMode:beforeDate:] (in Foundation) + 296 [0x9e271c9c] + ! : 1 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] + ! : 1 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] + ! : 1 __CFRunLoopRun (in CoreFoundation) + 1729 [0x9b4dc1f1] + ! : 1 mach_port_extract_member (in libsystem_kernel.dylib) + 31 [0x943dcc50] + ! : 1 _kernelrpc_mach_port_extract_member_trap (in libsystem_kernel.dylib) + 10 [0x943d7446] + ! 1 ??? (in <unknown binary>) [0x1f4002b0] + 2 ??? (in <unknown binary>) [0x1f40a2aa] + ! 1 ??? (in <unknown binary>) [0x1f40a352] + ! : 1 ??? (in <unknown binary>) [0x1f40a53a] + ! : 1 ??? (in <unknown binary>) [0x1f4022c7] + ! 1 ??? (in <unknown binary>) [0x1f40a360] + ! 1 ??? (in <unknown binary>) [0x1f40af82] + ! 1 ??? (in <unknown binary>) [0x1f40b087] + ! 1 ??? (in <unknown binary>) [0x1f40b256] + ! 1 ??? (in <unknown binary>) [0x1f40b2f0] + ! 1 ??? (in <unknown binary>) [0x1f40b3b5] + ! 1 ??? (in <unknown binary>) [0x1f40b540] + ! 1 ??? (in <unknown binary>) [0x1f40b640] + ! 1 ??? (in <unknown binary>) [0x1f40b6c9] + ! 1 ??? (in <unknown binary>) [0x1f40b8d2] + ! 1 ??? (in <unknown binary>) [0x1f40830f] + ! 1 ??? (in <unknown binary>) [0x1f4084da] + ! 1 ??? (in <unknown binary>) [0x1f40bd73] + ! 1 ??? (in <unknown binary>) [0x1f40be03] + ! 1 ??? (in <unknown binary>) [0x1f40be87] + ! 1 ??? (in <unknown binary>) [0x1f4091af] + ! 1 ??? (in <unknown binary>) [0x1f407043] + ! 1 ??? (in <unknown binary>) [0x1f409eb0] + ! 1 ??? (in <unknown binary>) [0x1f409f40] + ! 1 ??? (in <unknown binary>) [0x1f4091af] + ! 1 ??? (in <unknown binary>) [0x1f407043] + ! 1 ??? (in <unknown binary>) [0x1f40a16b] + ! 1 ??? (in <unknown binary>) [0x1f40a2aa] + ! 1 ??? (in <unknown binary>) [0x1f40a360] + ! 1 ??? (in <unknown binary>) [0x1f40af82] + ! 1 ??? (in <unknown binary>) [0x1f40b087] + ! 1 ??? (in <unknown binary>) [0x1f40b256] + ! 1 ??? (in <unknown binary>) [0x1f40b2f0] + ! 1 ??? (in <unknown binary>) [0x1f40b3f1] + 2 ??? (in <unknown binary>) [0x1f40b540] + ! 2 ??? (in <unknown binary>) [0x1f40b640] + ! 2 ??? (in <unknown binary>) [0x1f40b6c9] + ! 2 ??? (in <unknown binary>) [0x1f40b8d2] + ! 2 ??? (in <unknown binary>) [0x1f40830f] + ! 1 ??? (in <unknown binary>) [0x1f4084da] + ! : 1 ??? (in <unknown binary>) [0x1f40bd73] + ! : 1 ??? (in <unknown binary>) [0x1f40be03] + ! : 1 ??? (in <unknown binary>) [0x1f40be87] + ! : 1 ??? (in <unknown binary>) [0x1f4091af] + ! : 1 ??? (in <unknown binary>) [0x1f407043] + ! : 1 ??? (in <unknown binary>) [0x1f409eb0] + ! : 1 ??? (in <unknown binary>) [0x1f409f40] + ! : 1 ??? (in <unknown binary>) [0x1f4091af] + ! : 1 ??? (in <unknown binary>) [0x1f407043] + ! : 1 ??? (in <unknown binary>) [0x1f40a16b] + ! : 1 ??? (in <unknown binary>) [0x1f40a2aa] + ! : 1 ??? (in <unknown binary>) [0x1f40a352] + ! : 1 ??? (in <unknown binary>) [0x1f40a56e] + ! : 1 ??? (in <unknown binary>) [0x1f407c90] + ! : 1 ??? (in <unknown binary>) [0x1f4020c8] + ! 1 ??? (in <unknown binary>) [0x1f40243c] + 2 ??? (in <unknown binary>) [0x1f40be03] + 2 ??? (in <unknown binary>) [0x1f40be87] + 2 ??? (in <unknown binary>) [0x1f4091af] + 2 ??? (in <unknown binary>) [0x1f407043] + 1 ??? (in <unknown binary>) [0x1f409eb0] + : 1 ??? (in <unknown binary>) [0x1f409f40] + : 1 ??? (in <unknown binary>) [0x1f4091af] + : 1 ??? (in <unknown binary>) [0x1f407043] + : 1 ??? (in <unknown binary>) [0x1f40a16b] + : 1 ??? (in <unknown binary>) [0x1f40a2aa] + : 1 ??? (in <unknown binary>) [0x1f40a360] + : 1 ??? (in <unknown binary>) [0x1f40af82] + : 1 ??? (in <unknown binary>) [0x1f40b087] + : 1 ??? (in <unknown binary>) [0x1f40b256] + : 1 ??? (in <unknown binary>) [0x1f40b2f0] + : 1 ??? (in <unknown binary>) [0x1f40b3b5] + : 1 ??? (in <unknown binary>) [0x1f40b540] + : 1 ??? (in <unknown binary>) [0x1f40b640] + : 1 ??? (in <unknown binary>) [0x1f40b6c9] + : 1 ??? (in <unknown binary>) [0x1f40b8d2] + : 1 ??? (in <unknown binary>) [0x1f40830f] + : 1 ??? (in <unknown binary>) [0x1f4084da] + : 1 ??? (in <unknown binary>) [0x1f40bd73] + : 1 ??? (in <unknown binary>) [0x1f40be03] + : 1 ??? (in <unknown binary>) [0x1f40be87] + : 1 ??? (in <unknown binary>) [0x1f4091af] + : 1 ??? (in <unknown binary>) [0x1f400295] + 1 ??? (in <unknown binary>) [0x1f409ea1] 2451 Thread_2029987 DispatchQueue_2: com.apple.libdispatch-manager (serial) + 2451 _dispatch_mgr_thread (in libdispatch.dylib) + 52 [0x9b4053be] + 2451 _dispatch_mgr_invoke (in libdispatch.dylib) + 234 [0x9b4057ea] + 2451 kevent_qos (in libsystem_kernel.dylib) + 10 [0x943df7fa] 2451 Thread_2030323: com.apple.coreaudio.AQClient + 2451 thread_start (in libsystem_pthread.dylib) + 34 [0x9a9f5f7a] + 2451 _pthread_start (in libsystem_pthread.dylib) + 155 [0x9a9f86f6] + 2451 _pthread_body (in libsystem_pthread.dylib) + 138 [0x9a9f8780] + 2451 CAPThread::Entry(CAPThread*) (in AudioToolbox) + 96 [0x929fd2f0] + 2451 GenericRunLoopThread::Entry(void*) (in AudioToolbox) + 200 [0x929fd3ee] + 2451 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] + 2451 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] + 2451 __CFRunLoopRun (in CoreFoundation) + 1521 [0x9b4dc121] + 2451 __CFRunLoopServiceMachPort (in CoreFoundation) + 214 [0x9b4dcd16] + 2451 mach_msg (in libsystem_kernel.dylib) + 68 [0x943d6884] + 2451 mach_msg_trap (in libsystem_kernel.dylib) + 10 [0x943d749a] 2451 Thread_2030354 + 2451 thread_start (in libsystem_pthread.dylib) + 34 [0x9a9f5f7a] + 2451 _pthread_start (in libsystem_pthread.dylib) + 155 [0x9a9f86f6] + 2451 _pthread_body (in libsystem_pthread.dylib) + 138 [0x9a9f8780] + 2422 beatStateMachine (in Squeak) + 106 [0x153686] sqUnixHeartbeat.c:325 + ! 2385 nanosleep$UNIX2003 (in libsystem_c.dylib) + 218 [0x9c6528d1] + ! : 2385 __semwait_signal (in libsystem_kernel.dylib) + 10 [0x943de7ce] + ! 17 nanosleep$UNIX2003 (in libsystem_c.dylib) + 90 [0x9c652851] + ! : 17 clock_get_time (in libsystem_kernel.dylib) + 90 [0x943c4aa2] + ! : 17 mach_msg (in libsystem_kernel.dylib) + 68 [0x943d6884] + ! : 17 mach_msg_trap (in libsystem_kernel.dylib) + 10 [0x943d749a] + ! 8 __semwait_signal (in libsystem_kernel.dylib) + 12,24 [0x943de7d0,0x943de7dc] + ! 8 tramp_cerror (in libsystem_kernel.dylib) + 29 [0x943e0415] + ! : 7 cerror_nocancel (in libsystem_kernel.dylib) + 27 [0x943d7d80] + ! : 1 _pthread_exit_if_canceled (in libsystem_kernel.dylib) + 17 [0x943c44bd] + ! 3 nanosleep$UNIX2003 (in libsystem_c.dylib) + 75,27,... [0x9c652842,0x9c652812,...] + ! 1 nanosleep$UNIX2003 (in libsystem_c.dylib) + 40 [0x9c65281f] + ! 1 pthread_testcancel$UNIX2003 (in libsystem_pthread.dylib) + 51 [0x9a9fb2ae] + ! 1 OSSpinLockLock (in libsystem_platform.dylib) + 0 [0x97b95818] + 19 beatStateMachine (in Squeak) + 241 [0x15370d] sqUnixHeartbeat.c:280 + ! 15 forceInterruptCheck (in Squeak) + 30 [0x106637] gcc3x-cointerp.c:43260 + ! 1 forceInterruptCheck (in Squeak) + 0 [0x106619] gcc3x-cointerp.c:43247 + ! 1 forceInterruptCheck (in Squeak) + 18 [0x10662b] gcc3x-cointerp.c:43254 + ! 1 forceInterruptCheck (in Squeak) + 55 [0x106650] gcc3x-cointerp.c:43265 + ! 1 forceInterruptCheckFromHeartbeat (in Squeak) + 35 [0x10975b] gcc3x-cointerp.c:12249 + 8 beatStateMachine (in Squeak) + 159 [0x1536bb] sqUnixHeartbeat.c:272 + ! 4 updateMicrosecondClock (in Squeak) + 28 [0x153886] sqUnixHeartbeat.c:101 + ! : 2 gettimeofday (in libsystem_c.dylib) + 45 [0x9c5e4492] + ! : | 2 __commpage_gettimeofday (in libsystem_kernel.dylib) + 0,11 [0x943d7630,0x943d763b] + ! : 2 gettimeofday (in libsystem_c.dylib) + 0 [0x9c5e4465] + ! 4 updateMicrosecondClock (in Squeak) + 157 [0x153907] sqUnixHeartbeat.c:141 + 1 DYLD-STUB$$__error (in Squeak) + 0 [0x1a8ea6] + 1 beatStateMachine (in Squeak) + 109 [0x153689] sqUnixHeartbeat.c:326 2451 Thread_2030360: com.apple.NSEventThread 2451 thread_start (in libsystem_pthread.dylib) + 34 [0x9a9f5f7a] 2451 _pthread_start (in libsystem_pthread.dylib) + 155 [0x9a9f86f6] 2451 _pthread_body (in libsystem_pthread.dylib) + 138 [0x9a9f8780] 2451 _NSEventThread (in AppKit) + 291 [0x9baa7dde] 2451 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] 2451 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] 2451 __CFRunLoopRun (in CoreFoundation) + 1521 [0x9b4dc121] 2451 __CFRunLoopServiceMachPort (in CoreFoundation) + 214 [0x9b4dcd16] 2451 mach_msg (in libsystem_kernel.dylib) + 68 [0x943d6884] 2451 mach_msg_trap (in libsystem_kernel.dylib) + 10 [0x943d749a] Total number in stack (recursive counted multiple, when >=5): 7 ??? (in <unknown binary>) [0x1f4091af] 6 ??? (in <unknown binary>) [0x1f407043] 5 CFRunLoopRunInMode (in CoreFoundation) + 123 [0x9b4db72b] 5 CFRunLoopRunSpecific (in CoreFoundation) + 390 [0x9b4db8c6] Sort by top of stack, same collapsed (when >= 5): mach_msg_trap (in libsystem_kernel.dylib) 4920 kevent_qos (in libsystem_kernel.dylib) 2451 __semwait_signal (in libsystem_kernel.dylib) 2393 findMethodWithPrimitiveFromContextUpToContext (in Squeak) 2332 markAndTrace (in Squeak) 44 mapPointersInObjectsFromto (in Squeak) 26 forceInterruptCheck (in Squeak) 18 fullGC (in Squeak) 13 isWidowedContext (in Squeak) 10 cerror_nocancel (in libsystem_kernel.dylib) 7 The squeak.stack.v3 still works. The hang is reproducible in simulator: | cos | cos := CogVMSimulator newWithOptions: #(Cogit StackToRegisterMappingCogit ). cos desiredNumStackPages: 8. cos openOn: '/some_path_to/Squeak4.6-15102.image'. cos openAsMorph; run it hangs around counters 13000/993 and I've got this kind of output: (130) Looking for primitiveDecompressFromByteArray in MiscPrimitivePlugin Looking for module MiscPrimitivePlugin ... loaded Failed ... primitive not in plugin (276) Looking for primDigitBitShiftMagnitude in LargeIntegers Looking for module LargeIntegers ... loaded (1061) Looking for primDigitBitOr in LargeIntegers (1419) Looking for primDigitAdd in LargeIntegers (1420) Looking for primNormalizeNegative in LargeIntegers (1873) Looking for primitiveCopyBits in BitBltPlugin Looking for module BitBltPlugin ... loaded (9872) Looking for primitiveStringHash in MiscPrimitivePlugin (12180) Looking for primitiveCompareString in MiscPrimitivePlugin GC number 0 grow memory from 30872064 by 3747856 GC number 1 grow memory from 34619896 by 4091568 GC number 2 grow memory from 38711440 by 4438096 GC number 3 grow memory from 43149512 by 4814368 GC number 4 grow memory from 47963856 by 5223272 GC number 5 grow memory from 53187104 by 5667072 GC number 6 grow memory from 58854152 by 6148112 each time I interrupt the VM, it seems to loop in findMethodWithPrimitive: FromFP:UpToContext: I did not try to bissect when this happened, but the red status of continuous integration may well be related to this. We can't live forever with this red status, it's like not having CI feedback at all. Either we declare cog.v3 as unsupported or we fix it.

2 3

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Vm-dev February 2017