fix duplicate anchor names, and broken anchor links from the TOC

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@58332 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Torok Edwin 2008-10-28 16:54:34 +00:00
parent 57760d96e2
commit 2b9cbf127f

View File

@ -157,7 +157,7 @@ href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd>
<dd>Inter-Procedural Optimization. Refers to any variety of code <dd>Inter-Procedural Optimization. Refers to any variety of code
optimization that occurs between procedures, functions or compilation units optimization that occurs between procedures, functions or compilation units
(modules).</dd> (modules).</dd>
<dt><a name="IPO"><b>ISel</b></a></dt> <dt><a name="ISel"><b>ISel</b></a></dt>
<dd>Instruction Selection.</dd> <dd>Instruction Selection.</dd>
</dl> </dl>
</div> </div>
@ -175,7 +175,7 @@ href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd>
</div> </div>
<!-- _______________________________________________________________________ --> <!-- _______________________________________________________________________ -->
<div class="doc_subsection"><a name="P">- O -</a></div> <div class="doc_subsection"><a name="O">- O -</a></div>
<div class="doc_text"> <div class="doc_text">
<dl> <dl>
<dt><a name="Object_Pointer"><b>Object Pointer</b></a></dt> <dt><a name="Object_Pointer"><b>Object Pointer</b></a></dt>
@ -214,7 +214,7 @@ href="http://www.program-transformation.org/Transform/BURG">BURG</a> tool.</dd>
<div class="doc_subsection"><a name="S">- S -</a></div> <div class="doc_subsection"><a name="S">- S -</a></div>
<div class="doc_text"> <div class="doc_text">
<dl> <dl>
<dt><a name="SCC"><b>Safe Point</b></a></dt> <dt><a name="Safe_Point"><b>Safe Point</b></a></dt>
<dd>In garbage collection, it is necessary to identify <a href="#Root">stack <dd>In garbage collection, it is necessary to identify <a href="#Root">stack
roots</a> so that reachability analysis may proceed. It may be infeasible to roots</a> so that reachability analysis may proceed. It may be infeasible to
provide this information for every instruction, so instead the information provide this information for every instruction, so instead the information