1 //===-- llvm/Function.h - Class to represent a single function --*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains the declaration of the Function class, which represents a
11 // single function/procedure in LLVM.
13 // A function basically consists of a list of basic blocks, a list of arguments,
14 // and a symbol table.
16 //===----------------------------------------------------------------------===//
18 #ifndef LLVM_IR_FUNCTION_H
19 #define LLVM_IR_FUNCTION_H
21 #include "llvm/IR/Argument.h"
22 #include "llvm/IR/Attributes.h"
23 #include "llvm/IR/BasicBlock.h"
24 #include "llvm/IR/CallingConv.h"
25 #include "llvm/IR/GlobalValue.h"
26 #include "llvm/Support/Compiler.h"
33 // Traits for intrusive list of basic blocks...
34 template<> struct ilist_traits<BasicBlock>
35 : public SymbolTableListTraits<BasicBlock, Function> {
37 // createSentinel is used to get hold of the node that marks the end of the
38 // list... (same trick used here as in ilist_traits<Instruction>)
39 BasicBlock *createSentinel() const {
40 return static_cast<BasicBlock*>(&Sentinel);
42 static void destroySentinel(BasicBlock*) {}
44 BasicBlock *provideInitialHead() const { return createSentinel(); }
45 BasicBlock *ensureHead(BasicBlock*) const { return createSentinel(); }
46 static void noteHead(BasicBlock*, BasicBlock*) {}
48 static ValueSymbolTable *getSymTab(Function *ItemParent);
50 mutable ilist_half_node<BasicBlock> Sentinel;
53 template<> struct ilist_traits<Argument>
54 : public SymbolTableListTraits<Argument, Function> {
56 Argument *createSentinel() const {
57 return static_cast<Argument*>(&Sentinel);
59 static void destroySentinel(Argument*) {}
61 Argument *provideInitialHead() const { return createSentinel(); }
62 Argument *ensureHead(Argument*) const { return createSentinel(); }
63 static void noteHead(Argument*, Argument*) {}
65 static ValueSymbolTable *getSymTab(Function *ItemParent);
67 mutable ilist_half_node<Argument> Sentinel;
70 class Function : public GlobalValue,
71 public ilist_node<Function> {
73 typedef iplist<Argument> ArgumentListType;
74 typedef iplist<BasicBlock> BasicBlockListType;
76 // BasicBlock iterators...
77 typedef BasicBlockListType::iterator iterator;
78 typedef BasicBlockListType::const_iterator const_iterator;
80 typedef ArgumentListType::iterator arg_iterator;
81 typedef ArgumentListType::const_iterator const_arg_iterator;
84 // Important things that make up a function!
85 BasicBlockListType BasicBlocks; ///< The basic blocks
86 mutable ArgumentListType ArgumentList; ///< The formal arguments
87 ValueSymbolTable *SymTab; ///< Symbol table of args/instructions
88 AttributeSet AttributeList; ///< Parameter attributes
90 // HasLazyArguments is stored in Value::SubclassData.
91 /*bool HasLazyArguments;*/
93 // The Calling Convention is stored in Value::SubclassData.
94 /*CallingConv::ID CallingConvention;*/
96 friend class SymbolTableListTraits<Function, Module>;
98 void setParent(Module *parent);
100 /// hasLazyArguments/CheckLazyArguments - The argument list of a function is
101 /// built on demand, so that the list isn't allocated until the first client
102 /// needs it. The hasLazyArguments predicate returns true if the arg list
103 /// hasn't been set up yet.
104 bool hasLazyArguments() const {
105 return getSubclassDataFromValue() & 1;
107 void CheckLazyArguments() const {
108 if (hasLazyArguments())
109 BuildLazyArguments();
111 void BuildLazyArguments() const;
113 Function(const Function&) LLVM_DELETED_FUNCTION;
114 void operator=(const Function&) LLVM_DELETED_FUNCTION;
116 /// Function ctor - If the (optional) Module argument is specified, the
117 /// function is automatically inserted into the end of the function list for
120 Function(FunctionType *Ty, LinkageTypes Linkage,
121 const Twine &N = "", Module *M = 0);
124 static Function *Create(FunctionType *Ty, LinkageTypes Linkage,
125 const Twine &N = "", Module *M = 0) {
126 return new(0) Function(Ty, Linkage, N, M);
131 Type *getReturnType() const; // Return the type of the ret val
132 FunctionType *getFunctionType() const; // Return the FunctionType for me
134 /// getContext - Return a pointer to the LLVMContext associated with this
135 /// function, or NULL if this function is not bound to a context yet.
136 LLVMContext &getContext() const;
138 /// isVarArg - Return true if this function takes a variable number of
140 bool isVarArg() const;
142 /// getIntrinsicID - This method returns the ID number of the specified
143 /// function, or Intrinsic::not_intrinsic if the function is not an
144 /// instrinsic, or if the pointer is null. This value is always defined to be
145 /// zero to allow easy checking for whether a function is intrinsic or not.
146 /// The particular intrinsic functions which correspond to this value are
147 /// defined in llvm/Intrinsics.h.
149 unsigned getIntrinsicID() const LLVM_READONLY;
150 bool isIntrinsic() const { return getName().startswith("llvm."); }
152 /// getCallingConv()/setCallingConv(CC) - These method get and set the
153 /// calling convention of this function. The enum values for the known
154 /// calling conventions are defined in CallingConv.h.
155 CallingConv::ID getCallingConv() const {
156 return static_cast<CallingConv::ID>(getSubclassDataFromValue() >> 1);
158 void setCallingConv(CallingConv::ID CC) {
159 setValueSubclassData((getSubclassDataFromValue() & 1) |
160 (static_cast<unsigned>(CC) << 1));
163 /// getAttributes - Return the attribute list for this Function.
165 const AttributeSet &getAttributes() const { return AttributeList; }
167 /// setAttributes - Set the attribute list for this Function.
169 void setAttributes(const AttributeSet &attrs) { AttributeList = attrs; }
171 /// addFnAttr - Add function attributes to this function.
173 void addFnAttr(Attribute::AttrKind N) {
174 addAttribute(AttributeSet::FunctionIndex, Attribute::get(getContext(), N));
177 /// hasGC/getGC/setGC/clearGC - The name of the garbage collection algorithm
178 /// to use during code generation.
180 const char *getGC() const;
181 void setGC(const char *Str);
184 /// addAttribute - adds the attribute to the list of attributes.
185 void addAttribute(unsigned i, Attribute attr);
187 /// removeAttribute - removes the attribute from the list of attributes.
188 void removeAttribute(unsigned i, Attribute attr);
190 /// @brief Extract the alignment for a call or parameter (0=unknown).
191 unsigned getParamAlignment(unsigned i) const {
192 return AttributeList.getParamAlignment(i);
195 /// @brief Determine if the function does not access memory.
196 bool doesNotAccessMemory() const {
197 return AttributeList.hasAttribute(AttributeSet::FunctionIndex,
198 Attribute::ReadNone);
200 void setDoesNotAccessMemory() {
201 addFnAttr(Attribute::ReadNone);
204 /// @brief Determine if the function does not access or only reads memory.
205 bool onlyReadsMemory() const {
206 return doesNotAccessMemory() ||
207 AttributeList.hasAttribute(AttributeSet::FunctionIndex,
208 Attribute::ReadOnly);
210 void setOnlyReadsMemory() {
211 addFnAttr(Attribute::ReadOnly);
214 /// @brief Determine if the function cannot return.
215 bool doesNotReturn() const {
216 return AttributeList.hasAttribute(AttributeSet::FunctionIndex,
217 Attribute::NoReturn);
219 void setDoesNotReturn() {
220 addFnAttr(Attribute::NoReturn);
223 /// @brief Determine if the function cannot unwind.
224 bool doesNotThrow() const {
225 return AttributeList.hasAttribute(AttributeSet::FunctionIndex,
226 Attribute::NoUnwind);
228 void setDoesNotThrow() {
229 addFnAttr(Attribute::NoUnwind);
232 /// @brief Determine if the call cannot be duplicated.
233 bool cannotDuplicate() const {
234 return AttributeList.hasAttribute(AttributeSet::FunctionIndex,
235 Attribute::NoDuplicate);
237 void setCannotDuplicate() {
238 addFnAttr(Attribute::NoDuplicate);
241 /// @brief True if the ABI mandates (or the user requested) that this
242 /// function be in a unwind table.
243 bool hasUWTable() const {
244 return AttributeList.hasAttribute(AttributeSet::FunctionIndex,
247 void setHasUWTable() {
248 addFnAttr(Attribute::UWTable);
251 /// @brief True if this function needs an unwind table.
252 bool needsUnwindTableEntry() const {
253 return hasUWTable() || !doesNotThrow();
256 /// @brief Determine if the function returns a structure through first
257 /// pointer argument.
258 bool hasStructRetAttr() const {
259 return AttributeList.hasAttribute(1, Attribute::StructRet);
262 /// @brief Determine if the parameter does not alias other parameters.
263 /// @param n The parameter to check. 1 is the first parameter, 0 is the return
264 bool doesNotAlias(unsigned n) const {
265 return AttributeList.hasAttribute(n, Attribute::NoAlias);
267 void setDoesNotAlias(unsigned n) {
268 addAttribute(n, Attribute::get(getContext(), Attribute::NoAlias));
271 /// @brief Determine if the parameter can be captured.
272 /// @param n The parameter to check. 1 is the first parameter, 0 is the return
273 bool doesNotCapture(unsigned n) const {
274 return AttributeList.hasAttribute(n, Attribute::NoCapture);
276 void setDoesNotCapture(unsigned n) {
277 addAttribute(n, Attribute::get(getContext(), Attribute::NoCapture));
280 /// copyAttributesFrom - copy all additional attributes (those not needed to
281 /// create a Function) from the Function Src to this one.
282 void copyAttributesFrom(const GlobalValue *Src);
284 /// deleteBody - This method deletes the body of the function, and converts
285 /// the linkage to external.
289 setLinkage(ExternalLinkage);
292 /// removeFromParent - This method unlinks 'this' from the containing module,
293 /// but does not delete it.
295 virtual void removeFromParent();
297 /// eraseFromParent - This method unlinks 'this' from the containing module
300 virtual void eraseFromParent();
303 /// Get the underlying elements of the Function... the basic block list is
304 /// empty for external functions.
306 const ArgumentListType &getArgumentList() const {
307 CheckLazyArguments();
310 ArgumentListType &getArgumentList() {
311 CheckLazyArguments();
314 static iplist<Argument> Function::*getSublistAccess(Argument*) {
315 return &Function::ArgumentList;
318 const BasicBlockListType &getBasicBlockList() const { return BasicBlocks; }
319 BasicBlockListType &getBasicBlockList() { return BasicBlocks; }
320 static iplist<BasicBlock> Function::*getSublistAccess(BasicBlock*) {
321 return &Function::BasicBlocks;
324 const BasicBlock &getEntryBlock() const { return front(); }
325 BasicBlock &getEntryBlock() { return front(); }
327 //===--------------------------------------------------------------------===//
328 // Symbol Table Accessing functions...
330 /// getSymbolTable() - Return the symbol table...
332 inline ValueSymbolTable &getValueSymbolTable() { return *SymTab; }
333 inline const ValueSymbolTable &getValueSymbolTable() const { return *SymTab; }
336 //===--------------------------------------------------------------------===//
337 // BasicBlock iterator forwarding functions
339 iterator begin() { return BasicBlocks.begin(); }
340 const_iterator begin() const { return BasicBlocks.begin(); }
341 iterator end () { return BasicBlocks.end(); }
342 const_iterator end () const { return BasicBlocks.end(); }
344 size_t size() const { return BasicBlocks.size(); }
345 bool empty() const { return BasicBlocks.empty(); }
346 const BasicBlock &front() const { return BasicBlocks.front(); }
347 BasicBlock &front() { return BasicBlocks.front(); }
348 const BasicBlock &back() const { return BasicBlocks.back(); }
349 BasicBlock &back() { return BasicBlocks.back(); }
351 //===--------------------------------------------------------------------===//
352 // Argument iterator forwarding functions
354 arg_iterator arg_begin() {
355 CheckLazyArguments();
356 return ArgumentList.begin();
358 const_arg_iterator arg_begin() const {
359 CheckLazyArguments();
360 return ArgumentList.begin();
362 arg_iterator arg_end() {
363 CheckLazyArguments();
364 return ArgumentList.end();
366 const_arg_iterator arg_end() const {
367 CheckLazyArguments();
368 return ArgumentList.end();
371 size_t arg_size() const;
372 bool arg_empty() const;
374 /// viewCFG - This function is meant for use from the debugger. You can just
375 /// say 'call F->viewCFG()' and a ghostview window should pop up from the
376 /// program, displaying the CFG of the current function with the code for each
377 /// basic block inside. This depends on there being a 'dot' and 'gv' program
380 void viewCFG() const;
382 /// viewCFGOnly - This function is meant for use from the debugger. It works
383 /// just like viewCFG, but it does not include the contents of basic blocks
384 /// into the nodes, just the label. If you are only interested in the CFG
385 /// this can make the graph smaller.
387 void viewCFGOnly() const;
389 /// Methods for support type inquiry through isa, cast, and dyn_cast:
390 static inline bool classof(const Value *V) {
391 return V->getValueID() == Value::FunctionVal;
394 /// dropAllReferences() - This method causes all the subinstructions to "let
395 /// go" of all references that they are maintaining. This allows one to
396 /// 'delete' a whole module at a time, even though there may be circular
397 /// references... first all references are dropped, and all use counts go to
398 /// zero. Then everything is deleted for real. Note that no operations are
399 /// valid on an object that has "dropped all references", except operator
402 /// Since no other object in the module can have references into the body of a
403 /// function, dropping all references deletes the entire body of the function,
404 /// including any contained basic blocks.
406 void dropAllReferences();
408 /// hasAddressTaken - returns true if there are any uses of this function
409 /// other than direct calls or invokes to it, or blockaddress expressions.
410 /// Optionally passes back an offending user for diagnostic purposes.
412 bool hasAddressTaken(const User** = 0) const;
414 /// isDefTriviallyDead - Return true if it is trivially safe to remove
415 /// this function definition from the module (because it isn't externally
416 /// visible, does not have its address taken, and has no callers). To make
417 /// this more accurate, call removeDeadConstantUsers first.
418 bool isDefTriviallyDead() const;
420 /// callsFunctionThatReturnsTwice - Return true if the function has a call to
421 /// setjmp or other function that gcc recognizes as "returning twice".
422 bool callsFunctionThatReturnsTwice() const;
425 // Shadow Value::setValueSubclassData with a private forwarding method so that
426 // subclasses cannot accidentally use it.
427 void setValueSubclassData(unsigned short D) {
428 Value::setValueSubclassData(D);
432 inline ValueSymbolTable *
433 ilist_traits<BasicBlock>::getSymTab(Function *F) {
434 return F ? &F->getValueSymbolTable() : 0;
437 inline ValueSymbolTable *
438 ilist_traits<Argument>::getSymTab(Function *F) {
439 return F ? &F->getValueSymbolTable() : 0;
442 } // End llvm namespace