Gitiles
Code Review Sign In
gerrit-public.fairphone.software / fp2-dev / platform / external / llvm / 565f65d171288823bfa916f527478decc5842b45 / . / docs / LangRef.html
blob: c698e8a90a9d07b9193ae55ea83eff1aea434e5b [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
3<html>
4<head>
5 <title>LLVM Assembly Language Reference Manual</title>
6 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
7 <meta name="author" content="Chris Lattner">
8 <meta name="description"
9 content="LLVM Assembly Language Reference Manual.">
10 <link rel="stylesheet" href="llvm.css" type="text/css">
11</head>
12
13<body>
14
15<div class="doc_title"> LLVM Language Reference Manual </div>
16<ol>
17 <li><a href="#abstract">Abstract</a></li>
18 <li><a href="#introduction">Introduction</a></li>
19 <li><a href="#identifiers">Identifiers</a></li>
20 <li><a href="#highlevel">High Level Structure</a>
21 <ol>
22 <li><a href="#modulestructure">Module Structure</a></li>
23 <li><a href="#linkage">Linkage Types</a></li>
24 <li><a href="#callingconv">Calling Conventions</a></li>
Chris Lattner5b6dc6e2009-01-11 20:53:49 +0000[diff] [blame]25 <li><a href="#namedtypes">Named Types</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]26 <li><a href="#globalvars">Global Variables</a></li>
27 <li><a href="#functionstructure">Functions</a></li>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]28 <li><a href="#aliasstructure">Aliases</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]29 <li><a href="#paramattrs">Parameter Attributes</a></li>
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]30 <li><a href="#fnattrs">Function Attributes</a></li>
Gordon Henriksen13fe5e32007-12-10 03:18:06 +0000[diff] [blame]31 <li><a href="#gc">Garbage Collector Names</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]32 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
33 <li><a href="#datalayout">Data Layout</a></li>
34 </ol>
35 </li>
36 <li><a href="#typesystem">Type System</a>
37 <ol>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]38 <li><a href="#t_classifications">Type Classifications</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]39 <li><a href="#t_primitive">Primitive Types</a>
40 <ol>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]41 <li><a href="#t_floating">Floating Point Types</a></li>
42 <li><a href="#t_void">Void Type</a></li>
43 <li><a href="#t_label">Label Type</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]44 </ol>
45 </li>
46 <li><a href="#t_derived">Derived Types</a>
47 <ol>
Chris Lattner251ab812007-12-18 06:18:21 +0000[diff] [blame]48 <li><a href="#t_integer">Integer Type</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]49 <li><a href="#t_array">Array Type</a></li>
50 <li><a href="#t_function">Function Type</a></li>
51 <li><a href="#t_pointer">Pointer Type</a></li>
52 <li><a href="#t_struct">Structure Type</a></li>
53 <li><a href="#t_pstruct">Packed Structure Type</a></li>
54 <li><a href="#t_vector">Vector Type</a></li>
55 <li><a href="#t_opaque">Opaque Type</a></li>
56 </ol>
57 </li>
Chris Lattner515195a2009-02-02 07:32:36 +0000[diff] [blame]58 <li><a href="#t_uprefs">Type Up-references</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]59 </ol>
60 </li>
61 <li><a href="#constants">Constants</a>
62 <ol>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]63 <li><a href="#simpleconstants">Simple Constants</a></li>
Chris Lattner97063852009-02-28 18:32:25 +0000[diff] [blame]64 <li><a href="#complexconstants">Complex Constants</a></li>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]65 <li><a href="#globalconstants">Global Variable and Function Addresses</a></li>
66 <li><a href="#undefvalues">Undefined Values</a></li>
67 <li><a href="#constantexprs">Constant Expressions</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]68 </ol>
69 </li>
70 <li><a href="#othervalues">Other Values</a>
71 <ol>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]72 <li><a href="#inlineasm">Inline Assembler Expressions</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]73 </ol>
74 </li>
75 <li><a href="#instref">Instruction Reference</a>
76 <ol>
77 <li><a href="#terminators">Terminator Instructions</a>
78 <ol>
79 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
80 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
81 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
82 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
83 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
84 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
85 </ol>
86 </li>
87 <li><a href="#binaryops">Binary Operations</a>
88 <ol>
89 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
90 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
91 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
92 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
93 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
94 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
95 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
96 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
97 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
98 </ol>
99 </li>
100 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
101 <ol>
102 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
103 <li><a href="#i_lshr">'<tt>lshr</tt>' Instruction</a></li>
104 <li><a href="#i_ashr">'<tt>ashr</tt>' Instruction</a></li>
105 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
106 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
107 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
108 </ol>
109 </li>
110 <li><a href="#vectorops">Vector Operations</a>
111 <ol>
112 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
113 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
114 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
115 </ol>
116 </li>
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]117 <li><a href="#aggregateops">Aggregate Operations</a>
118 <ol>
119 <li><a href="#i_extractvalue">'<tt>extractvalue</tt>' Instruction</a></li>
120 <li><a href="#i_insertvalue">'<tt>insertvalue</tt>' Instruction</a></li>
121 </ol>
122 </li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]123 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
124 <ol>
125 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
126 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
127 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
128 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
129 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
130 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
131 </ol>
132 </li>
133 <li><a href="#convertops">Conversion Operations</a>
134 <ol>
135 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
136 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
137 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
138 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
139 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
140 <li><a href="#i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a></li>
141 <li><a href="#i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a></li>
142 <li><a href="#i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a></li>
143 <li><a href="#i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a></li>
144 <li><a href="#i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a></li>
145 <li><a href="#i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a></li>
146 <li><a href="#i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a></li>
147 </ol>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]148 </li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]149 <li><a href="#otherops">Other Operations</a>
150 <ol>
151 <li><a href="#i_icmp">'<tt>icmp</tt>' Instruction</a></li>
152 <li><a href="#i_fcmp">'<tt>fcmp</tt>' Instruction</a></li>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]153 <li><a href="#i_vicmp">'<tt>vicmp</tt>' Instruction</a></li>
154 <li><a href="#i_vfcmp">'<tt>vfcmp</tt>' Instruction</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]155 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
156 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
157 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
158 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
159 </ol>
160 </li>
161 </ol>
162 </li>
163 <li><a href="#intrinsics">Intrinsic Functions</a>
164 <ol>
165 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
166 <ol>
167 <li><a href="#int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
168 <li><a href="#int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
169 <li><a href="#int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
170 </ol>
171 </li>
172 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
173 <ol>
174 <li><a href="#int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a></li>
175 <li><a href="#int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a></li>
176 <li><a href="#int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a></li>
177 </ol>
178 </li>
179 <li><a href="#int_codegen">Code Generator Intrinsics</a>
180 <ol>
181 <li><a href="#int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a></li>
182 <li><a href="#int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a></li>
183 <li><a href="#int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a></li>
184 <li><a href="#int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a></li>
185 <li><a href="#int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a></li>
186 <li><a href="#int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a></li>
187 <li><a href="#int_readcyclecounter"><tt>llvm.readcyclecounter</tt>' Intrinsic</a></li>
188 </ol>
189 </li>
190 <li><a href="#int_libc">Standard C Library Intrinsics</a>
191 <ol>
192 <li><a href="#int_memcpy">'<tt>llvm.memcpy.*</tt>' Intrinsic</a></li>
193 <li><a href="#int_memmove">'<tt>llvm.memmove.*</tt>' Intrinsic</a></li>
194 <li><a href="#int_memset">'<tt>llvm.memset.*</tt>' Intrinsic</a></li>
195 <li><a href="#int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a></li>
196 <li><a href="#int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a></li>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]197 <li><a href="#int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a></li>
198 <li><a href="#int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a></li>
199 <li><a href="#int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a></li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]200 </ol>
201 </li>
202 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
203 <ol>
204 <li><a href="#int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
205 <li><a href="#int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic </a></li>
206 <li><a href="#int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic </a></li>
207 <li><a href="#int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic </a></li>
208 <li><a href="#int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic </a></li>
209 <li><a href="#int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic </a></li>
210 </ol>
211 </li>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]212 <li><a href="#int_overflow">Arithmetic with Overflow Intrinsics</a>
213 <ol>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]214 <li><a href="#int_sadd_overflow">'<tt>llvm.sadd.with.overflow.*</tt> Intrinsics</a></li>
215 <li><a href="#int_uadd_overflow">'<tt>llvm.uadd.with.overflow.*</tt> Intrinsics</a></li>
216 <li><a href="#int_ssub_overflow">'<tt>llvm.ssub.with.overflow.*</tt> Intrinsics</a></li>
217 <li><a href="#int_usub_overflow">'<tt>llvm.usub.with.overflow.*</tt> Intrinsics</a></li>
218 <li><a href="#int_smul_overflow">'<tt>llvm.smul.with.overflow.*</tt> Intrinsics</a></li>
Bill Wendlingbda98b62009-02-08 23:00:09 +0000[diff] [blame]219 <li><a href="#int_umul_overflow">'<tt>llvm.umul.with.overflow.*</tt> Intrinsics</a></li>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]220 </ol>
221 </li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]222 <li><a href="#int_debugger">Debugger intrinsics</a></li>
223 <li><a href="#int_eh">Exception Handling intrinsics</a></li>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]224 <li><a href="#int_trampoline">Trampoline Intrinsic</a>
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]225 <ol>
226 <li><a href="#int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a></li>
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]227 </ol>
228 </li>
Bill Wendling9127adb2008-11-18 22:10:53 +0000[diff] [blame]229 <li><a href="#int_atomics">Atomic intrinsics</a>
230 <ol>
231 <li><a href="#int_memory_barrier"><tt>llvm.memory_barrier</tt></a></li>
232 <li><a href="#int_atomic_cmp_swap"><tt>llvm.atomic.cmp.swap</tt></a></li>
233 <li><a href="#int_atomic_swap"><tt>llvm.atomic.swap</tt></a></li>
234 <li><a href="#int_atomic_load_add"><tt>llvm.atomic.load.add</tt></a></li>
235 <li><a href="#int_atomic_load_sub"><tt>llvm.atomic.load.sub</tt></a></li>
236 <li><a href="#int_atomic_load_and"><tt>llvm.atomic.load.and</tt></a></li>
237 <li><a href="#int_atomic_load_nand"><tt>llvm.atomic.load.nand</tt></a></li>
238 <li><a href="#int_atomic_load_or"><tt>llvm.atomic.load.or</tt></a></li>
239 <li><a href="#int_atomic_load_xor"><tt>llvm.atomic.load.xor</tt></a></li>
240 <li><a href="#int_atomic_load_max"><tt>llvm.atomic.load.max</tt></a></li>
241 <li><a href="#int_atomic_load_min"><tt>llvm.atomic.load.min</tt></a></li>
242 <li><a href="#int_atomic_load_umax"><tt>llvm.atomic.load.umax</tt></a></li>
243 <li><a href="#int_atomic_load_umin"><tt>llvm.atomic.load.umin</tt></a></li>
244 </ol>
245 </li>
Reid Spencerb043f672007-07-20 19:59:11 +0000[diff] [blame]246 <li><a href="#int_general">General intrinsics</a>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]247 <ol>
Reid Spencerb043f672007-07-20 19:59:11 +0000[diff] [blame]248 <li><a href="#int_var_annotation">
Bill Wendlinge4164592008-11-19 05:56:17 +0000[diff] [blame]249 '<tt>llvm.var.annotation</tt>' Intrinsic</a></li>
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]250 <li><a href="#int_annotation">
Bill Wendlinge4164592008-11-19 05:56:17 +0000[diff] [blame]251 '<tt>llvm.annotation.*</tt>' Intrinsic</a></li>
Anton Korobeynikove6e764f2008-01-15 22:31:34 +0000[diff] [blame]252 <li><a href="#int_trap">
Bill Wendlinge4164592008-11-19 05:56:17 +0000[diff] [blame]253 '<tt>llvm.trap</tt>' Intrinsic</a></li>
254 <li><a href="#int_stackprotector">
255 '<tt>llvm.stackprotector</tt>' Intrinsic</a></li>
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]256 </ol>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]257 </li>
258 </ol>
259 </li>
260</ol>
261
262<div class="doc_author">
263 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
264 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
265</div>
266
267<!-- *********************************************************************** -->
268<div class="doc_section"> <a name="abstract">Abstract </a></div>
269<!-- *********************************************************************** -->
270
271<div class="doc_text">
272<p>This document is a reference manual for the LLVM assembly language.
Bill Wendlinge7846a52008-08-05 22:29:16 +0000[diff] [blame]273LLVM is a Static Single Assignment (SSA) based representation that provides
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]274type safety, low-level operations, flexibility, and the capability of
275representing 'all' high-level languages cleanly. It is the common code
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]276representation used throughout all phases of the LLVM compilation
277strategy.</p>
278</div>
279
280<!-- *********************************************************************** -->
281<div class="doc_section"> <a name="introduction">Introduction</a> </div>
282<!-- *********************************************************************** -->
283
284<div class="doc_text">
285
286<p>The LLVM code representation is designed to be used in three
287different forms: as an in-memory compiler IR, as an on-disk bitcode
288representation (suitable for fast loading by a Just-In-Time compiler),
289and as a human readable assembly language representation. This allows
290LLVM to provide a powerful intermediate representation for efficient
291compiler transformations and analysis, while providing a natural means
292to debug and visualize the transformations. The three different forms
293of LLVM are all equivalent. This document describes the human readable
294representation and notation.</p>
295
296<p>The LLVM representation aims to be light-weight and low-level
297while being expressive, typed, and extensible at the same time. It
298aims to be a "universal IR" of sorts, by being at a low enough level
299that high-level ideas may be cleanly mapped to it (similar to how
300microprocessors are "universal IR's", allowing many source languages to
301be mapped to them). By providing type information, LLVM can be used as
302the target of optimizations: for example, through pointer analysis, it
303can be proven that a C automatic variable is never accessed outside of
304the current function... allowing it to be promoted to a simple SSA
305value instead of a memory location.</p>
306
307</div>
308
309<!-- _______________________________________________________________________ -->
310<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
311
312<div class="doc_text">
313
314<p>It is important to note that this document describes 'well formed'
315LLVM assembly language. There is a difference between what the parser
316accepts and what is considered 'well formed'. For example, the
317following instruction is syntactically okay, but not well formed:</p>
318
319<div class="doc_code">
320<pre>
321%x = <a href="#i_add">add</a> i32 1, %x
322</pre>
323</div>
324
325<p>...because the definition of <tt>%x</tt> does not dominate all of
326its uses. The LLVM infrastructure provides a verification pass that may
327be used to verify that an LLVM module is well formed. This pass is
328automatically run by the parser after parsing input assembly and by
329the optimizer before it outputs bitcode. The violations pointed out
330by the verifier pass indicate bugs in transformation passes or input to
331the parser.</p>
332</div>
333
Chris Lattnera83fdc02007-10-03 17:34:29 +0000[diff] [blame]334<!-- Describe the typesetting conventions here. -->
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]335
336<!-- *********************************************************************** -->
337<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
338<!-- *********************************************************************** -->
339
340<div class="doc_text">
341
Reid Spencerc8245b02007-08-07 14:34:28 +0000[diff] [blame]342 <p>LLVM identifiers come in two basic types: global and local. Global
343 identifiers (functions, global variables) begin with the @ character. Local
344 identifiers (register names, types) begin with the % character. Additionally,
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]345 there are three different formats for identifiers, for different purposes:</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]346
347<ol>
Reid Spencerc8245b02007-08-07 14:34:28 +0000[diff] [blame]348 <li>Named values are represented as a string of characters with their prefix.
349 For example, %foo, @DivisionByZero, %a.really.long.identifier. The actual
350 regular expression used is '<tt>[%@][a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]351 Identifiers which require other characters in their names can be surrounded
Daniel Dunbar73f9a772008-10-14 23:51:43 +0000[diff] [blame]352 with quotes. Special characters may be escaped using "\xx" where xx is the
353 ASCII code for the character in hexadecimal. In this way, any character can
354 be used in a name value, even quotes themselves.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]355
Reid Spencerc8245b02007-08-07 14:34:28 +0000[diff] [blame]356 <li>Unnamed values are represented as an unsigned numeric value with their
357 prefix. For example, %12, @2, %44.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]358
359 <li>Constants, which are described in a <a href="#constants">section about
360 constants</a>, below.</li>
361</ol>
362
Reid Spencerc8245b02007-08-07 14:34:28 +0000[diff] [blame]363<p>LLVM requires that values start with a prefix for two reasons: Compilers
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]364don't need to worry about name clashes with reserved words, and the set of
365reserved words may be expanded in the future without penalty. Additionally,
366unnamed identifiers allow a compiler to quickly come up with a temporary
367variable without having to avoid symbol table conflicts.</p>
368
369<p>Reserved words in LLVM are very similar to reserved words in other
370languages. There are keywords for different opcodes
371('<tt><a href="#i_add">add</a></tt>',
372 '<tt><a href="#i_bitcast">bitcast</a></tt>',
373 '<tt><a href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
374href="#t_void">void</a></tt>', '<tt><a href="#t_primitive">i32</a></tt>', etc...),
375and others. These reserved words cannot conflict with variable names, because
Reid Spencerc8245b02007-08-07 14:34:28 +0000[diff] [blame]376none of them start with a prefix character ('%' or '@').</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]377
378<p>Here is an example of LLVM code to multiply the integer variable
379'<tt>%X</tt>' by 8:</p>
380
381<p>The easy way:</p>
382
383<div class="doc_code">
384<pre>
385%result = <a href="#i_mul">mul</a> i32 %X, 8
386</pre>
387</div>
388
389<p>After strength reduction:</p>
390
391<div class="doc_code">
392<pre>
393%result = <a href="#i_shl">shl</a> i32 %X, i8 3
394</pre>
395</div>
396
397<p>And the hard way:</p>
398
399<div class="doc_code">
400<pre>
401<a href="#i_add">add</a> i32 %X, %X <i>; yields {i32}:%0</i>
402<a href="#i_add">add</a> i32 %0, %0 <i>; yields {i32}:%1</i>
403%result = <a href="#i_add">add</a> i32 %1, %1
404</pre>
405</div>
406
407<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
408important lexical features of LLVM:</p>
409
410<ol>
411
412 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
413 line.</li>
414
415 <li>Unnamed temporaries are created when the result of a computation is not
416 assigned to a named value.</li>
417
418 <li>Unnamed temporaries are numbered sequentially</li>
419
420</ol>
421
422<p>...and it also shows a convention that we follow in this document. When
423demonstrating instructions, we will follow an instruction with a comment that
424defines the type and name of value produced. Comments are shown in italic
425text.</p>
426
427</div>
428
429<!-- *********************************************************************** -->
430<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
431<!-- *********************************************************************** -->
432
433<!-- ======================================================================= -->
434<div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
435</div>
436
437<div class="doc_text">
438
439<p>LLVM programs are composed of "Module"s, each of which is a
440translation unit of the input programs. Each module consists of
441functions, global variables, and symbol table entries. Modules may be
442combined together with the LLVM linker, which merges function (and
443global variable) definitions, resolves forward declarations, and merges
444symbol table entries. Here is an example of the "hello world" module:</p>
445
446<div class="doc_code">
447<pre><i>; Declare the string constant as a global constant...</i>
448<a href="#identifiers">@.LC0</a> = <a href="#linkage_internal">internal</a> <a
449 href="#globalvars">constant</a> <a href="#t_array">[13 x i8]</a> c"hello world\0A\00" <i>; [13 x i8]*</i>
450
451<i>; External declaration of the puts function</i>
452<a href="#functionstructure">declare</a> i32 @puts(i8 *) <i>; i32(i8 *)* </i>
453
454<i>; Definition of main function</i>
455define i32 @main() { <i>; i32()* </i>
Dan Gohman01852382009-01-04 23:44:43 +0000[diff] [blame]456 <i>; Convert [13 x i8]* to i8 *...</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]457 %cast210 = <a
Dan Gohman01852382009-01-04 23:44:43 +0000[diff] [blame]458 href="#i_getelementptr">getelementptr</a> [13 x i8]* @.LC0, i64 0, i64 0 <i>; i8 *</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]459
460 <i>; Call puts function to write out the string to stdout...</i>
461 <a
462 href="#i_call">call</a> i32 @puts(i8 * %cast210) <i>; i32</i>
463 <a
464 href="#i_ret">ret</a> i32 0<br>}<br>
465</pre>
466</div>
467
468<p>This example is made up of a <a href="#globalvars">global variable</a>
469named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
470function, and a <a href="#functionstructure">function definition</a>
471for "<tt>main</tt>".</p>
472
473<p>In general, a module is made up of a list of global values,
474where both functions and global variables are global values. Global values are
475represented by a pointer to a memory location (in this case, a pointer to an
476array of char, and a pointer to a function), and have one of the following <a
477href="#linkage">linkage types</a>.</p>
478
479</div>
480
481<!-- ======================================================================= -->
482<div class="doc_subsection">
483 <a name="linkage">Linkage Types</a>
484</div>
485
486<div class="doc_text">
487
488<p>
489All Global Variables and Functions have one of the following types of linkage:
490</p>
491
492<dl>
493
Rafael Espindolaa168fc92009-01-15 20:18:42 +0000[diff] [blame]494 <dt><tt><b><a name="linkage_private">private</a></b></tt>: </dt>
495
496 <dd>Global values with private linkage are only directly accessible by
497 objects in the current module. In particular, linking code into a module with
498 an private global value may cause the private to be renamed as necessary to
499 avoid collisions. Because the symbol is private to the module, all
500 references can be updated. This doesn't show up in any symbol table in the
501 object file.
502 </dd>
503
Dale Johannesen96e7e092008-05-23 23:13:41 +0000[diff] [blame]504 <dt><tt><b><a name="linkage_internal">internal</a></b></tt>: </dt>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]505
Duncan Sandsa75223a2009-01-16 09:29:46 +0000[diff] [blame]506 <dd> Similar to private, but the value shows as a local symbol (STB_LOCAL in
Rafael Espindolaa168fc92009-01-15 20:18:42 +0000[diff] [blame]507 the case of ELF) in the object file. This corresponds to the notion of the
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]508 '<tt>static</tt>' keyword in C.
509 </dd>
510
511 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
512
513 <dd>Globals with "<tt>linkonce</tt>" linkage are merged with other globals of
514 the same name when linkage occurs. This is typically used to implement
515 inline functions, templates, or other code which must be generated in each
516 translation unit that uses it. Unreferenced <tt>linkonce</tt> globals are
517 allowed to be discarded.
518 </dd>
519
Dale Johannesen96e7e092008-05-23 23:13:41 +0000[diff] [blame]520 <dt><tt><b><a name="linkage_common">common</a></b></tt>: </dt>
521
522 <dd>"<tt>common</tt>" linkage is exactly the same as <tt>linkonce</tt>
523 linkage, except that unreferenced <tt>common</tt> globals may not be
524 discarded. This is used for globals that may be emitted in multiple
525 translation units, but that are not guaranteed to be emitted into every
526 translation unit that uses them. One example of this is tentative
527 definitions in C, such as "<tt>int X;</tt>" at global scope.
528 </dd>
529
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]530 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
531
Dale Johannesen96e7e092008-05-23 23:13:41 +0000[diff] [blame]532 <dd>"<tt>weak</tt>" linkage is the same as <tt>common</tt> linkage, except
533 that some targets may choose to emit different assembly sequences for them
534 for target-dependent reasons. This is used for globals that are declared
535 "weak" in C source code.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]536 </dd>
537
538 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
539
540 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
541 pointer to array type. When two global variables with appending linkage are
542 linked together, the two global arrays are appended together. This is the
543 LLVM, typesafe, equivalent of having the system linker append together
544 "sections" with identical names when .o files are linked.
545 </dd>
546
547 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
Duncan Sands19d161f2009-03-07 15:45:40 +0000[diff] [blame]548
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]549 <dd>The semantics of this linkage follow the ELF object file model: the
550 symbol is weak until linked, if not linked, the symbol becomes null instead
551 of being an undefined reference.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]552 </dd>
553
Duncan Sands19d161f2009-03-07 15:45:40 +0000[diff] [blame]554 <dt><tt><b><a name="linkage_linkonce">linkonce_odr</a></b></tt>: </dt>
555 <dt><tt><b><a name="linkage_common">common_odr</a></b></tt>: </dt>
556 <dt><tt><b><a name="linkage_weak">weak_odr</a></b></tt>: </dt>
Duncan Sands19d161f2009-03-07 15:45:40 +0000[diff] [blame]557 <dd>Some languages allow inequivalent globals to be merged, such as two
558 functions with different semantics. Other languages, such as <tt>C++</tt>,
559 ensure that only equivalent globals are ever merged (the "one definition
560 rule" - <tt>odr</tt>). Such languages can use the <tt>linkonce_odr</tt>,
Duncan Sands565f65d2009-03-11 08:08:06 +0000[diff] [blame^]561 <tt>common_odr</tt> and <tt>weak_odr</tt> linkage types to indicate that
562 the global will only be merged with equivalent globals. These linkage
563 types are otherwise the same as their non-<tt>odr</tt> versions.
Duncan Sands19d161f2009-03-07 15:45:40 +0000[diff] [blame]564 </dd>
565
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]566 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
567
568 <dd>If none of the above identifiers are used, the global is externally
569 visible, meaning that it participates in linkage and can be used to resolve
570 external symbol references.
571 </dd>
572</dl>
573
574 <p>
575 The next two types of linkage are targeted for Microsoft Windows platform
576 only. They are designed to support importing (exporting) symbols from (to)
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]577 DLLs (Dynamic Link Libraries).
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]578 </p>
579
580 <dl>
581 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
582
583 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
584 or variable via a global pointer to a pointer that is set up by the DLL
585 exporting the symbol. On Microsoft Windows targets, the pointer name is
Dan Gohman5ec99832009-01-12 21:35:55 +0000[diff] [blame]586 formed by combining <code>__imp_</code> and the function or variable name.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]587 </dd>
588
589 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
590
591 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
592 pointer to a pointer in a DLL, so that it can be referenced with the
593 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
Dan Gohman5ec99832009-01-12 21:35:55 +0000[diff] [blame]594 name is formed by combining <code>__imp_</code> and the function or variable
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]595 name.
596 </dd>
597
598</dl>
599
Dan Gohman4dfac702008-11-24 17:18:39 +0000[diff] [blame]600<p>For example, since the "<tt>.LC0</tt>"
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]601variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
602variable and was linked with this one, one of the two would be renamed,
603preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
604external (i.e., lacking any linkage declarations), they are accessible
605outside of the current module.</p>
606<p>It is illegal for a function <i>declaration</i>
Duncan Sands565f65d2009-03-11 08:08:06 +0000[diff] [blame^]607to have any linkage type other than "externally visible", <tt>dllimport</tt>
608or <tt>extern_weak</tt>.</p>
Duncan Sands19d161f2009-03-07 15:45:40 +0000[diff] [blame]609<p>Aliases can have only <tt>external</tt>, <tt>internal</tt>, <tt>weak</tt>
610or <tt>weak_odr</tt> linkages.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]611</div>
612
613<!-- ======================================================================= -->
614<div class="doc_subsection">
615 <a name="callingconv">Calling Conventions</a>
616</div>
617
618<div class="doc_text">
619
620<p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
621and <a href="#i_invoke">invokes</a> can all have an optional calling convention
622specified for the call. The calling convention of any pair of dynamic
623caller/callee must match, or the behavior of the program is undefined. The
624following calling conventions are supported by LLVM, and more may be added in
625the future:</p>
626
627<dl>
628 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
629
630 <dd>This calling convention (the default if no other calling convention is
631 specified) matches the target C calling conventions. This calling convention
632 supports varargs function calls and tolerates some mismatch in the declared
633 prototype and implemented declaration of the function (as does normal C).
634 </dd>
635
636 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
637
638 <dd>This calling convention attempts to make calls as fast as possible
639 (e.g. by passing things in registers). This calling convention allows the
640 target to use whatever tricks it wants to produce fast code for the target,
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]641 without having to conform to an externally specified ABI (Application Binary
642 Interface). Implementations of this convention should allow arbitrary
Arnold Schwaighofer07444922008-05-14 09:17:12 +0000[diff] [blame]643 <a href="CodeGenerator.html#tailcallopt">tail call optimization</a> to be
644 supported. This calling convention does not support varargs and requires the
645 prototype of all callees to exactly match the prototype of the function
646 definition.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]647 </dd>
648
649 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
650
651 <dd>This calling convention attempts to make code in the caller as efficient
652 as possible under the assumption that the call is not commonly executed. As
653 such, these calls often preserve all registers so that the call does not break
654 any live ranges in the caller side. This calling convention does not support
655 varargs and requires the prototype of all callees to exactly match the
656 prototype of the function definition.
657 </dd>
658
659 <dt><b>"<tt>cc &lt;<em>n</em>&gt;</tt>" - Numbered convention</b>:</dt>
660
661 <dd>Any calling convention may be specified by number, allowing
662 target-specific calling conventions to be used. Target specific calling
663 conventions start at 64.
664 </dd>
665</dl>
666
667<p>More calling conventions can be added/defined on an as-needed basis, to
668support pascal conventions or any other well-known target-independent
669convention.</p>
670
671</div>
672
673<!-- ======================================================================= -->
674<div class="doc_subsection">
675 <a name="visibility">Visibility Styles</a>
676</div>
677
678<div class="doc_text">
679
680<p>
681All Global Variables and Functions have one of the following visibility styles:
682</p>
683
684<dl>
685 <dt><b>"<tt>default</tt>" - Default style</b>:</dt>
686
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]687 <dd>On targets that use the ELF object file format, default visibility means
688 that the declaration is visible to other
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]689 modules and, in shared libraries, means that the declared entity may be
690 overridden. On Darwin, default visibility means that the declaration is
691 visible to other modules. Default visibility corresponds to "external
692 linkage" in the language.
693 </dd>
694
695 <dt><b>"<tt>hidden</tt>" - Hidden style</b>:</dt>
696
697 <dd>Two declarations of an object with hidden visibility refer to the same
698 object if they are in the same shared object. Usually, hidden visibility
699 indicates that the symbol will not be placed into the dynamic symbol table,
700 so no other module (executable or shared library) can reference it
701 directly.
702 </dd>
703
704 <dt><b>"<tt>protected</tt>" - Protected style</b>:</dt>
705
706 <dd>On ELF, protected visibility indicates that the symbol will be placed in
707 the dynamic symbol table, but that references within the defining module will
708 bind to the local symbol. That is, the symbol cannot be overridden by another
709 module.
710 </dd>
711</dl>
712
713</div>
714
715<!-- ======================================================================= -->
716<div class="doc_subsection">
Chris Lattner5b6dc6e2009-01-11 20:53:49 +0000[diff] [blame]717 <a name="namedtypes">Named Types</a>
718</div>
719
720<div class="doc_text">
721
722<p>LLVM IR allows you to specify name aliases for certain types. This can make
723it easier to read the IR and make the IR more condensed (particularly when
724recursive types are involved). An example of a name specification is:
725</p>
726
727<div class="doc_code">
728<pre>
729%mytype = type { %mytype*, i32 }
730</pre>
731</div>
732
733<p>You may give a name to any <a href="#typesystem">type</a> except "<a
734href="t_void">void</a>". Type name aliases may be used anywhere a type is
735expected with the syntax "%mytype".</p>
736
737<p>Note that type names are aliases for the structural type that they indicate,
738and that you can therefore specify multiple names for the same type. This often
739leads to confusing behavior when dumping out a .ll file. Since LLVM IR uses
740structural typing, the name is not part of the type. When printing out LLVM IR,
741the printer will pick <em>one name</em> to render all types of a particular
742shape. This means that if you have code where two different source types end up
743having the same LLVM type, that the dumper will sometimes print the "wrong" or
744unexpected type. This is an important design point and isn't going to
745change.</p>
746
747</div>
748
Chris Lattner5b6dc6e2009-01-11 20:53:49 +0000[diff] [blame]749<!-- ======================================================================= -->
750<div class="doc_subsection">
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]751 <a name="globalvars">Global Variables</a>
752</div>
753
754<div class="doc_text">
755
756<p>Global variables define regions of memory allocated at compilation time
757instead of run-time. Global variables may optionally be initialized, may have
758an explicit section to be placed in, and may have an optional explicit alignment
759specified. A variable may be defined as "thread_local", which means that it
760will not be shared by threads (each thread will have a separated copy of the
761variable). A variable may be defined as a global "constant," which indicates
762that the contents of the variable will <b>never</b> be modified (enabling better
763optimization, allowing the global data to be placed in the read-only section of
764an executable, etc). Note that variables that need runtime initialization
765cannot be marked "constant" as there is a store to the variable.</p>
766
767<p>
768LLVM explicitly allows <em>declarations</em> of global variables to be marked
769constant, even if the final definition of the global is not. This capability
770can be used to enable slightly better optimization of the program, but requires
771the language definition to guarantee that optimizations based on the
772'constantness' are valid for the translation units that do not include the
773definition.
774</p>
775
776<p>As SSA values, global variables define pointer values that are in
777scope (i.e. they dominate) all basic blocks in the program. Global
778variables always define a pointer to their "content" type because they
779describe a region of memory, and all memory objects in LLVM are
780accessed through pointers.</p>
781
Christopher Lambdd0049d2007-12-11 09:31:00 +0000[diff] [blame]782<p>A global variable may be declared to reside in a target-specifc numbered
783address space. For targets that support them, address spaces may affect how
784optimizations are performed and/or what target instructions are used to access
Christopher Lamb20a39e92007-12-12 08:44:39 +0000[diff] [blame]785the variable. The default address space is zero. The address space qualifier
786must precede any other attributes.</p>
Christopher Lambdd0049d2007-12-11 09:31:00 +0000[diff] [blame]787
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]788<p>LLVM allows an explicit section to be specified for globals. If the target
789supports it, it will emit globals to the section specified.</p>
790
791<p>An explicit alignment may be specified for a global. If not present, or if
792the alignment is set to zero, the alignment of the global is set by the target
793to whatever it feels convenient. If an explicit alignment is specified, the
794global is forced to have at least that much alignment. All alignments must be
795a power of 2.</p>
796
Christopher Lambdd0049d2007-12-11 09:31:00 +0000[diff] [blame]797<p>For example, the following defines a global in a numbered address space with
798an initializer, section, and alignment:</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]799
800<div class="doc_code">
801<pre>
Dan Gohman21ef02c2009-01-11 00:40:00 +0000[diff] [blame]802@G = addrspace(5) constant float 1.0, section "foo", align 4
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]803</pre>
804</div>
805
806</div>
807
808
809<!-- ======================================================================= -->
810<div class="doc_subsection">
811 <a name="functionstructure">Functions</a>
812</div>
813
814<div class="doc_text">
815
816<p>LLVM function definitions consist of the "<tt>define</tt>" keyord,
817an optional <a href="#linkage">linkage type</a>, an optional
818<a href="#visibility">visibility style</a>, an optional
819<a href="#callingconv">calling convention</a>, a return type, an optional
820<a href="#paramattrs">parameter attribute</a> for the return type, a function
821name, a (possibly empty) argument list (each with optional
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]822<a href="#paramattrs">parameter attributes</a>), optional
823<a href="#fnattrs">function attributes</a>, an optional section,
824an optional alignment, an optional <a href="#gc">garbage collector name</a>,
Chris Lattneree202542008-10-04 18:10:21 +0000[diff] [blame]825an opening curly brace, a list of basic blocks, and a closing curly brace.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]826
827LLVM function declarations consist of the "<tt>declare</tt>" keyword, an
828optional <a href="#linkage">linkage type</a>, an optional
829<a href="#visibility">visibility style</a>, an optional
830<a href="#callingconv">calling convention</a>, a return type, an optional
831<a href="#paramattrs">parameter attribute</a> for the return type, a function
Gordon Henriksen13fe5e32007-12-10 03:18:06 +0000[diff] [blame]832name, a possibly empty list of arguments, an optional alignment, and an optional
Gordon Henriksend606f5b2007-12-10 03:30:21 +0000[diff] [blame]833<a href="#gc">garbage collector name</a>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]834
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]835<p>A function definition contains a list of basic blocks, forming the CFG
836(Control Flow Graph) for
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]837the function. Each basic block may optionally start with a label (giving the
838basic block a symbol table entry), contains a list of instructions, and ends
839with a <a href="#terminators">terminator</a> instruction (such as a branch or
840function return).</p>
841
842<p>The first basic block in a function is special in two ways: it is immediately
843executed on entrance to the function, and it is not allowed to have predecessor
844basic blocks (i.e. there can not be any branches to the entry block of a
845function). Because the block can have no predecessors, it also cannot have any
846<a href="#i_phi">PHI nodes</a>.</p>
847
848<p>LLVM allows an explicit section to be specified for functions. If the target
849supports it, it will emit functions to the section specified.</p>
850
851<p>An explicit alignment may be specified for a function. If not present, or if
852the alignment is set to zero, the alignment of the function is set by the target
853to whatever it feels convenient. If an explicit alignment is specified, the
854function is forced to have at least that much alignment. All alignments must be
855a power of 2.</p>
856
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]857 <h5>Syntax:</h5>
858
859<div class="doc_code">
Chris Lattner1e5c5cd02008-10-13 16:55:18 +0000[diff] [blame]860<tt>
861define [<a href="#linkage">linkage</a>] [<a href="#visibility">visibility</a>]
862 [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>]
863 &lt;ResultType&gt; @&lt;FunctionName&gt; ([argument list])
864 [<a href="#fnattrs">fn Attrs</a>] [section "name"] [align N]
865 [<a href="#gc">gc</a>] { ... }
866</tt>
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]867</div>
868
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]869</div>
870
871
872<!-- ======================================================================= -->
873<div class="doc_subsection">
874 <a name="aliasstructure">Aliases</a>
875</div>
876<div class="doc_text">
877 <p>Aliases act as "second name" for the aliasee value (which can be either
Anton Korobeynikov96822812008-03-22 08:36:14 +0000[diff] [blame]878 function, global variable, another alias or bitcast of global value). Aliases
879 may have an optional <a href="#linkage">linkage type</a>, and an
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]880 optional <a href="#visibility">visibility style</a>.</p>
881
882 <h5>Syntax:</h5>
883
884<div class="doc_code">
885<pre>
Duncan Sandsd7bfabf2008-09-12 20:48:21 +0000[diff] [blame]886@&lt;Name&gt; = alias [Linkage] [Visibility] &lt;AliaseeTy&gt; @&lt;Aliasee&gt;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]887</pre>
888</div>
889
890</div>
891
892
893
894<!-- ======================================================================= -->
895<div class="doc_subsection"><a name="paramattrs">Parameter Attributes</a></div>
896<div class="doc_text">
897 <p>The return type and each parameter of a function type may have a set of
898 <i>parameter attributes</i> associated with them. Parameter attributes are
899 used to communicate additional information about the result or parameters of
Duncan Sandsf5588dc2007-11-27 13:23:08 +0000[diff] [blame]900 a function. Parameter attributes are considered to be part of the function,
901 not of the function type, so functions with different parameter attributes
902 can have the same function type.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]903
904 <p>Parameter attributes are simple keywords that follow the type specified. If
905 multiple parameter attributes are needed, they are space separated. For
906 example:</p>
907
908<div class="doc_code">
909<pre>
Nick Lewycky3022a742009-02-15 23:06:14 +0000[diff] [blame]910declare i32 @printf(i8* noalias nocapture, ...)
Chris Lattnerf33b8452008-10-04 18:33:34 +0000[diff] [blame]911declare i32 @atoi(i8 zeroext)
912declare signext i8 @returns_signed_char()
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]913</pre>
914</div>
915
Duncan Sandsf5588dc2007-11-27 13:23:08 +0000[diff] [blame]916 <p>Note that any attributes for the function result (<tt>nounwind</tt>,
917 <tt>readonly</tt>) come immediately after the argument list.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]918
919 <p>Currently, only the following parameter attributes are defined:</p>
920 <dl>
Reid Spencerf234bed2007-07-19 23:13:04 +0000[diff] [blame]921 <dt><tt>zeroext</tt></dt>
Chris Lattnerf33b8452008-10-04 18:33:34 +0000[diff] [blame]922 <dd>This indicates to the code generator that the parameter or return value
923 should be zero-extended to a 32-bit value by the caller (for a parameter)
924 or the callee (for a return value).</dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]925
Reid Spencerf234bed2007-07-19 23:13:04 +0000[diff] [blame]926 <dt><tt>signext</tt></dt>
Chris Lattnerf33b8452008-10-04 18:33:34 +0000[diff] [blame]927 <dd>This indicates to the code generator that the parameter or return value
928 should be sign-extended to a 32-bit value by the caller (for a parameter)
929 or the callee (for a return value).</dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]930
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]931 <dt><tt>inreg</tt></dt>
Dale Johannesenc08a0e22008-09-25 20:47:45 +0000[diff] [blame]932 <dd>This indicates that this parameter or return value should be treated
933 in a special target-dependent fashion during while emitting code for a
934 function call or return (usually, by putting it in a register as opposed
Chris Lattnerf33b8452008-10-04 18:33:34 +0000[diff] [blame]935 to memory, though some targets use it to distinguish between two different
936 kinds of registers). Use of this attribute is target-specific.</dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]937
Duncan Sands7d94e5a2008-10-06 08:14:18 +0000[diff] [blame]938 <dt><tt><a name="byval">byval</a></tt></dt>
Chris Lattner04c86182008-01-15 04:34:22 +0000[diff] [blame]939 <dd>This indicates that the pointer parameter should really be passed by
940 value to the function. The attribute implies that a hidden copy of the
941 pointee is made between the caller and the callee, so the callee is unable
Chris Lattner6a9f3c42008-08-05 18:21:08 +0000[diff] [blame]942 to modify the value in the callee. This attribute is only valid on LLVM
Chris Lattner04c86182008-01-15 04:34:22 +0000[diff] [blame]943 pointer arguments. It is generally used to pass structs and arrays by
Duncan Sands7d94e5a2008-10-06 08:14:18 +0000[diff] [blame]944 value, but is also valid on pointers to scalars. The copy is considered to
945 belong to the caller not the callee (for example,
946 <tt><a href="#readonly">readonly</a></tt> functions should not write to
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]947 <tt>byval</tt> parameters). This is not a valid attribute for return
Chris Lattnere39c5bf2009-02-05 05:42:28 +0000[diff] [blame]948 values. The byval attribute also supports specifying an alignment with the
949 align attribute. This has a target-specific effect on the code generator
950 that usually indicates a desired alignment for the synthesized stack
951 slot.</dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]952
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]953 <dt><tt>sret</tt></dt>
Duncan Sands616cc032008-02-18 04:19:38 +0000[diff] [blame]954 <dd>This indicates that the pointer parameter specifies the address of a
955 structure that is the return value of the function in the source program.
Chris Lattnerf33b8452008-10-04 18:33:34 +0000[diff] [blame]956 This pointer must be guaranteed by the caller to be valid: loads and stores
957 to the structure may be assumed by the callee to not to trap. This may only
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]958 be applied to the first parameter. This is not a valid attribute for
959 return values. </dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]960
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]961 <dt><tt>noalias</tt></dt>
Nick Lewyckyff384472008-11-24 03:41:24 +0000[diff] [blame]962 <dd>This indicates that the pointer does not alias any global or any other
963 parameter. The caller is responsible for ensuring that this is the
Nick Lewyckya604a942008-11-24 05:00:44 +0000[diff] [blame]964 case. On a function return value, <tt>noalias</tt> additionally indicates
965 that the pointer does not alias any other pointers visible to the
Nick Lewycky40fb6f22008-12-19 06:39:12 +0000[diff] [blame]966 caller. For further details, please see the discussion of the NoAlias
967 response in
968 <a href="http://llvm.org/docs/AliasAnalysis.html#MustMayNo">alias
969 analysis</a>.</dd>
970
971 <dt><tt>nocapture</tt></dt>
972 <dd>This indicates that the callee does not make any copies of the pointer
973 that outlive the callee itself. This is not a valid attribute for return
974 values.</dd>
Chris Lattner275e6be2008-01-11 06:20:47 +0000[diff] [blame]975
Duncan Sands4ee46812007-07-27 19:57:41 +0000[diff] [blame]976 <dt><tt>nest</tt></dt>
Duncan Sandsf1a7d4c2008-07-08 09:27:25 +0000[diff] [blame]977 <dd>This indicates that the pointer parameter can be excised using the
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]978 <a href="#int_trampoline">trampoline intrinsics</a>. This is not a valid
979 attribute for return values.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]980 </dl>
981
982</div>
983
984<!-- ======================================================================= -->
985<div class="doc_subsection">
Gordon Henriksen13fe5e32007-12-10 03:18:06 +0000[diff] [blame]986 <a name="gc">Garbage Collector Names</a>
987</div>
988
989<div class="doc_text">
990<p>Each function may specify a garbage collector name, which is simply a
991string.</p>
992
993<div class="doc_code"><pre
994>define void @f() gc "name" { ...</pre></div>
995
996<p>The compiler declares the supported values of <i>name</i>. Specifying a
997collector which will cause the compiler to alter its output in order to support
998the named garbage collection algorithm.</p>
999</div>
1000
1001<!-- ======================================================================= -->
1002<div class="doc_subsection">
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1003 <a name="fnattrs">Function Attributes</a>
Devang Pateld468f1c2008-09-04 23:05:13 +0000[diff] [blame]1004</div>
1005
1006<div class="doc_text">
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1007
1008<p>Function attributes are set to communicate additional information about
1009 a function. Function attributes are considered to be part of the function,
1010 not of the function type, so functions with different parameter attributes
1011 can have the same function type.</p>
1012
1013 <p>Function attributes are simple keywords that follow the type specified. If
1014 multiple attributes are needed, they are space separated. For
1015 example:</p>
Devang Pateld468f1c2008-09-04 23:05:13 +0000[diff] [blame]1016
1017<div class="doc_code">
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1018<pre>
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1019define void @f() noinline { ... }
1020define void @f() alwaysinline { ... }
1021define void @f() alwaysinline optsize { ... }
1022define void @f() optsize
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1023</pre>
Devang Pateld468f1c2008-09-04 23:05:13 +0000[diff] [blame]1024</div>
1025
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1026<dl>
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1027<dt><tt>alwaysinline</tt></dt>
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1028<dd>This attribute indicates that the inliner should attempt to inline this
1029function into callers whenever possible, ignoring any active inlining size
1030threshold for this caller.</dd>
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1031
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1032<dt><tt>noinline</tt></dt>
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1033<dd>This attribute indicates that the inliner should never inline this function
Chris Lattner377f3ae2008-10-05 17:14:59 +0000[diff] [blame]1034in any situation. This attribute may not be used together with the
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1035<tt>alwaysinline</tt> attribute.</dd>
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1036
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1037<dt><tt>optsize</tt></dt>
Devang Patelc29099b2008-09-29 18:34:44 +0000[diff] [blame]1038<dd>This attribute suggests that optimization passes and code generator passes
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1039make choices that keep the code size of this function low, and otherwise do
1040optimizations specifically to reduce code size.</dd>
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1041
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1042<dt><tt>noreturn</tt></dt>
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1043<dd>This function attribute indicates that the function never returns normally.
1044This produces undefined behavior at runtime if the function ever does
1045dynamically return.</dd>
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1046
1047<dt><tt>nounwind</tt></dt>
Chris Lattner82d70f92008-10-04 18:23:17 +0000[diff] [blame]1048<dd>This function attribute indicates that the function never returns with an
1049unwind or exceptional control flow. If the function does unwind, its runtime
1050behavior is undefined.</dd>
1051
1052<dt><tt>readnone</tt></dt>
Duncan Sands7d94e5a2008-10-06 08:14:18 +0000[diff] [blame]1053<dd>This attribute indicates that the function computes its result (or the
1054exception it throws) based strictly on its arguments, without dereferencing any
1055pointer arguments or otherwise accessing any mutable state (e.g. memory, control
1056registers, etc) visible to caller functions. It does not write through any
1057pointer arguments (including <tt><a href="#byval">byval</a></tt> arguments) and
1058never changes any state visible to callers.</dd>
Devang Patel008cd3e2008-09-26 23:51:19 +0000[diff] [blame]1059
Duncan Sands7d94e5a2008-10-06 08:14:18 +0000[diff] [blame]1060<dt><tt><a name="readonly">readonly</a></tt></dt>
1061<dd>This attribute indicates that the function does not write through any
1062pointer arguments (including <tt><a href="#byval">byval</a></tt> arguments)
1063or otherwise modify any state (e.g. memory, control registers, etc) visible to
1064caller functions. It may dereference pointer arguments and read state that may
1065be set in the caller. A readonly function always returns the same value (or
1066throws the same exception) when called with the same set of arguments and global
1067state.</dd>
Bill Wendlingdfaabba2008-11-13 01:02:51 +0000[diff] [blame]1068
1069<dt><tt><a name="ssp">ssp</a></tt></dt>
Bill Wendling34f70d82008-11-26 19:19:05 +0000[diff] [blame]1070<dd>This attribute indicates that the function should emit a stack smashing
Bill Wendlingdfaabba2008-11-13 01:02:51 +0000[diff] [blame]1071protector. It is in the form of a "canary"&mdash;a random value placed on the
1072stack before the local variables that's checked upon return from the function to
1073see if it has been overwritten. A heuristic is used to determine if a function
Bill Wendling34f70d82008-11-26 19:19:05 +0000[diff] [blame]1074needs stack protectors or not.
Bill Wendlingdfaabba2008-11-13 01:02:51 +0000[diff] [blame]1075
Bill Wendlingbe9ec3f2008-11-26 19:07:40 +0000[diff] [blame]1076<p>If a function that has an <tt>ssp</tt> attribute is inlined into a function
1077that doesn't have an <tt>ssp</tt> attribute, then the resulting function will
1078have an <tt>ssp</tt> attribute.</p></dd>
1079
1080<dt><tt>sspreq</tt></dt>
Bill Wendling34f70d82008-11-26 19:19:05 +0000[diff] [blame]1081<dd>This attribute indicates that the function should <em>always</em> emit a
Bill Wendlingdfaabba2008-11-13 01:02:51 +0000[diff] [blame]1082stack smashing protector. This overrides the <tt><a href="#ssp">ssp</a></tt>
Bill Wendling34f70d82008-11-26 19:19:05 +0000[diff] [blame]1083function attribute.
Bill Wendlingbe9ec3f2008-11-26 19:07:40 +0000[diff] [blame]1084
1085<p>If a function that has an <tt>sspreq</tt> attribute is inlined into a
1086function that doesn't have an <tt>sspreq</tt> attribute or which has
1087an <tt>ssp</tt> attribute, then the resulting function will have
1088an <tt>sspreq</tt> attribute.</p></dd>
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1089</dl>
1090
Devang Pateld468f1c2008-09-04 23:05:13 +0000[diff] [blame]1091</div>
1092
1093<!-- ======================================================================= -->
1094<div class="doc_subsection">
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1095 <a name="moduleasm">Module-Level Inline Assembly</a>
1096</div>
1097
1098<div class="doc_text">
1099<p>
1100Modules may contain "module-level inline asm" blocks, which corresponds to the
1101GCC "file scope inline asm" blocks. These blocks are internally concatenated by
1102LLVM and treated as a single unit, but may be separated in the .ll file if
1103desired. The syntax is very simple:
1104</p>
1105
1106<div class="doc_code">
1107<pre>
1108module asm "inline asm code goes here"
1109module asm "more can go here"
1110</pre>
1111</div>
1112
1113<p>The strings can contain any character by escaping non-printable characters.
1114 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
1115 for the number.
1116</p>
1117
1118<p>
1119 The inline asm code is simply printed to the machine code .s file when
1120 assembly code is generated.
1121</p>
1122</div>
1123
1124<!-- ======================================================================= -->
1125<div class="doc_subsection">
1126 <a name="datalayout">Data Layout</a>
1127</div>
1128
1129<div class="doc_text">
1130<p>A module may specify a target specific data layout string that specifies how
1131data is to be laid out in memory. The syntax for the data layout is simply:</p>
1132<pre> target datalayout = "<i>layout specification</i>"</pre>
1133<p>The <i>layout specification</i> consists of a list of specifications
1134separated by the minus sign character ('-'). Each specification starts with a
1135letter and may include other information after the letter to define some
1136aspect of the data layout. The specifications accepted are as follows: </p>
1137<dl>
1138 <dt><tt>E</tt></dt>
1139 <dd>Specifies that the target lays out data in big-endian form. That is, the
1140 bits with the most significance have the lowest address location.</dd>
1141 <dt><tt>e</tt></dt>
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]1142 <dd>Specifies that the target lays out data in little-endian form. That is,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1143 the bits with the least significance have the lowest address location.</dd>
1144 <dt><tt>p:<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1145 <dd>This specifies the <i>size</i> of a pointer and its <i>abi</i> and
1146 <i>preferred</i> alignments. All sizes are in bits. Specifying the <i>pref</i>
1147 alignment is optional. If omitted, the preceding <tt>:</tt> should be omitted
1148 too.</dd>
1149 <dt><tt>i<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1150 <dd>This specifies the alignment for an integer type of a given bit
1151 <i>size</i>. The value of <i>size</i> must be in the range [1,2^23).</dd>
1152 <dt><tt>v<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1153 <dd>This specifies the alignment for a vector type of a given bit
1154 <i>size</i>.</dd>
1155 <dt><tt>f<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1156 <dd>This specifies the alignment for a floating point type of a given bit
1157 <i>size</i>. The value of <i>size</i> must be either 32 (float) or 64
1158 (double).</dd>
1159 <dt><tt>a<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1160 <dd>This specifies the alignment for an aggregate type of a given bit
1161 <i>size</i>.</dd>
1162</dl>
1163<p>When constructing the data layout for a given target, LLVM starts with a
1164default set of specifications which are then (possibly) overriden by the
1165specifications in the <tt>datalayout</tt> keyword. The default specifications
1166are given in this list:</p>
1167<ul>
1168 <li><tt>E</tt> - big endian</li>
1169 <li><tt>p:32:64:64</tt> - 32-bit pointers with 64-bit alignment</li>
1170 <li><tt>i1:8:8</tt> - i1 is 8-bit (byte) aligned</li>
1171 <li><tt>i8:8:8</tt> - i8 is 8-bit (byte) aligned</li>
1172 <li><tt>i16:16:16</tt> - i16 is 16-bit aligned</li>
1173 <li><tt>i32:32:32</tt> - i32 is 32-bit aligned</li>
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]1174 <li><tt>i64:32:64</tt> - i64 has ABI alignment of 32-bits but preferred
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1175 alignment of 64-bits</li>
1176 <li><tt>f32:32:32</tt> - float is 32-bit aligned</li>
1177 <li><tt>f64:64:64</tt> - double is 64-bit aligned</li>
1178 <li><tt>v64:64:64</tt> - 64-bit vector is 64-bit aligned</li>
1179 <li><tt>v128:128:128</tt> - 128-bit vector is 128-bit aligned</li>
1180 <li><tt>a0:0:1</tt> - aggregates are 8-bit aligned</li>
1181</ul>
Chris Lattner6a9f3c42008-08-05 18:21:08 +0000[diff] [blame]1182<p>When LLVM is determining the alignment for a given type, it uses the
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]1183following rules:</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1184<ol>
1185 <li>If the type sought is an exact match for one of the specifications, that
1186 specification is used.</li>
1187 <li>If no match is found, and the type sought is an integer type, then the
1188 smallest integer type that is larger than the bitwidth of the sought type is
1189 used. If none of the specifications are larger than the bitwidth then the the
1190 largest integer type is used. For example, given the default specifications
1191 above, the i7 type will use the alignment of i8 (next largest) while both
1192 i65 and i256 will use the alignment of i64 (largest specified).</li>
1193 <li>If no match is found, and the type sought is a vector type, then the
1194 largest vector type that is smaller than the sought vector type will be used
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]1195 as a fall back. This happens because &lt;128 x double&gt; can be implemented
1196 in terms of 64 &lt;2 x double&gt;, for example.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1197</ol>
1198</div>
1199
1200<!-- *********************************************************************** -->
1201<div class="doc_section"> <a name="typesystem">Type System</a> </div>
1202<!-- *********************************************************************** -->
1203
1204<div class="doc_text">
1205
1206<p>The LLVM type system is one of the most important features of the
1207intermediate representation. Being typed enables a number of
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]1208optimizations to be performed on the intermediate representation directly,
1209without having to do
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1210extra analyses on the side before the transformation. A strong type
1211system makes it easier to read the generated code and enables novel
1212analyses and transformations that are not feasible to perform on normal
1213three address code representations.</p>
1214
1215</div>
1216
1217<!-- ======================================================================= -->
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1218<div class="doc_subsection"> <a name="t_classifications">Type
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1219Classifications</a> </div>
1220<div class="doc_text">
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1221<p>The types fall into a few useful
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1222classifications:</p>
1223
1224<table border="1" cellspacing="0" cellpadding="4">
1225 <tbody>
1226 <tr><th>Classification</th><th>Types</th></tr>
1227 <tr>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1228 <td><a href="#t_integer">integer</a></td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1229 <td><tt>i1, i2, i3, ... i8, ... i16, ... i32, ... i64, ... </tt></td>
1230 </tr>
1231 <tr>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1232 <td><a href="#t_floating">floating point</a></td>
1233 <td><tt>float, double, x86_fp80, fp128, ppc_fp128</tt></td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1234 </tr>
1235 <tr>
1236 <td><a name="t_firstclass">first class</a></td>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1237 <td><a href="#t_integer">integer</a>,
1238 <a href="#t_floating">floating point</a>,
1239 <a href="#t_pointer">pointer</a>,
Dan Gohmanf6237db2008-06-18 18:42:13 +0000[diff] [blame]1240 <a href="#t_vector">vector</a>,
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]1241 <a href="#t_struct">structure</a>,
1242 <a href="#t_array">array</a>,
Dan Gohmand13951e2008-05-23 22:50:26 +0000[diff] [blame]1243 <a href="#t_label">label</a>.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1244 </td>
1245 </tr>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1246 <tr>
1247 <td><a href="#t_primitive">primitive</a></td>
1248 <td><a href="#t_label">label</a>,
1249 <a href="#t_void">void</a>,
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1250 <a href="#t_floating">floating point</a>.</td>
1251 </tr>
1252 <tr>
1253 <td><a href="#t_derived">derived</a></td>
1254 <td><a href="#t_integer">integer</a>,
1255 <a href="#t_array">array</a>,
1256 <a href="#t_function">function</a>,
1257 <a href="#t_pointer">pointer</a>,
1258 <a href="#t_struct">structure</a>,
1259 <a href="#t_pstruct">packed structure</a>,
1260 <a href="#t_vector">vector</a>,
1261 <a href="#t_opaque">opaque</a>.
Dan Gohman032ba852008-10-14 16:32:04 +0000[diff] [blame]1262 </td>
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1263 </tr>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1264 </tbody>
1265</table>
1266
1267<p>The <a href="#t_firstclass">first class</a> types are perhaps the
1268most important. Values of these types are the only ones which can be
1269produced by instructions, passed as arguments, or used as operands to
Dan Gohman4f29e422008-05-23 21:53:15 +0000[diff] [blame]1270instructions.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1271</div>
1272
1273<!-- ======================================================================= -->
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1274<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
Chris Lattner86437612008-01-04 04:34:14 +0000[diff] [blame]1275
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1276<div class="doc_text">
1277<p>The primitive types are the fundamental building blocks of the LLVM
1278system.</p>
1279
Chris Lattner86437612008-01-04 04:34:14 +0000[diff] [blame]1280</div>
1281
Chris Lattner488772f2008-01-04 04:32:38 +0000[diff] [blame]1282<!-- _______________________________________________________________________ -->
1283<div class="doc_subsubsection"> <a name="t_floating">Floating Point Types</a> </div>
1284
1285<div class="doc_text">
1286 <table>
1287 <tbody>
1288 <tr><th>Type</th><th>Description</th></tr>
1289 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
1290 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
1291 <tr><td><tt>fp128</tt></td><td>128-bit floating point value (112-bit mantissa)</td></tr>
1292 <tr><td><tt>x86_fp80</tt></td><td>80-bit floating point value (X87)</td></tr>
1293 <tr><td><tt>ppc_fp128</tt></td><td>128-bit floating point value (two 64-bits)</td></tr>
1294 </tbody>
1295 </table>
1296</div>
1297
1298<!-- _______________________________________________________________________ -->
1299<div class="doc_subsubsection"> <a name="t_void">Void Type</a> </div>
1300
1301<div class="doc_text">
1302<h5>Overview:</h5>
1303<p>The void type does not represent any value and has no size.</p>
1304
1305<h5>Syntax:</h5>
1306
1307<pre>
1308 void
1309</pre>
1310</div>
1311
1312<!-- _______________________________________________________________________ -->
1313<div class="doc_subsubsection"> <a name="t_label">Label Type</a> </div>
1314
1315<div class="doc_text">
1316<h5>Overview:</h5>
1317<p>The label type represents code labels.</p>
1318
1319<h5>Syntax:</h5>
1320
1321<pre>
1322 label
1323</pre>
1324</div>
1325
1326
1327<!-- ======================================================================= -->
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1328<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
1329
1330<div class="doc_text">
1331
1332<p>The real power in LLVM comes from the derived types in the system.
1333This is what allows a programmer to represent arrays, functions,
1334pointers, and other useful types. Note that these derived types may be
1335recursive: For example, it is possible to have a two dimensional array.</p>
1336
1337</div>
1338
1339<!-- _______________________________________________________________________ -->
1340<div class="doc_subsubsection"> <a name="t_integer">Integer Type</a> </div>
1341
1342<div class="doc_text">
1343
1344<h5>Overview:</h5>
1345<p>The integer type is a very simple derived type that simply specifies an
1346arbitrary bit width for the integer type desired. Any bit width from 1 bit to
13472^23-1 (about 8 million) can be specified.</p>
1348
1349<h5>Syntax:</h5>
1350
1351<pre>
1352 iN
1353</pre>
1354
1355<p>The number of bits the integer will occupy is specified by the <tt>N</tt>
1356value.</p>
1357
1358<h5>Examples:</h5>
1359<table class="layout">
Chris Lattner251ab812007-12-18 06:18:21 +0000[diff] [blame]1360 <tbody>
1361 <tr>
1362 <td><tt>i1</tt></td>
1363 <td>a single-bit integer.</td>
1364 </tr><tr>
1365 <td><tt>i32</tt></td>
1366 <td>a 32-bit integer.</td>
1367 </tr><tr>
1368 <td><tt>i1942652</tt></td>
1369 <td>a really big integer of over 1 million bits.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1370 </tr>
Chris Lattner251ab812007-12-18 06:18:21 +0000[diff] [blame]1371 </tbody>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1372</table>
djge93155c2009-01-24 15:58:40 +0000[diff] [blame]1373
1374<p>Note that the code generator does not yet support large integer types
1375to be used as function return types. The specific limit on how large a
1376return type the code generator can currently handle is target-dependent;
1377currently it's often 64 bits for 32-bit targets and 128 bits for 64-bit
1378targets.</p>
1379
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1380</div>
1381
1382<!-- _______________________________________________________________________ -->
1383<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
1384
1385<div class="doc_text">
1386
1387<h5>Overview:</h5>
1388
1389<p>The array type is a very simple derived type that arranges elements
1390sequentially in memory. The array type requires a size (number of
1391elements) and an underlying data type.</p>
1392
1393<h5>Syntax:</h5>
1394
1395<pre>
1396 [&lt;# elements&gt; x &lt;elementtype&gt;]
1397</pre>
1398
1399<p>The number of elements is a constant integer value; elementtype may
1400be any type with a size.</p>
1401
1402<h5>Examples:</h5>
1403<table class="layout">
1404 <tr class="layout">
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1405 <td class="left"><tt>[40 x i32]</tt></td>
1406 <td class="left">Array of 40 32-bit integer values.</td>
1407 </tr>
1408 <tr class="layout">
1409 <td class="left"><tt>[41 x i32]</tt></td>
1410 <td class="left">Array of 41 32-bit integer values.</td>
1411 </tr>
1412 <tr class="layout">
1413 <td class="left"><tt>[4 x i8]</tt></td>
1414 <td class="left">Array of 4 8-bit integer values.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1415 </tr>
1416</table>
1417<p>Here are some examples of multidimensional arrays:</p>
1418<table class="layout">
1419 <tr class="layout">
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1420 <td class="left"><tt>[3 x [4 x i32]]</tt></td>
1421 <td class="left">3x4 array of 32-bit integer values.</td>
1422 </tr>
1423 <tr class="layout">
1424 <td class="left"><tt>[12 x [10 x float]]</tt></td>
1425 <td class="left">12x10 array of single precision floating point values.</td>
1426 </tr>
1427 <tr class="layout">
1428 <td class="left"><tt>[2 x [3 x [4 x i16]]]</tt></td>
1429 <td class="left">2x3x4 array of 16-bit integer values.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1430 </tr>
1431</table>
1432
1433<p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
1434length array. Normally, accesses past the end of an array are undefined in
1435LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
1436As a special case, however, zero length arrays are recognized to be variable
1437length. This allows implementation of 'pascal style arrays' with the LLVM
1438type "{ i32, [0 x float]}", for example.</p>
1439
djge93155c2009-01-24 15:58:40 +0000[diff] [blame]1440<p>Note that the code generator does not yet support large aggregate types
1441to be used as function return types. The specific limit on how large an
1442aggregate return type the code generator can currently handle is
1443target-dependent, and also dependent on the aggregate element types.</p>
1444
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1445</div>
1446
1447<!-- _______________________________________________________________________ -->
1448<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
1449<div class="doc_text">
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1450
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1451<h5>Overview:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1452
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1453<p>The function type can be thought of as a function signature. It
Devang Pateld4ba41d2008-03-24 05:35:41 +0000[diff] [blame]1454consists of a return type and a list of formal parameter types. The
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1455return type of a function type is a scalar type, a void type, or a struct type.
Devang Pateld5404c02008-03-24 20:52:42 +0000[diff] [blame]1456If the return type is a struct type then all struct elements must be of first
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1457class types, and the struct must have at least one element.</p>
Devang Patela3cc5372008-03-10 20:49:15 +0000[diff] [blame]1458
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1459<h5>Syntax:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1460
1461<pre>
1462 &lt;returntype list&gt; (&lt;parameter list&gt;)
1463</pre>
1464
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1465<p>...where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
1466specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
1467which indicates that the function takes a variable number of arguments.
1468Variable argument functions can access their arguments with the <a
Devang Patela3cc5372008-03-10 20:49:15 +0000[diff] [blame]1469 href="#int_varargs">variable argument handling intrinsic</a> functions.
1470'<tt>&lt;returntype list&gt;</tt>' is a comma-separated list of
1471<a href="#t_firstclass">first class</a> type specifiers.</p>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]1472
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1473<h5>Examples:</h5>
1474<table class="layout">
1475 <tr class="layout">
1476 <td class="left"><tt>i32 (i32)</tt></td>
1477 <td class="left">function taking an <tt>i32</tt>, returning an <tt>i32</tt>
1478 </td>
1479 </tr><tr class="layout">
Reid Spencerf234bed2007-07-19 23:13:04 +0000[diff] [blame]1480 <td class="left"><tt>float&nbsp;(i16&nbsp;signext,&nbsp;i32&nbsp;*)&nbsp;*
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1481 </tt></td>
1482 <td class="left"><a href="#t_pointer">Pointer</a> to a function that takes
1483 an <tt>i16</tt> that should be sign extended and a
1484 <a href="#t_pointer">pointer</a> to <tt>i32</tt>, returning
1485 <tt>float</tt>.
1486 </td>
1487 </tr><tr class="layout">
1488 <td class="left"><tt>i32 (i8*, ...)</tt></td>
1489 <td class="left">A vararg function that takes at least one
1490 <a href="#t_pointer">pointer</a> to <tt>i8 </tt> (char in C),
1491 which returns an integer. This is the signature for <tt>printf</tt> in
1492 LLVM.
1493 </td>
Devang Pateld4ba41d2008-03-24 05:35:41 +0000[diff] [blame]1494 </tr><tr class="layout">
1495 <td class="left"><tt>{i32, i32} (i32)</tt></td>
Misha Brukmanafc88b02008-11-27 06:41:20 +0000[diff] [blame]1496 <td class="left">A function taking an <tt>i32</tt>, returning two
1497 <tt>i32</tt> values as an aggregate of type <tt>{ i32, i32 }</tt>
Devang Pateld4ba41d2008-03-24 05:35:41 +0000[diff] [blame]1498 </td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1499 </tr>
1500</table>
1501
1502</div>
1503<!-- _______________________________________________________________________ -->
1504<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
1505<div class="doc_text">
1506<h5>Overview:</h5>
1507<p>The structure type is used to represent a collection of data members
1508together in memory. The packing of the field types is defined to match
1509the ABI of the underlying processor. The elements of a structure may
1510be any type that has a size.</p>
1511<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1512and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1513field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1514instruction.</p>
1515<h5>Syntax:</h5>
1516<pre> { &lt;type list&gt; }<br></pre>
1517<h5>Examples:</h5>
1518<table class="layout">
1519 <tr class="layout">
1520 <td class="left"><tt>{ i32, i32, i32 }</tt></td>
1521 <td class="left">A triple of three <tt>i32</tt> values</td>
1522 </tr><tr class="layout">
1523 <td class="left"><tt>{&nbsp;float,&nbsp;i32&nbsp;(i32)&nbsp;*&nbsp;}</tt></td>
1524 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1525 second element is a <a href="#t_pointer">pointer</a> to a
1526 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1527 an <tt>i32</tt>.</td>
1528 </tr>
1529</table>
djge93155c2009-01-24 15:58:40 +0000[diff] [blame]1530
1531<p>Note that the code generator does not yet support large aggregate types
1532to be used as function return types. The specific limit on how large an
1533aggregate return type the code generator can currently handle is
1534target-dependent, and also dependent on the aggregate element types.</p>
1535
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1536</div>
1537
1538<!-- _______________________________________________________________________ -->
1539<div class="doc_subsubsection"> <a name="t_pstruct">Packed Structure Type</a>
1540</div>
1541<div class="doc_text">
1542<h5>Overview:</h5>
1543<p>The packed structure type is used to represent a collection of data members
1544together in memory. There is no padding between fields. Further, the alignment
1545of a packed structure is 1 byte. The elements of a packed structure may
1546be any type that has a size.</p>
1547<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1548and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1549field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1550instruction.</p>
1551<h5>Syntax:</h5>
1552<pre> &lt; { &lt;type list&gt; } &gt; <br></pre>
1553<h5>Examples:</h5>
1554<table class="layout">
1555 <tr class="layout">
1556 <td class="left"><tt>&lt; { i32, i32, i32 } &gt;</tt></td>
1557 <td class="left">A triple of three <tt>i32</tt> values</td>
1558 </tr><tr class="layout">
Bill Wendling74d3eac2008-09-07 10:26:33 +0000[diff] [blame]1559 <td class="left">
1560<tt>&lt;&nbsp;{&nbsp;float,&nbsp;i32&nbsp;(i32)*&nbsp;}&nbsp;&gt;</tt></td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1561 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1562 second element is a <a href="#t_pointer">pointer</a> to a
1563 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1564 an <tt>i32</tt>.</td>
1565 </tr>
1566</table>
1567</div>
1568
1569<!-- _______________________________________________________________________ -->
1570<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
1571<div class="doc_text">
1572<h5>Overview:</h5>
1573<p>As in many languages, the pointer type represents a pointer or
Christopher Lambdd0049d2007-12-11 09:31:00 +0000[diff] [blame]1574reference to another object, which must live in memory. Pointer types may have
1575an optional address space attribute defining the target-specific numbered
1576address space where the pointed-to object resides. The default address space is
1577zero.</p>
Chris Lattner96edbd32009-02-08 19:53:29 +0000[diff] [blame]1578
1579<p>Note that LLVM does not permit pointers to void (<tt>void*</tt>) nor does
Chris Lattner0d879e02009-02-08 22:21:28 +0000[diff] [blame]1580it permit pointers to labels (<tt>label*</tt>). Use <tt>i8*</tt> instead.</p>
Chris Lattner96edbd32009-02-08 19:53:29 +0000[diff] [blame]1581
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1582<h5>Syntax:</h5>
1583<pre> &lt;type&gt; *<br></pre>
1584<h5>Examples:</h5>
1585<table class="layout">
1586 <tr class="layout">
Dan Gohman01852382009-01-04 23:44:43 +0000[diff] [blame]1587 <td class="left"><tt>[4 x i32]*</tt></td>
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1588 <td class="left">A <a href="#t_pointer">pointer</a> to <a
1589 href="#t_array">array</a> of four <tt>i32</tt> values.</td>
1590 </tr>
1591 <tr class="layout">
1592 <td class="left"><tt>i32 (i32 *) *</tt></td>
1593 <td class="left"> A <a href="#t_pointer">pointer</a> to a <a
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1594 href="#t_function">function</a> that takes an <tt>i32*</tt>, returning an
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1595 <tt>i32</tt>.</td>
1596 </tr>
1597 <tr class="layout">
1598 <td class="left"><tt>i32 addrspace(5)*</tt></td>
1599 <td class="left">A <a href="#t_pointer">pointer</a> to an <tt>i32</tt> value
1600 that resides in address space #5.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1601 </tr>
1602</table>
1603</div>
1604
1605<!-- _______________________________________________________________________ -->
1606<div class="doc_subsubsection"> <a name="t_vector">Vector Type</a> </div>
1607<div class="doc_text">
1608
1609<h5>Overview:</h5>
1610
1611<p>A vector type is a simple derived type that represents a vector
1612of elements. Vector types are used when multiple primitive data
1613are operated in parallel using a single instruction (SIMD).
1614A vector type requires a size (number of
1615elements) and an underlying primitive data type. Vectors must have a power
1616of two length (1, 2, 4, 8, 16 ...). Vector types are
1617considered <a href="#t_firstclass">first class</a>.</p>
1618
1619<h5>Syntax:</h5>
1620
1621<pre>
1622 &lt; &lt;# elements&gt; x &lt;elementtype&gt; &gt;
1623</pre>
1624
1625<p>The number of elements is a constant integer value; elementtype may
1626be any integer or floating point type.</p>
1627
1628<h5>Examples:</h5>
1629
1630<table class="layout">
1631 <tr class="layout">
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1632 <td class="left"><tt>&lt;4 x i32&gt;</tt></td>
1633 <td class="left">Vector of 4 32-bit integer values.</td>
1634 </tr>
1635 <tr class="layout">
1636 <td class="left"><tt>&lt;8 x float&gt;</tt></td>
1637 <td class="left">Vector of 8 32-bit floating-point values.</td>
1638 </tr>
1639 <tr class="layout">
1640 <td class="left"><tt>&lt;2 x i64&gt;</tt></td>
1641 <td class="left">Vector of 2 64-bit integer values.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1642 </tr>
1643</table>
djge93155c2009-01-24 15:58:40 +0000[diff] [blame]1644
1645<p>Note that the code generator does not yet support large vector types
1646to be used as function return types. The specific limit on how large a
1647vector return type codegen can currently handle is target-dependent;
1648currently it's often a few times longer than a hardware vector register.</p>
1649
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1650</div>
1651
1652<!-- _______________________________________________________________________ -->
1653<div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1654<div class="doc_text">
1655
1656<h5>Overview:</h5>
1657
1658<p>Opaque types are used to represent unknown types in the system. This
Gordon Henriksenda0706e2007-10-14 00:34:53 +0000[diff] [blame]1659corresponds (for example) to the C notion of a forward declared structure type.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1660In LLVM, opaque types can eventually be resolved to any type (not just a
1661structure type).</p>
1662
1663<h5>Syntax:</h5>
1664
1665<pre>
1666 opaque
1667</pre>
1668
1669<h5>Examples:</h5>
1670
1671<table class="layout">
1672 <tr class="layout">
Chris Lattner7311d222007-12-19 05:04:11 +0000[diff] [blame]1673 <td class="left"><tt>opaque</tt></td>
1674 <td class="left">An opaque type.</td>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1675 </tr>
1676</table>
1677</div>
1678
Chris Lattner515195a2009-02-02 07:32:36 +0000[diff] [blame]1679<!-- ======================================================================= -->
1680<div class="doc_subsection">
1681 <a name="t_uprefs">Type Up-references</a>
1682</div>
1683
1684<div class="doc_text">
1685<h5>Overview:</h5>
1686<p>
1687An "up reference" allows you to refer to a lexically enclosing type without
1688requiring it to have a name. For instance, a structure declaration may contain a
1689pointer to any of the types it is lexically a member of. Example of up
1690references (with their equivalent as named type declarations) include:</p>
1691
1692<pre>
Chris Lattner5ad632d2009-02-09 10:00:56 +0000[diff] [blame]1693 { \2 * } %x = type { %x* }
Chris Lattner515195a2009-02-02 07:32:36 +0000[diff] [blame]1694 { \2 }* %y = type { %y }*
1695 \1* %z = type %z*
1696</pre>
1697
1698<p>
1699An up reference is needed by the asmprinter for printing out cyclic types when
1700there is no declared name for a type in the cycle. Because the asmprinter does
1701not want to print out an infinite type string, it needs a syntax to handle
1702recursive types that have no names (all names are optional in llvm IR).
1703</p>
1704
1705<h5>Syntax:</h5>
1706<pre>
1707 \&lt;level&gt;
1708</pre>
1709
1710<p>
1711The level is the count of the lexical type that is being referred to.
1712</p>
1713
1714<h5>Examples:</h5>
1715
1716<table class="layout">
1717 <tr class="layout">
1718 <td class="left"><tt>\1*</tt></td>
1719 <td class="left">Self-referential pointer.</td>
1720 </tr>
1721 <tr class="layout">
1722 <td class="left"><tt>{ { \3*, i8 }, i32 }</tt></td>
1723 <td class="left">Recursive structure where the upref refers to the out-most
1724 structure.</td>
1725 </tr>
1726</table>
1727</div>
1728
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1729
1730<!-- *********************************************************************** -->
1731<div class="doc_section"> <a name="constants">Constants</a> </div>
1732<!-- *********************************************************************** -->
1733
1734<div class="doc_text">
1735
1736<p>LLVM has several different basic types of constants. This section describes
1737them all and their syntax.</p>
1738
1739</div>
1740
1741<!-- ======================================================================= -->
1742<div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
1743
1744<div class="doc_text">
1745
1746<dl>
1747 <dt><b>Boolean constants</b></dt>
1748
1749 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
1750 constants of the <tt><a href="#t_primitive">i1</a></tt> type.
1751 </dd>
1752
1753 <dt><b>Integer constants</b></dt>
1754
1755 <dd>Standard integers (such as '4') are constants of the <a
1756 href="#t_integer">integer</a> type. Negative numbers may be used with
1757 integer types.
1758 </dd>
1759
1760 <dt><b>Floating point constants</b></dt>
1761
1762 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1763 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
Chris Lattnerdc15b1d2008-04-01 18:45:27 +0000[diff] [blame]1764 notation (see below). The assembler requires the exact decimal value of
1765 a floating-point constant. For example, the assembler accepts 1.25 but
1766 rejects 1.3 because 1.3 is a repeating decimal in binary. Floating point
1767 constants must have a <a href="#t_floating">floating point</a> type. </dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1768
1769 <dt><b>Null pointer constants</b></dt>
1770
1771 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
1772 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1773
1774</dl>
1775
Dale Johannesenf82a52f2009-02-11 22:14:51 +0000[diff] [blame]1776<p>The one non-intuitive notation for constants is the hexadecimal form
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1777of floating point constants. For example, the form '<tt>double
17780x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
17794.5e+15</tt>'. The only time hexadecimal floating point constants are required
1780(and the only time that they are generated by the disassembler) is when a
1781floating point constant must be emitted but it cannot be represented as a
Dale Johannesenf82a52f2009-02-11 22:14:51 +0000[diff] [blame]1782decimal floating point number in a reasonable number of digits. For example,
1783NaN's, infinities, and other
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1784special values are represented in their IEEE hexadecimal format so that
1785assembly and disassembly do not cause any bits to change in the constants.</p>
Dale Johannesenf82a52f2009-02-11 22:14:51 +0000[diff] [blame]1786<p>When using the hexadecimal form, constants of types float and double are
1787represented using the 16-digit form shown above (which matches the IEEE754
1788representation for double); float values must, however, be exactly representable
1789as IEE754 single precision.
1790Hexadecimal format is always used for long
1791double, and there are three forms of long double. The 80-bit
1792format used by x86 is represented as <tt>0xK</tt>
1793followed by 20 hexadecimal digits.
1794The 128-bit format used by PowerPC (two adjacent doubles) is represented
1795by <tt>0xM</tt> followed by 32 hexadecimal digits. The IEEE 128-bit
1796format is represented
1797by <tt>0xL</tt> followed by 32 hexadecimal digits; no currently supported
1798target uses this format. Long doubles will only work if they match
1799the long double format on your target. All hexadecimal formats are big-endian
1800(sign bit at the left).</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1801</div>
1802
1803<!-- ======================================================================= -->
Chris Lattner97063852009-02-28 18:32:25 +0000[diff] [blame]1804<div class="doc_subsection">
1805<a name="aggregateconstants"> <!-- old anchor -->
1806<a name="complexconstants">Complex Constants</a></a>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1807</div>
1808
1809<div class="doc_text">
Chris Lattner97063852009-02-28 18:32:25 +0000[diff] [blame]1810<p>Complex constants are a (potentially recursive) combination of simple
1811constants and smaller complex constants.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1812
1813<dl>
1814 <dt><b>Structure constants</b></dt>
1815
1816 <dd>Structure constants are represented with notation similar to structure
1817 type definitions (a comma separated list of elements, surrounded by braces
Chris Lattner6c8de962007-12-25 20:34:52 +0000[diff] [blame]1818 (<tt>{}</tt>)). For example: "<tt>{ i32 4, float 17.0, i32* @G }</tt>",
1819 where "<tt>@G</tt>" is declared as "<tt>@G = external global i32</tt>". Structure constants
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1820 must have <a href="#t_struct">structure type</a>, and the number and
1821 types of elements must match those specified by the type.
1822 </dd>
1823
1824 <dt><b>Array constants</b></dt>
1825
1826 <dd>Array constants are represented with notation similar to array type
1827 definitions (a comma separated list of elements, surrounded by square brackets
1828 (<tt>[]</tt>)). For example: "<tt>[ i32 42, i32 11, i32 74 ]</tt>". Array
1829 constants must have <a href="#t_array">array type</a>, and the number and
1830 types of elements must match those specified by the type.
1831 </dd>
1832
1833 <dt><b>Vector constants</b></dt>
1834
1835 <dd>Vector constants are represented with notation similar to vector type
1836 definitions (a comma separated list of elements, surrounded by
1837 less-than/greater-than's (<tt>&lt;&gt;</tt>)). For example: "<tt>&lt; i32 42,
1838 i32 11, i32 74, i32 100 &gt;</tt>". Vector constants must have <a
1839 href="#t_vector">vector type</a>, and the number and types of elements must
1840 match those specified by the type.
1841 </dd>
1842
1843 <dt><b>Zero initialization</b></dt>
1844
1845 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1846 value to zero of <em>any</em> type, including scalar and aggregate types.
1847 This is often used to avoid having to print large zero initializers (e.g. for
1848 large arrays) and is always exactly equivalent to using explicit zero
1849 initializers.
1850 </dd>
1851</dl>
1852
1853</div>
1854
1855<!-- ======================================================================= -->
1856<div class="doc_subsection">
1857 <a name="globalconstants">Global Variable and Function Addresses</a>
1858</div>
1859
1860<div class="doc_text">
1861
1862<p>The addresses of <a href="#globalvars">global variables</a> and <a
1863href="#functionstructure">functions</a> are always implicitly valid (link-time)
1864constants. These constants are explicitly referenced when the <a
1865href="#identifiers">identifier for the global</a> is used and always have <a
1866href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1867file:</p>
1868
1869<div class="doc_code">
1870<pre>
1871@X = global i32 17
1872@Y = global i32 42
1873@Z = global [2 x i32*] [ i32* @X, i32* @Y ]
1874</pre>
1875</div>
1876
1877</div>
1878
1879<!-- ======================================================================= -->
1880<div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
1881<div class="doc_text">
1882 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
1883 no specific value. Undefined values may be of any type and be used anywhere
1884 a constant is permitted.</p>
1885
1886 <p>Undefined values indicate to the compiler that the program is well defined
1887 no matter what value is used, giving the compiler more freedom to optimize.
1888 </p>
1889</div>
1890
1891<!-- ======================================================================= -->
1892<div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1893</div>
1894
1895<div class="doc_text">
1896
1897<p>Constant expressions are used to allow expressions involving other constants
1898to be used as constants. Constant expressions may be of any <a
1899href="#t_firstclass">first class</a> type and may involve any LLVM operation
1900that does not have side effects (e.g. load and call are not supported). The
1901following is the syntax for constant expressions:</p>
1902
1903<dl>
1904 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1905 <dd>Truncate a constant to another type. The bit size of CST must be larger
1906 than the bit size of TYPE. Both types must be integers.</dd>
1907
1908 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1909 <dd>Zero extend a constant to another type. The bit size of CST must be
1910 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
1911
1912 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1913 <dd>Sign extend a constant to another type. The bit size of CST must be
1914 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
1915
1916 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1917 <dd>Truncate a floating point constant to another floating point type. The
1918 size of CST must be larger than the size of TYPE. Both types must be
1919 floating point.</dd>
1920
1921 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1922 <dd>Floating point extend a constant to another type. The size of CST must be
1923 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1924
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]1925 <dt><b><tt>fptoui ( CST to TYPE )</tt></b></dt>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1926 <dd>Convert a floating point constant to the corresponding unsigned integer
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]1927 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1928 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1929 of the same number of elements. If the value won't fit in the integer type,
1930 the results are undefined.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1931
1932 <dt><b><tt>fptosi ( CST to TYPE )</tt></b></dt>
1933 <dd>Convert a floating point constant to the corresponding signed integer
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]1934 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1935 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1936 of the same number of elements. If the value won't fit in the integer type,
1937 the results are undefined.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1938
1939 <dt><b><tt>uitofp ( CST to TYPE )</tt></b></dt>
1940 <dd>Convert an unsigned integer constant to the corresponding floating point
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]1941 constant. TYPE must be a scalar or vector floating point type. CST must be of
1942 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1943 of the same number of elements. If the value won't fit in the floating point
1944 type, the results are undefined.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1945
1946 <dt><b><tt>sitofp ( CST to TYPE )</tt></b></dt>
1947 <dd>Convert a signed integer constant to the corresponding floating point
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]1948 constant. TYPE must be a scalar or vector floating point type. CST must be of
1949 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1950 of the same number of elements. If the value won't fit in the floating point
1951 type, the results are undefined.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1952
1953 <dt><b><tt>ptrtoint ( CST to TYPE )</tt></b></dt>
1954 <dd>Convert a pointer typed constant to the corresponding integer constant
1955 TYPE must be an integer type. CST must be of pointer type. The CST value is
1956 zero extended, truncated, or unchanged to make it fit in TYPE.</dd>
1957
1958 <dt><b><tt>inttoptr ( CST to TYPE )</tt></b></dt>
1959 <dd>Convert a integer constant to a pointer constant. TYPE must be a
1960 pointer type. CST must be of integer type. The CST value is zero extended,
1961 truncated, or unchanged to make it fit in a pointer size. This one is
1962 <i>really</i> dangerous!</dd>
1963
1964 <dt><b><tt>bitcast ( CST to TYPE )</tt></b></dt>
Chris Lattner557bc5d2009-02-28 18:27:03 +0000[diff] [blame]1965 <dd>Convert a constant, CST, to another TYPE. The constraints of the operands
1966 are the same as those for the <a href="#i_bitcast">bitcast
1967 instruction</a>.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1968
1969 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1970
1971 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1972 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1973 instruction, the index list may have zero or more indexes, which are required
1974 to make sense for the type of "CSTPTR".</dd>
1975
1976 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1977
1978 <dd>Perform the <a href="#i_select">select operation</a> on
1979 constants.</dd>
1980
1981 <dt><b><tt>icmp COND ( VAL1, VAL2 )</tt></b></dt>
1982 <dd>Performs the <a href="#i_icmp">icmp operation</a> on constants.</dd>
1983
1984 <dt><b><tt>fcmp COND ( VAL1, VAL2 )</tt></b></dt>
1985 <dd>Performs the <a href="#i_fcmp">fcmp operation</a> on constants.</dd>
1986
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]1987 <dt><b><tt>vicmp COND ( VAL1, VAL2 )</tt></b></dt>
1988 <dd>Performs the <a href="#i_vicmp">vicmp operation</a> on constants.</dd>
1989
1990 <dt><b><tt>vfcmp COND ( VAL1, VAL2 )</tt></b></dt>
1991 <dd>Performs the <a href="#i_vfcmp">vfcmp operation</a> on constants.</dd>
1992
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1993 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1994
1995 <dd>Perform the <a href="#i_extractelement">extractelement
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]1996 operation</a> on constants.</dd>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]1997
1998 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1999
2000 <dd>Perform the <a href="#i_insertelement">insertelement
2001 operation</a> on constants.</dd>
2002
2003
2004 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
2005
2006 <dd>Perform the <a href="#i_shufflevector">shufflevector
2007 operation</a> on constants.</dd>
2008
2009 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
2010
2011 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
2012 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
2013 binary</a> operations. The constraints on operands are the same as those for
2014 the corresponding instruction (e.g. no bitwise operations on floating point
2015 values are allowed).</dd>
2016</dl>
2017</div>
2018
2019<!-- *********************************************************************** -->
2020<div class="doc_section"> <a name="othervalues">Other Values</a> </div>
2021<!-- *********************************************************************** -->
2022
2023<!-- ======================================================================= -->
2024<div class="doc_subsection">
2025<a name="inlineasm">Inline Assembler Expressions</a>
2026</div>
2027
2028<div class="doc_text">
2029
2030<p>
2031LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
2032Module-Level Inline Assembly</a>) through the use of a special value. This
2033value represents the inline assembler as a string (containing the instructions
2034to emit), a list of operand constraints (stored as a string), and a flag that
2035indicates whether or not the inline asm expression has side effects. An example
2036inline assembler expression is:
2037</p>
2038
2039<div class="doc_code">
2040<pre>
2041i32 (i32) asm "bswap $0", "=r,r"
2042</pre>
2043</div>
2044
2045<p>
2046Inline assembler expressions may <b>only</b> be used as the callee operand of
2047a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
2048</p>
2049
2050<div class="doc_code">
2051<pre>
2052%X = call i32 asm "<a href="#int_bswap">bswap</a> $0", "=r,r"(i32 %Y)
2053</pre>
2054</div>
2055
2056<p>
2057Inline asms with side effects not visible in the constraint list must be marked
2058as having side effects. This is done through the use of the
2059'<tt>sideeffect</tt>' keyword, like so:
2060</p>
2061
2062<div class="doc_code">
2063<pre>
2064call void asm sideeffect "eieio", ""()
2065</pre>
2066</div>
2067
2068<p>TODO: The format of the asm and constraints string still need to be
2069documented here. Constraints on what can be done (e.g. duplication, moving, etc
Chris Lattner1cdd64e2008-10-04 18:36:02 +0000[diff] [blame]2070need to be documented). This is probably best done by reference to another
2071document that covers inline asm from a holistic perspective.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2072</p>
2073
2074</div>
2075
2076<!-- *********************************************************************** -->
2077<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
2078<!-- *********************************************************************** -->
2079
2080<div class="doc_text">
2081
2082<p>The LLVM instruction set consists of several different
2083classifications of instructions: <a href="#terminators">terminator
2084instructions</a>, <a href="#binaryops">binary instructions</a>,
2085<a href="#bitwiseops">bitwise binary instructions</a>, <a
2086 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
2087instructions</a>.</p>
2088
2089</div>
2090
2091<!-- ======================================================================= -->
2092<div class="doc_subsection"> <a name="terminators">Terminator
2093Instructions</a> </div>
2094
2095<div class="doc_text">
2096
2097<p>As mentioned <a href="#functionstructure">previously</a>, every
2098basic block in a program ends with a "Terminator" instruction, which
2099indicates which block should be executed after the current block is
2100finished. These terminator instructions typically yield a '<tt>void</tt>'
2101value: they produce control flow, not values (the one exception being
2102the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
2103<p>There are six different terminator instructions: the '<a
2104 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
2105instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
2106the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
2107 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
2108 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
2109
2110</div>
2111
2112<!-- _______________________________________________________________________ -->
2113<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
2114Instruction</a> </div>
2115<div class="doc_text">
2116<h5>Syntax:</h5>
Dan Gohman3e700032008-10-04 19:00:07 +0000[diff] [blame]2117<pre>
2118 ret &lt;type&gt; &lt;value&gt; <i>; Return a value from a non-void function</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2119 ret void <i>; Return from void function</i>
2120</pre>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2121
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2122<h5>Overview:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2123
Dan Gohman3e700032008-10-04 19:00:07 +0000[diff] [blame]2124<p>The '<tt>ret</tt>' instruction is used to return control flow (and
2125optionally a value) from a function back to the caller.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2126<p>There are two forms of the '<tt>ret</tt>' instruction: one that
Dan Gohman3e700032008-10-04 19:00:07 +0000[diff] [blame]2127returns a value and then causes control flow, and one that just causes
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2128control flow to occur.</p>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2129
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2130<h5>Arguments:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2131
Dan Gohman3e700032008-10-04 19:00:07 +0000[diff] [blame]2132<p>The '<tt>ret</tt>' instruction optionally accepts a single argument,
2133the return value. The type of the return value must be a
2134'<a href="#t_firstclass">first class</a>' type.</p>
2135
2136<p>A function is not <a href="#wellformed">well formed</a> if
2137it it has a non-void return type and contains a '<tt>ret</tt>'
2138instruction with no return value or a return value with a type that
2139does not match its type, or if it has a void return type and contains
2140a '<tt>ret</tt>' instruction with a return value.</p>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2141
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2142<h5>Semantics:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2143
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2144<p>When the '<tt>ret</tt>' instruction is executed, control flow
2145returns back to the calling function's context. If the caller is a "<a
2146 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
2147the instruction after the call. If the caller was an "<a
2148 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
2149at the beginning of the "normal" destination block. If the instruction
2150returns a value, that value shall set the call or invoke instruction's
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]2151return value.</p>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2152
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2153<h5>Example:</h5>
Chris Lattner43030e72008-04-23 04:59:35 +0000[diff] [blame]2154
2155<pre>
2156 ret i32 5 <i>; Return an integer value of 5</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2157 ret void <i>; Return from a void function</i>
Bill Wendlingd163e2d2009-02-28 22:12:54 +0000[diff] [blame]2158 ret { i32, i8 } { i32 4, i8 2 } <i>; Return a struct of values 4 and 2</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2159</pre>
Dan Gohman60967192009-01-12 23:12:39 +0000[diff] [blame]2160
djge93155c2009-01-24 15:58:40 +0000[diff] [blame]2161<p>Note that the code generator does not yet fully support large
2162 return values. The specific sizes that are currently supported are
2163 dependent on the target. For integers, on 32-bit targets the limit
2164 is often 64 bits, and on 64-bit targets the limit is often 128 bits.
2165 For aggregate types, the current limits are dependent on the element
2166 types; for example targets are often limited to 2 total integer
2167 elements and 2 total floating-point elements.</p>
Dan Gohman60967192009-01-12 23:12:39 +0000[diff] [blame]2168
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2169</div>
2170<!-- _______________________________________________________________________ -->
2171<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
2172<div class="doc_text">
2173<h5>Syntax:</h5>
2174<pre> br i1 &lt;cond&gt;, label &lt;iftrue&gt;, label &lt;iffalse&gt;<br> br label &lt;dest&gt; <i>; Unconditional branch</i>
2175</pre>
2176<h5>Overview:</h5>
2177<p>The '<tt>br</tt>' instruction is used to cause control flow to
2178transfer to a different basic block in the current function. There are
2179two forms of this instruction, corresponding to a conditional branch
2180and an unconditional branch.</p>
2181<h5>Arguments:</h5>
2182<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
2183single '<tt>i1</tt>' value and two '<tt>label</tt>' values. The
2184unconditional form of the '<tt>br</tt>' instruction takes a single
2185'<tt>label</tt>' value as a target.</p>
2186<h5>Semantics:</h5>
2187<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>i1</tt>'
2188argument is evaluated. If the value is <tt>true</tt>, control flows
2189to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
2190control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
2191<h5>Example:</h5>
2192<pre>Test:<br> %cond = <a href="#i_icmp">icmp</a> eq, i32 %a, %b<br> br i1 %cond, label %IfEqual, label %IfUnequal<br>IfEqual:<br> <a
2193 href="#i_ret">ret</a> i32 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> i32 0<br></pre>
2194</div>
2195<!-- _______________________________________________________________________ -->
2196<div class="doc_subsubsection">
2197 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
2198</div>
2199
2200<div class="doc_text">
2201<h5>Syntax:</h5>
2202
2203<pre>
2204 switch &lt;intty&gt; &lt;value&gt;, label &lt;defaultdest&gt; [ &lt;intty&gt; &lt;val&gt;, label &lt;dest&gt; ... ]
2205</pre>
2206
2207<h5>Overview:</h5>
2208
2209<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
2210several different places. It is a generalization of the '<tt>br</tt>'
2211instruction, allowing a branch to occur to one of many possible
2212destinations.</p>
2213
2214
2215<h5>Arguments:</h5>
2216
2217<p>The '<tt>switch</tt>' instruction uses three parameters: an integer
2218comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
2219an array of pairs of comparison value constants and '<tt>label</tt>'s. The
2220table is not allowed to contain duplicate constant entries.</p>
2221
2222<h5>Semantics:</h5>
2223
2224<p>The <tt>switch</tt> instruction specifies a table of values and
2225destinations. When the '<tt>switch</tt>' instruction is executed, this
2226table is searched for the given value. If the value is found, control flow is
2227transfered to the corresponding destination; otherwise, control flow is
2228transfered to the default destination.</p>
2229
2230<h5>Implementation:</h5>
2231
2232<p>Depending on properties of the target machine and the particular
2233<tt>switch</tt> instruction, this instruction may be code generated in different
2234ways. For example, it could be generated as a series of chained conditional
2235branches or with a lookup table.</p>
2236
2237<h5>Example:</h5>
2238
2239<pre>
2240 <i>; Emulate a conditional br instruction</i>
2241 %Val = <a href="#i_zext">zext</a> i1 %value to i32
Dan Gohman01852382009-01-04 23:44:43 +0000[diff] [blame]2242 switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2243
2244 <i>; Emulate an unconditional br instruction</i>
2245 switch i32 0, label %dest [ ]
2246
2247 <i>; Implement a jump table:</i>
Dan Gohman01852382009-01-04 23:44:43 +0000[diff] [blame]2248 switch i32 %val, label %otherwise [ i32 0, label %onzero
2249 i32 1, label %onone
2250 i32 2, label %ontwo ]
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2251</pre>
2252</div>
2253
2254<!-- _______________________________________________________________________ -->
2255<div class="doc_subsubsection">
2256 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
2257</div>
2258
2259<div class="doc_text">
2260
2261<h5>Syntax:</h5>
2262
2263<pre>
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]2264 &lt;result&gt; = invoke [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>] &lt;ptr to function ty&gt; &lt;function ptr val&gt;(&lt;function args&gt;) [<a href="#fnattrs">fn attrs</a>]
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2265 to label &lt;normal label&gt; unwind label &lt;exception label&gt;
2266</pre>
2267
2268<h5>Overview:</h5>
2269
2270<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
2271function, with the possibility of control flow transfer to either the
2272'<tt>normal</tt>' label or the
2273'<tt>exception</tt>' label. If the callee function returns with the
2274"<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
2275"normal" label. If the callee (or any indirect callees) returns with the "<a
2276href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]2277continued at the dynamically nearest "exception" label.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2278
2279<h5>Arguments:</h5>
2280
2281<p>This instruction requires several arguments:</p>
2282
2283<ol>
2284 <li>
2285 The optional "cconv" marker indicates which <a href="#callingconv">calling
2286 convention</a> the call should use. If none is specified, the call defaults
2287 to using C calling conventions.
2288 </li>
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]2289
2290 <li>The optional <a href="#paramattrs">Parameter Attributes</a> list for
2291 return values. Only '<tt>zeroext</tt>', '<tt>signext</tt>',
2292 and '<tt>inreg</tt>' attributes are valid here.</li>
2293
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2294 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
2295 function value being invoked. In most cases, this is a direct function
2296 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
2297 an arbitrary pointer to function value.
2298 </li>
2299
2300 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
2301 function to be invoked. </li>
2302
2303 <li>'<tt>function args</tt>': argument list whose types match the function
2304 signature argument types. If the function signature indicates the function
2305 accepts a variable number of arguments, the extra arguments can be
2306 specified. </li>
2307
2308 <li>'<tt>normal label</tt>': the label reached when the called function
2309 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
2310
2311 <li>'<tt>exception label</tt>': the label reached when a callee returns with
2312 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
2313
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]2314 <li>The optional <a href="#fnattrs">function attributes</a> list. Only
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]2315 '<tt>noreturn</tt>', '<tt>nounwind</tt>', '<tt>readonly</tt>' and
2316 '<tt>readnone</tt>' attributes are valid here.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2317</ol>
2318
2319<h5>Semantics:</h5>
2320
2321<p>This instruction is designed to operate as a standard '<tt><a
2322href="#i_call">call</a></tt>' instruction in most regards. The primary
2323difference is that it establishes an association with a label, which is used by
2324the runtime library to unwind the stack.</p>
2325
2326<p>This instruction is used in languages with destructors to ensure that proper
2327cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
2328exception. Additionally, this is important for implementation of
2329'<tt>catch</tt>' clauses in high-level languages that support them.</p>
2330
2331<h5>Example:</h5>
2332<pre>
Nick Lewyckya1c11a12008-03-16 07:18:12 +0000[diff] [blame]2333 %retval = invoke i32 @Test(i32 15) to label %Continue
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2334 unwind label %TestCleanup <i>; {i32}:retval set</i>
Nick Lewyckya1c11a12008-03-16 07:18:12 +0000[diff] [blame]2335 %retval = invoke <a href="#callingconv">coldcc</a> i32 %Testfnptr(i32 15) to label %Continue
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2336 unwind label %TestCleanup <i>; {i32}:retval set</i>
2337</pre>
2338</div>
2339
2340
2341<!-- _______________________________________________________________________ -->
2342
2343<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
2344Instruction</a> </div>
2345
2346<div class="doc_text">
2347
2348<h5>Syntax:</h5>
2349<pre>
2350 unwind
2351</pre>
2352
2353<h5>Overview:</h5>
2354
2355<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
2356at the first callee in the dynamic call stack which used an <a
2357href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
2358primarily used to implement exception handling.</p>
2359
2360<h5>Semantics:</h5>
2361
Chris Lattner8b094fc2008-04-19 21:01:16 +0000[diff] [blame]2362<p>The '<tt>unwind</tt>' instruction causes execution of the current function to
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2363immediately halt. The dynamic call stack is then searched for the first <a
2364href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
2365execution continues at the "exceptional" destination block specified by the
2366<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
2367dynamic call chain, undefined behavior results.</p>
2368</div>
2369
2370<!-- _______________________________________________________________________ -->
2371
2372<div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
2373Instruction</a> </div>
2374
2375<div class="doc_text">
2376
2377<h5>Syntax:</h5>
2378<pre>
2379 unreachable
2380</pre>
2381
2382<h5>Overview:</h5>
2383
2384<p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
2385instruction is used to inform the optimizer that a particular portion of the
2386code is not reachable. This can be used to indicate that the code after a
2387no-return function cannot be reached, and other facts.</p>
2388
2389<h5>Semantics:</h5>
2390
2391<p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
2392</div>
2393
2394
2395
2396<!-- ======================================================================= -->
2397<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
2398<div class="doc_text">
2399<p>Binary operators are used to do most of the computation in a
Chris Lattnerab596d92008-04-01 18:47:32 +0000[diff] [blame]2400program. They require two operands of the same type, execute an operation on them, and
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2401produce a single value. The operands might represent
2402multiple data, as is the case with the <a href="#t_vector">vector</a> data type.
Chris Lattnerab596d92008-04-01 18:47:32 +0000[diff] [blame]2403The result value has the same type as its operands.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2404<p>There are several different binary operators:</p>
2405</div>
2406<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2407<div class="doc_subsubsection">
2408 <a name="i_add">'<tt>add</tt>' Instruction</a>
2409</div>
2410
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2411<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2412
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2413<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2414
2415<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2416 &lt;result&gt; = add &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2417</pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2418
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2419<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2420
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2421<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2422
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2423<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2424
2425<p>The two arguments to the '<tt>add</tt>' instruction must be <a
2426 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>, or
2427 <a href="#t_vector">vector</a> values. Both arguments must have identical
2428 types.</p>
2429
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2430<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2431
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2432<p>The value produced is the integer or floating point sum of the two
2433operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2434
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2435<p>If an integer sum has unsigned overflow, the result returned is the
2436mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2437the result.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2438
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2439<p>Because LLVM integers use a two's complement representation, this
2440instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2441
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2442<h5>Example:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2443
2444<pre>
2445 &lt;result&gt; = add i32 4, %var <i>; yields {i32}:result = 4 + %var</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2446</pre>
2447</div>
2448<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2449<div class="doc_subsubsection">
2450 <a name="i_sub">'<tt>sub</tt>' Instruction</a>
2451</div>
2452
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2453<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2454
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2455<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2456
2457<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2458 &lt;result&gt; = sub &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2459</pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2460
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2461<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2462
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2463<p>The '<tt>sub</tt>' instruction returns the difference of its two
2464operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2465
2466<p>Note that the '<tt>sub</tt>' instruction is used to represent the
2467'<tt>neg</tt>' instruction present in most other intermediate
2468representations.</p>
2469
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2470<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2471
2472<p>The two arguments to the '<tt>sub</tt>' instruction must be <a
2473 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2474 or <a href="#t_vector">vector</a> values. Both arguments must have identical
2475 types.</p>
2476
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2477<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2478
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2479<p>The value produced is the integer or floating point difference of
2480the two operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2481
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2482<p>If an integer difference has unsigned overflow, the result returned is the
2483mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2484the result.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2485
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2486<p>Because LLVM integers use a two's complement representation, this
2487instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2488
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2489<h5>Example:</h5>
2490<pre>
2491 &lt;result&gt; = sub i32 4, %var <i>; yields {i32}:result = 4 - %var</i>
2492 &lt;result&gt; = sub i32 0, %val <i>; yields {i32}:result = -%var</i>
2493</pre>
2494</div>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2495
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2496<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2497<div class="doc_subsubsection">
2498 <a name="i_mul">'<tt>mul</tt>' Instruction</a>
2499</div>
2500
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2501<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2502
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2503<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2504<pre> &lt;result&gt; = mul &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2505</pre>
2506<h5>Overview:</h5>
2507<p>The '<tt>mul</tt>' instruction returns the product of its two
2508operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2509
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2510<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2511
2512<p>The two arguments to the '<tt>mul</tt>' instruction must be <a
2513href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2514or <a href="#t_vector">vector</a> values. Both arguments must have identical
2515types.</p>
2516
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2517<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2518
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2519<p>The value produced is the integer or floating point product of the
2520two operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2521
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2522<p>If the result of an integer multiplication has unsigned overflow,
2523the result returned is the mathematical result modulo
25242<sup>n</sup>, where n is the bit width of the result.</p>
2525<p>Because LLVM integers use a two's complement representation, and the
2526result is the same width as the operands, this instruction returns the
2527correct result for both signed and unsigned integers. If a full product
2528(e.g. <tt>i32</tt>x<tt>i32</tt>-><tt>i64</tt>) is needed, the operands
2529should be sign-extended or zero-extended as appropriate to the
2530width of the full product.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2531<h5>Example:</h5>
2532<pre> &lt;result&gt; = mul i32 4, %var <i>; yields {i32}:result = 4 * %var</i>
2533</pre>
2534</div>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2535
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2536<!-- _______________________________________________________________________ -->
2537<div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
2538</a></div>
2539<div class="doc_text">
2540<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2541<pre> &lt;result&gt; = udiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2542</pre>
2543<h5>Overview:</h5>
2544<p>The '<tt>udiv</tt>' instruction returns the quotient of its two
2545operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2546
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2547<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2548
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2549<p>The two arguments to the '<tt>udiv</tt>' instruction must be
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2550<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2551values. Both arguments must have identical types.</p>
2552
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2553<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2554
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2555<p>The value produced is the unsigned integer quotient of the two operands.</p>
2556<p>Note that unsigned integer division and signed integer division are distinct
2557operations; for signed integer division, use '<tt>sdiv</tt>'.</p>
2558<p>Division by zero leads to undefined behavior.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2559<h5>Example:</h5>
2560<pre> &lt;result&gt; = udiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
2561</pre>
2562</div>
2563<!-- _______________________________________________________________________ -->
2564<div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
2565</a> </div>
2566<div class="doc_text">
2567<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2568<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2569 &lt;result&gt; = sdiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2570</pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2571
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2572<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2573
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2574<p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
2575operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2576
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2577<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2578
2579<p>The two arguments to the '<tt>sdiv</tt>' instruction must be
2580<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2581values. Both arguments must have identical types.</p>
2582
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2583<h5>Semantics:</h5>
Chris Lattnerdc15b1d2008-04-01 18:45:27 +0000[diff] [blame]2584<p>The value produced is the signed integer quotient of the two operands rounded towards zero.</p>
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2585<p>Note that signed integer division and unsigned integer division are distinct
2586operations; for unsigned integer division, use '<tt>udiv</tt>'.</p>
2587<p>Division by zero leads to undefined behavior. Overflow also leads to
2588undefined behavior; this is a rare case, but can occur, for example,
2589by doing a 32-bit division of -2147483648 by -1.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2590<h5>Example:</h5>
2591<pre> &lt;result&gt; = sdiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
2592</pre>
2593</div>
2594<!-- _______________________________________________________________________ -->
2595<div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
2596Instruction</a> </div>
2597<div class="doc_text">
2598<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2599<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2600 &lt;result&gt; = fdiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2601</pre>
2602<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2603
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2604<p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
2605operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2606
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2607<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2608
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2609<p>The two arguments to the '<tt>fdiv</tt>' instruction must be
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2610<a href="#t_floating">floating point</a> or <a href="#t_vector">vector</a>
2611of floating point values. Both arguments must have identical types.</p>
2612
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2613<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2614
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2615<p>The value produced is the floating point quotient of the two operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2616
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2617<h5>Example:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2618
2619<pre>
2620 &lt;result&gt; = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2621</pre>
2622</div>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2623
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2624<!-- _______________________________________________________________________ -->
2625<div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
2626</div>
2627<div class="doc_text">
2628<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2629<pre> &lt;result&gt; = urem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2630</pre>
2631<h5>Overview:</h5>
2632<p>The '<tt>urem</tt>' instruction returns the remainder from the
2633unsigned division of its two arguments.</p>
2634<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2635<p>The two arguments to the '<tt>urem</tt>' instruction must be
2636<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2637values. Both arguments must have identical types.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2638<h5>Semantics:</h5>
2639<p>This instruction returns the unsigned integer <i>remainder</i> of a division.
Chris Lattnerdc15b1d2008-04-01 18:45:27 +0000[diff] [blame]2640This instruction always performs an unsigned division to get the remainder.</p>
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2641<p>Note that unsigned integer remainder and signed integer remainder are
2642distinct operations; for signed integer remainder, use '<tt>srem</tt>'.</p>
2643<p>Taking the remainder of a division by zero leads to undefined behavior.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2644<h5>Example:</h5>
2645<pre> &lt;result&gt; = urem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
2646</pre>
2647
2648</div>
2649<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2650<div class="doc_subsubsection">
2651 <a name="i_srem">'<tt>srem</tt>' Instruction</a>
2652</div>
2653
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2654<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2655
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2656<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2657
2658<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2659 &lt;result&gt; = srem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2660</pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2661
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2662<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2663
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2664<p>The '<tt>srem</tt>' instruction returns the remainder from the
Dan Gohman3e3fd8c2007-11-05 23:35:22 +0000[diff] [blame]2665signed division of its two operands. This instruction can also take
2666<a href="#t_vector">vector</a> versions of the values in which case
2667the elements must be integers.</p>
Chris Lattner08497ce2008-01-04 04:33:49 +0000[diff] [blame]2668
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2669<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2670
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2671<p>The two arguments to the '<tt>srem</tt>' instruction must be
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2672<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2673values. Both arguments must have identical types.</p>
2674
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2675<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2676
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2677<p>This instruction returns the <i>remainder</i> of a division (where the result
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2678has the same sign as the dividend, <tt>op1</tt>), not the <i>modulo</i>
2679operator (where the result has the same sign as the divisor, <tt>op2</tt>) of
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2680a value. For more information about the difference, see <a
2681 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
2682Math Forum</a>. For a table of how this is implemented in various languages,
2683please see <a href="http://en.wikipedia.org/wiki/Modulo_operation">
2684Wikipedia: modulo operation</a>.</p>
Chris Lattner9aba1e22008-01-28 00:36:27 +0000[diff] [blame]2685<p>Note that signed integer remainder and unsigned integer remainder are
2686distinct operations; for unsigned integer remainder, use '<tt>urem</tt>'.</p>
2687<p>Taking the remainder of a division by zero leads to undefined behavior.
2688Overflow also leads to undefined behavior; this is a rare case, but can occur,
2689for example, by taking the remainder of a 32-bit division of -2147483648 by -1.
2690(The remainder doesn't actually overflow, but this rule lets srem be
2691implemented using instructions that return both the result of the division
2692and the remainder.)</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2693<h5>Example:</h5>
2694<pre> &lt;result&gt; = srem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
2695</pre>
2696
2697</div>
2698<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2699<div class="doc_subsubsection">
2700 <a name="i_frem">'<tt>frem</tt>' Instruction</a> </div>
2701
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2702<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2703
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2704<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2705<pre> &lt;result&gt; = frem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2706</pre>
2707<h5>Overview:</h5>
2708<p>The '<tt>frem</tt>' instruction returns the remainder from the
2709division of its two operands.</p>
2710<h5>Arguments:</h5>
2711<p>The two arguments to the '<tt>frem</tt>' instruction must be
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2712<a href="#t_floating">floating point</a> or <a href="#t_vector">vector</a>
2713of floating point values. Both arguments must have identical types.</p>
2714
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2715<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2716
Chris Lattnerdc15b1d2008-04-01 18:45:27 +0000[diff] [blame]2717<p>This instruction returns the <i>remainder</i> of a division.
2718The remainder has the same sign as the dividend.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2719
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2720<h5>Example:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2721
2722<pre>
2723 &lt;result&gt; = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2724</pre>
2725</div>
2726
2727<!-- ======================================================================= -->
2728<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
2729Operations</a> </div>
2730<div class="doc_text">
2731<p>Bitwise binary operators are used to do various forms of
2732bit-twiddling in a program. They are generally very efficient
2733instructions and can commonly be strength reduced from other
Chris Lattnerdc15b1d2008-04-01 18:45:27 +0000[diff] [blame]2734instructions. They require two operands of the same type, execute an operation on them,
2735and produce a single value. The resulting value is the same type as its operands.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2736</div>
2737
2738<!-- _______________________________________________________________________ -->
2739<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2740Instruction</a> </div>
2741<div class="doc_text">
2742<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2743<pre> &lt;result&gt; = shl &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2744</pre>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2745
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2746<h5>Overview:</h5>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2747
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2748<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2749the left a specified number of bits.</p>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2750
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2751<h5>Arguments:</h5>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2752
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2753<p>Both arguments to the '<tt>shl</tt>' instruction must be the same <a
Nate Begemanbb1ce942008-07-29 15:49:41 +0000[diff] [blame]2754 href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2755type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2756
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2757<h5>Semantics:</h5>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2758
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2759<p>The value produced is <tt>op1</tt> * 2<sup><tt>op2</tt></sup> mod 2<sup>n</sup>,
2760where n is the width of the result. If <tt>op2</tt> is (statically or dynamically) negative or
Mon P Wangb0f51822008-12-10 08:55:09 +0000[diff] [blame]2761equal to or larger than the number of bits in <tt>op1</tt>, the result is undefined.
2762If the arguments are vectors, each vector element of <tt>op1</tt> is shifted by the
2763corresponding shift amount in <tt>op2</tt>.</p>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2764
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2765<h5>Example:</h5><pre>
2766 &lt;result&gt; = shl i32 4, %var <i>; yields {i32}: 4 &lt;&lt; %var</i>
2767 &lt;result&gt; = shl i32 4, 2 <i>; yields {i32}: 16</i>
2768 &lt;result&gt; = shl i32 1, 10 <i>; yields {i32}: 1024</i>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2769 &lt;result&gt; = shl i32 1, 32 <i>; undefined</i>
Mon P Wang9901e732008-12-09 05:46:39 +0000[diff] [blame]2770 &lt;result&gt; = shl &lt;2 x i32&gt; &lt; i32 1, i32 1&gt;, &lt; i32 1, i32 2&gt; <i>; yields: result=&lt;2 x i32&gt; &lt; i32 2, i32 4&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2771</pre>
2772</div>
2773<!-- _______________________________________________________________________ -->
2774<div class="doc_subsubsection"> <a name="i_lshr">'<tt>lshr</tt>'
2775Instruction</a> </div>
2776<div class="doc_text">
2777<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2778<pre> &lt;result&gt; = lshr &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2779</pre>
2780
2781<h5>Overview:</h5>
2782<p>The '<tt>lshr</tt>' instruction (logical shift right) returns the first
2783operand shifted to the right a specified number of bits with zero fill.</p>
2784
2785<h5>Arguments:</h5>
2786<p>Both arguments to the '<tt>lshr</tt>' instruction must be the same
Nate Begemanbb1ce942008-07-29 15:49:41 +0000[diff] [blame]2787<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2788type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2789
2790<h5>Semantics:</h5>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2791
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2792<p>This instruction always performs a logical shift right operation. The most
2793significant bits of the result will be filled with zero bits after the
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2794shift. If <tt>op2</tt> is (statically or dynamically) equal to or larger than
Mon P Wangb0f51822008-12-10 08:55:09 +0000[diff] [blame]2795the number of bits in <tt>op1</tt>, the result is undefined. If the arguments are
2796vectors, each vector element of <tt>op1</tt> is shifted by the corresponding shift
2797amount in <tt>op2</tt>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2798
2799<h5>Example:</h5>
2800<pre>
2801 &lt;result&gt; = lshr i32 4, 1 <i>; yields {i32}:result = 2</i>
2802 &lt;result&gt; = lshr i32 4, 2 <i>; yields {i32}:result = 1</i>
2803 &lt;result&gt; = lshr i8 4, 3 <i>; yields {i8}:result = 0</i>
2804 &lt;result&gt; = lshr i8 -2, 1 <i>; yields {i8}:result = 0x7FFFFFFF </i>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2805 &lt;result&gt; = lshr i32 1, 32 <i>; undefined</i>
Mon P Wang9901e732008-12-09 05:46:39 +0000[diff] [blame]2806 &lt;result&gt; = lshr &lt;2 x i32&gt; &lt; i32 -2, i32 4&gt;, &lt; i32 1, i32 2&gt; <i>; yields: result=&lt;2 x i32&gt; &lt; i32 0x7FFFFFFF, i32 1&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2807</pre>
2808</div>
2809
2810<!-- _______________________________________________________________________ -->
2811<div class="doc_subsubsection"> <a name="i_ashr">'<tt>ashr</tt>'
2812Instruction</a> </div>
2813<div class="doc_text">
2814
2815<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2816<pre> &lt;result&gt; = ashr &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2817</pre>
2818
2819<h5>Overview:</h5>
2820<p>The '<tt>ashr</tt>' instruction (arithmetic shift right) returns the first
2821operand shifted to the right a specified number of bits with sign extension.</p>
2822
2823<h5>Arguments:</h5>
2824<p>Both arguments to the '<tt>ashr</tt>' instruction must be the same
Nate Begemanbb1ce942008-07-29 15:49:41 +0000[diff] [blame]2825<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2826type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2827
2828<h5>Semantics:</h5>
2829<p>This instruction always performs an arithmetic shift right operation,
2830The most significant bits of the result will be filled with the sign bit
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2831of <tt>op1</tt>. If <tt>op2</tt> is (statically or dynamically) equal to or
Mon P Wangb0f51822008-12-10 08:55:09 +0000[diff] [blame]2832larger than the number of bits in <tt>op1</tt>, the result is undefined. If the
2833arguments are vectors, each vector element of <tt>op1</tt> is shifted by the
2834corresponding shift amount in <tt>op2</tt>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2835
2836<h5>Example:</h5>
2837<pre>
2838 &lt;result&gt; = ashr i32 4, 1 <i>; yields {i32}:result = 2</i>
2839 &lt;result&gt; = ashr i32 4, 2 <i>; yields {i32}:result = 1</i>
2840 &lt;result&gt; = ashr i8 4, 3 <i>; yields {i8}:result = 0</i>
2841 &lt;result&gt; = ashr i8 -2, 1 <i>; yields {i8}:result = -1</i>
Chris Lattnerd939d9f2007-10-03 21:01:14 +0000[diff] [blame]2842 &lt;result&gt; = ashr i32 1, 32 <i>; undefined</i>
Mon P Wang9901e732008-12-09 05:46:39 +0000[diff] [blame]2843 &lt;result&gt; = ashr &lt;2 x i32&gt; &lt; i32 -2, i32 4&gt;, &lt; i32 1, i32 3&gt; <i>; yields: result=&lt;2 x i32&gt; &lt; i32 -1, i32 0&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2844</pre>
2845</div>
2846
2847<!-- _______________________________________________________________________ -->
2848<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
2849Instruction</a> </div>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2850
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2851<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2852
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2853<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2854
2855<pre>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2856 &lt;result&gt; = and &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2857</pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2858
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2859<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2860
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2861<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
2862its two operands.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2863
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2864<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2865
2866<p>The two arguments to the '<tt>and</tt>' instruction must be
2867<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2868values. Both arguments must have identical types.</p>
2869
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2870<h5>Semantics:</h5>
2871<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
2872<p> </p>
Bill Wendling1e19eac2008-09-07 10:29:20 +0000[diff] [blame]2873<div>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2874<table border="1" cellspacing="0" cellpadding="4">
2875 <tbody>
2876 <tr>
2877 <td>In0</td>
2878 <td>In1</td>
2879 <td>Out</td>
2880 </tr>
2881 <tr>
2882 <td>0</td>
2883 <td>0</td>
2884 <td>0</td>
2885 </tr>
2886 <tr>
2887 <td>0</td>
2888 <td>1</td>
2889 <td>0</td>
2890 </tr>
2891 <tr>
2892 <td>1</td>
2893 <td>0</td>
2894 <td>0</td>
2895 </tr>
2896 <tr>
2897 <td>1</td>
2898 <td>1</td>
2899 <td>1</td>
2900 </tr>
2901 </tbody>
2902</table>
2903</div>
2904<h5>Example:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2905<pre>
2906 &lt;result&gt; = and i32 4, %var <i>; yields {i32}:result = 4 &amp; %var</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2907 &lt;result&gt; = and i32 15, 40 <i>; yields {i32}:result = 8</i>
2908 &lt;result&gt; = and i32 4, 8 <i>; yields {i32}:result = 0</i>
2909</pre>
2910</div>
2911<!-- _______________________________________________________________________ -->
2912<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
2913<div class="doc_text">
2914<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2915<pre> &lt;result&gt; = or &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2916</pre>
2917<h5>Overview:</h5>
2918<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
2919or of its two operands.</p>
2920<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2921
2922<p>The two arguments to the '<tt>or</tt>' instruction must be
2923<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2924values. Both arguments must have identical types.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2925<h5>Semantics:</h5>
2926<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
2927<p> </p>
Bill Wendling1e19eac2008-09-07 10:29:20 +0000[diff] [blame]2928<div>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2929<table border="1" cellspacing="0" cellpadding="4">
2930 <tbody>
2931 <tr>
2932 <td>In0</td>
2933 <td>In1</td>
2934 <td>Out</td>
2935 </tr>
2936 <tr>
2937 <td>0</td>
2938 <td>0</td>
2939 <td>0</td>
2940 </tr>
2941 <tr>
2942 <td>0</td>
2943 <td>1</td>
2944 <td>1</td>
2945 </tr>
2946 <tr>
2947 <td>1</td>
2948 <td>0</td>
2949 <td>1</td>
2950 </tr>
2951 <tr>
2952 <td>1</td>
2953 <td>1</td>
2954 <td>1</td>
2955 </tr>
2956 </tbody>
2957</table>
2958</div>
2959<h5>Example:</h5>
2960<pre> &lt;result&gt; = or i32 4, %var <i>; yields {i32}:result = 4 | %var</i>
2961 &lt;result&gt; = or i32 15, 40 <i>; yields {i32}:result = 47</i>
2962 &lt;result&gt; = or i32 4, 8 <i>; yields {i32}:result = 12</i>
2963</pre>
2964</div>
2965<!-- _______________________________________________________________________ -->
2966<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
2967Instruction</a> </div>
2968<div class="doc_text">
2969<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]2970<pre> &lt;result&gt; = xor &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2971</pre>
2972<h5>Overview:</h5>
2973<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2974or of its two operands. The <tt>xor</tt> is used to implement the
2975"one's complement" operation, which is the "~" operator in C.</p>
2976<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2977<p>The two arguments to the '<tt>xor</tt>' instruction must be
2978<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2979values. Both arguments must have identical types.</p>
2980
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2981<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]2982
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2983<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
2984<p> </p>
Bill Wendling1e19eac2008-09-07 10:29:20 +0000[diff] [blame]2985<div>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]2986<table border="1" cellspacing="0" cellpadding="4">
2987 <tbody>
2988 <tr>
2989 <td>In0</td>
2990 <td>In1</td>
2991 <td>Out</td>
2992 </tr>
2993 <tr>
2994 <td>0</td>
2995 <td>0</td>
2996 <td>0</td>
2997 </tr>
2998 <tr>
2999 <td>0</td>
3000 <td>1</td>
3001 <td>1</td>
3002 </tr>
3003 <tr>
3004 <td>1</td>
3005 <td>0</td>
3006 <td>1</td>
3007 </tr>
3008 <tr>
3009 <td>1</td>
3010 <td>1</td>
3011 <td>0</td>
3012 </tr>
3013 </tbody>
3014</table>
3015</div>
3016<p> </p>
3017<h5>Example:</h5>
3018<pre> &lt;result&gt; = xor i32 4, %var <i>; yields {i32}:result = 4 ^ %var</i>
3019 &lt;result&gt; = xor i32 15, 40 <i>; yields {i32}:result = 39</i>
3020 &lt;result&gt; = xor i32 4, 8 <i>; yields {i32}:result = 12</i>
3021 &lt;result&gt; = xor i32 %V, -1 <i>; yields {i32}:result = ~%V</i>
3022</pre>
3023</div>
3024
3025<!-- ======================================================================= -->
3026<div class="doc_subsection">
3027 <a name="vectorops">Vector Operations</a>
3028</div>
3029
3030<div class="doc_text">
3031
3032<p>LLVM supports several instructions to represent vector operations in a
3033target-independent manner. These instructions cover the element-access and
3034vector-specific operations needed to process vectors effectively. While LLVM
3035does directly support these vector operations, many sophisticated algorithms
3036will want to use target-specific intrinsics to take full advantage of a specific
3037target.</p>
3038
3039</div>
3040
3041<!-- _______________________________________________________________________ -->
3042<div class="doc_subsubsection">
3043 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
3044</div>
3045
3046<div class="doc_text">
3047
3048<h5>Syntax:</h5>
3049
3050<pre>
3051 &lt;result&gt; = extractelement &lt;n x &lt;ty&gt;&gt; &lt;val&gt;, i32 &lt;idx&gt; <i>; yields &lt;ty&gt;</i>
3052</pre>
3053
3054<h5>Overview:</h5>
3055
3056<p>
3057The '<tt>extractelement</tt>' instruction extracts a single scalar
3058element from a vector at a specified index.
3059</p>
3060
3061
3062<h5>Arguments:</h5>
3063
3064<p>
3065The first operand of an '<tt>extractelement</tt>' instruction is a
3066value of <a href="#t_vector">vector</a> type. The second operand is
3067an index indicating the position from which to extract the element.
3068The index may be a variable.</p>
3069
3070<h5>Semantics:</h5>
3071
3072<p>
3073The result is a scalar of the same type as the element type of
3074<tt>val</tt>. Its value is the value at position <tt>idx</tt> of
3075<tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
3076results are undefined.
3077</p>
3078
3079<h5>Example:</h5>
3080
3081<pre>
3082 %result = extractelement &lt;4 x i32&gt; %vec, i32 0 <i>; yields i32</i>
3083</pre>
3084</div>
3085
3086
3087<!-- _______________________________________________________________________ -->
3088<div class="doc_subsubsection">
3089 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
3090</div>
3091
3092<div class="doc_text">
3093
3094<h5>Syntax:</h5>
3095
3096<pre>
Dan Gohmanbcc3c502008-05-12 23:38:42 +0000[diff] [blame]3097 &lt;result&gt; = insertelement &lt;n x &lt;ty&gt;&gt; &lt;val&gt;, &lt;ty&gt; &lt;elt&gt;, i32 &lt;idx&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3098</pre>
3099
3100<h5>Overview:</h5>
3101
3102<p>
3103The '<tt>insertelement</tt>' instruction inserts a scalar
3104element into a vector at a specified index.
3105</p>
3106
3107
3108<h5>Arguments:</h5>
3109
3110<p>
3111The first operand of an '<tt>insertelement</tt>' instruction is a
3112value of <a href="#t_vector">vector</a> type. The second operand is a
3113scalar value whose type must equal the element type of the first
3114operand. The third operand is an index indicating the position at
3115which to insert the value. The index may be a variable.</p>
3116
3117<h5>Semantics:</h5>
3118
3119<p>
3120The result is a vector of the same type as <tt>val</tt>. Its
3121element values are those of <tt>val</tt> except at position
3122<tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
3123exceeds the length of <tt>val</tt>, the results are undefined.
3124</p>
3125
3126<h5>Example:</h5>
3127
3128<pre>
3129 %result = insertelement &lt;4 x i32&gt; %vec, i32 1, i32 0 <i>; yields &lt;4 x i32&gt;</i>
3130</pre>
3131</div>
3132
3133<!-- _______________________________________________________________________ -->
3134<div class="doc_subsubsection">
3135 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
3136</div>
3137
3138<div class="doc_text">
3139
3140<h5>Syntax:</h5>
3141
3142<pre>
Mon P Wangbff5d9c2008-11-10 04:46:22 +0000[diff] [blame]3143 &lt;result&gt; = shufflevector &lt;n x &lt;ty&gt;&gt; &lt;v1&gt;, &lt;n x &lt;ty&gt;&gt; &lt;v2&gt;, &lt;m x i32&gt; &lt;mask&gt; <i>; yields &lt;m x &lt;ty&gt;&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3144</pre>
3145
3146<h5>Overview:</h5>
3147
3148<p>
3149The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
Mon P Wangbff5d9c2008-11-10 04:46:22 +0000[diff] [blame]3150from two input vectors, returning a vector with the same element type as
3151the input and length that is the same as the shuffle mask.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3152</p>
3153
3154<h5>Arguments:</h5>
3155
3156<p>
Mon P Wangbff5d9c2008-11-10 04:46:22 +0000[diff] [blame]3157The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
3158with types that match each other. The third argument is a shuffle mask whose
3159element type is always 'i32'. The result of the instruction is a vector whose
3160length is the same as the shuffle mask and whose element type is the same as
3161the element type of the first two operands.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3162</p>
3163
3164<p>
3165The shuffle mask operand is required to be a constant vector with either
3166constant integer or undef values.
3167</p>
3168
3169<h5>Semantics:</h5>
3170
3171<p>
3172The elements of the two input vectors are numbered from left to right across
3173both of the vectors. The shuffle mask operand specifies, for each element of
Mon P Wangbff5d9c2008-11-10 04:46:22 +0000[diff] [blame]3174the result vector, which element of the two input vectors the result element
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3175gets. The element selector may be undef (meaning "don't care") and the second
3176operand may be undef if performing a shuffle from only one vector.
3177</p>
3178
3179<h5>Example:</h5>
3180
3181<pre>
3182 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
3183 &lt;4 x i32&gt; &lt;i32 0, i32 4, i32 1, i32 5&gt; <i>; yields &lt;4 x i32&gt;</i>
3184 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; undef,
3185 &lt;4 x i32&gt; &lt;i32 0, i32 1, i32 2, i32 3&gt; <i>; yields &lt;4 x i32&gt;</i> - Identity shuffle.
Mon P Wangbff5d9c2008-11-10 04:46:22 +0000[diff] [blame]3186 %result = shufflevector &lt;8 x i32&gt; %v1, &lt;8 x i32&gt; undef,
3187 &lt;4 x i32&gt; &lt;i32 0, i32 1, i32 2, i32 3&gt; <i>; yields &lt;4 x i32&gt;</i>
3188 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
3189 &lt;8 x i32&gt; &lt;i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7 &gt; <i>; yields &lt;8 x i32&gt;</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3190</pre>
3191</div>
3192
3193
3194<!-- ======================================================================= -->
3195<div class="doc_subsection">
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3196 <a name="aggregateops">Aggregate Operations</a>
3197</div>
3198
3199<div class="doc_text">
3200
3201<p>LLVM supports several instructions for working with aggregate values.
3202</p>
3203
3204</div>
3205
3206<!-- _______________________________________________________________________ -->
3207<div class="doc_subsubsection">
3208 <a name="i_extractvalue">'<tt>extractvalue</tt>' Instruction</a>
3209</div>
3210
3211<div class="doc_text">
3212
3213<h5>Syntax:</h5>
3214
3215<pre>
3216 &lt;result&gt; = extractvalue &lt;aggregate type&gt; &lt;val&gt;, &lt;idx&gt;{, &lt;idx&gt;}*
3217</pre>
3218
3219<h5>Overview:</h5>
3220
3221<p>
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3222The '<tt>extractvalue</tt>' instruction extracts the value of a struct field
3223or array element from an aggregate value.
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3224</p>
3225
3226
3227<h5>Arguments:</h5>
3228
3229<p>
3230The first operand of an '<tt>extractvalue</tt>' instruction is a
3231value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a>
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3232type. The operands are constant indices to specify which value to extract
Dan Gohmane5febe42008-05-31 00:58:22 +0000[diff] [blame]3233in a similar manner as indices in a
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3234'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
3235</p>
3236
3237<h5>Semantics:</h5>
3238
3239<p>
3240The result is the value at the position in the aggregate specified by
3241the index operands.
3242</p>
3243
3244<h5>Example:</h5>
3245
3246<pre>
Dan Gohmane5febe42008-05-31 00:58:22 +0000[diff] [blame]3247 %result = extractvalue {i32, float} %agg, 0 <i>; yields i32</i>
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3248</pre>
3249</div>
3250
3251
3252<!-- _______________________________________________________________________ -->
3253<div class="doc_subsubsection">
3254 <a name="i_insertvalue">'<tt>insertvalue</tt>' Instruction</a>
3255</div>
3256
3257<div class="doc_text">
3258
3259<h5>Syntax:</h5>
3260
3261<pre>
Dan Gohmane5febe42008-05-31 00:58:22 +0000[diff] [blame]3262 &lt;result&gt; = insertvalue &lt;aggregate type&gt; &lt;val&gt;, &lt;ty&gt; &lt;val&gt;, &lt;idx&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3263</pre>
3264
3265<h5>Overview:</h5>
3266
3267<p>
3268The '<tt>insertvalue</tt>' instruction inserts a value
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3269into a struct field or array element in an aggregate.
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3270</p>
3271
3272
3273<h5>Arguments:</h5>
3274
3275<p>
3276The first operand of an '<tt>insertvalue</tt>' instruction is a
3277value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a> type.
3278The second operand is a first-class value to insert.
Dan Gohman4f29e422008-05-23 21:53:15 +0000[diff] [blame]3279The following operands are constant indices
Dan Gohmane5febe42008-05-31 00:58:22 +0000[diff] [blame]3280indicating the position at which to insert the value in a similar manner as
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3281indices in a
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3282'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
3283The value to insert must have the same type as the value identified
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3284by the indices.
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]3285</p>
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3286
3287<h5>Semantics:</h5>
3288
3289<p>
3290The result is an aggregate of the same type as <tt>val</tt>. Its
3291value is that of <tt>val</tt> except that the value at the position
Dan Gohman6c6dea02008-05-13 18:16:06 +0000[diff] [blame]3292specified by the indices is that of <tt>elt</tt>.
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3293</p>
3294
3295<h5>Example:</h5>
3296
3297<pre>
Dan Gohmanb1aab4e2008-06-23 15:26:37 +0000[diff] [blame]3298 %result = insertvalue {i32, float} %agg, i32 1, 0 <i>; yields {i32, float}</i>
Dan Gohman74d6faf2008-05-12 23:51:09 +0000[diff] [blame]3299</pre>
3300</div>
3301
3302
3303<!-- ======================================================================= -->
3304<div class="doc_subsection">
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3305 <a name="memoryops">Memory Access and Addressing Operations</a>
3306</div>
3307
3308<div class="doc_text">
3309
3310<p>A key design point of an SSA-based representation is how it
3311represents memory. In LLVM, no memory locations are in SSA form, which
3312makes things very simple. This section describes how to read, write,
3313allocate, and free memory in LLVM.</p>
3314
3315</div>
3316
3317<!-- _______________________________________________________________________ -->
3318<div class="doc_subsubsection">
3319 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
3320</div>
3321
3322<div class="doc_text">
3323
3324<h5>Syntax:</h5>
3325
3326<pre>
3327 &lt;result&gt; = malloc &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
3328</pre>
3329
3330<h5>Overview:</h5>
3331
3332<p>The '<tt>malloc</tt>' instruction allocates memory from the system
Christopher Lambcfe00962007-12-17 01:00:21 +0000[diff] [blame]3333heap and returns a pointer to it. The object is always allocated in the generic
3334address space (address space zero).</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3335
3336<h5>Arguments:</h5>
3337
3338<p>The '<tt>malloc</tt>' instruction allocates
3339<tt>sizeof(&lt;type&gt;)*NumElements</tt>
3340bytes of memory from the operating system and returns a pointer of the
3341appropriate type to the program. If "NumElements" is specified, it is the
Gabor Greif5082cf42008-02-09 22:24:34 +0000[diff] [blame]3342number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3343If a constant alignment is specified, the value result of the allocation is guaranteed to
Gabor Greif5082cf42008-02-09 22:24:34 +0000[diff] [blame]3344be aligned to at least that boundary. If not specified, or if zero, the target can
3345choose to align the allocation on any convenient boundary.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3346
3347<p>'<tt>type</tt>' must be a sized type.</p>
3348
3349<h5>Semantics:</h5>
3350
3351<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
Nick Lewyckyff384472008-11-24 03:41:24 +0000[diff] [blame]3352a pointer is returned. The result of a zero byte allocation is undefined. The
Chris Lattner8b094fc2008-04-19 21:01:16 +0000[diff] [blame]3353result is null if there is insufficient memory available.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3354
3355<h5>Example:</h5>
3356
3357<pre>
Dan Gohmanf54f50a2009-01-04 23:49:44 +0000[diff] [blame]3358 %array = malloc [4 x i8] <i>; yields {[%4 x i8]*}:array</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3359
3360 %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
3361 %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>
3362 %array2 = malloc [12 x i8], i32 %size <i>; yields {[12 x i8]*}:array2</i>
3363 %array3 = malloc i32, i32 4, align 1024 <i>; yields {i32*}:array3</i>
3364 %array4 = malloc i32, align 1024 <i>; yields {i32*}:array4</i>
3365</pre>
Dan Gohman60967192009-01-12 23:12:39 +0000[diff] [blame]3366
3367<p>Note that the code generator does not yet respect the
3368 alignment value.</p>
3369
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3370</div>
3371
3372<!-- _______________________________________________________________________ -->
3373<div class="doc_subsubsection">
3374 <a name="i_free">'<tt>free</tt>' Instruction</a>
3375</div>
3376
3377<div class="doc_text">
3378
3379<h5>Syntax:</h5>
3380
3381<pre>
Dan Gohmanf54f50a2009-01-04 23:49:44 +0000[diff] [blame]3382 free &lt;type&gt; &lt;value&gt; <i>; yields {void}</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3383</pre>
3384
3385<h5>Overview:</h5>
3386
3387<p>The '<tt>free</tt>' instruction returns memory back to the unused
3388memory heap to be reallocated in the future.</p>
3389
3390<h5>Arguments:</h5>
3391
3392<p>'<tt>value</tt>' shall be a pointer value that points to a value
3393that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
3394instruction.</p>
3395
3396<h5>Semantics:</h5>
3397
3398<p>Access to the memory pointed to by the pointer is no longer defined
Chris Lattner329d6532008-04-19 22:41:32 +0000[diff] [blame]3399after this instruction executes. If the pointer is null, the operation
3400is a noop.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3401
3402<h5>Example:</h5>
3403
3404<pre>
Dan Gohmanf54f50a2009-01-04 23:49:44 +0000[diff] [blame]3405 %array = <a href="#i_malloc">malloc</a> [4 x i8] <i>; yields {[4 x i8]*}:array</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3406 free [4 x i8]* %array
3407</pre>
3408</div>
3409
3410<!-- _______________________________________________________________________ -->
3411<div class="doc_subsubsection">
3412 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
3413</div>
3414
3415<div class="doc_text">
3416
3417<h5>Syntax:</h5>
3418
3419<pre>
3420 &lt;result&gt; = alloca &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
3421</pre>
3422
3423<h5>Overview:</h5>
3424
3425<p>The '<tt>alloca</tt>' instruction allocates memory on the stack frame of the
3426currently executing function, to be automatically released when this function
Christopher Lambcfe00962007-12-17 01:00:21 +0000[diff] [blame]3427returns to its caller. The object is always allocated in the generic address
3428space (address space zero).</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3429
3430<h5>Arguments:</h5>
3431
3432<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
3433bytes of memory on the runtime stack, returning a pointer of the
Gabor Greif5082cf42008-02-09 22:24:34 +0000[diff] [blame]3434appropriate type to the program. If "NumElements" is specified, it is the
3435number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3436If a constant alignment is specified, the value result of the allocation is guaranteed
Gabor Greif5082cf42008-02-09 22:24:34 +0000[diff] [blame]3437to be aligned to at least that boundary. If not specified, or if zero, the target
3438can choose to align the allocation on any convenient boundary.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3439
3440<p>'<tt>type</tt>' may be any sized type.</p>
3441
3442<h5>Semantics:</h5>
3443
Chris Lattner8b094fc2008-04-19 21:01:16 +0000[diff] [blame]3444<p>Memory is allocated; a pointer is returned. The operation is undefiend if
3445there is insufficient stack space for the allocation. '<tt>alloca</tt>'d
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3446memory is automatically released when the function returns. The '<tt>alloca</tt>'
3447instruction is commonly used to represent automatic variables that must
3448have an address available. When the function returns (either with the <tt><a
3449 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3450instructions), the memory is reclaimed. Allocating zero bytes
3451is legal, but the result is undefined.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3452
3453<h5>Example:</h5>
3454
3455<pre>
Dan Gohmanf54f50a2009-01-04 23:49:44 +0000[diff] [blame]3456 %ptr = alloca i32 <i>; yields {i32*}:ptr</i>
3457 %ptr = alloca i32, i32 4 <i>; yields {i32*}:ptr</i>
3458 %ptr = alloca i32, i32 4, align 1024 <i>; yields {i32*}:ptr</i>
3459 %ptr = alloca i32, align 1024 <i>; yields {i32*}:ptr</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3460</pre>
3461</div>
3462
3463<!-- _______________________________________________________________________ -->
3464<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
3465Instruction</a> </div>
3466<div class="doc_text">
3467<h5>Syntax:</h5>
3468<pre> &lt;result&gt; = load &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;]<br> &lt;result&gt; = volatile load &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;]<br></pre>
3469<h5>Overview:</h5>
3470<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
3471<h5>Arguments:</h5>
3472<p>The argument to the '<tt>load</tt>' instruction specifies the memory
3473address from which to load. The pointer must point to a <a
3474 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
3475marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
3476the number or order of execution of this <tt>load</tt> with other
3477volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
3478instructions. </p>
Chris Lattner21003c82008-01-06 21:04:43 +0000[diff] [blame]3479<p>
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3480The optional constant "align" argument specifies the alignment of the operation
Chris Lattner21003c82008-01-06 21:04:43 +0000[diff] [blame]3481(that is, the alignment of the memory address). A value of 0 or an
3482omitted "align" argument means that the operation has the preferential
3483alignment for the target. It is the responsibility of the code emitter
3484to ensure that the alignment information is correct. Overestimating
3485the alignment results in an undefined behavior. Underestimating the
3486alignment may produce less efficient code. An alignment of 1 is always
3487safe.
3488</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3489<h5>Semantics:</h5>
3490<p>The location of memory pointed to is loaded.</p>
3491<h5>Examples:</h5>
3492<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
3493 <a
3494 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
3495 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
3496</pre>
3497</div>
3498<!-- _______________________________________________________________________ -->
3499<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
3500Instruction</a> </div>
3501<div class="doc_text">
3502<h5>Syntax:</h5>
3503<pre> store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
3504 volatile store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
3505</pre>
3506<h5>Overview:</h5>
3507<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
3508<h5>Arguments:</h5>
3509<p>There are two arguments to the '<tt>store</tt>' instruction: a value
3510to store and an address at which to store it. The type of the '<tt>&lt;pointer&gt;</tt>'
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3511operand must be a pointer to the <a href="#t_firstclass">first class</a> type
3512of the '<tt>&lt;value&gt;</tt>'
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3513operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
3514optimizer is not allowed to modify the number or order of execution of
3515this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
3516 href="#i_store">store</a></tt> instructions.</p>
Chris Lattner21003c82008-01-06 21:04:43 +0000[diff] [blame]3517<p>
Chris Lattner10368b62008-04-02 00:38:26 +0000[diff] [blame]3518The optional constant "align" argument specifies the alignment of the operation
Chris Lattner21003c82008-01-06 21:04:43 +0000[diff] [blame]3519(that is, the alignment of the memory address). A value of 0 or an
3520omitted "align" argument means that the operation has the preferential
3521alignment for the target. It is the responsibility of the code emitter
3522to ensure that the alignment information is correct. Overestimating
3523the alignment results in an undefined behavior. Underestimating the
3524alignment may produce less efficient code. An alignment of 1 is always
3525safe.
3526</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3527<h5>Semantics:</h5>
3528<p>The contents of memory are updated to contain '<tt>&lt;value&gt;</tt>'
3529at the location specified by the '<tt>&lt;pointer&gt;</tt>' operand.</p>
3530<h5>Example:</h5>
3531<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Bill Wendling63ffa142007-10-22 05:10:05 +0000[diff] [blame]3532 store i32 3, i32* %ptr <i>; yields {void}</i>
3533 %val = <a href="#i_load">load</a> i32* %ptr <i>; yields {i32}:val = i32 3</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3534</pre>
3535</div>
3536
3537<!-- _______________________________________________________________________ -->
3538<div class="doc_subsubsection">
3539 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
3540</div>
3541
3542<div class="doc_text">
3543<h5>Syntax:</h5>
3544<pre>
Matthijs Kooijman32a080e2008-10-13 13:44:15 +0000[diff] [blame]3545 &lt;result&gt; = getelementptr &lt;pty&gt;* &lt;ptrval&gt;{, &lt;ty&gt; &lt;idx&gt;}*
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3546</pre>
3547
3548<h5>Overview:</h5>
3549
3550<p>
3551The '<tt>getelementptr</tt>' instruction is used to get the address of a
Matthijs Kooijman32a080e2008-10-13 13:44:15 +0000[diff] [blame]3552subelement of an aggregate data structure. It performs address calculation only
3553and does not access memory.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3554
3555<h5>Arguments:</h5>
3556
Matthijs Kooijman32a080e2008-10-13 13:44:15 +0000[diff] [blame]3557<p>The first argument is always a pointer, and forms the basis of the
3558calculation. The remaining arguments are indices, that indicate which of the
3559elements of the aggregate object are indexed. The interpretation of each index
3560is dependent on the type being indexed into. The first index always indexes the
3561pointer value given as the first argument, the second index indexes a value of
3562the type pointed to (not necessarily the value directly pointed to, since the
3563first index can be non-zero), etc. The first type indexed into must be a pointer
3564value, subsequent types can be arrays, vectors and structs. Note that subsequent
3565types being indexed into can never be pointers, since that would require loading
3566the pointer before continuing calculation.</p>
3567
3568<p>The type of each index argument depends on the type it is indexing into.
3569When indexing into a (packed) structure, only <tt>i32</tt> integer
3570<b>constants</b> are allowed. When indexing into an array, pointer or vector,
3571only integers of 32 or 64 bits are allowed (also non-constants). 32-bit values
3572will be sign extended to 64-bits if required.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3573
3574<p>For example, let's consider a C code fragment and how it gets
3575compiled to LLVM:</p>
3576
3577<div class="doc_code">
3578<pre>
3579struct RT {
3580 char A;
3581 int B[10][20];
3582 char C;
3583};
3584struct ST {
3585 int X;
3586 double Y;
3587 struct RT Z;
3588};
3589
3590int *foo(struct ST *s) {
3591 return &amp;s[1].Z.B[5][13];
3592}
3593</pre>
3594</div>
3595
3596<p>The LLVM code generated by the GCC frontend is:</p>
3597
3598<div class="doc_code">
3599<pre>
Chris Lattner5b6dc6e2009-01-11 20:53:49 +0000[diff] [blame]3600%RT = <a href="#namedtypes">type</a> { i8 , [10 x [20 x i32]], i8 }
3601%ST = <a href="#namedtypes">type</a> { i32, double, %RT }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3602
3603define i32* %foo(%ST* %s) {
3604entry:
3605 %reg = getelementptr %ST* %s, i32 1, i32 2, i32 1, i32 5, i32 13
3606 ret i32* %reg
3607}
3608</pre>
3609</div>
3610
3611<h5>Semantics:</h5>
3612
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3613<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
3614type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ i32, double, %RT
3615}</tt>' type, a structure. The second index indexes into the third element of
3616the structure, yielding a '<tt>%RT</tt>' = '<tt>{ i8 , [10 x [20 x i32]],
3617i8 }</tt>' type, another structure. The third index indexes into the second
3618element of the structure, yielding a '<tt>[10 x [20 x i32]]</tt>' type, an
3619array. The two dimensions of the array are subscripted into, yielding an
3620'<tt>i32</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
3621to this element, thus computing a value of '<tt>i32*</tt>' type.</p>
3622
3623<p>Note that it is perfectly legal to index partially through a
3624structure, returning a pointer to an inner element. Because of this,
3625the LLVM code for the given testcase is equivalent to:</p>
3626
3627<pre>
3628 define i32* %foo(%ST* %s) {
3629 %t1 = getelementptr %ST* %s, i32 1 <i>; yields %ST*:%t1</i>
3630 %t2 = getelementptr %ST* %t1, i32 0, i32 2 <i>; yields %RT*:%t2</i>
3631 %t3 = getelementptr %RT* %t2, i32 0, i32 1 <i>; yields [10 x [20 x i32]]*:%t3</i>
3632 %t4 = getelementptr [10 x [20 x i32]]* %t3, i32 0, i32 5 <i>; yields [20 x i32]*:%t4</i>
3633 %t5 = getelementptr [20 x i32]* %t4, i32 0, i32 13 <i>; yields i32*:%t5</i>
3634 ret i32* %t5
3635 }
3636</pre>
3637
Chris Lattner50609942009-03-09 20:55:18 +0000[diff] [blame]3638<p>Note that it is undefined to access an array out of bounds: array
3639and pointer indexes must always be within the defined bounds of the
3640array type when accessed with an instruction that dereferences the
3641pointer (e.g. a load or store instruction). The one exception for
3642this rule is zero length arrays. These arrays are defined to be
3643accessible as variable length arrays, which requires access beyond the
3644zero'th element.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3645
3646<p>The getelementptr instruction is often confusing. For some more insight
3647into how it works, see <a href="GetElementPtr.html">the getelementptr
3648FAQ</a>.</p>
3649
3650<h5>Example:</h5>
3651
3652<pre>
3653 <i>; yields [12 x i8]*:aptr</i>
Matthijs Kooijman32a080e2008-10-13 13:44:15 +0000[diff] [blame]3654 %aptr = getelementptr {i32, [12 x i8]}* %saptr, i64 0, i32 1
3655 <i>; yields i8*:vptr</i>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]3656 %vptr = getelementptr {i32, &lt;2 x i8&gt;}* %svptr, i64 0, i32 1, i32 1
Matthijs Kooijman32a080e2008-10-13 13:44:15 +0000[diff] [blame]3657 <i>; yields i8*:eptr</i>
3658 %eptr = getelementptr [12 x i8]* %aptr, i64 0, i32 1
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3659</pre>
3660</div>
3661
3662<!-- ======================================================================= -->
3663<div class="doc_subsection"> <a name="convertops">Conversion Operations</a>
3664</div>
3665<div class="doc_text">
3666<p>The instructions in this category are the conversion instructions (casting)
3667which all take a single operand and a type. They perform various bit conversions
3668on the operand.</p>
3669</div>
3670
3671<!-- _______________________________________________________________________ -->
3672<div class="doc_subsubsection">
3673 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
3674</div>
3675<div class="doc_text">
3676
3677<h5>Syntax:</h5>
3678<pre>
3679 &lt;result&gt; = trunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3680</pre>
3681
3682<h5>Overview:</h5>
3683<p>
3684The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
3685</p>
3686
3687<h5>Arguments:</h5>
3688<p>
3689The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
3690be an <a href="#t_integer">integer</a> type, and a type that specifies the size
3691and type of the result, which must be an <a href="#t_integer">integer</a>
3692type. The bit size of <tt>value</tt> must be larger than the bit size of
3693<tt>ty2</tt>. Equal sized types are not allowed.</p>
3694
3695<h5>Semantics:</h5>
3696<p>
3697The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
3698and converts the remaining bits to <tt>ty2</tt>. Since the source size must be
3699larger than the destination size, <tt>trunc</tt> cannot be a <i>no-op cast</i>.
3700It will always truncate bits.</p>
3701
3702<h5>Example:</h5>
3703<pre>
3704 %X = trunc i32 257 to i8 <i>; yields i8:1</i>
3705 %Y = trunc i32 123 to i1 <i>; yields i1:true</i>
3706 %Y = trunc i32 122 to i1 <i>; yields i1:false</i>
3707</pre>
3708</div>
3709
3710<!-- _______________________________________________________________________ -->
3711<div class="doc_subsubsection">
3712 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
3713</div>
3714<div class="doc_text">
3715
3716<h5>Syntax:</h5>
3717<pre>
3718 &lt;result&gt; = zext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3719</pre>
3720
3721<h5>Overview:</h5>
3722<p>The '<tt>zext</tt>' instruction zero extends its operand to type
3723<tt>ty2</tt>.</p>
3724
3725
3726<h5>Arguments:</h5>
3727<p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
3728<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3729also be of <a href="#t_integer">integer</a> type. The bit size of the
3730<tt>value</tt> must be smaller than the bit size of the destination type,
3731<tt>ty2</tt>.</p>
3732
3733<h5>Semantics:</h5>
3734<p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
3735bits until it reaches the size of the destination type, <tt>ty2</tt>.</p>
3736
3737<p>When zero extending from i1, the result will always be either 0 or 1.</p>
3738
3739<h5>Example:</h5>
3740<pre>
3741 %X = zext i32 257 to i64 <i>; yields i64:257</i>
3742 %Y = zext i1 true to i32 <i>; yields i32:1</i>
3743</pre>
3744</div>
3745
3746<!-- _______________________________________________________________________ -->
3747<div class="doc_subsubsection">
3748 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
3749</div>
3750<div class="doc_text">
3751
3752<h5>Syntax:</h5>
3753<pre>
3754 &lt;result&gt; = sext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3755</pre>
3756
3757<h5>Overview:</h5>
3758<p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
3759
3760<h5>Arguments:</h5>
3761<p>
3762The '<tt>sext</tt>' instruction takes a value to cast, which must be of
3763<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3764also be of <a href="#t_integer">integer</a> type. The bit size of the
3765<tt>value</tt> must be smaller than the bit size of the destination type,
3766<tt>ty2</tt>.</p>
3767
3768<h5>Semantics:</h5>
3769<p>
3770The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
3771bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
3772the type <tt>ty2</tt>.</p>
3773
3774<p>When sign extending from i1, the extension always results in -1 or 0.</p>
3775
3776<h5>Example:</h5>
3777<pre>
3778 %X = sext i8 -1 to i16 <i>; yields i16 :65535</i>
3779 %Y = sext i1 true to i32 <i>; yields i32:-1</i>
3780</pre>
3781</div>
3782
3783<!-- _______________________________________________________________________ -->
3784<div class="doc_subsubsection">
3785 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
3786</div>
3787
3788<div class="doc_text">
3789
3790<h5>Syntax:</h5>
3791
3792<pre>
3793 &lt;result&gt; = fptrunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3794</pre>
3795
3796<h5>Overview:</h5>
3797<p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
3798<tt>ty2</tt>.</p>
3799
3800
3801<h5>Arguments:</h5>
3802<p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
3803 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
3804cast it to. The size of <tt>value</tt> must be larger than the size of
3805<tt>ty2</tt>. This implies that <tt>fptrunc</tt> cannot be used to make a
3806<i>no-op cast</i>.</p>
3807
3808<h5>Semantics:</h5>
3809<p> The '<tt>fptrunc</tt>' instruction truncates a <tt>value</tt> from a larger
3810<a href="#t_floating">floating point</a> type to a smaller
3811<a href="#t_floating">floating point</a> type. If the value cannot fit within
3812the destination type, <tt>ty2</tt>, then the results are undefined.</p>
3813
3814<h5>Example:</h5>
3815<pre>
3816 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
3817 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
3818</pre>
3819</div>
3820
3821<!-- _______________________________________________________________________ -->
3822<div class="doc_subsubsection">
3823 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
3824</div>
3825<div class="doc_text">
3826
3827<h5>Syntax:</h5>
3828<pre>
3829 &lt;result&gt; = fpext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3830</pre>
3831
3832<h5>Overview:</h5>
3833<p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
3834floating point value.</p>
3835
3836<h5>Arguments:</h5>
3837<p>The '<tt>fpext</tt>' instruction takes a
3838<a href="#t_floating">floating point</a> <tt>value</tt> to cast,
3839and a <a href="#t_floating">floating point</a> type to cast it to. The source
3840type must be smaller than the destination type.</p>
3841
3842<h5>Semantics:</h5>
3843<p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from a smaller
3844<a href="#t_floating">floating point</a> type to a larger
3845<a href="#t_floating">floating point</a> type. The <tt>fpext</tt> cannot be
3846used to make a <i>no-op cast</i> because it always changes bits. Use
3847<tt>bitcast</tt> to make a <i>no-op cast</i> for a floating point cast.</p>
3848
3849<h5>Example:</h5>
3850<pre>
3851 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
3852 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
3853</pre>
3854</div>
3855
3856<!-- _______________________________________________________________________ -->
3857<div class="doc_subsubsection">
3858 <a name="i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a>
3859</div>
3860<div class="doc_text">
3861
3862<h5>Syntax:</h5>
3863<pre>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3864 &lt;result&gt; = fptoui &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3865</pre>
3866
3867<h5>Overview:</h5>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3868<p>The '<tt>fptoui</tt>' converts a floating point <tt>value</tt> to its
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3869unsigned integer equivalent of type <tt>ty2</tt>.
3870</p>
3871
3872<h5>Arguments:</h5>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3873<p>The '<tt>fptoui</tt>' instruction takes a value to cast, which must be a
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]3874scalar or vector <a href="#t_floating">floating point</a> value, and a type
3875to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3876type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3877vector integer type with the same number of elements as <tt>ty</tt></p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3878
3879<h5>Semantics:</h5>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3880<p> The '<tt>fptoui</tt>' instruction converts its
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3881<a href="#t_floating">floating point</a> operand into the nearest (rounding
3882towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
3883the results are undefined.</p>
3884
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3885<h5>Example:</h5>
3886<pre>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3887 %X = fptoui double 123.0 to i32 <i>; yields i32:123</i>
Chris Lattner681f1e82007-09-22 03:17:52 +0000[diff] [blame]3888 %Y = fptoui float 1.0E+300 to i1 <i>; yields undefined:1</i>
Reid Spencere6adee82007-07-31 14:40:14 +0000[diff] [blame]3889 %X = fptoui float 1.04E+17 to i8 <i>; yields undefined:1</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3890</pre>
3891</div>
3892
3893<!-- _______________________________________________________________________ -->
3894<div class="doc_subsubsection">
3895 <a name="i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a>
3896</div>
3897<div class="doc_text">
3898
3899<h5>Syntax:</h5>
3900<pre>
3901 &lt;result&gt; = fptosi &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3902</pre>
3903
3904<h5>Overview:</h5>
3905<p>The '<tt>fptosi</tt>' instruction converts
3906<a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
3907</p>
3908
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3909<h5>Arguments:</h5>
3910<p> The '<tt>fptosi</tt>' instruction takes a value to cast, which must be a
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]3911scalar or vector <a href="#t_floating">floating point</a> value, and a type
3912to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3913type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3914vector integer type with the same number of elements as <tt>ty</tt></p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3915
3916<h5>Semantics:</h5>
3917<p>The '<tt>fptosi</tt>' instruction converts its
3918<a href="#t_floating">floating point</a> operand into the nearest (rounding
3919towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3920the results are undefined.</p>
3921
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3922<h5>Example:</h5>
3923<pre>
3924 %X = fptosi double -123.0 to i32 <i>; yields i32:-123</i>
Chris Lattner681f1e82007-09-22 03:17:52 +0000[diff] [blame]3925 %Y = fptosi float 1.0E-247 to i1 <i>; yields undefined:1</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3926 %X = fptosi float 1.04E+17 to i8 <i>; yields undefined:1</i>
3927</pre>
3928</div>
3929
3930<!-- _______________________________________________________________________ -->
3931<div class="doc_subsubsection">
3932 <a name="i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a>
3933</div>
3934<div class="doc_text">
3935
3936<h5>Syntax:</h5>
3937<pre>
3938 &lt;result&gt; = uitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3939</pre>
3940
3941<h5>Overview:</h5>
3942<p>The '<tt>uitofp</tt>' instruction regards <tt>value</tt> as an unsigned
3943integer and converts that value to the <tt>ty2</tt> type.</p>
3944
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3945<h5>Arguments:</h5>
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]3946<p>The '<tt>uitofp</tt>' instruction takes a value to cast, which must be a
3947scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3948to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3949type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3950floating point type with the same number of elements as <tt>ty</tt></p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3951
3952<h5>Semantics:</h5>
3953<p>The '<tt>uitofp</tt>' instruction interprets its operand as an unsigned
3954integer quantity and converts it to the corresponding floating point value. If
3955the value cannot fit in the floating point value, the results are undefined.</p>
3956
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3957<h5>Example:</h5>
3958<pre>
3959 %X = uitofp i32 257 to float <i>; yields float:257.0</i>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]3960 %Y = uitofp i8 -1 to double <i>; yields double:255.0</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3961</pre>
3962</div>
3963
3964<!-- _______________________________________________________________________ -->
3965<div class="doc_subsubsection">
3966 <a name="i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a>
3967</div>
3968<div class="doc_text">
3969
3970<h5>Syntax:</h5>
3971<pre>
3972 &lt;result&gt; = sitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3973</pre>
3974
3975<h5>Overview:</h5>
3976<p>The '<tt>sitofp</tt>' instruction regards <tt>value</tt> as a signed
3977integer and converts that value to the <tt>ty2</tt> type.</p>
3978
3979<h5>Arguments:</h5>
Nate Begeman78246ca2007-11-17 03:58:34 +0000[diff] [blame]3980<p>The '<tt>sitofp</tt>' instruction takes a value to cast, which must be a
3981scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3982to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3983type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3984floating point type with the same number of elements as <tt>ty</tt></p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3985
3986<h5>Semantics:</h5>
3987<p>The '<tt>sitofp</tt>' instruction interprets its operand as a signed
3988integer quantity and converts it to the corresponding floating point value. If
3989the value cannot fit in the floating point value, the results are undefined.</p>
3990
3991<h5>Example:</h5>
3992<pre>
3993 %X = sitofp i32 257 to float <i>; yields float:257.0</i>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]3994 %Y = sitofp i8 -1 to double <i>; yields double:-1.0</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]3995</pre>
3996</div>
3997
3998<!-- _______________________________________________________________________ -->
3999<div class="doc_subsubsection">
4000 <a name="i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a>
4001</div>
4002<div class="doc_text">
4003
4004<h5>Syntax:</h5>
4005<pre>
4006 &lt;result&gt; = ptrtoint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
4007</pre>
4008
4009<h5>Overview:</h5>
4010<p>The '<tt>ptrtoint</tt>' instruction converts the pointer <tt>value</tt> to
4011the integer type <tt>ty2</tt>.</p>
4012
4013<h5>Arguments:</h5>
4014<p>The '<tt>ptrtoint</tt>' instruction takes a <tt>value</tt> to cast, which
4015must be a <a href="#t_pointer">pointer</a> value, and a type to cast it to
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4016<tt>ty2</tt>, which must be an <a href="#t_integer">integer</a> type.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4017
4018<h5>Semantics:</h5>
4019<p>The '<tt>ptrtoint</tt>' instruction converts <tt>value</tt> to integer type
4020<tt>ty2</tt> by interpreting the pointer value as an integer and either
4021truncating or zero extending that value to the size of the integer type. If
4022<tt>value</tt> is smaller than <tt>ty2</tt> then a zero extension is done. If
4023<tt>value</tt> is larger than <tt>ty2</tt> then a truncation is done. If they
4024are the same size, then nothing is done (<i>no-op cast</i>) other than a type
4025change.</p>
4026
4027<h5>Example:</h5>
4028<pre>
4029 %X = ptrtoint i32* %X to i8 <i>; yields truncation on 32-bit architecture</i>
4030 %Y = ptrtoint i32* %x to i64 <i>; yields zero extension on 32-bit architecture</i>
4031</pre>
4032</div>
4033
4034<!-- _______________________________________________________________________ -->
4035<div class="doc_subsubsection">
4036 <a name="i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a>
4037</div>
4038<div class="doc_text">
4039
4040<h5>Syntax:</h5>
4041<pre>
4042 &lt;result&gt; = inttoptr &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
4043</pre>
4044
4045<h5>Overview:</h5>
4046<p>The '<tt>inttoptr</tt>' instruction converts an integer <tt>value</tt> to
4047a pointer type, <tt>ty2</tt>.</p>
4048
4049<h5>Arguments:</h5>
4050<p>The '<tt>inttoptr</tt>' instruction takes an <a href="#t_integer">integer</a>
4051value to cast, and a type to cast it to, which must be a
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4052<a href="#t_pointer">pointer</a> type.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4053
4054<h5>Semantics:</h5>
4055<p>The '<tt>inttoptr</tt>' instruction converts <tt>value</tt> to type
4056<tt>ty2</tt> by applying either a zero extension or a truncation depending on
4057the size of the integer <tt>value</tt>. If <tt>value</tt> is larger than the
4058size of a pointer then a truncation is done. If <tt>value</tt> is smaller than
4059the size of a pointer then a zero extension is done. If they are the same size,
4060nothing is done (<i>no-op cast</i>).</p>
4061
4062<h5>Example:</h5>
4063<pre>
4064 %X = inttoptr i32 255 to i32* <i>; yields zero extension on 64-bit architecture</i>
4065 %X = inttoptr i32 255 to i32* <i>; yields no-op on 32-bit architecture</i>
4066 %Y = inttoptr i64 0 to i32* <i>; yields truncation on 32-bit architecture</i>
4067</pre>
4068</div>
4069
4070<!-- _______________________________________________________________________ -->
4071<div class="doc_subsubsection">
4072 <a name="i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a>
4073</div>
4074<div class="doc_text">
4075
4076<h5>Syntax:</h5>
4077<pre>
4078 &lt;result&gt; = bitcast &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
4079</pre>
4080
4081<h5>Overview:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4082
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4083<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
4084<tt>ty2</tt> without changing any bits.</p>
4085
4086<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4087
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4088<p>The '<tt>bitcast</tt>' instruction takes a value to cast, which must be
Dan Gohman7305fa02008-09-08 16:45:59 +0000[diff] [blame]4089a non-aggregate first class value, and a type to cast it to, which must also be
4090a non-aggregate <a href="#t_firstclass">first class</a> type. The bit sizes of
4091<tt>value</tt>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4092and the destination type, <tt>ty2</tt>, must be identical. If the source
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4093type is a pointer, the destination type must also be a pointer. This
4094instruction supports bitwise conversion of vectors to integers and to vectors
4095of other types (as long as they have the same size).</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4096
4097<h5>Semantics:</h5>
4098<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
4099<tt>ty2</tt>. It is always a <i>no-op cast</i> because no bits change with
4100this conversion. The conversion is done as if the <tt>value</tt> had been
4101stored to memory and read back as type <tt>ty2</tt>. Pointer types may only be
4102converted to other pointer types with this instruction. To convert pointers to
4103other types, use the <a href="#i_inttoptr">inttoptr</a> or
4104<a href="#i_ptrtoint">ptrtoint</a> instructions first.</p>
4105
4106<h5>Example:</h5>
4107<pre>
4108 %X = bitcast i8 255 to i8 <i>; yields i8 :-1</i>
4109 %Y = bitcast i32* %x to sint* <i>; yields sint*:%x</i>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4110 %Z = bitcast &lt;2 x int&gt; %V to i64; <i>; yields i64: %V</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4111</pre>
4112</div>
4113
4114<!-- ======================================================================= -->
4115<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
4116<div class="doc_text">
4117<p>The instructions in this category are the "miscellaneous"
4118instructions, which defy better classification.</p>
4119</div>
4120
4121<!-- _______________________________________________________________________ -->
4122<div class="doc_subsubsection"><a name="i_icmp">'<tt>icmp</tt>' Instruction</a>
4123</div>
4124<div class="doc_text">
4125<h5>Syntax:</h5>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4126<pre> &lt;result&gt; = icmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {i1} or {&lt;N x i1&gt;}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4127</pre>
4128<h5>Overview:</h5>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4129<p>The '<tt>icmp</tt>' instruction returns a boolean value or
4130a vector of boolean values based on comparison
4131of its two integer, integer vector, or pointer operands.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4132<h5>Arguments:</h5>
4133<p>The '<tt>icmp</tt>' instruction takes three operands. The first operand is
4134the condition code indicating the kind of comparison to perform. It is not
4135a value, just a keyword. The possible condition code are:
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4136</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4137<ol>
4138 <li><tt>eq</tt>: equal</li>
4139 <li><tt>ne</tt>: not equal </li>
4140 <li><tt>ugt</tt>: unsigned greater than</li>
4141 <li><tt>uge</tt>: unsigned greater or equal</li>
4142 <li><tt>ult</tt>: unsigned less than</li>
4143 <li><tt>ule</tt>: unsigned less or equal</li>
4144 <li><tt>sgt</tt>: signed greater than</li>
4145 <li><tt>sge</tt>: signed greater or equal</li>
4146 <li><tt>slt</tt>: signed less than</li>
4147 <li><tt>sle</tt>: signed less or equal</li>
4148</ol>
4149<p>The remaining two arguments must be <a href="#t_integer">integer</a> or
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4150<a href="#t_pointer">pointer</a>
4151or integer <a href="#t_vector">vector</a> typed.
4152They must also be identical types.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4153<h5>Semantics:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4154<p>The '<tt>icmp</tt>' compares <tt>op1</tt> and <tt>op2</tt> according to
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4155the condition code given as <tt>cond</tt>. The comparison performed always
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4156yields either an <a href="#t_primitive"><tt>i1</tt></a> or vector of <tt>i1</tt> result, as follows:
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4157</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4158<ol>
4159 <li><tt>eq</tt>: yields <tt>true</tt> if the operands are equal,
4160 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
4161 </li>
4162 <li><tt>ne</tt>: yields <tt>true</tt> if the operands are unequal,
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4163 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4164 <li><tt>ugt</tt>: interprets the operands as unsigned values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4165 <tt>true</tt> if <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4166 <li><tt>uge</tt>: interprets the operands as unsigned values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4167 <tt>true</tt> if <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4168 <li><tt>ult</tt>: interprets the operands as unsigned values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4169 <tt>true</tt> if <tt>op1</tt> is less than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4170 <li><tt>ule</tt>: interprets the operands as unsigned values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4171 <tt>true</tt> if <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4172 <li><tt>sgt</tt>: interprets the operands as signed values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4173 <tt>true</tt> if <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4174 <li><tt>sge</tt>: interprets the operands as signed values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4175 <tt>true</tt> if <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4176 <li><tt>slt</tt>: interprets the operands as signed values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4177 <tt>true</tt> if <tt>op1</tt> is less than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4178 <li><tt>sle</tt>: interprets the operands as signed values and yields
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4179 <tt>true</tt> if <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4180</ol>
4181<p>If the operands are <a href="#t_pointer">pointer</a> typed, the pointer
4182values are compared as if they were integers.</p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4183<p>If the operands are integer vectors, then they are compared
4184element by element. The result is an <tt>i1</tt> vector with
4185the same number of elements as the values being compared.
4186Otherwise, the result is an <tt>i1</tt>.
4187</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4188
4189<h5>Example:</h5>
4190<pre> &lt;result&gt; = icmp eq i32 4, 5 <i>; yields: result=false</i>
4191 &lt;result&gt; = icmp ne float* %X, %X <i>; yields: result=false</i>
4192 &lt;result&gt; = icmp ult i16 4, 5 <i>; yields: result=true</i>
4193 &lt;result&gt; = icmp sgt i16 4, 5 <i>; yields: result=false</i>
4194 &lt;result&gt; = icmp ule i16 -4, 5 <i>; yields: result=false</i>
4195 &lt;result&gt; = icmp sge i16 4, 5 <i>; yields: result=false</i>
4196</pre>
Dan Gohmana53eb382009-01-22 01:39:38 +0000[diff] [blame]4197
4198<p>Note that the code generator does not yet support vector types with
4199 the <tt>icmp</tt> instruction.</p>
4200
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4201</div>
4202
4203<!-- _______________________________________________________________________ -->
4204<div class="doc_subsubsection"><a name="i_fcmp">'<tt>fcmp</tt>' Instruction</a>
4205</div>
4206<div class="doc_text">
4207<h5>Syntax:</h5>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4208<pre> &lt;result&gt; = fcmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {i1} or {&lt;N x i1&gt;}:result</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4209</pre>
4210<h5>Overview:</h5>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4211<p>The '<tt>fcmp</tt>' instruction returns a boolean value
4212or vector of boolean values based on comparison
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4213of its operands.</p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4214<p>
4215If the operands are floating point scalars, then the result
4216type is a boolean (<a href="#t_primitive"><tt>i1</tt></a>).
4217</p>
4218<p>If the operands are floating point vectors, then the result type
4219is a vector of boolean with the same number of elements as the
4220operands being compared.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4221<h5>Arguments:</h5>
4222<p>The '<tt>fcmp</tt>' instruction takes three operands. The first operand is
4223the condition code indicating the kind of comparison to perform. It is not
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4224a value, just a keyword. The possible condition code are:</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4225<ol>
4226 <li><tt>false</tt>: no comparison, always returns false</li>
4227 <li><tt>oeq</tt>: ordered and equal</li>
4228 <li><tt>ogt</tt>: ordered and greater than </li>
4229 <li><tt>oge</tt>: ordered and greater than or equal</li>
4230 <li><tt>olt</tt>: ordered and less than </li>
4231 <li><tt>ole</tt>: ordered and less than or equal</li>
4232 <li><tt>one</tt>: ordered and not equal</li>
4233 <li><tt>ord</tt>: ordered (no nans)</li>
4234 <li><tt>ueq</tt>: unordered or equal</li>
4235 <li><tt>ugt</tt>: unordered or greater than </li>
4236 <li><tt>uge</tt>: unordered or greater than or equal</li>
4237 <li><tt>ult</tt>: unordered or less than </li>
4238 <li><tt>ule</tt>: unordered or less than or equal</li>
4239 <li><tt>une</tt>: unordered or not equal</li>
4240 <li><tt>uno</tt>: unordered (either nans)</li>
4241 <li><tt>true</tt>: no comparison, always returns true</li>
4242</ol>
4243<p><i>Ordered</i> means that neither operand is a QNAN while
4244<i>unordered</i> means that either operand may be a QNAN.</p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4245<p>Each of <tt>val1</tt> and <tt>val2</tt> arguments must be
4246either a <a href="#t_floating">floating point</a> type
4247or a <a href="#t_vector">vector</a> of floating point type.
4248They must have identical types.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4249<h5>Semantics:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4250<p>The '<tt>fcmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4251according to the condition code given as <tt>cond</tt>.
4252If the operands are vectors, then the vectors are compared
4253element by element.
4254Each comparison performed
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4255always yields an <a href="#t_primitive">i1</a> result, as follows:</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4256<ol>
4257 <li><tt>false</tt>: always yields <tt>false</tt>, regardless of operands.</li>
4258 <li><tt>oeq</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4259 <tt>op1</tt> is equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4260 <li><tt>ogt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4261 <tt>op1</tt> is greather than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4262 <li><tt>oge</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4263 <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4264 <li><tt>olt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4265 <tt>op1</tt> is less than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4266 <li><tt>ole</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4267 <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4268 <li><tt>one</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4269 <tt>op1</tt> is not equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4270 <li><tt>ord</tt>: yields <tt>true</tt> if both operands are not a QNAN.</li>
4271 <li><tt>ueq</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4272 <tt>op1</tt> is equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4273 <li><tt>ugt</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4274 <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4275 <li><tt>uge</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4276 <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4277 <li><tt>ult</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4278 <tt>op1</tt> is less than <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4279 <li><tt>ule</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4280 <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4281 <li><tt>une</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4282 <tt>op1</tt> is not equal to <tt>op2</tt>.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4283 <li><tt>uno</tt>: yields <tt>true</tt> if either operand is a QNAN.</li>
4284 <li><tt>true</tt>: always yields <tt>true</tt>, regardless of operands.</li>
4285</ol>
4286
4287<h5>Example:</h5>
4288<pre> &lt;result&gt; = fcmp oeq float 4.0, 5.0 <i>; yields: result=false</i>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4289 &lt;result&gt; = fcmp one float 4.0, 5.0 <i>; yields: result=true</i>
4290 &lt;result&gt; = fcmp olt float 4.0, 5.0 <i>; yields: result=true</i>
4291 &lt;result&gt; = fcmp ueq double 1.0, 2.0 <i>; yields: result=false</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4292</pre>
Dan Gohmana53eb382009-01-22 01:39:38 +0000[diff] [blame]4293
4294<p>Note that the code generator does not yet support vector types with
4295 the <tt>fcmp</tt> instruction.</p>
4296
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4297</div>
4298
4299<!-- _______________________________________________________________________ -->
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4300<div class="doc_subsubsection">
4301 <a name="i_vicmp">'<tt>vicmp</tt>' Instruction</a>
4302</div>
4303<div class="doc_text">
4304<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4305<pre> &lt;result&gt; = vicmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4306</pre>
4307<h5>Overview:</h5>
4308<p>The '<tt>vicmp</tt>' instruction returns an integer vector value based on
4309element-wise comparison of its two integer vector operands.</p>
4310<h5>Arguments:</h5>
4311<p>The '<tt>vicmp</tt>' instruction takes three operands. The first operand is
4312the condition code indicating the kind of comparison to perform. It is not
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4313a value, just a keyword. The possible condition code are:</p>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4314<ol>
4315 <li><tt>eq</tt>: equal</li>
4316 <li><tt>ne</tt>: not equal </li>
4317 <li><tt>ugt</tt>: unsigned greater than</li>
4318 <li><tt>uge</tt>: unsigned greater or equal</li>
4319 <li><tt>ult</tt>: unsigned less than</li>
4320 <li><tt>ule</tt>: unsigned less or equal</li>
4321 <li><tt>sgt</tt>: signed greater than</li>
4322 <li><tt>sge</tt>: signed greater or equal</li>
4323 <li><tt>slt</tt>: signed less than</li>
4324 <li><tt>sle</tt>: signed less or equal</li>
4325</ol>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4326<p>The remaining two arguments must be <a href="#t_vector">vector</a> or
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4327<a href="#t_integer">integer</a> typed. They must also be identical types.</p>
4328<h5>Semantics:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4329<p>The '<tt>vicmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4330according to the condition code given as <tt>cond</tt>. The comparison yields a
4331<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, of
4332identical type as the values being compared. The most significant bit in each
4333element is 1 if the element-wise comparison evaluates to true, and is 0
4334otherwise. All other bits of the result are undefined. The condition codes
4335are evaluated identically to the <a href="#i_icmp">'<tt>icmp</tt>'
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4336instruction</a>.</p>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4337
4338<h5>Example:</h5>
4339<pre>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4340 &lt;result&gt; = vicmp eq &lt;2 x i32&gt; &lt; i32 4, i32 0&gt;, &lt; i32 5, i32 0&gt; <i>; yields: result=&lt;2 x i32&gt; &lt; i32 0, i32 -1 &gt;</i>
4341 &lt;result&gt; = vicmp ult &lt;2 x i8 &gt; &lt; i8 1, i8 2&gt;, &lt; i8 2, i8 2 &gt; <i>; yields: result=&lt;2 x i8&gt; &lt; i8 -1, i8 0 &gt;</i>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4342</pre>
4343</div>
4344
4345<!-- _______________________________________________________________________ -->
4346<div class="doc_subsubsection">
4347 <a name="i_vfcmp">'<tt>vfcmp</tt>' Instruction</a>
4348</div>
4349<div class="doc_text">
4350<h5>Syntax:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4351<pre> &lt;result&gt; = vfcmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt;</pre>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4352<h5>Overview:</h5>
4353<p>The '<tt>vfcmp</tt>' instruction returns an integer vector value based on
4354element-wise comparison of its two floating point vector operands. The output
4355elements have the same width as the input elements.</p>
4356<h5>Arguments:</h5>
4357<p>The '<tt>vfcmp</tt>' instruction takes three operands. The first operand is
4358the condition code indicating the kind of comparison to perform. It is not
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4359a value, just a keyword. The possible condition code are:</p>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4360<ol>
4361 <li><tt>false</tt>: no comparison, always returns false</li>
4362 <li><tt>oeq</tt>: ordered and equal</li>
4363 <li><tt>ogt</tt>: ordered and greater than </li>
4364 <li><tt>oge</tt>: ordered and greater than or equal</li>
4365 <li><tt>olt</tt>: ordered and less than </li>
4366 <li><tt>ole</tt>: ordered and less than or equal</li>
4367 <li><tt>one</tt>: ordered and not equal</li>
4368 <li><tt>ord</tt>: ordered (no nans)</li>
4369 <li><tt>ueq</tt>: unordered or equal</li>
4370 <li><tt>ugt</tt>: unordered or greater than </li>
4371 <li><tt>uge</tt>: unordered or greater than or equal</li>
4372 <li><tt>ult</tt>: unordered or less than </li>
4373 <li><tt>ule</tt>: unordered or less than or equal</li>
4374 <li><tt>une</tt>: unordered or not equal</li>
4375 <li><tt>uno</tt>: unordered (either nans)</li>
4376 <li><tt>true</tt>: no comparison, always returns true</li>
4377</ol>
4378<p>The remaining two arguments must be <a href="#t_vector">vector</a> of
4379<a href="#t_floating">floating point</a> typed. They must also be identical
4380types.</p>
4381<h5>Semantics:</h5>
Gabor Greifd9068fe2008-08-07 21:46:00 +0000[diff] [blame]4382<p>The '<tt>vfcmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4383according to the condition code given as <tt>cond</tt>. The comparison yields a
4384<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, with
4385an identical number of elements as the values being compared, and each element
4386having identical with to the width of the floating point elements. The most
4387significant bit in each element is 1 if the element-wise comparison evaluates to
4388true, and is 0 otherwise. All other bits of the result are undefined. The
4389condition codes are evaluated identically to the
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4390<a href="#i_fcmp">'<tt>fcmp</tt>' instruction</a>.</p>
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4391
4392<h5>Example:</h5>
4393<pre>
Chris Lattner1e5c5cd02008-10-13 16:55:18 +0000[diff] [blame]4394 <i>; yields: result=&lt;2 x i32&gt; &lt; i32 0, i32 -1 &gt;</i>
4395 &lt;result&gt; = vfcmp oeq &lt;2 x float&gt; &lt; float 4, float 0 &gt;, &lt; float 5, float 0 &gt;
4396
4397 <i>; yields: result=&lt;2 x i64&gt; &lt; i64 -1, i64 0 &gt;</i>
4398 &lt;result&gt; = vfcmp ult &lt;2 x double&gt; &lt; double 1, double 2 &gt;, &lt; double 2, double 2&gt;
Nate Begeman646fa482008-05-12 19:01:56 +0000[diff] [blame]4399</pre>
4400</div>
4401
4402<!-- _______________________________________________________________________ -->
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4403<div class="doc_subsubsection">
4404 <a name="i_phi">'<tt>phi</tt>' Instruction</a>
4405</div>
4406
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4407<div class="doc_text">
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4408
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4409<h5>Syntax:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4410
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4411<pre> &lt;result&gt; = phi &lt;ty&gt; [ &lt;val0&gt;, &lt;label0&gt;], ...<br></pre>
4412<h5>Overview:</h5>
4413<p>The '<tt>phi</tt>' instruction is used to implement the &#966; node in
4414the SSA graph representing the function.</p>
4415<h5>Arguments:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4416
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4417<p>The type of the incoming values is specified with the first type
4418field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
4419as arguments, with one pair for each predecessor basic block of the
4420current block. Only values of <a href="#t_firstclass">first class</a>
4421type may be used as the value arguments to the PHI node. Only labels
4422may be used as the label arguments.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4423
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4424<p>There must be no non-phi instructions between the start of a basic
4425block and the PHI instructions: i.e. PHI instructions must be first in
4426a basic block.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4427
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4428<h5>Semantics:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4429
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4430<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the value
4431specified by the pair corresponding to the predecessor basic block that executed
4432just prior to the current block.</p>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4433
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4434<h5>Example:</h5>
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4435<pre>
4436Loop: ; Infinite loop that counts from 0 on up...
4437 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
4438 %nextindvar = add i32 %indvar, 1
4439 br label %Loop
4440</pre>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4441</div>
4442
4443<!-- _______________________________________________________________________ -->
4444<div class="doc_subsubsection">
4445 <a name="i_select">'<tt>select</tt>' Instruction</a>
4446</div>
4447
4448<div class="doc_text">
4449
4450<h5>Syntax:</h5>
4451
4452<pre>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4453 &lt;result&gt; = select <i>selty</i> &lt;cond&gt;, &lt;ty&gt; &lt;val1&gt;, &lt;ty&gt; &lt;val2&gt; <i>; yields ty</i>
4454
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4455 <i>selty</i> is either i1 or {&lt;N x i1&gt;}
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4456</pre>
4457
4458<h5>Overview:</h5>
4459
4460<p>
4461The '<tt>select</tt>' instruction is used to choose one value based on a
4462condition, without branching.
4463</p>
4464
4465
4466<h5>Arguments:</h5>
4467
4468<p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4469The '<tt>select</tt>' instruction requires an 'i1' value or
4470a vector of 'i1' values indicating the
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4471condition, and two values of the same <a href="#t_firstclass">first class</a>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4472type. If the val1/val2 are vectors and
4473the condition is a scalar, then entire vectors are selected, not
Chris Lattner6704c212008-05-20 20:48:21 +0000[diff] [blame]4474individual elements.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4475</p>
4476
4477<h5>Semantics:</h5>
4478
4479<p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4480If the condition is an i1 and it evaluates to 1, the instruction returns the first
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4481value argument; otherwise, it returns the second value argument.
4482</p>
Dan Gohmanb60ca3c2008-09-09 01:02:47 +0000[diff] [blame]4483<p>
4484If the condition is a vector of i1, then the value arguments must
4485be vectors of the same size, and the selection is done element
4486by element.
4487</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4488
4489<h5>Example:</h5>
4490
4491<pre>
4492 %X = select i1 true, i8 17, i8 42 <i>; yields i8:17</i>
4493</pre>
Dan Gohmana53eb382009-01-22 01:39:38 +0000[diff] [blame]4494
4495<p>Note that the code generator does not yet support conditions
4496 with vector type.</p>
4497
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4498</div>
4499
4500
4501<!-- _______________________________________________________________________ -->
4502<div class="doc_subsubsection">
4503 <a name="i_call">'<tt>call</tt>' Instruction</a>
4504</div>
4505
4506<div class="doc_text">
4507
4508<h5>Syntax:</h5>
4509<pre>
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]4510 &lt;result&gt; = [tail] call [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>] &lt;ty&gt; [&lt;fnty&gt;*] &lt;fnptrval&gt;(&lt;function args&gt;) [<a href="#fnattrs">fn attrs</a>]
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4511</pre>
4512
4513<h5>Overview:</h5>
4514
4515<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
4516
4517<h5>Arguments:</h5>
4518
4519<p>This instruction requires several arguments:</p>
4520
4521<ol>
4522 <li>
4523 <p>The optional "tail" marker indicates whether the callee function accesses
4524 any allocas or varargs in the caller. If the "tail" marker is present, the
4525 function call is eligible for tail call optimization. Note that calls may
4526 be marked "tail" even if they do not occur before a <a
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4527 href="#i_ret"><tt>ret</tt></a> instruction.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4528 </li>
4529 <li>
4530 <p>The optional "cconv" marker indicates which <a href="#callingconv">calling
4531 convention</a> the call should use. If none is specified, the call defaults
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4532 to using C calling conventions.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4533 </li>
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]4534
4535 <li>
4536 <p>The optional <a href="#paramattrs">Parameter Attributes</a> list for
4537 return values. Only '<tt>zeroext</tt>', '<tt>signext</tt>',
4538 and '<tt>inreg</tt>' attributes are valid here.</p>
4539 </li>
4540
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4541 <li>
Nick Lewycky93082fc2007-09-08 13:57:50 +0000[diff] [blame]4542 <p>'<tt>ty</tt>': the type of the call instruction itself which is also
4543 the type of the return value. Functions that return no value are marked
4544 <tt><a href="#t_void">void</a></tt>.</p>
4545 </li>
4546 <li>
4547 <p>'<tt>fnty</tt>': shall be the signature of the pointer to function
4548 value being invoked. The argument types must match the types implied by
4549 this signature. This type can be omitted if the function is not varargs
4550 and if the function type does not return a pointer to a function.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4551 </li>
4552 <li>
4553 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
4554 be invoked. In most cases, this is a direct function invocation, but
4555 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
4556 to function value.</p>
4557 </li>
4558 <li>
4559 <p>'<tt>function args</tt>': argument list whose types match the
4560 function signature argument types. All arguments must be of
4561 <a href="#t_firstclass">first class</a> type. If the function signature
4562 indicates the function accepts a variable number of arguments, the extra
4563 arguments can be specified.</p>
4564 </li>
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]4565 <li>
Devang Pateld0bfcc72008-10-07 17:48:33 +0000[diff] [blame]4566 <p>The optional <a href="#fnattrs">function attributes</a> list. Only
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]4567 '<tt>noreturn</tt>', '<tt>nounwind</tt>', '<tt>readonly</tt>' and
4568 '<tt>readnone</tt>' attributes are valid here.</p>
4569 </li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4570</ol>
4571
4572<h5>Semantics:</h5>
4573
4574<p>The '<tt>call</tt>' instruction is used to cause control flow to
4575transfer to a specified function, with its incoming arguments bound to
4576the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
4577instruction in the called function, control flow continues with the
4578instruction after the function call, and the return value of the
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4579function is bound to the result argument.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4580
4581<h5>Example:</h5>
4582
4583<pre>
Nick Lewycky93082fc2007-09-08 13:57:50 +0000[diff] [blame]4584 %retval = call i32 @test(i32 %argc)
Chris Lattner5e893ef2008-03-21 17:24:17 +0000[diff] [blame]4585 call i32 (i8 *, ...)* @printf(i8 * %msg, i32 12, i8 42) <i>; yields i32</i>
4586 %X = tail call i32 @foo() <i>; yields i32</i>
4587 %Y = tail call <a href="#callingconv">fastcc</a> i32 @foo() <i>; yields i32</i>
4588 call void %foo(i8 97 signext)
Devang Patela3cc5372008-03-10 20:49:15 +0000[diff] [blame]4589
4590 %struct.A = type { i32, i8 }
Devang Patelac2fc272008-10-06 18:50:38 +0000[diff] [blame]4591 %r = call %struct.A @foo() <i>; yields { 32, i8 }</i>
Dan Gohman3e700032008-10-04 19:00:07 +0000[diff] [blame]4592 %gr = extractvalue %struct.A %r, 0 <i>; yields i32</i>
4593 %gr1 = extractvalue %struct.A %r, 1 <i>; yields i8</i>
Chris Lattnerac454b32008-10-08 06:26:11 +0000[diff] [blame]4594 %Z = call void @foo() noreturn <i>; indicates that %foo never returns normally</i>
Matthijs Kooijman2c4e05a2008-10-07 10:03:45 +0000[diff] [blame]4595 %ZZ = call zeroext i32 @bar() <i>; Return value is %zero extended</i>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4596</pre>
4597
4598</div>
4599
4600<!-- _______________________________________________________________________ -->
4601<div class="doc_subsubsection">
4602 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
4603</div>
4604
4605<div class="doc_text">
4606
4607<h5>Syntax:</h5>
4608
4609<pre>
4610 &lt;resultval&gt; = va_arg &lt;va_list*&gt; &lt;arglist&gt;, &lt;argty&gt;
4611</pre>
4612
4613<h5>Overview:</h5>
4614
4615<p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
4616the "variable argument" area of a function call. It is used to implement the
4617<tt>va_arg</tt> macro in C.</p>
4618
4619<h5>Arguments:</h5>
4620
4621<p>This instruction takes a <tt>va_list*</tt> value and the type of
4622the argument. It returns a value of the specified argument type and
4623increments the <tt>va_list</tt> to point to the next argument. The
4624actual type of <tt>va_list</tt> is target specific.</p>
4625
4626<h5>Semantics:</h5>
4627
4628<p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
4629type from the specified <tt>va_list</tt> and causes the
4630<tt>va_list</tt> to point to the next argument. For more information,
4631see the variable argument handling <a href="#int_varargs">Intrinsic
4632Functions</a>.</p>
4633
4634<p>It is legal for this instruction to be called in a function which does not
4635take a variable number of arguments, for example, the <tt>vfprintf</tt>
4636function.</p>
4637
4638<p><tt>va_arg</tt> is an LLVM instruction instead of an <a
4639href="#intrinsics">intrinsic function</a> because it takes a type as an
4640argument.</p>
4641
4642<h5>Example:</h5>
4643
4644<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
4645
Dan Gohman60967192009-01-12 23:12:39 +0000[diff] [blame]4646<p>Note that the code generator does not yet fully support va_arg
4647 on many targets. Also, it does not currently support va_arg with
4648 aggregate types on any target.</p>
4649
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4650</div>
4651
4652<!-- *********************************************************************** -->
4653<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
4654<!-- *********************************************************************** -->
4655
4656<div class="doc_text">
4657
4658<p>LLVM supports the notion of an "intrinsic function". These functions have
4659well known names and semantics and are required to follow certain restrictions.
4660Overall, these intrinsics represent an extension mechanism for the LLVM
4661language that does not require changing all of the transformations in LLVM when
4662adding to the language (or the bitcode reader/writer, the parser, etc...).</p>
4663
4664<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
4665prefix is reserved in LLVM for intrinsic names; thus, function names may not
4666begin with this prefix. Intrinsic functions must always be external functions:
4667you cannot define the body of intrinsic functions. Intrinsic functions may
4668only be used in call or invoke instructions: it is illegal to take the address
4669of an intrinsic function. Additionally, because intrinsic functions are part
4670of the LLVM language, it is required if any are added that they be documented
4671here.</p>
4672
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]4673<p>Some intrinsic functions can be overloaded, i.e., the intrinsic represents
4674a family of functions that perform the same operation but on different data
4675types. Because LLVM can represent over 8 million different integer types,
4676overloading is used commonly to allow an intrinsic function to operate on any
4677integer type. One or more of the argument types or the result type can be
4678overloaded to accept any integer type. Argument types may also be defined as
4679exactly matching a previous argument's type or the result type. This allows an
4680intrinsic function which accepts multiple arguments, but needs all of them to
4681be of the same type, to only be overloaded with respect to a single argument or
4682the result.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4683
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]4684<p>Overloaded intrinsics will have the names of its overloaded argument types
4685encoded into its function name, each preceded by a period. Only those types
4686which are overloaded result in a name suffix. Arguments whose type is matched
4687against another type do not. For example, the <tt>llvm.ctpop</tt> function can
4688take an integer of any width and returns an integer of exactly the same integer
4689width. This leads to a family of functions such as
4690<tt>i8 @llvm.ctpop.i8(i8 %val)</tt> and <tt>i29 @llvm.ctpop.i29(i29 %val)</tt>.
4691Only one type, the return type, is overloaded, and only one type suffix is
4692required. Because the argument's type is matched against the return type, it
4693does not require its own name suffix.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4694
4695<p>To learn how to add an intrinsic function, please see the
4696<a href="ExtendingLLVM.html">Extending LLVM Guide</a>.
4697</p>
4698
4699</div>
4700
4701<!-- ======================================================================= -->
4702<div class="doc_subsection">
4703 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
4704</div>
4705
4706<div class="doc_text">
4707
4708<p>Variable argument support is defined in LLVM with the <a
4709 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
4710intrinsic functions. These functions are related to the similarly
4711named macros defined in the <tt>&lt;stdarg.h&gt;</tt> header file.</p>
4712
4713<p>All of these functions operate on arguments that use a
4714target-specific value type "<tt>va_list</tt>". The LLVM assembly
4715language reference manual does not define what this type is, so all
4716transformations should be prepared to handle these functions regardless of
4717the type used.</p>
4718
4719<p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
4720instruction and the variable argument handling intrinsic functions are
4721used.</p>
4722
4723<div class="doc_code">
4724<pre>
4725define i32 @test(i32 %X, ...) {
4726 ; Initialize variable argument processing
4727 %ap = alloca i8*
4728 %ap2 = bitcast i8** %ap to i8*
4729 call void @llvm.va_start(i8* %ap2)
4730
4731 ; Read a single integer argument
4732 %tmp = va_arg i8** %ap, i32
4733
4734 ; Demonstrate usage of llvm.va_copy and llvm.va_end
4735 %aq = alloca i8*
4736 %aq2 = bitcast i8** %aq to i8*
4737 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
4738 call void @llvm.va_end(i8* %aq2)
4739
4740 ; Stop processing of arguments.
4741 call void @llvm.va_end(i8* %ap2)
4742 ret i32 %tmp
4743}
4744
4745declare void @llvm.va_start(i8*)
4746declare void @llvm.va_copy(i8*, i8*)
4747declare void @llvm.va_end(i8*)
4748</pre>
4749</div>
4750
4751</div>
4752
4753<!-- _______________________________________________________________________ -->
4754<div class="doc_subsubsection">
4755 <a name="int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
4756</div>
4757
4758
4759<div class="doc_text">
4760<h5>Syntax:</h5>
4761<pre> declare void %llvm.va_start(i8* &lt;arglist&gt;)<br></pre>
4762<h5>Overview:</h5>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4763<p>The '<tt>llvm.va_start</tt>' intrinsic initializes
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4764<tt>*&lt;arglist&gt;</tt> for subsequent use by <tt><a
4765href="#i_va_arg">va_arg</a></tt>.</p>
4766
4767<h5>Arguments:</h5>
4768
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4769<p>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4770
4771<h5>Semantics:</h5>
4772
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]4773<p>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4774macro available in C. In a target-dependent way, it initializes the
4775<tt>va_list</tt> element to which the argument points, so that the next call to
4776<tt>va_arg</tt> will produce the first variable argument passed to the function.
4777Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
4778last argument of the function as the compiler can figure that out.</p>
4779
4780</div>
4781
4782<!-- _______________________________________________________________________ -->
4783<div class="doc_subsubsection">
4784 <a name="int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
4785</div>
4786
4787<div class="doc_text">
4788<h5>Syntax:</h5>
4789<pre> declare void @llvm.va_end(i8* &lt;arglist&gt;)<br></pre>
4790<h5>Overview:</h5>
4791
4792<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt>*&lt;arglist&gt;</tt>,
4793which has been initialized previously with <tt><a href="#int_va_start">llvm.va_start</a></tt>
4794or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
4795
4796<h5>Arguments:</h5>
4797
4798<p>The argument is a pointer to a <tt>va_list</tt> to destroy.</p>
4799
4800<h5>Semantics:</h5>
4801
4802<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
4803macro available in C. In a target-dependent way, it destroys the
4804<tt>va_list</tt> element to which the argument points. Calls to <a
4805href="#int_va_start"><tt>llvm.va_start</tt></a> and <a href="#int_va_copy">
4806<tt>llvm.va_copy</tt></a> must be matched exactly with calls to
4807<tt>llvm.va_end</tt>.</p>
4808
4809</div>
4810
4811<!-- _______________________________________________________________________ -->
4812<div class="doc_subsubsection">
4813 <a name="int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
4814</div>
4815
4816<div class="doc_text">
4817
4818<h5>Syntax:</h5>
4819
4820<pre>
4821 declare void @llvm.va_copy(i8* &lt;destarglist&gt;, i8* &lt;srcarglist&gt;)
4822</pre>
4823
4824<h5>Overview:</h5>
4825
4826<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position
4827from the source argument list to the destination argument list.</p>
4828
4829<h5>Arguments:</h5>
4830
4831<p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
4832The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
4833
4834
4835<h5>Semantics:</h5>
4836
4837<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt>
4838macro available in C. In a target-dependent way, it copies the source
4839<tt>va_list</tt> element into the destination <tt>va_list</tt> element. This
4840intrinsic is necessary because the <tt><a href="#int_va_start">
4841llvm.va_start</a></tt> intrinsic may be arbitrarily complex and require, for
4842example, memory allocation.</p>
4843
4844</div>
4845
4846<!-- ======================================================================= -->
4847<div class="doc_subsection">
4848 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
4849</div>
4850
4851<div class="doc_text">
4852
4853<p>
4854LLVM support for <a href="GarbageCollection.html">Accurate Garbage
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]4855Collection</a> (GC) requires the implementation and generation of these
4856intrinsics.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4857These intrinsics allow identification of <a href="#int_gcroot">GC roots on the
4858stack</a>, as well as garbage collector implementations that require <a
4859href="#int_gcread">read</a> and <a href="#int_gcwrite">write</a> barriers.
4860Front-ends for type-safe garbage collected languages should generate these
4861intrinsics to make use of the LLVM garbage collectors. For more details, see <a
4862href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
4863</p>
Christopher Lambcfe00962007-12-17 01:00:21 +0000[diff] [blame]4864
4865<p>The garbage collection intrinsics only operate on objects in the generic
4866 address space (address space zero).</p>
4867
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4868</div>
4869
4870<!-- _______________________________________________________________________ -->
4871<div class="doc_subsubsection">
4872 <a name="int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
4873</div>
4874
4875<div class="doc_text">
4876
4877<h5>Syntax:</h5>
4878
4879<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]4880 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4881</pre>
4882
4883<h5>Overview:</h5>
4884
4885<p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
4886the code generator, and allows some metadata to be associated with it.</p>
4887
4888<h5>Arguments:</h5>
4889
4890<p>The first argument specifies the address of a stack object that contains the
4891root pointer. The second pointer (which must be either a constant or a global
4892value address) contains the meta-data to be associated with the root.</p>
4893
4894<h5>Semantics:</h5>
4895
Chris Lattnera7d94ba2008-04-24 05:59:56 +0000[diff] [blame]4896<p>At runtime, a call to this intrinsic stores a null pointer into the "ptrloc"
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4897location. At compile-time, the code generator generates information to allow
Gordon Henriksen40393542007-12-25 02:31:26 +0000[diff] [blame]4898the runtime to find the pointer at GC safe points. The '<tt>llvm.gcroot</tt>'
4899intrinsic may only be used in a function which <a href="#gc">specifies a GC
4900algorithm</a>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4901
4902</div>
4903
4904
4905<!-- _______________________________________________________________________ -->
4906<div class="doc_subsubsection">
4907 <a name="int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
4908</div>
4909
4910<div class="doc_text">
4911
4912<h5>Syntax:</h5>
4913
4914<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]4915 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4916</pre>
4917
4918<h5>Overview:</h5>
4919
4920<p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
4921locations, allowing garbage collector implementations that require read
4922barriers.</p>
4923
4924<h5>Arguments:</h5>
4925
4926<p>The second argument is the address to read from, which should be an address
4927allocated from the garbage collector. The first object is a pointer to the
4928start of the referenced object, if needed by the language runtime (otherwise
4929null).</p>
4930
4931<h5>Semantics:</h5>
4932
4933<p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
4934instruction, but may be replaced with substantially more complex code by the
Gordon Henriksen40393542007-12-25 02:31:26 +0000[diff] [blame]4935garbage collector runtime, as needed. The '<tt>llvm.gcread</tt>' intrinsic
4936may only be used in a function which <a href="#gc">specifies a GC
4937algorithm</a>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4938
4939</div>
4940
4941
4942<!-- _______________________________________________________________________ -->
4943<div class="doc_subsubsection">
4944 <a name="int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
4945</div>
4946
4947<div class="doc_text">
4948
4949<h5>Syntax:</h5>
4950
4951<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]4952 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4953</pre>
4954
4955<h5>Overview:</h5>
4956
4957<p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
4958locations, allowing garbage collector implementations that require write
4959barriers (such as generational or reference counting collectors).</p>
4960
4961<h5>Arguments:</h5>
4962
4963<p>The first argument is the reference to store, the second is the start of the
4964object to store it to, and the third is the address of the field of Obj to
4965store to. If the runtime does not require a pointer to the object, Obj may be
4966null.</p>
4967
4968<h5>Semantics:</h5>
4969
4970<p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
4971instruction, but may be replaced with substantially more complex code by the
Gordon Henriksen40393542007-12-25 02:31:26 +0000[diff] [blame]4972garbage collector runtime, as needed. The '<tt>llvm.gcwrite</tt>' intrinsic
4973may only be used in a function which <a href="#gc">specifies a GC
4974algorithm</a>.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]4975
4976</div>
4977
4978
4979
4980<!-- ======================================================================= -->
4981<div class="doc_subsection">
4982 <a name="int_codegen">Code Generator Intrinsics</a>
4983</div>
4984
4985<div class="doc_text">
4986<p>
4987These intrinsics are provided by LLVM to expose special features that may only
4988be implemented with code generator support.
4989</p>
4990
4991</div>
4992
4993<!-- _______________________________________________________________________ -->
4994<div class="doc_subsubsection">
4995 <a name="int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
4996</div>
4997
4998<div class="doc_text">
4999
5000<h5>Syntax:</h5>
5001<pre>
5002 declare i8 *@llvm.returnaddress(i32 &lt;level&gt;)
5003</pre>
5004
5005<h5>Overview:</h5>
5006
5007<p>
5008The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
5009target-specific value indicating the return address of the current function
5010or one of its callers.
5011</p>
5012
5013<h5>Arguments:</h5>
5014
5015<p>
5016The argument to this intrinsic indicates which function to return the address
5017for. Zero indicates the calling function, one indicates its caller, etc. The
5018argument is <b>required</b> to be a constant integer value.
5019</p>
5020
5021<h5>Semantics:</h5>
5022
5023<p>
5024The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
5025the return address of the specified call frame, or zero if it cannot be
5026identified. The value returned by this intrinsic is likely to be incorrect or 0
5027for arguments other than zero, so it should only be used for debugging purposes.
5028</p>
5029
5030<p>
5031Note that calling this intrinsic does not prevent function inlining or other
5032aggressive transformations, so the value returned may not be that of the obvious
5033source-language caller.
5034</p>
5035</div>
5036
5037
5038<!-- _______________________________________________________________________ -->
5039<div class="doc_subsubsection">
5040 <a name="int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
5041</div>
5042
5043<div class="doc_text">
5044
5045<h5>Syntax:</h5>
5046<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]5047 declare i8 *@llvm.frameaddress(i32 &lt;level&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5048</pre>
5049
5050<h5>Overview:</h5>
5051
5052<p>
5053The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
5054target-specific frame pointer value for the specified stack frame.
5055</p>
5056
5057<h5>Arguments:</h5>
5058
5059<p>
5060The argument to this intrinsic indicates which function to return the frame
5061pointer for. Zero indicates the calling function, one indicates its caller,
5062etc. The argument is <b>required</b> to be a constant integer value.
5063</p>
5064
5065<h5>Semantics:</h5>
5066
5067<p>
5068The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
5069the frame address of the specified call frame, or zero if it cannot be
5070identified. The value returned by this intrinsic is likely to be incorrect or 0
5071for arguments other than zero, so it should only be used for debugging purposes.
5072</p>
5073
5074<p>
5075Note that calling this intrinsic does not prevent function inlining or other
5076aggressive transformations, so the value returned may not be that of the obvious
5077source-language caller.
5078</p>
5079</div>
5080
5081<!-- _______________________________________________________________________ -->
5082<div class="doc_subsubsection">
5083 <a name="int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
5084</div>
5085
5086<div class="doc_text">
5087
5088<h5>Syntax:</h5>
5089<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]5090 declare i8 *@llvm.stacksave()
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5091</pre>
5092
5093<h5>Overview:</h5>
5094
5095<p>
5096The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
5097the function stack, for use with <a href="#int_stackrestore">
5098<tt>llvm.stackrestore</tt></a>. This is useful for implementing language
5099features like scoped automatic variable sized arrays in C99.
5100</p>
5101
5102<h5>Semantics:</h5>
5103
5104<p>
5105This intrinsic returns a opaque pointer value that can be passed to <a
5106href="#int_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
5107<tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
5108<tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
5109state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
5110practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
5111that were allocated after the <tt>llvm.stacksave</tt> was executed.
5112</p>
5113
5114</div>
5115
5116<!-- _______________________________________________________________________ -->
5117<div class="doc_subsubsection">
5118 <a name="int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
5119</div>
5120
5121<div class="doc_text">
5122
5123<h5>Syntax:</h5>
5124<pre>
5125 declare void @llvm.stackrestore(i8 * %ptr)
5126</pre>
5127
5128<h5>Overview:</h5>
5129
5130<p>
5131The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
5132the function stack to the state it was in when the corresponding <a
5133href="#int_stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
5134useful for implementing language features like scoped automatic variable sized
5135arrays in C99.
5136</p>
5137
5138<h5>Semantics:</h5>
5139
5140<p>
5141See the description for <a href="#int_stacksave"><tt>llvm.stacksave</tt></a>.
5142</p>
5143
5144</div>
5145
5146
5147<!-- _______________________________________________________________________ -->
5148<div class="doc_subsubsection">
5149 <a name="int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
5150</div>
5151
5152<div class="doc_text">
5153
5154<h5>Syntax:</h5>
5155<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]5156 declare void @llvm.prefetch(i8* &lt;address&gt;, i32 &lt;rw&gt;, i32 &lt;locality&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5157</pre>
5158
5159<h5>Overview:</h5>
5160
5161
5162<p>
5163The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
5164a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
5165no
5166effect on the behavior of the program but can change its performance
5167characteristics.
5168</p>
5169
5170<h5>Arguments:</h5>
5171
5172<p>
5173<tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
5174determining if the fetch should be for a read (0) or write (1), and
5175<tt>locality</tt> is a temporal locality specifier ranging from (0) - no
5176locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
5177<tt>locality</tt> arguments must be constant integers.
5178</p>
5179
5180<h5>Semantics:</h5>
5181
5182<p>
5183This intrinsic does not modify the behavior of the program. In particular,
5184prefetches cannot trap and do not produce a value. On targets that support this
5185intrinsic, the prefetch can provide hints to the processor cache for better
5186performance.
5187</p>
5188
5189</div>
5190
5191<!-- _______________________________________________________________________ -->
5192<div class="doc_subsubsection">
5193 <a name="int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
5194</div>
5195
5196<div class="doc_text">
5197
5198<h5>Syntax:</h5>
5199<pre>
Chris Lattner38bd5dd2007-09-21 17:30:40 +0000[diff] [blame]5200 declare void @llvm.pcmarker(i32 &lt;id&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5201</pre>
5202
5203<h5>Overview:</h5>
5204
5205
5206<p>
5207The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]5208(PC) in a region of
5209code to simulators and other tools. The method is target specific, but it is
5210expected that the marker will use exported symbols to transmit the PC of the
5211marker.
5212The marker makes no guarantees that it will remain with any specific instruction
5213after optimizations. It is possible that the presence of a marker will inhibit
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5214optimizations. The intended use is to be inserted after optimizations to allow
5215correlations of simulation runs.
5216</p>
5217
5218<h5>Arguments:</h5>
5219
5220<p>
5221<tt>id</tt> is a numerical id identifying the marker.
5222</p>
5223
5224<h5>Semantics:</h5>
5225
5226<p>
5227This intrinsic does not modify the behavior of the program. Backends that do not
5228support this intrinisic may ignore it.
5229</p>
5230
5231</div>
5232
5233<!-- _______________________________________________________________________ -->
5234<div class="doc_subsubsection">
5235 <a name="int_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
5236</div>
5237
5238<div class="doc_text">
5239
5240<h5>Syntax:</h5>
5241<pre>
5242 declare i64 @llvm.readcyclecounter( )
5243</pre>
5244
5245<h5>Overview:</h5>
5246
5247
5248<p>
5249The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
5250counter register (or similar low latency, high accuracy clocks) on those targets
5251that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
5252As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
5253should only be used for small timings.
5254</p>
5255
5256<h5>Semantics:</h5>
5257
5258<p>
5259When directly supported, reading the cycle counter should not modify any memory.
5260Implementations are allowed to either return a application specific value or a
5261system wide value. On backends without support, this is lowered to a constant 0.
5262</p>
5263
5264</div>
5265
5266<!-- ======================================================================= -->
5267<div class="doc_subsection">
5268 <a name="int_libc">Standard C Library Intrinsics</a>
5269</div>
5270
5271<div class="doc_text">
5272<p>
5273LLVM provides intrinsics for a few important standard C library functions.
5274These intrinsics allow source-language front-ends to pass information about the
5275alignment of the pointer arguments to the code generator, providing opportunity
5276for more efficient code generation.
5277</p>
5278
5279</div>
5280
5281<!-- _______________________________________________________________________ -->
5282<div class="doc_subsubsection">
5283 <a name="int_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
5284</div>
5285
5286<div class="doc_text">
5287
5288<h5>Syntax:</h5>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5289<p>This is an overloaded intrinsic. You can use llvm.memcpy on any integer bit
5290width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5291<pre>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5292 declare void @llvm.memcpy.i8(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5293 i8 &lt;len&gt;, i32 &lt;align&gt;)
5294 declare void @llvm.memcpy.i16(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5295 i16 &lt;len&gt;, i32 &lt;align&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5296 declare void @llvm.memcpy.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5297 i32 &lt;len&gt;, i32 &lt;align&gt;)
5298 declare void @llvm.memcpy.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5299 i64 &lt;len&gt;, i32 &lt;align&gt;)
5300</pre>
5301
5302<h5>Overview:</h5>
5303
5304<p>
5305The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
5306location to the destination location.
5307</p>
5308
5309<p>
5310Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
5311intrinsics do not return a value, and takes an extra alignment argument.
5312</p>
5313
5314<h5>Arguments:</h5>
5315
5316<p>
5317The first argument is a pointer to the destination, the second is a pointer to
5318the source. The third argument is an integer argument
5319specifying the number of bytes to copy, and the fourth argument is the alignment
5320of the source and destination locations.
5321</p>
5322
5323<p>
5324If the call to this intrinisic has an alignment value that is not 0 or 1, then
5325the caller guarantees that both the source and destination pointers are aligned
5326to that boundary.
5327</p>
5328
5329<h5>Semantics:</h5>
5330
5331<p>
5332The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
5333location to the destination location, which are not allowed to overlap. It
5334copies "len" bytes of memory over. If the argument is known to be aligned to
5335some boundary, this can be specified as the fourth argument, otherwise it should
5336be set to 0 or 1.
5337</p>
5338</div>
5339
5340
5341<!-- _______________________________________________________________________ -->
5342<div class="doc_subsubsection">
5343 <a name="int_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
5344</div>
5345
5346<div class="doc_text">
5347
5348<h5>Syntax:</h5>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5349<p>This is an overloaded intrinsic. You can use llvm.memmove on any integer bit
5350width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5351<pre>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5352 declare void @llvm.memmove.i8(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5353 i8 &lt;len&gt;, i32 &lt;align&gt;)
5354 declare void @llvm.memmove.i16(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5355 i16 &lt;len&gt;, i32 &lt;align&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5356 declare void @llvm.memmove.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5357 i32 &lt;len&gt;, i32 &lt;align&gt;)
5358 declare void @llvm.memmove.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
5359 i64 &lt;len&gt;, i32 &lt;align&gt;)
5360</pre>
5361
5362<h5>Overview:</h5>
5363
5364<p>
5365The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
5366location to the destination location. It is similar to the
Chris Lattnerdba16ea2008-01-06 19:51:52 +0000[diff] [blame]5367'<tt>llvm.memcpy</tt>' intrinsic but allows the two memory locations to overlap.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5368</p>
5369
5370<p>
5371Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
5372intrinsics do not return a value, and takes an extra alignment argument.
5373</p>
5374
5375<h5>Arguments:</h5>
5376
5377<p>
5378The first argument is a pointer to the destination, the second is a pointer to
5379the source. The third argument is an integer argument
5380specifying the number of bytes to copy, and the fourth argument is the alignment
5381of the source and destination locations.
5382</p>
5383
5384<p>
5385If the call to this intrinisic has an alignment value that is not 0 or 1, then
5386the caller guarantees that the source and destination pointers are aligned to
5387that boundary.
5388</p>
5389
5390<h5>Semantics:</h5>
5391
5392<p>
5393The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
5394location to the destination location, which may overlap. It
5395copies "len" bytes of memory over. If the argument is known to be aligned to
5396some boundary, this can be specified as the fourth argument, otherwise it should
5397be set to 0 or 1.
5398</p>
5399</div>
5400
5401
5402<!-- _______________________________________________________________________ -->
5403<div class="doc_subsubsection">
5404 <a name="int_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
5405</div>
5406
5407<div class="doc_text">
5408
5409<h5>Syntax:</h5>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5410<p>This is an overloaded intrinsic. You can use llvm.memset on any integer bit
5411width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5412<pre>
Chris Lattner82c2e432008-11-21 16:42:48 +0000[diff] [blame]5413 declare void @llvm.memset.i8(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
5414 i8 &lt;len&gt;, i32 &lt;align&gt;)
5415 declare void @llvm.memset.i16(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
5416 i16 &lt;len&gt;, i32 &lt;align&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5417 declare void @llvm.memset.i32(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
5418 i32 &lt;len&gt;, i32 &lt;align&gt;)
5419 declare void @llvm.memset.i64(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
5420 i64 &lt;len&gt;, i32 &lt;align&gt;)
5421</pre>
5422
5423<h5>Overview:</h5>
5424
5425<p>
5426The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
5427byte value.
5428</p>
5429
5430<p>
5431Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
5432does not return a value, and takes an extra alignment argument.
5433</p>
5434
5435<h5>Arguments:</h5>
5436
5437<p>
5438The first argument is a pointer to the destination to fill, the second is the
5439byte value to fill it with, the third argument is an integer
5440argument specifying the number of bytes to fill, and the fourth argument is the
5441known alignment of destination location.
5442</p>
5443
5444<p>
5445If the call to this intrinisic has an alignment value that is not 0 or 1, then
5446the caller guarantees that the destination pointer is aligned to that boundary.
5447</p>
5448
5449<h5>Semantics:</h5>
5450
5451<p>
5452The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
5453the
5454destination location. If the argument is known to be aligned to some boundary,
5455this can be specified as the fourth argument, otherwise it should be set to 0 or
54561.
5457</p>
5458</div>
5459
5460
5461<!-- _______________________________________________________________________ -->
5462<div class="doc_subsubsection">
5463 <a name="int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
5464</div>
5465
5466<div class="doc_text">
5467
5468<h5>Syntax:</h5>
Dale Johannesenf9adbb62007-10-02 17:47:38 +0000[diff] [blame]5469<p>This is an overloaded intrinsic. You can use <tt>llvm.sqrt</tt> on any
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5470floating point or vector of floating point type. Not all targets support all
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5471types however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5472<pre>
Dale Johannesenf9adbb62007-10-02 17:47:38 +0000[diff] [blame]5473 declare float @llvm.sqrt.f32(float %Val)
5474 declare double @llvm.sqrt.f64(double %Val)
5475 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
5476 declare fp128 @llvm.sqrt.f128(fp128 %Val)
5477 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5478</pre>
5479
5480<h5>Overview:</h5>
5481
5482<p>
5483The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5484returning the same value as the libm '<tt>sqrt</tt>' functions would. Unlike
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5485<tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
Chris Lattnerf914a002008-01-29 07:00:44 +0000[diff] [blame]5486negative numbers other than -0.0 (which allows for better optimization, because
5487there is no need to worry about errno being set). <tt>llvm.sqrt(-0.0)</tt> is
5488defined to return -0.0 like IEEE sqrt.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5489</p>
5490
5491<h5>Arguments:</h5>
5492
5493<p>
5494The argument and return value are floating point numbers of the same type.
5495</p>
5496
5497<h5>Semantics:</h5>
5498
5499<p>
5500This function returns the sqrt of the specified operand if it is a nonnegative
5501floating point number.
5502</p>
5503</div>
5504
5505<!-- _______________________________________________________________________ -->
5506<div class="doc_subsubsection">
5507 <a name="int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
5508</div>
5509
5510<div class="doc_text">
5511
5512<h5>Syntax:</h5>
Dale Johannesenf9adbb62007-10-02 17:47:38 +0000[diff] [blame]5513<p>This is an overloaded intrinsic. You can use <tt>llvm.powi</tt> on any
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5514floating point or vector of floating point type. Not all targets support all
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5515types however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5516<pre>
Dale Johannesenf9adbb62007-10-02 17:47:38 +0000[diff] [blame]5517 declare float @llvm.powi.f32(float %Val, i32 %power)
5518 declare double @llvm.powi.f64(double %Val, i32 %power)
5519 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
5520 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
5521 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5522</pre>
5523
5524<h5>Overview:</h5>
5525
5526<p>
5527The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
5528specified (positive or negative) power. The order of evaluation of
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5529multiplications is not defined. When a vector of floating point type is
5530used, the second argument remains a scalar integer value.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5531</p>
5532
5533<h5>Arguments:</h5>
5534
5535<p>
5536The second argument is an integer power, and the first is a value to raise to
5537that power.
5538</p>
5539
5540<h5>Semantics:</h5>
5541
5542<p>
5543This function returns the first value raised to the second power with an
5544unspecified sequence of rounding operations.</p>
5545</div>
5546
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5547<!-- _______________________________________________________________________ -->
5548<div class="doc_subsubsection">
5549 <a name="int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a>
5550</div>
5551
5552<div class="doc_text">
5553
5554<h5>Syntax:</h5>
5555<p>This is an overloaded intrinsic. You can use <tt>llvm.sin</tt> on any
5556floating point or vector of floating point type. Not all targets support all
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5557types however.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5558<pre>
5559 declare float @llvm.sin.f32(float %Val)
5560 declare double @llvm.sin.f64(double %Val)
5561 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
5562 declare fp128 @llvm.sin.f128(fp128 %Val)
5563 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
5564</pre>
5565
5566<h5>Overview:</h5>
5567
5568<p>
5569The '<tt>llvm.sin.*</tt>' intrinsics return the sine of the operand.
5570</p>
5571
5572<h5>Arguments:</h5>
5573
5574<p>
5575The argument and return value are floating point numbers of the same type.
5576</p>
5577
5578<h5>Semantics:</h5>
5579
5580<p>
5581This function returns the sine of the specified operand, returning the
5582same values as the libm <tt>sin</tt> functions would, and handles error
Dan Gohmaneaba92e2007-10-17 18:05:13 +0000[diff] [blame]5583conditions in the same way.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5584</div>
5585
5586<!-- _______________________________________________________________________ -->
5587<div class="doc_subsubsection">
5588 <a name="int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a>
5589</div>
5590
5591<div class="doc_text">
5592
5593<h5>Syntax:</h5>
5594<p>This is an overloaded intrinsic. You can use <tt>llvm.cos</tt> on any
5595floating point or vector of floating point type. Not all targets support all
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5596types however.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5597<pre>
5598 declare float @llvm.cos.f32(float %Val)
5599 declare double @llvm.cos.f64(double %Val)
5600 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
5601 declare fp128 @llvm.cos.f128(fp128 %Val)
5602 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
5603</pre>
5604
5605<h5>Overview:</h5>
5606
5607<p>
5608The '<tt>llvm.cos.*</tt>' intrinsics return the cosine of the operand.
5609</p>
5610
5611<h5>Arguments:</h5>
5612
5613<p>
5614The argument and return value are floating point numbers of the same type.
5615</p>
5616
5617<h5>Semantics:</h5>
5618
5619<p>
5620This function returns the cosine of the specified operand, returning the
5621same values as the libm <tt>cos</tt> functions would, and handles error
Dan Gohmaneaba92e2007-10-17 18:05:13 +0000[diff] [blame]5622conditions in the same way.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5623</div>
5624
5625<!-- _______________________________________________________________________ -->
5626<div class="doc_subsubsection">
5627 <a name="int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a>
5628</div>
5629
5630<div class="doc_text">
5631
5632<h5>Syntax:</h5>
5633<p>This is an overloaded intrinsic. You can use <tt>llvm.pow</tt> on any
5634floating point or vector of floating point type. Not all targets support all
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5635types however.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5636<pre>
5637 declare float @llvm.pow.f32(float %Val, float %Power)
5638 declare double @llvm.pow.f64(double %Val, double %Power)
5639 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
5640 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
5641 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
5642</pre>
5643
5644<h5>Overview:</h5>
5645
5646<p>
5647The '<tt>llvm.pow.*</tt>' intrinsics return the first operand raised to the
5648specified (positive or negative) power.
5649</p>
5650
5651<h5>Arguments:</h5>
5652
5653<p>
5654The second argument is a floating point power, and the first is a value to
5655raise to that power.
5656</p>
5657
5658<h5>Semantics:</h5>
5659
5660<p>
5661This function returns the first value raised to the second power,
5662returning the
5663same values as the libm <tt>pow</tt> functions would, and handles error
Dan Gohmaneaba92e2007-10-17 18:05:13 +0000[diff] [blame]5664conditions in the same way.</p>
Dan Gohman361079c2007-10-15 20:30:11 +0000[diff] [blame]5665</div>
5666
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5667
5668<!-- ======================================================================= -->
5669<div class="doc_subsection">
5670 <a name="int_manip">Bit Manipulation Intrinsics</a>
5671</div>
5672
5673<div class="doc_text">
5674<p>
5675LLVM provides intrinsics for a few important bit manipulation operations.
5676These allow efficient code generation for some algorithms.
5677</p>
5678
5679</div>
5680
5681<!-- _______________________________________________________________________ -->
5682<div class="doc_subsubsection">
5683 <a name="int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
5684</div>
5685
5686<div class="doc_text">
5687
5688<h5>Syntax:</h5>
5689<p>This is an overloaded intrinsic function. You can use bswap on any integer
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5690type that is an even number of bytes (i.e. BitWidth % 16 == 0).</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5691<pre>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5692 declare i16 @llvm.bswap.i16(i16 &lt;id&gt;)
5693 declare i32 @llvm.bswap.i32(i32 &lt;id&gt;)
5694 declare i64 @llvm.bswap.i64(i64 &lt;id&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5695</pre>
5696
5697<h5>Overview:</h5>
5698
5699<p>
5700The '<tt>llvm.bswap</tt>' family of intrinsics is used to byte swap integer
5701values with an even number of bytes (positive multiple of 16 bits). These are
5702useful for performing operations on data that is not in the target's native
5703byte order.
5704</p>
5705
5706<h5>Semantics:</h5>
5707
5708<p>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5709The <tt>llvm.bswap.i16</tt> intrinsic returns an i16 value that has the high
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5710and low byte of the input i16 swapped. Similarly, the <tt>llvm.bswap.i32</tt>
5711intrinsic returns an i32 value that has the four bytes of the input i32
5712swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the returned
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5713i32 will have its bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i48</tt>,
5714<tt>llvm.bswap.i64</tt> and other intrinsics extend this concept to
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5715additional even-byte lengths (6 bytes, 8 bytes and more, respectively).
5716</p>
5717
5718</div>
5719
5720<!-- _______________________________________________________________________ -->
5721<div class="doc_subsubsection">
5722 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
5723</div>
5724
5725<div class="doc_text">
5726
5727<h5>Syntax:</h5>
5728<p>This is an overloaded intrinsic. You can use llvm.ctpop on any integer bit
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5729width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5730<pre>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5731 declare i8 @llvm.ctpop.i8(i8 &lt;src&gt;)
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5732 declare i16 @llvm.ctpop.i16(i16 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5733 declare i32 @llvm.ctpop.i32(i32 &lt;src&gt;)
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5734 declare i64 @llvm.ctpop.i64(i64 &lt;src&gt;)
5735 declare i256 @llvm.ctpop.i256(i256 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5736</pre>
5737
5738<h5>Overview:</h5>
5739
5740<p>
5741The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
5742value.
5743</p>
5744
5745<h5>Arguments:</h5>
5746
5747<p>
5748The only argument is the value to be counted. The argument may be of any
5749integer type. The return type must match the argument type.
5750</p>
5751
5752<h5>Semantics:</h5>
5753
5754<p>
5755The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
5756</p>
5757</div>
5758
5759<!-- _______________________________________________________________________ -->
5760<div class="doc_subsubsection">
5761 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
5762</div>
5763
5764<div class="doc_text">
5765
5766<h5>Syntax:</h5>
5767<p>This is an overloaded intrinsic. You can use <tt>llvm.ctlz</tt> on any
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5768integer bit width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5769<pre>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5770 declare i8 @llvm.ctlz.i8 (i8 &lt;src&gt;)
5771 declare i16 @llvm.ctlz.i16(i16 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5772 declare i32 @llvm.ctlz.i32(i32 &lt;src&gt;)
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5773 declare i64 @llvm.ctlz.i64(i64 &lt;src&gt;)
5774 declare i256 @llvm.ctlz.i256(i256 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5775</pre>
5776
5777<h5>Overview:</h5>
5778
5779<p>
5780The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
5781leading zeros in a variable.
5782</p>
5783
5784<h5>Arguments:</h5>
5785
5786<p>
5787The only argument is the value to be counted. The argument may be of any
5788integer type. The return type must match the argument type.
5789</p>
5790
5791<h5>Semantics:</h5>
5792
5793<p>
5794The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
5795in a variable. If the src == 0 then the result is the size in bits of the type
5796of src. For example, <tt>llvm.ctlz(i32 2) = 30</tt>.
5797</p>
5798</div>
5799
5800
5801
5802<!-- _______________________________________________________________________ -->
5803<div class="doc_subsubsection">
5804 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
5805</div>
5806
5807<div class="doc_text">
5808
5809<h5>Syntax:</h5>
5810<p>This is an overloaded intrinsic. You can use <tt>llvm.cttz</tt> on any
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5811integer bit width. Not all targets support all bit widths however.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5812<pre>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5813 declare i8 @llvm.cttz.i8 (i8 &lt;src&gt;)
5814 declare i16 @llvm.cttz.i16(i16 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5815 declare i32 @llvm.cttz.i32(i32 &lt;src&gt;)
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5816 declare i64 @llvm.cttz.i64(i64 &lt;src&gt;)
5817 declare i256 @llvm.cttz.i256(i256 &lt;src&gt;)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5818</pre>
5819
5820<h5>Overview:</h5>
5821
5822<p>
5823The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
5824trailing zeros.
5825</p>
5826
5827<h5>Arguments:</h5>
5828
5829<p>
5830The only argument is the value to be counted. The argument may be of any
5831integer type. The return type must match the argument type.
5832</p>
5833
5834<h5>Semantics:</h5>
5835
5836<p>
5837The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
5838in a variable. If the src == 0 then the result is the size in bits of the type
5839of src. For example, <tt>llvm.cttz(2) = 1</tt>.
5840</p>
5841</div>
5842
5843<!-- _______________________________________________________________________ -->
5844<div class="doc_subsubsection">
5845 <a name="int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic</a>
5846</div>
5847
5848<div class="doc_text">
5849
5850<h5>Syntax:</h5>
5851<p>This is an overloaded intrinsic. You can use <tt>llvm.part.select</tt>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5852on any integer bit width.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5853<pre>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5854 declare i17 @llvm.part.select.i17 (i17 %val, i32 %loBit, i32 %hiBit)
5855 declare i29 @llvm.part.select.i29 (i29 %val, i32 %loBit, i32 %hiBit)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5856</pre>
5857
5858<h5>Overview:</h5>
5859<p>The '<tt>llvm.part.select</tt>' family of intrinsic functions selects a
5860range of bits from an integer value and returns them in the same bit width as
5861the original value.</p>
5862
5863<h5>Arguments:</h5>
5864<p>The first argument, <tt>%val</tt> and the result may be integer types of
5865any bit width but they must have the same bit width. The second and third
5866arguments must be <tt>i32</tt> type since they specify only a bit index.</p>
5867
5868<h5>Semantics:</h5>
5869<p>The operation of the '<tt>llvm.part.select</tt>' intrinsic has two modes
5870of operation: forwards and reverse. If <tt>%loBit</tt> is greater than
5871<tt>%hiBits</tt> then the intrinsic operates in reverse mode. Otherwise it
5872operates in forward mode.</p>
5873<p>In forward mode, this intrinsic is the equivalent of shifting <tt>%val</tt>
5874right by <tt>%loBit</tt> bits and then ANDing it with a mask with
5875only the <tt>%hiBit - %loBit</tt> bits set, as follows:</p>
5876<ol>
5877 <li>The <tt>%val</tt> is shifted right (LSHR) by the number of bits specified
5878 by <tt>%loBits</tt>. This normalizes the value to the low order bits.</li>
5879 <li>The <tt>%loBits</tt> value is subtracted from the <tt>%hiBits</tt> value
5880 to determine the number of bits to retain.</li>
5881 <li>A mask of the retained bits is created by shifting a -1 value.</li>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5882 <li>The mask is ANDed with <tt>%val</tt> to produce the result.</li>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5883</ol>
5884<p>In reverse mode, a similar computation is made except that the bits are
5885returned in the reverse order. So, for example, if <tt>X</tt> has the value
5886<tt>i16 0x0ACF (101011001111)</tt> and we apply
5887<tt>part.select(i16 X, 8, 3)</tt> to it, we get back the value
5888<tt>i16 0x0026 (000000100110)</tt>.</p>
5889</div>
5890
5891<div class="doc_subsubsection">
5892 <a name="int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic</a>
5893</div>
5894
5895<div class="doc_text">
5896
5897<h5>Syntax:</h5>
5898<p>This is an overloaded intrinsic. You can use <tt>llvm.part.set</tt>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5899on any integer bit width.</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5900<pre>
Chandler Carrutha228e392007-08-04 01:51:18 +0000[diff] [blame]5901 declare i17 @llvm.part.set.i17.i9 (i17 %val, i9 %repl, i32 %lo, i32 %hi)
5902 declare i29 @llvm.part.set.i29.i9 (i29 %val, i9 %repl, i32 %lo, i32 %hi)
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5903</pre>
5904
5905<h5>Overview:</h5>
5906<p>The '<tt>llvm.part.set</tt>' family of intrinsic functions replaces a range
5907of bits in an integer value with another integer value. It returns the integer
5908with the replaced bits.</p>
5909
5910<h5>Arguments:</h5>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5911<p>The first argument, <tt>%val</tt>, and the result may be integer types of
5912any bit width, but they must have the same bit width. <tt>%val</tt> is the value
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5913whose bits will be replaced. The second argument, <tt>%repl</tt> may be an
5914integer of any bit width. The third and fourth arguments must be <tt>i32</tt>
5915type since they specify only a bit index.</p>
5916
5917<h5>Semantics:</h5>
5918<p>The operation of the '<tt>llvm.part.set</tt>' intrinsic has two modes
5919of operation: forwards and reverse. If <tt>%lo</tt> is greater than
5920<tt>%hi</tt> then the intrinsic operates in reverse mode. Otherwise it
5921operates in forward mode.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5922
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5923<p>For both modes, the <tt>%repl</tt> value is prepared for use by either
5924truncating it down to the size of the replacement area or zero extending it
5925up to that size.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5926
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5927<p>In forward mode, the bits between <tt>%lo</tt> and <tt>%hi</tt> (inclusive)
5928are replaced with corresponding bits from <tt>%repl</tt>. That is the 0th bit
5929in <tt>%repl</tt> replaces the <tt>%lo</tt>th bit in <tt>%val</tt> and etc. up
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5930to the <tt>%hi</tt>th bit.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5931
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5932<p>In reverse mode, a similar computation is made except that the bits are
5933reversed. That is, the <tt>0</tt>th bit in <tt>%repl</tt> replaces the
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]5934<tt>%hi</tt> bit in <tt>%val</tt> and etc. down to the <tt>%lo</tt>th bit.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5935
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5936<h5>Examples:</h5>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5937
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]5938<pre>
5939 llvm.part.set(0xFFFF, 0, 4, 7) -&gt; 0xFF0F
5940 llvm.part.set(0xFFFF, 0, 7, 4) -&gt; 0xFF0F
5941 llvm.part.set(0xFFFF, 1, 7, 4) -&gt; 0xFF8F
5942 llvm.part.set(0xFFFF, F, 8, 3) -&gt; 0xFFE7
5943 llvm.part.set(0xFFFF, 0, 3, 8) -&gt; 0xFE07
5944</pre>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5945
5946</div>
5947
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]5948<!-- ======================================================================= -->
5949<div class="doc_subsection">
5950 <a name="int_overflow">Arithmetic with Overflow Intrinsics</a>
5951</div>
5952
5953<div class="doc_text">
5954<p>
5955LLVM provides intrinsics for some arithmetic with overflow operations.
5956</p>
5957
5958</div>
5959
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5960<!-- _______________________________________________________________________ -->
5961<div class="doc_subsubsection">
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]5962 <a name="int_sadd_overflow">'<tt>llvm.sadd.with.overflow.*</tt>' Intrinsics</a>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5963</div>
5964
5965<div class="doc_text">
5966
5967<h5>Syntax:</h5>
5968
5969<p>This is an overloaded intrinsic. You can use <tt>llvm.sadd.with.overflow</tt>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]5970on any integer bit width.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]5971
5972<pre>
5973 declare {i16, i1} @llvm.sadd.with.overflow.i16(i16 %a, i16 %b)
5974 declare {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
5975 declare {i64, i1} @llvm.sadd.with.overflow.i64(i64 %a, i64 %b)
5976</pre>
5977
5978<h5>Overview:</h5>
5979
5980<p>The '<tt>llvm.sadd.with.overflow</tt>' family of intrinsic functions perform
5981a signed addition of the two arguments, and indicate whether an overflow
5982occurred during the signed summation.</p>
5983
5984<h5>Arguments:</h5>
5985
5986<p>The arguments (%a and %b) and the first element of the result structure may
5987be of integer types of any bit width, but they must have the same bit width. The
5988second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
5989and <tt>%b</tt> are the two values that will undergo signed addition.</p>
5990
5991<h5>Semantics:</h5>
5992
5993<p>The '<tt>llvm.sadd.with.overflow</tt>' family of intrinsic functions perform
5994a signed addition of the two variables. They return a structure &mdash; the
5995first element of which is the signed summation, and the second element of which
5996is a bit specifying if the signed summation resulted in an overflow.</p>
5997
5998<h5>Examples:</h5>
5999<pre>
6000 %res = call {i32, i1} @llvm.sadd.with.overflow.i32(i32 %a, i32 %b)
6001 %sum = extractvalue {i32, i1} %res, 0
6002 %obit = extractvalue {i32, i1} %res, 1
6003 br i1 %obit, label %overflow, label %normal
6004</pre>
6005
6006</div>
6007
6008<!-- _______________________________________________________________________ -->
6009<div class="doc_subsubsection">
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6010 <a name="int_uadd_overflow">'<tt>llvm.uadd.with.overflow.*</tt>' Intrinsics</a>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6011</div>
6012
6013<div class="doc_text">
6014
6015<h5>Syntax:</h5>
6016
6017<p>This is an overloaded intrinsic. You can use <tt>llvm.uadd.with.overflow</tt>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6018on any integer bit width.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6019
6020<pre>
6021 declare {i16, i1} @llvm.uadd.with.overflow.i16(i16 %a, i16 %b)
6022 declare {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
6023 declare {i64, i1} @llvm.uadd.with.overflow.i64(i64 %a, i64 %b)
6024</pre>
6025
6026<h5>Overview:</h5>
6027
6028<p>The '<tt>llvm.uadd.with.overflow</tt>' family of intrinsic functions perform
6029an unsigned addition of the two arguments, and indicate whether a carry occurred
6030during the unsigned summation.</p>
6031
6032<h5>Arguments:</h5>
6033
6034<p>The arguments (%a and %b) and the first element of the result structure may
6035be of integer types of any bit width, but they must have the same bit width. The
6036second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
6037and <tt>%b</tt> are the two values that will undergo unsigned addition.</p>
6038
6039<h5>Semantics:</h5>
6040
6041<p>The '<tt>llvm.uadd.with.overflow</tt>' family of intrinsic functions perform
6042an unsigned addition of the two arguments. They return a structure &mdash; the
6043first element of which is the sum, and the second element of which is a bit
6044specifying if the unsigned summation resulted in a carry.</p>
6045
6046<h5>Examples:</h5>
6047<pre>
6048 %res = call {i32, i1} @llvm.uadd.with.overflow.i32(i32 %a, i32 %b)
6049 %sum = extractvalue {i32, i1} %res, 0
6050 %obit = extractvalue {i32, i1} %res, 1
6051 br i1 %obit, label %carry, label %normal
6052</pre>
6053
6054</div>
6055
6056<!-- _______________________________________________________________________ -->
6057<div class="doc_subsubsection">
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6058 <a name="int_ssub_overflow">'<tt>llvm.ssub.with.overflow.*</tt>' Intrinsics</a>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6059</div>
6060
6061<div class="doc_text">
6062
6063<h5>Syntax:</h5>
6064
6065<p>This is an overloaded intrinsic. You can use <tt>llvm.ssub.with.overflow</tt>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6066on any integer bit width.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6067
6068<pre>
6069 declare {i16, i1} @llvm.ssub.with.overflow.i16(i16 %a, i16 %b)
6070 declare {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
6071 declare {i64, i1} @llvm.ssub.with.overflow.i64(i64 %a, i64 %b)
6072</pre>
6073
6074<h5>Overview:</h5>
6075
6076<p>The '<tt>llvm.ssub.with.overflow</tt>' family of intrinsic functions perform
6077a signed subtraction of the two arguments, and indicate whether an overflow
6078occurred during the signed subtraction.</p>
6079
6080<h5>Arguments:</h5>
6081
6082<p>The arguments (%a and %b) and the first element of the result structure may
6083be of integer types of any bit width, but they must have the same bit width. The
6084second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
6085and <tt>%b</tt> are the two values that will undergo signed subtraction.</p>
6086
6087<h5>Semantics:</h5>
6088
6089<p>The '<tt>llvm.ssub.with.overflow</tt>' family of intrinsic functions perform
6090a signed subtraction of the two arguments. They return a structure &mdash; the
6091first element of which is the subtraction, and the second element of which is a bit
6092specifying if the signed subtraction resulted in an overflow.</p>
6093
6094<h5>Examples:</h5>
6095<pre>
6096 %res = call {i32, i1} @llvm.ssub.with.overflow.i32(i32 %a, i32 %b)
6097 %sum = extractvalue {i32, i1} %res, 0
6098 %obit = extractvalue {i32, i1} %res, 1
6099 br i1 %obit, label %overflow, label %normal
6100</pre>
6101
6102</div>
6103
6104<!-- _______________________________________________________________________ -->
6105<div class="doc_subsubsection">
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6106 <a name="int_usub_overflow">'<tt>llvm.usub.with.overflow.*</tt>' Intrinsics</a>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6107</div>
6108
6109<div class="doc_text">
6110
6111<h5>Syntax:</h5>
6112
6113<p>This is an overloaded intrinsic. You can use <tt>llvm.usub.with.overflow</tt>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6114on any integer bit width.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6115
6116<pre>
6117 declare {i16, i1} @llvm.usub.with.overflow.i16(i16 %a, i16 %b)
6118 declare {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
6119 declare {i64, i1} @llvm.usub.with.overflow.i64(i64 %a, i64 %b)
6120</pre>
6121
6122<h5>Overview:</h5>
6123
6124<p>The '<tt>llvm.usub.with.overflow</tt>' family of intrinsic functions perform
6125an unsigned subtraction of the two arguments, and indicate whether an overflow
6126occurred during the unsigned subtraction.</p>
6127
6128<h5>Arguments:</h5>
6129
6130<p>The arguments (%a and %b) and the first element of the result structure may
6131be of integer types of any bit width, but they must have the same bit width. The
6132second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
6133and <tt>%b</tt> are the two values that will undergo unsigned subtraction.</p>
6134
6135<h5>Semantics:</h5>
6136
6137<p>The '<tt>llvm.usub.with.overflow</tt>' family of intrinsic functions perform
6138an unsigned subtraction of the two arguments. They return a structure &mdash; the
6139first element of which is the subtraction, and the second element of which is a bit
6140specifying if the unsigned subtraction resulted in an overflow.</p>
6141
6142<h5>Examples:</h5>
6143<pre>
6144 %res = call {i32, i1} @llvm.usub.with.overflow.i32(i32 %a, i32 %b)
6145 %sum = extractvalue {i32, i1} %res, 0
6146 %obit = extractvalue {i32, i1} %res, 1
6147 br i1 %obit, label %overflow, label %normal
6148</pre>
6149
6150</div>
6151
6152<!-- _______________________________________________________________________ -->
6153<div class="doc_subsubsection">
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6154 <a name="int_smul_overflow">'<tt>llvm.smul.with.overflow.*</tt>' Intrinsics</a>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6155</div>
6156
6157<div class="doc_text">
6158
6159<h5>Syntax:</h5>
6160
6161<p>This is an overloaded intrinsic. You can use <tt>llvm.smul.with.overflow</tt>
Bill Wendling3e1258b2009-02-08 04:04:40 +0000[diff] [blame]6162on any integer bit width.</p>
Bill Wendling3f8cebe2009-02-08 01:40:31 +0000[diff] [blame]6163
6164<pre>
6165 declare {i16, i1} @llvm.smul.with.overflow.i16(i16 %a, i16 %b)
6166 declare {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
6167 declare {i64, i1} @llvm.smul.with.overflow.i64(i64 %a, i64 %b)
6168</pre>
6169
6170<h5>Overview:</h5>
6171
6172<p>The '<tt>llvm.smul.with.overflow</tt>' family of intrinsic functions perform
6173a signed multiplication of the two arguments, and indicate whether an overflow
6174occurred during the signed multiplication.</p>
6175
6176<h5>Arguments:</h5>
6177
6178<p>The arguments (%a and %b) and the first element of the result structure may
6179be of integer types of any bit width, but they must have the same bit width. The
6180second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
6181and <tt>%b</tt> are the two values that will undergo signed multiplication.</p>
6182
6183<h5>Semantics:</h5>
6184
6185<p>The '<tt>llvm.smul.with.overflow</tt>' family of intrinsic functions perform
6186a signed multiplication of the two arguments. They return a structure &mdash;
6187the first element of which is the multiplication, and the second element of
6188which is a bit specifying if the signed multiplication resulted in an
6189overflow.</p>
6190
6191<h5>Examples:</h5>
6192<pre>
6193 %res = call {i32, i1} @llvm.smul.with.overflow.i32(i32 %a, i32 %b)
6194 %sum = extractvalue {i32, i1} %res, 0
6195 %obit = extractvalue {i32, i1} %res, 1
6196 br i1 %obit, label %overflow, label %normal
6197</pre>
6198
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6199</div>
6200
Bill Wendlingbda98b62009-02-08 23:00:09 +0000[diff] [blame]6201<!-- _______________________________________________________________________ -->
6202<div class="doc_subsubsection">
6203 <a name="int_umul_overflow">'<tt>llvm.umul.with.overflow.*</tt>' Intrinsics</a>
6204</div>
6205
6206<div class="doc_text">
6207
6208<h5>Syntax:</h5>
6209
6210<p>This is an overloaded intrinsic. You can use <tt>llvm.umul.with.overflow</tt>
6211on any integer bit width.</p>
6212
6213<pre>
6214 declare {i16, i1} @llvm.umul.with.overflow.i16(i16 %a, i16 %b)
6215 declare {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
6216 declare {i64, i1} @llvm.umul.with.overflow.i64(i64 %a, i64 %b)
6217</pre>
6218
6219<h5>Overview:</h5>
6220
6221<p><i><b>Warning:</b> '<tt>llvm.umul.with.overflow</tt>' is badly broken. It is
6222actively being fixed, but it should not currently be used!</i></p>
6223
6224<p>The '<tt>llvm.umul.with.overflow</tt>' family of intrinsic functions perform
6225a unsigned multiplication of the two arguments, and indicate whether an overflow
6226occurred during the unsigned multiplication.</p>
6227
6228<h5>Arguments:</h5>
6229
6230<p>The arguments (%a and %b) and the first element of the result structure may
6231be of integer types of any bit width, but they must have the same bit width. The
6232second element of the result structure must be of type <tt>i1</tt>. <tt>%a</tt>
6233and <tt>%b</tt> are the two values that will undergo unsigned
6234multiplication.</p>
6235
6236<h5>Semantics:</h5>
6237
6238<p>The '<tt>llvm.umul.with.overflow</tt>' family of intrinsic functions perform
6239an unsigned multiplication of the two arguments. They return a structure &mdash;
6240the first element of which is the multiplication, and the second element of
6241which is a bit specifying if the unsigned multiplication resulted in an
6242overflow.</p>
6243
6244<h5>Examples:</h5>
6245<pre>
6246 %res = call {i32, i1} @llvm.umul.with.overflow.i32(i32 %a, i32 %b)
6247 %sum = extractvalue {i32, i1} %res, 0
6248 %obit = extractvalue {i32, i1} %res, 1
6249 br i1 %obit, label %overflow, label %normal
6250</pre>
6251
6252</div>
6253
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6254<!-- ======================================================================= -->
6255<div class="doc_subsection">
6256 <a name="int_debugger">Debugger Intrinsics</a>
6257</div>
6258
6259<div class="doc_text">
6260<p>
6261The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
6262are described in the <a
6263href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
6264Debugging</a> document.
6265</p>
6266</div>
6267
6268
6269<!-- ======================================================================= -->
6270<div class="doc_subsection">
6271 <a name="int_eh">Exception Handling Intrinsics</a>
6272</div>
6273
6274<div class="doc_text">
6275<p> The LLVM exception handling intrinsics (which all start with
6276<tt>llvm.eh.</tt> prefix), are described in the <a
6277href="ExceptionHandling.html#format_common_intrinsics">LLVM Exception
6278Handling</a> document. </p>
6279</div>
6280
6281<!-- ======================================================================= -->
6282<div class="doc_subsection">
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6283 <a name="int_trampoline">Trampoline Intrinsic</a>
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6284</div>
6285
6286<div class="doc_text">
6287<p>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6288 This intrinsic makes it possible to excise one parameter, marked with
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6289 the <tt>nest</tt> attribute, from a function. The result is a callable
6290 function pointer lacking the nest parameter - the caller does not need
6291 to provide a value for it. Instead, the value to use is stored in
6292 advance in a "trampoline", a block of memory usually allocated
6293 on the stack, which also contains code to splice the nest value into the
6294 argument list. This is used to implement the GCC nested function address
6295 extension.
6296</p>
6297<p>
6298 For example, if the function is
6299 <tt>i32 f(i8* nest %c, i32 %x, i32 %y)</tt> then the resulting function
Bill Wendlinge262b4c2007-09-22 09:23:55 +0000[diff] [blame]6300 pointer has signature <tt>i32 (i32, i32)*</tt>. It can be created as follows:</p>
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6301<pre>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6302 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
6303 %tramp1 = getelementptr [10 x i8]* %tramp, i32 0, i32 0
6304 %p = call i8* @llvm.init.trampoline( i8* %tramp1, i8* bitcast (i32 (i8* nest , i32, i32)* @f to i8*), i8* %nval )
6305 %fp = bitcast i8* %p to i32 (i32, i32)*
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6306</pre>
Bill Wendlinge262b4c2007-09-22 09:23:55 +0000[diff] [blame]6307 <p>The call <tt>%val = call i32 %fp( i32 %x, i32 %y )</tt> is then equivalent
6308 to <tt>%val = call i32 %f( i8* %nval, i32 %x, i32 %y )</tt>.</p>
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6309</div>
6310
6311<!-- _______________________________________________________________________ -->
6312<div class="doc_subsubsection">
6313 <a name="int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a>
6314</div>
6315<div class="doc_text">
6316<h5>Syntax:</h5>
6317<pre>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6318declare i8* @llvm.init.trampoline(i8* &lt;tramp&gt;, i8* &lt;func&gt;, i8* &lt;nval&gt;)
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6319</pre>
6320<h5>Overview:</h5>
6321<p>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6322 This fills the memory pointed to by <tt>tramp</tt> with code
6323 and returns a function pointer suitable for executing it.
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6324</p>
6325<h5>Arguments:</h5>
6326<p>
6327 The <tt>llvm.init.trampoline</tt> intrinsic takes three arguments, all
6328 pointers. The <tt>tramp</tt> argument must point to a sufficiently large
6329 and sufficiently aligned block of memory; this memory is written to by the
Duncan Sands35012212007-08-22 23:39:54 +0000[diff] [blame]6330 intrinsic. Note that the size and the alignment are target-specific - LLVM
6331 currently provides no portable way of determining them, so a front-end that
6332 generates this intrinsic needs to have some target-specific knowledge.
6333 The <tt>func</tt> argument must hold a function bitcast to an <tt>i8*</tt>.
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6334</p>
6335<h5>Semantics:</h5>
6336<p>
6337 The block of memory pointed to by <tt>tramp</tt> is filled with target
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6338 dependent code, turning it into a function. A pointer to this function is
6339 returned, but needs to be bitcast to an
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6340 <a href="#int_trampoline">appropriate function pointer type</a>
Duncan Sands7407a9f2007-09-11 14:10:23 +0000[diff] [blame]6341 before being called. The new function's signature is the same as that of
6342 <tt>func</tt> with any arguments marked with the <tt>nest</tt> attribute
6343 removed. At most one such <tt>nest</tt> argument is allowed, and it must be
6344 of pointer type. Calling the new function is equivalent to calling
6345 <tt>func</tt> with the same argument list, but with <tt>nval</tt> used for the
6346 missing <tt>nest</tt> argument. If, after calling
6347 <tt>llvm.init.trampoline</tt>, the memory pointed to by <tt>tramp</tt> is
6348 modified, then the effect of any later call to the returned function pointer is
6349 undefined.
Duncan Sands38947cd2007-07-27 12:58:54 +0000[diff] [blame]6350</p>
6351</div>
6352
6353<!-- ======================================================================= -->
6354<div class="doc_subsection">
Andrew Lenharth785610d2008-02-16 01:24:58 +0000[diff] [blame]6355 <a name="int_atomics">Atomic Operations and Synchronization Intrinsics</a>
6356</div>
6357
6358<div class="doc_text">
6359<p>
6360 These intrinsic functions expand the "universal IR" of LLVM to represent
6361 hardware constructs for atomic operations and memory synchronization. This
6362 provides an interface to the hardware, not an interface to the programmer. It
Chris Lattner96451482008-08-05 18:29:16 +0000[diff] [blame]6363 is aimed at a low enough level to allow any programming models or APIs
6364 (Application Programming Interfaces) which
Andrew Lenharth785610d2008-02-16 01:24:58 +0000[diff] [blame]6365 need atomic behaviors to map cleanly onto it. It is also modeled primarily on
6366 hardware behavior. Just as hardware provides a "universal IR" for source
6367 languages, it also provides a starting point for developing a "universal"
6368 atomic operation and synchronization IR.
6369</p>
6370<p>
6371 These do <em>not</em> form an API such as high-level threading libraries,
6372 software transaction memory systems, atomic primitives, and intrinsic
6373 functions as found in BSD, GNU libc, atomic_ops, APR, and other system and
6374 application libraries. The hardware interface provided by LLVM should allow
6375 a clean implementation of all of these APIs and parallel programming models.
6376 No one model or paradigm should be selected above others unless the hardware
6377 itself ubiquitously does so.
6378
6379</p>
6380</div>
6381
6382<!-- _______________________________________________________________________ -->
6383<div class="doc_subsubsection">
6384 <a name="int_memory_barrier">'<tt>llvm.memory.barrier</tt>' Intrinsic</a>
6385</div>
6386<div class="doc_text">
6387<h5>Syntax:</h5>
6388<pre>
6389declare void @llvm.memory.barrier( i1 &lt;ll&gt;, i1 &lt;ls&gt;, i1 &lt;sl&gt;, i1 &lt;ss&gt;,
6390i1 &lt;device&gt; )
6391
6392</pre>
6393<h5>Overview:</h5>
6394<p>
6395 The <tt>llvm.memory.barrier</tt> intrinsic guarantees ordering between
6396 specific pairs of memory access types.
6397</p>
6398<h5>Arguments:</h5>
6399<p>
6400 The <tt>llvm.memory.barrier</tt> intrinsic requires five boolean arguments.
6401 The first four arguments enables a specific barrier as listed below. The fith
6402 argument specifies that the barrier applies to io or device or uncached memory.
6403
6404</p>
6405 <ul>
6406 <li><tt>ll</tt>: load-load barrier</li>
6407 <li><tt>ls</tt>: load-store barrier</li>
6408 <li><tt>sl</tt>: store-load barrier</li>
6409 <li><tt>ss</tt>: store-store barrier</li>
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]6410 <li><tt>device</tt>: barrier applies to device and uncached memory also.</li>
Andrew Lenharth785610d2008-02-16 01:24:58 +0000[diff] [blame]6411 </ul>
6412<h5>Semantics:</h5>
6413<p>
6414 This intrinsic causes the system to enforce some ordering constraints upon
6415 the loads and stores of the program. This barrier does not indicate
6416 <em>when</em> any events will occur, it only enforces an <em>order</em> in
6417 which they occur. For any of the specified pairs of load and store operations
6418 (f.ex. load-load, or store-load), all of the first operations preceding the
6419 barrier will complete before any of the second operations succeeding the
6420 barrier begin. Specifically the semantics for each pairing is as follows:
6421</p>
6422 <ul>
6423 <li><tt>ll</tt>: All loads before the barrier must complete before any load
6424 after the barrier begins.</li>
6425
6426 <li><tt>ls</tt>: All loads before the barrier must complete before any
6427 store after the barrier begins.</li>
6428 <li><tt>ss</tt>: All stores before the barrier must complete before any
6429 store after the barrier begins.</li>
6430 <li><tt>sl</tt>: All stores before the barrier must complete before any
6431 load after the barrier begins.</li>
6432 </ul>
6433<p>
6434 These semantics are applied with a logical "and" behavior when more than one
6435 is enabled in a single memory barrier intrinsic.
6436</p>
6437<p>
6438 Backends may implement stronger barriers than those requested when they do not
6439 support as fine grained a barrier as requested. Some architectures do not
6440 need all types of barriers and on such architectures, these become noops.
6441</p>
6442<h5>Example:</h5>
6443<pre>
6444%ptr = malloc i32
6445 store i32 4, %ptr
6446
6447%result1 = load i32* %ptr <i>; yields {i32}:result1 = 4</i>
6448 call void @llvm.memory.barrier( i1 false, i1 true, i1 false, i1 false )
6449 <i>; guarantee the above finishes</i>
6450 store i32 8, %ptr <i>; before this begins</i>
6451</pre>
6452</div>
6453
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6454<!-- _______________________________________________________________________ -->
6455<div class="doc_subsubsection">
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6456 <a name="int_atomic_cmp_swap">'<tt>llvm.atomic.cmp.swap.*</tt>' Intrinsic</a>
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6457</div>
6458<div class="doc_text">
6459<h5>Syntax:</h5>
6460<p>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6461 This is an overloaded intrinsic. You can use <tt>llvm.atomic.cmp.swap</tt> on
6462 any integer bit width and for different address spaces. Not all targets
6463 support all bit widths however.</p>
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6464
6465<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6466declare i8 @llvm.atomic.cmp.swap.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;cmp&gt;, i8 &lt;val&gt; )
6467declare i16 @llvm.atomic.cmp.swap.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;cmp&gt;, i16 &lt;val&gt; )
6468declare i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;cmp&gt;, i32 &lt;val&gt; )
6469declare i64 @llvm.atomic.cmp.swap.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;cmp&gt;, i64 &lt;val&gt; )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6470
6471</pre>
6472<h5>Overview:</h5>
6473<p>
6474 This loads a value in memory and compares it to a given value. If they are
6475 equal, it stores a new value into the memory.
6476</p>
6477<h5>Arguments:</h5>
6478<p>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6479 The <tt>llvm.atomic.cmp.swap</tt> intrinsic takes three arguments. The result as
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6480 well as both <tt>cmp</tt> and <tt>val</tt> must be integer values with the
6481 same bit width. The <tt>ptr</tt> argument must be a pointer to a value of
6482 this integer type. While any bit width integer may be used, targets may only
6483 lower representations they support in hardware.
6484
6485</p>
6486<h5>Semantics:</h5>
6487<p>
6488 This entire intrinsic must be executed atomically. It first loads the value
6489 in memory pointed to by <tt>ptr</tt> and compares it with the value
6490 <tt>cmp</tt>. If they are equal, <tt>val</tt> is stored into the memory. The
6491 loaded value is yielded in all cases. This provides the equivalent of an
6492 atomic compare-and-swap operation within the SSA framework.
6493</p>
6494<h5>Examples:</h5>
6495
6496<pre>
6497%ptr = malloc i32
6498 store i32 4, %ptr
6499
6500%val1 = add i32 4, 4
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6501%result1 = call i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* %ptr, i32 4, %val1 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6502 <i>; yields {i32}:result1 = 4</i>
6503%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
6504%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
6505
6506%val2 = add i32 1, 1
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6507%result2 = call i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* %ptr, i32 5, %val2 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6508 <i>; yields {i32}:result2 = 8</i>
6509%stored2 = icmp eq i32 %result2, 5 <i>; yields {i1}:stored2 = false</i>
6510
6511%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 8</i>
6512</pre>
6513</div>
6514
6515<!-- _______________________________________________________________________ -->
6516<div class="doc_subsubsection">
6517 <a name="int_atomic_swap">'<tt>llvm.atomic.swap.*</tt>' Intrinsic</a>
6518</div>
6519<div class="doc_text">
6520<h5>Syntax:</h5>
6521
6522<p>
6523 This is an overloaded intrinsic. You can use <tt>llvm.atomic.swap</tt> on any
6524 integer bit width. Not all targets support all bit widths however.</p>
6525<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6526declare i8 @llvm.atomic.swap.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;val&gt; )
6527declare i16 @llvm.atomic.swap.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;val&gt; )
6528declare i32 @llvm.atomic.swap.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;val&gt; )
6529declare i64 @llvm.atomic.swap.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;val&gt; )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6530
6531</pre>
6532<h5>Overview:</h5>
6533<p>
6534 This intrinsic loads the value stored in memory at <tt>ptr</tt> and yields
6535 the value from memory. It then stores the value in <tt>val</tt> in the memory
6536 at <tt>ptr</tt>.
6537</p>
6538<h5>Arguments:</h5>
6539
6540<p>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6541 The <tt>llvm.atomic.swap</tt> intrinsic takes two arguments. Both the
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6542 <tt>val</tt> argument and the result must be integers of the same bit width.
6543 The first argument, <tt>ptr</tt>, must be a pointer to a value of this
6544 integer type. The targets may only lower integer representations they
6545 support.
6546</p>
6547<h5>Semantics:</h5>
6548<p>
6549 This intrinsic loads the value pointed to by <tt>ptr</tt>, yields it, and
6550 stores <tt>val</tt> back into <tt>ptr</tt> atomically. This provides the
6551 equivalent of an atomic swap operation within the SSA framework.
6552
6553</p>
6554<h5>Examples:</h5>
6555<pre>
6556%ptr = malloc i32
6557 store i32 4, %ptr
6558
6559%val1 = add i32 4, 4
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6560%result1 = call i32 @llvm.atomic.swap.i32.p0i32( i32* %ptr, i32 %val1 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6561 <i>; yields {i32}:result1 = 4</i>
6562%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
6563%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
6564
6565%val2 = add i32 1, 1
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6566%result2 = call i32 @llvm.atomic.swap.i32.p0i32( i32* %ptr, i32 %val2 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6567 <i>; yields {i32}:result2 = 8</i>
6568
6569%stored2 = icmp eq i32 %result2, 8 <i>; yields {i1}:stored2 = true</i>
6570%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 2</i>
6571</pre>
6572</div>
6573
6574<!-- _______________________________________________________________________ -->
6575<div class="doc_subsubsection">
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6576 <a name="int_atomic_load_add">'<tt>llvm.atomic.load.add.*</tt>' Intrinsic</a>
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6577
6578</div>
6579<div class="doc_text">
6580<h5>Syntax:</h5>
6581<p>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6582 This is an overloaded intrinsic. You can use <tt>llvm.atomic.load.add</tt> on any
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6583 integer bit width. Not all targets support all bit widths however.</p>
6584<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6585declare i8 @llvm.atomic.load.add.i8..p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6586declare i16 @llvm.atomic.load.add.i16..p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6587declare i32 @llvm.atomic.load.add.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6588declare i64 @llvm.atomic.load.add.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6589
6590</pre>
6591<h5>Overview:</h5>
6592<p>
6593 This intrinsic adds <tt>delta</tt> to the value stored in memory at
6594 <tt>ptr</tt>. It yields the original value at <tt>ptr</tt>.
6595</p>
6596<h5>Arguments:</h5>
6597<p>
6598
6599 The intrinsic takes two arguments, the first a pointer to an integer value
6600 and the second an integer value. The result is also an integer value. These
6601 integer types can have any bit width, but they must all have the same bit
6602 width. The targets may only lower integer representations they support.
6603</p>
6604<h5>Semantics:</h5>
6605<p>
6606 This intrinsic does a series of operations atomically. It first loads the
6607 value stored at <tt>ptr</tt>. It then adds <tt>delta</tt>, stores the result
6608 to <tt>ptr</tt>. It yields the original value stored at <tt>ptr</tt>.
6609</p>
6610
6611<h5>Examples:</h5>
6612<pre>
6613%ptr = malloc i32
6614 store i32 4, %ptr
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6615%result1 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 4 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6616 <i>; yields {i32}:result1 = 4</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6617%result2 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 2 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6618 <i>; yields {i32}:result2 = 8</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6619%result3 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 5 )
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6620 <i>; yields {i32}:result3 = 10</i>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6621%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 15</i>
Andrew Lenharthe44f3902008-02-21 06:45:13 +0000[diff] [blame]6622</pre>
6623</div>
6624
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6625<!-- _______________________________________________________________________ -->
6626<div class="doc_subsubsection">
6627 <a name="int_atomic_load_sub">'<tt>llvm.atomic.load.sub.*</tt>' Intrinsic</a>
6628
6629</div>
6630<div class="doc_text">
6631<h5>Syntax:</h5>
6632<p>
6633 This is an overloaded intrinsic. You can use <tt>llvm.atomic.load.sub</tt> on
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6634 any integer bit width and for different address spaces. Not all targets
6635 support all bit widths however.</p>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6636<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6637declare i8 @llvm.atomic.load.sub.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6638declare i16 @llvm.atomic.load.sub.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6639declare i32 @llvm.atomic.load.sub.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6640declare i64 @llvm.atomic.load.sub.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6641
6642</pre>
6643<h5>Overview:</h5>
6644<p>
6645 This intrinsic subtracts <tt>delta</tt> to the value stored in memory at
6646 <tt>ptr</tt>. It yields the original value at <tt>ptr</tt>.
6647</p>
6648<h5>Arguments:</h5>
6649<p>
6650
6651 The intrinsic takes two arguments, the first a pointer to an integer value
6652 and the second an integer value. The result is also an integer value. These
6653 integer types can have any bit width, but they must all have the same bit
6654 width. The targets may only lower integer representations they support.
6655</p>
6656<h5>Semantics:</h5>
6657<p>
6658 This intrinsic does a series of operations atomically. It first loads the
6659 value stored at <tt>ptr</tt>. It then subtracts <tt>delta</tt>, stores the
6660 result to <tt>ptr</tt>. It yields the original value stored at <tt>ptr</tt>.
6661</p>
6662
6663<h5>Examples:</h5>
6664<pre>
6665%ptr = malloc i32
6666 store i32 8, %ptr
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6667%result1 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 4 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6668 <i>; yields {i32}:result1 = 8</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6669%result2 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 2 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6670 <i>; yields {i32}:result2 = 4</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6671%result3 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 5 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6672 <i>; yields {i32}:result3 = 2</i>
6673%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = -3</i>
6674</pre>
6675</div>
6676
6677<!-- _______________________________________________________________________ -->
6678<div class="doc_subsubsection">
6679 <a name="int_atomic_load_and">'<tt>llvm.atomic.load.and.*</tt>' Intrinsic</a><br>
6680 <a name="int_atomic_load_nand">'<tt>llvm.atomic.load.nand.*</tt>' Intrinsic</a><br>
6681 <a name="int_atomic_load_or">'<tt>llvm.atomic.load.or.*</tt>' Intrinsic</a><br>
6682 <a name="int_atomic_load_xor">'<tt>llvm.atomic.load.xor.*</tt>' Intrinsic</a><br>
6683
6684</div>
6685<div class="doc_text">
6686<h5>Syntax:</h5>
6687<p>
6688 These are overloaded intrinsics. You can use <tt>llvm.atomic.load_and</tt>,
6689 <tt>llvm.atomic.load_nand</tt>, <tt>llvm.atomic.load_or</tt>, and
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6690 <tt>llvm.atomic.load_xor</tt> on any integer bit width and for different
6691 address spaces. Not all targets support all bit widths however.</p>
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6692<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6693declare i8 @llvm.atomic.load.and.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6694declare i16 @llvm.atomic.load.and.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6695declare i32 @llvm.atomic.load.and.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6696declare i64 @llvm.atomic.load.and.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6697
6698</pre>
6699
6700<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6701declare i8 @llvm.atomic.load.or.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6702declare i16 @llvm.atomic.load.or.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6703declare i32 @llvm.atomic.load.or.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6704declare i64 @llvm.atomic.load.or.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6705
6706</pre>
6707
6708<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6709declare i8 @llvm.atomic.load.nand.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6710declare i16 @llvm.atomic.load.nand.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6711declare i32 @llvm.atomic.load.nand.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6712declare i64 @llvm.atomic.load.nand.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6713
6714</pre>
6715
6716<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6717declare i8 @llvm.atomic.load.xor.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6718declare i16 @llvm.atomic.load.xor.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6719declare i32 @llvm.atomic.load.xor.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6720declare i64 @llvm.atomic.load.xor.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6721
6722</pre>
6723<h5>Overview:</h5>
6724<p>
6725 These intrinsics bitwise the operation (and, nand, or, xor) <tt>delta</tt> to
6726 the value stored in memory at <tt>ptr</tt>. It yields the original value
6727 at <tt>ptr</tt>.
6728</p>
6729<h5>Arguments:</h5>
6730<p>
6731
6732 These intrinsics take two arguments, the first a pointer to an integer value
6733 and the second an integer value. The result is also an integer value. These
6734 integer types can have any bit width, but they must all have the same bit
6735 width. The targets may only lower integer representations they support.
6736</p>
6737<h5>Semantics:</h5>
6738<p>
6739 These intrinsics does a series of operations atomically. They first load the
6740 value stored at <tt>ptr</tt>. They then do the bitwise operation
6741 <tt>delta</tt>, store the result to <tt>ptr</tt>. They yield the original
6742 value stored at <tt>ptr</tt>.
6743</p>
6744
6745<h5>Examples:</h5>
6746<pre>
6747%ptr = malloc i32
6748 store i32 0x0F0F, %ptr
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6749%result0 = call i32 @llvm.atomic.load.nand.i32.p0i32( i32* %ptr, i32 0xFF )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6750 <i>; yields {i32}:result0 = 0x0F0F</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6751%result1 = call i32 @llvm.atomic.load.and.i32.p0i32( i32* %ptr, i32 0xFF )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6752 <i>; yields {i32}:result1 = 0xFFFFFFF0</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6753%result2 = call i32 @llvm.atomic.load.or.i32.p0i32( i32* %ptr, i32 0F )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6754 <i>; yields {i32}:result2 = 0xF0</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6755%result3 = call i32 @llvm.atomic.load.xor.i32.p0i32( i32* %ptr, i32 0F )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6756 <i>; yields {i32}:result3 = FF</i>
6757%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = F0</i>
6758</pre>
6759</div>
6760
6761
6762<!-- _______________________________________________________________________ -->
6763<div class="doc_subsubsection">
6764 <a name="int_atomic_load_max">'<tt>llvm.atomic.load.max.*</tt>' Intrinsic</a><br>
6765 <a name="int_atomic_load_min">'<tt>llvm.atomic.load.min.*</tt>' Intrinsic</a><br>
6766 <a name="int_atomic_load_umax">'<tt>llvm.atomic.load.umax.*</tt>' Intrinsic</a><br>
6767 <a name="int_atomic_load_umin">'<tt>llvm.atomic.load.umin.*</tt>' Intrinsic</a><br>
6768
6769</div>
6770<div class="doc_text">
6771<h5>Syntax:</h5>
6772<p>
6773 These are overloaded intrinsics. You can use <tt>llvm.atomic.load_max</tt>,
6774 <tt>llvm.atomic.load_min</tt>, <tt>llvm.atomic.load_umax</tt>, and
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6775 <tt>llvm.atomic.load_umin</tt> on any integer bit width and for different
6776 address spaces. Not all targets
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6777 support all bit widths however.</p>
6778<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6779declare i8 @llvm.atomic.load.max.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6780declare i16 @llvm.atomic.load.max.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6781declare i32 @llvm.atomic.load.max.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6782declare i64 @llvm.atomic.load.max.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6783
6784</pre>
6785
6786<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6787declare i8 @llvm.atomic.load.min.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6788declare i16 @llvm.atomic.load.min.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6789declare i32 @llvm.atomic.load.min.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6790declare i64 @llvm.atomic.load.min.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6791
6792</pre>
6793
6794<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6795declare i8 @llvm.atomic.load.umax.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6796declare i16 @llvm.atomic.load.umax.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6797declare i32 @llvm.atomic.load.umax.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6798declare i64 @llvm.atomic.load.umax.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6799
6800</pre>
6801
6802<pre>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6803declare i8 @llvm.atomic.load.umin.i8..p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6804declare i16 @llvm.atomic.load.umin.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6805declare i32 @llvm.atomic.load.umin.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6806declare i64 @llvm.atomic.load.umin.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6807
6808</pre>
6809<h5>Overview:</h5>
6810<p>
6811 These intrinsics takes the signed or unsigned minimum or maximum of
6812 <tt>delta</tt> and the value stored in memory at <tt>ptr</tt>. It yields the
6813 original value at <tt>ptr</tt>.
6814</p>
6815<h5>Arguments:</h5>
6816<p>
6817
6818 These intrinsics take two arguments, the first a pointer to an integer value
6819 and the second an integer value. The result is also an integer value. These
6820 integer types can have any bit width, but they must all have the same bit
6821 width. The targets may only lower integer representations they support.
6822</p>
6823<h5>Semantics:</h5>
6824<p>
6825 These intrinsics does a series of operations atomically. They first load the
6826 value stored at <tt>ptr</tt>. They then do the signed or unsigned min or max
6827 <tt>delta</tt> and the value, store the result to <tt>ptr</tt>. They yield
6828 the original value stored at <tt>ptr</tt>.
6829</p>
6830
6831<h5>Examples:</h5>
6832<pre>
6833%ptr = malloc i32
6834 store i32 7, %ptr
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6835%result0 = call i32 @llvm.atomic.load.min.i32.p0i32( i32* %ptr, i32 -2 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6836 <i>; yields {i32}:result0 = 7</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6837%result1 = call i32 @llvm.atomic.load.max.i32.p0i32( i32* %ptr, i32 8 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6838 <i>; yields {i32}:result1 = -2</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6839%result2 = call i32 @llvm.atomic.load.umin.i32.p0i32( i32* %ptr, i32 10 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6840 <i>; yields {i32}:result2 = 8</i>
Mon P Wangce3ac892008-07-30 04:36:53 +0000[diff] [blame]6841%result3 = call i32 @llvm.atomic.load.umax.i32.p0i32( i32* %ptr, i32 30 )
Mon P Wang6bde9ec2008-06-25 08:15:39 +0000[diff] [blame]6842 <i>; yields {i32}:result3 = 8</i>
6843%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 30</i>
6844</pre>
6845</div>
Andrew Lenharth785610d2008-02-16 01:24:58 +0000[diff] [blame]6846
6847<!-- ======================================================================= -->
6848<div class="doc_subsection">
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6849 <a name="int_general">General Intrinsics</a>
6850</div>
6851
6852<div class="doc_text">
6853<p> This class of intrinsics is designed to be generic and has
6854no specific purpose. </p>
6855</div>
6856
6857<!-- _______________________________________________________________________ -->
6858<div class="doc_subsubsection">
6859 <a name="int_var_annotation">'<tt>llvm.var.annotation</tt>' Intrinsic</a>
6860</div>
6861
6862<div class="doc_text">
6863
6864<h5>Syntax:</h5>
6865<pre>
6866 declare void @llvm.var.annotation(i8* &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6867</pre>
6868
6869<h5>Overview:</h5>
6870
6871<p>
6872The '<tt>llvm.var.annotation</tt>' intrinsic
6873</p>
6874
6875<h5>Arguments:</h5>
6876
6877<p>
6878The first argument is a pointer to a value, the second is a pointer to a
6879global string, the third is a pointer to a global string which is the source
6880file name, and the last argument is the line number.
6881</p>
6882
6883<h5>Semantics:</h5>
6884
6885<p>
Anton Korobeynikove6e764f2008-01-15 22:31:34 +0000[diff] [blame]6886This intrinsic allows annotation of local variables with arbitrary strings.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6887This can be useful for special purpose optimizations that want to look for these
Anton Korobeynikove6e764f2008-01-15 22:31:34 +0000[diff] [blame]6888annotations. These have no other defined use, they are ignored by code
6889generation and optimization.
6890</p>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6891</div>
6892
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6893<!-- _______________________________________________________________________ -->
6894<div class="doc_subsubsection">
Tanya Lattnerc9869b12007-09-21 23:57:59 +0000[diff] [blame]6895 <a name="int_annotation">'<tt>llvm.annotation.*</tt>' Intrinsic</a>
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6896</div>
6897
6898<div class="doc_text">
6899
6900<h5>Syntax:</h5>
Tanya Lattnere545be72007-09-21 23:56:27 +0000[diff] [blame]6901<p>This is an overloaded intrinsic. You can use '<tt>llvm.annotation</tt>' on
6902any integer bit width.
6903</p>
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6904<pre>
Tanya Lattner09161fe2007-09-22 00:03:01 +0000[diff] [blame]6905 declare i8 @llvm.annotation.i8(i8 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6906 declare i16 @llvm.annotation.i16(i16 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6907 declare i32 @llvm.annotation.i32(i32 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6908 declare i64 @llvm.annotation.i64(i64 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6909 declare i256 @llvm.annotation.i256(i256 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6910</pre>
6911
6912<h5>Overview:</h5>
Tanya Lattnere545be72007-09-21 23:56:27 +0000[diff] [blame]6913
6914<p>
6915The '<tt>llvm.annotation</tt>' intrinsic.
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6916</p>
6917
6918<h5>Arguments:</h5>
6919
6920<p>
6921The first argument is an integer value (result of some expression),
6922the second is a pointer to a global string, the third is a pointer to a global
6923string which is the source file name, and the last argument is the line number.
Tanya Lattnere545be72007-09-21 23:56:27 +0000[diff] [blame]6924It returns the value of the first argument.
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6925</p>
6926
6927<h5>Semantics:</h5>
6928
6929<p>
6930This intrinsic allows annotations to be put on arbitrary expressions
6931with arbitrary strings. This can be useful for special purpose optimizations
6932that want to look for these annotations. These have no other defined use, they
6933are ignored by code generation and optimization.
Dan Gohman2672f3e2008-10-14 16:51:45 +0000[diff] [blame]6934</p>
Tanya Lattnerb306a9e2007-09-21 22:59:12 +0000[diff] [blame]6935</div>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]6936
Anton Korobeynikove6e764f2008-01-15 22:31:34 +0000[diff] [blame]6937<!-- _______________________________________________________________________ -->
6938<div class="doc_subsubsection">
6939 <a name="int_trap">'<tt>llvm.trap</tt>' Intrinsic</a>
6940</div>
6941
6942<div class="doc_text">
6943
6944<h5>Syntax:</h5>
6945<pre>
6946 declare void @llvm.trap()
6947</pre>
6948
6949<h5>Overview:</h5>
6950
6951<p>
6952The '<tt>llvm.trap</tt>' intrinsic
6953</p>
6954
6955<h5>Arguments:</h5>
6956
6957<p>
6958None
6959</p>
6960
6961<h5>Semantics:</h5>
6962
6963<p>
6964This intrinsics is lowered to the target dependent trap instruction. If the
6965target does not have a trap instruction, this intrinsic will be lowered to the
6966call of the abort() function.
6967</p>
6968</div>
6969
Bill Wendlinge4164592008-11-19 05:56:17 +0000[diff] [blame]6970<!-- _______________________________________________________________________ -->
6971<div class="doc_subsubsection">
Misha Brukman5dd7f4d2008-11-22 23:55:29 +0000[diff] [blame]6972 <a name="int_stackprotector">'<tt>llvm.stackprotector</tt>' Intrinsic</a>
Bill Wendlinge4164592008-11-19 05:56:17 +0000[diff] [blame]6973</div>
6974<div class="doc_text">
6975<h5>Syntax:</h5>
6976<pre>
6977declare void @llvm.stackprotector( i8* &lt;guard&gt;, i8** &lt;slot&gt; )
6978
6979</pre>
6980<h5>Overview:</h5>
6981<p>
6982 The <tt>llvm.stackprotector</tt> intrinsic takes the <tt>guard</tt> and stores
6983 it onto the stack at <tt>slot</tt>. The stack slot is adjusted to ensure that
6984 it is placed on the stack before local variables.
6985</p>
6986<h5>Arguments:</h5>
6987<p>
6988 The <tt>llvm.stackprotector</tt> intrinsic requires two pointer arguments. The
6989 first argument is the value loaded from the stack guard
6990 <tt>@__stack_chk_guard</tt>. The second variable is an <tt>alloca</tt> that
6991 has enough space to hold the value of the guard.
6992</p>
6993<h5>Semantics:</h5>
6994<p>
6995 This intrinsic causes the prologue/epilogue inserter to force the position of
6996 the <tt>AllocaInst</tt> stack slot to be before local variables on the
6997 stack. This is to ensure that if a local variable on the stack is overwritten,
6998 it will destroy the value of the guard. When the function exits, the guard on
6999 the stack is checked against the original guard. If they're different, then
7000 the program aborts by calling the <tt>__stack_chk_fail()</tt> function.
7001</p>
7002</div>
7003
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]7004<!-- *********************************************************************** -->
7005<hr>
7006<address>
7007 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
Misha Brukman947321d2008-12-11 17:34:48 +0000[diff] [blame]7008 src="http://jigsaw.w3.org/css-validator/images/vcss-blue" alt="Valid CSS"></a>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]7009 <a href="http://validator.w3.org/check/referer"><img
Misha Brukman947321d2008-12-11 17:34:48 +0000[diff] [blame]7010 src="http://www.w3.org/Icons/valid-html401-blue" alt="Valid HTML 4.01"></a>
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]7011
7012 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
7013 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
7014 Last modified: $Date$
7015</address>
Chris Lattner08497ce2008-01-04 04:33:49 +0000[diff] [blame]7016
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000[diff] [blame]7017</body>
7018</html>