Displaying 20 results from an estimated 400 matches similar to: "[LLVMdev] How to require ScalarEvolution analysis in a Module pass?"
2012 Aug 31
0
[LLVMdev] Function inline pass core dump when removing a function
Guys,
In this case, I wanted to hack globalopt pass to require ScalarEvolution
analysis. It seems ScalarEvolution is not released after globalopt pass,
and it will hold a reference to the basicblocks. Later when the function is
removed(by inline pass), coredump happened:
opt test.bc -mem2reg -globalopt -inline -loop-unroll -debug-pass Details -o
out.bc >& log
So it seems to me if a pass
2011 May 16
0
[LLVMdev] Fail when building llvm2.9 using MinGW64
Chen, see http://llvm.org/docs/GettingStarted.html#pf_12
...Takumi
ps. Excuse me, PE+ (aka pep) means "Executable file format for WIndows x64".
2011/5/16 陈晓宇 <xychen0921 at gmail.com>:
> The stack trace:
>
> Starting program:
> C:\MinGW\msys\1.0\home\xchen\llvm-obj\lib\Target\CellSPU/../..
> /../Debug/bin/tblgen.exe -I
2017 Jun 24
1
musttail & alwaysinline interaction
Consider this program:
@globalSideEffect = global i32 0
define void @tobeinlined() #0 {
entry:
store i32 3, i32* @globalSideEffect, align 4
musttail call fastcc void @tailcallee(i32 3)
ret void
}
define fastcc void @tailcallee(i32 %i) {
entry:
call void @tobeinlined()
ret void
}
attributes #0 = { alwaysinline }
Clearly, if this is processed with opt -alwaysinline, it will lead
2015 Dec 16
1
Re: [PATCH 0/2] resize: Split out the command line parsing into Cmdline
Hi Rich,
Does that means that all the functions provided by virt-resize will be migrated to virt-builder?
Does the command virt-resize will totally be abandoned?
We may need to modify all the virt-resize test cases if so.
--
Thanks & Best regards,
Chen Xiang Hua
Raycom office Beijing (NAY), Red Hat Inc.
Red Hat Telephony: 86 10 62608040
internal extension: 8388040
Team: Virt QE
IRC:
2017 Aug 03
0
Re: [PATCH 0/2] Add lightweight bindings for PCRE.
Hi Rjones,
So, will we add dependency of ocaml-pcre in RHEL7.5 ?
Just like the new bug you filed to add dependency of ocaml-camlp4 & ocaml-labltk ?
--
Thanks & Best regards,
Chen Xiang Hua
Raycom office Beijing (NAY), Red Hat Inc.
Red Hat Telephony: 86 10 62608040
internal extension: 8388040
Team: Virt QE
IRC: xchen@#S1, #virt
----- Original Message -----
> From: "Richard W.M.
2011 May 13
4
[LLVMdev] Fail when building llvm2.9 using MinGW64
I was building llvm2.9 using MinGW64 on windows, msys was 32 bit so I
specified --host option for a cross compiling. Following are my configure
options:
../llvm2.9/configure --prefix=/home/AutoESL/llvm-obj
--host=x86_64-w64-mingw32
--disable-multilib
The error:
make[1]: Entering directory `/home/AutoESL/llvm-obj/lib/VMCore'
make[1]: ***
2008 Feb 22
2
[LLVMdev] ScalarEvolution Patch
Dear All,
Is the following patch to ScalarEvolution correct? It seems that
without it, the enclosing for loop could skip over SCEVAddRecExpr's in
the Ops[] array.
-- John T.
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: scpatch
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080222/3ff8edd7/attachment.ksh>
2008 Nov 12
1
[LLVMdev] Possible bug in ScalarEvolution
Hi,
I'm using pass ScalarEvolution to analyze the loop trip count on my
application.
And I found a possible bug in the code, that is in function
SCEVAddRecExpr::getNumIterationsInRange(),
Line 2905:
2904 // The exit value should be (End+A)/A.
2905 APInt ExitVal = (End + A).udiv(A);
2906 ConstantInt *ExitValue = ConstantInt::get(ExitVal);
The divide should be sdiv, right?
2010 Nov 17
2
[LLVMdev] Replacing phi nodes in ScalarEvolution while preserving LCSSA form
Hi Dan, I whipped up this patch as a more optimal test of whether
replacing the phi node PN by V will break LCSSA form. I hope it
is more or less correct, but since I know nothing about loops it
could well be completely bogus :) Can you please comment on it.
Best wishes,
Duncan.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: lcssa.diff
Type: text/x-patch
2010 Nov 17
0
[LLVMdev] Replacing phi nodes in ScalarEvolution while preserving LCSSA form
On Nov 17, 2010, at 11:03 AM, Duncan Sands wrote:
> Hi Dan, I whipped up this patch as a more optimal test of whether
> replacing the phi node PN by V will break LCSSA form. I hope it
> is more or less correct, but since I know nothing about loops it
> could well be completely bogus :) Can you please comment on it.
Looks good to me.
Thanks,
Dan
2010 Nov 18
1
[LLVMdev] Replacing phi nodes in ScalarEvolution while preserving LCSSA form
It doesn't seem to fix PR8622.
On Nov 17, 2010, at 8:39 PM, Dan Gohman wrote:
> On Nov 17, 2010, at 11:03 AM, Duncan Sands wrote:
>
>> Hi Dan, I whipped up this patch as a more optimal test of whether
>> replacing the phi node PN by V will break LCSSA form. I hope it
>> is more or less correct, but since I know nothing about loops it
>> could well be
2011 May 01
0
[LLVMdev] ScalarEvolution::getSVECAtScope
Hi,
Is it valid to query ScalarEvolution::getSCEVAtScope with a Value
which is an Instruction inside the provided Loop? If so, I believe
there is a bug in computeSCEVAtScope. Specifically:
04716 // If the scope is outside the addrec's loop, evaluate it by using the
04717 // loop exit value of the addrec.
04718 if (!AddRec->getLoop()->contains(L)) {
04719 // To
2011 May 01
0
[LLVMdev] ScalarEvolution::getSVECAtScope
Nevermind. I misread the documentation.
On Sat, Apr 30, 2011 at 8:12 PM, Thomas Jablin <tjablin at gmail.com> wrote:
> Hi,
>
> Is it valid to query ScalarEvolution::getSCEVAtScope with a Value
> which is an Instruction inside the provided Loop? If so, I believe
> there is a bug in computeSCEVAtScope. Specifically:
>
> 04716 // If the scope is outside the
2013 Oct 31
0
[LLVMdev] Get Different Result for ScalarEvolution through ModulePass and FunctionPass
Hi there,
I write two pass, a module pass, named "MP", and a FunctionPass, "FP".
Then I use this pass to print the scalar evolution information in two ways:
1.employ FP to process function directly
2.call MP, iterate on functions, then call FP on them
sample code is that:
*MP:*
*bool runOnModule(Module &M)*
*{*
*for(Module::iterator itr = M.begin(); itr != M.end();
2012 Dec 21
0
[LLVMdev] [PATCH] Teaching ScalarEvolution to handle IV=add(zext(trunc(IV)), Step)
On Thu, Dec 20, 2012 at 8:36 AM, Matthew Curtis <mcurtis at codeaurora.org> wrote:
> Ok, so I think I've mis-represented what's really happening.
> Ignore my previous statements concerning %add :)
>
> Again, given:
>
> 05: for.body: ; preds = %entry,
> %for.body
> 06: %j.04 = phi i32 [ 0, %entry ], [ %inc, %for.body
2017 Jul 24
2
LazyValueInfo vs ScalarEvolution
On Mon, Jul 24, 2017 at 2:29 PM, John Regehr via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> On 7/24/17 3:16 PM, Hongbin Zheng via llvm-dev wrote:
>
>> Thanks, maybe we could use ScalarEvolution in LazyValueInfo if it is
>> available?
>>
>
> This should be fairly easy to try, if you want to propose a patch and run
> some experiments. The question is
2012 Dec 18
0
[LLVMdev] [PATCH] Teaching ScalarEvolution to handle IV=add(zext(trunc(IV)), Step)
On Tue, Dec 18, 2012 at 9:56 AM, Matthew Curtis <mcurtis at codeaurora.org> wrote:
>
> Here's how I'm evaluating the expression (in my head):
>
> 00: Add(ZeroExtend(Truncate(Minus(AddRec(Start=0,Step=3)[n],3), i8), i32),3)
> |
> 01: Add(ZeroExtend(Truncate(Minus(AddRec(Start=0,Step=3)[0],3), i8), i32),3)
>
2017 Jul 24
2
LazyValueInfo vs ScalarEvolution
Thanks, maybe we could use ScalarEvolution in LazyValueInfo if it is
available?
On Mon, Jul 24, 2017 at 1:44 PM, John Regehr via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> Since they are different static analyses there's no reason to expect them
> to agree, but they should both be conservative. In other words, if you like
> you can compute the intersection of the two
2018 May 10
0
ScalarEvolution questions
Hi Ashutosh,
On Wed, May 9, 2018 at 3:28 AM, Nema, Ashutosh via llvm-dev
<llvm-dev at lists.llvm.org> wrote:
> I’m new to ScalarEvolution and wanted to explore its capabilities.
>
> I have following few questions:
>
> 1) How to compare SCEV expressions.
>
> I have a situation to compare two SCEV to find the min among them.
>
> Found an existing
2013 Oct 02
1
[LLVMdev] ScalarEvolution::createNodeForPHI
----- Original Message -----
>
> On Oct 1, 2013, at 6:45 AM, Michele Scandale
> <michele.scandale at gmail.com> wrote:
>
> > Hello to everybody,
> >
> > I'm working on some improvements on trip count computation with
> > ScalarEvolution
> > analysis.
> > Considering the following test
> >
> >