similar to: [LLVMdev] My top 5 LLVM wishes

On Wed, Jan 28, 2015 at 6:28 PM, Robin Eklind <carl.eklind at myport.ac.uk> wrote: > Hello Sean, > > Thank you for your reply. I'll give your suggestion to item 6 and 7 a try > tonight. I'll start a compilation and let it run throughout the night. My > laptop (x61s) is 8 years old by know, so compiling LLVM takes a little time > :) > This is why I did so much

This is an issue I raised a while ago, but I wanted to know if the situation had improved at all recently. The issue is determining the number of elements in an array that has appending linkage. The obvious course would be to use a constant GEP. Suppose we have N modules, each containing a global variable with appending linkage whose initializer is an array of size M containing elements of type

Hey all, it's been a while since I have posted on llvm-dev, but that's mainly because I have been making good progress with my LLVM project. :) In any case, I'd like some advice on implementing my own version of appending linkage as a linker plugin. As I have pointed out on this list before, the existing appending linkage type isn't useful for me for two reasons: 1) There's

Hello Sean, Thank you for your reply. I'll give your suggestion to item 6 and 7 a try tonight. I'll start a compilation and let it run throughout the night. My laptop (x61s) is 8 years old by know, so compiling LLVM takes a little time :) Regarding item 8. I don't know if anyone is using "": in the wild so fixing the implementation might make sense. If not the

On Mon, Feb 2, 2015 at 9:51 AM, Robin Eklind <carl.eklind at myport.ac.uk> wrote: > (forgot to cc the list) > > Answers, questions and assumptions are inlined in the response. > > If someone with knowledge of the LLVM IR type system could take a look at > my assumptions below I'd be very happy. > > On 01/30/2015 02:24 AM, Sean Silva wrote: > >> On Thu,

My apologies for opening up an old thread, but I've been thinking about this quite a bit lately, and it seems to me that "appending linkage" would be a lot more useful in general if there was some way to determine the size of the appended array without having to write a custom pass to do it. In other words, using the standard llvm tools (llvm-link and friends), one ought to be

So, I was in the process of writing a custom LLVM pass (my first one, yay!) to handle the problem of measuring the length of an appending linkage array. The approach I was taking was pretty simple: Iterate through all of the module's global variables until I find one that is trying to calculate the end of an appending-linkage array, which looks like this: @_moduleListEnd = constant [1 x

Hello everyone! I've recently had a chance to familiarize myself with the nitty-gritty details of LLVM IR. It has been a great learning experience, sometimes frustrating or confusing but mostly rewarding. There are a few cases I've come across which seems odd to me. I've tried to cross reference with the language specification and the source code to the best of my abilities, but

Hi, I am trying to run an LLVM analysis on a C++ program that calls qsort(), using the LLVM interpreter (lli --force-interpreter). The code is the qsort_large.c file in the MiBench benchmark suite. If I comment the qsort() call, the execution works fine. If I uncomment the qsort() call, I run into a segmentation fault error as follows: 0  lli             0x0000000000d35c6f 1  lli        

Hi, I am trying to run an LLVM analysis on a C++ program that calls qsort(), using the LLVM interpreter (lli --force-interpreter). The code is the qsort_large.c file in the MiBench benchmark suite. If I comment the qsort() call, the execution works fine. If I uncomment the qsort() call, I run into a segmentation fault error as follows: 0 lli 0x0000000000d35c6f 1 lli

Hi,all I tried to run the generated whole-program bitcode of BIND,but I got some information: 0 lli 0x0000000000feda16 1 lli 0x0000000000fed88f 2 libpthread.so.0 0x0000003df340eee0 3 libc.so.6 0x0000003df28332f5 gsignal + 53 4 libc.so.6 0x0000003df2834b20 abort + 384 5 libc.so.6 0x0000003df282c2fa __assert_fail + 234 6 lli

I'm having trouble getting the quota plugin to work with deliver. The quota in the database is not getting set. I am using dovecot-1.0-rc15. This server is not yet in production. Some values below are because I'm trying to test with the simplest possible case, and some because it's reading from a different database. Also, I noticed that "dovecot -n" doesn't display any

Hi, On Sat, Oct 31, 2009 at 11:42 AM, Nan Zhu <zhunansjtu at gmail.com> wrote: > Hi,all > > I tried to run the generated whole-program bitcode of BIND,but I got some > information: > > 0   lli             0x0000000000feda16 > 1   lli             0x0000000000fed88f > 2   libpthread.so.0 0x0000003df340eee0 > 3   libc.so.6       0x0000003df28332f5 gsignal + 53 >

Mahadevan R wrote: > Hi, > > On Sat, Oct 31, 2009 at 11:42 AM, Nan Zhu <zhunansjtu at gmail.com> wrote: >> Hi,all >> >> I tried to run the generated whole-program bitcode of BIND,but I got some >> information: >> >> 0 lli 0x0000000000feda16 >> 1 lli 0x0000000000fed88f >> 2 libpthread.so.0

On Thu, 25 Apr 2024 14:45:04 +0200 Jeroen Ooms <jeroenooms at gmail.com> wrote: > Thoughts? How verboten would it be to create an empty external pointer object, add it to the preserved list, and set an on-exit finalizer to clean up the curl multi-handle? As far as I can tell, the internet module is not supposed to be unloaded, so this would not introduce an opportunity to jump to an

Hi, I've got the cfe debug info to the point where it outputs correct function info, stoppoints for statements (but not for declarations anymore) and region ends at the beginning of the return block. So this is about as far as I wanted to go with it. However, there's one last big problem that I need some advice on. Running : gcc -g -S -o foo.ll llvmas foo.ll produces bytecode that works

I've been digging into some undefined behaviour stemming from how ilist is typically configured. r247937, r247944, and r247978 caused a UBSan failure to start firing on our Green Dragon bots, and after an IRC conversation between David and Nick and Mehdi, we added a blacklist: -- $echo "src:$WORKSPACE/llvm/include/llvm/CodeGen/MachineFunction.h" >> sanitize.blacklist --

Hello, I am currently doing my project and I need some help. I am trying to schedule tutors for a study room where students come in and out for helps. My goal is to schedule the tutors to maximally accomodate to the flow of students that need help with math so that each tutor is given an appropriate(also consecutive) hours of schedule. I am using monte carlo simulation for this, however I have

Hi Andy, > I am currently using llvm to compile memcache to get the bitcode. I simply > change all the "gcc -c" command to "clang -emit-llvm -c", and output ".o" to > ".bc". And all gcc link command to llvm-ld. By these means, I successfully get > the bitcode file, but when I run it using "lli", it fails with the error: > >

Dear Ciao, Duncan, Thank you for replying. I tried and the error goes away. But there comes a new error: LLVM ERROR: Unknown object format! How can I solve this problem? Thank you! BestAndy --- 12年9月18日，周二, Duncan Sands <baldrick at free.fr> 写道： 发件人: Duncan Sands <baldrick at free.fr> 主题: Re: [LLVMdev] Problems on getting UNREACHABLE executed 收件人: llvmdev at cs.uiuc.edu 日期: