about summary refs log tree commit diff stats
path: root/html/002test.cc.html
Commit message (Expand)AuthorAgeFilesLines
* 5490Kartik Agaram2019-07-271-3/+3
* 5485 - promote SubX to top-levelKartik Agaram2019-07-271-62/+70
* 4891Kartik Agaram2018-12-301-0/+1
* 4890 - new html renderingsKartik Agaram2018-12-291-16/+11
* 4814Kartik Agaram2018-12-011-31/+35
* 4539Kartik Agaram2018-09-071-8/+7
* 4447Kartik Agaram2018-07-271-86/+104
* 4239Kartik Agaram2018-05-081-7/+7
* 4199Kartik K. Agaram2018-01-251-22/+21
* 4162Kartik K. Agaram2017-12-221-111/+86
* 4161Kartik K. Agaram2017-12-151-8/+8
* 4155Kartik K. Agaram2017-12-071-1/+1
* 3971Kartik K. Agaram2017-08-191-86/+85
* 3927Kartik K. Agaram2017-06-191-2/+2
* 3897 - various updates to documentationKartik K. Agaram2017-05-291-1/+1
* 3764 - better colors for cross-linksKartik K. Agaram2017-03-081-4/+5
* 3761Kartik K. Agaram2017-03-071-17/+18
* 3750Kartik K. Agaram2017-03-021-1/+1
* 3749Kartik K. Agaram2017-03-021-2/+2
* 3716Kartik K. Agaram2016-12-261-0/+2
* 3713 - cross-link calls with definitions in htmlKartik K. Agaram2016-12-261-17/+17
* 3710Kartik K. Agaram2016-12-261-112/+112
* 3709 - line numbers in htmlKartik K. Agaram2016-12-261-115/+139
* 3561Kartik K. Agaram2016-10-221-1/+1
* 3558Kartik K. Agaram2016-10-221-6/+6
* 3544Kartik K. Agaram2016-10-221-1/+1
* 3543Kartik K. Agaram2016-10-221-3/+2
* 3524Kartik K. Agaram2016-10-201-2/+2
* 3433Kartik K. Agaram2016-10-011-1/+1
* 3315Kartik K. Agaram2016-09-101-4/+6
* 3219Kartik K. Agaram2016-08-171-1/+1
* 3174Kartik K. Agaram2016-08-121-1/+1
* 3102Kartik K. Agaram2016-07-051-1/+1
* 2812Kartik K. Agaram2016-03-271-13/+22
* 2744Kartik K. Agaram2016-03-091-4/+4
* 2743Kartik K. Agaram2016-03-091-39/+31
* 2706 - update htmlKartik K. Agaram2016-02-251-4/+5
* 2175Kartik K. Agaram2015-09-061-1/+1
* 2062Kartik K. Agaram2015-08-231-25/+36
* 1949Kartik K. Agaram2015-08-061-22/+23
* 1885Kartik K. Agaram2015-07-291-22/+21
* 1853Kartik K. Agaram2015-07-251-21/+22
* 1690Kartik K. Agaram2015-07-011-1/+1
* 1632Kartik K. Agaram2015-06-231-1/+1
* 1631 - update html versionsKartik K. Agaram2015-06-231-5/+5
* 1556Kartik K. Agaram2015-06-121-1/+1
* 1549Kartik K. Agaram2015-06-091-2/+2
* 1517Kartik K. Agaram2015-05-301-3/+5
* 1461 - descriptions/table of contents for the layersKartik K. Agaram2015-05-261-1/+1
* 1459Kartik K. Agaram2015-05-251-6/+8
lass="w"> 1px; } .Comment { color: #9090ff; } .Comment a { color:#0000ee; text-decoration:underline; } .PreProc { color: #800080; } --> </style> <script type='text/javascript'> <!-- /* function to open any folds containing a jumped-to line before jumping to it */ function JumpToLine() { var lineNum; lineNum = window.location.hash; lineNum = lineNum.substr(1); /* strip off '#' */ if (lineNum.indexOf('L') == -1) { lineNum = 'L'+lineNum; } lineElem = document.getElementById(lineNum); /* Always jump to new location even if the line was hidden inside a fold, or * we corrected the raw number to a line ID. */ if (lineElem) { lineElem.scrollIntoView(true); } return true; } if ('onhashchange' in window) { window.onhashchange = JumpToLine; } --> </script> </head> <body onload='JumpToLine();'> <pre id='vimCodeElement'> <span id="L1" class="LineNr"> 1 </span><span class="Comment">//: Start allowing us to not specify precise addresses for the start of each</span> <span id="L2" class="LineNr"> 2 </span><span class="Comment">//: segment.</span> <span id="L3" class="LineNr"> 3 </span><span class="Comment">//: This gives up a measure of control in placing code and data.</span> <span id="L4" class="LineNr"> 4 </span> <span id="L5" class="LineNr"> 5 </span><span class="Comment">//: segment address computation requires setting Mem_offset in test mode to what it'll be in run mode</span> <span id="L6" class="LineNr"> 6 </span><span class="Delimiter">:(scenario segment_name)</span> <span id="L7" class="LineNr"> 7 </span><span class="Special">% Mem_offset = CODE_START;</span> <span id="L8" class="LineNr"> 8 </span>== <a href='031check_operands.cc.html#L14'>code</a> <span id="L9" class="LineNr"> 9 </span><span class="PreProc">0</span><span class="Constant">5</span>/add <span class="Constant">0x0d0c0b0a</span>/imm32 <span class="Comment"># add 0x0d0c0b0a to EAX</span> <span id="L10" class="LineNr">10 </span><span class="Comment"># code starts at 0x08048000 + p_offset, which is 0x54 for a single-segment binary</span> <span id="L11" class="LineNr">11 </span><span class="traceContains">+load: 0x08048054 -&gt; 05</span> <span id="L12" class="LineNr">12 </span><span class="traceContains">+load: 0x08048055 -&gt; 0a</span> <span id="L13" class="LineNr">13 </span><span class="traceContains">+load: 0x08048056 -&gt; 0b</span> <span id="L14" class="LineNr">14 </span><span class="traceContains">+load: 0x08048057 -&gt; 0c</span> <span id="L15" class="LineNr">15 </span><span class="traceContains">+load: 0x08048058 -&gt; 0d</span> <span id="L16" class="LineNr">16 </span><span class="traceContains">+run: add imm32 0x0d0c0b0a to <a href='010---vm.cc.html#L23'>reg</a> <a href='010---vm.cc.html#L13'>EAX</a></span> <span id="L17" class="LineNr">17 </span><span class="traceContains">+run: storing 0x0d0c0b0a</span> <span id="L18" class="LineNr">18 </span> <span id="L19" class="LineNr">19 </span><span class="Delimiter">:(before &quot;End Level-2 Transforms&quot;)</span> <span id="L20" class="LineNr">20 </span><a href='011run.cc.html#L207'>Transform</a><span class="Delimiter">.</span>push_back<span class="Delimiter">(</span><a href='034compute_segment_address.cc.html#L23'>compute_segment_starts</a><span class="Delimiter">);</span> <span id="L21" class="LineNr">21 </span> <span id="L22" class="LineNr">22 </span><span class="Delimiter">:(code)</span> <span id="L23" class="LineNr">23 </span><span class="Normal">void</span> <a href='034compute_segment_address.cc.html#L23'>compute_segment_starts</a><span class="Delimiter">(</span>program&amp; p<span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L24" class="LineNr">24 </span> <a href='003trace.cc.html#L196'>trace</a><span class="Delimiter">(</span><span class="Constant">99</span><span class="Delimiter">,</span> <span class="Constant">&quot;transform&quot;</span><span class="Delimiter">)</span> &lt;&lt; <span class="Constant">&quot;-- compute segment addresses&quot;</span> &lt;&lt; <a href='003trace.cc.html#L222'>end</a><span class="Delimiter">();</span> <span id="L25" class="LineNr">25 </span> <span class="Normal">uint32_t</span> p_offset = <span class="Comment">/*</span><span class="Comment">size of ehdr</span><span class="Comment">*/</span><span class="Constant">0x34</span> + <a href='001help.cc.html#L157'>SIZE</a><span class="Delimiter">(</span>p<span class="Delimiter">.</span><a href='011run.cc.html#L100'>segments</a><span class="Delimiter">)</span>*<span class="Constant">0x20</span><span class="Comment">/*</span><span class="Comment">size of each phdr</span><span class="Comment">*/</span><span class="Delimiter">;</span> <span id="L26" class="LineNr">26 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">size_t</span> i = <span class="Constant">0</span><span class="Delimiter">;</span> i &lt; p<span class="Delimiter">.</span><a href='011run.cc.html#L100'>segments</a><span class="Delimiter">.</span>size<span class="Delimiter">();</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L27" class="LineNr">27 </span> segment&amp; curr = p<span class="Delimiter">.</span><a href='011run.cc.html#L100'>segments</a><span class="Delimiter">.</span>at<span class="Delimiter">(</span>i<span class="Delimiter">);</span> <span id="L28" class="LineNr">28 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>curr<span class="Delimiter">.</span><a href='011run.cc.html#L108'>start</a> == <span class="Constant">0</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L29" class="LineNr">29 </span> curr<span class="Delimiter">.</span><a href='011run.cc.html#L108'>start</a> = <a href='012elf.cc.html#L126'>CODE_START</a> + i*SEGMENT_SIZE + p_offset<span class="Delimiter">;</span> <span id="L30" class="LineNr">30 </span> <a href='003trace.cc.html#L196'>trace</a><span class="Delimiter">(</span><span class="Constant">99</span><span class="Delimiter">,</span> <span class="Constant">&quot;transform&quot;</span><span class="Delimiter">)</span> &lt;&lt; <span class="Constant">&quot;segment &quot;</span> &lt;&lt; i &lt;&lt; <span class="Constant">&quot; begins at address 0x&quot;</span> &lt;&lt; <a href='010---vm.cc.html#L260'>HEXWORD</a> &lt;&lt; curr<span class="Delimiter">.</span><a href='011run.cc.html#L108'>start</a> &lt;&lt; <a href='003trace.cc.html#L222'>end</a><span class="Delimiter">();</span> <span id="L31" class="LineNr">31 </span> <span class="Delimiter">}</span> <span id="L32" class="LineNr">32 </span> p_offset += <a href='034compute_segment_address.cc.html#L37'>size_of</a><span class="Delimiter">(</span>curr<span class="Delimiter">);</span> <span id="L33" class="LineNr">33 </span> assert<span class="Delimiter">(</span>p_offset &lt; <a href='012elf.cc.html#L127'>SEGMENT_SIZE</a><span class="Delimiter">);</span> <span class="Comment">// for now we get less and less available space in each successive segment</span> <span id="L34" class="LineNr">34 </span> <span class="Delimiter">}</span> <span id="L35" class="LineNr">35 </span><span class="Delimiter">}</span> <span id="L36" class="LineNr">36 </span> <span id="L37" class="LineNr">37 </span><span class="Normal">uint32_t</span> <a href='034compute_segment_address.cc.html#L37'>size_of</a><span class="Delimiter">(</span><span class="Normal">const</span> segment&amp; s<span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L38" class="LineNr">38 </span> <span class="Normal">uint32_t</span> sum = <span class="Constant">0</span><span class="Delimiter">;</span> <span id="L39" class="LineNr">39 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> i = <span class="Constant">0</span><span class="Delimiter">;</span> i &lt; <a href='001help.cc.html#L157'>SIZE</a><span class="Delimiter">(</span>s<span class="Delimiter">.</span><a href='011run.cc.html#L109'>lines</a><span class="Delimiter">);</span> ++i<span class="Delimiter">)</span> <span id="L40" class="LineNr">40 </span> sum += <a href='034compute_segment_address.cc.html#L45'>num_bytes</a><span class="Delimiter">(</span>s<span class="Delimiter">.</span><a href='011run.cc.html#L109'>lines</a><span class="Delimiter">.</span>at<span class="Delimiter">(</span>i<span class="Delimiter">));</span> <span id="L41" class="LineNr">41 </span> <span class="Identifier">return</span> sum<span class="Delimiter">;</span> <span id="L42" class="LineNr">42 </span><span class="Delimiter">}</span> <span id="L43" class="LineNr">43 </span> <span id="L44" class="LineNr">44 </span><span class="Comment">// Assumes all bitfields are packed.</span> <span id="L45" class="LineNr">45 </span><span class="Normal">uint32_t</span> <a href='034compute_segment_address.cc.html#L45'>num_bytes</a><span class="Delimiter">(</span><span class="Normal">const</span> line&amp; inst<span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L46" class="LineNr">46 </span> <span class="Normal">uint32_t</span> sum = <span class="Constant">0</span><span class="Delimiter">;</span> <span id="L47" class="LineNr">47 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> i = <span class="Constant">0</span><span class="Delimiter">;</span> i &lt; <a href='001help.cc.html#L157'>SIZE</a><span class="Delimiter">(</span>inst<span class="Delimiter">.</span><a href='011run.cc.html#L118'>words</a><span class="Delimiter">);</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> <span id="L48" class="LineNr">48 </span> <span class="Normal">const</span> word&amp; curr = inst<span class="Delimiter">.</span><a href='011run.cc.html#L118'>words</a><span class="Delimiter">.</span>at<span class="Delimiter">(</span>i<span class="Delimiter">);</span> <span id="L49" class="LineNr">49 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>has_operand_metadata<span class="Delimiter">(</span>curr<span class="Delimiter">,</span> <span class="Constant">&quot;disp32&quot;</span><span class="Delimiter">)</span> || has_operand_metadata<span class="Delimiter">(</span>curr<span class="Delimiter">,</span> <span class="Constant">&quot;imm32&quot;</span><span class="Delimiter">))</span> <span class="Comment">// only multi-byte operands</span> <span id="L50" class="LineNr">50 </span> sum += <span class="Constant">4</span><span class="Delimiter">;</span> <span id="L51" class="LineNr">51 </span> <span class="Comment">// End num_bytes(curr) Special-cases</span> <span id="L52" class="LineNr">52 </span> <span class="Normal">else</span> <span id="L53" class="LineNr">53 </span> sum++<span class="Delimiter">;</span> <span id="L54" class="LineNr">54 </span> <span class="Delimiter">}</span> <span id="L55" class="LineNr">55 </span> <span class="Identifier">return</span> sum<span class="Delimiter">;</span> <span id="L56" class="LineNr">56 </span><span class="Delimiter">}</span> <span id="L57" class="LineNr">57 </span> <span id="L58" class="LineNr">58 </span><span class="Comment">//: Dependencies:</span> <span id="L59" class="LineNr">59 </span><span class="Comment">//: - We'd like to compute segment addresses before setting up global variables,</span> <span id="L60" class="LineNr">60 </span><span class="Comment">//: because computing addresses for global variables requires knowing where</span> <span id="L61" class="LineNr">61 </span><span class="Comment">//: the data segment starts.</span> <span id="L62" class="LineNr">62 </span><span class="Comment">//: - We'd like to finish expanding labels before computing segment addresses,</span> <span id="L63" class="LineNr">63 </span><span class="Comment">//: because it would make computing the sizes of segments more self-contained</span> <span id="L64" class="LineNr">64 </span><span class="Comment">//: (num_bytes).</span> <span id="L65" class="LineNr">65 </span><span class="Comment">//:</span> <span id="L66" class="LineNr">66 </span><span class="Comment">//: Decision: compute segment addresses before expanding labels, by being</span> <span id="L67" class="LineNr">67 </span><span class="Comment">//: aware in this layer of certain operand types that will eventually occupy</span> <span id="L68" class="LineNr">68 </span><span class="Comment">//: multiple bytes.</span> <span id="L69" class="LineNr">69 </span><span class="Comment">//:</span> <span id="L70" class="LineNr">70 </span><span class="Comment">//: The layer to expand labels later hooks into num_bytes() to teach this</span> <span id="L71" class="LineNr">71 </span><span class="Comment">//: layer that labels occupy zero space in the binary.</span> </pre> </body> </html> <!-- vim: set foldmethod=manual : -->