Displaying 3 results from an estimated 3 matches for "canhandletermin".
2013 Feb 11
1
[LLVMdev] Preferential treatment of labels in MI sched DAG construction
On Feb 11, 2013, at 1:03 PM, Sergei Larin <slarin at codeaurora.org> wrote:
> Hi Andy,
>
> I have to resurrect an ancient question regarding scheduling boundaries.
>
> You might remember the reason for introduction of CanHandleTerminators to
> ScheduleDAGInstrs. In short, Hexagon is currently uses DAG construction
> method (buildSchedGraph) for several purposes, which includes region
> formation for general VLIW packetization/bundling. As such we need to handle
> pretty much all instructions and any terminators, inc...
2013 Feb 11
0
[LLVMdev] Preferential treatment of labels in MI sched DAG construction
Hi Andy,
I have to resurrect an ancient question regarding scheduling boundaries.
You might remember the reason for introduction of CanHandleTerminators to
ScheduleDAGInstrs. In short, Hexagon is currently uses DAG construction
method (buildSchedGraph) for several purposes, which includes region
formation for general VLIW packetization/bundling. As such we need to handle
pretty much all instructions and any terminators, including labels (thoug...
2013 Feb 08
3
[LLVMdev] Parallel Loop Metadata
On Feb 8, 2013, at 12:28 PM, Pekka Jääskeläinen <pekka.jaaskelainen at tut.fi> wrote:
> On 02/08/2013 08:20 PM, Tobias Grosser wrote:
>> That sounds elegant and seems to solve the correctness problems.
>
> There is no big difference here except that the memory instructions
> would not need the metadata.
>
> I do not think the abundance of metadata is really the