similar to: [GSoC'16] Weekly Status - June 27 - Zhengyang Liu

Dear Community, As I keep you update with my progress by writing weekly report, this report is covering the information about how we are processing. For those who are interested in these weekly reports, please check [1]. In general, the progress of this project is in working order. Before the midterm, I have done the following works: 1. Finish the SAFECode llvm 3.7 portation. Currently it

Hi, everyone This proposal covers the OpenProjects idea 'Port the Bigloo Scheme compiler, from Manuel Serrano at INRIA Sophia-Antipolis, to output LLVM bytecode.' There is not a popular functional language frontend yet on LLVM. To my knowledge, this is mostly because LLVM is lack of runtime support for the functional language needs, and C foreign function interface calls are relatively

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

Hi Adam, On Wed, Mar 23, 2016 at 1:50 PM, Adam Nemet via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > On Mar 22, 2016, at 5:13 PM, Philip Reames <listmail at philipreames.com> > wrote: > > > > On 03/20/2016 05:38 AM, Aries Gunawan via llvm-dev wrote: > > > *Loop Dependence Analysis Infrastructure. *I have looked in the source > codes repo and I

> On Mar 22, 2016, at 5:13 PM, Philip Reames <listmail at philipreames.com <mailto:listmail at philipreames.com>> wrote: > > > > On 03/20/2016 05:38 AM, Aries Gunawan via llvm-dev wrote: >> Hi everyone, >> >> I am very interested in contributing to LLVM project in this year’s GSoC. I am new with LLVM, but this is used in the compiler course in my

On 03/20/2016 05:38 AM, Aries Gunawan via llvm-dev wrote: > > Hi everyone, > > I am very interested in contributing to LLVM project in this year’s > GSoC. I am new with LLVM, but this is used in the compiler course in > my university. So, I am thinking to involve in LLVM development to > have a better knowledge of the system. Currently, I am preparing the > proposal.

First of all, I am really sorry about my time scheduling. I did not manage to upload my proposal at the last minutes before Google Summer of Code submission deadline. Could you kindly take the following revision as my final proposal? Abstraction --------------------- This projects will enhance the ‘Baggy Bounds with Accurate Checking’ (BBAC) [1] work. By adding information to the memory object’s

Hi everyone, I am very interested in contributing to LLVM project in this year's GSoC. I am new with LLVM, but this is used in the compiler course in my university. So, I am thinking to involve in LLVM development to have a better knowledge of the system. Currently, I am preparing the proposal. One of the project that caught my eyes is "New Transformations and Analysis". Several

On Thu, May 31, 2012 at 05:39:30PM +0200, Sander Eikelenboom wrote: > Hi Konrad, > > What is the status of the "devel/netback.liu.v5.on.3.5" branch in your tree ? Hm, lets wrap Ian and CC in this converstation. Were there any big outstanding TODOs before the network maintainer was OK with them? > It doesn''t seem to be destined for 3.5 mainline yet ? > >

> Message: 4 > Date: Sun, 27 Jun 2004 03:18:43 -0400 > From: Lei Liu <liulei at l.imap.itd.umich.edu> > Subject: [R] help in R calling C function > To: r-help at stat.math.ethz.ch > Message-ID: <5.1.0.14.1.20040627030746.014936b8 at l.imap.itd.umich.edu> > Content-Type: text/plain; charset="us-ascii"; format=flowed > > Hi there, > > I want

Dear Sanjoy Das and community. I was tried to fix a bug in the pass InitAllocas from SAFECode. This is a function pass and will insert a prototype of 'llvm.memset.p0i8.i32' in the module at doInitialize() stage of the pass. But, this prototype will be eliminated by strip unused function optimization since there is no call on this function after doInitialization(). Therefore there will be

Dear LLVM community. I have a function pass. This pass will insert a llvm intrinsic function prototype (llvm.memset.p0i8.i32) to the module at the doInitialize stage. Then at runOnFunction Stage, this pass will find the insert points and insert calls of this intrinsic function. However, when the -O2 flag is turned on, the strip unused function optimization will automatically delete this

Hi Zhengyang, Do you mind sharing _why_ you need the intrinsic declarations to stay around? It is possible that there is a better way of solving your problem. Thanks! -- Sanjoy

Ok, makes sense. My suggestion is that we patch the IR Verifier to ensure that the mask is indeed a vector of constants and/or undefs. Right now it only runs the standard checks for instructions. We will also run Alive2 on the test suite to make sure undef is never replaced in practice. Thanks, Nuno -----Original Message----- From: Eli Friedman <efriedma at quicinc.com> Sent: 27 de

Hi, This is a follow up on a discussion around shufflevector with undef mask in https://reviews.llvm.org/D70641 and https://bugs.llvm.org/show_bug.cgi?id=43958. The current semantics of shufflevector in http://llvm.org/docs/LangRef.html#shufflevector-instruction states: "If the shuffle mask is undef, the result vector is undef. If any element of the mask operand is undef, that element

Hello, How do I sample observations with replacement from a normal distribution with a specific mean and s.d? (I want to see the sample, not only the statistic.) Thank you, Sigalit. [[alternative HTML version deleted]]

On 11/27/19 2:10 AM, Eli Friedman via llvm-dev wrote: The shuffle mask of a shufflevector is special: it's required to be a constant in a specific form. From LangRef: "The shuffle mask operand is required to be a constant vector with either constant integer or undef values." So really, we can resolve this any way we want; "undef" in this context doesn't have to mean

Dear Josh, > If I understand correctly, if you find memory leak, you want to find the corresponding call(s) to malloc() that allocated the memory object, correct? Can you more completely explain what you are trying to accomplish? Thanks for your reply. In my task, I use data flow analysis to locate a program point where a malloc must be leaked (by must leaked, I mean (a) it must be

Dear LLVMers, I wrote a new proposal, to improve the static array bounds checking in SAFEcode, as follows: Improving static array bounds checking in SAFEcode ================================================== Objective --------- the main objective of this project is to improve the static array bounds checking engine used in SAFECode. It was written after the open project at

Hello all, This is a proposal for reducing # of ptrtoint/inttoptr casts which are not written by programmers but rather generated by LLVM passes. Currently the majority of ptrtoint/inttoptr casts are generated by LLVM; when compiling SPEC 2017 with LLVM r348082 (Dec 2 2018) with -O3, the output IR contains 22,771 inttoptr instructions. However, when compiling it with -O0, there are only 1048