/usr/lib/llvm-3.4/include/polly/TempScopInfo.h is in libclang-common-3.4-dev 1:3.4.2-13.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 | //===-------- polly/TempScopInfo.h - Extract TempScops ----------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Collect information about the control flow regions detected by the Scop
// detection, such that this information can be translated info its polyhedral
// representation.
//
//===----------------------------------------------------------------------===//
#ifndef POLLY_TEMP_SCOP_EXTRACTION_H
#define POLLY_TEMP_SCOP_EXTRACTION_H
#include "polly/MayAliasSet.h"
#include "polly/ScopDetection.h"
#include "llvm/Analysis/RegionPass.h"
#include "llvm/IR/Instructions.h"
namespace llvm {
class DataLayout;
}
using namespace llvm;
namespace polly {
class MayAliasSetInfo;
//===---------------------------------------------------------------------===//
/// @brief A memory access described by a SCEV expression and the access type.
class IRAccess {
public:
const Value *BaseAddress;
const SCEV *Offset;
// The type of the scev affine function
enum TypeKind {
READ = 0x1,
WRITE = 0x2,
SCALAR = 0x4,
SCALARREAD = SCALAR | READ,
SCALARWRITE = SCALAR | WRITE
};
private:
unsigned ElemBytes;
TypeKind Type;
bool IsAffine;
public:
explicit IRAccess(TypeKind Type, const Value *BaseAddress, const SCEV *Offset,
unsigned elemBytes, bool Affine)
: BaseAddress(BaseAddress), Offset(Offset), ElemBytes(elemBytes),
Type(Type), IsAffine(Affine) {}
enum TypeKind getType() const { return Type; }
const Value *getBase() const { return BaseAddress; }
const SCEV *getOffset() const { return Offset; }
unsigned getElemSizeInBytes() const { return ElemBytes; }
bool isAffine() const { return IsAffine; }
bool isRead() const { return Type & READ; }
bool isWrite() const { return Type & WRITE; }
bool isScalar() const { return Type & SCALAR; }
void print(raw_ostream &OS) const;
};
class Comparison {
const SCEV *LHS;
const SCEV *RHS;
ICmpInst::Predicate Pred;
public:
Comparison(const SCEV *LHS, const SCEV *RHS, ICmpInst::Predicate Pred)
: LHS(LHS), RHS(RHS), Pred(Pred) {}
const SCEV *getLHS() const { return LHS; }
const SCEV *getRHS() const { return RHS; }
ICmpInst::Predicate getPred() const { return Pred; }
void print(raw_ostream &OS) const;
};
//===---------------------------------------------------------------------===//
/// Types
// The condition of a Basicblock, combine brcond with "And" operator.
typedef SmallVector<Comparison, 4> BBCond;
/// Maps from a loop to the affine function expressing its backedge taken count.
/// The backedge taken count already enough to express iteration domain as we
/// only allow loops with canonical induction variable.
/// A canonical induction variable is:
/// an integer recurrence that starts at 0 and increments by one each time
/// through the loop.
typedef std::map<const Loop *, const SCEV *> LoopBoundMapType;
/// Mapping BBs to its condition constrains
typedef std::map<const BasicBlock *, BBCond> BBCondMapType;
typedef std::vector<std::pair<IRAccess, Instruction *> > AccFuncSetType;
typedef std::map<const BasicBlock *, AccFuncSetType> AccFuncMapType;
//===---------------------------------------------------------------------===//
/// @brief Scop represent with llvm objects.
///
/// A helper class for remembering the parameter number and the max depth in
/// this Scop, and others context.
class TempScop {
// The Region.
Region &R;
// The max loop depth of this Scop
unsigned MaxLoopDepth;
// Remember the bounds of loops, to help us build iteration domain of BBs.
const LoopBoundMapType &LoopBounds;
const BBCondMapType &BBConds;
// Access function of bbs.
const AccFuncMapType &AccFuncMap;
// The alias information about this SCoP.
MayAliasSetInfo *MayASInfo;
friend class TempScopInfo;
explicit TempScop(Region &r, LoopBoundMapType &loopBounds,
BBCondMapType &BBCmps, AccFuncMapType &accFuncMap)
: R(r), MaxLoopDepth(0), LoopBounds(loopBounds), BBConds(BBCmps),
AccFuncMap(accFuncMap), MayASInfo(new MayAliasSetInfo()) {}
public:
~TempScop();
/// @brief Get the maximum Region contained by this Scop.
///
/// @return The maximum Region contained by this Scop.
Region &getMaxRegion() const { return R; }
/// @brief Get the maximum loop depth of Region R.
///
/// @return The maximum loop depth of Region R.
unsigned getMaxLoopDepth() const { return MaxLoopDepth; }
/// @brief Get the loop bounds of the given loop.
///
/// @param L The loop to get the bounds.
///
/// @return The bounds of the loop L in { Lower bound, Upper bound } form.
///
const SCEV *getLoopBound(const Loop *L) const {
LoopBoundMapType::const_iterator at = LoopBounds.find(L);
assert(at != LoopBounds.end() && "Bound for loop not available!");
return at->second;
}
/// @brief Get the condition from entry block of the Scop to a BasicBlock
///
/// @param BB The BasicBlock
///
/// @return The condition from entry block of the Scop to a BB
///
const BBCond *getBBCond(const BasicBlock *BB) const {
BBCondMapType::const_iterator at = BBConds.find(BB);
return at != BBConds.end() ? &(at->second) : 0;
}
/// @brief Get all access functions in a BasicBlock
///
/// @param BB The BasicBlock that containing the access functions.
///
/// @return All access functions in BB
///
const AccFuncSetType *getAccessFunctions(const BasicBlock *BB) const {
AccFuncMapType::const_iterator at = AccFuncMap.find(BB);
return at != AccFuncMap.end() ? &(at->second) : 0;
}
//@}
/// @brief Print the Temporary Scop information.
///
/// @param OS The output stream the access functions is printed to.
/// @param SE The ScalarEvolution that help printing Temporary Scop
/// information.
/// @param LI The LoopInfo that help printing the access functions.
void print(raw_ostream &OS, ScalarEvolution *SE, LoopInfo *LI) const;
/// @brief Print the access functions and loop bounds in this Scop.
///
/// @param OS The output stream the access functions is printed to.
/// @param SE The ScalarEvolution that help printing the access functions.
/// @param LI The LoopInfo that help printing the access functions.
void printDetail(raw_ostream &OS, ScalarEvolution *SE, LoopInfo *LI,
const Region *Reg, unsigned ind) const;
};
typedef std::map<const Region *, TempScop *> TempScopMapType;
//===----------------------------------------------------------------------===//
/// @brief The Function Pass to extract temporary information for Static control
/// part in llvm function.
///
class TempScopInfo : public FunctionPass {
//===-------------------------------------------------------------------===//
TempScopInfo(const TempScopInfo &) LLVM_DELETED_FUNCTION;
const TempScopInfo &operator=(const TempScopInfo &) LLVM_DELETED_FUNCTION;
// The ScalarEvolution to help building Scop.
ScalarEvolution *SE;
// LoopInfo for information about loops
LoopInfo *LI;
// The AliasAnalysis to build AliasSetTracker.
AliasAnalysis *AA;
// Valid Regions for Scop
ScopDetection *SD;
// For condition extraction support.
DominatorTree *DT;
PostDominatorTree *PDT;
// Target data for element size computing.
DataLayout *TD;
// Remember the bounds of loops, to help us build iteration domain of BBs.
LoopBoundMapType LoopBounds;
// And also Remember the constrains for BBs
BBCondMapType BBConds;
// Access function of statements (currently BasicBlocks) .
AccFuncMapType AccFuncMap;
// Pre-created zero for the scalar accesses, with it we do not need create a
// zero scev every time when we need it.
const SCEV *ZeroOffset;
// Mapping regions to the corresponding Scop in current function.
TempScopMapType TempScops;
// Clear the context.
void clear();
/// @brief Build condition constrains to BBs in a valid Scop.
///
/// @param BB The BasicBlock to build condition constrains
/// @param RegionEntry The entry block of the Smallest Region that containing
/// BB
void buildCondition(BasicBlock *BB, BasicBlock *RegionEntry);
// Build the affine function of the given condition
void buildAffineCondition(Value &V, bool inverted, Comparison **Comp) const;
// Return the temporary Scop information of Region R, where R must be a valid
// part of Scop
TempScop *getTempScop(Region &R);
// Build the temprory information of Region R, where R must be a valid part
// of Scop.
TempScop *buildTempScop(Region &R);
/// @brief Build an instance of IRAccess from the Load/Store instruction.
///
/// @param Inst The Load/Store instruction that access the memory
/// @param L The parent loop of the instruction
/// @param R The region on which we are going to build a TempScop
///
/// @return The IRAccess to describe the access function of the
/// instruction.
IRAccess buildIRAccess(Instruction *Inst, Loop *L, Region *R);
/// @brief Analyze and extract the cross-BB scalar dependences (or,
/// dataflow dependencies) of an instruction.
///
/// @param Inst The instruction to be analyzed
/// @param R The SCoP region
///
/// @return True if the Instruction is used in other BB and a scalar write
/// Access is required.
bool buildScalarDependences(Instruction *Inst, Region *R);
void buildAccessFunctions(Region &RefRegion, BasicBlock &BB);
void buildLoopBounds(TempScop &Scop);
public:
static char ID;
explicit TempScopInfo() : FunctionPass(ID) {}
~TempScopInfo();
/// @brief Get the temporay Scop information in LLVM IR represent
/// for Region R.
///
/// @return The Scop information in LLVM IR represent.
TempScop *getTempScop(const Region *R) const;
/// @name FunctionPass interface
//@{
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
virtual void releaseMemory() { clear(); }
virtual bool runOnFunction(Function &F);
virtual void print(raw_ostream &OS, const Module *) const;
//@}
};
} // end namespace polly
namespace llvm {
class PassRegistry;
void initializeTempScopInfoPass(llvm::PassRegistry &);
}
#endif
|