blob: 59d6581ce211e915c7ac6121c01f7e01acca662b [file] [log] [blame]
Misha Brukmandaa4cb02004-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 Brukman9d0919f2003-11-08 01:05:38 +00003<html>
4<head>
5 <title>LLVM Assembly Language Reference Manual</title>
Reid Spencer3921c742004-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 Brukman9d0919f2003-11-08 01:05:38 +000010 <link rel="stylesheet" href="llvm.css" type="text/css">
11</head>
Chris Lattnerd7923912004-05-23 21:06:01 +000012
Misha Brukman9d0919f2003-11-08 01:05:38 +000013<body>
Chris Lattnerd7923912004-05-23 21:06:01 +000014
Chris Lattner261efe92003-11-25 01:02:51 +000015<div class="doc_title"> LLVM Language Reference Manual </div>
Chris Lattner00950542001-06-06 20:29:01 +000016<ol>
Misha Brukman9d0919f2003-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 Lattnerfa730212004-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 Lattnere5d947b2004-12-09 16:36:40 +000023 <li><a href="#linkage">Linkage Types</a></li>
Chris Lattnerbad10ee2005-05-06 22:57:40 +000024 <li><a href="#callingconv">Calling Conventions</a></li>
Chris Lattnerfa730212004-12-09 16:11:40 +000025 <li><a href="#globalvars">Global Variables</a></li>
Chris Lattner4e9aba72006-01-23 23:23:47 +000026 <li><a href="#functionstructure">Functions</a></li>
Anton Korobeynikovc6c98af2007-04-29 18:02:48 +000027 <li><a href="#aliasstructure">Aliases</a>
Reid Spencerca86e162006-12-31 07:07:53 +000028 <li><a href="#paramattrs">Parameter Attributes</a></li>
Gordon Henriksen80a75bf2007-12-10 03:18:06 +000029 <li><a href="#gc">Garbage Collector Names</a></li>
Chris Lattner4e9aba72006-01-23 23:23:47 +000030 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
Reid Spencerde151942007-02-19 23:54:10 +000031 <li><a href="#datalayout">Data Layout</a></li>
Chris Lattnerfa730212004-12-09 16:11:40 +000032 </ol>
33 </li>
Chris Lattner00950542001-06-06 20:29:01 +000034 <li><a href="#typesystem">Type System</a>
35 <ol>
Chris Lattner4f69f462008-01-04 04:32:38 +000036 <li><a href="#t_classifications">Type Classifications</a></li>
Robert Bocchino7b81c752006-02-17 21:18:08 +000037 <li><a href="#t_primitive">Primitive Types</a>
Chris Lattner261efe92003-11-25 01:02:51 +000038 <ol>
Chris Lattner4f69f462008-01-04 04:32:38 +000039 <li><a href="#t_floating">Floating Point Types</a></li>
40 <li><a href="#t_void">Void Type</a></li>
41 <li><a href="#t_label">Label Type</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000042 </ol>
43 </li>
Chris Lattner00950542001-06-06 20:29:01 +000044 <li><a href="#t_derived">Derived Types</a>
45 <ol>
Chris Lattnerb9488a62007-12-18 06:18:21 +000046 <li><a href="#t_integer">Integer Type</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000047 <li><a href="#t_array">Array Type</a></li>
Misha Brukman9d0919f2003-11-08 01:05:38 +000048 <li><a href="#t_function">Function Type</a></li>
49 <li><a href="#t_pointer">Pointer Type</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000050 <li><a href="#t_struct">Structure Type</a></li>
Andrew Lenharth75e10682006-12-08 17:13:00 +000051 <li><a href="#t_pstruct">Packed Structure Type</a></li>
Reid Spencer485bad12007-02-15 03:07:05 +000052 <li><a href="#t_vector">Vector Type</a></li>
Chris Lattner69c11bb2005-04-25 17:34:15 +000053 <li><a href="#t_opaque">Opaque Type</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000054 </ol>
55 </li>
56 </ol>
57 </li>
Chris Lattnerfa730212004-12-09 16:11:40 +000058 <li><a href="#constants">Constants</a>
Chris Lattnerc3f59762004-12-09 17:30:23 +000059 <ol>
60 <li><a href="#simpleconstants">Simple Constants</a>
61 <li><a href="#aggregateconstants">Aggregate Constants</a>
62 <li><a href="#globalconstants">Global Variable and Function Addresses</a>
63 <li><a href="#undefvalues">Undefined Values</a>
64 <li><a href="#constantexprs">Constant Expressions</a>
65 </ol>
Chris Lattner261efe92003-11-25 01:02:51 +000066 </li>
Chris Lattnere87d6532006-01-25 23:47:57 +000067 <li><a href="#othervalues">Other Values</a>
68 <ol>
69 <li><a href="#inlineasm">Inline Assembler Expressions</a>
70 </ol>
71 </li>
Chris Lattner00950542001-06-06 20:29:01 +000072 <li><a href="#instref">Instruction Reference</a>
73 <ol>
74 <li><a href="#terminators">Terminator Instructions</a>
75 <ol>
Chris Lattner261efe92003-11-25 01:02:51 +000076 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
77 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
Misha Brukman9d0919f2003-11-08 01:05:38 +000078 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
79 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000080 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
Chris Lattner35eca582004-10-16 18:04:13 +000081 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000082 </ol>
83 </li>
Chris Lattner00950542001-06-06 20:29:01 +000084 <li><a href="#binaryops">Binary Operations</a>
85 <ol>
Chris Lattner261efe92003-11-25 01:02:51 +000086 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
87 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
88 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
Reid Spencer1628cec2006-10-26 06:15:43 +000089 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
90 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
91 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
Reid Spencer0a783f72006-11-02 01:53:59 +000092 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
93 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
94 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +000095 </ol>
96 </li>
Chris Lattner00950542001-06-06 20:29:01 +000097 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
98 <ol>
Reid Spencer8e11bf82007-02-02 13:57:07 +000099 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
100 <li><a href="#i_lshr">'<tt>lshr</tt>' Instruction</a></li>
101 <li><a href="#i_ashr">'<tt>ashr</tt>' Instruction</a></li>
Misha Brukman9d0919f2003-11-08 01:05:38 +0000102 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +0000103 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
Misha Brukman9d0919f2003-11-08 01:05:38 +0000104 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +0000105 </ol>
106 </li>
Chris Lattner3df241e2006-04-08 23:07:04 +0000107 <li><a href="#vectorops">Vector Operations</a>
108 <ol>
109 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
110 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
111 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
Chris Lattner3df241e2006-04-08 23:07:04 +0000112 </ol>
113 </li>
Dan Gohmana334d5f2008-05-12 23:51:09 +0000114 <li><a href="#aggregateops">Aggregate Operations</a>
115 <ol>
116 <li><a href="#i_extractvalue">'<tt>extractvalue</tt>' Instruction</a></li>
117 <li><a href="#i_insertvalue">'<tt>insertvalue</tt>' Instruction</a></li>
118 </ol>
119 </li>
Chris Lattner884a9702006-08-15 00:45:58 +0000120 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
Chris Lattner00950542001-06-06 20:29:01 +0000121 <ol>
Chris Lattner261efe92003-11-25 01:02:51 +0000122 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
123 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
124 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
Robert Bocchino7b81c752006-02-17 21:18:08 +0000125 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
126 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
127 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +0000128 </ol>
129 </li>
Reid Spencer2fd21e62006-11-08 01:18:52 +0000130 <li><a href="#convertops">Conversion Operations</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +0000131 <ol>
132 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
133 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
134 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
135 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
136 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
Reid Spencerd4448792006-11-09 23:03:26 +0000137 <li><a href="#i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a></li>
138 <li><a href="#i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a></li>
139 <li><a href="#i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a></li>
140 <li><a href="#i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a></li>
Reid Spencer72679252006-11-11 21:00:47 +0000141 <li><a href="#i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a></li>
142 <li><a href="#i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a></li>
Reid Spencer5c0ef472006-11-11 23:08:07 +0000143 <li><a href="#i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a></li>
Reid Spencer9dee3ac2006-11-08 01:11:31 +0000144 </ol>
Chris Lattner00950542001-06-06 20:29:01 +0000145 <li><a href="#otherops">Other Operations</a>
146 <ol>
Reid Spencerf3a70a62006-11-18 21:50:54 +0000147 <li><a href="#i_icmp">'<tt>icmp</tt>' Instruction</a></li>
148 <li><a href="#i_fcmp">'<tt>fcmp</tt>' Instruction</a></li>
Nate Begemanac80ade2008-05-12 19:01:56 +0000149 <li><a href="#i_vicmp">'<tt>vicmp</tt>' Instruction</a></li>
150 <li><a href="#i_vfcmp">'<tt>vfcmp</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +0000151 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
Chris Lattnercc37aae2004-03-12 05:50:16 +0000152 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
Chris Lattner261efe92003-11-25 01:02:51 +0000153 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
Chris Lattnerfb6977d2006-01-13 23:26:01 +0000154 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
Devang Patelc3fc6df2008-03-10 20:49:15 +0000155 <li><a href="#i_getresult">'<tt>getresult</tt>' Instruction</a></li>
Chris Lattner00950542001-06-06 20:29:01 +0000156 </ol>
Chris Lattner261efe92003-11-25 01:02:51 +0000157 </li>
Chris Lattner00950542001-06-06 20:29:01 +0000158 </ol>
Chris Lattner261efe92003-11-25 01:02:51 +0000159 </li>
Chris Lattnerd9ad5b32003-05-08 04:57:36 +0000160 <li><a href="#intrinsics">Intrinsic Functions</a>
Chris Lattnerd9ad5b32003-05-08 04:57:36 +0000161 <ol>
Chris Lattner261efe92003-11-25 01:02:51 +0000162 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
163 <ol>
Reid Spencera3e435f2007-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 Lattner261efe92003-11-25 01:02:51 +0000167 </ol>
168 </li>
Chris Lattnerd7923912004-05-23 21:06:01 +0000169 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
170 <ol>
Reid Spencera3e435f2007-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 Lattnerd7923912004-05-23 21:06:01 +0000174 </ol>
175 </li>
Chris Lattner10610642004-02-14 04:08:35 +0000176 <li><a href="#int_codegen">Code Generator Intrinsics</a>
177 <ol>
Reid Spencera3e435f2007-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 Criswell7123e272004-04-09 16:43:20 +0000185 </ol>
186 </li>
Chris Lattner33aec9e2004-02-12 17:01:32 +0000187 <li><a href="#int_libc">Standard C Library Intrinsics</a>
188 <ol>
Reid Spencera3e435f2007-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 Gohman91c284c2007-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 Lattner33aec9e2004-02-12 17:01:32 +0000197 </ol>
198 </li>
Nate Begeman7e36c472006-01-13 23:26:38 +0000199 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharthec370fd2005-05-03 18:01:48 +0000200 <ol>
Reid Spencera3e435f2007-04-04 02:42:35 +0000201 <li><a href="#int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
Chris Lattner8a886be2006-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 Spencerf86037f2007-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 Lenharthec370fd2005-05-03 18:01:48 +0000207 </ol>
208 </li>
Chris Lattnerd7923912004-05-23 21:06:01 +0000209 <li><a href="#int_debugger">Debugger intrinsics</a></li>
Jim Laskeydd4ef1b2007-03-14 19:31:19 +0000210 <li><a href="#int_eh">Exception Handling intrinsics</a></li>
Duncan Sandsf7331b32007-09-11 14:10:23 +0000211 <li><a href="#int_trampoline">Trampoline Intrinsic</a>
Duncan Sands36397f52007-07-27 12:58:54 +0000212 <ol>
213 <li><a href="#int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a></li>
Duncan Sands36397f52007-07-27 12:58:54 +0000214 </ol>
215 </li>
Andrew Lenharth22c5c1b2008-02-16 01:24:58 +0000216 <li><a href="#int_atomics">Atomic intrinsics</a>
217 <ol>
Andrew Lenharthab0b9492008-02-21 06:45:13 +0000218 <li><a href="#int_memory_barrier"><tt>llvm.memory_barrier</tt></a></li>
219 <li><a href="#int_atomic_lcs"><tt>llvm.atomic.lcs</tt></a></li>
220 <li><a href="#int_atomic_las"><tt>llvm.atomic.las</tt></a></li>
221 <li><a href="#int_atomic_swap"><tt>llvm.atomic.swap</tt></a></li>
Andrew Lenharth22c5c1b2008-02-16 01:24:58 +0000222 </ol>
223 </li>
Reid Spencer20677642007-07-20 19:59:11 +0000224 <li><a href="#int_general">General intrinsics</a>
Tanya Lattner6d806e92007-06-15 20:50:54 +0000225 <ol>
Reid Spencer20677642007-07-20 19:59:11 +0000226 <li><a href="#int_var_annotation">
Tanya Lattner91d0b882007-09-22 00:01:26 +0000227 <tt>llvm.var.annotation</tt>' Intrinsic</a></li>
Tanya Lattnerb6367882007-09-21 22:59:12 +0000228 <li><a href="#int_annotation">
Tanya Lattner91d0b882007-09-22 00:01:26 +0000229 <tt>llvm.annotation.*</tt>' Intrinsic</a></li>
Anton Korobeynikov4cb86182008-01-15 22:31:34 +0000230 <li><a href="#int_trap">
231 <tt>llvm.trap</tt>' Intrinsic</a></li>
Tanya Lattnerb6367882007-09-21 22:59:12 +0000232 </ol>
Tanya Lattner6d806e92007-06-15 20:50:54 +0000233 </li>
Chris Lattner261efe92003-11-25 01:02:51 +0000234 </ol>
235 </li>
Chris Lattner00950542001-06-06 20:29:01 +0000236</ol>
Chris Lattnerd7923912004-05-23 21:06:01 +0000237
238<div class="doc_author">
239 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
240 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
Misha Brukman9d0919f2003-11-08 01:05:38 +0000241</div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000242
Chris Lattner00950542001-06-06 20:29:01 +0000243<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +0000244<div class="doc_section"> <a name="abstract">Abstract </a></div>
245<!-- *********************************************************************** -->
Chris Lattnerd7923912004-05-23 21:06:01 +0000246
Misha Brukman9d0919f2003-11-08 01:05:38 +0000247<div class="doc_text">
Chris Lattner261efe92003-11-25 01:02:51 +0000248<p>This document is a reference manual for the LLVM assembly language.
249LLVM is an SSA based representation that provides type safety,
250low-level operations, flexibility, and the capability of representing
251'all' high-level languages cleanly. It is the common code
252representation used throughout all phases of the LLVM compilation
253strategy.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +0000254</div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000255
Chris Lattner00950542001-06-06 20:29:01 +0000256<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +0000257<div class="doc_section"> <a name="introduction">Introduction</a> </div>
258<!-- *********************************************************************** -->
Chris Lattnerd7923912004-05-23 21:06:01 +0000259
Misha Brukman9d0919f2003-11-08 01:05:38 +0000260<div class="doc_text">
Chris Lattnerd7923912004-05-23 21:06:01 +0000261
Chris Lattner261efe92003-11-25 01:02:51 +0000262<p>The LLVM code representation is designed to be used in three
Gabor Greif04367bf2007-07-06 22:07:22 +0000263different forms: as an in-memory compiler IR, as an on-disk bitcode
Chris Lattner261efe92003-11-25 01:02:51 +0000264representation (suitable for fast loading by a Just-In-Time compiler),
265and as a human readable assembly language representation. This allows
266LLVM to provide a powerful intermediate representation for efficient
267compiler transformations and analysis, while providing a natural means
268to debug and visualize the transformations. The three different forms
269of LLVM are all equivalent. This document describes the human readable
270representation and notation.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +0000271
John Criswellc1f786c2005-05-13 22:25:59 +0000272<p>The LLVM representation aims to be light-weight and low-level
Chris Lattner261efe92003-11-25 01:02:51 +0000273while being expressive, typed, and extensible at the same time. It
274aims to be a "universal IR" of sorts, by being at a low enough level
275that high-level ideas may be cleanly mapped to it (similar to how
276microprocessors are "universal IR's", allowing many source languages to
277be mapped to them). By providing type information, LLVM can be used as
278the target of optimizations: for example, through pointer analysis, it
279can be proven that a C automatic variable is never accessed outside of
280the current function... allowing it to be promoted to a simple SSA
281value instead of a memory location.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +0000282
Misha Brukman9d0919f2003-11-08 01:05:38 +0000283</div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000284
Chris Lattner00950542001-06-06 20:29:01 +0000285<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +0000286<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000287
Misha Brukman9d0919f2003-11-08 01:05:38 +0000288<div class="doc_text">
Chris Lattnerd7923912004-05-23 21:06:01 +0000289
Chris Lattner261efe92003-11-25 01:02:51 +0000290<p>It is important to note that this document describes 'well formed'
291LLVM assembly language. There is a difference between what the parser
292accepts and what is considered 'well formed'. For example, the
293following instruction is syntactically okay, but not well formed:</p>
Chris Lattnerd7923912004-05-23 21:06:01 +0000294
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000295<div class="doc_code">
Chris Lattnerd7923912004-05-23 21:06:01 +0000296<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000297%x = <a href="#i_add">add</a> i32 1, %x
Chris Lattnerd7923912004-05-23 21:06:01 +0000298</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000299</div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000300
Chris Lattner261efe92003-11-25 01:02:51 +0000301<p>...because the definition of <tt>%x</tt> does not dominate all of
302its uses. The LLVM infrastructure provides a verification pass that may
303be used to verify that an LLVM module is well formed. This pass is
John Criswellc1f786c2005-05-13 22:25:59 +0000304automatically run by the parser after parsing input assembly and by
Gabor Greif04367bf2007-07-06 22:07:22 +0000305the optimizer before it outputs bitcode. The violations pointed out
Chris Lattner261efe92003-11-25 01:02:51 +0000306by the verifier pass indicate bugs in transformation passes or input to
307the parser.</p>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000308</div>
Chris Lattnerd7923912004-05-23 21:06:01 +0000309
Chris Lattnercc689392007-10-03 17:34:29 +0000310<!-- Describe the typesetting conventions here. -->
Chris Lattnerd7923912004-05-23 21:06:01 +0000311
Chris Lattner00950542001-06-06 20:29:01 +0000312<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +0000313<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
Chris Lattner00950542001-06-06 20:29:01 +0000314<!-- *********************************************************************** -->
Chris Lattnerd7923912004-05-23 21:06:01 +0000315
Misha Brukman9d0919f2003-11-08 01:05:38 +0000316<div class="doc_text">
Chris Lattnerd7923912004-05-23 21:06:01 +0000317
Reid Spencer2c452282007-08-07 14:34:28 +0000318 <p>LLVM identifiers come in two basic types: global and local. Global
319 identifiers (functions, global variables) begin with the @ character. Local
320 identifiers (register names, types) begin with the % character. Additionally,
321 there are three different formats for identifiers, for different purposes:
Chris Lattnerd7923912004-05-23 21:06:01 +0000322
Chris Lattner00950542001-06-06 20:29:01 +0000323<ol>
Reid Spencer2c452282007-08-07 14:34:28 +0000324 <li>Named values are represented as a string of characters with their prefix.
325 For example, %foo, @DivisionByZero, %a.really.long.identifier. The actual
326 regular expression used is '<tt>[%@][a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
Chris Lattnere5d947b2004-12-09 16:36:40 +0000327 Identifiers which require other characters in their names can be surrounded
Reid Spencer2c452282007-08-07 14:34:28 +0000328 with quotes. In this way, anything except a <tt>&quot;</tt> character can
329 be used in a named value.</li>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000330
Reid Spencer2c452282007-08-07 14:34:28 +0000331 <li>Unnamed values are represented as an unsigned numeric value with their
332 prefix. For example, %12, @2, %44.</li>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000333
Reid Spencercc16dc32004-12-09 18:02:53 +0000334 <li>Constants, which are described in a <a href="#constants">section about
335 constants</a>, below.</li>
Misha Brukman9d0919f2003-11-08 01:05:38 +0000336</ol>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000337
Reid Spencer2c452282007-08-07 14:34:28 +0000338<p>LLVM requires that values start with a prefix for two reasons: Compilers
Chris Lattnere5d947b2004-12-09 16:36:40 +0000339don't need to worry about name clashes with reserved words, and the set of
340reserved words may be expanded in the future without penalty. Additionally,
341unnamed identifiers allow a compiler to quickly come up with a temporary
342variable without having to avoid symbol table conflicts.</p>
343
Chris Lattner261efe92003-11-25 01:02:51 +0000344<p>Reserved words in LLVM are very similar to reserved words in other
Reid Spencer5c0ef472006-11-11 23:08:07 +0000345languages. There are keywords for different opcodes
346('<tt><a href="#i_add">add</a></tt>',
347 '<tt><a href="#i_bitcast">bitcast</a></tt>',
348 '<tt><a href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
Reid Spencerca86e162006-12-31 07:07:53 +0000349href="#t_void">void</a></tt>', '<tt><a href="#t_primitive">i32</a></tt>', etc...),
Chris Lattnere5d947b2004-12-09 16:36:40 +0000350and others. These reserved words cannot conflict with variable names, because
Reid Spencer2c452282007-08-07 14:34:28 +0000351none of them start with a prefix character ('%' or '@').</p>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000352
353<p>Here is an example of LLVM code to multiply the integer variable
354'<tt>%X</tt>' by 8:</p>
355
Misha Brukman9d0919f2003-11-08 01:05:38 +0000356<p>The easy way:</p>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000357
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000358<div class="doc_code">
Chris Lattnere5d947b2004-12-09 16:36:40 +0000359<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000360%result = <a href="#i_mul">mul</a> i32 %X, 8
Chris Lattnere5d947b2004-12-09 16:36:40 +0000361</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000362</div>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000363
Misha Brukman9d0919f2003-11-08 01:05:38 +0000364<p>After strength reduction:</p>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000365
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000366<div class="doc_code">
Chris Lattnere5d947b2004-12-09 16:36:40 +0000367<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000368%result = <a href="#i_shl">shl</a> i32 %X, i8 3
Chris Lattnere5d947b2004-12-09 16:36:40 +0000369</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000370</div>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000371
Misha Brukman9d0919f2003-11-08 01:05:38 +0000372<p>And the hard way:</p>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000373
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000374<div class="doc_code">
Chris Lattnere5d947b2004-12-09 16:36:40 +0000375<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000376<a href="#i_add">add</a> i32 %X, %X <i>; yields {i32}:%0</i>
377<a href="#i_add">add</a> i32 %0, %0 <i>; yields {i32}:%1</i>
378%result = <a href="#i_add">add</a> i32 %1, %1
Chris Lattnere5d947b2004-12-09 16:36:40 +0000379</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000380</div>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000381
Chris Lattner261efe92003-11-25 01:02:51 +0000382<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
383important lexical features of LLVM:</p>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000384
Chris Lattner00950542001-06-06 20:29:01 +0000385<ol>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000386
387 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
388 line.</li>
389
390 <li>Unnamed temporaries are created when the result of a computation is not
391 assigned to a named value.</li>
392
Misha Brukman9d0919f2003-11-08 01:05:38 +0000393 <li>Unnamed temporaries are numbered sequentially</li>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000394
Misha Brukman9d0919f2003-11-08 01:05:38 +0000395</ol>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000396
John Criswelle4c57cc2005-05-12 16:52:32 +0000397<p>...and it also shows a convention that we follow in this document. When
Chris Lattnere5d947b2004-12-09 16:36:40 +0000398demonstrating instructions, we will follow an instruction with a comment that
399defines the type and name of value produced. Comments are shown in italic
400text.</p>
401
Misha Brukman9d0919f2003-11-08 01:05:38 +0000402</div>
Chris Lattnerfa730212004-12-09 16:11:40 +0000403
404<!-- *********************************************************************** -->
405<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
406<!-- *********************************************************************** -->
407
408<!-- ======================================================================= -->
409<div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
410</div>
411
412<div class="doc_text">
413
414<p>LLVM programs are composed of "Module"s, each of which is a
415translation unit of the input programs. Each module consists of
416functions, global variables, and symbol table entries. Modules may be
417combined together with the LLVM linker, which merges function (and
418global variable) definitions, resolves forward declarations, and merges
419symbol table entries. Here is an example of the "hello world" module:</p>
420
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000421<div class="doc_code">
Chris Lattnerfa730212004-12-09 16:11:40 +0000422<pre><i>; Declare the string constant as a global constant...</i>
Chris Lattnera89e5f12007-06-12 17:00:26 +0000423<a href="#identifiers">@.LC0</a> = <a href="#linkage_internal">internal</a> <a
424 href="#globalvars">constant</a> <a href="#t_array">[13 x i8]</a> c"hello world\0A\00" <i>; [13 x i8]*</i>
Chris Lattnerfa730212004-12-09 16:11:40 +0000425
426<i>; External declaration of the puts function</i>
Chris Lattnera89e5f12007-06-12 17:00:26 +0000427<a href="#functionstructure">declare</a> i32 @puts(i8 *) <i>; i32(i8 *)* </i>
Chris Lattnerfa730212004-12-09 16:11:40 +0000428
429<i>; Definition of main function</i>
Chris Lattnera89e5f12007-06-12 17:00:26 +0000430define i32 @main() { <i>; i32()* </i>
Reid Spencerca86e162006-12-31 07:07:53 +0000431 <i>; Convert [13x i8 ]* to i8 *...</i>
Chris Lattnerfa730212004-12-09 16:11:40 +0000432 %cast210 = <a
Chris Lattner6c0955b2007-06-12 17:01:15 +0000433 href="#i_getelementptr">getelementptr</a> [13 x i8 ]* @.LC0, i64 0, i64 0 <i>; i8 *</i>
Chris Lattnerfa730212004-12-09 16:11:40 +0000434
435 <i>; Call puts function to write out the string to stdout...</i>
436 <a
Chris Lattnera89e5f12007-06-12 17:00:26 +0000437 href="#i_call">call</a> i32 @puts(i8 * %cast210) <i>; i32</i>
Chris Lattnerfa730212004-12-09 16:11:40 +0000438 <a
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000439 href="#i_ret">ret</a> i32 0<br>}<br>
440</pre>
441</div>
Chris Lattnerfa730212004-12-09 16:11:40 +0000442
443<p>This example is made up of a <a href="#globalvars">global variable</a>
444named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
445function, and a <a href="#functionstructure">function definition</a>
446for "<tt>main</tt>".</p>
447
Chris Lattnere5d947b2004-12-09 16:36:40 +0000448<p>In general, a module is made up of a list of global values,
449where both functions and global variables are global values. Global values are
450represented by a pointer to a memory location (in this case, a pointer to an
451array of char, and a pointer to a function), and have one of the following <a
452href="#linkage">linkage types</a>.</p>
Chris Lattnerfa730212004-12-09 16:11:40 +0000453
Chris Lattnere5d947b2004-12-09 16:36:40 +0000454</div>
455
456<!-- ======================================================================= -->
457<div class="doc_subsection">
458 <a name="linkage">Linkage Types</a>
459</div>
460
461<div class="doc_text">
462
463<p>
464All Global Variables and Functions have one of the following types of linkage:
465</p>
Chris Lattnerfa730212004-12-09 16:11:40 +0000466
467<dl>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000468
Chris Lattnerfa730212004-12-09 16:11:40 +0000469 <dt><tt><b><a name="linkage_internal">internal</a></b></tt> </dt>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000470
471 <dd>Global values with internal linkage are only directly accessible by
472 objects in the current module. In particular, linking code into a module with
473 an internal global value may cause the internal to be renamed as necessary to
474 avoid collisions. Because the symbol is internal to the module, all
475 references can be updated. This corresponds to the notion of the
Chris Lattner4887bd82007-01-14 06:51:48 +0000476 '<tt>static</tt>' keyword in C.
Chris Lattnerfa730212004-12-09 16:11:40 +0000477 </dd>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000478
Chris Lattnerfa730212004-12-09 16:11:40 +0000479 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000480
Chris Lattner4887bd82007-01-14 06:51:48 +0000481 <dd>Globals with "<tt>linkonce</tt>" linkage are merged with other globals of
482 the same name when linkage occurs. This is typically used to implement
483 inline functions, templates, or other code which must be generated in each
484 translation unit that uses it. Unreferenced <tt>linkonce</tt> globals are
485 allowed to be discarded.
Chris Lattnerfa730212004-12-09 16:11:40 +0000486 </dd>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000487
Chris Lattnerfa730212004-12-09 16:11:40 +0000488 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000489
490 <dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt> linkage,
491 except that unreferenced <tt>weak</tt> globals may not be discarded. This is
Chris Lattner4887bd82007-01-14 06:51:48 +0000492 used for globals that may be emitted in multiple translation units, but that
493 are not guaranteed to be emitted into every translation unit that uses them.
494 One example of this are common globals in C, such as "<tt>int X;</tt>" at
495 global scope.
Chris Lattnerfa730212004-12-09 16:11:40 +0000496 </dd>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000497
Chris Lattnerfa730212004-12-09 16:11:40 +0000498 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000499
500 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
501 pointer to array type. When two global variables with appending linkage are
502 linked together, the two global arrays are appended together. This is the
503 LLVM, typesafe, equivalent of having the system linker append together
504 "sections" with identical names when .o files are linked.
Chris Lattnerfa730212004-12-09 16:11:40 +0000505 </dd>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000506
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000507 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
508 <dd>The semantics of this linkage follow the ELF model: the symbol is weak
509 until linked, if not linked, the symbol becomes null instead of being an
510 undefined reference.
511 </dd>
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000512
Chris Lattnerfa730212004-12-09 16:11:40 +0000513 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
Chris Lattnere5d947b2004-12-09 16:36:40 +0000514
515 <dd>If none of the above identifiers are used, the global is externally
516 visible, meaning that it participates in linkage and can be used to resolve
517 external symbol references.
Chris Lattnerfa730212004-12-09 16:11:40 +0000518 </dd>
Reid Spencerc8910842007-04-11 23:49:50 +0000519</dl>
Anton Korobeynikovb74ed072006-09-14 18:23:27 +0000520
Anton Korobeynikovb74ed072006-09-14 18:23:27 +0000521 <p>
522 The next two types of linkage are targeted for Microsoft Windows platform
523 only. They are designed to support importing (exporting) symbols from (to)
524 DLLs.
525 </p>
526
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000527 <dl>
Anton Korobeynikovb74ed072006-09-14 18:23:27 +0000528 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
529
530 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
531 or variable via a global pointer to a pointer that is set up by the DLL
532 exporting the symbol. On Microsoft Windows targets, the pointer name is
533 formed by combining <code>_imp__</code> and the function or variable name.
534 </dd>
535
536 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
537
538 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
539 pointer to a pointer in a DLL, so that it can be referenced with the
540 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
541 name is formed by combining <code>_imp__</code> and the function or variable
542 name.
543 </dd>
544
Chris Lattnerfa730212004-12-09 16:11:40 +0000545</dl>
546
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000547<p><a name="linkage_external"></a>For example, since the "<tt>.LC0</tt>"
Chris Lattnerfa730212004-12-09 16:11:40 +0000548variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
549variable and was linked with this one, one of the two would be renamed,
550preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
551external (i.e., lacking any linkage declarations), they are accessible
Reid Spencerac8d2762007-01-05 00:59:10 +0000552outside of the current module.</p>
553<p>It is illegal for a function <i>declaration</i>
554to have any linkage type other than "externally visible", <tt>dllimport</tt>,
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000555or <tt>extern_weak</tt>.</p>
Anton Korobeynikov8b0a8c82007-04-25 14:27:10 +0000556<p>Aliases can have only <tt>external</tt>, <tt>internal</tt> and <tt>weak</tt>
557linkages.
Chris Lattnerfa730212004-12-09 16:11:40 +0000558</div>
559
560<!-- ======================================================================= -->
561<div class="doc_subsection">
Chris Lattnerbad10ee2005-05-06 22:57:40 +0000562 <a name="callingconv">Calling Conventions</a>
563</div>
564
565<div class="doc_text">
566
567<p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
568and <a href="#i_invoke">invokes</a> can all have an optional calling convention
569specified for the call. The calling convention of any pair of dynamic
570caller/callee must match, or the behavior of the program is undefined. The
571following calling conventions are supported by LLVM, and more may be added in
572the future:</p>
573
574<dl>
575 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
576
577 <dd>This calling convention (the default if no other calling convention is
578 specified) matches the target C calling conventions. This calling convention
John Criswelle4c57cc2005-05-12 16:52:32 +0000579 supports varargs function calls and tolerates some mismatch in the declared
Reid Spencerc28d2bc2006-12-31 21:30:18 +0000580 prototype and implemented declaration of the function (as does normal C).
Chris Lattnerbad10ee2005-05-06 22:57:40 +0000581 </dd>
582
583 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
584
585 <dd>This calling convention attempts to make calls as fast as possible
586 (e.g. by passing things in registers). This calling convention allows the
587 target to use whatever tricks it wants to produce fast code for the target,
Chris Lattner8cdc5bc2005-05-06 23:08:23 +0000588 without having to conform to an externally specified ABI. Implementations of
Arnold Schwaighofer9097d142008-05-14 09:17:12 +0000589 this convention should allow arbitrary
590 <a href="CodeGenerator.html#tailcallopt">tail call optimization</a> to be
591 supported. This calling convention does not support varargs and requires the
592 prototype of all callees to exactly match the prototype of the function
593 definition.
Chris Lattnerbad10ee2005-05-06 22:57:40 +0000594 </dd>
595
596 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
597
598 <dd>This calling convention attempts to make code in the caller as efficient
599 as possible under the assumption that the call is not commonly executed. As
600 such, these calls often preserve all registers so that the call does not break
601 any live ranges in the caller side. This calling convention does not support
602 varargs and requires the prototype of all callees to exactly match the
603 prototype of the function definition.
604 </dd>
605
Chris Lattnercfe6b372005-05-07 01:46:40 +0000606 <dt><b>"<tt>cc &lt;<em>n</em>&gt;</tt>" - Numbered convention</b>:</dt>
Chris Lattnerbad10ee2005-05-06 22:57:40 +0000607
608 <dd>Any calling convention may be specified by number, allowing
609 target-specific calling conventions to be used. Target specific calling
610 conventions start at 64.
611 </dd>
Chris Lattnercfe6b372005-05-07 01:46:40 +0000612</dl>
Chris Lattnerbad10ee2005-05-06 22:57:40 +0000613
614<p>More calling conventions can be added/defined on an as-needed basis, to
615support pascal conventions or any other well-known target-independent
616convention.</p>
617
618</div>
619
620<!-- ======================================================================= -->
621<div class="doc_subsection">
Anton Korobeynikov8cea37b2007-01-23 12:35:46 +0000622 <a name="visibility">Visibility Styles</a>
623</div>
624
625<div class="doc_text">
626
627<p>
628All Global Variables and Functions have one of the following visibility styles:
629</p>
630
631<dl>
632 <dt><b>"<tt>default</tt>" - Default style</b>:</dt>
633
634 <dd>On ELF, default visibility means that the declaration is visible to other
635 modules and, in shared libraries, means that the declared entity may be
636 overridden. On Darwin, default visibility means that the declaration is
637 visible to other modules. Default visibility corresponds to "external
638 linkage" in the language.
639 </dd>
640
641 <dt><b>"<tt>hidden</tt>" - Hidden style</b>:</dt>
642
643 <dd>Two declarations of an object with hidden visibility refer to the same
644 object if they are in the same shared object. Usually, hidden visibility
645 indicates that the symbol will not be placed into the dynamic symbol table,
646 so no other module (executable or shared library) can reference it
647 directly.
648 </dd>
649
Anton Korobeynikov6f9896f2007-04-29 18:35:00 +0000650 <dt><b>"<tt>protected</tt>" - Protected style</b>:</dt>
651
652 <dd>On ELF, protected visibility indicates that the symbol will be placed in
653 the dynamic symbol table, but that references within the defining module will
654 bind to the local symbol. That is, the symbol cannot be overridden by another
655 module.
656 </dd>
Anton Korobeynikov8cea37b2007-01-23 12:35:46 +0000657</dl>
658
659</div>
660
661<!-- ======================================================================= -->
662<div class="doc_subsection">
Chris Lattnerfa730212004-12-09 16:11:40 +0000663 <a name="globalvars">Global Variables</a>
664</div>
665
666<div class="doc_text">
667
Chris Lattner3689a342005-02-12 19:30:21 +0000668<p>Global variables define regions of memory allocated at compilation time
Chris Lattner88f6c462005-11-12 00:45:07 +0000669instead of run-time. Global variables may optionally be initialized, may have
Anton Korobeynikov8b0a8c82007-04-25 14:27:10 +0000670an explicit section to be placed in, and may have an optional explicit alignment
671specified. A variable may be defined as "thread_local", which means that it
672will not be shared by threads (each thread will have a separated copy of the
673variable). A variable may be defined as a global "constant," which indicates
674that the contents of the variable will <b>never</b> be modified (enabling better
Chris Lattner3689a342005-02-12 19:30:21 +0000675optimization, allowing the global data to be placed in the read-only section of
676an executable, etc). Note that variables that need runtime initialization
John Criswell0ec250c2005-10-24 16:17:18 +0000677cannot be marked "constant" as there is a store to the variable.</p>
Chris Lattner3689a342005-02-12 19:30:21 +0000678
679<p>
680LLVM explicitly allows <em>declarations</em> of global variables to be marked
681constant, even if the final definition of the global is not. This capability
682can be used to enable slightly better optimization of the program, but requires
683the language definition to guarantee that optimizations based on the
684'constantness' are valid for the translation units that do not include the
685definition.
686</p>
Chris Lattnerfa730212004-12-09 16:11:40 +0000687
688<p>As SSA values, global variables define pointer values that are in
689scope (i.e. they dominate) all basic blocks in the program. Global
690variables always define a pointer to their "content" type because they
691describe a region of memory, and all memory objects in LLVM are
692accessed through pointers.</p>
693
Christopher Lamb284d9922007-12-11 09:31:00 +0000694<p>A global variable may be declared to reside in a target-specifc numbered
695address space. For targets that support them, address spaces may affect how
696optimizations are performed and/or what target instructions are used to access
Christopher Lambd49e18d2007-12-12 08:44:39 +0000697the variable. The default address space is zero. The address space qualifier
698must precede any other attributes.</p>
Christopher Lamb284d9922007-12-11 09:31:00 +0000699
Chris Lattner88f6c462005-11-12 00:45:07 +0000700<p>LLVM allows an explicit section to be specified for globals. If the target
701supports it, it will emit globals to the section specified.</p>
702
Chris Lattner2cbdc452005-11-06 08:02:57 +0000703<p>An explicit alignment may be specified for a global. If not present, or if
704the alignment is set to zero, the alignment of the global is set by the target
705to whatever it feels convenient. If an explicit alignment is specified, the
706global is forced to have at least that much alignment. All alignments must be
707a power of 2.</p>
708
Christopher Lamb284d9922007-12-11 09:31:00 +0000709<p>For example, the following defines a global in a numbered address space with
710an initializer, section, and alignment:</p>
Chris Lattner68027ea2007-01-14 00:27:09 +0000711
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000712<div class="doc_code">
Chris Lattner68027ea2007-01-14 00:27:09 +0000713<pre>
Christopher Lamb284d9922007-12-11 09:31:00 +0000714@G = constant float 1.0 addrspace(5), section "foo", align 4
Chris Lattner68027ea2007-01-14 00:27:09 +0000715</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000716</div>
Chris Lattner68027ea2007-01-14 00:27:09 +0000717
Chris Lattnerfa730212004-12-09 16:11:40 +0000718</div>
719
720
721<!-- ======================================================================= -->
722<div class="doc_subsection">
723 <a name="functionstructure">Functions</a>
724</div>
725
726<div class="doc_text">
727
Reid Spencerca86e162006-12-31 07:07:53 +0000728<p>LLVM function definitions consist of the "<tt>define</tt>" keyord,
729an optional <a href="#linkage">linkage type</a>, an optional
Anton Korobeynikov8cea37b2007-01-23 12:35:46 +0000730<a href="#visibility">visibility style</a>, an optional
Reid Spencerca86e162006-12-31 07:07:53 +0000731<a href="#callingconv">calling convention</a>, a return type, an optional
732<a href="#paramattrs">parameter attribute</a> for the return type, a function
733name, a (possibly empty) argument list (each with optional
Anton Korobeynikov8cea37b2007-01-23 12:35:46 +0000734<a href="#paramattrs">parameter attributes</a>), an optional section, an
Gordon Henriksene754abe2007-12-10 03:30:21 +0000735optional alignment, an optional <a href="#gc">garbage collector name</a>, an
Gordon Henriksen80a75bf2007-12-10 03:18:06 +0000736opening curly brace, a list of basic blocks, and a closing curly brace.
Anton Korobeynikov8cea37b2007-01-23 12:35:46 +0000737
738LLVM function declarations consist of the "<tt>declare</tt>" keyword, an
739optional <a href="#linkage">linkage type</a>, an optional
740<a href="#visibility">visibility style</a>, an optional
741<a href="#callingconv">calling convention</a>, a return type, an optional
Reid Spencerca86e162006-12-31 07:07:53 +0000742<a href="#paramattrs">parameter attribute</a> for the return type, a function
Gordon Henriksen80a75bf2007-12-10 03:18:06 +0000743name, a possibly empty list of arguments, an optional alignment, and an optional
Gordon Henriksene754abe2007-12-10 03:30:21 +0000744<a href="#gc">garbage collector name</a>.</p>
Chris Lattnerfa730212004-12-09 16:11:40 +0000745
746<p>A function definition contains a list of basic blocks, forming the CFG for
747the function. Each basic block may optionally start with a label (giving the
748basic block a symbol table entry), contains a list of instructions, and ends
749with a <a href="#terminators">terminator</a> instruction (such as a branch or
750function return).</p>
751
Chris Lattner4a3c9012007-06-08 16:52:14 +0000752<p>The first basic block in a function is special in two ways: it is immediately
Chris Lattnerfa730212004-12-09 16:11:40 +0000753executed on entrance to the function, and it is not allowed to have predecessor
754basic blocks (i.e. there can not be any branches to the entry block of a
755function). Because the block can have no predecessors, it also cannot have any
756<a href="#i_phi">PHI nodes</a>.</p>
757
Chris Lattner88f6c462005-11-12 00:45:07 +0000758<p>LLVM allows an explicit section to be specified for functions. If the target
759supports it, it will emit functions to the section specified.</p>
760
Chris Lattner2cbdc452005-11-06 08:02:57 +0000761<p>An explicit alignment may be specified for a function. If not present, or if
762the alignment is set to zero, the alignment of the function is set by the target
763to whatever it feels convenient. If an explicit alignment is specified, the
764function is forced to have at least that much alignment. All alignments must be
765a power of 2.</p>
766
Chris Lattnerfa730212004-12-09 16:11:40 +0000767</div>
768
Anton Korobeynikov8b0a8c82007-04-25 14:27:10 +0000769
770<!-- ======================================================================= -->
771<div class="doc_subsection">
772 <a name="aliasstructure">Aliases</a>
773</div>
774<div class="doc_text">
775 <p>Aliases act as "second name" for the aliasee value (which can be either
Anton Korobeynikov726d45c2008-03-22 08:36:14 +0000776 function, global variable, another alias or bitcast of global value). Aliases
777 may have an optional <a href="#linkage">linkage type</a>, and an
Anton Korobeynikov8b0a8c82007-04-25 14:27:10 +0000778 optional <a href="#visibility">visibility style</a>.</p>
779
780 <h5>Syntax:</h5>
781
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000782<div class="doc_code">
Bill Wendlingaac388b2007-05-29 09:42:13 +0000783<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000784@&lt;Name&gt; = [Linkage] [Visibility] alias &lt;AliaseeTy&gt; @&lt;Aliasee&gt;
Bill Wendlingaac388b2007-05-29 09:42:13 +0000785</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000786</div>
Anton Korobeynikov8b0a8c82007-04-25 14:27:10 +0000787
788</div>
789
790
791
Chris Lattner4e9aba72006-01-23 23:23:47 +0000792<!-- ======================================================================= -->
Reid Spencerca86e162006-12-31 07:07:53 +0000793<div class="doc_subsection"><a name="paramattrs">Parameter Attributes</a></div>
794<div class="doc_text">
795 <p>The return type and each parameter of a function type may have a set of
796 <i>parameter attributes</i> associated with them. Parameter attributes are
797 used to communicate additional information about the result or parameters of
Duncan Sandsdc024672007-11-27 13:23:08 +0000798 a function. Parameter attributes are considered to be part of the function,
799 not of the function type, so functions with different parameter attributes
800 can have the same function type.</p>
Reid Spencerca86e162006-12-31 07:07:53 +0000801
Reid Spencer950e9f82007-01-15 18:27:39 +0000802 <p>Parameter attributes are simple keywords that follow the type specified. If
803 multiple parameter attributes are needed, they are space separated. For
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000804 example:</p>
805
806<div class="doc_code">
807<pre>
Duncan Sandsdc024672007-11-27 13:23:08 +0000808declare i32 @printf(i8* noalias , ...) nounwind
809declare i32 @atoi(i8*) nounwind readonly
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000810</pre>
811</div>
812
Duncan Sandsdc024672007-11-27 13:23:08 +0000813 <p>Note that any attributes for the function result (<tt>nounwind</tt>,
814 <tt>readonly</tt>) come immediately after the argument list.</p>
Reid Spencerca86e162006-12-31 07:07:53 +0000815
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000816 <p>Currently, only the following parameter attributes are defined:</p>
Reid Spencerca86e162006-12-31 07:07:53 +0000817 <dl>
Reid Spencer9445e9a2007-07-19 23:13:04 +0000818 <dt><tt>zeroext</tt></dt>
Reid Spencerca86e162006-12-31 07:07:53 +0000819 <dd>This indicates that the parameter should be zero extended just before
820 a call to this function.</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000821
Reid Spencer9445e9a2007-07-19 23:13:04 +0000822 <dt><tt>signext</tt></dt>
Reid Spencerca86e162006-12-31 07:07:53 +0000823 <dd>This indicates that the parameter should be sign extended just before
824 a call to this function.</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000825
Anton Korobeynikov34d6dea2007-01-28 14:30:45 +0000826 <dt><tt>inreg</tt></dt>
827 <dd>This indicates that the parameter should be placed in register (if
Anton Korobeynikov66a8c8c2007-01-28 15:27:21 +0000828 possible) during assembling function call. Support for this attribute is
829 target-specific</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000830
831 <dt><tt>byval</tt></dt>
Chris Lattner0747baa2008-01-15 04:34:22 +0000832 <dd>This indicates that the pointer parameter should really be passed by
833 value to the function. The attribute implies that a hidden copy of the
834 pointee is made between the caller and the callee, so the callee is unable
835 to modify the value in the callee. This attribute is only valid on llvm
836 pointer arguments. It is generally used to pass structs and arrays by
837 value, but is also valid on scalars (even though this is silly).</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000838
Anton Korobeynikov34d6dea2007-01-28 14:30:45 +0000839 <dt><tt>sret</tt></dt>
Duncan Sandse26dec62008-02-18 04:19:38 +0000840 <dd>This indicates that the pointer parameter specifies the address of a
841 structure that is the return value of the function in the source program.
Duncan Sandsb7f0c082008-03-17 12:17:41 +0000842 Loads and stores to the structure are assumed not to trap.
Duncan Sandse26dec62008-02-18 04:19:38 +0000843 May only be applied to the first parameter.</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000844
Zhou Shengfebca342007-06-05 05:28:26 +0000845 <dt><tt>noalias</tt></dt>
Owen Anderson117bbd32008-02-18 04:09:01 +0000846 <dd>This indicates that the parameter does not alias any global or any other
847 parameter. The caller is responsible for ensuring that this is the case,
848 usually by placing the value in a stack allocation.</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000849
Reid Spencer2dc52012007-03-22 02:18:56 +0000850 <dt><tt>noreturn</tt></dt>
851 <dd>This function attribute indicates that the function never returns. This
852 indicates to LLVM that every call to this function should be treated as if
853 an <tt>unreachable</tt> instruction immediately followed the call.</dd>
Chris Lattner47507de2008-01-11 06:20:47 +0000854
Reid Spencer67606122007-03-22 02:02:11 +0000855 <dt><tt>nounwind</tt></dt>
Duncan Sandsb7f0c082008-03-17 12:17:41 +0000856 <dd>This function attribute indicates that no exceptions unwind out of the
857 function. Usually this is because the function makes no use of exceptions,
858 but it may also be that the function catches any exceptions thrown when
859 executing it.</dd>
860
Duncan Sands50f19f52007-07-27 19:57:41 +0000861 <dt><tt>nest</tt></dt>
862 <dd>This indicates that the parameter can be excised using the
863 <a href="#int_trampoline">trampoline intrinsics</a>.</dd>
Duncan Sandsed4a2f12007-11-22 20:23:04 +0000864 <dt><tt>readonly</tt></dt>
Duncan Sandsf04d5842007-11-14 21:14:02 +0000865 <dd>This function attribute indicates that the function has no side-effects
Duncan Sandsed4a2f12007-11-22 20:23:04 +0000866 except for producing a return value or throwing an exception. The value
867 returned must only depend on the function arguments and/or global variables.
868 It may use values obtained by dereferencing pointers.</dd>
869 <dt><tt>readnone</tt></dt>
870 <dd>A <tt>readnone</tt> function has the same restrictions as a <tt>readonly</tt>
Duncan Sandsf04d5842007-11-14 21:14:02 +0000871 function, but in addition it is not allowed to dereference any pointer arguments
872 or global variables.
Anton Korobeynikov7f705592007-01-12 19:20:47 +0000873 </dl>
Reid Spencerca86e162006-12-31 07:07:53 +0000874
Reid Spencerca86e162006-12-31 07:07:53 +0000875</div>
876
877<!-- ======================================================================= -->
Chris Lattner4e9aba72006-01-23 23:23:47 +0000878<div class="doc_subsection">
Gordon Henriksen80a75bf2007-12-10 03:18:06 +0000879 <a name="gc">Garbage Collector Names</a>
880</div>
881
882<div class="doc_text">
883<p>Each function may specify a garbage collector name, which is simply a
884string.</p>
885
886<div class="doc_code"><pre
887>define void @f() gc "name" { ...</pre></div>
888
889<p>The compiler declares the supported values of <i>name</i>. Specifying a
890collector which will cause the compiler to alter its output in order to support
891the named garbage collection algorithm.</p>
892</div>
893
894<!-- ======================================================================= -->
895<div class="doc_subsection">
Chris Lattner1eeeb0c2006-04-08 04:40:53 +0000896 <a name="moduleasm">Module-Level Inline Assembly</a>
Chris Lattner4e9aba72006-01-23 23:23:47 +0000897</div>
898
899<div class="doc_text">
900<p>
901Modules may contain "module-level inline asm" blocks, which corresponds to the
902GCC "file scope inline asm" blocks. These blocks are internally concatenated by
903LLVM and treated as a single unit, but may be separated in the .ll file if
904desired. The syntax is very simple:
905</p>
906
Bill Wendling2f7a8b02007-05-29 09:04:49 +0000907<div class="doc_code">
908<pre>
909module asm "inline asm code goes here"
910module asm "more can go here"
911</pre>
912</div>
Chris Lattner4e9aba72006-01-23 23:23:47 +0000913
914<p>The strings can contain any character by escaping non-printable characters.
915 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
916 for the number.
917</p>
918
919<p>
920 The inline asm code is simply printed to the machine code .s file when
921 assembly code is generated.
922</p>
923</div>
Chris Lattnerfa730212004-12-09 16:11:40 +0000924
Reid Spencerde151942007-02-19 23:54:10 +0000925<!-- ======================================================================= -->
926<div class="doc_subsection">
927 <a name="datalayout">Data Layout</a>
928</div>
929
930<div class="doc_text">
931<p>A module may specify a target specific data layout string that specifies how
Reid Spencerc8910842007-04-11 23:49:50 +0000932data is to be laid out in memory. The syntax for the data layout is simply:</p>
933<pre> target datalayout = "<i>layout specification</i>"</pre>
934<p>The <i>layout specification</i> consists of a list of specifications
935separated by the minus sign character ('-'). Each specification starts with a
936letter and may include other information after the letter to define some
937aspect of the data layout. The specifications accepted are as follows: </p>
Reid Spencerde151942007-02-19 23:54:10 +0000938<dl>
939 <dt><tt>E</tt></dt>
940 <dd>Specifies that the target lays out data in big-endian form. That is, the
941 bits with the most significance have the lowest address location.</dd>
942 <dt><tt>e</tt></dt>
943 <dd>Specifies that hte target lays out data in little-endian form. That is,
944 the bits with the least significance have the lowest address location.</dd>
945 <dt><tt>p:<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
946 <dd>This specifies the <i>size</i> of a pointer and its <i>abi</i> and
947 <i>preferred</i> alignments. All sizes are in bits. Specifying the <i>pref</i>
948 alignment is optional. If omitted, the preceding <tt>:</tt> should be omitted
949 too.</dd>
950 <dt><tt>i<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
951 <dd>This specifies the alignment for an integer type of a given bit
952 <i>size</i>. The value of <i>size</i> must be in the range [1,2^23).</dd>
953 <dt><tt>v<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
954 <dd>This specifies the alignment for a vector type of a given bit
955 <i>size</i>.</dd>
956 <dt><tt>f<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
957 <dd>This specifies the alignment for a floating point type of a given bit
958 <i>size</i>. The value of <i>size</i> must be either 32 (float) or 64
959 (double).</dd>
960 <dt><tt>a<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
961 <dd>This specifies the alignment for an aggregate type of a given bit
962 <i>size</i>.</dd>
963</dl>
964<p>When constructing the data layout for a given target, LLVM starts with a
965default set of specifications which are then (possibly) overriden by the
966specifications in the <tt>datalayout</tt> keyword. The default specifications
967are given in this list:</p>
968<ul>
969 <li><tt>E</tt> - big endian</li>
970 <li><tt>p:32:64:64</tt> - 32-bit pointers with 64-bit alignment</li>
971 <li><tt>i1:8:8</tt> - i1 is 8-bit (byte) aligned</li>
972 <li><tt>i8:8:8</tt> - i8 is 8-bit (byte) aligned</li>
973 <li><tt>i16:16:16</tt> - i16 is 16-bit aligned</li>
974 <li><tt>i32:32:32</tt> - i32 is 32-bit aligned</li>
975 <li><tt>i64:32:64</tt> - i64 has abi alignment of 32-bits but preferred
976 alignment of 64-bits</li>
977 <li><tt>f32:32:32</tt> - float is 32-bit aligned</li>
978 <li><tt>f64:64:64</tt> - double is 64-bit aligned</li>
979 <li><tt>v64:64:64</tt> - 64-bit vector is 64-bit aligned</li>
980 <li><tt>v128:128:128</tt> - 128-bit vector is 128-bit aligned</li>
981 <li><tt>a0:0:1</tt> - aggregates are 8-bit aligned</li>
982</ul>
983<p>When llvm is determining the alignment for a given type, it uses the
984following rules:
985<ol>
986 <li>If the type sought is an exact match for one of the specifications, that
987 specification is used.</li>
988 <li>If no match is found, and the type sought is an integer type, then the
989 smallest integer type that is larger than the bitwidth of the sought type is
990 used. If none of the specifications are larger than the bitwidth then the the
991 largest integer type is used. For example, given the default specifications
992 above, the i7 type will use the alignment of i8 (next largest) while both
993 i65 and i256 will use the alignment of i64 (largest specified).</li>
994 <li>If no match is found, and the type sought is a vector type, then the
995 largest vector type that is smaller than the sought vector type will be used
996 as a fall back. This happens because <128 x double> can be implemented in
997 terms of 64 <2 x double>, for example.</li>
998</ol>
999</div>
Chris Lattnerfa730212004-12-09 16:11:40 +00001000
Chris Lattner00950542001-06-06 20:29:01 +00001001<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +00001002<div class="doc_section"> <a name="typesystem">Type System</a> </div>
1003<!-- *********************************************************************** -->
Chris Lattnerfa730212004-12-09 16:11:40 +00001004
Misha Brukman9d0919f2003-11-08 01:05:38 +00001005<div class="doc_text">
Chris Lattnerfa730212004-12-09 16:11:40 +00001006
Misha Brukman9d0919f2003-11-08 01:05:38 +00001007<p>The LLVM type system is one of the most important features of the
Chris Lattner261efe92003-11-25 01:02:51 +00001008intermediate representation. Being typed enables a number of
1009optimizations to be performed on the IR directly, without having to do
1010extra analyses on the side before the transformation. A strong type
1011system makes it easier to read the generated code and enables novel
1012analyses and transformations that are not feasible to perform on normal
1013three address code representations.</p>
Chris Lattnerfa730212004-12-09 16:11:40 +00001014
1015</div>
1016
Chris Lattner00950542001-06-06 20:29:01 +00001017<!-- ======================================================================= -->
Chris Lattner4f69f462008-01-04 04:32:38 +00001018<div class="doc_subsection"> <a name="t_classifications">Type
Chris Lattner261efe92003-11-25 01:02:51 +00001019Classifications</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001020<div class="doc_text">
Chris Lattner4f69f462008-01-04 04:32:38 +00001021<p>The types fall into a few useful
Chris Lattner261efe92003-11-25 01:02:51 +00001022classifications:</p>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00001023
1024<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner261efe92003-11-25 01:02:51 +00001025 <tbody>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001026 <tr><th>Classification</th><th>Types</th></tr>
Chris Lattner261efe92003-11-25 01:02:51 +00001027 <tr>
Chris Lattner4f69f462008-01-04 04:32:38 +00001028 <td><a href="#t_integer">integer</a></td>
Reid Spencer2b916312007-05-16 18:44:01 +00001029 <td><tt>i1, i2, i3, ... i8, ... i16, ... i32, ... i64, ... </tt></td>
Chris Lattner261efe92003-11-25 01:02:51 +00001030 </tr>
1031 <tr>
Chris Lattner4f69f462008-01-04 04:32:38 +00001032 <td><a href="#t_floating">floating point</a></td>
1033 <td><tt>float, double, x86_fp80, fp128, ppc_fp128</tt></td>
Chris Lattner261efe92003-11-25 01:02:51 +00001034 </tr>
1035 <tr>
1036 <td><a name="t_firstclass">first class</a></td>
Chris Lattner4f69f462008-01-04 04:32:38 +00001037 <td><a href="#t_integer">integer</a>,
1038 <a href="#t_floating">floating point</a>,
1039 <a href="#t_pointer">pointer</a>,
1040 <a href="#t_vector">vector</a>
Dan Gohmana334d5f2008-05-12 23:51:09 +00001041 <a href="#t_struct">structure</a>,
1042 <a href="#t_array">array</a>,
Reid Spencerca86e162006-12-31 07:07:53 +00001043 </td>
Chris Lattner261efe92003-11-25 01:02:51 +00001044 </tr>
Chris Lattner4f69f462008-01-04 04:32:38 +00001045 <tr>
1046 <td><a href="#t_primitive">primitive</a></td>
1047 <td><a href="#t_label">label</a>,
1048 <a href="#t_void">void</a>,
1049 <a href="#t_integer">integer</a>,
1050 <a href="#t_floating">floating point</a>.</td>
1051 </tr>
1052 <tr>
1053 <td><a href="#t_derived">derived</a></td>
1054 <td><a href="#t_integer">integer</a>,
1055 <a href="#t_array">array</a>,
1056 <a href="#t_function">function</a>,
1057 <a href="#t_pointer">pointer</a>,
1058 <a href="#t_struct">structure</a>,
1059 <a href="#t_pstruct">packed structure</a>,
1060 <a href="#t_vector">vector</a>,
1061 <a href="#t_opaque">opaque</a>.
1062 </tr>
Chris Lattner261efe92003-11-25 01:02:51 +00001063 </tbody>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001064</table>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00001065
Chris Lattner261efe92003-11-25 01:02:51 +00001066<p>The <a href="#t_firstclass">first class</a> types are perhaps the
1067most important. Values of these types are the only ones which can be
1068produced by instructions, passed as arguments, or used as operands to
1069instructions. This means that all structures and arrays must be
1070manipulated either by pointer or by component.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001071</div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001072
Chris Lattner00950542001-06-06 20:29:01 +00001073<!-- ======================================================================= -->
Chris Lattner4f69f462008-01-04 04:32:38 +00001074<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
Chris Lattner8f8c7b72008-01-04 04:34:14 +00001075
Chris Lattner4f69f462008-01-04 04:32:38 +00001076<div class="doc_text">
1077<p>The primitive types are the fundamental building blocks of the LLVM
1078system.</p>
1079
Chris Lattner8f8c7b72008-01-04 04:34:14 +00001080</div>
1081
Chris Lattner4f69f462008-01-04 04:32:38 +00001082<!-- _______________________________________________________________________ -->
1083<div class="doc_subsubsection"> <a name="t_floating">Floating Point Types</a> </div>
1084
1085<div class="doc_text">
1086 <table>
1087 <tbody>
1088 <tr><th>Type</th><th>Description</th></tr>
1089 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
1090 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
1091 <tr><td><tt>fp128</tt></td><td>128-bit floating point value (112-bit mantissa)</td></tr>
1092 <tr><td><tt>x86_fp80</tt></td><td>80-bit floating point value (X87)</td></tr>
1093 <tr><td><tt>ppc_fp128</tt></td><td>128-bit floating point value (two 64-bits)</td></tr>
1094 </tbody>
1095 </table>
1096</div>
1097
1098<!-- _______________________________________________________________________ -->
1099<div class="doc_subsubsection"> <a name="t_void">Void Type</a> </div>
1100
1101<div class="doc_text">
1102<h5>Overview:</h5>
1103<p>The void type does not represent any value and has no size.</p>
1104
1105<h5>Syntax:</h5>
1106
1107<pre>
1108 void
1109</pre>
1110</div>
1111
1112<!-- _______________________________________________________________________ -->
1113<div class="doc_subsubsection"> <a name="t_label">Label Type</a> </div>
1114
1115<div class="doc_text">
1116<h5>Overview:</h5>
1117<p>The label type represents code labels.</p>
1118
1119<h5>Syntax:</h5>
1120
1121<pre>
1122 label
1123</pre>
1124</div>
1125
1126
1127<!-- ======================================================================= -->
Chris Lattner261efe92003-11-25 01:02:51 +00001128<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001129
Misha Brukman9d0919f2003-11-08 01:05:38 +00001130<div class="doc_text">
Chris Lattnerc3f59762004-12-09 17:30:23 +00001131
Chris Lattner261efe92003-11-25 01:02:51 +00001132<p>The real power in LLVM comes from the derived types in the system.
1133This is what allows a programmer to represent arrays, functions,
1134pointers, and other useful types. Note that these derived types may be
1135recursive: For example, it is possible to have a two dimensional array.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001136
Misha Brukman9d0919f2003-11-08 01:05:38 +00001137</div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001138
Chris Lattner00950542001-06-06 20:29:01 +00001139<!-- _______________________________________________________________________ -->
Reid Spencer2b916312007-05-16 18:44:01 +00001140<div class="doc_subsubsection"> <a name="t_integer">Integer Type</a> </div>
1141
1142<div class="doc_text">
1143
1144<h5>Overview:</h5>
1145<p>The integer type is a very simple derived type that simply specifies an
1146arbitrary bit width for the integer type desired. Any bit width from 1 bit to
11472^23-1 (about 8 million) can be specified.</p>
1148
1149<h5>Syntax:</h5>
1150
1151<pre>
1152 iN
1153</pre>
1154
1155<p>The number of bits the integer will occupy is specified by the <tt>N</tt>
1156value.</p>
1157
1158<h5>Examples:</h5>
1159<table class="layout">
Chris Lattnerb9488a62007-12-18 06:18:21 +00001160 <tbody>
1161 <tr>
1162 <td><tt>i1</tt></td>
1163 <td>a single-bit integer.</td>
1164 </tr><tr>
1165 <td><tt>i32</tt></td>
1166 <td>a 32-bit integer.</td>
1167 </tr><tr>
1168 <td><tt>i1942652</tt></td>
1169 <td>a really big integer of over 1 million bits.</td>
Reid Spencer2b916312007-05-16 18:44:01 +00001170 </tr>
Chris Lattnerb9488a62007-12-18 06:18:21 +00001171 </tbody>
Reid Spencer2b916312007-05-16 18:44:01 +00001172</table>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001173</div>
Reid Spencer2b916312007-05-16 18:44:01 +00001174
1175<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001176<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001177
Misha Brukman9d0919f2003-11-08 01:05:38 +00001178<div class="doc_text">
Chris Lattnerc3f59762004-12-09 17:30:23 +00001179
Chris Lattner00950542001-06-06 20:29:01 +00001180<h5>Overview:</h5>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001181
Misha Brukman9d0919f2003-11-08 01:05:38 +00001182<p>The array type is a very simple derived type that arranges elements
Chris Lattner261efe92003-11-25 01:02:51 +00001183sequentially in memory. The array type requires a size (number of
1184elements) and an underlying data type.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001185
Chris Lattner7faa8832002-04-14 06:13:44 +00001186<h5>Syntax:</h5>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001187
1188<pre>
1189 [&lt;# elements&gt; x &lt;elementtype&gt;]
1190</pre>
1191
John Criswelle4c57cc2005-05-12 16:52:32 +00001192<p>The number of elements is a constant integer value; elementtype may
Chris Lattner261efe92003-11-25 01:02:51 +00001193be any type with a size.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001194
Chris Lattner7faa8832002-04-14 06:13:44 +00001195<h5>Examples:</h5>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001196<table class="layout">
1197 <tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001198 <td class="left"><tt>[40 x i32]</tt></td>
1199 <td class="left">Array of 40 32-bit integer values.</td>
1200 </tr>
1201 <tr class="layout">
1202 <td class="left"><tt>[41 x i32]</tt></td>
1203 <td class="left">Array of 41 32-bit integer values.</td>
1204 </tr>
1205 <tr class="layout">
1206 <td class="left"><tt>[4 x i8]</tt></td>
1207 <td class="left">Array of 4 8-bit integer values.</td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001208 </tr>
Chris Lattner00950542001-06-06 20:29:01 +00001209</table>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001210<p>Here are some examples of multidimensional arrays:</p>
1211<table class="layout">
1212 <tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001213 <td class="left"><tt>[3 x [4 x i32]]</tt></td>
1214 <td class="left">3x4 array of 32-bit integer values.</td>
1215 </tr>
1216 <tr class="layout">
1217 <td class="left"><tt>[12 x [10 x float]]</tt></td>
1218 <td class="left">12x10 array of single precision floating point values.</td>
1219 </tr>
1220 <tr class="layout">
1221 <td class="left"><tt>[2 x [3 x [4 x i16]]]</tt></td>
1222 <td class="left">2x3x4 array of 16-bit integer values.</td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001223 </tr>
1224</table>
Chris Lattnere67a9512005-06-24 17:22:57 +00001225
John Criswell0ec250c2005-10-24 16:17:18 +00001226<p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
1227length array. Normally, accesses past the end of an array are undefined in
Chris Lattnere67a9512005-06-24 17:22:57 +00001228LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
1229As a special case, however, zero length arrays are recognized to be variable
1230length. This allows implementation of 'pascal style arrays' with the LLVM
Reid Spencerca86e162006-12-31 07:07:53 +00001231type "{ i32, [0 x float]}", for example.</p>
Chris Lattnere67a9512005-06-24 17:22:57 +00001232
Misha Brukman9d0919f2003-11-08 01:05:38 +00001233</div>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001234
Chris Lattner00950542001-06-06 20:29:01 +00001235<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001236<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001237<div class="doc_text">
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001238
Chris Lattner00950542001-06-06 20:29:01 +00001239<h5>Overview:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001240
Chris Lattner261efe92003-11-25 01:02:51 +00001241<p>The function type can be thought of as a function signature. It
Devang Patela582f402008-03-24 05:35:41 +00001242consists of a return type and a list of formal parameter types. The
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001243return type of a function type is a scalar type, a void type, or a struct type.
Devang Patel7a3ad1a2008-03-24 20:52:42 +00001244If the return type is a struct type then all struct elements must be of first
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001245class types, and the struct must have at least one element.</p>
Devang Patelc3fc6df2008-03-10 20:49:15 +00001246
Chris Lattner00950542001-06-06 20:29:01 +00001247<h5>Syntax:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001248
1249<pre>
1250 &lt;returntype list&gt; (&lt;parameter list&gt;)
1251</pre>
1252
John Criswell0ec250c2005-10-24 16:17:18 +00001253<p>...where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
Misha Brukmanc24b7582004-08-12 20:16:08 +00001254specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
Chris Lattner27f71f22003-09-03 00:41:47 +00001255which indicates that the function takes a variable number of arguments.
1256Variable argument functions can access their arguments with the <a
Devang Patelc3fc6df2008-03-10 20:49:15 +00001257 href="#int_varargs">variable argument handling intrinsic</a> functions.
1258'<tt>&lt;returntype list&gt;</tt>' is a comma-separated list of
1259<a href="#t_firstclass">first class</a> type specifiers.</p>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001260
Chris Lattner00950542001-06-06 20:29:01 +00001261<h5>Examples:</h5>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001262<table class="layout">
1263 <tr class="layout">
Reid Spencer92f82302006-12-31 07:18:34 +00001264 <td class="left"><tt>i32 (i32)</tt></td>
1265 <td class="left">function taking an <tt>i32</tt>, returning an <tt>i32</tt>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001266 </td>
Reid Spencer92f82302006-12-31 07:18:34 +00001267 </tr><tr class="layout">
Reid Spencer9445e9a2007-07-19 23:13:04 +00001268 <td class="left"><tt>float&nbsp;(i16&nbsp;signext,&nbsp;i32&nbsp;*)&nbsp;*
Reid Spencerf17a0b72006-12-31 07:20:23 +00001269 </tt></td>
Reid Spencer92f82302006-12-31 07:18:34 +00001270 <td class="left"><a href="#t_pointer">Pointer</a> to a function that takes
1271 an <tt>i16</tt> that should be sign extended and a
Reid Spencerca86e162006-12-31 07:07:53 +00001272 <a href="#t_pointer">pointer</a> to <tt>i32</tt>, returning
Reid Spencer92f82302006-12-31 07:18:34 +00001273 <tt>float</tt>.
1274 </td>
1275 </tr><tr class="layout">
1276 <td class="left"><tt>i32 (i8*, ...)</tt></td>
1277 <td class="left">A vararg function that takes at least one
Reid Spencera5173382007-01-04 16:43:23 +00001278 <a href="#t_pointer">pointer</a> to <tt>i8 </tt> (char in C),
Reid Spencer92f82302006-12-31 07:18:34 +00001279 which returns an integer. This is the signature for <tt>printf</tt> in
1280 LLVM.
Reid Spencerd3f876c2004-11-01 08:19:36 +00001281 </td>
Devang Patela582f402008-03-24 05:35:41 +00001282 </tr><tr class="layout">
1283 <td class="left"><tt>{i32, i32} (i32)</tt></td>
Devang Patel3a5bff82008-03-24 18:10:52 +00001284 <td class="left">A function taking an <tt>i32></tt>, returning two
1285 <tt> i32 </tt> values as an aggregate of type <tt>{ i32, i32 }</tt>
Devang Patela582f402008-03-24 05:35:41 +00001286 </td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001287 </tr>
Chris Lattner00950542001-06-06 20:29:01 +00001288</table>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00001289
Misha Brukman9d0919f2003-11-08 01:05:38 +00001290</div>
Chris Lattner00950542001-06-06 20:29:01 +00001291<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001292<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001293<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00001294<h5>Overview:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001295<p>The structure type is used to represent a collection of data members
1296together in memory. The packing of the field types is defined to match
1297the ABI of the underlying processor. The elements of a structure may
1298be any type that has a size.</p>
1299<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1300and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1301field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1302instruction.</p>
Chris Lattner00950542001-06-06 20:29:01 +00001303<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001304<pre> { &lt;type list&gt; }<br></pre>
Chris Lattner00950542001-06-06 20:29:01 +00001305<h5>Examples:</h5>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001306<table class="layout">
1307 <tr class="layout">
Jeff Cohen6f1cc772007-04-22 01:17:39 +00001308 <td class="left"><tt>{ i32, i32, i32 }</tt></td>
1309 <td class="left">A triple of three <tt>i32</tt> values</td>
1310 </tr><tr class="layout">
1311 <td class="left"><tt>{&nbsp;float,&nbsp;i32&nbsp;(i32)&nbsp;*&nbsp;}</tt></td>
1312 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1313 second element is a <a href="#t_pointer">pointer</a> to a
1314 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1315 an <tt>i32</tt>.</td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001316 </tr>
Chris Lattner00950542001-06-06 20:29:01 +00001317</table>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001318</div>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001319
Chris Lattner00950542001-06-06 20:29:01 +00001320<!-- _______________________________________________________________________ -->
Andrew Lenharth75e10682006-12-08 17:13:00 +00001321<div class="doc_subsubsection"> <a name="t_pstruct">Packed Structure Type</a>
1322</div>
1323<div class="doc_text">
1324<h5>Overview:</h5>
1325<p>The packed structure type is used to represent a collection of data members
1326together in memory. There is no padding between fields. Further, the alignment
1327of a packed structure is 1 byte. The elements of a packed structure may
1328be any type that has a size.</p>
1329<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1330and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1331field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1332instruction.</p>
1333<h5>Syntax:</h5>
1334<pre> &lt; { &lt;type list&gt; } &gt; <br></pre>
1335<h5>Examples:</h5>
1336<table class="layout">
1337 <tr class="layout">
Jeff Cohen6f1cc772007-04-22 01:17:39 +00001338 <td class="left"><tt>&lt; { i32, i32, i32 } &gt;</tt></td>
1339 <td class="left">A triple of three <tt>i32</tt> values</td>
1340 </tr><tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001341 <td class="left"><tt>&lt; { float, i32 (i32)* } &gt;</tt></td>
Jeff Cohen6f1cc772007-04-22 01:17:39 +00001342 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1343 second element is a <a href="#t_pointer">pointer</a> to a
1344 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1345 an <tt>i32</tt>.</td>
Andrew Lenharth75e10682006-12-08 17:13:00 +00001346 </tr>
1347</table>
1348</div>
1349
1350<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001351<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001352<div class="doc_text">
Chris Lattner7faa8832002-04-14 06:13:44 +00001353<h5>Overview:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001354<p>As in many languages, the pointer type represents a pointer or
Christopher Lamb284d9922007-12-11 09:31:00 +00001355reference to another object, which must live in memory. Pointer types may have
1356an optional address space attribute defining the target-specific numbered
1357address space where the pointed-to object resides. The default address space is
1358zero.</p>
Chris Lattner7faa8832002-04-14 06:13:44 +00001359<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001360<pre> &lt;type&gt; *<br></pre>
Chris Lattner7faa8832002-04-14 06:13:44 +00001361<h5>Examples:</h5>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001362<table class="layout">
1363 <tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001364 <td class="left"><tt>[4x i32]*</tt></td>
1365 <td class="left">A <a href="#t_pointer">pointer</a> to <a
1366 href="#t_array">array</a> of four <tt>i32</tt> values.</td>
1367 </tr>
1368 <tr class="layout">
1369 <td class="left"><tt>i32 (i32 *) *</tt></td>
1370 <td class="left"> A <a href="#t_pointer">pointer</a> to a <a
Reid Spencerca86e162006-12-31 07:07:53 +00001371 href="#t_function">function</a> that takes an <tt>i32*</tt>, returning an
Chris Lattner23ff1f92007-12-19 05:04:11 +00001372 <tt>i32</tt>.</td>
1373 </tr>
1374 <tr class="layout">
1375 <td class="left"><tt>i32 addrspace(5)*</tt></td>
1376 <td class="left">A <a href="#t_pointer">pointer</a> to an <tt>i32</tt> value
1377 that resides in address space #5.</td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001378 </tr>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001379</table>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001380</div>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001381
Chris Lattnera58561b2004-08-12 19:12:28 +00001382<!-- _______________________________________________________________________ -->
Reid Spencer485bad12007-02-15 03:07:05 +00001383<div class="doc_subsubsection"> <a name="t_vector">Vector Type</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001384<div class="doc_text">
Chris Lattner69c11bb2005-04-25 17:34:15 +00001385
Chris Lattnera58561b2004-08-12 19:12:28 +00001386<h5>Overview:</h5>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001387
Reid Spencer485bad12007-02-15 03:07:05 +00001388<p>A vector type is a simple derived type that represents a vector
1389of elements. Vector types are used when multiple primitive data
Chris Lattnera58561b2004-08-12 19:12:28 +00001390are operated in parallel using a single instruction (SIMD).
Reid Spencer485bad12007-02-15 03:07:05 +00001391A vector type requires a size (number of
Chris Lattnerb8d172f2005-11-10 01:44:22 +00001392elements) and an underlying primitive data type. Vectors must have a power
Reid Spencer485bad12007-02-15 03:07:05 +00001393of two length (1, 2, 4, 8, 16 ...). Vector types are
Chris Lattnera58561b2004-08-12 19:12:28 +00001394considered <a href="#t_firstclass">first class</a>.</p>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001395
Chris Lattnera58561b2004-08-12 19:12:28 +00001396<h5>Syntax:</h5>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001397
1398<pre>
1399 &lt; &lt;# elements&gt; x &lt;elementtype&gt; &gt;
1400</pre>
1401
John Criswellc1f786c2005-05-13 22:25:59 +00001402<p>The number of elements is a constant integer value; elementtype may
Chris Lattner3b19d652007-01-15 01:54:13 +00001403be any integer or floating point type.</p>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001404
Chris Lattnera58561b2004-08-12 19:12:28 +00001405<h5>Examples:</h5>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001406
Reid Spencerd3f876c2004-11-01 08:19:36 +00001407<table class="layout">
1408 <tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001409 <td class="left"><tt>&lt;4 x i32&gt;</tt></td>
1410 <td class="left">Vector of 4 32-bit integer values.</td>
1411 </tr>
1412 <tr class="layout">
1413 <td class="left"><tt>&lt;8 x float&gt;</tt></td>
1414 <td class="left">Vector of 8 32-bit floating-point values.</td>
1415 </tr>
1416 <tr class="layout">
1417 <td class="left"><tt>&lt;2 x i64&gt;</tt></td>
1418 <td class="left">Vector of 2 64-bit integer values.</td>
Reid Spencerd3f876c2004-11-01 08:19:36 +00001419 </tr>
1420</table>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001421</div>
1422
Chris Lattner69c11bb2005-04-25 17:34:15 +00001423<!-- _______________________________________________________________________ -->
1424<div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1425<div class="doc_text">
1426
1427<h5>Overview:</h5>
1428
1429<p>Opaque types are used to represent unknown types in the system. This
Gordon Henriksen8ac04ff2007-10-14 00:34:53 +00001430corresponds (for example) to the C notion of a forward declared structure type.
Chris Lattner69c11bb2005-04-25 17:34:15 +00001431In LLVM, opaque types can eventually be resolved to any type (not just a
1432structure type).</p>
1433
1434<h5>Syntax:</h5>
1435
1436<pre>
1437 opaque
1438</pre>
1439
1440<h5>Examples:</h5>
1441
1442<table class="layout">
1443 <tr class="layout">
Chris Lattner23ff1f92007-12-19 05:04:11 +00001444 <td class="left"><tt>opaque</tt></td>
1445 <td class="left">An opaque type.</td>
Chris Lattner69c11bb2005-04-25 17:34:15 +00001446 </tr>
1447</table>
1448</div>
1449
1450
Chris Lattnerc3f59762004-12-09 17:30:23 +00001451<!-- *********************************************************************** -->
1452<div class="doc_section"> <a name="constants">Constants</a> </div>
1453<!-- *********************************************************************** -->
1454
1455<div class="doc_text">
1456
1457<p>LLVM has several different basic types of constants. This section describes
1458them all and their syntax.</p>
1459
1460</div>
1461
1462<!-- ======================================================================= -->
Reid Spencercc16dc32004-12-09 18:02:53 +00001463<div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001464
1465<div class="doc_text">
1466
1467<dl>
1468 <dt><b>Boolean constants</b></dt>
1469
1470 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
Reid Spencerc78f3372007-01-12 03:35:51 +00001471 constants of the <tt><a href="#t_primitive">i1</a></tt> type.
Chris Lattnerc3f59762004-12-09 17:30:23 +00001472 </dd>
1473
1474 <dt><b>Integer constants</b></dt>
1475
Reid Spencercc16dc32004-12-09 18:02:53 +00001476 <dd>Standard integers (such as '4') are constants of the <a
Reid Spencera5173382007-01-04 16:43:23 +00001477 href="#t_integer">integer</a> type. Negative numbers may be used with
Chris Lattnerc3f59762004-12-09 17:30:23 +00001478 integer types.
1479 </dd>
1480
1481 <dt><b>Floating point constants</b></dt>
1482
1483 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1484 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
Chris Lattnera73afe02008-04-01 18:45:27 +00001485 notation (see below). The assembler requires the exact decimal value of
1486 a floating-point constant. For example, the assembler accepts 1.25 but
1487 rejects 1.3 because 1.3 is a repeating decimal in binary. Floating point
1488 constants must have a <a href="#t_floating">floating point</a> type. </dd>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001489
1490 <dt><b>Null pointer constants</b></dt>
1491
John Criswell9e2485c2004-12-10 15:51:16 +00001492 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
Chris Lattnerc3f59762004-12-09 17:30:23 +00001493 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1494
1495</dl>
1496
John Criswell9e2485c2004-12-10 15:51:16 +00001497<p>The one non-intuitive notation for constants is the optional hexadecimal form
Chris Lattnerc3f59762004-12-09 17:30:23 +00001498of floating point constants. For example, the form '<tt>double
14990x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
15004.5e+15</tt>'. The only time hexadecimal floating point constants are required
Reid Spencercc16dc32004-12-09 18:02:53 +00001501(and the only time that they are generated by the disassembler) is when a
1502floating point constant must be emitted but it cannot be represented as a
1503decimal floating point number. For example, NaN's, infinities, and other
1504special values are represented in their IEEE hexadecimal format so that
1505assembly and disassembly do not cause any bits to change in the constants.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001506
1507</div>
1508
1509<!-- ======================================================================= -->
1510<div class="doc_subsection"><a name="aggregateconstants">Aggregate Constants</a>
1511</div>
1512
1513<div class="doc_text">
Chris Lattnerd4f6b172005-03-07 22:13:59 +00001514<p>Aggregate constants arise from aggregation of simple constants
1515and smaller aggregate constants.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001516
1517<dl>
1518 <dt><b>Structure constants</b></dt>
1519
1520 <dd>Structure constants are represented with notation similar to structure
1521 type definitions (a comma separated list of elements, surrounded by braces
Chris Lattner64910ee2007-12-25 20:34:52 +00001522 (<tt>{}</tt>)). For example: "<tt>{ i32 4, float 17.0, i32* @G }</tt>",
1523 where "<tt>@G</tt>" is declared as "<tt>@G = external global i32</tt>". Structure constants
Chris Lattnerd4f6b172005-03-07 22:13:59 +00001524 must have <a href="#t_struct">structure type</a>, and the number and
Chris Lattnerc3f59762004-12-09 17:30:23 +00001525 types of elements must match those specified by the type.
1526 </dd>
1527
1528 <dt><b>Array constants</b></dt>
1529
1530 <dd>Array constants are represented with notation similar to array type
1531 definitions (a comma separated list of elements, surrounded by square brackets
Reid Spencerca86e162006-12-31 07:07:53 +00001532 (<tt>[]</tt>)). For example: "<tt>[ i32 42, i32 11, i32 74 ]</tt>". Array
Chris Lattnerc3f59762004-12-09 17:30:23 +00001533 constants must have <a href="#t_array">array type</a>, and the number and
1534 types of elements must match those specified by the type.
1535 </dd>
1536
Reid Spencer485bad12007-02-15 03:07:05 +00001537 <dt><b>Vector constants</b></dt>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001538
Reid Spencer485bad12007-02-15 03:07:05 +00001539 <dd>Vector constants are represented with notation similar to vector type
Chris Lattnerc3f59762004-12-09 17:30:23 +00001540 definitions (a comma separated list of elements, surrounded by
Reid Spencerca86e162006-12-31 07:07:53 +00001541 less-than/greater-than's (<tt>&lt;&gt;</tt>)). For example: "<tt>&lt; i32 42,
Jeff Cohen6f1cc772007-04-22 01:17:39 +00001542 i32 11, i32 74, i32 100 &gt;</tt>". Vector constants must have <a
Reid Spencer485bad12007-02-15 03:07:05 +00001543 href="#t_vector">vector type</a>, and the number and types of elements must
Chris Lattnerc3f59762004-12-09 17:30:23 +00001544 match those specified by the type.
1545 </dd>
1546
1547 <dt><b>Zero initialization</b></dt>
1548
1549 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1550 value to zero of <em>any</em> type, including scalar and aggregate types.
1551 This is often used to avoid having to print large zero initializers (e.g. for
John Criswell0ec250c2005-10-24 16:17:18 +00001552 large arrays) and is always exactly equivalent to using explicit zero
Chris Lattnerc3f59762004-12-09 17:30:23 +00001553 initializers.
1554 </dd>
1555</dl>
1556
1557</div>
1558
1559<!-- ======================================================================= -->
1560<div class="doc_subsection">
1561 <a name="globalconstants">Global Variable and Function Addresses</a>
1562</div>
1563
1564<div class="doc_text">
1565
1566<p>The addresses of <a href="#globalvars">global variables</a> and <a
1567href="#functionstructure">functions</a> are always implicitly valid (link-time)
John Criswell9e2485c2004-12-10 15:51:16 +00001568constants. These constants are explicitly referenced when the <a
1569href="#identifiers">identifier for the global</a> is used and always have <a
Chris Lattnerc3f59762004-12-09 17:30:23 +00001570href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1571file:</p>
1572
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001573<div class="doc_code">
Chris Lattnerc3f59762004-12-09 17:30:23 +00001574<pre>
Chris Lattnera18a4242007-06-06 18:28:13 +00001575@X = global i32 17
1576@Y = global i32 42
1577@Z = global [2 x i32*] [ i32* @X, i32* @Y ]
Chris Lattnerc3f59762004-12-09 17:30:23 +00001578</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001579</div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001580
1581</div>
1582
1583<!-- ======================================================================= -->
Reid Spencer2dc45b82004-12-09 18:13:12 +00001584<div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001585<div class="doc_text">
Reid Spencer2dc45b82004-12-09 18:13:12 +00001586 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
John Criswellc1f786c2005-05-13 22:25:59 +00001587 no specific value. Undefined values may be of any type and be used anywhere
Reid Spencer2dc45b82004-12-09 18:13:12 +00001588 a constant is permitted.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001589
Reid Spencer2dc45b82004-12-09 18:13:12 +00001590 <p>Undefined values indicate to the compiler that the program is well defined
1591 no matter what value is used, giving the compiler more freedom to optimize.
1592 </p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001593</div>
1594
1595<!-- ======================================================================= -->
1596<div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1597</div>
1598
1599<div class="doc_text">
1600
1601<p>Constant expressions are used to allow expressions involving other constants
1602to be used as constants. Constant expressions may be of any <a
John Criswellc1f786c2005-05-13 22:25:59 +00001603href="#t_firstclass">first class</a> type and may involve any LLVM operation
Chris Lattnerc3f59762004-12-09 17:30:23 +00001604that does not have side effects (e.g. load and call are not supported). The
1605following is the syntax for constant expressions:</p>
1606
1607<dl>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001608 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1609 <dd>Truncate a constant to another type. The bit size of CST must be larger
Chris Lattner3b19d652007-01-15 01:54:13 +00001610 than the bit size of TYPE. Both types must be integers.</dd>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001611
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001612 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1613 <dd>Zero extend a constant to another type. The bit size of CST must be
Chris Lattner3b19d652007-01-15 01:54:13 +00001614 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001615
1616 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1617 <dd>Sign extend a constant to another type. The bit size of CST must be
Chris Lattner3b19d652007-01-15 01:54:13 +00001618 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001619
1620 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1621 <dd>Truncate a floating point constant to another floating point type. The
1622 size of CST must be larger than the size of TYPE. Both types must be
1623 floating point.</dd>
1624
1625 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1626 <dd>Floating point extend a constant to another type. The size of CST must be
1627 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1628
Reid Spencer1539a1c2007-07-31 14:40:14 +00001629 <dt><b><tt>fptoui ( CST to TYPE )</tt></b></dt>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001630 <dd>Convert a floating point constant to the corresponding unsigned integer
Nate Begemanb348d182007-11-17 03:58:34 +00001631 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1632 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1633 of the same number of elements. If the value won't fit in the integer type,
1634 the results are undefined.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001635
Reid Spencerd4448792006-11-09 23:03:26 +00001636 <dt><b><tt>fptosi ( CST to TYPE )</tt></b></dt>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001637 <dd>Convert a floating point constant to the corresponding signed integer
Nate Begemanb348d182007-11-17 03:58:34 +00001638 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1639 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1640 of the same number of elements. If the value won't fit in the integer type,
1641 the results are undefined.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001642
Reid Spencerd4448792006-11-09 23:03:26 +00001643 <dt><b><tt>uitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001644 <dd>Convert an unsigned integer constant to the corresponding floating point
Nate Begemanb348d182007-11-17 03:58:34 +00001645 constant. TYPE must be a scalar or vector floating point type. CST must be of
1646 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1647 of the same number of elements. If the value won't fit in the floating point
1648 type, the results are undefined.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001649
Reid Spencerd4448792006-11-09 23:03:26 +00001650 <dt><b><tt>sitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001651 <dd>Convert a signed integer constant to the corresponding floating point
Nate Begemanb348d182007-11-17 03:58:34 +00001652 constant. TYPE must be a scalar or vector floating point type. CST must be of
1653 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1654 of the same number of elements. If the value won't fit in the floating point
1655 type, the results are undefined.</dd>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001656
Reid Spencer5c0ef472006-11-11 23:08:07 +00001657 <dt><b><tt>ptrtoint ( CST to TYPE )</tt></b></dt>
1658 <dd>Convert a pointer typed constant to the corresponding integer constant
1659 TYPE must be an integer type. CST must be of pointer type. The CST value is
1660 zero extended, truncated, or unchanged to make it fit in TYPE.</dd>
1661
1662 <dt><b><tt>inttoptr ( CST to TYPE )</tt></b></dt>
1663 <dd>Convert a integer constant to a pointer constant. TYPE must be a
1664 pointer type. CST must be of integer type. The CST value is zero extended,
1665 truncated, or unchanged to make it fit in a pointer size. This one is
1666 <i>really</i> dangerous!</dd>
1667
1668 <dt><b><tt>bitcast ( CST to TYPE )</tt></b></dt>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001669 <dd>Convert a constant, CST, to another TYPE. The size of CST and TYPE must be
1670 identical (same number of bits). The conversion is done as if the CST value
1671 was stored to memory and read back as TYPE. In other words, no bits change
Reid Spencer5c0ef472006-11-11 23:08:07 +00001672 with this operator, just the type. This can be used for conversion of
Reid Spencer485bad12007-02-15 03:07:05 +00001673 vector types to any other type, as long as they have the same bit width. For
Reid Spencer5c0ef472006-11-11 23:08:07 +00001674 pointers it is only valid to cast to another pointer type.
Reid Spencer9dee3ac2006-11-08 01:11:31 +00001675 </dd>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001676
1677 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1678
1679 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1680 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1681 instruction, the index list may have zero or more indexes, which are required
1682 to make sense for the type of "CSTPTR".</dd>
1683
Robert Bocchino9fbe1452006-01-10 19:31:34 +00001684 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1685
1686 <dd>Perform the <a href="#i_select">select operation</a> on
Reid Spencer01c42592006-12-04 19:23:19 +00001687 constants.</dd>
1688
1689 <dt><b><tt>icmp COND ( VAL1, VAL2 )</tt></b></dt>
1690 <dd>Performs the <a href="#i_icmp">icmp operation</a> on constants.</dd>
1691
1692 <dt><b><tt>fcmp COND ( VAL1, VAL2 )</tt></b></dt>
1693 <dd>Performs the <a href="#i_fcmp">fcmp operation</a> on constants.</dd>
Robert Bocchino9fbe1452006-01-10 19:31:34 +00001694
Nate Begemanac80ade2008-05-12 19:01:56 +00001695 <dt><b><tt>vicmp COND ( VAL1, VAL2 )</tt></b></dt>
1696 <dd>Performs the <a href="#i_vicmp">vicmp operation</a> on constants.</dd>
1697
1698 <dt><b><tt>vfcmp COND ( VAL1, VAL2 )</tt></b></dt>
1699 <dd>Performs the <a href="#i_vfcmp">vfcmp operation</a> on constants.</dd>
1700
Robert Bocchino9fbe1452006-01-10 19:31:34 +00001701 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1702
1703 <dd>Perform the <a href="#i_extractelement">extractelement
1704 operation</a> on constants.
1705
Robert Bocchino05ccd702006-01-15 20:48:27 +00001706 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1707
1708 <dd>Perform the <a href="#i_insertelement">insertelement
Reid Spencer01c42592006-12-04 19:23:19 +00001709 operation</a> on constants.</dd>
Robert Bocchino05ccd702006-01-15 20:48:27 +00001710
Chris Lattnerc1989542006-04-08 00:13:41 +00001711
1712 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
1713
1714 <dd>Perform the <a href="#i_shufflevector">shufflevector
Reid Spencer01c42592006-12-04 19:23:19 +00001715 operation</a> on constants.</dd>
Chris Lattnerc1989542006-04-08 00:13:41 +00001716
Chris Lattnerc3f59762004-12-09 17:30:23 +00001717 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
1718
Reid Spencer2dc45b82004-12-09 18:13:12 +00001719 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
1720 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
Chris Lattnerc3f59762004-12-09 17:30:23 +00001721 binary</a> operations. The constraints on operands are the same as those for
1722 the corresponding instruction (e.g. no bitwise operations on floating point
John Criswelle4c57cc2005-05-12 16:52:32 +00001723 values are allowed).</dd>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001724</dl>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001725</div>
Chris Lattner9ee5d222004-03-08 16:49:10 +00001726
Chris Lattner00950542001-06-06 20:29:01 +00001727<!-- *********************************************************************** -->
Chris Lattnere87d6532006-01-25 23:47:57 +00001728<div class="doc_section"> <a name="othervalues">Other Values</a> </div>
1729<!-- *********************************************************************** -->
1730
1731<!-- ======================================================================= -->
1732<div class="doc_subsection">
1733<a name="inlineasm">Inline Assembler Expressions</a>
1734</div>
1735
1736<div class="doc_text">
1737
1738<p>
1739LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
1740Module-Level Inline Assembly</a>) through the use of a special value. This
1741value represents the inline assembler as a string (containing the instructions
1742to emit), a list of operand constraints (stored as a string), and a flag that
1743indicates whether or not the inline asm expression has side effects. An example
1744inline assembler expression is:
1745</p>
1746
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001747<div class="doc_code">
Chris Lattnere87d6532006-01-25 23:47:57 +00001748<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001749i32 (i32) asm "bswap $0", "=r,r"
Chris Lattnere87d6532006-01-25 23:47:57 +00001750</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001751</div>
Chris Lattnere87d6532006-01-25 23:47:57 +00001752
1753<p>
1754Inline assembler expressions may <b>only</b> be used as the callee operand of
1755a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
1756</p>
1757
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001758<div class="doc_code">
Chris Lattnere87d6532006-01-25 23:47:57 +00001759<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001760%X = call i32 asm "<a href="#int_bswap">bswap</a> $0", "=r,r"(i32 %Y)
Chris Lattnere87d6532006-01-25 23:47:57 +00001761</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001762</div>
Chris Lattnere87d6532006-01-25 23:47:57 +00001763
1764<p>
1765Inline asms with side effects not visible in the constraint list must be marked
1766as having side effects. This is done through the use of the
1767'<tt>sideeffect</tt>' keyword, like so:
1768</p>
1769
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001770<div class="doc_code">
Chris Lattnere87d6532006-01-25 23:47:57 +00001771<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001772call void asm sideeffect "eieio", ""()
Chris Lattnere87d6532006-01-25 23:47:57 +00001773</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00001774</div>
Chris Lattnere87d6532006-01-25 23:47:57 +00001775
1776<p>TODO: The format of the asm and constraints string still need to be
1777documented here. Constraints on what can be done (e.g. duplication, moving, etc
1778need to be documented).
1779</p>
1780
1781</div>
1782
1783<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +00001784<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
1785<!-- *********************************************************************** -->
Chris Lattnerc3f59762004-12-09 17:30:23 +00001786
Misha Brukman9d0919f2003-11-08 01:05:38 +00001787<div class="doc_text">
Chris Lattnerc3f59762004-12-09 17:30:23 +00001788
Chris Lattner261efe92003-11-25 01:02:51 +00001789<p>The LLVM instruction set consists of several different
1790classifications of instructions: <a href="#terminators">terminator
John Criswellc1f786c2005-05-13 22:25:59 +00001791instructions</a>, <a href="#binaryops">binary instructions</a>,
1792<a href="#bitwiseops">bitwise binary instructions</a>, <a
Chris Lattner261efe92003-11-25 01:02:51 +00001793 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
1794instructions</a>.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001795
Misha Brukman9d0919f2003-11-08 01:05:38 +00001796</div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001797
Chris Lattner00950542001-06-06 20:29:01 +00001798<!-- ======================================================================= -->
Chris Lattner261efe92003-11-25 01:02:51 +00001799<div class="doc_subsection"> <a name="terminators">Terminator
1800Instructions</a> </div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001801
Misha Brukman9d0919f2003-11-08 01:05:38 +00001802<div class="doc_text">
Chris Lattnerc3f59762004-12-09 17:30:23 +00001803
Chris Lattner261efe92003-11-25 01:02:51 +00001804<p>As mentioned <a href="#functionstructure">previously</a>, every
1805basic block in a program ends with a "Terminator" instruction, which
1806indicates which block should be executed after the current block is
1807finished. These terminator instructions typically yield a '<tt>void</tt>'
1808value: they produce control flow, not values (the one exception being
1809the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
John Criswell9e2485c2004-12-10 15:51:16 +00001810<p>There are six different terminator instructions: the '<a
Chris Lattner261efe92003-11-25 01:02:51 +00001811 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
1812instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
Chris Lattner35eca582004-10-16 18:04:13 +00001813the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
1814 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
1815 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001816
Misha Brukman9d0919f2003-11-08 01:05:38 +00001817</div>
Chris Lattnerc3f59762004-12-09 17:30:23 +00001818
Chris Lattner00950542001-06-06 20:29:01 +00001819<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001820<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
1821Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001822<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00001823<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001824<pre> ret &lt;type&gt; &lt;value&gt; <i>; Return a value from a non-void function</i>
Chris Lattner7faa8832002-04-14 06:13:44 +00001825 ret void <i>; Return from void function</i>
Devang Patelc3fc6df2008-03-10 20:49:15 +00001826 ret &lt;type&gt; &lt;value&gt;, &lt;type&gt; &lt;value&gt; <i>; Return two values from a non-void function </i>
Chris Lattner00950542001-06-06 20:29:01 +00001827</pre>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001828
Chris Lattner00950542001-06-06 20:29:01 +00001829<h5>Overview:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001830
Chris Lattner261efe92003-11-25 01:02:51 +00001831<p>The '<tt>ret</tt>' instruction is used to return control flow (and a
John Criswellc1f786c2005-05-13 22:25:59 +00001832value) from a function back to the caller.</p>
John Criswell4457dc92004-04-09 16:48:45 +00001833<p>There are two forms of the '<tt>ret</tt>' instruction: one that
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001834returns value(s) and then causes control flow, and one that just causes
Chris Lattner261efe92003-11-25 01:02:51 +00001835control flow to occur.</p>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001836
Chris Lattner00950542001-06-06 20:29:01 +00001837<h5>Arguments:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001838
1839<p>The '<tt>ret</tt>' instruction may return zero, one or multiple values.
1840The type of each return value must be a '<a href="#t_firstclass">first
1841class</a>' type. Note that a function is not <a href="#wellformed">well
1842formed</a> if there exists a '<tt>ret</tt>' instruction inside of the
1843function that returns values that do not match the return type of the
1844function.</p>
1845
Chris Lattner00950542001-06-06 20:29:01 +00001846<h5>Semantics:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001847
Chris Lattner261efe92003-11-25 01:02:51 +00001848<p>When the '<tt>ret</tt>' instruction is executed, control flow
1849returns back to the calling function's context. If the caller is a "<a
John Criswellfa081872004-06-25 15:16:57 +00001850 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
Chris Lattner261efe92003-11-25 01:02:51 +00001851the instruction after the call. If the caller was an "<a
1852 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
John Criswelle4c57cc2005-05-12 16:52:32 +00001853at the beginning of the "normal" destination block. If the instruction
Chris Lattner261efe92003-11-25 01:02:51 +00001854returns a value, that value shall set the call or invoke instruction's
Devang Patelc3fc6df2008-03-10 20:49:15 +00001855return value. If the instruction returns multiple values then these
Devang Patel0dbb4a12008-03-11 05:51:59 +00001856values can only be accessed through a '<a href="#i_getresult"><tt>getresult</tt>
1857</a>' instruction.</p>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001858
Chris Lattner00950542001-06-06 20:29:01 +00001859<h5>Example:</h5>
Chris Lattnerf4cde4e2008-04-23 04:59:35 +00001860
1861<pre>
1862 ret i32 5 <i>; Return an integer value of 5</i>
Chris Lattner7faa8832002-04-14 06:13:44 +00001863 ret void <i>; Return from a void function</i>
Devang Patelc3fc6df2008-03-10 20:49:15 +00001864 ret i32 4, i8 2 <i>; Return two values 4 and 2 </i>
Chris Lattner00950542001-06-06 20:29:01 +00001865</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001866</div>
Chris Lattner00950542001-06-06 20:29:01 +00001867<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00001868<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001869<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00001870<h5>Syntax:</h5>
Reid Spencerc78f3372007-01-12 03:35:51 +00001871<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 Lattner00950542001-06-06 20:29:01 +00001872</pre>
Chris Lattner00950542001-06-06 20:29:01 +00001873<h5>Overview:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001874<p>The '<tt>br</tt>' instruction is used to cause control flow to
1875transfer to a different basic block in the current function. There are
1876two forms of this instruction, corresponding to a conditional branch
1877and an unconditional branch.</p>
Chris Lattner00950542001-06-06 20:29:01 +00001878<h5>Arguments:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00001879<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
Reid Spencerc78f3372007-01-12 03:35:51 +00001880single '<tt>i1</tt>' value and two '<tt>label</tt>' values. The
Reid Spencerde151942007-02-19 23:54:10 +00001881unconditional form of the '<tt>br</tt>' instruction takes a single
1882'<tt>label</tt>' value as a target.</p>
Chris Lattner00950542001-06-06 20:29:01 +00001883<h5>Semantics:</h5>
Reid Spencerc78f3372007-01-12 03:35:51 +00001884<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>i1</tt>'
Chris Lattner261efe92003-11-25 01:02:51 +00001885argument is evaluated. If the value is <tt>true</tt>, control flows
1886to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
1887control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
Chris Lattner00950542001-06-06 20:29:01 +00001888<h5>Example:</h5>
Reid Spencerc78f3372007-01-12 03:35:51 +00001889<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 Spencerca86e162006-12-31 07:07:53 +00001890 href="#i_ret">ret</a> i32 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> i32 0<br></pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001891</div>
Chris Lattner00950542001-06-06 20:29:01 +00001892<!-- _______________________________________________________________________ -->
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001893<div class="doc_subsubsection">
1894 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
1895</div>
1896
Misha Brukman9d0919f2003-11-08 01:05:38 +00001897<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00001898<h5>Syntax:</h5>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001899
1900<pre>
1901 switch &lt;intty&gt; &lt;value&gt;, label &lt;defaultdest&gt; [ &lt;intty&gt; &lt;val&gt;, label &lt;dest&gt; ... ]
1902</pre>
1903
Chris Lattner00950542001-06-06 20:29:01 +00001904<h5>Overview:</h5>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001905
1906<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
1907several different places. It is a generalization of the '<tt>br</tt>'
Misha Brukman9d0919f2003-11-08 01:05:38 +00001908instruction, allowing a branch to occur to one of many possible
1909destinations.</p>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001910
1911
Chris Lattner00950542001-06-06 20:29:01 +00001912<h5>Arguments:</h5>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001913
1914<p>The '<tt>switch</tt>' instruction uses three parameters: an integer
1915comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
1916an array of pairs of comparison value constants and '<tt>label</tt>'s. The
1917table is not allowed to contain duplicate constant entries.</p>
1918
Chris Lattner00950542001-06-06 20:29:01 +00001919<h5>Semantics:</h5>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001920
Chris Lattner261efe92003-11-25 01:02:51 +00001921<p>The <tt>switch</tt> instruction specifies a table of values and
1922destinations. When the '<tt>switch</tt>' instruction is executed, this
John Criswell84114752004-06-25 16:05:06 +00001923table is searched for the given value. If the value is found, control flow is
1924transfered to the corresponding destination; otherwise, control flow is
1925transfered to the default destination.</p>
Chris Lattner00950542001-06-06 20:29:01 +00001926
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001927<h5>Implementation:</h5>
1928
1929<p>Depending on properties of the target machine and the particular
1930<tt>switch</tt> instruction, this instruction may be code generated in different
John Criswell84114752004-06-25 16:05:06 +00001931ways. For example, it could be generated as a series of chained conditional
1932branches or with a lookup table.</p>
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001933
1934<h5>Example:</h5>
1935
1936<pre>
1937 <i>; Emulate a conditional br instruction</i>
Reid Spencerc78f3372007-01-12 03:35:51 +00001938 %Val = <a href="#i_zext">zext</a> i1 %value to i32
Reid Spencerca86e162006-12-31 07:07:53 +00001939 switch i32 %Val, label %truedest [i32 0, label %falsedest ]
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001940
1941 <i>; Emulate an unconditional br instruction</i>
Reid Spencerca86e162006-12-31 07:07:53 +00001942 switch i32 0, label %dest [ ]
Chris Lattnerc88c17b2004-02-24 04:54:45 +00001943
1944 <i>; Implement a jump table:</i>
Reid Spencerca86e162006-12-31 07:07:53 +00001945 switch i32 %val, label %otherwise [ i32 0, label %onzero
1946 i32 1, label %onone
1947 i32 2, label %ontwo ]
Chris Lattner00950542001-06-06 20:29:01 +00001948</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00001949</div>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001950
Chris Lattner00950542001-06-06 20:29:01 +00001951<!-- _______________________________________________________________________ -->
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001952<div class="doc_subsubsection">
1953 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
1954</div>
1955
Misha Brukman9d0919f2003-11-08 01:05:38 +00001956<div class="doc_text">
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001957
Chris Lattner00950542001-06-06 20:29:01 +00001958<h5>Syntax:</h5>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001959
1960<pre>
Nick Lewyckyd703f652008-03-16 07:18:12 +00001961 &lt;result&gt; = invoke [<a href="#callingconv">cconv</a>] &lt;ptr to function ty&gt; &lt;function ptr val&gt;(&lt;function args&gt;)
Chris Lattner76b8a332006-05-14 18:23:06 +00001962 to label &lt;normal label&gt; unwind label &lt;exception label&gt;
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001963</pre>
1964
Chris Lattner6536cfe2002-05-06 22:08:29 +00001965<h5>Overview:</h5>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001966
1967<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
1968function, with the possibility of control flow transfer to either the
John Criswelle4c57cc2005-05-12 16:52:32 +00001969'<tt>normal</tt>' label or the
1970'<tt>exception</tt>' label. If the callee function returns with the
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001971"<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
1972"normal" label. If the callee (or any indirect callees) returns with the "<a
John Criswelle4c57cc2005-05-12 16:52:32 +00001973href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
Devang Patelc3fc6df2008-03-10 20:49:15 +00001974continued at the dynamically nearest "exception" label. If the callee function
Devang Patel0dbb4a12008-03-11 05:51:59 +00001975returns multiple values then individual return values are only accessible through
1976a '<tt><a href="#i_getresult">getresult</a></tt>' instruction.</p>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001977
Chris Lattner00950542001-06-06 20:29:01 +00001978<h5>Arguments:</h5>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001979
Misha Brukman9d0919f2003-11-08 01:05:38 +00001980<p>This instruction requires several arguments:</p>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001981
Chris Lattner00950542001-06-06 20:29:01 +00001982<ol>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001983 <li>
Duncan Sands8036ca42007-03-30 12:22:09 +00001984 The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattnerbad10ee2005-05-06 22:57:40 +00001985 convention</a> the call should use. If none is specified, the call defaults
1986 to using C calling conventions.
1987 </li>
1988 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
1989 function value being invoked. In most cases, this is a direct function
1990 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
1991 an arbitrary pointer to function value.
1992 </li>
1993
1994 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
1995 function to be invoked. </li>
1996
1997 <li>'<tt>function args</tt>': argument list whose types match the function
1998 signature argument types. If the function signature indicates the function
1999 accepts a variable number of arguments, the extra arguments can be
2000 specified. </li>
2001
2002 <li>'<tt>normal label</tt>': the label reached when the called function
2003 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
2004
2005 <li>'<tt>exception label</tt>': the label reached when a callee returns with
2006 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
2007
Chris Lattner00950542001-06-06 20:29:01 +00002008</ol>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00002009
Chris Lattner00950542001-06-06 20:29:01 +00002010<h5>Semantics:</h5>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00002011
Misha Brukman9d0919f2003-11-08 01:05:38 +00002012<p>This instruction is designed to operate as a standard '<tt><a
Chris Lattnerbad10ee2005-05-06 22:57:40 +00002013href="#i_call">call</a></tt>' instruction in most regards. The primary
2014difference is that it establishes an association with a label, which is used by
2015the runtime library to unwind the stack.</p>
2016
2017<p>This instruction is used in languages with destructors to ensure that proper
2018cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
2019exception. Additionally, this is important for implementation of
2020'<tt>catch</tt>' clauses in high-level languages that support them.</p>
2021
Chris Lattner00950542001-06-06 20:29:01 +00002022<h5>Example:</h5>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00002023<pre>
Nick Lewyckyd703f652008-03-16 07:18:12 +00002024 %retval = invoke i32 @Test(i32 15) to label %Continue
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002025 unwind label %TestCleanup <i>; {i32}:retval set</i>
Nick Lewyckyd703f652008-03-16 07:18:12 +00002026 %retval = invoke <a href="#callingconv">coldcc</a> i32 %Testfnptr(i32 15) to label %Continue
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002027 unwind label %TestCleanup <i>; {i32}:retval set</i>
Chris Lattner00950542001-06-06 20:29:01 +00002028</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002029</div>
Chris Lattner35eca582004-10-16 18:04:13 +00002030
2031
Chris Lattner27f71f22003-09-03 00:41:47 +00002032<!-- _______________________________________________________________________ -->
Chris Lattner35eca582004-10-16 18:04:13 +00002033
Chris Lattner261efe92003-11-25 01:02:51 +00002034<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
2035Instruction</a> </div>
Chris Lattner35eca582004-10-16 18:04:13 +00002036
Misha Brukman9d0919f2003-11-08 01:05:38 +00002037<div class="doc_text">
Chris Lattner35eca582004-10-16 18:04:13 +00002038
Chris Lattner27f71f22003-09-03 00:41:47 +00002039<h5>Syntax:</h5>
Chris Lattner35eca582004-10-16 18:04:13 +00002040<pre>
2041 unwind
2042</pre>
2043
Chris Lattner27f71f22003-09-03 00:41:47 +00002044<h5>Overview:</h5>
Chris Lattner35eca582004-10-16 18:04:13 +00002045
2046<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
2047at the first callee in the dynamic call stack which used an <a
2048href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
2049primarily used to implement exception handling.</p>
2050
Chris Lattner27f71f22003-09-03 00:41:47 +00002051<h5>Semantics:</h5>
Chris Lattner35eca582004-10-16 18:04:13 +00002052
Chris Lattner72ed2002008-04-19 21:01:16 +00002053<p>The '<tt>unwind</tt>' instruction causes execution of the current function to
Chris Lattner35eca582004-10-16 18:04:13 +00002054immediately halt. The dynamic call stack is then searched for the first <a
2055href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
2056execution continues at the "exceptional" destination block specified by the
2057<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
2058dynamic call chain, undefined behavior results.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002059</div>
Chris Lattner35eca582004-10-16 18:04:13 +00002060
2061<!-- _______________________________________________________________________ -->
2062
2063<div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
2064Instruction</a> </div>
2065
2066<div class="doc_text">
2067
2068<h5>Syntax:</h5>
2069<pre>
2070 unreachable
2071</pre>
2072
2073<h5>Overview:</h5>
2074
2075<p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
2076instruction is used to inform the optimizer that a particular portion of the
2077code is not reachable. This can be used to indicate that the code after a
2078no-return function cannot be reached, and other facts.</p>
2079
2080<h5>Semantics:</h5>
2081
2082<p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
2083</div>
2084
2085
2086
Chris Lattner00950542001-06-06 20:29:01 +00002087<!-- ======================================================================= -->
Chris Lattner261efe92003-11-25 01:02:51 +00002088<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002089<div class="doc_text">
Chris Lattner261efe92003-11-25 01:02:51 +00002090<p>Binary operators are used to do most of the computation in a
Chris Lattner5a158142008-04-01 18:47:32 +00002091program. They require two operands of the same type, execute an operation on them, and
John Criswell9e2485c2004-12-10 15:51:16 +00002092produce a single value. The operands might represent
Reid Spencer485bad12007-02-15 03:07:05 +00002093multiple data, as is the case with the <a href="#t_vector">vector</a> data type.
Chris Lattner5a158142008-04-01 18:47:32 +00002094The result value has the same type as its operands.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002095<p>There are several different binary operators:</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002096</div>
Chris Lattner00950542001-06-06 20:29:01 +00002097<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00002098<div class="doc_subsubsection">
2099 <a name="i_add">'<tt>add</tt>' Instruction</a>
2100</div>
2101
Misha Brukman9d0919f2003-11-08 01:05:38 +00002102<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002103
Chris Lattner00950542001-06-06 20:29:01 +00002104<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002105
2106<pre>
2107 &lt;result&gt; = add &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002108</pre>
Chris Lattner5568e942008-05-20 20:48:21 +00002109
Chris Lattner00950542001-06-06 20:29:01 +00002110<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002111
Misha Brukman9d0919f2003-11-08 01:05:38 +00002112<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002113
Chris Lattner00950542001-06-06 20:29:01 +00002114<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002115
2116<p>The two arguments to the '<tt>add</tt>' instruction must be <a
2117 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>, or
2118 <a href="#t_vector">vector</a> values. Both arguments must have identical
2119 types.</p>
2120
Chris Lattner00950542001-06-06 20:29:01 +00002121<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002122
Misha Brukman9d0919f2003-11-08 01:05:38 +00002123<p>The value produced is the integer or floating point sum of the two
2124operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002125
Chris Lattner5ec89832008-01-28 00:36:27 +00002126<p>If an integer sum has unsigned overflow, the result returned is the
2127mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2128the result.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002129
Chris Lattner5ec89832008-01-28 00:36:27 +00002130<p>Because LLVM integers use a two's complement representation, this
2131instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002132
Chris Lattner00950542001-06-06 20:29:01 +00002133<h5>Example:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002134
2135<pre>
2136 &lt;result&gt; = add i32 4, %var <i>; yields {i32}:result = 4 + %var</i>
Chris Lattner00950542001-06-06 20:29:01 +00002137</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002138</div>
Chris Lattner00950542001-06-06 20:29:01 +00002139<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00002140<div class="doc_subsubsection">
2141 <a name="i_sub">'<tt>sub</tt>' Instruction</a>
2142</div>
2143
Misha Brukman9d0919f2003-11-08 01:05:38 +00002144<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002145
Chris Lattner00950542001-06-06 20:29:01 +00002146<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002147
2148<pre>
2149 &lt;result&gt; = sub &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002150</pre>
Chris Lattner5568e942008-05-20 20:48:21 +00002151
Chris Lattner00950542001-06-06 20:29:01 +00002152<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002153
Misha Brukman9d0919f2003-11-08 01:05:38 +00002154<p>The '<tt>sub</tt>' instruction returns the difference of its two
2155operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002156
2157<p>Note that the '<tt>sub</tt>' instruction is used to represent the
2158'<tt>neg</tt>' instruction present in most other intermediate
2159representations.</p>
2160
Chris Lattner00950542001-06-06 20:29:01 +00002161<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002162
2163<p>The two arguments to the '<tt>sub</tt>' instruction must be <a
2164 href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2165 or <a href="#t_vector">vector</a> values. Both arguments must have identical
2166 types.</p>
2167
Chris Lattner00950542001-06-06 20:29:01 +00002168<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002169
Chris Lattner261efe92003-11-25 01:02:51 +00002170<p>The value produced is the integer or floating point difference of
2171the two operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002172
Chris Lattner5ec89832008-01-28 00:36:27 +00002173<p>If an integer difference has unsigned overflow, the result returned is the
2174mathematical result modulo 2<sup>n</sup>, where n is the bit width of
2175the result.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002176
Chris Lattner5ec89832008-01-28 00:36:27 +00002177<p>Because LLVM integers use a two's complement representation, this
2178instruction is appropriate for both signed and unsigned integers.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002179
Chris Lattner00950542001-06-06 20:29:01 +00002180<h5>Example:</h5>
Bill Wendlingaac388b2007-05-29 09:42:13 +00002181<pre>
2182 &lt;result&gt; = sub i32 4, %var <i>; yields {i32}:result = 4 - %var</i>
Reid Spencerca86e162006-12-31 07:07:53 +00002183 &lt;result&gt; = sub i32 0, %val <i>; yields {i32}:result = -%var</i>
Chris Lattner00950542001-06-06 20:29:01 +00002184</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002185</div>
Chris Lattner5568e942008-05-20 20:48:21 +00002186
Chris Lattner00950542001-06-06 20:29:01 +00002187<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00002188<div class="doc_subsubsection">
2189 <a name="i_mul">'<tt>mul</tt>' Instruction</a>
2190</div>
2191
Misha Brukman9d0919f2003-11-08 01:05:38 +00002192<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002193
Chris Lattner00950542001-06-06 20:29:01 +00002194<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00002195<pre> &lt;result&gt; = mul &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002196</pre>
Chris Lattner00950542001-06-06 20:29:01 +00002197<h5>Overview:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00002198<p>The '<tt>mul</tt>' instruction returns the product of its two
2199operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002200
Chris Lattner00950542001-06-06 20:29:01 +00002201<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002202
2203<p>The two arguments to the '<tt>mul</tt>' instruction must be <a
2204href="#t_integer">integer</a>, <a href="#t_floating">floating point</a>,
2205or <a href="#t_vector">vector</a> values. Both arguments must have identical
2206types.</p>
2207
Chris Lattner00950542001-06-06 20:29:01 +00002208<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002209
Chris Lattner261efe92003-11-25 01:02:51 +00002210<p>The value produced is the integer or floating point product of the
Misha Brukman9d0919f2003-11-08 01:05:38 +00002211two operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002212
Chris Lattner5ec89832008-01-28 00:36:27 +00002213<p>If the result of an integer multiplication has unsigned overflow,
2214the result returned is the mathematical result modulo
22152<sup>n</sup>, where n is the bit width of the result.</p>
2216<p>Because LLVM integers use a two's complement representation, and the
2217result is the same width as the operands, this instruction returns the
2218correct result for both signed and unsigned integers. If a full product
2219(e.g. <tt>i32</tt>x<tt>i32</tt>-><tt>i64</tt>) is needed, the operands
2220should be sign-extended or zero-extended as appropriate to the
2221width of the full product.</p>
Chris Lattner00950542001-06-06 20:29:01 +00002222<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002223<pre> &lt;result&gt; = mul i32 4, %var <i>; yields {i32}:result = 4 * %var</i>
Chris Lattner00950542001-06-06 20:29:01 +00002224</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002225</div>
Chris Lattner5568e942008-05-20 20:48:21 +00002226
Chris Lattner00950542001-06-06 20:29:01 +00002227<!-- _______________________________________________________________________ -->
Reid Spencer1628cec2006-10-26 06:15:43 +00002228<div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
2229</a></div>
2230<div class="doc_text">
2231<h5>Syntax:</h5>
2232<pre> &lt;result&gt; = udiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2233</pre>
2234<h5>Overview:</h5>
2235<p>The '<tt>udiv</tt>' instruction returns the quotient of its two
2236operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002237
Reid Spencer1628cec2006-10-26 06:15:43 +00002238<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002239
Reid Spencer1628cec2006-10-26 06:15:43 +00002240<p>The two arguments to the '<tt>udiv</tt>' instruction must be
Chris Lattner5568e942008-05-20 20:48:21 +00002241<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2242values. Both arguments must have identical types.</p>
2243
Reid Spencer1628cec2006-10-26 06:15:43 +00002244<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002245
Chris Lattner5ec89832008-01-28 00:36:27 +00002246<p>The value produced is the unsigned integer quotient of the two operands.</p>
2247<p>Note that unsigned integer division and signed integer division are distinct
2248operations; for signed integer division, use '<tt>sdiv</tt>'.</p>
2249<p>Division by zero leads to undefined behavior.</p>
Reid Spencer1628cec2006-10-26 06:15:43 +00002250<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002251<pre> &lt;result&gt; = udiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer1628cec2006-10-26 06:15:43 +00002252</pre>
2253</div>
2254<!-- _______________________________________________________________________ -->
2255<div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
2256</a> </div>
2257<div class="doc_text">
2258<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002259<pre>
2260 &lt;result&gt; = sdiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Reid Spencer1628cec2006-10-26 06:15:43 +00002261</pre>
Chris Lattner5568e942008-05-20 20:48:21 +00002262
Reid Spencer1628cec2006-10-26 06:15:43 +00002263<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002264
Reid Spencer1628cec2006-10-26 06:15:43 +00002265<p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
2266operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002267
Reid Spencer1628cec2006-10-26 06:15:43 +00002268<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002269
2270<p>The two arguments to the '<tt>sdiv</tt>' instruction must be
2271<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2272values. Both arguments must have identical types.</p>
2273
Reid Spencer1628cec2006-10-26 06:15:43 +00002274<h5>Semantics:</h5>
Chris Lattnera73afe02008-04-01 18:45:27 +00002275<p>The value produced is the signed integer quotient of the two operands rounded towards zero.</p>
Chris Lattner5ec89832008-01-28 00:36:27 +00002276<p>Note that signed integer division and unsigned integer division are distinct
2277operations; for unsigned integer division, use '<tt>udiv</tt>'.</p>
2278<p>Division by zero leads to undefined behavior. Overflow also leads to
2279undefined behavior; this is a rare case, but can occur, for example,
2280by doing a 32-bit division of -2147483648 by -1.</p>
Reid Spencer1628cec2006-10-26 06:15:43 +00002281<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002282<pre> &lt;result&gt; = sdiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer1628cec2006-10-26 06:15:43 +00002283</pre>
2284</div>
2285<!-- _______________________________________________________________________ -->
2286<div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
Chris Lattner261efe92003-11-25 01:02:51 +00002287Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002288<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00002289<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002290<pre>
2291 &lt;result&gt; = fdiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner261efe92003-11-25 01:02:51 +00002292</pre>
2293<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002294
Reid Spencer1628cec2006-10-26 06:15:43 +00002295<p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
Chris Lattner261efe92003-11-25 01:02:51 +00002296operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002297
Chris Lattner261efe92003-11-25 01:02:51 +00002298<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002299
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002300<p>The two arguments to the '<tt>fdiv</tt>' instruction must be
Chris Lattner5568e942008-05-20 20:48:21 +00002301<a href="#t_floating">floating point</a> or <a href="#t_vector">vector</a>
2302of floating point values. Both arguments must have identical types.</p>
2303
Chris Lattner261efe92003-11-25 01:02:51 +00002304<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002305
Reid Spencer1628cec2006-10-26 06:15:43 +00002306<p>The value produced is the floating point quotient of the two operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002307
Chris Lattner261efe92003-11-25 01:02:51 +00002308<h5>Example:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002309
2310<pre>
2311 &lt;result&gt; = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
Chris Lattner261efe92003-11-25 01:02:51 +00002312</pre>
2313</div>
Chris Lattner5568e942008-05-20 20:48:21 +00002314
Chris Lattner261efe92003-11-25 01:02:51 +00002315<!-- _______________________________________________________________________ -->
Reid Spencer0a783f72006-11-02 01:53:59 +00002316<div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
2317</div>
2318<div class="doc_text">
2319<h5>Syntax:</h5>
2320<pre> &lt;result&gt; = urem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2321</pre>
2322<h5>Overview:</h5>
2323<p>The '<tt>urem</tt>' instruction returns the remainder from the
2324unsigned division of its two arguments.</p>
2325<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002326<p>The two arguments to the '<tt>urem</tt>' instruction must be
2327<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2328values. Both arguments must have identical types.</p>
Reid Spencer0a783f72006-11-02 01:53:59 +00002329<h5>Semantics:</h5>
2330<p>This instruction returns the unsigned integer <i>remainder</i> of a division.
Chris Lattnera73afe02008-04-01 18:45:27 +00002331This instruction always performs an unsigned division to get the remainder.</p>
Chris Lattner5ec89832008-01-28 00:36:27 +00002332<p>Note that unsigned integer remainder and signed integer remainder are
2333distinct operations; for signed integer remainder, use '<tt>srem</tt>'.</p>
2334<p>Taking the remainder of a division by zero leads to undefined behavior.</p>
Reid Spencer0a783f72006-11-02 01:53:59 +00002335<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002336<pre> &lt;result&gt; = urem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer0a783f72006-11-02 01:53:59 +00002337</pre>
2338
2339</div>
2340<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00002341<div class="doc_subsubsection">
2342 <a name="i_srem">'<tt>srem</tt>' Instruction</a>
2343</div>
2344
Chris Lattner261efe92003-11-25 01:02:51 +00002345<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002346
Chris Lattner261efe92003-11-25 01:02:51 +00002347<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002348
2349<pre>
2350 &lt;result&gt; = srem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner261efe92003-11-25 01:02:51 +00002351</pre>
Chris Lattner5568e942008-05-20 20:48:21 +00002352
Chris Lattner261efe92003-11-25 01:02:51 +00002353<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002354
Reid Spencer0a783f72006-11-02 01:53:59 +00002355<p>The '<tt>srem</tt>' instruction returns the remainder from the
Dan Gohman80176312007-11-05 23:35:22 +00002356signed division of its two operands. This instruction can also take
2357<a href="#t_vector">vector</a> versions of the values in which case
2358the elements must be integers.</p>
Chris Lattnerc7d3ab32008-01-04 04:33:49 +00002359
Chris Lattner261efe92003-11-25 01:02:51 +00002360<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002361
Reid Spencer0a783f72006-11-02 01:53:59 +00002362<p>The two arguments to the '<tt>srem</tt>' instruction must be
Chris Lattner5568e942008-05-20 20:48:21 +00002363<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2364values. Both arguments must have identical types.</p>
2365
Chris Lattner261efe92003-11-25 01:02:51 +00002366<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002367
Reid Spencer0a783f72006-11-02 01:53:59 +00002368<p>This instruction returns the <i>remainder</i> of a division (where the result
Reid Spencerc9fdfc82007-03-24 22:23:39 +00002369has the same sign as the dividend, <tt>var1</tt>), not the <i>modulo</i>
2370operator (where the result has the same sign as the divisor, <tt>var2</tt>) of
2371a value. For more information about the difference, see <a
Chris Lattner261efe92003-11-25 01:02:51 +00002372 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
Reid Spencerc9fdfc82007-03-24 22:23:39 +00002373Math Forum</a>. For a table of how this is implemented in various languages,
Reid Spencer64f5c6c2007-03-24 22:40:44 +00002374please see <a href="http://en.wikipedia.org/wiki/Modulo_operation">
Reid Spencerc9fdfc82007-03-24 22:23:39 +00002375Wikipedia: modulo operation</a>.</p>
Chris Lattner5ec89832008-01-28 00:36:27 +00002376<p>Note that signed integer remainder and unsigned integer remainder are
2377distinct operations; for unsigned integer remainder, use '<tt>urem</tt>'.</p>
2378<p>Taking the remainder of a division by zero leads to undefined behavior.
2379Overflow also leads to undefined behavior; this is a rare case, but can occur,
2380for example, by taking the remainder of a 32-bit division of -2147483648 by -1.
2381(The remainder doesn't actually overflow, but this rule lets srem be
2382implemented using instructions that return both the result of the division
2383and the remainder.)</p>
Chris Lattner261efe92003-11-25 01:02:51 +00002384<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002385<pre> &lt;result&gt; = srem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer0a783f72006-11-02 01:53:59 +00002386</pre>
2387
2388</div>
2389<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00002390<div class="doc_subsubsection">
2391 <a name="i_frem">'<tt>frem</tt>' Instruction</a> </div>
2392
Reid Spencer0a783f72006-11-02 01:53:59 +00002393<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002394
Reid Spencer0a783f72006-11-02 01:53:59 +00002395<h5>Syntax:</h5>
2396<pre> &lt;result&gt; = frem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2397</pre>
2398<h5>Overview:</h5>
2399<p>The '<tt>frem</tt>' instruction returns the remainder from the
2400division of its two operands.</p>
2401<h5>Arguments:</h5>
2402<p>The two arguments to the '<tt>frem</tt>' instruction must be
Chris Lattner5568e942008-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
Reid Spencer0a783f72006-11-02 01:53:59 +00002406<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002407
Chris Lattnera73afe02008-04-01 18:45:27 +00002408<p>This instruction returns the <i>remainder</i> of a division.
2409The remainder has the same sign as the dividend.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002410
Reid Spencer0a783f72006-11-02 01:53:59 +00002411<h5>Example:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002412
2413<pre>
2414 &lt;result&gt; = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
Chris Lattner261efe92003-11-25 01:02:51 +00002415</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002416</div>
Robert Bocchino7b81c752006-02-17 21:18:08 +00002417
Reid Spencer8e11bf82007-02-02 13:57:07 +00002418<!-- ======================================================================= -->
2419<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
2420Operations</a> </div>
2421<div class="doc_text">
2422<p>Bitwise binary operators are used to do various forms of
2423bit-twiddling in a program. They are generally very efficient
2424instructions and can commonly be strength reduced from other
Chris Lattnera73afe02008-04-01 18:45:27 +00002425instructions. They require two operands of the same type, execute an operation on them,
2426and produce a single value. The resulting value is the same type as its operands.</p>
Reid Spencer8e11bf82007-02-02 13:57:07 +00002427</div>
2428
Reid Spencer569f2fa2007-01-31 21:39:12 +00002429<!-- _______________________________________________________________________ -->
2430<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2431Instruction</a> </div>
2432<div class="doc_text">
2433<h5>Syntax:</h5>
2434<pre> &lt;result&gt; = shl &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2435</pre>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002436
Reid Spencer569f2fa2007-01-31 21:39:12 +00002437<h5>Overview:</h5>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002438
Reid Spencer569f2fa2007-01-31 21:39:12 +00002439<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2440the left a specified number of bits.</p>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002441
Reid Spencer569f2fa2007-01-31 21:39:12 +00002442<h5>Arguments:</h5>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002443
Reid Spencer569f2fa2007-01-31 21:39:12 +00002444<p>Both arguments to the '<tt>shl</tt>' instruction must be the same <a
Chris Lattner72ed2002008-04-19 21:01:16 +00002445 href="#t_integer">integer</a> type. '<tt>var2</tt>' is treated as an
Chris Lattner5568e942008-05-20 20:48:21 +00002446unsigned value. This instruction does not support
2447<a href="#t_vector">vector</a> operands.</p>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002448
Reid Spencer569f2fa2007-01-31 21:39:12 +00002449<h5>Semantics:</h5>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002450
Chris Lattnera73afe02008-04-01 18:45:27 +00002451<p>The value produced is <tt>var1</tt> * 2<sup><tt>var2</tt></sup> mod 2<sup>n</sup>,
2452where n is the width of the result. If <tt>var2</tt> is (statically or dynamically) negative or
2453equal to or larger than the number of bits in <tt>var1</tt>, the result is undefined.</p>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002454
Reid Spencer569f2fa2007-01-31 21:39:12 +00002455<h5>Example:</h5><pre>
2456 &lt;result&gt; = shl i32 4, %var <i>; yields {i32}: 4 &lt;&lt; %var</i>
2457 &lt;result&gt; = shl i32 4, 2 <i>; yields {i32}: 16</i>
2458 &lt;result&gt; = shl i32 1, 10 <i>; yields {i32}: 1024</i>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002459 &lt;result&gt; = shl i32 1, 32 <i>; undefined</i>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002460</pre>
2461</div>
2462<!-- _______________________________________________________________________ -->
2463<div class="doc_subsubsection"> <a name="i_lshr">'<tt>lshr</tt>'
2464Instruction</a> </div>
2465<div class="doc_text">
2466<h5>Syntax:</h5>
2467<pre> &lt;result&gt; = lshr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2468</pre>
2469
2470<h5>Overview:</h5>
2471<p>The '<tt>lshr</tt>' instruction (logical shift right) returns the first
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002472operand shifted to the right a specified number of bits with zero fill.</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002473
2474<h5>Arguments:</h5>
2475<p>Both arguments to the '<tt>lshr</tt>' instruction must be the same
Chris Lattner72ed2002008-04-19 21:01:16 +00002476<a href="#t_integer">integer</a> type. '<tt>var2</tt>' is treated as an
Chris Lattner5568e942008-05-20 20:48:21 +00002477unsigned value. This instruction does not support
2478<a href="#t_vector">vector</a> operands.</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002479
2480<h5>Semantics:</h5>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002481
Reid Spencer569f2fa2007-01-31 21:39:12 +00002482<p>This instruction always performs a logical shift right operation. The most
2483significant bits of the result will be filled with zero bits after the
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002484shift. If <tt>var2</tt> is (statically or dynamically) equal to or larger than
2485the number of bits in <tt>var1</tt>, the result is undefined.</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002486
2487<h5>Example:</h5>
2488<pre>
2489 &lt;result&gt; = lshr i32 4, 1 <i>; yields {i32}:result = 2</i>
2490 &lt;result&gt; = lshr i32 4, 2 <i>; yields {i32}:result = 1</i>
2491 &lt;result&gt; = lshr i8 4, 3 <i>; yields {i8}:result = 0</i>
2492 &lt;result&gt; = lshr i8 -2, 1 <i>; yields {i8}:result = 0x7FFFFFFF </i>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002493 &lt;result&gt; = lshr i32 1, 32 <i>; undefined</i>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002494</pre>
2495</div>
2496
Reid Spencer8e11bf82007-02-02 13:57:07 +00002497<!-- _______________________________________________________________________ -->
Reid Spencer569f2fa2007-01-31 21:39:12 +00002498<div class="doc_subsubsection"> <a name="i_ashr">'<tt>ashr</tt>'
2499Instruction</a> </div>
2500<div class="doc_text">
2501
2502<h5>Syntax:</h5>
2503<pre> &lt;result&gt; = ashr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2504</pre>
2505
2506<h5>Overview:</h5>
2507<p>The '<tt>ashr</tt>' instruction (arithmetic shift right) returns the first
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002508operand shifted to the right a specified number of bits with sign extension.</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002509
2510<h5>Arguments:</h5>
2511<p>Both arguments to the '<tt>ashr</tt>' instruction must be the same
Chris Lattner72ed2002008-04-19 21:01:16 +00002512<a href="#t_integer">integer</a> type. '<tt>var2</tt>' is treated as an
Chris Lattner5568e942008-05-20 20:48:21 +00002513unsigned value. This instruction does not support
2514<a href="#t_vector">vector</a> operands.</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002515
2516<h5>Semantics:</h5>
2517<p>This instruction always performs an arithmetic shift right operation,
2518The most significant bits of the result will be filled with the sign bit
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002519of <tt>var1</tt>. If <tt>var2</tt> is (statically or dynamically) equal to or
2520larger than the number of bits in <tt>var1</tt>, the result is undefined.
2521</p>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002522
2523<h5>Example:</h5>
2524<pre>
2525 &lt;result&gt; = ashr i32 4, 1 <i>; yields {i32}:result = 2</i>
2526 &lt;result&gt; = ashr i32 4, 2 <i>; yields {i32}:result = 1</i>
2527 &lt;result&gt; = ashr i8 4, 3 <i>; yields {i8}:result = 0</i>
2528 &lt;result&gt; = ashr i8 -2, 1 <i>; yields {i8}:result = -1</i>
Chris Lattner6ccc2d52007-10-03 21:01:14 +00002529 &lt;result&gt; = ashr i32 1, 32 <i>; undefined</i>
Reid Spencer569f2fa2007-01-31 21:39:12 +00002530</pre>
2531</div>
2532
Chris Lattner00950542001-06-06 20:29:01 +00002533<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00002534<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
2535Instruction</a> </div>
Chris Lattner5568e942008-05-20 20:48:21 +00002536
Misha Brukman9d0919f2003-11-08 01:05:38 +00002537<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00002538
Chris Lattner00950542001-06-06 20:29:01 +00002539<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002540
2541<pre>
2542 &lt;result&gt; = and &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002543</pre>
Chris Lattner5568e942008-05-20 20:48:21 +00002544
Chris Lattner00950542001-06-06 20:29:01 +00002545<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002546
Chris Lattner261efe92003-11-25 01:02:51 +00002547<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
2548its two operands.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00002549
Chris Lattner00950542001-06-06 20:29:01 +00002550<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002551
2552<p>The two arguments to the '<tt>and</tt>' instruction must be
2553<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2554values. Both arguments must have identical types.</p>
2555
Chris Lattner00950542001-06-06 20:29:01 +00002556<h5>Semantics:</h5>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002557<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
Chris Lattner261efe92003-11-25 01:02:51 +00002558<p> </p>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002559<div style="align: center">
Misha Brukman9d0919f2003-11-08 01:05:38 +00002560<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner261efe92003-11-25 01:02:51 +00002561 <tbody>
2562 <tr>
2563 <td>In0</td>
2564 <td>In1</td>
2565 <td>Out</td>
2566 </tr>
2567 <tr>
2568 <td>0</td>
2569 <td>0</td>
2570 <td>0</td>
2571 </tr>
2572 <tr>
2573 <td>0</td>
2574 <td>1</td>
2575 <td>0</td>
2576 </tr>
2577 <tr>
2578 <td>1</td>
2579 <td>0</td>
2580 <td>0</td>
2581 </tr>
2582 <tr>
2583 <td>1</td>
2584 <td>1</td>
2585 <td>1</td>
2586 </tr>
2587 </tbody>
2588</table>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002589</div>
Chris Lattner00950542001-06-06 20:29:01 +00002590<h5>Example:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002591<pre>
2592 &lt;result&gt; = and i32 4, %var <i>; yields {i32}:result = 4 &amp; %var</i>
Reid Spencerca86e162006-12-31 07:07:53 +00002593 &lt;result&gt; = and i32 15, 40 <i>; yields {i32}:result = 8</i>
2594 &lt;result&gt; = and i32 4, 8 <i>; yields {i32}:result = 0</i>
Chris Lattner00950542001-06-06 20:29:01 +00002595</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002596</div>
Chris Lattner00950542001-06-06 20:29:01 +00002597<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00002598<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002599<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00002600<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00002601<pre> &lt;result&gt; = or &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002602</pre>
Chris Lattner261efe92003-11-25 01:02:51 +00002603<h5>Overview:</h5>
2604<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
2605or of its two operands.</p>
Chris Lattner00950542001-06-06 20:29:01 +00002606<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002607
2608<p>The two arguments to the '<tt>or</tt>' instruction must be
2609<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2610values. Both arguments must have identical types.</p>
Chris Lattner00950542001-06-06 20:29:01 +00002611<h5>Semantics:</h5>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002612<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
Chris Lattner261efe92003-11-25 01:02:51 +00002613<p> </p>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002614<div style="align: center">
Chris Lattner261efe92003-11-25 01:02:51 +00002615<table border="1" cellspacing="0" cellpadding="4">
2616 <tbody>
2617 <tr>
2618 <td>In0</td>
2619 <td>In1</td>
2620 <td>Out</td>
2621 </tr>
2622 <tr>
2623 <td>0</td>
2624 <td>0</td>
2625 <td>0</td>
2626 </tr>
2627 <tr>
2628 <td>0</td>
2629 <td>1</td>
2630 <td>1</td>
2631 </tr>
2632 <tr>
2633 <td>1</td>
2634 <td>0</td>
2635 <td>1</td>
2636 </tr>
2637 <tr>
2638 <td>1</td>
2639 <td>1</td>
2640 <td>1</td>
2641 </tr>
2642 </tbody>
2643</table>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002644</div>
Chris Lattner00950542001-06-06 20:29:01 +00002645<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002646<pre> &lt;result&gt; = or i32 4, %var <i>; yields {i32}:result = 4 | %var</i>
2647 &lt;result&gt; = or i32 15, 40 <i>; yields {i32}:result = 47</i>
2648 &lt;result&gt; = or i32 4, 8 <i>; yields {i32}:result = 12</i>
Chris Lattner00950542001-06-06 20:29:01 +00002649</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002650</div>
Chris Lattner00950542001-06-06 20:29:01 +00002651<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00002652<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
2653Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002654<div class="doc_text">
Chris Lattner00950542001-06-06 20:29:01 +00002655<h5>Syntax:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00002656<pre> &lt;result&gt; = xor &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00002657</pre>
Chris Lattner00950542001-06-06 20:29:01 +00002658<h5>Overview:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00002659<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2660or of its two operands. The <tt>xor</tt> is used to implement the
2661"one's complement" operation, which is the "~" operator in C.</p>
Chris Lattner00950542001-06-06 20:29:01 +00002662<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002663<p>The two arguments to the '<tt>xor</tt>' instruction must be
2664<a href="#t_integer">integer</a> or <a href="#t_vector">vector</a> of integer
2665values. Both arguments must have identical types.</p>
2666
Chris Lattner00950542001-06-06 20:29:01 +00002667<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00002668
Misha Brukman9d0919f2003-11-08 01:05:38 +00002669<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
Chris Lattner261efe92003-11-25 01:02:51 +00002670<p> </p>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002671<div style="align: center">
Chris Lattner261efe92003-11-25 01:02:51 +00002672<table border="1" cellspacing="0" cellpadding="4">
2673 <tbody>
2674 <tr>
2675 <td>In0</td>
2676 <td>In1</td>
2677 <td>Out</td>
2678 </tr>
2679 <tr>
2680 <td>0</td>
2681 <td>0</td>
2682 <td>0</td>
2683 </tr>
2684 <tr>
2685 <td>0</td>
2686 <td>1</td>
2687 <td>1</td>
2688 </tr>
2689 <tr>
2690 <td>1</td>
2691 <td>0</td>
2692 <td>1</td>
2693 </tr>
2694 <tr>
2695 <td>1</td>
2696 <td>1</td>
2697 <td>0</td>
2698 </tr>
2699 </tbody>
2700</table>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00002701</div>
Chris Lattner261efe92003-11-25 01:02:51 +00002702<p> </p>
Chris Lattner00950542001-06-06 20:29:01 +00002703<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00002704<pre> &lt;result&gt; = xor i32 4, %var <i>; yields {i32}:result = 4 ^ %var</i>
2705 &lt;result&gt; = xor i32 15, 40 <i>; yields {i32}:result = 39</i>
2706 &lt;result&gt; = xor i32 4, 8 <i>; yields {i32}:result = 12</i>
2707 &lt;result&gt; = xor i32 %V, -1 <i>; yields {i32}:result = ~%V</i>
Chris Lattner00950542001-06-06 20:29:01 +00002708</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00002709</div>
Chris Lattner2cbdc452005-11-06 08:02:57 +00002710
Chris Lattner00950542001-06-06 20:29:01 +00002711<!-- ======================================================================= -->
Chris Lattner2cbdc452005-11-06 08:02:57 +00002712<div class="doc_subsection">
Chris Lattner3df241e2006-04-08 23:07:04 +00002713 <a name="vectorops">Vector Operations</a>
2714</div>
2715
2716<div class="doc_text">
2717
2718<p>LLVM supports several instructions to represent vector operations in a
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002719target-independent manner. These instructions cover the element-access and
Chris Lattner3df241e2006-04-08 23:07:04 +00002720vector-specific operations needed to process vectors effectively. While LLVM
2721does directly support these vector operations, many sophisticated algorithms
2722will want to use target-specific intrinsics to take full advantage of a specific
2723target.</p>
2724
2725</div>
2726
2727<!-- _______________________________________________________________________ -->
2728<div class="doc_subsubsection">
2729 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
2730</div>
2731
2732<div class="doc_text">
2733
2734<h5>Syntax:</h5>
2735
2736<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00002737 &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 Lattner3df241e2006-04-08 23:07:04 +00002738</pre>
2739
2740<h5>Overview:</h5>
2741
2742<p>
2743The '<tt>extractelement</tt>' instruction extracts a single scalar
Reid Spencer485bad12007-02-15 03:07:05 +00002744element from a vector at a specified index.
Chris Lattner3df241e2006-04-08 23:07:04 +00002745</p>
2746
2747
2748<h5>Arguments:</h5>
2749
2750<p>
2751The first operand of an '<tt>extractelement</tt>' instruction is a
Reid Spencer485bad12007-02-15 03:07:05 +00002752value of <a href="#t_vector">vector</a> type. The second operand is
Chris Lattner3df241e2006-04-08 23:07:04 +00002753an index indicating the position from which to extract the element.
2754The index may be a variable.</p>
2755
2756<h5>Semantics:</h5>
2757
2758<p>
2759The result is a scalar of the same type as the element type of
2760<tt>val</tt>. Its value is the value at position <tt>idx</tt> of
2761<tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
2762results are undefined.
2763</p>
2764
2765<h5>Example:</h5>
2766
2767<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00002768 %result = extractelement &lt;4 x i32&gt; %vec, i32 0 <i>; yields i32</i>
Chris Lattner3df241e2006-04-08 23:07:04 +00002769</pre>
2770</div>
2771
2772
2773<!-- _______________________________________________________________________ -->
2774<div class="doc_subsubsection">
2775 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
2776</div>
2777
2778<div class="doc_text">
2779
2780<h5>Syntax:</h5>
2781
2782<pre>
Dan Gohmanf3480b92008-05-12 23:38:42 +00002783 &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 Lattner3df241e2006-04-08 23:07:04 +00002784</pre>
2785
2786<h5>Overview:</h5>
2787
2788<p>
2789The '<tt>insertelement</tt>' instruction inserts a scalar
Reid Spencer485bad12007-02-15 03:07:05 +00002790element into a vector at a specified index.
Chris Lattner3df241e2006-04-08 23:07:04 +00002791</p>
2792
2793
2794<h5>Arguments:</h5>
2795
2796<p>
2797The first operand of an '<tt>insertelement</tt>' instruction is a
Reid Spencer485bad12007-02-15 03:07:05 +00002798value of <a href="#t_vector">vector</a> type. The second operand is a
Chris Lattner3df241e2006-04-08 23:07:04 +00002799scalar value whose type must equal the element type of the first
2800operand. The third operand is an index indicating the position at
2801which to insert the value. The index may be a variable.</p>
2802
2803<h5>Semantics:</h5>
2804
2805<p>
Reid Spencer485bad12007-02-15 03:07:05 +00002806The result is a vector of the same type as <tt>val</tt>. Its
Chris Lattner3df241e2006-04-08 23:07:04 +00002807element values are those of <tt>val</tt> except at position
2808<tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
2809exceeds the length of <tt>val</tt>, the results are undefined.
2810</p>
2811
2812<h5>Example:</h5>
2813
2814<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00002815 %result = insertelement &lt;4 x i32&gt; %vec, i32 1, i32 0 <i>; yields &lt;4 x i32&gt;</i>
Chris Lattner3df241e2006-04-08 23:07:04 +00002816</pre>
2817</div>
2818
2819<!-- _______________________________________________________________________ -->
2820<div class="doc_subsubsection">
2821 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
2822</div>
2823
2824<div class="doc_text">
2825
2826<h5>Syntax:</h5>
2827
2828<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00002829 &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 Lattner3df241e2006-04-08 23:07:04 +00002830</pre>
2831
2832<h5>Overview:</h5>
2833
2834<p>
2835The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
2836from two input vectors, returning a vector of the same type.
2837</p>
2838
2839<h5>Arguments:</h5>
2840
2841<p>
2842The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
2843with types that match each other and types that match the result of the
2844instruction. The third argument is a shuffle mask, which has the same number
Reid Spencerca86e162006-12-31 07:07:53 +00002845of elements as the other vector type, but whose element type is always 'i32'.
Chris Lattner3df241e2006-04-08 23:07:04 +00002846</p>
2847
2848<p>
2849The shuffle mask operand is required to be a constant vector with either
2850constant integer or undef values.
2851</p>
2852
2853<h5>Semantics:</h5>
2854
2855<p>
2856The elements of the two input vectors are numbered from left to right across
2857both of the vectors. The shuffle mask operand specifies, for each element of
2858the result vector, which element of the two input registers the result element
2859gets. The element selector may be undef (meaning "don't care") and the second
2860operand may be undef if performing a shuffle from only one vector.
2861</p>
2862
2863<h5>Example:</h5>
2864
2865<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00002866 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
Jeff Cohen6f1cc772007-04-22 01:17:39 +00002867 &lt;4 x i32&gt; &lt;i32 0, i32 4, i32 1, i32 5&gt; <i>; yields &lt;4 x i32&gt;</i>
Reid Spencerca86e162006-12-31 07:07:53 +00002868 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; undef,
2869 &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 Lattner3df241e2006-04-08 23:07:04 +00002870</pre>
2871</div>
2872
Tanya Lattner09474292006-04-14 19:24:33 +00002873
Chris Lattner3df241e2006-04-08 23:07:04 +00002874<!-- ======================================================================= -->
2875<div class="doc_subsection">
Dan Gohmana334d5f2008-05-12 23:51:09 +00002876 <a name="aggregateops">Aggregate Operations</a>
2877</div>
2878
2879<div class="doc_text">
2880
2881<p>LLVM supports several instructions for working with aggregate values.
2882</p>
2883
2884</div>
2885
2886<!-- _______________________________________________________________________ -->
2887<div class="doc_subsubsection">
2888 <a name="i_extractvalue">'<tt>extractvalue</tt>' Instruction</a>
2889</div>
2890
2891<div class="doc_text">
2892
2893<h5>Syntax:</h5>
2894
2895<pre>
2896 &lt;result&gt; = extractvalue &lt;aggregate type&gt; &lt;val&gt;, &lt;idx&gt;{, &lt;idx&gt;}*
2897</pre>
2898
2899<h5>Overview:</h5>
2900
2901<p>
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002902The '<tt>extractvalue</tt>' instruction extracts the value of a struct field
2903or array element from an aggregate value.
Dan Gohmana334d5f2008-05-12 23:51:09 +00002904</p>
2905
2906
2907<h5>Arguments:</h5>
2908
2909<p>
2910The first operand of an '<tt>extractvalue</tt>' instruction is a
2911value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a>
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002912type. The operands are constant indices to specify which value to extract
2913in the same manner as indices in a
Dan Gohmana334d5f2008-05-12 23:51:09 +00002914'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
2915</p>
2916
2917<h5>Semantics:</h5>
2918
2919<p>
2920The result is the value at the position in the aggregate specified by
2921the index operands.
2922</p>
2923
2924<h5>Example:</h5>
2925
2926<pre>
2927 %result = extractvalue {i32, float} %agg, i32 0 <i>; yields i32</i>
2928</pre>
2929</div>
2930
2931
2932<!-- _______________________________________________________________________ -->
2933<div class="doc_subsubsection">
2934 <a name="i_insertvalue">'<tt>insertvalue</tt>' Instruction</a>
2935</div>
2936
2937<div class="doc_text">
2938
2939<h5>Syntax:</h5>
2940
2941<pre>
2942 &lt;result&gt; = insertvalue &lt;aggregate type&gt; &lt;val&gt;, &lt;ty&gt; &lt;val&gt;, i32 &lt;idx&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
2943</pre>
2944
2945<h5>Overview:</h5>
2946
2947<p>
2948The '<tt>insertvalue</tt>' instruction inserts a value
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002949into a struct field or array element in an aggregate.
Dan Gohmana334d5f2008-05-12 23:51:09 +00002950</p>
2951
2952
2953<h5>Arguments:</h5>
2954
2955<p>
2956The first operand of an '<tt>insertvalue</tt>' instruction is a
2957value of <a href="#t_struct">struct</a> or <a href="#t_array">array</a> type.
2958The second operand is a first-class value to insert.
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002959type of the first operand. The following operands are constant indices
Dan Gohmana334d5f2008-05-12 23:51:09 +00002960indicating the position at which to insert the value in the same manner as
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002961indices in a
Dan Gohmana334d5f2008-05-12 23:51:09 +00002962'<tt><a href="#i_getelementptr">getelementptr</a></tt>' instruction.
2963The value to insert must have the same type as the value identified
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002964by the indices.
Dan Gohmana334d5f2008-05-12 23:51:09 +00002965
2966<h5>Semantics:</h5>
2967
2968<p>
2969The result is an aggregate of the same type as <tt>val</tt>. Its
2970value is that of <tt>val</tt> except that the value at the position
Dan Gohmanc3dac5c2008-05-13 18:16:06 +00002971specified by the indices is that of <tt>elt</tt>.
Dan Gohmana334d5f2008-05-12 23:51:09 +00002972</p>
2973
2974<h5>Example:</h5>
2975
2976<pre>
2977 %result = insertvalue {i32, float} %agg, i32 1, i32 0 <i>; yields {i32, float}</i>
2978</pre>
2979</div>
2980
2981
2982<!-- ======================================================================= -->
2983<div class="doc_subsection">
Chris Lattner884a9702006-08-15 00:45:58 +00002984 <a name="memoryops">Memory Access and Addressing Operations</a>
Chris Lattner2cbdc452005-11-06 08:02:57 +00002985</div>
2986
Misha Brukman9d0919f2003-11-08 01:05:38 +00002987<div class="doc_text">
Chris Lattner2cbdc452005-11-06 08:02:57 +00002988
Chris Lattner261efe92003-11-25 01:02:51 +00002989<p>A key design point of an SSA-based representation is how it
2990represents memory. In LLVM, no memory locations are in SSA form, which
2991makes things very simple. This section describes how to read, write,
John Criswell9e2485c2004-12-10 15:51:16 +00002992allocate, and free memory in LLVM.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00002993
Misha Brukman9d0919f2003-11-08 01:05:38 +00002994</div>
Chris Lattner2cbdc452005-11-06 08:02:57 +00002995
Chris Lattner00950542001-06-06 20:29:01 +00002996<!-- _______________________________________________________________________ -->
Chris Lattner2cbdc452005-11-06 08:02:57 +00002997<div class="doc_subsubsection">
2998 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
2999</div>
3000
Misha Brukman9d0919f2003-11-08 01:05:38 +00003001<div class="doc_text">
Chris Lattner2cbdc452005-11-06 08:02:57 +00003002
Chris Lattner00950542001-06-06 20:29:01 +00003003<h5>Syntax:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003004
3005<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003006 &lt;result&gt; = malloc &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00003007</pre>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003008
Chris Lattner00950542001-06-06 20:29:01 +00003009<h5>Overview:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003010
Chris Lattner261efe92003-11-25 01:02:51 +00003011<p>The '<tt>malloc</tt>' instruction allocates memory from the system
Christopher Lamb303dae92007-12-17 01:00:21 +00003012heap and returns a pointer to it. The object is always allocated in the generic
3013address space (address space zero).</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003014
Chris Lattner00950542001-06-06 20:29:01 +00003015<h5>Arguments:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003016
3017<p>The '<tt>malloc</tt>' instruction allocates
3018<tt>sizeof(&lt;type&gt;)*NumElements</tt>
John Criswell6e4ca612004-02-24 16:13:56 +00003019bytes of memory from the operating system and returns a pointer of the
Chris Lattner2cbdc452005-11-06 08:02:57 +00003020appropriate type to the program. If "NumElements" is specified, it is the
Gabor Greif1acd2ee2008-02-09 22:24:34 +00003021number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner4316dec2008-04-02 00:38:26 +00003022If a constant alignment is specified, the value result of the allocation is guaranteed to
Gabor Greif1acd2ee2008-02-09 22:24:34 +00003023be aligned to at least that boundary. If not specified, or if zero, the target can
3024choose to align the allocation on any convenient boundary.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003025
Misha Brukman9d0919f2003-11-08 01:05:38 +00003026<p>'<tt>type</tt>' must be a sized type.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003027
Chris Lattner00950542001-06-06 20:29:01 +00003028<h5>Semantics:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003029
Chris Lattner261efe92003-11-25 01:02:51 +00003030<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
Chris Lattner72ed2002008-04-19 21:01:16 +00003031a pointer is returned. The result of a zero byte allocattion is undefined. The
3032result is null if there is insufficient memory available.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003033
Chris Lattner2cbdc452005-11-06 08:02:57 +00003034<h5>Example:</h5>
3035
3036<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003037 %array = malloc [4 x i8 ] <i>; yields {[%4 x i8]*}:array</i>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003038
Bill Wendlingaac388b2007-05-29 09:42:13 +00003039 %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
3040 %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>
3041 %array2 = malloc [12 x i8], i32 %size <i>; yields {[12 x i8]*}:array2</i>
3042 %array3 = malloc i32, i32 4, align 1024 <i>; yields {i32*}:array3</i>
3043 %array4 = malloc i32, align 1024 <i>; yields {i32*}:array4</i>
Chris Lattner00950542001-06-06 20:29:01 +00003044</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003045</div>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003046
Chris Lattner00950542001-06-06 20:29:01 +00003047<!-- _______________________________________________________________________ -->
Chris Lattner2cbdc452005-11-06 08:02:57 +00003048<div class="doc_subsubsection">
3049 <a name="i_free">'<tt>free</tt>' Instruction</a>
3050</div>
3051
Misha Brukman9d0919f2003-11-08 01:05:38 +00003052<div class="doc_text">
Chris Lattner2cbdc452005-11-06 08:02:57 +00003053
Chris Lattner00950542001-06-06 20:29:01 +00003054<h5>Syntax:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003055
3056<pre>
3057 free &lt;type&gt; &lt;value&gt; <i>; yields {void}</i>
Chris Lattner00950542001-06-06 20:29:01 +00003058</pre>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003059
Chris Lattner00950542001-06-06 20:29:01 +00003060<h5>Overview:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003061
Chris Lattner261efe92003-11-25 01:02:51 +00003062<p>The '<tt>free</tt>' instruction returns memory back to the unused
John Criswellc1f786c2005-05-13 22:25:59 +00003063memory heap to be reallocated in the future.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003064
Chris Lattner00950542001-06-06 20:29:01 +00003065<h5>Arguments:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003066
Chris Lattner261efe92003-11-25 01:02:51 +00003067<p>'<tt>value</tt>' shall be a pointer value that points to a value
3068that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
3069instruction.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003070
Chris Lattner00950542001-06-06 20:29:01 +00003071<h5>Semantics:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003072
John Criswell9e2485c2004-12-10 15:51:16 +00003073<p>Access to the memory pointed to by the pointer is no longer defined
Chris Lattnere0db56d2008-04-19 22:41:32 +00003074after this instruction executes. If the pointer is null, the operation
3075is a noop.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003076
Chris Lattner00950542001-06-06 20:29:01 +00003077<h5>Example:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003078
3079<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003080 %array = <a href="#i_malloc">malloc</a> [4 x i8] <i>; yields {[4 x i8]*}:array</i>
3081 free [4 x i8]* %array
Chris Lattner00950542001-06-06 20:29:01 +00003082</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003083</div>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003084
Chris Lattner00950542001-06-06 20:29:01 +00003085<!-- _______________________________________________________________________ -->
Chris Lattner2cbdc452005-11-06 08:02:57 +00003086<div class="doc_subsubsection">
3087 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
3088</div>
3089
Misha Brukman9d0919f2003-11-08 01:05:38 +00003090<div class="doc_text">
Chris Lattner2cbdc452005-11-06 08:02:57 +00003091
Chris Lattner00950542001-06-06 20:29:01 +00003092<h5>Syntax:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003093
3094<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003095 &lt;result&gt; = alloca &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner00950542001-06-06 20:29:01 +00003096</pre>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003097
Chris Lattner00950542001-06-06 20:29:01 +00003098<h5>Overview:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003099
Jeff Cohen6f1cc772007-04-22 01:17:39 +00003100<p>The '<tt>alloca</tt>' instruction allocates memory on the stack frame of the
3101currently executing function, to be automatically released when this function
Christopher Lamb303dae92007-12-17 01:00:21 +00003102returns to its caller. The object is always allocated in the generic address
3103space (address space zero).</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003104
Chris Lattner00950542001-06-06 20:29:01 +00003105<h5>Arguments:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003106
John Criswell9e2485c2004-12-10 15:51:16 +00003107<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
Chris Lattner261efe92003-11-25 01:02:51 +00003108bytes of memory on the runtime stack, returning a pointer of the
Gabor Greif1acd2ee2008-02-09 22:24:34 +00003109appropriate type to the program. If "NumElements" is specified, it is the
3110number of elements allocated, otherwise "NumElements" is defaulted to be one.
Chris Lattner4316dec2008-04-02 00:38:26 +00003111If a constant alignment is specified, the value result of the allocation is guaranteed
Gabor Greif1acd2ee2008-02-09 22:24:34 +00003112to be aligned to at least that boundary. If not specified, or if zero, the target
3113can choose to align the allocation on any convenient boundary.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003114
Misha Brukman9d0919f2003-11-08 01:05:38 +00003115<p>'<tt>type</tt>' may be any sized type.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003116
Chris Lattner00950542001-06-06 20:29:01 +00003117<h5>Semantics:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003118
Chris Lattner72ed2002008-04-19 21:01:16 +00003119<p>Memory is allocated; a pointer is returned. The operation is undefiend if
3120there is insufficient stack space for the allocation. '<tt>alloca</tt>'d
Chris Lattner261efe92003-11-25 01:02:51 +00003121memory is automatically released when the function returns. The '<tt>alloca</tt>'
3122instruction is commonly used to represent automatic variables that must
3123have an address available. When the function returns (either with the <tt><a
John Criswelldae2e932005-05-12 16:55:34 +00003124 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
Chris Lattner4316dec2008-04-02 00:38:26 +00003125instructions), the memory is reclaimed. Allocating zero bytes
3126is legal, but the result is undefined.</p>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003127
Chris Lattner00950542001-06-06 20:29:01 +00003128<h5>Example:</h5>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003129
3130<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003131 %ptr = alloca i32 <i>; yields {i32*}:ptr</i>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003132 %ptr = alloca i32, i32 4 <i>; yields {i32*}:ptr</i>
3133 %ptr = alloca i32, i32 4, align 1024 <i>; yields {i32*}:ptr</i>
Reid Spencerca86e162006-12-31 07:07:53 +00003134 %ptr = alloca i32, align 1024 <i>; yields {i32*}:ptr</i>
Chris Lattner00950542001-06-06 20:29:01 +00003135</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003136</div>
Chris Lattner2cbdc452005-11-06 08:02:57 +00003137
Chris Lattner00950542001-06-06 20:29:01 +00003138<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00003139<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
3140Instruction</a> </div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003141<div class="doc_text">
Chris Lattner2b7d3202002-05-06 03:03:22 +00003142<h5>Syntax:</h5>
Christopher Lamb2330e4d2007-04-21 08:16:25 +00003143<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 Lattner2b7d3202002-05-06 03:03:22 +00003144<h5>Overview:</h5>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003145<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003146<h5>Arguments:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00003147<p>The argument to the '<tt>load</tt>' instruction specifies the memory
John Criswell0ec250c2005-10-24 16:17:18 +00003148address from which to load. The pointer must point to a <a
Chris Lattnere53e5082004-06-03 22:57:15 +00003149 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
John Criswell0ec250c2005-10-24 16:17:18 +00003150marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
Chris Lattner261efe92003-11-25 01:02:51 +00003151the number or order of execution of this <tt>load</tt> with other
3152volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
3153instructions. </p>
Chris Lattnera31d1d72008-01-06 21:04:43 +00003154<p>
Chris Lattner4316dec2008-04-02 00:38:26 +00003155The optional constant "align" argument specifies the alignment of the operation
Chris Lattnera31d1d72008-01-06 21:04:43 +00003156(that is, the alignment of the memory address). A value of 0 or an
3157omitted "align" argument means that the operation has the preferential
3158alignment for the target. It is the responsibility of the code emitter
3159to ensure that the alignment information is correct. Overestimating
3160the alignment results in an undefined behavior. Underestimating the
3161alignment may produce less efficient code. An alignment of 1 is always
3162safe.
3163</p>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003164<h5>Semantics:</h5>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003165<p>The location of memory pointed to is loaded.</p>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003166<h5>Examples:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00003167<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Chris Lattner261efe92003-11-25 01:02:51 +00003168 <a
Reid Spencerca86e162006-12-31 07:07:53 +00003169 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
3170 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003171</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003172</div>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003173<!-- _______________________________________________________________________ -->
Chris Lattner261efe92003-11-25 01:02:51 +00003174<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
3175Instruction</a> </div>
Reid Spencer035ab572006-11-09 21:18:01 +00003176<div class="doc_text">
Chris Lattner2b7d3202002-05-06 03:03:22 +00003177<h5>Syntax:</h5>
Christopher Lamb2330e4d2007-04-21 08:16:25 +00003178<pre> store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
3179 volatile store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003180</pre>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003181<h5>Overview:</h5>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003182<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003183<h5>Arguments:</h5>
Chris Lattner261efe92003-11-25 01:02:51 +00003184<p>There are two arguments to the '<tt>store</tt>' instruction: a value
Jeff Cohen6f1cc772007-04-22 01:17:39 +00003185to store and an address at which to store it. The type of the '<tt>&lt;pointer&gt;</tt>'
Chris Lattner4316dec2008-04-02 00:38:26 +00003186operand must be a pointer to the <a href="#t_firstclass">first class</a> type
3187of the '<tt>&lt;value&gt;</tt>'
John Criswellc1f786c2005-05-13 22:25:59 +00003188operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
Chris Lattner261efe92003-11-25 01:02:51 +00003189optimizer is not allowed to modify the number or order of execution of
3190this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
3191 href="#i_store">store</a></tt> instructions.</p>
Chris Lattnera31d1d72008-01-06 21:04:43 +00003192<p>
Chris Lattner4316dec2008-04-02 00:38:26 +00003193The optional constant "align" argument specifies the alignment of the operation
Chris Lattnera31d1d72008-01-06 21:04:43 +00003194(that is, the alignment of the memory address). A value of 0 or an
3195omitted "align" argument means that the operation has the preferential
3196alignment for the target. It is the responsibility of the code emitter
3197to ensure that the alignment information is correct. Overestimating
3198the alignment results in an undefined behavior. Underestimating the
3199alignment may produce less efficient code. An alignment of 1 is always
3200safe.
3201</p>
Chris Lattner261efe92003-11-25 01:02:51 +00003202<h5>Semantics:</h5>
3203<p>The contents of memory are updated to contain '<tt>&lt;value&gt;</tt>'
3204at the location specified by the '<tt>&lt;pointer&gt;</tt>' operand.</p>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003205<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00003206<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Bill Wendling8c6c72d2007-10-22 05:10:05 +00003207 store i32 3, i32* %ptr <i>; yields {void}</i>
3208 %val = <a href="#i_load">load</a> i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner2b7d3202002-05-06 03:03:22 +00003209</pre>
Reid Spencer47ce1792006-11-09 21:15:49 +00003210</div>
3211
Chris Lattner2b7d3202002-05-06 03:03:22 +00003212<!-- _______________________________________________________________________ -->
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003213<div class="doc_subsubsection">
3214 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
3215</div>
3216
Misha Brukman9d0919f2003-11-08 01:05:38 +00003217<div class="doc_text">
Chris Lattner7faa8832002-04-14 06:13:44 +00003218<h5>Syntax:</h5>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003219<pre>
3220 &lt;result&gt; = getelementptr &lt;ty&gt;* &lt;ptrval&gt;{, &lt;ty&gt; &lt;idx&gt;}*
3221</pre>
3222
Chris Lattner7faa8832002-04-14 06:13:44 +00003223<h5>Overview:</h5>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003224
3225<p>
3226The '<tt>getelementptr</tt>' instruction is used to get the address of a
3227subelement of an aggregate data structure.</p>
3228
Chris Lattner7faa8832002-04-14 06:13:44 +00003229<h5>Arguments:</h5>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003230
Reid Spencer85f5b5b2006-12-04 21:29:24 +00003231<p>This instruction takes a list of integer operands that indicate what
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003232elements of the aggregate object to index to. The actual types of the arguments
3233provided depend on the type of the first pointer argument. The
3234'<tt>getelementptr</tt>' instruction is used to index down through the type
John Criswellfc6b8952005-05-16 16:17:45 +00003235levels of a structure or to a specific index in an array. When indexing into a
Reid Spencerca86e162006-12-31 07:07:53 +00003236structure, only <tt>i32</tt> integer constants are allowed. When indexing
Chris Lattner05d67092008-04-24 05:59:56 +00003237into an array or pointer, only integers of 32 or 64 bits are allowed; 32-bit
3238values will be sign extended to 64-bits if required.</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003239
Chris Lattner261efe92003-11-25 01:02:51 +00003240<p>For example, let's consider a C code fragment and how it gets
3241compiled to LLVM:</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003242
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003243<div class="doc_code">
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003244<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003245struct RT {
3246 char A;
Chris Lattnercabc8462007-05-29 15:43:56 +00003247 int B[10][20];
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003248 char C;
3249};
3250struct ST {
Chris Lattnercabc8462007-05-29 15:43:56 +00003251 int X;
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003252 double Y;
3253 struct RT Z;
3254};
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003255
Chris Lattnercabc8462007-05-29 15:43:56 +00003256int *foo(struct ST *s) {
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003257 return &amp;s[1].Z.B[5][13];
3258}
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003259</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003260</div>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003261
Misha Brukman9d0919f2003-11-08 01:05:38 +00003262<p>The LLVM code generated by the GCC frontend is:</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003263
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003264<div class="doc_code">
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003265<pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003266%RT = type { i8 , [10 x [20 x i32]], i8 }
3267%ST = type { i32, double, %RT }
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003268
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003269define i32* %foo(%ST* %s) {
3270entry:
3271 %reg = getelementptr %ST* %s, i32 1, i32 2, i32 1, i32 5, i32 13
3272 ret i32* %reg
3273}
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003274</pre>
Bill Wendling2f7a8b02007-05-29 09:04:49 +00003275</div>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003276
Chris Lattner7faa8832002-04-14 06:13:44 +00003277<h5>Semantics:</h5>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003278
3279<p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
John Criswellc1f786c2005-05-13 22:25:59 +00003280on the pointer type that is being indexed into. <a href="#t_pointer">Pointer</a>
Reid Spencer85f5b5b2006-12-04 21:29:24 +00003281and <a href="#t_array">array</a> types can use a 32-bit or 64-bit
Reid Spencer42ddd842006-12-03 16:53:48 +00003282<a href="#t_integer">integer</a> type but the value will always be sign extended
Chris Lattner4316dec2008-04-02 00:38:26 +00003283to 64-bits. <a href="#t_struct">Structure</a> and <a href="#t_pstruct">packed
3284structure</a> types require <tt>i32</tt> <b>constants</b>.</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003285
Misha Brukman9d0919f2003-11-08 01:05:38 +00003286<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
Reid Spencerca86e162006-12-31 07:07:53 +00003287type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ i32, double, %RT
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003288}</tt>' type, a structure. The second index indexes into the third element of
Reid Spencerca86e162006-12-31 07:07:53 +00003289the structure, yielding a '<tt>%RT</tt>' = '<tt>{ i8 , [10 x [20 x i32]],
3290i8 }</tt>' type, another structure. The third index indexes into the second
3291element of the structure, yielding a '<tt>[10 x [20 x i32]]</tt>' type, an
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003292array. The two dimensions of the array are subscripted into, yielding an
Reid Spencerca86e162006-12-31 07:07:53 +00003293'<tt>i32</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
3294to this element, thus computing a value of '<tt>i32*</tt>' type.</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003295
Chris Lattner261efe92003-11-25 01:02:51 +00003296<p>Note that it is perfectly legal to index partially through a
3297structure, returning a pointer to an inner element. Because of this,
3298the LLVM code for the given testcase is equivalent to:</p>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003299
3300<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003301 define i32* %foo(%ST* %s) {
3302 %t1 = getelementptr %ST* %s, i32 1 <i>; yields %ST*:%t1</i>
Jeff Cohen6f1cc772007-04-22 01:17:39 +00003303 %t2 = getelementptr %ST* %t1, i32 0, i32 2 <i>; yields %RT*:%t2</i>
3304 %t3 = getelementptr %RT* %t2, i32 0, i32 1 <i>; yields [10 x [20 x i32]]*:%t3</i>
Reid Spencerca86e162006-12-31 07:07:53 +00003305 %t4 = getelementptr [10 x [20 x i32]]* %t3, i32 0, i32 5 <i>; yields [20 x i32]*:%t4</i>
3306 %t5 = getelementptr [20 x i32]* %t4, i32 0, i32 13 <i>; yields i32*:%t5</i>
3307 ret i32* %t5
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003308 }
Chris Lattner6536cfe2002-05-06 22:08:29 +00003309</pre>
Chris Lattnere67a9512005-06-24 17:22:57 +00003310
3311<p>Note that it is undefined to access an array out of bounds: array and
3312pointer indexes must always be within the defined bounds of the array type.
Chris Lattner05d67092008-04-24 05:59:56 +00003313The one exception for this rule is zero length arrays. These arrays are
Chris Lattnere67a9512005-06-24 17:22:57 +00003314defined to be accessible as variable length arrays, which requires access
3315beyond the zero'th element.</p>
3316
Chris Lattner884a9702006-08-15 00:45:58 +00003317<p>The getelementptr instruction is often confusing. For some more insight
3318into how it works, see <a href="GetElementPtr.html">the getelementptr
3319FAQ</a>.</p>
3320
Chris Lattner7faa8832002-04-14 06:13:44 +00003321<h5>Example:</h5>
Chris Lattnere67a9512005-06-24 17:22:57 +00003322
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003323<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003324 <i>; yields [12 x i8]*:aptr</i>
3325 %aptr = getelementptr {i32, [12 x i8]}* %sptr, i64 0, i32 1
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003326</pre>
Chris Lattnerf74d5c72004-04-05 01:30:49 +00003327</div>
Reid Spencer47ce1792006-11-09 21:15:49 +00003328
Chris Lattner00950542001-06-06 20:29:01 +00003329<!-- ======================================================================= -->
Reid Spencer2fd21e62006-11-08 01:18:52 +00003330<div class="doc_subsection"> <a name="convertops">Conversion Operations</a>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003331</div>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003332<div class="doc_text">
Reid Spencer2fd21e62006-11-08 01:18:52 +00003333<p>The instructions in this category are the conversion instructions (casting)
3334which all take a single operand and a type. They perform various bit conversions
3335on the operand.</p>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003336</div>
Chris Lattnercc37aae2004-03-12 05:50:16 +00003337
Chris Lattner6536cfe2002-05-06 22:08:29 +00003338<!-- _______________________________________________________________________ -->
Chris Lattnercc37aae2004-03-12 05:50:16 +00003339<div class="doc_subsubsection">
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003340 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
3341</div>
3342<div class="doc_text">
3343
3344<h5>Syntax:</h5>
3345<pre>
3346 &lt;result&gt; = trunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3347</pre>
3348
3349<h5>Overview:</h5>
3350<p>
3351The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
3352</p>
3353
3354<h5>Arguments:</h5>
3355<p>
3356The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
3357be an <a href="#t_integer">integer</a> type, and a type that specifies the size
Chris Lattner3b19d652007-01-15 01:54:13 +00003358and type of the result, which must be an <a href="#t_integer">integer</a>
Reid Spencerd4448792006-11-09 23:03:26 +00003359type. The bit size of <tt>value</tt> must be larger than the bit size of
3360<tt>ty2</tt>. Equal sized types are not allowed.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003361
3362<h5>Semantics:</h5>
3363<p>
3364The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
Reid Spencerd4448792006-11-09 23:03:26 +00003365and converts the remaining bits to <tt>ty2</tt>. Since the source size must be
3366larger than the destination size, <tt>trunc</tt> cannot be a <i>no-op cast</i>.
3367It will always truncate bits.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003368
3369<h5>Example:</h5>
3370<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003371 %X = trunc i32 257 to i8 <i>; yields i8:1</i>
Reid Spencerc78f3372007-01-12 03:35:51 +00003372 %Y = trunc i32 123 to i1 <i>; yields i1:true</i>
3373 %Y = trunc i32 122 to i1 <i>; yields i1:false</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003374</pre>
3375</div>
3376
3377<!-- _______________________________________________________________________ -->
3378<div class="doc_subsubsection">
3379 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
3380</div>
3381<div class="doc_text">
3382
3383<h5>Syntax:</h5>
3384<pre>
3385 &lt;result&gt; = zext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3386</pre>
3387
3388<h5>Overview:</h5>
3389<p>The '<tt>zext</tt>' instruction zero extends its operand to type
3390<tt>ty2</tt>.</p>
3391
3392
3393<h5>Arguments:</h5>
3394<p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
Chris Lattner3b19d652007-01-15 01:54:13 +00003395<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3396also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencerd4448792006-11-09 23:03:26 +00003397<tt>value</tt> must be smaller than the bit size of the destination type,
3398<tt>ty2</tt>.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003399
3400<h5>Semantics:</h5>
3401<p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
Chris Lattnerd1d25172007-05-24 19:13:27 +00003402bits until it reaches the size of the destination type, <tt>ty2</tt>.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003403
Reid Spencerb5929522007-01-12 15:46:11 +00003404<p>When zero extending from i1, the result will always be either 0 or 1.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003405
3406<h5>Example:</h5>
3407<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003408 %X = zext i32 257 to i64 <i>; yields i64:257</i>
Reid Spencerc78f3372007-01-12 03:35:51 +00003409 %Y = zext i1 true to i32 <i>; yields i32:1</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003410</pre>
3411</div>
3412
3413<!-- _______________________________________________________________________ -->
3414<div class="doc_subsubsection">
3415 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
3416</div>
3417<div class="doc_text">
3418
3419<h5>Syntax:</h5>
3420<pre>
3421 &lt;result&gt; = sext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3422</pre>
3423
3424<h5>Overview:</h5>
3425<p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
3426
3427<h5>Arguments:</h5>
3428<p>
3429The '<tt>sext</tt>' instruction takes a value to cast, which must be of
Chris Lattner3b19d652007-01-15 01:54:13 +00003430<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3431also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencerd4448792006-11-09 23:03:26 +00003432<tt>value</tt> must be smaller than the bit size of the destination type,
3433<tt>ty2</tt>.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003434
3435<h5>Semantics:</h5>
3436<p>
3437The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
3438bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
Chris Lattnerd1d25172007-05-24 19:13:27 +00003439the type <tt>ty2</tt>.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003440
Reid Spencerc78f3372007-01-12 03:35:51 +00003441<p>When sign extending from i1, the extension always results in -1 or 0.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003442
3443<h5>Example:</h5>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003444<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003445 %X = sext i8 -1 to i16 <i>; yields i16 :65535</i>
Reid Spencerc78f3372007-01-12 03:35:51 +00003446 %Y = sext i1 true to i32 <i>; yields i32:-1</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003447</pre>
3448</div>
3449
3450<!-- _______________________________________________________________________ -->
3451<div class="doc_subsubsection">
Reid Spencer3fa91b02006-11-09 21:48:10 +00003452 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
3453</div>
3454
3455<div class="doc_text">
3456
3457<h5>Syntax:</h5>
3458
3459<pre>
3460 &lt;result&gt; = fptrunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3461</pre>
3462
3463<h5>Overview:</h5>
3464<p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
3465<tt>ty2</tt>.</p>
3466
3467
3468<h5>Arguments:</h5>
3469<p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
3470 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
3471cast it to. The size of <tt>value</tt> must be larger than the size of
3472<tt>ty2</tt>. This implies that <tt>fptrunc</tt> cannot be used to make a
3473<i>no-op cast</i>.</p>
3474
3475<h5>Semantics:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003476<p> The '<tt>fptrunc</tt>' instruction truncates a <tt>value</tt> from a larger
3477<a href="#t_floating">floating point</a> type to a smaller
3478<a href="#t_floating">floating point</a> type. If the value cannot fit within
3479the destination type, <tt>ty2</tt>, then the results are undefined.</p>
Reid Spencer3fa91b02006-11-09 21:48:10 +00003480
3481<h5>Example:</h5>
3482<pre>
3483 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
3484 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
3485</pre>
3486</div>
3487
3488<!-- _______________________________________________________________________ -->
3489<div class="doc_subsubsection">
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003490 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
3491</div>
3492<div class="doc_text">
3493
3494<h5>Syntax:</h5>
3495<pre>
3496 &lt;result&gt; = fpext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3497</pre>
3498
3499<h5>Overview:</h5>
3500<p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
3501floating point value.</p>
3502
3503<h5>Arguments:</h5>
3504<p>The '<tt>fpext</tt>' instruction takes a
3505<a href="#t_floating">floating point</a> <tt>value</tt> to cast,
Reid Spencerd4448792006-11-09 23:03:26 +00003506and a <a href="#t_floating">floating point</a> type to cast it to. The source
3507type must be smaller than the destination type.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003508
3509<h5>Semantics:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003510<p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from a smaller
Duncan Sands8036ca42007-03-30 12:22:09 +00003511<a href="#t_floating">floating point</a> type to a larger
3512<a href="#t_floating">floating point</a> type. The <tt>fpext</tt> cannot be
Reid Spencerd4448792006-11-09 23:03:26 +00003513used to make a <i>no-op cast</i> because it always changes bits. Use
Reid Spencer5c0ef472006-11-11 23:08:07 +00003514<tt>bitcast</tt> to make a <i>no-op cast</i> for a floating point cast.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003515
3516<h5>Example:</h5>
3517<pre>
3518 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
3519 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
3520</pre>
3521</div>
3522
3523<!-- _______________________________________________________________________ -->
3524<div class="doc_subsubsection">
Reid Spencer24d6da52007-01-21 00:29:26 +00003525 <a name="i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003526</div>
3527<div class="doc_text">
3528
3529<h5>Syntax:</h5>
3530<pre>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003531 &lt;result&gt; = fptoui &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003532</pre>
3533
3534<h5>Overview:</h5>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003535<p>The '<tt>fptoui</tt>' converts a floating point <tt>value</tt> to its
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003536unsigned integer equivalent of type <tt>ty2</tt>.
3537</p>
3538
3539<h5>Arguments:</h5>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003540<p>The '<tt>fptoui</tt>' instruction takes a value to cast, which must be a
Nate Begemanb348d182007-11-17 03:58:34 +00003541scalar or vector <a href="#t_floating">floating point</a> value, and a type
3542to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3543type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3544vector integer type with the same number of elements as <tt>ty</tt></p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003545
3546<h5>Semantics:</h5>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003547<p> The '<tt>fptoui</tt>' instruction converts its
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003548<a href="#t_floating">floating point</a> operand into the nearest (rounding
3549towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
3550the results are undefined.</p>
3551
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003552<h5>Example:</h5>
3553<pre>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003554 %X = fptoui double 123.0 to i32 <i>; yields i32:123</i>
Chris Lattner88519042007-09-22 03:17:52 +00003555 %Y = fptoui float 1.0E+300 to i1 <i>; yields undefined:1</i>
Reid Spencer1539a1c2007-07-31 14:40:14 +00003556 %X = fptoui float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003557</pre>
3558</div>
3559
3560<!-- _______________________________________________________________________ -->
3561<div class="doc_subsubsection">
Reid Spencerd4448792006-11-09 23:03:26 +00003562 <a name="i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003563</div>
3564<div class="doc_text">
3565
3566<h5>Syntax:</h5>
3567<pre>
Reid Spencerd4448792006-11-09 23:03:26 +00003568 &lt;result&gt; = fptosi &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003569</pre>
3570
3571<h5>Overview:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003572<p>The '<tt>fptosi</tt>' instruction converts
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003573<a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
Chris Lattnercc37aae2004-03-12 05:50:16 +00003574</p>
3575
Chris Lattner6536cfe2002-05-06 22:08:29 +00003576<h5>Arguments:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003577<p> The '<tt>fptosi</tt>' instruction takes a value to cast, which must be a
Nate Begemanb348d182007-11-17 03:58:34 +00003578scalar or vector <a href="#t_floating">floating point</a> value, and a type
3579to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3580type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3581vector integer type with the same number of elements as <tt>ty</tt></p>
Chris Lattnercc37aae2004-03-12 05:50:16 +00003582
Chris Lattner6536cfe2002-05-06 22:08:29 +00003583<h5>Semantics:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003584<p>The '<tt>fptosi</tt>' instruction converts its
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003585<a href="#t_floating">floating point</a> operand into the nearest (rounding
3586towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3587the results are undefined.</p>
Chris Lattnercc37aae2004-03-12 05:50:16 +00003588
Chris Lattner33ba0d92001-07-09 00:26:23 +00003589<h5>Example:</h5>
Chris Lattnercc37aae2004-03-12 05:50:16 +00003590<pre>
Reid Spencerc78f3372007-01-12 03:35:51 +00003591 %X = fptosi double -123.0 to i32 <i>; yields i32:-123</i>
Chris Lattner88519042007-09-22 03:17:52 +00003592 %Y = fptosi float 1.0E-247 to i1 <i>; yields undefined:1</i>
Reid Spencerca86e162006-12-31 07:07:53 +00003593 %X = fptosi float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003594</pre>
3595</div>
3596
3597<!-- _______________________________________________________________________ -->
3598<div class="doc_subsubsection">
Reid Spencerd4448792006-11-09 23:03:26 +00003599 <a name="i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003600</div>
3601<div class="doc_text">
3602
3603<h5>Syntax:</h5>
3604<pre>
Reid Spencerd4448792006-11-09 23:03:26 +00003605 &lt;result&gt; = uitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003606</pre>
3607
3608<h5>Overview:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003609<p>The '<tt>uitofp</tt>' instruction regards <tt>value</tt> as an unsigned
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003610integer and converts that value to the <tt>ty2</tt> type.</p>
3611
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003612<h5>Arguments:</h5>
Nate Begemanb348d182007-11-17 03:58:34 +00003613<p>The '<tt>uitofp</tt>' instruction takes a value to cast, which must be a
3614scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3615to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3616type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3617floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003618
3619<h5>Semantics:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003620<p>The '<tt>uitofp</tt>' instruction interprets its operand as an unsigned
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003621integer quantity and converts it to the corresponding floating point value. If
Jeff Cohencb757312007-04-22 14:56:37 +00003622the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003623
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003624<h5>Example:</h5>
3625<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003626 %X = uitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003627 %Y = uitofp i8 -1 to double <i>; yields double:255.0</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003628</pre>
3629</div>
3630
3631<!-- _______________________________________________________________________ -->
3632<div class="doc_subsubsection">
Reid Spencerd4448792006-11-09 23:03:26 +00003633 <a name="i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003634</div>
3635<div class="doc_text">
3636
3637<h5>Syntax:</h5>
3638<pre>
Reid Spencerd4448792006-11-09 23:03:26 +00003639 &lt;result&gt; = sitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003640</pre>
3641
3642<h5>Overview:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003643<p>The '<tt>sitofp</tt>' instruction regards <tt>value</tt> as a signed
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003644integer and converts that value to the <tt>ty2</tt> type.</p>
3645
3646<h5>Arguments:</h5>
Nate Begemanb348d182007-11-17 03:58:34 +00003647<p>The '<tt>sitofp</tt>' instruction takes a value to cast, which must be a
3648scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3649to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3650type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3651floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003652
3653<h5>Semantics:</h5>
Reid Spencerd4448792006-11-09 23:03:26 +00003654<p>The '<tt>sitofp</tt>' instruction interprets its operand as a signed
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003655integer quantity and converts it to the corresponding floating point value. If
Jeff Cohencb757312007-04-22 14:56:37 +00003656the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003657
3658<h5>Example:</h5>
3659<pre>
Reid Spencerca86e162006-12-31 07:07:53 +00003660 %X = sitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003661 %Y = sitofp i8 -1 to double <i>; yields double:-1.0</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003662</pre>
3663</div>
3664
3665<!-- _______________________________________________________________________ -->
3666<div class="doc_subsubsection">
Reid Spencer72679252006-11-11 21:00:47 +00003667 <a name="i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a>
3668</div>
3669<div class="doc_text">
3670
3671<h5>Syntax:</h5>
3672<pre>
3673 &lt;result&gt; = ptrtoint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3674</pre>
3675
3676<h5>Overview:</h5>
3677<p>The '<tt>ptrtoint</tt>' instruction converts the pointer <tt>value</tt> to
3678the integer type <tt>ty2</tt>.</p>
3679
3680<h5>Arguments:</h5>
3681<p>The '<tt>ptrtoint</tt>' instruction takes a <tt>value</tt> to cast, which
Duncan Sands8036ca42007-03-30 12:22:09 +00003682must be a <a href="#t_pointer">pointer</a> value, and a type to cast it to
Reid Spencer72679252006-11-11 21:00:47 +00003683<tt>ty2</tt>, which must be an <a href="#t_integer">integer</a> type.
3684
3685<h5>Semantics:</h5>
3686<p>The '<tt>ptrtoint</tt>' instruction converts <tt>value</tt> to integer type
3687<tt>ty2</tt> by interpreting the pointer value as an integer and either
3688truncating or zero extending that value to the size of the integer type. If
3689<tt>value</tt> is smaller than <tt>ty2</tt> then a zero extension is done. If
3690<tt>value</tt> is larger than <tt>ty2</tt> then a truncation is done. If they
Jeff Cohenb627eab2007-04-29 01:07:00 +00003691are the same size, then nothing is done (<i>no-op cast</i>) other than a type
3692change.</p>
Reid Spencer72679252006-11-11 21:00:47 +00003693
3694<h5>Example:</h5>
3695<pre>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003696 %X = ptrtoint i32* %X to i8 <i>; yields truncation on 32-bit architecture</i>
3697 %Y = ptrtoint i32* %x to i64 <i>; yields zero extension on 32-bit architecture</i>
Reid Spencer72679252006-11-11 21:00:47 +00003698</pre>
3699</div>
3700
3701<!-- _______________________________________________________________________ -->
3702<div class="doc_subsubsection">
3703 <a name="i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a>
3704</div>
3705<div class="doc_text">
3706
3707<h5>Syntax:</h5>
3708<pre>
3709 &lt;result&gt; = inttoptr &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3710</pre>
3711
3712<h5>Overview:</h5>
3713<p>The '<tt>inttoptr</tt>' instruction converts an integer <tt>value</tt> to
3714a pointer type, <tt>ty2</tt>.</p>
3715
3716<h5>Arguments:</h5>
Duncan Sands8036ca42007-03-30 12:22:09 +00003717<p>The '<tt>inttoptr</tt>' instruction takes an <a href="#t_integer">integer</a>
Reid Spencer72679252006-11-11 21:00:47 +00003718value to cast, and a type to cast it to, which must be a
Anton Korobeynikov7f705592007-01-12 19:20:47 +00003719<a href="#t_pointer">pointer</a> type.
Reid Spencer72679252006-11-11 21:00:47 +00003720
3721<h5>Semantics:</h5>
3722<p>The '<tt>inttoptr</tt>' instruction converts <tt>value</tt> to type
3723<tt>ty2</tt> by applying either a zero extension or a truncation depending on
3724the size of the integer <tt>value</tt>. If <tt>value</tt> is larger than the
3725size of a pointer then a truncation is done. If <tt>value</tt> is smaller than
3726the size of a pointer then a zero extension is done. If they are the same size,
3727nothing is done (<i>no-op cast</i>).</p>
3728
3729<h5>Example:</h5>
3730<pre>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003731 %X = inttoptr i32 255 to i32* <i>; yields zero extension on 64-bit architecture</i>
3732 %X = inttoptr i32 255 to i32* <i>; yields no-op on 32-bit architecture</i>
3733 %Y = inttoptr i64 0 to i32* <i>; yields truncation on 32-bit architecture</i>
Reid Spencer72679252006-11-11 21:00:47 +00003734</pre>
3735</div>
3736
3737<!-- _______________________________________________________________________ -->
3738<div class="doc_subsubsection">
Reid Spencer5c0ef472006-11-11 23:08:07 +00003739 <a name="i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003740</div>
3741<div class="doc_text">
3742
3743<h5>Syntax:</h5>
3744<pre>
Reid Spencer5c0ef472006-11-11 23:08:07 +00003745 &lt;result&gt; = bitcast &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003746</pre>
3747
3748<h5>Overview:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00003749
Reid Spencer5c0ef472006-11-11 23:08:07 +00003750<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003751<tt>ty2</tt> without changing any bits.</p>
3752
3753<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00003754
Reid Spencer5c0ef472006-11-11 23:08:07 +00003755<p>The '<tt>bitcast</tt>' instruction takes a value to cast, which must be
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003756a first class value, and a type to cast it to, which must also be a <a
3757 href="#t_firstclass">first class</a> type. The bit sizes of <tt>value</tt>
Reid Spencer19b569f2007-01-09 20:08:58 +00003758and the destination type, <tt>ty2</tt>, must be identical. If the source
Chris Lattner5568e942008-05-20 20:48:21 +00003759type is a pointer, the destination type must also be a pointer. This
3760instruction supports bitwise conversion of vectors to integers and to vectors
3761of other types (as long as they have the same size).</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003762
3763<h5>Semantics:</h5>
Reid Spencer5c0ef472006-11-11 23:08:07 +00003764<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencer72679252006-11-11 21:00:47 +00003765<tt>ty2</tt>. It is always a <i>no-op cast</i> because no bits change with
3766this conversion. The conversion is done as if the <tt>value</tt> had been
3767stored to memory and read back as type <tt>ty2</tt>. Pointer types may only be
3768converted to other pointer types with this instruction. To convert pointers to
3769other types, use the <a href="#i_inttoptr">inttoptr</a> or
3770<a href="#i_ptrtoint">ptrtoint</a> instructions first.</p>
Reid Spencer9dee3ac2006-11-08 01:11:31 +00003771
3772<h5>Example:</h5>
3773<pre>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003774 %X = bitcast i8 255 to i8 <i>; yields i8 :-1</i>
Reid Spencerca86e162006-12-31 07:07:53 +00003775 %Y = bitcast i32* %x to sint* <i>; yields sint*:%x</i>
3776 %Z = bitcast <2xint> %V to i64; <i>; yields i64: %V</i>
Chris Lattner33ba0d92001-07-09 00:26:23 +00003777</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00003778</div>
Chris Lattnercc37aae2004-03-12 05:50:16 +00003779
Reid Spencer2fd21e62006-11-08 01:18:52 +00003780<!-- ======================================================================= -->
3781<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
3782<div class="doc_text">
3783<p>The instructions in this category are the "miscellaneous"
3784instructions, which defy better classification.</p>
3785</div>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003786
3787<!-- _______________________________________________________________________ -->
3788<div class="doc_subsubsection"><a name="i_icmp">'<tt>icmp</tt>' Instruction</a>
3789</div>
3790<div class="doc_text">
3791<h5>Syntax:</h5>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003792<pre> &lt;result&gt; = icmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {i1}:result</i>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003793</pre>
3794<h5>Overview:</h5>
3795<p>The '<tt>icmp</tt>' instruction returns a boolean value based on comparison
Chris Lattner4316dec2008-04-02 00:38:26 +00003796of its two integer or pointer operands.</p>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003797<h5>Arguments:</h5>
3798<p>The '<tt>icmp</tt>' instruction takes three operands. The first operand is
Jeff Cohenb627eab2007-04-29 01:07:00 +00003799the condition code indicating the kind of comparison to perform. It is not
3800a value, just a keyword. The possible condition code are:
Reid Spencerf3a70a62006-11-18 21:50:54 +00003801<ol>
3802 <li><tt>eq</tt>: equal</li>
3803 <li><tt>ne</tt>: not equal </li>
3804 <li><tt>ugt</tt>: unsigned greater than</li>
3805 <li><tt>uge</tt>: unsigned greater or equal</li>
3806 <li><tt>ult</tt>: unsigned less than</li>
3807 <li><tt>ule</tt>: unsigned less or equal</li>
3808 <li><tt>sgt</tt>: signed greater than</li>
3809 <li><tt>sge</tt>: signed greater or equal</li>
3810 <li><tt>slt</tt>: signed less than</li>
3811 <li><tt>sle</tt>: signed less or equal</li>
3812</ol>
Chris Lattner3b19d652007-01-15 01:54:13 +00003813<p>The remaining two arguments must be <a href="#t_integer">integer</a> or
Reid Spencer350f8aa2007-01-04 05:19:58 +00003814<a href="#t_pointer">pointer</a> typed. They must also be identical types.</p>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003815<h5>Semantics:</h5>
3816<p>The '<tt>icmp</tt>' compares <tt>var1</tt> and <tt>var2</tt> according to
3817the condition code given as <tt>cond</tt>. The comparison performed always
Reid Spencerc78f3372007-01-12 03:35:51 +00003818yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerf3a70a62006-11-18 21:50:54 +00003819<ol>
3820 <li><tt>eq</tt>: yields <tt>true</tt> if the operands are equal,
3821 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3822 </li>
3823 <li><tt>ne</tt>: yields <tt>true</tt> if the operands are unequal,
3824 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3825 <li><tt>ugt</tt>: interprets the operands as unsigned values and yields
3826 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3827 <li><tt>uge</tt>: interprets the operands as unsigned values and yields
3828 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3829 <li><tt>ult</tt>: interprets the operands as unsigned values and yields
3830 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3831 <li><tt>ule</tt>: interprets the operands as unsigned values and yields
3832 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
3833 <li><tt>sgt</tt>: interprets the operands as signed values and yields
3834 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3835 <li><tt>sge</tt>: interprets the operands as signed values and yields
3836 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3837 <li><tt>slt</tt>: interprets the operands as signed values and yields
3838 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3839 <li><tt>sle</tt>: interprets the operands as signed values and yields
3840 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003841</ol>
3842<p>If the operands are <a href="#t_pointer">pointer</a> typed, the pointer
Jeff Cohenb627eab2007-04-29 01:07:00 +00003843values are compared as if they were integers.</p>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003844
3845<h5>Example:</h5>
Reid Spencerca86e162006-12-31 07:07:53 +00003846<pre> &lt;result&gt; = icmp eq i32 4, 5 <i>; yields: result=false</i>
3847 &lt;result&gt; = icmp ne float* %X, %X <i>; yields: result=false</i>
3848 &lt;result&gt; = icmp ult i16 4, 5 <i>; yields: result=true</i>
3849 &lt;result&gt; = icmp sgt i16 4, 5 <i>; yields: result=false</i>
3850 &lt;result&gt; = icmp ule i16 -4, 5 <i>; yields: result=false</i>
3851 &lt;result&gt; = icmp sge i16 4, 5 <i>; yields: result=false</i>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003852</pre>
3853</div>
3854
3855<!-- _______________________________________________________________________ -->
3856<div class="doc_subsubsection"><a name="i_fcmp">'<tt>fcmp</tt>' Instruction</a>
3857</div>
3858<div class="doc_text">
3859<h5>Syntax:</h5>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003860<pre> &lt;result&gt; = fcmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {i1}:result</i>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003861</pre>
3862<h5>Overview:</h5>
3863<p>The '<tt>fcmp</tt>' instruction returns a boolean value based on comparison
3864of its floating point operands.</p>
3865<h5>Arguments:</h5>
3866<p>The '<tt>fcmp</tt>' instruction takes three operands. The first operand is
Jeff Cohenb627eab2007-04-29 01:07:00 +00003867the condition code indicating the kind of comparison to perform. It is not
3868a value, just a keyword. The possible condition code are:
Reid Spencerf3a70a62006-11-18 21:50:54 +00003869<ol>
Reid Spencerb7f26282006-11-19 03:00:14 +00003870 <li><tt>false</tt>: no comparison, always returns false</li>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003871 <li><tt>oeq</tt>: ordered and equal</li>
3872 <li><tt>ogt</tt>: ordered and greater than </li>
3873 <li><tt>oge</tt>: ordered and greater than or equal</li>
3874 <li><tt>olt</tt>: ordered and less than </li>
3875 <li><tt>ole</tt>: ordered and less than or equal</li>
3876 <li><tt>one</tt>: ordered and not equal</li>
3877 <li><tt>ord</tt>: ordered (no nans)</li>
3878 <li><tt>ueq</tt>: unordered or equal</li>
3879 <li><tt>ugt</tt>: unordered or greater than </li>
3880 <li><tt>uge</tt>: unordered or greater than or equal</li>
3881 <li><tt>ult</tt>: unordered or less than </li>
3882 <li><tt>ule</tt>: unordered or less than or equal</li>
3883 <li><tt>une</tt>: unordered or not equal</li>
3884 <li><tt>uno</tt>: unordered (either nans)</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003885 <li><tt>true</tt>: no comparison, always returns true</li>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003886</ol>
Jeff Cohenb627eab2007-04-29 01:07:00 +00003887<p><i>Ordered</i> means that neither operand is a QNAN while
Reid Spencer93a49852006-12-06 07:08:07 +00003888<i>unordered</i> means that either operand may be a QNAN.</p>
Reid Spencer350f8aa2007-01-04 05:19:58 +00003889<p>The <tt>val1</tt> and <tt>val2</tt> arguments must be
3890<a href="#t_floating">floating point</a> typed. They must have identical
3891types.</p>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003892<h5>Semantics:</h5>
Nate Begemanac80ade2008-05-12 19:01:56 +00003893<p>The '<tt>fcmp</tt>' instruction compares <tt>var1</tt> and <tt>var2</tt>
3894according to the condition code given as <tt>cond</tt>. The comparison performed
3895always yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerf3a70a62006-11-18 21:50:54 +00003896<ol>
3897 <li><tt>false</tt>: always yields <tt>false</tt>, regardless of operands.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003898 <li><tt>oeq</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003899 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003900 <li><tt>ogt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003901 <tt>var1</tt> is greather than <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003902 <li><tt>oge</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003903 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003904 <li><tt>olt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003905 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003906 <li><tt>ole</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003907 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003908 <li><tt>one</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerf3a70a62006-11-18 21:50:54 +00003909 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003910 <li><tt>ord</tt>: yields <tt>true</tt> if both operands are not a QNAN.</li>
3911 <li><tt>ueq</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003912 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003913 <li><tt>ugt</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003914 <tt>var1</tt> is greater than <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003915 <li><tt>uge</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003916 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003917 <li><tt>ult</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003918 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003919 <li><tt>ule</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003920 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003921 <li><tt>une</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerf3a70a62006-11-18 21:50:54 +00003922 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerb7f26282006-11-19 03:00:14 +00003923 <li><tt>uno</tt>: yields <tt>true</tt> if either operand is a QNAN.</li>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003924 <li><tt>true</tt>: always yields <tt>true</tt>, regardless of operands.</li>
3925</ol>
Reid Spencerf3a70a62006-11-18 21:50:54 +00003926
3927<h5>Example:</h5>
3928<pre> &lt;result&gt; = fcmp oeq float 4.0, 5.0 <i>; yields: result=false</i>
3929 &lt;result&gt; = icmp one float 4.0, 5.0 <i>; yields: result=true</i>
3930 &lt;result&gt; = icmp olt float 4.0, 5.0 <i>; yields: result=true</i>
3931 &lt;result&gt; = icmp ueq double 1.0, 2.0 <i>; yields: result=false</i>
3932</pre>
3933</div>
3934
Reid Spencer2fd21e62006-11-08 01:18:52 +00003935<!-- _______________________________________________________________________ -->
Nate Begemanac80ade2008-05-12 19:01:56 +00003936<div class="doc_subsubsection">
3937 <a name="i_vicmp">'<tt>vicmp</tt>' Instruction</a>
3938</div>
3939<div class="doc_text">
3940<h5>Syntax:</h5>
3941<pre> &lt;result&gt; = vicmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
3942</pre>
3943<h5>Overview:</h5>
3944<p>The '<tt>vicmp</tt>' instruction returns an integer vector value based on
3945element-wise comparison of its two integer vector operands.</p>
3946<h5>Arguments:</h5>
3947<p>The '<tt>vicmp</tt>' instruction takes three operands. The first operand is
3948the condition code indicating the kind of comparison to perform. It is not
3949a value, just a keyword. The possible condition code are:
3950<ol>
3951 <li><tt>eq</tt>: equal</li>
3952 <li><tt>ne</tt>: not equal </li>
3953 <li><tt>ugt</tt>: unsigned greater than</li>
3954 <li><tt>uge</tt>: unsigned greater or equal</li>
3955 <li><tt>ult</tt>: unsigned less than</li>
3956 <li><tt>ule</tt>: unsigned less or equal</li>
3957 <li><tt>sgt</tt>: signed greater than</li>
3958 <li><tt>sge</tt>: signed greater or equal</li>
3959 <li><tt>slt</tt>: signed less than</li>
3960 <li><tt>sle</tt>: signed less or equal</li>
3961</ol>
3962<p>The remaining two arguments must be <a href="#t_vector">vector</a> of
3963<a href="#t_integer">integer</a> typed. They must also be identical types.</p>
3964<h5>Semantics:</h5>
3965<p>The '<tt>vicmp</tt>' instruction compares <tt>var1</tt> and <tt>var2</tt>
3966according to the condition code given as <tt>cond</tt>. The comparison yields a
3967<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, of
3968identical type as the values being compared. The most significant bit in each
3969element is 1 if the element-wise comparison evaluates to true, and is 0
3970otherwise. All other bits of the result are undefined. The condition codes
3971are evaluated identically to the <a href="#i_icmp">'<tt>icmp</tt>'
3972instruction</a>.
3973
3974<h5>Example:</h5>
3975<pre>
Chris Lattner5568e942008-05-20 20:48:21 +00003976 &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>
3977 &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 Begemanac80ade2008-05-12 19:01:56 +00003978</pre>
3979</div>
3980
3981<!-- _______________________________________________________________________ -->
3982<div class="doc_subsubsection">
3983 <a name="i_vfcmp">'<tt>vfcmp</tt>' Instruction</a>
3984</div>
3985<div class="doc_text">
3986<h5>Syntax:</h5>
3987<pre> &lt;result&gt; = vfcmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt;</pre>
3988<h5>Overview:</h5>
3989<p>The '<tt>vfcmp</tt>' instruction returns an integer vector value based on
3990element-wise comparison of its two floating point vector operands. The output
3991elements have the same width as the input elements.</p>
3992<h5>Arguments:</h5>
3993<p>The '<tt>vfcmp</tt>' instruction takes three operands. The first operand is
3994the condition code indicating the kind of comparison to perform. It is not
3995a value, just a keyword. The possible condition code are:
3996<ol>
3997 <li><tt>false</tt>: no comparison, always returns false</li>
3998 <li><tt>oeq</tt>: ordered and equal</li>
3999 <li><tt>ogt</tt>: ordered and greater than </li>
4000 <li><tt>oge</tt>: ordered and greater than or equal</li>
4001 <li><tt>olt</tt>: ordered and less than </li>
4002 <li><tt>ole</tt>: ordered and less than or equal</li>
4003 <li><tt>one</tt>: ordered and not equal</li>
4004 <li><tt>ord</tt>: ordered (no nans)</li>
4005 <li><tt>ueq</tt>: unordered or equal</li>
4006 <li><tt>ugt</tt>: unordered or greater than </li>
4007 <li><tt>uge</tt>: unordered or greater than or equal</li>
4008 <li><tt>ult</tt>: unordered or less than </li>
4009 <li><tt>ule</tt>: unordered or less than or equal</li>
4010 <li><tt>une</tt>: unordered or not equal</li>
4011 <li><tt>uno</tt>: unordered (either nans)</li>
4012 <li><tt>true</tt>: no comparison, always returns true</li>
4013</ol>
4014<p>The remaining two arguments must be <a href="#t_vector">vector</a> of
4015<a href="#t_floating">floating point</a> typed. They must also be identical
4016types.</p>
4017<h5>Semantics:</h5>
4018<p>The '<tt>vfcmp</tt>' instruction compares <tt>var1</tt> and <tt>var2</tt>
4019according to the condition code given as <tt>cond</tt>. The comparison yields a
4020<a href="#t_vector">vector</a> of <a href="#t_integer">integer</a> result, with
4021an identical number of elements as the values being compared, and each element
4022having identical with to the width of the floating point elements. The most
4023significant bit in each element is 1 if the element-wise comparison evaluates to
4024true, and is 0 otherwise. All other bits of the result are undefined. The
4025condition codes are evaluated identically to the
4026<a href="#i_fcmp">'<tt>fcmp</tt>' instruction</a>.
4027
4028<h5>Example:</h5>
4029<pre>
Chris Lattner5568e942008-05-20 20:48:21 +00004030 &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>
4031 &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 Begemanac80ade2008-05-12 19:01:56 +00004032</pre>
4033</div>
4034
4035<!-- _______________________________________________________________________ -->
Chris Lattner5568e942008-05-20 20:48:21 +00004036<div class="doc_subsubsection">
4037 <a name="i_phi">'<tt>phi</tt>' Instruction</a>
4038</div>
4039
Reid Spencer2fd21e62006-11-08 01:18:52 +00004040<div class="doc_text">
Chris Lattner5568e942008-05-20 20:48:21 +00004041
Reid Spencer2fd21e62006-11-08 01:18:52 +00004042<h5>Syntax:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00004043
Reid Spencer2fd21e62006-11-08 01:18:52 +00004044<pre> &lt;result&gt; = phi &lt;ty&gt; [ &lt;val0&gt;, &lt;label0&gt;], ...<br></pre>
4045<h5>Overview:</h5>
4046<p>The '<tt>phi</tt>' instruction is used to implement the &#966; node in
4047the SSA graph representing the function.</p>
4048<h5>Arguments:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00004049
Jeff Cohenb627eab2007-04-29 01:07:00 +00004050<p>The type of the incoming values is specified with the first type
Reid Spencer2fd21e62006-11-08 01:18:52 +00004051field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
4052as arguments, with one pair for each predecessor basic block of the
4053current block. Only values of <a href="#t_firstclass">first class</a>
4054type may be used as the value arguments to the PHI node. Only labels
4055may be used as the label arguments.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00004056
Reid Spencer2fd21e62006-11-08 01:18:52 +00004057<p>There must be no non-phi instructions between the start of a basic
4058block and the PHI instructions: i.e. PHI instructions must be first in
4059a basic block.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00004060
Reid Spencer2fd21e62006-11-08 01:18:52 +00004061<h5>Semantics:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00004062
Jeff Cohenb627eab2007-04-29 01:07:00 +00004063<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the value
4064specified by the pair corresponding to the predecessor basic block that executed
4065just prior to the current block.</p>
Chris Lattner5568e942008-05-20 20:48:21 +00004066
Reid Spencer2fd21e62006-11-08 01:18:52 +00004067<h5>Example:</h5>
Chris Lattner5568e942008-05-20 20:48:21 +00004068<pre>
4069Loop: ; Infinite loop that counts from 0 on up...
4070 %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]
4071 %nextindvar = add i32 %indvar, 1
4072 br label %Loop
4073</pre>
Reid Spencer2fd21e62006-11-08 01:18:52 +00004074</div>
4075
Chris Lattnercc37aae2004-03-12 05:50:16 +00004076<!-- _______________________________________________________________________ -->
4077<div class="doc_subsubsection">
4078 <a name="i_select">'<tt>select</tt>' Instruction</a>
4079</div>
4080
4081<div class="doc_text">
4082
4083<h5>Syntax:</h5>
4084
4085<pre>
Reid Spencerc78f3372007-01-12 03:35:51 +00004086 &lt;result&gt; = select i1 &lt;cond&gt;, &lt;ty&gt; &lt;val1&gt;, &lt;ty&gt; &lt;val2&gt; <i>; yields ty</i>
Chris Lattnercc37aae2004-03-12 05:50:16 +00004087</pre>
4088
4089<h5>Overview:</h5>
4090
4091<p>
4092The '<tt>select</tt>' instruction is used to choose one value based on a
4093condition, without branching.
4094</p>
4095
4096
4097<h5>Arguments:</h5>
4098
4099<p>
Chris Lattner5568e942008-05-20 20:48:21 +00004100The '<tt>select</tt>' instruction requires an 'i1' value indicating the
4101condition, and two values of the same <a href="#t_firstclass">first class</a>
4102type. If the val1/val2 are vectors, the entire vectors are selected, not
4103individual elements.
Chris Lattnercc37aae2004-03-12 05:50:16 +00004104</p>
4105
4106<h5>Semantics:</h5>
4107
4108<p>
Chris Lattner5568e942008-05-20 20:48:21 +00004109If the i1 condition evaluates is 1, the instruction returns the first
John Criswellfc6b8952005-05-16 16:17:45 +00004110value argument; otherwise, it returns the second value argument.
Chris Lattnercc37aae2004-03-12 05:50:16 +00004111</p>
4112
4113<h5>Example:</h5>
4114
4115<pre>
Reid Spencerc78f3372007-01-12 03:35:51 +00004116 %X = select i1 true, i8 17, i8 42 <i>; yields i8:17</i>
Chris Lattnercc37aae2004-03-12 05:50:16 +00004117</pre>
4118</div>
4119
Robert Bocchino05ccd702006-01-15 20:48:27 +00004120
4121<!-- _______________________________________________________________________ -->
4122<div class="doc_subsubsection">
Chris Lattner2bff5242005-05-06 05:47:36 +00004123 <a name="i_call">'<tt>call</tt>' Instruction</a>
4124</div>
4125
Misha Brukman9d0919f2003-11-08 01:05:38 +00004126<div class="doc_text">
Chris Lattner2bff5242005-05-06 05:47:36 +00004127
Chris Lattner00950542001-06-06 20:29:01 +00004128<h5>Syntax:</h5>
Chris Lattner2bff5242005-05-06 05:47:36 +00004129<pre>
Nick Lewyckydb7e3c92007-09-08 13:57:50 +00004130 &lt;result&gt; = [tail] call [<a href="#callingconv">cconv</a>] &lt;ty&gt; [&lt;fnty&gt;*] &lt;fnptrval&gt;(&lt;param list&gt;)
Chris Lattner2bff5242005-05-06 05:47:36 +00004131</pre>
4132
Chris Lattner00950542001-06-06 20:29:01 +00004133<h5>Overview:</h5>
Chris Lattner2bff5242005-05-06 05:47:36 +00004134
Misha Brukman9d0919f2003-11-08 01:05:38 +00004135<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
Chris Lattner2bff5242005-05-06 05:47:36 +00004136
Chris Lattner00950542001-06-06 20:29:01 +00004137<h5>Arguments:</h5>
Chris Lattner2bff5242005-05-06 05:47:36 +00004138
Misha Brukman9d0919f2003-11-08 01:05:38 +00004139<p>This instruction requires several arguments:</p>
Chris Lattner2bff5242005-05-06 05:47:36 +00004140
Chris Lattner6536cfe2002-05-06 22:08:29 +00004141<ol>
Chris Lattner261efe92003-11-25 01:02:51 +00004142 <li>
Chris Lattnerbad10ee2005-05-06 22:57:40 +00004143 <p>The optional "tail" marker indicates whether the callee function accesses
4144 any allocas or varargs in the caller. If the "tail" marker is present, the
Chris Lattner2bff5242005-05-06 05:47:36 +00004145 function call is eligible for tail call optimization. Note that calls may
4146 be marked "tail" even if they do not occur before a <a
4147 href="#i_ret"><tt>ret</tt></a> instruction.
Chris Lattner261efe92003-11-25 01:02:51 +00004148 </li>
4149 <li>
Duncan Sands8036ca42007-03-30 12:22:09 +00004150 <p>The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattnerbad10ee2005-05-06 22:57:40 +00004151 convention</a> the call should use. If none is specified, the call defaults
4152 to using C calling conventions.
4153 </li>
4154 <li>
Nick Lewyckydb7e3c92007-09-08 13:57:50 +00004155 <p>'<tt>ty</tt>': the type of the call instruction itself which is also
4156 the type of the return value. Functions that return no value are marked
4157 <tt><a href="#t_void">void</a></tt>.</p>
4158 </li>
4159 <li>
4160 <p>'<tt>fnty</tt>': shall be the signature of the pointer to function
4161 value being invoked. The argument types must match the types implied by
4162 this signature. This type can be omitted if the function is not varargs
4163 and if the function type does not return a pointer to a function.</p>
Chris Lattner2bff5242005-05-06 05:47:36 +00004164 </li>
4165 <li>
4166 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
4167 be invoked. In most cases, this is a direct function invocation, but
4168 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
John Criswellfc6b8952005-05-16 16:17:45 +00004169 to function value.</p>
Chris Lattner261efe92003-11-25 01:02:51 +00004170 </li>
4171 <li>
4172 <p>'<tt>function args</tt>': argument list whose types match the
Reid Spencera7e302a2005-05-01 22:22:57 +00004173 function signature argument types. All arguments must be of
4174 <a href="#t_firstclass">first class</a> type. If the function signature
4175 indicates the function accepts a variable number of arguments, the extra
4176 arguments can be specified.</p>
Chris Lattner261efe92003-11-25 01:02:51 +00004177 </li>
Chris Lattner6536cfe2002-05-06 22:08:29 +00004178</ol>
Chris Lattner2bff5242005-05-06 05:47:36 +00004179
Chris Lattner00950542001-06-06 20:29:01 +00004180<h5>Semantics:</h5>
Chris Lattner2bff5242005-05-06 05:47:36 +00004181
Chris Lattner261efe92003-11-25 01:02:51 +00004182<p>The '<tt>call</tt>' instruction is used to cause control flow to
4183transfer to a specified function, with its incoming arguments bound to
4184the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
4185instruction in the called function, control flow continues with the
4186instruction after the function call, and the return value of the
Chris Lattner772fccf2008-03-21 17:24:17 +00004187function is bound to the result argument. If the callee returns multiple
4188values then the return values of the function are only accessible through
4189the '<tt><a href="#i_getresult">getresult</a></tt>' instruction.</p>
Chris Lattner2bff5242005-05-06 05:47:36 +00004190
Chris Lattner00950542001-06-06 20:29:01 +00004191<h5>Example:</h5>
Chris Lattner2bff5242005-05-06 05:47:36 +00004192
4193<pre>
Nick Lewyckydb7e3c92007-09-08 13:57:50 +00004194 %retval = call i32 @test(i32 %argc)
Chris Lattner772fccf2008-03-21 17:24:17 +00004195 call i32 (i8 *, ...)* @printf(i8 * %msg, i32 12, i8 42) <i>; yields i32</i>
4196 %X = tail call i32 @foo() <i>; yields i32</i>
4197 %Y = tail call <a href="#callingconv">fastcc</a> i32 @foo() <i>; yields i32</i>
4198 call void %foo(i8 97 signext)
Devang Patelc3fc6df2008-03-10 20:49:15 +00004199
4200 %struct.A = type { i32, i8 }
Chris Lattner772fccf2008-03-21 17:24:17 +00004201 %r = call %struct.A @foo() <i>; yields { 32, i8 }</i>
4202 %gr = getresult %struct.A %r, 0 <i>; yields i32</i>
4203 %gr1 = getresult %struct.A %r, 1 <i>; yields i8</i>
Chris Lattner2bff5242005-05-06 05:47:36 +00004204</pre>
4205
Misha Brukman9d0919f2003-11-08 01:05:38 +00004206</div>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004207
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004208<!-- _______________________________________________________________________ -->
Chris Lattnere19d7a72004-09-27 21:51:25 +00004209<div class="doc_subsubsection">
Chris Lattnerfb6977d2006-01-13 23:26:01 +00004210 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004211</div>
4212
Misha Brukman9d0919f2003-11-08 01:05:38 +00004213<div class="doc_text">
Chris Lattnere19d7a72004-09-27 21:51:25 +00004214
Chris Lattner8d1a81d2003-10-18 05:51:36 +00004215<h5>Syntax:</h5>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004216
4217<pre>
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004218 &lt;resultval&gt; = va_arg &lt;va_list*&gt; &lt;arglist&gt;, &lt;argty&gt;
Chris Lattnere19d7a72004-09-27 21:51:25 +00004219</pre>
4220
Chris Lattner8d1a81d2003-10-18 05:51:36 +00004221<h5>Overview:</h5>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004222
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004223<p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
Chris Lattnere19d7a72004-09-27 21:51:25 +00004224the "variable argument" area of a function call. It is used to implement the
4225<tt>va_arg</tt> macro in C.</p>
4226
Chris Lattner8d1a81d2003-10-18 05:51:36 +00004227<h5>Arguments:</h5>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004228
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004229<p>This instruction takes a <tt>va_list*</tt> value and the type of
4230the argument. It returns a value of the specified argument type and
Jeff Cohenb627eab2007-04-29 01:07:00 +00004231increments the <tt>va_list</tt> to point to the next argument. The
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004232actual type of <tt>va_list</tt> is target specific.</p>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004233
Chris Lattner8d1a81d2003-10-18 05:51:36 +00004234<h5>Semantics:</h5>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004235
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004236<p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
4237type from the specified <tt>va_list</tt> and causes the
4238<tt>va_list</tt> to point to the next argument. For more information,
4239see the variable argument handling <a href="#int_varargs">Intrinsic
4240Functions</a>.</p>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004241
4242<p>It is legal for this instruction to be called in a function which does not
4243take a variable number of arguments, for example, the <tt>vfprintf</tt>
Misha Brukman9d0919f2003-11-08 01:05:38 +00004244function.</p>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004245
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004246<p><tt>va_arg</tt> is an LLVM instruction instead of an <a
John Criswellfc6b8952005-05-16 16:17:45 +00004247href="#intrinsics">intrinsic function</a> because it takes a type as an
Chris Lattnere19d7a72004-09-27 21:51:25 +00004248argument.</p>
4249
Chris Lattner8d1a81d2003-10-18 05:51:36 +00004250<h5>Example:</h5>
Chris Lattnere19d7a72004-09-27 21:51:25 +00004251
4252<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
4253
Misha Brukman9d0919f2003-11-08 01:05:38 +00004254</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004255
Devang Patelc3fc6df2008-03-10 20:49:15 +00004256<!-- _______________________________________________________________________ -->
4257<div class="doc_subsubsection">
4258 <a name="i_getresult">'<tt>getresult</tt>' Instruction</a>
4259</div>
4260
4261<div class="doc_text">
4262
4263<h5>Syntax:</h5>
4264<pre>
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004265 &lt;resultval&gt; = getresult &lt;type&gt; &lt;retval&gt;, &lt;index&gt;
Devang Patelc3fc6df2008-03-10 20:49:15 +00004266</pre>
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004267
Devang Patelc3fc6df2008-03-10 20:49:15 +00004268<h5>Overview:</h5>
4269
4270<p> The '<tt>getresult</tt>' instruction is used to extract individual values
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004271from a '<tt><a href="#i_call">call</a></tt>'
4272or '<tt><a href="#i_invoke">invoke</a></tt>' instruction that returns multiple
4273results.</p>
Devang Patelc3fc6df2008-03-10 20:49:15 +00004274
4275<h5>Arguments:</h5>
4276
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004277<p>The '<tt>getresult</tt>' instruction takes a call or invoke value as its
Chris Lattner1c406d72008-04-23 04:06:52 +00004278first argument, or an undef value. The value must have <a
4279href="#t_struct">structure type</a>. The second argument is a constant
4280unsigned index value which must be in range for the number of values returned
4281by the call.</p>
Devang Patelc3fc6df2008-03-10 20:49:15 +00004282
4283<h5>Semantics:</h5>
4284
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004285<p>The '<tt>getresult</tt>' instruction extracts the element identified by
4286'<tt>index</tt>' from the aggregate value.</p>
Devang Patelc3fc6df2008-03-10 20:49:15 +00004287
4288<h5>Example:</h5>
4289
4290<pre>
4291 %struct.A = type { i32, i8 }
4292
4293 %r = call %struct.A @foo()
Chris Lattner45c5e8b2008-03-21 17:20:51 +00004294 %gr = getresult %struct.A %r, 0 <i>; yields i32:%gr</i>
4295 %gr1 = getresult %struct.A %r, 1 <i>; yields i8:%gr1</i>
Devang Patelc3fc6df2008-03-10 20:49:15 +00004296 add i32 %gr, 42
4297 add i8 %gr1, 41
4298</pre>
4299
4300</div>
4301
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004302<!-- *********************************************************************** -->
Chris Lattner261efe92003-11-25 01:02:51 +00004303<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
4304<!-- *********************************************************************** -->
Chris Lattner8ff75902004-01-06 05:31:32 +00004305
Misha Brukman9d0919f2003-11-08 01:05:38 +00004306<div class="doc_text">
Chris Lattner33aec9e2004-02-12 17:01:32 +00004307
4308<p>LLVM supports the notion of an "intrinsic function". These functions have
Reid Spencer409e28f2007-04-01 08:04:23 +00004309well known names and semantics and are required to follow certain restrictions.
4310Overall, these intrinsics represent an extension mechanism for the LLVM
Jeff Cohenb627eab2007-04-29 01:07:00 +00004311language that does not require changing all of the transformations in LLVM when
Gabor Greif04367bf2007-07-06 22:07:22 +00004312adding to the language (or the bitcode reader/writer, the parser, etc...).</p>
Chris Lattner33aec9e2004-02-12 17:01:32 +00004313
John Criswellfc6b8952005-05-16 16:17:45 +00004314<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
Jeff Cohenb627eab2007-04-29 01:07:00 +00004315prefix is reserved in LLVM for intrinsic names; thus, function names may not
4316begin with this prefix. Intrinsic functions must always be external functions:
4317you cannot define the body of intrinsic functions. Intrinsic functions may
4318only be used in call or invoke instructions: it is illegal to take the address
4319of an intrinsic function. Additionally, because intrinsic functions are part
4320of the LLVM language, it is required if any are added that they be documented
4321here.</p>
Chris Lattner33aec9e2004-02-12 17:01:32 +00004322
Chandler Carruth69940402007-08-04 01:51:18 +00004323<p>Some intrinsic functions can be overloaded, i.e., the intrinsic represents
4324a family of functions that perform the same operation but on different data
4325types. Because LLVM can represent over 8 million different integer types,
4326overloading is used commonly to allow an intrinsic function to operate on any
4327integer type. One or more of the argument types or the result type can be
4328overloaded to accept any integer type. Argument types may also be defined as
4329exactly matching a previous argument's type or the result type. This allows an
4330intrinsic function which accepts multiple arguments, but needs all of them to
4331be of the same type, to only be overloaded with respect to a single argument or
4332the result.</p>
Chris Lattner33aec9e2004-02-12 17:01:32 +00004333
Chandler Carruth69940402007-08-04 01:51:18 +00004334<p>Overloaded intrinsics will have the names of its overloaded argument types
4335encoded into its function name, each preceded by a period. Only those types
4336which are overloaded result in a name suffix. Arguments whose type is matched
4337against another type do not. For example, the <tt>llvm.ctpop</tt> function can
4338take an integer of any width and returns an integer of exactly the same integer
4339width. This leads to a family of functions such as
4340<tt>i8 @llvm.ctpop.i8(i8 %val)</tt> and <tt>i29 @llvm.ctpop.i29(i29 %val)</tt>.
4341Only one type, the return type, is overloaded, and only one type suffix is
4342required. Because the argument's type is matched against the return type, it
4343does not require its own name suffix.</p>
Reid Spencer409e28f2007-04-01 08:04:23 +00004344
4345<p>To learn how to add an intrinsic function, please see the
4346<a href="ExtendingLLVM.html">Extending LLVM Guide</a>.
Chris Lattner33aec9e2004-02-12 17:01:32 +00004347</p>
4348
Misha Brukman9d0919f2003-11-08 01:05:38 +00004349</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004350
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004351<!-- ======================================================================= -->
Chris Lattner8ff75902004-01-06 05:31:32 +00004352<div class="doc_subsection">
4353 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
4354</div>
4355
Misha Brukman9d0919f2003-11-08 01:05:38 +00004356<div class="doc_text">
Chris Lattnerd7923912004-05-23 21:06:01 +00004357
Misha Brukman9d0919f2003-11-08 01:05:38 +00004358<p>Variable argument support is defined in LLVM with the <a
Chris Lattnerfb6977d2006-01-13 23:26:01 +00004359 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
Chris Lattner261efe92003-11-25 01:02:51 +00004360intrinsic functions. These functions are related to the similarly
4361named macros defined in the <tt>&lt;stdarg.h&gt;</tt> header file.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004362
Chris Lattner261efe92003-11-25 01:02:51 +00004363<p>All of these functions operate on arguments that use a
4364target-specific value type "<tt>va_list</tt>". The LLVM assembly
4365language reference manual does not define what this type is, so all
Jeff Cohenb627eab2007-04-29 01:07:00 +00004366transformations should be prepared to handle these functions regardless of
4367the type used.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004368
Chris Lattner374ab302006-05-15 17:26:46 +00004369<p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
Chris Lattner261efe92003-11-25 01:02:51 +00004370instruction and the variable argument handling intrinsic functions are
4371used.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004372
Bill Wendling2f7a8b02007-05-29 09:04:49 +00004373<div class="doc_code">
Chris Lattner33aec9e2004-02-12 17:01:32 +00004374<pre>
Anton Korobeynikov5d522f32007-03-21 23:58:04 +00004375define i32 @test(i32 %X, ...) {
Chris Lattner33aec9e2004-02-12 17:01:32 +00004376 ; Initialize variable argument processing
Jeff Cohenb627eab2007-04-29 01:07:00 +00004377 %ap = alloca i8*
Chris Lattnerb75137d2007-01-08 07:55:15 +00004378 %ap2 = bitcast i8** %ap to i8*
Anton Korobeynikov5d522f32007-03-21 23:58:04 +00004379 call void @llvm.va_start(i8* %ap2)
Chris Lattner33aec9e2004-02-12 17:01:32 +00004380
4381 ; Read a single integer argument
Jeff Cohenb627eab2007-04-29 01:07:00 +00004382 %tmp = va_arg i8** %ap, i32
Chris Lattner33aec9e2004-02-12 17:01:32 +00004383
4384 ; Demonstrate usage of llvm.va_copy and llvm.va_end
Jeff Cohenb627eab2007-04-29 01:07:00 +00004385 %aq = alloca i8*
Chris Lattnerb75137d2007-01-08 07:55:15 +00004386 %aq2 = bitcast i8** %aq to i8*
Jeff Cohenb627eab2007-04-29 01:07:00 +00004387 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
Anton Korobeynikov5d522f32007-03-21 23:58:04 +00004388 call void @llvm.va_end(i8* %aq2)
Chris Lattner33aec9e2004-02-12 17:01:32 +00004389
4390 ; Stop processing of arguments.
Anton Korobeynikov5d522f32007-03-21 23:58:04 +00004391 call void @llvm.va_end(i8* %ap2)
Reid Spencerca86e162006-12-31 07:07:53 +00004392 ret i32 %tmp
Chris Lattner33aec9e2004-02-12 17:01:32 +00004393}
Anton Korobeynikov5d522f32007-03-21 23:58:04 +00004394
4395declare void @llvm.va_start(i8*)
4396declare void @llvm.va_copy(i8*, i8*)
4397declare void @llvm.va_end(i8*)
Chris Lattner33aec9e2004-02-12 17:01:32 +00004398</pre>
Misha Brukman9d0919f2003-11-08 01:05:38 +00004399</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004400
Bill Wendling2f7a8b02007-05-29 09:04:49 +00004401</div>
4402
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004403<!-- _______________________________________________________________________ -->
Chris Lattner8ff75902004-01-06 05:31:32 +00004404<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004405 <a name="int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
Chris Lattner8ff75902004-01-06 05:31:32 +00004406</div>
4407
4408
Misha Brukman9d0919f2003-11-08 01:05:38 +00004409<div class="doc_text">
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004410<h5>Syntax:</h5>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004411<pre> declare void %llvm.va_start(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004412<h5>Overview:</h5>
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004413<P>The '<tt>llvm.va_start</tt>' intrinsic initializes
4414<tt>*&lt;arglist&gt;</tt> for subsequent use by <tt><a
4415href="#i_va_arg">va_arg</a></tt>.</p>
4416
4417<h5>Arguments:</h5>
4418
4419<P>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
4420
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004421<h5>Semantics:</h5>
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004422
4423<P>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
4424macro available in C. In a target-dependent way, it initializes the
Jeff Cohenb627eab2007-04-29 01:07:00 +00004425<tt>va_list</tt> element to which the argument points, so that the next call to
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004426<tt>va_arg</tt> will produce the first variable argument passed to the function.
4427Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
Jeff Cohenb627eab2007-04-29 01:07:00 +00004428last argument of the function as the compiler can figure that out.</p>
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004429
Misha Brukman9d0919f2003-11-08 01:05:38 +00004430</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004431
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004432<!-- _______________________________________________________________________ -->
Chris Lattner8ff75902004-01-06 05:31:32 +00004433<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004434 <a name="int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
Chris Lattner8ff75902004-01-06 05:31:32 +00004435</div>
4436
Misha Brukman9d0919f2003-11-08 01:05:38 +00004437<div class="doc_text">
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004438<h5>Syntax:</h5>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004439<pre> declare void @llvm.va_end(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004440<h5>Overview:</h5>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004441
Jeff Cohenb627eab2007-04-29 01:07:00 +00004442<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt>*&lt;arglist&gt;</tt>,
Reid Spencera3e435f2007-04-04 02:42:35 +00004443which has been initialized previously with <tt><a href="#int_va_start">llvm.va_start</a></tt>
Chris Lattner261efe92003-11-25 01:02:51 +00004444or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004445
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004446<h5>Arguments:</h5>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004447
Jeff Cohenb627eab2007-04-29 01:07:00 +00004448<p>The argument is a pointer to a <tt>va_list</tt> to destroy.</p>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004449
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004450<h5>Semantics:</h5>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004451
Misha Brukman9d0919f2003-11-08 01:05:38 +00004452<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
Jeff Cohenb627eab2007-04-29 01:07:00 +00004453macro available in C. In a target-dependent way, it destroys the
4454<tt>va_list</tt> element to which the argument points. Calls to <a
4455href="#int_va_start"><tt>llvm.va_start</tt></a> and <a href="#int_va_copy">
4456<tt>llvm.va_copy</tt></a> must be matched exactly with calls to
4457<tt>llvm.va_end</tt>.</p>
Chris Lattnerb75137d2007-01-08 07:55:15 +00004458
Misha Brukman9d0919f2003-11-08 01:05:38 +00004459</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004460
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004461<!-- _______________________________________________________________________ -->
Chris Lattner8ff75902004-01-06 05:31:32 +00004462<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004463 <a name="int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
Chris Lattner8ff75902004-01-06 05:31:32 +00004464</div>
4465
Misha Brukman9d0919f2003-11-08 01:05:38 +00004466<div class="doc_text">
Chris Lattnerd7923912004-05-23 21:06:01 +00004467
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004468<h5>Syntax:</h5>
Chris Lattnerd7923912004-05-23 21:06:01 +00004469
4470<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004471 declare void @llvm.va_copy(i8* &lt;destarglist&gt;, i8* &lt;srcarglist&gt;)
Chris Lattnerd7923912004-05-23 21:06:01 +00004472</pre>
4473
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004474<h5>Overview:</h5>
Chris Lattnerd7923912004-05-23 21:06:01 +00004475
Jeff Cohenb627eab2007-04-29 01:07:00 +00004476<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position
4477from the source argument list to the destination argument list.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004478
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004479<h5>Arguments:</h5>
Chris Lattnerd7923912004-05-23 21:06:01 +00004480
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004481<p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
Andrew Lenharthd0a4c622005-06-22 20:38:11 +00004482The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
Andrew Lenharth8bf607a2005-06-18 18:28:17 +00004483
Chris Lattnerd7923912004-05-23 21:06:01 +00004484
Chris Lattnerd9ad5b32003-05-08 04:57:36 +00004485<h5>Semantics:</h5>
Chris Lattnerd7923912004-05-23 21:06:01 +00004486
Jeff Cohenb627eab2007-04-29 01:07:00 +00004487<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt>
4488macro available in C. In a target-dependent way, it copies the source
4489<tt>va_list</tt> element into the destination <tt>va_list</tt> element. This
4490intrinsic is necessary because the <tt><a href="#int_va_start">
4491llvm.va_start</a></tt> intrinsic may be arbitrarily complex and require, for
4492example, memory allocation.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004493
Misha Brukman9d0919f2003-11-08 01:05:38 +00004494</div>
Chris Lattner8ff75902004-01-06 05:31:32 +00004495
Chris Lattner33aec9e2004-02-12 17:01:32 +00004496<!-- ======================================================================= -->
4497<div class="doc_subsection">
Chris Lattnerd7923912004-05-23 21:06:01 +00004498 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
4499</div>
4500
4501<div class="doc_text">
4502
4503<p>
4504LLVM support for <a href="GarbageCollection.html">Accurate Garbage
4505Collection</a> requires the implementation and generation of these intrinsics.
Reid Spencera3e435f2007-04-04 02:42:35 +00004506These intrinsics allow identification of <a href="#int_gcroot">GC roots on the
Chris Lattnerd7923912004-05-23 21:06:01 +00004507stack</a>, as well as garbage collector implementations that require <a
Reid Spencera3e435f2007-04-04 02:42:35 +00004508href="#int_gcread">read</a> and <a href="#int_gcwrite">write</a> barriers.
Chris Lattnerd7923912004-05-23 21:06:01 +00004509Front-ends for type-safe garbage collected languages should generate these
4510intrinsics to make use of the LLVM garbage collectors. For more details, see <a
4511href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
4512</p>
Christopher Lamb303dae92007-12-17 01:00:21 +00004513
4514<p>The garbage collection intrinsics only operate on objects in the generic
4515 address space (address space zero).</p>
4516
Chris Lattnerd7923912004-05-23 21:06:01 +00004517</div>
4518
4519<!-- _______________________________________________________________________ -->
4520<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004521 <a name="int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
Chris Lattnerd7923912004-05-23 21:06:01 +00004522</div>
4523
4524<div class="doc_text">
4525
4526<h5>Syntax:</h5>
4527
4528<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004529 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
Chris Lattnerd7923912004-05-23 21:06:01 +00004530</pre>
4531
4532<h5>Overview:</h5>
4533
John Criswell9e2485c2004-12-10 15:51:16 +00004534<p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
Chris Lattnerd7923912004-05-23 21:06:01 +00004535the code generator, and allows some metadata to be associated with it.</p>
4536
4537<h5>Arguments:</h5>
4538
4539<p>The first argument specifies the address of a stack object that contains the
4540root pointer. The second pointer (which must be either a constant or a global
4541value address) contains the meta-data to be associated with the root.</p>
4542
4543<h5>Semantics:</h5>
4544
Chris Lattner05d67092008-04-24 05:59:56 +00004545<p>At runtime, a call to this intrinsic stores a null pointer into the "ptrloc"
Chris Lattnerd7923912004-05-23 21:06:01 +00004546location. At compile-time, the code generator generates information to allow
Gordon Henriksene1433f22007-12-25 02:31:26 +00004547the runtime to find the pointer at GC safe points. The '<tt>llvm.gcroot</tt>'
4548intrinsic may only be used in a function which <a href="#gc">specifies a GC
4549algorithm</a>.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004550
4551</div>
4552
4553
4554<!-- _______________________________________________________________________ -->
4555<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004556 <a name="int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
Chris Lattnerd7923912004-05-23 21:06:01 +00004557</div>
4558
4559<div class="doc_text">
4560
4561<h5>Syntax:</h5>
4562
4563<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004564 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
Chris Lattnerd7923912004-05-23 21:06:01 +00004565</pre>
4566
4567<h5>Overview:</h5>
4568
4569<p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
4570locations, allowing garbage collector implementations that require read
4571barriers.</p>
4572
4573<h5>Arguments:</h5>
4574
Chris Lattner80626e92006-03-14 20:02:51 +00004575<p>The second argument is the address to read from, which should be an address
4576allocated from the garbage collector. The first object is a pointer to the
4577start of the referenced object, if needed by the language runtime (otherwise
4578null).</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004579
4580<h5>Semantics:</h5>
4581
4582<p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
4583instruction, but may be replaced with substantially more complex code by the
Gordon Henriksene1433f22007-12-25 02:31:26 +00004584garbage collector runtime, as needed. The '<tt>llvm.gcread</tt>' intrinsic
4585may only be used in a function which <a href="#gc">specifies a GC
4586algorithm</a>.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004587
4588</div>
4589
4590
4591<!-- _______________________________________________________________________ -->
4592<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004593 <a name="int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
Chris Lattnerd7923912004-05-23 21:06:01 +00004594</div>
4595
4596<div class="doc_text">
4597
4598<h5>Syntax:</h5>
4599
4600<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004601 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
Chris Lattnerd7923912004-05-23 21:06:01 +00004602</pre>
4603
4604<h5>Overview:</h5>
4605
4606<p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
4607locations, allowing garbage collector implementations that require write
4608barriers (such as generational or reference counting collectors).</p>
4609
4610<h5>Arguments:</h5>
4611
Chris Lattner80626e92006-03-14 20:02:51 +00004612<p>The first argument is the reference to store, the second is the start of the
4613object to store it to, and the third is the address of the field of Obj to
4614store to. If the runtime does not require a pointer to the object, Obj may be
4615null.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004616
4617<h5>Semantics:</h5>
4618
4619<p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
4620instruction, but may be replaced with substantially more complex code by the
Gordon Henriksene1433f22007-12-25 02:31:26 +00004621garbage collector runtime, as needed. The '<tt>llvm.gcwrite</tt>' intrinsic
4622may only be used in a function which <a href="#gc">specifies a GC
4623algorithm</a>.</p>
Chris Lattnerd7923912004-05-23 21:06:01 +00004624
4625</div>
4626
4627
4628
4629<!-- ======================================================================= -->
4630<div class="doc_subsection">
Chris Lattner10610642004-02-14 04:08:35 +00004631 <a name="int_codegen">Code Generator Intrinsics</a>
4632</div>
4633
4634<div class="doc_text">
4635<p>
4636These intrinsics are provided by LLVM to expose special features that may only
4637be implemented with code generator support.
4638</p>
4639
4640</div>
4641
4642<!-- _______________________________________________________________________ -->
4643<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004644 <a name="int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
Chris Lattner10610642004-02-14 04:08:35 +00004645</div>
4646
4647<div class="doc_text">
4648
4649<h5>Syntax:</h5>
4650<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004651 declare i8 *@llvm.returnaddress(i32 &lt;level&gt;)
Chris Lattner10610642004-02-14 04:08:35 +00004652</pre>
4653
4654<h5>Overview:</h5>
4655
4656<p>
Chris Lattner32b5d712006-10-15 20:05:59 +00004657The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
4658target-specific value indicating the return address of the current function
4659or one of its callers.
Chris Lattner10610642004-02-14 04:08:35 +00004660</p>
4661
4662<h5>Arguments:</h5>
4663
4664<p>
4665The argument to this intrinsic indicates which function to return the address
4666for. Zero indicates the calling function, one indicates its caller, etc. The
4667argument is <b>required</b> to be a constant integer value.
4668</p>
4669
4670<h5>Semantics:</h5>
4671
4672<p>
4673The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
4674the return address of the specified call frame, or zero if it cannot be
4675identified. The value returned by this intrinsic is likely to be incorrect or 0
4676for arguments other than zero, so it should only be used for debugging purposes.
4677</p>
4678
4679<p>
4680Note that calling this intrinsic does not prevent function inlining or other
Chris Lattnerb40bb382005-03-07 20:30:51 +00004681aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner10610642004-02-14 04:08:35 +00004682source-language caller.
4683</p>
4684</div>
4685
4686
4687<!-- _______________________________________________________________________ -->
4688<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004689 <a name="int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
Chris Lattner10610642004-02-14 04:08:35 +00004690</div>
4691
4692<div class="doc_text">
4693
4694<h5>Syntax:</h5>
4695<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004696 declare i8 *@llvm.frameaddress(i32 &lt;level&gt;)
Chris Lattner10610642004-02-14 04:08:35 +00004697</pre>
4698
4699<h5>Overview:</h5>
4700
4701<p>
Chris Lattner32b5d712006-10-15 20:05:59 +00004702The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
4703target-specific frame pointer value for the specified stack frame.
Chris Lattner10610642004-02-14 04:08:35 +00004704</p>
4705
4706<h5>Arguments:</h5>
4707
4708<p>
4709The argument to this intrinsic indicates which function to return the frame
4710pointer for. Zero indicates the calling function, one indicates its caller,
4711etc. The argument is <b>required</b> to be a constant integer value.
4712</p>
4713
4714<h5>Semantics:</h5>
4715
4716<p>
4717The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
4718the frame address of the specified call frame, or zero if it cannot be
4719identified. The value returned by this intrinsic is likely to be incorrect or 0
4720for arguments other than zero, so it should only be used for debugging purposes.
4721</p>
4722
4723<p>
4724Note that calling this intrinsic does not prevent function inlining or other
Chris Lattnerb40bb382005-03-07 20:30:51 +00004725aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner10610642004-02-14 04:08:35 +00004726source-language caller.
4727</p>
4728</div>
4729
Chris Lattner9a9d7ac2005-02-28 19:24:19 +00004730<!-- _______________________________________________________________________ -->
4731<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004732 <a name="int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
Chris Lattner57e1f392006-01-13 02:03:13 +00004733</div>
4734
4735<div class="doc_text">
4736
4737<h5>Syntax:</h5>
4738<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004739 declare i8 *@llvm.stacksave()
Chris Lattner57e1f392006-01-13 02:03:13 +00004740</pre>
4741
4742<h5>Overview:</h5>
4743
4744<p>
4745The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
Reid Spencera3e435f2007-04-04 02:42:35 +00004746the function stack, for use with <a href="#int_stackrestore">
Chris Lattner57e1f392006-01-13 02:03:13 +00004747<tt>llvm.stackrestore</tt></a>. This is useful for implementing language
4748features like scoped automatic variable sized arrays in C99.
4749</p>
4750
4751<h5>Semantics:</h5>
4752
4753<p>
4754This intrinsic returns a opaque pointer value that can be passed to <a
Reid Spencera3e435f2007-04-04 02:42:35 +00004755href="#int_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
Chris Lattner57e1f392006-01-13 02:03:13 +00004756<tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
4757<tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
4758state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
4759practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
4760that were allocated after the <tt>llvm.stacksave</tt> was executed.
4761</p>
4762
4763</div>
4764
4765<!-- _______________________________________________________________________ -->
4766<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004767 <a name="int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
Chris Lattner57e1f392006-01-13 02:03:13 +00004768</div>
4769
4770<div class="doc_text">
4771
4772<h5>Syntax:</h5>
4773<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004774 declare void @llvm.stackrestore(i8 * %ptr)
Chris Lattner57e1f392006-01-13 02:03:13 +00004775</pre>
4776
4777<h5>Overview:</h5>
4778
4779<p>
4780The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
4781the function stack to the state it was in when the corresponding <a
Reid Spencera3e435f2007-04-04 02:42:35 +00004782href="#int_stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
Chris Lattner57e1f392006-01-13 02:03:13 +00004783useful for implementing language features like scoped automatic variable sized
4784arrays in C99.
4785</p>
4786
4787<h5>Semantics:</h5>
4788
4789<p>
Reid Spencera3e435f2007-04-04 02:42:35 +00004790See the description for <a href="#int_stacksave"><tt>llvm.stacksave</tt></a>.
Chris Lattner57e1f392006-01-13 02:03:13 +00004791</p>
4792
4793</div>
4794
4795
4796<!-- _______________________________________________________________________ -->
4797<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004798 <a name="int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
Chris Lattner9a9d7ac2005-02-28 19:24:19 +00004799</div>
4800
4801<div class="doc_text">
4802
4803<h5>Syntax:</h5>
4804<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004805 declare void @llvm.prefetch(i8* &lt;address&gt;, i32 &lt;rw&gt;, i32 &lt;locality&gt;)
Chris Lattner9a9d7ac2005-02-28 19:24:19 +00004806</pre>
4807
4808<h5>Overview:</h5>
4809
4810
4811<p>
4812The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
John Criswellfc6b8952005-05-16 16:17:45 +00004813a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
4814no
4815effect on the behavior of the program but can change its performance
Chris Lattner2a615362005-02-28 19:47:14 +00004816characteristics.
Chris Lattner9a9d7ac2005-02-28 19:24:19 +00004817</p>
4818
4819<h5>Arguments:</h5>
4820
4821<p>
4822<tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
4823determining if the fetch should be for a read (0) or write (1), and
4824<tt>locality</tt> is a temporal locality specifier ranging from (0) - no
Chris Lattneraeffb4a2005-03-07 20:31:38 +00004825locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
Chris Lattner9a9d7ac2005-02-28 19:24:19 +00004826<tt>locality</tt> arguments must be constant integers.
4827</p>
4828
4829<h5>Semantics:</h5>
4830
4831<p>
4832This intrinsic does not modify the behavior of the program. In particular,
4833prefetches cannot trap and do not produce a value. On targets that support this
4834intrinsic, the prefetch can provide hints to the processor cache for better
4835performance.
4836</p>
4837
4838</div>
4839
Andrew Lenharth7f4ec3b2005-03-28 20:05:49 +00004840<!-- _______________________________________________________________________ -->
4841<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004842 <a name="int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
Andrew Lenharth7f4ec3b2005-03-28 20:05:49 +00004843</div>
4844
4845<div class="doc_text">
4846
4847<h5>Syntax:</h5>
4848<pre>
Chris Lattner1df4f752007-09-21 17:30:40 +00004849 declare void @llvm.pcmarker(i32 &lt;id&gt;)
Andrew Lenharth7f4ec3b2005-03-28 20:05:49 +00004850</pre>
4851
4852<h5>Overview:</h5>
4853
4854
4855<p>
John Criswellfc6b8952005-05-16 16:17:45 +00004856The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
4857(PC) in a region of
Andrew Lenharth7f4ec3b2005-03-28 20:05:49 +00004858code to simulators and other tools. The method is target specific, but it is
4859expected that the marker will use exported symbols to transmit the PC of the marker.
Jeff Cohen25d4f7e2005-11-11 02:15:27 +00004860The marker makes no guarantees that it will remain with any specific instruction
Chris Lattnerd07c3f42005-11-15 06:07:55 +00004861after optimizations. It is possible that the presence of a marker will inhibit
Chris Lattnerb3e7afd2006-03-24 07:16:10 +00004862optimizations. The intended use is to be inserted after optimizations to allow
John Criswellfc6b8952005-05-16 16:17:45 +00004863correlations of simulation runs.
Andrew Lenharth7f4ec3b2005-03-28 20:05:49 +00004864</p>
4865
4866<h5>Arguments:</h5>
4867
4868<p>
4869<tt>id</tt> is a numerical id identifying the marker.
4870</p>
4871
4872<h5>Semantics:</h5>
4873
4874<p>
4875This intrinsic does not modify the behavior of the program. Backends that do not
4876support this intrinisic may ignore it.
4877</p>
4878
4879</div>
4880
Andrew Lenharth51b8d542005-11-11 16:47:30 +00004881<!-- _______________________________________________________________________ -->
4882<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004883 <a name="int_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
Andrew Lenharth51b8d542005-11-11 16:47:30 +00004884</div>
4885
4886<div class="doc_text">
4887
4888<h5>Syntax:</h5>
4889<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004890 declare i64 @llvm.readcyclecounter( )
Andrew Lenharth51b8d542005-11-11 16:47:30 +00004891</pre>
4892
4893<h5>Overview:</h5>
4894
4895
4896<p>
4897The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
4898counter register (or similar low latency, high accuracy clocks) on those targets
4899that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
4900As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
4901should only be used for small timings.
4902</p>
4903
4904<h5>Semantics:</h5>
4905
4906<p>
4907When directly supported, reading the cycle counter should not modify any memory.
4908Implementations are allowed to either return a application specific value or a
4909system wide value. On backends without support, this is lowered to a constant 0.
4910</p>
4911
4912</div>
4913
Chris Lattner10610642004-02-14 04:08:35 +00004914<!-- ======================================================================= -->
4915<div class="doc_subsection">
Chris Lattner33aec9e2004-02-12 17:01:32 +00004916 <a name="int_libc">Standard C Library Intrinsics</a>
4917</div>
4918
4919<div class="doc_text">
4920<p>
Chris Lattner10610642004-02-14 04:08:35 +00004921LLVM provides intrinsics for a few important standard C library functions.
4922These intrinsics allow source-language front-ends to pass information about the
4923alignment of the pointer arguments to the code generator, providing opportunity
4924for more efficient code generation.
Chris Lattner33aec9e2004-02-12 17:01:32 +00004925</p>
4926
4927</div>
4928
4929<!-- _______________________________________________________________________ -->
4930<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004931 <a name="int_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
Chris Lattner33aec9e2004-02-12 17:01:32 +00004932</div>
4933
4934<div class="doc_text">
4935
4936<h5>Syntax:</h5>
4937<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004938 declare void @llvm.memcpy.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00004939 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004940 declare void @llvm.memcpy.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00004941 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner33aec9e2004-02-12 17:01:32 +00004942</pre>
4943
4944<h5>Overview:</h5>
4945
4946<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00004947The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattner33aec9e2004-02-12 17:01:32 +00004948location to the destination location.
4949</p>
4950
4951<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00004952Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
4953intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattner33aec9e2004-02-12 17:01:32 +00004954</p>
4955
4956<h5>Arguments:</h5>
4957
4958<p>
4959The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner5b310c32006-03-03 00:07:20 +00004960the source. The third argument is an integer argument
Chris Lattner33aec9e2004-02-12 17:01:32 +00004961specifying the number of bytes to copy, and the fourth argument is the alignment
4962of the source and destination locations.
4963</p>
4964
Chris Lattner3301ced2004-02-12 21:18:15 +00004965<p>
4966If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattnerf0afc2c2006-03-04 00:02:10 +00004967the caller guarantees that both the source and destination pointers are aligned
4968to that boundary.
Chris Lattner3301ced2004-02-12 21:18:15 +00004969</p>
4970
Chris Lattner33aec9e2004-02-12 17:01:32 +00004971<h5>Semantics:</h5>
4972
4973<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00004974The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattner33aec9e2004-02-12 17:01:32 +00004975location to the destination location, which are not allowed to overlap. It
4976copies "len" bytes of memory over. If the argument is known to be aligned to
4977some boundary, this can be specified as the fourth argument, otherwise it should
4978be set to 0 or 1.
4979</p>
4980</div>
4981
4982
Chris Lattner0eb51b42004-02-12 18:10:10 +00004983<!-- _______________________________________________________________________ -->
4984<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00004985 <a name="int_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
Chris Lattner0eb51b42004-02-12 18:10:10 +00004986</div>
4987
4988<div class="doc_text">
4989
4990<h5>Syntax:</h5>
4991<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004992 declare void @llvm.memmove.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00004993 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00004994 declare void @llvm.memmove.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00004995 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner0eb51b42004-02-12 18:10:10 +00004996</pre>
4997
4998<h5>Overview:</h5>
4999
5000<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00005001The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
5002location to the destination location. It is similar to the
Chris Lattner4b2cbcf2008-01-06 19:51:52 +00005003'<tt>llvm.memcpy</tt>' intrinsic but allows the two memory locations to overlap.
Chris Lattner0eb51b42004-02-12 18:10:10 +00005004</p>
5005
5006<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00005007Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
5008intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattner0eb51b42004-02-12 18:10:10 +00005009</p>
5010
5011<h5>Arguments:</h5>
5012
5013<p>
5014The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner5b310c32006-03-03 00:07:20 +00005015the source. The third argument is an integer argument
Chris Lattner0eb51b42004-02-12 18:10:10 +00005016specifying the number of bytes to copy, and the fourth argument is the alignment
5017of the source and destination locations.
5018</p>
5019
Chris Lattner3301ced2004-02-12 21:18:15 +00005020<p>
5021If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattnerf0afc2c2006-03-04 00:02:10 +00005022the caller guarantees that the source and destination pointers are aligned to
5023that boundary.
Chris Lattner3301ced2004-02-12 21:18:15 +00005024</p>
5025
Chris Lattner0eb51b42004-02-12 18:10:10 +00005026<h5>Semantics:</h5>
5027
5028<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00005029The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
Chris Lattner0eb51b42004-02-12 18:10:10 +00005030location to the destination location, which may overlap. It
5031copies "len" bytes of memory over. If the argument is known to be aligned to
5032some boundary, this can be specified as the fourth argument, otherwise it should
5033be set to 0 or 1.
5034</p>
5035</div>
5036
Chris Lattner8ff75902004-01-06 05:31:32 +00005037
Chris Lattner10610642004-02-14 04:08:35 +00005038<!-- _______________________________________________________________________ -->
5039<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00005040 <a name="int_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
Chris Lattner10610642004-02-14 04:08:35 +00005041</div>
5042
5043<div class="doc_text">
5044
5045<h5>Syntax:</h5>
5046<pre>
Anton Korobeynikovec43a062007-03-22 00:02:17 +00005047 declare void @llvm.memset.i32(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00005048 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00005049 declare void @llvm.memset.i64(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerca86e162006-12-31 07:07:53 +00005050 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner10610642004-02-14 04:08:35 +00005051</pre>
5052
5053<h5>Overview:</h5>
5054
5055<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00005056The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
Chris Lattner10610642004-02-14 04:08:35 +00005057byte value.
5058</p>
5059
5060<p>
5061Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
5062does not return a value, and takes an extra alignment argument.
5063</p>
5064
5065<h5>Arguments:</h5>
5066
5067<p>
5068The first argument is a pointer to the destination to fill, the second is the
Chris Lattner5b310c32006-03-03 00:07:20 +00005069byte value to fill it with, the third argument is an integer
Chris Lattner10610642004-02-14 04:08:35 +00005070argument specifying the number of bytes to fill, and the fourth argument is the
5071known alignment of destination location.
5072</p>
5073
5074<p>
5075If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattnerf0afc2c2006-03-04 00:02:10 +00005076the caller guarantees that the destination pointer is aligned to that boundary.
Chris Lattner10610642004-02-14 04:08:35 +00005077</p>
5078
5079<h5>Semantics:</h5>
5080
5081<p>
Chris Lattner5b310c32006-03-03 00:07:20 +00005082The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
5083the
Chris Lattner10610642004-02-14 04:08:35 +00005084destination location. If the argument is known to be aligned to some boundary,
5085this can be specified as the fourth argument, otherwise it should be set to 0 or
50861.
5087</p>
5088</div>
5089
5090
Chris Lattner32006282004-06-11 02:28:03 +00005091<!-- _______________________________________________________________________ -->
5092<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00005093 <a name="int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
Chris Lattnera4d74142005-07-21 01:29:16 +00005094</div>
5095
5096<div class="doc_text">
5097
5098<h5>Syntax:</h5>
Dale Johannesen408f9c12007-10-02 17:47:38 +00005099<p>This is an overloaded intrinsic. You can use <tt>llvm.sqrt</tt> on any
Dan Gohman91c284c2007-10-15 20:30:11 +00005100floating point or vector of floating point type. Not all targets support all
5101types however.
Chris Lattnera4d74142005-07-21 01:29:16 +00005102<pre>
Dale Johannesen408f9c12007-10-02 17:47:38 +00005103 declare float @llvm.sqrt.f32(float %Val)
5104 declare double @llvm.sqrt.f64(double %Val)
5105 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
5106 declare fp128 @llvm.sqrt.f128(fp128 %Val)
5107 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
Chris Lattnera4d74142005-07-21 01:29:16 +00005108</pre>
5109
5110<h5>Overview:</h5>
5111
5112<p>
Reid Spencer0b118202006-01-16 21:12:35 +00005113The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
Dan Gohman91c284c2007-10-15 20:30:11 +00005114returning the same value as the libm '<tt>sqrt</tt>' functions would. Unlike
Chris Lattnera4d74142005-07-21 01:29:16 +00005115<tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
Chris Lattner103e2d72008-01-29 07:00:44 +00005116negative numbers other than -0.0 (which allows for better optimization, because
5117there is no need to worry about errno being set). <tt>llvm.sqrt(-0.0)</tt> is
5118defined to return -0.0 like IEEE sqrt.
Chris Lattnera4d74142005-07-21 01:29:16 +00005119</p>
5120
5121<h5>Arguments:</h5>
5122
5123<p>
5124The argument and return value are floating point numbers of the same type.
5125</p>
5126
5127<h5>Semantics:</h5>
5128
5129<p>
Dan Gohmand6257fe2007-07-16 14:37:41 +00005130This function returns the sqrt of the specified operand if it is a nonnegative
Chris Lattnera4d74142005-07-21 01:29:16 +00005131floating point number.
5132</p>
5133</div>
5134
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005135<!-- _______________________________________________________________________ -->
5136<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00005137 <a name="int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005138</div>
5139
5140<div class="doc_text">
5141
5142<h5>Syntax:</h5>
Dale Johannesen408f9c12007-10-02 17:47:38 +00005143<p>This is an overloaded intrinsic. You can use <tt>llvm.powi</tt> on any
Dan Gohman91c284c2007-10-15 20:30:11 +00005144floating point or vector of floating point type. Not all targets support all
5145types however.
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005146<pre>
Dale Johannesen408f9c12007-10-02 17:47:38 +00005147 declare float @llvm.powi.f32(float %Val, i32 %power)
5148 declare double @llvm.powi.f64(double %Val, i32 %power)
5149 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
5150 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
5151 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005152</pre>
5153
5154<h5>Overview:</h5>
5155
5156<p>
5157The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
5158specified (positive or negative) power. The order of evaluation of
Dan Gohman91c284c2007-10-15 20:30:11 +00005159multiplications is not defined. When a vector of floating point type is
5160used, the second argument remains a scalar integer value.
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005161</p>
5162
5163<h5>Arguments:</h5>
5164
5165<p>
5166The second argument is an integer power, and the first is a value to raise to
5167that power.
5168</p>
5169
5170<h5>Semantics:</h5>
5171
5172<p>
5173This function returns the first value raised to the second power with an
5174unspecified sequence of rounding operations.</p>
5175</div>
5176
Dan Gohman91c284c2007-10-15 20:30:11 +00005177<!-- _______________________________________________________________________ -->
5178<div class="doc_subsubsection">
5179 <a name="int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a>
5180</div>
5181
5182<div class="doc_text">
5183
5184<h5>Syntax:</h5>
5185<p>This is an overloaded intrinsic. You can use <tt>llvm.sin</tt> on any
5186floating point or vector of floating point type. Not all targets support all
5187types however.
5188<pre>
5189 declare float @llvm.sin.f32(float %Val)
5190 declare double @llvm.sin.f64(double %Val)
5191 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
5192 declare fp128 @llvm.sin.f128(fp128 %Val)
5193 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
5194</pre>
5195
5196<h5>Overview:</h5>
5197
5198<p>
5199The '<tt>llvm.sin.*</tt>' intrinsics return the sine of the operand.
5200</p>
5201
5202<h5>Arguments:</h5>
5203
5204<p>
5205The argument and return value are floating point numbers of the same type.
5206</p>
5207
5208<h5>Semantics:</h5>
5209
5210<p>
5211This function returns the sine of the specified operand, returning the
5212same values as the libm <tt>sin</tt> functions would, and handles error
Dan Gohmanba83b7e2007-10-17 18:05:13 +00005213conditions in the same way.</p>
Dan Gohman91c284c2007-10-15 20:30:11 +00005214</div>
5215
5216<!-- _______________________________________________________________________ -->
5217<div class="doc_subsubsection">
5218 <a name="int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a>
5219</div>
5220
5221<div class="doc_text">
5222
5223<h5>Syntax:</h5>
5224<p>This is an overloaded intrinsic. You can use <tt>llvm.cos</tt> on any
5225floating point or vector of floating point type. Not all targets support all
5226types however.
5227<pre>
5228 declare float @llvm.cos.f32(float %Val)
5229 declare double @llvm.cos.f64(double %Val)
5230 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
5231 declare fp128 @llvm.cos.f128(fp128 %Val)
5232 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
5233</pre>
5234
5235<h5>Overview:</h5>
5236
5237<p>
5238The '<tt>llvm.cos.*</tt>' intrinsics return the cosine of the operand.
5239</p>
5240
5241<h5>Arguments:</h5>
5242
5243<p>
5244The argument and return value are floating point numbers of the same type.
5245</p>
5246
5247<h5>Semantics:</h5>
5248
5249<p>
5250This function returns the cosine of the specified operand, returning the
5251same values as the libm <tt>cos</tt> functions would, and handles error
Dan Gohmanba83b7e2007-10-17 18:05:13 +00005252conditions in the same way.</p>
Dan Gohman91c284c2007-10-15 20:30:11 +00005253</div>
5254
5255<!-- _______________________________________________________________________ -->
5256<div class="doc_subsubsection">
5257 <a name="int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a>
5258</div>
5259
5260<div class="doc_text">
5261
5262<h5>Syntax:</h5>
5263<p>This is an overloaded intrinsic. You can use <tt>llvm.pow</tt> on any
5264floating point or vector of floating point type. Not all targets support all
5265types however.
5266<pre>
5267 declare float @llvm.pow.f32(float %Val, float %Power)
5268 declare double @llvm.pow.f64(double %Val, double %Power)
5269 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
5270 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
5271 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
5272</pre>
5273
5274<h5>Overview:</h5>
5275
5276<p>
5277The '<tt>llvm.pow.*</tt>' intrinsics return the first operand raised to the
5278specified (positive or negative) power.
5279</p>
5280
5281<h5>Arguments:</h5>
5282
5283<p>
5284The second argument is a floating point power, and the first is a value to
5285raise to that power.
5286</p>
5287
5288<h5>Semantics:</h5>
5289
5290<p>
5291This function returns the first value raised to the second power,
5292returning the
5293same values as the libm <tt>pow</tt> functions would, and handles error
Dan Gohmanba83b7e2007-10-17 18:05:13 +00005294conditions in the same way.</p>
Dan Gohman91c284c2007-10-15 20:30:11 +00005295</div>
5296
Chris Lattnerf4d252d2006-09-08 06:34:02 +00005297
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005298<!-- ======================================================================= -->
5299<div class="doc_subsection">
Nate Begeman7e36c472006-01-13 23:26:38 +00005300 <a name="int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005301</div>
5302
5303<div class="doc_text">
5304<p>
Nate Begeman7e36c472006-01-13 23:26:38 +00005305LLVM provides intrinsics for a few important bit manipulation operations.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005306These allow efficient code generation for some algorithms.
5307</p>
5308
5309</div>
5310
5311<!-- _______________________________________________________________________ -->
5312<div class="doc_subsubsection">
Reid Spencera3e435f2007-04-04 02:42:35 +00005313 <a name="int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
Nate Begeman7e36c472006-01-13 23:26:38 +00005314</div>
5315
5316<div class="doc_text">
5317
5318<h5>Syntax:</h5>
Reid Spencer409e28f2007-04-01 08:04:23 +00005319<p>This is an overloaded intrinsic function. You can use bswap on any integer
Chandler Carruth69940402007-08-04 01:51:18 +00005320type that is an even number of bytes (i.e. BitWidth % 16 == 0).
Nate Begeman7e36c472006-01-13 23:26:38 +00005321<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005322 declare i16 @llvm.bswap.i16(i16 &lt;id&gt;)
5323 declare i32 @llvm.bswap.i32(i32 &lt;id&gt;)
5324 declare i64 @llvm.bswap.i64(i64 &lt;id&gt;)
Nate Begeman7e36c472006-01-13 23:26:38 +00005325</pre>
5326
5327<h5>Overview:</h5>
5328
5329<p>
Reid Spencer338ea092007-04-02 02:25:19 +00005330The '<tt>llvm.bswap</tt>' family of intrinsics is used to byte swap integer
Reid Spencer409e28f2007-04-01 08:04:23 +00005331values with an even number of bytes (positive multiple of 16 bits). These are
5332useful for performing operations on data that is not in the target's native
5333byte order.
Nate Begeman7e36c472006-01-13 23:26:38 +00005334</p>
5335
5336<h5>Semantics:</h5>
5337
5338<p>
Chandler Carruth69940402007-08-04 01:51:18 +00005339The <tt>llvm.bswap.i16</tt> intrinsic returns an i16 value that has the high
Reid Spencerca86e162006-12-31 07:07:53 +00005340and low byte of the input i16 swapped. Similarly, the <tt>llvm.bswap.i32</tt>
5341intrinsic returns an i32 value that has the four bytes of the input i32
5342swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the returned
Chandler Carruth69940402007-08-04 01:51:18 +00005343i32 will have its bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i48</tt>,
5344<tt>llvm.bswap.i64</tt> and other intrinsics extend this concept to
Reid Spencer409e28f2007-04-01 08:04:23 +00005345additional even-byte lengths (6 bytes, 8 bytes and more, respectively).
Nate Begeman7e36c472006-01-13 23:26:38 +00005346</p>
5347
5348</div>
5349
5350<!-- _______________________________________________________________________ -->
5351<div class="doc_subsubsection">
Reid Spencer0b118202006-01-16 21:12:35 +00005352 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005353</div>
5354
5355<div class="doc_text">
5356
5357<h5>Syntax:</h5>
Reid Spencer409e28f2007-04-01 08:04:23 +00005358<p>This is an overloaded intrinsic. You can use llvm.ctpop on any integer bit
5359width. Not all targets support all bit widths however.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005360<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005361 declare i8 @llvm.ctpop.i8 (i8 &lt;src&gt;)
5362 declare i16 @llvm.ctpop.i16(i16 &lt;src&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00005363 declare i32 @llvm.ctpop.i32(i32 &lt;src&gt;)
Chandler Carruth69940402007-08-04 01:51:18 +00005364 declare i64 @llvm.ctpop.i64(i64 &lt;src&gt;)
5365 declare i256 @llvm.ctpop.i256(i256 &lt;src&gt;)
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005366</pre>
5367
5368<h5>Overview:</h5>
5369
5370<p>
Chris Lattnerec6cb612006-01-16 22:38:59 +00005371The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
5372value.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005373</p>
5374
5375<h5>Arguments:</h5>
5376
5377<p>
Chris Lattnercfe6b372005-05-07 01:46:40 +00005378The only argument is the value to be counted. The argument may be of any
Reid Spencera5173382007-01-04 16:43:23 +00005379integer type. The return type must match the argument type.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005380</p>
5381
5382<h5>Semantics:</h5>
5383
5384<p>
5385The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
5386</p>
5387</div>
5388
5389<!-- _______________________________________________________________________ -->
5390<div class="doc_subsubsection">
Chris Lattner8a886be2006-01-16 22:34:14 +00005391 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005392</div>
5393
5394<div class="doc_text">
5395
5396<h5>Syntax:</h5>
Reid Spencer409e28f2007-04-01 08:04:23 +00005397<p>This is an overloaded intrinsic. You can use <tt>llvm.ctlz</tt> on any
5398integer bit width. Not all targets support all bit widths however.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005399<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005400 declare i8 @llvm.ctlz.i8 (i8 &lt;src&gt;)
5401 declare i16 @llvm.ctlz.i16(i16 &lt;src&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00005402 declare i32 @llvm.ctlz.i32(i32 &lt;src&gt;)
Chandler Carruth69940402007-08-04 01:51:18 +00005403 declare i64 @llvm.ctlz.i64(i64 &lt;src&gt;)
5404 declare i256 @llvm.ctlz.i256(i256 &lt;src&gt;)
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005405</pre>
5406
5407<h5>Overview:</h5>
5408
5409<p>
Reid Spencer0b118202006-01-16 21:12:35 +00005410The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
5411leading zeros in a variable.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005412</p>
5413
5414<h5>Arguments:</h5>
5415
5416<p>
Chris Lattnercfe6b372005-05-07 01:46:40 +00005417The only argument is the value to be counted. The argument may be of any
Reid Spencera5173382007-01-04 16:43:23 +00005418integer type. The return type must match the argument type.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005419</p>
5420
5421<h5>Semantics:</h5>
5422
5423<p>
Chris Lattnereff29ab2005-05-15 19:39:26 +00005424The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
5425in a variable. If the src == 0 then the result is the size in bits of the type
Reid Spencerca86e162006-12-31 07:07:53 +00005426of src. For example, <tt>llvm.ctlz(i32 2) = 30</tt>.
Andrew Lenharthec370fd2005-05-03 18:01:48 +00005427</p>
5428</div>
Chris Lattner32006282004-06-11 02:28:03 +00005429
5430
Chris Lattnereff29ab2005-05-15 19:39:26 +00005431
5432<!-- _______________________________________________________________________ -->
5433<div class="doc_subsubsection">
Chris Lattner8a886be2006-01-16 22:34:14 +00005434 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
Chris Lattnereff29ab2005-05-15 19:39:26 +00005435</div>
5436
5437<div class="doc_text">
5438
5439<h5>Syntax:</h5>
Reid Spencer409e28f2007-04-01 08:04:23 +00005440<p>This is an overloaded intrinsic. You can use <tt>llvm.cttz</tt> on any
5441integer bit width. Not all targets support all bit widths however.
Chris Lattnereff29ab2005-05-15 19:39:26 +00005442<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005443 declare i8 @llvm.cttz.i8 (i8 &lt;src&gt;)
5444 declare i16 @llvm.cttz.i16(i16 &lt;src&gt;)
Anton Korobeynikovec43a062007-03-22 00:02:17 +00005445 declare i32 @llvm.cttz.i32(i32 &lt;src&gt;)
Chandler Carruth69940402007-08-04 01:51:18 +00005446 declare i64 @llvm.cttz.i64(i64 &lt;src&gt;)
5447 declare i256 @llvm.cttz.i256(i256 &lt;src&gt;)
Chris Lattnereff29ab2005-05-15 19:39:26 +00005448</pre>
5449
5450<h5>Overview:</h5>
5451
5452<p>
Reid Spencer0b118202006-01-16 21:12:35 +00005453The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
5454trailing zeros.
Chris Lattnereff29ab2005-05-15 19:39:26 +00005455</p>
5456
5457<h5>Arguments:</h5>
5458
5459<p>
5460The only argument is the value to be counted. The argument may be of any
Reid Spencera5173382007-01-04 16:43:23 +00005461integer type. The return type must match the argument type.
Chris Lattnereff29ab2005-05-15 19:39:26 +00005462</p>
5463
5464<h5>Semantics:</h5>
5465
5466<p>
5467The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
5468in a variable. If the src == 0 then the result is the size in bits of the type
5469of src. For example, <tt>llvm.cttz(2) = 1</tt>.
5470</p>
5471</div>
5472
Reid Spencer497d93e2007-04-01 08:27:01 +00005473<!-- _______________________________________________________________________ -->
5474<div class="doc_subsubsection">
Reid Spencerbeacf662007-04-10 02:51:31 +00005475 <a name="int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic</a>
Reid Spencera13ba7d2007-04-01 19:00:37 +00005476</div>
5477
5478<div class="doc_text">
5479
5480<h5>Syntax:</h5>
Reid Spencerbeacf662007-04-10 02:51:31 +00005481<p>This is an overloaded intrinsic. You can use <tt>llvm.part.select</tt>
Reid Spencera13ba7d2007-04-01 19:00:37 +00005482on any integer bit width.
5483<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005484 declare i17 @llvm.part.select.i17 (i17 %val, i32 %loBit, i32 %hiBit)
5485 declare i29 @llvm.part.select.i29 (i29 %val, i32 %loBit, i32 %hiBit)
Reid Spencera13ba7d2007-04-01 19:00:37 +00005486</pre>
5487
5488<h5>Overview:</h5>
Reid Spencerbeacf662007-04-10 02:51:31 +00005489<p>The '<tt>llvm.part.select</tt>' family of intrinsic functions selects a
Reid Spencera13ba7d2007-04-01 19:00:37 +00005490range of bits from an integer value and returns them in the same bit width as
5491the original value.</p>
5492
5493<h5>Arguments:</h5>
5494<p>The first argument, <tt>%val</tt> and the result may be integer types of
5495any bit width but they must have the same bit width. The second and third
Reid Spencera3e435f2007-04-04 02:42:35 +00005496arguments must be <tt>i32</tt> type since they specify only a bit index.</p>
Reid Spencera13ba7d2007-04-01 19:00:37 +00005497
5498<h5>Semantics:</h5>
Reid Spencerbeacf662007-04-10 02:51:31 +00005499<p>The operation of the '<tt>llvm.part.select</tt>' intrinsic has two modes
Reid Spencera3e435f2007-04-04 02:42:35 +00005500of operation: forwards and reverse. If <tt>%loBit</tt> is greater than
5501<tt>%hiBits</tt> then the intrinsic operates in reverse mode. Otherwise it
5502operates in forward mode.</p>
5503<p>In forward mode, this intrinsic is the equivalent of shifting <tt>%val</tt>
5504right by <tt>%loBit</tt> bits and then ANDing it with a mask with
Reid Spencera13ba7d2007-04-01 19:00:37 +00005505only the <tt>%hiBit - %loBit</tt> bits set, as follows:</p>
5506<ol>
5507 <li>The <tt>%val</tt> is shifted right (LSHR) by the number of bits specified
5508 by <tt>%loBits</tt>. This normalizes the value to the low order bits.</li>
5509 <li>The <tt>%loBits</tt> value is subtracted from the <tt>%hiBits</tt> value
5510 to determine the number of bits to retain.</li>
5511 <li>A mask of the retained bits is created by shifting a -1 value.</li>
5512 <li>The mask is ANDed with <tt>%val</tt> to produce the result.
5513</ol>
Reid Spencerd6a85b52007-05-14 16:14:57 +00005514<p>In reverse mode, a similar computation is made except that the bits are
5515returned in the reverse order. So, for example, if <tt>X</tt> has the value
5516<tt>i16 0x0ACF (101011001111)</tt> and we apply
5517<tt>part.select(i16 X, 8, 3)</tt> to it, we get back the value
5518<tt>i16 0x0026 (000000100110)</tt>.</p>
Reid Spencera13ba7d2007-04-01 19:00:37 +00005519</div>
5520
Reid Spencerf86037f2007-04-11 23:23:49 +00005521<div class="doc_subsubsection">
5522 <a name="int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic</a>
5523</div>
5524
5525<div class="doc_text">
5526
5527<h5>Syntax:</h5>
5528<p>This is an overloaded intrinsic. You can use <tt>llvm.part.set</tt>
5529on any integer bit width.
5530<pre>
Chandler Carruth69940402007-08-04 01:51:18 +00005531 declare i17 @llvm.part.set.i17.i9 (i17 %val, i9 %repl, i32 %lo, i32 %hi)
5532 declare i29 @llvm.part.set.i29.i9 (i29 %val, i9 %repl, i32 %lo, i32 %hi)
Reid Spencerf86037f2007-04-11 23:23:49 +00005533</pre>
5534
5535<h5>Overview:</h5>
5536<p>The '<tt>llvm.part.set</tt>' family of intrinsic functions replaces a range
5537of bits in an integer value with another integer value. It returns the integer
5538with the replaced bits.</p>
5539
5540<h5>Arguments:</h5>
5541<p>The first argument, <tt>%val</tt> and the result may be integer types of
5542any bit width but they must have the same bit width. <tt>%val</tt> is the value
5543whose bits will be replaced. The second argument, <tt>%repl</tt> may be an
5544integer of any bit width. The third and fourth arguments must be <tt>i32</tt>
5545type since they specify only a bit index.</p>
5546
5547<h5>Semantics:</h5>
5548<p>The operation of the '<tt>llvm.part.set</tt>' intrinsic has two modes
5549of operation: forwards and reverse. If <tt>%lo</tt> is greater than
5550<tt>%hi</tt> then the intrinsic operates in reverse mode. Otherwise it
5551operates in forward mode.</p>
5552<p>For both modes, the <tt>%repl</tt> value is prepared for use by either
5553truncating it down to the size of the replacement area or zero extending it
5554up to that size.</p>
5555<p>In forward mode, the bits between <tt>%lo</tt> and <tt>%hi</tt> (inclusive)
5556are replaced with corresponding bits from <tt>%repl</tt>. That is the 0th bit
5557in <tt>%repl</tt> replaces the <tt>%lo</tt>th bit in <tt>%val</tt> and etc. up
5558to the <tt>%hi</tt>th bit.
Reid Spencerc6749c42007-05-14 16:50:20 +00005559<p>In reverse mode, a similar computation is made except that the bits are
5560reversed. That is, the <tt>0</tt>th bit in <tt>%repl</tt> replaces the
5561<tt>%hi</tt> bit in <tt>%val</tt> and etc. down to the <tt>%lo</tt>th bit.
Reid Spencerf86037f2007-04-11 23:23:49 +00005562<h5>Examples:</h5>
5563<pre>
Reid Spencerf0dbf642007-04-12 01:03:03 +00005564 llvm.part.set(0xFFFF, 0, 4, 7) -&gt; 0xFF0F
Reid Spencerc6749c42007-05-14 16:50:20 +00005565 llvm.part.set(0xFFFF, 0, 7, 4) -&gt; 0xFF0F
5566 llvm.part.set(0xFFFF, 1, 7, 4) -&gt; 0xFF8F
5567 llvm.part.set(0xFFFF, F, 8, 3) -&gt; 0xFFE7
Reid Spencerf0dbf642007-04-12 01:03:03 +00005568 llvm.part.set(0xFFFF, 0, 3, 8) -&gt; 0xFE07
Reid Spencerc8910842007-04-11 23:49:50 +00005569</pre>
Reid Spencerf86037f2007-04-11 23:23:49 +00005570</div>
5571
Chris Lattner8ff75902004-01-06 05:31:32 +00005572<!-- ======================================================================= -->
5573<div class="doc_subsection">
5574 <a name="int_debugger">Debugger Intrinsics</a>
5575</div>
5576
5577<div class="doc_text">
5578<p>
5579The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
5580are described in the <a
5581href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
5582Debugging</a> document.
5583</p>
5584</div>
5585
5586
Jim Laskeydd4ef1b2007-03-14 19:31:19 +00005587<!-- ======================================================================= -->
5588<div class="doc_subsection">
5589 <a name="int_eh">Exception Handling Intrinsics</a>
5590</div>
5591
5592<div class="doc_text">
5593<p> The LLVM exception handling intrinsics (which all start with
5594<tt>llvm.eh.</tt> prefix), are described in the <a
5595href="ExceptionHandling.html#format_common_intrinsics">LLVM Exception
5596Handling</a> document. </p>
5597</div>
5598
Tanya Lattner6d806e92007-06-15 20:50:54 +00005599<!-- ======================================================================= -->
5600<div class="doc_subsection">
Duncan Sandsf7331b32007-09-11 14:10:23 +00005601 <a name="int_trampoline">Trampoline Intrinsic</a>
Duncan Sands36397f52007-07-27 12:58:54 +00005602</div>
5603
5604<div class="doc_text">
5605<p>
Duncan Sandsf7331b32007-09-11 14:10:23 +00005606 This intrinsic makes it possible to excise one parameter, marked with
Duncan Sands36397f52007-07-27 12:58:54 +00005607 the <tt>nest</tt> attribute, from a function. The result is a callable
5608 function pointer lacking the nest parameter - the caller does not need
5609 to provide a value for it. Instead, the value to use is stored in
5610 advance in a "trampoline", a block of memory usually allocated
5611 on the stack, which also contains code to splice the nest value into the
5612 argument list. This is used to implement the GCC nested function address
5613 extension.
5614</p>
5615<p>
5616 For example, if the function is
5617 <tt>i32 f(i8* nest %c, i32 %x, i32 %y)</tt> then the resulting function
Bill Wendling03295ca2007-09-22 09:23:55 +00005618 pointer has signature <tt>i32 (i32, i32)*</tt>. It can be created as follows:</p>
Duncan Sands36397f52007-07-27 12:58:54 +00005619<pre>
Duncan Sandsf7331b32007-09-11 14:10:23 +00005620 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
5621 %tramp1 = getelementptr [10 x i8]* %tramp, i32 0, i32 0
5622 %p = call i8* @llvm.init.trampoline( i8* %tramp1, i8* bitcast (i32 (i8* nest , i32, i32)* @f to i8*), i8* %nval )
5623 %fp = bitcast i8* %p to i32 (i32, i32)*
Duncan Sands36397f52007-07-27 12:58:54 +00005624</pre>
Bill Wendling03295ca2007-09-22 09:23:55 +00005625 <p>The call <tt>%val = call i32 %fp( i32 %x, i32 %y )</tt> is then equivalent
5626 to <tt>%val = call i32 %f( i8* %nval, i32 %x, i32 %y )</tt>.</p>
Duncan Sands36397f52007-07-27 12:58:54 +00005627</div>
5628
5629<!-- _______________________________________________________________________ -->
5630<div class="doc_subsubsection">
5631 <a name="int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a>
5632</div>
5633<div class="doc_text">
5634<h5>Syntax:</h5>
5635<pre>
Duncan Sandsf7331b32007-09-11 14:10:23 +00005636declare i8* @llvm.init.trampoline(i8* &lt;tramp&gt;, i8* &lt;func&gt;, i8* &lt;nval&gt;)
Duncan Sands36397f52007-07-27 12:58:54 +00005637</pre>
5638<h5>Overview:</h5>
5639<p>
Duncan Sandsf7331b32007-09-11 14:10:23 +00005640 This fills the memory pointed to by <tt>tramp</tt> with code
5641 and returns a function pointer suitable for executing it.
Duncan Sands36397f52007-07-27 12:58:54 +00005642</p>
5643<h5>Arguments:</h5>
5644<p>
5645 The <tt>llvm.init.trampoline</tt> intrinsic takes three arguments, all
5646 pointers. The <tt>tramp</tt> argument must point to a sufficiently large
5647 and sufficiently aligned block of memory; this memory is written to by the
Duncan Sandsc00c2ba2007-08-22 23:39:54 +00005648 intrinsic. Note that the size and the alignment are target-specific - LLVM
5649 currently provides no portable way of determining them, so a front-end that
5650 generates this intrinsic needs to have some target-specific knowledge.
5651 The <tt>func</tt> argument must hold a function bitcast to an <tt>i8*</tt>.
Duncan Sands36397f52007-07-27 12:58:54 +00005652</p>
5653<h5>Semantics:</h5>
5654<p>
5655 The block of memory pointed to by <tt>tramp</tt> is filled with target
Duncan Sandsf7331b32007-09-11 14:10:23 +00005656 dependent code, turning it into a function. A pointer to this function is
5657 returned, but needs to be bitcast to an
Duncan Sands36397f52007-07-27 12:58:54 +00005658 <a href="#int_trampoline">appropriate function pointer type</a>
Duncan Sandsf7331b32007-09-11 14:10:23 +00005659 before being called. The new function's signature is the same as that of
5660 <tt>func</tt> with any arguments marked with the <tt>nest</tt> attribute
5661 removed. At most one such <tt>nest</tt> argument is allowed, and it must be
5662 of pointer type. Calling the new function is equivalent to calling
5663 <tt>func</tt> with the same argument list, but with <tt>nval</tt> used for the
5664 missing <tt>nest</tt> argument. If, after calling
5665 <tt>llvm.init.trampoline</tt>, the memory pointed to by <tt>tramp</tt> is
5666 modified, then the effect of any later call to the returned function pointer is
5667 undefined.
Duncan Sands36397f52007-07-27 12:58:54 +00005668</p>
5669</div>
5670
5671<!-- ======================================================================= -->
5672<div class="doc_subsection">
Andrew Lenharth22c5c1b2008-02-16 01:24:58 +00005673 <a name="int_atomics">Atomic Operations and Synchronization Intrinsics</a>
5674</div>
5675
5676<div class="doc_text">
5677<p>
5678 These intrinsic functions expand the "universal IR" of LLVM to represent
5679 hardware constructs for atomic operations and memory synchronization. This
5680 provides an interface to the hardware, not an interface to the programmer. It
5681 is aimed at a low enough level to allow any programming models or APIs which
5682 need atomic behaviors to map cleanly onto it. It is also modeled primarily on
5683 hardware behavior. Just as hardware provides a "universal IR" for source
5684 languages, it also provides a starting point for developing a "universal"
5685 atomic operation and synchronization IR.
5686</p>
5687<p>
5688 These do <em>not</em> form an API such as high-level threading libraries,
5689 software transaction memory systems, atomic primitives, and intrinsic
5690 functions as found in BSD, GNU libc, atomic_ops, APR, and other system and
5691 application libraries. The hardware interface provided by LLVM should allow
5692 a clean implementation of all of these APIs and parallel programming models.
5693 No one model or paradigm should be selected above others unless the hardware
5694 itself ubiquitously does so.
5695
5696</p>
5697</div>
5698
5699<!-- _______________________________________________________________________ -->
5700<div class="doc_subsubsection">
5701 <a name="int_memory_barrier">'<tt>llvm.memory.barrier</tt>' Intrinsic</a>
5702</div>
5703<div class="doc_text">
5704<h5>Syntax:</h5>
5705<pre>
5706declare void @llvm.memory.barrier( i1 &lt;ll&gt;, i1 &lt;ls&gt;, i1 &lt;sl&gt;, i1 &lt;ss&gt;,
5707i1 &lt;device&gt; )
5708
5709</pre>
5710<h5>Overview:</h5>
5711<p>
5712 The <tt>llvm.memory.barrier</tt> intrinsic guarantees ordering between
5713 specific pairs of memory access types.
5714</p>
5715<h5>Arguments:</h5>
5716<p>
5717 The <tt>llvm.memory.barrier</tt> intrinsic requires five boolean arguments.
5718 The first four arguments enables a specific barrier as listed below. The fith
5719 argument specifies that the barrier applies to io or device or uncached memory.
5720
5721</p>
5722 <ul>
5723 <li><tt>ll</tt>: load-load barrier</li>
5724 <li><tt>ls</tt>: load-store barrier</li>
5725 <li><tt>sl</tt>: store-load barrier</li>
5726 <li><tt>ss</tt>: store-store barrier</li>
5727 <li><tt>device</tt>: barrier applies to device and uncached memory also.
5728 </ul>
5729<h5>Semantics:</h5>
5730<p>
5731 This intrinsic causes the system to enforce some ordering constraints upon
5732 the loads and stores of the program. This barrier does not indicate
5733 <em>when</em> any events will occur, it only enforces an <em>order</em> in
5734 which they occur. For any of the specified pairs of load and store operations
5735 (f.ex. load-load, or store-load), all of the first operations preceding the
5736 barrier will complete before any of the second operations succeeding the
5737 barrier begin. Specifically the semantics for each pairing is as follows:
5738</p>
5739 <ul>
5740 <li><tt>ll</tt>: All loads before the barrier must complete before any load
5741 after the barrier begins.</li>
5742
5743 <li><tt>ls</tt>: All loads before the barrier must complete before any
5744 store after the barrier begins.</li>
5745 <li><tt>ss</tt>: All stores before the barrier must complete before any
5746 store after the barrier begins.</li>
5747 <li><tt>sl</tt>: All stores before the barrier must complete before any
5748 load after the barrier begins.</li>
5749 </ul>
5750<p>
5751 These semantics are applied with a logical "and" behavior when more than one
5752 is enabled in a single memory barrier intrinsic.
5753</p>
5754<p>
5755 Backends may implement stronger barriers than those requested when they do not
5756 support as fine grained a barrier as requested. Some architectures do not
5757 need all types of barriers and on such architectures, these become noops.
5758</p>
5759<h5>Example:</h5>
5760<pre>
5761%ptr = malloc i32
5762 store i32 4, %ptr
5763
5764%result1 = load i32* %ptr <i>; yields {i32}:result1 = 4</i>
5765 call void @llvm.memory.barrier( i1 false, i1 true, i1 false, i1 false )
5766 <i>; guarantee the above finishes</i>
5767 store i32 8, %ptr <i>; before this begins</i>
5768</pre>
5769</div>
5770
Andrew Lenharthab0b9492008-02-21 06:45:13 +00005771<!-- _______________________________________________________________________ -->
5772<div class="doc_subsubsection">
5773 <a name="int_atomic_lcs">'<tt>llvm.atomic.lcs.*</tt>' Intrinsic</a>
5774</div>
5775<div class="doc_text">
5776<h5>Syntax:</h5>
5777<p>
5778 This is an overloaded intrinsic. You can use <tt>llvm.atomic.lcs</tt> on any
5779 integer bit width. Not all targets support all bit widths however.</p>
5780
5781<pre>
5782declare i8 @llvm.atomic.lcs.i8( i8* &lt;ptr&gt;, i8 &lt;cmp&gt;, i8 &lt;val&gt; )
5783declare i16 @llvm.atomic.lcs.i16( i16* &lt;ptr&gt;, i16 &lt;cmp&gt;, i16 &lt;val&gt; )
5784declare i32 @llvm.atomic.lcs.i32( i32* &lt;ptr&gt;, i32 &lt;cmp&gt;, i32 &lt;val&gt; )
5785declare i64 @llvm.atomic.lcs.i64( i64* &lt;ptr&gt;, i64 &lt;cmp&gt;, i64 &lt;val&gt; )
5786
5787</pre>
5788<h5>Overview:</h5>
5789<p>
5790 This loads a value in memory and compares it to a given value. If they are
5791 equal, it stores a new value into the memory.
5792</p>
5793<h5>Arguments:</h5>
5794<p>
5795 The <tt>llvm.atomic.lcs</tt> intrinsic takes three arguments. The result as
5796 well as both <tt>cmp</tt> and <tt>val</tt> must be integer values with the
5797 same bit width. The <tt>ptr</tt> argument must be a pointer to a value of
5798 this integer type. While any bit width integer may be used, targets may only
5799 lower representations they support in hardware.
5800
5801</p>
5802<h5>Semantics:</h5>
5803<p>
5804 This entire intrinsic must be executed atomically. It first loads the value
5805 in memory pointed to by <tt>ptr</tt> and compares it with the value
5806 <tt>cmp</tt>. If they are equal, <tt>val</tt> is stored into the memory. The
5807 loaded value is yielded in all cases. This provides the equivalent of an
5808 atomic compare-and-swap operation within the SSA framework.
5809</p>
5810<h5>Examples:</h5>
5811
5812<pre>
5813%ptr = malloc i32
5814 store i32 4, %ptr
5815
5816%val1 = add i32 4, 4
5817%result1 = call i32 @llvm.atomic.lcs.i32( i32* %ptr, i32 4, %val1 )
5818 <i>; yields {i32}:result1 = 4</i>
5819%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
5820%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
5821
5822%val2 = add i32 1, 1
5823%result2 = call i32 @llvm.atomic.lcs.i32( i32* %ptr, i32 5, %val2 )
5824 <i>; yields {i32}:result2 = 8</i>
5825%stored2 = icmp eq i32 %result2, 5 <i>; yields {i1}:stored2 = false</i>
5826
5827%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 8</i>
5828</pre>
5829</div>
5830
5831<!-- _______________________________________________________________________ -->
5832<div class="doc_subsubsection">
5833 <a name="int_atomic_swap">'<tt>llvm.atomic.swap.*</tt>' Intrinsic</a>
5834</div>
5835<div class="doc_text">
5836<h5>Syntax:</h5>
5837
5838<p>
5839 This is an overloaded intrinsic. You can use <tt>llvm.atomic.swap</tt> on any
5840 integer bit width. Not all targets support all bit widths however.</p>
5841<pre>
5842declare i8 @llvm.atomic.swap.i8( i8* &lt;ptr&gt;, i8 &lt;val&gt; )
5843declare i16 @llvm.atomic.swap.i16( i16* &lt;ptr&gt;, i16 &lt;val&gt; )
5844declare i32 @llvm.atomic.swap.i32( i32* &lt;ptr&gt;, i32 &lt;val&gt; )
5845declare i64 @llvm.atomic.swap.i64( i64* &lt;ptr&gt;, i64 &lt;val&gt; )
5846
5847</pre>
5848<h5>Overview:</h5>
5849<p>
5850 This intrinsic loads the value stored in memory at <tt>ptr</tt> and yields
5851 the value from memory. It then stores the value in <tt>val</tt> in the memory
5852 at <tt>ptr</tt>.
5853</p>
5854<h5>Arguments:</h5>
5855
5856<p>
5857 The <tt>llvm.atomic.ls</tt> intrinsic takes two arguments. Both the
5858 <tt>val</tt> argument and the result must be integers of the same bit width.
5859 The first argument, <tt>ptr</tt>, must be a pointer to a value of this
5860 integer type. The targets may only lower integer representations they
5861 support.
5862</p>
5863<h5>Semantics:</h5>
5864<p>
5865 This intrinsic loads the value pointed to by <tt>ptr</tt>, yields it, and
5866 stores <tt>val</tt> back into <tt>ptr</tt> atomically. This provides the
5867 equivalent of an atomic swap operation within the SSA framework.
5868
5869</p>
5870<h5>Examples:</h5>
5871<pre>
5872%ptr = malloc i32
5873 store i32 4, %ptr
5874
5875%val1 = add i32 4, 4
5876%result1 = call i32 @llvm.atomic.swap.i32( i32* %ptr, i32 %val1 )
5877 <i>; yields {i32}:result1 = 4</i>
5878%stored1 = icmp eq i32 %result1, 4 <i>; yields {i1}:stored1 = true</i>
5879%memval1 = load i32* %ptr <i>; yields {i32}:memval1 = 8</i>
5880
5881%val2 = add i32 1, 1
5882%result2 = call i32 @llvm.atomic.swap.i32( i32* %ptr, i32 %val2 )
5883 <i>; yields {i32}:result2 = 8</i>
5884
5885%stored2 = icmp eq i32 %result2, 8 <i>; yields {i1}:stored2 = true</i>
5886%memval2 = load i32* %ptr <i>; yields {i32}:memval2 = 2</i>
5887</pre>
5888</div>
5889
5890<!-- _______________________________________________________________________ -->
5891<div class="doc_subsubsection">
5892 <a name="int_atomic_las">'<tt>llvm.atomic.las.*</tt>' Intrinsic</a>
5893
5894</div>
5895<div class="doc_text">
5896<h5>Syntax:</h5>
5897<p>
5898 This is an overloaded intrinsic. You can use <tt>llvm.atomic.las</tt> on any
5899 integer bit width. Not all targets support all bit widths however.</p>
5900<pre>
5901declare i8 @llvm.atomic.las.i8.( i8* &lt;ptr&gt;, i8 &lt;delta&gt; )
5902declare i16 @llvm.atomic.las.i16.( i16* &lt;ptr&gt;, i16 &lt;delta&gt; )
5903declare i32 @llvm.atomic.las.i32.( i32* &lt;ptr&gt;, i32 &lt;delta&gt; )
5904declare i64 @llvm.atomic.las.i64.( i64* &lt;ptr&gt;, i64 &lt;delta&gt; )
5905
5906</pre>
5907<h5>Overview:</h5>
5908<p>
5909 This intrinsic adds <tt>delta</tt> to the value stored in memory at
5910 <tt>ptr</tt>. It yields the original value at <tt>ptr</tt>.
5911</p>
5912<h5>Arguments:</h5>
5913<p>
5914
5915 The intrinsic takes two arguments, the first a pointer to an integer value
5916 and the second an integer value. The result is also an integer value. These
5917 integer types can have any bit width, but they must all have the same bit
5918 width. The targets may only lower integer representations they support.
5919</p>
5920<h5>Semantics:</h5>
5921<p>
5922 This intrinsic does a series of operations atomically. It first loads the
5923 value stored at <tt>ptr</tt>. It then adds <tt>delta</tt>, stores the result
5924 to <tt>ptr</tt>. It yields the original value stored at <tt>ptr</tt>.
5925</p>
5926
5927<h5>Examples:</h5>
5928<pre>
5929%ptr = malloc i32
5930 store i32 4, %ptr
5931%result1 = call i32 @llvm.atomic.las.i32( i32* %ptr, i32 4 )
5932 <i>; yields {i32}:result1 = 4</i>
5933%result2 = call i32 @llvm.atomic.las.i32( i32* %ptr, i32 2 )
5934 <i>; yields {i32}:result2 = 8</i>
5935%result3 = call i32 @llvm.atomic.las.i32( i32* %ptr, i32 5 )
5936 <i>; yields {i32}:result3 = 10</i>
5937%memval = load i32* %ptr <i>; yields {i32}:memval1 = 15</i>
5938</pre>
5939</div>
5940
Andrew Lenharth22c5c1b2008-02-16 01:24:58 +00005941
5942<!-- ======================================================================= -->
5943<div class="doc_subsection">
Tanya Lattner6d806e92007-06-15 20:50:54 +00005944 <a name="int_general">General Intrinsics</a>
5945</div>
5946
5947<div class="doc_text">
5948<p> This class of intrinsics is designed to be generic and has
5949no specific purpose. </p>
5950</div>
5951
5952<!-- _______________________________________________________________________ -->
5953<div class="doc_subsubsection">
5954 <a name="int_var_annotation">'<tt>llvm.var.annotation</tt>' Intrinsic</a>
5955</div>
5956
5957<div class="doc_text">
5958
5959<h5>Syntax:</h5>
5960<pre>
Tanya Lattnerd2e84422007-06-18 23:42:37 +00005961 declare void @llvm.var.annotation(i8* &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattner6d806e92007-06-15 20:50:54 +00005962</pre>
5963
5964<h5>Overview:</h5>
5965
5966<p>
5967The '<tt>llvm.var.annotation</tt>' intrinsic
5968</p>
5969
5970<h5>Arguments:</h5>
5971
5972<p>
Tanya Lattnerd2e84422007-06-18 23:42:37 +00005973The first argument is a pointer to a value, the second is a pointer to a
5974global string, the third is a pointer to a global string which is the source
5975file name, and the last argument is the line number.
Tanya Lattner6d806e92007-06-15 20:50:54 +00005976</p>
5977
5978<h5>Semantics:</h5>
5979
5980<p>
Anton Korobeynikov4cb86182008-01-15 22:31:34 +00005981This intrinsic allows annotation of local variables with arbitrary strings.
Tanya Lattner6d806e92007-06-15 20:50:54 +00005982This can be useful for special purpose optimizations that want to look for these
Anton Korobeynikov4cb86182008-01-15 22:31:34 +00005983annotations. These have no other defined use, they are ignored by code
5984generation and optimization.
5985</p>
Tanya Lattner6d806e92007-06-15 20:50:54 +00005986</div>
5987
Tanya Lattnerb6367882007-09-21 22:59:12 +00005988<!-- _______________________________________________________________________ -->
5989<div class="doc_subsubsection">
Tanya Lattnere1a8da02007-09-21 23:57:59 +00005990 <a name="int_annotation">'<tt>llvm.annotation.*</tt>' Intrinsic</a>
Tanya Lattnerb6367882007-09-21 22:59:12 +00005991</div>
5992
5993<div class="doc_text">
5994
5995<h5>Syntax:</h5>
Tanya Lattner39cfba62007-09-21 23:56:27 +00005996<p>This is an overloaded intrinsic. You can use '<tt>llvm.annotation</tt>' on
5997any integer bit width.
5998</p>
Tanya Lattnerb6367882007-09-21 22:59:12 +00005999<pre>
Tanya Lattnerd3989a82007-09-22 00:03:01 +00006000 declare i8 @llvm.annotation.i8(i8 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6001 declare i16 @llvm.annotation.i16(i16 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6002 declare i32 @llvm.annotation.i32(i32 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6003 declare i64 @llvm.annotation.i64(i64 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
6004 declare i256 @llvm.annotation.i256(i256 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattnerb6367882007-09-21 22:59:12 +00006005</pre>
6006
6007<h5>Overview:</h5>
Tanya Lattner39cfba62007-09-21 23:56:27 +00006008
6009<p>
6010The '<tt>llvm.annotation</tt>' intrinsic.
Tanya Lattnerb6367882007-09-21 22:59:12 +00006011</p>
6012
6013<h5>Arguments:</h5>
6014
6015<p>
6016The first argument is an integer value (result of some expression),
6017the second is a pointer to a global string, the third is a pointer to a global
6018string which is the source file name, and the last argument is the line number.
Tanya Lattner39cfba62007-09-21 23:56:27 +00006019It returns the value of the first argument.
Tanya Lattnerb6367882007-09-21 22:59:12 +00006020</p>
6021
6022<h5>Semantics:</h5>
6023
6024<p>
6025This intrinsic allows annotations to be put on arbitrary expressions
6026with arbitrary strings. This can be useful for special purpose optimizations
6027that want to look for these annotations. These have no other defined use, they
6028are ignored by code generation and optimization.
6029</div>
Jim Laskeydd4ef1b2007-03-14 19:31:19 +00006030
Anton Korobeynikov4cb86182008-01-15 22:31:34 +00006031<!-- _______________________________________________________________________ -->
6032<div class="doc_subsubsection">
6033 <a name="int_trap">'<tt>llvm.trap</tt>' Intrinsic</a>
6034</div>
6035
6036<div class="doc_text">
6037
6038<h5>Syntax:</h5>
6039<pre>
6040 declare void @llvm.trap()
6041</pre>
6042
6043<h5>Overview:</h5>
6044
6045<p>
6046The '<tt>llvm.trap</tt>' intrinsic
6047</p>
6048
6049<h5>Arguments:</h5>
6050
6051<p>
6052None
6053</p>
6054
6055<h5>Semantics:</h5>
6056
6057<p>
6058This intrinsics is lowered to the target dependent trap instruction. If the
6059target does not have a trap instruction, this intrinsic will be lowered to the
6060call of the abort() function.
6061</p>
6062</div>
6063
Chris Lattner00950542001-06-06 20:29:01 +00006064<!-- *********************************************************************** -->
Chris Lattner00950542001-06-06 20:29:01 +00006065<hr>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00006066<address>
6067 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
6068 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
6069 <a href="http://validator.w3.org/check/referer"><img
Chris Lattnerc7d3ab32008-01-04 04:33:49 +00006070 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00006071
6072 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
Reid Spencer05fe4b02006-03-14 05:39:39 +00006073 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
Misha Brukmandaa4cb02004-03-01 17:47:27 +00006074 Last modified: $Date$
6075</address>
Chris Lattnerc7d3ab32008-01-04 04:33:49 +00006076
Misha Brukman9d0919f2003-11-08 01:05:38 +00006077</body>
6078</html>