Searched refs:IslAstInfo (Results 1 – 4 of 4) sorted by relevance
| /external/llvm-project/polly/lib/CodeGen/ |
| D | IslAst.cpp | 60 using IslAstUserPayload = IslAstInfo::IslAstUserPayload;
124 delete ((IslAstInfo::IslAstUserPayload *)Ptr); in freeIslAstUserPayload()
127 IslAstInfo::IslAstUserPayload::~IslAstUserPayload() { in ~IslAstUserPayload()
144 IslAstInfo::MemoryAccessSet *BrokenReductions; in getBrokenReductionsStr()
147 BrokenReductions = IslAstInfo::getBrokenReductions(Node); in getBrokenReductionsStr()
174 isl_pw_aff *DD = IslAstInfo::getMinimalDependenceDistance(Node); in cbPrintFor()
184 if (IslAstInfo::isInnermostParallel(Node)) in cbPrintFor()
187 if (IslAstInfo::isExecutedInParallel(Node)) in cbPrintFor()
189 else if (IslAstInfo::isOutermostParallel(Node)) in cbPrintFor()
482 if (IslAstInfo::isParallel(Node)) in walkAstForStatistics()
[all …]
|
| D | CodeGeneration.cpp | 86 static void verifyGeneratedFunction(Scop &S, Function &F, IslAstInfo &AI) { in verifyGeneratedFunction()
169 static bool CodeGen(Scop &S, IslAstInfo &AI, LoopInfo &LI, DominatorTree &DT, in CodeGen()
318 IslAstInfo *AI;
|
| D | IslNodeBuilder.cpp | 305 return IslAstInfo::getSchedule(For); in getScheduleForAstNode()
765 if (Vector && IslAstInfo::isInnermostParallel(For) && in createFor()
766 !IslAstInfo::isReductionParallel(For)) { in createFor()
774 if (IslAstInfo::isExecutedInParallel(For)) { in createFor()
779 (IslAstInfo::isParallel(For) && !IslAstInfo::isReductionParallel(For)); in createFor()
838 auto *Build = IslAstInfo::getBuild(Node); in createNewAccesses()
|
| /external/llvm-project/polly/include/polly/CodeGen/ |
| D | IslAst.h | 73 class IslAstInfo {
116 IslAstInfo(Scop &S, const Dependences &D) : S(S), Ast(IslAst::create(S, D)) {} in IslAstInfo() function
177 using Result = IslAstInfo;
179 IslAstInfo run(Scop &S, ScopAnalysisManager &SAM,
184 std::unique_ptr<IslAstInfo> Ast;
191 IslAstInfo &getAI() { return *Ast; } in getAI()
192 const IslAstInfo &getAI() const { return *Ast; } in getAI()
|