similar to: Your help needed: List of LLVM Open Projects 2017

> On Feb 5, 2017, at 7:13 PM, Rodney M. Bates via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > A couple of Modula-3 developers have worked on splicing LLVM on as an alternative > back end to the Modula-3 compiler, out-of-tree (the LLVM tree), of course. A major > portion of the necessary glue code is there, and at one time, I was able to get the > M3 compiler and the

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 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)

On Mon, Jan 16, 2017 at 12:31 PM, Sean Silva <chisophugis at gmail.com> wrote: > Do we have any open projects on LLD? > > I know we usually try to avoid any big "projects" and mainly add/fix > things in response to user needs, but just wondering if somebody has any > ideas. > > Some really generic/simple stuff I can think of: > 1. trying out LLD on a large

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

> 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

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

+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

> 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

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

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

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

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.

> On Mar 30, 2017, at 6:56 AM, Vassil Vassilev <v.g.vassilev at gmail.com> wrote: > > Hi, > > This seems a very exciting project. Do I take that you’re volunteering to mentor it? ;-) > > As part of GSoC16 Raphael developed a code clone detection tool (https://docs.google.com/presentation/d/1mJ6dA6XmAQ8s8Zqm_j518yoW-_QZ72e69fPG1u_nbj8/edit#slide=id.g35f391192_00

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

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

Hi, I'm interested in GSOC in general, but I missed this roundtable unfortunately. Any summary from this session? Thanks, -- Mehdi On Mon, Oct 21, 2019 at 7:19 PM Vassil Vassilev via cfe-dev < cfe-dev at lists.llvm.org> wrote: > Round table on GSoC is a very good idea. Thanks for organizing! > > -- Vassil > On 10/22/19 12:51 AM, Anton Korobeynikov via cfe-dev wrote:

On 23 October 2013 22:41, Vassil Vassilev <vvasilev at cern.ch> wrote: > 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,

Dear All, On Wednesday, October 23 at 5 pm we will have a roundtable about LLVM's participation in GSoC and similar programs: http://llvm.org/devmtg/2019-10/#round The list of topics includes: - Overall organization of the project (timeline, ideas, etc) - Ideas lists - Lessons learned from past projects More topics for discussion are welcome! -- With best regards, Anton Korobeynikov

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 as I can tell nothing currently would allow me todo this and I'm wondering what exactly it would take to do something like this. After stairing