similar to: AA and external globals

I was trying to build the Linux kernel with clang and observed a crash due to incorrect loop optimization: drivers/base/firmware_class.c extern struct builtin_fw __start_builtin_fw[]; extern struct builtin_fw __end_builtin_fw[]; static bool fw_get_builtin_firmware(struct firmware *fw, const char *name) { struct builtin_fw *b_fw; for (b_fw = __start_builtin_fw; b_fw != __end_builtin_fw;

Hi, I just found -steens-aa and -ds-aa Alias Analysis listed in documents do not exist in my llvm-2.3 code. Both from opt -help and the lib/Analysis. And then I go to download the llvm-2.5 version, there is still no these 2 options. Where are they? Lei -- /****** * Lei Shang * PhD candidate, Computer Science & Engineering, * University of New South Wales, Sydney, Australia, 2052 *

On Wed, Sep 9, 2009 at 12:50 AM, Lei Shang<shang1982 at gmail.com> wrote: > Hi, > >    I just found -steens-aa and -ds-aa Alias Analysis listed in documents do > not exist in my llvm-2.3 code. Both from opt -help and the lib/Analysis. > And then I go to download the llvm-2.5 version, there is still no these 2 > options. Where are they?

On Wed, Sep 9, 2009 at 11:49 PM, Mai, Haohui <haohui.mai at gmail.com> wrote: > On 9/9/09 3:28 AM, Eli Friedman wrote: >> On Wed, Sep 9, 2009 at 12:50 AM, Lei Shang<shang1982 at gmail.com>  wrote: >> >>> Hi, >>> >>>     I just found -steens-aa and -ds-aa Alias Analysis listed in documents do >>> not exist in my llvm-2.3 code. Both from

On 4/13/12 1:02 PM, Douglas do Couto Teixeira wrote: > Hi, > > I was looking at the LLVM's alias analysis documentation > (http://llvm.org/docs/AliasAnalysis.html#exist) and it seems that > poolalloc has ds-aa and steens-aa. However, I followed the > instructions to use these passes, but I wasn't able to use them. Also, > I found this:

Hi, I was looking at the LLVM's alias analysis documentation (http://llvm.org/docs/AliasAnalysis.html#exist) and it seems that poolalloc has ds-aa and steens-aa. However, I followed the instructions to use these passes, but I wasn't able to use them. Also, I found this: http://old.nabble.com/DSA-or-rDSA---td32576486.html saying that they were removed from poolalloc. Is that true? If so,

On 9/9/09 3:28 AM, Eli Friedman wrote: > On Wed, Sep 9, 2009 at 12:50 AM, Lei Shang<shang1982 at gmail.com> wrote: > >> Hi, >> >> I just found -steens-aa and -ds-aa Alias Analysis listed in documents do >> not exist in my llvm-2.3 code. Both from opt -help and the lib/Analysis. >> And then I go to download the llvm-2.5 version, there is still no

Dear list, Please consider the following call of sort > sort(c("a","f")) [1] "a" "f" > sort(c("f","a")) [1] "a" "f" > > sort(c("aa","ff")) [1] "ff" "aa" > sort(c("ff","aa")) [1] "ff" "aa" The last two results look strange

Hello all, I am working with someone else's LLVM code, which is about 8 months old. Part of this pass involves AliasAnalysis, and I'm getting the above assertion when the pass completes. The dump is as follows: -------------------------------- Program received signal SIGABRT, Aborted. 0xf7fdf430 in __kernel_vsyscall () (gdb) bt #0 0xf7fdf430 in __kernel_vsyscall () #1 0xf602e921 in

This makes may day; it actually makes my week! I can't believe the genius wine developers have implemented subpixel font anti-aliasing in 1.1.12! All the apps look 100 times better now! I have opened Word 2003 about 10 times today just to look at the new beautiful UI! I have waited for this ever since I started using wine (~ 2006). This is my personal wine day! Thank so much, wine developers

Hi... I'm running Debian 5 (Lenny) and using wine packages from http://www.lamaresh.net/apt lenny main, which contains wine version 1.1.12. I've installed MS Office 2003 without problems, but when I start up word the fonts are choppy/blocky/what-have-you, but certainly not being AA. I came across a thread on this forum that suggested adding a file to the registry. I can do that on

On Wed, 2007-03-21 at 13:29 -0700, Wei Jiang wrote: > hi, > The llvm alias analysis doc mentioned that llvm have various alias > analysis passes, e.g. steens-aa; but I can't find it in llvm 2.0. Are > these passes obsoleted? Thanks. I think that Steensgaard was part of the data structure analysis which has been moved out of llvm. We currently have -basicaa, -globalsmodref-aa,

I'm not quite understanding how one would use the existing alias analysis framework to represent a flow-sensitive analysis. Let's say I have a load and a store and I want to determine whether the load loads from the same place the store stores to. Today we'd do something like this: AA.alias(load->getPointerOperand(), /* get the size */ store->getPointerOperand()), /*

On Aug 18, 2008, at 3:19 PM, David Greene wrote: > I'm not quite understanding how one would use the existing alias > analysis > framework to represent a flow-sensitive analysis. Yep, the current infrastructure isn't set up to support this. I haven't seen a real world case where flow sensitive AA is useful. Normally, the conversion to SSA form is sufficient. Can you

On Wednesday 20 August 2008 14:07, Vikram S. Adve wrote: > At Illinois, we are working on a parallelizing compiler but we're at > an extremely early stage. We too will need a dependence analysis > interface that can support fairly aggressive analysis, including > strong tests, direction vectors, perhaps distance vectors, and > dependence breaking conditions. We were going to

On Aug 22, 2008, at 9:53 AM, Dale Johannesen wrote: >> >> C has a way to express this: signed integers are defined to never >> overflow, > > More precisely, signed integer overflow is undefined behavior, which > gives the compiler great latitude. > Assuming this will never happen and doing optimizations on that basis > is valid, but so are other things. > An

On Aug 22, 2008, at 4:49 PM, John Regehr wrote: > Has anyone quantified the optimizations afforded by undefined signed > overflow? I'd expect that the benefits are minimal for most codes. In most cases, I agree. But for codes that depend heavily on dependence analysis, I would think that being conservative with index expressions would really kill any disambiguation capability and

> before and it hurts about 3-5 without high level loop > opts/vectorization on. With them on, they do roughly nothing in the > presence of -fwrapv because you can't determine bounds of any non > trivial loop. Very interesting, thanks! Before hearing this I'd have said that Java-style overflow is the right language design, but if this makes loop optimizations impossible

On Sun, Aug 24, 2008 at 6:28 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Sun, Aug 24, 2008 at 2:46 PM, Wojciech Matyjewicz > <wmatyjewicz at fastmail.fm> wrote: >>> I asked myself the same question. Without mod, how do you ensure that for instance the expression 2*i+255 was not actually 2*i-1 ? >> >> I think it is not possible in general, but I

>> One nit-pick, I see that some of the interfaces use tons of parameter, >> which is something I'd like reduce for ease of use. > >Right. It was my concern as well, but I eventually decided to write it >this way. Feel free to change it. > As we are speaking about modifying the lib, here are two things I would like to modify/add in it: - Replacing depedency