/usr/share/doc/llvm-3.6-doc/html/Statepoints.html is in llvm-3.6-doc 1:3.6-2ubuntu1~trusty2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>Garbage Collection Safepoints in LLVM — LLVM 3.6 documentation</title>
<link rel="stylesheet" href="_static/llvm-theme.css" type="text/css" />
<link rel="stylesheet" href="_static/pygments.css" type="text/css" />
<script type="text/javascript">
var DOCUMENTATION_OPTIONS = {
URL_ROOT: './',
VERSION: '3.6',
COLLAPSE_INDEX: false,
FILE_SUFFIX: '.html',
HAS_SOURCE: true
};
</script>
<script type="text/javascript" src="_static/jquery.js"></script>
<script type="text/javascript" src="_static/underscore.js"></script>
<script type="text/javascript" src="_static/doctools.js"></script>
<link rel="top" title="LLVM 3.6 documentation" href="index.html" />
<link rel="next" title="MergeFunctions pass, how it works" href="MergeFunctions.html" />
<link rel="prev" title="LLVM Code Coverage Mapping Format" href="CoverageMappingFormat.html" />
<style type="text/css">
table.right { float: right; margin-left: 20px; }
table.right td { border: 1px solid #ccc; }
</style>
</head>
<body>
<div class="logo">
<a href="index.html">
<img src="_static/logo.png"
alt="LLVM Logo" width="250" height="88"/></a>
</div>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="genindex.html" title="General Index"
accesskey="I">index</a></li>
<li class="right" >
<a href="MergeFunctions.html" title="MergeFunctions pass, how it works"
accesskey="N">next</a> |</li>
<li class="right" >
<a href="CoverageMappingFormat.html" title="LLVM Code Coverage Mapping Format"
accesskey="P">previous</a> |</li>
<li><a href="http://llvm.org/">LLVM Home</a> | </li>
<li><a href="index.html">Documentation</a>»</li>
</ul>
</div>
<div class="document">
<div class="documentwrapper">
<div class="body">
<div class="section" id="garbage-collection-safepoints-in-llvm">
<h1>Garbage Collection Safepoints in LLVM<a class="headerlink" href="#garbage-collection-safepoints-in-llvm" title="Permalink to this headline">¶</a></h1>
<div class="contents local topic" id="contents">
<ul class="simple">
<li><a class="reference internal" href="#status" id="id10">Status</a></li>
<li><a class="reference internal" href="#overview" id="id11">Overview</a></li>
<li><a class="reference internal" href="#intrinsics" id="id12">Intrinsics</a><ul>
<li><a class="reference internal" href="#gc-statepoint-intrinsic" id="id13">‘’‘gc.statepoint’‘’ Intrinsic</a></li>
<li><a class="reference internal" href="#gc-result-intrinsic" id="id14">‘’‘gc.result’‘’ Intrinsic</a></li>
<li><a class="reference internal" href="#gc-relocate-intrinsic" id="id15">‘’‘gc.relocate’‘’ Intrinsic</a></li>
</ul>
</li>
<li><a class="reference internal" href="#stack-map-format" id="id16">Stack Map Format</a></li>
<li><a class="reference internal" href="#safepoint-semantics-verification" id="id17">Safepoint Semantics & Verification</a></li>
<li><a class="reference internal" href="#bugs-and-enhancements" id="id18">Bugs and Enhancements</a></li>
</ul>
</div>
<div class="section" id="status">
<h2><a class="toc-backref" href="#id10">Status</a><a class="headerlink" href="#status" title="Permalink to this headline">¶</a></h2>
<p>This document describes a set of experimental extensions to LLVM. Use
with caution. Because the intrinsics have experimental status,
compatibility across LLVM releases is not guaranteed.</p>
<p>LLVM currently supports an alternate mechanism for conservative
garbage collection support using the gc_root intrinsic. The mechanism
described here shares little in common with the alternate
implementation and it is hoped that this mechanism will eventually
replace the gc_root mechanism.</p>
</div>
<div class="section" id="overview">
<h2><a class="toc-backref" href="#id11">Overview</a><a class="headerlink" href="#overview" title="Permalink to this headline">¶</a></h2>
<p>To collect dead objects, garbage collectors must be able to identify
any references to objects contained within executing code, and,
depending on the collector, potentially update them. The collector
does not need this information at all points in code - that would make
the problem much harder - but only at well-defined points in the
execution known as ‘safepoints’ For most collectors, it is sufficient
to track at least one copy of each unique pointer value. However, for
a collector which wishes to relocate objects directly reachable from
running code, a higher standard is required.</p>
<p>One additional challenge is that the compiler may compute intermediate
results (“derived pointers”) which point outside of the allocation or
even into the middle of another allocation. The eventual use of this
intermediate value must yield an address within the bounds of the
allocation, but such “exterior derived pointers” may be visible to the
collector. Given this, a garbage collector can not safely rely on the
runtime value of an address to indicate the object it is associated
with. If the garbage collector wishes to move any object, the
compiler must provide a mapping, for each pointer, to an indication of
its allocation.</p>
<p>To simplify the interaction between a collector and the compiled code,
most garbage collectors are organized in terms of three abstractions:
load barriers, store barriers, and safepoints.</p>
<ol class="arabic simple">
<li>A load barrier is a bit of code executed immediately after the
machine load instruction, but before any use of the value loaded.
Depending on the collector, such a barrier may be needed for all
loads, merely loads of a particular type (in the original source
language), or none at all.</li>
<li>Analogously, a store barrier is a code fragement that runs
immediately before the machine store instruction, but after the
computation of the value stored. The most common use of a store
barrier is to update a ‘card table’ in a generational garbage
collector.</li>
<li>A safepoint is a location at which pointers visible to the compiled
code (i.e. currently in registers or on the stack) are allowed to
change. After the safepoint completes, the actual pointer value
may differ, but the ‘object’ (as seen by the source language)
pointed to will not.</li>
</ol>
<blockquote>
<div>Note that the term ‘safepoint’ is somewhat overloaded. It refers to
both the location at which the machine state is parsable and the
coordination protocol involved in bring application threads to a
point at which the collector can safely use that information. The
term “statepoint” as used in this document refers exclusively to the
former.</div></blockquote>
<p>This document focuses on the last item - compiler support for
safepoints in generated code. We will assume that an outside
mechanism has decided where to place safepoints. From our
perspective, all safepoints will be function calls. To support
relocation of objects directly reachable from values in compiled code,
the collector must be able to:</p>
<ol class="arabic simple">
<li>identify every copy of a pointer (including copies introduced by
the compiler itself) at the safepoint,</li>
<li>identify which object each pointer relates to, and</li>
<li>potentially update each of those copies.</li>
</ol>
<p>This document describes the mechanism by which an LLVM based compiler
can provide this information to a language runtime/collector, and
ensure that all pointers can be read and updated if desired. The
heart of the approach is to construct (or rewrite) the IR in a manner
where the possible updates performed by the garbage collector are
explicitly visible in the IR. Doing so requires that we:</p>
<ol class="arabic simple">
<li>create a new SSA value for each potentially relocated pointer, and
ensure that no uses of the original (non relocated) value is
reachable after the safepoint,</li>
<li>specify the relocation in a way which is opaque to the compiler to
ensure that the optimizer can not introduce new uses of an
unrelocated value after a statepoint. This prevents the optimizer
from performing unsound optimizations.</li>
<li>recording a mapping of live pointers (and the allocation they’re
associated with) for each statepoint.</li>
</ol>
<p>At the most abstract level, inserting a safepoint can be thought of as
replacing a call instruction with a call to a multiple return value
function which both calls the original target of the call, returns
it’s result, and returns updated values for any live pointers to
garbage collected objects.</p>
<blockquote>
<div>Note that the task of identifying all live pointers to garbage
collected values, transforming the IR to expose a pointer giving the
base object for every such live pointer, and inserting all the
intrinsics correctly is explicitly out of scope for this document.
The recommended approach is described in the section of Late
Safepoint Placement below.</div></blockquote>
<p>This abstract function call is concretely represented by a sequence of
intrinsic calls known as a ‘statepoint sequence’.</p>
<dl class="docutils">
<dt>Let’s consider a simple call in LLVM IR:</dt>
<dd>todo</dd>
</dl>
<p>Depending on our language we may need to allow a safepoint during the
execution of the function called from this site. If so, we need to
let the collector update local values in the current frame.</p>
<p>Let’s say we need to relocate SSA values ‘a’, ‘b’, and ‘c’ at this
safepoint. To represent this, we would generate the statepoint
sequence:</p>
<blockquote>
<div>todo</div></blockquote>
<p>Ideally, this sequence would have been represented as a M argument, N
return value function (where M is the number of values being
relocated + the original call arguments and N is the original return
value + each relocated value), but LLVM does not easily support such a
representation.</p>
<p>Instead, the statepoint intrinsic marks the actual site of the
safepoint or statepoint. The statepoint returns a token value (which
exists only at compile time). To get back the original return value
of the call, we use the ‘gc.result’ intrinsic. To get the relocation
of each pointer in turn, we use the ‘gc.relocate’ intrinsic with the
appropriate index. Note that both the gc.relocate and gc.result are
tied to the statepoint. The combination forms a “statepoint sequence”
and represents the entitety of a parseable call or ‘statepoint’.</p>
<dl class="docutils">
<dt>When lowered, this example would generate the following x86 assembly::</dt>
<dd>put assembly here</dd>
</dl>
<p>Each of the potentially relocated values has been spilled to the
stack, and a record of that location has been recorded to the
<a class="reference internal" href="StackMaps.html#stackmap-section"><em>Stack Map section</em></a>. If the garbage collector
needs to update any of these pointers during the call, it knows
exactly what to change.</p>
</div>
<div class="section" id="intrinsics">
<h2><a class="toc-backref" href="#id12">Intrinsics</a><a class="headerlink" href="#intrinsics" title="Permalink to this headline">¶</a></h2>
<div class="section" id="gc-statepoint-intrinsic">
<h3><a class="toc-backref" href="#id13">‘’‘gc.statepoint’‘’ Intrinsic</a><a class="headerlink" href="#gc-statepoint-intrinsic" title="Permalink to this headline">¶</a></h3>
<div class="section" id="syntax">
<h4>Syntax:<a class="headerlink" href="#syntax" title="Permalink to this headline">¶</a></h4>
<div class="highlight-python"><div class="highlight"><pre>declare i32
@gc.statepoint(func_type <target>, i64 <#call args>.
i64 <unused>, ... (call parameters),
i64 <# deopt args>, ... (deopt parameters),
... (gc parameters))
</pre></div>
</div>
</div>
<div class="section" id="id1">
<h4>Overview:<a class="headerlink" href="#id1" title="Permalink to this headline">¶</a></h4>
<p>The statepoint intrinsic represents a call which is parse-able by the
runtime.</p>
</div>
<div class="section" id="operands">
<h4>Operands:<a class="headerlink" href="#operands" title="Permalink to this headline">¶</a></h4>
<p>The ‘target’ operand is the function actually being called. The
target can be specified as either a symbolic LLVM function, or as an
arbitrary Value of appropriate function type. Note that the function
type must match the signature of the callee and the types of the ‘call
parameters’ arguments.</p>
<p>The ‘#call args’ operand is the number of arguments to the actual
call. It must exactly match the number of arguments passed in the
‘call parameters’ variable length section.</p>
<p>The ‘unused’ operand is unused and likely to be removed. Please do
not use.</p>
<p>The ‘call parameters’ arguments are simply the arguments which need to
be passed to the call target. They will be lowered according to the
specified calling convention and otherwise handled like a normal call
instruction. The number of arguments must exactly match what is
specified in ‘# call args’. The types must match the signature of
‘target’.</p>
<p>The ‘deopt parameters’ arguments contain an arbitrary list of Values
which is meaningful to the runtime. The runtime may read any of these
values, but is assumed not to modify them. If the garbage collector
might need to modify one of these values, it must also be listed in
the ‘gc pointer’ argument list. The ‘# deopt args’ field indicates
how many operands are to be interpreted as ‘deopt parameters’.</p>
<p>The ‘gc parameters’ arguments contain every pointer to a garbage
collector object which potentially needs to be updated by the garbage
collector. Note that the argument list must explicitly contain a base
pointer for every derived pointer listed. The order of arguments is
unimportant. Unlike the other variable length parameter sets, this
list is not length prefixed.</p>
</div>
<div class="section" id="semantics">
<h4>Semantics:<a class="headerlink" href="#semantics" title="Permalink to this headline">¶</a></h4>
<p>A statepoint is assumed to read and write all memory. As a result,
memory operations can not be reordered past a statepoint. It is
illegal to mark a statepoint as being either ‘readonly’ or ‘readnone’.</p>
<p>Note that legal IR can not perform any memory operation on a ‘gc
pointer’ argument of the statepoint in a location statically reachable
from the statepoint. Instead, the explicitly relocated value (from a
‘’gc.relocate’‘) must be used.</p>
</div>
</div>
<div class="section" id="gc-result-intrinsic">
<h3><a class="toc-backref" href="#id14">‘’‘gc.result’‘’ Intrinsic</a><a class="headerlink" href="#gc-result-intrinsic" title="Permalink to this headline">¶</a></h3>
<div class="section" id="id2">
<h4>Syntax:<a class="headerlink" href="#id2" title="Permalink to this headline">¶</a></h4>
<div class="highlight-python"><div class="highlight"><pre>declare type*
@gc.result_ptr(i32 %statepoint_token)
declare fX
@gc.result_float(i32 %statepoint_token)
declare iX
@gc.result_int(i32 %statepoint_token)
</pre></div>
</div>
</div>
<div class="section" id="id3">
<h4>Overview:<a class="headerlink" href="#id3" title="Permalink to this headline">¶</a></h4>
<p>‘’‘gc.result’‘’ extracts the result of the original call instruction
which was replaced by the ‘’‘gc.statepoint’‘’. The ‘’‘gc.result’‘’
intrinsic is actually a family of three intrinsics due to an
implementation limitation. Other than the type of the return value,
the semantics are the same.</p>
</div>
<div class="section" id="id4">
<h4>Operands:<a class="headerlink" href="#id4" title="Permalink to this headline">¶</a></h4>
<p>The first and only argument is the ‘’‘gc.statepoint’‘’ which starts
the safepoint sequence of which this ‘’‘gc.result’’ is a part.
Despite the typing of this as a generic i32, <em>only</em> the value defined
by a ‘’‘gc.statepoint’‘’ is legal here.</p>
</div>
<div class="section" id="id5">
<h4>Semantics:<a class="headerlink" href="#id5" title="Permalink to this headline">¶</a></h4>
<p>The ‘’gc.result’’ represents the return value of the call target of
the ‘’statepoint’‘. The type of the ‘’gc.result’’ must exactly match
the type of the target. If the call target returns void, there will
be no ‘’gc.result’‘.</p>
<p>A ‘’gc.result’’ is modeled as a ‘readnone’ pure function. It has no
side effects since it is just a projection of the return value of the
previous call represented by the ‘’gc.statepoint’‘.</p>
</div>
</div>
<div class="section" id="gc-relocate-intrinsic">
<h3><a class="toc-backref" href="#id15">‘’‘gc.relocate’‘’ Intrinsic</a><a class="headerlink" href="#gc-relocate-intrinsic" title="Permalink to this headline">¶</a></h3>
<div class="section" id="id6">
<h4>Syntax:<a class="headerlink" href="#id6" title="Permalink to this headline">¶</a></h4>
<div class="highlight-python"><div class="highlight"><pre>declare <type> addrspace(1)*
@gc.relocate(i32 %statepoint_token, i32 %base_offset, i32 %pointer_offset)
</pre></div>
</div>
</div>
<div class="section" id="id7">
<h4>Overview:<a class="headerlink" href="#id7" title="Permalink to this headline">¶</a></h4>
<p>A ‘’gc.relocate’’ returns the potentially relocated value of a pointer
at the safepoint.</p>
</div>
<div class="section" id="id8">
<h4>Operands:<a class="headerlink" href="#id8" title="Permalink to this headline">¶</a></h4>
<p>The first argument is the ‘’‘gc.statepoint’‘’ which starts the
safepoint sequence of which this ‘’‘gc.relocation’’ is a part.
Despite the typing of this as a generic i32, <em>only</em> the value defined
by a ‘’‘gc.statepoint’‘’ is legal here.</p>
<p>The second argument is an index into the statepoints list of arguments
which specifies the base pointer for the pointer being relocated.
This index must land within the ‘gc parameter’ section of the
statepoint’s argument list.</p>
<p>The third argument is an index into the statepoint’s list of arguments
which specify the (potentially) derived pointer being relocated. It
is legal for this index to be the same as the second argument
if-and-only-if a base pointer is being relocated. This index must land
within the ‘gc parameter’ section of the statepoint’s argument list.</p>
</div>
<div class="section" id="id9">
<h4>Semantics:<a class="headerlink" href="#id9" title="Permalink to this headline">¶</a></h4>
<p>The return value of ‘’gc.relocate’’ is the potentially relocated value
of the pointer specified by it’s arguments. It is unspecified how the
value of the returned pointer relates to the argument to the
‘’gc.statepoint’’ other than that a) it points to the same source
language object with the same offset, and b) the ‘based-on’
relationship of the newly relocated pointers is a projection of the
unrelocated pointers. In particular, the integer value of the pointer
returned is unspecified.</p>
<p>A ‘’gc.relocate’’ is modeled as a ‘readnone’ pure function. It has no
side effects since it is just a way to extract information about work
done during the actual call modeled by the ‘’gc.statepoint’‘.</p>
</div>
</div>
</div>
<div class="section" id="stack-map-format">
<h2><a class="toc-backref" href="#id16">Stack Map Format</a><a class="headerlink" href="#stack-map-format" title="Permalink to this headline">¶</a></h2>
<p>Locations for each pointer value which may need read and/or updated by
the runtime or collector are provided via the <a class="reference internal" href="StackMaps.html#stackmap-format"><em>Stack Map format</em></a> specified in the PatchPoint documentation.</p>
<p>Each statepoint generates the following Locations:</p>
<ul class="simple">
<li>Constant which describes number of following deopt <em>Locations</em> (not
operands)</li>
<li>Variable number of Locations, one for each deopt parameter listed in
the IR statepoint (same number as described by previous Constant)</li>
<li>Variable number of Locations pairs, one pair for each unique pointer
which needs relocated. The first Location in each pair describes
the base pointer for the object. The second is the derived pointer
actually being relocated. It is guaranteed that the base pointer
must also appear explicitly as a relocation pair if used after the
statepoint. There may be fewer pairs then gc parameters in the IR
statepoint. Each <em>unique</em> pair will occur at least once; duplicates
are possible.</li>
</ul>
<p>Note that the Locations used in each section may describe the same
physical location. e.g. A stack slot may appear as a deopt location,
a gc base pointer, and a gc derived pointer.</p>
<p>The ID field of the ‘StkMapRecord’ for a statepoint is meaningless and
it’s value is explicitly unspecified.</p>
<p>The LiveOut section of the StkMapRecord will be empty for a statepoint
record.</p>
</div>
<div class="section" id="safepoint-semantics-verification">
<h2><a class="toc-backref" href="#id17">Safepoint Semantics & Verification</a><a class="headerlink" href="#safepoint-semantics-verification" title="Permalink to this headline">¶</a></h2>
<p>The fundamental correctness property for the compiled code’s
correctness w.r.t. the garbage collector is a dynamic one. It must be
the case that there is no dynamic trace such that a operation
involving a potentially relocated pointer is observably-after a
safepoint which could relocate it. ‘observably-after’ is this usage
means that an outside observer could observe this sequence of events
in a way which precludes the operation being performed before the
safepoint.</p>
<p>To understand why this ‘observable-after’ property is required,
consider a null comparison performed on the original copy of a
relocated pointer. Assuming that control flow follows the safepoint,
there is no way to observe externally whether the null comparison is
performed before or after the safepoint. (Remember, the original
Value is unmodified by the safepoint.) The compiler is free to make
either scheduling choice.</p>
<p>The actual correctness property implemented is slightly stronger than
this. We require that there be no <em>static path</em> on which a
potentially relocated pointer is ‘observably-after’ it may have been
relocated. This is slightly stronger than is strictly necessary (and
thus may disallow some otherwise valid programs), but greatly
simplifies reasoning about correctness of the compiled code.</p>
<p>By construction, this property will be upheld by the optimizer if
correctly established in the source IR. This is a key invariant of
the design.</p>
<p>The existing IR Verifier pass has been extended to check most of the
local restrictions on the intrinsics mentioned in their respective
documentation. The current implementation in LLVM does not check the
key relocation invariant, but this is ongoing work on developing such
a verifier. Please ask on llvmdev if you’re interested in
experimenting with the current version.</p>
</div>
<div class="section" id="bugs-and-enhancements">
<h2><a class="toc-backref" href="#id18">Bugs and Enhancements</a><a class="headerlink" href="#bugs-and-enhancements" title="Permalink to this headline">¶</a></h2>
<p>Currently known bugs and enhancements under consideration can be
tracked by performing a <a class="reference external" href="http://llvm.org/bugs/buglist.cgi?cmdtype=runnamed&namedcmd=Statepoint%20Bugs&list_id=64342">bugzilla search</a>
for [Statepoint] in the summary field. When filing new bugs, please
use this tag so that interested parties see the newly filed bug. As
with most LLVM features, design discussions take place on <a class="reference external" href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev">llvmdev</a>, and patches
should be sent to <a class="reference external" href="http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits">llvm-commits</a> for review.</p>
</div>
</div>
</div>
</div>
<div class="clearer"></div>
</div>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="genindex.html" title="General Index"
>index</a></li>
<li class="right" >
<a href="MergeFunctions.html" title="MergeFunctions pass, how it works"
>next</a> |</li>
<li class="right" >
<a href="CoverageMappingFormat.html" title="LLVM Code Coverage Mapping Format"
>previous</a> |</li>
<li><a href="http://llvm.org/">LLVM Home</a> | </li>
<li><a href="index.html">Documentation</a>»</li>
</ul>
</div>
<div class="footer">
© Copyright 2003-2014, LLVM Project.
Last updated on 2018-07-24.
Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.2.
</div>
</body>
</html>
|