blob: 523abfaeefacf461eec69ceda9ef20d970eb5d04 [file] [log] [blame]
Misha Brukmanc501f552004-03-01 17:47:27 +00001<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
Misha Brukman76307852003-11-08 01:05:38 +00003<html>
4<head>
5 <title>LLVM Assembly Language Reference Manual</title>
Reid Spencercb84e432004-08-26 20:44:00 +00006 <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.">
Misha Brukman76307852003-11-08 01:05:38 +000010 <link rel="stylesheet" href="llvm.css" type="text/css">
11</head>
Chris Lattner757528b0b2004-05-23 21:06:01 +000012
Misha Brukman76307852003-11-08 01:05:38 +000013<body>
Chris Lattner757528b0b2004-05-23 21:06:01 +000014
Chris Lattner48b383b02003-11-25 01:02:51 +000015<div class="doc_title"> LLVM Language Reference Manual </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +000016<ol>
Misha Brukman76307852003-11-08 01:05:38 +000017 <li><a href="#abstract">Abstract</a></li>
18 <li><a href="#introduction">Introduction</a></li>
19 <li><a href="#identifiers">Identifiers</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000020 <li><a href="#highlevel">High Level Structure</a>
21 <ol>
22 <li><a href="#modulestructure">Module Structure</a></li>
Chris Lattnerd79749a2004-12-09 16:36:40 +000023 <li><a href="#linkage">Linkage Types</a></li>
Chris Lattner0132aff2005-05-06 22:57:40 +000024 <li><a href="#callingconv">Calling Conventions</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000025 <li><a href="#globalvars">Global Variables</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000026 <li><a href="#functionstructure">Functions</a></li>
Anton Korobeynikov546ea7e2007-04-29 18:02:48 +000027 <li><a href="#aliasstructure">Aliases</a>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +000028 <li><a href="#paramattrs">Parameter Attributes</a></li>
Devang Patel9eb525d2008-09-26 23:51:19 +000029 <li><a href="#fnattrs">Function Attributes</a></li>
Gordon Henriksen71183b62007-12-10 03:18:06 +000030 <li><a href="#gc">Garbage Collector Names</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000031 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
Reid Spencer50c723a2007-02-19 23:54:10 +000032 <li><a href="#datalayout">Data Layout</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000033 </ol>
34 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000035 <li><a href="#typesystem">Type System</a>
36 <ol>
Chris Lattner7824d182008-01-04 04:32:38 +000037 <li><a href="#t_classifications">Type Classifications</a></li>
Robert Bocchino820bc75b2006-02-17 21:18:08 +000038 <li><a href="#t_primitive">Primitive Types</a>
Chris Lattner48b383b02003-11-25 01:02:51 +000039 <ol>
Chris Lattner7824d182008-01-04 04:32:38 +000040 <li><a href="#t_floating">Floating Point Types</a></li>
41 <li><a href="#t_void">Void Type</a></li>
42 <li><a href="#t_label">Label Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000043 </ol>
44 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000045 <li><a href="#t_derived">Derived Types</a>
46 <ol>
Chris Lattner9a2e3cb2007-12-18 06:18:21 +000047 <li><a href="#t_integer">Integer Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000048 <li><a href="#t_array">Array Type</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000049 <li><a href="#t_function">Function Type</a></li>
50 <li><a href="#t_pointer">Pointer Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000051 <li><a href="#t_struct">Structure Type</a></li>
Andrew Lenharth8df88e22006-12-08 17:13:00 +000052 <li><a href="#t_pstruct">Packed Structure Type</a></li>
Reid Spencer404a3252007-02-15 03:07:05 +000053 <li><a href="#t_vector">Vector Type</a></li>
Chris Lattner37b6b092005-04-25 17:34:15 +000054 <li><a href="#t_opaque">Opaque Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000055 </ol>
56 </li>
57 </ol>
58 </li>
Chris Lattner6af02f32004-12-09 16:11:40 +000059 <li><a href="#constants">Constants</a>
Chris Lattner74d3f822004-12-09 17:30:23 +000060 <ol>
61 <li><a href="#simpleconstants">Simple Constants</a>
62 <li><a href="#aggregateconstants">Aggregate Constants</a>
63 <li><a href="#globalconstants">Global Variable and Function Addresses</a>
64 <li><a href="#undefvalues">Undefined Values</a>
65 <li><a href="#constantexprs">Constant Expressions</a>
66 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000067 </li>
Chris Lattner98f013c2006-01-25 23:47:57 +000068 <li><a href="#othervalues">Other Values</a>
69 <ol>
70 <li><a href="#inlineasm">Inline Assembler Expressions</a>
71 </ol>
72 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000073 <li><a href="#instref">Instruction Reference</a>
74 <ol>
75 <li><a href="#terminators">Terminator Instructions</a>
76 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000077 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
78 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000079 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
80 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000081 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
Chris Lattner08b7d5b2004-10-16 18:04:13 +000082 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000083 </ol>
84 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000085 <li><a href="#binaryops">Binary Operations</a>
86 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000087 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
88 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
89 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
Reid Spencer7e80b0b2006-10-26 06:15:43 +000090 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
91 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
92 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
Reid Spencer7eb55b32006-11-02 01:53:59 +000093 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
94 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
95 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000096 </ol>
97 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000098 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
99 <ol>
Reid Spencer2ab01932007-02-02 13:57:07 +0000100 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
101 <li><a href="#i_lshr">'<tt>lshr</tt>' Instruction</a></li>
102 <li><a href="#i_ashr">'<tt>ashr</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +0000103 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000104 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +0000105 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000106 </ol>
107 </li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000108 <li><a href="#vectorops">Vector Operations</a>
109 <ol>
110 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
111 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
112 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000113 </ol>
114 </li>
Dan Gohmanb9d66602008-05-12 23:51:09 +0000115 <li><a href="#aggregateops">Aggregate Operations</a>
116 <ol>
117 <li><a href="#i_extractvalue">'<tt>extractvalue</tt>' Instruction</a></li>
118 <li><a href="#i_insertvalue">'<tt>insertvalue</tt>' Instruction</a></li>
119 </ol>
120 </li>
Chris Lattner6ab66722006-08-15 00:45:58 +0000121 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000122 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000123 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
124 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
125 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
Robert Bocchino820bc75b2006-02-17 21:18:08 +0000126 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
127 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
128 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000129 </ol>
130 </li>
Reid Spencer97c5fa42006-11-08 01:18:52 +0000131 <li><a href="#convertops">Conversion Operations</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000132 <ol>
133 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
134 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
135 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
136 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
137 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
Reid Spencer51b07252006-11-09 23:03:26 +0000138 <li><a href="#i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a></li>
139 <li><a href="#i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a></li>
140 <li><a href="#i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a></li>
141 <li><a href="#i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a></li>
Reid Spencerb7344ff2006-11-11 21:00:47 +0000142 <li><a href="#i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a></li>
143 <li><a href="#i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a></li>
Reid Spencer5b950642006-11-11 23:08:07 +0000144 <li><a href="#i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a></li>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000145 </ol>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000146 <li><a href="#otherops">Other Operations</a>
147 <ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +0000148 <li><a href="#i_icmp">'<tt>icmp</tt>' Instruction</a></li>
149 <li><a href="#i_fcmp">'<tt>fcmp</tt>' Instruction</a></li>
Nate Begemand2195702008-05-12 19:01:56 +0000150 <li><a href="#i_vicmp">'<tt>vicmp</tt>' Instruction</a></li>
151 <li><a href="#i_vfcmp">'<tt>vfcmp</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000152 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
Chris Lattnerb53c28d2004-03-12 05:50:16 +0000153 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000154 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
Chris Lattner33337472006-01-13 23:26:01 +0000155 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000156 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000157 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000158 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000159 </li>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000160 <li><a href="#intrinsics">Intrinsic Functions</a>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000161 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000162 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
163 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000164 <li><a href="#int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
165 <li><a href="#int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
166 <li><a href="#int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000167 </ol>
168 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000169 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
170 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000171 <li><a href="#int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a></li>
172 <li><a href="#int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a></li>
173 <li><a href="#int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a></li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000174 </ol>
175 </li>
Chris Lattner3649c3a2004-02-14 04:08:35 +0000176 <li><a href="#int_codegen">Code Generator Intrinsics</a>
177 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000178 <li><a href="#int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a></li>
179 <li><a href="#int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a></li>
180 <li><a href="#int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a></li>
181 <li><a href="#int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a></li>
182 <li><a href="#int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a></li>
183 <li><a href="#int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a></li>
184 <li><a href="#int_readcyclecounter"><tt>llvm.readcyclecounter</tt>' Intrinsic</a></li>
John Criswellaa1c3c12004-04-09 16:43:20 +0000185 </ol>
186 </li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000187 <li><a href="#int_libc">Standard C Library Intrinsics</a>
188 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000189 <li><a href="#int_memcpy">'<tt>llvm.memcpy.*</tt>' Intrinsic</a></li>
190 <li><a href="#int_memmove">'<tt>llvm.memmove.*</tt>' Intrinsic</a></li>
191 <li><a href="#int_memset">'<tt>llvm.memset.*</tt>' Intrinsic</a></li>
192 <li><a href="#int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a></li>
193 <li><a href="#int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a></li>
Dan Gohmanb6324c12007-10-15 20:30:11 +0000194 <li><a href="#int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a></li>
195 <li><a href="#int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a></li>
196 <li><a href="#int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a></li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000197 </ol>
198 </li>
Nate Begeman0f223bb2006-01-13 23:26:38 +0000199 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000200 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000201 <li><a href="#int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
Chris Lattnerb748c672006-01-16 22:34:14 +0000202 <li><a href="#int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic </a></li>
203 <li><a href="#int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic </a></li>
204 <li><a href="#int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic </a></li>
Reid Spencer5bf54c82007-04-11 23:23:49 +0000205 <li><a href="#int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic </a></li>
206 <li><a href="#int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic </a></li>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000207 </ol>
208 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000209 <li><a href="#int_debugger">Debugger intrinsics</a></li>
Jim Laskey2211f492007-03-14 19:31:19 +0000210 <li><a href="#int_eh">Exception Handling intrinsics</a></li>
Duncan Sands86e01192007-09-11 14:10:23 +0000211 <li><a href="#int_trampoline">Trampoline Intrinsic</a>
Duncan Sands644f9172007-07-27 12:58:54 +0000212 <ol>
213 <li><a href="#int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a></li>
Duncan Sands644f9172007-07-27 12:58:54 +0000214 </ol>
215 </li>
Andrew Lenharth9b254ee2008-02-16 01:24:58 +0000216 <li><a href="#int_atomics">Atomic intrinsics</a>
217 <ol>
Andrew Lenharth95528942008-02-21 06:45:13 +0000218 <li><a href="#int_memory_barrier"><tt>llvm.memory_barrier</tt></a></li>
Mon P Wang6a490372008-06-25 08:15:39 +0000219 <li><a href="#int_atomic_cmp_swap"><tt>llvm.atomic.cmp.swap</tt></a></li>
Andrew Lenharth95528942008-02-21 06:45:13 +0000220 <li><a href="#int_atomic_swap"><tt>llvm.atomic.swap</tt></a></li>
Mon P Wang6a490372008-06-25 08:15:39 +0000221 <li><a href="#int_atomic_load_add"><tt>llvm.atomic.load.add</tt></a></li>
222 <li><a href="#int_atomic_load_sub"><tt>llvm.atomic.load.sub</tt></a></li>
223 <li><a href="#int_atomic_load_and"><tt>llvm.atomic.load.and</tt></a></li>
224 <li><a href="#int_atomic_load_nand"><tt>llvm.atomic.load.nand</tt></a></li>
225 <li><a href="#int_atomic_load_or"><tt>llvm.atomic.load.or</tt></a></li>
226 <li><a href="#int_atomic_load_xor"><tt>llvm.atomic.load.xor</tt></a></li>
227 <li><a href="#int_atomic_load_max"><tt>llvm.atomic.load.max</tt></a></li>
228 <li><a href="#int_atomic_load_min"><tt>llvm.atomic.load.min</tt></a></li>
229 <li><a href="#int_atomic_load_umax"><tt>llvm.atomic.load.umax</tt></a></li>
230 <li><a href="#int_atomic_load_umin"><tt>llvm.atomic.load.umin</tt></a></li>
Andrew Lenharth9b254ee2008-02-16 01:24:58 +0000231 </ol>
232 </li>
Reid Spencer5b2cb0f2007-07-20 19:59:11 +0000233 <li><a href="#int_general">General intrinsics</a>
Tanya Lattnercb1b9602007-06-15 20:50:54 +0000234 <ol>
Reid Spencer5b2cb0f2007-07-20 19:59:11 +0000235 <li><a href="#int_var_annotation">
Tanya Lattner08abc812007-09-22 00:01:26 +0000236 <tt>llvm.var.annotation</tt>' Intrinsic</a></li>
Tanya Lattner293c0372007-09-21 22:59:12 +0000237 <li><a href="#int_annotation">
Tanya Lattner08abc812007-09-22 00:01:26 +0000238 <tt>llvm.annotation.*</tt>' Intrinsic</a></li>
Anton Korobeynikov06cbb652008-01-15 22:31:34 +0000239 <li><a href="#int_trap">
240 <tt>llvm.trap</tt>' Intrinsic</a></li>
Tanya Lattner293c0372007-09-21 22:59:12 +0000241 </ol>
Tanya Lattnercb1b9602007-06-15 20:50:54 +0000242 </li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000243 </ol>
244 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000245</ol>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000246
247<div class="doc_author">
248 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
249 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
Misha Brukman76307852003-11-08 01:05:38 +0000250</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000251
Chris Lattner2f7c9632001-06-06 20:29:01 +0000252<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000253<div class="doc_section"> <a name="abstract">Abstract </a></div>
254<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000255
Misha Brukman76307852003-11-08 01:05:38 +0000256<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +0000257<p>This document is a reference manual for the LLVM assembly language.
Bill Wendling6e03f9a2008-08-05 22:29:16 +0000258LLVM is a Static Single Assignment (SSA) based representation that provides
Chris Lattner67c37d12008-08-05 18:29:16 +0000259type safety, low-level operations, flexibility, and the capability of
260representing 'all' high-level languages cleanly. It is the common code
Chris Lattner48b383b02003-11-25 01:02:51 +0000261representation used throughout all phases of the LLVM compilation
262strategy.</p>
Misha Brukman76307852003-11-08 01:05:38 +0000263</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000264
Chris Lattner2f7c9632001-06-06 20:29:01 +0000265<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000266<div class="doc_section"> <a name="introduction">Introduction</a> </div>
267<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000268
Misha Brukman76307852003-11-08 01:05:38 +0000269<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000270
Chris Lattner48b383b02003-11-25 01:02:51 +0000271<p>The LLVM code representation is designed to be used in three
Gabor Greifa54634a2007-07-06 22:07:22 +0000272different forms: as an in-memory compiler IR, as an on-disk bitcode
Chris Lattner48b383b02003-11-25 01:02:51 +0000273representation (suitable for fast loading by a Just-In-Time compiler),
274and as a human readable assembly language representation. This allows
275LLVM to provide a powerful intermediate representation for efficient
276compiler transformations and analysis, while providing a natural means
277to debug and visualize the transformations. The three different forms
278of LLVM are all equivalent. This document describes the human readable
279representation and notation.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000280
John Criswell4a3327e2005-05-13 22:25:59 +0000281<p>The LLVM representation aims to be light-weight and low-level
Chris Lattner48b383b02003-11-25 01:02:51 +0000282while being expressive, typed, and extensible at the same time. It
283aims to be a "universal IR" of sorts, by being at a low enough level
284that high-level ideas may be cleanly mapped to it (similar to how
285microprocessors are "universal IR's", allowing many source languages to
286be mapped to them). By providing type information, LLVM can be used as
287the target of optimizations: for example, through pointer analysis, it
288can be proven that a C automatic variable is never accessed outside of
289the current function... allowing it to be promoted to a simple SSA
290value instead of a memory location.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000291
Misha Brukman76307852003-11-08 01:05:38 +0000292</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000293
Chris Lattner2f7c9632001-06-06 20:29:01 +0000294<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000295<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000296
Misha Brukman76307852003-11-08 01:05:38 +0000297<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000298
Chris Lattner48b383b02003-11-25 01:02:51 +0000299<p>It is important to note that this document describes 'well formed'
300LLVM assembly language. There is a difference between what the parser
301accepts and what is considered 'well formed'. For example, the
302following instruction is syntactically okay, but not well formed:</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000303
Bill Wendling3716c5d2007-05-29 09:04:49 +0000304<div class="doc_code">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000305<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000306%x = <a href="#i_add">add</a> i32 1, %x
Chris Lattner757528b0b2004-05-23 21:06:01 +0000307</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000308</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000309
Chris Lattner48b383b02003-11-25 01:02:51 +0000310<p>...because the definition of <tt>%x</tt> does not dominate all of
311its uses. The LLVM infrastructure provides a verification pass that may
312be used to verify that an LLVM module is well formed. This pass is
John Criswell4a3327e2005-05-13 22:25:59 +0000313automatically run by the parser after parsing input assembly and by
Gabor Greifa54634a2007-07-06 22:07:22 +0000314the optimizer before it outputs bitcode. The violations pointed out
Chris Lattner48b383b02003-11-25 01:02:51 +0000315by the verifier pass indicate bugs in transformation passes or input to
316the parser.</p>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000317</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000318
Chris Lattner87a3dbe2007-10-03 17:34:29 +0000319<!-- Describe the typesetting conventions here. -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000320
Chris Lattner2f7c9632001-06-06 20:29:01 +0000321<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000322<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000323<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000324
Misha Brukman76307852003-11-08 01:05:38 +0000325<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000326
Reid Spencerb23b65f2007-08-07 14:34:28 +0000327 <p>LLVM identifiers come in two basic types: global and local. Global
328 identifiers (functions, global variables) begin with the @ character. Local
329 identifiers (register names, types) begin with the % character. Additionally,
330 there are three different formats for identifiers, for different purposes:
Chris Lattner757528b0b2004-05-23 21:06:01 +0000331
Chris Lattner2f7c9632001-06-06 20:29:01 +0000332<ol>
Reid Spencerb23b65f2007-08-07 14:34:28 +0000333 <li>Named values are represented as a string of characters with their prefix.
334 For example, %foo, @DivisionByZero, %a.really.long.identifier. The actual
335 regular expression used is '<tt>[%@][a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
Chris Lattnerd79749a2004-12-09 16:36:40 +0000336 Identifiers which require other characters in their names can be surrounded
Reid Spencerb23b65f2007-08-07 14:34:28 +0000337 with quotes. In this way, anything except a <tt>&quot;</tt> character can
338 be used in a named value.</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000339
Reid Spencerb23b65f2007-08-07 14:34:28 +0000340 <li>Unnamed values are represented as an unsigned numeric value with their
341 prefix. For example, %12, @2, %44.</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000342
Reid Spencer8f08d802004-12-09 18:02:53 +0000343 <li>Constants, which are described in a <a href="#constants">section about
344 constants</a>, below.</li>
Misha Brukman76307852003-11-08 01:05:38 +0000345</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000346
Reid Spencerb23b65f2007-08-07 14:34:28 +0000347<p>LLVM requires that values start with a prefix for two reasons: Compilers
Chris Lattnerd79749a2004-12-09 16:36:40 +0000348don't need to worry about name clashes with reserved words, and the set of
349reserved words may be expanded in the future without penalty. Additionally,
350unnamed identifiers allow a compiler to quickly come up with a temporary
351variable without having to avoid symbol table conflicts.</p>
352
Chris Lattner48b383b02003-11-25 01:02:51 +0000353<p>Reserved words in LLVM are very similar to reserved words in other
Reid Spencer5b950642006-11-11 23:08:07 +0000354languages. There are keywords for different opcodes
355('<tt><a href="#i_add">add</a></tt>',
356 '<tt><a href="#i_bitcast">bitcast</a></tt>',
357 '<tt><a href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000358href="#t_void">void</a></tt>', '<tt><a href="#t_primitive">i32</a></tt>', etc...),
Chris Lattnerd79749a2004-12-09 16:36:40 +0000359and others. These reserved words cannot conflict with variable names, because
Reid Spencerb23b65f2007-08-07 14:34:28 +0000360none of them start with a prefix character ('%' or '@').</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000361
362<p>Here is an example of LLVM code to multiply the integer variable
363'<tt>%X</tt>' by 8:</p>
364
Misha Brukman76307852003-11-08 01:05:38 +0000365<p>The easy way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000366
Bill Wendling3716c5d2007-05-29 09:04:49 +0000367<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000368<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000369%result = <a href="#i_mul">mul</a> i32 %X, 8
Chris Lattnerd79749a2004-12-09 16:36:40 +0000370</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000371</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000372
Misha Brukman76307852003-11-08 01:05:38 +0000373<p>After strength reduction:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000374
Bill Wendling3716c5d2007-05-29 09:04:49 +0000375<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000376<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000377%result = <a href="#i_shl">shl</a> i32 %X, i8 3
Chris Lattnerd79749a2004-12-09 16:36:40 +0000378</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000379</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000380
Misha Brukman76307852003-11-08 01:05:38 +0000381<p>And the hard way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000382
Bill Wendling3716c5d2007-05-29 09:04:49 +0000383<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000384<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000385<a href="#i_add">add</a> i32 %X, %X <i>; yields {i32}:%0</i>
386<a href="#i_add">add</a> i32 %0, %0 <i>; yields {i32}:%1</i>
387%result = <a href="#i_add">add</a> i32 %1, %1
Chris Lattnerd79749a2004-12-09 16:36:40 +0000388</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000389</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000390
Chris Lattner48b383b02003-11-25 01:02:51 +0000391<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
392important lexical features of LLVM:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000393
Chris Lattner2f7c9632001-06-06 20:29:01 +0000394<ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000395
396 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
397 line.</li>
398
399 <li>Unnamed temporaries are created when the result of a computation is not
400 assigned to a named value.</li>
401
Misha Brukman76307852003-11-08 01:05:38 +0000402 <li>Unnamed temporaries are numbered sequentially</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000403
Misha Brukman76307852003-11-08 01:05:38 +0000404</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000405
John Criswell02fdc6f2005-05-12 16:52:32 +0000406<p>...and it also shows a convention that we follow in this document. When
Chris Lattnerd79749a2004-12-09 16:36:40 +0000407demonstrating instructions, we will follow an instruction with a comment that
408defines the type and name of value produced. Comments are shown in italic
409text.</p>
410
Misha Brukman76307852003-11-08 01:05:38 +0000411</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000412
413<!-- *********************************************************************** -->
414<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
415<!-- *********************************************************************** -->
416
417<!-- ======================================================================= -->
418<div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
419</div>
420
421<div class="doc_text">
422
423<p>LLVM programs are composed of "Module"s, each of which is a
424translation unit of the input programs. Each module consists of
425functions, global variables, and symbol table entries. Modules may be
426combined together with the LLVM linker, which merges function (and
427global variable) definitions, resolves forward declarations, and merges
428symbol table entries. Here is an example of the "hello world" module:</p>
429
Bill Wendling3716c5d2007-05-29 09:04:49 +0000430<div class="doc_code">
Chris Lattner6af02f32004-12-09 16:11:40 +0000431<pre><i>; Declare the string constant as a global constant...</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000432<a href="#identifiers">@.LC0</a> = <a href="#linkage_internal">internal</a> <a
433 href="#globalvars">constant</a> <a href="#t_array">[13 x i8]</a> c"hello world\0A\00" <i>; [13 x i8]*</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000434
435<i>; External declaration of the puts function</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000436<a href="#functionstructure">declare</a> i32 @puts(i8 *) <i>; i32(i8 *)* </i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000437
438<i>; Definition of main function</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000439define i32 @main() { <i>; i32()* </i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000440 <i>; Convert [13x i8 ]* to i8 *...</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000441 %cast210 = <a
Chris Lattner2150cde2007-06-12 17:01:15 +0000442 href="#i_getelementptr">getelementptr</a> [13 x i8 ]* @.LC0, i64 0, i64 0 <i>; i8 *</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000443
444 <i>; Call puts function to write out the string to stdout...</i>
445 <a
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000446 href="#i_call">call</a> i32 @puts(i8 * %cast210) <i>; i32</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000447 <a
Bill Wendling3716c5d2007-05-29 09:04:49 +0000448 href="#i_ret">ret</a> i32 0<br>}<br>
449</pre>
450</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000451
452<p>This example is made up of a <a href="#globalvars">global variable</a>
453named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
454function, and a <a href="#functionstructure">function definition</a>
455for "<tt>main</tt>".</p>
456
Chris Lattnerd79749a2004-12-09 16:36:40 +0000457<p>In general, a module is made up of a list of global values,
458where both functions and global variables are global values. Global values are
459represented by a pointer to a memory location (in this case, a pointer to an
460array of char, and a pointer to a function), and have one of the following <a
461href="#linkage">linkage types</a>.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000462
Chris Lattnerd79749a2004-12-09 16:36:40 +0000463</div>
464
465<!-- ======================================================================= -->
466<div class="doc_subsection">
467 <a name="linkage">Linkage Types</a>
468</div>
469
470<div class="doc_text">
471
472<p>
473All Global Variables and Functions have one of the following types of linkage:
474</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000475
476<dl>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000477
Dale Johannesen4188aad2008-05-23 23:13:41 +0000478 <dt><tt><b><a name="linkage_internal">internal</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000479
480 <dd>Global values with internal linkage are only directly accessible by
481 objects in the current module. In particular, linking code into a module with
482 an internal global value may cause the internal to be renamed as necessary to
483 avoid collisions. Because the symbol is internal to the module, all
484 references can be updated. This corresponds to the notion of the
Chris Lattnere20b4702007-01-14 06:51:48 +0000485 '<tt>static</tt>' keyword in C.
Chris Lattner6af02f32004-12-09 16:11:40 +0000486 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000487
Chris Lattner6af02f32004-12-09 16:11:40 +0000488 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000489
Chris Lattnere20b4702007-01-14 06:51:48 +0000490 <dd>Globals with "<tt>linkonce</tt>" linkage are merged with other globals of
491 the same name when linkage occurs. This is typically used to implement
492 inline functions, templates, or other code which must be generated in each
493 translation unit that uses it. Unreferenced <tt>linkonce</tt> globals are
494 allowed to be discarded.
Chris Lattner6af02f32004-12-09 16:11:40 +0000495 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000496
Dale Johannesen4188aad2008-05-23 23:13:41 +0000497 <dt><tt><b><a name="linkage_common">common</a></b></tt>: </dt>
498
499 <dd>"<tt>common</tt>" linkage is exactly the same as <tt>linkonce</tt>
500 linkage, except that unreferenced <tt>common</tt> globals may not be
501 discarded. This is used for globals that may be emitted in multiple
502 translation units, but that are not guaranteed to be emitted into every
503 translation unit that uses them. One example of this is tentative
504 definitions in C, such as "<tt>int X;</tt>" at global scope.
505 </dd>
506
Chris Lattner6af02f32004-12-09 16:11:40 +0000507 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000508
Dale Johannesen4188aad2008-05-23 23:13:41 +0000509 <dd>"<tt>weak</tt>" linkage is the same as <tt>common</tt> linkage, except
510 that some targets may choose to emit different assembly sequences for them
511 for target-dependent reasons. This is used for globals that are declared
512 "weak" in C source code.
Chris Lattner6af02f32004-12-09 16:11:40 +0000513 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000514
Chris Lattner6af02f32004-12-09 16:11:40 +0000515 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000516
517 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
518 pointer to array type. When two global variables with appending linkage are
519 linked together, the two global arrays are appended together. This is the
520 LLVM, typesafe, equivalent of having the system linker append together
521 "sections" with identical names when .o files are linked.
Chris Lattner6af02f32004-12-09 16:11:40 +0000522 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000523
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000524 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
Chris Lattner67c37d12008-08-05 18:29:16 +0000525 <dd>The semantics of this linkage follow the ELF object file model: the
526 symbol is weak until linked, if not linked, the symbol becomes null instead
527 of being an undefined reference.
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000528 </dd>
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000529
Chris Lattner6af02f32004-12-09 16:11:40 +0000530 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000531
532 <dd>If none of the above identifiers are used, the global is externally
533 visible, meaning that it participates in linkage and can be used to resolve
534 external symbol references.
Chris Lattner6af02f32004-12-09 16:11:40 +0000535 </dd>
Reid Spencer7972c472007-04-11 23:49:50 +0000536</dl>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000537
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000538 <p>
539 The next two types of linkage are targeted for Microsoft Windows platform
540 only. They are designed to support importing (exporting) symbols from (to)
Chris Lattner67c37d12008-08-05 18:29:16 +0000541 DLLs (Dynamic Link Libraries).
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000542 </p>
543
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000544 <dl>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000545 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
546
547 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
548 or variable via a global pointer to a pointer that is set up by the DLL
549 exporting the symbol. On Microsoft Windows targets, the pointer name is
550 formed by combining <code>_imp__</code> and the function or variable name.
551 </dd>
552
553 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
554
555 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
556 pointer to a pointer in a DLL, so that it can be referenced with the
557 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
558 name is formed by combining <code>_imp__</code> and the function or variable
559 name.
560 </dd>
561
Chris Lattner6af02f32004-12-09 16:11:40 +0000562</dl>
563
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000564<p><a name="linkage_external"></a>For example, since the "<tt>.LC0</tt>"
Chris Lattner6af02f32004-12-09 16:11:40 +0000565variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
566variable and was linked with this one, one of the two would be renamed,
567preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
568external (i.e., lacking any linkage declarations), they are accessible
Reid Spencer92c671e2007-01-05 00:59:10 +0000569outside of the current module.</p>
570<p>It is illegal for a function <i>declaration</i>
571to have any linkage type other than "externally visible", <tt>dllimport</tt>,
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000572or <tt>extern_weak</tt>.</p>
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000573<p>Aliases can have only <tt>external</tt>, <tt>internal</tt> and <tt>weak</tt>
574linkages.
Chris Lattner6af02f32004-12-09 16:11:40 +0000575</div>
576
577<!-- ======================================================================= -->
578<div class="doc_subsection">
Chris Lattner0132aff2005-05-06 22:57:40 +0000579 <a name="callingconv">Calling Conventions</a>
580</div>
581
582<div class="doc_text">
583
584<p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
585and <a href="#i_invoke">invokes</a> can all have an optional calling convention
586specified for the call. The calling convention of any pair of dynamic
587caller/callee must match, or the behavior of the program is undefined. The
588following calling conventions are supported by LLVM, and more may be added in
589the future:</p>
590
591<dl>
592 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
593
594 <dd>This calling convention (the default if no other calling convention is
595 specified) matches the target C calling conventions. This calling convention
John Criswell02fdc6f2005-05-12 16:52:32 +0000596 supports varargs function calls and tolerates some mismatch in the declared
Reid Spencer72ba4992006-12-31 21:30:18 +0000597 prototype and implemented declaration of the function (as does normal C).
Chris Lattner0132aff2005-05-06 22:57:40 +0000598 </dd>
599
600 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
601
602 <dd>This calling convention attempts to make calls as fast as possible
603 (e.g. by passing things in registers). This calling convention allows the
604 target to use whatever tricks it wants to produce fast code for the target,
Chris Lattner67c37d12008-08-05 18:29:16 +0000605 without having to conform to an externally specified ABI (Application Binary
606 Interface). Implementations of this convention should allow arbitrary
Arnold Schwaighofer2c6b8882008-05-14 09:17:12 +0000607 <a href="CodeGenerator.html#tailcallopt">tail call optimization</a> to be
608 supported. This calling convention does not support varargs and requires the
609 prototype of all callees to exactly match the prototype of the function
610 definition.
Chris Lattner0132aff2005-05-06 22:57:40 +0000611 </dd>
612
613 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
614
615 <dd>This calling convention attempts to make code in the caller as efficient
616 as possible under the assumption that the call is not commonly executed. As
617 such, these calls often preserve all registers so that the call does not break
618 any live ranges in the caller side. This calling convention does not support
619 varargs and requires the prototype of all callees to exactly match the
620 prototype of the function definition.
621 </dd>
622
Chris Lattner573f64e2005-05-07 01:46:40 +0000623 <dt><b>"<tt>cc &lt;<em>n</em>&gt;</tt>" - Numbered convention</b>:</dt>
Chris Lattner0132aff2005-05-06 22:57:40 +0000624
625 <dd>Any calling convention may be specified by number, allowing
626 target-specific calling conventions to be used. Target specific calling
627 conventions start at 64.
628 </dd>
Chris Lattner573f64e2005-05-07 01:46:40 +0000629</dl>
Chris Lattner0132aff2005-05-06 22:57:40 +0000630
631<p>More calling conventions can be added/defined on an as-needed basis, to
632support pascal conventions or any other well-known target-independent
633convention.</p>
634
635</div>
636
637<!-- ======================================================================= -->
638<div class="doc_subsection">
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000639 <a name="visibility">Visibility Styles</a>
640</div>
641
642<div class="doc_text">
643
644<p>
645All Global Variables and Functions have one of the following visibility styles:
646</p>
647
648<dl>
649 <dt><b>"<tt>default</tt>" - Default style</b>:</dt>
650
Chris Lattner67c37d12008-08-05 18:29:16 +0000651 <dd>On targets that use the ELF object file format, default visibility means
652 that the declaration is visible to other
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000653 modules and, in shared libraries, means that the declared entity may be
654 overridden. On Darwin, default visibility means that the declaration is
655 visible to other modules. Default visibility corresponds to "external
656 linkage" in the language.
657 </dd>
658
659 <dt><b>"<tt>hidden</tt>" - Hidden style</b>:</dt>
660
661 <dd>Two declarations of an object with hidden visibility refer to the same
662 object if they are in the same shared object. Usually, hidden visibility
663 indicates that the symbol will not be placed into the dynamic symbol table,
664 so no other module (executable or shared library) can reference it
665 directly.
666 </dd>
667
Anton Korobeynikov39f3cff2007-04-29 18:35:00 +0000668 <dt><b>"<tt>protected</tt>" - Protected style</b>:</dt>
669
670 <dd>On ELF, protected visibility indicates that the symbol will be placed in
671 the dynamic symbol table, but that references within the defining module will
672 bind to the local symbol. That is, the symbol cannot be overridden by another
673 module.
674 </dd>
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000675</dl>
676
677</div>
678
679<!-- ======================================================================= -->
680<div class="doc_subsection">
Chris Lattner6af02f32004-12-09 16:11:40 +0000681 <a name="globalvars">Global Variables</a>
682</div>
683
684<div class="doc_text">
685
Chris Lattner5d5aede2005-02-12 19:30:21 +0000686<p>Global variables define regions of memory allocated at compilation time
Chris Lattner662c8722005-11-12 00:45:07 +0000687instead of run-time. Global variables may optionally be initialized, may have
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000688an explicit section to be placed in, and may have an optional explicit alignment
689specified. A variable may be defined as "thread_local", which means that it
690will not be shared by threads (each thread will have a separated copy of the
691variable). A variable may be defined as a global "constant," which indicates
692that the contents of the variable will <b>never</b> be modified (enabling better
Chris Lattner5d5aede2005-02-12 19:30:21 +0000693optimization, allowing the global data to be placed in the read-only section of
694an executable, etc). Note that variables that need runtime initialization
John Criswell4c0cf7f2005-10-24 16:17:18 +0000695cannot be marked "constant" as there is a store to the variable.</p>
Chris Lattner5d5aede2005-02-12 19:30:21 +0000696
697<p>
698LLVM explicitly allows <em>declarations</em> of global variables to be marked
699constant, even if the final definition of the global is not. This capability
700can be used to enable slightly better optimization of the program, but requires
701the language definition to guarantee that optimizations based on the
702'constantness' are valid for the translation units that do not include the
703definition.
704</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000705
706<p>As SSA values, global variables define pointer values that are in
707scope (i.e. they dominate) all basic blocks in the program. Global
708variables always define a pointer to their "content" type because they
709describe a region of memory, and all memory objects in LLVM are
710accessed through pointers.</p>
711
Christopher Lamb308121c2007-12-11 09:31:00 +0000712<p>A global variable may be declared to reside in a target-specifc numbered
713address space. For targets that support them, address spaces may affect how
714optimizations are performed and/or what target instructions are used to access
Christopher Lamb25f50762007-12-12 08:44:39 +0000715the variable. The default address space is zero. The address space qualifier
716must precede any other attributes.</p>
Christopher Lamb308121c2007-12-11 09:31:00 +0000717
Chris Lattner662c8722005-11-12 00:45:07 +0000718<p>LLVM allows an explicit section to be specified for globals. If the target
719supports it, it will emit globals to the section specified.</p>
720
Chris Lattner54611b42005-11-06 08:02:57 +0000721<p>An explicit alignment may be specified for a global. If not present, or if
722the alignment is set to zero, the alignment of the global is set by the target
723to whatever it feels convenient. If an explicit alignment is specified, the
724global is forced to have at least that much alignment. All alignments must be
725a power of 2.</p>
726
Christopher Lamb308121c2007-12-11 09:31:00 +0000727<p>For example, the following defines a global in a numbered address space with
728an initializer, section, and alignment:</p>
Chris Lattner5760c502007-01-14 00:27:09 +0000729
Bill Wendling3716c5d2007-05-29 09:04:49 +0000730<div class="doc_code">
Chris Lattner5760c502007-01-14 00:27:09 +0000731<pre>
Christopher Lamb308121c2007-12-11 09:31:00 +0000732@G = constant float 1.0 addrspace(5), section "foo", align 4
Chris Lattner5760c502007-01-14 00:27:09 +0000733</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000734</div>
Chris Lattner5760c502007-01-14 00:27:09 +0000735
Chris Lattner6af02f32004-12-09 16:11:40 +0000736</div>
737
738
739<!-- ======================================================================= -->
740<div class="doc_subsection">
741 <a name="functionstructure">Functions</a>
742</div>
743
744<div class="doc_text">
745
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000746<p>LLVM function definitions consist of the "<tt>define</tt>" keyord,
747an optional <a href="#linkage">linkage type</a>, an optional
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000748<a href="#visibility">visibility style</a>, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000749<a href="#callingconv">calling convention</a>, a return type, an optional
750<a href="#paramattrs">parameter attribute</a> for the return type, a function
751name, a (possibly empty) argument list (each with optional
Devang Patel7e9b05e2008-10-06 18:50:38 +0000752<a href="#paramattrs">parameter attributes</a>), optional
753<a href="#fnattrs">function attributes</a>, an optional section,
754an optional alignment, an optional <a href="#gc">garbage collector name</a>,
Chris Lattnercbc4d2a2008-10-04 18:10:21 +0000755an opening curly brace, a list of basic blocks, and a closing curly brace.
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000756
757LLVM function declarations consist of the "<tt>declare</tt>" keyword, an
758optional <a href="#linkage">linkage type</a>, an optional
759<a href="#visibility">visibility style</a>, an optional
760<a href="#callingconv">calling convention</a>, a return type, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000761<a href="#paramattrs">parameter attribute</a> for the return type, a function
Gordon Henriksen71183b62007-12-10 03:18:06 +0000762name, a possibly empty list of arguments, an optional alignment, and an optional
Gordon Henriksendc5cafb2007-12-10 03:30:21 +0000763<a href="#gc">garbage collector name</a>.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000764
Chris Lattner67c37d12008-08-05 18:29:16 +0000765<p>A function definition contains a list of basic blocks, forming the CFG
766(Control Flow Graph) for
Chris Lattner6af02f32004-12-09 16:11:40 +0000767the function. Each basic block may optionally start with a label (giving the
768basic block a symbol table entry), contains a list of instructions, and ends
769with a <a href="#terminators">terminator</a> instruction (such as a branch or
770function return).</p>
771
Chris Lattnera59fb102007-06-08 16:52:14 +0000772<p>The first basic block in a function is special in two ways: it is immediately
Chris Lattner6af02f32004-12-09 16:11:40 +0000773executed on entrance to the function, and it is not allowed to have predecessor
774basic blocks (i.e. there can not be any branches to the entry block of a
775function). Because the block can have no predecessors, it also cannot have any
776<a href="#i_phi">PHI nodes</a>.</p>
777
Chris Lattner662c8722005-11-12 00:45:07 +0000778<p>LLVM allows an explicit section to be specified for functions. If the target
779supports it, it will emit functions to the section specified.</p>
780
Chris Lattner54611b42005-11-06 08:02:57 +0000781<p>An explicit alignment may be specified for a function. If not present, or if
782the alignment is set to zero, the alignment of the function is set by the target
783to whatever it feels convenient. If an explicit alignment is specified, the
784function is forced to have at least that much alignment. All alignments must be
785a power of 2.</p>
786
Devang Patel02256232008-10-07 17:48:33 +0000787 <h5>Syntax:</h5>
788
789<div class="doc_code">
790<pre>
791define [<a href="#linkage">linkage</a>] [<a href="#visibility">visibility</a>] [<a href="#callingconv">cconv</a>] [<a href="#paramattrs">ret attrs</a>] &lt;ResultType&gt; @&lt;FunctionName&gt; ([argument list]) [<a href="#fnattrs">fn Attrs</a>] [section "name"] [align N] [<a href="#gc">gc</a>] { ... }
792</pre>
793</div>
794
Chris Lattner6af02f32004-12-09 16:11:40 +0000795</div>
796
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000797
798<!-- ======================================================================= -->
799<div class="doc_subsection">
800 <a name="aliasstructure">Aliases</a>
801</div>
802<div class="doc_text">
803 <p>Aliases act as "second name" for the aliasee value (which can be either
Anton Korobeynikov25b2e822008-03-22 08:36:14 +0000804 function, global variable, another alias or bitcast of global value). Aliases
805 may have an optional <a href="#linkage">linkage type</a>, and an
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000806 optional <a href="#visibility">visibility style</a>.</p>
807
808 <h5>Syntax:</h5>
809
Bill Wendling3716c5d2007-05-29 09:04:49 +0000810<div class="doc_code">
Bill Wendling2d8b9a82007-05-29 09:42:13 +0000811<pre>
Duncan Sands7e99a942008-09-12 20:48:21 +0000812@&lt;Name&gt; = alias [Linkage] [Visibility] &lt;AliaseeTy&gt; @&lt;Aliasee&gt;
Bill Wendling2d8b9a82007-05-29 09:42:13 +0000813</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000814</div>
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000815
816</div>
817
818
819
Chris Lattner91c15c42006-01-23 23:23:47 +0000820<!-- ======================================================================= -->
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000821<div class="doc_subsection"><a name="paramattrs">Parameter Attributes</a></div>
822<div class="doc_text">
823 <p>The return type and each parameter of a function type may have a set of
824 <i>parameter attributes</i> associated with them. Parameter attributes are
825 used to communicate additional information about the result or parameters of
Duncan Sandsad0ea2d2007-11-27 13:23:08 +0000826 a function. Parameter attributes are considered to be part of the function,
827 not of the function type, so functions with different parameter attributes
828 can have the same function type.</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000829
Reid Spencercf7ebf52007-01-15 18:27:39 +0000830 <p>Parameter attributes are simple keywords that follow the type specified. If
831 multiple parameter attributes are needed, they are space separated. For
Bill Wendling3716c5d2007-05-29 09:04:49 +0000832 example:</p>
833
834<div class="doc_code">
835<pre>
Devang Patel9eb525d2008-09-26 23:51:19 +0000836declare i32 @printf(i8* noalias , ...)
Chris Lattnerd2597d72008-10-04 18:33:34 +0000837declare i32 @atoi(i8 zeroext)
838declare signext i8 @returns_signed_char()
Bill Wendling3716c5d2007-05-29 09:04:49 +0000839</pre>
840</div>
841
Duncan Sandsad0ea2d2007-11-27 13:23:08 +0000842 <p>Note that any attributes for the function result (<tt>nounwind</tt>,
843 <tt>readonly</tt>) come immediately after the argument list.</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000844
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000845 <p>Currently, only the following parameter attributes are defined:</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000846 <dl>
Reid Spencer314e1cb2007-07-19 23:13:04 +0000847 <dt><tt>zeroext</tt></dt>
Chris Lattnerd2597d72008-10-04 18:33:34 +0000848 <dd>This indicates to the code generator that the parameter or return value
849 should be zero-extended to a 32-bit value by the caller (for a parameter)
850 or the callee (for a return value).</dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000851
Reid Spencer314e1cb2007-07-19 23:13:04 +0000852 <dt><tt>signext</tt></dt>
Chris Lattnerd2597d72008-10-04 18:33:34 +0000853 <dd>This indicates to the code generator that the parameter or return value
854 should be sign-extended to a 32-bit value by the caller (for a parameter)
855 or the callee (for a return value).</dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000856
Anton Korobeynikove8166852007-01-28 14:30:45 +0000857 <dt><tt>inreg</tt></dt>
Dale Johannesenc50ada22008-09-25 20:47:45 +0000858 <dd>This indicates that this parameter or return value should be treated
859 in a special target-dependent fashion during while emitting code for a
860 function call or return (usually, by putting it in a register as opposed
Chris Lattnerd2597d72008-10-04 18:33:34 +0000861 to memory, though some targets use it to distinguish between two different
862 kinds of registers). Use of this attribute is target-specific.</dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000863
Duncan Sands2a1d8ba2008-10-06 08:14:18 +0000864 <dt><tt><a name="byval">byval</a></tt></dt>
Chris Lattner352ab9b2008-01-15 04:34:22 +0000865 <dd>This indicates that the pointer parameter should really be passed by
866 value to the function. The attribute implies that a hidden copy of the
867 pointee is made between the caller and the callee, so the callee is unable
Chris Lattner1ca5c642008-08-05 18:21:08 +0000868 to modify the value in the callee. This attribute is only valid on LLVM
Chris Lattner352ab9b2008-01-15 04:34:22 +0000869 pointer arguments. It is generally used to pass structs and arrays by
Duncan Sands2a1d8ba2008-10-06 08:14:18 +0000870 value, but is also valid on pointers to scalars. The copy is considered to
871 belong to the caller not the callee (for example,
872 <tt><a href="#readonly">readonly</a></tt> functions should not write to
Devang Patel7e9b05e2008-10-06 18:50:38 +0000873 <tt>byval</tt> parameters). This is not a valid attribute for return
874 values. </dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000875
Anton Korobeynikove8166852007-01-28 14:30:45 +0000876 <dt><tt>sret</tt></dt>
Duncan Sandsfa4b6732008-02-18 04:19:38 +0000877 <dd>This indicates that the pointer parameter specifies the address of a
878 structure that is the return value of the function in the source program.
Chris Lattnerd2597d72008-10-04 18:33:34 +0000879 This pointer must be guaranteed by the caller to be valid: loads and stores
880 to the structure may be assumed by the callee to not to trap. This may only
Devang Patel7e9b05e2008-10-06 18:50:38 +0000881 be applied to the first parameter. This is not a valid attribute for
882 return values. </dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000883
Zhou Sheng2444a9a2007-06-05 05:28:26 +0000884 <dt><tt>noalias</tt></dt>
Owen Anderson61101282008-02-18 04:09:01 +0000885 <dd>This indicates that the parameter does not alias any global or any other
886 parameter. The caller is responsible for ensuring that this is the case,
Devang Patel7e9b05e2008-10-06 18:50:38 +0000887 usually by placing the value in a stack allocation. This is not a valid
888 attribute for return values.</dd>
Chris Lattner5cee13f2008-01-11 06:20:47 +0000889
Duncan Sands27e91592007-07-27 19:57:41 +0000890 <dt><tt>nest</tt></dt>
Duncan Sands825bde42008-07-08 09:27:25 +0000891 <dd>This indicates that the pointer parameter can be excised using the
Devang Patel7e9b05e2008-10-06 18:50:38 +0000892 <a href="#int_trampoline">trampoline intrinsics</a>. This is not a valid
893 attribute for return values.</dd>
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000894 </dl>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000895
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000896</div>
897
898<!-- ======================================================================= -->
Chris Lattner91c15c42006-01-23 23:23:47 +0000899<div class="doc_subsection">
Gordon Henriksen71183b62007-12-10 03:18:06 +0000900 <a name="gc">Garbage Collector Names</a>
901</div>
902
903<div class="doc_text">
904<p>Each function may specify a garbage collector name, which is simply a
905string.</p>
906
907<div class="doc_code"><pre
908>define void @f() gc "name" { ...</pre></div>
909
910<p>The compiler declares the supported values of <i>name</i>. Specifying a
911collector which will cause the compiler to alter its output in order to support
912the named garbage collection algorithm.</p>
913</div>
914
915<!-- ======================================================================= -->
916<div class="doc_subsection">
Devang Patel9eb525d2008-09-26 23:51:19 +0000917 <a name="fnattrs">Function Attributes</a>
Devang Patelcaacdba2008-09-04 23:05:13 +0000918</div>
919
920<div class="doc_text">
Devang Patel9eb525d2008-09-26 23:51:19 +0000921
922<p>Function attributes are set to communicate additional information about
923 a function. Function attributes are considered to be part of the function,
924 not of the function type, so functions with different parameter attributes
925 can have the same function type.</p>
926
927 <p>Function attributes are simple keywords that follow the type specified. If
928 multiple attributes are needed, they are space separated. For
929 example:</p>
Devang Patelcaacdba2008-09-04 23:05:13 +0000930
931<div class="doc_code">
Bill Wendlingb175fa42008-09-07 10:26:33 +0000932<pre>
Devang Patel9eb525d2008-09-26 23:51:19 +0000933define void @f() noinline { ... }
934define void @f() alwaysinline { ... }
935define void @f() alwaysinline optsize { ... }
936define void @f() optsize
Bill Wendlingb175fa42008-09-07 10:26:33 +0000937</pre>
Devang Patelcaacdba2008-09-04 23:05:13 +0000938</div>
939
Bill Wendlingb175fa42008-09-07 10:26:33 +0000940<dl>
Devang Patel9eb525d2008-09-26 23:51:19 +0000941<dt><tt>alwaysinline</tt></dt>
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000942<dd>This attribute indicates that the inliner should attempt to inline this
943function into callers whenever possible, ignoring any active inlining size
944threshold for this caller.</dd>
Bill Wendlingb175fa42008-09-07 10:26:33 +0000945
Devang Patel9eb525d2008-09-26 23:51:19 +0000946<dt><tt>noinline</tt></dt>
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000947<dd>This attribute indicates that the inliner should never inline this function
Chris Lattner0625c282008-10-05 17:14:59 +0000948in any situation. This attribute may not be used together with the
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000949<tt>alwaysinline</tt> attribute.</dd>
Bill Wendlingb175fa42008-09-07 10:26:33 +0000950
Devang Patel9eb525d2008-09-26 23:51:19 +0000951<dt><tt>optsize</tt></dt>
Devang Patele9743902008-09-29 18:34:44 +0000952<dd>This attribute suggests that optimization passes and code generator passes
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000953make choices that keep the code size of this function low, and otherwise do
954optimizations specifically to reduce code size.</dd>
Bill Wendlingb175fa42008-09-07 10:26:33 +0000955
Devang Patel9eb525d2008-09-26 23:51:19 +0000956<dt><tt>noreturn</tt></dt>
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000957<dd>This function attribute indicates that the function never returns normally.
958This produces undefined behavior at runtime if the function ever does
959dynamically return.</dd>
Devang Patel9eb525d2008-09-26 23:51:19 +0000960
961<dt><tt>nounwind</tt></dt>
Chris Lattnerfbf60a42008-10-04 18:23:17 +0000962<dd>This function attribute indicates that the function never returns with an
963unwind or exceptional control flow. If the function does unwind, its runtime
964behavior is undefined.</dd>
965
966<dt><tt>readnone</tt></dt>
Duncan Sands2a1d8ba2008-10-06 08:14:18 +0000967<dd>This attribute indicates that the function computes its result (or the
968exception it throws) based strictly on its arguments, without dereferencing any
969pointer arguments or otherwise accessing any mutable state (e.g. memory, control
970registers, etc) visible to caller functions. It does not write through any
971pointer arguments (including <tt><a href="#byval">byval</a></tt> arguments) and
972never changes any state visible to callers.</dd>
Devang Patel9eb525d2008-09-26 23:51:19 +0000973
Duncan Sands2a1d8ba2008-10-06 08:14:18 +0000974<dt><tt><a name="readonly">readonly</a></tt></dt>
975<dd>This attribute indicates that the function does not write through any
976pointer arguments (including <tt><a href="#byval">byval</a></tt> arguments)
977or otherwise modify any state (e.g. memory, control registers, etc) visible to
978caller functions. It may dereference pointer arguments and read state that may
979be set in the caller. A readonly function always returns the same value (or
980throws the same exception) when called with the same set of arguments and global
981state.</dd>
Bill Wendlingb175fa42008-09-07 10:26:33 +0000982</dl>
983
Devang Patelcaacdba2008-09-04 23:05:13 +0000984</div>
985
986<!-- ======================================================================= -->
987<div class="doc_subsection">
Chris Lattner93564892006-04-08 04:40:53 +0000988 <a name="moduleasm">Module-Level Inline Assembly</a>
Chris Lattner91c15c42006-01-23 23:23:47 +0000989</div>
990
991<div class="doc_text">
992<p>
993Modules may contain "module-level inline asm" blocks, which corresponds to the
994GCC "file scope inline asm" blocks. These blocks are internally concatenated by
995LLVM and treated as a single unit, but may be separated in the .ll file if
996desired. The syntax is very simple:
997</p>
998
Bill Wendling3716c5d2007-05-29 09:04:49 +0000999<div class="doc_code">
1000<pre>
1001module asm "inline asm code goes here"
1002module asm "more can go here"
1003</pre>
1004</div>
Chris Lattner91c15c42006-01-23 23:23:47 +00001005
1006<p>The strings can contain any character by escaping non-printable characters.
1007 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
1008 for the number.
1009</p>
1010
1011<p>
1012 The inline asm code is simply printed to the machine code .s file when
1013 assembly code is generated.
1014</p>
1015</div>
Chris Lattner6af02f32004-12-09 16:11:40 +00001016
Reid Spencer50c723a2007-02-19 23:54:10 +00001017<!-- ======================================================================= -->
1018<div class="doc_subsection">
1019 <a name="datalayout">Data Layout</a>
1020</div>
1021
1022<div class="doc_text">
1023<p>A module may specify a target specific data layout string that specifies how
Reid Spencer7972c472007-04-11 23:49:50 +00001024data is to be laid out in memory. The syntax for the data layout is simply:</p>
1025<pre> target datalayout = "<i>layout specification</i>"</pre>
1026<p>The <i>layout specification</i> consists of a list of specifications
1027separated by the minus sign character ('-'). Each specification starts with a
1028letter and may include other information after the letter to define some
1029aspect of the data layout. The specifications accepted are as follows: </p>
Reid Spencer50c723a2007-02-19 23:54:10 +00001030<dl>
1031 <dt><tt>E</tt></dt>
1032 <dd>Specifies that the target lays out data in big-endian form. That is, the
1033 bits with the most significance have the lowest address location.</dd>
1034 <dt><tt>e</tt></dt>
Chris Lattner67c37d12008-08-05 18:29:16 +00001035 <dd>Specifies that the target lays out data in little-endian form. That is,
Reid Spencer50c723a2007-02-19 23:54:10 +00001036 the bits with the least significance have the lowest address location.</dd>
1037 <dt><tt>p:<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1038 <dd>This specifies the <i>size</i> of a pointer and its <i>abi</i> and
1039 <i>preferred</i> alignments. All sizes are in bits. Specifying the <i>pref</i>
1040 alignment is optional. If omitted, the preceding <tt>:</tt> should be omitted
1041 too.</dd>
1042 <dt><tt>i<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1043 <dd>This specifies the alignment for an integer type of a given bit
1044 <i>size</i>. The value of <i>size</i> must be in the range [1,2^23).</dd>
1045 <dt><tt>v<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1046 <dd>This specifies the alignment for a vector type of a given bit
1047 <i>size</i>.</dd>
1048 <dt><tt>f<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1049 <dd>This specifies the alignment for a floating point type of a given bit
1050 <i>size</i>. The value of <i>size</i> must be either 32 (float) or 64
1051 (double).</dd>
1052 <dt><tt>a<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
1053 <dd>This specifies the alignment for an aggregate type of a given bit
1054 <i>size</i>.</dd>
1055</dl>
1056<p>When constructing the data layout for a given target, LLVM starts with a
1057default set of specifications which are then (possibly) overriden by the
1058specifications in the <tt>datalayout</tt> keyword. The default specifications
1059are given in this list:</p>
1060<ul>
1061 <li><tt>E</tt> - big endian</li>
1062 <li><tt>p:32:64:64</tt> - 32-bit pointers with 64-bit alignment</li>
1063 <li><tt>i1:8:8</tt> - i1 is 8-bit (byte) aligned</li>
1064 <li><tt>i8:8:8</tt> - i8 is 8-bit (byte) aligned</li>
1065 <li><tt>i16:16:16</tt> - i16 is 16-bit aligned</li>
1066 <li><tt>i32:32:32</tt> - i32 is 32-bit aligned</li>
Chris Lattner67c37d12008-08-05 18:29:16 +00001067 <li><tt>i64:32:64</tt> - i64 has ABI alignment of 32-bits but preferred
Reid Spencer50c723a2007-02-19 23:54:10 +00001068 alignment of 64-bits</li>
1069 <li><tt>f32:32:32</tt> - float is 32-bit aligned</li>
1070 <li><tt>f64:64:64</tt> - double is 64-bit aligned</li>
1071 <li><tt>v64:64:64</tt> - 64-bit vector is 64-bit aligned</li>
1072 <li><tt>v128:128:128</tt> - 128-bit vector is 128-bit aligned</li>
1073 <li><tt>a0:0:1</tt> - aggregates are 8-bit aligned</li>
1074</ul>
Chris Lattner1ca5c642008-08-05 18:21:08 +00001075<p>When LLVM is determining the alignment for a given type, it uses the
Reid Spencer50c723a2007-02-19 23:54:10 +00001076following rules:
1077<ol>
1078 <li>If the type sought is an exact match for one of the specifications, that
1079 specification is used.</li>
1080 <li>If no match is found, and the type sought is an integer type, then the
1081 smallest integer type that is larger than the bitwidth of the sought type is
1082 used. If none of the specifications are larger than the bitwidth then the the
1083 largest integer type is used. For example, given the default specifications
1084 above, the i7 type will use the alignment of i8 (next largest) while both
1085 i65 and i256 will use the alignment of i64 (largest specified).</li>
1086 <li>If no match is found, and the type sought is a vector type, then the
1087 largest vector type that is smaller than the sought vector type will be used
1088 as a fall back. This happens because <128 x double> can be implemented in
1089 terms of 64 <2 x double>, for example.</li>
1090</ol>
1091</div>
Chris Lattner6af02f32004-12-09 16:11:40 +00001092
Chris Lattner2f7c9632001-06-06 20:29:01 +00001093<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001094<div class="doc_section"> <a name="typesystem">Type System</a> </div>
1095<!-- *********************************************************************** -->
Chris Lattner6af02f32004-12-09 16:11:40 +00001096
Misha Brukman76307852003-11-08 01:05:38 +00001097<div class="doc_text">
Chris Lattner6af02f32004-12-09 16:11:40 +00001098
Misha Brukman76307852003-11-08 01:05:38 +00001099<p>The LLVM type system is one of the most important features of the
Chris Lattner48b383b02003-11-25 01:02:51 +00001100intermediate representation. Being typed enables a number of
Chris Lattner67c37d12008-08-05 18:29:16 +00001101optimizations to be performed on the intermediate representation directly,
1102without having to do
Chris Lattner48b383b02003-11-25 01:02:51 +00001103extra analyses on the side before the transformation. A strong type
1104system makes it easier to read the generated code and enables novel
1105analyses and transformations that are not feasible to perform on normal
1106three address code representations.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +00001107
1108</div>
1109
Chris Lattner2f7c9632001-06-06 20:29:01 +00001110<!-- ======================================================================= -->
Chris Lattner7824d182008-01-04 04:32:38 +00001111<div class="doc_subsection"> <a name="t_classifications">Type
Chris Lattner48b383b02003-11-25 01:02:51 +00001112Classifications</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001113<div class="doc_text">
Chris Lattner7824d182008-01-04 04:32:38 +00001114<p>The types fall into a few useful
Chris Lattner48b383b02003-11-25 01:02:51 +00001115classifications:</p>
Misha Brukmanc501f552004-03-01 17:47:27 +00001116
1117<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +00001118 <tbody>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001119 <tr><th>Classification</th><th>Types</th></tr>
Chris Lattner48b383b02003-11-25 01:02:51 +00001120 <tr>
Chris Lattner7824d182008-01-04 04:32:38 +00001121 <td><a href="#t_integer">integer</a></td>
Reid Spencer138249b2007-05-16 18:44:01 +00001122 <td><tt>i1, i2, i3, ... i8, ... i16, ... i32, ... i64, ... </tt></td>
Chris Lattner48b383b02003-11-25 01:02:51 +00001123 </tr>
1124 <tr>
Chris Lattner7824d182008-01-04 04:32:38 +00001125 <td><a href="#t_floating">floating point</a></td>
1126 <td><tt>float, double, x86_fp80, fp128, ppc_fp128</tt></td>
Chris Lattner48b383b02003-11-25 01:02:51 +00001127 </tr>
1128 <tr>
1129 <td><a name="t_firstclass">first class</a></td>
Chris Lattner7824d182008-01-04 04:32:38 +00001130 <td><a href="#t_integer">integer</a>,
1131 <a href="#t_floating">floating point</a>,
1132 <a href="#t_pointer">pointer</a>,
Dan Gohman08783a882008-06-18 18:42:13 +00001133 <a href="#t_vector">vector</a>,
Dan Gohmanb9d66602008-05-12 23:51:09 +00001134 <a href="#t_struct">structure</a>,
1135 <a href="#t_array">array</a>,
Dan Gohmanda52d212008-05-23 22:50:26 +00001136 <a href="#t_label">label</a>.
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001137 </td>
Chris Lattner48b383b02003-11-25 01:02:51 +00001138 </tr>
Chris Lattner7824d182008-01-04 04:32:38 +00001139 <tr>
1140 <td><a href="#t_primitive">primitive</a></td>
1141 <td><a href="#t_label">label</a>,
1142 <a href="#t_void">void</a>,
Chris Lattner7824d182008-01-04 04:32:38 +00001143 <a href="#t_floating">floating point</a>.</td>
1144 </tr>
1145 <tr>
1146 <td><a href="#t_derived">derived</a></td>
1147 <td><a href="#t_integer">integer</a>,
1148 <a href="#t_array">array</a>,
1149 <a href="#t_function">function</a>,
1150 <a href="#t_pointer">pointer</a>,
1151 <a href="#t_struct">structure</a>,
1152 <a href="#t_pstruct">packed structure</a>,
1153 <a href="#t_vector">vector</a>,
1154 <a href="#t_opaque">opaque</a>.
1155 </tr>
Chris Lattner48b383b02003-11-25 01:02:51 +00001156 </tbody>
Misha Brukman76307852003-11-08 01:05:38 +00001157</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00001158
Chris Lattner48b383b02003-11-25 01:02:51 +00001159<p>The <a href="#t_firstclass">first class</a> types are perhaps the
1160most important. Values of these types are the only ones which can be
1161produced by instructions, passed as arguments, or used as operands to
Dan Gohman34d1c0d2008-05-23 21:53:15 +00001162instructions.</p>
Misha Brukman76307852003-11-08 01:05:38 +00001163</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001164
Chris Lattner2f7c9632001-06-06 20:29:01 +00001165<!-- ======================================================================= -->
Chris Lattner7824d182008-01-04 04:32:38 +00001166<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
Chris Lattner43542b32008-01-04 04:34:14 +00001167
Chris Lattner7824d182008-01-04 04:32:38 +00001168<div class="doc_text">
1169<p>The primitive types are the fundamental building blocks of the LLVM
1170system.</p>
1171
Chris Lattner43542b32008-01-04 04:34:14 +00001172</div>
1173
Chris Lattner7824d182008-01-04 04:32:38 +00001174<!-- _______________________________________________________________________ -->
1175<div class="doc_subsubsection"> <a name="t_floating">Floating Point Types</a> </div>
1176
1177<div class="doc_text">
1178 <table>
1179 <tbody>
1180 <tr><th>Type</th><th>Description</th></tr>
1181 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
1182 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
1183 <tr><td><tt>fp128</tt></td><td>128-bit floating point value (112-bit mantissa)</td></tr>
1184 <tr><td><tt>x86_fp80</tt></td><td>80-bit floating point value (X87)</td></tr>
1185 <tr><td><tt>ppc_fp128</tt></td><td>128-bit floating point value (two 64-bits)</td></tr>
1186 </tbody>
1187 </table>
1188</div>
1189
1190<!-- _______________________________________________________________________ -->
1191<div class="doc_subsubsection"> <a name="t_void">Void Type</a> </div>
1192
1193<div class="doc_text">
1194<h5>Overview:</h5>
1195<p>The void type does not represent any value and has no size.</p>
1196
1197<h5>Syntax:</h5>
1198
1199<pre>
1200 void
1201</pre>
1202</div>
1203
1204<!-- _______________________________________________________________________ -->
1205<div class="doc_subsubsection"> <a name="t_label">Label Type</a> </div>
1206
1207<div class="doc_text">
1208<h5>Overview:</h5>
1209<p>The label type represents code labels.</p>
1210
1211<h5>Syntax:</h5>
1212
1213<pre>
1214 label
1215</pre>
1216</div>
1217
1218
1219<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001220<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001221
Misha Brukman76307852003-11-08 01:05:38 +00001222<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001223
Chris Lattner48b383b02003-11-25 01:02:51 +00001224<p>The real power in LLVM comes from the derived types in the system.
1225This is what allows a programmer to represent arrays, functions,
1226pointers, and other useful types. Note that these derived types may be
1227recursive: For example, it is possible to have a two dimensional array.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001228
Misha Brukman76307852003-11-08 01:05:38 +00001229</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001230
Chris Lattner2f7c9632001-06-06 20:29:01 +00001231<!-- _______________________________________________________________________ -->
Reid Spencer138249b2007-05-16 18:44:01 +00001232<div class="doc_subsubsection"> <a name="t_integer">Integer Type</a> </div>
1233
1234<div class="doc_text">
1235
1236<h5>Overview:</h5>
1237<p>The integer type is a very simple derived type that simply specifies an
1238arbitrary bit width for the integer type desired. Any bit width from 1 bit to
12392^23-1 (about 8 million) can be specified.</p>
1240
1241<h5>Syntax:</h5>
1242
1243<pre>
1244 iN
1245</pre>
1246
1247<p>The number of bits the integer will occupy is specified by the <tt>N</tt>
1248value.</p>
1249
1250<h5>Examples:</h5>
1251<table class="layout">
Chris Lattner9a2e3cb2007-12-18 06:18:21 +00001252 <tbody>
1253 <tr>
1254 <td><tt>i1</tt></td>
1255 <td>a single-bit integer.</td>
1256 </tr><tr>
1257 <td><tt>i32</tt></td>
1258 <td>a 32-bit integer.</td>
1259 </tr><tr>
1260 <td><tt>i1942652</tt></td>
1261 <td>a really big integer of over 1 million bits.</td>
Reid Spencer138249b2007-05-16 18:44:01 +00001262 </tr>
Chris Lattner9a2e3cb2007-12-18 06:18:21 +00001263 </tbody>
Reid Spencer138249b2007-05-16 18:44:01 +00001264</table>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001265</div>
Reid Spencer138249b2007-05-16 18:44:01 +00001266
1267<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001268<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001269
Misha Brukman76307852003-11-08 01:05:38 +00001270<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001271
Chris Lattner2f7c9632001-06-06 20:29:01 +00001272<h5>Overview:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +00001273
Misha Brukman76307852003-11-08 01:05:38 +00001274<p>The array type is a very simple derived type that arranges elements
Chris Lattner48b383b02003-11-25 01:02:51 +00001275sequentially in memory. The array type requires a size (number of
1276elements) and an underlying data type.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001277
Chris Lattner590645f2002-04-14 06:13:44 +00001278<h5>Syntax:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +00001279
1280<pre>
1281 [&lt;# elements&gt; x &lt;elementtype&gt;]
1282</pre>
1283
John Criswell02fdc6f2005-05-12 16:52:32 +00001284<p>The number of elements is a constant integer value; elementtype may
Chris Lattner48b383b02003-11-25 01:02:51 +00001285be any type with a size.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001286
Chris Lattner590645f2002-04-14 06:13:44 +00001287<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001288<table class="layout">
1289 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001290 <td class="left"><tt>[40 x i32]</tt></td>
1291 <td class="left">Array of 40 32-bit integer values.</td>
1292 </tr>
1293 <tr class="layout">
1294 <td class="left"><tt>[41 x i32]</tt></td>
1295 <td class="left">Array of 41 32-bit integer values.</td>
1296 </tr>
1297 <tr class="layout">
1298 <td class="left"><tt>[4 x i8]</tt></td>
1299 <td class="left">Array of 4 8-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001300 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001301</table>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001302<p>Here are some examples of multidimensional arrays:</p>
1303<table class="layout">
1304 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001305 <td class="left"><tt>[3 x [4 x i32]]</tt></td>
1306 <td class="left">3x4 array of 32-bit integer values.</td>
1307 </tr>
1308 <tr class="layout">
1309 <td class="left"><tt>[12 x [10 x float]]</tt></td>
1310 <td class="left">12x10 array of single precision floating point values.</td>
1311 </tr>
1312 <tr class="layout">
1313 <td class="left"><tt>[2 x [3 x [4 x i16]]]</tt></td>
1314 <td class="left">2x3x4 array of 16-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001315 </tr>
1316</table>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001317
John Criswell4c0cf7f2005-10-24 16:17:18 +00001318<p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
1319length array. Normally, accesses past the end of an array are undefined in
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001320LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
1321As a special case, however, zero length arrays are recognized to be variable
1322length. This allows implementation of 'pascal style arrays' with the LLVM
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001323type "{ i32, [0 x float]}", for example.</p>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001324
Misha Brukman76307852003-11-08 01:05:38 +00001325</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001326
Chris Lattner2f7c9632001-06-06 20:29:01 +00001327<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001328<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001329<div class="doc_text">
Chris Lattnerda508ac2008-04-23 04:59:35 +00001330
Chris Lattner2f7c9632001-06-06 20:29:01 +00001331<h5>Overview:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001332
Chris Lattner48b383b02003-11-25 01:02:51 +00001333<p>The function type can be thought of as a function signature. It
Devang Patele3dfc1c2008-03-24 05:35:41 +00001334consists of a return type and a list of formal parameter types. The
Chris Lattnerda508ac2008-04-23 04:59:35 +00001335return type of a function type is a scalar type, a void type, or a struct type.
Devang Patel9c1f8b12008-03-24 20:52:42 +00001336If the return type is a struct type then all struct elements must be of first
Chris Lattnerda508ac2008-04-23 04:59:35 +00001337class types, and the struct must have at least one element.</p>
Devang Pateld6cff512008-03-10 20:49:15 +00001338
Chris Lattner2f7c9632001-06-06 20:29:01 +00001339<h5>Syntax:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001340
1341<pre>
1342 &lt;returntype list&gt; (&lt;parameter list&gt;)
1343</pre>
1344
John Criswell4c0cf7f2005-10-24 16:17:18 +00001345<p>...where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
Misha Brukman20f9a622004-08-12 20:16:08 +00001346specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
Chris Lattner5ed60612003-09-03 00:41:47 +00001347which indicates that the function takes a variable number of arguments.
1348Variable argument functions can access their arguments with the <a
Devang Pateld6cff512008-03-10 20:49:15 +00001349 href="#int_varargs">variable argument handling intrinsic</a> functions.
1350'<tt>&lt;returntype list&gt;</tt>' is a comma-separated list of
1351<a href="#t_firstclass">first class</a> type specifiers.</p>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001352
Chris Lattner2f7c9632001-06-06 20:29:01 +00001353<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001354<table class="layout">
1355 <tr class="layout">
Reid Spencer58c08712006-12-31 07:18:34 +00001356 <td class="left"><tt>i32 (i32)</tt></td>
1357 <td class="left">function taking an <tt>i32</tt>, returning an <tt>i32</tt>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001358 </td>
Reid Spencer58c08712006-12-31 07:18:34 +00001359 </tr><tr class="layout">
Reid Spencer314e1cb2007-07-19 23:13:04 +00001360 <td class="left"><tt>float&nbsp;(i16&nbsp;signext,&nbsp;i32&nbsp;*)&nbsp;*
Reid Spencer655dcc62006-12-31 07:20:23 +00001361 </tt></td>
Reid Spencer58c08712006-12-31 07:18:34 +00001362 <td class="left"><a href="#t_pointer">Pointer</a> to a function that takes
1363 an <tt>i16</tt> that should be sign extended and a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001364 <a href="#t_pointer">pointer</a> to <tt>i32</tt>, returning
Reid Spencer58c08712006-12-31 07:18:34 +00001365 <tt>float</tt>.
1366 </td>
1367 </tr><tr class="layout">
1368 <td class="left"><tt>i32 (i8*, ...)</tt></td>
1369 <td class="left">A vararg function that takes at least one
Reid Spencer3e628eb92007-01-04 16:43:23 +00001370 <a href="#t_pointer">pointer</a> to <tt>i8 </tt> (char in C),
Reid Spencer58c08712006-12-31 07:18:34 +00001371 which returns an integer. This is the signature for <tt>printf</tt> in
1372 LLVM.
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001373 </td>
Devang Patele3dfc1c2008-03-24 05:35:41 +00001374 </tr><tr class="layout">
1375 <td class="left"><tt>{i32, i32} (i32)</tt></td>
Devang Patel8dec6c22008-03-24 18:10:52 +00001376 <td class="left">A function taking an <tt>i32></tt>, returning two
1377 <tt> i32 </tt> values as an aggregate of type <tt>{ i32, i32 }</tt>
Devang Patele3dfc1c2008-03-24 05:35:41 +00001378 </td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001379 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001380</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00001381
Misha Brukman76307852003-11-08 01:05:38 +00001382</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001383<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001384<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001385<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001386<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001387<p>The structure type is used to represent a collection of data members
1388together in memory. The packing of the field types is defined to match
1389the ABI of the underlying processor. The elements of a structure may
1390be any type that has a size.</p>
1391<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1392and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1393field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1394instruction.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001395<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001396<pre> { &lt;type list&gt; }<br></pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001397<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001398<table class="layout">
1399 <tr class="layout">
Jeff Cohen5819f182007-04-22 01:17:39 +00001400 <td class="left"><tt>{ i32, i32, i32 }</tt></td>
1401 <td class="left">A triple of three <tt>i32</tt> values</td>
1402 </tr><tr class="layout">
1403 <td class="left"><tt>{&nbsp;float,&nbsp;i32&nbsp;(i32)&nbsp;*&nbsp;}</tt></td>
1404 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1405 second element is a <a href="#t_pointer">pointer</a> to a
1406 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1407 an <tt>i32</tt>.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001408 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001409</table>
Misha Brukman76307852003-11-08 01:05:38 +00001410</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001411
Chris Lattner2f7c9632001-06-06 20:29:01 +00001412<!-- _______________________________________________________________________ -->
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001413<div class="doc_subsubsection"> <a name="t_pstruct">Packed Structure Type</a>
1414</div>
1415<div class="doc_text">
1416<h5>Overview:</h5>
1417<p>The packed structure type is used to represent a collection of data members
1418together in memory. There is no padding between fields. Further, the alignment
1419of a packed structure is 1 byte. The elements of a packed structure may
1420be any type that has a size.</p>
1421<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1422and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1423field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1424instruction.</p>
1425<h5>Syntax:</h5>
1426<pre> &lt; { &lt;type list&gt; } &gt; <br></pre>
1427<h5>Examples:</h5>
1428<table class="layout">
1429 <tr class="layout">
Jeff Cohen5819f182007-04-22 01:17:39 +00001430 <td class="left"><tt>&lt; { i32, i32, i32 } &gt;</tt></td>
1431 <td class="left">A triple of three <tt>i32</tt> values</td>
1432 </tr><tr class="layout">
Bill Wendlingb175fa42008-09-07 10:26:33 +00001433 <td class="left">
1434<tt>&lt;&nbsp;{&nbsp;float,&nbsp;i32&nbsp;(i32)*&nbsp;}&nbsp;&gt;</tt></td>
Jeff Cohen5819f182007-04-22 01:17:39 +00001435 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1436 second element is a <a href="#t_pointer">pointer</a> to a
1437 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1438 an <tt>i32</tt>.</td>
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001439 </tr>
1440</table>
1441</div>
1442
1443<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001444<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001445<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00001446<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001447<p>As in many languages, the pointer type represents a pointer or
Christopher Lamb308121c2007-12-11 09:31:00 +00001448reference to another object, which must live in memory. Pointer types may have
1449an optional address space attribute defining the target-specific numbered
1450address space where the pointed-to object resides. The default address space is
1451zero.</p>
Chris Lattner590645f2002-04-14 06:13:44 +00001452<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001453<pre> &lt;type&gt; *<br></pre>
Chris Lattner590645f2002-04-14 06:13:44 +00001454<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001455<table class="layout">
1456 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001457 <td class="left"><tt>[4x i32]*</tt></td>
1458 <td class="left">A <a href="#t_pointer">pointer</a> to <a
1459 href="#t_array">array</a> of four <tt>i32</tt> values.</td>
1460 </tr>
1461 <tr class="layout">
1462 <td class="left"><tt>i32 (i32 *) *</tt></td>
1463 <td class="left"> A <a href="#t_pointer">pointer</a> to a <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001464 href="#t_function">function</a> that takes an <tt>i32*</tt>, returning an
Chris Lattner747359f2007-12-19 05:04:11 +00001465 <tt>i32</tt>.</td>
1466 </tr>
1467 <tr class="layout">
1468 <td class="left"><tt>i32 addrspace(5)*</tt></td>
1469 <td class="left">A <a href="#t_pointer">pointer</a> to an <tt>i32</tt> value
1470 that resides in address space #5.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001471 </tr>
Misha Brukman76307852003-11-08 01:05:38 +00001472</table>
Misha Brukman76307852003-11-08 01:05:38 +00001473</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001474
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001475<!-- _______________________________________________________________________ -->
Reid Spencer404a3252007-02-15 03:07:05 +00001476<div class="doc_subsubsection"> <a name="t_vector">Vector Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001477<div class="doc_text">
Chris Lattner37b6b092005-04-25 17:34:15 +00001478
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001479<h5>Overview:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001480
Reid Spencer404a3252007-02-15 03:07:05 +00001481<p>A vector type is a simple derived type that represents a vector
1482of elements. Vector types are used when multiple primitive data
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001483are operated in parallel using a single instruction (SIMD).
Reid Spencer404a3252007-02-15 03:07:05 +00001484A vector type requires a size (number of
Chris Lattner330ce692005-11-10 01:44:22 +00001485elements) and an underlying primitive data type. Vectors must have a power
Reid Spencer404a3252007-02-15 03:07:05 +00001486of two length (1, 2, 4, 8, 16 ...). Vector types are
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001487considered <a href="#t_firstclass">first class</a>.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001488
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001489<h5>Syntax:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001490
1491<pre>
1492 &lt; &lt;# elements&gt; x &lt;elementtype&gt; &gt;
1493</pre>
1494
John Criswell4a3327e2005-05-13 22:25:59 +00001495<p>The number of elements is a constant integer value; elementtype may
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001496be any integer or floating point type.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001497
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001498<h5>Examples:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001499
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001500<table class="layout">
1501 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001502 <td class="left"><tt>&lt;4 x i32&gt;</tt></td>
1503 <td class="left">Vector of 4 32-bit integer values.</td>
1504 </tr>
1505 <tr class="layout">
1506 <td class="left"><tt>&lt;8 x float&gt;</tt></td>
1507 <td class="left">Vector of 8 32-bit floating-point values.</td>
1508 </tr>
1509 <tr class="layout">
1510 <td class="left"><tt>&lt;2 x i64&gt;</tt></td>
1511 <td class="left">Vector of 2 64-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001512 </tr>
1513</table>
Misha Brukman76307852003-11-08 01:05:38 +00001514</div>
1515
Chris Lattner37b6b092005-04-25 17:34:15 +00001516<!-- _______________________________________________________________________ -->
1517<div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1518<div class="doc_text">
1519
1520<h5>Overview:</h5>
1521
1522<p>Opaque types are used to represent unknown types in the system. This
Gordon Henriksena699c4d2007-10-14 00:34:53 +00001523corresponds (for example) to the C notion of a forward declared structure type.
Chris Lattner37b6b092005-04-25 17:34:15 +00001524In LLVM, opaque types can eventually be resolved to any type (not just a
1525structure type).</p>
1526
1527<h5>Syntax:</h5>
1528
1529<pre>
1530 opaque
1531</pre>
1532
1533<h5>Examples:</h5>
1534
1535<table class="layout">
1536 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001537 <td class="left"><tt>opaque</tt></td>
1538 <td class="left">An opaque type.</td>
Chris Lattner37b6b092005-04-25 17:34:15 +00001539 </tr>
1540</table>
1541</div>
1542
1543
Chris Lattner74d3f822004-12-09 17:30:23 +00001544<!-- *********************************************************************** -->
1545<div class="doc_section"> <a name="constants">Constants</a> </div>
1546<!-- *********************************************************************** -->
1547
1548<div class="doc_text">
1549
1550<p>LLVM has several different basic types of constants. This section describes
1551them all and their syntax.</p>
1552
1553</div>
1554
1555<!-- ======================================================================= -->
Reid Spencer8f08d802004-12-09 18:02:53 +00001556<div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001557
1558<div class="doc_text">
1559
1560<dl>
1561 <dt><b>Boolean constants</b></dt>
1562
1563 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
Reid Spencer36a15422007-01-12 03:35:51 +00001564 constants of the <tt><a href="#t_primitive">i1</a></tt> type.
Chris Lattner74d3f822004-12-09 17:30:23 +00001565 </dd>
1566
1567 <dt><b>Integer constants</b></dt>
1568
Reid Spencer8f08d802004-12-09 18:02:53 +00001569 <dd>Standard integers (such as '4') are constants of the <a
Reid Spencer3e628eb92007-01-04 16:43:23 +00001570 href="#t_integer">integer</a> type. Negative numbers may be used with
Chris Lattner74d3f822004-12-09 17:30:23 +00001571 integer types.
1572 </dd>
1573
1574 <dt><b>Floating point constants</b></dt>
1575
1576 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1577 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
Chris Lattner1429e6f2008-04-01 18:45:27 +00001578 notation (see below). The assembler requires the exact decimal value of
1579 a floating-point constant. For example, the assembler accepts 1.25 but
1580 rejects 1.3 because 1.3 is a repeating decimal in binary. Floating point
1581 constants must have a <a href="#t_floating">floating point</a> type. </dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001582
1583 <dt><b>Null pointer constants</b></dt>
1584
John Criswelldfe6a862004-12-10 15:51:16 +00001585 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
Chris Lattner74d3f822004-12-09 17:30:23 +00001586 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1587
1588</dl>
1589
John Criswelldfe6a862004-12-10 15:51:16 +00001590<p>The one non-intuitive notation for constants is the optional hexadecimal form
Chris Lattner74d3f822004-12-09 17:30:23 +00001591of floating point constants. For example, the form '<tt>double
15920x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
15934.5e+15</tt>'. The only time hexadecimal floating point constants are required
Reid Spencer8f08d802004-12-09 18:02:53 +00001594(and the only time that they are generated by the disassembler) is when a
1595floating point constant must be emitted but it cannot be represented as a
1596decimal floating point number. For example, NaN's, infinities, and other
1597special values are represented in their IEEE hexadecimal format so that
1598assembly and disassembly do not cause any bits to change in the constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001599
1600</div>
1601
1602<!-- ======================================================================= -->
1603<div class="doc_subsection"><a name="aggregateconstants">Aggregate Constants</a>
1604</div>
1605
1606<div class="doc_text">
Chris Lattner455fc8c2005-03-07 22:13:59 +00001607<p>Aggregate constants arise from aggregation of simple constants
1608and smaller aggregate constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001609
1610<dl>
1611 <dt><b>Structure constants</b></dt>
1612
1613 <dd>Structure constants are represented with notation similar to structure
1614 type definitions (a comma separated list of elements, surrounded by braces
Chris Lattnerbea11172007-12-25 20:34:52 +00001615 (<tt>{}</tt>)). For example: "<tt>{ i32 4, float 17.0, i32* @G }</tt>",
1616 where "<tt>@G</tt>" is declared as "<tt>@G = external global i32</tt>". Structure constants
Chris Lattner455fc8c2005-03-07 22:13:59 +00001617 must have <a href="#t_struct">structure type</a>, and the number and
Chris Lattner74d3f822004-12-09 17:30:23 +00001618 types of elements must match those specified by the type.
1619 </dd>
1620
1621 <dt><b>Array constants</b></dt>
1622
1623 <dd>Array constants are represented with notation similar to array type
1624 definitions (a comma separated list of elements, surrounded by square brackets
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001625 (<tt>[]</tt>)). For example: "<tt>[ i32 42, i32 11, i32 74 ]</tt>". Array
Chris Lattner74d3f822004-12-09 17:30:23 +00001626 constants must have <a href="#t_array">array type</a>, and the number and
1627 types of elements must match those specified by the type.
1628 </dd>
1629
Reid Spencer404a3252007-02-15 03:07:05 +00001630 <dt><b>Vector constants</b></dt>
Chris Lattner74d3f822004-12-09 17:30:23 +00001631
Reid Spencer404a3252007-02-15 03:07:05 +00001632 <dd>Vector constants are represented with notation similar to vector type
Chris Lattner74d3f822004-12-09 17:30:23 +00001633 definitions (a comma separated list of elements, surrounded by
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001634 less-than/greater-than's (<tt>&lt;&gt;</tt>)). For example: "<tt>&lt; i32 42,
Jeff Cohen5819f182007-04-22 01:17:39 +00001635 i32 11, i32 74, i32 100 &gt;</tt>". Vector constants must have <a
Reid Spencer404a3252007-02-15 03:07:05 +00001636 href="#t_vector">vector type</a>, and the number and types of elements must
Chris Lattner74d3f822004-12-09 17:30:23 +00001637 match those specified by the type.
1638 </dd>
1639
1640 <dt><b>Zero initialization</b></dt>
1641
1642 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1643 value to zero of <em>any</em> type, including scalar and aggregate types.
1644 This is often used to avoid having to print large zero initializers (e.g. for
John Criswell4c0cf7f2005-10-24 16:17:18 +00001645 large arrays) and is always exactly equivalent to using explicit zero
Chris Lattner74d3f822004-12-09 17:30:23 +00001646 initializers.
1647 </dd>
1648</dl>
1649
1650</div>
1651
1652<!-- ======================================================================= -->
1653<div class="doc_subsection">
1654 <a name="globalconstants">Global Variable and Function Addresses</a>
1655</div>
1656
1657<div class="doc_text">
1658
1659<p>The addresses of <a href="#globalvars">global variables</a> and <a
1660href="#functionstructure">functions</a> are always implicitly valid (link-time)
John Criswelldfe6a862004-12-10 15:51:16 +00001661constants. These constants are explicitly referenced when the <a
1662href="#identifiers">identifier for the global</a> is used and always have <a
Chris Lattner74d3f822004-12-09 17:30:23 +00001663href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1664file:</p>
1665
Bill Wendling3716c5d2007-05-29 09:04:49 +00001666<div class="doc_code">
Chris Lattner74d3f822004-12-09 17:30:23 +00001667<pre>
Chris Lattner00538a12007-06-06 18:28:13 +00001668@X = global i32 17
1669@Y = global i32 42
1670@Z = global [2 x i32*] [ i32* @X, i32* @Y ]
Chris Lattner74d3f822004-12-09 17:30:23 +00001671</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001672</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001673
1674</div>
1675
1676<!-- ======================================================================= -->
Reid Spencer641f5c92004-12-09 18:13:12 +00001677<div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001678<div class="doc_text">
Reid Spencer641f5c92004-12-09 18:13:12 +00001679 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
John Criswell4a3327e2005-05-13 22:25:59 +00001680 no specific value. Undefined values may be of any type and be used anywhere
Reid Spencer641f5c92004-12-09 18:13:12 +00001681 a constant is permitted.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001682
Reid Spencer641f5c92004-12-09 18:13:12 +00001683 <p>Undefined values indicate to the compiler that the program is well defined
1684 no matter what value is used, giving the compiler more freedom to optimize.
1685 </p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001686</div>
1687
1688<!-- ======================================================================= -->
1689<div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1690</div>
1691
1692<div class="doc_text">
1693
1694<p>Constant expressions are used to allow expressions involving other constants
1695to be used as constants. Constant expressions may be of any <a
John Criswell4a3327e2005-05-13 22:25:59 +00001696href="#t_firstclass">first class</a> type and may involve any LLVM operation
Chris Lattner74d3f822004-12-09 17:30:23 +00001697that does not have side effects (e.g. load and call are not supported). The
1698following is the syntax for constant expressions:</p>
1699
1700<dl>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001701 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1702 <dd>Truncate a constant to another type. The bit size of CST must be larger
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001703 than the bit size of TYPE. Both types must be integers.</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001704
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001705 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1706 <dd>Zero extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001707 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001708
1709 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1710 <dd>Sign extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001711 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001712
1713 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1714 <dd>Truncate a floating point constant to another floating point type. The
1715 size of CST must be larger than the size of TYPE. Both types must be
1716 floating point.</dd>
1717
1718 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1719 <dd>Floating point extend a constant to another type. The size of CST must be
1720 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1721
Reid Spencer753163d2007-07-31 14:40:14 +00001722 <dt><b><tt>fptoui ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001723 <dd>Convert a floating point constant to the corresponding unsigned integer
Nate Begemand4d45c22007-11-17 03:58:34 +00001724 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1725 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1726 of the same number of elements. If the value won't fit in the integer type,
1727 the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001728
Reid Spencer51b07252006-11-09 23:03:26 +00001729 <dt><b><tt>fptosi ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001730 <dd>Convert a floating point constant to the corresponding signed integer
Nate Begemand4d45c22007-11-17 03:58:34 +00001731 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1732 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1733 of the same number of elements. If the value won't fit in the integer type,
1734 the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001735
Reid Spencer51b07252006-11-09 23:03:26 +00001736 <dt><b><tt>uitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001737 <dd>Convert an unsigned integer constant to the corresponding floating point
Nate Begemand4d45c22007-11-17 03:58:34 +00001738 constant. TYPE must be a scalar or vector floating point type. CST must be of
1739 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1740 of the same number of elements. If the value won't fit in the floating point
1741 type, the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001742
Reid Spencer51b07252006-11-09 23:03:26 +00001743 <dt><b><tt>sitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001744 <dd>Convert a signed integer constant to the corresponding floating point
Nate Begemand4d45c22007-11-17 03:58:34 +00001745 constant. TYPE must be a scalar or vector floating point type. CST must be of
1746 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1747 of the same number of elements. If the value won't fit in the floating point
1748 type, the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001749
Reid Spencer5b950642006-11-11 23:08:07 +00001750 <dt><b><tt>ptrtoint ( CST to TYPE )</tt></b></dt>
1751 <dd>Convert a pointer typed constant to the corresponding integer constant
1752 TYPE must be an integer type. CST must be of pointer type. The CST value is
1753 zero extended, truncated, or unchanged to make it fit in TYPE.</dd>
1754
1755 <dt><b><tt>inttoptr ( CST to TYPE )</tt></b></dt>
1756 <dd>Convert a integer constant to a pointer constant. TYPE must be a
1757 pointer type. CST must be of integer type. The CST value is zero extended,
1758 truncated, or unchanged to make it fit in a pointer size. This one is
1759 <i>really</i> dangerous!</dd>
1760
1761 <dt><b><tt>bitcast ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001762 <dd>Convert a constant, CST, to another TYPE. The size of CST and TYPE must be
1763 identical (same number of bits). The conversion is done as if the CST value
1764 was stored to memory and read back as TYPE. In other words, no bits change
Reid Spencer5b950642006-11-11 23:08:07 +00001765 with this operator, just the type. This can be used for conversion of
Reid Spencer404a3252007-02-15 03:07:05 +00001766 vector types to any other type, as long as they have the same bit width. For
Dan Gohmanc05dca92008-09-08 16:45:59 +00001767 pointers it is only valid to cast to another pointer type. It is not valid
1768 to bitcast to or from an aggregate type.
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001769 </dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001770
1771 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1772
1773 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1774 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1775 instruction, the index list may have zero or more indexes, which are required
1776 to make sense for the type of "CSTPTR".</dd>
1777
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001778 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1779
1780 <dd>Perform the <a href="#i_select">select operation</a> on
Reid Spencer9965ee72006-12-04 19:23:19 +00001781 constants.</dd>
1782
1783 <dt><b><tt>icmp COND ( VAL1, VAL2 )</tt></b></dt>
1784 <dd>Performs the <a href="#i_icmp">icmp operation</a> on constants.</dd>
1785
1786 <dt><b><tt>fcmp COND ( VAL1, VAL2 )</tt></b></dt>
1787 <dd>Performs the <a href="#i_fcmp">fcmp operation</a> on constants.</dd>
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001788
Nate Begemand2195702008-05-12 19:01:56 +00001789 <dt><b><tt>vicmp COND ( VAL1, VAL2 )</tt></b></dt>
1790 <dd>Performs the <a href="#i_vicmp">vicmp operation</a> on constants.</dd>
1791
1792 <dt><b><tt>vfcmp COND ( VAL1, VAL2 )</tt></b></dt>
1793 <dd>Performs the <a href="#i_vfcmp">vfcmp operation</a> on constants.</dd>
1794
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001795 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1796
1797 <dd>Perform the <a href="#i_extractelement">extractelement
1798 operation</a> on constants.
1799
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001800 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1801
1802 <dd>Perform the <a href="#i_insertelement">insertelement
Reid Spencer9965ee72006-12-04 19:23:19 +00001803 operation</a> on constants.</dd>
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001804
Chris Lattner016a0e52006-04-08 00:13:41 +00001805
1806 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
1807
1808 <dd>Perform the <a href="#i_shufflevector">shufflevector
Reid Spencer9965ee72006-12-04 19:23:19 +00001809 operation</a> on constants.</dd>
Chris Lattner016a0e52006-04-08 00:13:41 +00001810
Chris Lattner74d3f822004-12-09 17:30:23 +00001811 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
1812
Reid Spencer641f5c92004-12-09 18:13:12 +00001813 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
1814 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
Chris Lattner74d3f822004-12-09 17:30:23 +00001815 binary</a> operations. The constraints on operands are the same as those for
1816 the corresponding instruction (e.g. no bitwise operations on floating point
John Criswell02fdc6f2005-05-12 16:52:32 +00001817 values are allowed).</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001818</dl>
Chris Lattner74d3f822004-12-09 17:30:23 +00001819</div>
Chris Lattnerb1652612004-03-08 16:49:10 +00001820
Chris Lattner2f7c9632001-06-06 20:29:01 +00001821<!-- *********************************************************************** -->
Chris Lattner98f013c2006-01-25 23:47:57 +00001822<div class="doc_section"> <a name="othervalues">Other Values</a> </div>
1823<!-- *********************************************************************** -->
1824
1825<!-- ======================================================================= -->
1826<div class="doc_subsection">
1827<a name="inlineasm">Inline Assembler Expressions</a>
1828</div>
1829
1830<div class="doc_text">
1831
1832<p>
1833LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
1834Module-Level Inline Assembly</a>) through the use of a special value. This
1835value represents the inline assembler as a string (containing the instructions
1836to emit), a list of operand constraints (stored as a string), and a flag that
1837indicates whether or not the inline asm expression has side effects. An example
1838inline assembler expression is:
1839</p>
1840
Bill Wendling3716c5d2007-05-29 09:04:49 +00001841<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001842<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001843i32 (i32) asm "bswap $0", "=r,r"
Chris Lattner98f013c2006-01-25 23:47:57 +00001844</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001845</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001846
1847<p>
1848Inline assembler expressions may <b>only</b> be used as the callee operand of
1849a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
1850</p>
1851
Bill Wendling3716c5d2007-05-29 09:04:49 +00001852<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001853<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001854%X = call i32 asm "<a href="#int_bswap">bswap</a> $0", "=r,r"(i32 %Y)
Chris Lattner98f013c2006-01-25 23:47:57 +00001855</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001856</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001857
1858<p>
1859Inline asms with side effects not visible in the constraint list must be marked
1860as having side effects. This is done through the use of the
1861'<tt>sideeffect</tt>' keyword, like so:
1862</p>
1863
Bill Wendling3716c5d2007-05-29 09:04:49 +00001864<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001865<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001866call void asm sideeffect "eieio", ""()
Chris Lattner98f013c2006-01-25 23:47:57 +00001867</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001868</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001869
1870<p>TODO: The format of the asm and constraints string still need to be
1871documented here. Constraints on what can be done (e.g. duplication, moving, etc
Chris Lattnerd5528262008-10-04 18:36:02 +00001872need to be documented). This is probably best done by reference to another
1873document that covers inline asm from a holistic perspective.
Chris Lattner98f013c2006-01-25 23:47:57 +00001874</p>
1875
1876</div>
1877
1878<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001879<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
1880<!-- *********************************************************************** -->
Chris Lattner74d3f822004-12-09 17:30:23 +00001881
Misha Brukman76307852003-11-08 01:05:38 +00001882<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001883
Chris Lattner48b383b02003-11-25 01:02:51 +00001884<p>The LLVM instruction set consists of several different
1885classifications of instructions: <a href="#terminators">terminator
John Criswell4a3327e2005-05-13 22:25:59 +00001886instructions</a>, <a href="#binaryops">binary instructions</a>,
1887<a href="#bitwiseops">bitwise binary instructions</a>, <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001888 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
1889instructions</a>.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001890
Misha Brukman76307852003-11-08 01:05:38 +00001891</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001892
Chris Lattner2f7c9632001-06-06 20:29:01 +00001893<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001894<div class="doc_subsection"> <a name="terminators">Terminator
1895Instructions</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001896
Misha Brukman76307852003-11-08 01:05:38 +00001897<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001898
Chris Lattner48b383b02003-11-25 01:02:51 +00001899<p>As mentioned <a href="#functionstructure">previously</a>, every
1900basic block in a program ends with a "Terminator" instruction, which
1901indicates which block should be executed after the current block is
1902finished. These terminator instructions typically yield a '<tt>void</tt>'
1903value: they produce control flow, not values (the one exception being
1904the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
John Criswelldfe6a862004-12-10 15:51:16 +00001905<p>There are six different terminator instructions: the '<a
Chris Lattner48b383b02003-11-25 01:02:51 +00001906 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
1907instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001908the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
1909 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
1910 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001911
Misha Brukman76307852003-11-08 01:05:38 +00001912</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001913
Chris Lattner2f7c9632001-06-06 20:29:01 +00001914<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001915<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
1916Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001917<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001918<h5>Syntax:</h5>
Dan Gohmancc3132e2008-10-04 19:00:07 +00001919<pre>
1920 ret &lt;type&gt; &lt;value&gt; <i>; Return a value from a non-void function</i>
Chris Lattner590645f2002-04-14 06:13:44 +00001921 ret void <i>; Return from void function</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001922</pre>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001923
Chris Lattner2f7c9632001-06-06 20:29:01 +00001924<h5>Overview:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001925
Dan Gohmancc3132e2008-10-04 19:00:07 +00001926<p>The '<tt>ret</tt>' instruction is used to return control flow (and
1927optionally a value) from a function back to the caller.</p>
John Criswell417228d2004-04-09 16:48:45 +00001928<p>There are two forms of the '<tt>ret</tt>' instruction: one that
Dan Gohmancc3132e2008-10-04 19:00:07 +00001929returns a value and then causes control flow, and one that just causes
Chris Lattner48b383b02003-11-25 01:02:51 +00001930control flow to occur.</p>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001931
Chris Lattner2f7c9632001-06-06 20:29:01 +00001932<h5>Arguments:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001933
Dan Gohmancc3132e2008-10-04 19:00:07 +00001934<p>The '<tt>ret</tt>' instruction optionally accepts a single argument,
1935the return value. The type of the return value must be a
1936'<a href="#t_firstclass">first class</a>' type.</p>
1937
1938<p>A function is not <a href="#wellformed">well formed</a> if
1939it it has a non-void return type and contains a '<tt>ret</tt>'
1940instruction with no return value or a return value with a type that
1941does not match its type, or if it has a void return type and contains
1942a '<tt>ret</tt>' instruction with a return value.</p>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001943
Chris Lattner2f7c9632001-06-06 20:29:01 +00001944<h5>Semantics:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001945
Chris Lattner48b383b02003-11-25 01:02:51 +00001946<p>When the '<tt>ret</tt>' instruction is executed, control flow
1947returns back to the calling function's context. If the caller is a "<a
John Criswell40db33f2004-06-25 15:16:57 +00001948 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
Chris Lattner48b383b02003-11-25 01:02:51 +00001949the instruction after the call. If the caller was an "<a
1950 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
John Criswell02fdc6f2005-05-12 16:52:32 +00001951at the beginning of the "normal" destination block. If the instruction
Chris Lattner48b383b02003-11-25 01:02:51 +00001952returns a value, that value shall set the call or invoke instruction's
Dan Gohmancc3132e2008-10-04 19:00:07 +00001953return value.
Chris Lattnerda508ac2008-04-23 04:59:35 +00001954
Chris Lattner2f7c9632001-06-06 20:29:01 +00001955<h5>Example:</h5>
Chris Lattnerda508ac2008-04-23 04:59:35 +00001956
1957<pre>
1958 ret i32 5 <i>; Return an integer value of 5</i>
Chris Lattner590645f2002-04-14 06:13:44 +00001959 ret void <i>; Return from a void function</i>
Dan Gohmancc3132e2008-10-04 19:00:07 +00001960 ret { i32, i8 } { i32 4, i8 2 } <i>; Return an aggregate of values 4 and 2</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001961</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001962</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001963<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001964<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001965<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001966<h5>Syntax:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001967<pre> br i1 &lt;cond&gt;, label &lt;iftrue&gt;, label &lt;iffalse&gt;<br> br label &lt;dest&gt; <i>; Unconditional branch</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001968</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001969<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001970<p>The '<tt>br</tt>' instruction is used to cause control flow to
1971transfer to a different basic block in the current function. There are
1972two forms of this instruction, corresponding to a conditional branch
1973and an unconditional branch.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001974<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001975<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
Reid Spencer36a15422007-01-12 03:35:51 +00001976single '<tt>i1</tt>' value and two '<tt>label</tt>' values. The
Reid Spencer50c723a2007-02-19 23:54:10 +00001977unconditional form of the '<tt>br</tt>' instruction takes a single
1978'<tt>label</tt>' value as a target.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001979<h5>Semantics:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001980<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>i1</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00001981argument is evaluated. If the value is <tt>true</tt>, control flows
1982to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
1983control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001984<h5>Example:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001985<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
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001986 href="#i_ret">ret</a> i32 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> i32 0<br></pre>
Misha Brukman76307852003-11-08 01:05:38 +00001987</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001988<!-- _______________________________________________________________________ -->
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001989<div class="doc_subsubsection">
1990 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
1991</div>
1992
Misha Brukman76307852003-11-08 01:05:38 +00001993<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001994<h5>Syntax:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001995
1996<pre>
1997 switch &lt;intty&gt; &lt;value&gt;, label &lt;defaultdest&gt; [ &lt;intty&gt; &lt;val&gt;, label &lt;dest&gt; ... ]
1998</pre>
1999
Chris Lattner2f7c9632001-06-06 20:29:01 +00002000<h5>Overview:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002001
2002<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
2003several different places. It is a generalization of the '<tt>br</tt>'
Misha Brukman76307852003-11-08 01:05:38 +00002004instruction, allowing a branch to occur to one of many possible
2005destinations.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002006
2007
Chris Lattner2f7c9632001-06-06 20:29:01 +00002008<h5>Arguments:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002009
2010<p>The '<tt>switch</tt>' instruction uses three parameters: an integer
2011comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
2012an array of pairs of comparison value constants and '<tt>label</tt>'s. The
2013table is not allowed to contain duplicate constant entries.</p>
2014
Chris Lattner2f7c9632001-06-06 20:29:01 +00002015<h5>Semantics:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002016
Chris Lattner48b383b02003-11-25 01:02:51 +00002017<p>The <tt>switch</tt> instruction specifies a table of values and
2018destinations. When the '<tt>switch</tt>' instruction is executed, this
John Criswellbcbb18c2004-06-25 16:05:06 +00002019table is searched for the given value. If the value is found, control flow is
2020transfered to the corresponding destination; otherwise, control flow is
2021transfered to the default destination.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002022
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002023<h5>Implementation:</h5>
2024
2025<p>Depending on properties of the target machine and the particular
2026<tt>switch</tt> instruction, this instruction may be code generated in different
John Criswellbcbb18c2004-06-25 16:05:06 +00002027ways. For example, it could be generated as a series of chained conditional
2028branches or with a lookup table.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002029
2030<h5>Example:</h5>
2031
2032<pre>
2033 <i>; Emulate a conditional br instruction</i>
Reid Spencer36a15422007-01-12 03:35:51 +00002034 %Val = <a href="#i_zext">zext</a> i1 %value to i32
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002035 switch i32 %Val, label %truedest [i32 0, label %falsedest ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002036
2037 <i>; Emulate an unconditional br instruction</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002038 switch i32 0, label %dest [ ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00002039
2040 <i>; Implement a jump table:</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002041 switch i32 %val, label %otherwise [ i32 0, label %onzero
2042 i32 1, label %onone
2043 i32 2, label %ontwo ]
Chris Lattner2f7c9632001-06-06 20:29:01 +00002044</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002045</div>
Chris Lattner0132aff2005-05-06 22:57:40 +00002046
Chris Lattner2f7c9632001-06-06 20:29:01 +00002047<!-- _______________________________________________________________________ -->
Chris Lattner0132aff2005-05-06 22:57:40 +00002048<div class="doc_subsubsection">
2049 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
2050</div>
2051
Misha Brukman76307852003-11-08 01:05:38 +00002052<div class="doc_text">
Chris Lattner0132aff2005-05-06 22:57:40 +00002053
Chris Lattner2f7c9632001-06-06 20:29:01 +00002054<h5>Syntax:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00002055
2056<pre>
Devang Patel02256232008-10-07 17:48:33 +00002057 &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>]
Chris Lattner6b7a0082006-05-14 18:23:06 +00002058 to label &lt;normal label&gt; unwind label &lt;exception label&gt;
Chris Lattner0132aff2005-05-06 22:57:40 +00002059</pre>
2060
Chris Lattnera8292f32002-05-06 22:08:29 +00002061<h5>Overview:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00002062
2063<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
2064function, with the possibility of control flow transfer to either the
John Criswell02fdc6f2005-05-12 16:52:32 +00002065'<tt>normal</tt>' label or the
2066'<tt>exception</tt>' label. If the callee function returns with the
Chris Lattner0132aff2005-05-06 22:57:40 +00002067"<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
2068"normal" label. If the callee (or any indirect callees) returns with the "<a
John Criswell02fdc6f2005-05-12 16:52:32 +00002069href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
Dan Gohmancc3132e2008-10-04 19:00:07 +00002070continued at the dynamically nearest "exception" label.
Chris Lattner0132aff2005-05-06 22:57:40 +00002071
Chris Lattner2f7c9632001-06-06 20:29:01 +00002072<h5>Arguments:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00002073
Misha Brukman76307852003-11-08 01:05:38 +00002074<p>This instruction requires several arguments:</p>
Chris Lattner0132aff2005-05-06 22:57:40 +00002075
Chris Lattner2f7c9632001-06-06 20:29:01 +00002076<ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00002077 <li>
Duncan Sands16f122e2007-03-30 12:22:09 +00002078 The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattner0132aff2005-05-06 22:57:40 +00002079 convention</a> the call should use. If none is specified, the call defaults
2080 to using C calling conventions.
2081 </li>
Devang Patel7e9b05e2008-10-06 18:50:38 +00002082
2083 <li>The optional <a href="#paramattrs">Parameter Attributes</a> list for
2084 return values. Only '<tt>zeroext</tt>', '<tt>signext</tt>',
2085 and '<tt>inreg</tt>' attributes are valid here.</li>
2086
Chris Lattner0132aff2005-05-06 22:57:40 +00002087 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
2088 function value being invoked. In most cases, this is a direct function
2089 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
2090 an arbitrary pointer to function value.
2091 </li>
2092
2093 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
2094 function to be invoked. </li>
2095
2096 <li>'<tt>function args</tt>': argument list whose types match the function
2097 signature argument types. If the function signature indicates the function
2098 accepts a variable number of arguments, the extra arguments can be
2099 specified. </li>
2100
2101 <li>'<tt>normal label</tt>': the label reached when the called function
2102 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
2103
2104 <li>'<tt>exception label</tt>': the label reached when a callee returns with
2105 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
2106
Devang Patel02256232008-10-07 17:48:33 +00002107 <li>The optional <a href="#fnattrs">function attributes</a> list. Only
Devang Patel7e9b05e2008-10-06 18:50:38 +00002108 '<tt>noreturn</tt>', '<tt>nounwind</tt>', '<tt>readonly</tt>' and
2109 '<tt>readnone</tt>' attributes are valid here.</li>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002110</ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00002111
Chris Lattner2f7c9632001-06-06 20:29:01 +00002112<h5>Semantics:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00002113
Misha Brukman76307852003-11-08 01:05:38 +00002114<p>This instruction is designed to operate as a standard '<tt><a
Chris Lattner0132aff2005-05-06 22:57:40 +00002115href="#i_call">call</a></tt>' instruction in most regards. The primary
2116difference is that it establishes an association with a label, which is used by
2117the runtime library to unwind the stack.</p>
2118
2119<p>This instruction is used in languages with destructors to ensure that proper
2120cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
2121exception. Additionally, this is important for implementation of
2122'<tt>catch</tt>' clauses in high-level languages that support them.</p>
2123
Chris Lattner2f7c9632001-06-06 20:29:01 +00002124<h5>Example:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00002125<pre>
Nick Lewycky084ab472008-03-16 07:18:12 +00002126 %retval = invoke i32 @Test(i32 15) to label %Continue
Jeff Cohen5819f182007-04-22 01:17:39 +00002127 unwind label %TestCleanup <i>; {i32}:retval set</i>
Nick Lewycky084ab472008-03-16 07:18:12 +00002128 %retval = invoke <a href="#callingconv">coldcc</a> i32 %Testfnptr(i32 15) to label %Continue
Jeff Cohen5819f182007-04-22 01:17:39 +00002129 unwind label %TestCleanup <i>; {i32}:retval set</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002130</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002131</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002132
2133
Chris Lattner5ed60612003-09-03 00:41:47 +00002134<!-- _______________________________________________________________________ -->
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002135
Chris Lattner48b383b02003-11-25 01:02:51 +00002136<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
2137Instruction</a> </div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002138
Misha Brukman76307852003-11-08 01:05:38 +00002139<div class="doc_text">
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002140
Chris Lattner5ed60612003-09-03 00:41:47 +00002141<h5>Syntax:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002142<pre>
2143 unwind
2144</pre>
2145
Chris Lattner5ed60612003-09-03 00:41:47 +00002146<h5>Overview:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002147
2148<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
2149at the first callee in the dynamic call stack which used an <a
2150href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
2151primarily used to implement exception handling.</p>
2152
Chris Lattner5ed60612003-09-03 00:41:47 +00002153<h5>Semantics:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002154
Chris Lattnerfe8519c2008-04-19 21:01:16 +00002155<p>The '<tt>unwind</tt>' instruction causes execution of the current function to
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002156immediately halt. The dynamic call stack is then searched for the first <a
2157href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
2158execution continues at the "exceptional" destination block specified by the
2159<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
2160dynamic call chain, undefined behavior results.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002161</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00002162
2163<!-- _______________________________________________________________________ -->
2164
2165<div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
2166Instruction</a> </div>
2167
2168<div class="doc_text">
2169
2170<h5>Syntax:</h5>
2171<pre>
2172 unreachable
2173</pre>
2174
2175<h5>Overview:</h5>
2176
2177<p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
2178instruction is used to inform the optimizer that a particular portion of the
2179code is not reachable. This can be used to indicate that the code after a
2180no-return function cannot be reached, and other facts.</p>
2181
2182<h5>Semantics:</h5>
2183
2184<p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
2185</div>
2186
2187
2188
Chris Lattner2f7c9632001-06-06 20:29:01 +00002189<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002190<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002191<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +00002192<p>Binary operators are used to do most of the computation in a
Chris Lattner81f92972008-04-01 18:47:32 +00002193program. They require two operands of the same type, execute an operation on them, and
John Criswelldfe6a862004-12-10 15:51:16 +00002194produce a single value. The operands might represent
Reid Spencer404a3252007-02-15 03:07:05 +00002195multiple data, as is the case with the <a href="#t_vector">vector</a> data type.
Chris Lattner81f92972008-04-01 18:47:32 +00002196The result value has the same type as its operands.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002197<p>There are several different binary operators:</p>
Misha Brukman76307852003-11-08 01:05:38 +00002198</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002199<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002200<div class="doc_subsubsection">
2201 <a name="i_add">'<tt>add</tt>' Instruction</a>
2202</div>
2203
Misha Brukman76307852003-11-08 01:05:38 +00002204<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002205
Chris Lattner2f7c9632001-06-06 20:29:01 +00002206<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002207
2208<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002209 &lt;result&gt; = add &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002210</pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002211
Chris Lattner2f7c9632001-06-06 20:29:01 +00002212<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002213
Misha Brukman76307852003-11-08 01:05:38 +00002214<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002215
Chris Lattner2f7c9632001-06-06 20:29:01 +00002216<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002217
2218<p>The two arguments to the '<tt>add</tt>' instruction must be <a
2219 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>, or
2220 <a href="#t_vector">vector</a> values. Both arguments must have identical
2221 types.</p>
2222
Chris Lattner2f7c9632001-06-06 20:29:01 +00002223<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002224
Misha Brukman76307852003-11-08 01:05:38 +00002225<p>The value produced is the integer or floating point sum of the two
2226operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002227
Chris Lattner2f2427e2008-01-28 00:36:27 +00002228<p>If an integer sum has unsigned overflow, the result returned is the
2229mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2230the result.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002231
Chris Lattner2f2427e2008-01-28 00:36:27 +00002232<p>Because LLVM integers use a two's complement representation, this
2233instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002234
Chris Lattner2f7c9632001-06-06 20:29:01 +00002235<h5>Example:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002236
2237<pre>
2238 &lt;result&gt; = add i32 4, %var <i>; yields {i32}:result = 4 + %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002239</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002240</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002241<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002242<div class="doc_subsubsection">
2243 <a name="i_sub">'<tt>sub</tt>' Instruction</a>
2244</div>
2245
Misha Brukman76307852003-11-08 01:05:38 +00002246<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002247
Chris Lattner2f7c9632001-06-06 20:29:01 +00002248<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002249
2250<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002251 &lt;result&gt; = sub &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002252</pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002253
Chris Lattner2f7c9632001-06-06 20:29:01 +00002254<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002255
Misha Brukman76307852003-11-08 01:05:38 +00002256<p>The '<tt>sub</tt>' instruction returns the difference of its two
2257operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002258
2259<p>Note that the '<tt>sub</tt>' instruction is used to represent the
2260'<tt>neg</tt>' instruction present in most other intermediate
2261representations.</p>
2262
Chris Lattner2f7c9632001-06-06 20:29:01 +00002263<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002264
2265<p>The two arguments to the '<tt>sub</tt>' instruction must be <a
2266 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2267 or <a href="#t_vector">vector</a> values. Both arguments must have identical
2268 types.</p>
2269
Chris Lattner2f7c9632001-06-06 20:29:01 +00002270<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002271
Chris Lattner48b383b02003-11-25 01:02:51 +00002272<p>The value produced is the integer or floating point difference of
2273the two operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002274
Chris Lattner2f2427e2008-01-28 00:36:27 +00002275<p>If an integer difference has unsigned overflow, the result returned is the
2276mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2277the result.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002278
Chris Lattner2f2427e2008-01-28 00:36:27 +00002279<p>Because LLVM integers use a two's complement representation, this
2280instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002281
Chris Lattner2f7c9632001-06-06 20:29:01 +00002282<h5>Example:</h5>
Bill Wendling2d8b9a82007-05-29 09:42:13 +00002283<pre>
2284 &lt;result&gt; = sub i32 4, %var <i>; yields {i32}:result = 4 - %var</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002285 &lt;result&gt; = sub i32 0, %val <i>; yields {i32}:result = -%var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002286</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002287</div>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002288
Chris Lattner2f7c9632001-06-06 20:29:01 +00002289<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002290<div class="doc_subsubsection">
2291 <a name="i_mul">'<tt>mul</tt>' Instruction</a>
2292</div>
2293
Misha Brukman76307852003-11-08 01:05:38 +00002294<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002295
Chris Lattner2f7c9632001-06-06 20:29:01 +00002296<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002297<pre> &lt;result&gt; = mul &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002298</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002299<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002300<p>The '<tt>mul</tt>' instruction returns the product of its two
2301operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002302
Chris Lattner2f7c9632001-06-06 20:29:01 +00002303<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002304
2305<p>The two arguments to the '<tt>mul</tt>' instruction must be <a
2306href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2307or <a href="#t_vector">vector</a> values. Both arguments must have identical
2308types.</p>
2309
Chris Lattner2f7c9632001-06-06 20:29:01 +00002310<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002311
Chris Lattner48b383b02003-11-25 01:02:51 +00002312<p>The value produced is the integer or floating point product of the
Misha Brukman76307852003-11-08 01:05:38 +00002313two operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002314
Chris Lattner2f2427e2008-01-28 00:36:27 +00002315<p>If the result of an integer multiplication has unsigned overflow,
2316the result returned is the mathematical result modulo
23172<sup>n</sup>, where n is the bit width of the result.</p>
2318<p>Because LLVM integers use a two's complement representation, and the
2319result is the same width as the operands, this instruction returns the
2320correct result for both signed and unsigned integers. If a full product
2321(e.g. <tt>i32</tt>x<tt>i32</tt>-><tt>i64</tt>) is needed, the operands
2322should be sign-extended or zero-extended as appropriate to the
2323width of the full product.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002324<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002325<pre> &lt;result&gt; = mul i32 4, %var <i>; yields {i32}:result = 4 * %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002326</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002327</div>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002328
Chris Lattner2f7c9632001-06-06 20:29:01 +00002329<!-- _______________________________________________________________________ -->
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002330<div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
2331</a></div>
2332<div class="doc_text">
2333<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002334<pre> &lt;result&gt; = udiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002335</pre>
2336<h5>Overview:</h5>
2337<p>The '<tt>udiv</tt>' instruction returns the quotient of its two
2338operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002339
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002340<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002341
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002342<p>The two arguments to the '<tt>udiv</tt>' instruction must be
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002343<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2344values. Both arguments must have identical types.</p>
2345
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002346<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002347
Chris Lattner2f2427e2008-01-28 00:36:27 +00002348<p>The value produced is the unsigned integer quotient of the two operands.</p>
2349<p>Note that unsigned integer division and signed integer division are distinct
2350operations; for signed integer division, use '<tt>sdiv</tt>'.</p>
2351<p>Division by zero leads to undefined behavior.</p>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002352<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002353<pre> &lt;result&gt; = udiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002354</pre>
2355</div>
2356<!-- _______________________________________________________________________ -->
2357<div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
2358</a> </div>
2359<div class="doc_text">
2360<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002361<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002362 &lt;result&gt; = sdiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002363</pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002364
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002365<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002366
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002367<p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
2368operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002369
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002370<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002371
2372<p>The two arguments to the '<tt>sdiv</tt>' instruction must be
2373<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2374values. Both arguments must have identical types.</p>
2375
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002376<h5>Semantics:</h5>
Chris Lattner1429e6f2008-04-01 18:45:27 +00002377<p>The value produced is the signed integer quotient of the two operands rounded towards zero.</p>
Chris Lattner2f2427e2008-01-28 00:36:27 +00002378<p>Note that signed integer division and unsigned integer division are distinct
2379operations; for unsigned integer division, use '<tt>udiv</tt>'.</p>
2380<p>Division by zero leads to undefined behavior. Overflow also leads to
2381undefined behavior; this is a rare case, but can occur, for example,
2382by doing a 32-bit division of -2147483648 by -1.</p>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002383<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002384<pre> &lt;result&gt; = sdiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002385</pre>
2386</div>
2387<!-- _______________________________________________________________________ -->
2388<div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00002389Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002390<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002391<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002392<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002393 &lt;result&gt; = fdiv &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002394</pre>
2395<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002396
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002397<p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
Chris Lattner48b383b02003-11-25 01:02:51 +00002398operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002399
Chris Lattner48b383b02003-11-25 01:02:51 +00002400<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002401
Jeff Cohen5819f182007-04-22 01:17:39 +00002402<p>The two arguments to the '<tt>fdiv</tt>' instruction must be
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002403<a href="#t_floating">floating point</a> or <a href="#t_vector">vector</a>
2404of floating point values. Both arguments must have identical types.</p>
2405
Chris Lattner48b383b02003-11-25 01:02:51 +00002406<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002407
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002408<p>The value produced is the floating point quotient of the two operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002409
Chris Lattner48b383b02003-11-25 01:02:51 +00002410<h5>Example:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002411
2412<pre>
2413 &lt;result&gt; = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002414</pre>
2415</div>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002416
Chris Lattner48b383b02003-11-25 01:02:51 +00002417<!-- _______________________________________________________________________ -->
Reid Spencer7eb55b32006-11-02 01:53:59 +00002418<div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
2419</div>
2420<div class="doc_text">
2421<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002422<pre> &lt;result&gt; = urem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002423</pre>
2424<h5>Overview:</h5>
2425<p>The '<tt>urem</tt>' instruction returns the remainder from the
2426unsigned division of its two arguments.</p>
2427<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002428<p>The two arguments to the '<tt>urem</tt>' instruction must be
2429<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2430values. Both arguments must have identical types.</p>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002431<h5>Semantics:</h5>
2432<p>This instruction returns the unsigned integer <i>remainder</i> of a division.
Chris Lattner1429e6f2008-04-01 18:45:27 +00002433This instruction always performs an unsigned division to get the remainder.</p>
Chris Lattner2f2427e2008-01-28 00:36:27 +00002434<p>Note that unsigned integer remainder and signed integer remainder are
2435distinct operations; for signed integer remainder, use '<tt>srem</tt>'.</p>
2436<p>Taking the remainder of a division by zero leads to undefined behavior.</p>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002437<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002438<pre> &lt;result&gt; = urem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002439</pre>
2440
2441</div>
2442<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002443<div class="doc_subsubsection">
2444 <a name="i_srem">'<tt>srem</tt>' Instruction</a>
2445</div>
2446
Chris Lattner48b383b02003-11-25 01:02:51 +00002447<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002448
Chris Lattner48b383b02003-11-25 01:02:51 +00002449<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002450
2451<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002452 &lt;result&gt; = srem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002453</pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002454
Chris Lattner48b383b02003-11-25 01:02:51 +00002455<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002456
Reid Spencer7eb55b32006-11-02 01:53:59 +00002457<p>The '<tt>srem</tt>' instruction returns the remainder from the
Dan Gohman08143e32007-11-05 23:35:22 +00002458signed division of its two operands. This instruction can also take
2459<a href="#t_vector">vector</a> versions of the values in which case
2460the elements must be integers.</p>
Chris Lattnerb8f816e2008-01-04 04:33:49 +00002461
Chris Lattner48b383b02003-11-25 01:02:51 +00002462<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002463
Reid Spencer7eb55b32006-11-02 01:53:59 +00002464<p>The two arguments to the '<tt>srem</tt>' instruction must be
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002465<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2466values. Both arguments must have identical types.</p>
2467
Chris Lattner48b383b02003-11-25 01:02:51 +00002468<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002469
Reid Spencer7eb55b32006-11-02 01:53:59 +00002470<p>This instruction returns the <i>remainder</i> of a division (where the result
Gabor Greif0f75ad02008-08-07 21:46:00 +00002471has the same sign as the dividend, <tt>op1</tt>), not the <i>modulo</i>
2472operator (where the result has the same sign as the divisor, <tt>op2</tt>) of
Reid Spencer806ad6a2007-03-24 22:23:39 +00002473a value. For more information about the difference, see <a
Chris Lattner48b383b02003-11-25 01:02:51 +00002474 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
Reid Spencer806ad6a2007-03-24 22:23:39 +00002475Math Forum</a>. For a table of how this is implemented in various languages,
Reid Spencerdb3b93b2007-03-24 22:40:44 +00002476please see <a href="http://en.wikipedia.org/wiki/Modulo_operation">
Reid Spencer806ad6a2007-03-24 22:23:39 +00002477Wikipedia: modulo operation</a>.</p>
Chris Lattner2f2427e2008-01-28 00:36:27 +00002478<p>Note that signed integer remainder and unsigned integer remainder are
2479distinct operations; for unsigned integer remainder, use '<tt>urem</tt>'.</p>
2480<p>Taking the remainder of a division by zero leads to undefined behavior.
2481Overflow also leads to undefined behavior; this is a rare case, but can occur,
2482for example, by taking the remainder of a 32-bit division of -2147483648 by -1.
2483(The remainder doesn't actually overflow, but this rule lets srem be
2484implemented using instructions that return both the result of the division
2485and the remainder.)</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002486<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002487<pre> &lt;result&gt; = srem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002488</pre>
2489
2490</div>
2491<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002492<div class="doc_subsubsection">
2493 <a name="i_frem">'<tt>frem</tt>' Instruction</a> </div>
2494
Reid Spencer7eb55b32006-11-02 01:53:59 +00002495<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002496
Reid Spencer7eb55b32006-11-02 01:53:59 +00002497<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002498<pre> &lt;result&gt; = frem &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002499</pre>
2500<h5>Overview:</h5>
2501<p>The '<tt>frem</tt>' instruction returns the remainder from the
2502division of its two operands.</p>
2503<h5>Arguments:</h5>
2504<p>The two arguments to the '<tt>frem</tt>' instruction must be
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002505<a href="#t_floating">floating point</a> or <a href="#t_vector">vector</a>
2506of floating point values. Both arguments must have identical types.</p>
2507
Reid Spencer7eb55b32006-11-02 01:53:59 +00002508<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002509
Chris Lattner1429e6f2008-04-01 18:45:27 +00002510<p>This instruction returns the <i>remainder</i> of a division.
2511The remainder has the same sign as the dividend.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002512
Reid Spencer7eb55b32006-11-02 01:53:59 +00002513<h5>Example:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002514
2515<pre>
2516 &lt;result&gt; = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002517</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002518</div>
Robert Bocchino820bc75b2006-02-17 21:18:08 +00002519
Reid Spencer2ab01932007-02-02 13:57:07 +00002520<!-- ======================================================================= -->
2521<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
2522Operations</a> </div>
2523<div class="doc_text">
2524<p>Bitwise binary operators are used to do various forms of
2525bit-twiddling in a program. They are generally very efficient
2526instructions and can commonly be strength reduced from other
Chris Lattner1429e6f2008-04-01 18:45:27 +00002527instructions. They require two operands of the same type, execute an operation on them,
2528and produce a single value. The resulting value is the same type as its operands.</p>
Reid Spencer2ab01932007-02-02 13:57:07 +00002529</div>
2530
Reid Spencer04e259b2007-01-31 21:39:12 +00002531<!-- _______________________________________________________________________ -->
2532<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2533Instruction</a> </div>
2534<div class="doc_text">
2535<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002536<pre> &lt;result&gt; = shl &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002537</pre>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002538
Reid Spencer04e259b2007-01-31 21:39:12 +00002539<h5>Overview:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002540
Reid Spencer04e259b2007-01-31 21:39:12 +00002541<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2542the left a specified number of bits.</p>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002543
Reid Spencer04e259b2007-01-31 21:39:12 +00002544<h5>Arguments:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002545
Reid Spencer04e259b2007-01-31 21:39:12 +00002546<p>Both arguments to the '<tt>shl</tt>' instruction must be the same <a
Nate Begemanfecbc8c2008-07-29 15:49:41 +00002547 href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greif0f75ad02008-08-07 21:46:00 +00002548type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002549
Reid Spencer04e259b2007-01-31 21:39:12 +00002550<h5>Semantics:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002551
Gabor Greif0f75ad02008-08-07 21:46:00 +00002552<p>The value produced is <tt>op1</tt> * 2<sup><tt>op2</tt></sup> mod 2<sup>n</sup>,
2553where n is the width of the result. If <tt>op2</tt> is (statically or dynamically) negative or
2554equal to or larger than the number of bits in <tt>op1</tt>, the result is undefined.</p>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002555
Reid Spencer04e259b2007-01-31 21:39:12 +00002556<h5>Example:</h5><pre>
2557 &lt;result&gt; = shl i32 4, %var <i>; yields {i32}: 4 &lt;&lt; %var</i>
2558 &lt;result&gt; = shl i32 4, 2 <i>; yields {i32}: 16</i>
2559 &lt;result&gt; = shl i32 1, 10 <i>; yields {i32}: 1024</i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002560 &lt;result&gt; = shl i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002561</pre>
2562</div>
2563<!-- _______________________________________________________________________ -->
2564<div class="doc_subsubsection"> <a name="i_lshr">'<tt>lshr</tt>'
2565Instruction</a> </div>
2566<div class="doc_text">
2567<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002568<pre> &lt;result&gt; = lshr &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002569</pre>
2570
2571<h5>Overview:</h5>
2572<p>The '<tt>lshr</tt>' instruction (logical shift right) returns the first
Jeff Cohen5819f182007-04-22 01:17:39 +00002573operand shifted to the right a specified number of bits with zero fill.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002574
2575<h5>Arguments:</h5>
2576<p>Both arguments to the '<tt>lshr</tt>' instruction must be the same
Nate Begemanfecbc8c2008-07-29 15:49:41 +00002577<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greif0f75ad02008-08-07 21:46:00 +00002578type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002579
2580<h5>Semantics:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002581
Reid Spencer04e259b2007-01-31 21:39:12 +00002582<p>This instruction always performs a logical shift right operation. The most
2583significant bits of the result will be filled with zero bits after the
Gabor Greif0f75ad02008-08-07 21:46:00 +00002584shift. If <tt>op2</tt> is (statically or dynamically) equal to or larger than
2585the number of bits in <tt>op1</tt>, the result is undefined.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002586
2587<h5>Example:</h5>
2588<pre>
2589 &lt;result&gt; = lshr i32 4, 1 <i>; yields {i32}:result = 2</i>
2590 &lt;result&gt; = lshr i32 4, 2 <i>; yields {i32}:result = 1</i>
2591 &lt;result&gt; = lshr i8 4, 3 <i>; yields {i8}:result = 0</i>
2592 &lt;result&gt; = lshr i8 -2, 1 <i>; yields {i8}:result = 0x7FFFFFFF </i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002593 &lt;result&gt; = lshr i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002594</pre>
2595</div>
2596
Reid Spencer2ab01932007-02-02 13:57:07 +00002597<!-- _______________________________________________________________________ -->
Reid Spencer04e259b2007-01-31 21:39:12 +00002598<div class="doc_subsubsection"> <a name="i_ashr">'<tt>ashr</tt>'
2599Instruction</a> </div>
2600<div class="doc_text">
2601
2602<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002603<pre> &lt;result&gt; = ashr &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002604</pre>
2605
2606<h5>Overview:</h5>
2607<p>The '<tt>ashr</tt>' instruction (arithmetic shift right) returns the first
Jeff Cohen5819f182007-04-22 01:17:39 +00002608operand shifted to the right a specified number of bits with sign extension.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002609
2610<h5>Arguments:</h5>
2611<p>Both arguments to the '<tt>ashr</tt>' instruction must be the same
Nate Begemanfecbc8c2008-07-29 15:49:41 +00002612<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
Gabor Greif0f75ad02008-08-07 21:46:00 +00002613type. '<tt>op2</tt>' is treated as an unsigned value.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002614
2615<h5>Semantics:</h5>
2616<p>This instruction always performs an arithmetic shift right operation,
2617The most significant bits of the result will be filled with the sign bit
Gabor Greif0f75ad02008-08-07 21:46:00 +00002618of <tt>op1</tt>. If <tt>op2</tt> is (statically or dynamically) equal to or
2619larger than the number of bits in <tt>op1</tt>, the result is undefined.
Chris Lattnerf0e50112007-10-03 21:01:14 +00002620</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002621
2622<h5>Example:</h5>
2623<pre>
2624 &lt;result&gt; = ashr i32 4, 1 <i>; yields {i32}:result = 2</i>
2625 &lt;result&gt; = ashr i32 4, 2 <i>; yields {i32}:result = 1</i>
2626 &lt;result&gt; = ashr i8 4, 3 <i>; yields {i8}:result = 0</i>
2627 &lt;result&gt; = ashr i8 -2, 1 <i>; yields {i8}:result = -1</i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002628 &lt;result&gt; = ashr i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002629</pre>
2630</div>
2631
Chris Lattner2f7c9632001-06-06 20:29:01 +00002632<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002633<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
2634Instruction</a> </div>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002635
Misha Brukman76307852003-11-08 01:05:38 +00002636<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002637
Chris Lattner2f7c9632001-06-06 20:29:01 +00002638<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002639
2640<pre>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002641 &lt;result&gt; = and &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002642</pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002643
Chris Lattner2f7c9632001-06-06 20:29:01 +00002644<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002645
Chris Lattner48b383b02003-11-25 01:02:51 +00002646<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
2647its two operands.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002648
Chris Lattner2f7c9632001-06-06 20:29:01 +00002649<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002650
2651<p>The two arguments to the '<tt>and</tt>' instruction must be
2652<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2653values. Both arguments must have identical types.</p>
2654
Chris Lattner2f7c9632001-06-06 20:29:01 +00002655<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002656<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002657<p> </p>
Bill Wendling5703c6e2008-09-07 10:29:20 +00002658<div>
Misha Brukman76307852003-11-08 01:05:38 +00002659<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +00002660 <tbody>
2661 <tr>
2662 <td>In0</td>
2663 <td>In1</td>
2664 <td>Out</td>
2665 </tr>
2666 <tr>
2667 <td>0</td>
2668 <td>0</td>
2669 <td>0</td>
2670 </tr>
2671 <tr>
2672 <td>0</td>
2673 <td>1</td>
2674 <td>0</td>
2675 </tr>
2676 <tr>
2677 <td>1</td>
2678 <td>0</td>
2679 <td>0</td>
2680 </tr>
2681 <tr>
2682 <td>1</td>
2683 <td>1</td>
2684 <td>1</td>
2685 </tr>
2686 </tbody>
2687</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002688</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002689<h5>Example:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002690<pre>
2691 &lt;result&gt; = and i32 4, %var <i>; yields {i32}:result = 4 &amp; %var</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002692 &lt;result&gt; = and i32 15, 40 <i>; yields {i32}:result = 8</i>
2693 &lt;result&gt; = and i32 4, 8 <i>; yields {i32}:result = 0</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002694</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002695</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002696<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002697<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002698<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002699<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002700<pre> &lt;result&gt; = or &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002701</pre>
Chris Lattner48b383b02003-11-25 01:02:51 +00002702<h5>Overview:</h5>
2703<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
2704or of its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002705<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002706
2707<p>The two arguments to the '<tt>or</tt>' instruction must be
2708<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2709values. Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002710<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002711<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002712<p> </p>
Bill Wendling5703c6e2008-09-07 10:29:20 +00002713<div>
Chris Lattner48b383b02003-11-25 01:02:51 +00002714<table border="1" cellspacing="0" cellpadding="4">
2715 <tbody>
2716 <tr>
2717 <td>In0</td>
2718 <td>In1</td>
2719 <td>Out</td>
2720 </tr>
2721 <tr>
2722 <td>0</td>
2723 <td>0</td>
2724 <td>0</td>
2725 </tr>
2726 <tr>
2727 <td>0</td>
2728 <td>1</td>
2729 <td>1</td>
2730 </tr>
2731 <tr>
2732 <td>1</td>
2733 <td>0</td>
2734 <td>1</td>
2735 </tr>
2736 <tr>
2737 <td>1</td>
2738 <td>1</td>
2739 <td>1</td>
2740 </tr>
2741 </tbody>
2742</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002743</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002744<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002745<pre> &lt;result&gt; = or i32 4, %var <i>; yields {i32}:result = 4 | %var</i>
2746 &lt;result&gt; = or i32 15, 40 <i>; yields {i32}:result = 47</i>
2747 &lt;result&gt; = or i32 4, 8 <i>; yields {i32}:result = 12</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002748</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002749</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002750<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002751<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
2752Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002753<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002754<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00002755<pre> &lt;result&gt; = xor &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002756</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002757<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002758<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2759or of its two operands. The <tt>xor</tt> is used to implement the
2760"one's complement" operation, which is the "~" operator in C.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002761<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002762<p>The two arguments to the '<tt>xor</tt>' instruction must be
2763<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2764values. Both arguments must have identical types.</p>
2765
Chris Lattner2f7c9632001-06-06 20:29:01 +00002766<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00002767
Misha Brukman76307852003-11-08 01:05:38 +00002768<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002769<p> </p>
Bill Wendling5703c6e2008-09-07 10:29:20 +00002770<div>
Chris Lattner48b383b02003-11-25 01:02:51 +00002771<table border="1" cellspacing="0" cellpadding="4">
2772 <tbody>
2773 <tr>
2774 <td>In0</td>
2775 <td>In1</td>
2776 <td>Out</td>
2777 </tr>
2778 <tr>
2779 <td>0</td>
2780 <td>0</td>
2781 <td>0</td>
2782 </tr>
2783 <tr>
2784 <td>0</td>
2785 <td>1</td>
2786 <td>1</td>
2787 </tr>
2788 <tr>
2789 <td>1</td>
2790 <td>0</td>
2791 <td>1</td>
2792 </tr>
2793 <tr>
2794 <td>1</td>
2795 <td>1</td>
2796 <td>0</td>
2797 </tr>
2798 </tbody>
2799</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002800</div>
Chris Lattner48b383b02003-11-25 01:02:51 +00002801<p> </p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002802<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002803<pre> &lt;result&gt; = xor i32 4, %var <i>; yields {i32}:result = 4 ^ %var</i>
2804 &lt;result&gt; = xor i32 15, 40 <i>; yields {i32}:result = 39</i>
2805 &lt;result&gt; = xor i32 4, 8 <i>; yields {i32}:result = 12</i>
2806 &lt;result&gt; = xor i32 %V, -1 <i>; yields {i32}:result = ~%V</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002807</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002808</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002809
Chris Lattner2f7c9632001-06-06 20:29:01 +00002810<!-- ======================================================================= -->
Chris Lattner54611b42005-11-06 08:02:57 +00002811<div class="doc_subsection">
Chris Lattnerce83bff2006-04-08 23:07:04 +00002812 <a name="vectorops">Vector Operations</a>
2813</div>
2814
2815<div class="doc_text">
2816
2817<p>LLVM supports several instructions to represent vector operations in a
Jeff Cohen5819f182007-04-22 01:17:39 +00002818target-independent manner. These instructions cover the element-access and
Chris Lattnerce83bff2006-04-08 23:07:04 +00002819vector-specific operations needed to process vectors effectively. While LLVM
2820does directly support these vector operations, many sophisticated algorithms
2821will want to use target-specific intrinsics to take full advantage of a specific
2822target.</p>
2823
2824</div>
2825
2826<!-- _______________________________________________________________________ -->
2827<div class="doc_subsubsection">
2828 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
2829</div>
2830
2831<div class="doc_text">
2832
2833<h5>Syntax:</h5>
2834
2835<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002836 &lt;result&gt; = extractelement &lt;n x &lt;ty&gt;&gt; &lt;val&gt;, i32 &lt;idx&gt; <i>; yields &lt;ty&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002837</pre>
2838
2839<h5>Overview:</h5>
2840
2841<p>
2842The '<tt>extractelement</tt>' instruction extracts a single scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002843element from a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002844</p>
2845
2846
2847<h5>Arguments:</h5>
2848
2849<p>
2850The first operand of an '<tt>extractelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002851value of <a href="#t_vector">vector</a> type. The second operand is
Chris Lattnerce83bff2006-04-08 23:07:04 +00002852an index indicating the position from which to extract the element.
2853The index may be a variable.</p>
2854
2855<h5>Semantics:</h5>
2856
2857<p>
2858The result is a scalar of the same type as the element type of
2859<tt>val</tt>. Its value is the value at position <tt>idx</tt> of
2860<tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
2861results are undefined.
2862</p>
2863
2864<h5>Example:</h5>
2865
2866<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002867 %result = extractelement &lt;4 x i32&gt; %vec, i32 0 <i>; yields i32</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002868</pre>
2869</div>
2870
2871
2872<!-- _______________________________________________________________________ -->
2873<div class="doc_subsubsection">
2874 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
2875</div>
2876
2877<div class="doc_text">
2878
2879<h5>Syntax:</h5>
2880
2881<pre>
Dan Gohman43ba0672008-05-12 23:38:42 +00002882 &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>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002883</pre>
2884
2885<h5>Overview:</h5>
2886
2887<p>
2888The '<tt>insertelement</tt>' instruction inserts a scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002889element into a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002890</p>
2891
2892
2893<h5>Arguments:</h5>
2894
2895<p>
2896The first operand of an '<tt>insertelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002897value of <a href="#t_vector">vector</a> type. The second operand is a
Chris Lattnerce83bff2006-04-08 23:07:04 +00002898scalar value whose type must equal the element type of the first
2899operand. The third operand is an index indicating the position at
2900which to insert the value. The index may be a variable.</p>
2901
2902<h5>Semantics:</h5>
2903
2904<p>
Reid Spencer404a3252007-02-15 03:07:05 +00002905The result is a vector of the same type as <tt>val</tt>. Its
Chris Lattnerce83bff2006-04-08 23:07:04 +00002906element values are those of <tt>val</tt> except at position
2907<tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
2908exceeds the length of <tt>val</tt>, the results are undefined.
2909</p>
2910
2911<h5>Example:</h5>
2912
2913<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002914 %result = insertelement &lt;4 x i32&gt; %vec, i32 1, i32 0 <i>; yields &lt;4 x i32&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002915</pre>
2916</div>
2917
2918<!-- _______________________________________________________________________ -->
2919<div class="doc_subsubsection">
2920 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
2921</div>
2922
2923<div class="doc_text">
2924
2925<h5>Syntax:</h5>
2926
2927<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002928 &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;n x i32&gt; &lt;mask&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002929</pre>
2930
2931<h5>Overview:</h5>
2932
2933<p>
2934The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
2935from two input vectors, returning a vector of the same type.
2936</p>
2937
2938<h5>Arguments:</h5>
2939
2940<p>
2941The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
2942with types that match each other and types that match the result of the
2943instruction. The third argument is a shuffle mask, which has the same number
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002944of elements as the other vector type, but whose element type is always 'i32'.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002945</p>
2946
2947<p>
2948The shuffle mask operand is required to be a constant vector with either
2949constant integer or undef values.
2950</p>
2951
2952<h5>Semantics:</h5>
2953
2954<p>
2955The elements of the two input vectors are numbered from left to right across
2956both of the vectors. The shuffle mask operand specifies, for each element of
2957the result vector, which element of the two input registers the result element
2958gets. The element selector may be undef (meaning "don't care") and the second
2959operand may be undef if performing a shuffle from only one vector.
2960</p>
2961
2962<h5>Example:</h5>
2963
2964<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002965 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
Jeff Cohen5819f182007-04-22 01:17:39 +00002966 &lt;4 x i32&gt; &lt;i32 0, i32 4, i32 1, i32 5&gt; <i>; yields &lt;4 x i32&gt;</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002967 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; undef,
2968 &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.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002969</pre>
2970</div>
2971
Tanya Lattnerb138bbe2006-04-14 19:24:33 +00002972
Chris Lattnerce83bff2006-04-08 23:07:04 +00002973<!-- ======================================================================= -->
2974<div class="doc_subsection">
Dan Gohmanb9d66602008-05-12 23:51:09 +00002975 <a name="aggregateops">Aggregate Operations</a>
2976</div>
2977
2978<div class="doc_text">
2979
2980<p>LLVM supports several instructions for working with aggregate values.
2981</p>
2982
2983</div>
2984
2985<!-- _______________________________________________________________________ -->
2986<div class="doc_subsubsection">
2987 <a name="i_extractvalue">'<tt>extractvalue</tt>' Instruction</a>
2988</div>
2989
2990<div class="doc_text">
2991
2992<h5>Syntax:</h5>
2993
2994<pre>
2995 &lt;result&gt; = extractvalue &lt;aggregate type&gt; &lt;val&gt;, &lt;idx&gt;{, &lt;idx&gt;}*
2996</pre>
2997
2998<h5>Overview:</h5>
2999
3000<p>
Dan Gohman35a835c2008-05-13 18:16:06 +00003001The '<tt>extractvalue</tt>' instruction extracts the value of a struct field
3002or array element from an aggregate value.
Dan Gohmanb9d66602008-05-12 23:51:09 +00003003</p>
3004
3005
3006<h5>Arguments:</h5>
3007
3008<p>
3009The first operand of an '<tt>extractvalue</tt>' instruction is a
3010value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a>
Dan Gohman35a835c2008-05-13 18:16:06 +00003011type. The operands are constant indices to specify which value to extract
Dan Gohman1ecaf452008-05-31 00:58:22 +00003012in a similar manner as indices in a
Dan Gohmanb9d66602008-05-12 23:51:09 +00003013'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
3014</p>
3015
3016<h5>Semantics:</h5>
3017
3018<p>
3019The result is the value at the position in the aggregate specified by
3020the index operands.
3021</p>
3022
3023<h5>Example:</h5>
3024
3025<pre>
Dan Gohman1ecaf452008-05-31 00:58:22 +00003026 %result = extractvalue {i32, float} %agg, 0 <i>; yields i32</i>
Dan Gohmanb9d66602008-05-12 23:51:09 +00003027</pre>
3028</div>
3029
3030
3031<!-- _______________________________________________________________________ -->
3032<div class="doc_subsubsection">
3033 <a name="i_insertvalue">'<tt>insertvalue</tt>' Instruction</a>
3034</div>
3035
3036<div class="doc_text">
3037
3038<h5>Syntax:</h5>
3039
3040<pre>
Dan Gohman1ecaf452008-05-31 00:58:22 +00003041 &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 Gohmanb9d66602008-05-12 23:51:09 +00003042</pre>
3043
3044<h5>Overview:</h5>
3045
3046<p>
3047The '<tt>insertvalue</tt>' instruction inserts a value
Dan Gohman35a835c2008-05-13 18:16:06 +00003048into a struct field or array element in an aggregate.
Dan Gohmanb9d66602008-05-12 23:51:09 +00003049</p>
3050
3051
3052<h5>Arguments:</h5>
3053
3054<p>
3055The first operand of an '<tt>insertvalue</tt>' instruction is a
3056value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a> type.
3057The second operand is a first-class value to insert.
Dan Gohman34d1c0d2008-05-23 21:53:15 +00003058The following operands are constant indices
Dan Gohman1ecaf452008-05-31 00:58:22 +00003059indicating the position at which to insert the value in a similar manner as
Dan Gohman35a835c2008-05-13 18:16:06 +00003060indices in a
Dan Gohmanb9d66602008-05-12 23:51:09 +00003061'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
3062The value to insert must have the same type as the value identified
Dan Gohman35a835c2008-05-13 18:16:06 +00003063by the indices.
Dan Gohmanb9d66602008-05-12 23:51:09 +00003064
3065<h5>Semantics:</h5>
3066
3067<p>
3068The result is an aggregate of the same type as <tt>val</tt>. Its
3069value is that of <tt>val</tt> except that the value at the position
Dan Gohman35a835c2008-05-13 18:16:06 +00003070specified by the indices is that of <tt>elt</tt>.
Dan Gohmanb9d66602008-05-12 23:51:09 +00003071</p>
3072
3073<h5>Example:</h5>
3074
3075<pre>
Dan Gohman88ce1a52008-06-23 15:26:37 +00003076 %result = insertvalue {i32, float} %agg, i32 1, 0 <i>; yields {i32, float}</i>
Dan Gohmanb9d66602008-05-12 23:51:09 +00003077</pre>
3078</div>
3079
3080
3081<!-- ======================================================================= -->
3082<div class="doc_subsection">
Chris Lattner6ab66722006-08-15 00:45:58 +00003083 <a name="memoryops">Memory Access and Addressing Operations</a>
Chris Lattner54611b42005-11-06 08:02:57 +00003084</div>
3085
Misha Brukman76307852003-11-08 01:05:38 +00003086<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00003087
Chris Lattner48b383b02003-11-25 01:02:51 +00003088<p>A key design point of an SSA-based representation is how it
3089represents memory. In LLVM, no memory locations are in SSA form, which
3090makes things very simple. This section describes how to read, write,
John Criswelldfe6a862004-12-10 15:51:16 +00003091allocate, and free memory in LLVM.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003092
Misha Brukman76307852003-11-08 01:05:38 +00003093</div>
Chris Lattner54611b42005-11-06 08:02:57 +00003094
Chris Lattner2f7c9632001-06-06 20:29:01 +00003095<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00003096<div class="doc_subsubsection">
3097 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
3098</div>
3099
Misha Brukman76307852003-11-08 01:05:38 +00003100<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00003101
Chris Lattner2f7c9632001-06-06 20:29:01 +00003102<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003103
3104<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003105 &lt;result&gt; = malloc &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00003106</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00003107
Chris Lattner2f7c9632001-06-06 20:29:01 +00003108<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003109
Chris Lattner48b383b02003-11-25 01:02:51 +00003110<p>The '<tt>malloc</tt>' instruction allocates memory from the system
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00003111heap and returns a pointer to it. The object is always allocated in the generic
3112address space (address space zero).</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003113
Chris Lattner2f7c9632001-06-06 20:29:01 +00003114<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003115
3116<p>The '<tt>malloc</tt>' instruction allocates
3117<tt>sizeof(&lt;type&gt;)*NumElements</tt>
John Criswella92e5862004-02-24 16:13:56 +00003118bytes of memory from the operating system and returns a pointer of the
Chris Lattner54611b42005-11-06 08:02:57 +00003119appropriate type to the program. If "NumElements" is specified, it is the
Gabor Greifdd1fc982008-02-09 22:24:34 +00003120number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner1f17cce2008-04-02 00:38:26 +00003121If a constant alignment is specified, the value result of the allocation is guaranteed to
Gabor Greifdd1fc982008-02-09 22:24:34 +00003122be aligned to at least that boundary. If not specified, or if zero, the target can
3123choose to align the allocation on any convenient boundary.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003124
Misha Brukman76307852003-11-08 01:05:38 +00003125<p>'<tt>type</tt>' must be a sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003126
Chris Lattner2f7c9632001-06-06 20:29:01 +00003127<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003128
Chris Lattner48b383b02003-11-25 01:02:51 +00003129<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
Chris Lattnerfe8519c2008-04-19 21:01:16 +00003130a pointer is returned. The result of a zero byte allocattion is undefined. The
3131result is null if there is insufficient memory available.</p>
Misha Brukman76307852003-11-08 01:05:38 +00003132
Chris Lattner54611b42005-11-06 08:02:57 +00003133<h5>Example:</h5>
3134
3135<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003136 %array = malloc [4 x i8 ] <i>; yields {[%4 x i8]*}:array</i>
Chris Lattner54611b42005-11-06 08:02:57 +00003137
Bill Wendling2d8b9a82007-05-29 09:42:13 +00003138 %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
3139 %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>
3140 %array2 = malloc [12 x i8], i32 %size <i>; yields {[12 x i8]*}:array2</i>
3141 %array3 = malloc i32, i32 4, align 1024 <i>; yields {i32*}:array3</i>
3142 %array4 = malloc i32, align 1024 <i>; yields {i32*}:array4</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00003143</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003144</div>
Chris Lattner54611b42005-11-06 08:02:57 +00003145
Chris Lattner2f7c9632001-06-06 20:29:01 +00003146<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00003147<div class="doc_subsubsection">
3148 <a name="i_free">'<tt>free</tt>' Instruction</a>
3149</div>
3150
Misha Brukman76307852003-11-08 01:05:38 +00003151<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00003152
Chris Lattner2f7c9632001-06-06 20:29:01 +00003153<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003154
3155<pre>
3156 free &lt;type&gt; &lt;value&gt; <i>; yields {void}</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00003157</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00003158
Chris Lattner2f7c9632001-06-06 20:29:01 +00003159<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003160
Chris Lattner48b383b02003-11-25 01:02:51 +00003161<p>The '<tt>free</tt>' instruction returns memory back to the unused
John Criswell4a3327e2005-05-13 22:25:59 +00003162memory heap to be reallocated in the future.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003163
Chris Lattner2f7c9632001-06-06 20:29:01 +00003164<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003165
Chris Lattner48b383b02003-11-25 01:02:51 +00003166<p>'<tt>value</tt>' shall be a pointer value that points to a value
3167that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
3168instruction.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003169
Chris Lattner2f7c9632001-06-06 20:29:01 +00003170<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003171
John Criswelldfe6a862004-12-10 15:51:16 +00003172<p>Access to the memory pointed to by the pointer is no longer defined
Chris Lattner0f103e12008-04-19 22:41:32 +00003173after this instruction executes. If the pointer is null, the operation
3174is a noop.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003175
Chris Lattner2f7c9632001-06-06 20:29:01 +00003176<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003177
3178<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003179 %array = <a href="#i_malloc">malloc</a> [4 x i8] <i>; yields {[4 x i8]*}:array</i>
3180 free [4 x i8]* %array
Chris Lattner2f7c9632001-06-06 20:29:01 +00003181</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003182</div>
Chris Lattner54611b42005-11-06 08:02:57 +00003183
Chris Lattner2f7c9632001-06-06 20:29:01 +00003184<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00003185<div class="doc_subsubsection">
3186 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
3187</div>
3188
Misha Brukman76307852003-11-08 01:05:38 +00003189<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00003190
Chris Lattner2f7c9632001-06-06 20:29:01 +00003191<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003192
3193<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003194 &lt;result&gt; = alloca &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00003195</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00003196
Chris Lattner2f7c9632001-06-06 20:29:01 +00003197<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003198
Jeff Cohen5819f182007-04-22 01:17:39 +00003199<p>The '<tt>alloca</tt>' instruction allocates memory on the stack frame of the
3200currently executing function, to be automatically released when this function
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00003201returns to its caller. The object is always allocated in the generic address
3202space (address space zero).</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003203
Chris Lattner2f7c9632001-06-06 20:29:01 +00003204<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003205
John Criswelldfe6a862004-12-10 15:51:16 +00003206<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00003207bytes of memory on the runtime stack, returning a pointer of the
Gabor Greifdd1fc982008-02-09 22:24:34 +00003208appropriate type to the program. If "NumElements" is specified, it is the
3209number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner1f17cce2008-04-02 00:38:26 +00003210If a constant alignment is specified, the value result of the allocation is guaranteed
Gabor Greifdd1fc982008-02-09 22:24:34 +00003211to be aligned to at least that boundary. If not specified, or if zero, the target
3212can choose to align the allocation on any convenient boundary.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003213
Misha Brukman76307852003-11-08 01:05:38 +00003214<p>'<tt>type</tt>' may be any sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003215
Chris Lattner2f7c9632001-06-06 20:29:01 +00003216<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003217
Chris Lattnerfe8519c2008-04-19 21:01:16 +00003218<p>Memory is allocated; a pointer is returned. The operation is undefiend if
3219there is insufficient stack space for the allocation. '<tt>alloca</tt>'d
Chris Lattner48b383b02003-11-25 01:02:51 +00003220memory is automatically released when the function returns. The '<tt>alloca</tt>'
3221instruction is commonly used to represent automatic variables that must
3222have an address available. When the function returns (either with the <tt><a
John Criswellc932bef2005-05-12 16:55:34 +00003223 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
Chris Lattner1f17cce2008-04-02 00:38:26 +00003224instructions), the memory is reclaimed. Allocating zero bytes
3225is legal, but the result is undefined.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00003226
Chris Lattner2f7c9632001-06-06 20:29:01 +00003227<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00003228
3229<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003230 %ptr = alloca i32 <i>; yields {i32*}:ptr</i>
Bill Wendling3716c5d2007-05-29 09:04:49 +00003231 %ptr = alloca i32, i32 4 <i>; yields {i32*}:ptr</i>
3232 %ptr = alloca i32, i32 4, align 1024 <i>; yields {i32*}:ptr</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003233 %ptr = alloca i32, align 1024 <i>; yields {i32*}:ptr</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00003234</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003235</div>
Chris Lattner54611b42005-11-06 08:02:57 +00003236
Chris Lattner2f7c9632001-06-06 20:29:01 +00003237<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00003238<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
3239Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00003240<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00003241<h5>Syntax:</h5>
Christopher Lambbff50202007-04-21 08:16:25 +00003242<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>
Chris Lattner095735d2002-05-06 03:03:22 +00003243<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00003244<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00003245<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00003246<p>The argument to the '<tt>load</tt>' instruction specifies the memory
John Criswell4c0cf7f2005-10-24 16:17:18 +00003247address from which to load. The pointer must point to a <a
Chris Lattner10ee9652004-06-03 22:57:15 +00003248 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
John Criswell4c0cf7f2005-10-24 16:17:18 +00003249marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
Chris Lattner48b383b02003-11-25 01:02:51 +00003250the number or order of execution of this <tt>load</tt> with other
3251volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
3252instructions. </p>
Chris Lattner2a1993f2008-01-06 21:04:43 +00003253<p>
Chris Lattner1f17cce2008-04-02 00:38:26 +00003254The optional constant "align" argument specifies the alignment of the operation
Chris Lattner2a1993f2008-01-06 21:04:43 +00003255(that is, the alignment of the memory address). A value of 0 or an
3256omitted "align" argument means that the operation has the preferential
3257alignment for the target. It is the responsibility of the code emitter
3258to ensure that the alignment information is correct. Overestimating
3259the alignment results in an undefined behavior. Underestimating the
3260alignment may produce less efficient code. An alignment of 1 is always
3261safe.
3262</p>
Chris Lattner095735d2002-05-06 03:03:22 +00003263<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00003264<p>The location of memory pointed to is loaded.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00003265<h5>Examples:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003266<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00003267 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003268 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
3269 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00003270</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003271</div>
Chris Lattner095735d2002-05-06 03:03:22 +00003272<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00003273<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
3274Instruction</a> </div>
Reid Spencera89fb182006-11-09 21:18:01 +00003275<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00003276<h5>Syntax:</h5>
Christopher Lambbff50202007-04-21 08:16:25 +00003277<pre> store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
3278 volatile store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
Chris Lattner095735d2002-05-06 03:03:22 +00003279</pre>
Chris Lattner095735d2002-05-06 03:03:22 +00003280<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00003281<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00003282<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00003283<p>There are two arguments to the '<tt>store</tt>' instruction: a value
Jeff Cohen5819f182007-04-22 01:17:39 +00003284to store and an address at which to store it. The type of the '<tt>&lt;pointer&gt;</tt>'
Chris Lattner1f17cce2008-04-02 00:38:26 +00003285operand must be a pointer to the <a href="#t_firstclass">first class</a> type
3286of the '<tt>&lt;value&gt;</tt>'
John Criswell4a3327e2005-05-13 22:25:59 +00003287operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
Chris Lattner48b383b02003-11-25 01:02:51 +00003288optimizer is not allowed to modify the number or order of execution of
3289this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
3290 href="#i_store">store</a></tt> instructions.</p>
Chris Lattner2a1993f2008-01-06 21:04:43 +00003291<p>
Chris Lattner1f17cce2008-04-02 00:38:26 +00003292The optional constant "align" argument specifies the alignment of the operation
Chris Lattner2a1993f2008-01-06 21:04:43 +00003293(that is, the alignment of the memory address). A value of 0 or an
3294omitted "align" argument means that the operation has the preferential
3295alignment for the target. It is the responsibility of the code emitter
3296to ensure that the alignment information is correct. Overestimating
3297the alignment results in an undefined behavior. Underestimating the
3298alignment may produce less efficient code. An alignment of 1 is always
3299safe.
3300</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00003301<h5>Semantics:</h5>
3302<p>The contents of memory are updated to contain '<tt>&lt;value&gt;</tt>'
3303at the location specified by the '<tt>&lt;pointer&gt;</tt>' operand.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00003304<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003305<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Bill Wendling8830ffe2007-10-22 05:10:05 +00003306 store i32 3, i32* %ptr <i>; yields {void}</i>
3307 %val = <a href="#i_load">load</a> i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00003308</pre>
Reid Spencer443460a2006-11-09 21:15:49 +00003309</div>
3310
Chris Lattner095735d2002-05-06 03:03:22 +00003311<!-- _______________________________________________________________________ -->
Chris Lattner33fd7022004-04-05 01:30:49 +00003312<div class="doc_subsubsection">
3313 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
3314</div>
3315
Misha Brukman76307852003-11-08 01:05:38 +00003316<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00003317<h5>Syntax:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00003318<pre>
3319 &lt;result&gt; = getelementptr &lt;ty&gt;* &lt;ptrval&gt;{, &lt;ty&gt; &lt;idx&gt;}*
3320</pre>
3321
Chris Lattner590645f2002-04-14 06:13:44 +00003322<h5>Overview:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00003323
3324<p>
3325The '<tt>getelementptr</tt>' instruction is used to get the address of a
3326subelement of an aggregate data structure.</p>
3327
Chris Lattner590645f2002-04-14 06:13:44 +00003328<h5>Arguments:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00003329
Reid Spencercee005c2006-12-04 21:29:24 +00003330<p>This instruction takes a list of integer operands that indicate what
Chris Lattner33fd7022004-04-05 01:30:49 +00003331elements of the aggregate object to index to. The actual types of the arguments
3332provided depend on the type of the first pointer argument. The
3333'<tt>getelementptr</tt>' instruction is used to index down through the type
John Criswell88190562005-05-16 16:17:45 +00003334levels of a structure or to a specific index in an array. When indexing into a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003335structure, only <tt>i32</tt> integer constants are allowed. When indexing
Chris Lattner851b7712008-04-24 05:59:56 +00003336into an array or pointer, only integers of 32 or 64 bits are allowed; 32-bit
3337values will be sign extended to 64-bits if required.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003338
Chris Lattner48b383b02003-11-25 01:02:51 +00003339<p>For example, let's consider a C code fragment and how it gets
3340compiled to LLVM:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003341
Bill Wendling3716c5d2007-05-29 09:04:49 +00003342<div class="doc_code">
Chris Lattner33fd7022004-04-05 01:30:49 +00003343<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00003344struct RT {
3345 char A;
Chris Lattnera446f1b2007-05-29 15:43:56 +00003346 int B[10][20];
Bill Wendling3716c5d2007-05-29 09:04:49 +00003347 char C;
3348};
3349struct ST {
Chris Lattnera446f1b2007-05-29 15:43:56 +00003350 int X;
Bill Wendling3716c5d2007-05-29 09:04:49 +00003351 double Y;
3352 struct RT Z;
3353};
Chris Lattner33fd7022004-04-05 01:30:49 +00003354
Chris Lattnera446f1b2007-05-29 15:43:56 +00003355int *foo(struct ST *s) {
Bill Wendling3716c5d2007-05-29 09:04:49 +00003356 return &amp;s[1].Z.B[5][13];
3357}
Chris Lattner33fd7022004-04-05 01:30:49 +00003358</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00003359</div>
Chris Lattner33fd7022004-04-05 01:30:49 +00003360
Misha Brukman76307852003-11-08 01:05:38 +00003361<p>The LLVM code generated by the GCC frontend is:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003362
Bill Wendling3716c5d2007-05-29 09:04:49 +00003363<div class="doc_code">
Chris Lattner33fd7022004-04-05 01:30:49 +00003364<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00003365%RT = type { i8 , [10 x [20 x i32]], i8 }
3366%ST = type { i32, double, %RT }
Chris Lattner33fd7022004-04-05 01:30:49 +00003367
Bill Wendling3716c5d2007-05-29 09:04:49 +00003368define i32* %foo(%ST* %s) {
3369entry:
3370 %reg = getelementptr %ST* %s, i32 1, i32 2, i32 1, i32 5, i32 13
3371 ret i32* %reg
3372}
Chris Lattner33fd7022004-04-05 01:30:49 +00003373</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00003374</div>
Chris Lattner33fd7022004-04-05 01:30:49 +00003375
Chris Lattner590645f2002-04-14 06:13:44 +00003376<h5>Semantics:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00003377
3378<p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
John Criswell4a3327e2005-05-13 22:25:59 +00003379on the pointer type that is being indexed into. <a href="#t_pointer">Pointer</a>
Reid Spencercee005c2006-12-04 21:29:24 +00003380and <a href="#t_array">array</a> types can use a 32-bit or 64-bit
Reid Spencerc0312692006-12-03 16:53:48 +00003381<a href="#t_integer">integer</a> type but the value will always be sign extended
Chris Lattner1f17cce2008-04-02 00:38:26 +00003382to 64-bits. <a href="#t_struct">Structure</a> and <a href="#t_pstruct">packed
3383structure</a> types require <tt>i32</tt> <b>constants</b>.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003384
Misha Brukman76307852003-11-08 01:05:38 +00003385<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003386type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ i32, double, %RT
Chris Lattner33fd7022004-04-05 01:30:49 +00003387}</tt>' type, a structure. The second index indexes into the third element of
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003388the structure, yielding a '<tt>%RT</tt>' = '<tt>{ i8 , [10 x [20 x i32]],
3389i8 }</tt>' type, another structure. The third index indexes into the second
3390element of the structure, yielding a '<tt>[10 x [20 x i32]]</tt>' type, an
Chris Lattner33fd7022004-04-05 01:30:49 +00003391array. The two dimensions of the array are subscripted into, yielding an
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003392'<tt>i32</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
3393to this element, thus computing a value of '<tt>i32*</tt>' type.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003394
Chris Lattner48b383b02003-11-25 01:02:51 +00003395<p>Note that it is perfectly legal to index partially through a
3396structure, returning a pointer to an inner element. Because of this,
3397the LLVM code for the given testcase is equivalent to:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00003398
3399<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003400 define i32* %foo(%ST* %s) {
3401 %t1 = getelementptr %ST* %s, i32 1 <i>; yields %ST*:%t1</i>
Jeff Cohen5819f182007-04-22 01:17:39 +00003402 %t2 = getelementptr %ST* %t1, i32 0, i32 2 <i>; yields %RT*:%t2</i>
3403 %t3 = getelementptr %RT* %t2, i32 0, i32 1 <i>; yields [10 x [20 x i32]]*:%t3</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003404 %t4 = getelementptr [10 x [20 x i32]]* %t3, i32 0, i32 5 <i>; yields [20 x i32]*:%t4</i>
3405 %t5 = getelementptr [20 x i32]* %t4, i32 0, i32 13 <i>; yields i32*:%t5</i>
3406 ret i32* %t5
Chris Lattner33fd7022004-04-05 01:30:49 +00003407 }
Chris Lattnera8292f32002-05-06 22:08:29 +00003408</pre>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00003409
3410<p>Note that it is undefined to access an array out of bounds: array and
3411pointer indexes must always be within the defined bounds of the array type.
Chris Lattner851b7712008-04-24 05:59:56 +00003412The one exception for this rule is zero length arrays. These arrays are
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00003413defined to be accessible as variable length arrays, which requires access
3414beyond the zero'th element.</p>
3415
Chris Lattner6ab66722006-08-15 00:45:58 +00003416<p>The getelementptr instruction is often confusing. For some more insight
3417into how it works, see <a href="GetElementPtr.html">the getelementptr
3418FAQ</a>.</p>
3419
Chris Lattner590645f2002-04-14 06:13:44 +00003420<h5>Example:</h5>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00003421
Chris Lattner33fd7022004-04-05 01:30:49 +00003422<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003423 <i>; yields [12 x i8]*:aptr</i>
3424 %aptr = getelementptr {i32, [12 x i8]}* %sptr, i64 0, i32 1
Chris Lattner33fd7022004-04-05 01:30:49 +00003425</pre>
Chris Lattner33fd7022004-04-05 01:30:49 +00003426</div>
Reid Spencer443460a2006-11-09 21:15:49 +00003427
Chris Lattner2f7c9632001-06-06 20:29:01 +00003428<!-- ======================================================================= -->
Reid Spencer97c5fa42006-11-08 01:18:52 +00003429<div class="doc_subsection"> <a name="convertops">Conversion Operations</a>
Misha Brukman76307852003-11-08 01:05:38 +00003430</div>
Misha Brukman76307852003-11-08 01:05:38 +00003431<div class="doc_text">
Reid Spencer97c5fa42006-11-08 01:18:52 +00003432<p>The instructions in this category are the conversion instructions (casting)
3433which all take a single operand and a type. They perform various bit conversions
3434on the operand.</p>
Misha Brukman76307852003-11-08 01:05:38 +00003435</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003436
Chris Lattnera8292f32002-05-06 22:08:29 +00003437<!-- _______________________________________________________________________ -->
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003438<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003439 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
3440</div>
3441<div class="doc_text">
3442
3443<h5>Syntax:</h5>
3444<pre>
3445 &lt;result&gt; = trunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3446</pre>
3447
3448<h5>Overview:</h5>
3449<p>
3450The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
3451</p>
3452
3453<h5>Arguments:</h5>
3454<p>
3455The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
3456be an <a href="#t_integer">integer</a> type, and a type that specifies the size
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003457and type of the result, which must be an <a href="#t_integer">integer</a>
Reid Spencer51b07252006-11-09 23:03:26 +00003458type. The bit size of <tt>value</tt> must be larger than the bit size of
3459<tt>ty2</tt>. Equal sized types are not allowed.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003460
3461<h5>Semantics:</h5>
3462<p>
3463The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
Reid Spencer51b07252006-11-09 23:03:26 +00003464and converts the remaining bits to <tt>ty2</tt>. Since the source size must be
3465larger than the destination size, <tt>trunc</tt> cannot be a <i>no-op cast</i>.
3466It will always truncate bits.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003467
3468<h5>Example:</h5>
3469<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003470 %X = trunc i32 257 to i8 <i>; yields i8:1</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003471 %Y = trunc i32 123 to i1 <i>; yields i1:true</i>
3472 %Y = trunc i32 122 to i1 <i>; yields i1:false</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003473</pre>
3474</div>
3475
3476<!-- _______________________________________________________________________ -->
3477<div class="doc_subsubsection">
3478 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
3479</div>
3480<div class="doc_text">
3481
3482<h5>Syntax:</h5>
3483<pre>
3484 &lt;result&gt; = zext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3485</pre>
3486
3487<h5>Overview:</h5>
3488<p>The '<tt>zext</tt>' instruction zero extends its operand to type
3489<tt>ty2</tt>.</p>
3490
3491
3492<h5>Arguments:</h5>
3493<p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003494<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3495also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00003496<tt>value</tt> must be smaller than the bit size of the destination type,
3497<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003498
3499<h5>Semantics:</h5>
3500<p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
Chris Lattnerc87f3df2007-05-24 19:13:27 +00003501bits until it reaches the size of the destination type, <tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003502
Reid Spencer07c9c682007-01-12 15:46:11 +00003503<p>When zero extending from i1, the result will always be either 0 or 1.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003504
3505<h5>Example:</h5>
3506<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003507 %X = zext i32 257 to i64 <i>; yields i64:257</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003508 %Y = zext i1 true to i32 <i>; yields i32:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003509</pre>
3510</div>
3511
3512<!-- _______________________________________________________________________ -->
3513<div class="doc_subsubsection">
3514 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
3515</div>
3516<div class="doc_text">
3517
3518<h5>Syntax:</h5>
3519<pre>
3520 &lt;result&gt; = sext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3521</pre>
3522
3523<h5>Overview:</h5>
3524<p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
3525
3526<h5>Arguments:</h5>
3527<p>
3528The '<tt>sext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003529<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3530also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00003531<tt>value</tt> must be smaller than the bit size of the destination type,
3532<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003533
3534<h5>Semantics:</h5>
3535<p>
3536The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
3537bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
Chris Lattnerc87f3df2007-05-24 19:13:27 +00003538the type <tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003539
Reid Spencer36a15422007-01-12 03:35:51 +00003540<p>When sign extending from i1, the extension always results in -1 or 0.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003541
3542<h5>Example:</h5>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003543<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003544 %X = sext i8 -1 to i16 <i>; yields i16 :65535</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003545 %Y = sext i1 true to i32 <i>; yields i32:-1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003546</pre>
3547</div>
3548
3549<!-- _______________________________________________________________________ -->
3550<div class="doc_subsubsection">
Reid Spencer2e2740d2006-11-09 21:48:10 +00003551 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
3552</div>
3553
3554<div class="doc_text">
3555
3556<h5>Syntax:</h5>
3557
3558<pre>
3559 &lt;result&gt; = fptrunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3560</pre>
3561
3562<h5>Overview:</h5>
3563<p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
3564<tt>ty2</tt>.</p>
3565
3566
3567<h5>Arguments:</h5>
3568<p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
3569 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
3570cast it to. The size of <tt>value</tt> must be larger than the size of
3571<tt>ty2</tt>. This implies that <tt>fptrunc</tt> cannot be used to make a
3572<i>no-op cast</i>.</p>
3573
3574<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003575<p> The '<tt>fptrunc</tt>' instruction truncates a <tt>value</tt> from a larger
3576<a href="#t_floating">floating point</a> type to a smaller
3577<a href="#t_floating">floating point</a> type. If the value cannot fit within
3578the destination type, <tt>ty2</tt>, then the results are undefined.</p>
Reid Spencer2e2740d2006-11-09 21:48:10 +00003579
3580<h5>Example:</h5>
3581<pre>
3582 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
3583 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
3584</pre>
3585</div>
3586
3587<!-- _______________________________________________________________________ -->
3588<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003589 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
3590</div>
3591<div class="doc_text">
3592
3593<h5>Syntax:</h5>
3594<pre>
3595 &lt;result&gt; = fpext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3596</pre>
3597
3598<h5>Overview:</h5>
3599<p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
3600floating point value.</p>
3601
3602<h5>Arguments:</h5>
3603<p>The '<tt>fpext</tt>' instruction takes a
3604<a href="#t_floating">floating point</a> <tt>value</tt> to cast,
Reid Spencer51b07252006-11-09 23:03:26 +00003605and a <a href="#t_floating">floating point</a> type to cast it to. The source
3606type must be smaller than the destination type.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003607
3608<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003609<p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from a smaller
Duncan Sands16f122e2007-03-30 12:22:09 +00003610<a href="#t_floating">floating point</a> type to a larger
3611<a href="#t_floating">floating point</a> type. The <tt>fpext</tt> cannot be
Reid Spencer51b07252006-11-09 23:03:26 +00003612used to make a <i>no-op cast</i> because it always changes bits. Use
Reid Spencer5b950642006-11-11 23:08:07 +00003613<tt>bitcast</tt> to make a <i>no-op cast</i> for a floating point cast.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003614
3615<h5>Example:</h5>
3616<pre>
3617 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
3618 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
3619</pre>
3620</div>
3621
3622<!-- _______________________________________________________________________ -->
3623<div class="doc_subsubsection">
Reid Spencer2eadb532007-01-21 00:29:26 +00003624 <a name="i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003625</div>
3626<div class="doc_text">
3627
3628<h5>Syntax:</h5>
3629<pre>
Reid Spencer753163d2007-07-31 14:40:14 +00003630 &lt;result&gt; = fptoui &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003631</pre>
3632
3633<h5>Overview:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003634<p>The '<tt>fptoui</tt>' converts a floating point <tt>value</tt> to its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003635unsigned integer equivalent of type <tt>ty2</tt>.
3636</p>
3637
3638<h5>Arguments:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003639<p>The '<tt>fptoui</tt>' instruction takes a value to cast, which must be a
Nate Begemand4d45c22007-11-17 03:58:34 +00003640scalar or vector <a href="#t_floating">floating point</a> value, and a type
3641to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3642type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3643vector integer type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003644
3645<h5>Semantics:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003646<p> The '<tt>fptoui</tt>' instruction converts its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003647<a href="#t_floating">floating point</a> operand into the nearest (rounding
3648towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
3649the results are undefined.</p>
3650
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003651<h5>Example:</h5>
3652<pre>
Reid Spencer753163d2007-07-31 14:40:14 +00003653 %X = fptoui double 123.0 to i32 <i>; yields i32:123</i>
Chris Lattner5b95a172007-09-22 03:17:52 +00003654 %Y = fptoui float 1.0E+300 to i1 <i>; yields undefined:1</i>
Reid Spencer753163d2007-07-31 14:40:14 +00003655 %X = fptoui float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003656</pre>
3657</div>
3658
3659<!-- _______________________________________________________________________ -->
3660<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003661 <a name="i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003662</div>
3663<div class="doc_text">
3664
3665<h5>Syntax:</h5>
3666<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003667 &lt;result&gt; = fptosi &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003668</pre>
3669
3670<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003671<p>The '<tt>fptosi</tt>' instruction converts
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003672<a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003673</p>
3674
Chris Lattnera8292f32002-05-06 22:08:29 +00003675<h5>Arguments:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003676<p> The '<tt>fptosi</tt>' instruction takes a value to cast, which must be a
Nate Begemand4d45c22007-11-17 03:58:34 +00003677scalar or vector <a href="#t_floating">floating point</a> value, and a type
3678to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3679type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3680vector integer type with the same number of elements as <tt>ty</tt></p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003681
Chris Lattnera8292f32002-05-06 22:08:29 +00003682<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003683<p>The '<tt>fptosi</tt>' instruction converts its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003684<a href="#t_floating">floating point</a> operand into the nearest (rounding
3685towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3686the results are undefined.</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003687
Chris Lattner70de6632001-07-09 00:26:23 +00003688<h5>Example:</h5>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003689<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003690 %X = fptosi double -123.0 to i32 <i>; yields i32:-123</i>
Chris Lattner5b95a172007-09-22 03:17:52 +00003691 %Y = fptosi float 1.0E-247 to i1 <i>; yields undefined:1</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003692 %X = fptosi float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003693</pre>
3694</div>
3695
3696<!-- _______________________________________________________________________ -->
3697<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003698 <a name="i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003699</div>
3700<div class="doc_text">
3701
3702<h5>Syntax:</h5>
3703<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003704 &lt;result&gt; = uitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003705</pre>
3706
3707<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003708<p>The '<tt>uitofp</tt>' instruction regards <tt>value</tt> as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003709integer and converts that value to the <tt>ty2</tt> type.</p>
3710
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003711<h5>Arguments:</h5>
Nate Begemand4d45c22007-11-17 03:58:34 +00003712<p>The '<tt>uitofp</tt>' instruction takes a value to cast, which must be a
3713scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3714to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3715type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3716floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003717
3718<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003719<p>The '<tt>uitofp</tt>' instruction interprets its operand as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003720integer quantity and converts it to the corresponding floating point value. If
Jeff Cohenbeccb742007-04-22 14:56:37 +00003721the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003722
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003723<h5>Example:</h5>
3724<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003725 %X = uitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003726 %Y = uitofp i8 -1 to double <i>; yields double:255.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003727</pre>
3728</div>
3729
3730<!-- _______________________________________________________________________ -->
3731<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003732 <a name="i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003733</div>
3734<div class="doc_text">
3735
3736<h5>Syntax:</h5>
3737<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003738 &lt;result&gt; = sitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003739</pre>
3740
3741<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003742<p>The '<tt>sitofp</tt>' instruction regards <tt>value</tt> as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003743integer and converts that value to the <tt>ty2</tt> type.</p>
3744
3745<h5>Arguments:</h5>
Nate Begemand4d45c22007-11-17 03:58:34 +00003746<p>The '<tt>sitofp</tt>' instruction takes a value to cast, which must be a
3747scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3748to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3749type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3750floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003751
3752<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003753<p>The '<tt>sitofp</tt>' instruction interprets its operand as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003754integer quantity and converts it to the corresponding floating point value. If
Jeff Cohenbeccb742007-04-22 14:56:37 +00003755the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003756
3757<h5>Example:</h5>
3758<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003759 %X = sitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003760 %Y = sitofp i8 -1 to double <i>; yields double:-1.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003761</pre>
3762</div>
3763
3764<!-- _______________________________________________________________________ -->
3765<div class="doc_subsubsection">
Reid Spencerb7344ff2006-11-11 21:00:47 +00003766 <a name="i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a>
3767</div>
3768<div class="doc_text">
3769
3770<h5>Syntax:</h5>
3771<pre>
3772 &lt;result&gt; = ptrtoint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3773</pre>
3774
3775<h5>Overview:</h5>
3776<p>The '<tt>ptrtoint</tt>' instruction converts the pointer <tt>value</tt> to
3777the integer type <tt>ty2</tt>.</p>
3778
3779<h5>Arguments:</h5>
3780<p>The '<tt>ptrtoint</tt>' instruction takes a <tt>value</tt> to cast, which
Duncan Sands16f122e2007-03-30 12:22:09 +00003781must be a <a href="#t_pointer">pointer</a> value, and a type to cast it to
Reid Spencerb7344ff2006-11-11 21:00:47 +00003782<tt>ty2</tt>, which must be an <a href="#t_integer">integer</a> type.
3783
3784<h5>Semantics:</h5>
3785<p>The '<tt>ptrtoint</tt>' instruction converts <tt>value</tt> to integer type
3786<tt>ty2</tt> by interpreting the pointer value as an integer and either
3787truncating or zero extending that value to the size of the integer type. If
3788<tt>value</tt> is smaller than <tt>ty2</tt> then a zero extension is done. If
3789<tt>value</tt> is larger than <tt>ty2</tt> then a truncation is done. If they
Jeff Cohen222a8a42007-04-29 01:07:00 +00003790are the same size, then nothing is done (<i>no-op cast</i>) other than a type
3791change.</p>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003792
3793<h5>Example:</h5>
3794<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003795 %X = ptrtoint i32* %X to i8 <i>; yields truncation on 32-bit architecture</i>
3796 %Y = ptrtoint i32* %x to i64 <i>; yields zero extension on 32-bit architecture</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003797</pre>
3798</div>
3799
3800<!-- _______________________________________________________________________ -->
3801<div class="doc_subsubsection">
3802 <a name="i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a>
3803</div>
3804<div class="doc_text">
3805
3806<h5>Syntax:</h5>
3807<pre>
3808 &lt;result&gt; = inttoptr &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3809</pre>
3810
3811<h5>Overview:</h5>
3812<p>The '<tt>inttoptr</tt>' instruction converts an integer <tt>value</tt> to
3813a pointer type, <tt>ty2</tt>.</p>
3814
3815<h5>Arguments:</h5>
Duncan Sands16f122e2007-03-30 12:22:09 +00003816<p>The '<tt>inttoptr</tt>' instruction takes an <a href="#t_integer">integer</a>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003817value to cast, and a type to cast it to, which must be a
Anton Korobeynikova0554d92007-01-12 19:20:47 +00003818<a href="#t_pointer">pointer</a> type.
Reid Spencerb7344ff2006-11-11 21:00:47 +00003819
3820<h5>Semantics:</h5>
3821<p>The '<tt>inttoptr</tt>' instruction converts <tt>value</tt> to type
3822<tt>ty2</tt> by applying either a zero extension or a truncation depending on
3823the size of the integer <tt>value</tt>. If <tt>value</tt> is larger than the
3824size of a pointer then a truncation is done. If <tt>value</tt> is smaller than
3825the size of a pointer then a zero extension is done. If they are the same size,
3826nothing is done (<i>no-op cast</i>).</p>
3827
3828<h5>Example:</h5>
3829<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003830 %X = inttoptr i32 255 to i32* <i>; yields zero extension on 64-bit architecture</i>
3831 %X = inttoptr i32 255 to i32* <i>; yields no-op on 32-bit architecture</i>
3832 %Y = inttoptr i64 0 to i32* <i>; yields truncation on 32-bit architecture</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003833</pre>
3834</div>
3835
3836<!-- _______________________________________________________________________ -->
3837<div class="doc_subsubsection">
Reid Spencer5b950642006-11-11 23:08:07 +00003838 <a name="i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003839</div>
3840<div class="doc_text">
3841
3842<h5>Syntax:</h5>
3843<pre>
Reid Spencer5b950642006-11-11 23:08:07 +00003844 &lt;result&gt; = bitcast &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003845</pre>
3846
3847<h5>Overview:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00003848
Reid Spencer5b950642006-11-11 23:08:07 +00003849<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003850<tt>ty2</tt> without changing any bits.</p>
3851
3852<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00003853
Reid Spencer5b950642006-11-11 23:08:07 +00003854<p>The '<tt>bitcast</tt>' instruction takes a value to cast, which must be
Dan Gohmanc05dca92008-09-08 16:45:59 +00003855a non-aggregate first class value, and a type to cast it to, which must also be
3856a non-aggregate <a href="#t_firstclass">first class</a> type. The bit sizes of
3857<tt>value</tt>
Reid Spencere3db84c2007-01-09 20:08:58 +00003858and the destination type, <tt>ty2</tt>, must be identical. If the source
Chris Lattnerb54c30f2008-05-20 20:48:21 +00003859type is a pointer, the destination type must also be a pointer. This
3860instruction supports bitwise conversion of vectors to integers and to vectors
3861of other types (as long as they have the same size).</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003862
3863<h5>Semantics:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003864<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencerb7344ff2006-11-11 21:00:47 +00003865<tt>ty2</tt>. It is always a <i>no-op cast</i> because no bits change with
3866this conversion. The conversion is done as if the <tt>value</tt> had been
3867stored to memory and read back as type <tt>ty2</tt>. Pointer types may only be
3868converted to other pointer types with this instruction. To convert pointers to
3869other types, use the <a href="#i_inttoptr">inttoptr</a> or
3870<a href="#i_ptrtoint">ptrtoint</a> instructions first.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003871
3872<h5>Example:</h5>
3873<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003874 %X = bitcast i8 255 to i8 <i>; yields i8 :-1</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003875 %Y = bitcast i32* %x to sint* <i>; yields sint*:%x</i>
3876 %Z = bitcast <2xint> %V to i64; <i>; yields i64: %V</i>
Chris Lattner70de6632001-07-09 00:26:23 +00003877</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003878</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003879
Reid Spencer97c5fa42006-11-08 01:18:52 +00003880<!-- ======================================================================= -->
3881<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
3882<div class="doc_text">
3883<p>The instructions in this category are the "miscellaneous"
3884instructions, which defy better classification.</p>
3885</div>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003886
3887<!-- _______________________________________________________________________ -->
3888<div class="doc_subsubsection"><a name="i_icmp">'<tt>icmp</tt>' Instruction</a>
3889</div>
3890<div class="doc_text">
3891<h5>Syntax:</h5>
Dan Gohmanc579d972008-09-09 01:02:47 +00003892<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>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003893</pre>
3894<h5>Overview:</h5>
Dan Gohmanc579d972008-09-09 01:02:47 +00003895<p>The '<tt>icmp</tt>' instruction returns a boolean value or
3896a vector of boolean values based on comparison
3897of its two integer, integer vector, or pointer operands.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003898<h5>Arguments:</h5>
3899<p>The '<tt>icmp</tt>' instruction takes three operands. The first operand is
Jeff Cohen222a8a42007-04-29 01:07:00 +00003900the condition code indicating the kind of comparison to perform. It is not
3901a value, just a keyword. The possible condition code are:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003902<ol>
3903 <li><tt>eq</tt>: equal</li>
3904 <li><tt>ne</tt>: not equal </li>
3905 <li><tt>ugt</tt>: unsigned greater than</li>
3906 <li><tt>uge</tt>: unsigned greater or equal</li>
3907 <li><tt>ult</tt>: unsigned less than</li>
3908 <li><tt>ule</tt>: unsigned less or equal</li>
3909 <li><tt>sgt</tt>: signed greater than</li>
3910 <li><tt>sge</tt>: signed greater or equal</li>
3911 <li><tt>slt</tt>: signed less than</li>
3912 <li><tt>sle</tt>: signed less or equal</li>
3913</ol>
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003914<p>The remaining two arguments must be <a href="#t_integer">integer</a> or
Dan Gohmanc579d972008-09-09 01:02:47 +00003915<a href="#t_pointer">pointer</a>
3916or integer <a href="#t_vector">vector</a> typed.
3917They must also be identical types.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003918<h5>Semantics:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00003919<p>The '<tt>icmp</tt>' compares <tt>op1</tt> and <tt>op2</tt> according to
Reid Spencerc828a0e2006-11-18 21:50:54 +00003920the condition code given as <tt>cond</tt>. The comparison performed always
Dan Gohmanc579d972008-09-09 01:02:47 +00003921yields either an <a href="#t_primitive"><tt>i1</tt></a> or vector of <tt>i1</tt> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003922<ol>
3923 <li><tt>eq</tt>: yields <tt>true</tt> if the operands are equal,
3924 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3925 </li>
3926 <li><tt>ne</tt>: yields <tt>true</tt> if the operands are unequal,
3927 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3928 <li><tt>ugt</tt>: interprets the operands as unsigned values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003929 <tt>true</tt> if <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003930 <li><tt>uge</tt>: interprets the operands as unsigned values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003931 <tt>true</tt> if <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003932 <li><tt>ult</tt>: interprets the operands as unsigned values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003933 <tt>true</tt> if <tt>op1</tt> is less than <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003934 <li><tt>ule</tt>: interprets the operands as unsigned values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003935 <tt>true</tt> if <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003936 <li><tt>sgt</tt>: interprets the operands as signed values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003937 <tt>true</tt> if <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003938 <li><tt>sge</tt>: interprets the operands as signed values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003939 <tt>true</tt> if <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003940 <li><tt>slt</tt>: interprets the operands as signed values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003941 <tt>true</tt> if <tt>op1</tt> is less than <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003942 <li><tt>sle</tt>: interprets the operands as signed values and yields
Gabor Greif0f75ad02008-08-07 21:46:00 +00003943 <tt>true</tt> if <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003944</ol>
3945<p>If the operands are <a href="#t_pointer">pointer</a> typed, the pointer
Jeff Cohen222a8a42007-04-29 01:07:00 +00003946values are compared as if they were integers.</p>
Dan Gohmanc579d972008-09-09 01:02:47 +00003947<p>If the operands are integer vectors, then they are compared
3948element by element. The result is an <tt>i1</tt> vector with
3949the same number of elements as the values being compared.
3950Otherwise, the result is an <tt>i1</tt>.
3951</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003952
3953<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003954<pre> &lt;result&gt; = icmp eq i32 4, 5 <i>; yields: result=false</i>
3955 &lt;result&gt; = icmp ne float* %X, %X <i>; yields: result=false</i>
3956 &lt;result&gt; = icmp ult i16 4, 5 <i>; yields: result=true</i>
3957 &lt;result&gt; = icmp sgt i16 4, 5 <i>; yields: result=false</i>
3958 &lt;result&gt; = icmp ule i16 -4, 5 <i>; yields: result=false</i>
3959 &lt;result&gt; = icmp sge i16 4, 5 <i>; yields: result=false</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003960</pre>
3961</div>
3962
3963<!-- _______________________________________________________________________ -->
3964<div class="doc_subsubsection"><a name="i_fcmp">'<tt>fcmp</tt>' Instruction</a>
3965</div>
3966<div class="doc_text">
3967<h5>Syntax:</h5>
Dan Gohmanc579d972008-09-09 01:02:47 +00003968<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>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003969</pre>
3970<h5>Overview:</h5>
Dan Gohmanc579d972008-09-09 01:02:47 +00003971<p>The '<tt>fcmp</tt>' instruction returns a boolean value
3972or vector of boolean values based on comparison
3973of its operands.
3974<p>
3975If the operands are floating point scalars, then the result
3976type is a boolean (<a href="#t_primitive"><tt>i1</tt></a>).
3977</p>
3978<p>If the operands are floating point vectors, then the result type
3979is a vector of boolean with the same number of elements as the
3980operands being compared.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003981<h5>Arguments:</h5>
3982<p>The '<tt>fcmp</tt>' instruction takes three operands. The first operand is
Jeff Cohen222a8a42007-04-29 01:07:00 +00003983the condition code indicating the kind of comparison to perform. It is not
3984a value, just a keyword. The possible condition code are:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003985<ol>
Reid Spencerf69acf32006-11-19 03:00:14 +00003986 <li><tt>false</tt>: no comparison, always returns false</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003987 <li><tt>oeq</tt>: ordered and equal</li>
3988 <li><tt>ogt</tt>: ordered and greater than </li>
3989 <li><tt>oge</tt>: ordered and greater than or equal</li>
3990 <li><tt>olt</tt>: ordered and less than </li>
3991 <li><tt>ole</tt>: ordered and less than or equal</li>
3992 <li><tt>one</tt>: ordered and not equal</li>
3993 <li><tt>ord</tt>: ordered (no nans)</li>
3994 <li><tt>ueq</tt>: unordered or equal</li>
3995 <li><tt>ugt</tt>: unordered or greater than </li>
3996 <li><tt>uge</tt>: unordered or greater than or equal</li>
3997 <li><tt>ult</tt>: unordered or less than </li>
3998 <li><tt>ule</tt>: unordered or less than or equal</li>
3999 <li><tt>une</tt>: unordered or not equal</li>
4000 <li><tt>uno</tt>: unordered (either nans)</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004001 <li><tt>true</tt>: no comparison, always returns true</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00004002</ol>
Jeff Cohen222a8a42007-04-29 01:07:00 +00004003<p><i>Ordered</i> means that neither operand is a QNAN while
Reid Spencer02e0d1d2006-12-06 07:08:07 +00004004<i>unordered</i> means that either operand may be a QNAN.</p>
Dan Gohmanc579d972008-09-09 01:02:47 +00004005<p>Each of <tt>val1</tt> and <tt>val2</tt> arguments must be
4006either a <a href="#t_floating">floating point</a> type
4007or a <a href="#t_vector">vector</a> of floating point type.
4008They must have identical types.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00004009<h5>Semantics:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00004010<p>The '<tt>fcmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Dan Gohmanc579d972008-09-09 01:02:47 +00004011according to the condition code given as <tt>cond</tt>.
4012If the operands are vectors, then the vectors are compared
4013element by element.
4014Each comparison performed
4015always yields an <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00004016<ol>
4017 <li><tt>false</tt>: always yields <tt>false</tt>, regardless of operands.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004018 <li><tt>oeq</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004019 <tt>op1</tt> is equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004020 <li><tt>ogt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004021 <tt>op1</tt> is greather than <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004022 <li><tt>oge</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004023 <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004024 <li><tt>olt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004025 <tt>op1</tt> is less than <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004026 <li><tt>ole</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004027 <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004028 <li><tt>one</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Gabor Greif0f75ad02008-08-07 21:46:00 +00004029 <tt>op1</tt> is not equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004030 <li><tt>ord</tt>: yields <tt>true</tt> if both operands are not a QNAN.</li>
4031 <li><tt>ueq</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004032 <tt>op1</tt> is equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004033 <li><tt>ugt</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004034 <tt>op1</tt> is greater than <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004035 <li><tt>uge</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004036 <tt>op1</tt> is greater than or equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004037 <li><tt>ult</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004038 <tt>op1</tt> is less than <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004039 <li><tt>ule</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004040 <tt>op1</tt> is less than or equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004041 <li><tt>une</tt>: yields <tt>true</tt> if either operand is a QNAN or
Gabor Greif0f75ad02008-08-07 21:46:00 +00004042 <tt>op1</tt> is not equal to <tt>op2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00004043 <li><tt>uno</tt>: yields <tt>true</tt> if either operand is a QNAN.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00004044 <li><tt>true</tt>: always yields <tt>true</tt>, regardless of operands.</li>
4045</ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +00004046
4047<h5>Example:</h5>
4048<pre> &lt;result&gt; = fcmp oeq float 4.0, 5.0 <i>; yields: result=false</i>
Dan Gohmanc579d972008-09-09 01:02:47 +00004049 &lt;result&gt; = fcmp one float 4.0, 5.0 <i>; yields: result=true</i>
4050 &lt;result&gt; = fcmp olt float 4.0, 5.0 <i>; yields: result=true</i>
4051 &lt;result&gt; = fcmp ueq double 1.0, 2.0 <i>; yields: result=false</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00004052</pre>
4053</div>
4054
Reid Spencer97c5fa42006-11-08 01:18:52 +00004055<!-- _______________________________________________________________________ -->
Nate Begemand2195702008-05-12 19:01:56 +00004056<div class="doc_subsubsection">
4057 <a name="i_vicmp">'<tt>vicmp</tt>' Instruction</a>
4058</div>
4059<div class="doc_text">
4060<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00004061<pre> &lt;result&gt; = vicmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt; <i>; yields {ty}:result</i>
Nate Begemand2195702008-05-12 19:01:56 +00004062</pre>
4063<h5>Overview:</h5>
4064<p>The '<tt>vicmp</tt>' instruction returns an integer vector value based on
4065element-wise comparison of its two integer vector operands.</p>
4066<h5>Arguments:</h5>
4067<p>The '<tt>vicmp</tt>' instruction takes three operands. The first operand is
4068the condition code indicating the kind of comparison to perform. It is not
4069a value, just a keyword. The possible condition code are:
4070<ol>
4071 <li><tt>eq</tt>: equal</li>
4072 <li><tt>ne</tt>: not equal </li>
4073 <li><tt>ugt</tt>: unsigned greater than</li>
4074 <li><tt>uge</tt>: unsigned greater or equal</li>
4075 <li><tt>ult</tt>: unsigned less than</li>
4076 <li><tt>ule</tt>: unsigned less or equal</li>
4077 <li><tt>sgt</tt>: signed greater than</li>
4078 <li><tt>sge</tt>: signed greater or equal</li>
4079 <li><tt>slt</tt>: signed less than</li>
4080 <li><tt>sle</tt>: signed less or equal</li>
4081</ol>
Dan Gohmanc579d972008-09-09 01:02:47 +00004082<p>The remaining two arguments must be <a href="#t_vector">vector</a> or
Nate Begemand2195702008-05-12 19:01:56 +00004083<a href="#t_integer">integer</a> typed. They must also be identical types.</p>
4084<h5>Semantics:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00004085<p>The '<tt>vicmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Nate Begemand2195702008-05-12 19:01:56 +00004086according to the condition code given as <tt>cond</tt>. The comparison yields a
4087<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, of
4088identical type as the values being compared. The most significant bit in each
4089element is 1 if the element-wise comparison evaluates to true, and is 0
4090otherwise. All other bits of the result are undefined. The condition codes
4091are evaluated identically to the <a href="#i_icmp">'<tt>icmp</tt>'
4092instruction</a>.
4093
4094<h5>Example:</h5>
4095<pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004096 &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>
4097 &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 Begemand2195702008-05-12 19:01:56 +00004098</pre>
4099</div>
4100
4101<!-- _______________________________________________________________________ -->
4102<div class="doc_subsubsection">
4103 <a name="i_vfcmp">'<tt>vfcmp</tt>' Instruction</a>
4104</div>
4105<div class="doc_text">
4106<h5>Syntax:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00004107<pre> &lt;result&gt; = vfcmp &lt;cond&gt; &lt;ty&gt; &lt;op1&gt;, &lt;op2&gt;</pre>
Nate Begemand2195702008-05-12 19:01:56 +00004108<h5>Overview:</h5>
4109<p>The '<tt>vfcmp</tt>' instruction returns an integer vector value based on
4110element-wise comparison of its two floating point vector operands. The output
4111elements have the same width as the input elements.</p>
4112<h5>Arguments:</h5>
4113<p>The '<tt>vfcmp</tt>' instruction takes three operands. The first operand is
4114the condition code indicating the kind of comparison to perform. It is not
4115a value, just a keyword. The possible condition code are:
4116<ol>
4117 <li><tt>false</tt>: no comparison, always returns false</li>
4118 <li><tt>oeq</tt>: ordered and equal</li>
4119 <li><tt>ogt</tt>: ordered and greater than </li>
4120 <li><tt>oge</tt>: ordered and greater than or equal</li>
4121 <li><tt>olt</tt>: ordered and less than </li>
4122 <li><tt>ole</tt>: ordered and less than or equal</li>
4123 <li><tt>one</tt>: ordered and not equal</li>
4124 <li><tt>ord</tt>: ordered (no nans)</li>
4125 <li><tt>ueq</tt>: unordered or equal</li>
4126 <li><tt>ugt</tt>: unordered or greater than </li>
4127 <li><tt>uge</tt>: unordered or greater than or equal</li>
4128 <li><tt>ult</tt>: unordered or less than </li>
4129 <li><tt>ule</tt>: unordered or less than or equal</li>
4130 <li><tt>une</tt>: unordered or not equal</li>
4131 <li><tt>uno</tt>: unordered (either nans)</li>
4132 <li><tt>true</tt>: no comparison, always returns true</li>
4133</ol>
4134<p>The remaining two arguments must be <a href="#t_vector">vector</a> of
4135<a href="#t_floating">floating point</a> typed. They must also be identical
4136types.</p>
4137<h5>Semantics:</h5>
Gabor Greif0f75ad02008-08-07 21:46:00 +00004138<p>The '<tt>vfcmp</tt>' instruction compares <tt>op1</tt> and <tt>op2</tt>
Nate Begemand2195702008-05-12 19:01:56 +00004139according to the condition code given as <tt>cond</tt>. The comparison yields a
4140<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, with
4141an identical number of elements as the values being compared, and each element
4142having identical with to the width of the floating point elements. The most
4143significant bit in each element is 1 if the element-wise comparison evaluates to
4144true, and is 0 otherwise. All other bits of the result are undefined. The
4145condition codes are evaluated identically to the
4146<a href="#i_fcmp">'<tt>fcmp</tt>' instruction</a>.
4147
4148<h5>Example:</h5>
4149<pre>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004150 &lt;result&gt; = vfcmp oeq &lt;2 x float&gt; &lt; float 4, float 0 &gt;, &lt; float 5, float 0 &gt; <i>; yields: result=&lt;2 x i32&gt; &lt; i32 0, i32 -1 &gt;</i>
4151 &lt;result&gt; = vfcmp ult &lt;2 x double&gt; &lt; double 1, double 2 &gt;, &lt; double 2, double 2&gt; <i>; yields: result=&lt;2 x i64&gt; &lt; i64 -1, i64 0 &gt;</i>
Nate Begemand2195702008-05-12 19:01:56 +00004152</pre>
4153</div>
4154
4155<!-- _______________________________________________________________________ -->
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004156<div class="doc_subsubsection">
4157 <a name="i_phi">'<tt>phi</tt>' Instruction</a>
4158</div>
4159
Reid Spencer97c5fa42006-11-08 01:18:52 +00004160<div class="doc_text">
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004161
Reid Spencer97c5fa42006-11-08 01:18:52 +00004162<h5>Syntax:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004163
Reid Spencer97c5fa42006-11-08 01:18:52 +00004164<pre> &lt;result&gt; = phi &lt;ty&gt; [ &lt;val0&gt;, &lt;label0&gt;], ...<br></pre>
4165<h5>Overview:</h5>
4166<p>The '<tt>phi</tt>' instruction is used to implement the &#966; node in
4167the SSA graph representing the function.</p>
4168<h5>Arguments:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004169
Jeff Cohen222a8a42007-04-29 01:07:00 +00004170<p>The type of the incoming values is specified with the first type
Reid Spencer97c5fa42006-11-08 01:18:52 +00004171field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
4172as arguments, with one pair for each predecessor basic block of the
4173current block. Only values of <a href="#t_firstclass">first class</a>
4174type may be used as the value arguments to the PHI node. Only labels
4175may be used as the label arguments.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004176
Reid Spencer97c5fa42006-11-08 01:18:52 +00004177<p>There must be no non-phi instructions between the start of a basic
4178block and the PHI instructions: i.e. PHI instructions must be first in
4179a basic block.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004180
Reid Spencer97c5fa42006-11-08 01:18:52 +00004181<h5>Semantics:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004182
Jeff Cohen222a8a42007-04-29 01:07:00 +00004183<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the value
4184specified by the pair corresponding to the predecessor basic block that executed
4185just prior to the current block.</p>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004186
Reid Spencer97c5fa42006-11-08 01:18:52 +00004187<h5>Example:</h5>
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004188<pre>
4189Loop: ; Infinite loop that counts from 0 on up...
4190 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
4191 %nextindvar = add i32 %indvar, 1
4192 br label %Loop
4193</pre>
Reid Spencer97c5fa42006-11-08 01:18:52 +00004194</div>
4195
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004196<!-- _______________________________________________________________________ -->
4197<div class="doc_subsubsection">
4198 <a name="i_select">'<tt>select</tt>' Instruction</a>
4199</div>
4200
4201<div class="doc_text">
4202
4203<h5>Syntax:</h5>
4204
4205<pre>
Dan Gohmanc579d972008-09-09 01:02:47 +00004206 &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>
4207
4208 <i>selty</i> is either i1 or {&lt;N x i1&gt}
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004209</pre>
4210
4211<h5>Overview:</h5>
4212
4213<p>
4214The '<tt>select</tt>' instruction is used to choose one value based on a
4215condition, without branching.
4216</p>
4217
4218
4219<h5>Arguments:</h5>
4220
4221<p>
Dan Gohmanc579d972008-09-09 01:02:47 +00004222The '<tt>select</tt>' instruction requires an 'i1' value or
4223a vector of 'i1' values indicating the
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004224condition, and two values of the same <a href="#t_firstclass">first class</a>
Dan Gohmanc579d972008-09-09 01:02:47 +00004225type. If the val1/val2 are vectors and
4226the condition is a scalar, then entire vectors are selected, not
Chris Lattnerb54c30f2008-05-20 20:48:21 +00004227individual elements.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004228</p>
4229
4230<h5>Semantics:</h5>
4231
4232<p>
Dan Gohmanc579d972008-09-09 01:02:47 +00004233If the condition is an i1 and it evaluates to 1, the instruction returns the first
John Criswell88190562005-05-16 16:17:45 +00004234value argument; otherwise, it returns the second value argument.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004235</p>
Dan Gohmanc579d972008-09-09 01:02:47 +00004236<p>
4237If the condition is a vector of i1, then the value arguments must
4238be vectors of the same size, and the selection is done element
4239by element.
4240</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004241
4242<h5>Example:</h5>
4243
4244<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00004245 %X = select i1 true, i8 17, i8 42 <i>; yields i8:17</i>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00004246</pre>
4247</div>
4248
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00004249
4250<!-- _______________________________________________________________________ -->
4251<div class="doc_subsubsection">
Chris Lattnere23c1392005-05-06 05:47:36 +00004252 <a name="i_call">'<tt>call</tt>' Instruction</a>
4253</div>
4254
Misha Brukman76307852003-11-08 01:05:38 +00004255<div class="doc_text">
Chris Lattnere23c1392005-05-06 05:47:36 +00004256
Chris Lattner2f7c9632001-06-06 20:29:01 +00004257<h5>Syntax:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00004258<pre>
Devang Patel02256232008-10-07 17:48:33 +00004259 &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>]
Chris Lattnere23c1392005-05-06 05:47:36 +00004260</pre>
4261
Chris Lattner2f7c9632001-06-06 20:29:01 +00004262<h5>Overview:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00004263
Misha Brukman76307852003-11-08 01:05:38 +00004264<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00004265
Chris Lattner2f7c9632001-06-06 20:29:01 +00004266<h5>Arguments:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00004267
Misha Brukman76307852003-11-08 01:05:38 +00004268<p>This instruction requires several arguments:</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00004269
Chris Lattnera8292f32002-05-06 22:08:29 +00004270<ol>
Chris Lattner48b383b02003-11-25 01:02:51 +00004271 <li>
Chris Lattner0132aff2005-05-06 22:57:40 +00004272 <p>The optional "tail" marker indicates whether the callee function accesses
4273 any allocas or varargs in the caller. If the "tail" marker is present, the
Chris Lattnere23c1392005-05-06 05:47:36 +00004274 function call is eligible for tail call optimization. Note that calls may
4275 be marked "tail" even if they do not occur before a <a
4276 href="#i_ret"><tt>ret</tt></a> instruction.
Chris Lattner48b383b02003-11-25 01:02:51 +00004277 </li>
4278 <li>
Duncan Sands16f122e2007-03-30 12:22:09 +00004279 <p>The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattner0132aff2005-05-06 22:57:40 +00004280 convention</a> the call should use. If none is specified, the call defaults
4281 to using C calling conventions.
4282 </li>
Devang Patel7e9b05e2008-10-06 18:50:38 +00004283
4284 <li>
4285 <p>The optional <a href="#paramattrs">Parameter Attributes</a> list for
4286 return values. Only '<tt>zeroext</tt>', '<tt>signext</tt>',
4287 and '<tt>inreg</tt>' attributes are valid here.</p>
4288 </li>
4289
Chris Lattner0132aff2005-05-06 22:57:40 +00004290 <li>
Nick Lewyckya9b13d52007-09-08 13:57:50 +00004291 <p>'<tt>ty</tt>': the type of the call instruction itself which is also
4292 the type of the return value. Functions that return no value are marked
4293 <tt><a href="#t_void">void</a></tt>.</p>
4294 </li>
4295 <li>
4296 <p>'<tt>fnty</tt>': shall be the signature of the pointer to function
4297 value being invoked. The argument types must match the types implied by
4298 this signature. This type can be omitted if the function is not varargs
4299 and if the function type does not return a pointer to a function.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00004300 </li>
4301 <li>
4302 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
4303 be invoked. In most cases, this is a direct function invocation, but
4304 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
John Criswell88190562005-05-16 16:17:45 +00004305 to function value.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00004306 </li>
4307 <li>
4308 <p>'<tt>function args</tt>': argument list whose types match the
Reid Spencerd845d162005-05-01 22:22:57 +00004309 function signature argument types. All arguments must be of
4310 <a href="#t_firstclass">first class</a> type. If the function signature
4311 indicates the function accepts a variable number of arguments, the extra
4312 arguments can be specified.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00004313 </li>
Devang Patel7e9b05e2008-10-06 18:50:38 +00004314 <li>
Devang Patel02256232008-10-07 17:48:33 +00004315 <p>The optional <a href="#fnattrs">function attributes</a> list. Only
Devang Patel7e9b05e2008-10-06 18:50:38 +00004316 '<tt>noreturn</tt>', '<tt>nounwind</tt>', '<tt>readonly</tt>' and
4317 '<tt>readnone</tt>' attributes are valid here.</p>
4318 </li>
Chris Lattnera8292f32002-05-06 22:08:29 +00004319</ol>
Chris Lattnere23c1392005-05-06 05:47:36 +00004320
Chris Lattner2f7c9632001-06-06 20:29:01 +00004321<h5>Semantics:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00004322
Chris Lattner48b383b02003-11-25 01:02:51 +00004323<p>The '<tt>call</tt>' instruction is used to cause control flow to
4324transfer to a specified function, with its incoming arguments bound to
4325the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
4326instruction in the called function, control flow continues with the
4327instruction after the function call, and the return value of the
Dan Gohmancc3132e2008-10-04 19:00:07 +00004328function is bound to the result argument.
Chris Lattnere23c1392005-05-06 05:47:36 +00004329
Chris Lattner2f7c9632001-06-06 20:29:01 +00004330<h5>Example:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00004331
4332<pre>
Nick Lewyckya9b13d52007-09-08 13:57:50 +00004333 %retval = call i32 @test(i32 %argc)
Chris Lattnerfb7c88d2008-03-21 17:24:17 +00004334 call i32 (i8 *, ...)* @printf(i8 * %msg, i32 12, i8 42) <i>; yields i32</i>
4335 %X = tail call i32 @foo() <i>; yields i32</i>
4336 %Y = tail call <a href="#callingconv">fastcc</a> i32 @foo() <i>; yields i32</i>
4337 call void %foo(i8 97 signext)
Devang Pateld6cff512008-03-10 20:49:15 +00004338
4339 %struct.A = type { i32, i8 }
Devang Patel7e9b05e2008-10-06 18:50:38 +00004340 %r = call %struct.A @foo() <i>; yields { 32, i8 }</i>
Dan Gohmancc3132e2008-10-04 19:00:07 +00004341 %gr = extractvalue %struct.A %r, 0 <i>; yields i32</i>
4342 %gr1 = extractvalue %struct.A %r, 1 <i>; yields i8</i>
Chris Lattner6cbe8e92008-10-08 06:26:11 +00004343 %Z = call void @foo() noreturn <i>; indicates that %foo never returns normally</i>
Matthijs Kooijmaneefa7df2008-10-07 10:03:45 +00004344 %ZZ = call zeroext i32 @bar() <i>; Return value is %zero extended</i>
Chris Lattnere23c1392005-05-06 05:47:36 +00004345</pre>
4346
Misha Brukman76307852003-11-08 01:05:38 +00004347</div>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004348
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004349<!-- _______________________________________________________________________ -->
Chris Lattner6a4a0492004-09-27 21:51:25 +00004350<div class="doc_subsubsection">
Chris Lattner33337472006-01-13 23:26:01 +00004351 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004352</div>
4353
Misha Brukman76307852003-11-08 01:05:38 +00004354<div class="doc_text">
Chris Lattner6a4a0492004-09-27 21:51:25 +00004355
Chris Lattner26ca62e2003-10-18 05:51:36 +00004356<h5>Syntax:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004357
4358<pre>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004359 &lt;resultval&gt; = va_arg &lt;va_list*&gt; &lt;arglist&gt;, &lt;argty&gt;
Chris Lattner6a4a0492004-09-27 21:51:25 +00004360</pre>
4361
Chris Lattner26ca62e2003-10-18 05:51:36 +00004362<h5>Overview:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004363
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004364<p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
Chris Lattner6a4a0492004-09-27 21:51:25 +00004365the "variable argument" area of a function call. It is used to implement the
4366<tt>va_arg</tt> macro in C.</p>
4367
Chris Lattner26ca62e2003-10-18 05:51:36 +00004368<h5>Arguments:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004369
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004370<p>This instruction takes a <tt>va_list*</tt> value and the type of
4371the argument. It returns a value of the specified argument type and
Jeff Cohen222a8a42007-04-29 01:07:00 +00004372increments the <tt>va_list</tt> to point to the next argument. The
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004373actual type of <tt>va_list</tt> is target specific.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004374
Chris Lattner26ca62e2003-10-18 05:51:36 +00004375<h5>Semantics:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004376
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004377<p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
4378type from the specified <tt>va_list</tt> and causes the
4379<tt>va_list</tt> to point to the next argument. For more information,
4380see the variable argument handling <a href="#int_varargs">Intrinsic
4381Functions</a>.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004382
4383<p>It is legal for this instruction to be called in a function which does not
4384take a variable number of arguments, for example, the <tt>vfprintf</tt>
Misha Brukman76307852003-11-08 01:05:38 +00004385function.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004386
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004387<p><tt>va_arg</tt> is an LLVM instruction instead of an <a
John Criswell88190562005-05-16 16:17:45 +00004388href="#intrinsics">intrinsic function</a> because it takes a type as an
Chris Lattner6a4a0492004-09-27 21:51:25 +00004389argument.</p>
4390
Chris Lattner26ca62e2003-10-18 05:51:36 +00004391<h5>Example:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00004392
4393<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
4394
Misha Brukman76307852003-11-08 01:05:38 +00004395</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004396
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004397<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00004398<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
4399<!-- *********************************************************************** -->
Chris Lattner941515c2004-01-06 05:31:32 +00004400
Misha Brukman76307852003-11-08 01:05:38 +00004401<div class="doc_text">
Chris Lattnerfee11462004-02-12 17:01:32 +00004402
4403<p>LLVM supports the notion of an "intrinsic function". These functions have
Reid Spencer4eefaab2007-04-01 08:04:23 +00004404well known names and semantics and are required to follow certain restrictions.
4405Overall, these intrinsics represent an extension mechanism for the LLVM
Jeff Cohen222a8a42007-04-29 01:07:00 +00004406language that does not require changing all of the transformations in LLVM when
Gabor Greifa54634a2007-07-06 22:07:22 +00004407adding to the language (or the bitcode reader/writer, the parser, etc...).</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00004408
John Criswell88190562005-05-16 16:17:45 +00004409<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
Jeff Cohen222a8a42007-04-29 01:07:00 +00004410prefix is reserved in LLVM for intrinsic names; thus, function names may not
4411begin with this prefix. Intrinsic functions must always be external functions:
4412you cannot define the body of intrinsic functions. Intrinsic functions may
4413only be used in call or invoke instructions: it is illegal to take the address
4414of an intrinsic function. Additionally, because intrinsic functions are part
4415of the LLVM language, it is required if any are added that they be documented
4416here.</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00004417
Chandler Carruth7132e002007-08-04 01:51:18 +00004418<p>Some intrinsic functions can be overloaded, i.e., the intrinsic represents
4419a family of functions that perform the same operation but on different data
4420types. Because LLVM can represent over 8 million different integer types,
4421overloading is used commonly to allow an intrinsic function to operate on any
4422integer type. One or more of the argument types or the result type can be
4423overloaded to accept any integer type. Argument types may also be defined as
4424exactly matching a previous argument's type or the result type. This allows an
4425intrinsic function which accepts multiple arguments, but needs all of them to
4426be of the same type, to only be overloaded with respect to a single argument or
4427the result.</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00004428
Chandler Carruth7132e002007-08-04 01:51:18 +00004429<p>Overloaded intrinsics will have the names of its overloaded argument types
4430encoded into its function name, each preceded by a period. Only those types
4431which are overloaded result in a name suffix. Arguments whose type is matched
4432against another type do not. For example, the <tt>llvm.ctpop</tt> function can
4433take an integer of any width and returns an integer of exactly the same integer
4434width. This leads to a family of functions such as
4435<tt>i8 @llvm.ctpop.i8(i8 %val)</tt> and <tt>i29 @llvm.ctpop.i29(i29 %val)</tt>.
4436Only one type, the return type, is overloaded, and only one type suffix is
4437required. Because the argument's type is matched against the return type, it
4438does not require its own name suffix.</p>
Reid Spencer4eefaab2007-04-01 08:04:23 +00004439
4440<p>To learn how to add an intrinsic function, please see the
4441<a href="ExtendingLLVM.html">Extending LLVM Guide</a>.
Chris Lattnerfee11462004-02-12 17:01:32 +00004442</p>
4443
Misha Brukman76307852003-11-08 01:05:38 +00004444</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004445
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004446<!-- ======================================================================= -->
Chris Lattner941515c2004-01-06 05:31:32 +00004447<div class="doc_subsection">
4448 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
4449</div>
4450
Misha Brukman76307852003-11-08 01:05:38 +00004451<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00004452
Misha Brukman76307852003-11-08 01:05:38 +00004453<p>Variable argument support is defined in LLVM with the <a
Chris Lattner33337472006-01-13 23:26:01 +00004454 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
Chris Lattner48b383b02003-11-25 01:02:51 +00004455intrinsic functions. These functions are related to the similarly
4456named macros defined in the <tt>&lt;stdarg.h&gt;</tt> header file.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004457
Chris Lattner48b383b02003-11-25 01:02:51 +00004458<p>All of these functions operate on arguments that use a
4459target-specific value type "<tt>va_list</tt>". The LLVM assembly
4460language reference manual does not define what this type is, so all
Jeff Cohen222a8a42007-04-29 01:07:00 +00004461transformations should be prepared to handle these functions regardless of
4462the type used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004463
Chris Lattner30b868d2006-05-15 17:26:46 +00004464<p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
Chris Lattner48b383b02003-11-25 01:02:51 +00004465instruction and the variable argument handling intrinsic functions are
4466used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004467
Bill Wendling3716c5d2007-05-29 09:04:49 +00004468<div class="doc_code">
Chris Lattnerfee11462004-02-12 17:01:32 +00004469<pre>
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00004470define i32 @test(i32 %X, ...) {
Chris Lattnerfee11462004-02-12 17:01:32 +00004471 ; Initialize variable argument processing
Jeff Cohen222a8a42007-04-29 01:07:00 +00004472 %ap = alloca i8*
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004473 %ap2 = bitcast i8** %ap to i8*
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00004474 call void @llvm.va_start(i8* %ap2)
Chris Lattnerfee11462004-02-12 17:01:32 +00004475
4476 ; Read a single integer argument
Jeff Cohen222a8a42007-04-29 01:07:00 +00004477 %tmp = va_arg i8** %ap, i32
Chris Lattnerfee11462004-02-12 17:01:32 +00004478
4479 ; Demonstrate usage of llvm.va_copy and llvm.va_end
Jeff Cohen222a8a42007-04-29 01:07:00 +00004480 %aq = alloca i8*
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004481 %aq2 = bitcast i8** %aq to i8*
Jeff Cohen222a8a42007-04-29 01:07:00 +00004482 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00004483 call void @llvm.va_end(i8* %aq2)
Chris Lattnerfee11462004-02-12 17:01:32 +00004484
4485 ; Stop processing of arguments.
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00004486 call void @llvm.va_end(i8* %ap2)
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004487 ret i32 %tmp
Chris Lattnerfee11462004-02-12 17:01:32 +00004488}
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00004489
4490declare void @llvm.va_start(i8*)
4491declare void @llvm.va_copy(i8*, i8*)
4492declare void @llvm.va_end(i8*)
Chris Lattnerfee11462004-02-12 17:01:32 +00004493</pre>
Misha Brukman76307852003-11-08 01:05:38 +00004494</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004495
Bill Wendling3716c5d2007-05-29 09:04:49 +00004496</div>
4497
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004498<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00004499<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004500 <a name="int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00004501</div>
4502
4503
Misha Brukman76307852003-11-08 01:05:38 +00004504<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004505<h5>Syntax:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004506<pre> declare void %llvm.va_start(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004507<h5>Overview:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004508<P>The '<tt>llvm.va_start</tt>' intrinsic initializes
4509<tt>*&lt;arglist&gt;</tt> for subsequent use by <tt><a
4510href="#i_va_arg">va_arg</a></tt>.</p>
4511
4512<h5>Arguments:</h5>
4513
4514<P>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
4515
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004516<h5>Semantics:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004517
4518<P>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
4519macro available in C. In a target-dependent way, it initializes the
Jeff Cohen222a8a42007-04-29 01:07:00 +00004520<tt>va_list</tt> element to which the argument points, so that the next call to
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004521<tt>va_arg</tt> will produce the first variable argument passed to the function.
4522Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
Jeff Cohen222a8a42007-04-29 01:07:00 +00004523last argument of the function as the compiler can figure that out.</p>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004524
Misha Brukman76307852003-11-08 01:05:38 +00004525</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004526
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004527<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00004528<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004529 <a name="int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00004530</div>
4531
Misha Brukman76307852003-11-08 01:05:38 +00004532<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004533<h5>Syntax:</h5>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004534<pre> declare void @llvm.va_end(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004535<h5>Overview:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004536
Jeff Cohen222a8a42007-04-29 01:07:00 +00004537<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt>*&lt;arglist&gt;</tt>,
Reid Spencer96a5f022007-04-04 02:42:35 +00004538which has been initialized previously with <tt><a href="#int_va_start">llvm.va_start</a></tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00004539or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004540
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004541<h5>Arguments:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004542
Jeff Cohen222a8a42007-04-29 01:07:00 +00004543<p>The argument is a pointer to a <tt>va_list</tt> to destroy.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004544
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004545<h5>Semantics:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004546
Misha Brukman76307852003-11-08 01:05:38 +00004547<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
Jeff Cohen222a8a42007-04-29 01:07:00 +00004548macro available in C. In a target-dependent way, it destroys the
4549<tt>va_list</tt> element to which the argument points. Calls to <a
4550href="#int_va_start"><tt>llvm.va_start</tt></a> and <a href="#int_va_copy">
4551<tt>llvm.va_copy</tt></a> must be matched exactly with calls to
4552<tt>llvm.va_end</tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00004553
Misha Brukman76307852003-11-08 01:05:38 +00004554</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004555
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004556<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00004557<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004558 <a name="int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00004559</div>
4560
Misha Brukman76307852003-11-08 01:05:38 +00004561<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00004562
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004563<h5>Syntax:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004564
4565<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004566 declare void @llvm.va_copy(i8* &lt;destarglist&gt;, i8* &lt;srcarglist&gt;)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004567</pre>
4568
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004569<h5>Overview:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004570
Jeff Cohen222a8a42007-04-29 01:07:00 +00004571<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position
4572from the source argument list to the destination argument list.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004573
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004574<h5>Arguments:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004575
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004576<p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
Andrew Lenharth5305ea52005-06-22 20:38:11 +00004577The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00004578
Chris Lattner757528b0b2004-05-23 21:06:01 +00004579
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00004580<h5>Semantics:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004581
Jeff Cohen222a8a42007-04-29 01:07:00 +00004582<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt>
4583macro available in C. In a target-dependent way, it copies the source
4584<tt>va_list</tt> element into the destination <tt>va_list</tt> element. This
4585intrinsic is necessary because the <tt><a href="#int_va_start">
4586llvm.va_start</a></tt> intrinsic may be arbitrarily complex and require, for
4587example, memory allocation.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004588
Misha Brukman76307852003-11-08 01:05:38 +00004589</div>
Chris Lattner941515c2004-01-06 05:31:32 +00004590
Chris Lattnerfee11462004-02-12 17:01:32 +00004591<!-- ======================================================================= -->
4592<div class="doc_subsection">
Chris Lattner757528b0b2004-05-23 21:06:01 +00004593 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
4594</div>
4595
4596<div class="doc_text">
4597
4598<p>
4599LLVM support for <a href="GarbageCollection.html">Accurate Garbage
Chris Lattner67c37d12008-08-05 18:29:16 +00004600Collection</a> (GC) requires the implementation and generation of these
4601intrinsics.
Reid Spencer96a5f022007-04-04 02:42:35 +00004602These intrinsics allow identification of <a href="#int_gcroot">GC roots on the
Chris Lattner757528b0b2004-05-23 21:06:01 +00004603stack</a>, as well as garbage collector implementations that require <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004604href="#int_gcread">read</a> and <a href="#int_gcwrite">write</a> barriers.
Chris Lattner757528b0b2004-05-23 21:06:01 +00004605Front-ends for type-safe garbage collected languages should generate these
4606intrinsics to make use of the LLVM garbage collectors. For more details, see <a
4607href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
4608</p>
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00004609
4610<p>The garbage collection intrinsics only operate on objects in the generic
4611 address space (address space zero).</p>
4612
Chris Lattner757528b0b2004-05-23 21:06:01 +00004613</div>
4614
4615<!-- _______________________________________________________________________ -->
4616<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004617 <a name="int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004618</div>
4619
4620<div class="doc_text">
4621
4622<h5>Syntax:</h5>
4623
4624<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004625 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004626</pre>
4627
4628<h5>Overview:</h5>
4629
John Criswelldfe6a862004-12-10 15:51:16 +00004630<p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
Chris Lattner757528b0b2004-05-23 21:06:01 +00004631the code generator, and allows some metadata to be associated with it.</p>
4632
4633<h5>Arguments:</h5>
4634
4635<p>The first argument specifies the address of a stack object that contains the
4636root pointer. The second pointer (which must be either a constant or a global
4637value address) contains the meta-data to be associated with the root.</p>
4638
4639<h5>Semantics:</h5>
4640
Chris Lattner851b7712008-04-24 05:59:56 +00004641<p>At runtime, a call to this intrinsic stores a null pointer into the "ptrloc"
Chris Lattner757528b0b2004-05-23 21:06:01 +00004642location. At compile-time, the code generator generates information to allow
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004643the runtime to find the pointer at GC safe points. The '<tt>llvm.gcroot</tt>'
4644intrinsic may only be used in a function which <a href="#gc">specifies a GC
4645algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004646
4647</div>
4648
4649
4650<!-- _______________________________________________________________________ -->
4651<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004652 <a name="int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004653</div>
4654
4655<div class="doc_text">
4656
4657<h5>Syntax:</h5>
4658
4659<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004660 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004661</pre>
4662
4663<h5>Overview:</h5>
4664
4665<p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
4666locations, allowing garbage collector implementations that require read
4667barriers.</p>
4668
4669<h5>Arguments:</h5>
4670
Chris Lattnerf9228072006-03-14 20:02:51 +00004671<p>The second argument is the address to read from, which should be an address
4672allocated from the garbage collector. The first object is a pointer to the
4673start of the referenced object, if needed by the language runtime (otherwise
4674null).</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004675
4676<h5>Semantics:</h5>
4677
4678<p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
4679instruction, but may be replaced with substantially more complex code by the
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004680garbage collector runtime, as needed. The '<tt>llvm.gcread</tt>' intrinsic
4681may only be used in a function which <a href="#gc">specifies a GC
4682algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004683
4684</div>
4685
4686
4687<!-- _______________________________________________________________________ -->
4688<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004689 <a name="int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004690</div>
4691
4692<div class="doc_text">
4693
4694<h5>Syntax:</h5>
4695
4696<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004697 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004698</pre>
4699
4700<h5>Overview:</h5>
4701
4702<p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
4703locations, allowing garbage collector implementations that require write
4704barriers (such as generational or reference counting collectors).</p>
4705
4706<h5>Arguments:</h5>
4707
Chris Lattnerf9228072006-03-14 20:02:51 +00004708<p>The first argument is the reference to store, the second is the start of the
4709object to store it to, and the third is the address of the field of Obj to
4710store to. If the runtime does not require a pointer to the object, Obj may be
4711null.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004712
4713<h5>Semantics:</h5>
4714
4715<p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
4716instruction, but may be replaced with substantially more complex code by the
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004717garbage collector runtime, as needed. The '<tt>llvm.gcwrite</tt>' intrinsic
4718may only be used in a function which <a href="#gc">specifies a GC
4719algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004720
4721</div>
4722
4723
4724
4725<!-- ======================================================================= -->
4726<div class="doc_subsection">
Chris Lattner3649c3a2004-02-14 04:08:35 +00004727 <a name="int_codegen">Code Generator Intrinsics</a>
4728</div>
4729
4730<div class="doc_text">
4731<p>
4732These intrinsics are provided by LLVM to expose special features that may only
4733be implemented with code generator support.
4734</p>
4735
4736</div>
4737
4738<!-- _______________________________________________________________________ -->
4739<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004740 <a name="int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004741</div>
4742
4743<div class="doc_text">
4744
4745<h5>Syntax:</h5>
4746<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004747 declare i8 *@llvm.returnaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004748</pre>
4749
4750<h5>Overview:</h5>
4751
4752<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00004753The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
4754target-specific value indicating the return address of the current function
4755or one of its callers.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004756</p>
4757
4758<h5>Arguments:</h5>
4759
4760<p>
4761The argument to this intrinsic indicates which function to return the address
4762for. Zero indicates the calling function, one indicates its caller, etc. The
4763argument is <b>required</b> to be a constant integer value.
4764</p>
4765
4766<h5>Semantics:</h5>
4767
4768<p>
4769The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
4770the return address of the specified call frame, or zero if it cannot be
4771identified. The value returned by this intrinsic is likely to be incorrect or 0
4772for arguments other than zero, so it should only be used for debugging purposes.
4773</p>
4774
4775<p>
4776Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00004777aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00004778source-language caller.
4779</p>
4780</div>
4781
4782
4783<!-- _______________________________________________________________________ -->
4784<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004785 <a name="int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004786</div>
4787
4788<div class="doc_text">
4789
4790<h5>Syntax:</h5>
4791<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004792 declare i8 *@llvm.frameaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004793</pre>
4794
4795<h5>Overview:</h5>
4796
4797<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00004798The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
4799target-specific frame pointer value for the specified stack frame.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004800</p>
4801
4802<h5>Arguments:</h5>
4803
4804<p>
4805The argument to this intrinsic indicates which function to return the frame
4806pointer for. Zero indicates the calling function, one indicates its caller,
4807etc. The argument is <b>required</b> to be a constant integer value.
4808</p>
4809
4810<h5>Semantics:</h5>
4811
4812<p>
4813The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
4814the frame address of the specified call frame, or zero if it cannot be
4815identified. The value returned by this intrinsic is likely to be incorrect or 0
4816for arguments other than zero, so it should only be used for debugging purposes.
4817</p>
4818
4819<p>
4820Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00004821aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00004822source-language caller.
4823</p>
4824</div>
4825
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004826<!-- _______________________________________________________________________ -->
4827<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004828 <a name="int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
Chris Lattner2f0f0012006-01-13 02:03:13 +00004829</div>
4830
4831<div class="doc_text">
4832
4833<h5>Syntax:</h5>
4834<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004835 declare i8 *@llvm.stacksave()
Chris Lattner2f0f0012006-01-13 02:03:13 +00004836</pre>
4837
4838<h5>Overview:</h5>
4839
4840<p>
4841The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
Reid Spencer96a5f022007-04-04 02:42:35 +00004842the function stack, for use with <a href="#int_stackrestore">
Chris Lattner2f0f0012006-01-13 02:03:13 +00004843<tt>llvm.stackrestore</tt></a>. This is useful for implementing language
4844features like scoped automatic variable sized arrays in C99.
4845</p>
4846
4847<h5>Semantics:</h5>
4848
4849<p>
4850This intrinsic returns a opaque pointer value that can be passed to <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004851href="#int_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
Chris Lattner2f0f0012006-01-13 02:03:13 +00004852<tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
4853<tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
4854state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
4855practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
4856that were allocated after the <tt>llvm.stacksave</tt> was executed.
4857</p>
4858
4859</div>
4860
4861<!-- _______________________________________________________________________ -->
4862<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004863 <a name="int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
Chris Lattner2f0f0012006-01-13 02:03:13 +00004864</div>
4865
4866<div class="doc_text">
4867
4868<h5>Syntax:</h5>
4869<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004870 declare void @llvm.stackrestore(i8 * %ptr)
Chris Lattner2f0f0012006-01-13 02:03:13 +00004871</pre>
4872
4873<h5>Overview:</h5>
4874
4875<p>
4876The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
4877the function stack to the state it was in when the corresponding <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004878href="#int_stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
Chris Lattner2f0f0012006-01-13 02:03:13 +00004879useful for implementing language features like scoped automatic variable sized
4880arrays in C99.
4881</p>
4882
4883<h5>Semantics:</h5>
4884
4885<p>
Reid Spencer96a5f022007-04-04 02:42:35 +00004886See the description for <a href="#int_stacksave"><tt>llvm.stacksave</tt></a>.
Chris Lattner2f0f0012006-01-13 02:03:13 +00004887</p>
4888
4889</div>
4890
4891
4892<!-- _______________________________________________________________________ -->
4893<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004894 <a name="int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004895</div>
4896
4897<div class="doc_text">
4898
4899<h5>Syntax:</h5>
4900<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004901 declare void @llvm.prefetch(i8* &lt;address&gt;, i32 &lt;rw&gt;, i32 &lt;locality&gt;)
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004902</pre>
4903
4904<h5>Overview:</h5>
4905
4906
4907<p>
4908The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
John Criswell88190562005-05-16 16:17:45 +00004909a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
4910no
4911effect on the behavior of the program but can change its performance
Chris Lattnerff851072005-02-28 19:47:14 +00004912characteristics.
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004913</p>
4914
4915<h5>Arguments:</h5>
4916
4917<p>
4918<tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
4919determining if the fetch should be for a read (0) or write (1), and
4920<tt>locality</tt> is a temporal locality specifier ranging from (0) - no
Chris Lattnerd3e641c2005-03-07 20:31:38 +00004921locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004922<tt>locality</tt> arguments must be constant integers.
4923</p>
4924
4925<h5>Semantics:</h5>
4926
4927<p>
4928This intrinsic does not modify the behavior of the program. In particular,
4929prefetches cannot trap and do not produce a value. On targets that support this
4930intrinsic, the prefetch can provide hints to the processor cache for better
4931performance.
4932</p>
4933
4934</div>
4935
Andrew Lenharthb4427912005-03-28 20:05:49 +00004936<!-- _______________________________________________________________________ -->
4937<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004938 <a name="int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
Andrew Lenharthb4427912005-03-28 20:05:49 +00004939</div>
4940
4941<div class="doc_text">
4942
4943<h5>Syntax:</h5>
4944<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004945 declare void @llvm.pcmarker(i32 &lt;id&gt;)
Andrew Lenharthb4427912005-03-28 20:05:49 +00004946</pre>
4947
4948<h5>Overview:</h5>
4949
4950
4951<p>
John Criswell88190562005-05-16 16:17:45 +00004952The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
Chris Lattner67c37d12008-08-05 18:29:16 +00004953(PC) in a region of
4954code to simulators and other tools. The method is target specific, but it is
4955expected that the marker will use exported symbols to transmit the PC of the
4956marker.
4957The marker makes no guarantees that it will remain with any specific instruction
4958after optimizations. It is possible that the presence of a marker will inhibit
Chris Lattnerb40261e2006-03-24 07:16:10 +00004959optimizations. The intended use is to be inserted after optimizations to allow
John Criswell88190562005-05-16 16:17:45 +00004960correlations of simulation runs.
Andrew Lenharthb4427912005-03-28 20:05:49 +00004961</p>
4962
4963<h5>Arguments:</h5>
4964
4965<p>
4966<tt>id</tt> is a numerical id identifying the marker.
4967</p>
4968
4969<h5>Semantics:</h5>
4970
4971<p>
4972This intrinsic does not modify the behavior of the program. Backends that do not
4973support this intrinisic may ignore it.
4974</p>
4975
4976</div>
4977
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004978<!-- _______________________________________________________________________ -->
4979<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004980 <a name="int_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004981</div>
4982
4983<div class="doc_text">
4984
4985<h5>Syntax:</h5>
4986<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004987 declare i64 @llvm.readcyclecounter( )
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004988</pre>
4989
4990<h5>Overview:</h5>
4991
4992
4993<p>
4994The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
4995counter register (or similar low latency, high accuracy clocks) on those targets
4996that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
4997As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
4998should only be used for small timings.
4999</p>
5000
5001<h5>Semantics:</h5>
5002
5003<p>
5004When directly supported, reading the cycle counter should not modify any memory.
5005Implementations are allowed to either return a application specific value or a
5006system wide value. On backends without support, this is lowered to a constant 0.
5007</p>
5008
5009</div>
5010
Chris Lattner3649c3a2004-02-14 04:08:35 +00005011<!-- ======================================================================= -->
5012<div class="doc_subsection">
Chris Lattnerfee11462004-02-12 17:01:32 +00005013 <a name="int_libc">Standard C Library Intrinsics</a>
5014</div>
5015
5016<div class="doc_text">
5017<p>
Chris Lattner3649c3a2004-02-14 04:08:35 +00005018LLVM provides intrinsics for a few important standard C library functions.
5019These intrinsics allow source-language front-ends to pass information about the
5020alignment of the pointer arguments to the code generator, providing opportunity
5021for more efficient code generation.
Chris Lattnerfee11462004-02-12 17:01:32 +00005022</p>
5023
5024</div>
5025
5026<!-- _______________________________________________________________________ -->
5027<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005028 <a name="int_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
Chris Lattnerfee11462004-02-12 17:01:32 +00005029</div>
5030
5031<div class="doc_text">
5032
5033<h5>Syntax:</h5>
5034<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005035 declare void @llvm.memcpy.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005036 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005037 declare void @llvm.memcpy.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005038 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerfee11462004-02-12 17:01:32 +00005039</pre>
5040
5041<h5>Overview:</h5>
5042
5043<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005044The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00005045location to the destination location.
5046</p>
5047
5048<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005049Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
5050intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerfee11462004-02-12 17:01:32 +00005051</p>
5052
5053<h5>Arguments:</h5>
5054
5055<p>
5056The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00005057the source. The third argument is an integer argument
Chris Lattnerfee11462004-02-12 17:01:32 +00005058specifying the number of bytes to copy, and the fourth argument is the alignment
5059of the source and destination locations.
5060</p>
5061
Chris Lattner4c67c482004-02-12 21:18:15 +00005062<p>
5063If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00005064the caller guarantees that both the source and destination pointers are aligned
5065to that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00005066</p>
5067
Chris Lattnerfee11462004-02-12 17:01:32 +00005068<h5>Semantics:</h5>
5069
5070<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005071The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00005072location to the destination location, which are not allowed to overlap. It
5073copies "len" bytes of memory over. If the argument is known to be aligned to
5074some boundary, this can be specified as the fourth argument, otherwise it should
5075be set to 0 or 1.
5076</p>
5077</div>
5078
5079
Chris Lattnerf30152e2004-02-12 18:10:10 +00005080<!-- _______________________________________________________________________ -->
5081<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005082 <a name="int_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
Chris Lattnerf30152e2004-02-12 18:10:10 +00005083</div>
5084
5085<div class="doc_text">
5086
5087<h5>Syntax:</h5>
5088<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005089 declare void @llvm.memmove.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005090 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005091 declare void @llvm.memmove.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005092 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerf30152e2004-02-12 18:10:10 +00005093</pre>
5094
5095<h5>Overview:</h5>
5096
5097<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005098The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
5099location to the destination location. It is similar to the
Chris Lattnerec564022008-01-06 19:51:52 +00005100'<tt>llvm.memcpy</tt>' intrinsic but allows the two memory locations to overlap.
Chris Lattnerf30152e2004-02-12 18:10:10 +00005101</p>
5102
5103<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005104Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
5105intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerf30152e2004-02-12 18:10:10 +00005106</p>
5107
5108<h5>Arguments:</h5>
5109
5110<p>
5111The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00005112the source. The third argument is an integer argument
Chris Lattnerf30152e2004-02-12 18:10:10 +00005113specifying the number of bytes to copy, and the fourth argument is the alignment
5114of the source and destination locations.
5115</p>
5116
Chris Lattner4c67c482004-02-12 21:18:15 +00005117<p>
5118If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00005119the caller guarantees that the source and destination pointers are aligned to
5120that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00005121</p>
5122
Chris Lattnerf30152e2004-02-12 18:10:10 +00005123<h5>Semantics:</h5>
5124
5125<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005126The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerf30152e2004-02-12 18:10:10 +00005127location to the destination location, which may overlap. It
5128copies "len" bytes of memory over. If the argument is known to be aligned to
5129some boundary, this can be specified as the fourth argument, otherwise it should
5130be set to 0 or 1.
5131</p>
5132</div>
5133
Chris Lattner941515c2004-01-06 05:31:32 +00005134
Chris Lattner3649c3a2004-02-14 04:08:35 +00005135<!-- _______________________________________________________________________ -->
5136<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005137 <a name="int_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00005138</div>
5139
5140<div class="doc_text">
5141
5142<h5>Syntax:</h5>
5143<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005144 declare void @llvm.memset.i32(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005145 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005146 declare void @llvm.memset.i64(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005147 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00005148</pre>
5149
5150<h5>Overview:</h5>
5151
5152<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005153The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
Chris Lattner3649c3a2004-02-14 04:08:35 +00005154byte value.
5155</p>
5156
5157<p>
5158Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
5159does not return a value, and takes an extra alignment argument.
5160</p>
5161
5162<h5>Arguments:</h5>
5163
5164<p>
5165The first argument is a pointer to the destination to fill, the second is the
Chris Lattner0c8b2592006-03-03 00:07:20 +00005166byte value to fill it with, the third argument is an integer
Chris Lattner3649c3a2004-02-14 04:08:35 +00005167argument specifying the number of bytes to fill, and the fourth argument is the
5168known alignment of destination location.
5169</p>
5170
5171<p>
5172If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00005173the caller guarantees that the destination pointer is aligned to that boundary.
Chris Lattner3649c3a2004-02-14 04:08:35 +00005174</p>
5175
5176<h5>Semantics:</h5>
5177
5178<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00005179The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
5180the
Chris Lattner3649c3a2004-02-14 04:08:35 +00005181destination location. If the argument is known to be aligned to some boundary,
5182this can be specified as the fourth argument, otherwise it should be set to 0 or
51831.
5184</p>
5185</div>
5186
5187
Chris Lattner3b4f4372004-06-11 02:28:03 +00005188<!-- _______________________________________________________________________ -->
5189<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005190 <a name="int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005191</div>
5192
5193<div class="doc_text">
5194
5195<h5>Syntax:</h5>
Dale Johannesendd89d272007-10-02 17:47:38 +00005196<p>This is an overloaded intrinsic. You can use <tt>llvm.sqrt</tt> on any
Dan Gohmanb6324c12007-10-15 20:30:11 +00005197floating point or vector of floating point type. Not all targets support all
5198types however.
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005199<pre>
Dale Johannesendd89d272007-10-02 17:47:38 +00005200 declare float @llvm.sqrt.f32(float %Val)
5201 declare double @llvm.sqrt.f64(double %Val)
5202 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
5203 declare fp128 @llvm.sqrt.f128(fp128 %Val)
5204 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005205</pre>
5206
5207<h5>Overview:</h5>
5208
5209<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00005210The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
Dan Gohmanb6324c12007-10-15 20:30:11 +00005211returning the same value as the libm '<tt>sqrt</tt>' functions would. Unlike
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005212<tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
Chris Lattner00d7cb92008-01-29 07:00:44 +00005213negative numbers other than -0.0 (which allows for better optimization, because
5214there is no need to worry about errno being set). <tt>llvm.sqrt(-0.0)</tt> is
5215defined to return -0.0 like IEEE sqrt.
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005216</p>
5217
5218<h5>Arguments:</h5>
5219
5220<p>
5221The argument and return value are floating point numbers of the same type.
5222</p>
5223
5224<h5>Semantics:</h5>
5225
5226<p>
Dan Gohman33988db2007-07-16 14:37:41 +00005227This function returns the sqrt of the specified operand if it is a nonnegative
Chris Lattner8a8f2e52005-07-21 01:29:16 +00005228floating point number.
5229</p>
5230</div>
5231
Chris Lattner33b73f92006-09-08 06:34:02 +00005232<!-- _______________________________________________________________________ -->
5233<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005234 <a name="int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
Chris Lattner33b73f92006-09-08 06:34:02 +00005235</div>
5236
5237<div class="doc_text">
5238
5239<h5>Syntax:</h5>
Dale Johannesendd89d272007-10-02 17:47:38 +00005240<p>This is an overloaded intrinsic. You can use <tt>llvm.powi</tt> on any
Dan Gohmanb6324c12007-10-15 20:30:11 +00005241floating point or vector of floating point type. Not all targets support all
5242types however.
Chris Lattner33b73f92006-09-08 06:34:02 +00005243<pre>
Dale Johannesendd89d272007-10-02 17:47:38 +00005244 declare float @llvm.powi.f32(float %Val, i32 %power)
5245 declare double @llvm.powi.f64(double %Val, i32 %power)
5246 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
5247 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
5248 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
Chris Lattner33b73f92006-09-08 06:34:02 +00005249</pre>
5250
5251<h5>Overview:</h5>
5252
5253<p>
5254The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
5255specified (positive or negative) power. The order of evaluation of
Dan Gohmanb6324c12007-10-15 20:30:11 +00005256multiplications is not defined. When a vector of floating point type is
5257used, the second argument remains a scalar integer value.
Chris Lattner33b73f92006-09-08 06:34:02 +00005258</p>
5259
5260<h5>Arguments:</h5>
5261
5262<p>
5263The second argument is an integer power, and the first is a value to raise to
5264that power.
5265</p>
5266
5267<h5>Semantics:</h5>
5268
5269<p>
5270This function returns the first value raised to the second power with an
5271unspecified sequence of rounding operations.</p>
5272</div>
5273
Dan Gohmanb6324c12007-10-15 20:30:11 +00005274<!-- _______________________________________________________________________ -->
5275<div class="doc_subsubsection">
5276 <a name="int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a>
5277</div>
5278
5279<div class="doc_text">
5280
5281<h5>Syntax:</h5>
5282<p>This is an overloaded intrinsic. You can use <tt>llvm.sin</tt> on any
5283floating point or vector of floating point type. Not all targets support all
5284types however.
5285<pre>
5286 declare float @llvm.sin.f32(float %Val)
5287 declare double @llvm.sin.f64(double %Val)
5288 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
5289 declare fp128 @llvm.sin.f128(fp128 %Val)
5290 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
5291</pre>
5292
5293<h5>Overview:</h5>
5294
5295<p>
5296The '<tt>llvm.sin.*</tt>' intrinsics return the sine of the operand.
5297</p>
5298
5299<h5>Arguments:</h5>
5300
5301<p>
5302The argument and return value are floating point numbers of the same type.
5303</p>
5304
5305<h5>Semantics:</h5>
5306
5307<p>
5308This function returns the sine of the specified operand, returning the
5309same values as the libm <tt>sin</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00005310conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00005311</div>
5312
5313<!-- _______________________________________________________________________ -->
5314<div class="doc_subsubsection">
5315 <a name="int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a>
5316</div>
5317
5318<div class="doc_text">
5319
5320<h5>Syntax:</h5>
5321<p>This is an overloaded intrinsic. You can use <tt>llvm.cos</tt> on any
5322floating point or vector of floating point type. Not all targets support all
5323types however.
5324<pre>
5325 declare float @llvm.cos.f32(float %Val)
5326 declare double @llvm.cos.f64(double %Val)
5327 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
5328 declare fp128 @llvm.cos.f128(fp128 %Val)
5329 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
5330</pre>
5331
5332<h5>Overview:</h5>
5333
5334<p>
5335The '<tt>llvm.cos.*</tt>' intrinsics return the cosine of the operand.
5336</p>
5337
5338<h5>Arguments:</h5>
5339
5340<p>
5341The argument and return value are floating point numbers of the same type.
5342</p>
5343
5344<h5>Semantics:</h5>
5345
5346<p>
5347This function returns the cosine of the specified operand, returning the
5348same values as the libm <tt>cos</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00005349conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00005350</div>
5351
5352<!-- _______________________________________________________________________ -->
5353<div class="doc_subsubsection">
5354 <a name="int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a>
5355</div>
5356
5357<div class="doc_text">
5358
5359<h5>Syntax:</h5>
5360<p>This is an overloaded intrinsic. You can use <tt>llvm.pow</tt> on any
5361floating point or vector of floating point type. Not all targets support all
5362types however.
5363<pre>
5364 declare float @llvm.pow.f32(float %Val, float %Power)
5365 declare double @llvm.pow.f64(double %Val, double %Power)
5366 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
5367 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
5368 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
5369</pre>
5370
5371<h5>Overview:</h5>
5372
5373<p>
5374The '<tt>llvm.pow.*</tt>' intrinsics return the first operand raised to the
5375specified (positive or negative) power.
5376</p>
5377
5378<h5>Arguments:</h5>
5379
5380<p>
5381The second argument is a floating point power, and the first is a value to
5382raise to that power.
5383</p>
5384
5385<h5>Semantics:</h5>
5386
5387<p>
5388This function returns the first value raised to the second power,
5389returning the
5390same values as the libm <tt>pow</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00005391conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00005392</div>
5393
Chris Lattner33b73f92006-09-08 06:34:02 +00005394
Andrew Lenharth1d463522005-05-03 18:01:48 +00005395<!-- ======================================================================= -->
5396<div class="doc_subsection">
Nate Begeman0f223bb2006-01-13 23:26:38 +00005397 <a name="int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00005398</div>
5399
5400<div class="doc_text">
5401<p>
Nate Begeman0f223bb2006-01-13 23:26:38 +00005402LLVM provides intrinsics for a few important bit manipulation operations.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005403These allow efficient code generation for some algorithms.
5404</p>
5405
5406</div>
5407
5408<!-- _______________________________________________________________________ -->
5409<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00005410 <a name="int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
Nate Begeman0f223bb2006-01-13 23:26:38 +00005411</div>
5412
5413<div class="doc_text">
5414
5415<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00005416<p>This is an overloaded intrinsic function. You can use bswap on any integer
Chandler Carruth7132e002007-08-04 01:51:18 +00005417type that is an even number of bytes (i.e. BitWidth % 16 == 0).
Nate Begeman0f223bb2006-01-13 23:26:38 +00005418<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005419 declare i16 @llvm.bswap.i16(i16 &lt;id&gt;)
5420 declare i32 @llvm.bswap.i32(i32 &lt;id&gt;)
5421 declare i64 @llvm.bswap.i64(i64 &lt;id&gt;)
Nate Begeman0f223bb2006-01-13 23:26:38 +00005422</pre>
5423
5424<h5>Overview:</h5>
5425
5426<p>
Reid Spencerf361c4f2007-04-02 02:25:19 +00005427The '<tt>llvm.bswap</tt>' family of intrinsics is used to byte swap integer
Reid Spencer4eefaab2007-04-01 08:04:23 +00005428values with an even number of bytes (positive multiple of 16 bits). These are
5429useful for performing operations on data that is not in the target's native
5430byte order.
Nate Begeman0f223bb2006-01-13 23:26:38 +00005431</p>
5432
5433<h5>Semantics:</h5>
5434
5435<p>
Chandler Carruth7132e002007-08-04 01:51:18 +00005436The <tt>llvm.bswap.i16</tt> intrinsic returns an i16 value that has the high
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005437and low byte of the input i16 swapped. Similarly, the <tt>llvm.bswap.i32</tt>
5438intrinsic returns an i32 value that has the four bytes of the input i32
5439swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the returned
Chandler Carruth7132e002007-08-04 01:51:18 +00005440i32 will have its bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i48</tt>,
5441<tt>llvm.bswap.i64</tt> and other intrinsics extend this concept to
Reid Spencer4eefaab2007-04-01 08:04:23 +00005442additional even-byte lengths (6 bytes, 8 bytes and more, respectively).
Nate Begeman0f223bb2006-01-13 23:26:38 +00005443</p>
5444
5445</div>
5446
5447<!-- _______________________________________________________________________ -->
5448<div class="doc_subsubsection">
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00005449 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00005450</div>
5451
5452<div class="doc_text">
5453
5454<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00005455<p>This is an overloaded intrinsic. You can use llvm.ctpop on any integer bit
5456width. Not all targets support all bit widths however.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005457<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005458 declare i8 @llvm.ctpop.i8 (i8 &lt;src&gt;)
5459 declare i16 @llvm.ctpop.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005460 declare i32 @llvm.ctpop.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00005461 declare i64 @llvm.ctpop.i64(i64 &lt;src&gt;)
5462 declare i256 @llvm.ctpop.i256(i256 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00005463</pre>
5464
5465<h5>Overview:</h5>
5466
5467<p>
Chris Lattner069b5bd2006-01-16 22:38:59 +00005468The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
5469value.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005470</p>
5471
5472<h5>Arguments:</h5>
5473
5474<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00005475The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00005476integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005477</p>
5478
5479<h5>Semantics:</h5>
5480
5481<p>
5482The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
5483</p>
5484</div>
5485
5486<!-- _______________________________________________________________________ -->
5487<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00005488 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00005489</div>
5490
5491<div class="doc_text">
5492
5493<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00005494<p>This is an overloaded intrinsic. You can use <tt>llvm.ctlz</tt> on any
5495integer bit width. Not all targets support all bit widths however.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005496<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005497 declare i8 @llvm.ctlz.i8 (i8 &lt;src&gt;)
5498 declare i16 @llvm.ctlz.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005499 declare i32 @llvm.ctlz.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00005500 declare i64 @llvm.ctlz.i64(i64 &lt;src&gt;)
5501 declare i256 @llvm.ctlz.i256(i256 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00005502</pre>
5503
5504<h5>Overview:</h5>
5505
5506<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00005507The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
5508leading zeros in a variable.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005509</p>
5510
5511<h5>Arguments:</h5>
5512
5513<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00005514The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00005515integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005516</p>
5517
5518<h5>Semantics:</h5>
5519
5520<p>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005521The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
5522in a variable. If the src == 0 then the result is the size in bits of the type
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00005523of src. For example, <tt>llvm.ctlz(i32 2) = 30</tt>.
Andrew Lenharth1d463522005-05-03 18:01:48 +00005524</p>
5525</div>
Chris Lattner3b4f4372004-06-11 02:28:03 +00005526
5527
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005528
5529<!-- _______________________________________________________________________ -->
5530<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00005531 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005532</div>
5533
5534<div class="doc_text">
5535
5536<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00005537<p>This is an overloaded intrinsic. You can use <tt>llvm.cttz</tt> on any
5538integer bit width. Not all targets support all bit widths however.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005539<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005540 declare i8 @llvm.cttz.i8 (i8 &lt;src&gt;)
5541 declare i16 @llvm.cttz.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00005542 declare i32 @llvm.cttz.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00005543 declare i64 @llvm.cttz.i64(i64 &lt;src&gt;)
5544 declare i256 @llvm.cttz.i256(i256 &lt;src&gt;)
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005545</pre>
5546
5547<h5>Overview:</h5>
5548
5549<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00005550The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
5551trailing zeros.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005552</p>
5553
5554<h5>Arguments:</h5>
5555
5556<p>
5557The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00005558integer type. The return type must match the argument type.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00005559</p>
5560
5561<h5>Semantics:</h5>
5562
5563<p>
5564The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
5565in a variable. If the src == 0 then the result is the size in bits of the type
5566of src. For example, <tt>llvm.cttz(2) = 1</tt>.
5567</p>
5568</div>
5569
Reid Spencer8a5799f2007-04-01 08:27:01 +00005570<!-- _______________________________________________________________________ -->
5571<div class="doc_subsubsection">
Reid Spencerea2945e2007-04-10 02:51:31 +00005572 <a name="int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic</a>
Reid Spencer8bc7d952007-04-01 19:00:37 +00005573</div>
5574
5575<div class="doc_text">
5576
5577<h5>Syntax:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00005578<p>This is an overloaded intrinsic. You can use <tt>llvm.part.select</tt>
Reid Spencer8bc7d952007-04-01 19:00:37 +00005579on any integer bit width.
5580<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005581 declare i17 @llvm.part.select.i17 (i17 %val, i32 %loBit, i32 %hiBit)
5582 declare i29 @llvm.part.select.i29 (i29 %val, i32 %loBit, i32 %hiBit)
Reid Spencer8bc7d952007-04-01 19:00:37 +00005583</pre>
5584
5585<h5>Overview:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00005586<p>The '<tt>llvm.part.select</tt>' family of intrinsic functions selects a
Reid Spencer8bc7d952007-04-01 19:00:37 +00005587range of bits from an integer value and returns them in the same bit width as
5588the original value.</p>
5589
5590<h5>Arguments:</h5>
5591<p>The first argument, <tt>%val</tt> and the result may be integer types of
5592any bit width but they must have the same bit width. The second and third
Reid Spencer96a5f022007-04-04 02:42:35 +00005593arguments must be <tt>i32</tt> type since they specify only a bit index.</p>
Reid Spencer8bc7d952007-04-01 19:00:37 +00005594
5595<h5>Semantics:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00005596<p>The operation of the '<tt>llvm.part.select</tt>' intrinsic has two modes
Reid Spencer96a5f022007-04-04 02:42:35 +00005597of operation: forwards and reverse. If <tt>%loBit</tt> is greater than
5598<tt>%hiBits</tt> then the intrinsic operates in reverse mode. Otherwise it
5599operates in forward mode.</p>
5600<p>In forward mode, this intrinsic is the equivalent of shifting <tt>%val</tt>
5601right by <tt>%loBit</tt> bits and then ANDing it with a mask with
Reid Spencer8bc7d952007-04-01 19:00:37 +00005602only the <tt>%hiBit - %loBit</tt> bits set, as follows:</p>
5603<ol>
5604 <li>The <tt>%val</tt> is shifted right (LSHR) by the number of bits specified
5605 by <tt>%loBits</tt>. This normalizes the value to the low order bits.</li>
5606 <li>The <tt>%loBits</tt> value is subtracted from the <tt>%hiBits</tt> value
5607 to determine the number of bits to retain.</li>
5608 <li>A mask of the retained bits is created by shifting a -1 value.</li>
5609 <li>The mask is ANDed with <tt>%val</tt> to produce the result.
5610</ol>
Reid Spencer70845c02007-05-14 16:14:57 +00005611<p>In reverse mode, a similar computation is made except that the bits are
5612returned in the reverse order. So, for example, if <tt>X</tt> has the value
5613<tt>i16 0x0ACF (101011001111)</tt> and we apply
5614<tt>part.select(i16 X, 8, 3)</tt> to it, we get back the value
5615<tt>i16 0x0026 (000000100110)</tt>.</p>
Reid Spencer8bc7d952007-04-01 19:00:37 +00005616</div>
5617
Reid Spencer5bf54c82007-04-11 23:23:49 +00005618<div class="doc_subsubsection">
5619 <a name="int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic</a>
5620</div>
5621
5622<div class="doc_text">
5623
5624<h5>Syntax:</h5>
5625<p>This is an overloaded intrinsic. You can use <tt>llvm.part.set</tt>
5626on any integer bit width.
5627<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005628 declare i17 @llvm.part.set.i17.i9 (i17 %val, i9 %repl, i32 %lo, i32 %hi)
5629 declare i29 @llvm.part.set.i29.i9 (i29 %val, i9 %repl, i32 %lo, i32 %hi)
Reid Spencer5bf54c82007-04-11 23:23:49 +00005630</pre>
5631
5632<h5>Overview:</h5>
5633<p>The '<tt>llvm.part.set</tt>' family of intrinsic functions replaces a range
5634of bits in an integer value with another integer value. It returns the integer
5635with the replaced bits.</p>
5636
5637<h5>Arguments:</h5>
5638<p>The first argument, <tt>%val</tt> and the result may be integer types of
5639any bit width but they must have the same bit width. <tt>%val</tt> is the value
5640whose bits will be replaced. The second argument, <tt>%repl</tt> may be an
5641integer of any bit width. The third and fourth arguments must be <tt>i32</tt>
5642type since they specify only a bit index.</p>
5643
5644<h5>Semantics:</h5>
5645<p>The operation of the '<tt>llvm.part.set</tt>' intrinsic has two modes
5646of operation: forwards and reverse. If <tt>%lo</tt> is greater than
5647<tt>%hi</tt> then the intrinsic operates in reverse mode. Otherwise it
5648operates in forward mode.</p>
5649<p>For both modes, the <tt>%repl</tt> value is prepared for use by either
5650truncating it down to the size of the replacement area or zero extending it
5651up to that size.</p>
5652<p>In forward mode, the bits between <tt>%lo</tt> and <tt>%hi</tt> (inclusive)
5653are replaced with corresponding bits from <tt>%repl</tt>. That is the 0th bit
5654in <tt>%repl</tt> replaces the <tt>%lo</tt>th bit in <tt>%val</tt> and etc. up
5655to the <tt>%hi</tt>th bit.
Reid Spencer146281c2007-05-14 16:50:20 +00005656<p>In reverse mode, a similar computation is made except that the bits are
5657reversed. That is, the <tt>0</tt>th bit in <tt>%repl</tt> replaces the
5658<tt>%hi</tt> bit in <tt>%val</tt> and etc. down to the <tt>%lo</tt>th bit.
Reid Spencer5bf54c82007-04-11 23:23:49 +00005659<h5>Examples:</h5>
5660<pre>
Reid Spencerc70afc32007-04-12 01:03:03 +00005661 llvm.part.set(0xFFFF, 0, 4, 7) -&gt; 0xFF0F
Reid Spencer146281c2007-05-14 16:50:20 +00005662 llvm.part.set(0xFFFF, 0, 7, 4) -&gt; 0xFF0F
5663 llvm.part.set(0xFFFF, 1, 7, 4) -&gt; 0xFF8F
5664 llvm.part.set(0xFFFF, F, 8, 3) -&gt; 0xFFE7
Reid Spencerc70afc32007-04-12 01:03:03 +00005665 llvm.part.set(0xFFFF, 0, 3, 8) -&gt; 0xFE07
Reid Spencer7972c472007-04-11 23:49:50 +00005666</pre>
Reid Spencer5bf54c82007-04-11 23:23:49 +00005667</div>
5668
Chris Lattner941515c2004-01-06 05:31:32 +00005669<!-- ======================================================================= -->
5670<div class="doc_subsection">
5671 <a name="int_debugger">Debugger Intrinsics</a>
5672</div>
5673
5674<div class="doc_text">
5675<p>
5676The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
5677are described in the <a
5678href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
5679Debugging</a> document.
5680</p>
5681</div>
5682
5683
Jim Laskey2211f492007-03-14 19:31:19 +00005684<!-- ======================================================================= -->
5685<div class="doc_subsection">
5686 <a name="int_eh">Exception Handling Intrinsics</a>
5687</div>
5688
5689<div class="doc_text">
5690<p> The LLVM exception handling intrinsics (which all start with
5691<tt>llvm.eh.</tt> prefix), are described in the <a
5692href="ExceptionHandling.html#format_common_intrinsics">LLVM Exception
5693Handling</a> document. </p>
5694</div>
5695
Tanya Lattnercb1b9602007-06-15 20:50:54 +00005696<!-- ======================================================================= -->
5697<div class="doc_subsection">
Duncan Sands86e01192007-09-11 14:10:23 +00005698 <a name="int_trampoline">Trampoline Intrinsic</a>
Duncan Sands644f9172007-07-27 12:58:54 +00005699</div>
5700
5701<div class="doc_text">
5702<p>
Duncan Sands86e01192007-09-11 14:10:23 +00005703 This intrinsic makes it possible to excise one parameter, marked with
Duncan Sands644f9172007-07-27 12:58:54 +00005704 the <tt>nest</tt> attribute, from a function. The result is a callable
5705 function pointer lacking the nest parameter - the caller does not need
5706 to provide a value for it. Instead, the value to use is stored in
5707 advance in a "trampoline", a block of memory usually allocated
5708 on the stack, which also contains code to splice the nest value into the
5709 argument list. This is used to implement the GCC nested function address
5710 extension.
5711</p>
5712<p>
5713 For example, if the function is
5714 <tt>i32 f(i8* nest %c, i32 %x, i32 %y)</tt> then the resulting function
Bill Wendling252570f2007-09-22 09:23:55 +00005715 pointer has signature <tt>i32 (i32, i32)*</tt>. It can be created as follows:</p>
Duncan Sands644f9172007-07-27 12:58:54 +00005716<pre>
Duncan Sands86e01192007-09-11 14:10:23 +00005717 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
5718 %tramp1 = getelementptr [10 x i8]* %tramp, i32 0, i32 0
5719 %p = call i8* @llvm.init.trampoline( i8* %tramp1, i8* bitcast (i32 (i8* nest , i32, i32)* @f to i8*), i8* %nval )
5720 %fp = bitcast i8* %p to i32 (i32, i32)*
Duncan Sands644f9172007-07-27 12:58:54 +00005721</pre>
Bill Wendling252570f2007-09-22 09:23:55 +00005722 <p>The call <tt>%val = call i32 %fp( i32 %x, i32 %y )</tt> is then equivalent
5723 to <tt>%val = call i32 %f( i8* %nval, i32 %x, i32 %y )</tt>.</p>
Duncan Sands644f9172007-07-27 12:58:54 +00005724</div>
5725
5726<!-- _______________________________________________________________________ -->
5727<div class="doc_subsubsection">
5728 <a name="int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a>
5729</div>
5730<div class="doc_text">
5731<h5>Syntax:</h5>
5732<pre>
Duncan Sands86e01192007-09-11 14:10:23 +00005733declare i8* @llvm.init.trampoline(i8* &lt;tramp&gt;, i8* &lt;func&gt;, i8* &lt;nval&gt;)
Duncan Sands644f9172007-07-27 12:58:54 +00005734</pre>
5735<h5>Overview:</h5>
5736<p>
Duncan Sands86e01192007-09-11 14:10:23 +00005737 This fills the memory pointed to by <tt>tramp</tt> with code
5738 and returns a function pointer suitable for executing it.
Duncan Sands644f9172007-07-27 12:58:54 +00005739</p>
5740<h5>Arguments:</h5>
5741<p>
5742 The <tt>llvm.init.trampoline</tt> intrinsic takes three arguments, all
5743 pointers. The <tt>tramp</tt> argument must point to a sufficiently large
5744 and sufficiently aligned block of memory; this memory is written to by the
Duncan Sandsf2bcd372007-08-22 23:39:54 +00005745 intrinsic. Note that the size and the alignment are target-specific - LLVM
5746 currently provides no portable way of determining them, so a front-end that
5747 generates this intrinsic needs to have some target-specific knowledge.
5748 The <tt>func</tt> argument must hold a function bitcast to an <tt>i8*</tt>.
Duncan Sands644f9172007-07-27 12:58:54 +00005749</p>
5750<h5>Semantics:</h5>
5751<p>
5752 The block of memory pointed to by <tt>tramp</tt> is filled with target
Duncan Sands86e01192007-09-11 14:10:23 +00005753 dependent code, turning it into a function. A pointer to this function is
5754 returned, but needs to be bitcast to an
Duncan Sands644f9172007-07-27 12:58:54 +00005755 <a href="#int_trampoline">appropriate function pointer type</a>
Duncan Sands86e01192007-09-11 14:10:23 +00005756 before being called. The new function's signature is the same as that of
5757 <tt>func</tt> with any arguments marked with the <tt>nest</tt> attribute
5758 removed. At most one such <tt>nest</tt> argument is allowed, and it must be
5759 of pointer type. Calling the new function is equivalent to calling
5760 <tt>func</tt> with the same argument list, but with <tt>nval</tt> used for the
5761 missing <tt>nest</tt> argument. If, after calling
5762 <tt>llvm.init.trampoline</tt>, the memory pointed to by <tt>tramp</tt> is
5763 modified, then the effect of any later call to the returned function pointer is
5764 undefined.
Duncan Sands644f9172007-07-27 12:58:54 +00005765</p>
5766</div>
5767
5768<!-- ======================================================================= -->
5769<div class="doc_subsection">
Andrew Lenharth9b254ee2008-02-16 01:24:58 +00005770 <a name="int_atomics">Atomic Operations and Synchronization Intrinsics</a>
5771</div>
5772
5773<div class="doc_text">
5774<p>
5775 These intrinsic functions expand the "universal IR" of LLVM to represent
5776 hardware constructs for atomic operations and memory synchronization. This
5777 provides an interface to the hardware, not an interface to the programmer. It
Chris Lattner67c37d12008-08-05 18:29:16 +00005778 is aimed at a low enough level to allow any programming models or APIs
5779 (Application Programming Interfaces) which
Andrew Lenharth9b254ee2008-02-16 01:24:58 +00005780 need atomic behaviors to map cleanly onto it. It is also modeled primarily on
5781 hardware behavior. Just as hardware provides a "universal IR" for source
5782 languages, it also provides a starting point for developing a "universal"
5783 atomic operation and synchronization IR.
5784</p>
5785<p>
5786 These do <em>not</em> form an API such as high-level threading libraries,
5787 software transaction memory systems, atomic primitives, and intrinsic
5788 functions as found in BSD, GNU libc, atomic_ops, APR, and other system and
5789 application libraries. The hardware interface provided by LLVM should allow
5790 a clean implementation of all of these APIs and parallel programming models.
5791 No one model or paradigm should be selected above others unless the hardware
5792 itself ubiquitously does so.
5793
5794</p>
5795</div>
5796
5797<!-- _______________________________________________________________________ -->
5798<div class="doc_subsubsection">
5799 <a name="int_memory_barrier">'<tt>llvm.memory.barrier</tt>' Intrinsic</a>
5800</div>
5801<div class="doc_text">
5802<h5>Syntax:</h5>
5803<pre>
5804declare void @llvm.memory.barrier( i1 &lt;ll&gt;, i1 &lt;ls&gt;, i1 &lt;sl&gt;, i1 &lt;ss&gt;,
5805i1 &lt;device&gt; )
5806
5807</pre>
5808<h5>Overview:</h5>
5809<p>
5810 The <tt>llvm.memory.barrier</tt> intrinsic guarantees ordering between
5811 specific pairs of memory access types.
5812</p>
5813<h5>Arguments:</h5>
5814<p>
5815 The <tt>llvm.memory.barrier</tt> intrinsic requires five boolean arguments.
5816 The first four arguments enables a specific barrier as listed below. The fith
5817 argument specifies that the barrier applies to io or device or uncached memory.
5818
5819</p>
5820 <ul>
5821 <li><tt>ll</tt>: load-load barrier</li>
5822 <li><tt>ls</tt>: load-store barrier</li>
5823 <li><tt>sl</tt>: store-load barrier</li>
5824 <li><tt>ss</tt>: store-store barrier</li>
5825 <li><tt>device</tt>: barrier applies to device and uncached memory also.
5826 </ul>
5827<h5>Semantics:</h5>
5828<p>
5829 This intrinsic causes the system to enforce some ordering constraints upon
5830 the loads and stores of the program. This barrier does not indicate
5831 <em>when</em> any events will occur, it only enforces an <em>order</em> in
5832 which they occur. For any of the specified pairs of load and store operations
5833 (f.ex. load-load, or store-load), all of the first operations preceding the
5834 barrier will complete before any of the second operations succeeding the
5835 barrier begin. Specifically the semantics for each pairing is as follows:
5836</p>
5837 <ul>
5838 <li><tt>ll</tt>: All loads before the barrier must complete before any load
5839 after the barrier begins.</li>
5840
5841 <li><tt>ls</tt>: All loads before the barrier must complete before any
5842 store after the barrier begins.</li>
5843 <li><tt>ss</tt>: All stores before the barrier must complete before any
5844 store after the barrier begins.</li>
5845 <li><tt>sl</tt>: All stores before the barrier must complete before any
5846 load after the barrier begins.</li>
5847 </ul>
5848<p>
5849 These semantics are applied with a logical "and" behavior when more than one
5850 is enabled in a single memory barrier intrinsic.
5851</p>
5852<p>
5853 Backends may implement stronger barriers than those requested when they do not
5854 support as fine grained a barrier as requested. Some architectures do not
5855 need all types of barriers and on such architectures, these become noops.
5856</p>
5857<h5>Example:</h5>
5858<pre>
5859%ptr = malloc i32
5860 store i32 4, %ptr
5861
5862%result1 = load i32* %ptr <i>; yields {i32}:result1 = 4</i>
5863 call void @llvm.memory.barrier( i1 false, i1 true, i1 false, i1 false )
5864 <i>; guarantee the above finishes</i>
5865 store i32 8, %ptr <i>; before this begins</i>
5866</pre>
5867</div>
5868
Andrew Lenharth95528942008-02-21 06:45:13 +00005869<!-- _______________________________________________________________________ -->
5870<div class="doc_subsubsection">
Mon P Wang6a490372008-06-25 08:15:39 +00005871 <a name="int_atomic_cmp_swap">'<tt>llvm.atomic.cmp.swap.*</tt>' Intrinsic</a>
Andrew Lenharth95528942008-02-21 06:45:13 +00005872</div>
5873<div class="doc_text">
5874<h5>Syntax:</h5>
5875<p>
Mon P Wang2c839d42008-07-30 04:36:53 +00005876 This is an overloaded intrinsic. You can use <tt>llvm.atomic.cmp.swap</tt> on
5877 any integer bit width and for different address spaces. Not all targets
5878 support all bit widths however.</p>
Andrew Lenharth95528942008-02-21 06:45:13 +00005879
5880<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00005881declare i8 @llvm.atomic.cmp.swap.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;cmp&gt;, i8 &lt;val&gt; )
5882declare i16 @llvm.atomic.cmp.swap.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;cmp&gt;, i16 &lt;val&gt; )
5883declare i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;cmp&gt;, i32 &lt;val&gt; )
5884declare i64 @llvm.atomic.cmp.swap.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;cmp&gt;, i64 &lt;val&gt; )
Andrew Lenharth95528942008-02-21 06:45:13 +00005885
5886</pre>
5887<h5>Overview:</h5>
5888<p>
5889 This loads a value in memory and compares it to a given value. If they are
5890 equal, it stores a new value into the memory.
5891</p>
5892<h5>Arguments:</h5>
5893<p>
Mon P Wang6a490372008-06-25 08:15:39 +00005894 The <tt>llvm.atomic.cmp.swap</tt> intrinsic takes three arguments. The result as
Andrew Lenharth95528942008-02-21 06:45:13 +00005895 well as both <tt>cmp</tt> and <tt>val</tt> must be integer values with the
5896 same bit width. The <tt>ptr</tt> argument must be a pointer to a value of
5897 this integer type. While any bit width integer may be used, targets may only
5898 lower representations they support in hardware.
5899
5900</p>
5901<h5>Semantics:</h5>
5902<p>
5903 This entire intrinsic must be executed atomically. It first loads the value
5904 in memory pointed to by <tt>ptr</tt> and compares it with the value
5905 <tt>cmp</tt>. If they are equal, <tt>val</tt> is stored into the memory. The
5906 loaded value is yielded in all cases. This provides the equivalent of an
5907 atomic compare-and-swap operation within the SSA framework.
5908</p>
5909<h5>Examples:</h5>
5910
5911<pre>
5912%ptr = malloc i32
5913 store i32 4, %ptr
5914
5915%val1 = add i32 4, 4
Mon P Wang2c839d42008-07-30 04:36:53 +00005916%result1 = call i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* %ptr, i32 4, %val1 )
Andrew Lenharth95528942008-02-21 06:45:13 +00005917 <i>; yields {i32}:result1 = 4</i>
5918%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
5919%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
5920
5921%val2 = add i32 1, 1
Mon P Wang2c839d42008-07-30 04:36:53 +00005922%result2 = call i32 @llvm.atomic.cmp.swap.i32.p0i32( i32* %ptr, i32 5, %val2 )
Andrew Lenharth95528942008-02-21 06:45:13 +00005923 <i>; yields {i32}:result2 = 8</i>
5924%stored2 = icmp eq i32 %result2, 5 <i>; yields {i1}:stored2 = false</i>
5925
5926%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 8</i>
5927</pre>
5928</div>
5929
5930<!-- _______________________________________________________________________ -->
5931<div class="doc_subsubsection">
5932 <a name="int_atomic_swap">'<tt>llvm.atomic.swap.*</tt>' Intrinsic</a>
5933</div>
5934<div class="doc_text">
5935<h5>Syntax:</h5>
5936
5937<p>
5938 This is an overloaded intrinsic. You can use <tt>llvm.atomic.swap</tt> on any
5939 integer bit width. Not all targets support all bit widths however.</p>
5940<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00005941declare i8 @llvm.atomic.swap.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;val&gt; )
5942declare i16 @llvm.atomic.swap.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;val&gt; )
5943declare i32 @llvm.atomic.swap.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;val&gt; )
5944declare i64 @llvm.atomic.swap.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;val&gt; )
Andrew Lenharth95528942008-02-21 06:45:13 +00005945
5946</pre>
5947<h5>Overview:</h5>
5948<p>
5949 This intrinsic loads the value stored in memory at <tt>ptr</tt> and yields
5950 the value from memory. It then stores the value in <tt>val</tt> in the memory
5951 at <tt>ptr</tt>.
5952</p>
5953<h5>Arguments:</h5>
5954
5955<p>
Mon P Wang6a490372008-06-25 08:15:39 +00005956 The <tt>llvm.atomic.swap</tt> intrinsic takes two arguments. Both the
Andrew Lenharth95528942008-02-21 06:45:13 +00005957 <tt>val</tt> argument and the result must be integers of the same bit width.
5958 The first argument, <tt>ptr</tt>, must be a pointer to a value of this
5959 integer type. The targets may only lower integer representations they
5960 support.
5961</p>
5962<h5>Semantics:</h5>
5963<p>
5964 This intrinsic loads the value pointed to by <tt>ptr</tt>, yields it, and
5965 stores <tt>val</tt> back into <tt>ptr</tt> atomically. This provides the
5966 equivalent of an atomic swap operation within the SSA framework.
5967
5968</p>
5969<h5>Examples:</h5>
5970<pre>
5971%ptr = malloc i32
5972 store i32 4, %ptr
5973
5974%val1 = add i32 4, 4
Mon P Wang2c839d42008-07-30 04:36:53 +00005975%result1 = call i32 @llvm.atomic.swap.i32.p0i32( i32* %ptr, i32 %val1 )
Andrew Lenharth95528942008-02-21 06:45:13 +00005976 <i>; yields {i32}:result1 = 4</i>
5977%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
5978%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
5979
5980%val2 = add i32 1, 1
Mon P Wang2c839d42008-07-30 04:36:53 +00005981%result2 = call i32 @llvm.atomic.swap.i32.p0i32( i32* %ptr, i32 %val2 )
Andrew Lenharth95528942008-02-21 06:45:13 +00005982 <i>; yields {i32}:result2 = 8</i>
5983
5984%stored2 = icmp eq i32 %result2, 8 <i>; yields {i1}:stored2 = true</i>
5985%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 2</i>
5986</pre>
5987</div>
5988
5989<!-- _______________________________________________________________________ -->
5990<div class="doc_subsubsection">
Mon P Wang6a490372008-06-25 08:15:39 +00005991 <a name="int_atomic_load_add">'<tt>llvm.atomic.load.add.*</tt>' Intrinsic</a>
Andrew Lenharth95528942008-02-21 06:45:13 +00005992
5993</div>
5994<div class="doc_text">
5995<h5>Syntax:</h5>
5996<p>
Mon P Wang6a490372008-06-25 08:15:39 +00005997 This is an overloaded intrinsic. You can use <tt>llvm.atomic.load.add</tt> on any
Andrew Lenharth95528942008-02-21 06:45:13 +00005998 integer bit width. Not all targets support all bit widths however.</p>
5999<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006000declare i8 @llvm.atomic.load.add.i8..p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6001declare i16 @llvm.atomic.load.add.i16..p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6002declare i32 @llvm.atomic.load.add.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6003declare i64 @llvm.atomic.load.add.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Andrew Lenharth95528942008-02-21 06:45:13 +00006004
6005</pre>
6006<h5>Overview:</h5>
6007<p>
6008 This intrinsic adds <tt>delta</tt> to the value stored in memory at
6009 <tt>ptr</tt>. It yields the original value at <tt>ptr</tt>.
6010</p>
6011<h5>Arguments:</h5>
6012<p>
6013
6014 The intrinsic takes two arguments, the first a pointer to an integer value
6015 and the second an integer value. The result is also an integer value. These
6016 integer types can have any bit width, but they must all have the same bit
6017 width. The targets may only lower integer representations they support.
6018</p>
6019<h5>Semantics:</h5>
6020<p>
6021 This intrinsic does a series of operations atomically. It first loads the
6022 value stored at <tt>ptr</tt>. It then adds <tt>delta</tt>, stores the result
6023 to <tt>ptr</tt>. It yields the original value stored at <tt>ptr</tt>.
6024</p>
6025
6026<h5>Examples:</h5>
6027<pre>
6028%ptr = malloc i32
6029 store i32 4, %ptr
Mon P Wang2c839d42008-07-30 04:36:53 +00006030%result1 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 4 )
Andrew Lenharth95528942008-02-21 06:45:13 +00006031 <i>; yields {i32}:result1 = 4</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006032%result2 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 2 )
Andrew Lenharth95528942008-02-21 06:45:13 +00006033 <i>; yields {i32}:result2 = 8</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006034%result3 = call i32 @llvm.atomic.load.add.i32.p0i32( i32* %ptr, i32 5 )
Andrew Lenharth95528942008-02-21 06:45:13 +00006035 <i>; yields {i32}:result3 = 10</i>
Mon P Wang6a490372008-06-25 08:15:39 +00006036%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 15</i>
Andrew Lenharth95528942008-02-21 06:45:13 +00006037</pre>
6038</div>
6039
Mon P Wang6a490372008-06-25 08:15:39 +00006040<!-- _______________________________________________________________________ -->
6041<div class="doc_subsubsection">
6042 <a name="int_atomic_load_sub">'<tt>llvm.atomic.load.sub.*</tt>' Intrinsic</a>
6043
6044</div>
6045<div class="doc_text">
6046<h5>Syntax:</h5>
6047<p>
6048 This is an overloaded intrinsic. You can use <tt>llvm.atomic.load.sub</tt> on
Mon P Wang2c839d42008-07-30 04:36:53 +00006049 any integer bit width and for different address spaces. Not all targets
6050 support all bit widths however.</p>
Mon P Wang6a490372008-06-25 08:15:39 +00006051<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006052declare i8 @llvm.atomic.load.sub.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6053declare i16 @llvm.atomic.load.sub.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6054declare i32 @llvm.atomic.load.sub.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6055declare i64 @llvm.atomic.load.sub.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006056
6057</pre>
6058<h5>Overview:</h5>
6059<p>
6060 This intrinsic subtracts <tt>delta</tt> to the value stored in memory at
6061 <tt>ptr</tt>. It yields the original value at <tt>ptr</tt>.
6062</p>
6063<h5>Arguments:</h5>
6064<p>
6065
6066 The intrinsic takes two arguments, the first a pointer to an integer value
6067 and the second an integer value. The result is also an integer value. These
6068 integer types can have any bit width, but they must all have the same bit
6069 width. The targets may only lower integer representations they support.
6070</p>
6071<h5>Semantics:</h5>
6072<p>
6073 This intrinsic does a series of operations atomically. It first loads the
6074 value stored at <tt>ptr</tt>. It then subtracts <tt>delta</tt>, stores the
6075 result to <tt>ptr</tt>. It yields the original value stored at <tt>ptr</tt>.
6076</p>
6077
6078<h5>Examples:</h5>
6079<pre>
6080%ptr = malloc i32
6081 store i32 8, %ptr
Mon P Wang2c839d42008-07-30 04:36:53 +00006082%result1 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 4 )
Mon P Wang6a490372008-06-25 08:15:39 +00006083 <i>; yields {i32}:result1 = 8</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006084%result2 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 2 )
Mon P Wang6a490372008-06-25 08:15:39 +00006085 <i>; yields {i32}:result2 = 4</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006086%result3 = call i32 @llvm.atomic.load.sub.i32.p0i32( i32* %ptr, i32 5 )
Mon P Wang6a490372008-06-25 08:15:39 +00006087 <i>; yields {i32}:result3 = 2</i>
6088%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = -3</i>
6089</pre>
6090</div>
6091
6092<!-- _______________________________________________________________________ -->
6093<div class="doc_subsubsection">
6094 <a name="int_atomic_load_and">'<tt>llvm.atomic.load.and.*</tt>' Intrinsic</a><br>
6095 <a name="int_atomic_load_nand">'<tt>llvm.atomic.load.nand.*</tt>' Intrinsic</a><br>
6096 <a name="int_atomic_load_or">'<tt>llvm.atomic.load.or.*</tt>' Intrinsic</a><br>
6097 <a name="int_atomic_load_xor">'<tt>llvm.atomic.load.xor.*</tt>' Intrinsic</a><br>
6098
6099</div>
6100<div class="doc_text">
6101<h5>Syntax:</h5>
6102<p>
6103 These are overloaded intrinsics. You can use <tt>llvm.atomic.load_and</tt>,
6104 <tt>llvm.atomic.load_nand</tt>, <tt>llvm.atomic.load_or</tt>, and
Mon P Wang2c839d42008-07-30 04:36:53 +00006105 <tt>llvm.atomic.load_xor</tt> on any integer bit width and for different
6106 address spaces. Not all targets support all bit widths however.</p>
Mon P Wang6a490372008-06-25 08:15:39 +00006107<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006108declare i8 @llvm.atomic.load.and.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6109declare i16 @llvm.atomic.load.and.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6110declare i32 @llvm.atomic.load.and.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6111declare i64 @llvm.atomic.load.and.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006112
6113</pre>
6114
6115<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006116declare i8 @llvm.atomic.load.or.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6117declare i16 @llvm.atomic.load.or.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6118declare i32 @llvm.atomic.load.or.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6119declare i64 @llvm.atomic.load.or.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006120
6121</pre>
6122
6123<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006124declare i8 @llvm.atomic.load.nand.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6125declare i16 @llvm.atomic.load.nand.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6126declare i32 @llvm.atomic.load.nand.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6127declare i64 @llvm.atomic.load.nand.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006128
6129</pre>
6130
6131<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006132declare i8 @llvm.atomic.load.xor.i8.p0i32( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6133declare i16 @llvm.atomic.load.xor.i16.p0i32( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6134declare i32 @llvm.atomic.load.xor.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6135declare i64 @llvm.atomic.load.xor.i64.p0i32( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006136
6137</pre>
6138<h5>Overview:</h5>
6139<p>
6140 These intrinsics bitwise the operation (and, nand, or, xor) <tt>delta</tt> to
6141 the value stored in memory at <tt>ptr</tt>. It yields the original value
6142 at <tt>ptr</tt>.
6143</p>
6144<h5>Arguments:</h5>
6145<p>
6146
6147 These intrinsics take two arguments, the first a pointer to an integer value
6148 and the second an integer value. The result is also an integer value. These
6149 integer types can have any bit width, but they must all have the same bit
6150 width. The targets may only lower integer representations they support.
6151</p>
6152<h5>Semantics:</h5>
6153<p>
6154 These intrinsics does a series of operations atomically. They first load the
6155 value stored at <tt>ptr</tt>. They then do the bitwise operation
6156 <tt>delta</tt>, store the result to <tt>ptr</tt>. They yield the original
6157 value stored at <tt>ptr</tt>.
6158</p>
6159
6160<h5>Examples:</h5>
6161<pre>
6162%ptr = malloc i32
6163 store i32 0x0F0F, %ptr
Mon P Wang2c839d42008-07-30 04:36:53 +00006164%result0 = call i32 @llvm.atomic.load.nand.i32.p0i32( i32* %ptr, i32 0xFF )
Mon P Wang6a490372008-06-25 08:15:39 +00006165 <i>; yields {i32}:result0 = 0x0F0F</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006166%result1 = call i32 @llvm.atomic.load.and.i32.p0i32( i32* %ptr, i32 0xFF )
Mon P Wang6a490372008-06-25 08:15:39 +00006167 <i>; yields {i32}:result1 = 0xFFFFFFF0</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006168%result2 = call i32 @llvm.atomic.load.or.i32.p0i32( i32* %ptr, i32 0F )
Mon P Wang6a490372008-06-25 08:15:39 +00006169 <i>; yields {i32}:result2 = 0xF0</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006170%result3 = call i32 @llvm.atomic.load.xor.i32.p0i32( i32* %ptr, i32 0F )
Mon P Wang6a490372008-06-25 08:15:39 +00006171 <i>; yields {i32}:result3 = FF</i>
6172%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = F0</i>
6173</pre>
6174</div>
6175
6176
6177<!-- _______________________________________________________________________ -->
6178<div class="doc_subsubsection">
6179 <a name="int_atomic_load_max">'<tt>llvm.atomic.load.max.*</tt>' Intrinsic</a><br>
6180 <a name="int_atomic_load_min">'<tt>llvm.atomic.load.min.*</tt>' Intrinsic</a><br>
6181 <a name="int_atomic_load_umax">'<tt>llvm.atomic.load.umax.*</tt>' Intrinsic</a><br>
6182 <a name="int_atomic_load_umin">'<tt>llvm.atomic.load.umin.*</tt>' Intrinsic</a><br>
6183
6184</div>
6185<div class="doc_text">
6186<h5>Syntax:</h5>
6187<p>
6188 These are overloaded intrinsics. You can use <tt>llvm.atomic.load_max</tt>,
6189 <tt>llvm.atomic.load_min</tt>, <tt>llvm.atomic.load_umax</tt>, and
Mon P Wang2c839d42008-07-30 04:36:53 +00006190 <tt>llvm.atomic.load_umin</tt> on any integer bit width and for different
6191 address spaces. Not all targets
Mon P Wang6a490372008-06-25 08:15:39 +00006192 support all bit widths however.</p>
6193<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006194declare i8 @llvm.atomic.load.max.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6195declare i16 @llvm.atomic.load.max.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6196declare i32 @llvm.atomic.load.max.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6197declare i64 @llvm.atomic.load.max.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006198
6199</pre>
6200
6201<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006202declare i8 @llvm.atomic.load.min.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6203declare i16 @llvm.atomic.load.min.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6204declare i32 @llvm.atomic.load.min.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6205declare i64 @llvm.atomic.load.min.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006206
6207</pre>
6208
6209<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006210declare i8 @llvm.atomic.load.umax.i8.p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6211declare i16 @llvm.atomic.load.umax.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6212declare i32 @llvm.atomic.load.umax.i32.p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6213declare i64 @llvm.atomic.load.umax.i64.p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006214
6215</pre>
6216
6217<pre>
Mon P Wang2c839d42008-07-30 04:36:53 +00006218declare i8 @llvm.atomic.load.umin.i8..p0i8( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
6219declare i16 @llvm.atomic.load.umin.i16.p0i16( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
6220declare i32 @llvm.atomic.load.umin.i32..p0i32( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
6221declare i64 @llvm.atomic.load.umin.i64..p0i64( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
Mon P Wang6a490372008-06-25 08:15:39 +00006222
6223</pre>
6224<h5>Overview:</h5>
6225<p>
6226 These intrinsics takes the signed or unsigned minimum or maximum of
6227 <tt>delta</tt> and the value stored in memory at <tt>ptr</tt>. It yields the
6228 original value at <tt>ptr</tt>.
6229</p>
6230<h5>Arguments:</h5>
6231<p>
6232
6233 These intrinsics take two arguments, the first a pointer to an integer value
6234 and the second an integer value. The result is also an integer value. These
6235 integer types can have any bit width, but they must all have the same bit
6236 width. The targets may only lower integer representations they support.
6237</p>
6238<h5>Semantics:</h5>
6239<p>
6240 These intrinsics does a series of operations atomically. They first load the
6241 value stored at <tt>ptr</tt>. They then do the signed or unsigned min or max
6242 <tt>delta</tt> and the value, store the result to <tt>ptr</tt>. They yield
6243 the original value stored at <tt>ptr</tt>.
6244</p>
6245
6246<h5>Examples:</h5>
6247<pre>
6248%ptr = malloc i32
6249 store i32 7, %ptr
Mon P Wang2c839d42008-07-30 04:36:53 +00006250%result0 = call i32 @llvm.atomic.load.min.i32.p0i32( i32* %ptr, i32 -2 )
Mon P Wang6a490372008-06-25 08:15:39 +00006251 <i>; yields {i32}:result0 = 7</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006252%result1 = call i32 @llvm.atomic.load.max.i32.p0i32( i32* %ptr, i32 8 )
Mon P Wang6a490372008-06-25 08:15:39 +00006253 <i>; yields {i32}:result1 = -2</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006254%result2 = call i32 @llvm.atomic.load.umin.i32.p0i32( i32* %ptr, i32 10 )
Mon P Wang6a490372008-06-25 08:15:39 +00006255 <i>; yields {i32}:result2 = 8</i>
Mon P Wang2c839d42008-07-30 04:36:53 +00006256%result3 = call i32 @llvm.atomic.load.umax.i32.p0i32( i32* %ptr, i32 30 )
Mon P Wang6a490372008-06-25 08:15:39 +00006257 <i>; yields {i32}:result3 = 8</i>
6258%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 30</i>
6259</pre>
6260</div>
Andrew Lenharth9b254ee2008-02-16 01:24:58 +00006261
6262<!-- ======================================================================= -->
6263<div class="doc_subsection">
Tanya Lattnercb1b9602007-06-15 20:50:54 +00006264 <a name="int_general">General Intrinsics</a>
6265</div>
6266
6267<div class="doc_text">
6268<p> This class of intrinsics is designed to be generic and has
6269no specific purpose. </p>
6270</div>
6271
6272<!-- _______________________________________________________________________ -->
6273<div class="doc_subsubsection">
6274 <a name="int_var_annotation">'<tt>llvm.var.annotation</tt>' Intrinsic</a>
6275</div>
6276
6277<div class="doc_text">
6278
6279<h5>Syntax:</h5>
6280<pre>
Tanya Lattnerbed1d4d2007-06-18 23:42:37 +00006281 declare void @llvm.var.annotation(i8* &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattnercb1b9602007-06-15 20:50:54 +00006282</pre>
6283
6284<h5>Overview:</h5>
6285
6286<p>
6287The '<tt>llvm.var.annotation</tt>' intrinsic
6288</p>
6289
6290<h5>Arguments:</h5>
6291
6292<p>
Tanya Lattnerbed1d4d2007-06-18 23:42:37 +00006293The first argument is a pointer to a value, the second is a pointer to a
6294global string, the third is a pointer to a global string which is the source
6295file name, and the last argument is the line number.
Tanya Lattnercb1b9602007-06-15 20:50:54 +00006296</p>
6297
6298<h5>Semantics:</h5>
6299
6300<p>
Anton Korobeynikov06cbb652008-01-15 22:31:34 +00006301This intrinsic allows annotation of local variables with arbitrary strings.
Tanya Lattnercb1b9602007-06-15 20:50:54 +00006302This can be useful for special purpose optimizations that want to look for these
Anton Korobeynikov06cbb652008-01-15 22:31:34 +00006303annotations. These have no other defined use, they are ignored by code
6304generation and optimization.
6305</p>
Tanya Lattnercb1b9602007-06-15 20:50:54 +00006306</div>
6307
Tanya Lattner293c0372007-09-21 22:59:12 +00006308<!-- _______________________________________________________________________ -->
6309<div class="doc_subsubsection">
Tanya Lattner0186a652007-09-21 23:57:59 +00006310 <a name="int_annotation">'<tt>llvm.annotation.*</tt>' Intrinsic</a>
Tanya Lattner293c0372007-09-21 22:59:12 +00006311</div>
6312
6313<div class="doc_text">
6314
6315<h5>Syntax:</h5>
Tanya Lattner23dbd572007-09-21 23:56:27 +00006316<p>This is an overloaded intrinsic. You can use '<tt>llvm.annotation</tt>' on
6317any integer bit width.
6318</p>
Tanya Lattner293c0372007-09-21 22:59:12 +00006319<pre>
Tanya Lattnercf3e26f2007-09-22 00:03:01 +00006320 declare i8 @llvm.annotation.i8(i8 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6321 declare i16 @llvm.annotation.i16(i16 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6322 declare i32 @llvm.annotation.i32(i32 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6323 declare i64 @llvm.annotation.i64(i64 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6324 declare i256 @llvm.annotation.i256(i256 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattner293c0372007-09-21 22:59:12 +00006325</pre>
6326
6327<h5>Overview:</h5>
Tanya Lattner23dbd572007-09-21 23:56:27 +00006328
6329<p>
6330The '<tt>llvm.annotation</tt>' intrinsic.
Tanya Lattner293c0372007-09-21 22:59:12 +00006331</p>
6332
6333<h5>Arguments:</h5>
6334
6335<p>
6336The first argument is an integer value (result of some expression),
6337the second is a pointer to a global string, the third is a pointer to a global
6338string which is the source file name, and the last argument is the line number.
Tanya Lattner23dbd572007-09-21 23:56:27 +00006339It returns the value of the first argument.
Tanya Lattner293c0372007-09-21 22:59:12 +00006340</p>
6341
6342<h5>Semantics:</h5>
6343
6344<p>
6345This intrinsic allows annotations to be put on arbitrary expressions
6346with arbitrary strings. This can be useful for special purpose optimizations
6347that want to look for these annotations. These have no other defined use, they
6348are ignored by code generation and optimization.
6349</div>
Jim Laskey2211f492007-03-14 19:31:19 +00006350
Anton Korobeynikov06cbb652008-01-15 22:31:34 +00006351<!-- _______________________________________________________________________ -->
6352<div class="doc_subsubsection">
6353 <a name="int_trap">'<tt>llvm.trap</tt>' Intrinsic</a>
6354</div>
6355
6356<div class="doc_text">
6357
6358<h5>Syntax:</h5>
6359<pre>
6360 declare void @llvm.trap()
6361</pre>
6362
6363<h5>Overview:</h5>
6364
6365<p>
6366The '<tt>llvm.trap</tt>' intrinsic
6367</p>
6368
6369<h5>Arguments:</h5>
6370
6371<p>
6372None
6373</p>
6374
6375<h5>Semantics:</h5>
6376
6377<p>
6378This intrinsics is lowered to the target dependent trap instruction. If the
6379target does not have a trap instruction, this intrinsic will be lowered to the
6380call of the abort() function.
6381</p>
6382</div>
6383
Chris Lattner2f7c9632001-06-06 20:29:01 +00006384<!-- *********************************************************************** -->
Chris Lattner2f7c9632001-06-06 20:29:01 +00006385<hr>
Misha Brukmanc501f552004-03-01 17:47:27 +00006386<address>
6387 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
6388 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
6389 <a href="http://validator.w3.org/check/referer"><img
Chris Lattnerb8f816e2008-01-04 04:33:49 +00006390 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
Misha Brukmanc501f552004-03-01 17:47:27 +00006391
6392 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
Reid Spencerca058542006-03-14 05:39:39 +00006393 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
Misha Brukmanc501f552004-03-01 17:47:27 +00006394 Last modified: $Date$
6395</address>
Chris Lattnerb8f816e2008-01-04 04:33:49 +00006396
Misha Brukman76307852003-11-08 01:05:38 +00006397</body>
6398</html>