similar to: [LLVMdev] No of Datastructures

Displaying 20 results from an estimated 2000 matches similar to: "[LLVMdev] No of Datastructures"

2008 Oct 31
0
[LLVMdev] No of Datastructures
Hi Nipun, On Oct 30, 2008, at 9:31 PM, Nipun Arora wrote: > Hi > > I am trying to count the no of datastructures and the type, say for > example the number of arrays in a given code. Which pass would give > me this info? And what do I need to use in it? What are you trying to achieve here with this information ? You can iterate over types to collect the info you need. For
2008 Nov 02
2
[LLVMdev] No of Datastructures
Hey Devang, Thanks for the assist, I'm trying to extract a signature which uniquely identifies a block of code.... this is required for a project I am doing. The no of data structures is one of the identifying features of this signature. Thanks Nipun On Fri, Oct 31, 2008 at 1:05 PM, Devang Patel <dpatel at apple.com> wrote: > Hi Nipun, > On Oct 30, 2008, at 9:31 PM, Nipun
2008 Nov 05
1
[LLVMdev] No of Datastructures
Hi I was having just one more problem. I would like to find these datastructures/ primitive types etc inside a block, however the valuesymbol table is available only at a functional level. What can I do so as to get the number + type of datastructs(eg. arrays etc) inside a single block? Thanks Nipun On Fri, Oct 31, 2008 at 12:05 PM, Devang Patel <dpatel at apple.com> wrote: > Hi
2008 Nov 02
0
[LLVMdev] No of Datastructures
How do you define a data structure for this purpose? Do you mean individual data types like structs or arrays? Or higher-level "logical" structures like lists, trees, or hash tables? The former is obviously easier but even the latter is possible, in some cases. --Vikram Associate Professor, Computer Science University of Illinois at Urbana-Champaign http://llvm.org/~vadve On
2008 Nov 03
1
[LLVMdev] No of Datastructures
Right now I am writing passes just to look for arrays & structs I am trying to identify the array by parsing the memory description(use regex's) ex./ { [20 x i8], i32 } *- for a struct. is a structure with a character array of size 20 and an integer. I'm not sure if llvm provides an easier way to do this? The type id for most arrays comes out to be a pointer rather than an array, its
2011 Dec 06
3
[LLVMdev] Regarding anonymous types
Hi All,   While collecting type information for "anonymous types", I had below observation.   For the example with anonymous types, given below struct test {   struct {     union {       Char a[4];     };   };   struct {     int b;     char c;   }; };   LLVM 2.6 defines the types as %struct.anon1 = type { %union.anon0} %struct.anon2 = type { i32, i8} %struct.test = type {
2011 Dec 06
0
[LLVMdev] Regarding anonymous types
Pankaj, I encourage you to read Chris's excellent blog entry on type system @ http://blog.llvm.org/2011/11/llvm-30-type-system-rewrite.html - Devang On Dec 6, 2011, at 3:54 AM, Pankaj Gode wrote: > Hi All, > > While collecting type information for "anonymous types", I had below observation. > > For the example with anonymous types, given below > struct test
2011 Apr 01
2
[LLVMdev] compiling bitccode to executable binary/LLI
Hi, Could anyone tell me how exactly can one convert a .bc file (bitcode file) to an executable in the native program. I was trying an instrumentation transform with the following workflow opt -insert-edge-profiling input.bc -o output.bc and then try and execute output.bc using lli output.bc however the program gives the following error : Program used external function
2012 Jan 26
3
[LLVMdev] Compiling glibc with LLVM
Hi, I read on the gentoo website http://en.gentoo-wiki.com/wiki/Llvm that glibc cannot be compiled using llvm because of some GNU extensions which LLVM does not support. Has there been any success in compiling glibc using LLVM so as to get the bytecode? We are looking to do whole program analysis to look at control flows including those in libc... we were hoping that we could get the control
2011 Mar 28
0
[LLVMdev] Memory Dependence Analysis
On 03/28/2011 12:15 PM, Nipun Arora wrote: > Hi, > > I have been trying to run the memdep analysis using opt with the > following command: opt -analyze -memdep <*.bc>. > However, I keep getting the following error: Pass::print not implemented > for pass: 'Memory Dependence Analysis' ! . > I get similar errors for a lot of the analyses passes, which seem as if
2011 Mar 28
3
[LLVMdev] Memory Dependence Analysis
Hi, I have been trying to run the memdep analysis using opt with the following command: opt -analyze -memdep <*.bc>. However, I keep getting the following error: Pass::print not implemented for pass: 'Memory Dependence Analysis' ! . I get similar errors for a lot of the analyses passes, which seem as if they should have a print out? Is there any other memory dependence analysis
2009 Feb 11
3
[LLVMdev] Operand, instruction
Hi, How can one extract the operand of an instruction in an LLVM pass? Like I can get the opcode bt I'd like to get the operands as well Thanks Nipun -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090211/3a073512/attachment.html>
2008 Oct 30
2
[LLVMdev] Error in registration of Pass
Hi , I get the following error when I try and load a certain pass I have made. Can anyone help me out? What could be the problem? And how can I remove it? opt: Pass.cpp:147: void<unnamed>::PassRegistrar::RegisterPass(llvm::PassInfo&): Assertion `Inserted && "Pass registered multiple times!"' failed. Aborted (core dumped) Thanks Nipun --------------
2011 Apr 01
0
[LLVMdev] compiling bitccode to executable binary/LLI
Hi, I was able to figure out this one, by checking out profile.pl. However, I am still interested in getting to know if there is anyway to compile from bitcode to a normal executable? Maybe I am missing something obvious... :P ? Thanks Nipun On Fri, Apr 1, 2011 at 1:34 PM, Nipun Arora <nipun2512 at gmail.com> wrote: > Hi, > > Could anyone tell me how exactly can one convert a
2012 Jan 26
1
[LLVMdev] Compiling glibc with LLVM
Hi James, I will look into the RedHat newlib library, however, we def are looking for a solution for glibc, but maybe newlib would be a good way to go to test our complete workflow before putting an effort to generate control flow graphs for glibc. btw. I did have another question, hopefully you would be able to answer, what we are looking to do is to get the control flow graph including some
2011 Dec 07
2
[LLVMdev] LLVM instrumentation overhead
Hi, I need to write a transform pass which instruments the target program to output the name of each function executed, and the rdtsc counter along with it. Can anyone give me an idea of how to go about it?(I've worked around with LLVM pass framework and opt to do static analysis, but would like to do a lightweight instrumentation). Also can anyone give an approximate idea of the
2009 Feb 04
2
[LLVMdev] Creating AST
Hi all, Does LLVM provide any way to parse and extract the AST from C++ source files? Thanks Nipun -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090204/7dffd376/attachment.html>
2009 Jan 31
2
[LLVMdev] Optimized code analysis problems
Hi all, I am trying to do an analysis of a parallelized code using sse optimizations. The problem I am encountering is that I need to do some matching based on the analysis and I would like to extract the names of the functions as is rather than llvm intrinsics with an llvm. representation. Essentially I would like to extract the control flow graph representation with function names (eg.
2009 Jan 31
2
[LLVMdev] Optimized code analysis problems
Hii, Thanks for the response, yes I couldn't find any way to extract the names through any of the passes. Where could I potentially insert a hack so that any function call to intrinsic functions or library functions can be retrieved? Could you gimme any ideas for the start? -Nipun On Fri, Jan 30, 2009 at 10:39 PM, Eli Friedman <eli.friedman at gmail.com>wrote: > On Fri, Jan 30,
2009 Mar 11
3
[LLVMdev] Wiki?
On Mar 11, 2009, at 10:53 AM, Jon Harrop wrote: > On Wednesday 11 March 2009 14:19:28 Vikram S. Adve wrote: >> In principle, having a Wiki like this would be valuable. In >> practice, >> I think there will need to be some sanity checking to make sure >> incorrect or misleading information is not added to it. > > Yes, I think a Wiki would be extremely valuable.