similar to: [LLVMdev] share between AST and IR?

Hi, Isn't clang::CodeGenOptions::EmitDeclMetadata what you need? Vassil On 07/21/2011 04:32 AM, ret val wrote: > I wrote a plugin using ASTConsumer and RecursiveASTVisitor to find > "interesting" variables and functions. I'm wonder if there is a way to > save/flag/metadata these so later on at the IR level I can use this > information in a Pass. > > As far

Hi, I am writing a plugin to get information about the OpenMP constructs from the AST. I am basically writing a “RecursiveASTVisitor” and I am trying to find the OpenMP statement and get information like filename and line of code. When I am visiting recursively each statement I have my own switch on the “StmtClass” and for now I am focusing on “OMPParallelForDirectiveClass”. In my understanding,

Hi. I've tried to search the way to write a pass for clang like a pass for opt, but I haven't find it. Is it possible? I need to save class inheritance of the program being processed to external file. Thanks! Yours sincerely, Kadysev Mikhail -------------- next part -------------- An HTML attachment was scrubbed... URL:

LLVM Weekly - #1, Jan 6th 2014 ============================== Welcome to the inaugural issue of LLVM Weekly, a weekly newsletter (published every Monday) covering developments in LLVM, Clang, and related projects. I've been a long time lurker on the LLVM and Clang mailing lists and have been using LLVM extensively in my PhD research for the past 4 years. I thought it might be worthwhile to

> On Mar 10, 2015, at 1:03 AM, Vassil Vassilev <vvasilev at cern.ch> wrote: > > On 09/03/15 21:52, Anna Zaks wrote: >> >> +Easily, some of the code snippets end up being copied dozens of >> +times, which leads to worse maintainability, understandability and logical >> +design. > Should be better now. >> >> The project description stresses

I got your point. Thank you, and I'd like to provide the relative message now. But firstly, what do you mean by the "relevant command generated by your makefile"? What I can tell you now is: The Error Message: make[3]: Entering directory `/home/tang.kk/ppcg/ppcg/isl/interface' CXXLD extract_interface extract_interface.o:(.data.rel.ro._ZTI13MyASTConsumer[typeinfo for

Hi, I need a data structure which has fast search and I can walk it forward and backward. Is there something like that in LLVM ADT which am not aware of? And if not can I implement it in llvm::DenseSet? Vassil

Jun-qi Deng <dengjunqi06323011 at gmail.com> writes: > I got your point. Thank you, and I'd like to provide the relative message > now. But firstly, what do you mean by the "relevant command generated by > your makefile"? What I can tell you now is: > > The Error Message: > make[3]: Entering directory `/home/tang.kk/ppcg/ppcg/isl/interface' > CXXLD

+Easily, some of the code snippets end up being copied dozens of +times, which leads to worse maintainability, understandability and logical +design. The project description stresses code maintainability and logical design more than bug finding due to omissions in copy and pasted code. Reading this made me think of a check that would suggest people to replace copy and pasted code with a function

Reverse iteration doesn't really make sense for DenseSet, since its iteration order isn't meaningful to begin with... --Owen On Jul 12, 2012, at 8:20 AM, Vassil Vassilev wrote: > Hi, > I need a data structure which has fast search and I can walk it > forward and backward. Is there something like that in LLVM ADT which am > not aware of? And if not can I implement it in

> On Mar 11, 2015, at 2:14 AM, Vassil Vassilev <vvasilev at cern.ch> wrote: > > On 10/03/15 19:13, Anna Zaks wrote: >> >>> On Mar 10, 2015, at 1:03 AM, Vassil Vassilev <vvasilev at cern.ch <mailto:vvasilev at cern.ch>> wrote: >>> >>> On 09/03/15 21:52, Anna Zaks wrote: >>>> >>>> +Easily, some of the code

Something that might interest you is the SetVector, which as its name implies is both a set and a vector paired together. You get the advantage of doing set-like operations (search) on the set and vector-like operations (iteration, random access) on the vector, but at the cost of paying the price for both data structures when modifying the structure (and double the memory). This seems like it

Please provide a patch to Open Projects list. On Wed, Mar 4, 2015 at 8:25 PM, Vassil Vassilev <vvasilev at cern.ch> wrote: > On 17/02/15 09:47, Anton Korobeynikov wrote: >> >> John, >> >> Yes, I'm taking care about application as usual. > > I saw the the LLVM mentoring org was accepted. Congrats! > Anton, could you tell me what is the procedure of

UniqueVector is an stl map coupled with an stl vector[1], which seems very undesirable for you. As far as SmallVector + slow search, I believe that is precisely what the implementation of SmallSet does until it has to grow, after which it uses an stl set[2]. If you're always staying within your small number, SmallSetVector would be wasteful as the SmallSet would itself also have a SmallVector.

Hi folks, Happy new year! Last LLVM Developers' Meeting I had a BoF: 'Raising Next Generation LLVM Developers'. It was suggested that we should update our open projects page and possibly restructure it a little bit. I volunteered to do this work and I need your help. Chandler and I started working on a google doc [1]. We pinged few code owners asking them to list of

Dear community, We are trying to setup a BoF ( Raising Next Generation of LLVM Developers, http://sched.co/8Yzs). In our academic-oriented environments the main work force is students: undergrads, grads or PhD (rarely postdocs). Often we have limited time to bring somebody up to speed and we have to it in a productive and motivating for both parties way. I believe most of you had

Hi Matthias, Thanks a lot for the project. Could you put it in the google doc below? I'd appreciate if you could follow more-or-less the format. Are you going to be the mentor. Cheers, Vassil On 06/02/17 19:29, Matthias Braun wrote: > Here's another one: > > = Improve code generation testing = > > After instruction selection LLVM uses the MI (Machine Instruction)

Hi, I have: ... @.str1 = private unnamed_addr constant [21 x i8] c"Now f is a function\0A\00", align 1 ; Function Attrs: ssp uwtable define i32 @_Z1fv() #2 { entry: %call = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([21 x i8]* @.str1, i32 0, i32 0)) ret i32 0 } Then I get after trying to erase the function from the module: 511

The list can't ommit clang-tidy. There are many ideas about new checks on llvm bugzilla. https://llvm.org/bugs/buglist.cgi?product=clang-tools-extra&component=clang-tidy&resolution=---&list_id=110936 Everything matching ".*Feature Request.*" Piotr 2017-01-16 21:31 GMT+01:00 Sean Silva via cfe-dev <cfe-dev at lists.llvm.org>: > Do we have any open projects on

Hi, Thanks a lot for the help! It seems that the SmallSetVector is the ADT I need (interface-wise). Is more efficient than llvm::UniqueVector? In my use case I have to insert a new element in the structure only if the element is unique. I hardly expect more than 32 elements. Do you think I gain a lot if I use the SmallSetVector instead of using SmallVector + slow searching on every