1 //===--- CFG.h - Classes for representing and building CFGs------*- 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 defines the CFG and CFGBuilder classes for representing and
11 // building Control-Flow Graphs (CFGs) from ASTs.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_CLANG_CFG_H
16 #define LLVM_CLANG_CFG_H
18 #include "llvm/ADT/PointerIntPair.h"
19 #include "llvm/ADT/GraphTraits.h"
20 #include "llvm/Support/Allocator.h"
21 #include "llvm/Support/Casting.h"
22 #include "llvm/ADT/OwningPtr.h"
23 #include "llvm/ADT/DenseMap.h"
24 #include "llvm/ADT/BitVector.h"
25 #include "clang/AST/Stmt.h"
26 #include "clang/Analysis/Support/BumpVector.h"
27 #include "clang/Basic/SourceLocation.h"
32 class CXXDestructorDecl;
38 class CXXCtorInitializer;
39 class CXXBaseSpecifier;
40 class CXXBindTemporaryExpr;
46 /// CFGElement - Represents a top-level expression in a basic block.
59 DTOR_BEGIN = AutomaticObjectDtor,
60 DTOR_END = TemporaryDtor
64 // The int bits are used to mark the kind.
65 llvm::PointerIntPair<void *, 2> Data1;
66 llvm::PointerIntPair<void *, 2> Data2;
68 CFGElement(Kind kind, const void *Ptr1, const void *Ptr2 = 0)
69 : Data1(const_cast<void*>(Ptr1), ((unsigned) kind) & 0x3),
70 Data2(const_cast<void*>(Ptr2), (((unsigned) kind) >> 2) & 0x3) {}
75 Kind getKind() const {
76 unsigned x = Data2.getInt();
82 bool isValid() const { return getKind() != Invalid; }
84 operator bool() const { return isValid(); }
86 template<class ElemTy> const ElemTy *getAs() const {
87 if (llvm::isa<ElemTy>(this))
88 return static_cast<const ElemTy*>(this);
92 static bool classof(const CFGElement *E) { return true; }
95 class CFGStmt : public CFGElement {
97 CFGStmt(Stmt *S) : CFGElement(Statement, S) {}
99 const Stmt *getStmt() const {
100 return static_cast<const Stmt *>(Data1.getPointer());
103 static bool classof(const CFGElement *E) {
104 return E->getKind() == Statement;
108 /// CFGInitializer - Represents C++ base or member initializer from
109 /// constructor's initialization list.
110 class CFGInitializer : public CFGElement {
112 CFGInitializer(CXXCtorInitializer *initializer)
113 : CFGElement(Initializer, initializer) {}
115 CXXCtorInitializer* getInitializer() const {
116 return static_cast<CXXCtorInitializer*>(Data1.getPointer());
119 static bool classof(const CFGElement *E) {
120 return E->getKind() == Initializer;
124 /// CFGImplicitDtor - Represents C++ object destructor implicitly generated
125 /// by compiler on various occasions.
126 class CFGImplicitDtor : public CFGElement {
128 CFGImplicitDtor(Kind kind, const void *data1, const void *data2 = 0)
129 : CFGElement(kind, data1, data2) {
130 assert(kind >= DTOR_BEGIN && kind <= DTOR_END);
134 const CXXDestructorDecl *getDestructorDecl(ASTContext &astContext) const;
135 bool isNoReturn(ASTContext &astContext) const;
137 static bool classof(const CFGElement *E) {
138 Kind kind = E->getKind();
139 return kind >= DTOR_BEGIN && kind <= DTOR_END;
143 /// CFGAutomaticObjDtor - Represents C++ object destructor implicitly generated
144 /// for automatic object or temporary bound to const reference at the point
145 /// of leaving its local scope.
146 class CFGAutomaticObjDtor: public CFGImplicitDtor {
148 CFGAutomaticObjDtor(const VarDecl *var, const Stmt *stmt)
149 : CFGImplicitDtor(AutomaticObjectDtor, var, stmt) {}
151 const VarDecl *getVarDecl() const {
152 return static_cast<VarDecl*>(Data1.getPointer());
155 // Get statement end of which triggered the destructor call.
156 const Stmt *getTriggerStmt() const {
157 return static_cast<Stmt*>(Data2.getPointer());
160 static bool classof(const CFGElement *elem) {
161 return elem->getKind() == AutomaticObjectDtor;
165 /// CFGBaseDtor - Represents C++ object destructor implicitly generated for
166 /// base object in destructor.
167 class CFGBaseDtor : public CFGImplicitDtor {
169 CFGBaseDtor(const CXXBaseSpecifier *base)
170 : CFGImplicitDtor(BaseDtor, base) {}
172 const CXXBaseSpecifier *getBaseSpecifier() const {
173 return static_cast<const CXXBaseSpecifier*>(Data1.getPointer());
176 static bool classof(const CFGElement *E) {
177 return E->getKind() == BaseDtor;
181 /// CFGMemberDtor - Represents C++ object destructor implicitly generated for
182 /// member object in destructor.
183 class CFGMemberDtor : public CFGImplicitDtor {
185 CFGMemberDtor(const FieldDecl *field)
186 : CFGImplicitDtor(MemberDtor, field, 0) {}
188 const FieldDecl *getFieldDecl() const {
189 return static_cast<const FieldDecl*>(Data1.getPointer());
192 static bool classof(const CFGElement *E) {
193 return E->getKind() == MemberDtor;
197 /// CFGTemporaryDtor - Represents C++ object destructor implicitly generated
198 /// at the end of full expression for temporary object.
199 class CFGTemporaryDtor : public CFGImplicitDtor {
201 CFGTemporaryDtor(CXXBindTemporaryExpr *expr)
202 : CFGImplicitDtor(TemporaryDtor, expr, 0) {}
204 const CXXBindTemporaryExpr *getBindTemporaryExpr() const {
205 return static_cast<const CXXBindTemporaryExpr *>(Data1.getPointer());
208 static bool classof(const CFGElement *E) {
209 return E->getKind() == TemporaryDtor;
213 /// CFGTerminator - Represents CFGBlock terminator statement.
215 /// TemporaryDtorsBranch bit is set to true if the terminator marks a branch
216 /// in control flow of destructors of temporaries. In this case terminator
217 /// statement is the same statement that branches control flow in evaluation
218 /// of matching full expression.
219 class CFGTerminator {
220 llvm::PointerIntPair<Stmt *, 1> Data;
223 CFGTerminator(Stmt *S, bool TemporaryDtorsBranch = false)
224 : Data(S, TemporaryDtorsBranch) {}
226 Stmt *getStmt() { return Data.getPointer(); }
227 const Stmt *getStmt() const { return Data.getPointer(); }
229 bool isTemporaryDtorsBranch() const { return Data.getInt(); }
231 operator Stmt *() { return getStmt(); }
232 operator const Stmt *() const { return getStmt(); }
234 Stmt *operator->() { return getStmt(); }
235 const Stmt *operator->() const { return getStmt(); }
237 Stmt &operator*() { return *getStmt(); }
238 const Stmt &operator*() const { return *getStmt(); }
240 operator bool() const { return getStmt(); }
243 /// CFGBlock - Represents a single basic block in a source-level CFG.
246 /// (1) A set of statements/expressions (which may contain subexpressions).
247 /// (2) A "terminator" statement (not in the set of statements).
248 /// (3) A list of successors and predecessors.
250 /// Terminator: The terminator represents the type of control-flow that occurs
251 /// at the end of the basic block. The terminator is a Stmt* referring to an
252 /// AST node that has control-flow: if-statements, breaks, loops, etc.
253 /// If the control-flow is conditional, the condition expression will appear
254 /// within the set of statements in the block (usually the last statement).
256 /// Predecessors: the order in the set of predecessors is arbitrary.
258 /// Successors: the order in the set of successors is NOT arbitrary. We
259 /// currently have the following orderings based on the terminator:
261 /// Terminator Successor Ordering
262 /// -----------------------------------------------------
263 /// if Then Block; Else Block
264 /// ? operator LHS expression; RHS expression
265 /// &&, || expression that uses result of && or ||, RHS
267 /// But note that any of that may be NULL in case of optimized-out edges.
271 typedef BumpVector<CFGElement> ImplTy;
274 ElementList(BumpVectorContext &C) : Impl(C, 4) {}
276 typedef std::reverse_iterator<ImplTy::iterator> iterator;
277 typedef std::reverse_iterator<ImplTy::const_iterator> const_iterator;
278 typedef ImplTy::iterator reverse_iterator;
279 typedef ImplTy::const_iterator const_reverse_iterator;
281 void push_back(CFGElement e, BumpVectorContext &C) { Impl.push_back(e, C); }
282 reverse_iterator insert(reverse_iterator I, size_t Cnt, CFGElement E,
283 BumpVectorContext &C) {
284 return Impl.insert(I, Cnt, E, C);
287 CFGElement front() const { return Impl.back(); }
288 CFGElement back() const { return Impl.front(); }
290 iterator begin() { return Impl.rbegin(); }
291 iterator end() { return Impl.rend(); }
292 const_iterator begin() const { return Impl.rbegin(); }
293 const_iterator end() const { return Impl.rend(); }
294 reverse_iterator rbegin() { return Impl.begin(); }
295 reverse_iterator rend() { return Impl.end(); }
296 const_reverse_iterator rbegin() const { return Impl.begin(); }
297 const_reverse_iterator rend() const { return Impl.end(); }
299 CFGElement operator[](size_t i) const {
300 assert(i < Impl.size());
301 return Impl[Impl.size() - 1 - i];
304 size_t size() const { return Impl.size(); }
305 bool empty() const { return Impl.empty(); }
308 /// Stmts - The set of statements in the basic block.
309 ElementList Elements;
311 /// Label - An (optional) label that prefixes the executable
312 /// statements in the block. When this variable is non-NULL, it is
313 /// either an instance of LabelStmt, SwitchCase or CXXCatchStmt.
316 /// Terminator - The terminator for a basic block that
317 /// indicates the type of control-flow that occurs between a block
318 /// and its successors.
319 CFGTerminator Terminator;
321 /// LoopTarget - Some blocks are used to represent the "loop edge" to
322 /// the start of a loop from within the loop body. This Stmt* will be
323 /// refer to the loop statement for such blocks (and be null otherwise).
324 const Stmt *LoopTarget;
326 /// BlockID - A numerical ID assigned to a CFGBlock during construction
330 /// Predecessors/Successors - Keep track of the predecessor / successor
332 typedef BumpVector<CFGBlock*> AdjacentBlocks;
333 AdjacentBlocks Preds;
334 AdjacentBlocks Succs;
337 explicit CFGBlock(unsigned blockid, BumpVectorContext &C)
338 : Elements(C), Label(NULL), Terminator(NULL), LoopTarget(NULL),
339 BlockID(blockid), Preds(C, 1), Succs(C, 1) {}
342 // Statement iterators
343 typedef ElementList::iterator iterator;
344 typedef ElementList::const_iterator const_iterator;
345 typedef ElementList::reverse_iterator reverse_iterator;
346 typedef ElementList::const_reverse_iterator const_reverse_iterator;
348 CFGElement front() const { return Elements.front(); }
349 CFGElement back() const { return Elements.back(); }
351 iterator begin() { return Elements.begin(); }
352 iterator end() { return Elements.end(); }
353 const_iterator begin() const { return Elements.begin(); }
354 const_iterator end() const { return Elements.end(); }
356 reverse_iterator rbegin() { return Elements.rbegin(); }
357 reverse_iterator rend() { return Elements.rend(); }
358 const_reverse_iterator rbegin() const { return Elements.rbegin(); }
359 const_reverse_iterator rend() const { return Elements.rend(); }
361 unsigned size() const { return Elements.size(); }
362 bool empty() const { return Elements.empty(); }
364 CFGElement operator[](size_t i) const { return Elements[i]; }
367 typedef AdjacentBlocks::iterator pred_iterator;
368 typedef AdjacentBlocks::const_iterator const_pred_iterator;
369 typedef AdjacentBlocks::reverse_iterator pred_reverse_iterator;
370 typedef AdjacentBlocks::const_reverse_iterator const_pred_reverse_iterator;
372 typedef AdjacentBlocks::iterator succ_iterator;
373 typedef AdjacentBlocks::const_iterator const_succ_iterator;
374 typedef AdjacentBlocks::reverse_iterator succ_reverse_iterator;
375 typedef AdjacentBlocks::const_reverse_iterator const_succ_reverse_iterator;
377 pred_iterator pred_begin() { return Preds.begin(); }
378 pred_iterator pred_end() { return Preds.end(); }
379 const_pred_iterator pred_begin() const { return Preds.begin(); }
380 const_pred_iterator pred_end() const { return Preds.end(); }
382 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); }
383 pred_reverse_iterator pred_rend() { return Preds.rend(); }
384 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); }
385 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); }
387 succ_iterator succ_begin() { return Succs.begin(); }
388 succ_iterator succ_end() { return Succs.end(); }
389 const_succ_iterator succ_begin() const { return Succs.begin(); }
390 const_succ_iterator succ_end() const { return Succs.end(); }
392 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
393 succ_reverse_iterator succ_rend() { return Succs.rend(); }
394 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
395 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); }
397 unsigned succ_size() const { return Succs.size(); }
398 bool succ_empty() const { return Succs.empty(); }
400 unsigned pred_size() const { return Preds.size(); }
401 bool pred_empty() const { return Preds.empty(); }
404 class FilterOptions {
407 IgnoreDefaultsWithCoveredEnums = 0;
410 unsigned IgnoreDefaultsWithCoveredEnums : 1;
413 static bool FilterEdge(const FilterOptions &F, const CFGBlock *Src,
414 const CFGBlock *Dst);
416 template <typename IMPL, bool IsPred>
417 class FilteredCFGBlockIterator {
420 const FilterOptions F;
421 const CFGBlock *From;
423 explicit FilteredCFGBlockIterator(const IMPL &i, const IMPL &e,
424 const CFGBlock *from,
425 const FilterOptions &f)
426 : I(i), E(e), F(f), From(from) {}
428 bool hasMore() const { return I != E; }
430 FilteredCFGBlockIterator &operator++() {
431 do { ++I; } while (hasMore() && Filter(*I));
435 const CFGBlock *operator*() const { return *I; }
437 bool Filter(const CFGBlock *To) {
438 return IsPred ? FilterEdge(F, To, From) : FilterEdge(F, From, To);
442 typedef FilteredCFGBlockIterator<const_pred_iterator, true>
443 filtered_pred_iterator;
445 typedef FilteredCFGBlockIterator<const_succ_iterator, false>
446 filtered_succ_iterator;
448 filtered_pred_iterator filtered_pred_start_end(const FilterOptions &f) const {
449 return filtered_pred_iterator(pred_begin(), pred_end(), this, f);
452 filtered_succ_iterator filtered_succ_start_end(const FilterOptions &f) const {
453 return filtered_succ_iterator(succ_begin(), succ_end(), this, f);
456 // Manipulation of block contents
458 void setTerminator(Stmt *Statement) { Terminator = Statement; }
459 void setLabel(Stmt *Statement) { Label = Statement; }
460 void setLoopTarget(const Stmt *loopTarget) { LoopTarget = loopTarget; }
462 CFGTerminator getTerminator() { return Terminator; }
463 const CFGTerminator getTerminator() const { return Terminator; }
465 Stmt *getTerminatorCondition();
467 const Stmt *getTerminatorCondition() const {
468 return const_cast<CFGBlock*>(this)->getTerminatorCondition();
471 const Stmt *getLoopTarget() const { return LoopTarget; }
473 Stmt *getLabel() { return Label; }
474 const Stmt *getLabel() const { return Label; }
476 unsigned getBlockID() const { return BlockID; }
478 void dump(const CFG *cfg, const LangOptions &LO) const;
479 void print(raw_ostream &OS, const CFG* cfg, const LangOptions &LO) const;
480 void printTerminator(raw_ostream &OS, const LangOptions &LO) const;
482 void addSuccessor(CFGBlock *Block, BumpVectorContext &C) {
484 Block->Preds.push_back(this, C);
485 Succs.push_back(Block, C);
488 void appendStmt(Stmt *statement, BumpVectorContext &C) {
489 Elements.push_back(CFGStmt(statement), C);
492 void appendInitializer(CXXCtorInitializer *initializer,
493 BumpVectorContext &C) {
494 Elements.push_back(CFGInitializer(initializer), C);
497 void appendBaseDtor(const CXXBaseSpecifier *BS, BumpVectorContext &C) {
498 Elements.push_back(CFGBaseDtor(BS), C);
501 void appendMemberDtor(FieldDecl *FD, BumpVectorContext &C) {
502 Elements.push_back(CFGMemberDtor(FD), C);
505 void appendTemporaryDtor(CXXBindTemporaryExpr *E, BumpVectorContext &C) {
506 Elements.push_back(CFGTemporaryDtor(E), C);
509 void appendAutomaticObjDtor(VarDecl *VD, Stmt *S, BumpVectorContext &C) {
510 Elements.push_back(CFGAutomaticObjDtor(VD, S), C);
513 // Destructors must be inserted in reversed order. So insertion is in two
514 // steps. First we prepare space for some number of elements, then we insert
515 // the elements beginning at the last position in prepared space.
516 iterator beginAutomaticObjDtorsInsert(iterator I, size_t Cnt,
517 BumpVectorContext &C) {
518 return iterator(Elements.insert(I.base(), Cnt, CFGElement(), C));
520 iterator insertAutomaticObjDtor(iterator I, VarDecl *VD, Stmt *S) {
521 *I = CFGAutomaticObjDtor(VD, S);
526 /// CFG - Represents a source-level, intra-procedural CFG that represents the
527 /// control-flow of a Stmt. The Stmt can represent an entire function body,
528 /// or a single expression. A CFG will always contain one empty block that
529 /// represents the Exit point of the CFG. A CFG will also contain a designated
530 /// Entry block. The CFG solely represents control-flow; it consists of
531 /// CFGBlocks which are simply containers of Stmt*'s in the AST the CFG
532 /// was constructed from.
535 //===--------------------------------------------------------------------===//
536 // CFG Construction & Manipulation.
537 //===--------------------------------------------------------------------===//
540 llvm::BitVector alwaysAddMask;
542 typedef llvm::DenseMap<const Stmt *, const CFGBlock*> ForcedBlkExprs;
543 ForcedBlkExprs **forcedBlkExprs;
545 bool PruneTriviallyFalseEdges;
547 bool AddInitializers;
548 bool AddImplicitDtors;
550 bool alwaysAdd(const Stmt *stmt) const {
551 return alwaysAddMask[stmt->getStmtClass()];
554 BuildOptions &setAlwaysAdd(Stmt::StmtClass stmtClass, bool val = true) {
555 alwaysAddMask[stmtClass] = val;
559 BuildOptions &setAllAlwaysAdd() {
565 : alwaysAddMask(Stmt::lastStmtConstant, false)
566 ,forcedBlkExprs(0), PruneTriviallyFalseEdges(true)
568 ,AddInitializers(false)
569 ,AddImplicitDtors(false) {}
572 /// buildCFG - Builds a CFG from an AST. The responsibility to free the
573 /// constructed CFG belongs to the caller.
574 static CFG* buildCFG(const Decl *D, Stmt *AST, ASTContext *C,
575 const BuildOptions &BO);
577 /// createBlock - Create a new block in the CFG. The CFG owns the block;
578 /// the caller should not directly free it.
579 CFGBlock *createBlock();
581 /// setEntry - Set the entry block of the CFG. This is typically used
582 /// only during CFG construction. Most CFG clients expect that the
583 /// entry block has no predecessors and contains no statements.
584 void setEntry(CFGBlock *B) { Entry = B; }
586 /// setIndirectGotoBlock - Set the block used for indirect goto jumps.
587 /// This is typically used only during CFG construction.
588 void setIndirectGotoBlock(CFGBlock *B) { IndirectGotoBlock = B; }
590 //===--------------------------------------------------------------------===//
592 //===--------------------------------------------------------------------===//
594 typedef BumpVector<CFGBlock*> CFGBlockListTy;
595 typedef CFGBlockListTy::iterator iterator;
596 typedef CFGBlockListTy::const_iterator const_iterator;
597 typedef std::reverse_iterator<iterator> reverse_iterator;
598 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
600 CFGBlock & front() { return *Blocks.front(); }
601 CFGBlock & back() { return *Blocks.back(); }
603 iterator begin() { return Blocks.begin(); }
604 iterator end() { return Blocks.end(); }
605 const_iterator begin() const { return Blocks.begin(); }
606 const_iterator end() const { return Blocks.end(); }
608 reverse_iterator rbegin() { return Blocks.rbegin(); }
609 reverse_iterator rend() { return Blocks.rend(); }
610 const_reverse_iterator rbegin() const { return Blocks.rbegin(); }
611 const_reverse_iterator rend() const { return Blocks.rend(); }
613 CFGBlock & getEntry() { return *Entry; }
614 const CFGBlock & getEntry() const { return *Entry; }
615 CFGBlock & getExit() { return *Exit; }
616 const CFGBlock & getExit() const { return *Exit; }
618 CFGBlock * getIndirectGotoBlock() { return IndirectGotoBlock; }
619 const CFGBlock * getIndirectGotoBlock() const { return IndirectGotoBlock; }
621 typedef std::vector<const CFGBlock*>::const_iterator try_block_iterator;
622 try_block_iterator try_blocks_begin() const {
623 return TryDispatchBlocks.begin();
625 try_block_iterator try_blocks_end() const {
626 return TryDispatchBlocks.end();
629 void addTryDispatchBlock(const CFGBlock *block) {
630 TryDispatchBlocks.push_back(block);
633 //===--------------------------------------------------------------------===//
634 // Member templates useful for various batch operations over CFGs.
635 //===--------------------------------------------------------------------===//
637 template <typename CALLBACK>
638 void VisitBlockStmts(CALLBACK& O) const {
639 for (const_iterator I=begin(), E=end(); I != E; ++I)
640 for (CFGBlock::const_iterator BI=(*I)->begin(), BE=(*I)->end();
642 if (const CFGStmt *stmt = BI->getAs<CFGStmt>())
643 O(const_cast<Stmt*>(stmt->getStmt()));
647 //===--------------------------------------------------------------------===//
648 // CFG Introspection.
649 //===--------------------------------------------------------------------===//
651 struct BlkExprNumTy {
653 explicit BlkExprNumTy(signed idx) : Idx(idx) {}
654 explicit BlkExprNumTy() : Idx(-1) {}
655 operator bool() const { return Idx >= 0; }
656 operator unsigned() const { assert(Idx >=0); return (unsigned) Idx; }
659 bool isBlkExpr(const Stmt *S) { return getBlkExprNum(S); }
660 bool isBlkExpr(const Stmt *S) const {
661 return const_cast<CFG*>(this)->isBlkExpr(S);
663 BlkExprNumTy getBlkExprNum(const Stmt *S);
664 unsigned getNumBlkExprs();
666 /// getNumBlockIDs - Returns the total number of BlockIDs allocated (which
668 unsigned getNumBlockIDs() const { return NumBlockIDs; }
670 //===--------------------------------------------------------------------===//
671 // CFG Debugging: Pretty-Printing and Visualization.
672 //===--------------------------------------------------------------------===//
674 void viewCFG(const LangOptions &LO) const;
675 void print(raw_ostream &OS, const LangOptions &LO) const;
676 void dump(const LangOptions &LO) const;
678 //===--------------------------------------------------------------------===//
679 // Internal: constructors and data.
680 //===--------------------------------------------------------------------===//
682 CFG() : Entry(NULL), Exit(NULL), IndirectGotoBlock(NULL), NumBlockIDs(0),
683 BlkExprMap(NULL), Blocks(BlkBVC, 10) {}
687 llvm::BumpPtrAllocator& getAllocator() {
688 return BlkBVC.getAllocator();
691 BumpVectorContext &getBumpVectorContext() {
698 CFGBlock* IndirectGotoBlock; // Special block to contain collective dispatch
699 // for indirect gotos
700 unsigned NumBlockIDs;
702 // BlkExprMap - An opaque pointer to prevent inclusion of DenseMap.h.
703 // It represents a map from Expr* to integers to record the set of
704 // block-level expressions and their "statement number" in the CFG.
707 BumpVectorContext BlkBVC;
709 CFGBlockListTy Blocks;
711 /// C++ 'try' statements are modeled with an indirect dispatch block.
712 /// This is the collection of such blocks present in the CFG.
713 std::vector<const CFGBlock *> TryDispatchBlocks;
716 } // end namespace clang
718 //===----------------------------------------------------------------------===//
719 // GraphTraits specializations for CFG basic block graphs (source-level CFGs)
720 //===----------------------------------------------------------------------===//
724 /// Implement simplify_type for CFGTerminator, so that we can dyn_cast from
725 /// CFGTerminator to a specific Stmt class.
726 template <> struct simplify_type<const ::clang::CFGTerminator> {
727 typedef const ::clang::Stmt *SimpleType;
728 static SimpleType getSimplifiedValue(const ::clang::CFGTerminator &Val) {
729 return Val.getStmt();
733 template <> struct simplify_type< ::clang::CFGTerminator> {
734 typedef ::clang::Stmt *SimpleType;
735 static SimpleType getSimplifiedValue(const ::clang::CFGTerminator &Val) {
736 return const_cast<SimpleType>(Val.getStmt());
740 // Traits for: CFGBlock
742 template <> struct GraphTraits< ::clang::CFGBlock *> {
743 typedef ::clang::CFGBlock NodeType;
744 typedef ::clang::CFGBlock::succ_iterator ChildIteratorType;
746 static NodeType* getEntryNode(::clang::CFGBlock *BB)
749 static inline ChildIteratorType child_begin(NodeType* N)
750 { return N->succ_begin(); }
752 static inline ChildIteratorType child_end(NodeType* N)
753 { return N->succ_end(); }
756 template <> struct GraphTraits< const ::clang::CFGBlock *> {
757 typedef const ::clang::CFGBlock NodeType;
758 typedef ::clang::CFGBlock::const_succ_iterator ChildIteratorType;
760 static NodeType* getEntryNode(const clang::CFGBlock *BB)
763 static inline ChildIteratorType child_begin(NodeType* N)
764 { return N->succ_begin(); }
766 static inline ChildIteratorType child_end(NodeType* N)
767 { return N->succ_end(); }
770 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
771 typedef const ::clang::CFGBlock NodeType;
772 typedef ::clang::CFGBlock::const_pred_iterator ChildIteratorType;
774 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
777 static inline ChildIteratorType child_begin(NodeType* N)
778 { return N->pred_begin(); }
780 static inline ChildIteratorType child_end(NodeType* N)
781 { return N->pred_end(); }
786 template <> struct GraphTraits< ::clang::CFG* >
787 : public GraphTraits< ::clang::CFGBlock *> {
789 typedef ::clang::CFG::iterator nodes_iterator;
791 static NodeType *getEntryNode(::clang::CFG* F) { return &F->getEntry(); }
792 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->begin(); }
793 static nodes_iterator nodes_end(::clang::CFG* F) { return F->end(); }
796 template <> struct GraphTraits<const ::clang::CFG* >
797 : public GraphTraits<const ::clang::CFGBlock *> {
799 typedef ::clang::CFG::const_iterator nodes_iterator;
801 static NodeType *getEntryNode( const ::clang::CFG* F) {
802 return &F->getEntry();
804 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
807 static nodes_iterator nodes_end( const ::clang::CFG* F) {
812 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
813 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
815 typedef ::clang::CFG::const_iterator nodes_iterator;
817 static NodeType *getEntryNode(const ::clang::CFG* F) { return &F->getExit(); }
818 static nodes_iterator nodes_begin(const ::clang::CFG* F) { return F->begin();}
819 static nodes_iterator nodes_end(const ::clang::CFG* F) { return F->end(); }
821 } // end llvm namespace