similar to: [LLVMdev] GSOC2012 idea: Python bindings for LLVM

Am Freitag, 23. März 2012, 19:44:19 schrieb Baozeng: > Hello all, > I notice in previous gsocs of LLVM , there is no projects about language > bindings for LLVM. Does that mean it has lower priority than other > projects? Current python bindings for LLVM in the trunk are far from > complemte. So I would like to improve python bindings for LLVM this summer > if possible. My work

> Please look at the thread "Python bindings in tree" starting on 2012-03-16. > There are at least four Python binding projects currently running. (None of > them in GSoC) > > I think it's a great idea to improve llvm-py, but I'd also suggest to first > look at the other bindig projects. > > http://lists.cs.uiuc.edu/pipermail/llvmdev/2012-March/thread.html

Hell all, I am doing some research work on protecting Xen''s data structures. I know there is a direct-map area(about 12M), in which we can get the physical address of the data structure from its virtual address. My question is : are the stack and the heap of Xen both located in this direct-map area? Since I need protect stack and heap data, so it is easy to identify their physical

Hello all, I found that the alignment for stack value has no limitation, but for global value, it has a limitation. Here is an example: #include <stdio.h> #include <stdlib.h> char x[4000] __attribute__((aligned(4096))); int main (int argc, char ** argv) { char y[4000] __attribute__((aligned(4096))); printf("x is %p\n", x); printf("y is %p\n", y); return

Hello, I would like to work with Orange as part of GSoC 2012(and continue henceforth). Apologies for joining in a bit late- i was waiting to get a proper grasp of things before discussing it here. Currently I am a Masters students in Mathematics with my bachelors in Computer Science[integrated dual degree]. Over the last year and a half, I have worked on a few ML projects and have a couple of

With Debug mode, it shows the assert error: Assertion failed: (I != BlockLiveness.end() && "Predecessor not found"), function calculateLocalLiveness, file lib/CodeGen/StackColoring.cpp, line 782. 1. <eof> parser at end of file 2. Code generation 3. Running pass 'Function Pass Manager' on module 'busybox/archival/libarchive/decompress_bunzip2.c'. 4. Running

Hi Qingrui Liu, sorry for replying slowly. Here some comments: On 03/24/2012 02:47 PM, Tsingray Liu wrote: > Hi all, > My name is Qingrui Liu, a student at Sun Yat-sen University, China. > I have been working on high level synthesis project which is implemented > as a back-end of LLVM, in the last two years. When I want to use Polly to > generate parallel LLVM-IR from

Hello all, I have written a pass, which replaces condition branchinst using indirectBr to obfuscate program. The origin IR is as the following: br i1 %1, label %2, label %3 And the transformed IR is as the follwoing: %4 = select i1 %1, i8* blockaddress(@func, %2), i8* blockaddress(@func, %3) indirectbr i8* %4, [label %2, label %3] The pass's core function is as the

Hi Tobi, Thank you very much for the elaborate advises and sorry for the long delay. I have kept thinking your advises and investigate more detail of the existing code of Polly. Now, I re-evaluate my proposal and something interesting is added to the new one. ：） On Fri, Mar 30, 2012 at 5:52 AM, Tobias Grosser <tobias at grosser.es> wrote: > Hi Qingrui Liu, > > sorry for replying

Hi all, My name is Qingrui Liu, a student at Sun Yat-sen University, China. I have been working on high level synthesis project which is implemented as a back-end of LLVM, in the last two years.When I want to use Polly to generate parallel LLVM-IR from Polly-IR for me as input to my high level synthesis tools at the begining of this year, I found that Polly's back-end is not flexible and

On Aug 14, 2012, at 7:31 AM, Baozeng wrote: > Hello all, > I found that the alignment for stack value has no limitation, but for global value, it has a limitation. > > Here is an example: > > #include <stdio.h> > #include <stdlib.h> > > char x[4000] __attribute__((aligned(4096))); > > int > main (int argc, char ** argv) { > char y[4000]

Hi, My name is Vivek Pal. I had submitted a proposal on weighing schemes project for GSoC. I'm so glad and excited to be selected for working on this project! I'd like to thank mentors for reviewing & selecting my project proposa,l and letting me be a part of Xapian -- open source community. I'll make sure to keep up with all the expectations and try my best to produce good

On 8/14/12 12:19 PM, John McCall wrote: > On Aug 14, 2012, at 7:31 AM, Baozeng wrote: >> Hello all, >> I found that the alignment for stack value has no limitation, but for global value, it has a limitation. Baozen, with what version of LLVM did you do the following test? Was it LLVM mainline? >> >> Here is an example: >> >> #include <stdio.h>

Dear LLVM developers: Here is my another proposal of LLVM. Any suggestion would be welcome! * ** * *** Integrate Baggy Bounds Checking into SAFECode*** * * *Abstract:** * Baggy Bounds Checking (BBC) is an efficient bounds checking technique that pad and align objects to powers of two and enable allocation bounds. It uses a contiguous array as bounds table to enable

Abstraction ---------------------------------- This projects will enhance the ‘Baggy Bounds with Accurate Checking’ [1] work. I will provide more efficient runtime checks in BBAC framework by adding more informations to the memory object’s padding area. A new padding area scheme will be designed to make these informations compact and efficient to fetch. I will create some new runtime checks on

Hello all, Here is my GSoC 2012 proposal: Python bindings for LLVM. Any feedback are welcome! *Title: Python bindings for LLVM* *Abstract: * llvm-py provides Python bindings for LLVM. The latest llvm-py supports bindings with Python 2.x version for LLVM 2.x. This project is to improve llvm-py to make it compatible with both Python 2.x and Python 3 for LLVM 3. *Motivation* LLVM is used as a

Hi all, Some days ago I attempted to submitt Syslinux as a mentoring organization for Google Summer of Code 2012, but Google rejected it. As kernel.org has been accepted as a mentoring organization, and also listed Syslinux as one of the things they intend to develop, we can work with them under their umbrella. As I'm currently the only mentor of kernel.org (for Syslinux, specifically),

Hi - any person interested in building a binding between Smalltalk and R, please contact myself or Hernan. This could be done as the Google Summer of Code (GSoC). http://www.google-melange.com/gsoc/homepage/google/gsoc2012 http://gsoc2012.esug.org/projects/r-statistics For those who don't know Smalltalk it is an Object Oriented language that was created back in the '80s in the Xerox

The deadline for student applications is 19:00 UTC on Friday 6th April: http://www.google-melange.com/gsoc/events/google/gsoc2012 That's just over 36 hours away as I write this. The deadline is sharply enforced by the melange software, and you won't get an extension, so don't leave it until the last few seconds, as you might have an unexpected internet outage. There's also no

Hi. I've seen that there are a few python bindings for the libraries. I am planning to write a relationed python module and before doing things wrong I wanted to know if this list can be used to talk about those bindings, if the authors of those bindings are on this list, or if I should join a python mailing list or something like that. IOW, I wouldn't like to write something to discover