blob: 9f896c5b87c04fce23739819d012fae664305f7c [file] [log] [blame]
Misha Brukmanc501f552004-03-01 17:47:27 +00001<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
Misha Brukman76307852003-11-08 01:05:38 +00003<html>
4<head>
5 <title>LLVM Assembly Language Reference Manual</title>
Reid Spencercb84e432004-08-26 20:44:00 +00006 <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
7 <meta name="author" content="Chris Lattner">
8 <meta name="description"
9 content="LLVM Assembly Language Reference Manual.">
Misha Brukman76307852003-11-08 01:05:38 +000010 <link rel="stylesheet" href="llvm.css" type="text/css">
11</head>
Chris Lattner757528b0b2004-05-23 21:06:01 +000012
Misha Brukman76307852003-11-08 01:05:38 +000013<body>
Chris Lattner757528b0b2004-05-23 21:06:01 +000014
Chris Lattner48b383b02003-11-25 01:02:51 +000015<div class="doc_title"> LLVM Language Reference Manual </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +000016<ol>
Misha Brukman76307852003-11-08 01:05:38 +000017 <li><a href="#abstract">Abstract</a></li>
18 <li><a href="#introduction">Introduction</a></li>
19 <li><a href="#identifiers">Identifiers</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000020 <li><a href="#highlevel">High Level Structure</a>
21 <ol>
22 <li><a href="#modulestructure">Module Structure</a></li>
Chris Lattnerd79749a2004-12-09 16:36:40 +000023 <li><a href="#linkage">Linkage Types</a></li>
Chris Lattner0132aff2005-05-06 22:57:40 +000024 <li><a href="#callingconv">Calling Conventions</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000025 <li><a href="#globalvars">Global Variables</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000026 <li><a href="#functionstructure">Functions</a></li>
Anton Korobeynikov546ea7e2007-04-29 18:02:48 +000027 <li><a href="#aliasstructure">Aliases</a>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +000028 <li><a href="#paramattrs">Parameter Attributes</a></li>
Gordon Henriksen71183b62007-12-10 03:18:06 +000029 <li><a href="#gc">Garbage Collector Names</a></li>
Chris Lattner91c15c42006-01-23 23:23:47 +000030 <li><a href="#moduleasm">Module-Level Inline Assembly</a></li>
Reid Spencer50c723a2007-02-19 23:54:10 +000031 <li><a href="#datalayout">Data Layout</a></li>
Chris Lattner6af02f32004-12-09 16:11:40 +000032 </ol>
33 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000034 <li><a href="#typesystem">Type System</a>
35 <ol>
Chris Lattner7824d182008-01-04 04:32:38 +000036 <li><a href="#t_classifications">Type Classifications</a></li>
Robert Bocchino820bc75b2006-02-17 21:18:08 +000037 <li><a href="#t_primitive">Primitive Types</a>
Chris Lattner48b383b02003-11-25 01:02:51 +000038 <ol>
Chris Lattner7824d182008-01-04 04:32:38 +000039 <li><a href="#t_floating">Floating Point Types</a></li>
40 <li><a href="#t_void">Void Type</a></li>
41 <li><a href="#t_label">Label Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000042 </ol>
43 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000044 <li><a href="#t_derived">Derived Types</a>
45 <ol>
Chris Lattner9a2e3cb2007-12-18 06:18:21 +000046 <li><a href="#t_integer">Integer Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000047 <li><a href="#t_array">Array Type</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000048 <li><a href="#t_function">Function Type</a></li>
49 <li><a href="#t_pointer">Pointer Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000050 <li><a href="#t_struct">Structure Type</a></li>
Andrew Lenharth8df88e22006-12-08 17:13:00 +000051 <li><a href="#t_pstruct">Packed Structure Type</a></li>
Reid Spencer404a3252007-02-15 03:07:05 +000052 <li><a href="#t_vector">Vector Type</a></li>
Chris Lattner37b6b092005-04-25 17:34:15 +000053 <li><a href="#t_opaque">Opaque Type</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000054 </ol>
55 </li>
56 </ol>
57 </li>
Chris Lattner6af02f32004-12-09 16:11:40 +000058 <li><a href="#constants">Constants</a>
Chris Lattner74d3f822004-12-09 17:30:23 +000059 <ol>
60 <li><a href="#simpleconstants">Simple Constants</a>
61 <li><a href="#aggregateconstants">Aggregate Constants</a>
62 <li><a href="#globalconstants">Global Variable and Function Addresses</a>
63 <li><a href="#undefvalues">Undefined Values</a>
64 <li><a href="#constantexprs">Constant Expressions</a>
65 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000066 </li>
Chris Lattner98f013c2006-01-25 23:47:57 +000067 <li><a href="#othervalues">Other Values</a>
68 <ol>
69 <li><a href="#inlineasm">Inline Assembler Expressions</a>
70 </ol>
71 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000072 <li><a href="#instref">Instruction Reference</a>
73 <ol>
74 <li><a href="#terminators">Terminator Instructions</a>
75 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000076 <li><a href="#i_ret">'<tt>ret</tt>' Instruction</a></li>
77 <li><a href="#i_br">'<tt>br</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +000078 <li><a href="#i_switch">'<tt>switch</tt>' Instruction</a></li>
79 <li><a href="#i_invoke">'<tt>invoke</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000080 <li><a href="#i_unwind">'<tt>unwind</tt>' Instruction</a></li>
Chris Lattner08b7d5b2004-10-16 18:04:13 +000081 <li><a href="#i_unreachable">'<tt>unreachable</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000082 </ol>
83 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000084 <li><a href="#binaryops">Binary Operations</a>
85 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +000086 <li><a href="#i_add">'<tt>add</tt>' Instruction</a></li>
87 <li><a href="#i_sub">'<tt>sub</tt>' Instruction</a></li>
88 <li><a href="#i_mul">'<tt>mul</tt>' Instruction</a></li>
Reid Spencer7e80b0b2006-10-26 06:15:43 +000089 <li><a href="#i_udiv">'<tt>udiv</tt>' Instruction</a></li>
90 <li><a href="#i_sdiv">'<tt>sdiv</tt>' Instruction</a></li>
91 <li><a href="#i_fdiv">'<tt>fdiv</tt>' Instruction</a></li>
Reid Spencer7eb55b32006-11-02 01:53:59 +000092 <li><a href="#i_urem">'<tt>urem</tt>' Instruction</a></li>
93 <li><a href="#i_srem">'<tt>srem</tt>' Instruction</a></li>
94 <li><a href="#i_frem">'<tt>frem</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +000095 </ol>
96 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +000097 <li><a href="#bitwiseops">Bitwise Binary Operations</a>
98 <ol>
Reid Spencer2ab01932007-02-02 13:57:07 +000099 <li><a href="#i_shl">'<tt>shl</tt>' Instruction</a></li>
100 <li><a href="#i_lshr">'<tt>lshr</tt>' Instruction</a></li>
101 <li><a href="#i_ashr">'<tt>ashr</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +0000102 <li><a href="#i_and">'<tt>and</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000103 <li><a href="#i_or">'<tt>or</tt>' Instruction</a></li>
Misha Brukman76307852003-11-08 01:05:38 +0000104 <li><a href="#i_xor">'<tt>xor</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000105 </ol>
106 </li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000107 <li><a href="#vectorops">Vector Operations</a>
108 <ol>
109 <li><a href="#i_extractelement">'<tt>extractelement</tt>' Instruction</a></li>
110 <li><a href="#i_insertelement">'<tt>insertelement</tt>' Instruction</a></li>
111 <li><a href="#i_shufflevector">'<tt>shufflevector</tt>' Instruction</a></li>
Chris Lattnerce83bff2006-04-08 23:07:04 +0000112 </ol>
113 </li>
Chris Lattner6ab66722006-08-15 00:45:58 +0000114 <li><a href="#memoryops">Memory Access and Addressing Operations</a>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000115 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000116 <li><a href="#i_malloc">'<tt>malloc</tt>' Instruction</a></li>
117 <li><a href="#i_free">'<tt>free</tt>' Instruction</a></li>
118 <li><a href="#i_alloca">'<tt>alloca</tt>' Instruction</a></li>
Robert Bocchino820bc75b2006-02-17 21:18:08 +0000119 <li><a href="#i_load">'<tt>load</tt>' Instruction</a></li>
120 <li><a href="#i_store">'<tt>store</tt>' Instruction</a></li>
121 <li><a href="#i_getelementptr">'<tt>getelementptr</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000122 </ol>
123 </li>
Reid Spencer97c5fa42006-11-08 01:18:52 +0000124 <li><a href="#convertops">Conversion Operations</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000125 <ol>
126 <li><a href="#i_trunc">'<tt>trunc .. to</tt>' Instruction</a></li>
127 <li><a href="#i_zext">'<tt>zext .. to</tt>' Instruction</a></li>
128 <li><a href="#i_sext">'<tt>sext .. to</tt>' Instruction</a></li>
129 <li><a href="#i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a></li>
130 <li><a href="#i_fpext">'<tt>fpext .. to</tt>' Instruction</a></li>
Reid Spencer51b07252006-11-09 23:03:26 +0000131 <li><a href="#i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a></li>
132 <li><a href="#i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a></li>
133 <li><a href="#i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a></li>
134 <li><a href="#i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a></li>
Reid Spencerb7344ff2006-11-11 21:00:47 +0000135 <li><a href="#i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a></li>
136 <li><a href="#i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a></li>
Reid Spencer5b950642006-11-11 23:08:07 +0000137 <li><a href="#i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a></li>
Reid Spencer59b6b7d2006-11-08 01:11:31 +0000138 </ol>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000139 <li><a href="#otherops">Other Operations</a>
140 <ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +0000141 <li><a href="#i_icmp">'<tt>icmp</tt>' Instruction</a></li>
142 <li><a href="#i_fcmp">'<tt>fcmp</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000143 <li><a href="#i_phi">'<tt>phi</tt>' Instruction</a></li>
Chris Lattnerb53c28d2004-03-12 05:50:16 +0000144 <li><a href="#i_select">'<tt>select</tt>' Instruction</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000145 <li><a href="#i_call">'<tt>call</tt>' Instruction</a></li>
Chris Lattner33337472006-01-13 23:26:01 +0000146 <li><a href="#i_va_arg">'<tt>va_arg</tt>' Instruction</a></li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000147 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000148 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000149 </ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000150 </li>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000151 <li><a href="#intrinsics">Intrinsic Functions</a>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +0000152 <ol>
Chris Lattner48b383b02003-11-25 01:02:51 +0000153 <li><a href="#int_varargs">Variable Argument Handling Intrinsics</a>
154 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000155 <li><a href="#int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a></li>
156 <li><a href="#int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a></li>
157 <li><a href="#int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a></li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000158 </ol>
159 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000160 <li><a href="#int_gc">Accurate Garbage Collection Intrinsics</a>
161 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000162 <li><a href="#int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a></li>
163 <li><a href="#int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a></li>
164 <li><a href="#int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a></li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000165 </ol>
166 </li>
Chris Lattner3649c3a2004-02-14 04:08:35 +0000167 <li><a href="#int_codegen">Code Generator Intrinsics</a>
168 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000169 <li><a href="#int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a></li>
170 <li><a href="#int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a></li>
171 <li><a href="#int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a></li>
172 <li><a href="#int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a></li>
173 <li><a href="#int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a></li>
174 <li><a href="#int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a></li>
175 <li><a href="#int_readcyclecounter"><tt>llvm.readcyclecounter</tt>' Intrinsic</a></li>
John Criswellaa1c3c12004-04-09 16:43:20 +0000176 </ol>
177 </li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000178 <li><a href="#int_libc">Standard C Library Intrinsics</a>
179 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000180 <li><a href="#int_memcpy">'<tt>llvm.memcpy.*</tt>' Intrinsic</a></li>
181 <li><a href="#int_memmove">'<tt>llvm.memmove.*</tt>' Intrinsic</a></li>
182 <li><a href="#int_memset">'<tt>llvm.memset.*</tt>' Intrinsic</a></li>
183 <li><a href="#int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a></li>
184 <li><a href="#int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a></li>
Dan Gohmanb6324c12007-10-15 20:30:11 +0000185 <li><a href="#int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a></li>
186 <li><a href="#int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a></li>
187 <li><a href="#int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a></li>
Chris Lattnerfee11462004-02-12 17:01:32 +0000188 </ol>
189 </li>
Nate Begeman0f223bb2006-01-13 23:26:38 +0000190 <li><a href="#int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000191 <ol>
Reid Spencer96a5f022007-04-04 02:42:35 +0000192 <li><a href="#int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a></li>
Chris Lattnerb748c672006-01-16 22:34:14 +0000193 <li><a href="#int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic </a></li>
194 <li><a href="#int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic </a></li>
195 <li><a href="#int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic </a></li>
Reid Spencer5bf54c82007-04-11 23:23:49 +0000196 <li><a href="#int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic </a></li>
197 <li><a href="#int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic </a></li>
Andrew Lenharth1d463522005-05-03 18:01:48 +0000198 </ol>
199 </li>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000200 <li><a href="#int_debugger">Debugger intrinsics</a></li>
Jim Laskey2211f492007-03-14 19:31:19 +0000201 <li><a href="#int_eh">Exception Handling intrinsics</a></li>
Duncan Sands86e01192007-09-11 14:10:23 +0000202 <li><a href="#int_trampoline">Trampoline Intrinsic</a>
Duncan Sands644f9172007-07-27 12:58:54 +0000203 <ol>
204 <li><a href="#int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a></li>
Duncan Sands644f9172007-07-27 12:58:54 +0000205 </ol>
206 </li>
Reid Spencer5b2cb0f2007-07-20 19:59:11 +0000207 <li><a href="#int_general">General intrinsics</a>
Tanya Lattnercb1b9602007-06-15 20:50:54 +0000208 <ol>
Reid Spencer5b2cb0f2007-07-20 19:59:11 +0000209 <li><a href="#int_var_annotation">
Tanya Lattner08abc812007-09-22 00:01:26 +0000210 <tt>llvm.var.annotation</tt>' Intrinsic</a></li>
Reid Spencer5b2cb0f2007-07-20 19:59:11 +0000211 </ol>
Tanya Lattner293c0372007-09-21 22:59:12 +0000212 <ol>
213 <li><a href="#int_annotation">
Tanya Lattner08abc812007-09-22 00:01:26 +0000214 <tt>llvm.annotation.*</tt>' Intrinsic</a></li>
Tanya Lattner293c0372007-09-21 22:59:12 +0000215 </ol>
Tanya Lattnercb1b9602007-06-15 20:50:54 +0000216 </li>
Chris Lattner48b383b02003-11-25 01:02:51 +0000217 </ol>
218 </li>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000219</ol>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000220
221<div class="doc_author">
222 <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a>
223 and <a href="mailto:vadve@cs.uiuc.edu">Vikram Adve</a></p>
Misha Brukman76307852003-11-08 01:05:38 +0000224</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000225
Chris Lattner2f7c9632001-06-06 20:29:01 +0000226<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000227<div class="doc_section"> <a name="abstract">Abstract </a></div>
228<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000229
Misha Brukman76307852003-11-08 01:05:38 +0000230<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +0000231<p>This document is a reference manual for the LLVM assembly language.
232LLVM is an SSA based representation that provides type safety,
233low-level operations, flexibility, and the capability of representing
234'all' high-level languages cleanly. It is the common code
235representation used throughout all phases of the LLVM compilation
236strategy.</p>
Misha Brukman76307852003-11-08 01:05:38 +0000237</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000238
Chris Lattner2f7c9632001-06-06 20:29:01 +0000239<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000240<div class="doc_section"> <a name="introduction">Introduction</a> </div>
241<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000242
Misha Brukman76307852003-11-08 01:05:38 +0000243<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000244
Chris Lattner48b383b02003-11-25 01:02:51 +0000245<p>The LLVM code representation is designed to be used in three
Gabor Greifa54634a2007-07-06 22:07:22 +0000246different forms: as an in-memory compiler IR, as an on-disk bitcode
Chris Lattner48b383b02003-11-25 01:02:51 +0000247representation (suitable for fast loading by a Just-In-Time compiler),
248and as a human readable assembly language representation. This allows
249LLVM to provide a powerful intermediate representation for efficient
250compiler transformations and analysis, while providing a natural means
251to debug and visualize the transformations. The three different forms
252of LLVM are all equivalent. This document describes the human readable
253representation and notation.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000254
John Criswell4a3327e2005-05-13 22:25:59 +0000255<p>The LLVM representation aims to be light-weight and low-level
Chris Lattner48b383b02003-11-25 01:02:51 +0000256while being expressive, typed, and extensible at the same time. It
257aims to be a "universal IR" of sorts, by being at a low enough level
258that high-level ideas may be cleanly mapped to it (similar to how
259microprocessors are "universal IR's", allowing many source languages to
260be mapped to them). By providing type information, LLVM can be used as
261the target of optimizations: for example, through pointer analysis, it
262can be proven that a C automatic variable is never accessed outside of
263the current function... allowing it to be promoted to a simple SSA
264value instead of a memory location.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000265
Misha Brukman76307852003-11-08 01:05:38 +0000266</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000267
Chris Lattner2f7c9632001-06-06 20:29:01 +0000268<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000269<div class="doc_subsubsection"> <a name="wellformed">Well-Formedness</a> </div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000270
Misha Brukman76307852003-11-08 01:05:38 +0000271<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000272
Chris Lattner48b383b02003-11-25 01:02:51 +0000273<p>It is important to note that this document describes 'well formed'
274LLVM assembly language. There is a difference between what the parser
275accepts and what is considered 'well formed'. For example, the
276following instruction is syntactically okay, but not well formed:</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000277
Bill Wendling3716c5d2007-05-29 09:04:49 +0000278<div class="doc_code">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000279<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000280%x = <a href="#i_add">add</a> i32 1, %x
Chris Lattner757528b0b2004-05-23 21:06:01 +0000281</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000282</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000283
Chris Lattner48b383b02003-11-25 01:02:51 +0000284<p>...because the definition of <tt>%x</tt> does not dominate all of
285its uses. The LLVM infrastructure provides a verification pass that may
286be used to verify that an LLVM module is well formed. This pass is
John Criswell4a3327e2005-05-13 22:25:59 +0000287automatically run by the parser after parsing input assembly and by
Gabor Greifa54634a2007-07-06 22:07:22 +0000288the optimizer before it outputs bitcode. The violations pointed out
Chris Lattner48b383b02003-11-25 01:02:51 +0000289by the verifier pass indicate bugs in transformation passes or input to
290the parser.</p>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000291</div>
Chris Lattner757528b0b2004-05-23 21:06:01 +0000292
Chris Lattner87a3dbe2007-10-03 17:34:29 +0000293<!-- Describe the typesetting conventions here. -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000294
Chris Lattner2f7c9632001-06-06 20:29:01 +0000295<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000296<div class="doc_section"> <a name="identifiers">Identifiers</a> </div>
Chris Lattner2f7c9632001-06-06 20:29:01 +0000297<!-- *********************************************************************** -->
Chris Lattner757528b0b2004-05-23 21:06:01 +0000298
Misha Brukman76307852003-11-08 01:05:38 +0000299<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +0000300
Reid Spencerb23b65f2007-08-07 14:34:28 +0000301 <p>LLVM identifiers come in two basic types: global and local. Global
302 identifiers (functions, global variables) begin with the @ character. Local
303 identifiers (register names, types) begin with the % character. Additionally,
304 there are three different formats for identifiers, for different purposes:
Chris Lattner757528b0b2004-05-23 21:06:01 +0000305
Chris Lattner2f7c9632001-06-06 20:29:01 +0000306<ol>
Reid Spencerb23b65f2007-08-07 14:34:28 +0000307 <li>Named values are represented as a string of characters with their prefix.
308 For example, %foo, @DivisionByZero, %a.really.long.identifier. The actual
309 regular expression used is '<tt>[%@][a-zA-Z$._][a-zA-Z$._0-9]*</tt>'.
Chris Lattnerd79749a2004-12-09 16:36:40 +0000310 Identifiers which require other characters in their names can be surrounded
Reid Spencerb23b65f2007-08-07 14:34:28 +0000311 with quotes. In this way, anything except a <tt>&quot;</tt> character can
312 be used in a named value.</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000313
Reid Spencerb23b65f2007-08-07 14:34:28 +0000314 <li>Unnamed values are represented as an unsigned numeric value with their
315 prefix. For example, %12, @2, %44.</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000316
Reid Spencer8f08d802004-12-09 18:02:53 +0000317 <li>Constants, which are described in a <a href="#constants">section about
318 constants</a>, below.</li>
Misha Brukman76307852003-11-08 01:05:38 +0000319</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000320
Reid Spencerb23b65f2007-08-07 14:34:28 +0000321<p>LLVM requires that values start with a prefix for two reasons: Compilers
Chris Lattnerd79749a2004-12-09 16:36:40 +0000322don't need to worry about name clashes with reserved words, and the set of
323reserved words may be expanded in the future without penalty. Additionally,
324unnamed identifiers allow a compiler to quickly come up with a temporary
325variable without having to avoid symbol table conflicts.</p>
326
Chris Lattner48b383b02003-11-25 01:02:51 +0000327<p>Reserved words in LLVM are very similar to reserved words in other
Reid Spencer5b950642006-11-11 23:08:07 +0000328languages. There are keywords for different opcodes
329('<tt><a href="#i_add">add</a></tt>',
330 '<tt><a href="#i_bitcast">bitcast</a></tt>',
331 '<tt><a href="#i_ret">ret</a></tt>', etc...), for primitive type names ('<tt><a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000332href="#t_void">void</a></tt>', '<tt><a href="#t_primitive">i32</a></tt>', etc...),
Chris Lattnerd79749a2004-12-09 16:36:40 +0000333and others. These reserved words cannot conflict with variable names, because
Reid Spencerb23b65f2007-08-07 14:34:28 +0000334none of them start with a prefix character ('%' or '@').</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000335
336<p>Here is an example of LLVM code to multiply the integer variable
337'<tt>%X</tt>' by 8:</p>
338
Misha Brukman76307852003-11-08 01:05:38 +0000339<p>The easy way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000340
Bill Wendling3716c5d2007-05-29 09:04:49 +0000341<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000342<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000343%result = <a href="#i_mul">mul</a> i32 %X, 8
Chris Lattnerd79749a2004-12-09 16:36:40 +0000344</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000345</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000346
Misha Brukman76307852003-11-08 01:05:38 +0000347<p>After strength reduction:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000348
Bill Wendling3716c5d2007-05-29 09:04:49 +0000349<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000350<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000351%result = <a href="#i_shl">shl</a> i32 %X, i8 3
Chris Lattnerd79749a2004-12-09 16:36:40 +0000352</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000353</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000354
Misha Brukman76307852003-11-08 01:05:38 +0000355<p>And the hard way:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000356
Bill Wendling3716c5d2007-05-29 09:04:49 +0000357<div class="doc_code">
Chris Lattnerd79749a2004-12-09 16:36:40 +0000358<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000359<a href="#i_add">add</a> i32 %X, %X <i>; yields {i32}:%0</i>
360<a href="#i_add">add</a> i32 %0, %0 <i>; yields {i32}:%1</i>
361%result = <a href="#i_add">add</a> i32 %1, %1
Chris Lattnerd79749a2004-12-09 16:36:40 +0000362</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000363</div>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000364
Chris Lattner48b383b02003-11-25 01:02:51 +0000365<p>This last way of multiplying <tt>%X</tt> by 8 illustrates several
366important lexical features of LLVM:</p>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000367
Chris Lattner2f7c9632001-06-06 20:29:01 +0000368<ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000369
370 <li>Comments are delimited with a '<tt>;</tt>' and go until the end of
371 line.</li>
372
373 <li>Unnamed temporaries are created when the result of a computation is not
374 assigned to a named value.</li>
375
Misha Brukman76307852003-11-08 01:05:38 +0000376 <li>Unnamed temporaries are numbered sequentially</li>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000377
Misha Brukman76307852003-11-08 01:05:38 +0000378</ol>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000379
John Criswell02fdc6f2005-05-12 16:52:32 +0000380<p>...and it also shows a convention that we follow in this document. When
Chris Lattnerd79749a2004-12-09 16:36:40 +0000381demonstrating instructions, we will follow an instruction with a comment that
382defines the type and name of value produced. Comments are shown in italic
383text.</p>
384
Misha Brukman76307852003-11-08 01:05:38 +0000385</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000386
387<!-- *********************************************************************** -->
388<div class="doc_section"> <a name="highlevel">High Level Structure</a> </div>
389<!-- *********************************************************************** -->
390
391<!-- ======================================================================= -->
392<div class="doc_subsection"> <a name="modulestructure">Module Structure</a>
393</div>
394
395<div class="doc_text">
396
397<p>LLVM programs are composed of "Module"s, each of which is a
398translation unit of the input programs. Each module consists of
399functions, global variables, and symbol table entries. Modules may be
400combined together with the LLVM linker, which merges function (and
401global variable) definitions, resolves forward declarations, and merges
402symbol table entries. Here is an example of the "hello world" module:</p>
403
Bill Wendling3716c5d2007-05-29 09:04:49 +0000404<div class="doc_code">
Chris Lattner6af02f32004-12-09 16:11:40 +0000405<pre><i>; Declare the string constant as a global constant...</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000406<a href="#identifiers">@.LC0</a> = <a href="#linkage_internal">internal</a> <a
407 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 +0000408
409<i>; External declaration of the puts function</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000410<a href="#functionstructure">declare</a> i32 @puts(i8 *) <i>; i32(i8 *)* </i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000411
412<i>; Definition of main function</i>
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000413define i32 @main() { <i>; i32()* </i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000414 <i>; Convert [13x i8 ]* to i8 *...</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000415 %cast210 = <a
Chris Lattner2150cde2007-06-12 17:01:15 +0000416 href="#i_getelementptr">getelementptr</a> [13 x i8 ]* @.LC0, i64 0, i64 0 <i>; i8 *</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000417
418 <i>; Call puts function to write out the string to stdout...</i>
419 <a
Chris Lattner2b0bf4f2007-06-12 17:00:26 +0000420 href="#i_call">call</a> i32 @puts(i8 * %cast210) <i>; i32</i>
Chris Lattner6af02f32004-12-09 16:11:40 +0000421 <a
Bill Wendling3716c5d2007-05-29 09:04:49 +0000422 href="#i_ret">ret</a> i32 0<br>}<br>
423</pre>
424</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000425
426<p>This example is made up of a <a href="#globalvars">global variable</a>
427named "<tt>.LC0</tt>", an external declaration of the "<tt>puts</tt>"
428function, and a <a href="#functionstructure">function definition</a>
429for "<tt>main</tt>".</p>
430
Chris Lattnerd79749a2004-12-09 16:36:40 +0000431<p>In general, a module is made up of a list of global values,
432where both functions and global variables are global values. Global values are
433represented by a pointer to a memory location (in this case, a pointer to an
434array of char, and a pointer to a function), and have one of the following <a
435href="#linkage">linkage types</a>.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000436
Chris Lattnerd79749a2004-12-09 16:36:40 +0000437</div>
438
439<!-- ======================================================================= -->
440<div class="doc_subsection">
441 <a name="linkage">Linkage Types</a>
442</div>
443
444<div class="doc_text">
445
446<p>
447All Global Variables and Functions have one of the following types of linkage:
448</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000449
450<dl>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000451
Chris Lattner6af02f32004-12-09 16:11:40 +0000452 <dt><tt><b><a name="linkage_internal">internal</a></b></tt> </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000453
454 <dd>Global values with internal linkage are only directly accessible by
455 objects in the current module. In particular, linking code into a module with
456 an internal global value may cause the internal to be renamed as necessary to
457 avoid collisions. Because the symbol is internal to the module, all
458 references can be updated. This corresponds to the notion of the
Chris Lattnere20b4702007-01-14 06:51:48 +0000459 '<tt>static</tt>' keyword in C.
Chris Lattner6af02f32004-12-09 16:11:40 +0000460 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000461
Chris Lattner6af02f32004-12-09 16:11:40 +0000462 <dt><tt><b><a name="linkage_linkonce">linkonce</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000463
Chris Lattnere20b4702007-01-14 06:51:48 +0000464 <dd>Globals with "<tt>linkonce</tt>" linkage are merged with other globals of
465 the same name when linkage occurs. This is typically used to implement
466 inline functions, templates, or other code which must be generated in each
467 translation unit that uses it. Unreferenced <tt>linkonce</tt> globals are
468 allowed to be discarded.
Chris Lattner6af02f32004-12-09 16:11:40 +0000469 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000470
Chris Lattner6af02f32004-12-09 16:11:40 +0000471 <dt><tt><b><a name="linkage_weak">weak</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000472
473 <dd>"<tt>weak</tt>" linkage is exactly the same as <tt>linkonce</tt> linkage,
474 except that unreferenced <tt>weak</tt> globals may not be discarded. This is
Chris Lattnere20b4702007-01-14 06:51:48 +0000475 used for globals that may be emitted in multiple translation units, but that
476 are not guaranteed to be emitted into every translation unit that uses them.
477 One example of this are common globals in C, such as "<tt>int X;</tt>" at
478 global scope.
Chris Lattner6af02f32004-12-09 16:11:40 +0000479 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000480
Chris Lattner6af02f32004-12-09 16:11:40 +0000481 <dt><tt><b><a name="linkage_appending">appending</a></b></tt>: </dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000482
483 <dd>"<tt>appending</tt>" linkage may only be applied to global variables of
484 pointer to array type. When two global variables with appending linkage are
485 linked together, the two global arrays are appended together. This is the
486 LLVM, typesafe, equivalent of having the system linker append together
487 "sections" with identical names when .o files are linked.
Chris Lattner6af02f32004-12-09 16:11:40 +0000488 </dd>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000489
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000490 <dt><tt><b><a name="linkage_externweak">extern_weak</a></b></tt>: </dt>
491 <dd>The semantics of this linkage follow the ELF model: the symbol is weak
492 until linked, if not linked, the symbol becomes null instead of being an
493 undefined reference.
494 </dd>
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000495
Chris Lattner6af02f32004-12-09 16:11:40 +0000496 <dt><tt><b><a name="linkage_external">externally visible</a></b></tt>:</dt>
Chris Lattnerd79749a2004-12-09 16:36:40 +0000497
498 <dd>If none of the above identifiers are used, the global is externally
499 visible, meaning that it participates in linkage and can be used to resolve
500 external symbol references.
Chris Lattner6af02f32004-12-09 16:11:40 +0000501 </dd>
Reid Spencer7972c472007-04-11 23:49:50 +0000502</dl>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000503
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000504 <p>
505 The next two types of linkage are targeted for Microsoft Windows platform
506 only. They are designed to support importing (exporting) symbols from (to)
507 DLLs.
508 </p>
509
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000510 <dl>
Anton Korobeynikovd61d39e2006-09-14 18:23:27 +0000511 <dt><tt><b><a name="linkage_dllimport">dllimport</a></b></tt>: </dt>
512
513 <dd>"<tt>dllimport</tt>" linkage causes the compiler to reference a function
514 or variable via a global pointer to a pointer that is set up by the DLL
515 exporting the symbol. On Microsoft Windows targets, the pointer name is
516 formed by combining <code>_imp__</code> and the function or variable name.
517 </dd>
518
519 <dt><tt><b><a name="linkage_dllexport">dllexport</a></b></tt>: </dt>
520
521 <dd>"<tt>dllexport</tt>" linkage causes the compiler to provide a global
522 pointer to a pointer in a DLL, so that it can be referenced with the
523 <tt>dllimport</tt> attribute. On Microsoft Windows targets, the pointer
524 name is formed by combining <code>_imp__</code> and the function or variable
525 name.
526 </dd>
527
Chris Lattner6af02f32004-12-09 16:11:40 +0000528</dl>
529
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000530<p><a name="linkage_external"></a>For example, since the "<tt>.LC0</tt>"
Chris Lattner6af02f32004-12-09 16:11:40 +0000531variable is defined to be internal, if another module defined a "<tt>.LC0</tt>"
532variable and was linked with this one, one of the two would be renamed,
533preventing a collision. Since "<tt>main</tt>" and "<tt>puts</tt>" are
534external (i.e., lacking any linkage declarations), they are accessible
Reid Spencer92c671e2007-01-05 00:59:10 +0000535outside of the current module.</p>
536<p>It is illegal for a function <i>declaration</i>
537to have any linkage type other than "externally visible", <tt>dllimport</tt>,
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000538or <tt>extern_weak</tt>.</p>
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000539<p>Aliases can have only <tt>external</tt>, <tt>internal</tt> and <tt>weak</tt>
540linkages.
Chris Lattner6af02f32004-12-09 16:11:40 +0000541</div>
542
543<!-- ======================================================================= -->
544<div class="doc_subsection">
Chris Lattner0132aff2005-05-06 22:57:40 +0000545 <a name="callingconv">Calling Conventions</a>
546</div>
547
548<div class="doc_text">
549
550<p>LLVM <a href="#functionstructure">functions</a>, <a href="#i_call">calls</a>
551and <a href="#i_invoke">invokes</a> can all have an optional calling convention
552specified for the call. The calling convention of any pair of dynamic
553caller/callee must match, or the behavior of the program is undefined. The
554following calling conventions are supported by LLVM, and more may be added in
555the future:</p>
556
557<dl>
558 <dt><b>"<tt>ccc</tt>" - The C calling convention</b>:</dt>
559
560 <dd>This calling convention (the default if no other calling convention is
561 specified) matches the target C calling conventions. This calling convention
John Criswell02fdc6f2005-05-12 16:52:32 +0000562 supports varargs function calls and tolerates some mismatch in the declared
Reid Spencer72ba4992006-12-31 21:30:18 +0000563 prototype and implemented declaration of the function (as does normal C).
Chris Lattner0132aff2005-05-06 22:57:40 +0000564 </dd>
565
566 <dt><b>"<tt>fastcc</tt>" - The fast calling convention</b>:</dt>
567
568 <dd>This calling convention attempts to make calls as fast as possible
569 (e.g. by passing things in registers). This calling convention allows the
570 target to use whatever tricks it wants to produce fast code for the target,
Chris Lattnerc792eb32005-05-06 23:08:23 +0000571 without having to conform to an externally specified ABI. Implementations of
572 this convention should allow arbitrary tail call optimization to be supported.
573 This calling convention does not support varargs and requires the prototype of
574 all callees to exactly match the prototype of the function definition.
Chris Lattner0132aff2005-05-06 22:57:40 +0000575 </dd>
576
577 <dt><b>"<tt>coldcc</tt>" - The cold calling convention</b>:</dt>
578
579 <dd>This calling convention attempts to make code in the caller as efficient
580 as possible under the assumption that the call is not commonly executed. As
581 such, these calls often preserve all registers so that the call does not break
582 any live ranges in the caller side. This calling convention does not support
583 varargs and requires the prototype of all callees to exactly match the
584 prototype of the function definition.
585 </dd>
586
Chris Lattner573f64e2005-05-07 01:46:40 +0000587 <dt><b>"<tt>cc &lt;<em>n</em>&gt;</tt>" - Numbered convention</b>:</dt>
Chris Lattner0132aff2005-05-06 22:57:40 +0000588
589 <dd>Any calling convention may be specified by number, allowing
590 target-specific calling conventions to be used. Target specific calling
591 conventions start at 64.
592 </dd>
Chris Lattner573f64e2005-05-07 01:46:40 +0000593</dl>
Chris Lattner0132aff2005-05-06 22:57:40 +0000594
595<p>More calling conventions can be added/defined on an as-needed basis, to
596support pascal conventions or any other well-known target-independent
597convention.</p>
598
599</div>
600
601<!-- ======================================================================= -->
602<div class="doc_subsection">
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000603 <a name="visibility">Visibility Styles</a>
604</div>
605
606<div class="doc_text">
607
608<p>
609All Global Variables and Functions have one of the following visibility styles:
610</p>
611
612<dl>
613 <dt><b>"<tt>default</tt>" - Default style</b>:</dt>
614
615 <dd>On ELF, default visibility means that the declaration is visible to other
616 modules and, in shared libraries, means that the declared entity may be
617 overridden. On Darwin, default visibility means that the declaration is
618 visible to other modules. Default visibility corresponds to "external
619 linkage" in the language.
620 </dd>
621
622 <dt><b>"<tt>hidden</tt>" - Hidden style</b>:</dt>
623
624 <dd>Two declarations of an object with hidden visibility refer to the same
625 object if they are in the same shared object. Usually, hidden visibility
626 indicates that the symbol will not be placed into the dynamic symbol table,
627 so no other module (executable or shared library) can reference it
628 directly.
629 </dd>
630
Anton Korobeynikov39f3cff2007-04-29 18:35:00 +0000631 <dt><b>"<tt>protected</tt>" - Protected style</b>:</dt>
632
633 <dd>On ELF, protected visibility indicates that the symbol will be placed in
634 the dynamic symbol table, but that references within the defining module will
635 bind to the local symbol. That is, the symbol cannot be overridden by another
636 module.
637 </dd>
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000638</dl>
639
640</div>
641
642<!-- ======================================================================= -->
643<div class="doc_subsection">
Chris Lattner6af02f32004-12-09 16:11:40 +0000644 <a name="globalvars">Global Variables</a>
645</div>
646
647<div class="doc_text">
648
Chris Lattner5d5aede2005-02-12 19:30:21 +0000649<p>Global variables define regions of memory allocated at compilation time
Chris Lattner662c8722005-11-12 00:45:07 +0000650instead of run-time. Global variables may optionally be initialized, may have
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000651an explicit section to be placed in, and may have an optional explicit alignment
652specified. A variable may be defined as "thread_local", which means that it
653will not be shared by threads (each thread will have a separated copy of the
654variable). A variable may be defined as a global "constant," which indicates
655that the contents of the variable will <b>never</b> be modified (enabling better
Chris Lattner5d5aede2005-02-12 19:30:21 +0000656optimization, allowing the global data to be placed in the read-only section of
657an executable, etc). Note that variables that need runtime initialization
John Criswell4c0cf7f2005-10-24 16:17:18 +0000658cannot be marked "constant" as there is a store to the variable.</p>
Chris Lattner5d5aede2005-02-12 19:30:21 +0000659
660<p>
661LLVM explicitly allows <em>declarations</em> of global variables to be marked
662constant, even if the final definition of the global is not. This capability
663can be used to enable slightly better optimization of the program, but requires
664the language definition to guarantee that optimizations based on the
665'constantness' are valid for the translation units that do not include the
666definition.
667</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000668
669<p>As SSA values, global variables define pointer values that are in
670scope (i.e. they dominate) all basic blocks in the program. Global
671variables always define a pointer to their "content" type because they
672describe a region of memory, and all memory objects in LLVM are
673accessed through pointers.</p>
674
Christopher Lamb308121c2007-12-11 09:31:00 +0000675<p>A global variable may be declared to reside in a target-specifc numbered
676address space. For targets that support them, address spaces may affect how
677optimizations are performed and/or what target instructions are used to access
Christopher Lamb25f50762007-12-12 08:44:39 +0000678the variable. The default address space is zero. The address space qualifier
679must precede any other attributes.</p>
Christopher Lamb308121c2007-12-11 09:31:00 +0000680
Chris Lattner662c8722005-11-12 00:45:07 +0000681<p>LLVM allows an explicit section to be specified for globals. If the target
682supports it, it will emit globals to the section specified.</p>
683
Chris Lattner54611b42005-11-06 08:02:57 +0000684<p>An explicit alignment may be specified for a global. If not present, or if
685the alignment is set to zero, the alignment of the global is set by the target
686to whatever it feels convenient. If an explicit alignment is specified, the
687global is forced to have at least that much alignment. All alignments must be
688a power of 2.</p>
689
Christopher Lamb308121c2007-12-11 09:31:00 +0000690<p>For example, the following defines a global in a numbered address space with
691an initializer, section, and alignment:</p>
Chris Lattner5760c502007-01-14 00:27:09 +0000692
Bill Wendling3716c5d2007-05-29 09:04:49 +0000693<div class="doc_code">
Chris Lattner5760c502007-01-14 00:27:09 +0000694<pre>
Christopher Lamb308121c2007-12-11 09:31:00 +0000695@G = constant float 1.0 addrspace(5), section "foo", align 4
Chris Lattner5760c502007-01-14 00:27:09 +0000696</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000697</div>
Chris Lattner5760c502007-01-14 00:27:09 +0000698
Chris Lattner6af02f32004-12-09 16:11:40 +0000699</div>
700
701
702<!-- ======================================================================= -->
703<div class="doc_subsection">
704 <a name="functionstructure">Functions</a>
705</div>
706
707<div class="doc_text">
708
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000709<p>LLVM function definitions consist of the "<tt>define</tt>" keyord,
710an optional <a href="#linkage">linkage type</a>, an optional
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000711<a href="#visibility">visibility style</a>, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000712<a href="#callingconv">calling convention</a>, a return type, an optional
713<a href="#paramattrs">parameter attribute</a> for the return type, a function
714name, a (possibly empty) argument list (each with optional
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000715<a href="#paramattrs">parameter attributes</a>), an optional section, an
Gordon Henriksendc5cafb2007-12-10 03:30:21 +0000716optional alignment, an optional <a href="#gc">garbage collector name</a>, an
Gordon Henriksen71183b62007-12-10 03:18:06 +0000717opening curly brace, a list of basic blocks, and a closing curly brace.
Anton Korobeynikovc7f9f3d2007-01-23 12:35:46 +0000718
719LLVM function declarations consist of the "<tt>declare</tt>" keyword, an
720optional <a href="#linkage">linkage type</a>, an optional
721<a href="#visibility">visibility style</a>, an optional
722<a href="#callingconv">calling convention</a>, a return type, an optional
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000723<a href="#paramattrs">parameter attribute</a> for the return type, a function
Gordon Henriksen71183b62007-12-10 03:18:06 +0000724name, a possibly empty list of arguments, an optional alignment, and an optional
Gordon Henriksendc5cafb2007-12-10 03:30:21 +0000725<a href="#gc">garbage collector name</a>.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000726
727<p>A function definition contains a list of basic blocks, forming the CFG for
728the function. Each basic block may optionally start with a label (giving the
729basic block a symbol table entry), contains a list of instructions, and ends
730with a <a href="#terminators">terminator</a> instruction (such as a branch or
731function return).</p>
732
Chris Lattnera59fb102007-06-08 16:52:14 +0000733<p>The first basic block in a function is special in two ways: it is immediately
Chris Lattner6af02f32004-12-09 16:11:40 +0000734executed on entrance to the function, and it is not allowed to have predecessor
735basic blocks (i.e. there can not be any branches to the entry block of a
736function). Because the block can have no predecessors, it also cannot have any
737<a href="#i_phi">PHI nodes</a>.</p>
738
Chris Lattner662c8722005-11-12 00:45:07 +0000739<p>LLVM allows an explicit section to be specified for functions. If the target
740supports it, it will emit functions to the section specified.</p>
741
Chris Lattner54611b42005-11-06 08:02:57 +0000742<p>An explicit alignment may be specified for a function. If not present, or if
743the alignment is set to zero, the alignment of the function is set by the target
744to whatever it feels convenient. If an explicit alignment is specified, the
745function is forced to have at least that much alignment. All alignments must be
746a power of 2.</p>
747
Chris Lattner6af02f32004-12-09 16:11:40 +0000748</div>
749
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000750
751<!-- ======================================================================= -->
752<div class="doc_subsection">
753 <a name="aliasstructure">Aliases</a>
754</div>
755<div class="doc_text">
756 <p>Aliases act as "second name" for the aliasee value (which can be either
Anton Korobeynikovb18f8f82007-04-28 13:45:00 +0000757 function or global variable or bitcast of global value). Aliases may have an
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000758 optional <a href="#linkage">linkage type</a>, and an
759 optional <a href="#visibility">visibility style</a>.</p>
760
761 <h5>Syntax:</h5>
762
Bill Wendling3716c5d2007-05-29 09:04:49 +0000763<div class="doc_code">
Bill Wendling2d8b9a82007-05-29 09:42:13 +0000764<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000765@&lt;Name&gt; = [Linkage] [Visibility] alias &lt;AliaseeTy&gt; @&lt;Aliasee&gt;
Bill Wendling2d8b9a82007-05-29 09:42:13 +0000766</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +0000767</div>
Anton Korobeynikova97b6942007-04-25 14:27:10 +0000768
769</div>
770
771
772
Chris Lattner91c15c42006-01-23 23:23:47 +0000773<!-- ======================================================================= -->
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000774<div class="doc_subsection"><a name="paramattrs">Parameter Attributes</a></div>
775<div class="doc_text">
776 <p>The return type and each parameter of a function type may have a set of
777 <i>parameter attributes</i> associated with them. Parameter attributes are
778 used to communicate additional information about the result or parameters of
Duncan Sandsad0ea2d2007-11-27 13:23:08 +0000779 a function. Parameter attributes are considered to be part of the function,
780 not of the function type, so functions with different parameter attributes
781 can have the same function type.</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000782
Reid Spencercf7ebf52007-01-15 18:27:39 +0000783 <p>Parameter attributes are simple keywords that follow the type specified. If
784 multiple parameter attributes are needed, they are space separated. For
Bill Wendling3716c5d2007-05-29 09:04:49 +0000785 example:</p>
786
787<div class="doc_code">
788<pre>
Duncan Sandsad0ea2d2007-11-27 13:23:08 +0000789declare i32 @printf(i8* noalias , ...) nounwind
790declare i32 @atoi(i8*) nounwind readonly
Bill Wendling3716c5d2007-05-29 09:04:49 +0000791</pre>
792</div>
793
Duncan Sandsad0ea2d2007-11-27 13:23:08 +0000794 <p>Note that any attributes for the function result (<tt>nounwind</tt>,
795 <tt>readonly</tt>) come immediately after the argument list.</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000796
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000797 <p>Currently, only the following parameter attributes are defined:</p>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000798 <dl>
Reid Spencer314e1cb2007-07-19 23:13:04 +0000799 <dt><tt>zeroext</tt></dt>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000800 <dd>This indicates that the parameter should be zero extended just before
801 a call to this function.</dd>
Reid Spencer314e1cb2007-07-19 23:13:04 +0000802 <dt><tt>signext</tt></dt>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000803 <dd>This indicates that the parameter should be sign extended just before
804 a call to this function.</dd>
Anton Korobeynikove8166852007-01-28 14:30:45 +0000805 <dt><tt>inreg</tt></dt>
806 <dd>This indicates that the parameter should be placed in register (if
Anton Korobeynikove93c6e82007-01-28 15:27:21 +0000807 possible) during assembling function call. Support for this attribute is
808 target-specific</dd>
Anton Korobeynikove8166852007-01-28 14:30:45 +0000809 <dt><tt>sret</tt></dt>
Anton Korobeynikove93c6e82007-01-28 15:27:21 +0000810 <dd>This indicates that the parameter specifies the address of a structure
Reid Spencer05dbb9d2007-03-22 02:02:11 +0000811 that is the return value of the function in the source program.</dd>
Zhou Sheng2444a9a2007-06-05 05:28:26 +0000812 <dt><tt>noalias</tt></dt>
813 <dd>This indicates that the parameter not alias any other object or any
814 other "noalias" objects during the function call.
Reid Spencer9d1700e2007-03-22 02:18:56 +0000815 <dt><tt>noreturn</tt></dt>
816 <dd>This function attribute indicates that the function never returns. This
817 indicates to LLVM that every call to this function should be treated as if
818 an <tt>unreachable</tt> instruction immediately followed the call.</dd>
Reid Spencer05dbb9d2007-03-22 02:02:11 +0000819 <dt><tt>nounwind</tt></dt>
820 <dd>This function attribute indicates that the function type does not use
821 the unwind instruction and does not allow stack unwinding to propagate
822 through it.</dd>
Duncan Sands27e91592007-07-27 19:57:41 +0000823 <dt><tt>nest</tt></dt>
824 <dd>This indicates that the parameter can be excised using the
825 <a href="#int_trampoline">trampoline intrinsics</a>.</dd>
Duncan Sandsa89a1132007-11-22 20:23:04 +0000826 <dt><tt>readonly</tt></dt>
Duncan Sands730a3262007-11-14 21:14:02 +0000827 <dd>This function attribute indicates that the function has no side-effects
Duncan Sandsa89a1132007-11-22 20:23:04 +0000828 except for producing a return value or throwing an exception. The value
829 returned must only depend on the function arguments and/or global variables.
830 It may use values obtained by dereferencing pointers.</dd>
831 <dt><tt>readnone</tt></dt>
832 <dd>A <tt>readnone</tt> function has the same restrictions as a <tt>readonly</tt>
Duncan Sands730a3262007-11-14 21:14:02 +0000833 function, but in addition it is not allowed to dereference any pointer arguments
834 or global variables.
Anton Korobeynikova0554d92007-01-12 19:20:47 +0000835 </dl>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000836
Reid Spencerb5ebf3d2006-12-31 07:07:53 +0000837</div>
838
839<!-- ======================================================================= -->
Chris Lattner91c15c42006-01-23 23:23:47 +0000840<div class="doc_subsection">
Gordon Henriksen71183b62007-12-10 03:18:06 +0000841 <a name="gc">Garbage Collector Names</a>
842</div>
843
844<div class="doc_text">
845<p>Each function may specify a garbage collector name, which is simply a
846string.</p>
847
848<div class="doc_code"><pre
849>define void @f() gc "name" { ...</pre></div>
850
851<p>The compiler declares the supported values of <i>name</i>. Specifying a
852collector which will cause the compiler to alter its output in order to support
853the named garbage collection algorithm.</p>
854</div>
855
856<!-- ======================================================================= -->
857<div class="doc_subsection">
Chris Lattner93564892006-04-08 04:40:53 +0000858 <a name="moduleasm">Module-Level Inline Assembly</a>
Chris Lattner91c15c42006-01-23 23:23:47 +0000859</div>
860
861<div class="doc_text">
862<p>
863Modules may contain "module-level inline asm" blocks, which corresponds to the
864GCC "file scope inline asm" blocks. These blocks are internally concatenated by
865LLVM and treated as a single unit, but may be separated in the .ll file if
866desired. The syntax is very simple:
867</p>
868
Bill Wendling3716c5d2007-05-29 09:04:49 +0000869<div class="doc_code">
870<pre>
871module asm "inline asm code goes here"
872module asm "more can go here"
873</pre>
874</div>
Chris Lattner91c15c42006-01-23 23:23:47 +0000875
876<p>The strings can contain any character by escaping non-printable characters.
877 The escape sequence used is simply "\xx" where "xx" is the two digit hex code
878 for the number.
879</p>
880
881<p>
882 The inline asm code is simply printed to the machine code .s file when
883 assembly code is generated.
884</p>
885</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000886
Reid Spencer50c723a2007-02-19 23:54:10 +0000887<!-- ======================================================================= -->
888<div class="doc_subsection">
889 <a name="datalayout">Data Layout</a>
890</div>
891
892<div class="doc_text">
893<p>A module may specify a target specific data layout string that specifies how
Reid Spencer7972c472007-04-11 23:49:50 +0000894data is to be laid out in memory. The syntax for the data layout is simply:</p>
895<pre> target datalayout = "<i>layout specification</i>"</pre>
896<p>The <i>layout specification</i> consists of a list of specifications
897separated by the minus sign character ('-'). Each specification starts with a
898letter and may include other information after the letter to define some
899aspect of the data layout. The specifications accepted are as follows: </p>
Reid Spencer50c723a2007-02-19 23:54:10 +0000900<dl>
901 <dt><tt>E</tt></dt>
902 <dd>Specifies that the target lays out data in big-endian form. That is, the
903 bits with the most significance have the lowest address location.</dd>
904 <dt><tt>e</tt></dt>
905 <dd>Specifies that hte target lays out data in little-endian form. That is,
906 the bits with the least significance have the lowest address location.</dd>
907 <dt><tt>p:<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
908 <dd>This specifies the <i>size</i> of a pointer and its <i>abi</i> and
909 <i>preferred</i> alignments. All sizes are in bits. Specifying the <i>pref</i>
910 alignment is optional. If omitted, the preceding <tt>:</tt> should be omitted
911 too.</dd>
912 <dt><tt>i<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
913 <dd>This specifies the alignment for an integer type of a given bit
914 <i>size</i>. The value of <i>size</i> must be in the range [1,2^23).</dd>
915 <dt><tt>v<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
916 <dd>This specifies the alignment for a vector type of a given bit
917 <i>size</i>.</dd>
918 <dt><tt>f<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
919 <dd>This specifies the alignment for a floating point type of a given bit
920 <i>size</i>. The value of <i>size</i> must be either 32 (float) or 64
921 (double).</dd>
922 <dt><tt>a<i>size</i>:<i>abi</i>:<i>pref</i></tt></dt>
923 <dd>This specifies the alignment for an aggregate type of a given bit
924 <i>size</i>.</dd>
925</dl>
926<p>When constructing the data layout for a given target, LLVM starts with a
927default set of specifications which are then (possibly) overriden by the
928specifications in the <tt>datalayout</tt> keyword. The default specifications
929are given in this list:</p>
930<ul>
931 <li><tt>E</tt> - big endian</li>
932 <li><tt>p:32:64:64</tt> - 32-bit pointers with 64-bit alignment</li>
933 <li><tt>i1:8:8</tt> - i1 is 8-bit (byte) aligned</li>
934 <li><tt>i8:8:8</tt> - i8 is 8-bit (byte) aligned</li>
935 <li><tt>i16:16:16</tt> - i16 is 16-bit aligned</li>
936 <li><tt>i32:32:32</tt> - i32 is 32-bit aligned</li>
937 <li><tt>i64:32:64</tt> - i64 has abi alignment of 32-bits but preferred
938 alignment of 64-bits</li>
939 <li><tt>f32:32:32</tt> - float is 32-bit aligned</li>
940 <li><tt>f64:64:64</tt> - double is 64-bit aligned</li>
941 <li><tt>v64:64:64</tt> - 64-bit vector is 64-bit aligned</li>
942 <li><tt>v128:128:128</tt> - 128-bit vector is 128-bit aligned</li>
943 <li><tt>a0:0:1</tt> - aggregates are 8-bit aligned</li>
944</ul>
945<p>When llvm is determining the alignment for a given type, it uses the
946following rules:
947<ol>
948 <li>If the type sought is an exact match for one of the specifications, that
949 specification is used.</li>
950 <li>If no match is found, and the type sought is an integer type, then the
951 smallest integer type that is larger than the bitwidth of the sought type is
952 used. If none of the specifications are larger than the bitwidth then the the
953 largest integer type is used. For example, given the default specifications
954 above, the i7 type will use the alignment of i8 (next largest) while both
955 i65 and i256 will use the alignment of i64 (largest specified).</li>
956 <li>If no match is found, and the type sought is a vector type, then the
957 largest vector type that is smaller than the sought vector type will be used
958 as a fall back. This happens because <128 x double> can be implemented in
959 terms of 64 <2 x double>, for example.</li>
960</ol>
961</div>
Chris Lattner6af02f32004-12-09 16:11:40 +0000962
Chris Lattner2f7c9632001-06-06 20:29:01 +0000963<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +0000964<div class="doc_section"> <a name="typesystem">Type System</a> </div>
965<!-- *********************************************************************** -->
Chris Lattner6af02f32004-12-09 16:11:40 +0000966
Misha Brukman76307852003-11-08 01:05:38 +0000967<div class="doc_text">
Chris Lattner6af02f32004-12-09 16:11:40 +0000968
Misha Brukman76307852003-11-08 01:05:38 +0000969<p>The LLVM type system is one of the most important features of the
Chris Lattner48b383b02003-11-25 01:02:51 +0000970intermediate representation. Being typed enables a number of
971optimizations to be performed on the IR directly, without having to do
972extra analyses on the side before the transformation. A strong type
973system makes it easier to read the generated code and enables novel
974analyses and transformations that are not feasible to perform on normal
975three address code representations.</p>
Chris Lattner6af02f32004-12-09 16:11:40 +0000976
977</div>
978
Chris Lattner2f7c9632001-06-06 20:29:01 +0000979<!-- ======================================================================= -->
Chris Lattner7824d182008-01-04 04:32:38 +0000980<div class="doc_subsection"> <a name="t_classifications">Type
Chris Lattner48b383b02003-11-25 01:02:51 +0000981Classifications</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +0000982<div class="doc_text">
Chris Lattner7824d182008-01-04 04:32:38 +0000983<p>The types fall into a few useful
Chris Lattner48b383b02003-11-25 01:02:51 +0000984classifications:</p>
Misha Brukmanc501f552004-03-01 17:47:27 +0000985
986<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +0000987 <tbody>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +0000988 <tr><th>Classification</th><th>Types</th></tr>
Chris Lattner48b383b02003-11-25 01:02:51 +0000989 <tr>
Chris Lattner7824d182008-01-04 04:32:38 +0000990 <td><a href="#t_integer">integer</a></td>
Reid Spencer138249b2007-05-16 18:44:01 +0000991 <td><tt>i1, i2, i3, ... i8, ... i16, ... i32, ... i64, ... </tt></td>
Chris Lattner48b383b02003-11-25 01:02:51 +0000992 </tr>
993 <tr>
Chris Lattner7824d182008-01-04 04:32:38 +0000994 <td><a href="#t_floating">floating point</a></td>
995 <td><tt>float, double, x86_fp80, fp128, ppc_fp128</tt></td>
Chris Lattner48b383b02003-11-25 01:02:51 +0000996 </tr>
997 <tr>
998 <td><a name="t_firstclass">first class</a></td>
Chris Lattner7824d182008-01-04 04:32:38 +0000999 <td><a href="#t_integer">integer</a>,
1000 <a href="#t_floating">floating point</a>,
1001 <a href="#t_pointer">pointer</a>,
1002 <a href="#t_vector">vector</a>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001003 </td>
Chris Lattner48b383b02003-11-25 01:02:51 +00001004 </tr>
Chris Lattner7824d182008-01-04 04:32:38 +00001005 <tr>
1006 <td><a href="#t_primitive">primitive</a></td>
1007 <td><a href="#t_label">label</a>,
1008 <a href="#t_void">void</a>,
1009 <a href="#t_integer">integer</a>,
1010 <a href="#t_floating">floating point</a>.</td>
1011 </tr>
1012 <tr>
1013 <td><a href="#t_derived">derived</a></td>
1014 <td><a href="#t_integer">integer</a>,
1015 <a href="#t_array">array</a>,
1016 <a href="#t_function">function</a>,
1017 <a href="#t_pointer">pointer</a>,
1018 <a href="#t_struct">structure</a>,
1019 <a href="#t_pstruct">packed structure</a>,
1020 <a href="#t_vector">vector</a>,
1021 <a href="#t_opaque">opaque</a>.
1022 </tr>
Chris Lattner48b383b02003-11-25 01:02:51 +00001023 </tbody>
Misha Brukman76307852003-11-08 01:05:38 +00001024</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00001025
Chris Lattner48b383b02003-11-25 01:02:51 +00001026<p>The <a href="#t_firstclass">first class</a> types are perhaps the
1027most important. Values of these types are the only ones which can be
1028produced by instructions, passed as arguments, or used as operands to
1029instructions. This means that all structures and arrays must be
1030manipulated either by pointer or by component.</p>
Misha Brukman76307852003-11-08 01:05:38 +00001031</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001032
Chris Lattner2f7c9632001-06-06 20:29:01 +00001033<!-- ======================================================================= -->
Chris Lattner7824d182008-01-04 04:32:38 +00001034<div class="doc_subsection"> <a name="t_primitive">Primitive Types</a> </div>
1035<div class="doc_text">
1036<p>The primitive types are the fundamental building blocks of the LLVM
1037system.</p>
1038
1039<!-- _______________________________________________________________________ -->
1040<div class="doc_subsubsection"> <a name="t_floating">Floating Point Types</a> </div>
1041
1042<div class="doc_text">
1043 <table>
1044 <tbody>
1045 <tr><th>Type</th><th>Description</th></tr>
1046 <tr><td><tt>float</tt></td><td>32-bit floating point value</td></tr>
1047 <tr><td><tt>double</tt></td><td>64-bit floating point value</td></tr>
1048 <tr><td><tt>fp128</tt></td><td>128-bit floating point value (112-bit mantissa)</td></tr>
1049 <tr><td><tt>x86_fp80</tt></td><td>80-bit floating point value (X87)</td></tr>
1050 <tr><td><tt>ppc_fp128</tt></td><td>128-bit floating point value (two 64-bits)</td></tr>
1051 </tbody>
1052 </table>
1053</div>
1054
1055<!-- _______________________________________________________________________ -->
1056<div class="doc_subsubsection"> <a name="t_void">Void Type</a> </div>
1057
1058<div class="doc_text">
1059<h5>Overview:</h5>
1060<p>The void type does not represent any value and has no size.</p>
1061
1062<h5>Syntax:</h5>
1063
1064<pre>
1065 void
1066</pre>
1067</div>
1068
1069<!-- _______________________________________________________________________ -->
1070<div class="doc_subsubsection"> <a name="t_label">Label Type</a> </div>
1071
1072<div class="doc_text">
1073<h5>Overview:</h5>
1074<p>The label type represents code labels.</p>
1075
1076<h5>Syntax:</h5>
1077
1078<pre>
1079 label
1080</pre>
1081</div>
1082
1083
1084<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001085<div class="doc_subsection"> <a name="t_derived">Derived Types</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001086
Misha Brukman76307852003-11-08 01:05:38 +00001087<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001088
Chris Lattner48b383b02003-11-25 01:02:51 +00001089<p>The real power in LLVM comes from the derived types in the system.
1090This is what allows a programmer to represent arrays, functions,
1091pointers, and other useful types. Note that these derived types may be
1092recursive: For example, it is possible to have a two dimensional array.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001093
Misha Brukman76307852003-11-08 01:05:38 +00001094</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001095
Chris Lattner2f7c9632001-06-06 20:29:01 +00001096<!-- _______________________________________________________________________ -->
Reid Spencer138249b2007-05-16 18:44:01 +00001097<div class="doc_subsubsection"> <a name="t_integer">Integer Type</a> </div>
1098
1099<div class="doc_text">
1100
1101<h5>Overview:</h5>
1102<p>The integer type is a very simple derived type that simply specifies an
1103arbitrary bit width for the integer type desired. Any bit width from 1 bit to
11042^23-1 (about 8 million) can be specified.</p>
1105
1106<h5>Syntax:</h5>
1107
1108<pre>
1109 iN
1110</pre>
1111
1112<p>The number of bits the integer will occupy is specified by the <tt>N</tt>
1113value.</p>
1114
1115<h5>Examples:</h5>
1116<table class="layout">
Chris Lattner9a2e3cb2007-12-18 06:18:21 +00001117 <tbody>
1118 <tr>
1119 <td><tt>i1</tt></td>
1120 <td>a single-bit integer.</td>
1121 </tr><tr>
1122 <td><tt>i32</tt></td>
1123 <td>a 32-bit integer.</td>
1124 </tr><tr>
1125 <td><tt>i1942652</tt></td>
1126 <td>a really big integer of over 1 million bits.</td>
Reid Spencer138249b2007-05-16 18:44:01 +00001127 </tr>
Chris Lattner9a2e3cb2007-12-18 06:18:21 +00001128 </tbody>
Reid Spencer138249b2007-05-16 18:44:01 +00001129</table>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001130</div>
Reid Spencer138249b2007-05-16 18:44:01 +00001131
1132<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001133<div class="doc_subsubsection"> <a name="t_array">Array Type</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001134
Misha Brukman76307852003-11-08 01:05:38 +00001135<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001136
Chris Lattner2f7c9632001-06-06 20:29:01 +00001137<h5>Overview:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +00001138
Misha Brukman76307852003-11-08 01:05:38 +00001139<p>The array type is a very simple derived type that arranges elements
Chris Lattner48b383b02003-11-25 01:02:51 +00001140sequentially in memory. The array type requires a size (number of
1141elements) and an underlying data type.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001142
Chris Lattner590645f2002-04-14 06:13:44 +00001143<h5>Syntax:</h5>
Chris Lattner74d3f822004-12-09 17:30:23 +00001144
1145<pre>
1146 [&lt;# elements&gt; x &lt;elementtype&gt;]
1147</pre>
1148
John Criswell02fdc6f2005-05-12 16:52:32 +00001149<p>The number of elements is a constant integer value; elementtype may
Chris Lattner48b383b02003-11-25 01:02:51 +00001150be any type with a size.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001151
Chris Lattner590645f2002-04-14 06:13:44 +00001152<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001153<table class="layout">
1154 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001155 <td class="left"><tt>[40 x i32]</tt></td>
1156 <td class="left">Array of 40 32-bit integer values.</td>
1157 </tr>
1158 <tr class="layout">
1159 <td class="left"><tt>[41 x i32]</tt></td>
1160 <td class="left">Array of 41 32-bit integer values.</td>
1161 </tr>
1162 <tr class="layout">
1163 <td class="left"><tt>[4 x i8]</tt></td>
1164 <td class="left">Array of 4 8-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001165 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001166</table>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001167<p>Here are some examples of multidimensional arrays:</p>
1168<table class="layout">
1169 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001170 <td class="left"><tt>[3 x [4 x i32]]</tt></td>
1171 <td class="left">3x4 array of 32-bit integer values.</td>
1172 </tr>
1173 <tr class="layout">
1174 <td class="left"><tt>[12 x [10 x float]]</tt></td>
1175 <td class="left">12x10 array of single precision floating point values.</td>
1176 </tr>
1177 <tr class="layout">
1178 <td class="left"><tt>[2 x [3 x [4 x i16]]]</tt></td>
1179 <td class="left">2x3x4 array of 16-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001180 </tr>
1181</table>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001182
John Criswell4c0cf7f2005-10-24 16:17:18 +00001183<p>Note that 'variable sized arrays' can be implemented in LLVM with a zero
1184length array. Normally, accesses past the end of an array are undefined in
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001185LLVM (e.g. it is illegal to access the 5th element of a 3 element array).
1186As a special case, however, zero length arrays are recognized to be variable
1187length. This allows implementation of 'pascal style arrays' with the LLVM
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001188type "{ i32, [0 x float]}", for example.</p>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00001189
Misha Brukman76307852003-11-08 01:05:38 +00001190</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001191
Chris Lattner2f7c9632001-06-06 20:29:01 +00001192<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001193<div class="doc_subsubsection"> <a name="t_function">Function Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001194<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001195<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001196<p>The function type can be thought of as a function signature. It
1197consists of a return type and a list of formal parameter types.
John Criswella0d50d22003-11-25 21:45:46 +00001198Function types are usually used to build virtual function tables
Chris Lattner48b383b02003-11-25 01:02:51 +00001199(which are structures of pointers to functions), for indirect function
1200calls, and when defining a function.</p>
John Criswella0d50d22003-11-25 21:45:46 +00001201<p>
1202The return type of a function type cannot be an aggregate type.
1203</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001204<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001205<pre> &lt;returntype&gt; (&lt;parameter list&gt;)<br></pre>
John Criswell4c0cf7f2005-10-24 16:17:18 +00001206<p>...where '<tt>&lt;parameter list&gt;</tt>' is a comma-separated list of type
Misha Brukman20f9a622004-08-12 20:16:08 +00001207specifiers. Optionally, the parameter list may include a type <tt>...</tt>,
Chris Lattner5ed60612003-09-03 00:41:47 +00001208which indicates that the function takes a variable number of arguments.
1209Variable argument functions can access their arguments with the <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001210 href="#int_varargs">variable argument handling intrinsic</a> functions.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001211<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001212<table class="layout">
1213 <tr class="layout">
Reid Spencer58c08712006-12-31 07:18:34 +00001214 <td class="left"><tt>i32 (i32)</tt></td>
1215 <td class="left">function taking an <tt>i32</tt>, returning an <tt>i32</tt>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001216 </td>
Reid Spencer58c08712006-12-31 07:18:34 +00001217 </tr><tr class="layout">
Reid Spencer314e1cb2007-07-19 23:13:04 +00001218 <td class="left"><tt>float&nbsp;(i16&nbsp;signext,&nbsp;i32&nbsp;*)&nbsp;*
Reid Spencer655dcc62006-12-31 07:20:23 +00001219 </tt></td>
Reid Spencer58c08712006-12-31 07:18:34 +00001220 <td class="left"><a href="#t_pointer">Pointer</a> to a function that takes
1221 an <tt>i16</tt> that should be sign extended and a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001222 <a href="#t_pointer">pointer</a> to <tt>i32</tt>, returning
Reid Spencer58c08712006-12-31 07:18:34 +00001223 <tt>float</tt>.
1224 </td>
1225 </tr><tr class="layout">
1226 <td class="left"><tt>i32 (i8*, ...)</tt></td>
1227 <td class="left">A vararg function that takes at least one
Reid Spencer3e628eb92007-01-04 16:43:23 +00001228 <a href="#t_pointer">pointer</a> to <tt>i8 </tt> (char in C),
Reid Spencer58c08712006-12-31 07:18:34 +00001229 which returns an integer. This is the signature for <tt>printf</tt> in
1230 LLVM.
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001231 </td>
1232 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001233</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00001234
Misha Brukman76307852003-11-08 01:05:38 +00001235</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001236<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001237<div class="doc_subsubsection"> <a name="t_struct">Structure Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001238<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001239<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001240<p>The structure type is used to represent a collection of data members
1241together in memory. The packing of the field types is defined to match
1242the ABI of the underlying processor. The elements of a structure may
1243be any type that has a size.</p>
1244<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1245and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1246field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1247instruction.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001248<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001249<pre> { &lt;type list&gt; }<br></pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001250<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001251<table class="layout">
1252 <tr class="layout">
Jeff Cohen5819f182007-04-22 01:17:39 +00001253 <td class="left"><tt>{ i32, i32, i32 }</tt></td>
1254 <td class="left">A triple of three <tt>i32</tt> values</td>
1255 </tr><tr class="layout">
1256 <td class="left"><tt>{&nbsp;float,&nbsp;i32&nbsp;(i32)&nbsp;*&nbsp;}</tt></td>
1257 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1258 second element is a <a href="#t_pointer">pointer</a> to a
1259 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1260 an <tt>i32</tt>.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001261 </tr>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001262</table>
Misha Brukman76307852003-11-08 01:05:38 +00001263</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001264
Chris Lattner2f7c9632001-06-06 20:29:01 +00001265<!-- _______________________________________________________________________ -->
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001266<div class="doc_subsubsection"> <a name="t_pstruct">Packed Structure Type</a>
1267</div>
1268<div class="doc_text">
1269<h5>Overview:</h5>
1270<p>The packed structure type is used to represent a collection of data members
1271together in memory. There is no padding between fields. Further, the alignment
1272of a packed structure is 1 byte. The elements of a packed structure may
1273be any type that has a size.</p>
1274<p>Structures are accessed using '<tt><a href="#i_load">load</a></tt>
1275and '<tt><a href="#i_store">store</a></tt>' by getting a pointer to a
1276field with the '<tt><a href="#i_getelementptr">getelementptr</a></tt>'
1277instruction.</p>
1278<h5>Syntax:</h5>
1279<pre> &lt; { &lt;type list&gt; } &gt; <br></pre>
1280<h5>Examples:</h5>
1281<table class="layout">
1282 <tr class="layout">
Jeff Cohen5819f182007-04-22 01:17:39 +00001283 <td class="left"><tt>&lt; { i32, i32, i32 } &gt;</tt></td>
1284 <td class="left">A triple of three <tt>i32</tt> values</td>
1285 </tr><tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001286 <td class="left"><tt>&lt; { float, i32 (i32)* } &gt;</tt></td>
Jeff Cohen5819f182007-04-22 01:17:39 +00001287 <td class="left">A pair, where the first element is a <tt>float</tt> and the
1288 second element is a <a href="#t_pointer">pointer</a> to a
1289 <a href="#t_function">function</a> that takes an <tt>i32</tt>, returning
1290 an <tt>i32</tt>.</td>
Andrew Lenharth8df88e22006-12-08 17:13:00 +00001291 </tr>
1292</table>
1293</div>
1294
1295<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001296<div class="doc_subsubsection"> <a name="t_pointer">Pointer Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001297<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00001298<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001299<p>As in many languages, the pointer type represents a pointer or
Christopher Lamb308121c2007-12-11 09:31:00 +00001300reference to another object, which must live in memory. Pointer types may have
1301an optional address space attribute defining the target-specific numbered
1302address space where the pointed-to object resides. The default address space is
1303zero.</p>
Chris Lattner590645f2002-04-14 06:13:44 +00001304<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001305<pre> &lt;type&gt; *<br></pre>
Chris Lattner590645f2002-04-14 06:13:44 +00001306<h5>Examples:</h5>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001307<table class="layout">
1308 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001309 <td class="left"><tt>[4x i32]*</tt></td>
1310 <td class="left">A <a href="#t_pointer">pointer</a> to <a
1311 href="#t_array">array</a> of four <tt>i32</tt> values.</td>
1312 </tr>
1313 <tr class="layout">
1314 <td class="left"><tt>i32 (i32 *) *</tt></td>
1315 <td class="left"> A <a href="#t_pointer">pointer</a> to a <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001316 href="#t_function">function</a> that takes an <tt>i32*</tt>, returning an
Chris Lattner747359f2007-12-19 05:04:11 +00001317 <tt>i32</tt>.</td>
1318 </tr>
1319 <tr class="layout">
1320 <td class="left"><tt>i32 addrspace(5)*</tt></td>
1321 <td class="left">A <a href="#t_pointer">pointer</a> to an <tt>i32</tt> value
1322 that resides in address space #5.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001323 </tr>
Misha Brukman76307852003-11-08 01:05:38 +00001324</table>
Misha Brukman76307852003-11-08 01:05:38 +00001325</div>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001326
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001327<!-- _______________________________________________________________________ -->
Reid Spencer404a3252007-02-15 03:07:05 +00001328<div class="doc_subsubsection"> <a name="t_vector">Vector Type</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001329<div class="doc_text">
Chris Lattner37b6b092005-04-25 17:34:15 +00001330
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001331<h5>Overview:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001332
Reid Spencer404a3252007-02-15 03:07:05 +00001333<p>A vector type is a simple derived type that represents a vector
1334of elements. Vector types are used when multiple primitive data
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001335are operated in parallel using a single instruction (SIMD).
Reid Spencer404a3252007-02-15 03:07:05 +00001336A vector type requires a size (number of
Chris Lattner330ce692005-11-10 01:44:22 +00001337elements) and an underlying primitive data type. Vectors must have a power
Reid Spencer404a3252007-02-15 03:07:05 +00001338of two length (1, 2, 4, 8, 16 ...). Vector types are
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001339considered <a href="#t_firstclass">first class</a>.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001340
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001341<h5>Syntax:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001342
1343<pre>
1344 &lt; &lt;# elements&gt; x &lt;elementtype&gt; &gt;
1345</pre>
1346
John Criswell4a3327e2005-05-13 22:25:59 +00001347<p>The number of elements is a constant integer value; elementtype may
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001348be any integer or floating point type.</p>
Chris Lattner37b6b092005-04-25 17:34:15 +00001349
Chris Lattnerc8cb6952004-08-12 19:12:28 +00001350<h5>Examples:</h5>
Chris Lattner37b6b092005-04-25 17:34:15 +00001351
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001352<table class="layout">
1353 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001354 <td class="left"><tt>&lt;4 x i32&gt;</tt></td>
1355 <td class="left">Vector of 4 32-bit integer values.</td>
1356 </tr>
1357 <tr class="layout">
1358 <td class="left"><tt>&lt;8 x float&gt;</tt></td>
1359 <td class="left">Vector of 8 32-bit floating-point values.</td>
1360 </tr>
1361 <tr class="layout">
1362 <td class="left"><tt>&lt;2 x i64&gt;</tt></td>
1363 <td class="left">Vector of 2 64-bit integer values.</td>
Reid Spencerc3c4c4f2004-11-01 08:19:36 +00001364 </tr>
1365</table>
Misha Brukman76307852003-11-08 01:05:38 +00001366</div>
1367
Chris Lattner37b6b092005-04-25 17:34:15 +00001368<!-- _______________________________________________________________________ -->
1369<div class="doc_subsubsection"> <a name="t_opaque">Opaque Type</a> </div>
1370<div class="doc_text">
1371
1372<h5>Overview:</h5>
1373
1374<p>Opaque types are used to represent unknown types in the system. This
Gordon Henriksena699c4d2007-10-14 00:34:53 +00001375corresponds (for example) to the C notion of a forward declared structure type.
Chris Lattner37b6b092005-04-25 17:34:15 +00001376In LLVM, opaque types can eventually be resolved to any type (not just a
1377structure type).</p>
1378
1379<h5>Syntax:</h5>
1380
1381<pre>
1382 opaque
1383</pre>
1384
1385<h5>Examples:</h5>
1386
1387<table class="layout">
1388 <tr class="layout">
Chris Lattner747359f2007-12-19 05:04:11 +00001389 <td class="left"><tt>opaque</tt></td>
1390 <td class="left">An opaque type.</td>
Chris Lattner37b6b092005-04-25 17:34:15 +00001391 </tr>
1392</table>
1393</div>
1394
1395
Chris Lattner74d3f822004-12-09 17:30:23 +00001396<!-- *********************************************************************** -->
1397<div class="doc_section"> <a name="constants">Constants</a> </div>
1398<!-- *********************************************************************** -->
1399
1400<div class="doc_text">
1401
1402<p>LLVM has several different basic types of constants. This section describes
1403them all and their syntax.</p>
1404
1405</div>
1406
1407<!-- ======================================================================= -->
Reid Spencer8f08d802004-12-09 18:02:53 +00001408<div class="doc_subsection"><a name="simpleconstants">Simple Constants</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001409
1410<div class="doc_text">
1411
1412<dl>
1413 <dt><b>Boolean constants</b></dt>
1414
1415 <dd>The two strings '<tt>true</tt>' and '<tt>false</tt>' are both valid
Reid Spencer36a15422007-01-12 03:35:51 +00001416 constants of the <tt><a href="#t_primitive">i1</a></tt> type.
Chris Lattner74d3f822004-12-09 17:30:23 +00001417 </dd>
1418
1419 <dt><b>Integer constants</b></dt>
1420
Reid Spencer8f08d802004-12-09 18:02:53 +00001421 <dd>Standard integers (such as '4') are constants of the <a
Reid Spencer3e628eb92007-01-04 16:43:23 +00001422 href="#t_integer">integer</a> type. Negative numbers may be used with
Chris Lattner74d3f822004-12-09 17:30:23 +00001423 integer types.
1424 </dd>
1425
1426 <dt><b>Floating point constants</b></dt>
1427
1428 <dd>Floating point constants use standard decimal notation (e.g. 123.421),
1429 exponential notation (e.g. 1.23421e+2), or a more precise hexadecimal
Chris Lattner74d3f822004-12-09 17:30:23 +00001430 notation (see below). Floating point constants must have a <a
1431 href="#t_floating">floating point</a> type. </dd>
1432
1433 <dt><b>Null pointer constants</b></dt>
1434
John Criswelldfe6a862004-12-10 15:51:16 +00001435 <dd>The identifier '<tt>null</tt>' is recognized as a null pointer constant
Chris Lattner74d3f822004-12-09 17:30:23 +00001436 and must be of <a href="#t_pointer">pointer type</a>.</dd>
1437
1438</dl>
1439
John Criswelldfe6a862004-12-10 15:51:16 +00001440<p>The one non-intuitive notation for constants is the optional hexadecimal form
Chris Lattner74d3f822004-12-09 17:30:23 +00001441of floating point constants. For example, the form '<tt>double
14420x432ff973cafa8000</tt>' is equivalent to (but harder to read than) '<tt>double
14434.5e+15</tt>'. The only time hexadecimal floating point constants are required
Reid Spencer8f08d802004-12-09 18:02:53 +00001444(and the only time that they are generated by the disassembler) is when a
1445floating point constant must be emitted but it cannot be represented as a
1446decimal floating point number. For example, NaN's, infinities, and other
1447special values are represented in their IEEE hexadecimal format so that
1448assembly and disassembly do not cause any bits to change in the constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001449
1450</div>
1451
1452<!-- ======================================================================= -->
1453<div class="doc_subsection"><a name="aggregateconstants">Aggregate Constants</a>
1454</div>
1455
1456<div class="doc_text">
Chris Lattner455fc8c2005-03-07 22:13:59 +00001457<p>Aggregate constants arise from aggregation of simple constants
1458and smaller aggregate constants.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001459
1460<dl>
1461 <dt><b>Structure constants</b></dt>
1462
1463 <dd>Structure constants are represented with notation similar to structure
1464 type definitions (a comma separated list of elements, surrounded by braces
Chris Lattnerbea11172007-12-25 20:34:52 +00001465 (<tt>{}</tt>)). For example: "<tt>{ i32 4, float 17.0, i32* @G }</tt>",
1466 where "<tt>@G</tt>" is declared as "<tt>@G = external global i32</tt>". Structure constants
Chris Lattner455fc8c2005-03-07 22:13:59 +00001467 must have <a href="#t_struct">structure type</a>, and the number and
Chris Lattner74d3f822004-12-09 17:30:23 +00001468 types of elements must match those specified by the type.
1469 </dd>
1470
1471 <dt><b>Array constants</b></dt>
1472
1473 <dd>Array constants are represented with notation similar to array type
1474 definitions (a comma separated list of elements, surrounded by square brackets
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001475 (<tt>[]</tt>)). For example: "<tt>[ i32 42, i32 11, i32 74 ]</tt>". Array
Chris Lattner74d3f822004-12-09 17:30:23 +00001476 constants must have <a href="#t_array">array type</a>, and the number and
1477 types of elements must match those specified by the type.
1478 </dd>
1479
Reid Spencer404a3252007-02-15 03:07:05 +00001480 <dt><b>Vector constants</b></dt>
Chris Lattner74d3f822004-12-09 17:30:23 +00001481
Reid Spencer404a3252007-02-15 03:07:05 +00001482 <dd>Vector constants are represented with notation similar to vector type
Chris Lattner74d3f822004-12-09 17:30:23 +00001483 definitions (a comma separated list of elements, surrounded by
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001484 less-than/greater-than's (<tt>&lt;&gt;</tt>)). For example: "<tt>&lt; i32 42,
Jeff Cohen5819f182007-04-22 01:17:39 +00001485 i32 11, i32 74, i32 100 &gt;</tt>". Vector constants must have <a
Reid Spencer404a3252007-02-15 03:07:05 +00001486 href="#t_vector">vector type</a>, and the number and types of elements must
Chris Lattner74d3f822004-12-09 17:30:23 +00001487 match those specified by the type.
1488 </dd>
1489
1490 <dt><b>Zero initialization</b></dt>
1491
1492 <dd>The string '<tt>zeroinitializer</tt>' can be used to zero initialize a
1493 value to zero of <em>any</em> type, including scalar and aggregate types.
1494 This is often used to avoid having to print large zero initializers (e.g. for
John Criswell4c0cf7f2005-10-24 16:17:18 +00001495 large arrays) and is always exactly equivalent to using explicit zero
Chris Lattner74d3f822004-12-09 17:30:23 +00001496 initializers.
1497 </dd>
1498</dl>
1499
1500</div>
1501
1502<!-- ======================================================================= -->
1503<div class="doc_subsection">
1504 <a name="globalconstants">Global Variable and Function Addresses</a>
1505</div>
1506
1507<div class="doc_text">
1508
1509<p>The addresses of <a href="#globalvars">global variables</a> and <a
1510href="#functionstructure">functions</a> are always implicitly valid (link-time)
John Criswelldfe6a862004-12-10 15:51:16 +00001511constants. These constants are explicitly referenced when the <a
1512href="#identifiers">identifier for the global</a> is used and always have <a
Chris Lattner74d3f822004-12-09 17:30:23 +00001513href="#t_pointer">pointer</a> type. For example, the following is a legal LLVM
1514file:</p>
1515
Bill Wendling3716c5d2007-05-29 09:04:49 +00001516<div class="doc_code">
Chris Lattner74d3f822004-12-09 17:30:23 +00001517<pre>
Chris Lattner00538a12007-06-06 18:28:13 +00001518@X = global i32 17
1519@Y = global i32 42
1520@Z = global [2 x i32*] [ i32* @X, i32* @Y ]
Chris Lattner74d3f822004-12-09 17:30:23 +00001521</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001522</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001523
1524</div>
1525
1526<!-- ======================================================================= -->
Reid Spencer641f5c92004-12-09 18:13:12 +00001527<div class="doc_subsection"><a name="undefvalues">Undefined Values</a></div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001528<div class="doc_text">
Reid Spencer641f5c92004-12-09 18:13:12 +00001529 <p>The string '<tt>undef</tt>' is recognized as a type-less constant that has
John Criswell4a3327e2005-05-13 22:25:59 +00001530 no specific value. Undefined values may be of any type and be used anywhere
Reid Spencer641f5c92004-12-09 18:13:12 +00001531 a constant is permitted.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001532
Reid Spencer641f5c92004-12-09 18:13:12 +00001533 <p>Undefined values indicate to the compiler that the program is well defined
1534 no matter what value is used, giving the compiler more freedom to optimize.
1535 </p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001536</div>
1537
1538<!-- ======================================================================= -->
1539<div class="doc_subsection"><a name="constantexprs">Constant Expressions</a>
1540</div>
1541
1542<div class="doc_text">
1543
1544<p>Constant expressions are used to allow expressions involving other constants
1545to be used as constants. Constant expressions may be of any <a
John Criswell4a3327e2005-05-13 22:25:59 +00001546href="#t_firstclass">first class</a> type and may involve any LLVM operation
Chris Lattner74d3f822004-12-09 17:30:23 +00001547that does not have side effects (e.g. load and call are not supported). The
1548following is the syntax for constant expressions:</p>
1549
1550<dl>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001551 <dt><b><tt>trunc ( CST to TYPE )</tt></b></dt>
1552 <dd>Truncate a constant to another type. The bit size of CST must be larger
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001553 than the bit size of TYPE. Both types must be integers.</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001554
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001555 <dt><b><tt>zext ( CST to TYPE )</tt></b></dt>
1556 <dd>Zero extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001557 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001558
1559 <dt><b><tt>sext ( CST to TYPE )</tt></b></dt>
1560 <dd>Sign extend a constant to another type. The bit size of CST must be
Chris Lattnerc0f423a2007-01-15 01:54:13 +00001561 smaller or equal to the bit size of TYPE. Both types must be integers.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001562
1563 <dt><b><tt>fptrunc ( CST to TYPE )</tt></b></dt>
1564 <dd>Truncate a floating point constant to another floating point type. The
1565 size of CST must be larger than the size of TYPE. Both types must be
1566 floating point.</dd>
1567
1568 <dt><b><tt>fpext ( CST to TYPE )</tt></b></dt>
1569 <dd>Floating point extend a constant to another type. The size of CST must be
1570 smaller or equal to the size of TYPE. Both types must be floating point.</dd>
1571
Reid Spencer753163d2007-07-31 14:40:14 +00001572 <dt><b><tt>fptoui ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001573 <dd>Convert a floating point constant to the corresponding unsigned integer
Nate Begemand4d45c22007-11-17 03:58:34 +00001574 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1575 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1576 of the same number of elements. If the value won't fit in the integer type,
1577 the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001578
Reid Spencer51b07252006-11-09 23:03:26 +00001579 <dt><b><tt>fptosi ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001580 <dd>Convert a floating point constant to the corresponding signed integer
Nate Begemand4d45c22007-11-17 03:58:34 +00001581 constant. TYPE must be a scalar or vector integer type. CST must be of scalar
1582 or vector floating point type. Both CST and TYPE must be scalars, or vectors
1583 of the same number of elements. If the value won't fit in the integer type,
1584 the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001585
Reid Spencer51b07252006-11-09 23:03:26 +00001586 <dt><b><tt>uitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001587 <dd>Convert an unsigned integer constant to the corresponding floating point
Nate Begemand4d45c22007-11-17 03:58:34 +00001588 constant. TYPE must be a scalar or vector floating point type. CST must be of
1589 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1590 of the same number of elements. If the value won't fit in the floating point
1591 type, the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001592
Reid Spencer51b07252006-11-09 23:03:26 +00001593 <dt><b><tt>sitofp ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001594 <dd>Convert a signed integer constant to the corresponding floating point
Nate Begemand4d45c22007-11-17 03:58:34 +00001595 constant. TYPE must be a scalar or vector floating point type. CST must be of
1596 scalar or vector integer type. Both CST and TYPE must be scalars, or vectors
1597 of the same number of elements. If the value won't fit in the floating point
1598 type, the results are undefined.</dd>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001599
Reid Spencer5b950642006-11-11 23:08:07 +00001600 <dt><b><tt>ptrtoint ( CST to TYPE )</tt></b></dt>
1601 <dd>Convert a pointer typed constant to the corresponding integer constant
1602 TYPE must be an integer type. CST must be of pointer type. The CST value is
1603 zero extended, truncated, or unchanged to make it fit in TYPE.</dd>
1604
1605 <dt><b><tt>inttoptr ( CST to TYPE )</tt></b></dt>
1606 <dd>Convert a integer constant to a pointer constant. TYPE must be a
1607 pointer type. CST must be of integer type. The CST value is zero extended,
1608 truncated, or unchanged to make it fit in a pointer size. This one is
1609 <i>really</i> dangerous!</dd>
1610
1611 <dt><b><tt>bitcast ( CST to TYPE )</tt></b></dt>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001612 <dd>Convert a constant, CST, to another TYPE. The size of CST and TYPE must be
1613 identical (same number of bits). The conversion is done as if the CST value
1614 was stored to memory and read back as TYPE. In other words, no bits change
Reid Spencer5b950642006-11-11 23:08:07 +00001615 with this operator, just the type. This can be used for conversion of
Reid Spencer404a3252007-02-15 03:07:05 +00001616 vector types to any other type, as long as they have the same bit width. For
Reid Spencer5b950642006-11-11 23:08:07 +00001617 pointers it is only valid to cast to another pointer type.
Reid Spencer59b6b7d2006-11-08 01:11:31 +00001618 </dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001619
1620 <dt><b><tt>getelementptr ( CSTPTR, IDX0, IDX1, ... )</tt></b></dt>
1621
1622 <dd>Perform the <a href="#i_getelementptr">getelementptr operation</a> on
1623 constants. As with the <a href="#i_getelementptr">getelementptr</a>
1624 instruction, the index list may have zero or more indexes, which are required
1625 to make sense for the type of "CSTPTR".</dd>
1626
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001627 <dt><b><tt>select ( COND, VAL1, VAL2 )</tt></b></dt>
1628
1629 <dd>Perform the <a href="#i_select">select operation</a> on
Reid Spencer9965ee72006-12-04 19:23:19 +00001630 constants.</dd>
1631
1632 <dt><b><tt>icmp COND ( VAL1, VAL2 )</tt></b></dt>
1633 <dd>Performs the <a href="#i_icmp">icmp operation</a> on constants.</dd>
1634
1635 <dt><b><tt>fcmp COND ( VAL1, VAL2 )</tt></b></dt>
1636 <dd>Performs the <a href="#i_fcmp">fcmp operation</a> on constants.</dd>
Robert Bocchino7e97a6d2006-01-10 19:31:34 +00001637
1638 <dt><b><tt>extractelement ( VAL, IDX )</tt></b></dt>
1639
1640 <dd>Perform the <a href="#i_extractelement">extractelement
1641 operation</a> on constants.
1642
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001643 <dt><b><tt>insertelement ( VAL, ELT, IDX )</tt></b></dt>
1644
1645 <dd>Perform the <a href="#i_insertelement">insertelement
Reid Spencer9965ee72006-12-04 19:23:19 +00001646 operation</a> on constants.</dd>
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00001647
Chris Lattner016a0e52006-04-08 00:13:41 +00001648
1649 <dt><b><tt>shufflevector ( VEC1, VEC2, IDXMASK )</tt></b></dt>
1650
1651 <dd>Perform the <a href="#i_shufflevector">shufflevector
Reid Spencer9965ee72006-12-04 19:23:19 +00001652 operation</a> on constants.</dd>
Chris Lattner016a0e52006-04-08 00:13:41 +00001653
Chris Lattner74d3f822004-12-09 17:30:23 +00001654 <dt><b><tt>OPCODE ( LHS, RHS )</tt></b></dt>
1655
Reid Spencer641f5c92004-12-09 18:13:12 +00001656 <dd>Perform the specified operation of the LHS and RHS constants. OPCODE may
1657 be any of the <a href="#binaryops">binary</a> or <a href="#bitwiseops">bitwise
Chris Lattner74d3f822004-12-09 17:30:23 +00001658 binary</a> operations. The constraints on operands are the same as those for
1659 the corresponding instruction (e.g. no bitwise operations on floating point
John Criswell02fdc6f2005-05-12 16:52:32 +00001660 values are allowed).</dd>
Chris Lattner74d3f822004-12-09 17:30:23 +00001661</dl>
Chris Lattner74d3f822004-12-09 17:30:23 +00001662</div>
Chris Lattnerb1652612004-03-08 16:49:10 +00001663
Chris Lattner2f7c9632001-06-06 20:29:01 +00001664<!-- *********************************************************************** -->
Chris Lattner98f013c2006-01-25 23:47:57 +00001665<div class="doc_section"> <a name="othervalues">Other Values</a> </div>
1666<!-- *********************************************************************** -->
1667
1668<!-- ======================================================================= -->
1669<div class="doc_subsection">
1670<a name="inlineasm">Inline Assembler Expressions</a>
1671</div>
1672
1673<div class="doc_text">
1674
1675<p>
1676LLVM supports inline assembler expressions (as opposed to <a href="#moduleasm">
1677Module-Level Inline Assembly</a>) through the use of a special value. This
1678value represents the inline assembler as a string (containing the instructions
1679to emit), a list of operand constraints (stored as a string), and a flag that
1680indicates whether or not the inline asm expression has side effects. An example
1681inline assembler expression is:
1682</p>
1683
Bill Wendling3716c5d2007-05-29 09:04:49 +00001684<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001685<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001686i32 (i32) asm "bswap $0", "=r,r"
Chris Lattner98f013c2006-01-25 23:47:57 +00001687</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001688</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001689
1690<p>
1691Inline assembler expressions may <b>only</b> be used as the callee operand of
1692a <a href="#i_call"><tt>call</tt> instruction</a>. Thus, typically we have:
1693</p>
1694
Bill Wendling3716c5d2007-05-29 09:04:49 +00001695<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001696<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001697%X = call i32 asm "<a href="#int_bswap">bswap</a> $0", "=r,r"(i32 %Y)
Chris Lattner98f013c2006-01-25 23:47:57 +00001698</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001699</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001700
1701<p>
1702Inline asms with side effects not visible in the constraint list must be marked
1703as having side effects. This is done through the use of the
1704'<tt>sideeffect</tt>' keyword, like so:
1705</p>
1706
Bill Wendling3716c5d2007-05-29 09:04:49 +00001707<div class="doc_code">
Chris Lattner98f013c2006-01-25 23:47:57 +00001708<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001709call void asm sideeffect "eieio", ""()
Chris Lattner98f013c2006-01-25 23:47:57 +00001710</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00001711</div>
Chris Lattner98f013c2006-01-25 23:47:57 +00001712
1713<p>TODO: The format of the asm and constraints string still need to be
1714documented here. Constraints on what can be done (e.g. duplication, moving, etc
1715need to be documented).
1716</p>
1717
1718</div>
1719
1720<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001721<div class="doc_section"> <a name="instref">Instruction Reference</a> </div>
1722<!-- *********************************************************************** -->
Chris Lattner74d3f822004-12-09 17:30:23 +00001723
Misha Brukman76307852003-11-08 01:05:38 +00001724<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001725
Chris Lattner48b383b02003-11-25 01:02:51 +00001726<p>The LLVM instruction set consists of several different
1727classifications of instructions: <a href="#terminators">terminator
John Criswell4a3327e2005-05-13 22:25:59 +00001728instructions</a>, <a href="#binaryops">binary instructions</a>,
1729<a href="#bitwiseops">bitwise binary instructions</a>, <a
Chris Lattner48b383b02003-11-25 01:02:51 +00001730 href="#memoryops">memory instructions</a>, and <a href="#otherops">other
1731instructions</a>.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001732
Misha Brukman76307852003-11-08 01:05:38 +00001733</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001734
Chris Lattner2f7c9632001-06-06 20:29:01 +00001735<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001736<div class="doc_subsection"> <a name="terminators">Terminator
1737Instructions</a> </div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001738
Misha Brukman76307852003-11-08 01:05:38 +00001739<div class="doc_text">
Chris Lattner74d3f822004-12-09 17:30:23 +00001740
Chris Lattner48b383b02003-11-25 01:02:51 +00001741<p>As mentioned <a href="#functionstructure">previously</a>, every
1742basic block in a program ends with a "Terminator" instruction, which
1743indicates which block should be executed after the current block is
1744finished. These terminator instructions typically yield a '<tt>void</tt>'
1745value: they produce control flow, not values (the one exception being
1746the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
John Criswelldfe6a862004-12-10 15:51:16 +00001747<p>There are six different terminator instructions: the '<a
Chris Lattner48b383b02003-11-25 01:02:51 +00001748 href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
1749instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001750the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
1751 href="#i_unwind"><tt>unwind</tt></a>' instruction, and the '<a
1752 href="#i_unreachable"><tt>unreachable</tt></a>' instruction.</p>
Chris Lattner74d3f822004-12-09 17:30:23 +00001753
Misha Brukman76307852003-11-08 01:05:38 +00001754</div>
Chris Lattner74d3f822004-12-09 17:30:23 +00001755
Chris Lattner2f7c9632001-06-06 20:29:01 +00001756<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001757<div class="doc_subsubsection"> <a name="i_ret">'<tt>ret</tt>'
1758Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001759<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001760<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001761<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 +00001762 ret void <i>; Return from void function</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001763</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001764<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001765<p>The '<tt>ret</tt>' instruction is used to return control flow (and a
John Criswell4a3327e2005-05-13 22:25:59 +00001766value) from a function back to the caller.</p>
John Criswell417228d2004-04-09 16:48:45 +00001767<p>There are two forms of the '<tt>ret</tt>' instruction: one that
Chris Lattner48b383b02003-11-25 01:02:51 +00001768returns a value and then causes control flow, and one that just causes
1769control flow to occur.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001770<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001771<p>The '<tt>ret</tt>' instruction may return any '<a
1772 href="#t_firstclass">first class</a>' type. Notice that a function is
1773not <a href="#wellformed">well formed</a> if there exists a '<tt>ret</tt>'
1774instruction inside of the function that returns a value that does not
1775match the return type of the function.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001776<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001777<p>When the '<tt>ret</tt>' instruction is executed, control flow
1778returns back to the calling function's context. If the caller is a "<a
John Criswell40db33f2004-06-25 15:16:57 +00001779 href="#i_call"><tt>call</tt></a>" instruction, execution continues at
Chris Lattner48b383b02003-11-25 01:02:51 +00001780the instruction after the call. If the caller was an "<a
1781 href="#i_invoke"><tt>invoke</tt></a>" instruction, execution continues
John Criswell02fdc6f2005-05-12 16:52:32 +00001782at the beginning of the "normal" destination block. If the instruction
Chris Lattner48b383b02003-11-25 01:02:51 +00001783returns a value, that value shall set the call or invoke instruction's
1784return value.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001785<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001786<pre> ret i32 5 <i>; Return an integer value of 5</i>
Chris Lattner590645f2002-04-14 06:13:44 +00001787 ret void <i>; Return from a void function</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001788</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001789</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001790<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00001791<div class="doc_subsubsection"> <a name="i_br">'<tt>br</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00001792<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001793<h5>Syntax:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001794<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 +00001795</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001796<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001797<p>The '<tt>br</tt>' instruction is used to cause control flow to
1798transfer to a different basic block in the current function. There are
1799two forms of this instruction, corresponding to a conditional branch
1800and an unconditional branch.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001801<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00001802<p>The conditional branch form of the '<tt>br</tt>' instruction takes a
Reid Spencer36a15422007-01-12 03:35:51 +00001803single '<tt>i1</tt>' value and two '<tt>label</tt>' values. The
Reid Spencer50c723a2007-02-19 23:54:10 +00001804unconditional form of the '<tt>br</tt>' instruction takes a single
1805'<tt>label</tt>' value as a target.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001806<h5>Semantics:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001807<p>Upon execution of a conditional '<tt>br</tt>' instruction, the '<tt>i1</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00001808argument is evaluated. If the value is <tt>true</tt>, control flows
1809to the '<tt>iftrue</tt>' <tt>label</tt> argument. If "cond" is <tt>false</tt>,
1810control flows to the '<tt>iffalse</tt>' <tt>label</tt> argument.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001811<h5>Example:</h5>
Reid Spencer36a15422007-01-12 03:35:51 +00001812<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 +00001813 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 +00001814</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001815<!-- _______________________________________________________________________ -->
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001816<div class="doc_subsubsection">
1817 <a name="i_switch">'<tt>switch</tt>' Instruction</a>
1818</div>
1819
Misha Brukman76307852003-11-08 01:05:38 +00001820<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00001821<h5>Syntax:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001822
1823<pre>
1824 switch &lt;intty&gt; &lt;value&gt;, label &lt;defaultdest&gt; [ &lt;intty&gt; &lt;val&gt;, label &lt;dest&gt; ... ]
1825</pre>
1826
Chris Lattner2f7c9632001-06-06 20:29:01 +00001827<h5>Overview:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001828
1829<p>The '<tt>switch</tt>' instruction is used to transfer control flow to one of
1830several different places. It is a generalization of the '<tt>br</tt>'
Misha Brukman76307852003-11-08 01:05:38 +00001831instruction, allowing a branch to occur to one of many possible
1832destinations.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001833
1834
Chris Lattner2f7c9632001-06-06 20:29:01 +00001835<h5>Arguments:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001836
1837<p>The '<tt>switch</tt>' instruction uses three parameters: an integer
1838comparison value '<tt>value</tt>', a default '<tt>label</tt>' destination, and
1839an array of pairs of comparison value constants and '<tt>label</tt>'s. The
1840table is not allowed to contain duplicate constant entries.</p>
1841
Chris Lattner2f7c9632001-06-06 20:29:01 +00001842<h5>Semantics:</h5>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001843
Chris Lattner48b383b02003-11-25 01:02:51 +00001844<p>The <tt>switch</tt> instruction specifies a table of values and
1845destinations. When the '<tt>switch</tt>' instruction is executed, this
John Criswellbcbb18c2004-06-25 16:05:06 +00001846table is searched for the given value. If the value is found, control flow is
1847transfered to the corresponding destination; otherwise, control flow is
1848transfered to the default destination.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001849
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001850<h5>Implementation:</h5>
1851
1852<p>Depending on properties of the target machine and the particular
1853<tt>switch</tt> instruction, this instruction may be code generated in different
John Criswellbcbb18c2004-06-25 16:05:06 +00001854ways. For example, it could be generated as a series of chained conditional
1855branches or with a lookup table.</p>
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001856
1857<h5>Example:</h5>
1858
1859<pre>
1860 <i>; Emulate a conditional br instruction</i>
Reid Spencer36a15422007-01-12 03:35:51 +00001861 %Val = <a href="#i_zext">zext</a> i1 %value to i32
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001862 switch i32 %Val, label %truedest [i32 0, label %falsedest ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001863
1864 <i>; Emulate an unconditional br instruction</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001865 switch i32 0, label %dest [ ]
Chris Lattnercf96c6c2004-02-24 04:54:45 +00001866
1867 <i>; Implement a jump table:</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00001868 switch i32 %val, label %otherwise [ i32 0, label %onzero
1869 i32 1, label %onone
1870 i32 2, label %ontwo ]
Chris Lattner2f7c9632001-06-06 20:29:01 +00001871</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001872</div>
Chris Lattner0132aff2005-05-06 22:57:40 +00001873
Chris Lattner2f7c9632001-06-06 20:29:01 +00001874<!-- _______________________________________________________________________ -->
Chris Lattner0132aff2005-05-06 22:57:40 +00001875<div class="doc_subsubsection">
1876 <a name="i_invoke">'<tt>invoke</tt>' Instruction</a>
1877</div>
1878
Misha Brukman76307852003-11-08 01:05:38 +00001879<div class="doc_text">
Chris Lattner0132aff2005-05-06 22:57:40 +00001880
Chris Lattner2f7c9632001-06-06 20:29:01 +00001881<h5>Syntax:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001882
1883<pre>
1884 &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 +00001885 to label &lt;normal label&gt; unwind label &lt;exception label&gt;
Chris Lattner0132aff2005-05-06 22:57:40 +00001886</pre>
1887
Chris Lattnera8292f32002-05-06 22:08:29 +00001888<h5>Overview:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001889
1890<p>The '<tt>invoke</tt>' instruction causes control to transfer to a specified
1891function, with the possibility of control flow transfer to either the
John Criswell02fdc6f2005-05-12 16:52:32 +00001892'<tt>normal</tt>' label or the
1893'<tt>exception</tt>' label. If the callee function returns with the
Chris Lattner0132aff2005-05-06 22:57:40 +00001894"<tt><a href="#i_ret">ret</a></tt>" instruction, control flow will return to the
1895"normal" label. If the callee (or any indirect callees) returns with the "<a
John Criswell02fdc6f2005-05-12 16:52:32 +00001896href="#i_unwind"><tt>unwind</tt></a>" instruction, control is interrupted and
1897continued at the dynamically nearest "exception" label.</p>
Chris Lattner0132aff2005-05-06 22:57:40 +00001898
Chris Lattner2f7c9632001-06-06 20:29:01 +00001899<h5>Arguments:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001900
Misha Brukman76307852003-11-08 01:05:38 +00001901<p>This instruction requires several arguments:</p>
Chris Lattner0132aff2005-05-06 22:57:40 +00001902
Chris Lattner2f7c9632001-06-06 20:29:01 +00001903<ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00001904 <li>
Duncan Sands16f122e2007-03-30 12:22:09 +00001905 The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattner0132aff2005-05-06 22:57:40 +00001906 convention</a> the call should use. If none is specified, the call defaults
1907 to using C calling conventions.
1908 </li>
1909 <li>'<tt>ptr to function ty</tt>': shall be the signature of the pointer to
1910 function value being invoked. In most cases, this is a direct function
1911 invocation, but indirect <tt>invoke</tt>s are just as possible, branching off
1912 an arbitrary pointer to function value.
1913 </li>
1914
1915 <li>'<tt>function ptr val</tt>': An LLVM value containing a pointer to a
1916 function to be invoked. </li>
1917
1918 <li>'<tt>function args</tt>': argument list whose types match the function
1919 signature argument types. If the function signature indicates the function
1920 accepts a variable number of arguments, the extra arguments can be
1921 specified. </li>
1922
1923 <li>'<tt>normal label</tt>': the label reached when the called function
1924 executes a '<tt><a href="#i_ret">ret</a></tt>' instruction. </li>
1925
1926 <li>'<tt>exception label</tt>': the label reached when a callee returns with
1927 the <a href="#i_unwind"><tt>unwind</tt></a> instruction. </li>
1928
Chris Lattner2f7c9632001-06-06 20:29:01 +00001929</ol>
Chris Lattner0132aff2005-05-06 22:57:40 +00001930
Chris Lattner2f7c9632001-06-06 20:29:01 +00001931<h5>Semantics:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001932
Misha Brukman76307852003-11-08 01:05:38 +00001933<p>This instruction is designed to operate as a standard '<tt><a
Chris Lattner0132aff2005-05-06 22:57:40 +00001934href="#i_call">call</a></tt>' instruction in most regards. The primary
1935difference is that it establishes an association with a label, which is used by
1936the runtime library to unwind the stack.</p>
1937
1938<p>This instruction is used in languages with destructors to ensure that proper
1939cleanup is performed in the case of either a <tt>longjmp</tt> or a thrown
1940exception. Additionally, this is important for implementation of
1941'<tt>catch</tt>' clauses in high-level languages that support them.</p>
1942
Chris Lattner2f7c9632001-06-06 20:29:01 +00001943<h5>Example:</h5>
Chris Lattner0132aff2005-05-06 22:57:40 +00001944<pre>
Jeff Cohen5819f182007-04-22 01:17:39 +00001945 %retval = invoke i32 %Test(i32 15) to label %Continue
1946 unwind label %TestCleanup <i>; {i32}:retval set</i>
1947 %retval = invoke <a href="#callingconv">coldcc</a> i32 %Test(i32 15) to label %Continue
1948 unwind label %TestCleanup <i>; {i32}:retval set</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00001949</pre>
Misha Brukman76307852003-11-08 01:05:38 +00001950</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001951
1952
Chris Lattner5ed60612003-09-03 00:41:47 +00001953<!-- _______________________________________________________________________ -->
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001954
Chris Lattner48b383b02003-11-25 01:02:51 +00001955<div class="doc_subsubsection"> <a name="i_unwind">'<tt>unwind</tt>'
1956Instruction</a> </div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001957
Misha Brukman76307852003-11-08 01:05:38 +00001958<div class="doc_text">
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001959
Chris Lattner5ed60612003-09-03 00:41:47 +00001960<h5>Syntax:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001961<pre>
1962 unwind
1963</pre>
1964
Chris Lattner5ed60612003-09-03 00:41:47 +00001965<h5>Overview:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001966
1967<p>The '<tt>unwind</tt>' instruction unwinds the stack, continuing control flow
1968at the first callee in the dynamic call stack which used an <a
1969href="#i_invoke"><tt>invoke</tt></a> instruction to perform the call. This is
1970primarily used to implement exception handling.</p>
1971
Chris Lattner5ed60612003-09-03 00:41:47 +00001972<h5>Semantics:</h5>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001973
1974<p>The '<tt>unwind</tt>' intrinsic causes execution of the current function to
1975immediately halt. The dynamic call stack is then searched for the first <a
1976href="#i_invoke"><tt>invoke</tt></a> instruction on the call stack. Once found,
1977execution continues at the "exceptional" destination block specified by the
1978<tt>invoke</tt> instruction. If there is no <tt>invoke</tt> instruction in the
1979dynamic call chain, undefined behavior results.</p>
Misha Brukman76307852003-11-08 01:05:38 +00001980</div>
Chris Lattner08b7d5b2004-10-16 18:04:13 +00001981
1982<!-- _______________________________________________________________________ -->
1983
1984<div class="doc_subsubsection"> <a name="i_unreachable">'<tt>unreachable</tt>'
1985Instruction</a> </div>
1986
1987<div class="doc_text">
1988
1989<h5>Syntax:</h5>
1990<pre>
1991 unreachable
1992</pre>
1993
1994<h5>Overview:</h5>
1995
1996<p>The '<tt>unreachable</tt>' instruction has no defined semantics. This
1997instruction is used to inform the optimizer that a particular portion of the
1998code is not reachable. This can be used to indicate that the code after a
1999no-return function cannot be reached, and other facts.</p>
2000
2001<h5>Semantics:</h5>
2002
2003<p>The '<tt>unreachable</tt>' instruction has no defined semantics.</p>
2004</div>
2005
2006
2007
Chris Lattner2f7c9632001-06-06 20:29:01 +00002008<!-- ======================================================================= -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002009<div class="doc_subsection"> <a name="binaryops">Binary Operations</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002010<div class="doc_text">
Chris Lattner48b383b02003-11-25 01:02:51 +00002011<p>Binary operators are used to do most of the computation in a
2012program. They require two operands, execute an operation on them, and
John Criswelldfe6a862004-12-10 15:51:16 +00002013produce a single value. The operands might represent
Reid Spencer404a3252007-02-15 03:07:05 +00002014multiple data, as is the case with the <a href="#t_vector">vector</a> data type.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002015The result value of a binary operator is not
Chris Lattner48b383b02003-11-25 01:02:51 +00002016necessarily the same type as its operands.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002017<p>There are several different binary operators:</p>
Misha Brukman76307852003-11-08 01:05:38 +00002018</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002019<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002020<div class="doc_subsubsection"> <a name="i_add">'<tt>add</tt>'
2021Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002022<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002023<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002024<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 +00002025</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002026<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002027<p>The '<tt>add</tt>' instruction returns the sum of its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002028<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002029<p>The two arguments to the '<tt>add</tt>' instruction must be either <a
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002030 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a> values.
Reid Spencer404a3252007-02-15 03:07:05 +00002031 This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002032Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002033<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002034<p>The value produced is the integer or floating point sum of the two
2035operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002036<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002037<pre> &lt;result&gt; = add i32 4, %var <i>; yields {i32}:result = 4 + %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002038</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002039</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002040<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002041<div class="doc_subsubsection"> <a name="i_sub">'<tt>sub</tt>'
2042Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002043<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002044<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002045<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 +00002046</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002047<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002048<p>The '<tt>sub</tt>' instruction returns the difference of its two
2049operands.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002050<p>Note that the '<tt>sub</tt>' instruction is used to represent the '<tt>neg</tt>'
2051instruction present in most other intermediate representations.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002052<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002053<p>The two arguments to the '<tt>sub</tt>' instruction must be either <a
Chris Lattner48b383b02003-11-25 01:02:51 +00002054 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002055values.
Reid Spencer404a3252007-02-15 03:07:05 +00002056This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002057Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002058<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002059<p>The value produced is the integer or floating point difference of
2060the two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002061<h5>Example:</h5>
Bill Wendling2d8b9a82007-05-29 09:42:13 +00002062<pre>
2063 &lt;result&gt; = sub i32 4, %var <i>; yields {i32}:result = 4 - %var</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002064 &lt;result&gt; = sub i32 0, %val <i>; yields {i32}:result = -%var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002065</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002066</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002067<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002068<div class="doc_subsubsection"> <a name="i_mul">'<tt>mul</tt>'
2069Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002070<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002071<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002072<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 +00002073</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002074<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002075<p>The '<tt>mul</tt>' instruction returns the product of its two
2076operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002077<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002078<p>The two arguments to the '<tt>mul</tt>' instruction must be either <a
Chris Lattner48b383b02003-11-25 01:02:51 +00002079 href="#t_integer">integer</a> or <a href="#t_floating">floating point</a>
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002080values.
Reid Spencer404a3252007-02-15 03:07:05 +00002081This instruction can also take <a href="#t_vector">vector</a> versions of the values.
Chris Lattnerc8cb6952004-08-12 19:12:28 +00002082Both arguments must have identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002083<h5>Semantics:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002084<p>The value produced is the integer or floating point product of the
Misha Brukman76307852003-11-08 01:05:38 +00002085two operands.</p>
Reid Spencer3e628eb92007-01-04 16:43:23 +00002086<p>Because the operands are the same width, the result of an integer
2087multiplication is the same whether the operands should be deemed unsigned or
2088signed.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002089<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002090<pre> &lt;result&gt; = mul i32 4, %var <i>; yields {i32}:result = 4 * %var</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002091</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002092</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002093<!-- _______________________________________________________________________ -->
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002094<div class="doc_subsubsection"> <a name="i_udiv">'<tt>udiv</tt>' Instruction
2095</a></div>
2096<div class="doc_text">
2097<h5>Syntax:</h5>
2098<pre> &lt;result&gt; = udiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2099</pre>
2100<h5>Overview:</h5>
2101<p>The '<tt>udiv</tt>' instruction returns the quotient of its two
2102operands.</p>
2103<h5>Arguments:</h5>
2104<p>The two arguments to the '<tt>udiv</tt>' instruction must be
2105<a href="#t_integer">integer</a> values. Both arguments must have identical
Reid Spencer404a3252007-02-15 03:07:05 +00002106types. This instruction can also take <a href="#t_vector">vector</a> versions
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002107of the values in which case the elements must be integers.</p>
2108<h5>Semantics:</h5>
2109<p>The value produced is the unsigned integer quotient of the two operands. This
2110instruction always performs an unsigned division operation, regardless of
2111whether the arguments are unsigned or not.</p>
2112<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002113<pre> &lt;result&gt; = udiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002114</pre>
2115</div>
2116<!-- _______________________________________________________________________ -->
2117<div class="doc_subsubsection"> <a name="i_sdiv">'<tt>sdiv</tt>' Instruction
2118</a> </div>
2119<div class="doc_text">
2120<h5>Syntax:</h5>
2121<pre> &lt;result&gt; = sdiv &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2122</pre>
2123<h5>Overview:</h5>
2124<p>The '<tt>sdiv</tt>' instruction returns the quotient of its two
2125operands.</p>
2126<h5>Arguments:</h5>
2127<p>The two arguments to the '<tt>sdiv</tt>' instruction must be
2128<a href="#t_integer">integer</a> values. Both arguments must have identical
Reid Spencer404a3252007-02-15 03:07:05 +00002129types. This instruction can also take <a href="#t_vector">vector</a> versions
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002130of the values in which case the elements must be integers.</p>
2131<h5>Semantics:</h5>
2132<p>The value produced is the signed integer quotient of the two operands. This
2133instruction always performs a signed division operation, regardless of whether
2134the arguments are signed or not.</p>
2135<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002136<pre> &lt;result&gt; = sdiv i32 4, %var <i>; yields {i32}:result = 4 / %var</i>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002137</pre>
2138</div>
2139<!-- _______________________________________________________________________ -->
2140<div class="doc_subsubsection"> <a name="i_fdiv">'<tt>fdiv</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00002141Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002142<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002143<h5>Syntax:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002144<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 +00002145</pre>
2146<h5>Overview:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002147<p>The '<tt>fdiv</tt>' instruction returns the quotient of its two
Chris Lattner48b383b02003-11-25 01:02:51 +00002148operands.</p>
2149<h5>Arguments:</h5>
Jeff Cohen5819f182007-04-22 01:17:39 +00002150<p>The two arguments to the '<tt>fdiv</tt>' instruction must be
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002151<a href="#t_floating">floating point</a> values. Both arguments must have
Reid Spencer404a3252007-02-15 03:07:05 +00002152identical types. This instruction can also take <a href="#t_vector">vector</a>
Jeff Cohen5819f182007-04-22 01:17:39 +00002153versions of floating point values.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002154<h5>Semantics:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002155<p>The value produced is the floating point quotient of the two operands.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002156<h5>Example:</h5>
Reid Spencer7e80b0b2006-10-26 06:15:43 +00002157<pre> &lt;result&gt; = fdiv float 4.0, %var <i>; yields {float}:result = 4.0 / %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002158</pre>
2159</div>
2160<!-- _______________________________________________________________________ -->
Reid Spencer7eb55b32006-11-02 01:53:59 +00002161<div class="doc_subsubsection"> <a name="i_urem">'<tt>urem</tt>' Instruction</a>
2162</div>
2163<div class="doc_text">
2164<h5>Syntax:</h5>
2165<pre> &lt;result&gt; = urem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2166</pre>
2167<h5>Overview:</h5>
2168<p>The '<tt>urem</tt>' instruction returns the remainder from the
2169unsigned division of its two arguments.</p>
2170<h5>Arguments:</h5>
2171<p>The two arguments to the '<tt>urem</tt>' instruction must be
2172<a href="#t_integer">integer</a> values. Both arguments must have identical
Dan Gohman08143e32007-11-05 23:35:22 +00002173types. This instruction can also take <a href="#t_vector">vector</a> versions
2174of the values in which case the elements must be integers.</p>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002175<h5>Semantics:</h5>
2176<p>This instruction returns the unsigned integer <i>remainder</i> of a division.
2177This instruction always performs an unsigned division to get the remainder,
2178regardless of whether the arguments are unsigned or not.</p>
2179<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002180<pre> &lt;result&gt; = urem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002181</pre>
2182
2183</div>
2184<!-- _______________________________________________________________________ -->
2185<div class="doc_subsubsection"> <a name="i_srem">'<tt>srem</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00002186Instruction</a> </div>
2187<div class="doc_text">
2188<h5>Syntax:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002189<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 +00002190</pre>
2191<h5>Overview:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002192<p>The '<tt>srem</tt>' instruction returns the remainder from the
Dan Gohman08143e32007-11-05 23:35:22 +00002193signed division of its two operands. This instruction can also take
2194<a href="#t_vector">vector</a> versions of the values in which case
2195the elements must be integers.</p>
Chris Lattnerb8f816e2008-01-04 04:33:49 +00002196
Chris Lattner48b383b02003-11-25 01:02:51 +00002197<h5>Arguments:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002198<p>The two arguments to the '<tt>srem</tt>' instruction must be
2199<a href="#t_integer">integer</a> values. Both arguments must have identical
2200types.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002201<h5>Semantics:</h5>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002202<p>This instruction returns the <i>remainder</i> of a division (where the result
Reid Spencer806ad6a2007-03-24 22:23:39 +00002203has the same sign as the dividend, <tt>var1</tt>), not the <i>modulo</i>
2204operator (where the result has the same sign as the divisor, <tt>var2</tt>) of
2205a value. For more information about the difference, see <a
Chris Lattner48b383b02003-11-25 01:02:51 +00002206 href="http://mathforum.org/dr.math/problems/anne.4.28.99.html">The
Reid Spencer806ad6a2007-03-24 22:23:39 +00002207Math Forum</a>. For a table of how this is implemented in various languages,
Reid Spencerdb3b93b2007-03-24 22:40:44 +00002208please see <a href="http://en.wikipedia.org/wiki/Modulo_operation">
Reid Spencer806ad6a2007-03-24 22:23:39 +00002209Wikipedia: modulo operation</a>.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002210<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002211<pre> &lt;result&gt; = srem i32 4, %var <i>; yields {i32}:result = 4 % %var</i>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002212</pre>
2213
2214</div>
2215<!-- _______________________________________________________________________ -->
2216<div class="doc_subsubsection"> <a name="i_frem">'<tt>frem</tt>'
2217Instruction</a> </div>
2218<div class="doc_text">
2219<h5>Syntax:</h5>
2220<pre> &lt;result&gt; = frem &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2221</pre>
2222<h5>Overview:</h5>
2223<p>The '<tt>frem</tt>' instruction returns the remainder from the
2224division of its two operands.</p>
2225<h5>Arguments:</h5>
2226<p>The two arguments to the '<tt>frem</tt>' instruction must be
2227<a href="#t_floating">floating point</a> values. Both arguments must have
Dan Gohman08143e32007-11-05 23:35:22 +00002228identical types. This instruction can also take <a href="#t_vector">vector</a>
2229versions of floating point values.</p>
Reid Spencer7eb55b32006-11-02 01:53:59 +00002230<h5>Semantics:</h5>
2231<p>This instruction returns the <i>remainder</i> of a division.</p>
2232<h5>Example:</h5>
2233<pre> &lt;result&gt; = frem float 4.0, %var <i>; yields {float}:result = 4.0 % %var</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002234</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002235</div>
Robert Bocchino820bc75b2006-02-17 21:18:08 +00002236
Reid Spencer2ab01932007-02-02 13:57:07 +00002237<!-- ======================================================================= -->
2238<div class="doc_subsection"> <a name="bitwiseops">Bitwise Binary
2239Operations</a> </div>
2240<div class="doc_text">
2241<p>Bitwise binary operators are used to do various forms of
2242bit-twiddling in a program. They are generally very efficient
2243instructions and can commonly be strength reduced from other
2244instructions. They require two operands, execute an operation on them,
2245and produce a single value. The resulting value of the bitwise binary
2246operators is always the same type as its first operand.</p>
2247</div>
2248
Reid Spencer04e259b2007-01-31 21:39:12 +00002249<!-- _______________________________________________________________________ -->
2250<div class="doc_subsubsection"> <a name="i_shl">'<tt>shl</tt>'
2251Instruction</a> </div>
2252<div class="doc_text">
2253<h5>Syntax:</h5>
2254<pre> &lt;result&gt; = shl &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2255</pre>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002256
Reid Spencer04e259b2007-01-31 21:39:12 +00002257<h5>Overview:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002258
Reid Spencer04e259b2007-01-31 21:39:12 +00002259<p>The '<tt>shl</tt>' instruction returns the first operand shifted to
2260the left a specified number of bits.</p>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002261
Reid Spencer04e259b2007-01-31 21:39:12 +00002262<h5>Arguments:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002263
Reid Spencer04e259b2007-01-31 21:39:12 +00002264<p>Both arguments to the '<tt>shl</tt>' instruction must be the same <a
2265 href="#t_integer">integer</a> type.</p>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002266
Reid Spencer04e259b2007-01-31 21:39:12 +00002267<h5>Semantics:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002268
2269<p>The value produced is <tt>var1</tt> * 2<sup><tt>var2</tt></sup>. If
2270<tt>var2</tt> is (statically or dynamically) equal to or larger than the number
2271of bits in <tt>var1</tt>, the result is undefined.</p>
2272
Reid Spencer04e259b2007-01-31 21:39:12 +00002273<h5>Example:</h5><pre>
2274 &lt;result&gt; = shl i32 4, %var <i>; yields {i32}: 4 &lt;&lt; %var</i>
2275 &lt;result&gt; = shl i32 4, 2 <i>; yields {i32}: 16</i>
2276 &lt;result&gt; = shl i32 1, 10 <i>; yields {i32}: 1024</i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002277 &lt;result&gt; = shl i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002278</pre>
2279</div>
2280<!-- _______________________________________________________________________ -->
2281<div class="doc_subsubsection"> <a name="i_lshr">'<tt>lshr</tt>'
2282Instruction</a> </div>
2283<div class="doc_text">
2284<h5>Syntax:</h5>
2285<pre> &lt;result&gt; = lshr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2286</pre>
2287
2288<h5>Overview:</h5>
2289<p>The '<tt>lshr</tt>' instruction (logical shift right) returns the first
Jeff Cohen5819f182007-04-22 01:17:39 +00002290operand shifted to the right a specified number of bits with zero fill.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002291
2292<h5>Arguments:</h5>
2293<p>Both arguments to the '<tt>lshr</tt>' instruction must be the same
2294<a href="#t_integer">integer</a> type.</p>
2295
2296<h5>Semantics:</h5>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002297
Reid Spencer04e259b2007-01-31 21:39:12 +00002298<p>This instruction always performs a logical shift right operation. The most
2299significant bits of the result will be filled with zero bits after the
Chris Lattnerf0e50112007-10-03 21:01:14 +00002300shift. If <tt>var2</tt> is (statically or dynamically) equal to or larger than
2301the number of bits in <tt>var1</tt>, the result is undefined.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002302
2303<h5>Example:</h5>
2304<pre>
2305 &lt;result&gt; = lshr i32 4, 1 <i>; yields {i32}:result = 2</i>
2306 &lt;result&gt; = lshr i32 4, 2 <i>; yields {i32}:result = 1</i>
2307 &lt;result&gt; = lshr i8 4, 3 <i>; yields {i8}:result = 0</i>
2308 &lt;result&gt; = lshr i8 -2, 1 <i>; yields {i8}:result = 0x7FFFFFFF </i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002309 &lt;result&gt; = lshr i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002310</pre>
2311</div>
2312
Reid Spencer2ab01932007-02-02 13:57:07 +00002313<!-- _______________________________________________________________________ -->
Reid Spencer04e259b2007-01-31 21:39:12 +00002314<div class="doc_subsubsection"> <a name="i_ashr">'<tt>ashr</tt>'
2315Instruction</a> </div>
2316<div class="doc_text">
2317
2318<h5>Syntax:</h5>
2319<pre> &lt;result&gt; = ashr &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {ty}:result</i>
2320</pre>
2321
2322<h5>Overview:</h5>
2323<p>The '<tt>ashr</tt>' instruction (arithmetic shift right) returns the first
Jeff Cohen5819f182007-04-22 01:17:39 +00002324operand shifted to the right a specified number of bits with sign extension.</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002325
2326<h5>Arguments:</h5>
2327<p>Both arguments to the '<tt>ashr</tt>' instruction must be the same
2328<a href="#t_integer">integer</a> type.</p>
2329
2330<h5>Semantics:</h5>
2331<p>This instruction always performs an arithmetic shift right operation,
2332The most significant bits of the result will be filled with the sign bit
Chris Lattnerf0e50112007-10-03 21:01:14 +00002333of <tt>var1</tt>. If <tt>var2</tt> is (statically or dynamically) equal to or
2334larger than the number of bits in <tt>var1</tt>, the result is undefined.
2335</p>
Reid Spencer04e259b2007-01-31 21:39:12 +00002336
2337<h5>Example:</h5>
2338<pre>
2339 &lt;result&gt; = ashr i32 4, 1 <i>; yields {i32}:result = 2</i>
2340 &lt;result&gt; = ashr i32 4, 2 <i>; yields {i32}:result = 1</i>
2341 &lt;result&gt; = ashr i8 4, 3 <i>; yields {i8}:result = 0</i>
2342 &lt;result&gt; = ashr i8 -2, 1 <i>; yields {i8}:result = -1</i>
Chris Lattnerf0e50112007-10-03 21:01:14 +00002343 &lt;result&gt; = ashr i32 1, 32 <i>; undefined</i>
Reid Spencer04e259b2007-01-31 21:39:12 +00002344</pre>
2345</div>
2346
Chris Lattner2f7c9632001-06-06 20:29:01 +00002347<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002348<div class="doc_subsubsection"> <a name="i_and">'<tt>and</tt>'
2349Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002350<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002351<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002352<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 +00002353</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002354<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002355<p>The '<tt>and</tt>' instruction returns the bitwise logical and of
2356its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002357<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002358<p>The two arguments to the '<tt>and</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002359 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002360identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002361<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002362<p>The truth table used for the '<tt>and</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002363<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002364<div style="align: center">
Misha Brukman76307852003-11-08 01:05:38 +00002365<table border="1" cellspacing="0" cellpadding="4">
Chris Lattner48b383b02003-11-25 01:02:51 +00002366 <tbody>
2367 <tr>
2368 <td>In0</td>
2369 <td>In1</td>
2370 <td>Out</td>
2371 </tr>
2372 <tr>
2373 <td>0</td>
2374 <td>0</td>
2375 <td>0</td>
2376 </tr>
2377 <tr>
2378 <td>0</td>
2379 <td>1</td>
2380 <td>0</td>
2381 </tr>
2382 <tr>
2383 <td>1</td>
2384 <td>0</td>
2385 <td>0</td>
2386 </tr>
2387 <tr>
2388 <td>1</td>
2389 <td>1</td>
2390 <td>1</td>
2391 </tr>
2392 </tbody>
2393</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002394</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002395<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002396<pre> &lt;result&gt; = and i32 4, %var <i>; yields {i32}:result = 4 &amp; %var</i>
2397 &lt;result&gt; = and i32 15, 40 <i>; yields {i32}:result = 8</i>
2398 &lt;result&gt; = and i32 4, 8 <i>; yields {i32}:result = 0</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002399</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002400</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002401<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002402<div class="doc_subsubsection"> <a name="i_or">'<tt>or</tt>' Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002403<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002404<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002405<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 +00002406</pre>
Chris Lattner48b383b02003-11-25 01:02:51 +00002407<h5>Overview:</h5>
2408<p>The '<tt>or</tt>' instruction returns the bitwise logical inclusive
2409or of its two operands.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002410<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002411<p>The two arguments to the '<tt>or</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002412 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002413identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002414<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002415<p>The truth table used for the '<tt>or</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002416<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002417<div style="align: center">
Chris Lattner48b383b02003-11-25 01:02:51 +00002418<table border="1" cellspacing="0" cellpadding="4">
2419 <tbody>
2420 <tr>
2421 <td>In0</td>
2422 <td>In1</td>
2423 <td>Out</td>
2424 </tr>
2425 <tr>
2426 <td>0</td>
2427 <td>0</td>
2428 <td>0</td>
2429 </tr>
2430 <tr>
2431 <td>0</td>
2432 <td>1</td>
2433 <td>1</td>
2434 </tr>
2435 <tr>
2436 <td>1</td>
2437 <td>0</td>
2438 <td>1</td>
2439 </tr>
2440 <tr>
2441 <td>1</td>
2442 <td>1</td>
2443 <td>1</td>
2444 </tr>
2445 </tbody>
2446</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002447</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002448<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002449<pre> &lt;result&gt; = or i32 4, %var <i>; yields {i32}:result = 4 | %var</i>
2450 &lt;result&gt; = or i32 15, 40 <i>; yields {i32}:result = 47</i>
2451 &lt;result&gt; = or i32 4, 8 <i>; yields {i32}:result = 12</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002452</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002453</div>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002454<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002455<div class="doc_subsubsection"> <a name="i_xor">'<tt>xor</tt>'
2456Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002457<div class="doc_text">
Chris Lattner2f7c9632001-06-06 20:29:01 +00002458<h5>Syntax:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002459<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 +00002460</pre>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002461<h5>Overview:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002462<p>The '<tt>xor</tt>' instruction returns the bitwise logical exclusive
2463or of its two operands. The <tt>xor</tt> is used to implement the
2464"one's complement" operation, which is the "~" operator in C.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002465<h5>Arguments:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002466<p>The two arguments to the '<tt>xor</tt>' instruction must be <a
Chris Lattnerc0f423a2007-01-15 01:54:13 +00002467 href="#t_integer">integer</a> values. Both arguments must have
Chris Lattner48b383b02003-11-25 01:02:51 +00002468identical types.</p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002469<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002470<p>The truth table used for the '<tt>xor</tt>' instruction is:</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00002471<p> </p>
Misha Brukmanc501f552004-03-01 17:47:27 +00002472<div style="align: center">
Chris Lattner48b383b02003-11-25 01:02:51 +00002473<table border="1" cellspacing="0" cellpadding="4">
2474 <tbody>
2475 <tr>
2476 <td>In0</td>
2477 <td>In1</td>
2478 <td>Out</td>
2479 </tr>
2480 <tr>
2481 <td>0</td>
2482 <td>0</td>
2483 <td>0</td>
2484 </tr>
2485 <tr>
2486 <td>0</td>
2487 <td>1</td>
2488 <td>1</td>
2489 </tr>
2490 <tr>
2491 <td>1</td>
2492 <td>0</td>
2493 <td>1</td>
2494 </tr>
2495 <tr>
2496 <td>1</td>
2497 <td>1</td>
2498 <td>0</td>
2499 </tr>
2500 </tbody>
2501</table>
Misha Brukmanc501f552004-03-01 17:47:27 +00002502</div>
Chris Lattner48b383b02003-11-25 01:02:51 +00002503<p> </p>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002504<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002505<pre> &lt;result&gt; = xor i32 4, %var <i>; yields {i32}:result = 4 ^ %var</i>
2506 &lt;result&gt; = xor i32 15, 40 <i>; yields {i32}:result = 39</i>
2507 &lt;result&gt; = xor i32 4, 8 <i>; yields {i32}:result = 12</i>
2508 &lt;result&gt; = xor i32 %V, -1 <i>; yields {i32}:result = ~%V</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002509</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002510</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002511
Chris Lattner2f7c9632001-06-06 20:29:01 +00002512<!-- ======================================================================= -->
Chris Lattner54611b42005-11-06 08:02:57 +00002513<div class="doc_subsection">
Chris Lattnerce83bff2006-04-08 23:07:04 +00002514 <a name="vectorops">Vector Operations</a>
2515</div>
2516
2517<div class="doc_text">
2518
2519<p>LLVM supports several instructions to represent vector operations in a
Jeff Cohen5819f182007-04-22 01:17:39 +00002520target-independent manner. These instructions cover the element-access and
Chris Lattnerce83bff2006-04-08 23:07:04 +00002521vector-specific operations needed to process vectors effectively. While LLVM
2522does directly support these vector operations, many sophisticated algorithms
2523will want to use target-specific intrinsics to take full advantage of a specific
2524target.</p>
2525
2526</div>
2527
2528<!-- _______________________________________________________________________ -->
2529<div class="doc_subsubsection">
2530 <a name="i_extractelement">'<tt>extractelement</tt>' Instruction</a>
2531</div>
2532
2533<div class="doc_text">
2534
2535<h5>Syntax:</h5>
2536
2537<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002538 &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 +00002539</pre>
2540
2541<h5>Overview:</h5>
2542
2543<p>
2544The '<tt>extractelement</tt>' instruction extracts a single scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002545element from a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002546</p>
2547
2548
2549<h5>Arguments:</h5>
2550
2551<p>
2552The first operand of an '<tt>extractelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002553value of <a href="#t_vector">vector</a> type. The second operand is
Chris Lattnerce83bff2006-04-08 23:07:04 +00002554an index indicating the position from which to extract the element.
2555The index may be a variable.</p>
2556
2557<h5>Semantics:</h5>
2558
2559<p>
2560The result is a scalar of the same type as the element type of
2561<tt>val</tt>. Its value is the value at position <tt>idx</tt> of
2562<tt>val</tt>. If <tt>idx</tt> exceeds the length of <tt>val</tt>, the
2563results are undefined.
2564</p>
2565
2566<h5>Example:</h5>
2567
2568<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002569 %result = extractelement &lt;4 x i32&gt; %vec, i32 0 <i>; yields i32</i>
Chris Lattnerce83bff2006-04-08 23:07:04 +00002570</pre>
2571</div>
2572
2573
2574<!-- _______________________________________________________________________ -->
2575<div class="doc_subsubsection">
2576 <a name="i_insertelement">'<tt>insertelement</tt>' Instruction</a>
2577</div>
2578
2579<div class="doc_text">
2580
2581<h5>Syntax:</h5>
2582
2583<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002584 &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 +00002585</pre>
2586
2587<h5>Overview:</h5>
2588
2589<p>
2590The '<tt>insertelement</tt>' instruction inserts a scalar
Reid Spencer404a3252007-02-15 03:07:05 +00002591element into a vector at a specified index.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002592</p>
2593
2594
2595<h5>Arguments:</h5>
2596
2597<p>
2598The first operand of an '<tt>insertelement</tt>' instruction is a
Reid Spencer404a3252007-02-15 03:07:05 +00002599value of <a href="#t_vector">vector</a> type. The second operand is a
Chris Lattnerce83bff2006-04-08 23:07:04 +00002600scalar value whose type must equal the element type of the first
2601operand. The third operand is an index indicating the position at
2602which to insert the value. The index may be a variable.</p>
2603
2604<h5>Semantics:</h5>
2605
2606<p>
Reid Spencer404a3252007-02-15 03:07:05 +00002607The result is a vector of the same type as <tt>val</tt>. Its
Chris Lattnerce83bff2006-04-08 23:07:04 +00002608element values are those of <tt>val</tt> except at position
2609<tt>idx</tt>, where it gets the value <tt>elt</tt>. If <tt>idx</tt>
2610exceeds the length of <tt>val</tt>, the results are undefined.
2611</p>
2612
2613<h5>Example:</h5>
2614
2615<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002616 %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 +00002617</pre>
2618</div>
2619
2620<!-- _______________________________________________________________________ -->
2621<div class="doc_subsubsection">
2622 <a name="i_shufflevector">'<tt>shufflevector</tt>' Instruction</a>
2623</div>
2624
2625<div class="doc_text">
2626
2627<h5>Syntax:</h5>
2628
2629<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002630 &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 +00002631</pre>
2632
2633<h5>Overview:</h5>
2634
2635<p>
2636The '<tt>shufflevector</tt>' instruction constructs a permutation of elements
2637from two input vectors, returning a vector of the same type.
2638</p>
2639
2640<h5>Arguments:</h5>
2641
2642<p>
2643The first two operands of a '<tt>shufflevector</tt>' instruction are vectors
2644with types that match each other and types that match the result of the
2645instruction. The third argument is a shuffle mask, which has the same number
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002646of elements as the other vector type, but whose element type is always 'i32'.
Chris Lattnerce83bff2006-04-08 23:07:04 +00002647</p>
2648
2649<p>
2650The shuffle mask operand is required to be a constant vector with either
2651constant integer or undef values.
2652</p>
2653
2654<h5>Semantics:</h5>
2655
2656<p>
2657The elements of the two input vectors are numbered from left to right across
2658both of the vectors. The shuffle mask operand specifies, for each element of
2659the result vector, which element of the two input registers the result element
2660gets. The element selector may be undef (meaning "don't care") and the second
2661operand may be undef if performing a shuffle from only one vector.
2662</p>
2663
2664<h5>Example:</h5>
2665
2666<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002667 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; %v2,
Jeff Cohen5819f182007-04-22 01:17:39 +00002668 &lt;4 x i32&gt; &lt;i32 0, i32 4, i32 1, i32 5&gt; <i>; yields &lt;4 x i32&gt;</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002669 %result = shufflevector &lt;4 x i32&gt; %v1, &lt;4 x i32&gt; undef,
2670 &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 +00002671</pre>
2672</div>
2673
Tanya Lattnerb138bbe2006-04-14 19:24:33 +00002674
Chris Lattnerce83bff2006-04-08 23:07:04 +00002675<!-- ======================================================================= -->
2676<div class="doc_subsection">
Chris Lattner6ab66722006-08-15 00:45:58 +00002677 <a name="memoryops">Memory Access and Addressing Operations</a>
Chris Lattner54611b42005-11-06 08:02:57 +00002678</div>
2679
Misha Brukman76307852003-11-08 01:05:38 +00002680<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002681
Chris Lattner48b383b02003-11-25 01:02:51 +00002682<p>A key design point of an SSA-based representation is how it
2683represents memory. In LLVM, no memory locations are in SSA form, which
2684makes things very simple. This section describes how to read, write,
John Criswelldfe6a862004-12-10 15:51:16 +00002685allocate, and free memory in LLVM.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002686
Misha Brukman76307852003-11-08 01:05:38 +00002687</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002688
Chris Lattner2f7c9632001-06-06 20:29:01 +00002689<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002690<div class="doc_subsubsection">
2691 <a name="i_malloc">'<tt>malloc</tt>' Instruction</a>
2692</div>
2693
Misha Brukman76307852003-11-08 01:05:38 +00002694<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002695
Chris Lattner2f7c9632001-06-06 20:29:01 +00002696<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002697
2698<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002699 &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 +00002700</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002701
Chris Lattner2f7c9632001-06-06 20:29:01 +00002702<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002703
Chris Lattner48b383b02003-11-25 01:02:51 +00002704<p>The '<tt>malloc</tt>' instruction allocates memory from the system
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00002705heap and returns a pointer to it. The object is always allocated in the generic
2706address space (address space zero).</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002707
Chris Lattner2f7c9632001-06-06 20:29:01 +00002708<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002709
2710<p>The '<tt>malloc</tt>' instruction allocates
2711<tt>sizeof(&lt;type&gt;)*NumElements</tt>
John Criswella92e5862004-02-24 16:13:56 +00002712bytes of memory from the operating system and returns a pointer of the
Chris Lattner54611b42005-11-06 08:02:57 +00002713appropriate type to the program. If "NumElements" is specified, it is the
2714number of elements allocated. If an alignment is specified, the value result
2715of the allocation is guaranteed to be aligned to at least that boundary. If
2716not specified, or if zero, the target can choose to align the allocation on any
2717convenient boundary.</p>
2718
Misha Brukman76307852003-11-08 01:05:38 +00002719<p>'<tt>type</tt>' must be a sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002720
Chris Lattner2f7c9632001-06-06 20:29:01 +00002721<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002722
Chris Lattner48b383b02003-11-25 01:02:51 +00002723<p>Memory is allocated using the system "<tt>malloc</tt>" function, and
2724a pointer is returned.</p>
Misha Brukman76307852003-11-08 01:05:38 +00002725
Chris Lattner54611b42005-11-06 08:02:57 +00002726<h5>Example:</h5>
2727
2728<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002729 %array = malloc [4 x i8 ] <i>; yields {[%4 x i8]*}:array</i>
Chris Lattner54611b42005-11-06 08:02:57 +00002730
Bill Wendling2d8b9a82007-05-29 09:42:13 +00002731 %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
2732 %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>
2733 %array2 = malloc [12 x i8], i32 %size <i>; yields {[12 x i8]*}:array2</i>
2734 %array3 = malloc i32, i32 4, align 1024 <i>; yields {i32*}:array3</i>
2735 %array4 = malloc i32, align 1024 <i>; yields {i32*}:array4</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002736</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002737</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002738
Chris Lattner2f7c9632001-06-06 20:29:01 +00002739<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002740<div class="doc_subsubsection">
2741 <a name="i_free">'<tt>free</tt>' Instruction</a>
2742</div>
2743
Misha Brukman76307852003-11-08 01:05:38 +00002744<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002745
Chris Lattner2f7c9632001-06-06 20:29:01 +00002746<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002747
2748<pre>
2749 free &lt;type&gt; &lt;value&gt; <i>; yields {void}</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002750</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002751
Chris Lattner2f7c9632001-06-06 20:29:01 +00002752<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002753
Chris Lattner48b383b02003-11-25 01:02:51 +00002754<p>The '<tt>free</tt>' instruction returns memory back to the unused
John Criswell4a3327e2005-05-13 22:25:59 +00002755memory heap to be reallocated in the future.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002756
Chris Lattner2f7c9632001-06-06 20:29:01 +00002757<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002758
Chris Lattner48b383b02003-11-25 01:02:51 +00002759<p>'<tt>value</tt>' shall be a pointer value that points to a value
2760that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
2761instruction.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002762
Chris Lattner2f7c9632001-06-06 20:29:01 +00002763<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002764
John Criswelldfe6a862004-12-10 15:51:16 +00002765<p>Access to the memory pointed to by the pointer is no longer defined
Chris Lattner48b383b02003-11-25 01:02:51 +00002766after this instruction executes.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002767
Chris Lattner2f7c9632001-06-06 20:29:01 +00002768<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002769
2770<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002771 %array = <a href="#i_malloc">malloc</a> [4 x i8] <i>; yields {[4 x i8]*}:array</i>
2772 free [4 x i8]* %array
Chris Lattner2f7c9632001-06-06 20:29:01 +00002773</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002774</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002775
Chris Lattner2f7c9632001-06-06 20:29:01 +00002776<!-- _______________________________________________________________________ -->
Chris Lattner54611b42005-11-06 08:02:57 +00002777<div class="doc_subsubsection">
2778 <a name="i_alloca">'<tt>alloca</tt>' Instruction</a>
2779</div>
2780
Misha Brukman76307852003-11-08 01:05:38 +00002781<div class="doc_text">
Chris Lattner54611b42005-11-06 08:02:57 +00002782
Chris Lattner2f7c9632001-06-06 20:29:01 +00002783<h5>Syntax:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002784
2785<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002786 &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 +00002787</pre>
Chris Lattner54611b42005-11-06 08:02:57 +00002788
Chris Lattner2f7c9632001-06-06 20:29:01 +00002789<h5>Overview:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002790
Jeff Cohen5819f182007-04-22 01:17:39 +00002791<p>The '<tt>alloca</tt>' instruction allocates memory on the stack frame of the
2792currently executing function, to be automatically released when this function
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00002793returns to its caller. The object is always allocated in the generic address
2794space (address space zero).</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002795
Chris Lattner2f7c9632001-06-06 20:29:01 +00002796<h5>Arguments:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002797
John Criswelldfe6a862004-12-10 15:51:16 +00002798<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00002799bytes of memory on the runtime stack, returning a pointer of the
Chris Lattner54611b42005-11-06 08:02:57 +00002800appropriate type to the program. If "NumElements" is specified, it is the
2801number of elements allocated. If an alignment is specified, the value result
2802of the allocation is guaranteed to be aligned to at least that boundary. If
2803not specified, or if zero, the target can choose to align the allocation on any
2804convenient boundary.</p>
2805
Misha Brukman76307852003-11-08 01:05:38 +00002806<p>'<tt>type</tt>' may be any sized type.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002807
Chris Lattner2f7c9632001-06-06 20:29:01 +00002808<h5>Semantics:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002809
John Criswell4a3327e2005-05-13 22:25:59 +00002810<p>Memory is allocated; a pointer is returned. '<tt>alloca</tt>'d
Chris Lattner48b383b02003-11-25 01:02:51 +00002811memory is automatically released when the function returns. The '<tt>alloca</tt>'
2812instruction is commonly used to represent automatic variables that must
2813have an address available. When the function returns (either with the <tt><a
John Criswellc932bef2005-05-12 16:55:34 +00002814 href="#i_ret">ret</a></tt> or <tt><a href="#i_unwind">unwind</a></tt>
Misha Brukman76307852003-11-08 01:05:38 +00002815instructions), the memory is reclaimed.</p>
Chris Lattner54611b42005-11-06 08:02:57 +00002816
Chris Lattner2f7c9632001-06-06 20:29:01 +00002817<h5>Example:</h5>
Chris Lattner54611b42005-11-06 08:02:57 +00002818
2819<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002820 %ptr = alloca i32 <i>; yields {i32*}:ptr</i>
Bill Wendling3716c5d2007-05-29 09:04:49 +00002821 %ptr = alloca i32, i32 4 <i>; yields {i32*}:ptr</i>
2822 %ptr = alloca i32, i32 4, align 1024 <i>; yields {i32*}:ptr</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002823 %ptr = alloca i32, align 1024 <i>; yields {i32*}:ptr</i>
Chris Lattner2f7c9632001-06-06 20:29:01 +00002824</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002825</div>
Chris Lattner54611b42005-11-06 08:02:57 +00002826
Chris Lattner2f7c9632001-06-06 20:29:01 +00002827<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002828<div class="doc_subsubsection"> <a name="i_load">'<tt>load</tt>'
2829Instruction</a> </div>
Misha Brukman76307852003-11-08 01:05:38 +00002830<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00002831<h5>Syntax:</h5>
Christopher Lambbff50202007-04-21 08:16:25 +00002832<pre> &lt;result&gt; = load &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;]<br> &lt;result&gt; = volatile load &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;]<br></pre>
Chris Lattner095735d2002-05-06 03:03:22 +00002833<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002834<p>The '<tt>load</tt>' instruction is used to read from memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002835<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002836<p>The argument to the '<tt>load</tt>' instruction specifies the memory
John Criswell4c0cf7f2005-10-24 16:17:18 +00002837address from which to load. The pointer must point to a <a
Chris Lattner10ee9652004-06-03 22:57:15 +00002838 href="#t_firstclass">first class</a> type. If the <tt>load</tt> is
John Criswell4c0cf7f2005-10-24 16:17:18 +00002839marked as <tt>volatile</tt>, then the optimizer is not allowed to modify
Chris Lattner48b383b02003-11-25 01:02:51 +00002840the number or order of execution of this <tt>load</tt> with other
2841volatile <tt>load</tt> and <tt><a href="#i_store">store</a></tt>
2842instructions. </p>
Chris Lattner095735d2002-05-06 03:03:22 +00002843<h5>Semantics:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002844<p>The location of memory pointed to is loaded.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002845<h5>Examples:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002846<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Chris Lattner48b383b02003-11-25 01:02:51 +00002847 <a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002848 href="#i_store">store</a> i32 3, i32* %ptr <i>; yields {void}</i>
2849 %val = load i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002850</pre>
Misha Brukman76307852003-11-08 01:05:38 +00002851</div>
Chris Lattner095735d2002-05-06 03:03:22 +00002852<!-- _______________________________________________________________________ -->
Chris Lattner48b383b02003-11-25 01:02:51 +00002853<div class="doc_subsubsection"> <a name="i_store">'<tt>store</tt>'
2854Instruction</a> </div>
Reid Spencera89fb182006-11-09 21:18:01 +00002855<div class="doc_text">
Chris Lattner095735d2002-05-06 03:03:22 +00002856<h5>Syntax:</h5>
Christopher Lambbff50202007-04-21 08:16:25 +00002857<pre> store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
2858 volatile store &lt;ty&gt; &lt;value&gt;, &lt;ty&gt;* &lt;pointer&gt;[, align &lt;alignment&gt;] <i>; yields {void}</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002859</pre>
Chris Lattner095735d2002-05-06 03:03:22 +00002860<h5>Overview:</h5>
Misha Brukman76307852003-11-08 01:05:38 +00002861<p>The '<tt>store</tt>' instruction is used to write to memory.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002862<h5>Arguments:</h5>
Chris Lattner48b383b02003-11-25 01:02:51 +00002863<p>There are two arguments to the '<tt>store</tt>' instruction: a value
Jeff Cohen5819f182007-04-22 01:17:39 +00002864to store and an address at which to store it. The type of the '<tt>&lt;pointer&gt;</tt>'
Chris Lattner48b383b02003-11-25 01:02:51 +00002865operand must be a pointer to the type of the '<tt>&lt;value&gt;</tt>'
John Criswell4a3327e2005-05-13 22:25:59 +00002866operand. If the <tt>store</tt> is marked as <tt>volatile</tt>, then the
Chris Lattner48b383b02003-11-25 01:02:51 +00002867optimizer is not allowed to modify the number or order of execution of
2868this <tt>store</tt> with other volatile <tt>load</tt> and <tt><a
2869 href="#i_store">store</a></tt> instructions.</p>
2870<h5>Semantics:</h5>
2871<p>The contents of memory are updated to contain '<tt>&lt;value&gt;</tt>'
2872at the location specified by the '<tt>&lt;pointer&gt;</tt>' operand.</p>
Chris Lattner095735d2002-05-06 03:03:22 +00002873<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002874<pre> %ptr = <a href="#i_alloca">alloca</a> i32 <i>; yields {i32*}:ptr</i>
Bill Wendling8830ffe2007-10-22 05:10:05 +00002875 store i32 3, i32* %ptr <i>; yields {void}</i>
2876 %val = <a href="#i_load">load</a> i32* %ptr <i>; yields {i32}:val = i32 3</i>
Chris Lattner095735d2002-05-06 03:03:22 +00002877</pre>
Reid Spencer443460a2006-11-09 21:15:49 +00002878</div>
2879
Chris Lattner095735d2002-05-06 03:03:22 +00002880<!-- _______________________________________________________________________ -->
Chris Lattner33fd7022004-04-05 01:30:49 +00002881<div class="doc_subsubsection">
2882 <a name="i_getelementptr">'<tt>getelementptr</tt>' Instruction</a>
2883</div>
2884
Misha Brukman76307852003-11-08 01:05:38 +00002885<div class="doc_text">
Chris Lattner590645f2002-04-14 06:13:44 +00002886<h5>Syntax:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002887<pre>
2888 &lt;result&gt; = getelementptr &lt;ty&gt;* &lt;ptrval&gt;{, &lt;ty&gt; &lt;idx&gt;}*
2889</pre>
2890
Chris Lattner590645f2002-04-14 06:13:44 +00002891<h5>Overview:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002892
2893<p>
2894The '<tt>getelementptr</tt>' instruction is used to get the address of a
2895subelement of an aggregate data structure.</p>
2896
Chris Lattner590645f2002-04-14 06:13:44 +00002897<h5>Arguments:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002898
Reid Spencercee005c2006-12-04 21:29:24 +00002899<p>This instruction takes a list of integer operands that indicate what
Chris Lattner33fd7022004-04-05 01:30:49 +00002900elements of the aggregate object to index to. The actual types of the arguments
2901provided depend on the type of the first pointer argument. The
2902'<tt>getelementptr</tt>' instruction is used to index down through the type
John Criswell88190562005-05-16 16:17:45 +00002903levels of a structure or to a specific index in an array. When indexing into a
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002904structure, only <tt>i32</tt> integer constants are allowed. When indexing
Reid Spencercee005c2006-12-04 21:29:24 +00002905into an array or pointer, only integers of 32 or 64 bits are allowed, and will
2906be sign extended to 64-bit values.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002907
Chris Lattner48b383b02003-11-25 01:02:51 +00002908<p>For example, let's consider a C code fragment and how it gets
2909compiled to LLVM:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002910
Bill Wendling3716c5d2007-05-29 09:04:49 +00002911<div class="doc_code">
Chris Lattner33fd7022004-04-05 01:30:49 +00002912<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00002913struct RT {
2914 char A;
Chris Lattnera446f1b2007-05-29 15:43:56 +00002915 int B[10][20];
Bill Wendling3716c5d2007-05-29 09:04:49 +00002916 char C;
2917};
2918struct ST {
Chris Lattnera446f1b2007-05-29 15:43:56 +00002919 int X;
Bill Wendling3716c5d2007-05-29 09:04:49 +00002920 double Y;
2921 struct RT Z;
2922};
Chris Lattner33fd7022004-04-05 01:30:49 +00002923
Chris Lattnera446f1b2007-05-29 15:43:56 +00002924int *foo(struct ST *s) {
Bill Wendling3716c5d2007-05-29 09:04:49 +00002925 return &amp;s[1].Z.B[5][13];
2926}
Chris Lattner33fd7022004-04-05 01:30:49 +00002927</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00002928</div>
Chris Lattner33fd7022004-04-05 01:30:49 +00002929
Misha Brukman76307852003-11-08 01:05:38 +00002930<p>The LLVM code generated by the GCC frontend is:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002931
Bill Wendling3716c5d2007-05-29 09:04:49 +00002932<div class="doc_code">
Chris Lattner33fd7022004-04-05 01:30:49 +00002933<pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00002934%RT = type { i8 , [10 x [20 x i32]], i8 }
2935%ST = type { i32, double, %RT }
Chris Lattner33fd7022004-04-05 01:30:49 +00002936
Bill Wendling3716c5d2007-05-29 09:04:49 +00002937define i32* %foo(%ST* %s) {
2938entry:
2939 %reg = getelementptr %ST* %s, i32 1, i32 2, i32 1, i32 5, i32 13
2940 ret i32* %reg
2941}
Chris Lattner33fd7022004-04-05 01:30:49 +00002942</pre>
Bill Wendling3716c5d2007-05-29 09:04:49 +00002943</div>
Chris Lattner33fd7022004-04-05 01:30:49 +00002944
Chris Lattner590645f2002-04-14 06:13:44 +00002945<h5>Semantics:</h5>
Chris Lattner33fd7022004-04-05 01:30:49 +00002946
2947<p>The index types specified for the '<tt>getelementptr</tt>' instruction depend
John Criswell4a3327e2005-05-13 22:25:59 +00002948on the pointer type that is being indexed into. <a href="#t_pointer">Pointer</a>
Reid Spencercee005c2006-12-04 21:29:24 +00002949and <a href="#t_array">array</a> types can use a 32-bit or 64-bit
Reid Spencerc0312692006-12-03 16:53:48 +00002950<a href="#t_integer">integer</a> type but the value will always be sign extended
Jeff Cohen5819f182007-04-22 01:17:39 +00002951to 64-bits. <a href="#t_struct">Structure</a> types require <tt>i32</tt>
Reid Spencerc0312692006-12-03 16:53:48 +00002952<b>constants</b>.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002953
Misha Brukman76307852003-11-08 01:05:38 +00002954<p>In the example above, the first index is indexing into the '<tt>%ST*</tt>'
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002955type, which is a pointer, yielding a '<tt>%ST</tt>' = '<tt>{ i32, double, %RT
Chris Lattner33fd7022004-04-05 01:30:49 +00002956}</tt>' type, a structure. The second index indexes into the third element of
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002957the structure, yielding a '<tt>%RT</tt>' = '<tt>{ i8 , [10 x [20 x i32]],
2958i8 }</tt>' type, another structure. The third index indexes into the second
2959element of the structure, yielding a '<tt>[10 x [20 x i32]]</tt>' type, an
Chris Lattner33fd7022004-04-05 01:30:49 +00002960array. The two dimensions of the array are subscripted into, yielding an
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002961'<tt>i32</tt>' type. The '<tt>getelementptr</tt>' instruction returns a pointer
2962to this element, thus computing a value of '<tt>i32*</tt>' type.</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002963
Chris Lattner48b383b02003-11-25 01:02:51 +00002964<p>Note that it is perfectly legal to index partially through a
2965structure, returning a pointer to an inner element. Because of this,
2966the LLVM code for the given testcase is equivalent to:</p>
Chris Lattner33fd7022004-04-05 01:30:49 +00002967
2968<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002969 define i32* %foo(%ST* %s) {
2970 %t1 = getelementptr %ST* %s, i32 1 <i>; yields %ST*:%t1</i>
Jeff Cohen5819f182007-04-22 01:17:39 +00002971 %t2 = getelementptr %ST* %t1, i32 0, i32 2 <i>; yields %RT*:%t2</i>
2972 %t3 = getelementptr %RT* %t2, i32 0, i32 1 <i>; yields [10 x [20 x i32]]*:%t3</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002973 %t4 = getelementptr [10 x [20 x i32]]* %t3, i32 0, i32 5 <i>; yields [20 x i32]*:%t4</i>
2974 %t5 = getelementptr [20 x i32]* %t4, i32 0, i32 13 <i>; yields i32*:%t5</i>
2975 ret i32* %t5
Chris Lattner33fd7022004-04-05 01:30:49 +00002976 }
Chris Lattnera8292f32002-05-06 22:08:29 +00002977</pre>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00002978
2979<p>Note that it is undefined to access an array out of bounds: array and
2980pointer indexes must always be within the defined bounds of the array type.
2981The one exception for this rules is zero length arrays. These arrays are
2982defined to be accessible as variable length arrays, which requires access
2983beyond the zero'th element.</p>
2984
Chris Lattner6ab66722006-08-15 00:45:58 +00002985<p>The getelementptr instruction is often confusing. For some more insight
2986into how it works, see <a href="GetElementPtr.html">the getelementptr
2987FAQ</a>.</p>
2988
Chris Lattner590645f2002-04-14 06:13:44 +00002989<h5>Example:</h5>
Chris Lattnerc0ad71e2005-06-24 17:22:57 +00002990
Chris Lattner33fd7022004-04-05 01:30:49 +00002991<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00002992 <i>; yields [12 x i8]*:aptr</i>
2993 %aptr = getelementptr {i32, [12 x i8]}* %sptr, i64 0, i32 1
Chris Lattner33fd7022004-04-05 01:30:49 +00002994</pre>
Chris Lattner33fd7022004-04-05 01:30:49 +00002995</div>
Reid Spencer443460a2006-11-09 21:15:49 +00002996
Chris Lattner2f7c9632001-06-06 20:29:01 +00002997<!-- ======================================================================= -->
Reid Spencer97c5fa42006-11-08 01:18:52 +00002998<div class="doc_subsection"> <a name="convertops">Conversion Operations</a>
Misha Brukman76307852003-11-08 01:05:38 +00002999</div>
Misha Brukman76307852003-11-08 01:05:38 +00003000<div class="doc_text">
Reid Spencer97c5fa42006-11-08 01:18:52 +00003001<p>The instructions in this category are the conversion instructions (casting)
3002which all take a single operand and a type. They perform various bit conversions
3003on the operand.</p>
Misha Brukman76307852003-11-08 01:05:38 +00003004</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003005
Chris Lattnera8292f32002-05-06 22:08:29 +00003006<!-- _______________________________________________________________________ -->
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003007<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003008 <a name="i_trunc">'<tt>trunc .. to</tt>' Instruction</a>
3009</div>
3010<div class="doc_text">
3011
3012<h5>Syntax:</h5>
3013<pre>
3014 &lt;result&gt; = trunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3015</pre>
3016
3017<h5>Overview:</h5>
3018<p>
3019The '<tt>trunc</tt>' instruction truncates its operand to the type <tt>ty2</tt>.
3020</p>
3021
3022<h5>Arguments:</h5>
3023<p>
3024The '<tt>trunc</tt>' instruction takes a <tt>value</tt> to trunc, which must
3025be an <a href="#t_integer">integer</a> type, and a type that specifies the size
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003026and type of the result, which must be an <a href="#t_integer">integer</a>
Reid Spencer51b07252006-11-09 23:03:26 +00003027type. The bit size of <tt>value</tt> must be larger than the bit size of
3028<tt>ty2</tt>. Equal sized types are not allowed.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003029
3030<h5>Semantics:</h5>
3031<p>
3032The '<tt>trunc</tt>' instruction truncates the high order bits in <tt>value</tt>
Reid Spencer51b07252006-11-09 23:03:26 +00003033and converts the remaining bits to <tt>ty2</tt>. Since the source size must be
3034larger than the destination size, <tt>trunc</tt> cannot be a <i>no-op cast</i>.
3035It will always truncate bits.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003036
3037<h5>Example:</h5>
3038<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003039 %X = trunc i32 257 to i8 <i>; yields i8:1</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003040 %Y = trunc i32 123 to i1 <i>; yields i1:true</i>
3041 %Y = trunc i32 122 to i1 <i>; yields i1:false</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003042</pre>
3043</div>
3044
3045<!-- _______________________________________________________________________ -->
3046<div class="doc_subsubsection">
3047 <a name="i_zext">'<tt>zext .. to</tt>' Instruction</a>
3048</div>
3049<div class="doc_text">
3050
3051<h5>Syntax:</h5>
3052<pre>
3053 &lt;result&gt; = zext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3054</pre>
3055
3056<h5>Overview:</h5>
3057<p>The '<tt>zext</tt>' instruction zero extends its operand to type
3058<tt>ty2</tt>.</p>
3059
3060
3061<h5>Arguments:</h5>
3062<p>The '<tt>zext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003063<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3064also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00003065<tt>value</tt> must be smaller than the bit size of the destination type,
3066<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003067
3068<h5>Semantics:</h5>
3069<p>The <tt>zext</tt> fills the high order bits of the <tt>value</tt> with zero
Chris Lattnerc87f3df2007-05-24 19:13:27 +00003070bits until it reaches the size of the destination type, <tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003071
Reid Spencer07c9c682007-01-12 15:46:11 +00003072<p>When zero extending from i1, the result will always be either 0 or 1.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003073
3074<h5>Example:</h5>
3075<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003076 %X = zext i32 257 to i64 <i>; yields i64:257</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003077 %Y = zext i1 true to i32 <i>; yields i32:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003078</pre>
3079</div>
3080
3081<!-- _______________________________________________________________________ -->
3082<div class="doc_subsubsection">
3083 <a name="i_sext">'<tt>sext .. to</tt>' Instruction</a>
3084</div>
3085<div class="doc_text">
3086
3087<h5>Syntax:</h5>
3088<pre>
3089 &lt;result&gt; = sext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3090</pre>
3091
3092<h5>Overview:</h5>
3093<p>The '<tt>sext</tt>' sign extends <tt>value</tt> to the type <tt>ty2</tt>.</p>
3094
3095<h5>Arguments:</h5>
3096<p>
3097The '<tt>sext</tt>' instruction takes a value to cast, which must be of
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003098<a href="#t_integer">integer</a> type, and a type to cast it to, which must
3099also be of <a href="#t_integer">integer</a> type. The bit size of the
Reid Spencer51b07252006-11-09 23:03:26 +00003100<tt>value</tt> must be smaller than the bit size of the destination type,
3101<tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003102
3103<h5>Semantics:</h5>
3104<p>
3105The '<tt>sext</tt>' instruction performs a sign extension by copying the sign
3106bit (highest order bit) of the <tt>value</tt> until it reaches the bit size of
Chris Lattnerc87f3df2007-05-24 19:13:27 +00003107the type <tt>ty2</tt>.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003108
Reid Spencer36a15422007-01-12 03:35:51 +00003109<p>When sign extending from i1, the extension always results in -1 or 0.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003110
3111<h5>Example:</h5>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003112<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003113 %X = sext i8 -1 to i16 <i>; yields i16 :65535</i>
Reid Spencer36a15422007-01-12 03:35:51 +00003114 %Y = sext i1 true to i32 <i>; yields i32:-1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003115</pre>
3116</div>
3117
3118<!-- _______________________________________________________________________ -->
3119<div class="doc_subsubsection">
Reid Spencer2e2740d2006-11-09 21:48:10 +00003120 <a name="i_fptrunc">'<tt>fptrunc .. to</tt>' Instruction</a>
3121</div>
3122
3123<div class="doc_text">
3124
3125<h5>Syntax:</h5>
3126
3127<pre>
3128 &lt;result&gt; = fptrunc &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3129</pre>
3130
3131<h5>Overview:</h5>
3132<p>The '<tt>fptrunc</tt>' instruction truncates <tt>value</tt> to type
3133<tt>ty2</tt>.</p>
3134
3135
3136<h5>Arguments:</h5>
3137<p>The '<tt>fptrunc</tt>' instruction takes a <a href="#t_floating">floating
3138 point</a> value to cast and a <a href="#t_floating">floating point</a> type to
3139cast it to. The size of <tt>value</tt> must be larger than the size of
3140<tt>ty2</tt>. This implies that <tt>fptrunc</tt> cannot be used to make a
3141<i>no-op cast</i>.</p>
3142
3143<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003144<p> The '<tt>fptrunc</tt>' instruction truncates a <tt>value</tt> from a larger
3145<a href="#t_floating">floating point</a> type to a smaller
3146<a href="#t_floating">floating point</a> type. If the value cannot fit within
3147the destination type, <tt>ty2</tt>, then the results are undefined.</p>
Reid Spencer2e2740d2006-11-09 21:48:10 +00003148
3149<h5>Example:</h5>
3150<pre>
3151 %X = fptrunc double 123.0 to float <i>; yields float:123.0</i>
3152 %Y = fptrunc double 1.0E+300 to float <i>; yields undefined</i>
3153</pre>
3154</div>
3155
3156<!-- _______________________________________________________________________ -->
3157<div class="doc_subsubsection">
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003158 <a name="i_fpext">'<tt>fpext .. to</tt>' Instruction</a>
3159</div>
3160<div class="doc_text">
3161
3162<h5>Syntax:</h5>
3163<pre>
3164 &lt;result&gt; = fpext &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3165</pre>
3166
3167<h5>Overview:</h5>
3168<p>The '<tt>fpext</tt>' extends a floating point <tt>value</tt> to a larger
3169floating point value.</p>
3170
3171<h5>Arguments:</h5>
3172<p>The '<tt>fpext</tt>' instruction takes a
3173<a href="#t_floating">floating point</a> <tt>value</tt> to cast,
Reid Spencer51b07252006-11-09 23:03:26 +00003174and a <a href="#t_floating">floating point</a> type to cast it to. The source
3175type must be smaller than the destination type.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003176
3177<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003178<p>The '<tt>fpext</tt>' instruction extends the <tt>value</tt> from a smaller
Duncan Sands16f122e2007-03-30 12:22:09 +00003179<a href="#t_floating">floating point</a> type to a larger
3180<a href="#t_floating">floating point</a> type. The <tt>fpext</tt> cannot be
Reid Spencer51b07252006-11-09 23:03:26 +00003181used to make a <i>no-op cast</i> because it always changes bits. Use
Reid Spencer5b950642006-11-11 23:08:07 +00003182<tt>bitcast</tt> to make a <i>no-op cast</i> for a floating point cast.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003183
3184<h5>Example:</h5>
3185<pre>
3186 %X = fpext float 3.1415 to double <i>; yields double:3.1415</i>
3187 %Y = fpext float 1.0 to float <i>; yields float:1.0 (no-op)</i>
3188</pre>
3189</div>
3190
3191<!-- _______________________________________________________________________ -->
3192<div class="doc_subsubsection">
Reid Spencer2eadb532007-01-21 00:29:26 +00003193 <a name="i_fptoui">'<tt>fptoui .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003194</div>
3195<div class="doc_text">
3196
3197<h5>Syntax:</h5>
3198<pre>
Reid Spencer753163d2007-07-31 14:40:14 +00003199 &lt;result&gt; = fptoui &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003200</pre>
3201
3202<h5>Overview:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003203<p>The '<tt>fptoui</tt>' converts a floating point <tt>value</tt> to its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003204unsigned integer equivalent of type <tt>ty2</tt>.
3205</p>
3206
3207<h5>Arguments:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003208<p>The '<tt>fptoui</tt>' instruction takes a value to cast, which must be a
Nate Begemand4d45c22007-11-17 03:58:34 +00003209scalar or vector <a href="#t_floating">floating point</a> value, and a type
3210to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3211type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3212vector integer type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003213
3214<h5>Semantics:</h5>
Reid Spencer753163d2007-07-31 14:40:14 +00003215<p> The '<tt>fptoui</tt>' instruction converts its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003216<a href="#t_floating">floating point</a> operand into the nearest (rounding
3217towards zero) unsigned integer value. If the value cannot fit in <tt>ty2</tt>,
3218the results are undefined.</p>
3219
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003220<h5>Example:</h5>
3221<pre>
Reid Spencer753163d2007-07-31 14:40:14 +00003222 %X = fptoui double 123.0 to i32 <i>; yields i32:123</i>
Chris Lattner5b95a172007-09-22 03:17:52 +00003223 %Y = fptoui float 1.0E+300 to i1 <i>; yields undefined:1</i>
Reid Spencer753163d2007-07-31 14:40:14 +00003224 %X = fptoui float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003225</pre>
3226</div>
3227
3228<!-- _______________________________________________________________________ -->
3229<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003230 <a name="i_fptosi">'<tt>fptosi .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003231</div>
3232<div class="doc_text">
3233
3234<h5>Syntax:</h5>
3235<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003236 &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 +00003237</pre>
3238
3239<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003240<p>The '<tt>fptosi</tt>' instruction converts
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003241<a href="#t_floating">floating point</a> <tt>value</tt> to type <tt>ty2</tt>.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003242</p>
3243
Chris Lattnera8292f32002-05-06 22:08:29 +00003244<h5>Arguments:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003245<p> The '<tt>fptosi</tt>' instruction takes a value to cast, which must be a
Nate Begemand4d45c22007-11-17 03:58:34 +00003246scalar or vector <a href="#t_floating">floating point</a> value, and a type
3247to cast it to <tt>ty2</tt>, which must be an <a href="#t_integer">integer</a>
3248type. If <tt>ty</tt> is a vector floating point type, <tt>ty2</tt> must be a
3249vector integer type with the same number of elements as <tt>ty</tt></p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003250
Chris Lattnera8292f32002-05-06 22:08:29 +00003251<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003252<p>The '<tt>fptosi</tt>' instruction converts its
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003253<a href="#t_floating">floating point</a> operand into the nearest (rounding
3254towards zero) signed integer value. If the value cannot fit in <tt>ty2</tt>,
3255the results are undefined.</p>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003256
Chris Lattner70de6632001-07-09 00:26:23 +00003257<h5>Example:</h5>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003258<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003259 %X = fptosi double -123.0 to i32 <i>; yields i32:-123</i>
Chris Lattner5b95a172007-09-22 03:17:52 +00003260 %Y = fptosi float 1.0E-247 to i1 <i>; yields undefined:1</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003261 %X = fptosi float 1.04E+17 to i8 <i>; yields undefined:1</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003262</pre>
3263</div>
3264
3265<!-- _______________________________________________________________________ -->
3266<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003267 <a name="i_uitofp">'<tt>uitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003268</div>
3269<div class="doc_text">
3270
3271<h5>Syntax:</h5>
3272<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003273 &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 +00003274</pre>
3275
3276<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003277<p>The '<tt>uitofp</tt>' instruction regards <tt>value</tt> as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003278integer and converts that value to the <tt>ty2</tt> type.</p>
3279
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003280<h5>Arguments:</h5>
Nate Begemand4d45c22007-11-17 03:58:34 +00003281<p>The '<tt>uitofp</tt>' instruction takes a value to cast, which must be a
3282scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3283to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3284type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3285floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003286
3287<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003288<p>The '<tt>uitofp</tt>' instruction interprets its operand as an unsigned
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003289integer quantity and converts it to the corresponding floating point value. If
Jeff Cohenbeccb742007-04-22 14:56:37 +00003290the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003291
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003292<h5>Example:</h5>
3293<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003294 %X = uitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003295 %Y = uitofp i8 -1 to double <i>; yields double:255.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003296</pre>
3297</div>
3298
3299<!-- _______________________________________________________________________ -->
3300<div class="doc_subsubsection">
Reid Spencer51b07252006-11-09 23:03:26 +00003301 <a name="i_sitofp">'<tt>sitofp .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003302</div>
3303<div class="doc_text">
3304
3305<h5>Syntax:</h5>
3306<pre>
Reid Spencer51b07252006-11-09 23:03:26 +00003307 &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 +00003308</pre>
3309
3310<h5>Overview:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003311<p>The '<tt>sitofp</tt>' instruction regards <tt>value</tt> as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003312integer and converts that value to the <tt>ty2</tt> type.</p>
3313
3314<h5>Arguments:</h5>
Nate Begemand4d45c22007-11-17 03:58:34 +00003315<p>The '<tt>sitofp</tt>' instruction takes a value to cast, which must be a
3316scalar or vector <a href="#t_integer">integer</a> value, and a type to cast it
3317to <tt>ty2</tt>, which must be an <a href="#t_floating">floating point</a>
3318type. If <tt>ty</tt> is a vector integer type, <tt>ty2</tt> must be a vector
3319floating point type with the same number of elements as <tt>ty</tt></p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003320
3321<h5>Semantics:</h5>
Reid Spencer51b07252006-11-09 23:03:26 +00003322<p>The '<tt>sitofp</tt>' instruction interprets its operand as a signed
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003323integer quantity and converts it to the corresponding floating point value. If
Jeff Cohenbeccb742007-04-22 14:56:37 +00003324the value cannot fit in the floating point value, the results are undefined.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003325
3326<h5>Example:</h5>
3327<pre>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003328 %X = sitofp i32 257 to float <i>; yields float:257.0</i>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003329 %Y = sitofp i8 -1 to double <i>; yields double:-1.0</i>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003330</pre>
3331</div>
3332
3333<!-- _______________________________________________________________________ -->
3334<div class="doc_subsubsection">
Reid Spencerb7344ff2006-11-11 21:00:47 +00003335 <a name="i_ptrtoint">'<tt>ptrtoint .. to</tt>' Instruction</a>
3336</div>
3337<div class="doc_text">
3338
3339<h5>Syntax:</h5>
3340<pre>
3341 &lt;result&gt; = ptrtoint &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3342</pre>
3343
3344<h5>Overview:</h5>
3345<p>The '<tt>ptrtoint</tt>' instruction converts the pointer <tt>value</tt> to
3346the integer type <tt>ty2</tt>.</p>
3347
3348<h5>Arguments:</h5>
3349<p>The '<tt>ptrtoint</tt>' instruction takes a <tt>value</tt> to cast, which
Duncan Sands16f122e2007-03-30 12:22:09 +00003350must be a <a href="#t_pointer">pointer</a> value, and a type to cast it to
Reid Spencerb7344ff2006-11-11 21:00:47 +00003351<tt>ty2</tt>, which must be an <a href="#t_integer">integer</a> type.
3352
3353<h5>Semantics:</h5>
3354<p>The '<tt>ptrtoint</tt>' instruction converts <tt>value</tt> to integer type
3355<tt>ty2</tt> by interpreting the pointer value as an integer and either
3356truncating or zero extending that value to the size of the integer type. If
3357<tt>value</tt> is smaller than <tt>ty2</tt> then a zero extension is done. If
3358<tt>value</tt> is larger than <tt>ty2</tt> then a truncation is done. If they
Jeff Cohen222a8a42007-04-29 01:07:00 +00003359are the same size, then nothing is done (<i>no-op cast</i>) other than a type
3360change.</p>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003361
3362<h5>Example:</h5>
3363<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003364 %X = ptrtoint i32* %X to i8 <i>; yields truncation on 32-bit architecture</i>
3365 %Y = ptrtoint i32* %x to i64 <i>; yields zero extension on 32-bit architecture</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003366</pre>
3367</div>
3368
3369<!-- _______________________________________________________________________ -->
3370<div class="doc_subsubsection">
3371 <a name="i_inttoptr">'<tt>inttoptr .. to</tt>' Instruction</a>
3372</div>
3373<div class="doc_text">
3374
3375<h5>Syntax:</h5>
3376<pre>
3377 &lt;result&gt; = inttoptr &lt;ty&gt; &lt;value&gt; to &lt;ty2&gt; <i>; yields ty2</i>
3378</pre>
3379
3380<h5>Overview:</h5>
3381<p>The '<tt>inttoptr</tt>' instruction converts an integer <tt>value</tt> to
3382a pointer type, <tt>ty2</tt>.</p>
3383
3384<h5>Arguments:</h5>
Duncan Sands16f122e2007-03-30 12:22:09 +00003385<p>The '<tt>inttoptr</tt>' instruction takes an <a href="#t_integer">integer</a>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003386value to cast, and a type to cast it to, which must be a
Anton Korobeynikova0554d92007-01-12 19:20:47 +00003387<a href="#t_pointer">pointer</a> type.
Reid Spencerb7344ff2006-11-11 21:00:47 +00003388
3389<h5>Semantics:</h5>
3390<p>The '<tt>inttoptr</tt>' instruction converts <tt>value</tt> to type
3391<tt>ty2</tt> by applying either a zero extension or a truncation depending on
3392the size of the integer <tt>value</tt>. If <tt>value</tt> is larger than the
3393size of a pointer then a truncation is done. If <tt>value</tt> is smaller than
3394the size of a pointer then a zero extension is done. If they are the same size,
3395nothing is done (<i>no-op cast</i>).</p>
3396
3397<h5>Example:</h5>
3398<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003399 %X = inttoptr i32 255 to i32* <i>; yields zero extension on 64-bit architecture</i>
3400 %X = inttoptr i32 255 to i32* <i>; yields no-op on 32-bit architecture</i>
3401 %Y = inttoptr i64 0 to i32* <i>; yields truncation on 32-bit architecture</i>
Reid Spencerb7344ff2006-11-11 21:00:47 +00003402</pre>
3403</div>
3404
3405<!-- _______________________________________________________________________ -->
3406<div class="doc_subsubsection">
Reid Spencer5b950642006-11-11 23:08:07 +00003407 <a name="i_bitcast">'<tt>bitcast .. to</tt>' Instruction</a>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003408</div>
3409<div class="doc_text">
3410
3411<h5>Syntax:</h5>
3412<pre>
Reid Spencer5b950642006-11-11 23:08:07 +00003413 &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 +00003414</pre>
3415
3416<h5>Overview:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003417<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003418<tt>ty2</tt> without changing any bits.</p>
3419
3420<h5>Arguments:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003421<p>The '<tt>bitcast</tt>' instruction takes a value to cast, which must be
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003422a first class value, and a type to cast it to, which must also be a <a
3423 href="#t_firstclass">first class</a> type. The bit sizes of <tt>value</tt>
Reid Spencere3db84c2007-01-09 20:08:58 +00003424and the destination type, <tt>ty2</tt>, must be identical. If the source
3425type is a pointer, the destination type must also be a pointer.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003426
3427<h5>Semantics:</h5>
Reid Spencer5b950642006-11-11 23:08:07 +00003428<p>The '<tt>bitcast</tt>' instruction converts <tt>value</tt> to type
Reid Spencerb7344ff2006-11-11 21:00:47 +00003429<tt>ty2</tt>. It is always a <i>no-op cast</i> because no bits change with
3430this conversion. The conversion is done as if the <tt>value</tt> had been
3431stored to memory and read back as type <tt>ty2</tt>. Pointer types may only be
3432converted to other pointer types with this instruction. To convert pointers to
3433other types, use the <a href="#i_inttoptr">inttoptr</a> or
3434<a href="#i_ptrtoint">ptrtoint</a> instructions first.</p>
Reid Spencer59b6b7d2006-11-08 01:11:31 +00003435
3436<h5>Example:</h5>
3437<pre>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003438 %X = bitcast i8 255 to i8 <i>; yields i8 :-1</i>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003439 %Y = bitcast i32* %x to sint* <i>; yields sint*:%x</i>
3440 %Z = bitcast <2xint> %V to i64; <i>; yields i64: %V</i>
Chris Lattner70de6632001-07-09 00:26:23 +00003441</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003442</div>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003443
Reid Spencer97c5fa42006-11-08 01:18:52 +00003444<!-- ======================================================================= -->
3445<div class="doc_subsection"> <a name="otherops">Other Operations</a> </div>
3446<div class="doc_text">
3447<p>The instructions in this category are the "miscellaneous"
3448instructions, which defy better classification.</p>
3449</div>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003450
3451<!-- _______________________________________________________________________ -->
3452<div class="doc_subsubsection"><a name="i_icmp">'<tt>icmp</tt>' Instruction</a>
3453</div>
3454<div class="doc_text">
3455<h5>Syntax:</h5>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003456<pre> &lt;result&gt; = icmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {i1}:result</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003457</pre>
3458<h5>Overview:</h5>
3459<p>The '<tt>icmp</tt>' instruction returns a boolean value based on comparison
3460of its two integer operands.</p>
3461<h5>Arguments:</h5>
3462<p>The '<tt>icmp</tt>' instruction takes three operands. The first operand is
Jeff Cohen222a8a42007-04-29 01:07:00 +00003463the condition code indicating the kind of comparison to perform. It is not
3464a value, just a keyword. The possible condition code are:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003465<ol>
3466 <li><tt>eq</tt>: equal</li>
3467 <li><tt>ne</tt>: not equal </li>
3468 <li><tt>ugt</tt>: unsigned greater than</li>
3469 <li><tt>uge</tt>: unsigned greater or equal</li>
3470 <li><tt>ult</tt>: unsigned less than</li>
3471 <li><tt>ule</tt>: unsigned less or equal</li>
3472 <li><tt>sgt</tt>: signed greater than</li>
3473 <li><tt>sge</tt>: signed greater or equal</li>
3474 <li><tt>slt</tt>: signed less than</li>
3475 <li><tt>sle</tt>: signed less or equal</li>
3476</ol>
Chris Lattnerc0f423a2007-01-15 01:54:13 +00003477<p>The remaining two arguments must be <a href="#t_integer">integer</a> or
Reid Spencer784ef792007-01-04 05:19:58 +00003478<a href="#t_pointer">pointer</a> typed. They must also be identical types.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003479<h5>Semantics:</h5>
3480<p>The '<tt>icmp</tt>' compares <tt>var1</tt> and <tt>var2</tt> according to
3481the condition code given as <tt>cond</tt>. The comparison performed always
Reid Spencer36a15422007-01-12 03:35:51 +00003482yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003483<ol>
3484 <li><tt>eq</tt>: yields <tt>true</tt> if the operands are equal,
3485 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3486 </li>
3487 <li><tt>ne</tt>: yields <tt>true</tt> if the operands are unequal,
3488 <tt>false</tt> otherwise. No sign interpretation is necessary or performed.
3489 <li><tt>ugt</tt>: interprets the operands as unsigned values and yields
3490 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3491 <li><tt>uge</tt>: interprets the operands as unsigned values and yields
3492 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3493 <li><tt>ult</tt>: interprets the operands as unsigned values and yields
3494 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3495 <li><tt>ule</tt>: interprets the operands as unsigned values and yields
3496 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
3497 <li><tt>sgt</tt>: interprets the operands as signed values and yields
3498 <tt>true</tt> if <tt>var1</tt> is greater than <tt>var2</tt>.</li>
3499 <li><tt>sge</tt>: interprets the operands as signed values and yields
3500 <tt>true</tt> if <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
3501 <li><tt>slt</tt>: interprets the operands as signed values and yields
3502 <tt>true</tt> if <tt>var1</tt> is less than <tt>var2</tt>.</li>
3503 <li><tt>sle</tt>: interprets the operands as signed values and yields
3504 <tt>true</tt> if <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003505</ol>
3506<p>If the operands are <a href="#t_pointer">pointer</a> typed, the pointer
Jeff Cohen222a8a42007-04-29 01:07:00 +00003507values are compared as if they were integers.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003508
3509<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003510<pre> &lt;result&gt; = icmp eq i32 4, 5 <i>; yields: result=false</i>
3511 &lt;result&gt; = icmp ne float* %X, %X <i>; yields: result=false</i>
3512 &lt;result&gt; = icmp ult i16 4, 5 <i>; yields: result=true</i>
3513 &lt;result&gt; = icmp sgt i16 4, 5 <i>; yields: result=false</i>
3514 &lt;result&gt; = icmp ule i16 -4, 5 <i>; yields: result=false</i>
3515 &lt;result&gt; = icmp sge i16 4, 5 <i>; yields: result=false</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003516</pre>
3517</div>
3518
3519<!-- _______________________________________________________________________ -->
3520<div class="doc_subsubsection"><a name="i_fcmp">'<tt>fcmp</tt>' Instruction</a>
3521</div>
3522<div class="doc_text">
3523<h5>Syntax:</h5>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003524<pre> &lt;result&gt; = fcmp &lt;cond&gt; &lt;ty&gt; &lt;var1&gt;, &lt;var2&gt; <i>; yields {i1}:result</i>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003525</pre>
3526<h5>Overview:</h5>
3527<p>The '<tt>fcmp</tt>' instruction returns a boolean value based on comparison
3528of its floating point operands.</p>
3529<h5>Arguments:</h5>
3530<p>The '<tt>fcmp</tt>' instruction takes three operands. The first operand is
Jeff Cohen222a8a42007-04-29 01:07:00 +00003531the condition code indicating the kind of comparison to perform. It is not
3532a value, just a keyword. The possible condition code are:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003533<ol>
Reid Spencerf69acf32006-11-19 03:00:14 +00003534 <li><tt>false</tt>: no comparison, always returns false</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003535 <li><tt>oeq</tt>: ordered and equal</li>
3536 <li><tt>ogt</tt>: ordered and greater than </li>
3537 <li><tt>oge</tt>: ordered and greater than or equal</li>
3538 <li><tt>olt</tt>: ordered and less than </li>
3539 <li><tt>ole</tt>: ordered and less than or equal</li>
3540 <li><tt>one</tt>: ordered and not equal</li>
3541 <li><tt>ord</tt>: ordered (no nans)</li>
3542 <li><tt>ueq</tt>: unordered or equal</li>
3543 <li><tt>ugt</tt>: unordered or greater than </li>
3544 <li><tt>uge</tt>: unordered or greater than or equal</li>
3545 <li><tt>ult</tt>: unordered or less than </li>
3546 <li><tt>ule</tt>: unordered or less than or equal</li>
3547 <li><tt>une</tt>: unordered or not equal</li>
3548 <li><tt>uno</tt>: unordered (either nans)</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003549 <li><tt>true</tt>: no comparison, always returns true</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003550</ol>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003551<p><i>Ordered</i> means that neither operand is a QNAN while
Reid Spencer02e0d1d2006-12-06 07:08:07 +00003552<i>unordered</i> means that either operand may be a QNAN.</p>
Reid Spencer784ef792007-01-04 05:19:58 +00003553<p>The <tt>val1</tt> and <tt>val2</tt> arguments must be
3554<a href="#t_floating">floating point</a> typed. They must have identical
3555types.</p>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003556<h5>Semantics:</h5>
3557<p>The '<tt>fcmp</tt>' compares <tt>var1</tt> and <tt>var2</tt> according to
3558the condition code given as <tt>cond</tt>. The comparison performed always
Reid Spencer36a15422007-01-12 03:35:51 +00003559yields a <a href="#t_primitive">i1</a> result, as follows:
Reid Spencerc828a0e2006-11-18 21:50:54 +00003560<ol>
3561 <li><tt>false</tt>: always yields <tt>false</tt>, regardless of operands.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003562 <li><tt>oeq</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003563 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003564 <li><tt>ogt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003565 <tt>var1</tt> is greather than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003566 <li><tt>oge</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003567 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003568 <li><tt>olt</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003569 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003570 <li><tt>ole</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003571 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003572 <li><tt>one</tt>: yields <tt>true</tt> if both operands are not a QNAN and
Reid Spencerc828a0e2006-11-18 21:50:54 +00003573 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003574 <li><tt>ord</tt>: yields <tt>true</tt> if both operands are not a QNAN.</li>
3575 <li><tt>ueq</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003576 <tt>var1</tt> is equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003577 <li><tt>ugt</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003578 <tt>var1</tt> is greater than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003579 <li><tt>uge</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003580 <tt>var1</tt> is greater than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003581 <li><tt>ult</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003582 <tt>var1</tt> is less than <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003583 <li><tt>ule</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003584 <tt>var1</tt> is less than or equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003585 <li><tt>une</tt>: yields <tt>true</tt> if either operand is a QNAN or
Reid Spencerc828a0e2006-11-18 21:50:54 +00003586 <tt>var1</tt> is not equal to <tt>var2</tt>.</li>
Reid Spencerf69acf32006-11-19 03:00:14 +00003587 <li><tt>uno</tt>: yields <tt>true</tt> if either operand is a QNAN.</li>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003588 <li><tt>true</tt>: always yields <tt>true</tt>, regardless of operands.</li>
3589</ol>
Reid Spencerc828a0e2006-11-18 21:50:54 +00003590
3591<h5>Example:</h5>
3592<pre> &lt;result&gt; = fcmp oeq float 4.0, 5.0 <i>; yields: result=false</i>
3593 &lt;result&gt; = icmp one float 4.0, 5.0 <i>; yields: result=true</i>
3594 &lt;result&gt; = icmp olt float 4.0, 5.0 <i>; yields: result=true</i>
3595 &lt;result&gt; = icmp ueq double 1.0, 2.0 <i>; yields: result=false</i>
3596</pre>
3597</div>
3598
Reid Spencer97c5fa42006-11-08 01:18:52 +00003599<!-- _______________________________________________________________________ -->
3600<div class="doc_subsubsection"> <a name="i_phi">'<tt>phi</tt>'
3601Instruction</a> </div>
3602<div class="doc_text">
3603<h5>Syntax:</h5>
3604<pre> &lt;result&gt; = phi &lt;ty&gt; [ &lt;val0&gt;, &lt;label0&gt;], ...<br></pre>
3605<h5>Overview:</h5>
3606<p>The '<tt>phi</tt>' instruction is used to implement the &#966; node in
3607the SSA graph representing the function.</p>
3608<h5>Arguments:</h5>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003609<p>The type of the incoming values is specified with the first type
Reid Spencer97c5fa42006-11-08 01:18:52 +00003610field. After this, the '<tt>phi</tt>' instruction takes a list of pairs
3611as arguments, with one pair for each predecessor basic block of the
3612current block. Only values of <a href="#t_firstclass">first class</a>
3613type may be used as the value arguments to the PHI node. Only labels
3614may be used as the label arguments.</p>
3615<p>There must be no non-phi instructions between the start of a basic
3616block and the PHI instructions: i.e. PHI instructions must be first in
3617a basic block.</p>
3618<h5>Semantics:</h5>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003619<p>At runtime, the '<tt>phi</tt>' instruction logically takes on the value
3620specified by the pair corresponding to the predecessor basic block that executed
3621just prior to the current block.</p>
Reid Spencer97c5fa42006-11-08 01:18:52 +00003622<h5>Example:</h5>
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003623<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 +00003624</div>
3625
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003626<!-- _______________________________________________________________________ -->
3627<div class="doc_subsubsection">
3628 <a name="i_select">'<tt>select</tt>' Instruction</a>
3629</div>
3630
3631<div class="doc_text">
3632
3633<h5>Syntax:</h5>
3634
3635<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003636 &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 +00003637</pre>
3638
3639<h5>Overview:</h5>
3640
3641<p>
3642The '<tt>select</tt>' instruction is used to choose one value based on a
3643condition, without branching.
3644</p>
3645
3646
3647<h5>Arguments:</h5>
3648
3649<p>
3650The '<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.
3651</p>
3652
3653<h5>Semantics:</h5>
3654
3655<p>
3656If the boolean condition evaluates to true, the instruction returns the first
John Criswell88190562005-05-16 16:17:45 +00003657value argument; otherwise, it returns the second value argument.
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003658</p>
3659
3660<h5>Example:</h5>
3661
3662<pre>
Reid Spencer36a15422007-01-12 03:35:51 +00003663 %X = select i1 true, i8 17, i8 42 <i>; yields i8:17</i>
Chris Lattnerb53c28d2004-03-12 05:50:16 +00003664</pre>
3665</div>
3666
Robert Bocchinof72fdfe2006-01-15 20:48:27 +00003667
3668<!-- _______________________________________________________________________ -->
3669<div class="doc_subsubsection">
Chris Lattnere23c1392005-05-06 05:47:36 +00003670 <a name="i_call">'<tt>call</tt>' Instruction</a>
3671</div>
3672
Misha Brukman76307852003-11-08 01:05:38 +00003673<div class="doc_text">
Chris Lattnere23c1392005-05-06 05:47:36 +00003674
Chris Lattner2f7c9632001-06-06 20:29:01 +00003675<h5>Syntax:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003676<pre>
Nick Lewyckya9b13d52007-09-08 13:57:50 +00003677 &lt;result&gt; = [tail] call [<a href="#callingconv">cconv</a>] &lt;ty&gt; [&lt;fnty&gt;*] &lt;fnptrval&gt;(&lt;param list&gt;)
Chris Lattnere23c1392005-05-06 05:47:36 +00003678</pre>
3679
Chris Lattner2f7c9632001-06-06 20:29:01 +00003680<h5>Overview:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003681
Misha Brukman76307852003-11-08 01:05:38 +00003682<p>The '<tt>call</tt>' instruction represents a simple function call.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003683
Chris Lattner2f7c9632001-06-06 20:29:01 +00003684<h5>Arguments:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003685
Misha Brukman76307852003-11-08 01:05:38 +00003686<p>This instruction requires several arguments:</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003687
Chris Lattnera8292f32002-05-06 22:08:29 +00003688<ol>
Chris Lattner48b383b02003-11-25 01:02:51 +00003689 <li>
Chris Lattner0132aff2005-05-06 22:57:40 +00003690 <p>The optional "tail" marker indicates whether the callee function accesses
3691 any allocas or varargs in the caller. If the "tail" marker is present, the
Chris Lattnere23c1392005-05-06 05:47:36 +00003692 function call is eligible for tail call optimization. Note that calls may
3693 be marked "tail" even if they do not occur before a <a
3694 href="#i_ret"><tt>ret</tt></a> instruction.
Chris Lattner48b383b02003-11-25 01:02:51 +00003695 </li>
3696 <li>
Duncan Sands16f122e2007-03-30 12:22:09 +00003697 <p>The optional "cconv" marker indicates which <a href="#callingconv">calling
Chris Lattner0132aff2005-05-06 22:57:40 +00003698 convention</a> the call should use. If none is specified, the call defaults
3699 to using C calling conventions.
3700 </li>
3701 <li>
Nick Lewyckya9b13d52007-09-08 13:57:50 +00003702 <p>'<tt>ty</tt>': the type of the call instruction itself which is also
3703 the type of the return value. Functions that return no value are marked
3704 <tt><a href="#t_void">void</a></tt>.</p>
3705 </li>
3706 <li>
3707 <p>'<tt>fnty</tt>': shall be the signature of the pointer to function
3708 value being invoked. The argument types must match the types implied by
3709 this signature. This type can be omitted if the function is not varargs
3710 and if the function type does not return a pointer to a function.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003711 </li>
3712 <li>
3713 <p>'<tt>fnptrval</tt>': An LLVM value containing a pointer to a function to
3714 be invoked. In most cases, this is a direct function invocation, but
3715 indirect <tt>call</tt>s are just as possible, calling an arbitrary pointer
John Criswell88190562005-05-16 16:17:45 +00003716 to function value.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00003717 </li>
3718 <li>
3719 <p>'<tt>function args</tt>': argument list whose types match the
Reid Spencerd845d162005-05-01 22:22:57 +00003720 function signature argument types. All arguments must be of
3721 <a href="#t_firstclass">first class</a> type. If the function signature
3722 indicates the function accepts a variable number of arguments, the extra
3723 arguments can be specified.</p>
Chris Lattner48b383b02003-11-25 01:02:51 +00003724 </li>
Chris Lattnera8292f32002-05-06 22:08:29 +00003725</ol>
Chris Lattnere23c1392005-05-06 05:47:36 +00003726
Chris Lattner2f7c9632001-06-06 20:29:01 +00003727<h5>Semantics:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003728
Chris Lattner48b383b02003-11-25 01:02:51 +00003729<p>The '<tt>call</tt>' instruction is used to cause control flow to
3730transfer to a specified function, with its incoming arguments bound to
3731the specified values. Upon a '<tt><a href="#i_ret">ret</a></tt>'
3732instruction in the called function, control flow continues with the
3733instruction after the function call, and the return value of the
3734function is bound to the result argument. This is a simpler case of
3735the <a href="#i_invoke">invoke</a> instruction.</p>
Chris Lattnere23c1392005-05-06 05:47:36 +00003736
Chris Lattner2f7c9632001-06-06 20:29:01 +00003737<h5>Example:</h5>
Chris Lattnere23c1392005-05-06 05:47:36 +00003738
3739<pre>
Nick Lewyckya9b13d52007-09-08 13:57:50 +00003740 %retval = call i32 @test(i32 %argc)
3741 call i32 (i8 *, ...)* @printf(i8 * %msg, i32 12, i8 42);
3742 %X = tail call i32 @foo()
3743 %Y = tail call <a href="#callingconv">fastcc</a> i32 @foo()
3744 %Z = call void %foo(i8 97 signext)
Chris Lattnere23c1392005-05-06 05:47:36 +00003745</pre>
3746
Misha Brukman76307852003-11-08 01:05:38 +00003747</div>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003748
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003749<!-- _______________________________________________________________________ -->
Chris Lattner6a4a0492004-09-27 21:51:25 +00003750<div class="doc_subsubsection">
Chris Lattner33337472006-01-13 23:26:01 +00003751 <a name="i_va_arg">'<tt>va_arg</tt>' Instruction</a>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003752</div>
3753
Misha Brukman76307852003-11-08 01:05:38 +00003754<div class="doc_text">
Chris Lattner6a4a0492004-09-27 21:51:25 +00003755
Chris Lattner26ca62e2003-10-18 05:51:36 +00003756<h5>Syntax:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003757
3758<pre>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003759 &lt;resultval&gt; = va_arg &lt;va_list*&gt; &lt;arglist&gt;, &lt;argty&gt;
Chris Lattner6a4a0492004-09-27 21:51:25 +00003760</pre>
3761
Chris Lattner26ca62e2003-10-18 05:51:36 +00003762<h5>Overview:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003763
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003764<p>The '<tt>va_arg</tt>' instruction is used to access arguments passed through
Chris Lattner6a4a0492004-09-27 21:51:25 +00003765the "variable argument" area of a function call. It is used to implement the
3766<tt>va_arg</tt> macro in C.</p>
3767
Chris Lattner26ca62e2003-10-18 05:51:36 +00003768<h5>Arguments:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003769
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003770<p>This instruction takes a <tt>va_list*</tt> value and the type of
3771the argument. It returns a value of the specified argument type and
Jeff Cohen222a8a42007-04-29 01:07:00 +00003772increments the <tt>va_list</tt> to point to the next argument. The
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003773actual type of <tt>va_list</tt> is target specific.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003774
Chris Lattner26ca62e2003-10-18 05:51:36 +00003775<h5>Semantics:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003776
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003777<p>The '<tt>va_arg</tt>' instruction loads an argument of the specified
3778type from the specified <tt>va_list</tt> and causes the
3779<tt>va_list</tt> to point to the next argument. For more information,
3780see the variable argument handling <a href="#int_varargs">Intrinsic
3781Functions</a>.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003782
3783<p>It is legal for this instruction to be called in a function which does not
3784take a variable number of arguments, for example, the <tt>vfprintf</tt>
Misha Brukman76307852003-11-08 01:05:38 +00003785function.</p>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003786
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003787<p><tt>va_arg</tt> is an LLVM instruction instead of an <a
John Criswell88190562005-05-16 16:17:45 +00003788href="#intrinsics">intrinsic function</a> because it takes a type as an
Chris Lattner6a4a0492004-09-27 21:51:25 +00003789argument.</p>
3790
Chris Lattner26ca62e2003-10-18 05:51:36 +00003791<h5>Example:</h5>
Chris Lattner6a4a0492004-09-27 21:51:25 +00003792
3793<p>See the <a href="#int_varargs">variable argument processing</a> section.</p>
3794
Misha Brukman76307852003-11-08 01:05:38 +00003795</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003796
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003797<!-- *********************************************************************** -->
Chris Lattner48b383b02003-11-25 01:02:51 +00003798<div class="doc_section"> <a name="intrinsics">Intrinsic Functions</a> </div>
3799<!-- *********************************************************************** -->
Chris Lattner941515c2004-01-06 05:31:32 +00003800
Misha Brukman76307852003-11-08 01:05:38 +00003801<div class="doc_text">
Chris Lattnerfee11462004-02-12 17:01:32 +00003802
3803<p>LLVM supports the notion of an "intrinsic function". These functions have
Reid Spencer4eefaab2007-04-01 08:04:23 +00003804well known names and semantics and are required to follow certain restrictions.
3805Overall, these intrinsics represent an extension mechanism for the LLVM
Jeff Cohen222a8a42007-04-29 01:07:00 +00003806language that does not require changing all of the transformations in LLVM when
Gabor Greifa54634a2007-07-06 22:07:22 +00003807adding to the language (or the bitcode reader/writer, the parser, etc...).</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00003808
John Criswell88190562005-05-16 16:17:45 +00003809<p>Intrinsic function names must all start with an "<tt>llvm.</tt>" prefix. This
Jeff Cohen222a8a42007-04-29 01:07:00 +00003810prefix is reserved in LLVM for intrinsic names; thus, function names may not
3811begin with this prefix. Intrinsic functions must always be external functions:
3812you cannot define the body of intrinsic functions. Intrinsic functions may
3813only be used in call or invoke instructions: it is illegal to take the address
3814of an intrinsic function. Additionally, because intrinsic functions are part
3815of the LLVM language, it is required if any are added that they be documented
3816here.</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00003817
Chandler Carruth7132e002007-08-04 01:51:18 +00003818<p>Some intrinsic functions can be overloaded, i.e., the intrinsic represents
3819a family of functions that perform the same operation but on different data
3820types. Because LLVM can represent over 8 million different integer types,
3821overloading is used commonly to allow an intrinsic function to operate on any
3822integer type. One or more of the argument types or the result type can be
3823overloaded to accept any integer type. Argument types may also be defined as
3824exactly matching a previous argument's type or the result type. This allows an
3825intrinsic function which accepts multiple arguments, but needs all of them to
3826be of the same type, to only be overloaded with respect to a single argument or
3827the result.</p>
Chris Lattnerfee11462004-02-12 17:01:32 +00003828
Chandler Carruth7132e002007-08-04 01:51:18 +00003829<p>Overloaded intrinsics will have the names of its overloaded argument types
3830encoded into its function name, each preceded by a period. Only those types
3831which are overloaded result in a name suffix. Arguments whose type is matched
3832against another type do not. For example, the <tt>llvm.ctpop</tt> function can
3833take an integer of any width and returns an integer of exactly the same integer
3834width. This leads to a family of functions such as
3835<tt>i8 @llvm.ctpop.i8(i8 %val)</tt> and <tt>i29 @llvm.ctpop.i29(i29 %val)</tt>.
3836Only one type, the return type, is overloaded, and only one type suffix is
3837required. Because the argument's type is matched against the return type, it
3838does not require its own name suffix.</p>
Reid Spencer4eefaab2007-04-01 08:04:23 +00003839
3840<p>To learn how to add an intrinsic function, please see the
3841<a href="ExtendingLLVM.html">Extending LLVM Guide</a>.
Chris Lattnerfee11462004-02-12 17:01:32 +00003842</p>
3843
Misha Brukman76307852003-11-08 01:05:38 +00003844</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003845
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003846<!-- ======================================================================= -->
Chris Lattner941515c2004-01-06 05:31:32 +00003847<div class="doc_subsection">
3848 <a name="int_varargs">Variable Argument Handling Intrinsics</a>
3849</div>
3850
Misha Brukman76307852003-11-08 01:05:38 +00003851<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003852
Misha Brukman76307852003-11-08 01:05:38 +00003853<p>Variable argument support is defined in LLVM with the <a
Chris Lattner33337472006-01-13 23:26:01 +00003854 href="#i_va_arg"><tt>va_arg</tt></a> instruction and these three
Chris Lattner48b383b02003-11-25 01:02:51 +00003855intrinsic functions. These functions are related to the similarly
3856named macros defined in the <tt>&lt;stdarg.h&gt;</tt> header file.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003857
Chris Lattner48b383b02003-11-25 01:02:51 +00003858<p>All of these functions operate on arguments that use a
3859target-specific value type "<tt>va_list</tt>". The LLVM assembly
3860language reference manual does not define what this type is, so all
Jeff Cohen222a8a42007-04-29 01:07:00 +00003861transformations should be prepared to handle these functions regardless of
3862the type used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003863
Chris Lattner30b868d2006-05-15 17:26:46 +00003864<p>This example shows how the <a href="#i_va_arg"><tt>va_arg</tt></a>
Chris Lattner48b383b02003-11-25 01:02:51 +00003865instruction and the variable argument handling intrinsic functions are
3866used.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003867
Bill Wendling3716c5d2007-05-29 09:04:49 +00003868<div class="doc_code">
Chris Lattnerfee11462004-02-12 17:01:32 +00003869<pre>
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00003870define i32 @test(i32 %X, ...) {
Chris Lattnerfee11462004-02-12 17:01:32 +00003871 ; Initialize variable argument processing
Jeff Cohen222a8a42007-04-29 01:07:00 +00003872 %ap = alloca i8*
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003873 %ap2 = bitcast i8** %ap to i8*
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00003874 call void @llvm.va_start(i8* %ap2)
Chris Lattnerfee11462004-02-12 17:01:32 +00003875
3876 ; Read a single integer argument
Jeff Cohen222a8a42007-04-29 01:07:00 +00003877 %tmp = va_arg i8** %ap, i32
Chris Lattnerfee11462004-02-12 17:01:32 +00003878
3879 ; Demonstrate usage of llvm.va_copy and llvm.va_end
Jeff Cohen222a8a42007-04-29 01:07:00 +00003880 %aq = alloca i8*
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003881 %aq2 = bitcast i8** %aq to i8*
Jeff Cohen222a8a42007-04-29 01:07:00 +00003882 call void @llvm.va_copy(i8* %aq2, i8* %ap2)
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00003883 call void @llvm.va_end(i8* %aq2)
Chris Lattnerfee11462004-02-12 17:01:32 +00003884
3885 ; Stop processing of arguments.
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00003886 call void @llvm.va_end(i8* %ap2)
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00003887 ret i32 %tmp
Chris Lattnerfee11462004-02-12 17:01:32 +00003888}
Anton Korobeynikov640bbe02007-03-21 23:58:04 +00003889
3890declare void @llvm.va_start(i8*)
3891declare void @llvm.va_copy(i8*, i8*)
3892declare void @llvm.va_end(i8*)
Chris Lattnerfee11462004-02-12 17:01:32 +00003893</pre>
Misha Brukman76307852003-11-08 01:05:38 +00003894</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003895
Bill Wendling3716c5d2007-05-29 09:04:49 +00003896</div>
3897
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003898<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003899<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00003900 <a name="int_va_start">'<tt>llvm.va_start</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00003901</div>
3902
3903
Misha Brukman76307852003-11-08 01:05:38 +00003904<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003905<h5>Syntax:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003906<pre> declare void %llvm.va_start(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003907<h5>Overview:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003908<P>The '<tt>llvm.va_start</tt>' intrinsic initializes
3909<tt>*&lt;arglist&gt;</tt> for subsequent use by <tt><a
3910href="#i_va_arg">va_arg</a></tt>.</p>
3911
3912<h5>Arguments:</h5>
3913
3914<P>The argument is a pointer to a <tt>va_list</tt> element to initialize.</p>
3915
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003916<h5>Semantics:</h5>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003917
3918<P>The '<tt>llvm.va_start</tt>' intrinsic works just like the <tt>va_start</tt>
3919macro available in C. In a target-dependent way, it initializes the
Jeff Cohen222a8a42007-04-29 01:07:00 +00003920<tt>va_list</tt> element to which the argument points, so that the next call to
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003921<tt>va_arg</tt> will produce the first variable argument passed to the function.
3922Unlike the C <tt>va_start</tt> macro, this intrinsic does not need to know the
Jeff Cohen222a8a42007-04-29 01:07:00 +00003923last argument of the function as the compiler can figure that out.</p>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003924
Misha Brukman76307852003-11-08 01:05:38 +00003925</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003926
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003927<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003928<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00003929 <a name="int_va_end">'<tt>llvm.va_end</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00003930</div>
3931
Misha Brukman76307852003-11-08 01:05:38 +00003932<div class="doc_text">
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003933<h5>Syntax:</h5>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00003934<pre> declare void @llvm.va_end(i8* &lt;arglist&gt;)<br></pre>
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003935<h5>Overview:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003936
Jeff Cohen222a8a42007-04-29 01:07:00 +00003937<p>The '<tt>llvm.va_end</tt>' intrinsic destroys <tt>*&lt;arglist&gt;</tt>,
Reid Spencer96a5f022007-04-04 02:42:35 +00003938which has been initialized previously with <tt><a href="#int_va_start">llvm.va_start</a></tt>
Chris Lattner48b383b02003-11-25 01:02:51 +00003939or <tt><a href="#i_va_copy">llvm.va_copy</a></tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003940
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003941<h5>Arguments:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003942
Jeff Cohen222a8a42007-04-29 01:07:00 +00003943<p>The argument is a pointer to a <tt>va_list</tt> to destroy.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003944
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003945<h5>Semantics:</h5>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003946
Misha Brukman76307852003-11-08 01:05:38 +00003947<p>The '<tt>llvm.va_end</tt>' intrinsic works just like the <tt>va_end</tt>
Jeff Cohen222a8a42007-04-29 01:07:00 +00003948macro available in C. In a target-dependent way, it destroys the
3949<tt>va_list</tt> element to which the argument points. Calls to <a
3950href="#int_va_start"><tt>llvm.va_start</tt></a> and <a href="#int_va_copy">
3951<tt>llvm.va_copy</tt></a> must be matched exactly with calls to
3952<tt>llvm.va_end</tt>.</p>
Chris Lattnerdb0790c2007-01-08 07:55:15 +00003953
Misha Brukman76307852003-11-08 01:05:38 +00003954</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003955
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003956<!-- _______________________________________________________________________ -->
Chris Lattner941515c2004-01-06 05:31:32 +00003957<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00003958 <a name="int_va_copy">'<tt>llvm.va_copy</tt>' Intrinsic</a>
Chris Lattner941515c2004-01-06 05:31:32 +00003959</div>
3960
Misha Brukman76307852003-11-08 01:05:38 +00003961<div class="doc_text">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003962
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003963<h5>Syntax:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003964
3965<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00003966 declare void @llvm.va_copy(i8* &lt;destarglist&gt;, i8* &lt;srcarglist&gt;)
Chris Lattner757528b0b2004-05-23 21:06:01 +00003967</pre>
3968
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003969<h5>Overview:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003970
Jeff Cohen222a8a42007-04-29 01:07:00 +00003971<p>The '<tt>llvm.va_copy</tt>' intrinsic copies the current argument position
3972from the source argument list to the destination argument list.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003973
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003974<h5>Arguments:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003975
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003976<p>The first argument is a pointer to a <tt>va_list</tt> element to initialize.
Andrew Lenharth5305ea52005-06-22 20:38:11 +00003977The second argument is a pointer to a <tt>va_list</tt> element to copy from.</p>
Andrew Lenharth5fb787c2005-06-18 18:28:17 +00003978
Chris Lattner757528b0b2004-05-23 21:06:01 +00003979
Chris Lattnerbd64b4e2003-05-08 04:57:36 +00003980<h5>Semantics:</h5>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003981
Jeff Cohen222a8a42007-04-29 01:07:00 +00003982<p>The '<tt>llvm.va_copy</tt>' intrinsic works just like the <tt>va_copy</tt>
3983macro available in C. In a target-dependent way, it copies the source
3984<tt>va_list</tt> element into the destination <tt>va_list</tt> element. This
3985intrinsic is necessary because the <tt><a href="#int_va_start">
3986llvm.va_start</a></tt> intrinsic may be arbitrarily complex and require, for
3987example, memory allocation.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00003988
Misha Brukman76307852003-11-08 01:05:38 +00003989</div>
Chris Lattner941515c2004-01-06 05:31:32 +00003990
Chris Lattnerfee11462004-02-12 17:01:32 +00003991<!-- ======================================================================= -->
3992<div class="doc_subsection">
Chris Lattner757528b0b2004-05-23 21:06:01 +00003993 <a name="int_gc">Accurate Garbage Collection Intrinsics</a>
3994</div>
3995
3996<div class="doc_text">
3997
3998<p>
3999LLVM support for <a href="GarbageCollection.html">Accurate Garbage
4000Collection</a> requires the implementation and generation of these intrinsics.
Reid Spencer96a5f022007-04-04 02:42:35 +00004001These intrinsics allow identification of <a href="#int_gcroot">GC roots on the
Chris Lattner757528b0b2004-05-23 21:06:01 +00004002stack</a>, as well as garbage collector implementations that require <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004003href="#int_gcread">read</a> and <a href="#int_gcwrite">write</a> barriers.
Chris Lattner757528b0b2004-05-23 21:06:01 +00004004Front-ends for type-safe garbage collected languages should generate these
4005intrinsics to make use of the LLVM garbage collectors. For more details, see <a
4006href="GarbageCollection.html">Accurate Garbage Collection with LLVM</a>.
4007</p>
Christopher Lamb55c6d4f2007-12-17 01:00:21 +00004008
4009<p>The garbage collection intrinsics only operate on objects in the generic
4010 address space (address space zero).</p>
4011
Chris Lattner757528b0b2004-05-23 21:06:01 +00004012</div>
4013
4014<!-- _______________________________________________________________________ -->
4015<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004016 <a name="int_gcroot">'<tt>llvm.gcroot</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004017</div>
4018
4019<div class="doc_text">
4020
4021<h5>Syntax:</h5>
4022
4023<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004024 declare void @llvm.gcroot(i8** %ptrloc, i8* %metadata)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004025</pre>
4026
4027<h5>Overview:</h5>
4028
John Criswelldfe6a862004-12-10 15:51:16 +00004029<p>The '<tt>llvm.gcroot</tt>' intrinsic declares the existence of a GC root to
Chris Lattner757528b0b2004-05-23 21:06:01 +00004030the code generator, and allows some metadata to be associated with it.</p>
4031
4032<h5>Arguments:</h5>
4033
4034<p>The first argument specifies the address of a stack object that contains the
4035root pointer. The second pointer (which must be either a constant or a global
4036value address) contains the meta-data to be associated with the root.</p>
4037
4038<h5>Semantics:</h5>
4039
4040<p>At runtime, a call to this intrinsics stores a null pointer into the "ptrloc"
4041location. At compile-time, the code generator generates information to allow
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004042the runtime to find the pointer at GC safe points. The '<tt>llvm.gcroot</tt>'
4043intrinsic may only be used in a function which <a href="#gc">specifies a GC
4044algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004045
4046</div>
4047
4048
4049<!-- _______________________________________________________________________ -->
4050<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004051 <a name="int_gcread">'<tt>llvm.gcread</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004052</div>
4053
4054<div class="doc_text">
4055
4056<h5>Syntax:</h5>
4057
4058<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004059 declare i8* @llvm.gcread(i8* %ObjPtr, i8** %Ptr)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004060</pre>
4061
4062<h5>Overview:</h5>
4063
4064<p>The '<tt>llvm.gcread</tt>' intrinsic identifies reads of references from heap
4065locations, allowing garbage collector implementations that require read
4066barriers.</p>
4067
4068<h5>Arguments:</h5>
4069
Chris Lattnerf9228072006-03-14 20:02:51 +00004070<p>The second argument is the address to read from, which should be an address
4071allocated from the garbage collector. The first object is a pointer to the
4072start of the referenced object, if needed by the language runtime (otherwise
4073null).</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004074
4075<h5>Semantics:</h5>
4076
4077<p>The '<tt>llvm.gcread</tt>' intrinsic has the same semantics as a load
4078instruction, but may be replaced with substantially more complex code by the
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004079garbage collector runtime, as needed. The '<tt>llvm.gcread</tt>' intrinsic
4080may only be used in a function which <a href="#gc">specifies a GC
4081algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004082
4083</div>
4084
4085
4086<!-- _______________________________________________________________________ -->
4087<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004088 <a name="int_gcwrite">'<tt>llvm.gcwrite</tt>' Intrinsic</a>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004089</div>
4090
4091<div class="doc_text">
4092
4093<h5>Syntax:</h5>
4094
4095<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004096 declare void @llvm.gcwrite(i8* %P1, i8* %Obj, i8** %P2)
Chris Lattner757528b0b2004-05-23 21:06:01 +00004097</pre>
4098
4099<h5>Overview:</h5>
4100
4101<p>The '<tt>llvm.gcwrite</tt>' intrinsic identifies writes of references to heap
4102locations, allowing garbage collector implementations that require write
4103barriers (such as generational or reference counting collectors).</p>
4104
4105<h5>Arguments:</h5>
4106
Chris Lattnerf9228072006-03-14 20:02:51 +00004107<p>The first argument is the reference to store, the second is the start of the
4108object to store it to, and the third is the address of the field of Obj to
4109store to. If the runtime does not require a pointer to the object, Obj may be
4110null.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004111
4112<h5>Semantics:</h5>
4113
4114<p>The '<tt>llvm.gcwrite</tt>' intrinsic has the same semantics as a store
4115instruction, but may be replaced with substantially more complex code by the
Gordon Henriksenfb56bde2007-12-25 02:31:26 +00004116garbage collector runtime, as needed. The '<tt>llvm.gcwrite</tt>' intrinsic
4117may only be used in a function which <a href="#gc">specifies a GC
4118algorithm</a>.</p>
Chris Lattner757528b0b2004-05-23 21:06:01 +00004119
4120</div>
4121
4122
4123
4124<!-- ======================================================================= -->
4125<div class="doc_subsection">
Chris Lattner3649c3a2004-02-14 04:08:35 +00004126 <a name="int_codegen">Code Generator Intrinsics</a>
4127</div>
4128
4129<div class="doc_text">
4130<p>
4131These intrinsics are provided by LLVM to expose special features that may only
4132be implemented with code generator support.
4133</p>
4134
4135</div>
4136
4137<!-- _______________________________________________________________________ -->
4138<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004139 <a name="int_returnaddress">'<tt>llvm.returnaddress</tt>' Intrinsic</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004140</div>
4141
4142<div class="doc_text">
4143
4144<h5>Syntax:</h5>
4145<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004146 declare i8 *@llvm.returnaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004147</pre>
4148
4149<h5>Overview:</h5>
4150
4151<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00004152The '<tt>llvm.returnaddress</tt>' intrinsic attempts to compute a
4153target-specific value indicating the return address of the current function
4154or one of its callers.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004155</p>
4156
4157<h5>Arguments:</h5>
4158
4159<p>
4160The argument to this intrinsic indicates which function to return the address
4161for. Zero indicates the calling function, one indicates its caller, etc. The
4162argument is <b>required</b> to be a constant integer value.
4163</p>
4164
4165<h5>Semantics:</h5>
4166
4167<p>
4168The '<tt>llvm.returnaddress</tt>' intrinsic either returns a pointer indicating
4169the return address of the specified call frame, or zero if it cannot be
4170identified. The value returned by this intrinsic is likely to be incorrect or 0
4171for arguments other than zero, so it should only be used for debugging purposes.
4172</p>
4173
4174<p>
4175Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00004176aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00004177source-language caller.
4178</p>
4179</div>
4180
4181
4182<!-- _______________________________________________________________________ -->
4183<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004184 <a name="int_frameaddress">'<tt>llvm.frameaddress</tt>' Intrinsic</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004185</div>
4186
4187<div class="doc_text">
4188
4189<h5>Syntax:</h5>
4190<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004191 declare i8 *@llvm.frameaddress(i32 &lt;level&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004192</pre>
4193
4194<h5>Overview:</h5>
4195
4196<p>
Chris Lattnerc1fb4262006-10-15 20:05:59 +00004197The '<tt>llvm.frameaddress</tt>' intrinsic attempts to return the
4198target-specific frame pointer value for the specified stack frame.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004199</p>
4200
4201<h5>Arguments:</h5>
4202
4203<p>
4204The argument to this intrinsic indicates which function to return the frame
4205pointer for. Zero indicates the calling function, one indicates its caller,
4206etc. The argument is <b>required</b> to be a constant integer value.
4207</p>
4208
4209<h5>Semantics:</h5>
4210
4211<p>
4212The '<tt>llvm.frameaddress</tt>' intrinsic either returns a pointer indicating
4213the frame address of the specified call frame, or zero if it cannot be
4214identified. The value returned by this intrinsic is likely to be incorrect or 0
4215for arguments other than zero, so it should only be used for debugging purposes.
4216</p>
4217
4218<p>
4219Note that calling this intrinsic does not prevent function inlining or other
Chris Lattner2e6eb5f2005-03-07 20:30:51 +00004220aggressive transformations, so the value returned may not be that of the obvious
Chris Lattner3649c3a2004-02-14 04:08:35 +00004221source-language caller.
4222</p>
4223</div>
4224
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004225<!-- _______________________________________________________________________ -->
4226<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004227 <a name="int_stacksave">'<tt>llvm.stacksave</tt>' Intrinsic</a>
Chris Lattner2f0f0012006-01-13 02:03:13 +00004228</div>
4229
4230<div class="doc_text">
4231
4232<h5>Syntax:</h5>
4233<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004234 declare i8 *@llvm.stacksave()
Chris Lattner2f0f0012006-01-13 02:03:13 +00004235</pre>
4236
4237<h5>Overview:</h5>
4238
4239<p>
4240The '<tt>llvm.stacksave</tt>' intrinsic is used to remember the current state of
Reid Spencer96a5f022007-04-04 02:42:35 +00004241the function stack, for use with <a href="#int_stackrestore">
Chris Lattner2f0f0012006-01-13 02:03:13 +00004242<tt>llvm.stackrestore</tt></a>. This is useful for implementing language
4243features like scoped automatic variable sized arrays in C99.
4244</p>
4245
4246<h5>Semantics:</h5>
4247
4248<p>
4249This intrinsic returns a opaque pointer value that can be passed to <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004250href="#int_stackrestore"><tt>llvm.stackrestore</tt></a>. When an
Chris Lattner2f0f0012006-01-13 02:03:13 +00004251<tt>llvm.stackrestore</tt> intrinsic is executed with a value saved from
4252<tt>llvm.stacksave</tt>, it effectively restores the state of the stack to the
4253state it was in when the <tt>llvm.stacksave</tt> intrinsic executed. In
4254practice, this pops any <a href="#i_alloca">alloca</a> blocks from the stack
4255that were allocated after the <tt>llvm.stacksave</tt> was executed.
4256</p>
4257
4258</div>
4259
4260<!-- _______________________________________________________________________ -->
4261<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004262 <a name="int_stackrestore">'<tt>llvm.stackrestore</tt>' Intrinsic</a>
Chris Lattner2f0f0012006-01-13 02:03:13 +00004263</div>
4264
4265<div class="doc_text">
4266
4267<h5>Syntax:</h5>
4268<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004269 declare void @llvm.stackrestore(i8 * %ptr)
Chris Lattner2f0f0012006-01-13 02:03:13 +00004270</pre>
4271
4272<h5>Overview:</h5>
4273
4274<p>
4275The '<tt>llvm.stackrestore</tt>' intrinsic is used to restore the state of
4276the function stack to the state it was in when the corresponding <a
Reid Spencer96a5f022007-04-04 02:42:35 +00004277href="#int_stacksave"><tt>llvm.stacksave</tt></a> intrinsic executed. This is
Chris Lattner2f0f0012006-01-13 02:03:13 +00004278useful for implementing language features like scoped automatic variable sized
4279arrays in C99.
4280</p>
4281
4282<h5>Semantics:</h5>
4283
4284<p>
Reid Spencer96a5f022007-04-04 02:42:35 +00004285See the description for <a href="#int_stacksave"><tt>llvm.stacksave</tt></a>.
Chris Lattner2f0f0012006-01-13 02:03:13 +00004286</p>
4287
4288</div>
4289
4290
4291<!-- _______________________________________________________________________ -->
4292<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004293 <a name="int_prefetch">'<tt>llvm.prefetch</tt>' Intrinsic</a>
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004294</div>
4295
4296<div class="doc_text">
4297
4298<h5>Syntax:</h5>
4299<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004300 declare void @llvm.prefetch(i8* &lt;address&gt;, i32 &lt;rw&gt;, i32 &lt;locality&gt;)
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004301</pre>
4302
4303<h5>Overview:</h5>
4304
4305
4306<p>
4307The '<tt>llvm.prefetch</tt>' intrinsic is a hint to the code generator to insert
John Criswell88190562005-05-16 16:17:45 +00004308a prefetch instruction if supported; otherwise, it is a noop. Prefetches have
4309no
4310effect on the behavior of the program but can change its performance
Chris Lattnerff851072005-02-28 19:47:14 +00004311characteristics.
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004312</p>
4313
4314<h5>Arguments:</h5>
4315
4316<p>
4317<tt>address</tt> is the address to be prefetched, <tt>rw</tt> is the specifier
4318determining if the fetch should be for a read (0) or write (1), and
4319<tt>locality</tt> is a temporal locality specifier ranging from (0) - no
Chris Lattnerd3e641c2005-03-07 20:31:38 +00004320locality, to (3) - extremely local keep in cache. The <tt>rw</tt> and
Chris Lattnerc8a2c222005-02-28 19:24:19 +00004321<tt>locality</tt> arguments must be constant integers.
4322</p>
4323
4324<h5>Semantics:</h5>
4325
4326<p>
4327This intrinsic does not modify the behavior of the program. In particular,
4328prefetches cannot trap and do not produce a value. On targets that support this
4329intrinsic, the prefetch can provide hints to the processor cache for better
4330performance.
4331</p>
4332
4333</div>
4334
Andrew Lenharthb4427912005-03-28 20:05:49 +00004335<!-- _______________________________________________________________________ -->
4336<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004337 <a name="int_pcmarker">'<tt>llvm.pcmarker</tt>' Intrinsic</a>
Andrew Lenharthb4427912005-03-28 20:05:49 +00004338</div>
4339
4340<div class="doc_text">
4341
4342<h5>Syntax:</h5>
4343<pre>
Chris Lattner12477732007-09-21 17:30:40 +00004344 declare void @llvm.pcmarker(i32 &lt;id&gt;)
Andrew Lenharthb4427912005-03-28 20:05:49 +00004345</pre>
4346
4347<h5>Overview:</h5>
4348
4349
4350<p>
John Criswell88190562005-05-16 16:17:45 +00004351The '<tt>llvm.pcmarker</tt>' intrinsic is a method to export a Program Counter
4352(PC) in a region of
Andrew Lenharthb4427912005-03-28 20:05:49 +00004353code to simulators and other tools. The method is target specific, but it is
4354expected that the marker will use exported symbols to transmit the PC of the marker.
Jeff Cohendc6bfea2005-11-11 02:15:27 +00004355The marker makes no guarantees that it will remain with any specific instruction
Chris Lattnere64d41d2005-11-15 06:07:55 +00004356after optimizations. It is possible that the presence of a marker will inhibit
Chris Lattnerb40261e2006-03-24 07:16:10 +00004357optimizations. The intended use is to be inserted after optimizations to allow
John Criswell88190562005-05-16 16:17:45 +00004358correlations of simulation runs.
Andrew Lenharthb4427912005-03-28 20:05:49 +00004359</p>
4360
4361<h5>Arguments:</h5>
4362
4363<p>
4364<tt>id</tt> is a numerical id identifying the marker.
4365</p>
4366
4367<h5>Semantics:</h5>
4368
4369<p>
4370This intrinsic does not modify the behavior of the program. Backends that do not
4371support this intrinisic may ignore it.
4372</p>
4373
4374</div>
4375
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004376<!-- _______________________________________________________________________ -->
4377<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004378 <a name="int_readcyclecounter">'<tt>llvm.readcyclecounter</tt>' Intrinsic</a>
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004379</div>
4380
4381<div class="doc_text">
4382
4383<h5>Syntax:</h5>
4384<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004385 declare i64 @llvm.readcyclecounter( )
Andrew Lenharth01aa5632005-11-11 16:47:30 +00004386</pre>
4387
4388<h5>Overview:</h5>
4389
4390
4391<p>
4392The '<tt>llvm.readcyclecounter</tt>' intrinsic provides access to the cycle
4393counter register (or similar low latency, high accuracy clocks) on those targets
4394that support it. On X86, it should map to RDTSC. On Alpha, it should map to RPCC.
4395As the backing counters overflow quickly (on the order of 9 seconds on alpha), this
4396should only be used for small timings.
4397</p>
4398
4399<h5>Semantics:</h5>
4400
4401<p>
4402When directly supported, reading the cycle counter should not modify any memory.
4403Implementations are allowed to either return a application specific value or a
4404system wide value. On backends without support, this is lowered to a constant 0.
4405</p>
4406
4407</div>
4408
Chris Lattner3649c3a2004-02-14 04:08:35 +00004409<!-- ======================================================================= -->
4410<div class="doc_subsection">
Chris Lattnerfee11462004-02-12 17:01:32 +00004411 <a name="int_libc">Standard C Library Intrinsics</a>
4412</div>
4413
4414<div class="doc_text">
4415<p>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004416LLVM provides intrinsics for a few important standard C library functions.
4417These intrinsics allow source-language front-ends to pass information about the
4418alignment of the pointer arguments to the code generator, providing opportunity
4419for more efficient code generation.
Chris Lattnerfee11462004-02-12 17:01:32 +00004420</p>
4421
4422</div>
4423
4424<!-- _______________________________________________________________________ -->
4425<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004426 <a name="int_memcpy">'<tt>llvm.memcpy</tt>' Intrinsic</a>
Chris Lattnerfee11462004-02-12 17:01:32 +00004427</div>
4428
4429<div class="doc_text">
4430
4431<h5>Syntax:</h5>
4432<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004433 declare void @llvm.memcpy.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004434 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004435 declare void @llvm.memcpy.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004436 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerfee11462004-02-12 17:01:32 +00004437</pre>
4438
4439<h5>Overview:</h5>
4440
4441<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004442The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00004443location to the destination location.
4444</p>
4445
4446<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004447Note that, unlike the standard libc function, the <tt>llvm.memcpy.*</tt>
4448intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerfee11462004-02-12 17:01:32 +00004449</p>
4450
4451<h5>Arguments:</h5>
4452
4453<p>
4454The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00004455the source. The third argument is an integer argument
Chris Lattnerfee11462004-02-12 17:01:32 +00004456specifying the number of bytes to copy, and the fourth argument is the alignment
4457of the source and destination locations.
4458</p>
4459
Chris Lattner4c67c482004-02-12 21:18:15 +00004460<p>
4461If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004462the caller guarantees that both the source and destination pointers are aligned
4463to that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00004464</p>
4465
Chris Lattnerfee11462004-02-12 17:01:32 +00004466<h5>Semantics:</h5>
4467
4468<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004469The '<tt>llvm.memcpy.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerfee11462004-02-12 17:01:32 +00004470location to the destination location, which are not allowed to overlap. It
4471copies "len" bytes of memory over. If the argument is known to be aligned to
4472some boundary, this can be specified as the fourth argument, otherwise it should
4473be set to 0 or 1.
4474</p>
4475</div>
4476
4477
Chris Lattnerf30152e2004-02-12 18:10:10 +00004478<!-- _______________________________________________________________________ -->
4479<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004480 <a name="int_memmove">'<tt>llvm.memmove</tt>' Intrinsic</a>
Chris Lattnerf30152e2004-02-12 18:10:10 +00004481</div>
4482
4483<div class="doc_text">
4484
4485<h5>Syntax:</h5>
4486<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004487 declare void @llvm.memmove.i32(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004488 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004489 declare void @llvm.memmove.i64(i8 * &lt;dest&gt;, i8 * &lt;src&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004490 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattnerf30152e2004-02-12 18:10:10 +00004491</pre>
4492
4493<h5>Overview:</h5>
4494
4495<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004496The '<tt>llvm.memmove.*</tt>' intrinsics move a block of memory from the source
4497location to the destination location. It is similar to the
4498'<tt>llvm.memcmp</tt>' intrinsic but allows the two memory locations to overlap.
Chris Lattnerf30152e2004-02-12 18:10:10 +00004499</p>
4500
4501<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004502Note that, unlike the standard libc function, the <tt>llvm.memmove.*</tt>
4503intrinsics do not return a value, and takes an extra alignment argument.
Chris Lattnerf30152e2004-02-12 18:10:10 +00004504</p>
4505
4506<h5>Arguments:</h5>
4507
4508<p>
4509The first argument is a pointer to the destination, the second is a pointer to
Chris Lattner0c8b2592006-03-03 00:07:20 +00004510the source. The third argument is an integer argument
Chris Lattnerf30152e2004-02-12 18:10:10 +00004511specifying the number of bytes to copy, and the fourth argument is the alignment
4512of the source and destination locations.
4513</p>
4514
Chris Lattner4c67c482004-02-12 21:18:15 +00004515<p>
4516If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004517the caller guarantees that the source and destination pointers are aligned to
4518that boundary.
Chris Lattner4c67c482004-02-12 21:18:15 +00004519</p>
4520
Chris Lattnerf30152e2004-02-12 18:10:10 +00004521<h5>Semantics:</h5>
4522
4523<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004524The '<tt>llvm.memmove.*</tt>' intrinsics copy a block of memory from the source
Chris Lattnerf30152e2004-02-12 18:10:10 +00004525location to the destination location, which may overlap. It
4526copies "len" bytes of memory over. If the argument is known to be aligned to
4527some boundary, this can be specified as the fourth argument, otherwise it should
4528be set to 0 or 1.
4529</p>
4530</div>
4531
Chris Lattner941515c2004-01-06 05:31:32 +00004532
Chris Lattner3649c3a2004-02-14 04:08:35 +00004533<!-- _______________________________________________________________________ -->
4534<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004535 <a name="int_memset">'<tt>llvm.memset.*</tt>' Intrinsics</a>
Chris Lattner3649c3a2004-02-14 04:08:35 +00004536</div>
4537
4538<div class="doc_text">
4539
4540<h5>Syntax:</h5>
4541<pre>
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004542 declare void @llvm.memset.i32(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004543 i32 &lt;len&gt;, i32 &lt;align&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004544 declare void @llvm.memset.i64(i8 * &lt;dest&gt;, i8 &lt;val&gt;,
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004545 i64 &lt;len&gt;, i32 &lt;align&gt;)
Chris Lattner3649c3a2004-02-14 04:08:35 +00004546</pre>
4547
4548<h5>Overview:</h5>
4549
4550<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004551The '<tt>llvm.memset.*</tt>' intrinsics fill a block of memory with a particular
Chris Lattner3649c3a2004-02-14 04:08:35 +00004552byte value.
4553</p>
4554
4555<p>
4556Note that, unlike the standard libc function, the <tt>llvm.memset</tt> intrinsic
4557does not return a value, and takes an extra alignment argument.
4558</p>
4559
4560<h5>Arguments:</h5>
4561
4562<p>
4563The first argument is a pointer to the destination to fill, the second is the
Chris Lattner0c8b2592006-03-03 00:07:20 +00004564byte value to fill it with, the third argument is an integer
Chris Lattner3649c3a2004-02-14 04:08:35 +00004565argument specifying the number of bytes to fill, and the fourth argument is the
4566known alignment of destination location.
4567</p>
4568
4569<p>
4570If the call to this intrinisic has an alignment value that is not 0 or 1, then
Chris Lattner5316e5d2006-03-04 00:02:10 +00004571the caller guarantees that the destination pointer is aligned to that boundary.
Chris Lattner3649c3a2004-02-14 04:08:35 +00004572</p>
4573
4574<h5>Semantics:</h5>
4575
4576<p>
Chris Lattner0c8b2592006-03-03 00:07:20 +00004577The '<tt>llvm.memset.*</tt>' intrinsics fill "len" bytes of memory starting at
4578the
Chris Lattner3649c3a2004-02-14 04:08:35 +00004579destination location. If the argument is known to be aligned to some boundary,
4580this can be specified as the fourth argument, otherwise it should be set to 0 or
45811.
4582</p>
4583</div>
4584
4585
Chris Lattner3b4f4372004-06-11 02:28:03 +00004586<!-- _______________________________________________________________________ -->
4587<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004588 <a name="int_sqrt">'<tt>llvm.sqrt.*</tt>' Intrinsic</a>
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004589</div>
4590
4591<div class="doc_text">
4592
4593<h5>Syntax:</h5>
Dale Johannesendd89d272007-10-02 17:47:38 +00004594<p>This is an overloaded intrinsic. You can use <tt>llvm.sqrt</tt> on any
Dan Gohmanb6324c12007-10-15 20:30:11 +00004595floating point or vector of floating point type. Not all targets support all
4596types however.
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004597<pre>
Dale Johannesendd89d272007-10-02 17:47:38 +00004598 declare float @llvm.sqrt.f32(float %Val)
4599 declare double @llvm.sqrt.f64(double %Val)
4600 declare x86_fp80 @llvm.sqrt.f80(x86_fp80 %Val)
4601 declare fp128 @llvm.sqrt.f128(fp128 %Val)
4602 declare ppc_fp128 @llvm.sqrt.ppcf128(ppc_fp128 %Val)
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004603</pre>
4604
4605<h5>Overview:</h5>
4606
4607<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004608The '<tt>llvm.sqrt</tt>' intrinsics return the sqrt of the specified operand,
Dan Gohmanb6324c12007-10-15 20:30:11 +00004609returning the same value as the libm '<tt>sqrt</tt>' functions would. Unlike
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004610<tt>sqrt</tt> in libm, however, <tt>llvm.sqrt</tt> has undefined behavior for
4611negative numbers (which allows for better optimization).
4612</p>
4613
4614<h5>Arguments:</h5>
4615
4616<p>
4617The argument and return value are floating point numbers of the same type.
4618</p>
4619
4620<h5>Semantics:</h5>
4621
4622<p>
Dan Gohman33988db2007-07-16 14:37:41 +00004623This function returns the sqrt of the specified operand if it is a nonnegative
Chris Lattner8a8f2e52005-07-21 01:29:16 +00004624floating point number.
4625</p>
4626</div>
4627
Chris Lattner33b73f92006-09-08 06:34:02 +00004628<!-- _______________________________________________________________________ -->
4629<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004630 <a name="int_powi">'<tt>llvm.powi.*</tt>' Intrinsic</a>
Chris Lattner33b73f92006-09-08 06:34:02 +00004631</div>
4632
4633<div class="doc_text">
4634
4635<h5>Syntax:</h5>
Dale Johannesendd89d272007-10-02 17:47:38 +00004636<p>This is an overloaded intrinsic. You can use <tt>llvm.powi</tt> on any
Dan Gohmanb6324c12007-10-15 20:30:11 +00004637floating point or vector of floating point type. Not all targets support all
4638types however.
Chris Lattner33b73f92006-09-08 06:34:02 +00004639<pre>
Dale Johannesendd89d272007-10-02 17:47:38 +00004640 declare float @llvm.powi.f32(float %Val, i32 %power)
4641 declare double @llvm.powi.f64(double %Val, i32 %power)
4642 declare x86_fp80 @llvm.powi.f80(x86_fp80 %Val, i32 %power)
4643 declare fp128 @llvm.powi.f128(fp128 %Val, i32 %power)
4644 declare ppc_fp128 @llvm.powi.ppcf128(ppc_fp128 %Val, i32 %power)
Chris Lattner33b73f92006-09-08 06:34:02 +00004645</pre>
4646
4647<h5>Overview:</h5>
4648
4649<p>
4650The '<tt>llvm.powi.*</tt>' intrinsics return the first operand raised to the
4651specified (positive or negative) power. The order of evaluation of
Dan Gohmanb6324c12007-10-15 20:30:11 +00004652multiplications is not defined. When a vector of floating point type is
4653used, the second argument remains a scalar integer value.
Chris Lattner33b73f92006-09-08 06:34:02 +00004654</p>
4655
4656<h5>Arguments:</h5>
4657
4658<p>
4659The second argument is an integer power, and the first is a value to raise to
4660that power.
4661</p>
4662
4663<h5>Semantics:</h5>
4664
4665<p>
4666This function returns the first value raised to the second power with an
4667unspecified sequence of rounding operations.</p>
4668</div>
4669
Dan Gohmanb6324c12007-10-15 20:30:11 +00004670<!-- _______________________________________________________________________ -->
4671<div class="doc_subsubsection">
4672 <a name="int_sin">'<tt>llvm.sin.*</tt>' Intrinsic</a>
4673</div>
4674
4675<div class="doc_text">
4676
4677<h5>Syntax:</h5>
4678<p>This is an overloaded intrinsic. You can use <tt>llvm.sin</tt> on any
4679floating point or vector of floating point type. Not all targets support all
4680types however.
4681<pre>
4682 declare float @llvm.sin.f32(float %Val)
4683 declare double @llvm.sin.f64(double %Val)
4684 declare x86_fp80 @llvm.sin.f80(x86_fp80 %Val)
4685 declare fp128 @llvm.sin.f128(fp128 %Val)
4686 declare ppc_fp128 @llvm.sin.ppcf128(ppc_fp128 %Val)
4687</pre>
4688
4689<h5>Overview:</h5>
4690
4691<p>
4692The '<tt>llvm.sin.*</tt>' intrinsics return the sine of the operand.
4693</p>
4694
4695<h5>Arguments:</h5>
4696
4697<p>
4698The argument and return value are floating point numbers of the same type.
4699</p>
4700
4701<h5>Semantics:</h5>
4702
4703<p>
4704This function returns the sine of the specified operand, returning the
4705same values as the libm <tt>sin</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00004706conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00004707</div>
4708
4709<!-- _______________________________________________________________________ -->
4710<div class="doc_subsubsection">
4711 <a name="int_cos">'<tt>llvm.cos.*</tt>' Intrinsic</a>
4712</div>
4713
4714<div class="doc_text">
4715
4716<h5>Syntax:</h5>
4717<p>This is an overloaded intrinsic. You can use <tt>llvm.cos</tt> on any
4718floating point or vector of floating point type. Not all targets support all
4719types however.
4720<pre>
4721 declare float @llvm.cos.f32(float %Val)
4722 declare double @llvm.cos.f64(double %Val)
4723 declare x86_fp80 @llvm.cos.f80(x86_fp80 %Val)
4724 declare fp128 @llvm.cos.f128(fp128 %Val)
4725 declare ppc_fp128 @llvm.cos.ppcf128(ppc_fp128 %Val)
4726</pre>
4727
4728<h5>Overview:</h5>
4729
4730<p>
4731The '<tt>llvm.cos.*</tt>' intrinsics return the cosine of the operand.
4732</p>
4733
4734<h5>Arguments:</h5>
4735
4736<p>
4737The argument and return value are floating point numbers of the same type.
4738</p>
4739
4740<h5>Semantics:</h5>
4741
4742<p>
4743This function returns the cosine of the specified operand, returning the
4744same values as the libm <tt>cos</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00004745conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00004746</div>
4747
4748<!-- _______________________________________________________________________ -->
4749<div class="doc_subsubsection">
4750 <a name="int_pow">'<tt>llvm.pow.*</tt>' Intrinsic</a>
4751</div>
4752
4753<div class="doc_text">
4754
4755<h5>Syntax:</h5>
4756<p>This is an overloaded intrinsic. You can use <tt>llvm.pow</tt> on any
4757floating point or vector of floating point type. Not all targets support all
4758types however.
4759<pre>
4760 declare float @llvm.pow.f32(float %Val, float %Power)
4761 declare double @llvm.pow.f64(double %Val, double %Power)
4762 declare x86_fp80 @llvm.pow.f80(x86_fp80 %Val, x86_fp80 %Power)
4763 declare fp128 @llvm.pow.f128(fp128 %Val, fp128 %Power)
4764 declare ppc_fp128 @llvm.pow.ppcf128(ppc_fp128 %Val, ppc_fp128 Power)
4765</pre>
4766
4767<h5>Overview:</h5>
4768
4769<p>
4770The '<tt>llvm.pow.*</tt>' intrinsics return the first operand raised to the
4771specified (positive or negative) power.
4772</p>
4773
4774<h5>Arguments:</h5>
4775
4776<p>
4777The second argument is a floating point power, and the first is a value to
4778raise to that power.
4779</p>
4780
4781<h5>Semantics:</h5>
4782
4783<p>
4784This function returns the first value raised to the second power,
4785returning the
4786same values as the libm <tt>pow</tt> functions would, and handles error
Dan Gohmand0806a02007-10-17 18:05:13 +00004787conditions in the same way.</p>
Dan Gohmanb6324c12007-10-15 20:30:11 +00004788</div>
4789
Chris Lattner33b73f92006-09-08 06:34:02 +00004790
Andrew Lenharth1d463522005-05-03 18:01:48 +00004791<!-- ======================================================================= -->
4792<div class="doc_subsection">
Nate Begeman0f223bb2006-01-13 23:26:38 +00004793 <a name="int_manip">Bit Manipulation Intrinsics</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004794</div>
4795
4796<div class="doc_text">
4797<p>
Nate Begeman0f223bb2006-01-13 23:26:38 +00004798LLVM provides intrinsics for a few important bit manipulation operations.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004799These allow efficient code generation for some algorithms.
4800</p>
4801
4802</div>
4803
4804<!-- _______________________________________________________________________ -->
4805<div class="doc_subsubsection">
Reid Spencer96a5f022007-04-04 02:42:35 +00004806 <a name="int_bswap">'<tt>llvm.bswap.*</tt>' Intrinsics</a>
Nate Begeman0f223bb2006-01-13 23:26:38 +00004807</div>
4808
4809<div class="doc_text">
4810
4811<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00004812<p>This is an overloaded intrinsic function. You can use bswap on any integer
Chandler Carruth7132e002007-08-04 01:51:18 +00004813type that is an even number of bytes (i.e. BitWidth % 16 == 0).
Nate Begeman0f223bb2006-01-13 23:26:38 +00004814<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00004815 declare i16 @llvm.bswap.i16(i16 &lt;id&gt;)
4816 declare i32 @llvm.bswap.i32(i32 &lt;id&gt;)
4817 declare i64 @llvm.bswap.i64(i64 &lt;id&gt;)
Nate Begeman0f223bb2006-01-13 23:26:38 +00004818</pre>
4819
4820<h5>Overview:</h5>
4821
4822<p>
Reid Spencerf361c4f2007-04-02 02:25:19 +00004823The '<tt>llvm.bswap</tt>' family of intrinsics is used to byte swap integer
Reid Spencer4eefaab2007-04-01 08:04:23 +00004824values with an even number of bytes (positive multiple of 16 bits). These are
4825useful for performing operations on data that is not in the target's native
4826byte order.
Nate Begeman0f223bb2006-01-13 23:26:38 +00004827</p>
4828
4829<h5>Semantics:</h5>
4830
4831<p>
Chandler Carruth7132e002007-08-04 01:51:18 +00004832The <tt>llvm.bswap.i16</tt> intrinsic returns an i16 value that has the high
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004833and low byte of the input i16 swapped. Similarly, the <tt>llvm.bswap.i32</tt>
4834intrinsic returns an i32 value that has the four bytes of the input i32
4835swapped, so that if the input bytes are numbered 0, 1, 2, 3 then the returned
Chandler Carruth7132e002007-08-04 01:51:18 +00004836i32 will have its bytes in 3, 2, 1, 0 order. The <tt>llvm.bswap.i48</tt>,
4837<tt>llvm.bswap.i64</tt> and other intrinsics extend this concept to
Reid Spencer4eefaab2007-04-01 08:04:23 +00004838additional even-byte lengths (6 bytes, 8 bytes and more, respectively).
Nate Begeman0f223bb2006-01-13 23:26:38 +00004839</p>
4840
4841</div>
4842
4843<!-- _______________________________________________________________________ -->
4844<div class="doc_subsubsection">
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004845 <a name="int_ctpop">'<tt>llvm.ctpop.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004846</div>
4847
4848<div class="doc_text">
4849
4850<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00004851<p>This is an overloaded intrinsic. You can use llvm.ctpop on any integer bit
4852width. Not all targets support all bit widths however.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004853<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00004854 declare i8 @llvm.ctpop.i8 (i8 &lt;src&gt;)
4855 declare i16 @llvm.ctpop.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004856 declare i32 @llvm.ctpop.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00004857 declare i64 @llvm.ctpop.i64(i64 &lt;src&gt;)
4858 declare i256 @llvm.ctpop.i256(i256 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00004859</pre>
4860
4861<h5>Overview:</h5>
4862
4863<p>
Chris Lattner069b5bd2006-01-16 22:38:59 +00004864The '<tt>llvm.ctpop</tt>' family of intrinsics counts the number of bits set in a
4865value.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004866</p>
4867
4868<h5>Arguments:</h5>
4869
4870<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00004871The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004872integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004873</p>
4874
4875<h5>Semantics:</h5>
4876
4877<p>
4878The '<tt>llvm.ctpop</tt>' intrinsic counts the 1's in a variable.
4879</p>
4880</div>
4881
4882<!-- _______________________________________________________________________ -->
4883<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00004884 <a name="int_ctlz">'<tt>llvm.ctlz.*</tt>' Intrinsic</a>
Andrew Lenharth1d463522005-05-03 18:01:48 +00004885</div>
4886
4887<div class="doc_text">
4888
4889<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00004890<p>This is an overloaded intrinsic. You can use <tt>llvm.ctlz</tt> on any
4891integer bit width. Not all targets support all bit widths however.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004892<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00004893 declare i8 @llvm.ctlz.i8 (i8 &lt;src&gt;)
4894 declare i16 @llvm.ctlz.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004895 declare i32 @llvm.ctlz.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00004896 declare i64 @llvm.ctlz.i64(i64 &lt;src&gt;)
4897 declare i256 @llvm.ctlz.i256(i256 &lt;src&gt;)
Andrew Lenharth1d463522005-05-03 18:01:48 +00004898</pre>
4899
4900<h5>Overview:</h5>
4901
4902<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004903The '<tt>llvm.ctlz</tt>' family of intrinsic functions counts the number of
4904leading zeros in a variable.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004905</p>
4906
4907<h5>Arguments:</h5>
4908
4909<p>
Chris Lattner573f64e2005-05-07 01:46:40 +00004910The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004911integer type. The return type must match the argument type.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004912</p>
4913
4914<h5>Semantics:</h5>
4915
4916<p>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004917The '<tt>llvm.ctlz</tt>' intrinsic counts the leading (most significant) zeros
4918in a variable. If the src == 0 then the result is the size in bits of the type
Reid Spencerb5ebf3d2006-12-31 07:07:53 +00004919of src. For example, <tt>llvm.ctlz(i32 2) = 30</tt>.
Andrew Lenharth1d463522005-05-03 18:01:48 +00004920</p>
4921</div>
Chris Lattner3b4f4372004-06-11 02:28:03 +00004922
4923
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004924
4925<!-- _______________________________________________________________________ -->
4926<div class="doc_subsubsection">
Chris Lattnerb748c672006-01-16 22:34:14 +00004927 <a name="int_cttz">'<tt>llvm.cttz.*</tt>' Intrinsic</a>
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004928</div>
4929
4930<div class="doc_text">
4931
4932<h5>Syntax:</h5>
Reid Spencer4eefaab2007-04-01 08:04:23 +00004933<p>This is an overloaded intrinsic. You can use <tt>llvm.cttz</tt> on any
4934integer bit width. Not all targets support all bit widths however.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004935<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00004936 declare i8 @llvm.cttz.i8 (i8 &lt;src&gt;)
4937 declare i16 @llvm.cttz.i16(i16 &lt;src&gt;)
Anton Korobeynikovbe9c93c2007-03-22 00:02:17 +00004938 declare i32 @llvm.cttz.i32(i32 &lt;src&gt;)
Chandler Carruth7132e002007-08-04 01:51:18 +00004939 declare i64 @llvm.cttz.i64(i64 &lt;src&gt;)
4940 declare i256 @llvm.cttz.i256(i256 &lt;src&gt;)
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004941</pre>
4942
4943<h5>Overview:</h5>
4944
4945<p>
Reid Spencerb4f9a6f2006-01-16 21:12:35 +00004946The '<tt>llvm.cttz</tt>' family of intrinsic functions counts the number of
4947trailing zeros.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004948</p>
4949
4950<h5>Arguments:</h5>
4951
4952<p>
4953The only argument is the value to be counted. The argument may be of any
Reid Spencer3e628eb92007-01-04 16:43:23 +00004954integer type. The return type must match the argument type.
Chris Lattnerefa20fa2005-05-15 19:39:26 +00004955</p>
4956
4957<h5>Semantics:</h5>
4958
4959<p>
4960The '<tt>llvm.cttz</tt>' intrinsic counts the trailing (least significant) zeros
4961in a variable. If the src == 0 then the result is the size in bits of the type
4962of src. For example, <tt>llvm.cttz(2) = 1</tt>.
4963</p>
4964</div>
4965
Reid Spencer8a5799f2007-04-01 08:27:01 +00004966<!-- _______________________________________________________________________ -->
4967<div class="doc_subsubsection">
Reid Spencerea2945e2007-04-10 02:51:31 +00004968 <a name="int_part_select">'<tt>llvm.part.select.*</tt>' Intrinsic</a>
Reid Spencer8bc7d952007-04-01 19:00:37 +00004969</div>
4970
4971<div class="doc_text">
4972
4973<h5>Syntax:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00004974<p>This is an overloaded intrinsic. You can use <tt>llvm.part.select</tt>
Reid Spencer8bc7d952007-04-01 19:00:37 +00004975on any integer bit width.
4976<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00004977 declare i17 @llvm.part.select.i17 (i17 %val, i32 %loBit, i32 %hiBit)
4978 declare i29 @llvm.part.select.i29 (i29 %val, i32 %loBit, i32 %hiBit)
Reid Spencer8bc7d952007-04-01 19:00:37 +00004979</pre>
4980
4981<h5>Overview:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00004982<p>The '<tt>llvm.part.select</tt>' family of intrinsic functions selects a
Reid Spencer8bc7d952007-04-01 19:00:37 +00004983range of bits from an integer value and returns them in the same bit width as
4984the original value.</p>
4985
4986<h5>Arguments:</h5>
4987<p>The first argument, <tt>%val</tt> and the result may be integer types of
4988any bit width but they must have the same bit width. The second and third
Reid Spencer96a5f022007-04-04 02:42:35 +00004989arguments must be <tt>i32</tt> type since they specify only a bit index.</p>
Reid Spencer8bc7d952007-04-01 19:00:37 +00004990
4991<h5>Semantics:</h5>
Reid Spencerea2945e2007-04-10 02:51:31 +00004992<p>The operation of the '<tt>llvm.part.select</tt>' intrinsic has two modes
Reid Spencer96a5f022007-04-04 02:42:35 +00004993of operation: forwards and reverse. If <tt>%loBit</tt> is greater than
4994<tt>%hiBits</tt> then the intrinsic operates in reverse mode. Otherwise it
4995operates in forward mode.</p>
4996<p>In forward mode, this intrinsic is the equivalent of shifting <tt>%val</tt>
4997right by <tt>%loBit</tt> bits and then ANDing it with a mask with
Reid Spencer8bc7d952007-04-01 19:00:37 +00004998only the <tt>%hiBit - %loBit</tt> bits set, as follows:</p>
4999<ol>
5000 <li>The <tt>%val</tt> is shifted right (LSHR) by the number of bits specified
5001 by <tt>%loBits</tt>. This normalizes the value to the low order bits.</li>
5002 <li>The <tt>%loBits</tt> value is subtracted from the <tt>%hiBits</tt> value
5003 to determine the number of bits to retain.</li>
5004 <li>A mask of the retained bits is created by shifting a -1 value.</li>
5005 <li>The mask is ANDed with <tt>%val</tt> to produce the result.
5006</ol>
Reid Spencer70845c02007-05-14 16:14:57 +00005007<p>In reverse mode, a similar computation is made except that the bits are
5008returned in the reverse order. So, for example, if <tt>X</tt> has the value
5009<tt>i16 0x0ACF (101011001111)</tt> and we apply
5010<tt>part.select(i16 X, 8, 3)</tt> to it, we get back the value
5011<tt>i16 0x0026 (000000100110)</tt>.</p>
Reid Spencer8bc7d952007-04-01 19:00:37 +00005012</div>
5013
Reid Spencer5bf54c82007-04-11 23:23:49 +00005014<div class="doc_subsubsection">
5015 <a name="int_part_set">'<tt>llvm.part.set.*</tt>' Intrinsic</a>
5016</div>
5017
5018<div class="doc_text">
5019
5020<h5>Syntax:</h5>
5021<p>This is an overloaded intrinsic. You can use <tt>llvm.part.set</tt>
5022on any integer bit width.
5023<pre>
Chandler Carruth7132e002007-08-04 01:51:18 +00005024 declare i17 @llvm.part.set.i17.i9 (i17 %val, i9 %repl, i32 %lo, i32 %hi)
5025 declare i29 @llvm.part.set.i29.i9 (i29 %val, i9 %repl, i32 %lo, i32 %hi)
Reid Spencer5bf54c82007-04-11 23:23:49 +00005026</pre>
5027
5028<h5>Overview:</h5>
5029<p>The '<tt>llvm.part.set</tt>' family of intrinsic functions replaces a range
5030of bits in an integer value with another integer value. It returns the integer
5031with the replaced bits.</p>
5032
5033<h5>Arguments:</h5>
5034<p>The first argument, <tt>%val</tt> and the result may be integer types of
5035any bit width but they must have the same bit width. <tt>%val</tt> is the value
5036whose bits will be replaced. The second argument, <tt>%repl</tt> may be an
5037integer of any bit width. The third and fourth arguments must be <tt>i32</tt>
5038type since they specify only a bit index.</p>
5039
5040<h5>Semantics:</h5>
5041<p>The operation of the '<tt>llvm.part.set</tt>' intrinsic has two modes
5042of operation: forwards and reverse. If <tt>%lo</tt> is greater than
5043<tt>%hi</tt> then the intrinsic operates in reverse mode. Otherwise it
5044operates in forward mode.</p>
5045<p>For both modes, the <tt>%repl</tt> value is prepared for use by either
5046truncating it down to the size of the replacement area or zero extending it
5047up to that size.</p>
5048<p>In forward mode, the bits between <tt>%lo</tt> and <tt>%hi</tt> (inclusive)
5049are replaced with corresponding bits from <tt>%repl</tt>. That is the 0th bit
5050in <tt>%repl</tt> replaces the <tt>%lo</tt>th bit in <tt>%val</tt> and etc. up
5051to the <tt>%hi</tt>th bit.
Reid Spencer146281c2007-05-14 16:50:20 +00005052<p>In reverse mode, a similar computation is made except that the bits are
5053reversed. That is, the <tt>0</tt>th bit in <tt>%repl</tt> replaces the
5054<tt>%hi</tt> bit in <tt>%val</tt> and etc. down to the <tt>%lo</tt>th bit.
Reid Spencer5bf54c82007-04-11 23:23:49 +00005055<h5>Examples:</h5>
5056<pre>
Reid Spencerc70afc32007-04-12 01:03:03 +00005057 llvm.part.set(0xFFFF, 0, 4, 7) -&gt; 0xFF0F
Reid Spencer146281c2007-05-14 16:50:20 +00005058 llvm.part.set(0xFFFF, 0, 7, 4) -&gt; 0xFF0F
5059 llvm.part.set(0xFFFF, 1, 7, 4) -&gt; 0xFF8F
5060 llvm.part.set(0xFFFF, F, 8, 3) -&gt; 0xFFE7
Reid Spencerc70afc32007-04-12 01:03:03 +00005061 llvm.part.set(0xFFFF, 0, 3, 8) -&gt; 0xFE07
Reid Spencer7972c472007-04-11 23:49:50 +00005062</pre>
Reid Spencer5bf54c82007-04-11 23:23:49 +00005063</div>
5064
Chris Lattner941515c2004-01-06 05:31:32 +00005065<!-- ======================================================================= -->
5066<div class="doc_subsection">
5067 <a name="int_debugger">Debugger Intrinsics</a>
5068</div>
5069
5070<div class="doc_text">
5071<p>
5072The LLVM debugger intrinsics (which all start with <tt>llvm.dbg.</tt> prefix),
5073are described in the <a
5074href="SourceLevelDebugging.html#format_common_intrinsics">LLVM Source Level
5075Debugging</a> document.
5076</p>
5077</div>
5078
5079
Jim Laskey2211f492007-03-14 19:31:19 +00005080<!-- ======================================================================= -->
5081<div class="doc_subsection">
5082 <a name="int_eh">Exception Handling Intrinsics</a>
5083</div>
5084
5085<div class="doc_text">
5086<p> The LLVM exception handling intrinsics (which all start with
5087<tt>llvm.eh.</tt> prefix), are described in the <a
5088href="ExceptionHandling.html#format_common_intrinsics">LLVM Exception
5089Handling</a> document. </p>
5090</div>
5091
Tanya Lattnercb1b9602007-06-15 20:50:54 +00005092<!-- ======================================================================= -->
5093<div class="doc_subsection">
Duncan Sands86e01192007-09-11 14:10:23 +00005094 <a name="int_trampoline">Trampoline Intrinsic</a>
Duncan Sands644f9172007-07-27 12:58:54 +00005095</div>
5096
5097<div class="doc_text">
5098<p>
Duncan Sands86e01192007-09-11 14:10:23 +00005099 This intrinsic makes it possible to excise one parameter, marked with
Duncan Sands644f9172007-07-27 12:58:54 +00005100 the <tt>nest</tt> attribute, from a function. The result is a callable
5101 function pointer lacking the nest parameter - the caller does not need
5102 to provide a value for it. Instead, the value to use is stored in
5103 advance in a "trampoline", a block of memory usually allocated
5104 on the stack, which also contains code to splice the nest value into the
5105 argument list. This is used to implement the GCC nested function address
5106 extension.
5107</p>
5108<p>
5109 For example, if the function is
5110 <tt>i32 f(i8* nest %c, i32 %x, i32 %y)</tt> then the resulting function
Bill Wendling252570f2007-09-22 09:23:55 +00005111 pointer has signature <tt>i32 (i32, i32)*</tt>. It can be created as follows:</p>
Duncan Sands644f9172007-07-27 12:58:54 +00005112<pre>
Duncan Sands86e01192007-09-11 14:10:23 +00005113 %tramp = alloca [10 x i8], align 4 ; size and alignment only correct for X86
5114 %tramp1 = getelementptr [10 x i8]* %tramp, i32 0, i32 0
5115 %p = call i8* @llvm.init.trampoline( i8* %tramp1, i8* bitcast (i32 (i8* nest , i32, i32)* @f to i8*), i8* %nval )
5116 %fp = bitcast i8* %p to i32 (i32, i32)*
Duncan Sands644f9172007-07-27 12:58:54 +00005117</pre>
Bill Wendling252570f2007-09-22 09:23:55 +00005118 <p>The call <tt>%val = call i32 %fp( i32 %x, i32 %y )</tt> is then equivalent
5119 to <tt>%val = call i32 %f( i8* %nval, i32 %x, i32 %y )</tt>.</p>
Duncan Sands644f9172007-07-27 12:58:54 +00005120</div>
5121
5122<!-- _______________________________________________________________________ -->
5123<div class="doc_subsubsection">
5124 <a name="int_it">'<tt>llvm.init.trampoline</tt>' Intrinsic</a>
5125</div>
5126<div class="doc_text">
5127<h5>Syntax:</h5>
5128<pre>
Duncan Sands86e01192007-09-11 14:10:23 +00005129declare i8* @llvm.init.trampoline(i8* &lt;tramp&gt;, i8* &lt;func&gt;, i8* &lt;nval&gt;)
Duncan Sands644f9172007-07-27 12:58:54 +00005130</pre>
5131<h5>Overview:</h5>
5132<p>
Duncan Sands86e01192007-09-11 14:10:23 +00005133 This fills the memory pointed to by <tt>tramp</tt> with code
5134 and returns a function pointer suitable for executing it.
Duncan Sands644f9172007-07-27 12:58:54 +00005135</p>
5136<h5>Arguments:</h5>
5137<p>
5138 The <tt>llvm.init.trampoline</tt> intrinsic takes three arguments, all
5139 pointers. The <tt>tramp</tt> argument must point to a sufficiently large
5140 and sufficiently aligned block of memory; this memory is written to by the
Duncan Sandsf2bcd372007-08-22 23:39:54 +00005141 intrinsic. Note that the size and the alignment are target-specific - LLVM
5142 currently provides no portable way of determining them, so a front-end that
5143 generates this intrinsic needs to have some target-specific knowledge.
5144 The <tt>func</tt> argument must hold a function bitcast to an <tt>i8*</tt>.
Duncan Sands644f9172007-07-27 12:58:54 +00005145</p>
5146<h5>Semantics:</h5>
5147<p>
5148 The block of memory pointed to by <tt>tramp</tt> is filled with target
Duncan Sands86e01192007-09-11 14:10:23 +00005149 dependent code, turning it into a function. A pointer to this function is
5150 returned, but needs to be bitcast to an
Duncan Sands644f9172007-07-27 12:58:54 +00005151 <a href="#int_trampoline">appropriate function pointer type</a>
Duncan Sands86e01192007-09-11 14:10:23 +00005152 before being called. The new function's signature is the same as that of
5153 <tt>func</tt> with any arguments marked with the <tt>nest</tt> attribute
5154 removed. At most one such <tt>nest</tt> argument is allowed, and it must be
5155 of pointer type. Calling the new function is equivalent to calling
5156 <tt>func</tt> with the same argument list, but with <tt>nval</tt> used for the
5157 missing <tt>nest</tt> argument. If, after calling
5158 <tt>llvm.init.trampoline</tt>, the memory pointed to by <tt>tramp</tt> is
5159 modified, then the effect of any later call to the returned function pointer is
5160 undefined.
Duncan Sands644f9172007-07-27 12:58:54 +00005161</p>
5162</div>
5163
5164<!-- ======================================================================= -->
5165<div class="doc_subsection">
Tanya Lattnercb1b9602007-06-15 20:50:54 +00005166 <a name="int_general">General Intrinsics</a>
5167</div>
5168
5169<div class="doc_text">
5170<p> This class of intrinsics is designed to be generic and has
5171no specific purpose. </p>
5172</div>
5173
5174<!-- _______________________________________________________________________ -->
5175<div class="doc_subsubsection">
5176 <a name="int_var_annotation">'<tt>llvm.var.annotation</tt>' Intrinsic</a>
5177</div>
5178
5179<div class="doc_text">
5180
5181<h5>Syntax:</h5>
5182<pre>
Tanya Lattnerbed1d4d2007-06-18 23:42:37 +00005183 declare void @llvm.var.annotation(i8* &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattnercb1b9602007-06-15 20:50:54 +00005184</pre>
5185
5186<h5>Overview:</h5>
5187
5188<p>
5189The '<tt>llvm.var.annotation</tt>' intrinsic
5190</p>
5191
5192<h5>Arguments:</h5>
5193
5194<p>
Tanya Lattnerbed1d4d2007-06-18 23:42:37 +00005195The first argument is a pointer to a value, the second is a pointer to a
5196global string, the third is a pointer to a global string which is the source
5197file name, and the last argument is the line number.
Tanya Lattnercb1b9602007-06-15 20:50:54 +00005198</p>
5199
5200<h5>Semantics:</h5>
5201
5202<p>
5203This intrinsic allows annotation of local variables with arbitrary strings.
5204This can be useful for special purpose optimizations that want to look for these
5205 annotations. These have no other defined use, they are ignored by code
5206 generation and optimization.
5207</div>
5208
Tanya Lattner293c0372007-09-21 22:59:12 +00005209<!-- _______________________________________________________________________ -->
5210<div class="doc_subsubsection">
Tanya Lattner0186a652007-09-21 23:57:59 +00005211 <a name="int_annotation">'<tt>llvm.annotation.*</tt>' Intrinsic</a>
Tanya Lattner293c0372007-09-21 22:59:12 +00005212</div>
5213
5214<div class="doc_text">
5215
5216<h5>Syntax:</h5>
Tanya Lattner23dbd572007-09-21 23:56:27 +00005217<p>This is an overloaded intrinsic. You can use '<tt>llvm.annotation</tt>' on
5218any integer bit width.
5219</p>
Tanya Lattner293c0372007-09-21 22:59:12 +00005220<pre>
Tanya Lattnercf3e26f2007-09-22 00:03:01 +00005221 declare i8 @llvm.annotation.i8(i8 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
5222 declare i16 @llvm.annotation.i16(i16 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
5223 declare i32 @llvm.annotation.i32(i32 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
5224 declare i64 @llvm.annotation.i64(i64 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
5225 declare i256 @llvm.annotation.i256(i256 &lt;val&gt;, i8* &lt;str&gt;, i8* &lt;str&gt;, i32 &lt;int&gt; )
Tanya Lattner293c0372007-09-21 22:59:12 +00005226</pre>
5227
5228<h5>Overview:</h5>
Tanya Lattner23dbd572007-09-21 23:56:27 +00005229
5230<p>
5231The '<tt>llvm.annotation</tt>' intrinsic.
Tanya Lattner293c0372007-09-21 22:59:12 +00005232</p>
5233
5234<h5>Arguments:</h5>
5235
5236<p>
5237The first argument is an integer value (result of some expression),
5238the second is a pointer to a global string, the third is a pointer to a global
5239string which is the source file name, and the last argument is the line number.
Tanya Lattner23dbd572007-09-21 23:56:27 +00005240It returns the value of the first argument.
Tanya Lattner293c0372007-09-21 22:59:12 +00005241</p>
5242
5243<h5>Semantics:</h5>
5244
5245<p>
5246This intrinsic allows annotations to be put on arbitrary expressions
5247with arbitrary strings. This can be useful for special purpose optimizations
5248that want to look for these annotations. These have no other defined use, they
5249are ignored by code generation and optimization.
5250</div>
Jim Laskey2211f492007-03-14 19:31:19 +00005251
Chris Lattner2f7c9632001-06-06 20:29:01 +00005252<!-- *********************************************************************** -->
Chris Lattner2f7c9632001-06-06 20:29:01 +00005253<hr>
Misha Brukmanc501f552004-03-01 17:47:27 +00005254<address>
5255 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
5256 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
5257 <a href="http://validator.w3.org/check/referer"><img
Chris Lattnerb8f816e2008-01-04 04:33:49 +00005258 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
Misha Brukmanc501f552004-03-01 17:47:27 +00005259
5260 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
Reid Spencerca058542006-03-14 05:39:39 +00005261 <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
Misha Brukmanc501f552004-03-01 17:47:27 +00005262 Last modified: $Date$
5263</address>
Chris Lattnerb8f816e2008-01-04 04:33:49 +00005264
5265</div>
Misha Brukman76307852003-11-08 01:05:38 +00005266</body>
5267</html>