Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
|
| bool | llvm::UnrollLoop (Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime, bool AllowExpensiveTripCount, unsigned TripMultiple, LoopInfo *LI, Pass *PP, LPPassManager *LPM, AssumptionCache *AC) |
| | Unroll the given loop by Count. More...
|
| |
| bool | llvm::UnrollRuntimeLoopProlog (Loop *L, unsigned Count, bool AllowExpensiveTripCount, LoopInfo *LI, LPPassManager *LPM) |
| | Insert code in the prolog code when unrolling a loop with a run-time trip-count. More...
|
| |
| MDNode * | llvm::GetUnrollMetadata (MDNode *LoopID, StringRef Name) |
| | Given an llvm.loop loop id metadata node, returns the loop hint metadata node with the given name (for example, "llvm.loop.unroll.count"). More...
|
| |