Erik Eckstein 2a17d9a480 ArrayBoundCheckOpts: introduce a limit for the maximum dominator tree recursion depth ...

This is a quick fix for a stack overflow in case of very large functions.
TODO: Ideally this algorithm would be implemented as an iterative worklist algorithm.

rdar://77563057

2021-05-07 18:13:08 +02:00

..

ArrayBoundsCheckOpts.cpp

ArrayBoundCheckOpts: introduce a limit for the maximum dominator tree recursion depth

2021-05-07 18:13:08 +02:00

ArrayOpt.h

Update a comment about StructAddressUsers

2021-01-11 16:05:35 -08:00

ArrayPropertyOpt.cpp

Verify critical edges when -sil-verify-all is enabled

2021-03-03 23:45:56 -08:00

CMakeLists.txt

SIL: use object libraries instead of globbing

2020-05-18 18:56:34 +00:00

COWArrayOpt.cpp

[cowarrayopt] Instead of always recomputing the loop we are analyzings exiting blocks when checking for dominance, use a cache.

2021-02-24 11:13:52 -08:00

ForEachLoopUnroll.cpp

SILOptimizer: use the BasicBlockFlag utility in ValueLifetimeAnalysis

2021-01-21 21:31:41 +01:00

LICM.cpp

OSSA: Rewrite address cloning code to fix issues.

2021-02-24 22:18:21 -08:00

LoopRotate.cpp

[loop-rotate] In OSSA, instead of creating address phis, sneak the address through the phi using a RawPointer.

2021-02-12 23:20:17 -08:00

LoopUnroll.cpp

Support ownershipKind in SILSSAUpdater

2021-01-21 16:27:50 -08:00