/usr/lib/llvm-6.0/include/polly/PolyhedralInfo.h is in libclang-common-6.0-dev 1:6.0-1ubuntu2.
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 | //===- polly/PolyhedralInfo.h - PolyhedralInfo class definition -*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
///
/// This file contains the declaration of the PolyhedralInfo class, which will
/// provide an interface to expose polyhedral analysis information of Polly.
///
/// This is work in progress. We will add more API's as and when deemed
/// required.
//===----------------------------------------------------------------------===///
#ifndef POLLY_POLYHEDRAL_INFO_H
#define POLLY_POLYHEDRAL_INFO_H
#include "llvm/Pass.h"
#include "isl/ctx.h"
#include "isl/union_map.h"
namespace llvm {
class Loop;
} // namespace llvm
namespace polly {
class Scop;
class ScopInfo;
class DependenceInfoWrapperPass;
class PolyhedralInfo : public llvm::FunctionPass {
public:
static char ID; // Pass identification, replacement for typeid
/// Construct a new PolyhedralInfo pass.
PolyhedralInfo() : FunctionPass(ID) {}
~PolyhedralInfo() {}
/// Check if a given loop is parallel.
///
/// @param L The loop.
///
/// @return Returns true, if loop is parallel false otherwise.
bool isParallel(llvm::Loop *L) const;
/// Return the SCoP containing the @p L loop.
///
/// @param L The loop.
///
/// @return Returns the SCoP containing the given loop.
/// Returns null if the loop is not contained in any SCoP.
const Scop *getScopContainingLoop(llvm::Loop *L) const;
/// Computes the partial schedule for the given @p L loop.
///
/// @param S The SCoP containing the given loop
/// @param L The loop.
///
/// @return Returns the partial schedule for the given loop
__isl_give isl_union_map *getScheduleForLoop(const Scop *S,
llvm::Loop *L) const;
/// Get the SCoP and dependence analysis information for @p F.
bool runOnFunction(llvm::Function &F) override;
/// Release the internal memory.
void releaseMemory() override {}
/// Print to @p OS if each dimension of a loop nest is parallel or not.
void print(llvm::raw_ostream &OS,
const llvm::Module *M = nullptr) const override;
/// Register all analyses and transformation required.
void getAnalysisUsage(llvm::AnalysisUsage &AU) const override;
private:
/// Check if a given loop is parallel or vectorizable.
///
/// @param L The loop.
/// @param MinDepDistPtr If not nullptr, the minimal dependence distance will
/// be returned at the address of that pointer
///
/// @return Returns true if loop is parallel or vectorizable, false
/// otherwise.
bool checkParallel(llvm::Loop *L,
__isl_give isl_pw_aff **MinDepDistPtr = nullptr) const;
ScopInfo *SI;
DependenceInfoWrapperPass *DI;
};
} // end namespace polly
namespace llvm {
class PassRegistry;
void initializePolyhedralInfoPass(llvm::PassRegistry &);
} // namespace llvm
#endif
|