blob: b6f6f47256c3d5fd9ac08c3dadf60f487f3820f8 [file] [log] [blame]
Misha Brukmanc501f552004-03-01 17:47:27 +00001<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
Misha Brukman76307852003-11-08 01:05:38 +00003<html>
4<head>
5 <title>LLVM Assembly Language Reference Manual</title>
Reid Spencercb84e432004-08-26 20:44:00 +00006 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
7 <meta name="author" content="Chris Lattner">
8 <meta name="description"
9 content="LLVM Assembly Language Reference Manual.">
Misha Brukman76307852003-11-08 01:05:38 +000010 <link rel="stylesheet" href="llvm.css" type="text/css">
11</head>
Chris Lattner757528b0b2004-05-23 21:06:01 +000012
Misha Brukman76307852003-11-08 01:05:38 +000013<body>
Chris Lattner757528b0b2004-05-23 21:06:01 +000014
Chris Lattner48b383b02003-11-25 01:02:51 +000015<div class="doc_title"> LLVM Language Reference Manual </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +000016<ol>
Misha Brukman76307852003-11-08 01:05:38 +000017 <li><a href="#abstract">Abstract</a></li>
18 <li><a href="#introduction">Introduction</a></li>
19 <li><a href="#identifiers">Identifiers</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000020 <li><a href="#highlevel">High Level Structure</a>
21 <ol>
22 <li><a href="#modulestructure">Module Structure</a></li>
Chris Lattnerd79749a2004-12-09 16:36:40 +000023 <li><a href="#linkage">Linkage Types</a></li>
Chris Lattner0132aff2005-05-06 22:57:40 +000024 <li><a href="#callingconv">Calling Conventions</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000025 <li><a href="#globalvars">Global Variables</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000026 <li><a href="#functionstructure">Functions</a></li>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +000027 <li><a href="#paramattrs">Parameter Attributes</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000028 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
Reid Spencer50c723a2007-02-19 23:54:10 +000029 <li><a href="#datalayout">Data Layout</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000030 </ol>
31 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000032 <li><a href="#typesystem">Type System</a>
33 <ol>
Robert Bocchino820bc75b2006-02-17 21:18:08 +000034 <li><a href="#t_primitive">Primitive Types</a>
Chris Lattner48b383b02003-11-25 01:02:51 +000035 <ol>
Misha Brukman76307852003-11-08 01:05:38 +000036 <li><a href="#t_classifications">Type Classifications</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000037 </ol>
38 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000039 <li><a href="#t_derived">Derived Types</a>
40 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000041 <li><a href="#t_array">Array Type</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000042 <li><a href="#t_function">Function Type</a></li>
43 <li><a href="#t_pointer">Pointer Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000044 <li><a href="#t_struct">Structure Type</a></li>
Andrew Lenharth8df88e22006-12-08 17:13:00 +000045 <li><a href="#t_pstruct">Packed Structure Type</a></li>
Reid Spencer404a3252007-02-15 03:07:05 +000046 <li><a href="#t_vector">Vector Type</a></li>
Chris Lattner37b6b092005-04-25 17:34:15 +000047 <li><a href="#t_opaque">Opaque Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000048 </ol>
49 </li>
50 </ol>
51 </li>
Chris Lattner6af02f32004-12-09 16:11:40 +000052 <li><a href="#constants">Constants</a>
Chris Lattner74d3f822004-12-09 17:30:23 +000053 <ol>
54 <li><a href="#simpleconstants">Simple Constants</a>
55 <li><a href="#aggregateconstants">Aggregate Constants</a>
56 <li><a href="#globalconstants">Global Variable and Function Addresses</a>
57 <li><a href="#undefvalues">Undefined Values</a>
58 <li><a href="#constantexprs">Constant Expressions</a>
59 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000060 </li>
Chris Lattner98f013c2006-01-25 23:47:57 +000061 <li><a href="#othervalues">Other Values</a>
62 <ol>
63 <li><a href="#inlineasm">Inline Assembler Expressions</a>
64 </ol>
65 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000066 <li><a href="#instref">Instruction Reference</a>
67 <ol>
68 <li><a href="#terminators">Terminator Instructions</a>
69 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000070 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
71 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000072 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
73 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000074 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
Chris Lattner08b7d5b2004-10-16 18:04:13 +000075 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000076 </ol>
77 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000078 <li><a href="#binaryops">Binary Operations</a>
79 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000080 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
81 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
82 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
Reid Spencer7e80b0b2006-10-26 06:15:43 +000083 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
84 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
85 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
Reid Spencer7eb55b32006-11-02 01:53:59 +000086 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
87 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
88 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000089 </ol>
90 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000091 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
92 <ol>
Reid Spencer2ab01932007-02-02 13:57:07 +000093 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
94 <li><a href="#i_lshr">'<tt>lshr</tt>' Instruction</a></li>
95 <li><a href="#i_ashr">'<tt>ashr</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000096 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000097 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000098 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000099 </ol>
100 </li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000101 <li><a href="#vectorops">Vector Operations</a>
102 <ol>
103 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
104 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
105 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000106 </ol>
107 </li>
Chris Lattner6ab66722006-08-15 00:45:58 +0000108 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000109 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000110 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
111 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
112 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
Robert Bocchino820bc75b2006-02-17 21:18:08 +0000113 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
114 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
115 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000116 </ol>
117 </li>
Reid Spencer97c5fa42006-11-08 01:18:52 +0000118 <li><a href="#convertops">Conversion Operations</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000119 <ol>
120 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
121 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
122 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
123 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
124 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
Reid Spencer51b07252006-11-09 23:03:26 +0000125 <li><a href="#i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a></li>
126 <li><a href="#i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a></li>
127 <li><a href="#i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a></li>
128 <li><a href="#i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a></li>
Reid Spencerb7344ff2006-11-11 21:00:47 +0000129 <li><a href="#i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a></li>
130 <li><a href="#i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a></li>
Reid Spencer5b950642006-11-11 23:08:07 +0000131 <li><a href="#i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a></li>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000132 </ol>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000133 <li><a href="#otherops">Other Operations</a>
134 <ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +0000135 <li><a href="#i_icmp">'<tt>icmp</tt>' Instruction</a></li>
136 <li><a href="#i_fcmp">'<tt>fcmp</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000137 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
Chris Lattnerb53c28d2004-03-12 05:50:16 +0000138 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000139 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
Chris Lattner33337472006-01-13 23:26:01 +0000140 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000141 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000142 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000143 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000144 </li>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000145 <li><a href="#intrinsics">Intrinsic Functions</a>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000146 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000147 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
148 <ol>
149 <li><a href="#i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
150 <li><a href="#i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
151 <li><a href="#i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
152 </ol>
153 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000154 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
155 <ol>
156 <li><a href="#i_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a></li>
157 <li><a href="#i_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a></li>
158 <li><a href="#i_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a></li>
159 </ol>
160 </li>
Chris Lattner3649c3a2004-02-14 04:08:35 +0000161 <li><a href="#int_codegen">Code Generator Intrinsics</a>
162 <ol>
163 <li><a href="#i_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a></li>
164 <li><a href="#i_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a></li>
Chris Lattner2f0f0012006-01-13 02:03:13 +0000165 <li><a href="#i_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a></li>
166 <li><a href="#i_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a></li>
Chris Lattnerc8a2c222005-02-28 19:24:19 +0000167 <li><a href="#i_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a></li>
Andrew Lenharthb4427912005-03-28 20:05:49 +0000168 <li><a href="#i_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a></li>
Andrew Lenharth01aa5632005-11-11 16:47:30 +0000169 <li><a href="#i_readcyclecounter"><tt>llvm.readcyclecounter</tt>' Intrinsic</a></li>
John Criswellaa1c3c12004-04-09 16:43:20 +0000170 </ol>
171 </li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000172 <li><a href="#int_libc">Standard C Library Intrinsics</a>
173 <ol>
Chris Lattner0c8b2592006-03-03 00:07:20 +0000174 <li><a href="#i_memcpy">'<tt>llvm.memcpy.*</tt>' Intrinsic</a></li>
175 <li><a href="#i_memmove">'<tt>llvm.memmove.*</tt>' Intrinsic</a></li>
176 <li><a href="#i_memset">'<tt>llvm.memset.*</tt>' Intrinsic</a></li>
Chris Lattner069b5bd2006-01-16 22:38:59 +0000177 <li><a href="#i_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a></li>
Chris Lattner33b73f92006-09-08 06:34:02 +0000178 <li><a href="#i_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a></li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000179 </ol>
180 </li>
Nate Begeman0f223bb2006-01-13 23:26:38 +0000181 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000182 <ol>
Nate Begeman0f223bb2006-01-13 23:26:38 +0000183 <li><a href="#i_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
Chris Lattnerb748c672006-01-16 22:34:14 +0000184 <li><a href="#int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic </a></li>
185 <li><a href="#int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic </a></li>
186 <li><a href="#int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic </a></li>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000187 </ol>
188 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000189 <li><a href="#int_debugger">Debugger intrinsics</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000190 </ol>
191 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000192</ol>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000193
194<div class="doc_author">
195 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
196 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
Misha Brukman76307852003-11-08 01:05:38 +0000197</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000198
Chris Lattner2f7c9632001-06-06 20:29:01 +0000199<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000200<div class="doc_section"> <a name="abstract">Abstract </a></div>
201<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000202
Misha Brukman76307852003-11-08 01:05:38 +0000203<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +0000204<p>This document is a reference manual for the LLVM assembly language.
205LLVM is an SSA based representation that provides type safety,
206low-level operations, flexibility, and the capability of representing
207'all' high-level languages cleanly. It is the common code
208representation used throughout all phases of the LLVM compilation
209strategy.</p>
Misha Brukman76307852003-11-08 01:05:38 +0000210</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000211
Chris Lattner2f7c9632001-06-06 20:29:01 +0000212<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000213<div class="doc_section"> <a name="introduction">Introduction</a> </div>
214<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000215
Misha Brukman76307852003-11-08 01:05:38 +0000216<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000217
Chris Lattner48b383b02003-11-25 01:02:51 +0000218<p>The LLVM code representation is designed to be used in three
219different forms: as an in-memory compiler IR, as an on-disk bytecode
220representation (suitable for fast loading by a Just-In-Time compiler),
221and as a human readable assembly language representation. This allows
222LLVM to provide a powerful intermediate representation for efficient
223compiler transformations and analysis, while providing a natural means
224to debug and visualize the transformations. The three different forms
225of LLVM are all equivalent. This document describes the human readable
226representation and notation.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000227
John Criswell4a3327e2005-05-13 22:25:59 +0000228<p>The LLVM representation aims to be light-weight and low-level
Chris Lattner48b383b02003-11-25 01:02:51 +0000229while being expressive, typed, and extensible at the same time. It
230aims to be a "universal IR" of sorts, by being at a low enough level
231that high-level ideas may be cleanly mapped to it (similar to how
232microprocessors are "universal IR's", allowing many source languages to
233be mapped to them). By providing type information, LLVM can be used as
234the target of optimizations: for example, through pointer analysis, it
235can be proven that a C automatic variable is never accessed outside of
236the current function... allowing it to be promoted to a simple SSA
237value instead of a memory location.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000238
Misha Brukman76307852003-11-08 01:05:38 +0000239</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000240
Chris Lattner2f7c9632001-06-06 20:29:01 +0000241<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000242<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000243
Misha Brukman76307852003-11-08 01:05:38 +0000244<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000245
Chris Lattner48b383b02003-11-25 01:02:51 +0000246<p>It is important to note that this document describes 'well formed'
247LLVM assembly language. There is a difference between what the parser
248accepts and what is considered 'well formed'. For example, the
249following instruction is syntactically okay, but not well formed:</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000250
251<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000252 %x = <a href="#i_add">add</a> i32 1, %x
Chris Lattner757528b0b2004-05-23 21:06:01 +0000253</pre>
254
Chris Lattner48b383b02003-11-25 01:02:51 +0000255<p>...because the definition of <tt>%x</tt> does not dominate all of
256its uses. The LLVM infrastructure provides a verification pass that may
257be used to verify that an LLVM module is well formed. This pass is
John Criswell4a3327e2005-05-13 22:25:59 +0000258automatically run by the parser after parsing input assembly and by
Chris Lattner48b383b02003-11-25 01:02:51 +0000259the optimizer before it outputs bytecode. The violations pointed out
260by the verifier pass indicate bugs in transformation passes or input to
261the parser.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000262
Chris Lattner48b383b02003-11-25 01:02:51 +0000263<!-- Describe the typesetting conventions here. --> </div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000264
Chris Lattner2f7c9632001-06-06 20:29:01 +0000265<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000266<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000267<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000268
Misha Brukman76307852003-11-08 01:05:38 +0000269<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000270
Chris Lattner48b383b02003-11-25 01:02:51 +0000271<p>LLVM uses three different forms of identifiers, for different
272purposes:</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000273
Chris Lattner2f7c9632001-06-06 20:29:01 +0000274<ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000275 <li>Named values are represented as a string of characters with a '%' prefix.
276 For example, %foo, %DivisionByZero, %a.really.long.identifier. The actual
277 regular expression used is '<tt>%[a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
278 Identifiers which require other characters in their names can be surrounded
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000279 with quotes. In this way, anything except a <tt>&quot;</tt> character can be used
Chris Lattnerd79749a2004-12-09 16:36:40 +0000280 in a name.</li>
281
282 <li>Unnamed values are represented as an unsigned numeric value with a '%'
283 prefix. For example, %12, %2, %44.</li>
284
Reid Spencer8f08d802004-12-09 18:02:53 +0000285 <li>Constants, which are described in a <a href="#constants">section about
286 constants</a>, below.</li>
Misha Brukman76307852003-11-08 01:05:38 +0000287</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000288
289<p>LLVM requires that values start with a '%' sign for two reasons: Compilers
290don't need to worry about name clashes with reserved words, and the set of
291reserved words may be expanded in the future without penalty. Additionally,
292unnamed identifiers allow a compiler to quickly come up with a temporary
293variable without having to avoid symbol table conflicts.</p>
294
Chris Lattner48b383b02003-11-25 01:02:51 +0000295<p>Reserved words in LLVM are very similar to reserved words in other
Reid Spencer5b950642006-11-11 23:08:07 +0000296languages. There are keywords for different opcodes
297('<tt><a href="#i_add">add</a></tt>',
298 '<tt><a href="#i_bitcast">bitcast</a></tt>',
299 '<tt><a href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000300href="#t_void">void</a></tt>', '<tt><a href="#t_primitive">i32</a></tt>', etc...),
Chris Lattnerd79749a2004-12-09 16:36:40 +0000301and others. These reserved words cannot conflict with variable names, because
302none of them start with a '%' character.</p>
303
304<p>Here is an example of LLVM code to multiply the integer variable
305'<tt>%X</tt>' by 8:</p>
306
Misha Brukman76307852003-11-08 01:05:38 +0000307<p>The easy way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000308
309<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000310 %result = <a href="#i_mul">mul</a> i32 %X, 8
Chris Lattnerd79749a2004-12-09 16:36:40 +0000311</pre>
312
Misha Brukman76307852003-11-08 01:05:38 +0000313<p>After strength reduction:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000314
315<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000316 %result = <a href="#i_shl">shl</a> i32 %X, i8 3
Chris Lattnerd79749a2004-12-09 16:36:40 +0000317</pre>
318
Misha Brukman76307852003-11-08 01:05:38 +0000319<p>And the hard way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000320
321<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000322 <a href="#i_add">add</a> i32 %X, %X <i>; yields {i32}:%0</i>
323 <a href="#i_add">add</a> i32 %0, %0 <i>; yields {i32}:%1</i>
324 %result = <a href="#i_add">add</a> i32 %1, %1
Chris Lattnerd79749a2004-12-09 16:36:40 +0000325</pre>
326
Chris Lattner48b383b02003-11-25 01:02:51 +0000327<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
328important lexical features of LLVM:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000329
Chris Lattner2f7c9632001-06-06 20:29:01 +0000330<ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000331
332 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
333 line.</li>
334
335 <li>Unnamed temporaries are created when the result of a computation is not
336 assigned to a named value.</li>
337
Misha Brukman76307852003-11-08 01:05:38 +0000338 <li>Unnamed temporaries are numbered sequentially</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000339
Misha Brukman76307852003-11-08 01:05:38 +0000340</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000341
John Criswell02fdc6f2005-05-12 16:52:32 +0000342<p>...and it also shows a convention that we follow in this document. When
Chris Lattnerd79749a2004-12-09 16:36:40 +0000343demonstrating instructions, we will follow an instruction with a comment that
344defines the type and name of value produced. Comments are shown in italic
345text.</p>
346
Misha Brukman76307852003-11-08 01:05:38 +0000347</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000348
349<!-- *********************************************************************** -->
350<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
351<!-- *********************************************************************** -->
352
353<!-- ======================================================================= -->
354<div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
355</div>
356
357<div class="doc_text">
358
359<p>LLVM programs are composed of "Module"s, each of which is a
360translation unit of the input programs. Each module consists of
361functions, global variables, and symbol table entries. Modules may be
362combined together with the LLVM linker, which merges function (and
363global variable) definitions, resolves forward declarations, and merges
364symbol table entries. Here is an example of the "hello world" module:</p>
365
366<pre><i>; Declare the string constant as a global constant...</i>
367<a href="#identifiers">%.LC0</a> = <a href="#linkage_internal">internal</a> <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000368 href="#globalvars">constant</a> <a href="#t_array">[13 x i8 ]</a> c"hello world\0A\00" <i>; [13 x i8 ]*</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000369
370<i>; External declaration of the puts function</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000371<a href="#functionstructure">declare</a> i32 %puts(i8 *) <i>; i32(i8 *)* </i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000372
Chris Lattnerd2d29a02006-06-13 03:05:47 +0000373<i>; Global variable / Function body section separator</i>
374implementation
375
Chris Lattner6af02f32004-12-09 16:11:40 +0000376<i>; Definition of main function</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000377define i32 %main() { <i>; i32()* </i>
378 <i>; Convert [13x i8 ]* to i8 *...</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000379 %cast210 = <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000380 href="#i_getelementptr">getelementptr</a> [13 x i8 ]* %.LC0, i64 0, i64 0 <i>; i8 *</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000381
382 <i>; Call puts function to write out the string to stdout...</i>
383 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000384 href="#i_call">call</a> i32 %puts(i8 * %cast210) <i>; i32</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000385 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000386 href="#i_ret">ret</a> i32 0<br>}<br></pre>
Chris Lattner6af02f32004-12-09 16:11:40 +0000387
388<p>This example is made up of a <a href="#globalvars">global variable</a>
389named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
390function, and a <a href="#functionstructure">function definition</a>
391for "<tt>main</tt>".</p>
392
Chris Lattnerd79749a2004-12-09 16:36:40 +0000393<p>In general, a module is made up of a list of global values,
394where both functions and global variables are global values. Global values are
395represented by a pointer to a memory location (in this case, a pointer to an
396array of char, and a pointer to a function), and have one of the following <a
397href="#linkage">linkage types</a>.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000398
Chris Lattnerd2d29a02006-06-13 03:05:47 +0000399<p>Due to a limitation in the current LLVM assembly parser (it is limited by
400one-token lookahead), modules are split into two pieces by the "implementation"
401keyword. Global variable prototypes and definitions must occur before the
402keyword, and function definitions must occur after it. Function prototypes may
403occur either before or after it. In the future, the implementation keyword may
404become a noop, if the parser gets smarter.</p>
405
Chris Lattnerd79749a2004-12-09 16:36:40 +0000406</div>
407
408<!-- ======================================================================= -->
409<div class="doc_subsection">
410 <a name="linkage">Linkage Types</a>
411</div>
412
413<div class="doc_text">
414
415<p>
416All Global Variables and Functions have one of the following types of linkage:
417</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000418
419<dl>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000420
Chris Lattner6af02f32004-12-09 16:11:40 +0000421 <dt><tt><b><a name="linkage_internal">internal</a></b></tt> </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000422
423 <dd>Global values with internal linkage are only directly accessible by
424 objects in the current module. In particular, linking code into a module with
425 an internal global value may cause the internal to be renamed as necessary to
426 avoid collisions. Because the symbol is internal to the module, all
427 references can be updated. This corresponds to the notion of the
Chris Lattnere20b4702007-01-14 06:51:48 +0000428 '<tt>static</tt>' keyword in C.
Chris Lattner6af02f32004-12-09 16:11:40 +0000429 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000430
Chris Lattner6af02f32004-12-09 16:11:40 +0000431 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000432
Chris Lattnere20b4702007-01-14 06:51:48 +0000433 <dd>Globals with "<tt>linkonce</tt>" linkage are merged with other globals of
434 the same name when linkage occurs. This is typically used to implement
435 inline functions, templates, or other code which must be generated in each
436 translation unit that uses it. Unreferenced <tt>linkonce</tt> globals are
437 allowed to be discarded.
Chris Lattner6af02f32004-12-09 16:11:40 +0000438 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000439
Chris Lattner6af02f32004-12-09 16:11:40 +0000440 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000441
442 <dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt> linkage,
443 except that unreferenced <tt>weak</tt> globals may not be discarded. This is
Chris Lattnere20b4702007-01-14 06:51:48 +0000444 used for globals that may be emitted in multiple translation units, but that
445 are not guaranteed to be emitted into every translation unit that uses them.
446 One example of this are common globals in C, such as "<tt>int X;</tt>" at
447 global scope.
Chris Lattner6af02f32004-12-09 16:11:40 +0000448 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000449
Chris Lattner6af02f32004-12-09 16:11:40 +0000450 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000451
452 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
453 pointer to array type. When two global variables with appending linkage are
454 linked together, the two global arrays are appended together. This is the
455 LLVM, typesafe, equivalent of having the system linker append together
456 "sections" with identical names when .o files are linked.
Chris Lattner6af02f32004-12-09 16:11:40 +0000457 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000458
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000459 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
460 <dd>The semantics of this linkage follow the ELF model: the symbol is weak
461 until linked, if not linked, the symbol becomes null instead of being an
462 undefined reference.
463 </dd>
464</dl>
465
Chris Lattner6af02f32004-12-09 16:11:40 +0000466 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000467
468 <dd>If none of the above identifiers are used, the global is externally
469 visible, meaning that it participates in linkage and can be used to resolve
470 external symbol references.
Chris Lattner6af02f32004-12-09 16:11:40 +0000471 </dd>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000472
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000473 <p>
474 The next two types of linkage are targeted for Microsoft Windows platform
475 only. They are designed to support importing (exporting) symbols from (to)
476 DLLs.
477 </p>
478
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000479 <dl>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000480 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
481
482 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
483 or variable via a global pointer to a pointer that is set up by the DLL
484 exporting the symbol. On Microsoft Windows targets, the pointer name is
485 formed by combining <code>_imp__</code> and the function or variable name.
486 </dd>
487
488 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
489
490 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
491 pointer to a pointer in a DLL, so that it can be referenced with the
492 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
493 name is formed by combining <code>_imp__</code> and the function or variable
494 name.
495 </dd>
496
Chris Lattner6af02f32004-12-09 16:11:40 +0000497</dl>
498
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000499<p><a name="linkage_external"></a>For example, since the "<tt>.LC0</tt>"
Chris Lattner6af02f32004-12-09 16:11:40 +0000500variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
501variable and was linked with this one, one of the two would be renamed,
502preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
503external (i.e., lacking any linkage declarations), they are accessible
Reid Spencer92c671e2007-01-05 00:59:10 +0000504outside of the current module.</p>
505<p>It is illegal for a function <i>declaration</i>
506to have any linkage type other than "externally visible", <tt>dllimport</tt>,
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000507or <tt>extern_weak</tt>.</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000508
Chris Lattner6af02f32004-12-09 16:11:40 +0000509</div>
510
511<!-- ======================================================================= -->
512<div class="doc_subsection">
Chris Lattner0132aff2005-05-06 22:57:40 +0000513 <a name="callingconv">Calling Conventions</a>
514</div>
515
516<div class="doc_text">
517
518<p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
519and <a href="#i_invoke">invokes</a> can all have an optional calling convention
520specified for the call. The calling convention of any pair of dynamic
521caller/callee must match, or the behavior of the program is undefined. The
522following calling conventions are supported by LLVM, and more may be added in
523the future:</p>
524
525<dl>
526 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
527
528 <dd>This calling convention (the default if no other calling convention is
529 specified) matches the target C calling conventions. This calling convention
John Criswell02fdc6f2005-05-12 16:52:32 +0000530 supports varargs function calls and tolerates some mismatch in the declared
Reid Spencer72ba4992006-12-31 21:30:18 +0000531 prototype and implemented declaration of the function (as does normal C).
Chris Lattner0132aff2005-05-06 22:57:40 +0000532 </dd>
533
534 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
535
536 <dd>This calling convention attempts to make calls as fast as possible
537 (e.g. by passing things in registers). This calling convention allows the
538 target to use whatever tricks it wants to produce fast code for the target,
Chris Lattnerc792eb32005-05-06 23:08:23 +0000539 without having to conform to an externally specified ABI. Implementations of
540 this convention should allow arbitrary tail call optimization to be supported.
541 This calling convention does not support varargs and requires the prototype of
542 all callees to exactly match the prototype of the function definition.
Chris Lattner0132aff2005-05-06 22:57:40 +0000543 </dd>
544
545 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
546
547 <dd>This calling convention attempts to make code in the caller as efficient
548 as possible under the assumption that the call is not commonly executed. As
549 such, these calls often preserve all registers so that the call does not break
550 any live ranges in the caller side. This calling convention does not support
551 varargs and requires the prototype of all callees to exactly match the
552 prototype of the function definition.
553 </dd>
554
Chris Lattner573f64e2005-05-07 01:46:40 +0000555 <dt><b>"<tt>cc &lt;<em>n</em>&gt;</tt>" - Numbered convention</b>:</dt>
Chris Lattner0132aff2005-05-06 22:57:40 +0000556
557 <dd>Any calling convention may be specified by number, allowing
558 target-specific calling conventions to be used. Target specific calling
559 conventions start at 64.
560 </dd>
Chris Lattner573f64e2005-05-07 01:46:40 +0000561</dl>
Chris Lattner0132aff2005-05-06 22:57:40 +0000562
563<p>More calling conventions can be added/defined on an as-needed basis, to
564support pascal conventions or any other well-known target-independent
565convention.</p>
566
567</div>
568
569<!-- ======================================================================= -->
570<div class="doc_subsection">
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000571 <a name="visibility">Visibility Styles</a>
572</div>
573
574<div class="doc_text">
575
576<p>
577All Global Variables and Functions have one of the following visibility styles:
578</p>
579
580<dl>
581 <dt><b>"<tt>default</tt>" - Default style</b>:</dt>
582
583 <dd>On ELF, default visibility means that the declaration is visible to other
584 modules and, in shared libraries, means that the declared entity may be
585 overridden. On Darwin, default visibility means that the declaration is
586 visible to other modules. Default visibility corresponds to "external
587 linkage" in the language.
588 </dd>
589
590 <dt><b>"<tt>hidden</tt>" - Hidden style</b>:</dt>
591
592 <dd>Two declarations of an object with hidden visibility refer to the same
593 object if they are in the same shared object. Usually, hidden visibility
594 indicates that the symbol will not be placed into the dynamic symbol table,
595 so no other module (executable or shared library) can reference it
596 directly.
597 </dd>
598
599</dl>
600
601</div>
602
603<!-- ======================================================================= -->
604<div class="doc_subsection">
Chris Lattner6af02f32004-12-09 16:11:40 +0000605 <a name="globalvars">Global Variables</a>
606</div>
607
608<div class="doc_text">
609
Chris Lattner5d5aede2005-02-12 19:30:21 +0000610<p>Global variables define regions of memory allocated at compilation time
Chris Lattner662c8722005-11-12 00:45:07 +0000611instead of run-time. Global variables may optionally be initialized, may have
612an explicit section to be placed in, and may
Chris Lattner54611b42005-11-06 08:02:57 +0000613have an optional explicit alignment specified. A
John Criswell4c0cf7f2005-10-24 16:17:18 +0000614variable may be defined as a global "constant," which indicates that the
Chris Lattner5d5aede2005-02-12 19:30:21 +0000615contents of the variable will <b>never</b> be modified (enabling better
616optimization, allowing the global data to be placed in the read-only section of
617an executable, etc). Note that variables that need runtime initialization
John Criswell4c0cf7f2005-10-24 16:17:18 +0000618cannot be marked "constant" as there is a store to the variable.</p>
Chris Lattner5d5aede2005-02-12 19:30:21 +0000619
620<p>
621LLVM explicitly allows <em>declarations</em> of global variables to be marked
622constant, even if the final definition of the global is not. This capability
623can be used to enable slightly better optimization of the program, but requires
624the language definition to guarantee that optimizations based on the
625'constantness' are valid for the translation units that do not include the
626definition.
627</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000628
629<p>As SSA values, global variables define pointer values that are in
630scope (i.e. they dominate) all basic blocks in the program. Global
631variables always define a pointer to their "content" type because they
632describe a region of memory, and all memory objects in LLVM are
633accessed through pointers.</p>
634
Chris Lattner662c8722005-11-12 00:45:07 +0000635<p>LLVM allows an explicit section to be specified for globals. If the target
636supports it, it will emit globals to the section specified.</p>
637
Chris Lattner54611b42005-11-06 08:02:57 +0000638<p>An explicit alignment may be specified for a global. If not present, or if
639the alignment is set to zero, the alignment of the global is set by the target
640to whatever it feels convenient. If an explicit alignment is specified, the
641global is forced to have at least that much alignment. All alignments must be
642a power of 2.</p>
643
Chris Lattner5760c502007-01-14 00:27:09 +0000644<p>For example, the following defines a global with an initializer, section,
645 and alignment:</p>
646
647<pre>
648 %G = constant float 1.0, section "foo", align 4
649</pre>
650
Chris Lattner6af02f32004-12-09 16:11:40 +0000651</div>
652
653
654<!-- ======================================================================= -->
655<div class="doc_subsection">
656 <a name="functionstructure">Functions</a>
657</div>
658
659<div class="doc_text">
660
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000661<p>LLVM function definitions consist of the "<tt>define</tt>" keyord,
662an optional <a href="#linkage">linkage type</a>, an optional
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000663<a href="#visibility">visibility style</a>, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000664<a href="#callingconv">calling convention</a>, a return type, an optional
665<a href="#paramattrs">parameter attribute</a> for the return type, a function
666name, a (possibly empty) argument list (each with optional
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000667<a href="#paramattrs">parameter attributes</a>), an optional section, an
668optional alignment, an opening curly brace, a list of basic blocks, and a
669closing curly brace.
670
671LLVM function declarations consist of the "<tt>declare</tt>" keyword, an
672optional <a href="#linkage">linkage type</a>, an optional
673<a href="#visibility">visibility style</a>, an optional
674<a href="#callingconv">calling convention</a>, a return type, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000675<a href="#paramattrs">parameter attribute</a> for the return type, a function
676name, a possibly empty list of arguments, and an optional alignment.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000677
678<p>A function definition contains a list of basic blocks, forming the CFG for
679the function. Each basic block may optionally start with a label (giving the
680basic block a symbol table entry), contains a list of instructions, and ends
681with a <a href="#terminators">terminator</a> instruction (such as a branch or
682function return).</p>
683
John Criswell02fdc6f2005-05-12 16:52:32 +0000684<p>The first basic block in a program is special in two ways: it is immediately
Chris Lattner6af02f32004-12-09 16:11:40 +0000685executed on entrance to the function, and it is not allowed to have predecessor
686basic blocks (i.e. there can not be any branches to the entry block of a
687function). Because the block can have no predecessors, it also cannot have any
688<a href="#i_phi">PHI nodes</a>.</p>
689
690<p>LLVM functions are identified by their name and type signature. Hence, two
691functions with the same name but different parameter lists or return values are
Chris Lattner455fc8c2005-03-07 22:13:59 +0000692considered different functions, and LLVM will resolve references to each
Chris Lattner6af02f32004-12-09 16:11:40 +0000693appropriately.</p>
694
Chris Lattner662c8722005-11-12 00:45:07 +0000695<p>LLVM allows an explicit section to be specified for functions. If the target
696supports it, it will emit functions to the section specified.</p>
697
Chris Lattner54611b42005-11-06 08:02:57 +0000698<p>An explicit alignment may be specified for a function. If not present, or if
699the alignment is set to zero, the alignment of the function is set by the target
700to whatever it feels convenient. If an explicit alignment is specified, the
701function is forced to have at least that much alignment. All alignments must be
702a power of 2.</p>
703
Chris Lattner6af02f32004-12-09 16:11:40 +0000704</div>
705
Chris Lattner91c15c42006-01-23 23:23:47 +0000706<!-- ======================================================================= -->
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000707<div class="doc_subsection"><a name="paramattrs">Parameter Attributes</a></div>
708<div class="doc_text">
709 <p>The return type and each parameter of a function type may have a set of
710 <i>parameter attributes</i> associated with them. Parameter attributes are
711 used to communicate additional information about the result or parameters of
712 a function. Parameter attributes are considered to be part of the function
713 type so two functions types that differ only by the parameter attributes
714 are different function types.</p>
715
Reid Spencercf7ebf52007-01-15 18:27:39 +0000716 <p>Parameter attributes are simple keywords that follow the type specified. If
717 multiple parameter attributes are needed, they are space separated. For
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000718 example:</p><pre>
Reid Spencercf7ebf52007-01-15 18:27:39 +0000719 %someFunc = i16 (i8 sext %someParam) zext
720 %someFunc = i16 (i8 zext %someParam) zext</pre>
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000721 <p>Note that the two function types above are unique because the parameter has
Reid Spencercf7ebf52007-01-15 18:27:39 +0000722 a different attribute (sext in the first one, zext in the second). Also note
723 that the attribute for the function result (zext) comes immediately after the
724 argument list.</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000725
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000726 <p>Currently, only the following parameter attributes are defined:</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000727 <dl>
Reid Spencercf7ebf52007-01-15 18:27:39 +0000728 <dt><tt>zext</tt></dt>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000729 <dd>This indicates that the parameter should be zero extended just before
730 a call to this function.</dd>
Reid Spencercf7ebf52007-01-15 18:27:39 +0000731 <dt><tt>sext</tt></dt>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000732 <dd>This indicates that the parameter should be sign extended just before
733 a call to this function.</dd>
Anton Korobeynikove8166852007-01-28 14:30:45 +0000734 <dt><tt>inreg</tt></dt>
735 <dd>This indicates that the parameter should be placed in register (if
Anton Korobeynikove93c6e82007-01-28 15:27:21 +0000736 possible) during assembling function call. Support for this attribute is
737 target-specific</dd>
Anton Korobeynikove8166852007-01-28 14:30:45 +0000738 <dt><tt>sret</tt></dt>
Anton Korobeynikove93c6e82007-01-28 15:27:21 +0000739 <dd>This indicates that the parameter specifies the address of a structure
740 that is the return value of the function in the source program.
741 </dd>
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000742 </dl>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000743
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000744</div>
745
746<!-- ======================================================================= -->
Chris Lattner91c15c42006-01-23 23:23:47 +0000747<div class="doc_subsection">
Chris Lattner93564892006-04-08 04:40:53 +0000748 <a name="moduleasm">Module-Level Inline Assembly</a>
Chris Lattner91c15c42006-01-23 23:23:47 +0000749</div>
750
751<div class="doc_text">
752<p>
753Modules may contain "module-level inline asm" blocks, which corresponds to the
754GCC "file scope inline asm" blocks. These blocks are internally concatenated by
755LLVM and treated as a single unit, but may be separated in the .ll file if
756desired. The syntax is very simple:
757</p>
758
759<div class="doc_code"><pre>
Chris Lattnera1280ad2006-01-24 00:37:20 +0000760 module asm "inline asm code goes here"
761 module asm "more can go here"
Chris Lattner91c15c42006-01-23 23:23:47 +0000762</pre></div>
763
764<p>The strings can contain any character by escaping non-printable characters.
765 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
766 for the number.
767</p>
768
769<p>
770 The inline asm code is simply printed to the machine code .s file when
771 assembly code is generated.
772</p>
773</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000774
Reid Spencer50c723a2007-02-19 23:54:10 +0000775<!-- ======================================================================= -->
776<div class="doc_subsection">
777 <a name="datalayout">Data Layout</a>
778</div>
779
780<div class="doc_text">
781<p>A module may specify a target specific data layout string that specifies how
782data is to be laid out in memory. The syntax for the data layout is simply:<br/>
783<pre> target datalayout = "<i>layout specification</i>"
784</pre>
785The <i>layout specification</i> consists of a list of specifications separated
786by the minus sign character ('-'). Each specification starts with a letter
787and may include other information after the letter to define some aspect of the
788data layout. The specifications accepted are as follows: </p>
789<dl>
790 <dt><tt>E</tt></dt>
791 <dd>Specifies that the target lays out data in big-endian form. That is, the
792 bits with the most significance have the lowest address location.</dd>
793 <dt><tt>e</tt></dt>
794 <dd>Specifies that hte target lays out data in little-endian form. That is,
795 the bits with the least significance have the lowest address location.</dd>
796 <dt><tt>p:<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
797 <dd>This specifies the <i>size</i> of a pointer and its <i>abi</i> and
798 <i>preferred</i> alignments. All sizes are in bits. Specifying the <i>pref</i>
799 alignment is optional. If omitted, the preceding <tt>:</tt> should be omitted
800 too.</dd>
801 <dt><tt>i<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
802 <dd>This specifies the alignment for an integer type of a given bit
803 <i>size</i>. The value of <i>size</i> must be in the range [1,2^23).</dd>
804 <dt><tt>v<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
805 <dd>This specifies the alignment for a vector type of a given bit
806 <i>size</i>.</dd>
807 <dt><tt>f<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
808 <dd>This specifies the alignment for a floating point type of a given bit
809 <i>size</i>. The value of <i>size</i> must be either 32 (float) or 64
810 (double).</dd>
811 <dt><tt>a<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
812 <dd>This specifies the alignment for an aggregate type of a given bit
813 <i>size</i>.</dd>
814</dl>
815<p>When constructing the data layout for a given target, LLVM starts with a
816default set of specifications which are then (possibly) overriden by the
817specifications in the <tt>datalayout</tt> keyword. The default specifications
818are given in this list:</p>
819<ul>
820 <li><tt>E</tt> - big endian</li>
821 <li><tt>p:32:64:64</tt> - 32-bit pointers with 64-bit alignment</li>
822 <li><tt>i1:8:8</tt> - i1 is 8-bit (byte) aligned</li>
823 <li><tt>i8:8:8</tt> - i8 is 8-bit (byte) aligned</li>
824 <li><tt>i16:16:16</tt> - i16 is 16-bit aligned</li>
825 <li><tt>i32:32:32</tt> - i32 is 32-bit aligned</li>
826 <li><tt>i64:32:64</tt> - i64 has abi alignment of 32-bits but preferred
827 alignment of 64-bits</li>
828 <li><tt>f32:32:32</tt> - float is 32-bit aligned</li>
829 <li><tt>f64:64:64</tt> - double is 64-bit aligned</li>
830 <li><tt>v64:64:64</tt> - 64-bit vector is 64-bit aligned</li>
831 <li><tt>v128:128:128</tt> - 128-bit vector is 128-bit aligned</li>
832 <li><tt>a0:0:1</tt> - aggregates are 8-bit aligned</li>
833</ul>
834<p>When llvm is determining the alignment for a given type, it uses the
835following rules:
836<ol>
837 <li>If the type sought is an exact match for one of the specifications, that
838 specification is used.</li>
839 <li>If no match is found, and the type sought is an integer type, then the
840 smallest integer type that is larger than the bitwidth of the sought type is
841 used. If none of the specifications are larger than the bitwidth then the the
842 largest integer type is used. For example, given the default specifications
843 above, the i7 type will use the alignment of i8 (next largest) while both
844 i65 and i256 will use the alignment of i64 (largest specified).</li>
845 <li>If no match is found, and the type sought is a vector type, then the
846 largest vector type that is smaller than the sought vector type will be used
847 as a fall back. This happens because <128 x double> can be implemented in
848 terms of 64 <2 x double>, for example.</li>
849</ol>
850</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000851
Chris Lattner2f7c9632001-06-06 20:29:01 +0000852<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000853<div class="doc_section"> <a name="typesystem">Type System</a> </div>
854<!-- *********************************************************************** -->
Chris Lattner6af02f32004-12-09 16:11:40 +0000855
Misha Brukman76307852003-11-08 01:05:38 +0000856<div class="doc_text">
Chris Lattner6af02f32004-12-09 16:11:40 +0000857
Misha Brukman76307852003-11-08 01:05:38 +0000858<p>The LLVM type system is one of the most important features of the
Chris Lattner48b383b02003-11-25 01:02:51 +0000859intermediate representation. Being typed enables a number of
860optimizations to be performed on the IR directly, without having to do
861extra analyses on the side before the transformation. A strong type
862system makes it easier to read the generated code and enables novel
863analyses and transformations that are not feasible to perform on normal
864three address code representations.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000865
866</div>
867
Chris Lattner2f7c9632001-06-06 20:29:01 +0000868<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000869<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +0000870<div class="doc_text">
John Criswell417228d2004-04-09 16:48:45 +0000871<p>The primitive types are the fundamental building blocks of the LLVM
Chris Lattner455fc8c2005-03-07 22:13:59 +0000872system. The current set of primitive types is as follows:</p>
Misha Brukmanc501f552004-03-01 17:47:27 +0000873
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000874<table class="layout">
875 <tr class="layout">
876 <td class="left">
877 <table>
Chris Lattner48b383b02003-11-25 01:02:51 +0000878 <tbody>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000879 <tr><th>Type</th><th>Description</th></tr>
880 <tr><td><tt>void</tt></td><td>No value</td></tr>
Chris Lattnerc0f423a2007-01-15 01:54:13 +0000881 <tr><td><tt>i8</tt></td><td>8-bit value</td></tr>
882 <tr><td><tt>i32</tt></td><td>32-bit value</td></tr>
Misha Brukman36c6bc12005-04-22 18:02:52 +0000883 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000884 <tr><td><tt>label</tt></td><td>Branch destination</td></tr>
Chris Lattner48b383b02003-11-25 01:02:51 +0000885 </tbody>
886 </table>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000887 </td>
888 <td class="right">
889 <table>
Chris Lattner48b383b02003-11-25 01:02:51 +0000890 <tbody>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000891 <tr><th>Type</th><th>Description</th></tr>
Reid Spencer36a15422007-01-12 03:35:51 +0000892 <tr><td><tt>i1</tt></td><td>True or False value</td></tr>
Chris Lattnerc0f423a2007-01-15 01:54:13 +0000893 <tr><td><tt>i16</tt></td><td>16-bit value</td></tr>
894 <tr><td><tt>i64</tt></td><td>64-bit value</td></tr>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000895 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
Chris Lattner48b383b02003-11-25 01:02:51 +0000896 </tbody>
897 </table>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000898 </td>
899 </tr>
Misha Brukman76307852003-11-08 01:05:38 +0000900</table>
Misha Brukman76307852003-11-08 01:05:38 +0000901</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000902
Chris Lattner2f7c9632001-06-06 20:29:01 +0000903<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000904<div class="doc_subsubsection"> <a name="t_classifications">Type
905Classifications</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +0000906<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +0000907<p>These different primitive types fall into a few useful
908classifications:</p>
Misha Brukmanc501f552004-03-01 17:47:27 +0000909
910<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +0000911 <tbody>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000912 <tr><th>Classification</th><th>Types</th></tr>
Chris Lattner48b383b02003-11-25 01:02:51 +0000913 <tr>
Chris Lattner48b383b02003-11-25 01:02:51 +0000914 <td><a name="t_integer">integer</a></td>
Chris Lattnerc0f423a2007-01-15 01:54:13 +0000915 <td><tt>i1, i8, i16, i32, i64</tt></td>
Chris Lattner48b383b02003-11-25 01:02:51 +0000916 </tr>
917 <tr>
918 <td><a name="t_floating">floating point</a></td>
919 <td><tt>float, double</tt></td>
920 </tr>
921 <tr>
922 <td><a name="t_firstclass">first class</a></td>
Reid Spencer36a15422007-01-12 03:35:51 +0000923 <td><tt>i1, i8, i16, i32, i64, float, double, <br/>
Reid Spencer404a3252007-02-15 03:07:05 +0000924 <a href="#t_pointer">pointer</a>,<a href="#t_vector">vector</a></tt>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000925 </td>
Chris Lattner48b383b02003-11-25 01:02:51 +0000926 </tr>
927 </tbody>
Misha Brukman76307852003-11-08 01:05:38 +0000928</table>
Misha Brukmanc501f552004-03-01 17:47:27 +0000929
Chris Lattner48b383b02003-11-25 01:02:51 +0000930<p>The <a href="#t_firstclass">first class</a> types are perhaps the
931most important. Values of these types are the only ones which can be
932produced by instructions, passed as arguments, or used as operands to
933instructions. This means that all structures and arrays must be
934manipulated either by pointer or by component.</p>
Misha Brukman76307852003-11-08 01:05:38 +0000935</div>
Chris Lattner74d3f822004-12-09 17:30:23 +0000936
Chris Lattner2f7c9632001-06-06 20:29:01 +0000937<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000938<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +0000939
Misha Brukman76307852003-11-08 01:05:38 +0000940<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +0000941
Chris Lattner48b383b02003-11-25 01:02:51 +0000942<p>The real power in LLVM comes from the derived types in the system.
943This is what allows a programmer to represent arrays, functions,
944pointers, and other useful types. Note that these derived types may be
945recursive: For example, it is possible to have a two dimensional array.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +0000946
Misha Brukman76307852003-11-08 01:05:38 +0000947</div>
Chris Lattner74d3f822004-12-09 17:30:23 +0000948
Chris Lattner2f7c9632001-06-06 20:29:01 +0000949<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000950<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +0000951
Misha Brukman76307852003-11-08 01:05:38 +0000952<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +0000953
Chris Lattner2f7c9632001-06-06 20:29:01 +0000954<h5>Overview:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +0000955
Misha Brukman76307852003-11-08 01:05:38 +0000956<p>The array type is a very simple derived type that arranges elements
Chris Lattner48b383b02003-11-25 01:02:51 +0000957sequentially in memory. The array type requires a size (number of
958elements) and an underlying data type.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +0000959
Chris Lattner590645f2002-04-14 06:13:44 +0000960<h5>Syntax:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +0000961
962<pre>
963 [&lt;# elements&gt; x &lt;elementtype&gt;]
964</pre>
965
John Criswell02fdc6f2005-05-12 16:52:32 +0000966<p>The number of elements is a constant integer value; elementtype may
Chris Lattner48b383b02003-11-25 01:02:51 +0000967be any type with a size.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +0000968
Chris Lattner590645f2002-04-14 06:13:44 +0000969<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000970<table class="layout">
971 <tr class="layout">
972 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000973 <tt>[40 x i32 ]</tt><br/>
974 <tt>[41 x i32 ]</tt><br/>
Reid Spencer3e628eb92007-01-04 16:43:23 +0000975 <tt>[40 x i8]</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000976 </td>
977 <td class="left">
Reid Spencer3e628eb92007-01-04 16:43:23 +0000978 Array of 40 32-bit integer values.<br/>
979 Array of 41 32-bit integer values.<br/>
980 Array of 40 8-bit integer values.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000981 </td>
982 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000983</table>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000984<p>Here are some examples of multidimensional arrays:</p>
985<table class="layout">
986 <tr class="layout">
987 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000988 <tt>[3 x [4 x i32]]</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000989 <tt>[12 x [10 x float]]</tt><br/>
Reid Spencer3e628eb92007-01-04 16:43:23 +0000990 <tt>[2 x [3 x [4 x i16]]]</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000991 </td>
992 <td class="left">
Reid Spencer3e628eb92007-01-04 16:43:23 +0000993 3x4 array of 32-bit integer values.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000994 12x10 array of single precision floating point values.<br/>
Reid Spencer3e628eb92007-01-04 16:43:23 +0000995 2x3x4 array of 16-bit integer values.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000996 </td>
997 </tr>
998</table>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +0000999
John Criswell4c0cf7f2005-10-24 16:17:18 +00001000<p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
1001length array. Normally, accesses past the end of an array are undefined in
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001002LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
1003As a special case, however, zero length arrays are recognized to be variable
1004length. This allows implementation of 'pascal style arrays' with the LLVM
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001005type "{ i32, [0 x float]}", for example.</p>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001006
Misha Brukman76307852003-11-08 01:05:38 +00001007</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001008
Chris Lattner2f7c9632001-06-06 20:29:01 +00001009<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001010<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001011<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001012<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001013<p>The function type can be thought of as a function signature. It
1014consists of a return type and a list of formal parameter types.
John Criswella0d50d22003-11-25 21:45:46 +00001015Function types are usually used to build virtual function tables
Chris Lattner48b383b02003-11-25 01:02:51 +00001016(which are structures of pointers to functions), for indirect function
1017calls, and when defining a function.</p>
John Criswella0d50d22003-11-25 21:45:46 +00001018<p>
1019The return type of a function type cannot be an aggregate type.
1020</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001021<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001022<pre> &lt;returntype&gt; (&lt;parameter list&gt;)<br></pre>
John Criswell4c0cf7f2005-10-24 16:17:18 +00001023<p>...where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
Misha Brukman20f9a622004-08-12 20:16:08 +00001024specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
Chris Lattner5ed60612003-09-03 00:41:47 +00001025which indicates that the function takes a variable number of arguments.
1026Variable argument functions can access their arguments with the <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001027 href="#int_varargs">variable argument handling intrinsic</a> functions.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001028<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001029<table class="layout">
1030 <tr class="layout">
Reid Spencer58c08712006-12-31 07:18:34 +00001031 <td class="left"><tt>i32 (i32)</tt></td>
1032 <td class="left">function taking an <tt>i32</tt>, returning an <tt>i32</tt>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001033 </td>
Reid Spencer58c08712006-12-31 07:18:34 +00001034 </tr><tr class="layout">
Reid Spencere6a338d2007-01-15 18:28:34 +00001035 <td class="left"><tt>float&nbsp;(i16&nbsp;sext,&nbsp;i32&nbsp;*)&nbsp;*
Reid Spencer655dcc62006-12-31 07:20:23 +00001036 </tt></td>
Reid Spencer58c08712006-12-31 07:18:34 +00001037 <td class="left"><a href="#t_pointer">Pointer</a> to a function that takes
1038 an <tt>i16</tt> that should be sign extended and a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001039 <a href="#t_pointer">pointer</a> to <tt>i32</tt>, returning
Reid Spencer58c08712006-12-31 07:18:34 +00001040 <tt>float</tt>.
1041 </td>
1042 </tr><tr class="layout">
1043 <td class="left"><tt>i32 (i8*, ...)</tt></td>
1044 <td class="left">A vararg function that takes at least one
Reid Spencer3e628eb92007-01-04 16:43:23 +00001045 <a href="#t_pointer">pointer</a> to <tt>i8 </tt> (char in C),
Reid Spencer58c08712006-12-31 07:18:34 +00001046 which returns an integer. This is the signature for <tt>printf</tt> in
1047 LLVM.
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001048 </td>
1049 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001050</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00001051
Misha Brukman76307852003-11-08 01:05:38 +00001052</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001053<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001054<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001055<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001056<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001057<p>The structure type is used to represent a collection of data members
1058together in memory. The packing of the field types is defined to match
1059the ABI of the underlying processor. The elements of a structure may
1060be any type that has a size.</p>
1061<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1062and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1063field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1064instruction.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001065<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001066<pre> { &lt;type list&gt; }<br></pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001067<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001068<table class="layout">
1069 <tr class="layout">
1070 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001071 <tt>{ i32, i32, i32 }</tt><br/>
1072 <tt>{ float, i32 (i32) * }</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001073 </td>
1074 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001075 a triple of three <tt>i32</tt> values<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001076 A pair, where the first element is a <tt>float</tt> and the second element
1077 is a <a href="#t_pointer">pointer</a> to a <a href="#t_function">function</a>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001078 that takes an <tt>i32</tt>, returning an <tt>i32</tt>.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001079 </td>
1080 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001081</table>
Misha Brukman76307852003-11-08 01:05:38 +00001082</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001083
Chris Lattner2f7c9632001-06-06 20:29:01 +00001084<!-- _______________________________________________________________________ -->
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001085<div class="doc_subsubsection"> <a name="t_pstruct">Packed Structure Type</a>
1086</div>
1087<div class="doc_text">
1088<h5>Overview:</h5>
1089<p>The packed structure type is used to represent a collection of data members
1090together in memory. There is no padding between fields. Further, the alignment
1091of a packed structure is 1 byte. The elements of a packed structure may
1092be any type that has a size.</p>
1093<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1094and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1095field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1096instruction.</p>
1097<h5>Syntax:</h5>
1098<pre> &lt; { &lt;type list&gt; } &gt; <br></pre>
1099<h5>Examples:</h5>
1100<table class="layout">
1101 <tr class="layout">
1102 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001103 <tt> &lt; { i32, i32, i32 } &gt; </tt><br/>
1104 <tt> &lt; { float, i32 (i32) * } &gt; </tt><br/>
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001105 </td>
1106 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001107 a triple of three <tt>i32</tt> values<br/>
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001108 A pair, where the first element is a <tt>float</tt> and the second element
1109 is a <a href="#t_pointer">pointer</a> to a <a href="#t_function">function</a>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001110 that takes an <tt>i32</tt>, returning an <tt>i32</tt>.<br/>
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001111 </td>
1112 </tr>
1113</table>
1114</div>
1115
1116<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001117<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001118<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00001119<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001120<p>As in many languages, the pointer type represents a pointer or
1121reference to another object, which must live in memory.</p>
Chris Lattner590645f2002-04-14 06:13:44 +00001122<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001123<pre> &lt;type&gt; *<br></pre>
Chris Lattner590645f2002-04-14 06:13:44 +00001124<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001125<table class="layout">
1126 <tr class="layout">
1127 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001128 <tt>[4x i32]*</tt><br/>
1129 <tt>i32 (i32 *) *</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001130 </td>
1131 <td class="left">
1132 A <a href="#t_pointer">pointer</a> to <a href="#t_array">array</a> of
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001133 four <tt>i32</tt> values<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001134 A <a href="#t_pointer">pointer</a> to a <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001135 href="#t_function">function</a> that takes an <tt>i32*</tt>, returning an
1136 <tt>i32</tt>.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001137 </td>
1138 </tr>
Misha Brukman76307852003-11-08 01:05:38 +00001139</table>
Misha Brukman76307852003-11-08 01:05:38 +00001140</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001141
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001142<!-- _______________________________________________________________________ -->
Reid Spencer404a3252007-02-15 03:07:05 +00001143<div class="doc_subsubsection"> <a name="t_vector">Vector Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001144<div class="doc_text">
Chris Lattner37b6b092005-04-25 17:34:15 +00001145
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001146<h5>Overview:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001147
Reid Spencer404a3252007-02-15 03:07:05 +00001148<p>A vector type is a simple derived type that represents a vector
1149of elements. Vector types are used when multiple primitive data
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001150are operated in parallel using a single instruction (SIMD).
Reid Spencer404a3252007-02-15 03:07:05 +00001151A vector type requires a size (number of
Chris Lattner330ce692005-11-10 01:44:22 +00001152elements) and an underlying primitive data type. Vectors must have a power
Reid Spencer404a3252007-02-15 03:07:05 +00001153of two length (1, 2, 4, 8, 16 ...). Vector types are
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001154considered <a href="#t_firstclass">first class</a>.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001155
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001156<h5>Syntax:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001157
1158<pre>
1159 &lt; &lt;# elements&gt; x &lt;elementtype&gt; &gt;
1160</pre>
1161
John Criswell4a3327e2005-05-13 22:25:59 +00001162<p>The number of elements is a constant integer value; elementtype may
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001163be any integer or floating point type.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001164
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001165<h5>Examples:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001166
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001167<table class="layout">
1168 <tr class="layout">
1169 <td class="left">
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001170 <tt>&lt;4 x i32&gt;</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001171 <tt>&lt;8 x float&gt;</tt><br/>
Reid Spencer3e628eb92007-01-04 16:43:23 +00001172 <tt>&lt;2 x i64&gt;</tt><br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001173 </td>
1174 <td class="left">
Reid Spencer404a3252007-02-15 03:07:05 +00001175 Vector of 4 32-bit integer values.<br/>
1176 Vector of 8 floating-point values.<br/>
1177 Vector of 2 64-bit integer values.<br/>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001178 </td>
1179 </tr>
1180</table>
Misha Brukman76307852003-11-08 01:05:38 +00001181</div>
1182
Chris Lattner37b6b092005-04-25 17:34:15 +00001183<!-- _______________________________________________________________________ -->
1184<div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1185<div class="doc_text">
1186
1187<h5>Overview:</h5>
1188
1189<p>Opaque types are used to represent unknown types in the system. This
1190corresponds (for example) to the C notion of a foward declared structure type.
1191In LLVM, opaque types can eventually be resolved to any type (not just a
1192structure type).</p>
1193
1194<h5>Syntax:</h5>
1195
1196<pre>
1197 opaque
1198</pre>
1199
1200<h5>Examples:</h5>
1201
1202<table class="layout">
1203 <tr class="layout">
1204 <td class="left">
1205 <tt>opaque</tt>
1206 </td>
1207 <td class="left">
1208 An opaque type.<br/>
1209 </td>
1210 </tr>
1211</table>
1212</div>
1213
1214
Chris Lattner74d3f822004-12-09 17:30:23 +00001215<!-- *********************************************************************** -->
1216<div class="doc_section"> <a name="constants">Constants</a> </div>
1217<!-- *********************************************************************** -->
1218
1219<div class="doc_text">
1220
1221<p>LLVM has several different basic types of constants. This section describes
1222them all and their syntax.</p>
1223
1224</div>
1225
1226<!-- ======================================================================= -->
Reid Spencer8f08d802004-12-09 18:02:53 +00001227<div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001228
1229<div class="doc_text">
1230
1231<dl>
1232 <dt><b>Boolean constants</b></dt>
1233
1234 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
Reid Spencer36a15422007-01-12 03:35:51 +00001235 constants of the <tt><a href="#t_primitive">i1</a></tt> type.
Chris Lattner74d3f822004-12-09 17:30:23 +00001236 </dd>
1237
1238 <dt><b>Integer constants</b></dt>
1239
Reid Spencer8f08d802004-12-09 18:02:53 +00001240 <dd>Standard integers (such as '4') are constants of the <a
Reid Spencer3e628eb92007-01-04 16:43:23 +00001241 href="#t_integer">integer</a> type. Negative numbers may be used with
Chris Lattner74d3f822004-12-09 17:30:23 +00001242 integer types.
1243 </dd>
1244
1245 <dt><b>Floating point constants</b></dt>
1246
1247 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1248 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
Chris Lattner74d3f822004-12-09 17:30:23 +00001249 notation (see below). Floating point constants must have a <a
1250 href="#t_floating">floating point</a> type. </dd>
1251
1252 <dt><b>Null pointer constants</b></dt>
1253
John Criswelldfe6a862004-12-10 15:51:16 +00001254 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
Chris Lattner74d3f822004-12-09 17:30:23 +00001255 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1256
1257</dl>
1258
John Criswelldfe6a862004-12-10 15:51:16 +00001259<p>The one non-intuitive notation for constants is the optional hexadecimal form
Chris Lattner74d3f822004-12-09 17:30:23 +00001260of floating point constants. For example, the form '<tt>double
12610x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
12624.5e+15</tt>'. The only time hexadecimal floating point constants are required
Reid Spencer8f08d802004-12-09 18:02:53 +00001263(and the only time that they are generated by the disassembler) is when a
1264floating point constant must be emitted but it cannot be represented as a
1265decimal floating point number. For example, NaN's, infinities, and other
1266special values are represented in their IEEE hexadecimal format so that
1267assembly and disassembly do not cause any bits to change in the constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001268
1269</div>
1270
1271<!-- ======================================================================= -->
1272<div class="doc_subsection"><a name="aggregateconstants">Aggregate Constants</a>
1273</div>
1274
1275<div class="doc_text">
Chris Lattner455fc8c2005-03-07 22:13:59 +00001276<p>Aggregate constants arise from aggregation of simple constants
1277and smaller aggregate constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001278
1279<dl>
1280 <dt><b>Structure constants</b></dt>
1281
1282 <dd>Structure constants are represented with notation similar to structure
1283 type definitions (a comma separated list of elements, surrounded by braces
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001284 (<tt>{}</tt>)). For example: "<tt>{ i32 4, float 17.0, i32* %G }</tt>",
1285 where "<tt>%G</tt>" is declared as "<tt>%G = external global i32</tt>". Structure constants
Chris Lattner455fc8c2005-03-07 22:13:59 +00001286 must have <a href="#t_struct">structure type</a>, and the number and
Chris Lattner74d3f822004-12-09 17:30:23 +00001287 types of elements must match those specified by the type.
1288 </dd>
1289
1290 <dt><b>Array constants</b></dt>
1291
1292 <dd>Array constants are represented with notation similar to array type
1293 definitions (a comma separated list of elements, surrounded by square brackets
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001294 (<tt>[]</tt>)). For example: "<tt>[ i32 42, i32 11, i32 74 ]</tt>". Array
Chris Lattner74d3f822004-12-09 17:30:23 +00001295 constants must have <a href="#t_array">array type</a>, and the number and
1296 types of elements must match those specified by the type.
1297 </dd>
1298
Reid Spencer404a3252007-02-15 03:07:05 +00001299 <dt><b>Vector constants</b></dt>
Chris Lattner74d3f822004-12-09 17:30:23 +00001300
Reid Spencer404a3252007-02-15 03:07:05 +00001301 <dd>Vector constants are represented with notation similar to vector type
Chris Lattner74d3f822004-12-09 17:30:23 +00001302 definitions (a comma separated list of elements, surrounded by
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001303 less-than/greater-than's (<tt>&lt;&gt;</tt>)). For example: "<tt>&lt; i32 42,
Reid Spencer404a3252007-02-15 03:07:05 +00001304 i32 11, i32 74, i32 100 &gt;</tt>". VEctor constants must have <a
1305 href="#t_vector">vector type</a>, and the number and types of elements must
Chris Lattner74d3f822004-12-09 17:30:23 +00001306 match those specified by the type.
1307 </dd>
1308
1309 <dt><b>Zero initialization</b></dt>
1310
1311 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1312 value to zero of <em>any</em> type, including scalar and aggregate types.
1313 This is often used to avoid having to print large zero initializers (e.g. for
John Criswell4c0cf7f2005-10-24 16:17:18 +00001314 large arrays) and is always exactly equivalent to using explicit zero
Chris Lattner74d3f822004-12-09 17:30:23 +00001315 initializers.
1316 </dd>
1317</dl>
1318
1319</div>
1320
1321<!-- ======================================================================= -->
1322<div class="doc_subsection">
1323 <a name="globalconstants">Global Variable and Function Addresses</a>
1324</div>
1325
1326<div class="doc_text">
1327
1328<p>The addresses of <a href="#globalvars">global variables</a> and <a
1329href="#functionstructure">functions</a> are always implicitly valid (link-time)
John Criswelldfe6a862004-12-10 15:51:16 +00001330constants. These constants are explicitly referenced when the <a
1331href="#identifiers">identifier for the global</a> is used and always have <a
Chris Lattner74d3f822004-12-09 17:30:23 +00001332href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1333file:</p>
1334
1335<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001336 %X = global i32 17
1337 %Y = global i32 42
1338 %Z = global [2 x i32*] [ i32* %X, i32* %Y ]
Chris Lattner74d3f822004-12-09 17:30:23 +00001339</pre>
1340
1341</div>
1342
1343<!-- ======================================================================= -->
Reid Spencer641f5c92004-12-09 18:13:12 +00001344<div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001345<div class="doc_text">
Reid Spencer641f5c92004-12-09 18:13:12 +00001346 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
John Criswell4a3327e2005-05-13 22:25:59 +00001347 no specific value. Undefined values may be of any type and be used anywhere
Reid Spencer641f5c92004-12-09 18:13:12 +00001348 a constant is permitted.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001349
Reid Spencer641f5c92004-12-09 18:13:12 +00001350 <p>Undefined values indicate to the compiler that the program is well defined
1351 no matter what value is used, giving the compiler more freedom to optimize.
1352 </p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001353</div>
1354
1355<!-- ======================================================================= -->
1356<div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1357</div>
1358
1359<div class="doc_text">
1360
1361<p>Constant expressions are used to allow expressions involving other constants
1362to be used as constants. Constant expressions may be of any <a
John Criswell4a3327e2005-05-13 22:25:59 +00001363href="#t_firstclass">first class</a> type and may involve any LLVM operation
Chris Lattner74d3f822004-12-09 17:30:23 +00001364that does not have side effects (e.g. load and call are not supported). The
1365following is the syntax for constant expressions:</p>
1366
1367<dl>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001368 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1369 <dd>Truncate a constant to another type. The bit size of CST must be larger
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001370 than the bit size of TYPE. Both types must be integers.</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001371
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001372 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1373 <dd>Zero extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001374 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001375
1376 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1377 <dd>Sign extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001378 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001379
1380 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1381 <dd>Truncate a floating point constant to another floating point type. The
1382 size of CST must be larger than the size of TYPE. Both types must be
1383 floating point.</dd>
1384
1385 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1386 <dd>Floating point extend a constant to another type. The size of CST must be
1387 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1388
1389 <dt><b><tt>fp2uint ( CST to TYPE )</tt></b></dt>
1390 <dd>Convert a floating point constant to the corresponding unsigned integer
1391 constant. TYPE must be an integer type. CST must be floating point. If the
1392 value won't fit in the integer type, the results are undefined.</dd>
1393
Reid Spencer51b07252006-11-09 23:03:26 +00001394 <dt><b><tt>fptosi ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001395 <dd>Convert a floating point constant to the corresponding signed integer
1396 constant. TYPE must be an integer type. CST must be floating point. If the
1397 value won't fit in the integer type, the results are undefined.</dd>
1398
Reid Spencer51b07252006-11-09 23:03:26 +00001399 <dt><b><tt>uitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001400 <dd>Convert an unsigned integer constant to the corresponding floating point
1401 constant. TYPE must be floating point. CST must be of integer type. If the
1402 value won't fit in the floating point type, the results are undefined.</dd>
1403
Reid Spencer51b07252006-11-09 23:03:26 +00001404 <dt><b><tt>sitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001405 <dd>Convert a signed integer constant to the corresponding floating point
1406 constant. TYPE must be floating point. CST must be of integer type. If the
1407 value won't fit in the floating point type, the results are undefined.</dd>
1408
Reid Spencer5b950642006-11-11 23:08:07 +00001409 <dt><b><tt>ptrtoint ( CST to TYPE )</tt></b></dt>
1410 <dd>Convert a pointer typed constant to the corresponding integer constant
1411 TYPE must be an integer type. CST must be of pointer type. The CST value is
1412 zero extended, truncated, or unchanged to make it fit in TYPE.</dd>
1413
1414 <dt><b><tt>inttoptr ( CST to TYPE )</tt></b></dt>
1415 <dd>Convert a integer constant to a pointer constant. TYPE must be a
1416 pointer type. CST must be of integer type. The CST value is zero extended,
1417 truncated, or unchanged to make it fit in a pointer size. This one is
1418 <i>really</i> dangerous!</dd>
1419
1420 <dt><b><tt>bitcast ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001421 <dd>Convert a constant, CST, to another TYPE. The size of CST and TYPE must be
1422 identical (same number of bits). The conversion is done as if the CST value
1423 was stored to memory and read back as TYPE. In other words, no bits change
Reid Spencer5b950642006-11-11 23:08:07 +00001424 with this operator, just the type. This can be used for conversion of
Reid Spencer404a3252007-02-15 03:07:05 +00001425 vector types to any other type, as long as they have the same bit width. For
Reid Spencer5b950642006-11-11 23:08:07 +00001426 pointers it is only valid to cast to another pointer type.
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001427 </dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001428
1429 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1430
1431 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1432 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1433 instruction, the index list may have zero or more indexes, which are required
1434 to make sense for the type of "CSTPTR".</dd>
1435
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001436 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1437
1438 <dd>Perform the <a href="#i_select">select operation</a> on
Reid Spencer9965ee72006-12-04 19:23:19 +00001439 constants.</dd>
1440
1441 <dt><b><tt>icmp COND ( VAL1, VAL2 )</tt></b></dt>
1442 <dd>Performs the <a href="#i_icmp">icmp operation</a> on constants.</dd>
1443
1444 <dt><b><tt>fcmp COND ( VAL1, VAL2 )</tt></b></dt>
1445 <dd>Performs the <a href="#i_fcmp">fcmp operation</a> on constants.</dd>
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001446
1447 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1448
1449 <dd>Perform the <a href="#i_extractelement">extractelement
1450 operation</a> on constants.
1451
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001452 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1453
1454 <dd>Perform the <a href="#i_insertelement">insertelement
Reid Spencer9965ee72006-12-04 19:23:19 +00001455 operation</a> on constants.</dd>
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001456
Chris Lattner016a0e52006-04-08 00:13:41 +00001457
1458 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
1459
1460 <dd>Perform the <a href="#i_shufflevector">shufflevector
Reid Spencer9965ee72006-12-04 19:23:19 +00001461 operation</a> on constants.</dd>
Chris Lattner016a0e52006-04-08 00:13:41 +00001462
Chris Lattner74d3f822004-12-09 17:30:23 +00001463 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
1464
Reid Spencer641f5c92004-12-09 18:13:12 +00001465 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
1466 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
Chris Lattner74d3f822004-12-09 17:30:23 +00001467 binary</a> operations. The constraints on operands are the same as those for
1468 the corresponding instruction (e.g. no bitwise operations on floating point
John Criswell02fdc6f2005-05-12 16:52:32 +00001469 values are allowed).</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001470</dl>
Chris Lattner74d3f822004-12-09 17:30:23 +00001471</div>
Chris Lattnerb1652612004-03-08 16:49:10 +00001472
Chris Lattner2f7c9632001-06-06 20:29:01 +00001473<!-- *********************************************************************** -->
Chris Lattner98f013c2006-01-25 23:47:57 +00001474<div class="doc_section"> <a name="othervalues">Other Values</a> </div>
1475<!-- *********************************************************************** -->
1476
1477<!-- ======================================================================= -->
1478<div class="doc_subsection">
1479<a name="inlineasm">Inline Assembler Expressions</a>
1480</div>
1481
1482<div class="doc_text">
1483
1484<p>
1485LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
1486Module-Level Inline Assembly</a>) through the use of a special value. This
1487value represents the inline assembler as a string (containing the instructions
1488to emit), a list of operand constraints (stored as a string), and a flag that
1489indicates whether or not the inline asm expression has side effects. An example
1490inline assembler expression is:
1491</p>
1492
1493<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001494 i32 (i32) asm "bswap $0", "=r,r"
Chris Lattner98f013c2006-01-25 23:47:57 +00001495</pre>
1496
1497<p>
1498Inline assembler expressions may <b>only</b> be used as the callee operand of
1499a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
1500</p>
1501
1502<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001503 %X = call i32 asm "<a href="#i_bswap">bswap</a> $0", "=r,r"(i32 %Y)
Chris Lattner98f013c2006-01-25 23:47:57 +00001504</pre>
1505
1506<p>
1507Inline asms with side effects not visible in the constraint list must be marked
1508as having side effects. This is done through the use of the
1509'<tt>sideeffect</tt>' keyword, like so:
1510</p>
1511
1512<pre>
1513 call void asm sideeffect "eieio", ""()
1514</pre>
1515
1516<p>TODO: The format of the asm and constraints string still need to be
1517documented here. Constraints on what can be done (e.g. duplication, moving, etc
1518need to be documented).
1519</p>
1520
1521</div>
1522
1523<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001524<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
1525<!-- *********************************************************************** -->
Chris Lattner74d3f822004-12-09 17:30:23 +00001526
Misha Brukman76307852003-11-08 01:05:38 +00001527<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001528
Chris Lattner48b383b02003-11-25 01:02:51 +00001529<p>The LLVM instruction set consists of several different
1530classifications of instructions: <a href="#terminators">terminator
John Criswell4a3327e2005-05-13 22:25:59 +00001531instructions</a>, <a href="#binaryops">binary instructions</a>,
1532<a href="#bitwiseops">bitwise binary instructions</a>, <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001533 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
1534instructions</a>.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001535
Misha Brukman76307852003-11-08 01:05:38 +00001536</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001537
Chris Lattner2f7c9632001-06-06 20:29:01 +00001538<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001539<div class="doc_subsection"> <a name="terminators">Terminator
1540Instructions</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001541
Misha Brukman76307852003-11-08 01:05:38 +00001542<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001543
Chris Lattner48b383b02003-11-25 01:02:51 +00001544<p>As mentioned <a href="#functionstructure">previously</a>, every
1545basic block in a program ends with a "Terminator" instruction, which
1546indicates which block should be executed after the current block is
1547finished. These terminator instructions typically yield a '<tt>void</tt>'
1548value: they produce control flow, not values (the one exception being
1549the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
John Criswelldfe6a862004-12-10 15:51:16 +00001550<p>There are six different terminator instructions: the '<a
Chris Lattner48b383b02003-11-25 01:02:51 +00001551 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
1552instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001553the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
1554 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
1555 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001556
Misha Brukman76307852003-11-08 01:05:38 +00001557</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001558
Chris Lattner2f7c9632001-06-06 20:29:01 +00001559<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001560<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
1561Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001562<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001563<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001564<pre> ret &lt;type&gt; &lt;value&gt; <i>; Return a value from a non-void function</i>
Chris Lattner590645f2002-04-14 06:13:44 +00001565 ret void <i>; Return from void function</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001566</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001567<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001568<p>The '<tt>ret</tt>' instruction is used to return control flow (and a
John Criswell4a3327e2005-05-13 22:25:59 +00001569value) from a function back to the caller.</p>
John Criswell417228d2004-04-09 16:48:45 +00001570<p>There are two forms of the '<tt>ret</tt>' instruction: one that
Chris Lattner48b383b02003-11-25 01:02:51 +00001571returns a value and then causes control flow, and one that just causes
1572control flow to occur.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001573<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001574<p>The '<tt>ret</tt>' instruction may return any '<a
1575 href="#t_firstclass">first class</a>' type. Notice that a function is
1576not <a href="#wellformed">well formed</a> if there exists a '<tt>ret</tt>'
1577instruction inside of the function that returns a value that does not
1578match the return type of the function.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001579<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001580<p>When the '<tt>ret</tt>' instruction is executed, control flow
1581returns back to the calling function's context. If the caller is a "<a
John Criswell40db33f2004-06-25 15:16:57 +00001582 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
Chris Lattner48b383b02003-11-25 01:02:51 +00001583the instruction after the call. If the caller was an "<a
1584 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
John Criswell02fdc6f2005-05-12 16:52:32 +00001585at the beginning of the "normal" destination block. If the instruction
Chris Lattner48b383b02003-11-25 01:02:51 +00001586returns a value, that value shall set the call or invoke instruction's
1587return value.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001588<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001589<pre> ret i32 5 <i>; Return an integer value of 5</i>
Chris Lattner590645f2002-04-14 06:13:44 +00001590 ret void <i>; Return from a void function</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001591</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001592</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001593<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001594<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001595<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001596<h5>Syntax:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001597<pre> br i1 &lt;cond&gt;, label &lt;iftrue&gt;, label &lt;iffalse&gt;<br> br label &lt;dest&gt; <i>; Unconditional branch</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001598</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001599<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001600<p>The '<tt>br</tt>' instruction is used to cause control flow to
1601transfer to a different basic block in the current function. There are
1602two forms of this instruction, corresponding to a conditional branch
1603and an unconditional branch.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001604<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001605<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
Reid Spencer36a15422007-01-12 03:35:51 +00001606single '<tt>i1</tt>' value and two '<tt>label</tt>' values. The
Reid Spencer50c723a2007-02-19 23:54:10 +00001607unconditional form of the '<tt>br</tt>' instruction takes a single
1608'<tt>label</tt>' value as a target.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001609<h5>Semantics:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001610<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>i1</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00001611argument is evaluated. If the value is <tt>true</tt>, control flows
1612to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
1613control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001614<h5>Example:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001615<pre>Test:<br> %cond = <a href="#i_icmp">icmp</a> eq, i32 %a, %b<br> br i1 %cond, label %IfEqual, label %IfUnequal<br>IfEqual:<br> <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001616 href="#i_ret">ret</a> i32 1<br>IfUnequal:<br> <a href="#i_ret">ret</a> i32 0<br></pre>
Misha Brukman76307852003-11-08 01:05:38 +00001617</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001618<!-- _______________________________________________________________________ -->
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001619<div class="doc_subsubsection">
1620 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
1621</div>
1622
Misha Brukman76307852003-11-08 01:05:38 +00001623<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001624<h5>Syntax:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001625
1626<pre>
1627 switch &lt;intty&gt; &lt;value&gt;, label &lt;defaultdest&gt; [ &lt;intty&gt; &lt;val&gt;, label &lt;dest&gt; ... ]
1628</pre>
1629
Chris Lattner2f7c9632001-06-06 20:29:01 +00001630<h5>Overview:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001631
1632<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
1633several different places. It is a generalization of the '<tt>br</tt>'
Misha Brukman76307852003-11-08 01:05:38 +00001634instruction, allowing a branch to occur to one of many possible
1635destinations.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001636
1637
Chris Lattner2f7c9632001-06-06 20:29:01 +00001638<h5>Arguments:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001639
1640<p>The '<tt>switch</tt>' instruction uses three parameters: an integer
1641comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
1642an array of pairs of comparison value constants and '<tt>label</tt>'s. The
1643table is not allowed to contain duplicate constant entries.</p>
1644
Chris Lattner2f7c9632001-06-06 20:29:01 +00001645<h5>Semantics:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001646
Chris Lattner48b383b02003-11-25 01:02:51 +00001647<p>The <tt>switch</tt> instruction specifies a table of values and
1648destinations. When the '<tt>switch</tt>' instruction is executed, this
John Criswellbcbb18c2004-06-25 16:05:06 +00001649table is searched for the given value. If the value is found, control flow is
1650transfered to the corresponding destination; otherwise, control flow is
1651transfered to the default destination.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001652
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001653<h5>Implementation:</h5>
1654
1655<p>Depending on properties of the target machine and the particular
1656<tt>switch</tt> instruction, this instruction may be code generated in different
John Criswellbcbb18c2004-06-25 16:05:06 +00001657ways. For example, it could be generated as a series of chained conditional
1658branches or with a lookup table.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001659
1660<h5>Example:</h5>
1661
1662<pre>
1663 <i>; Emulate a conditional br instruction</i>
Reid Spencer36a15422007-01-12 03:35:51 +00001664 %Val = <a href="#i_zext">zext</a> i1 %value to i32
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001665 switch i32 %Val, label %truedest [i32 0, label %falsedest ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001666
1667 <i>; Emulate an unconditional br instruction</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001668 switch i32 0, label %dest [ ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001669
1670 <i>; Implement a jump table:</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001671 switch i32 %val, label %otherwise [ i32 0, label %onzero
1672 i32 1, label %onone
1673 i32 2, label %ontwo ]
Chris Lattner2f7c9632001-06-06 20:29:01 +00001674</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001675</div>
Chris Lattner0132aff2005-05-06 22:57:40 +00001676
Chris Lattner2f7c9632001-06-06 20:29:01 +00001677<!-- _______________________________________________________________________ -->
Chris Lattner0132aff2005-05-06 22:57:40 +00001678<div class="doc_subsubsection">
1679 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
1680</div>
1681
Misha Brukman76307852003-11-08 01:05:38 +00001682<div class="doc_text">
Chris Lattner0132aff2005-05-06 22:57:40 +00001683
Chris Lattner2f7c9632001-06-06 20:29:01 +00001684<h5>Syntax:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001685
1686<pre>
1687 &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 Lattner6b7a0082006-05-14 18:23:06 +00001688 to label &lt;normal label&gt; unwind label &lt;exception label&gt;
Chris Lattner0132aff2005-05-06 22:57:40 +00001689</pre>
1690
Chris Lattnera8292f32002-05-06 22:08:29 +00001691<h5>Overview:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001692
1693<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
1694function, with the possibility of control flow transfer to either the
John Criswell02fdc6f2005-05-12 16:52:32 +00001695'<tt>normal</tt>' label or the
1696'<tt>exception</tt>' label. If the callee function returns with the
Chris Lattner0132aff2005-05-06 22:57:40 +00001697"<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
1698"normal" label. If the callee (or any indirect callees) returns with the "<a
John Criswell02fdc6f2005-05-12 16:52:32 +00001699href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
1700continued at the dynamically nearest "exception" label.</p>
Chris Lattner0132aff2005-05-06 22:57:40 +00001701
Chris Lattner2f7c9632001-06-06 20:29:01 +00001702<h5>Arguments:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001703
Misha Brukman76307852003-11-08 01:05:38 +00001704<p>This instruction requires several arguments:</p>
Chris Lattner0132aff2005-05-06 22:57:40 +00001705
Chris Lattner2f7c9632001-06-06 20:29:01 +00001706<ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00001707 <li>
John Criswell4a3327e2005-05-13 22:25:59 +00001708 The optional "cconv" marker indicates which <a href="callingconv">calling
Chris Lattner0132aff2005-05-06 22:57:40 +00001709 convention</a> the call should use. If none is specified, the call defaults
1710 to using C calling conventions.
1711 </li>
1712 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
1713 function value being invoked. In most cases, this is a direct function
1714 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
1715 an arbitrary pointer to function value.
1716 </li>
1717
1718 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
1719 function to be invoked. </li>
1720
1721 <li>'<tt>function args</tt>': argument list whose types match the function
1722 signature argument types. If the function signature indicates the function
1723 accepts a variable number of arguments, the extra arguments can be
1724 specified. </li>
1725
1726 <li>'<tt>normal label</tt>': the label reached when the called function
1727 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
1728
1729 <li>'<tt>exception label</tt>': the label reached when a callee returns with
1730 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
1731
Chris Lattner2f7c9632001-06-06 20:29:01 +00001732</ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00001733
Chris Lattner2f7c9632001-06-06 20:29:01 +00001734<h5>Semantics:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001735
Misha Brukman76307852003-11-08 01:05:38 +00001736<p>This instruction is designed to operate as a standard '<tt><a
Chris Lattner0132aff2005-05-06 22:57:40 +00001737href="#i_call">call</a></tt>' instruction in most regards. The primary
1738difference is that it establishes an association with a label, which is used by
1739the runtime library to unwind the stack.</p>
1740
1741<p>This instruction is used in languages with destructors to ensure that proper
1742cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
1743exception. Additionally, this is important for implementation of
1744'<tt>catch</tt>' clauses in high-level languages that support them.</p>
1745
Chris Lattner2f7c9632001-06-06 20:29:01 +00001746<h5>Example:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001747<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001748 %retval = invoke i32 %Test(i32 15) to label %Continue
1749 unwind label %TestCleanup <i>; {i32}:retval set</i>
1750 %retval = invoke <a href="#callingconv">coldcc</a> i32 %Test(i32 15) to label %Continue
1751 unwind label %TestCleanup <i>; {i32}:retval set</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001752</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001753</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001754
1755
Chris Lattner5ed60612003-09-03 00:41:47 +00001756<!-- _______________________________________________________________________ -->
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001757
Chris Lattner48b383b02003-11-25 01:02:51 +00001758<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
1759Instruction</a> </div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001760
Misha Brukman76307852003-11-08 01:05:38 +00001761<div class="doc_text">
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001762
Chris Lattner5ed60612003-09-03 00:41:47 +00001763<h5>Syntax:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001764<pre>
1765 unwind
1766</pre>
1767
Chris Lattner5ed60612003-09-03 00:41:47 +00001768<h5>Overview:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001769
1770<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
1771at the first callee in the dynamic call stack which used an <a
1772href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
1773primarily used to implement exception handling.</p>
1774
Chris Lattner5ed60612003-09-03 00:41:47 +00001775<h5>Semantics:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001776
1777<p>The '<tt>unwind</tt>' intrinsic causes execution of the current function to
1778immediately halt. The dynamic call stack is then searched for the first <a
1779href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
1780execution continues at the "exceptional" destination block specified by the
1781<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
1782dynamic call chain, undefined behavior results.</p>
Misha Brukman76307852003-11-08 01:05:38 +00001783</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001784
1785<!-- _______________________________________________________________________ -->
1786
1787<div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
1788Instruction</a> </div>
1789
1790<div class="doc_text">
1791
1792<h5>Syntax:</h5>
1793<pre>
1794 unreachable
1795</pre>
1796
1797<h5>Overview:</h5>
1798
1799<p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
1800instruction is used to inform the optimizer that a particular portion of the
1801code is not reachable. This can be used to indicate that the code after a
1802no-return function cannot be reached, and other facts.</p>
1803
1804<h5>Semantics:</h5>
1805
1806<p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
1807</div>
1808
1809
1810
Chris Lattner2f7c9632001-06-06 20:29:01 +00001811<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001812<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001813<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +00001814<p>Binary operators are used to do most of the computation in a
1815program. They require two operands, execute an operation on them, and
John Criswelldfe6a862004-12-10 15:51:16 +00001816produce a single value. The operands might represent
Reid Spencer404a3252007-02-15 03:07:05 +00001817multiple data, as is the case with the <a href="#t_vector">vector</a> data type.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001818The result value of a binary operator is not
Chris Lattner48b383b02003-11-25 01:02:51 +00001819necessarily the same type as its operands.</p>
Misha Brukman76307852003-11-08 01:05:38 +00001820<p>There are several different binary operators:</p>
Misha Brukman76307852003-11-08 01:05:38 +00001821</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001822<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001823<div class="doc_subsubsection"> <a name="i_add">'<tt>add</tt>'
1824Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001825<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001826<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001827<pre> &lt;result&gt; = add &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001828</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001829<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001830<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001831<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001832<p>The two arguments to the '<tt>add</tt>' instruction must be either <a
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001833 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a> values.
Reid Spencer404a3252007-02-15 03:07:05 +00001834 This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001835Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001836<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001837<p>The value produced is the integer or floating point sum of the two
1838operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001839<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001840<pre> &lt;result&gt; = add i32 4, %var <i>; yields {i32}:result = 4 + %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001841</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001842</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001843<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001844<div class="doc_subsubsection"> <a name="i_sub">'<tt>sub</tt>'
1845Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001846<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001847<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001848<pre> &lt;result&gt; = sub &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001849</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001850<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001851<p>The '<tt>sub</tt>' instruction returns the difference of its two
1852operands.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00001853<p>Note that the '<tt>sub</tt>' instruction is used to represent the '<tt>neg</tt>'
1854instruction present in most other intermediate representations.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001855<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001856<p>The two arguments to the '<tt>sub</tt>' instruction must be either <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001857 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001858values.
Reid Spencer404a3252007-02-15 03:07:05 +00001859This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001860Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001861<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001862<p>The value produced is the integer or floating point difference of
1863the two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001864<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001865<pre> &lt;result&gt; = sub i32 4, %var <i>; yields {i32}:result = 4 - %var</i>
1866 &lt;result&gt; = sub i32 0, %val <i>; yields {i32}:result = -%var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001867</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001868</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001869<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001870<div class="doc_subsubsection"> <a name="i_mul">'<tt>mul</tt>'
1871Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001872<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001873<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001874<pre> &lt;result&gt; = mul &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001875</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001876<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001877<p>The '<tt>mul</tt>' instruction returns the product of its two
1878operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001879<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00001880<p>The two arguments to the '<tt>mul</tt>' instruction must be either <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001881 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001882values.
Reid Spencer404a3252007-02-15 03:07:05 +00001883This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001884Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001885<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001886<p>The value produced is the integer or floating point product of the
Misha Brukman76307852003-11-08 01:05:38 +00001887two operands.</p>
Reid Spencer3e628eb92007-01-04 16:43:23 +00001888<p>Because the operands are the same width, the result of an integer
1889multiplication is the same whether the operands should be deemed unsigned or
1890signed.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001891<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001892<pre> &lt;result&gt; = mul i32 4, %var <i>; yields {i32}:result = 4 * %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001893</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001894</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001895<!-- _______________________________________________________________________ -->
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001896<div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
1897</a></div>
1898<div class="doc_text">
1899<h5>Syntax:</h5>
1900<pre> &lt;result&gt; = udiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
1901</pre>
1902<h5>Overview:</h5>
1903<p>The '<tt>udiv</tt>' instruction returns the quotient of its two
1904operands.</p>
1905<h5>Arguments:</h5>
1906<p>The two arguments to the '<tt>udiv</tt>' instruction must be
1907<a href="#t_integer">integer</a> values. Both arguments must have identical
Reid Spencer404a3252007-02-15 03:07:05 +00001908types. This instruction can also take <a href="#t_vector">vector</a> versions
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001909of the values in which case the elements must be integers.</p>
1910<h5>Semantics:</h5>
1911<p>The value produced is the unsigned integer quotient of the two operands. This
1912instruction always performs an unsigned division operation, regardless of
1913whether the arguments are unsigned or not.</p>
1914<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001915<pre> &lt;result&gt; = udiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001916</pre>
1917</div>
1918<!-- _______________________________________________________________________ -->
1919<div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
1920</a> </div>
1921<div class="doc_text">
1922<h5>Syntax:</h5>
1923<pre> &lt;result&gt; = sdiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
1924</pre>
1925<h5>Overview:</h5>
1926<p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
1927operands.</p>
1928<h5>Arguments:</h5>
1929<p>The two arguments to the '<tt>sdiv</tt>' instruction must be
1930<a href="#t_integer">integer</a> values. Both arguments must have identical
Reid Spencer404a3252007-02-15 03:07:05 +00001931types. This instruction can also take <a href="#t_vector">vector</a> versions
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001932of the values in which case the elements must be integers.</p>
1933<h5>Semantics:</h5>
1934<p>The value produced is the signed integer quotient of the two operands. This
1935instruction always performs a signed division operation, regardless of whether
1936the arguments are signed or not.</p>
1937<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001938<pre> &lt;result&gt; = sdiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001939</pre>
1940</div>
1941<!-- _______________________________________________________________________ -->
1942<div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00001943Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001944<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001945<h5>Syntax:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001946<pre> &lt;result&gt; = fdiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00001947</pre>
1948<h5>Overview:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001949<p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
Chris Lattner48b383b02003-11-25 01:02:51 +00001950operands.</p>
1951<h5>Arguments:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001952<p>The two arguments to the '<tt>div</tt>' instruction must be
1953<a href="#t_floating">floating point</a> values. Both arguments must have
Reid Spencer404a3252007-02-15 03:07:05 +00001954identical types. This instruction can also take <a href="#t_vector">vector</a>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001955versions of the values in which case the elements must be floating point.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00001956<h5>Semantics:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001957<p>The value produced is the floating point quotient of the two operands.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00001958<h5>Example:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00001959<pre> &lt;result&gt; = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00001960</pre>
1961</div>
1962<!-- _______________________________________________________________________ -->
Reid Spencer7eb55b32006-11-02 01:53:59 +00001963<div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
1964</div>
1965<div class="doc_text">
1966<h5>Syntax:</h5>
1967<pre> &lt;result&gt; = urem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
1968</pre>
1969<h5>Overview:</h5>
1970<p>The '<tt>urem</tt>' instruction returns the remainder from the
1971unsigned division of its two arguments.</p>
1972<h5>Arguments:</h5>
1973<p>The two arguments to the '<tt>urem</tt>' instruction must be
1974<a href="#t_integer">integer</a> values. Both arguments must have identical
1975types.</p>
1976<h5>Semantics:</h5>
1977<p>This instruction returns the unsigned integer <i>remainder</i> of a division.
1978This instruction always performs an unsigned division to get the remainder,
1979regardless of whether the arguments are unsigned or not.</p>
1980<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001981<pre> &lt;result&gt; = urem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00001982</pre>
1983
1984</div>
1985<!-- _______________________________________________________________________ -->
1986<div class="doc_subsubsection"> <a name="i_srem">'<tt>srem</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00001987Instruction</a> </div>
1988<div class="doc_text">
1989<h5>Syntax:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00001990<pre> &lt;result&gt; = srem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00001991</pre>
1992<h5>Overview:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00001993<p>The '<tt>srem</tt>' instruction returns the remainder from the
1994signed division of its two operands.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00001995<h5>Arguments:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00001996<p>The two arguments to the '<tt>srem</tt>' instruction must be
1997<a href="#t_integer">integer</a> values. Both arguments must have identical
1998types.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00001999<h5>Semantics:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002000<p>This instruction returns the <i>remainder</i> of a division (where the result
Chris Lattner48b383b02003-11-25 01:02:51 +00002001has the same sign as the divisor), not the <i>modulus</i> (where the
2002result has the same sign as the dividend) of a value. For more
John Criswell4c0cf7f2005-10-24 16:17:18 +00002003information about the difference, see <a
Chris Lattner48b383b02003-11-25 01:02:51 +00002004 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
2005Math Forum</a>.</p>
2006<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002007<pre> &lt;result&gt; = srem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002008</pre>
2009
2010</div>
2011<!-- _______________________________________________________________________ -->
2012<div class="doc_subsubsection"> <a name="i_frem">'<tt>frem</tt>'
2013Instruction</a> </div>
2014<div class="doc_text">
2015<h5>Syntax:</h5>
2016<pre> &lt;result&gt; = frem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2017</pre>
2018<h5>Overview:</h5>
2019<p>The '<tt>frem</tt>' instruction returns the remainder from the
2020division of its two operands.</p>
2021<h5>Arguments:</h5>
2022<p>The two arguments to the '<tt>frem</tt>' instruction must be
2023<a href="#t_floating">floating point</a> values. Both arguments must have
2024identical types.</p>
2025<h5>Semantics:</h5>
2026<p>This instruction returns the <i>remainder</i> of a division.</p>
2027<h5>Example:</h5>
2028<pre> &lt;result&gt; = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002029</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002030</div>
Robert Bocchino820bc75b2006-02-17 21:18:08 +00002031
Reid Spencer2ab01932007-02-02 13:57:07 +00002032<!-- ======================================================================= -->
2033<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
2034Operations</a> </div>
2035<div class="doc_text">
2036<p>Bitwise binary operators are used to do various forms of
2037bit-twiddling in a program. They are generally very efficient
2038instructions and can commonly be strength reduced from other
2039instructions. They require two operands, execute an operation on them,
2040and produce a single value. The resulting value of the bitwise binary
2041operators is always the same type as its first operand.</p>
2042</div>
2043
Reid Spencer04e259b2007-01-31 21:39:12 +00002044<!-- _______________________________________________________________________ -->
2045<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2046Instruction</a> </div>
2047<div class="doc_text">
2048<h5>Syntax:</h5>
2049<pre> &lt;result&gt; = shl &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2050</pre>
2051<h5>Overview:</h5>
2052<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2053the left a specified number of bits.</p>
2054<h5>Arguments:</h5>
2055<p>Both arguments to the '<tt>shl</tt>' instruction must be the same <a
2056 href="#t_integer">integer</a> type.</p>
2057<h5>Semantics:</h5>
2058<p>The value produced is <tt>var1</tt> * 2<sup><tt>var2</tt></sup>.</p>
2059<h5>Example:</h5><pre>
2060 &lt;result&gt; = shl i32 4, %var <i>; yields {i32}: 4 &lt;&lt; %var</i>
2061 &lt;result&gt; = shl i32 4, 2 <i>; yields {i32}: 16</i>
2062 &lt;result&gt; = shl i32 1, 10 <i>; yields {i32}: 1024</i>
2063</pre>
2064</div>
2065<!-- _______________________________________________________________________ -->
2066<div class="doc_subsubsection"> <a name="i_lshr">'<tt>lshr</tt>'
2067Instruction</a> </div>
2068<div class="doc_text">
2069<h5>Syntax:</h5>
2070<pre> &lt;result&gt; = lshr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2071</pre>
2072
2073<h5>Overview:</h5>
2074<p>The '<tt>lshr</tt>' instruction (logical shift right) returns the first
2075operand shifted to the right a specified number of bits.</p>
2076
2077<h5>Arguments:</h5>
2078<p>Both arguments to the '<tt>lshr</tt>' instruction must be the same
2079<a href="#t_integer">integer</a> type.</p>
2080
2081<h5>Semantics:</h5>
2082<p>This instruction always performs a logical shift right operation. The most
2083significant bits of the result will be filled with zero bits after the
2084shift.</p>
2085
2086<h5>Example:</h5>
2087<pre>
2088 &lt;result&gt; = lshr i32 4, 1 <i>; yields {i32}:result = 2</i>
2089 &lt;result&gt; = lshr i32 4, 2 <i>; yields {i32}:result = 1</i>
2090 &lt;result&gt; = lshr i8 4, 3 <i>; yields {i8}:result = 0</i>
2091 &lt;result&gt; = lshr i8 -2, 1 <i>; yields {i8}:result = 0x7FFFFFFF </i>
2092</pre>
2093</div>
2094
Reid Spencer2ab01932007-02-02 13:57:07 +00002095<!-- _______________________________________________________________________ -->
Reid Spencer04e259b2007-01-31 21:39:12 +00002096<div class="doc_subsubsection"> <a name="i_ashr">'<tt>ashr</tt>'
2097Instruction</a> </div>
2098<div class="doc_text">
2099
2100<h5>Syntax:</h5>
2101<pre> &lt;result&gt; = ashr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2102</pre>
2103
2104<h5>Overview:</h5>
2105<p>The '<tt>ashr</tt>' instruction (arithmetic shift right) returns the first
2106operand shifted to the right a specified number of bits.</p>
2107
2108<h5>Arguments:</h5>
2109<p>Both arguments to the '<tt>ashr</tt>' instruction must be the same
2110<a href="#t_integer">integer</a> type.</p>
2111
2112<h5>Semantics:</h5>
2113<p>This instruction always performs an arithmetic shift right operation,
2114The most significant bits of the result will be filled with the sign bit
2115of <tt>var1</tt>.</p>
2116
2117<h5>Example:</h5>
2118<pre>
2119 &lt;result&gt; = ashr i32 4, 1 <i>; yields {i32}:result = 2</i>
2120 &lt;result&gt; = ashr i32 4, 2 <i>; yields {i32}:result = 1</i>
2121 &lt;result&gt; = ashr i8 4, 3 <i>; yields {i8}:result = 0</i>
2122 &lt;result&gt; = ashr i8 -2, 1 <i>; yields {i8}:result = -1</i>
2123</pre>
2124</div>
2125
Chris Lattner2f7c9632001-06-06 20:29:01 +00002126<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002127<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
2128Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002129<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002130<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002131<pre> &lt;result&gt; = and &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002132</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002133<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002134<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
2135its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002136<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002137<p>The two arguments to the '<tt>and</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002138 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002139identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002140<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002141<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002142<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002143<div style="align: center">
Misha Brukman76307852003-11-08 01:05:38 +00002144<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +00002145 <tbody>
2146 <tr>
2147 <td>In0</td>
2148 <td>In1</td>
2149 <td>Out</td>
2150 </tr>
2151 <tr>
2152 <td>0</td>
2153 <td>0</td>
2154 <td>0</td>
2155 </tr>
2156 <tr>
2157 <td>0</td>
2158 <td>1</td>
2159 <td>0</td>
2160 </tr>
2161 <tr>
2162 <td>1</td>
2163 <td>0</td>
2164 <td>0</td>
2165 </tr>
2166 <tr>
2167 <td>1</td>
2168 <td>1</td>
2169 <td>1</td>
2170 </tr>
2171 </tbody>
2172</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002173</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002174<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002175<pre> &lt;result&gt; = and i32 4, %var <i>; yields {i32}:result = 4 &amp; %var</i>
2176 &lt;result&gt; = and i32 15, 40 <i>; yields {i32}:result = 8</i>
2177 &lt;result&gt; = and i32 4, 8 <i>; yields {i32}:result = 0</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002178</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002179</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002180<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002181<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002182<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002183<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002184<pre> &lt;result&gt; = or &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002185</pre>
Chris Lattner48b383b02003-11-25 01:02:51 +00002186<h5>Overview:</h5>
2187<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
2188or of its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002189<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002190<p>The two arguments to the '<tt>or</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002191 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002192identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002193<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002194<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002195<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002196<div style="align: center">
Chris Lattner48b383b02003-11-25 01:02:51 +00002197<table border="1" cellspacing="0" cellpadding="4">
2198 <tbody>
2199 <tr>
2200 <td>In0</td>
2201 <td>In1</td>
2202 <td>Out</td>
2203 </tr>
2204 <tr>
2205 <td>0</td>
2206 <td>0</td>
2207 <td>0</td>
2208 </tr>
2209 <tr>
2210 <td>0</td>
2211 <td>1</td>
2212 <td>1</td>
2213 </tr>
2214 <tr>
2215 <td>1</td>
2216 <td>0</td>
2217 <td>1</td>
2218 </tr>
2219 <tr>
2220 <td>1</td>
2221 <td>1</td>
2222 <td>1</td>
2223 </tr>
2224 </tbody>
2225</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002226</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002227<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002228<pre> &lt;result&gt; = or i32 4, %var <i>; yields {i32}:result = 4 | %var</i>
2229 &lt;result&gt; = or i32 15, 40 <i>; yields {i32}:result = 47</i>
2230 &lt;result&gt; = or i32 4, 8 <i>; yields {i32}:result = 12</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002231</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002232</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002233<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002234<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
2235Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002236<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002237<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002238<pre> &lt;result&gt; = xor &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002239</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002240<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002241<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2242or of its two operands. The <tt>xor</tt> is used to implement the
2243"one's complement" operation, which is the "~" operator in C.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002244<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002245<p>The two arguments to the '<tt>xor</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002246 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002247identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002248<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002249<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002250<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002251<div style="align: center">
Chris Lattner48b383b02003-11-25 01:02:51 +00002252<table border="1" cellspacing="0" cellpadding="4">
2253 <tbody>
2254 <tr>
2255 <td>In0</td>
2256 <td>In1</td>
2257 <td>Out</td>
2258 </tr>
2259 <tr>
2260 <td>0</td>
2261 <td>0</td>
2262 <td>0</td>
2263 </tr>
2264 <tr>
2265 <td>0</td>
2266 <td>1</td>
2267 <td>1</td>
2268 </tr>
2269 <tr>
2270 <td>1</td>
2271 <td>0</td>
2272 <td>1</td>
2273 </tr>
2274 <tr>
2275 <td>1</td>
2276 <td>1</td>
2277 <td>0</td>
2278 </tr>
2279 </tbody>
2280</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002281</div>
Chris Lattner48b383b02003-11-25 01:02:51 +00002282<p> </p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002283<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002284<pre> &lt;result&gt; = xor i32 4, %var <i>; yields {i32}:result = 4 ^ %var</i>
2285 &lt;result&gt; = xor i32 15, 40 <i>; yields {i32}:result = 39</i>
2286 &lt;result&gt; = xor i32 4, 8 <i>; yields {i32}:result = 12</i>
2287 &lt;result&gt; = xor i32 %V, -1 <i>; yields {i32}:result = ~%V</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002288</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002289</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002290
Chris Lattner2f7c9632001-06-06 20:29:01 +00002291<!-- ======================================================================= -->
Chris Lattner54611b42005-11-06 08:02:57 +00002292<div class="doc_subsection">
Chris Lattnerce83bff2006-04-08 23:07:04 +00002293 <a name="vectorops">Vector Operations</a>
2294</div>
2295
2296<div class="doc_text">
2297
2298<p>LLVM supports several instructions to represent vector operations in a
2299target-independent manner. This instructions cover the element-access and
2300vector-specific operations needed to process vectors effectively. While LLVM
2301does directly support these vector operations, many sophisticated algorithms
2302will want to use target-specific intrinsics to take full advantage of a specific
2303target.</p>
2304
2305</div>
2306
2307<!-- _______________________________________________________________________ -->
2308<div class="doc_subsubsection">
2309 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
2310</div>
2311
2312<div class="doc_text">
2313
2314<h5>Syntax:</h5>
2315
2316<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002317 &lt;result&gt; = extractelement &lt;n x &lt;ty&gt;&gt; &lt;val&gt;, i32 &lt;idx&gt; <i>; yields &lt;ty&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002318</pre>
2319
2320<h5>Overview:</h5>
2321
2322<p>
2323The '<tt>extractelement</tt>' instruction extracts a single scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002324element from a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002325</p>
2326
2327
2328<h5>Arguments:</h5>
2329
2330<p>
2331The first operand of an '<tt>extractelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002332value of <a href="#t_vector">vector</a> type. The second operand is
Chris Lattnerce83bff2006-04-08 23:07:04 +00002333an index indicating the position from which to extract the element.
2334The index may be a variable.</p>
2335
2336<h5>Semantics:</h5>
2337
2338<p>
2339The result is a scalar of the same type as the element type of
2340<tt>val</tt>. Its value is the value at position <tt>idx</tt> of
2341<tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
2342results are undefined.
2343</p>
2344
2345<h5>Example:</h5>
2346
2347<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002348 %result = extractelement &lt;4 x i32&gt; %vec, i32 0 <i>; yields i32</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002349</pre>
2350</div>
2351
2352
2353<!-- _______________________________________________________________________ -->
2354<div class="doc_subsubsection">
2355 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
2356</div>
2357
2358<div class="doc_text">
2359
2360<h5>Syntax:</h5>
2361
2362<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002363 &lt;result&gt; = insertelement &lt;n x &lt;ty&gt;&gt; &lt;val&gt;, &lt;ty&gt; &lt;elt&gt, i32 &lt;idx&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002364</pre>
2365
2366<h5>Overview:</h5>
2367
2368<p>
2369The '<tt>insertelement</tt>' instruction inserts a scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002370element into a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002371</p>
2372
2373
2374<h5>Arguments:</h5>
2375
2376<p>
2377The first operand of an '<tt>insertelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002378value of <a href="#t_vector">vector</a> type. The second operand is a
Chris Lattnerce83bff2006-04-08 23:07:04 +00002379scalar value whose type must equal the element type of the first
2380operand. The third operand is an index indicating the position at
2381which to insert the value. The index may be a variable.</p>
2382
2383<h5>Semantics:</h5>
2384
2385<p>
Reid Spencer404a3252007-02-15 03:07:05 +00002386The result is a vector of the same type as <tt>val</tt>. Its
Chris Lattnerce83bff2006-04-08 23:07:04 +00002387element values are those of <tt>val</tt> except at position
2388<tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
2389exceeds the length of <tt>val</tt>, the results are undefined.
2390</p>
2391
2392<h5>Example:</h5>
2393
2394<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002395 %result = insertelement &lt;4 x i32&gt; %vec, i32 1, i32 0 <i>; yields &lt;4 x i32&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002396</pre>
2397</div>
2398
2399<!-- _______________________________________________________________________ -->
2400<div class="doc_subsubsection">
2401 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
2402</div>
2403
2404<div class="doc_text">
2405
2406<h5>Syntax:</h5>
2407
2408<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002409 &lt;result&gt; = shufflevector &lt;n x &lt;ty&gt;&gt; &lt;v1&gt;, &lt;n x &lt;ty&gt;&gt; &lt;v2&gt;, &lt;n x i32&gt; &lt;mask&gt; <i>; yields &lt;n x &lt;ty&gt;&gt;</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002410</pre>
2411
2412<h5>Overview:</h5>
2413
2414<p>
2415The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
2416from two input vectors, returning a vector of the same type.
2417</p>
2418
2419<h5>Arguments:</h5>
2420
2421<p>
2422The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
2423with types that match each other and types that match the result of the
2424instruction. The third argument is a shuffle mask, which has the same number
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002425of elements as the other vector type, but whose element type is always 'i32'.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002426</p>
2427
2428<p>
2429The shuffle mask operand is required to be a constant vector with either
2430constant integer or undef values.
2431</p>
2432
2433<h5>Semantics:</h5>
2434
2435<p>
2436The elements of the two input vectors are numbered from left to right across
2437both of the vectors. The shuffle mask operand specifies, for each element of
2438the result vector, which element of the two input registers the result element
2439gets. The element selector may be undef (meaning "don't care") and the second
2440operand may be undef if performing a shuffle from only one vector.
2441</p>
2442
2443<h5>Example:</h5>
2444
2445<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002446 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
2447 &lt;4 x i32&gt; &lt;i32 0, i32 4, i32 1, i32 5&gt; <i>; yields &lt;4 x i32&gt;</i>
2448 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; undef,
2449 &lt;4 x i32&gt; &lt;i32 0, i32 1, i32 2, i32 3&gt; <i>; yields &lt;4 x i32&gt;</i> - Identity shuffle.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002450</pre>
2451</div>
2452
Tanya Lattnerb138bbe2006-04-14 19:24:33 +00002453
Chris Lattnerce83bff2006-04-08 23:07:04 +00002454<!-- ======================================================================= -->
2455<div class="doc_subsection">
Chris Lattner6ab66722006-08-15 00:45:58 +00002456 <a name="memoryops">Memory Access and Addressing Operations</a>
Chris Lattner54611b42005-11-06 08:02:57 +00002457</div>
2458
Misha Brukman76307852003-11-08 01:05:38 +00002459<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002460
Chris Lattner48b383b02003-11-25 01:02:51 +00002461<p>A key design point of an SSA-based representation is how it
2462represents memory. In LLVM, no memory locations are in SSA form, which
2463makes things very simple. This section describes how to read, write,
John Criswelldfe6a862004-12-10 15:51:16 +00002464allocate, and free memory in LLVM.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002465
Misha Brukman76307852003-11-08 01:05:38 +00002466</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002467
Chris Lattner2f7c9632001-06-06 20:29:01 +00002468<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002469<div class="doc_subsubsection">
2470 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
2471</div>
2472
Misha Brukman76307852003-11-08 01:05:38 +00002473<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002474
Chris Lattner2f7c9632001-06-06 20:29:01 +00002475<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002476
2477<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002478 &lt;result&gt; = malloc &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002479</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002480
Chris Lattner2f7c9632001-06-06 20:29:01 +00002481<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002482
Chris Lattner48b383b02003-11-25 01:02:51 +00002483<p>The '<tt>malloc</tt>' instruction allocates memory from the system
2484heap and returns a pointer to it.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002485
Chris Lattner2f7c9632001-06-06 20:29:01 +00002486<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002487
2488<p>The '<tt>malloc</tt>' instruction allocates
2489<tt>sizeof(&lt;type&gt;)*NumElements</tt>
John Criswella92e5862004-02-24 16:13:56 +00002490bytes of memory from the operating system and returns a pointer of the
Chris Lattner54611b42005-11-06 08:02:57 +00002491appropriate type to the program. If "NumElements" is specified, it is the
2492number of elements allocated. If an alignment is specified, the value result
2493of the allocation is guaranteed to be aligned to at least that boundary. If
2494not specified, or if zero, the target can choose to align the allocation on any
2495convenient boundary.</p>
2496
Misha Brukman76307852003-11-08 01:05:38 +00002497<p>'<tt>type</tt>' must be a sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002498
Chris Lattner2f7c9632001-06-06 20:29:01 +00002499<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002500
Chris Lattner48b383b02003-11-25 01:02:51 +00002501<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
2502a pointer is returned.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002503
Chris Lattner54611b42005-11-06 08:02:57 +00002504<h5>Example:</h5>
2505
2506<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002507 %array = malloc [4 x i8 ] <i>; yields {[%4 x i8]*}:array</i>
Chris Lattner54611b42005-11-06 08:02:57 +00002508
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002509 %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
2510 %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>
2511 %array2 = malloc [12 x i8], i32 %size <i>; yields {[12 x i8]*}:array2</i>
2512 %array3 = malloc i32, i32 4, align 1024 <i>; yields {i32*}:array3</i>
2513 %array4 = malloc i32, align 1024 <i>; yields {i32*}:array4</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002514</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002515</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002516
Chris Lattner2f7c9632001-06-06 20:29:01 +00002517<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002518<div class="doc_subsubsection">
2519 <a name="i_free">'<tt>free</tt>' Instruction</a>
2520</div>
2521
Misha Brukman76307852003-11-08 01:05:38 +00002522<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002523
Chris Lattner2f7c9632001-06-06 20:29:01 +00002524<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002525
2526<pre>
2527 free &lt;type&gt; &lt;value&gt; <i>; yields {void}</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002528</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002529
Chris Lattner2f7c9632001-06-06 20:29:01 +00002530<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002531
Chris Lattner48b383b02003-11-25 01:02:51 +00002532<p>The '<tt>free</tt>' instruction returns memory back to the unused
John Criswell4a3327e2005-05-13 22:25:59 +00002533memory heap to be reallocated in the future.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002534
Chris Lattner2f7c9632001-06-06 20:29:01 +00002535<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002536
Chris Lattner48b383b02003-11-25 01:02:51 +00002537<p>'<tt>value</tt>' shall be a pointer value that points to a value
2538that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
2539instruction.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002540
Chris Lattner2f7c9632001-06-06 20:29:01 +00002541<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002542
John Criswelldfe6a862004-12-10 15:51:16 +00002543<p>Access to the memory pointed to by the pointer is no longer defined
Chris Lattner48b383b02003-11-25 01:02:51 +00002544after this instruction executes.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002545
Chris Lattner2f7c9632001-06-06 20:29:01 +00002546<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002547
2548<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002549 %array = <a href="#i_malloc">malloc</a> [4 x i8] <i>; yields {[4 x i8]*}:array</i>
2550 free [4 x i8]* %array
Chris Lattner2f7c9632001-06-06 20:29:01 +00002551</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002552</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002553
Chris Lattner2f7c9632001-06-06 20:29:01 +00002554<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002555<div class="doc_subsubsection">
2556 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
2557</div>
2558
Misha Brukman76307852003-11-08 01:05:38 +00002559<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002560
Chris Lattner2f7c9632001-06-06 20:29:01 +00002561<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002562
2563<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002564 &lt;result&gt; = alloca &lt;type&gt;[, i32 &lt;NumElements&gt;][, align &lt;alignment&gt;] <i>; yields {type*}:result</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002565</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002566
Chris Lattner2f7c9632001-06-06 20:29:01 +00002567<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002568
Chris Lattner48b383b02003-11-25 01:02:51 +00002569<p>The '<tt>alloca</tt>' instruction allocates memory on the current
2570stack frame of the procedure that is live until the current function
2571returns to its caller.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002572
Chris Lattner2f7c9632001-06-06 20:29:01 +00002573<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002574
John Criswelldfe6a862004-12-10 15:51:16 +00002575<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00002576bytes of memory on the runtime stack, returning a pointer of the
Chris Lattner54611b42005-11-06 08:02:57 +00002577appropriate type to the program. If "NumElements" is specified, it is the
2578number of elements allocated. If an alignment is specified, the value result
2579of the allocation is guaranteed to be aligned to at least that boundary. If
2580not specified, or if zero, the target can choose to align the allocation on any
2581convenient boundary.</p>
2582
Misha Brukman76307852003-11-08 01:05:38 +00002583<p>'<tt>type</tt>' may be any sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002584
Chris Lattner2f7c9632001-06-06 20:29:01 +00002585<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002586
John Criswell4a3327e2005-05-13 22:25:59 +00002587<p>Memory is allocated; a pointer is returned. '<tt>alloca</tt>'d
Chris Lattner48b383b02003-11-25 01:02:51 +00002588memory is automatically released when the function returns. The '<tt>alloca</tt>'
2589instruction is commonly used to represent automatic variables that must
2590have an address available. When the function returns (either with the <tt><a
John Criswellc932bef2005-05-12 16:55:34 +00002591 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
Misha Brukman76307852003-11-08 01:05:38 +00002592instructions), the memory is reclaimed.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002593
Chris Lattner2f7c9632001-06-06 20:29:01 +00002594<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002595
2596<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002597 %ptr = alloca i32 <i>; yields {i32*}:ptr</i>
2598 %ptr = alloca i32, i32 4 <i>; yields {i32*}:ptr</i>
2599 %ptr = alloca i32, i32 4, align 1024 <i>; yields {i32*}:ptr</i>
2600 %ptr = alloca i32, align 1024 <i>; yields {i32*}:ptr</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002601</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002602</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002603
Chris Lattner2f7c9632001-06-06 20:29:01 +00002604<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002605<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
2606Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002607<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00002608<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002609<pre> &lt;result&gt; = load &lt;ty&gt;* &lt;pointer&gt;<br> &lt;result&gt; = volatile load &lt;ty&gt;* &lt;pointer&gt;<br></pre>
Chris Lattner095735d2002-05-06 03:03:22 +00002610<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002611<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002612<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002613<p>The argument to the '<tt>load</tt>' instruction specifies the memory
John Criswell4c0cf7f2005-10-24 16:17:18 +00002614address from which to load. The pointer must point to a <a
Chris Lattner10ee9652004-06-03 22:57:15 +00002615 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
John Criswell4c0cf7f2005-10-24 16:17:18 +00002616marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
Chris Lattner48b383b02003-11-25 01:02:51 +00002617the number or order of execution of this <tt>load</tt> with other
2618volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
2619instructions. </p>
Chris Lattner095735d2002-05-06 03:03:22 +00002620<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002621<p>The location of memory pointed to is loaded.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002622<h5>Examples:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002623<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002624 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002625 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
2626 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002627</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002628</div>
Chris Lattner095735d2002-05-06 03:03:22 +00002629<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002630<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
2631Instruction</a> </div>
Reid Spencera89fb182006-11-09 21:18:01 +00002632<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00002633<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002634<pre> store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt; <i>; yields {void}</i>
Chris Lattner12d456c2003-09-08 18:27:49 +00002635 volatile store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt; <i>; yields {void}</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002636</pre>
Chris Lattner095735d2002-05-06 03:03:22 +00002637<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002638<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002639<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002640<p>There are two arguments to the '<tt>store</tt>' instruction: a value
John Criswell4c0cf7f2005-10-24 16:17:18 +00002641to store and an address in which to store it. The type of the '<tt>&lt;pointer&gt;</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00002642operand must be a pointer to the type of the '<tt>&lt;value&gt;</tt>'
John Criswell4a3327e2005-05-13 22:25:59 +00002643operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
Chris Lattner48b383b02003-11-25 01:02:51 +00002644optimizer is not allowed to modify the number or order of execution of
2645this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
2646 href="#i_store">store</a></tt> instructions.</p>
2647<h5>Semantics:</h5>
2648<p>The contents of memory are updated to contain '<tt>&lt;value&gt;</tt>'
2649at the location specified by the '<tt>&lt;pointer&gt;</tt>' operand.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002650<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002651<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002652 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002653 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
2654 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002655</pre>
Reid Spencer443460a2006-11-09 21:15:49 +00002656</div>
2657
Chris Lattner095735d2002-05-06 03:03:22 +00002658<!-- _______________________________________________________________________ -->
Chris Lattner33fd7022004-04-05 01:30:49 +00002659<div class="doc_subsubsection">
2660 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
2661</div>
2662
Misha Brukman76307852003-11-08 01:05:38 +00002663<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00002664<h5>Syntax:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002665<pre>
2666 &lt;result&gt; = getelementptr &lt;ty&gt;* &lt;ptrval&gt;{, &lt;ty&gt; &lt;idx&gt;}*
2667</pre>
2668
Chris Lattner590645f2002-04-14 06:13:44 +00002669<h5>Overview:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002670
2671<p>
2672The '<tt>getelementptr</tt>' instruction is used to get the address of a
2673subelement of an aggregate data structure.</p>
2674
Chris Lattner590645f2002-04-14 06:13:44 +00002675<h5>Arguments:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002676
Reid Spencercee005c2006-12-04 21:29:24 +00002677<p>This instruction takes a list of integer operands that indicate what
Chris Lattner33fd7022004-04-05 01:30:49 +00002678elements of the aggregate object to index to. The actual types of the arguments
2679provided depend on the type of the first pointer argument. The
2680'<tt>getelementptr</tt>' instruction is used to index down through the type
John Criswell88190562005-05-16 16:17:45 +00002681levels of a structure or to a specific index in an array. When indexing into a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002682structure, only <tt>i32</tt> integer constants are allowed. When indexing
Reid Spencercee005c2006-12-04 21:29:24 +00002683into an array or pointer, only integers of 32 or 64 bits are allowed, and will
2684be sign extended to 64-bit values.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002685
Chris Lattner48b383b02003-11-25 01:02:51 +00002686<p>For example, let's consider a C code fragment and how it gets
2687compiled to LLVM:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002688
2689<pre>
2690 struct RT {
2691 char A;
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002692 i32 B[10][20];
Chris Lattner33fd7022004-04-05 01:30:49 +00002693 char C;
2694 };
2695 struct ST {
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002696 i32 X;
Chris Lattner33fd7022004-04-05 01:30:49 +00002697 double Y;
2698 struct RT Z;
2699 };
2700
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002701 define i32 *foo(struct ST *s) {
Chris Lattner33fd7022004-04-05 01:30:49 +00002702 return &amp;s[1].Z.B[5][13];
2703 }
2704</pre>
2705
Misha Brukman76307852003-11-08 01:05:38 +00002706<p>The LLVM code generated by the GCC frontend is:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002707
2708<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002709 %RT = type { i8 , [10 x [20 x i32]], i8 }
2710 %ST = type { i32, double, %RT }
Chris Lattner33fd7022004-04-05 01:30:49 +00002711
Brian Gaeke317ef962004-07-02 21:08:14 +00002712 implementation
2713
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002714 define i32* %foo(%ST* %s) {
Brian Gaeke317ef962004-07-02 21:08:14 +00002715 entry:
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002716 %reg = getelementptr %ST* %s, i32 1, i32 2, i32 1, i32 5, i32 13
2717 ret i32* %reg
Chris Lattner33fd7022004-04-05 01:30:49 +00002718 }
2719</pre>
2720
Chris Lattner590645f2002-04-14 06:13:44 +00002721<h5>Semantics:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002722
2723<p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
John Criswell4a3327e2005-05-13 22:25:59 +00002724on the pointer type that is being indexed into. <a href="#t_pointer">Pointer</a>
Reid Spencercee005c2006-12-04 21:29:24 +00002725and <a href="#t_array">array</a> types can use a 32-bit or 64-bit
Reid Spencerc0312692006-12-03 16:53:48 +00002726<a href="#t_integer">integer</a> type but the value will always be sign extended
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002727to 64-bits. <a href="#t_struct">Structure</a> types, require <tt>i32</tt>
Reid Spencerc0312692006-12-03 16:53:48 +00002728<b>constants</b>.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002729
Misha Brukman76307852003-11-08 01:05:38 +00002730<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002731type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ i32, double, %RT
Chris Lattner33fd7022004-04-05 01:30:49 +00002732}</tt>' type, a structure. The second index indexes into the third element of
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002733the structure, yielding a '<tt>%RT</tt>' = '<tt>{ i8 , [10 x [20 x i32]],
2734i8 }</tt>' type, another structure. The third index indexes into the second
2735element of the structure, yielding a '<tt>[10 x [20 x i32]]</tt>' type, an
Chris Lattner33fd7022004-04-05 01:30:49 +00002736array. The two dimensions of the array are subscripted into, yielding an
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002737'<tt>i32</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
2738to this element, thus computing a value of '<tt>i32*</tt>' type.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002739
Chris Lattner48b383b02003-11-25 01:02:51 +00002740<p>Note that it is perfectly legal to index partially through a
2741structure, returning a pointer to an inner element. Because of this,
2742the LLVM code for the given testcase is equivalent to:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002743
2744<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002745 define i32* %foo(%ST* %s) {
2746 %t1 = getelementptr %ST* %s, i32 1 <i>; yields %ST*:%t1</i>
2747 %t2 = getelementptr %ST* %t1, i32 0, i32 2 <i>; yields %RT*:%t2</i>
2748 %t3 = getelementptr %RT* %t2, i32 0, i32 1 <i>; yields [10 x [20 x i32]]*:%t3</i>
2749 %t4 = getelementptr [10 x [20 x i32]]* %t3, i32 0, i32 5 <i>; yields [20 x i32]*:%t4</i>
2750 %t5 = getelementptr [20 x i32]* %t4, i32 0, i32 13 <i>; yields i32*:%t5</i>
2751 ret i32* %t5
Chris Lattner33fd7022004-04-05 01:30:49 +00002752 }
Chris Lattnera8292f32002-05-06 22:08:29 +00002753</pre>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00002754
2755<p>Note that it is undefined to access an array out of bounds: array and
2756pointer indexes must always be within the defined bounds of the array type.
2757The one exception for this rules is zero length arrays. These arrays are
2758defined to be accessible as variable length arrays, which requires access
2759beyond the zero'th element.</p>
2760
Chris Lattner6ab66722006-08-15 00:45:58 +00002761<p>The getelementptr instruction is often confusing. For some more insight
2762into how it works, see <a href="GetElementPtr.html">the getelementptr
2763FAQ</a>.</p>
2764
Chris Lattner590645f2002-04-14 06:13:44 +00002765<h5>Example:</h5>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00002766
Chris Lattner33fd7022004-04-05 01:30:49 +00002767<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002768 <i>; yields [12 x i8]*:aptr</i>
2769 %aptr = getelementptr {i32, [12 x i8]}* %sptr, i64 0, i32 1
Chris Lattner33fd7022004-04-05 01:30:49 +00002770</pre>
Chris Lattner33fd7022004-04-05 01:30:49 +00002771</div>
Reid Spencer443460a2006-11-09 21:15:49 +00002772
Chris Lattner2f7c9632001-06-06 20:29:01 +00002773<!-- ======================================================================= -->
Reid Spencer97c5fa42006-11-08 01:18:52 +00002774<div class="doc_subsection"> <a name="convertops">Conversion Operations</a>
Misha Brukman76307852003-11-08 01:05:38 +00002775</div>
Misha Brukman76307852003-11-08 01:05:38 +00002776<div class="doc_text">
Reid Spencer97c5fa42006-11-08 01:18:52 +00002777<p>The instructions in this category are the conversion instructions (casting)
2778which all take a single operand and a type. They perform various bit conversions
2779on the operand.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002780</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00002781
Chris Lattnera8292f32002-05-06 22:08:29 +00002782<!-- _______________________________________________________________________ -->
Chris Lattnerb53c28d2004-03-12 05:50:16 +00002783<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002784 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
2785</div>
2786<div class="doc_text">
2787
2788<h5>Syntax:</h5>
2789<pre>
2790 &lt;result&gt; = trunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2791</pre>
2792
2793<h5>Overview:</h5>
2794<p>
2795The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
2796</p>
2797
2798<h5>Arguments:</h5>
2799<p>
2800The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
2801be an <a href="#t_integer">integer</a> type, and a type that specifies the size
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002802and type of the result, which must be an <a href="#t_integer">integer</a>
Reid Spencer51b07252006-11-09 23:03:26 +00002803type. The bit size of <tt>value</tt> must be larger than the bit size of
2804<tt>ty2</tt>. Equal sized types are not allowed.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002805
2806<h5>Semantics:</h5>
2807<p>
2808The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
Reid Spencer51b07252006-11-09 23:03:26 +00002809and converts the remaining bits to <tt>ty2</tt>. Since the source size must be
2810larger than the destination size, <tt>trunc</tt> cannot be a <i>no-op cast</i>.
2811It will always truncate bits.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002812
2813<h5>Example:</h5>
2814<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002815 %X = trunc i32 257 to i8 <i>; yields i8:1</i>
Reid Spencer36a15422007-01-12 03:35:51 +00002816 %Y = trunc i32 123 to i1 <i>; yields i1:true</i>
2817 %Y = trunc i32 122 to i1 <i>; yields i1:false</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002818</pre>
2819</div>
2820
2821<!-- _______________________________________________________________________ -->
2822<div class="doc_subsubsection">
2823 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
2824</div>
2825<div class="doc_text">
2826
2827<h5>Syntax:</h5>
2828<pre>
2829 &lt;result&gt; = zext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2830</pre>
2831
2832<h5>Overview:</h5>
2833<p>The '<tt>zext</tt>' instruction zero extends its operand to type
2834<tt>ty2</tt>.</p>
2835
2836
2837<h5>Arguments:</h5>
2838<p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002839<a href="#t_integer">integer</a> type, and a type to cast it to, which must
2840also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00002841<tt>value</tt> must be smaller than the bit size of the destination type,
2842<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002843
2844<h5>Semantics:</h5>
2845<p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
2846bits until it reaches the size of the destination type, <tt>ty2</tt>. When the
2847the operand and the type are the same size, no bit filling is done and the
2848cast is considered a <i>no-op cast</i> because no bits change (only the type
2849changes).</p>
2850
Reid Spencer07c9c682007-01-12 15:46:11 +00002851<p>When zero extending from i1, the result will always be either 0 or 1.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002852
2853<h5>Example:</h5>
2854<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002855 %X = zext i32 257 to i64 <i>; yields i64:257</i>
Reid Spencer36a15422007-01-12 03:35:51 +00002856 %Y = zext i1 true to i32 <i>; yields i32:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002857</pre>
2858</div>
2859
2860<!-- _______________________________________________________________________ -->
2861<div class="doc_subsubsection">
2862 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
2863</div>
2864<div class="doc_text">
2865
2866<h5>Syntax:</h5>
2867<pre>
2868 &lt;result&gt; = sext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2869</pre>
2870
2871<h5>Overview:</h5>
2872<p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
2873
2874<h5>Arguments:</h5>
2875<p>
2876The '<tt>sext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002877<a href="#t_integer">integer</a> type, and a type to cast it to, which must
2878also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00002879<tt>value</tt> must be smaller than the bit size of the destination type,
2880<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002881
2882<h5>Semantics:</h5>
2883<p>
2884The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
2885bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
2886the type <tt>ty2</tt>. When the the operand and the type are the same size,
2887no bit filling is done and the cast is considered a <i>no-op cast</i> because
2888no bits change (only the type changes).</p>
2889
Reid Spencer36a15422007-01-12 03:35:51 +00002890<p>When sign extending from i1, the extension always results in -1 or 0.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002891
2892<h5>Example:</h5>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002893<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002894 %X = sext i8 -1 to i16 <i>; yields i16 :65535</i>
Reid Spencer36a15422007-01-12 03:35:51 +00002895 %Y = sext i1 true to i32 <i>; yields i32:-1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002896</pre>
2897</div>
2898
2899<!-- _______________________________________________________________________ -->
2900<div class="doc_subsubsection">
Reid Spencer2e2740d2006-11-09 21:48:10 +00002901 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
2902</div>
2903
2904<div class="doc_text">
2905
2906<h5>Syntax:</h5>
2907
2908<pre>
2909 &lt;result&gt; = fptrunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2910</pre>
2911
2912<h5>Overview:</h5>
2913<p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
2914<tt>ty2</tt>.</p>
2915
2916
2917<h5>Arguments:</h5>
2918<p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
2919 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
2920cast it to. The size of <tt>value</tt> must be larger than the size of
2921<tt>ty2</tt>. This implies that <tt>fptrunc</tt> cannot be used to make a
2922<i>no-op cast</i>.</p>
2923
2924<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00002925<p> The '<tt>fptrunc</tt>' instruction truncates a <tt>value</tt> from a larger
2926<a href="#t_floating">floating point</a> type to a smaller
2927<a href="#t_floating">floating point</a> type. If the value cannot fit within
2928the destination type, <tt>ty2</tt>, then the results are undefined.</p>
Reid Spencer2e2740d2006-11-09 21:48:10 +00002929
2930<h5>Example:</h5>
2931<pre>
2932 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
2933 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
2934</pre>
2935</div>
2936
2937<!-- _______________________________________________________________________ -->
2938<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002939 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
2940</div>
2941<div class="doc_text">
2942
2943<h5>Syntax:</h5>
2944<pre>
2945 &lt;result&gt; = fpext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2946</pre>
2947
2948<h5>Overview:</h5>
2949<p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
2950floating point value.</p>
2951
2952<h5>Arguments:</h5>
2953<p>The '<tt>fpext</tt>' instruction takes a
2954<a href="#t_floating">floating point</a> <tt>value</tt> to cast,
Reid Spencer51b07252006-11-09 23:03:26 +00002955and a <a href="#t_floating">floating point</a> type to cast it to. The source
2956type must be smaller than the destination type.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002957
2958<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00002959<p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from a smaller
2960<a href="t_floating">floating point</a> type to a larger
2961<a href="t_floating">floating point</a> type. The <tt>fpext</tt> cannot be
2962used to make a <i>no-op cast</i> because it always changes bits. Use
Reid Spencer5b950642006-11-11 23:08:07 +00002963<tt>bitcast</tt> to make a <i>no-op cast</i> for a floating point cast.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002964
2965<h5>Example:</h5>
2966<pre>
2967 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
2968 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
2969</pre>
2970</div>
2971
2972<!-- _______________________________________________________________________ -->
2973<div class="doc_subsubsection">
Reid Spencer2eadb532007-01-21 00:29:26 +00002974 <a name="i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002975</div>
2976<div class="doc_text">
2977
2978<h5>Syntax:</h5>
2979<pre>
2980 &lt;result&gt; = fp2uint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
2981</pre>
2982
2983<h5>Overview:</h5>
2984<p>The '<tt>fp2uint</tt>' converts a floating point <tt>value</tt> to its
2985unsigned integer equivalent of type <tt>ty2</tt>.
2986</p>
2987
2988<h5>Arguments:</h5>
2989<p>The '<tt>fp2uint</tt>' instruction takes a value to cast, which must be a
2990<a href="#t_floating">floating point</a> value, and a type to cast it to, which
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002991must be an <a href="#t_integer">integer</a> type.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00002992
2993<h5>Semantics:</h5>
2994<p> The '<tt>fp2uint</tt>' instruction converts its
2995<a href="#t_floating">floating point</a> operand into the nearest (rounding
2996towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
2997the results are undefined.</p>
2998
Reid Spencer36a15422007-01-12 03:35:51 +00002999<p>When converting to i1, the conversion is done as a comparison against
3000zero. If the <tt>value</tt> was zero, the i1 result will be <tt>false</tt>.
3001If the <tt>value</tt> was non-zero, the i1 result will be <tt>true</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003002
3003<h5>Example:</h5>
3004<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003005 %X = fp2uint double 123.0 to i32 <i>; yields i32:123</i>
3006 %Y = fp2uint float 1.0E+300 to i1 <i>; yields i1:true</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003007 %X = fp2uint float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003008</pre>
3009</div>
3010
3011<!-- _______________________________________________________________________ -->
3012<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003013 <a name="i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003014</div>
3015<div class="doc_text">
3016
3017<h5>Syntax:</h5>
3018<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003019 &lt;result&gt; = fptosi &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003020</pre>
3021
3022<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003023<p>The '<tt>fptosi</tt>' instruction converts
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003024<a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003025</p>
3026
3027
Chris Lattnera8292f32002-05-06 22:08:29 +00003028<h5>Arguments:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003029<p> The '<tt>fptosi</tt>' instruction takes a value to cast, which must be a
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003030<a href="#t_floating">floating point</a> value, and a type to cast it to, which
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003031must also be an <a href="#t_integer">integer</a> type.</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003032
Chris Lattnera8292f32002-05-06 22:08:29 +00003033<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003034<p>The '<tt>fptosi</tt>' instruction converts its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003035<a href="#t_floating">floating point</a> operand into the nearest (rounding
3036towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3037the results are undefined.</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003038
Reid Spencer36a15422007-01-12 03:35:51 +00003039<p>When converting to i1, the conversion is done as a comparison against
3040zero. If the <tt>value</tt> was zero, the i1 result will be <tt>false</tt>.
3041If the <tt>value</tt> was non-zero, the i1 result will be <tt>true</tt>.</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003042
Chris Lattner70de6632001-07-09 00:26:23 +00003043<h5>Example:</h5>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003044<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003045 %X = fptosi double -123.0 to i32 <i>; yields i32:-123</i>
3046 %Y = fptosi float 1.0E-247 to i1 <i>; yields i1:true</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003047 %X = fptosi float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003048</pre>
3049</div>
3050
3051<!-- _______________________________________________________________________ -->
3052<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003053 <a name="i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003054</div>
3055<div class="doc_text">
3056
3057<h5>Syntax:</h5>
3058<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003059 &lt;result&gt; = uitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003060</pre>
3061
3062<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003063<p>The '<tt>uitofp</tt>' instruction regards <tt>value</tt> as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003064integer and converts that value to the <tt>ty2</tt> type.</p>
3065
3066
3067<h5>Arguments:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003068<p>The '<tt>uitofp</tt>' instruction takes a value to cast, which must be an
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003069<a href="#t_integer">integer</a> value, and a type to cast it to, which must
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003070be a <a href="#t_floating">floating point</a> type.</p>
3071
3072<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003073<p>The '<tt>uitofp</tt>' instruction interprets its operand as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003074integer quantity and converts it to the corresponding floating point value. If
3075the value cannot fit in the floating point value, the results are undefined.</p>
3076
3077
3078<h5>Example:</h5>
3079<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003080 %X = uitofp i32 257 to float <i>; yields float:257.0</i>
3081 %Y = uitofp i8 -1 to double <i>; yields double:255.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003082</pre>
3083</div>
3084
3085<!-- _______________________________________________________________________ -->
3086<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003087 <a name="i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003088</div>
3089<div class="doc_text">
3090
3091<h5>Syntax:</h5>
3092<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003093 &lt;result&gt; = sitofp &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003094</pre>
3095
3096<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003097<p>The '<tt>sitofp</tt>' instruction regards <tt>value</tt> as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003098integer and converts that value to the <tt>ty2</tt> type.</p>
3099
3100<h5>Arguments:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003101<p>The '<tt>sitofp</tt>' instruction takes a value to cast, which must be an
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003102<a href="#t_integer">integer</a> value, and a type to cast it to, which must be
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003103a <a href="#t_floating">floating point</a> type.</p>
3104
3105<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003106<p>The '<tt>sitofp</tt>' instruction interprets its operand as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003107integer quantity and converts it to the corresponding floating point value. If
3108the value cannot fit in the floating point value, the results are undefined.</p>
3109
3110<h5>Example:</h5>
3111<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003112 %X = sitofp i32 257 to float <i>; yields float:257.0</i>
3113 %Y = sitofp i8 -1 to double <i>; yields double:-1.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003114</pre>
3115</div>
3116
3117<!-- _______________________________________________________________________ -->
3118<div class="doc_subsubsection">
Reid Spencerb7344ff2006-11-11 21:00:47 +00003119 <a name="i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a>
3120</div>
3121<div class="doc_text">
3122
3123<h5>Syntax:</h5>
3124<pre>
3125 &lt;result&gt; = ptrtoint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3126</pre>
3127
3128<h5>Overview:</h5>
3129<p>The '<tt>ptrtoint</tt>' instruction converts the pointer <tt>value</tt> to
3130the integer type <tt>ty2</tt>.</p>
3131
3132<h5>Arguments:</h5>
3133<p>The '<tt>ptrtoint</tt>' instruction takes a <tt>value</tt> to cast, which
3134must be a <a href="t_pointer">pointer</a> value, and a type to cast it to
3135<tt>ty2</tt>, which must be an <a href="#t_integer">integer</a> type.
3136
3137<h5>Semantics:</h5>
3138<p>The '<tt>ptrtoint</tt>' instruction converts <tt>value</tt> to integer type
3139<tt>ty2</tt> by interpreting the pointer value as an integer and either
3140truncating or zero extending that value to the size of the integer type. If
3141<tt>value</tt> is smaller than <tt>ty2</tt> then a zero extension is done. If
3142<tt>value</tt> is larger than <tt>ty2</tt> then a truncation is done. If they
3143are the same size, then nothing is done (<i>no-op cast</i>).</p>
3144
3145<h5>Example:</h5>
3146<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003147 %X = ptrtoint i32* %X to i8 <i>; yields truncation on 32-bit</i>
3148 %Y = ptrtoint i32* %x to i64 <i>; yields zero extend on 32-bit</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003149</pre>
3150</div>
3151
3152<!-- _______________________________________________________________________ -->
3153<div class="doc_subsubsection">
3154 <a name="i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a>
3155</div>
3156<div class="doc_text">
3157
3158<h5>Syntax:</h5>
3159<pre>
3160 &lt;result&gt; = inttoptr &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3161</pre>
3162
3163<h5>Overview:</h5>
3164<p>The '<tt>inttoptr</tt>' instruction converts an integer <tt>value</tt> to
3165a pointer type, <tt>ty2</tt>.</p>
3166
3167<h5>Arguments:</h5>
3168<p>The '<tt>inttoptr</tt>' instruction takes an <a href="i_integer">integer</a>
3169value to cast, and a type to cast it to, which must be a
Anton Korobeynikova0554d92007-01-12 19:20:47 +00003170<a href="#t_pointer">pointer</a> type.
Reid Spencerb7344ff2006-11-11 21:00:47 +00003171
3172<h5>Semantics:</h5>
3173<p>The '<tt>inttoptr</tt>' instruction converts <tt>value</tt> to type
3174<tt>ty2</tt> by applying either a zero extension or a truncation depending on
3175the size of the integer <tt>value</tt>. If <tt>value</tt> is larger than the
3176size of a pointer then a truncation is done. If <tt>value</tt> is smaller than
3177the size of a pointer then a zero extension is done. If they are the same size,
3178nothing is done (<i>no-op cast</i>).</p>
3179
3180<h5>Example:</h5>
3181<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003182 %X = inttoptr i32 255 to i32* <i>; yields zero extend on 64-bit</i>
3183 %X = inttoptr i32 255 to i32* <i>; yields no-op on 32-bit </i>
3184 %Y = inttoptr i16 0 to i32* <i>; yields zero extend on 32-bit</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003185</pre>
3186</div>
3187
3188<!-- _______________________________________________________________________ -->
3189<div class="doc_subsubsection">
Reid Spencer5b950642006-11-11 23:08:07 +00003190 <a name="i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003191</div>
3192<div class="doc_text">
3193
3194<h5>Syntax:</h5>
3195<pre>
Reid Spencer5b950642006-11-11 23:08:07 +00003196 &lt;result&gt; = bitcast &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003197</pre>
3198
3199<h5>Overview:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003200<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003201<tt>ty2</tt> without changing any bits.</p>
3202
3203<h5>Arguments:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003204<p>The '<tt>bitcast</tt>' instruction takes a value to cast, which must be
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003205a first class value, and a type to cast it to, which must also be a <a
3206 href="#t_firstclass">first class</a> type. The bit sizes of <tt>value</tt>
Reid Spencere3db84c2007-01-09 20:08:58 +00003207and the destination type, <tt>ty2</tt>, must be identical. If the source
3208type is a pointer, the destination type must also be a pointer.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003209
3210<h5>Semantics:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003211<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencerb7344ff2006-11-11 21:00:47 +00003212<tt>ty2</tt>. It is always a <i>no-op cast</i> because no bits change with
3213this conversion. The conversion is done as if the <tt>value</tt> had been
3214stored to memory and read back as type <tt>ty2</tt>. Pointer types may only be
3215converted to other pointer types with this instruction. To convert pointers to
3216other types, use the <a href="#i_inttoptr">inttoptr</a> or
3217<a href="#i_ptrtoint">ptrtoint</a> instructions first.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003218
3219<h5>Example:</h5>
3220<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003221 %X = bitcast i8 255 to i8 <i>; yields i8 :-1</i>
3222 %Y = bitcast i32* %x to sint* <i>; yields sint*:%x</i>
3223 %Z = bitcast <2xint> %V to i64; <i>; yields i64: %V</i>
Chris Lattner70de6632001-07-09 00:26:23 +00003224</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003225</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003226
Reid Spencer97c5fa42006-11-08 01:18:52 +00003227<!-- ======================================================================= -->
3228<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
3229<div class="doc_text">
3230<p>The instructions in this category are the "miscellaneous"
3231instructions, which defy better classification.</p>
3232</div>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003233
3234<!-- _______________________________________________________________________ -->
3235<div class="doc_subsubsection"><a name="i_icmp">'<tt>icmp</tt>' Instruction</a>
3236</div>
3237<div class="doc_text">
3238<h5>Syntax:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00003239<pre> &lt;result&gt; = icmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt;
3240<i>; yields {i1}:result</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003241</pre>
3242<h5>Overview:</h5>
3243<p>The '<tt>icmp</tt>' instruction returns a boolean value based on comparison
3244of its two integer operands.</p>
3245<h5>Arguments:</h5>
3246<p>The '<tt>icmp</tt>' instruction takes three operands. The first operand is
3247the condition code which indicates the kind of comparison to perform. It is not
3248a value, just a keyword. The possibilities for the condition code are:
3249<ol>
3250 <li><tt>eq</tt>: equal</li>
3251 <li><tt>ne</tt>: not equal </li>
3252 <li><tt>ugt</tt>: unsigned greater than</li>
3253 <li><tt>uge</tt>: unsigned greater or equal</li>
3254 <li><tt>ult</tt>: unsigned less than</li>
3255 <li><tt>ule</tt>: unsigned less or equal</li>
3256 <li><tt>sgt</tt>: signed greater than</li>
3257 <li><tt>sge</tt>: signed greater or equal</li>
3258 <li><tt>slt</tt>: signed less than</li>
3259 <li><tt>sle</tt>: signed less or equal</li>
3260</ol>
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003261<p>The remaining two arguments must be <a href="#t_integer">integer</a> or
Reid Spencer784ef792007-01-04 05:19:58 +00003262<a href="#t_pointer">pointer</a> typed. They must also be identical types.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003263<h5>Semantics:</h5>
3264<p>The '<tt>icmp</tt>' compares <tt>var1</tt> and <tt>var2</tt> according to
3265the condition code given as <tt>cond</tt>. The comparison performed always
Reid Spencer36a15422007-01-12 03:35:51 +00003266yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003267<ol>
3268 <li><tt>eq</tt>: yields <tt>true</tt> if the operands are equal,
3269 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3270 </li>
3271 <li><tt>ne</tt>: yields <tt>true</tt> if the operands are unequal,
3272 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3273 <li><tt>ugt</tt>: interprets the operands as unsigned values and yields
3274 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3275 <li><tt>uge</tt>: interprets the operands as unsigned values and yields
3276 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3277 <li><tt>ult</tt>: interprets the operands as unsigned values and yields
3278 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3279 <li><tt>ule</tt>: interprets the operands as unsigned values and yields
3280 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
3281 <li><tt>sgt</tt>: interprets the operands as signed values and yields
3282 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3283 <li><tt>sge</tt>: interprets the operands as signed values and yields
3284 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3285 <li><tt>slt</tt>: interprets the operands as signed values and yields
3286 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3287 <li><tt>sle</tt>: interprets the operands as signed values and yields
3288 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003289</ol>
3290<p>If the operands are <a href="#t_pointer">pointer</a> typed, the pointer
3291values are treated as integers and then compared.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003292
3293<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003294<pre> &lt;result&gt; = icmp eq i32 4, 5 <i>; yields: result=false</i>
3295 &lt;result&gt; = icmp ne float* %X, %X <i>; yields: result=false</i>
3296 &lt;result&gt; = icmp ult i16 4, 5 <i>; yields: result=true</i>
3297 &lt;result&gt; = icmp sgt i16 4, 5 <i>; yields: result=false</i>
3298 &lt;result&gt; = icmp ule i16 -4, 5 <i>; yields: result=false</i>
3299 &lt;result&gt; = icmp sge i16 4, 5 <i>; yields: result=false</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003300</pre>
3301</div>
3302
3303<!-- _______________________________________________________________________ -->
3304<div class="doc_subsubsection"><a name="i_fcmp">'<tt>fcmp</tt>' Instruction</a>
3305</div>
3306<div class="doc_text">
3307<h5>Syntax:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00003308<pre> &lt;result&gt; = fcmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt;
3309<i>; yields {i1}:result</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003310</pre>
3311<h5>Overview:</h5>
3312<p>The '<tt>fcmp</tt>' instruction returns a boolean value based on comparison
3313of its floating point operands.</p>
3314<h5>Arguments:</h5>
3315<p>The '<tt>fcmp</tt>' instruction takes three operands. The first operand is
3316the condition code which indicates the kind of comparison to perform. It is not
3317a value, just a keyword. The possibilities for the condition code are:
3318<ol>
Reid Spencerf69acf32006-11-19 03:00:14 +00003319 <li><tt>false</tt>: no comparison, always returns false</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003320 <li><tt>oeq</tt>: ordered and equal</li>
3321 <li><tt>ogt</tt>: ordered and greater than </li>
3322 <li><tt>oge</tt>: ordered and greater than or equal</li>
3323 <li><tt>olt</tt>: ordered and less than </li>
3324 <li><tt>ole</tt>: ordered and less than or equal</li>
3325 <li><tt>one</tt>: ordered and not equal</li>
3326 <li><tt>ord</tt>: ordered (no nans)</li>
3327 <li><tt>ueq</tt>: unordered or equal</li>
3328 <li><tt>ugt</tt>: unordered or greater than </li>
3329 <li><tt>uge</tt>: unordered or greater than or equal</li>
3330 <li><tt>ult</tt>: unordered or less than </li>
3331 <li><tt>ule</tt>: unordered or less than or equal</li>
3332 <li><tt>une</tt>: unordered or not equal</li>
3333 <li><tt>uno</tt>: unordered (either nans)</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003334 <li><tt>true</tt>: no comparison, always returns true</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003335</ol>
Reid Spencer02e0d1d2006-12-06 07:08:07 +00003336<p>In the preceding, <i>ordered</i> means that neither operand is a QNAN while
3337<i>unordered</i> means that either operand may be a QNAN.</p>
Reid Spencer784ef792007-01-04 05:19:58 +00003338<p>The <tt>val1</tt> and <tt>val2</tt> arguments must be
3339<a href="#t_floating">floating point</a> typed. They must have identical
3340types.</p>
Reid Spencerf69acf32006-11-19 03:00:14 +00003341<p>In the foregoing, <i>ordered</i> means that neither operand is a QNAN and
3342<i>unordered</i> means that either operand is a QNAN.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003343<h5>Semantics:</h5>
3344<p>The '<tt>fcmp</tt>' compares <tt>var1</tt> and <tt>var2</tt> according to
3345the condition code given as <tt>cond</tt>. The comparison performed always
Reid Spencer36a15422007-01-12 03:35:51 +00003346yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003347<ol>
3348 <li><tt>false</tt>: always yields <tt>false</tt>, regardless of operands.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003349 <li><tt>oeq</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003350 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003351 <li><tt>ogt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003352 <tt>var1</tt> is greather than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003353 <li><tt>oge</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003354 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003355 <li><tt>olt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003356 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003357 <li><tt>ole</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003358 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003359 <li><tt>one</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003360 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003361 <li><tt>ord</tt>: yields <tt>true</tt> if both operands are not a QNAN.</li>
3362 <li><tt>ueq</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003363 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003364 <li><tt>ugt</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003365 <tt>var1</tt> is greater than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003366 <li><tt>uge</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003367 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003368 <li><tt>ult</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003369 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003370 <li><tt>ule</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003371 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003372 <li><tt>une</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003373 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003374 <li><tt>uno</tt>: yields <tt>true</tt> if either operand is a QNAN.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003375 <li><tt>true</tt>: always yields <tt>true</tt>, regardless of operands.</li>
3376</ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003377
3378<h5>Example:</h5>
3379<pre> &lt;result&gt; = fcmp oeq float 4.0, 5.0 <i>; yields: result=false</i>
3380 &lt;result&gt; = icmp one float 4.0, 5.0 <i>; yields: result=true</i>
3381 &lt;result&gt; = icmp olt float 4.0, 5.0 <i>; yields: result=true</i>
3382 &lt;result&gt; = icmp ueq double 1.0, 2.0 <i>; yields: result=false</i>
3383</pre>
3384</div>
3385
Reid Spencer97c5fa42006-11-08 01:18:52 +00003386<!-- _______________________________________________________________________ -->
3387<div class="doc_subsubsection"> <a name="i_phi">'<tt>phi</tt>'
3388Instruction</a> </div>
3389<div class="doc_text">
3390<h5>Syntax:</h5>
3391<pre> &lt;result&gt; = phi &lt;ty&gt; [ &lt;val0&gt;, &lt;label0&gt;], ...<br></pre>
3392<h5>Overview:</h5>
3393<p>The '<tt>phi</tt>' instruction is used to implement the &#966; node in
3394the SSA graph representing the function.</p>
3395<h5>Arguments:</h5>
3396<p>The type of the incoming values are specified with the first type
3397field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
3398as arguments, with one pair for each predecessor basic block of the
3399current block. Only values of <a href="#t_firstclass">first class</a>
3400type may be used as the value arguments to the PHI node. Only labels
3401may be used as the label arguments.</p>
3402<p>There must be no non-phi instructions between the start of a basic
3403block and the PHI instructions: i.e. PHI instructions must be first in
3404a basic block.</p>
3405<h5>Semantics:</h5>
3406<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the
3407value specified by the parameter, depending on which basic block we
3408came from in the last <a href="#terminators">terminator</a> instruction.</p>
3409<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003410<pre>Loop: ; Infinite loop that counts from 0 on up...<br> %indvar = phi i32 [ 0, %LoopHeader ], [ %nextindvar, %Loop ]<br> %nextindvar = add i32 %indvar, 1<br> br label %Loop<br></pre>
Reid Spencer97c5fa42006-11-08 01:18:52 +00003411</div>
3412
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003413<!-- _______________________________________________________________________ -->
3414<div class="doc_subsubsection">
3415 <a name="i_select">'<tt>select</tt>' Instruction</a>
3416</div>
3417
3418<div class="doc_text">
3419
3420<h5>Syntax:</h5>
3421
3422<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003423 &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 Lattnerb53c28d2004-03-12 05:50:16 +00003424</pre>
3425
3426<h5>Overview:</h5>
3427
3428<p>
3429The '<tt>select</tt>' instruction is used to choose one value based on a
3430condition, without branching.
3431</p>
3432
3433
3434<h5>Arguments:</h5>
3435
3436<p>
3437The '<tt>select</tt>' instruction requires a boolean value indicating the condition, and two values of the same <a href="#t_firstclass">first class</a> type.
3438</p>
3439
3440<h5>Semantics:</h5>
3441
3442<p>
3443If the boolean condition evaluates to true, the instruction returns the first
John Criswell88190562005-05-16 16:17:45 +00003444value argument; otherwise, it returns the second value argument.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003445</p>
3446
3447<h5>Example:</h5>
3448
3449<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003450 %X = select i1 true, i8 17, i8 42 <i>; yields i8:17</i>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003451</pre>
3452</div>
3453
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00003454
3455<!-- _______________________________________________________________________ -->
3456<div class="doc_subsubsection">
Chris Lattnere23c1392005-05-06 05:47:36 +00003457 <a name="i_call">'<tt>call</tt>' Instruction</a>
3458</div>
3459
Misha Brukman76307852003-11-08 01:05:38 +00003460<div class="doc_text">
Chris Lattnere23c1392005-05-06 05:47:36 +00003461
Chris Lattner2f7c9632001-06-06 20:29:01 +00003462<h5>Syntax:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003463<pre>
Chris Lattner0132aff2005-05-06 22:57:40 +00003464 &lt;result&gt; = [tail] call [<a href="#callingconv">cconv</a>] &lt;ty&gt;* &lt;fnptrval&gt;(&lt;param list&gt;)
Chris Lattnere23c1392005-05-06 05:47:36 +00003465</pre>
3466
Chris Lattner2f7c9632001-06-06 20:29:01 +00003467<h5>Overview:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003468
Misha Brukman76307852003-11-08 01:05:38 +00003469<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003470
Chris Lattner2f7c9632001-06-06 20:29:01 +00003471<h5>Arguments:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003472
Misha Brukman76307852003-11-08 01:05:38 +00003473<p>This instruction requires several arguments:</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003474
Chris Lattnera8292f32002-05-06 22:08:29 +00003475<ol>
Chris Lattner48b383b02003-11-25 01:02:51 +00003476 <li>
Chris Lattner0132aff2005-05-06 22:57:40 +00003477 <p>The optional "tail" marker indicates whether the callee function accesses
3478 any allocas or varargs in the caller. If the "tail" marker is present, the
Chris Lattnere23c1392005-05-06 05:47:36 +00003479 function call is eligible for tail call optimization. Note that calls may
3480 be marked "tail" even if they do not occur before a <a
3481 href="#i_ret"><tt>ret</tt></a> instruction.
Chris Lattner48b383b02003-11-25 01:02:51 +00003482 </li>
3483 <li>
Chris Lattner0132aff2005-05-06 22:57:40 +00003484 <p>The optional "cconv" marker indicates which <a href="callingconv">calling
3485 convention</a> the call should use. If none is specified, the call defaults
3486 to using C calling conventions.
3487 </li>
3488 <li>
Chris Lattnere23c1392005-05-06 05:47:36 +00003489 <p>'<tt>ty</tt>': shall be the signature of the pointer to function value
3490 being invoked. The argument types must match the types implied by this
John Criswell88190562005-05-16 16:17:45 +00003491 signature. This type can be omitted if the function is not varargs and
3492 if the function type does not return a pointer to a function.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003493 </li>
3494 <li>
3495 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
3496 be invoked. In most cases, this is a direct function invocation, but
3497 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
John Criswell88190562005-05-16 16:17:45 +00003498 to function value.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00003499 </li>
3500 <li>
3501 <p>'<tt>function args</tt>': argument list whose types match the
Reid Spencerd845d162005-05-01 22:22:57 +00003502 function signature argument types. All arguments must be of
3503 <a href="#t_firstclass">first class</a> type. If the function signature
3504 indicates the function accepts a variable number of arguments, the extra
3505 arguments can be specified.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00003506 </li>
Chris Lattnera8292f32002-05-06 22:08:29 +00003507</ol>
Chris Lattnere23c1392005-05-06 05:47:36 +00003508
Chris Lattner2f7c9632001-06-06 20:29:01 +00003509<h5>Semantics:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003510
Chris Lattner48b383b02003-11-25 01:02:51 +00003511<p>The '<tt>call</tt>' instruction is used to cause control flow to
3512transfer to a specified function, with its incoming arguments bound to
3513the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
3514instruction in the called function, control flow continues with the
3515instruction after the function call, and the return value of the
3516function is bound to the result argument. This is a simpler case of
3517the <a href="#i_invoke">invoke</a> instruction.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003518
Chris Lattner2f7c9632001-06-06 20:29:01 +00003519<h5>Example:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003520
3521<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003522 %retval = call i32 %test(i32 %argc)
3523 call i32(i8 *, ...) *%printf(i8 * %msg, i32 12, i8 42);
3524 %X = tail call i32 %foo()
3525 %Y = tail call <a href="#callingconv">fastcc</a> i32 %foo()
Chris Lattnere23c1392005-05-06 05:47:36 +00003526</pre>
3527
Misha Brukman76307852003-11-08 01:05:38 +00003528</div>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003529
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003530<!-- _______________________________________________________________________ -->
Chris Lattner6a4a0492004-09-27 21:51:25 +00003531<div class="doc_subsubsection">
Chris Lattner33337472006-01-13 23:26:01 +00003532 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003533</div>
3534
Misha Brukman76307852003-11-08 01:05:38 +00003535<div class="doc_text">
Chris Lattner6a4a0492004-09-27 21:51:25 +00003536
Chris Lattner26ca62e2003-10-18 05:51:36 +00003537<h5>Syntax:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003538
3539<pre>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003540 &lt;resultval&gt; = va_arg &lt;va_list*&gt; &lt;arglist&gt;, &lt;argty&gt;
Chris Lattner6a4a0492004-09-27 21:51:25 +00003541</pre>
3542
Chris Lattner26ca62e2003-10-18 05:51:36 +00003543<h5>Overview:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003544
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003545<p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
Chris Lattner6a4a0492004-09-27 21:51:25 +00003546the "variable argument" area of a function call. It is used to implement the
3547<tt>va_arg</tt> macro in C.</p>
3548
Chris Lattner26ca62e2003-10-18 05:51:36 +00003549<h5>Arguments:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003550
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003551<p>This instruction takes a <tt>va_list*</tt> value and the type of
3552the argument. It returns a value of the specified argument type and
Jeff Cohendc6bfea2005-11-11 02:15:27 +00003553increments the <tt>va_list</tt> to point to the next argument. Again, the
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003554actual type of <tt>va_list</tt> is target specific.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003555
Chris Lattner26ca62e2003-10-18 05:51:36 +00003556<h5>Semantics:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003557
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003558<p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
3559type from the specified <tt>va_list</tt> and causes the
3560<tt>va_list</tt> to point to the next argument. For more information,
3561see the variable argument handling <a href="#int_varargs">Intrinsic
3562Functions</a>.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003563
3564<p>It is legal for this instruction to be called in a function which does not
3565take a variable number of arguments, for example, the <tt>vfprintf</tt>
Misha Brukman76307852003-11-08 01:05:38 +00003566function.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003567
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003568<p><tt>va_arg</tt> is an LLVM instruction instead of an <a
John Criswell88190562005-05-16 16:17:45 +00003569href="#intrinsics">intrinsic function</a> because it takes a type as an
Chris Lattner6a4a0492004-09-27 21:51:25 +00003570argument.</p>
3571
Chris Lattner26ca62e2003-10-18 05:51:36 +00003572<h5>Example:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003573
3574<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
3575
Misha Brukman76307852003-11-08 01:05:38 +00003576</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003577
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003578<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00003579<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
3580<!-- *********************************************************************** -->
Chris Lattner941515c2004-01-06 05:31:32 +00003581
Misha Brukman76307852003-11-08 01:05:38 +00003582<div class="doc_text">
Chris Lattnerfee11462004-02-12 17:01:32 +00003583
3584<p>LLVM supports the notion of an "intrinsic function". These functions have
John Criswell88190562005-05-16 16:17:45 +00003585well known names and semantics and are required to follow certain
Chris Lattnerfee11462004-02-12 17:01:32 +00003586restrictions. Overall, these instructions represent an extension mechanism for
3587the LLVM language that does not require changing all of the transformations in
3588LLVM to add to the language (or the bytecode reader/writer, the parser,
3589etc...).</p>
3590
John Criswell88190562005-05-16 16:17:45 +00003591<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
3592prefix is reserved in LLVM for intrinsic names; thus, functions may not be named
Chris Lattnerfee11462004-02-12 17:01:32 +00003593this. Intrinsic functions must always be external functions: you cannot define
3594the body of intrinsic functions. Intrinsic functions may only be used in call
3595or invoke instructions: it is illegal to take the address of an intrinsic
3596function. Additionally, because intrinsic functions are part of the LLVM
3597language, it is required that they all be documented here if any are added.</p>
3598
3599
John Criswell88190562005-05-16 16:17:45 +00003600<p>To learn how to add an intrinsic function, please see the <a
Chris Lattner90391c12005-05-11 03:35:57 +00003601href="ExtendingLLVM.html">Extending LLVM Guide</a>.
Chris Lattnerfee11462004-02-12 17:01:32 +00003602</p>
3603
Misha Brukman76307852003-11-08 01:05:38 +00003604</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003605
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003606<!-- ======================================================================= -->
Chris Lattner941515c2004-01-06 05:31:32 +00003607<div class="doc_subsection">
3608 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
3609</div>
3610
Misha Brukman76307852003-11-08 01:05:38 +00003611<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003612
Misha Brukman76307852003-11-08 01:05:38 +00003613<p>Variable argument support is defined in LLVM with the <a
Chris Lattner33337472006-01-13 23:26:01 +00003614 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
Chris Lattner48b383b02003-11-25 01:02:51 +00003615intrinsic functions. These functions are related to the similarly
3616named macros defined in the <tt>&lt;stdarg.h&gt;</tt> header file.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003617
Chris Lattner48b383b02003-11-25 01:02:51 +00003618<p>All of these functions operate on arguments that use a
3619target-specific value type "<tt>va_list</tt>". The LLVM assembly
3620language reference manual does not define what this type is, so all
3621transformations should be prepared to handle intrinsics with any type
3622used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003623
Chris Lattner30b868d2006-05-15 17:26:46 +00003624<p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
Chris Lattner48b383b02003-11-25 01:02:51 +00003625instruction and the variable argument handling intrinsic functions are
3626used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003627
Chris Lattnerfee11462004-02-12 17:01:32 +00003628<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003629define i32 %test(i32 %X, ...) {
Chris Lattnerfee11462004-02-12 17:01:32 +00003630 ; Initialize variable argument processing
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003631 %ap = alloca i8 *
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003632 %ap2 = bitcast i8** %ap to i8*
3633 call void %<a href="#i_va_start">llvm.va_start</a>(i8* %ap2)
Chris Lattnerfee11462004-02-12 17:01:32 +00003634
3635 ; Read a single integer argument
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003636 %tmp = va_arg i8 ** %ap, i32
Chris Lattnerfee11462004-02-12 17:01:32 +00003637
3638 ; Demonstrate usage of llvm.va_copy and llvm.va_end
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003639 %aq = alloca i8 *
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003640 %aq2 = bitcast i8** %aq to i8*
3641 call void %<a href="#i_va_copy">llvm.va_copy</a>(i8 *%aq2, i8* %ap2)
3642 call void %<a href="#i_va_end">llvm.va_end</a>(i8* %aq2)
Chris Lattnerfee11462004-02-12 17:01:32 +00003643
3644 ; Stop processing of arguments.
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003645 call void %<a href="#i_va_end">llvm.va_end</a>(i8* %ap2)
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003646 ret i32 %tmp
Chris Lattnerfee11462004-02-12 17:01:32 +00003647}
3648</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003649</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003650
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003651<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003652<div class="doc_subsubsection">
3653 <a name="i_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
3654</div>
3655
3656
Misha Brukman76307852003-11-08 01:05:38 +00003657<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003658<h5>Syntax:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003659<pre> declare void %llvm.va_start(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003660<h5>Overview:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003661<P>The '<tt>llvm.va_start</tt>' intrinsic initializes
3662<tt>*&lt;arglist&gt;</tt> for subsequent use by <tt><a
3663href="#i_va_arg">va_arg</a></tt>.</p>
3664
3665<h5>Arguments:</h5>
3666
3667<P>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
3668
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003669<h5>Semantics:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003670
3671<P>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
3672macro available in C. In a target-dependent way, it initializes the
3673<tt>va_list</tt> element the argument points to, so that the next call to
3674<tt>va_arg</tt> will produce the first variable argument passed to the function.
3675Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
3676last argument of the function, the compiler can figure that out.</p>
3677
Misha Brukman76307852003-11-08 01:05:38 +00003678</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003679
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003680<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003681<div class="doc_subsubsection">
3682 <a name="i_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
3683</div>
3684
Misha Brukman76307852003-11-08 01:05:38 +00003685<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003686<h5>Syntax:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003687<pre> declare void %llvm.va_end(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003688<h5>Overview:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003689
Chris Lattner48b383b02003-11-25 01:02:51 +00003690<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt>&lt;arglist&gt;</tt>
3691which has been initialized previously with <tt><a href="#i_va_start">llvm.va_start</a></tt>
3692or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003693
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003694<h5>Arguments:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003695
Misha Brukman76307852003-11-08 01:05:38 +00003696<p>The argument is a <tt>va_list</tt> to destroy.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003697
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003698<h5>Semantics:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003699
Misha Brukman76307852003-11-08 01:05:38 +00003700<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00003701macro available in C. In a target-dependent way, it destroys the <tt>va_list</tt>.
3702Calls to <a href="#i_va_start"><tt>llvm.va_start</tt></a> and <a
3703 href="#i_va_copy"><tt>llvm.va_copy</tt></a> must be matched exactly
3704with calls to <tt>llvm.va_end</tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003705
Misha Brukman76307852003-11-08 01:05:38 +00003706</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003707
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003708<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003709<div class="doc_subsubsection">
3710 <a name="i_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
3711</div>
3712
Misha Brukman76307852003-11-08 01:05:38 +00003713<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003714
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003715<h5>Syntax:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003716
3717<pre>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003718 declare void %llvm.va_copy(i8* &lt;destarglist&gt;, i8* &lt;srcarglist&gt;)
Chris Lattner757528b0b2004-05-23 21:06:01 +00003719</pre>
3720
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003721<h5>Overview:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003722
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003723<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position from
3724the source argument list to the destination argument list.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003725
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003726<h5>Arguments:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003727
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003728<p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
Andrew Lenharth5305ea52005-06-22 20:38:11 +00003729The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003730
Chris Lattner757528b0b2004-05-23 21:06:01 +00003731
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003732<h5>Semantics:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003733
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003734<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt> macro
3735available in C. In a target-dependent way, it copies the source
3736<tt>va_list</tt> element into the destination list. This intrinsic is necessary
3737because the <tt><a href="i_va_begin">llvm.va_begin</a></tt> intrinsic may be
Chris Lattner757528b0b2004-05-23 21:06:01 +00003738arbitrarily complex and require memory allocation, for example.</p>
3739
Misha Brukman76307852003-11-08 01:05:38 +00003740</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003741
Chris Lattnerfee11462004-02-12 17:01:32 +00003742<!-- ======================================================================= -->
3743<div class="doc_subsection">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003744 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
3745</div>
3746
3747<div class="doc_text">
3748
3749<p>
3750LLVM support for <a href="GarbageCollection.html">Accurate Garbage
3751Collection</a> requires the implementation and generation of these intrinsics.
3752These intrinsics allow identification of <a href="#i_gcroot">GC roots on the
3753stack</a>, as well as garbage collector implementations that require <a
3754href="#i_gcread">read</a> and <a href="#i_gcwrite">write</a> barriers.
3755Front-ends for type-safe garbage collected languages should generate these
3756intrinsics to make use of the LLVM garbage collectors. For more details, see <a
3757href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
3758</p>
3759</div>
3760
3761<!-- _______________________________________________________________________ -->
3762<div class="doc_subsubsection">
3763 <a name="i_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
3764</div>
3765
3766<div class="doc_text">
3767
3768<h5>Syntax:</h5>
3769
3770<pre>
Reid Spencer7821d062005-04-26 20:50:44 +00003771 declare void %llvm.gcroot(&lt;ty&gt;** %ptrloc, &lt;ty2&gt;* %metadata)
Chris Lattner757528b0b2004-05-23 21:06:01 +00003772</pre>
3773
3774<h5>Overview:</h5>
3775
John Criswelldfe6a862004-12-10 15:51:16 +00003776<p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
Chris Lattner757528b0b2004-05-23 21:06:01 +00003777the code generator, and allows some metadata to be associated with it.</p>
3778
3779<h5>Arguments:</h5>
3780
3781<p>The first argument specifies the address of a stack object that contains the
3782root pointer. The second pointer (which must be either a constant or a global
3783value address) contains the meta-data to be associated with the root.</p>
3784
3785<h5>Semantics:</h5>
3786
3787<p>At runtime, a call to this intrinsics stores a null pointer into the "ptrloc"
3788location. At compile-time, the code generator generates information to allow
3789the runtime to find the pointer at GC safe points.
3790</p>
3791
3792</div>
3793
3794
3795<!-- _______________________________________________________________________ -->
3796<div class="doc_subsubsection">
3797 <a name="i_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
3798</div>
3799
3800<div class="doc_text">
3801
3802<h5>Syntax:</h5>
3803
3804<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003805 declare i8 * %llvm.gcread(i8 * %ObjPtr, i8 ** %Ptr)
Chris Lattner757528b0b2004-05-23 21:06:01 +00003806</pre>
3807
3808<h5>Overview:</h5>
3809
3810<p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
3811locations, allowing garbage collector implementations that require read
3812barriers.</p>
3813
3814<h5>Arguments:</h5>
3815
Chris Lattnerf9228072006-03-14 20:02:51 +00003816<p>The second argument is the address to read from, which should be an address
3817allocated from the garbage collector. The first object is a pointer to the
3818start of the referenced object, if needed by the language runtime (otherwise
3819null).</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003820
3821<h5>Semantics:</h5>
3822
3823<p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
3824instruction, but may be replaced with substantially more complex code by the
3825garbage collector runtime, as needed.</p>
3826
3827</div>
3828
3829
3830<!-- _______________________________________________________________________ -->
3831<div class="doc_subsubsection">
3832 <a name="i_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
3833</div>
3834
3835<div class="doc_text">
3836
3837<h5>Syntax:</h5>
3838
3839<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003840 declare void %llvm.gcwrite(i8 * %P1, i8 * %Obj, i8 ** %P2)
Chris Lattner757528b0b2004-05-23 21:06:01 +00003841</pre>
3842
3843<h5>Overview:</h5>
3844
3845<p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
3846locations, allowing garbage collector implementations that require write
3847barriers (such as generational or reference counting collectors).</p>
3848
3849<h5>Arguments:</h5>
3850
Chris Lattnerf9228072006-03-14 20:02:51 +00003851<p>The first argument is the reference to store, the second is the start of the
3852object to store it to, and the third is the address of the field of Obj to
3853store to. If the runtime does not require a pointer to the object, Obj may be
3854null.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003855
3856<h5>Semantics:</h5>
3857
3858<p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
3859instruction, but may be replaced with substantially more complex code by the
3860garbage collector runtime, as needed.</p>
3861
3862</div>
3863
3864
3865
3866<!-- ======================================================================= -->
3867<div class="doc_subsection">
Chris Lattner3649c3a2004-02-14 04:08:35 +00003868 <a name="int_codegen">Code Generator Intrinsics</a>
3869</div>
3870
3871<div class="doc_text">
3872<p>
3873These intrinsics are provided by LLVM to expose special features that may only
3874be implemented with code generator support.
3875</p>
3876
3877</div>
3878
3879<!-- _______________________________________________________________________ -->
3880<div class="doc_subsubsection">
3881 <a name="i_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
3882</div>
3883
3884<div class="doc_text">
3885
3886<h5>Syntax:</h5>
3887<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003888 declare i8 *%llvm.returnaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00003889</pre>
3890
3891<h5>Overview:</h5>
3892
3893<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00003894The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
3895target-specific value indicating the return address of the current function
3896or one of its callers.
Chris Lattner3649c3a2004-02-14 04:08:35 +00003897</p>
3898
3899<h5>Arguments:</h5>
3900
3901<p>
3902The argument to this intrinsic indicates which function to return the address
3903for. Zero indicates the calling function, one indicates its caller, etc. The
3904argument is <b>required</b> to be a constant integer value.
3905</p>
3906
3907<h5>Semantics:</h5>
3908
3909<p>
3910The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
3911the return address of the specified call frame, or zero if it cannot be
3912identified. The value returned by this intrinsic is likely to be incorrect or 0
3913for arguments other than zero, so it should only be used for debugging purposes.
3914</p>
3915
3916<p>
3917Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00003918aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00003919source-language caller.
3920</p>
3921</div>
3922
3923
3924<!-- _______________________________________________________________________ -->
3925<div class="doc_subsubsection">
3926 <a name="i_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
3927</div>
3928
3929<div class="doc_text">
3930
3931<h5>Syntax:</h5>
3932<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003933 declare i8 *%llvm.frameaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00003934</pre>
3935
3936<h5>Overview:</h5>
3937
3938<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00003939The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
3940target-specific frame pointer value for the specified stack frame.
Chris Lattner3649c3a2004-02-14 04:08:35 +00003941</p>
3942
3943<h5>Arguments:</h5>
3944
3945<p>
3946The argument to this intrinsic indicates which function to return the frame
3947pointer for. Zero indicates the calling function, one indicates its caller,
3948etc. The argument is <b>required</b> to be a constant integer value.
3949</p>
3950
3951<h5>Semantics:</h5>
3952
3953<p>
3954The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
3955the frame address of the specified call frame, or zero if it cannot be
3956identified. The value returned by this intrinsic is likely to be incorrect or 0
3957for arguments other than zero, so it should only be used for debugging purposes.
3958</p>
3959
3960<p>
3961Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00003962aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00003963source-language caller.
3964</p>
3965</div>
3966
Chris Lattnerc8a2c222005-02-28 19:24:19 +00003967<!-- _______________________________________________________________________ -->
3968<div class="doc_subsubsection">
Chris Lattner2f0f0012006-01-13 02:03:13 +00003969 <a name="i_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
3970</div>
3971
3972<div class="doc_text">
3973
3974<h5>Syntax:</h5>
3975<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003976 declare i8 *%llvm.stacksave()
Chris Lattner2f0f0012006-01-13 02:03:13 +00003977</pre>
3978
3979<h5>Overview:</h5>
3980
3981<p>
3982The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
3983the function stack, for use with <a href="#i_stackrestore">
3984<tt>llvm.stackrestore</tt></a>. This is useful for implementing language
3985features like scoped automatic variable sized arrays in C99.
3986</p>
3987
3988<h5>Semantics:</h5>
3989
3990<p>
3991This intrinsic returns a opaque pointer value that can be passed to <a
3992href="#i_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
3993<tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
3994<tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
3995state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
3996practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
3997that were allocated after the <tt>llvm.stacksave</tt> was executed.
3998</p>
3999
4000</div>
4001
4002<!-- _______________________________________________________________________ -->
4003<div class="doc_subsubsection">
4004 <a name="i_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
4005</div>
4006
4007<div class="doc_text">
4008
4009<h5>Syntax:</h5>
4010<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004011 declare void %llvm.stackrestore(i8 * %ptr)
Chris Lattner2f0f0012006-01-13 02:03:13 +00004012</pre>
4013
4014<h5>Overview:</h5>
4015
4016<p>
4017The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
4018the function stack to the state it was in when the corresponding <a
4019href="#llvm.stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
4020useful for implementing language features like scoped automatic variable sized
4021arrays in C99.
4022</p>
4023
4024<h5>Semantics:</h5>
4025
4026<p>
4027See the description for <a href="#i_stacksave"><tt>llvm.stacksave</tt></a>.
4028</p>
4029
4030</div>
4031
4032
4033<!-- _______________________________________________________________________ -->
4034<div class="doc_subsubsection">
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004035 <a name="i_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
4036</div>
4037
4038<div class="doc_text">
4039
4040<h5>Syntax:</h5>
4041<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004042 declare void %llvm.prefetch(i8 * &lt;address&gt;,
4043 i32 &lt;rw&gt;, i32 &lt;locality&gt;)
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004044</pre>
4045
4046<h5>Overview:</h5>
4047
4048
4049<p>
4050The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
John Criswell88190562005-05-16 16:17:45 +00004051a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
4052no
4053effect on the behavior of the program but can change its performance
Chris Lattnerff851072005-02-28 19:47:14 +00004054characteristics.
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004055</p>
4056
4057<h5>Arguments:</h5>
4058
4059<p>
4060<tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
4061determining if the fetch should be for a read (0) or write (1), and
4062<tt>locality</tt> is a temporal locality specifier ranging from (0) - no
Chris Lattnerd3e641c2005-03-07 20:31:38 +00004063locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004064<tt>locality</tt> arguments must be constant integers.
4065</p>
4066
4067<h5>Semantics:</h5>
4068
4069<p>
4070This intrinsic does not modify the behavior of the program. In particular,
4071prefetches cannot trap and do not produce a value. On targets that support this
4072intrinsic, the prefetch can provide hints to the processor cache for better
4073performance.
4074</p>
4075
4076</div>
4077
Andrew Lenharthb4427912005-03-28 20:05:49 +00004078<!-- _______________________________________________________________________ -->
4079<div class="doc_subsubsection">
4080 <a name="i_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
4081</div>
4082
4083<div class="doc_text">
4084
4085<h5>Syntax:</h5>
4086<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004087 declare void %llvm.pcmarker( i32 &lt;id&gt; )
Andrew Lenharthb4427912005-03-28 20:05:49 +00004088</pre>
4089
4090<h5>Overview:</h5>
4091
4092
4093<p>
John Criswell88190562005-05-16 16:17:45 +00004094The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
4095(PC) in a region of
Andrew Lenharthb4427912005-03-28 20:05:49 +00004096code to simulators and other tools. The method is target specific, but it is
4097expected that the marker will use exported symbols to transmit the PC of the marker.
Jeff Cohendc6bfea2005-11-11 02:15:27 +00004098The marker makes no guarantees that it will remain with any specific instruction
Chris Lattnere64d41d2005-11-15 06:07:55 +00004099after optimizations. It is possible that the presence of a marker will inhibit
Chris Lattnerb40261e2006-03-24 07:16:10 +00004100optimizations. The intended use is to be inserted after optimizations to allow
John Criswell88190562005-05-16 16:17:45 +00004101correlations of simulation runs.
Andrew Lenharthb4427912005-03-28 20:05:49 +00004102</p>
4103
4104<h5>Arguments:</h5>
4105
4106<p>
4107<tt>id</tt> is a numerical id identifying the marker.
4108</p>
4109
4110<h5>Semantics:</h5>
4111
4112<p>
4113This intrinsic does not modify the behavior of the program. Backends that do not
4114support this intrinisic may ignore it.
4115</p>
4116
4117</div>
4118
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004119<!-- _______________________________________________________________________ -->
4120<div class="doc_subsubsection">
4121 <a name="i_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
4122</div>
4123
4124<div class="doc_text">
4125
4126<h5>Syntax:</h5>
4127<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004128 declare i64 %llvm.readcyclecounter( )
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004129</pre>
4130
4131<h5>Overview:</h5>
4132
4133
4134<p>
4135The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
4136counter register (or similar low latency, high accuracy clocks) on those targets
4137that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
4138As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
4139should only be used for small timings.
4140</p>
4141
4142<h5>Semantics:</h5>
4143
4144<p>
4145When directly supported, reading the cycle counter should not modify any memory.
4146Implementations are allowed to either return a application specific value or a
4147system wide value. On backends without support, this is lowered to a constant 0.
4148</p>
4149
4150</div>
4151
Chris Lattner3649c3a2004-02-14 04:08:35 +00004152<!-- ======================================================================= -->
4153<div class="doc_subsection">
Chris Lattnerfee11462004-02-12 17:01:32 +00004154 <a name="int_libc">Standard C Library Intrinsics</a>
4155</div>
4156
4157<div class="doc_text">
4158<p>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004159LLVM provides intrinsics for a few important standard C library functions.
4160These intrinsics allow source-language front-ends to pass information about the
4161alignment of the pointer arguments to the code generator, providing opportunity
4162for more efficient code generation.
Chris Lattnerfee11462004-02-12 17:01:32 +00004163</p>
4164
4165</div>
4166
4167<!-- _______________________________________________________________________ -->
4168<div class="doc_subsubsection">
4169 <a name="i_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
4170</div>
4171
4172<div class="doc_text">
4173
4174<h5>Syntax:</h5>
4175<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004176 declare void %llvm.memcpy.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
4177 i32 &lt;len&gt;, i32 &lt;align&gt;)
4178 declare void %llvm.memcpy.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
4179 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerfee11462004-02-12 17:01:32 +00004180</pre>
4181
4182<h5>Overview:</h5>
4183
4184<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004185The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00004186location to the destination location.
4187</p>
4188
4189<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004190Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
4191intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerfee11462004-02-12 17:01:32 +00004192</p>
4193
4194<h5>Arguments:</h5>
4195
4196<p>
4197The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00004198the source. The third argument is an integer argument
Chris Lattnerfee11462004-02-12 17:01:32 +00004199specifying the number of bytes to copy, and the fourth argument is the alignment
4200of the source and destination locations.
4201</p>
4202
Chris Lattner4c67c482004-02-12 21:18:15 +00004203<p>
4204If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004205the caller guarantees that both the source and destination pointers are aligned
4206to that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00004207</p>
4208
Chris Lattnerfee11462004-02-12 17:01:32 +00004209<h5>Semantics:</h5>
4210
4211<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004212The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00004213location to the destination location, which are not allowed to overlap. It
4214copies "len" bytes of memory over. If the argument is known to be aligned to
4215some boundary, this can be specified as the fourth argument, otherwise it should
4216be set to 0 or 1.
4217</p>
4218</div>
4219
4220
Chris Lattnerf30152e2004-02-12 18:10:10 +00004221<!-- _______________________________________________________________________ -->
4222<div class="doc_subsubsection">
4223 <a name="i_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
4224</div>
4225
4226<div class="doc_text">
4227
4228<h5>Syntax:</h5>
4229<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004230 declare void %llvm.memmove.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
4231 i32 &lt;len&gt;, i32 &lt;align&gt;)
4232 declare void %llvm.memmove.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
4233 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerf30152e2004-02-12 18:10:10 +00004234</pre>
4235
4236<h5>Overview:</h5>
4237
4238<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004239The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
4240location to the destination location. It is similar to the
4241'<tt>llvm.memcmp</tt>' intrinsic but allows the two memory locations to overlap.
Chris Lattnerf30152e2004-02-12 18:10:10 +00004242</p>
4243
4244<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004245Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
4246intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerf30152e2004-02-12 18:10:10 +00004247</p>
4248
4249<h5>Arguments:</h5>
4250
4251<p>
4252The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00004253the source. The third argument is an integer argument
Chris Lattnerf30152e2004-02-12 18:10:10 +00004254specifying the number of bytes to copy, and the fourth argument is the alignment
4255of the source and destination locations.
4256</p>
4257
Chris Lattner4c67c482004-02-12 21:18:15 +00004258<p>
4259If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004260the caller guarantees that the source and destination pointers are aligned to
4261that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00004262</p>
4263
Chris Lattnerf30152e2004-02-12 18:10:10 +00004264<h5>Semantics:</h5>
4265
4266<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004267The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerf30152e2004-02-12 18:10:10 +00004268location to the destination location, which may overlap. It
4269copies "len" bytes of memory over. If the argument is known to be aligned to
4270some boundary, this can be specified as the fourth argument, otherwise it should
4271be set to 0 or 1.
4272</p>
4273</div>
4274
Chris Lattner941515c2004-01-06 05:31:32 +00004275
Chris Lattner3649c3a2004-02-14 04:08:35 +00004276<!-- _______________________________________________________________________ -->
4277<div class="doc_subsubsection">
Chris Lattner0c8b2592006-03-03 00:07:20 +00004278 <a name="i_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004279</div>
4280
4281<div class="doc_text">
4282
4283<h5>Syntax:</h5>
4284<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004285 declare void %llvm.memset.i32(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
4286 i32 &lt;len&gt;, i32 &lt;align&gt;)
4287 declare void %llvm.memset.i64(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
4288 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004289</pre>
4290
4291<h5>Overview:</h5>
4292
4293<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004294The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
Chris Lattner3649c3a2004-02-14 04:08:35 +00004295byte value.
4296</p>
4297
4298<p>
4299Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
4300does not return a value, and takes an extra alignment argument.
4301</p>
4302
4303<h5>Arguments:</h5>
4304
4305<p>
4306The first argument is a pointer to the destination to fill, the second is the
Chris Lattner0c8b2592006-03-03 00:07:20 +00004307byte value to fill it with, the third argument is an integer
Chris Lattner3649c3a2004-02-14 04:08:35 +00004308argument specifying the number of bytes to fill, and the fourth argument is the
4309known alignment of destination location.
4310</p>
4311
4312<p>
4313If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004314the caller guarantees that the destination pointer is aligned to that boundary.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004315</p>
4316
4317<h5>Semantics:</h5>
4318
4319<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004320The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
4321the
Chris Lattner3649c3a2004-02-14 04:08:35 +00004322destination location. If the argument is known to be aligned to some boundary,
4323this can be specified as the fourth argument, otherwise it should be set to 0 or
43241.
4325</p>
4326</div>
4327
4328
Chris Lattner3b4f4372004-06-11 02:28:03 +00004329<!-- _______________________________________________________________________ -->
4330<div class="doc_subsubsection">
Chris Lattner069b5bd2006-01-16 22:38:59 +00004331 <a name="i_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004332</div>
4333
4334<div class="doc_text">
4335
4336<h5>Syntax:</h5>
4337<pre>
Chris Lattner33b73f92006-09-08 06:34:02 +00004338 declare float %llvm.sqrt.f32(float %Val)
4339 declare double %llvm.sqrt.f64(double %Val)
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004340</pre>
4341
4342<h5>Overview:</h5>
4343
4344<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004345The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004346returning the same value as the libm '<tt>sqrt</tt>' function would. Unlike
4347<tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
4348negative numbers (which allows for better optimization).
4349</p>
4350
4351<h5>Arguments:</h5>
4352
4353<p>
4354The argument and return value are floating point numbers of the same type.
4355</p>
4356
4357<h5>Semantics:</h5>
4358
4359<p>
4360This function returns the sqrt of the specified operand if it is a positive
4361floating point number.
4362</p>
4363</div>
4364
Chris Lattner33b73f92006-09-08 06:34:02 +00004365<!-- _______________________________________________________________________ -->
4366<div class="doc_subsubsection">
4367 <a name="i_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
4368</div>
4369
4370<div class="doc_text">
4371
4372<h5>Syntax:</h5>
4373<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004374 declare float %llvm.powi.f32(float %Val, i32 %power)
4375 declare double %llvm.powi.f64(double %Val, i32 %power)
Chris Lattner33b73f92006-09-08 06:34:02 +00004376</pre>
4377
4378<h5>Overview:</h5>
4379
4380<p>
4381The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
4382specified (positive or negative) power. The order of evaluation of
4383multiplications is not defined.
4384</p>
4385
4386<h5>Arguments:</h5>
4387
4388<p>
4389The second argument is an integer power, and the first is a value to raise to
4390that power.
4391</p>
4392
4393<h5>Semantics:</h5>
4394
4395<p>
4396This function returns the first value raised to the second power with an
4397unspecified sequence of rounding operations.</p>
4398</div>
4399
4400
Andrew Lenharth1d463522005-05-03 18:01:48 +00004401<!-- ======================================================================= -->
4402<div class="doc_subsection">
Nate Begeman0f223bb2006-01-13 23:26:38 +00004403 <a name="int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004404</div>
4405
4406<div class="doc_text">
4407<p>
Nate Begeman0f223bb2006-01-13 23:26:38 +00004408LLVM provides intrinsics for a few important bit manipulation operations.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004409These allow efficient code generation for some algorithms.
4410</p>
4411
4412</div>
4413
4414<!-- _______________________________________________________________________ -->
4415<div class="doc_subsubsection">
Nate Begeman0f223bb2006-01-13 23:26:38 +00004416 <a name="i_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
4417</div>
4418
4419<div class="doc_text">
4420
4421<h5>Syntax:</h5>
4422<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004423 declare i16 %llvm.bswap.i16(i16 &lt;id&gt;)
4424 declare i32 %llvm.bswap.i32(i32 &lt;id&gt;)
4425 declare i64 %llvm.bswap.i64(i64 &lt;id&gt;)
Nate Begeman0f223bb2006-01-13 23:26:38 +00004426</pre>
4427
4428<h5>Overview:</h5>
4429
4430<p>
4431The '<tt>llvm.bwsap</tt>' family of intrinsics is used to byteswap a 16, 32 or
443264 bit quantity. These are useful for performing operations on data that is not
4433in the target's native byte order.
4434</p>
4435
4436<h5>Semantics:</h5>
4437
4438<p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004439The <tt>llvm.bswap.16</tt> intrinsic returns an i16 value that has the high
4440and low byte of the input i16 swapped. Similarly, the <tt>llvm.bswap.i32</tt>
4441intrinsic returns an i32 value that has the four bytes of the input i32
4442swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the returned
4443i32 will have its bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i64</tt>
4444intrinsic extends this concept to 64 bits.
Nate Begeman0f223bb2006-01-13 23:26:38 +00004445</p>
4446
4447</div>
4448
4449<!-- _______________________________________________________________________ -->
4450<div class="doc_subsubsection">
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004451 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004452</div>
4453
4454<div class="doc_text">
4455
4456<h5>Syntax:</h5>
4457<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004458 declare i8 %llvm.ctpop.i8 (i8 &lt;src&gt;)
4459 declare i16 %llvm.ctpop.i16(i16 &lt;src&gt;)
4460 declare i32 %llvm.ctpop.i32(i32 &lt;src&gt;)
4461 declare i64 %llvm.ctpop.i64(i64 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00004462</pre>
4463
4464<h5>Overview:</h5>
4465
4466<p>
Chris Lattner069b5bd2006-01-16 22:38:59 +00004467The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
4468value.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004469</p>
4470
4471<h5>Arguments:</h5>
4472
4473<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00004474The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004475integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004476</p>
4477
4478<h5>Semantics:</h5>
4479
4480<p>
4481The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
4482</p>
4483</div>
4484
4485<!-- _______________________________________________________________________ -->
4486<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00004487 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004488</div>
4489
4490<div class="doc_text">
4491
4492<h5>Syntax:</h5>
4493<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004494 declare i8 %llvm.ctlz.i8 (i8 &lt;src&gt;)
4495 declare i16 %llvm.ctlz.i16(i16 &lt;src&gt;)
4496 declare i32 %llvm.ctlz.i32(i32 &lt;src&gt;)
4497 declare i64 %llvm.ctlz.i64(i64 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00004498</pre>
4499
4500<h5>Overview:</h5>
4501
4502<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004503The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
4504leading zeros in a variable.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004505</p>
4506
4507<h5>Arguments:</h5>
4508
4509<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00004510The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004511integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004512</p>
4513
4514<h5>Semantics:</h5>
4515
4516<p>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004517The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
4518in a variable. If the src == 0 then the result is the size in bits of the type
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004519of src. For example, <tt>llvm.ctlz(i32 2) = 30</tt>.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004520</p>
4521</div>
Chris Lattner3b4f4372004-06-11 02:28:03 +00004522
4523
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004524
4525<!-- _______________________________________________________________________ -->
4526<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00004527 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004528</div>
4529
4530<div class="doc_text">
4531
4532<h5>Syntax:</h5>
4533<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004534 declare i8 %llvm.cttz.i8 (i8 &lt;src&gt;)
4535 declare i16 %llvm.cttz.i16(i16 &lt;src&gt;)
4536 declare i32 %llvm.cttz.i32(i32 &lt;src&gt;)
4537 declare i64 %llvm.cttz.i64(i64 &lt;src&gt;)
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004538</pre>
4539
4540<h5>Overview:</h5>
4541
4542<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004543The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
4544trailing zeros.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004545</p>
4546
4547<h5>Arguments:</h5>
4548
4549<p>
4550The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004551integer type. The return type must match the argument type.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004552</p>
4553
4554<h5>Semantics:</h5>
4555
4556<p>
4557The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
4558in a variable. If the src == 0 then the result is the size in bits of the type
4559of src. For example, <tt>llvm.cttz(2) = 1</tt>.
4560</p>
4561</div>
4562
Chris Lattner941515c2004-01-06 05:31:32 +00004563<!-- ======================================================================= -->
4564<div class="doc_subsection">
4565 <a name="int_debugger">Debugger Intrinsics</a>
4566</div>
4567
4568<div class="doc_text">
4569<p>
4570The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
4571are described in the <a
4572href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
4573Debugging</a> document.
4574</p>
4575</div>
4576
4577
Chris Lattner2f7c9632001-06-06 20:29:01 +00004578<!-- *********************************************************************** -->
Chris Lattner2f7c9632001-06-06 20:29:01 +00004579<hr>
Misha Brukmanc501f552004-03-01 17:47:27 +00004580<address>
4581 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
4582 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
4583 <a href="http://validator.w3.org/check/referer"><img
4584 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
4585
4586 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
Reid Spencerca058542006-03-14 05:39:39 +00004587 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
Misha Brukmanc501f552004-03-01 17:47:27 +00004588 Last modified: $Date$
4589</address>
Misha Brukman76307852003-11-08 01:05:38 +00004590</body>
4591</html>