similar to: [LLVMdev] How can I obtain upper bound of a pointer?

This is rather off-topic for LLVM, it's a C programming question and the C answer is: you can't. C doesn't expose any way to find the upper limit of 'Ptr' you just have to keep track of what size you used yourself. On Sun, Dec 15, 2013 at 6:22 PM, 李永超 <lyc364 at gmail.com> wrote: > Hi, > How can I obtain the upper bound of a pointer in the code? For example, I

Hi, getMetadata(“dbg”) returns NULL for such a small program as follows: int main(){ char a[10], b[2]; if(a[0] != 0 && a[1] != 0){ strcpy(a, b); } return 0; } The compiling command is: llvm-gcc --emit-llvm -g -c ./src.c I also tried the solutions I found through Google: http://stackoverflow.com/questions/14943447/llvm-line-number-of-an-instruction

Sir, I am a M.tech student of Computer Science and Engineering Department ,Indian Institute of technology, Kharagpur(India). I have to do a project in trusted computing field. I went through LLVM Project site. and I want to work in some project of LLVM. Can u suggest me some project which is somehow related to trusted computing and i can work on that ? In hope of your reply, Amit Suthar

Hi, llvm-gcc is deprecated. It would be wise to avoid using it unless you have to! You don't say what form you want the control flow graphs in. AFAIK you can think of LLVM bitcode modules (emitted by using -emit-llvm flag) as a collection of global variables and functions. Each function is essentially a control flow graph. You can quickly take a look at a CFG by doing something like...

Dear LLVMers, My name is Raphael Ernani, and I am doing my MsC at the Federal University of Minas Gerais, Brazil. I have been using LLVM for a while, and I would like to participate in this year's Summer of Code. One particular idea, in your "open projects" page caught my eye, and I decided to write a proposal about it. The line that I liked in the page was "Create an LLVM

On 3/30/12 1:08 PM, Raphael Ernani Rodrigues wrote: > Dear LLVMers, > > My name is Raphael Ernani, and I am doing my MsC at the Federal > University of Minas Gerais, Brazil. I have been using LLVM for a > while, and I would like to participate in this year's Summer of Code. > One particular idea, in your "open projects" page caught my eye, and I > decided to

Hello All, I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. I could come up with the following that are not provided in ASAN/MSAN/Clang S.A -> dangling pointer error and detection -> crashes in system libraries due to security vulnerabilities. In the process, I wanted to run the

On 2/26/15 9:54 AM, Jyoti Rajendra Allur wrote: > Hello All, > I am looking at exploring what benefits SAFECode has to offer over clang S.A and llvm's instrumentation tools like memory sanitizer and address sanitizer. Are you looking for an off-the-shelf tool, or are you looking for approaches to use in your own tool? > I could come up with the following that are not provided in

Hi, I tried to build dragonegg 2.9 but encountered following error at the very beginning of the building process: qingjinlyc at qingjinlyc:~/IDEs/dragonegg-2.9$ GCC=../build-gcc/bin/gcc-4.5 makeCompiling utils/TargetInfo.cpp g++: error: directory": No such file or directory make: *** [TargetInfo.o] Error 1 qingjinlyc at qingjinlyc:~/IDEs/dragonegg-2.9$ Does anyone have any idea about this?

Hello, As far as I know, there is no MPX pass in LLVM (though the x86-64 backend already declares MPX registers and instructions). I wonder if anyone is currently working on the LLVM pass for MPX instrumentation, similar to Pointer Checker in gcc. If yes, could anyone elaborate on the status and accessability to other researchers? And if any help is needed? Prof. Santosh Nagarakatte, the author

Dear List, I tested the example in the reposTools vignette: library(reposTools); Loading required package: tools genRepos("Test Repository", "http://biowww.dfci.harvard.edu/~jgentry/","newRepos"); Error in rep.int(colnames(x), nr) : unimplemented type 'NULL' in 'rep' Could someone help me out with this one? I'd appreciate all help.... I am

Anyone using or has access to ParallelR? I was looking at the page and found nothing really useful! http://www.revolution-computing.com/sitegenius/topic.php?id=195 I want to see if I can run R on a cluster of workstation, and use batch systems like Grid Engine or Xgrid: http://gridengine.sunsource.net/ http://ww.apple.com/acg/xgrid/ --Chi

At 11:40 AM 11/14/2001 -0500, sublime@mac.com wrote: >the ACG function that the compressor provides is limited at best. its >adjustment is way too audible to make full use of it in balancing levels. >yes, it is last in the chain. i'm just wondering if there's anything out >there in the way of software. if a minidisc recorder can do it, why can't a >$1000 pc? tons of

Hi John, On 25 May 2016 at 16:11, John Criswell <jtcriswel at gmail.com> wrote: > Dear Pierre, > > Stepping up a level, what is your goal in replacing calls to malloc() and > free()? Is it any different than what SAFECode, SoftBound, or ASan do? > That's a good question. I didn't knew about SoftBound until now, so thank you for the name =). Anyway here is what I

The Secure Coding group at CERT has current job openings for knowledgeable Clang and/or LLVM developers. We have two (and soon to be three) ongoing research projects involving LLVM and Clang, with a need for significant development work. An ideal candidate would be someone who has multiple patches submitted and accepted across fairly diverse portions of the code base. The job postings are

On 2/27/13 9:50 AM, Dean Sutherland wrote: > The Secure Coding group at CERT has current job openings for knowledgeable Clang and/or LLVM developers. We have two (and soon to be three) ongoing research projects involving LLVM and Clang, with a need for significant development work. An ideal candidate would be someone who has multiple patches submitted and accepted across fairly diverse

>Fromwhat you describe, your comp/limiter can't possibly be working correctly. It should be the last unit in line before the sound card, and needs to be adjusted properly. You also need to balance the levels on your mixing board (so that the correc t level comes at predictable place on the slider). It might be worthwhile to find someone with some sound-mixing or radio engineering experience

Dear Pierre, Stepping up a level, what is your goal in replacing calls to malloc() and free()? Is it any different than what SAFECode, SoftBound, or ASan do? Regards, John Criswell On 5/25/16 8:05 AM, Pierre Gagelin via llvm-dev wrote: > Hi everyone, > > I am having troubles but this shouldn't be hard to solve for many > people here. I am beginning a runtime feature for the

Hello, even though the study of Intel MPX took much longer than expected, we have finally finished it. Currently, it is published in two formats: * as a technical report: https://arxiv.org/abs/1702.00719 * and as a webpage: https://intel-mpx.github.io/ This work contains evaluation of MPX from perspectives of performance (Phoenix, PARSEC, and SPEC benchmark suites), security (RIPE and found

Dear all, I need to simulate data which fit to a double poisson time series model with certain parameters. Then, check whether the estimated parameter close to the true parameter by using maximum likelihood estimation. Simulation: set.seed(10) library("rmutil") a0 = 1.5; a1 = 0.4; b1 = 0.3; g1= 0.7 ; n=100 #a0, a1 and b1 are parameter where n is size. nu = h =