search for: demoteregtostack

...void %42(%swift.opaque* noalias nocapture nonnull sret %.reload33, %swift.refcounted* swiftself %1, %swift.error** nocapture nonnull swifterror %.reload25) LLVM ERROR: Broken function found, compilation aborted! I understand the cause of the error and disabled the demoteToStack() function(invokes DemoteRegToStack() and DemotePHIToStack()) at the very end of the bcf function pass. Doing so resolved the issuse, but I'm not certain of the functinality of thoses two demote functions and the consequence of not using them. I tried to search for information regarding reg2mem, but couldn't find any detailed...

I am trying to implement node splitting to transform irreducible CFGS to reducible ones. This means making copies of some basic blocks, which in turn means making copies of individual instructions. I can use the "clone" function to make an exact copy, but then I need to change some operands. For example, when I copy %1 = ... %2 = add %1, 5 I get %3 = ... %4 = add %1, 5

On 08/20/2012 03:46 PM, Duncan Sands wrote: > Hi Andrew, > >> Somewhere during optimization PHI nodes on pointer types (including >> alloca instructions) are being introduced, and they persist through the >> scalar replacement of aggregates pass and others. I can't seem to find >> a combination of passes or transformations to get rid of them. Has >> anyone

On Jul 22, 2011, at 11:52 PM, Cameron Zwarich wrote: > On Jul 22, 2011, at 11:44 PM, Jakob Stoklund Olesen wrote: > >> On Jul 22, 2011, at 10:29 PM, Bill Wendling wrote: >> >>> // Restrictions: >>> >>> There are several new invariants which will be enforced by the verifier: >>> >>> 1. A landing pad block is a basic block which is

I just accidently sent a partially complete email, so this contains the rest (sorry!) I'm working on translating llvm's optimized intermediate code to another compiler's intermediate code, and I'm working on the PHI instruction. Here's an example phi instruction to help explain what I'm trying to do: %inc25 = phi i32 [ 1, %entry ], [ %inc, %for.body ] What I would want to

On Jul 22, 2011, at 11:44 PM, Jakob Stoklund Olesen wrote: > On Jul 22, 2011, at 10:29 PM, Bill Wendling wrote: > >> // Restrictions: >> >> There are several new invariants which will be enforced by the verifier: >> >> 1. A landing pad block is a basic block which is the unwind destination of an >> invoke instruction. >> 2. A landing pad block

...; RelativePath="..\..\lib\Transforms\Utils\CloneTrace.cpp"> > </File> > <File > RelativePath="..\..\lib\Transforms\Utils\CodeExtractor.cpp"> > </File> > <File > RelativePath="..\..\lib\Transforms\Utils\DemoteRegToStack.cpp"> > </File> > <File > RelativePath="..\..\lib\Transforms\Utils\InlineFunction.cpp"> > </File> > <File > RelativePath="..\..\lib\Transforms\Utils\Local.cpp"> > </File> > <File &...

...Release+Asserts build llvm[2]: Compiling ConstantFolding.cpp for Release+Asserts build llvm[3]: Compiling MemorySanitizer.cpp for Release+Asserts build llvm[3]: Compiling FunctionLoweringInfo.cpp for Release+Asserts build llvm[3]: Compiling CtorUtils.cpp for Release+Asserts build llvm[3]: Compiling DemoteRegToStack.cpp for Release+Asserts build llvm[2]: Compiling CostModel.cpp for Release+Asserts build llvm[3]: Compiling FlattenCFG.cpp for Release+Asserts build llvm[2]: Compiling Delinearization.cpp for Release+Asserts build llvm[3]: Compiling SafeStack.cpp for Release+Asserts build llvm[3]: Compiling InstrEm...