search for: algotithm

Hi, I'm trying to build code for very short function and I encounter with a problem (or bug) in DAG selection algotithm. I have a node that was created in Combine(BeforeLegalizeTypes) and should be optimized in Combine(AfterLegalizeTypes). But LegalizeTypes() did not change anything and Combine(AfterLegalizeTypes) was not called. Vector legalization that comes afterwards just scalarized the operation. SelectionDAGI...

...s is my own. The previous 1.1.12 cancellation works moreless well, and after appearance of new version i desided to try use it. The result is: In real condition case 8 from 10 times cancellation is very unstable and starts generate a noise signal. I think this happens on fast learning stage of EC algotithm. When EC learning stage finished normally (2 from 10 times ) after 2- 5 seconds cancelletion works better than previous version. Could you please suggest to do something to stabilize EC in new version 1.2 beta1? Do you plan release the new version in nearest time? Can i help to accelerate resolv...

On Mon, Feb 6, 2012 at 11:54 PM, Demikhovsky, Elena <elena.demikhovsky at intel.com> wrote: > Hi, > > I'm trying to build code for very short function and I encounter with a problem (or bug) in DAG selection algotithm. > I have a node that was created in Combine(BeforeLegalizeTypes) and should be optimized in Combine(AfterLegalizeTypes). But LegalizeTypes() did not change anything and Combine(AfterLegalizeTypes) was not called. > Vector legalization that comes afterwards just scalarized the operation. >...

Hello, I would like to call a function that can take infinite time to be executed in some circumstances (which can not be easily detected). So, I would like that once the function is being executed for more than two seconds it is stopped. I have found documentation for timers but i did not found how to "kill" a function. Moreover, I would like not to change the function code (it should

...on one display, while allo= wing an audience to watch the presentation on a second display or projector. Due to display mirroring, the external monitor could have black borders dur= ing mirroring, depending on the supported timings between the two displays and = on the monitor=E2=80=99s selection algotithm. Both displays show full-sized im= ages only when the display resolution for the second monitor is set to the first display=E2=80=99s native resolution: 1440x900 on the 17-inch display and 10= 24x768 on the 15-inch display. The external monitor supports user-selectable display sizes up to 1600x120...

...uiuc.edu Subject: Re: [LLVMdev] DAG optimization and lowering algorithm On Mon, Feb 6, 2012 at 11:54 PM, Demikhovsky, Elena <elena.demikhovsky at intel.com> wrote: > Hi, > > I'm trying to build code for very short function and I encounter with a problem (or bug) in DAG selection algotithm. > I have a node that was created in Combine(BeforeLegalizeTypes) and should be optimized in Combine(AfterLegalizeTypes). But LegalizeTypes() did not change anything and Combine(AfterLegalizeTypes) was not called. > Vector legalization that comes afterwards just scalarized the operation. >...

Hello, Normally, in addition to such qdisc scheduler mechanisms as FIFO, PQ, WRR, WFQ, are there any more? Then, there is a confusion on scheduler in Linux enviroment: Assume there is a qdisc, such as RED as a leaf qdisc in a router, we know, if there is packet which want to enqueue the packet, the Function red_enqueue is called, but when the packet leave the queue(when the Function red_dequeue