search for: propag

Hello, I wonder if llvm has pure range propagation pass. Is correlated value propagation that one? It seems that it is not directly deals with ranges. Maybe there any passes that simply contain some information about value ranges? Will symbolic value range propagation be done in some time? -------------- next part -------------- An HTML att...

Hi all, I am currently compiling R to RISC-V64 CPU and I think I have discovered a NA propagation failure. How R implements NA (not available) and NaN (not-a-number) is explained in detail here: https://stat.ethz.ch/pipermail/r-devel/2014-February/068380.html. In short, according to my understanding of R's convention, any calculation involving NA but no NaN should result in NA (calle...

Constant propagation pass generates constant expression when undef is used in float instructions instead of propagating the undef value. ; Function Attrs: nounwind define float @_Z1fv() #0 { entry: %add = fadd fast float undef, 2.000000e+00 ret float %add } Becomes: ; Function Attrs: nounwind define float @...

On 12/9/13 2:13 PM, Raoux, Thomas F wrote: > > Constant propagation pass generates constant expression when undef is > used in float instructions instead of propagating the undef value. > > ; Function Attrs: nounwind > > define float @_Z1fv() #0 { > > entry: > > %add = fadd fast float undef, 2.000000e+00 > > ret float %add...

Here we use a (custom-made, internal) password propagation system, hooked around 'check password script'. Recently we suffer a network outgage (another one ;-), and the system that take care of password propagation goes offline. + NT domains continue to work, clearly password not propagate + AD domain stop to work (eg, users password chan...

----- Original Message ----- > From: "Philip Reames" <listmail at philipreames.com> > To: llvmdev at cs.uiuc.edu > Sent: Tuesday, December 10, 2013 2:55:36 PM > Subject: Re: [LLVMdev] Float undef value propagation > > > > On 12/9/13 2:13 PM, Raoux, Thomas F wrote: > > > > > > Constant propagation pass generates constant expression when undef is > used in float instructions instead of propagating the undef value. > > > > ; Function Attrs: nounwind &...

Hello. I'm writing an LLVM pass that is working on LLVM IR. To my surprise the following LLVM pass code generates optimized code - it does copy propagation on it. Value *vecShuffleOnePtr = Builder.CreateGEP(ptr_B, vecShuffleOne, "VectorGep"); ... packed_gather_params.push_back(vecShuffleOnePtr); CallInst *callGather = Builder.CreateCall(func_llvm_masked_gather_v128i16,...

Hi, Thank you for all your helpful comments. To sum up, below is the list of correct folding examples for fadd: (1) fadd %x, -0.0 -> %x (2) fadd undef, undef -> undef (3) fadd %x, undef -> NaN (undef is a NaN which is propagated) Looking through the code I found the "NoNaNs" flag accessed through an instance of the FastMathFlags class. (2) and (3) should probably depend on it. If the flag is set, (2) and (3) cannot be folded as there are no NaNs and we are not guaranteed to get an arbitrary bit pattern fro...

Hi all, I am trying to see how single llvm optimizations work by running them one by one with opt and looking how the IR changes.Since I was interested in seeing how constant propagation was working I tried to run opt on the Sparse Conditional Constant Propagation, however by passing as argument -S -sccp -die it does not change anything in the output IR code. I attached the file with the source code I used, I think that the x value in that example should be propagated in the m...

...pen. Do you think the right solution would be to add such optimization? Is there any reason why we keep some arithmetic constant expressions while those could always be evaluated as far as I understand (unless it uses global pointers)? In this example there might be cases where we would be able to propagate undef which could generate better code. Thanks, Thomas From: llvmdev-bounces at cs.uiuc.edu<mailto:llvmdev-bounces at cs.uiuc.edu> [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Philip Reames Sent: Tuesday, December 10, 2013 12:56 PM To: llvmdev at cs.uiuc.edu<mailto:llvmdev at...

...R0 = R0 + R1 R10 = R2 * R10; R3 = R3 + R10; END_REPEAT; REDUCE R3; R0 = R5; // basically unnecessary reg. copy END_REPEAT; The above code has the deficiencies created basically by PHI elimination and not applying a proper register copy propagation on machine instructions before Register Allocation. I see 3 options to address my problem: - implement a case that handles this in PHI elimination (PHIElimination.cpp); - create a new pass that does copy propagation (based on DFA) on machine instructions before Register A...

...h> void f1(int a) { a=a+1; printf("%d",a); } void f2() { int b; b=1; f1(b); } int main() { int a=1; f2(); f1(a); } Also,when i use the following command: opt -print-after-all main.bc The dumps generated dont include IPCP or Intraprocedural Const Propagation dumps.Why so? Is there any other way to see the effect of a pass on the i/p bitcode file? Kindly let me know where i am going wrong. Netra, >> ---------------------------- Original Message ---------------------------- >> Subject: Regarding Inter Procedural Constant Propagation...

Hello, I've filled a bug to track the issue we've recently seen in our LLVM-based compiler: the Correlated Value Propagation Pass may become significantly slow on certain files. According to opt time profiles, value propagation alone is very fast (less than 1 second), -O3 with value propagation turned off is acceptable (31 secs), but with value propagation included it becomes too slow (197 secs). http://llvm.org/b...

> On Dec 30, 2016, at 3:03 PM, Alex Susu via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Hello. > I'm writing an LLVM pass that is working on LLVM IR. > To my surprise the following LLVM pass code generates optimized code - it does copy propagation on it. It does *constant* propagation to be exact. > Value *vecShuffleOnePtr = Builder.CreateGEP(ptr_B, vecShuffleOne, "VectorGep"); > ... > packed_gather_params.push_back(vecShuffleOnePtr); > CallInst *callGather = Builder.CreateCall(func_llvm_maske...

Hello, I wish to examine the influence of error in variables on my analyses via error propagation. I have a data frame (x) as follows: id response 1 -121 2 -131 3 -125 etc..... I wish to propagate errors for each row in the data frame, where error is distributed around the value of the response variable. To do this, I wish to simulate 1000 variables for each row in the above d...

Dear R-helpers, I´m in the context of writing a general function for error propagation in R. There are somehow a few questions I would like to ask (discuss), as my statistical knowledge is somewhat restricted. Below is the function I wrote, the questions are marked. Many thanks in advance. propagate <- function(expr, varList, type = c("stat", "raw"), cov...

...>> >> To sum up, below is the list of correct folding examples for fadd: >> (1) fadd %x, -0.0 -> %x >> (2) fadd undef, undef -> undef >> (3) fadd %x, undef -> NaN (undef is a NaN which >> is propagated) >> >> Looking through the code I found the "NoNaNs" flag accessed through >> an instance >> of the FastMathFlags class. >> (2) and (3) should probably depend on it. >> If the flag is set, (2) and (3) cannot be folded as there are no NaNs >>...

...the minimum value for h, and vice versa. Is there any way to do this automatically, without thinking about every single step? There is a thing called interval arithmetic (I saw it as an Octave package) which would do something like this. I would have thought that tracking how a (measuring) error propagates through a complex calculation would be a standard problem of statistics?? In other words, I am looking for a data type which is a number with a deviation +- somehow attached to it, with binary operators that automatically knows how to handle the deviation. Thank you, Jan

...sfers: SIP G.711 --> GSM IAX --> (wan) --> GSM IAX --> SIP G.711 - Sending custom parameters in URI: exten => 1,1,Setvar,VXML_URL=var1=value1 exten => 1,2,Dial,sip/192.168.0.1 I need to know if there is some possibilities for: 1) Automatic SIP header and/or uri-parameter propagation I need to propagate custom **headers** and/or **uri parameters** from source to destination. Does Asterisk propagate this additional info automatically? 2) Automatic SIP headers and/or uri-parameters propagation via IAX Yes, in wan communications I use 2 asterisk servers: SIP G.711 -->...

On using builtin functions we have to move the input to registers $0 and $1, if one of the input value is an immediate, we fail to propagate the immediate: ... mov u32 $r477 0x00000003 (0) ... mov u32 $r0 %r473 (0) mov u32 $r1 $r477 (0) call abs BUILTIN:0 (0) mov u32 %r495 $r1 (0) ... With this patch the immediate is propagated, potentially causing the first MOV to be superfluous, which we'd remove in that case: ... mov u32 $...