<html><head><meta http-equiv="Content-Type" content="text/html charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;"><br><div><div>On May 9, 2013, at 4:02 AM, Fraser Cormack <<a href="mailto:fraser@codeplay.com">fraser@codeplay.com</a>> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div style="letter-spacing: normal; orphans: auto; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;">I have an instruction that takes no operands, and produces two results, in two consecutive cycles.<br><br>I tried both of the following to my Schedule.td file:<br><br>InstrItinData<IIMyInstr, [InstrStage<2, [FuncU]>], [1, 2]>,<br>InstrItinData<IIMyInstr, [InstrStage<1, [FuncU]>, InstrStage<1, [FuncU]>], [1, 2]>,<br><br>From what I can see in examples, these say that the first operand is ready the cycle after issue, and the second is ready 2 cycles after issue.<br></div></blockquote><div><br></div>Yes, they look equivalent.</div><div><br><blockquote type="cite"><div style="letter-spacing: normal; orphans: auto; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;">But when I issue an instruction that uses both results, it does not obey this hazard, and is issued the cycle immediately after. Are there any target hooks I need to implement to get this scheduling correctly?<br></div></blockquote><div><br></div><div>Look at -debug-only=pre-RA-sched and confirm that the DAG's edges have the correct latency.</div><div><br></div><div>It also prints the current cycle count each time it schedules an instruction.</div><div>DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");</div><div><br></div><div>You should see a two cycle difference between MyInstr and its second dependent. The scheduler won't insert nops for you. You'd need to do that in a target-specific way.</div><br><blockquote type="cite"><div style="letter-spacing: normal; orphans: auto; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;">I noticed that my target was using the default HazardRecognizer, which is effectively disabled, so I changed it to use the ScoreboardHazardRecognizer instead. I'm also still using the SelectionDAG scheduler, but will need to change to the MI scheduler at some point, to keep up with trunk. Should either of these help?<br></div></blockquote><div><br></div><div>The hazard recognizer won't help you. It only enforces pipeline hazards (other instructions that need FuncU). It's the list scheduler itself that "enforces" operand latency.</div><div><br></div>MI scheduler allows you to use a new machine model that's simpler for most people who don't need the precision of Itineraries. Maybe not important in your case.</div><div><br></div><div>More importantly, SDScheduler is take-it-as-is, and will go away entirely after 3.3. Whereas MI scheduler can be fixed and improved. Now would be a good time to try switching over and start filing bugs. PPC is an example of using MI scheduler out-of-box. Hexagon is an example of customizing it at a high level. You could start off like PPC with minimal customization, but eventually you may want something in between--provide a custom MachineSchedStrategy:</div><div><br></div><div><div>class MyScheduler : public MachineSchedStrategy {...}</div><div><br></div><div>namespace llvm {</div><div>ScheduleDAGInstrs *createMySched(MachineSchedContext *C) {</div><div> ScheduleDAGMI *DAG = new ScheduleDAGMI(C, new MyScheduler());</div><div> DAG->addMutation(new MyDAGMutation());</div><div> return DAG;</div><div>}</div><div>} // namespace llvm</div><div><br></div><div>static MachineSchedRegistry</div><div>MySchedRegistry("mysched", "Custom My scheduler.", createMySched);</div></div><div><br></div><div>-Andy</div><div><br><blockquote type="cite"><div style="letter-spacing: normal; orphans: auto; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;">Thanks,<br>Fraser<br><br>--<span class="Apple-converted-space"> </span><br>Fraser Cormack<br>Compiler Developer<br>Codeplay Software Ltd<br>45 York Place, Edinburgh, EH1 3HP<br>Tel: 0131 466 0503<br>Fax: 0131 557 6600<br>Website:<span class="Apple-converted-space"> </span><a href="http://www.codeplay.com/">http://www.codeplay.com</a><br>Twitter:<span class="Apple-converted-space"> </span><a href="https://twitter.com/codeplaysoft">https://twitter.com/codeplaysoft</a><br><br>This email and any attachments may contain confidential and /or privileged information and is for use by the addressee only. If you are not the intended recipient, please notify Codeplay Software Ltd immediately and delete the message from your computer. You may not copy or forward it,or use or disclose its contents to any other person. Any views or other information in this message which do not relate to our business are not authorized by Codeplay software Ltd, nor does this message form part of any contract unless so stated.<br>As internet communications are capable of data corruption Codeplay Software Ltd does not accept any responsibility for any changes made to this message after it was sent. Please note that Codeplay Software Ltd does not accept any liability or responsibility for viruses and it is your responsibility to scan any attachments.<br>Company registered in England and Wales, number: 04567874<br>Registered office: 81 Linkfield Street, Redhill RH1 6BY<br><br>_______________________________________________<br>LLVM Developers mailing list<br><a href="mailto:LLVMdev@cs.uiuc.edu">LLVMdev@cs.uiuc.edu</a><span class="Apple-converted-space"> </span> <a href="http://llvm.cs.uiuc.edu/">http://llvm.cs.uiuc.edu</a><br><a href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev">http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev</a></div></blockquote></div><br></body></html>