similar to: [LLVMdev] Using an alias analysis pass

for example /// getPointerUnionTypeNum - If the argument has type PT1* or PT2* return /// false or true respectively. template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT1 *P) { return 0; } template <typename PT1, typename PT2> static inline int getPointerUnionTypeNum(PT2 *P) { return 1; } template <typename PT1, typename PT2> static

When compiling trunk using gcc 4.1.2 on linux/ppc64, I now see a warning that I don't remember seeing previously: llvm[2]: Compiling InlineSpiller.cpp for Release+Asserts build /src/llvm-trunk-dev/include/llvm/ADT/PointerIntPair.h: In member function ‘const PointerTy* llvm::PointerIntPair<PointerTy, IntBits, IntType, PtrTraits>::getAddrOfPointer() const [with PointerTy = void*, unsigned

Hey All, I was wondering if I could solicit a little advice. I have been experiencing some quirkiness in my C code through .Call. Unfortunately, my program is rather large, so I'm trying to create a brief example. Yet before I do, I thought maybe a conceptual question would be sufficient. Basically, I'm writing up a multidimensional Gaussian likelihood (with spatial covariances and

I have the following (simple!?) problem which I am unable to find a relatively trivial solution to. If I have a dataframe, A 1 A 7 B 4 B 5 C 3 D 3 D 2 E 5 F 5 F 6 I would like to create a new data.frame in the form ID pt1 pt2 A 1 7 B 4 5 C 3 NA D 3 2 E 5 NA F 5 6 so that for each identifier, in this

On 3/13/13 1:21 PM, Daniel Berlin wrote: > On Wed, Mar 13, 2013 at 11:37 AM, Arnold Schwaighofer > <aschwaighofer at apple.com> wrote: >> On Mar 13, 2013, at 1:07 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: >> >>>> The program I gave was well typed :) >>> Hi, Daniel: >>> Thank you for sharing your insight. I didn't realized

> The program I gave was well typed :) Hi, Daniel: Thank you for sharing your insight. I didn't realized it is well-typed -- I'm basically a big nut of any std. I'd admit std/spec is one of the most boring material on this planet:-). So, if I understand correct, your point is: if a std call a type-casting (could be one which is in bad-taste:-), TBAA has to

Dear R-experts, I have 28 data points that I would like to fit with a non linear broken-stick -- with three fitted parameters. When I view trace -- and use the final values as lines on the graph of data -- it looks pretty good. Q1. Why am I getting singular convergeance? Q2. Can you suggest another approach that may prove more satisfying? I have read previous examples on nls and this sort of

Hi I want to sum over one of the dimensions of a n x k1 x k2 array in which each column is the product of the corresponding columns from two matrices with dimensions n x k1 and n x k2. I can see two approaches: a loop on k1 and a loop on k2. But I cannot figure a solution that avoids the loop? Is it possible? (I don't refer to apply or lapply etc either as they are just hidden loops so,

Hi, I'm attempting to do some alias analysis & other memory inspection. I've written a pointless AliasAnalysis pass (that says everything must alias) to attempt to verify that my pass is getting picked up & run by opt. I run opt with: opt -load ~/Applications/llvm/lib/MustAA.so -must-aa -aa-eval -debug < trace0.ll I see my pass being initialized, but never being called (I see

On 08/12/2013 02:34 PM, Justin Holewinski wrote: > On Mon, Aug 12, 2013 at 8:24 AM, Michele Scandale <michele.scandale at gmail.com > <mailto:michele.scandale at gmail.com>> wrote: > > On 08/12/2013 02:02 PM, Justin Holewinski wrote: > > On Mon, Aug 12, 2013 at 6:03 AM, Michele Scandale > <michele.scandale at gmail.com <mailto:michele.scandale at

On Mon, Aug 12, 2013 at 8:24 AM, Michele Scandale < michele.scandale at gmail.com> wrote: > On 08/12/2013 02:02 PM, Justin Holewinski wrote: > > On Mon, Aug 12, 2013 at 6:03 AM, Michele Scandale < > michele.scandale at gmail.com > > <mailto:michele.scandale at gmail.com>> wrote: > > > > On 08/12/2013 12:44 AM, Michele Scandale wrote: > >

Hi, ? I am trying to solve a problem related to Poincare circles ( for more info http://www.ms.uky.edu/~droyster/courses/spring08/math6118/Classnotes/Chapter09.pdf). In a nutshell i am trying to replicate the method in the above pdf section 9.2.1. that explains in broad terms how to draw the arc inside a circle that goes through 2 previously set points on the first circle. ? I think i came up

Hi, I found that http://llvm.org/doxygen seems to be out-of-date. The footer shows that the files are regenerated everyday. I guess that the input repository for doxygen has not been updated for a while. For example, http://llvm.org/doxygen/namespacellvm.html#adeb6bbe8b1bed333ee7608e1939153c0 It says llvm::ParseBitcodeFile() has following prototype: Module *ParseBitcodeFile(MemoryBuffer

On Tue, Mar 12, 2013 at 11:59 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > I personally believe that in the context of type-based AA, correctness is a > subjective term:-). > > If the user smell something fishy, it is up to user to disable such opt, > there is no other > way around. TBAA is just to find the a sweet spot between precision & > safeness. Sorry,

On Wed, Mar 13, 2013 at 11:37 AM, Arnold Schwaighofer <aschwaighofer at apple.com> wrote: > > On Mar 13, 2013, at 1:07 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > >>> >>> The program I gave was well typed :) >> >> Hi, Daniel: >> Thank you for sharing your insight. I didn't realized it is well-typed -- I'm basically a big

Hi all, Sometimes llvm::UpgradeDebugInfo <http://llvm.org/docs/doxygen/html/namespacellvm.html#ad3c29183c5faa7f5a352807af8aca268> drops debug info which is pretty compatible with recent llvm version ( http://stackoverflow.com/questions/27023713/missing-debug-metadata-in-llvm-after-xcode-update ) and sometimes it drops something really outdated, but acceptable for me. In both cases I want to

i'm afraid this question is extremely basic, but i've assumed that dumping a .bc file from a module was a trivial operation, but now, first time i have to actually do it from code, for the life of me i can't find one missing step in the process: static void WriteModule ( const Module * M, BitstreamWriter & Stream )

On Aug 12, 2013, at 6:52 AM, Michele Scandale <michele.scandale at gmail.com> wrote: > On 08/12/2013 02:34 PM, Justin Holewinski wrote: >> On Mon, Aug 12, 2013 at 8:24 AM, Michele Scandale <michele.scandale at gmail.com >> <mailto:michele.scandale at gmail.com>> wrote: >> >> On 08/12/2013 02:02 PM, Justin Holewinski wrote: >>> On Mon, Aug

I personally believe that in the context of type-based AA, correctness is a subjective term:-). If the user smell something fishy, it is up to user to disable such opt, there is no other way around. TBAA is just to find the a sweet spot between precision & safeness. Unfortunately, in the context of TBAA, precision & safeness usually come at each other's expense... It would be

Hi Matthew, Did you add your alias analysis pass initializeEverythingMustAliasPass() into llvm::initializeAnalysis(PassRegistry &Registry) {} ? This will initialize it linked into the Analysis library. thanks, chen On Apr 28, 2014, at 8:43 PM, Jingyue Wu <jingyue at google.com> wrote: > > > > On Thu, Apr 24, 2014 at 4:38 PM, Matthew O'Connor <thegreendragon at