LLVM  8.0.1
Interval.cpp
Go to the documentation of this file.
1 //===- Interval.cpp - Interval class code ---------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file contains the definition of the Interval class, which represents a
11 // partition of a control flow graph of some kind.
12 //
13 //===----------------------------------------------------------------------===//
14 
15 #include "llvm/Analysis/Interval.h"
16 #include "llvm/IR/BasicBlock.h"
17 #include "llvm/IR/CFG.h"
19 
20 using namespace llvm;
21 
22 //===----------------------------------------------------------------------===//
23 // Interval Implementation
24 //===----------------------------------------------------------------------===//
25 
26 // isLoop - Find out if there is a back edge in this interval...
27 bool Interval::isLoop() const {
28  // There is a loop in this interval iff one of the predecessors of the header
29  // node lives in the interval.
30  for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
31  I != E; ++I)
32  if (contains(*I))
33  return true;
34  return false;
35 }
36 
37 void Interval::print(raw_ostream &OS) const {
38  OS << "-------------------------------------------------------------\n"
39  << "Interval Contents:\n";
40 
41  // Print out all of the basic blocks in the interval...
42  for (const BasicBlock *Node : Nodes)
43  OS << *Node << "\n";
44 
45  OS << "Interval Predecessors:\n";
46  for (const BasicBlock *Predecessor : Predecessors)
47  OS << *Predecessor << "\n";
48 
49  OS << "Interval Successors:\n";
50  for (const BasicBlock *Successor : Successors)
51  OS << *Successor << "\n";
52 }
This class represents lattice values for constants.
Definition: AllocatorList.h:24
bool isLoop() const
isLoop - Find out if there is a back edge in this interval...
Definition: Interval.cpp:27
std::vector< BasicBlock * >::iterator pred_iterator
Definition: Interval.h:45
bool contains(BasicBlock *BB) const
contains - Find out if a basic block is in this interval
Definition: Interval.h:67
LLVM Basic Block Representation.
Definition: BasicBlock.h:58
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
Interval::pred_iterator pred_begin(Interval *I)
pred_begin/pred_end - define methods so that Intervals may be used just like BasicBlocks can with the...
Definition: Interval.h:113
Interval::pred_iterator pred_end(Interval *I)
Definition: Interval.h:116
std::vector< BasicBlock * > Nodes
Nodes - The basic blocks in this interval.
Definition: Interval.h:55
std::vector< BasicBlock * > Predecessors
Predecessors - List of BasicBlocks that have this Interval&#39;s header block as one of their successors...
Definition: Interval.h:64
std::vector< BasicBlock * > Successors
Successors - List of BasicBlocks that are reachable directly from nodes in this interval, but are not in the interval themselves.
Definition: Interval.h:60
This file provides various utilities for inspecting and working with the control flow graph in LLVM I...
#define I(x, y, z)
Definition: MD5.cpp:58
void print(raw_ostream &O) const
print - Show contents in human readable format...
Definition: Interval.cpp:37
This class implements an extremely fast bulk output stream that can only output to a stream...
Definition: raw_ostream.h:46