<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:x="urn:schemas-microsoft-com:office:excel" xmlns:p="urn:schemas-microsoft-com:office:powerpoint" xmlns:a="urn:schemas-microsoft-com:office:access" xmlns:dt="uuid:C2F41010-65B3-11d1-A29F-00AA00C14882" xmlns:s="uuid:BDC6E3F0-6DA3-11d1-A2A3-00AA00C14882" xmlns:rs="urn:schemas-microsoft-com:rowset" xmlns:z="#RowsetSchema" xmlns:b="urn:schemas-microsoft-com:office:publisher" xmlns:ss="urn:schemas-microsoft-com:office:spreadsheet" xmlns:c="urn:schemas-microsoft-com:office:component:spreadsheet" xmlns:odc="urn:schemas-microsoft-com:office:odc" xmlns:oa="urn:schemas-microsoft-com:office:activation" xmlns:html="http://www.w3.org/TR/REC-html40" xmlns:q="http://schemas.xmlsoap.org/soap/envelope/" xmlns:rtc="http://microsoft.com/officenet/conferencing" xmlns:D="DAV:" xmlns:Repl="http://schemas.microsoft.com/repl/" xmlns:mt="http://schemas.microsoft.com/sharepoint/soap/meetings/" xmlns:x2="http://schemas.microsoft.com/office/excel/2003/xml" xmlns:ppda="http://www.passport.com/NameSpace.xsd" xmlns:ois="http://schemas.microsoft.com/sharepoint/soap/ois/" xmlns:dir="http://schemas.microsoft.com/sharepoint/soap/directory/" xmlns:ds="http://www.w3.org/2000/09/xmldsig#" xmlns:dsp="http://schemas.microsoft.com/sharepoint/dsp" xmlns:udc="http://schemas.microsoft.com/data/udc" xmlns:xsd="http://www.w3.org/2001/XMLSchema" xmlns:sub="http://schemas.microsoft.com/sharepoint/soap/2002/1/alerts/" xmlns:ec="http://www.w3.org/2001/04/xmlenc#" xmlns:sp="http://schemas.microsoft.com/sharepoint/" xmlns:sps="http://schemas.microsoft.com/sharepoint/soap/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:udcs="http://schemas.microsoft.com/data/udc/soap" xmlns:udcxf="http://schemas.microsoft.com/data/udc/xmlfile" xmlns:udcp2p="http://schemas.microsoft.com/data/udc/parttopart" xmlns:wf="http://schemas.microsoft.com/sharepoint/soap/workflow/" xmlns:dsss="http://schemas.microsoft.com/office/2006/digsig-setup" xmlns:dssi="http://schemas.microsoft.com/office/2006/digsig" xmlns:mdssi="http://schemas.openxmlformats.org/package/2006/digital-signature" xmlns:mver="http://schemas.openxmlformats.org/markup-compatibility/2006" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns:mrels="http://schemas.openxmlformats.org/package/2006/relationships" xmlns:spwp="http://microsoft.com/sharepoint/webpartpages" xmlns:ex12t="http://schemas.microsoft.com/exchange/services/2006/types" xmlns:ex12m="http://schemas.microsoft.com/exchange/services/2006/messages" xmlns:pptsl="http://schemas.microsoft.com/sharepoint/soap/SlideLibrary/" xmlns:spsl="http://microsoft.com/webservices/SharePointPortalServer/PublishedLinksService" xmlns:Z="urn:schemas-microsoft-com:" xmlns:st="" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 12 (filtered medium)"><base href="x-msg://1133/"><style><!--
/* Font Definitions */
@font-face
{font-family:Courier;
panose-1:2 7 4 9 2 2 5 2 4 4;}
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Tahoma;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:Consolas;
panose-1:2 11 6 9 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:12.0pt;
font-family:"Times New Roman","serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.apple-style-span
{mso-style-name:apple-style-span;}
span.apple-converted-space
{mso-style-name:apple-converted-space;}
span.EmailStyle19
{mso-style-type:personal-reply;
font-family:"Calibri","sans-serif";
color:#1F497D;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-US link=blue vlink=purple style='word-wrap: break-word;-webkit-nbsp-mode: space;-webkit-line-break: after-white-space'><div class=WordSection1><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'>Yes it is. Or it could be. All I am saying – if we make this implied assumption (that the order of instructions in the list == semantical order in the bundle) it needs to be explicitly stated. Otherwise a pass developer could really treat a bundle as truly “parallel” entity potentially causing nasty things. <o:p></o:p></span></p><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'><o:p> </o:p></span></p><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'>Sergei Larin<o:p></o:p></span></p><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'><o:p> </o:p></span></p><div><p class=MsoNormal><span style='font-size:10.5pt;font-family:Consolas;color:#1F497D'>--<o:p></o:p></span></p><p class=MsoNormal><span style='font-size:10.5pt;font-family:Consolas;color:#1F497D'>Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum.<o:p></o:p></span></p></div><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'><o:p> </o:p></span></p><div style='border:none;border-left:solid blue 1.5pt;padding:0in 0in 0in 4.0pt'><div><div style='border:none;border-top:solid #B5C4DF 1.0pt;padding:3.0pt 0in 0in 0in'><p class=MsoNormal><b><span style='font-size:10.0pt;font-family:"Tahoma","sans-serif"'>From:</span></b><span style='font-size:10.0pt;font-family:"Tahoma","sans-serif"'> Evan Cheng [mailto:evan.cheng@apple.com] <br><b>Sent:</b> Friday, December 02, 2011 6:07 PM<br><b>To:</b> Sergei Larin<br><b>Cc:</b> 'LLVM Dev'<br><b>Subject:</b> Re: [LLVMdev] RFC: Machine Instruction Bundle<o:p></o:p></span></p></div></div><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p><div><div><p class=MsoNormal>On Dec 2, 2011, at 2:41 PM, Sergei Larin wrote:<o:p></o:p></p></div><p class=MsoNormal><br><br><o:p></o:p></p><div><div><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'>… and yes, one more thing. On some architectures it might be desirable to know the _<i>order</i>_ of instructions in the packet. That is a bit trickier….</span><o:p></o:p></p></div></div><div><p class=MsoNormal><o:p> </o:p></p></div><p class=MsoNormal>Isn't that just the order of the instructions in the list? I don't see anything that prevents getting the order of instructions. It might require iterator over MIs in the packet. But for targets like VLIW, the # of instructions should be small. Also note, passes that require this kind of information should aggregate and maintain the data itself. Information like schedule cycle belongs in "schedule unit", not in MI.<o:p></o:p></p></div><div><p class=MsoNormal><o:p> </o:p></p></div><div><p class=MsoNormal>Evan<o:p></o:p></p></div><div><p class=MsoNormal><br><br><o:p></o:p></p><div><div><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'> </span><o:p></o:p></p></div><div><div><p class=MsoNormal><span style='font-size:10.5pt;font-family:Consolas;color:#1F497D'>--</span><o:p></o:p></p></div><div><p class=MsoNormal><span style='font-size:10.5pt;font-family:Consolas;color:#1F497D'>Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum.</span><o:p></o:p></p></div></div><div><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'> </span><o:p></o:p></p></div><div style='border:none;border-left:solid blue 1.5pt;padding:0in 0in 0in 4.0pt;border-width:initial;border-color:initial'><div><div style='border:none;border-top:solid #B5C4DF 1.0pt;padding:3.0pt 0in 0in 0in;border-width:initial;border-color:initial'><div><p class=MsoNormal><b><span style='font-size:10.0pt;font-family:"Tahoma","sans-serif"'>From:</span></b><span class=apple-converted-space><span style='font-size:10.0pt;font-family:"Tahoma","sans-serif"'> </span></span><span style='font-size:10.0pt;font-family:"Tahoma","sans-serif"'><a href="mailto:llvmdev-bounces@cs.uiuc.edu">llvmdev-bounces@cs.uiuc.edu</a><span class=apple-converted-space> </span>[mailto:llvmdev-bounces@cs.uiuc.edu]<span class=apple-converted-space> </span><b>On Behalf Of<span class=apple-converted-space> </span></b>Evan Cheng<br><b>Sent:</b><span class=apple-converted-space> </span>Friday, December 02, 2011 2:40 PM<br><b>To:</b><span class=apple-converted-space> </span>LLVM Dev<br><b>Subject:</b><span class=apple-converted-space> </span>[LLVMdev] RFC: Machine Instruction Bundle</span><o:p></o:p></p></div></div></div><div><p class=MsoNormal> <o:p></o:p></p></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Machine Instruction Bundle in LLVM</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>Hi all,</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>There have been quite a bit of discussions about adding machine instruction bundle to support VLIW targets. I have been pondering what the right representation should be and what kind of impact it might have on the LLVM code generator. I believe I have a fairly good plan now and would like to share with the LLVM community.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Design Criteria</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. The bundle representation must be light weight. We cannot afford to add significant memory or compile time overhead.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. It must be flexible enough to represent more than VLIW bundles. It should be useful to represent arbitrary sequence of instructions that must be scheduled as a unit. e.g. ARM Thumb2 IT block, Intel compare + branch macro-fusion, or random instruction sequences that are currently modeled as pseudo instructions that are expanded late.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>3. Minimize the amount of changes required in the LLVM code generator, especially in target independent passes. It must minimize code duplication (i.e. we don't want code snippets that search for bundle start / end like all the code in the backend that skip over DBG_VALUE).</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>4. The representation should make it easy for new code to be oblivious of bundles. That is, MI passes should not have to check whether something is a bundle.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>Given the above, we can rule out a new class (e.g. MachineInstrBundle) right away. We don't want MachineBasic block to keep a list of MachineInstrBundles since it will require massive amount of code change. So what are the choices?</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Bundle Representation</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. A nested MachineInstr: This is the most natural (meaning it looks most like the real HW bundle) representation. It has the nice property that most passes do not have to check if a MI is a bundle.The concern here this can add significant memory overhead if this means adding a ilist or SmallVector field to keep bundled MIs.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. Add a bit to MachineInstr: The bit means the next MI in the list is part of the same bundle. This is very light weight. However it requires many passes to check wether a MI is part of a bundle.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>The solution is a combination of both #1 and #2. Conceptually we want a representation that looks like this:</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>--------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| Bundle | -------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------- \</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>--------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| Bundle | ------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------- \</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | …</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>--------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| Bundle | ------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------- \</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ...</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>This is #1, a series of nested MI's. However, we are going to store the instructions in the same way as it's done right now, i.e. a list<MachineInstr> on MachineBasicBlocks. Using #2, we will add a bit to MI that indicates whether it is part of a bundle.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * | (* bit indicates next MI is "glued" to this MI, i.e. in the same bundle)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI | (no bit, this is the end of the bundle)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> --------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * | (* a new bundle)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ...</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>We are going to hide the complexity in the MachineBasicBlock::iterator instead. That is, the iterator will be changed to visit only the *top level* instructions (i.e. first instruction in each bundle). We will add another iterator that allows client to visit all of the MIs for those passes that want to look into bundles.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>We can use the same representation for arbitrary sequence of instructions that cannot be broken up. e.g. Thumb2 IT blocks.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI | (just a MI)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * | (* Start of Thumb2 IT block)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * | </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI | (last MI in the block)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI | </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ...</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>This representation can support VLIW (where top level MI's are all start of bundles) or non-VLIW (where there can be mix of MIs and bundles). It is also very cheap since the "Flags" field has plenty of free bits available.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Properties of Bundle</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>If MI passes can consider each bundle as a single unit, then how are they going to examine properties (i.e. flags and operands) of a MI bundle? Conceptually a the properties of a bundle is the union of the properties of all the MIs inside the bundle. So a bundle reads all the inputs that the individual MIs read and it defines all the outputs of the individual MIs. However, this is not correct when there are intra-bundle dependencies. e.g.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r0 = op1 r1, r2 |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r3 = op2 r0<kill>, #c |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>r0 should not be considered as a source on the bundle since it's defined inside the bundle and its live range does not extend beyond it. Instead, r0 is a clobber (i.e. dead def).</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r0 = op1 r1, r2 |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r3 = op2 r0, #c |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ...</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> = op3 r0, </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>r0 is a def, not a use.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>What does this mean? It means in order for passes to operate on a bundle at a time, it must be able to visit all the defs and uses of a bundle. We have established that computing the defs and uses of a bundle is not as trivial as taking the union. This is certainly not something we want to re-compute every time! This requires a slight change to the bundle representation.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | Bundle * | (A MI with special opcode "Bundle")</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI | (no bit, this is the end of the bundle)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> --------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | Bundle * | (a new bundle)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI * | </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> | MI |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ----------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> ...</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>The pseudo bundle instructions should be used to capture properties of the bundle. When a bundle is finalized the packetizer must add source and def operands to the pseudo bundle instruction. More on this later.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>Other properties, such as mayLoad, mayStore, are static properties associated with opcodes. They cannot be copied. We will add APIs to examine properties of MIs which will do the *right thing* for bundles (i.e. look into MIs in bundles).</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Packetizing</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>The current MI flow looks like this:</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. DAG to MI lowering (and pre-RA schedule)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. MI optimizations (LICM, CSE, etc.)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>3. Register allocation super pass</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3a. De-ssa (2-address, phi slim)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3b. Coalescing</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3c. Actual register allocation</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>4. Post-RA optimizations</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>5. PEI</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>6. Post-RA scheduling</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>In the hopefully not very distant future it should look like this:</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. DAG to MI lowering (no scheduling!)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. MI optimizations (LICM, CSE, etc.)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>3. Register allocation super pass</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3a. De-ssa (2-address, phi slim)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3b. Coalescing</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3c.<span class=apple-converted-space> </span><b>Pre-RA scheduling</b></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3d. Actual register allocation</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>4. Post-RA optimizations</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>5. PEI</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>6.<span class=apple-converted-space> </span><b>Re-schedule restores, copies</b></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>The current proposal is for "packetization" to be done as part of the "RA super pass". Early MI optimization passes such as LICM do not benefit from operating on bundles. Furthermore, the packetizer should not have to know how to deal with copies which may later be coalesced, phi nodes, or other copy like pseudo instructions.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>Packetization should be done in two phases. The first part decides what MIs should be bundled together and it add the "bits" which glued MIs together. This can be done either before pre-RA scheduling. The second part of the packetization should only be done after register allocation is completed. There are two very important reason for this.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. Packet finalization *must* add source and def operands to the "Bundle" pseudo MI. This allows all later passes to handle they transparently. However, we do not want to do this before register allocation is complete. Otherwise it introduces new defs and uses of virtual registers and that mess up MachineRegisterInfo def-use chains.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>e.g. Now vr0 has two defs!</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>defs: vr0<dead>, vr3, uses: vr1, vr2</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>----------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| vr0 = op1 vr1, vr2 |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| vr3 = op2 vr0<kill>, #c |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>----------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. During register allocation, more identity copies will be eliminated while loads, stores, copies, re-materialized instructions will be introduced. It makes sense for the second part of packetization to try to fill these new instructions into empty slots (for VLIW like targets).</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>So the overall flow should look like this:</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. DAG to MI lowering (no scheduling!)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. MI optimizations (LICM, CSE, etc.)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>3. Register allocation super pass</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3a. De-ssa (2-address, phi slim)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3b. Coalescing</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3c.<span class=apple-converted-space> </span><b>Pre-scheduling packetization (optional)</b></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3d. Pre-RA scheduling (or<span class=apple-converted-space> </span><b>integrated packetization</b>)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3e.<span class=apple-converted-space> </span><b>Post-scheduling packetization (optional)</b></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3f. Actual register allocation</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> 3g.<span class=apple-converted-space> </span><b>Packet finalization</b></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>4. Post-RA optimizations</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>5. PEI</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>6. Re-schedule restores, copies</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>Lowering Bundles to MCInst</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>There is no need to add the equivalent of MI bundle to MCInst. A MI bundle should be concatenated into a single MCInst by storing opcodes as integer operands. e.g.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r0 = op1 r1, r2 |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>| r3 = op2 r0, #c |</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>-------------------------</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>=></span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>MCInst: op1 r0, r1, r2, op2, r3, r0, #c</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>or</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>MCInst: op1 op2 r0, r1, r2, r3, r0, #c</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><b><span style='font-size:9.0pt;font-family:Courier'>What's Next?</span></b><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>I am hoping to find some time to implement the followings in the near future:</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>1. Add BUNDLE opcode</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>2. MachineInstr class changes: new bit, changes to methods such as eraseFromParent(), isIdenticalTo().</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>3. Change MachineInstr::iterator to skip over bundled MIs. Rename old iterator.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>4. Add MachineInstr API to check for instruction properties and switch existing code over.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>5. Add API to form a bundle. It would compute the proper def's and use's and add MachineOperands to the bundle MI.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>6. Switch Thumb2 IT block to using MI bundles.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>7. Add interface for targets to register their own packetization passes.</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>I would dearly welcome help on any of these tasks especially on 4, 5, 6. I also would not cry if someone beats me to #6 (or actually any of the tasks. :-)</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>In the longer term, I would like to see a target independent packetization pass (I believe one is being reviewed). I would also like to see a target independent interface for pre-scheduling optimizations that form instruction sequences (e.g. macro-fusion). Patches welcome!</span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'> </span><o:p></o:p></p></div></div><div><div><p class=MsoNormal><span style='font-size:9.0pt;font-family:Courier'>Evan</span><o:p></o:p></p></div></div></div></div></div><p class=MsoNormal><o:p> </o:p></p></div></div></body></html>