search for: vassil

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

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

> 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: >&gt...

...odies". Some +examples and possible applications are: Is this intentional? If not, maybe we could rephrase a bit with more emphasis on bug finding. I would also make it a requirement to use the infrastructure for bug detection. Thanks for driving this! Anna. > On Mar 9, 2015, at 1:54 AM, Vassil Vassilev <vvasilev at cern.ch> wrote: > > Hi Anton, > (CC-ing the people who might be interested to review) > I am attaching the patch. > Many thanks, > Vassil > On 04/03/15 23:00, Anton Korobeynikov wrote: >> Please provide a patch to Open Projects list. >&gt...

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 llvm::DenseSet? > Vassil > ______________________________________...

...en large. I don't have a good feel for what exactly is "pretty small", but a lot of the LLVM code chooses 4 or 8. [1] http://llvm.org/docs/doxygen/html/UniqueVector_8h_source.html [2] http://llvm.org/docs/doxygen/html/SmallSet_8h_source.html#l00048 On Thu, Jul 12, 2012 at 11:43 AM, Vassil Vassilev <vvasilev at cern.ch> wrote: > 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 > e...

...ersManual.html#dss_setvector On Thu, Jul 12, 2012 at 10:04 AM, Owen Anderson <resistor at mac.com> wrote: > 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 llvm::DenseSet? >> Vassil >> ____________...

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 p...

...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 push_back? Vassil On 7/12/12 6:23 PM, Michael Ilseman wrote: > 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, rand...

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) > representation for programs. We recently added support for reading and > writing this representa...

...loyed and HR. We would be happy to hear from you ( sorry for the late notice ;( ) what do you think. We would be happy to add or change the foreseen agenda for the BoF. Finally, if you are interested to hear more please come and visit us on Thu, 3 Nov, at 3pm (Rm+LL21CD). Best regards, Vassil

...8* getelementptr inbounds ([21 x i8]* @.str1, i32 0, i32 0)) ret i32 0 } (gdb) n 513 } (gdb) br llvm::AssemblyWriter::printModule(llvm::Module const*) (gdb) p m_CurTransaction->getModule()->dump() llvm::AssemblyWriter::printGlobal (this=0x7fff5fbfe850, GV=0x107274058) at /Users/vvassilev/workspace/root/interpreter/llvm/src/lib/IR/AsmWriter.cpp:1444 1444 if (GV->isMaterializable()) (gdb) p GV->use_empty() $78 = false (gdb) p GV->use_back() $79 = (class llvm::User *) 0x107279b88 (gdb) p GV->use_back()->dump() i8* getelementptr inbounds ([21 x i8]* @.str1, i32 0,...

...er. Now we would like to ask for your input, too. I believe an up to date list can serve as a good entry point for students, interns and new contributors. Feel free to propose a new item or comment under an existing one. I expect to start gradually updating the page beginning of Feb. -- Vassil [1] https://docs.google.com/document/d/1YLK_xINSg1Ei0w8w39uAMR1n0dlf6wrzfypiX0YDQBc/edit?usp=sharing

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*, ...)*...

...r is to essentially follow the approach > suggested by Peter (in the context of "hardening") in > https://llvm.org/bugs/show_bug.cgi?id=30540#c5 i.e. getting to the point > where LLD can survive intensive fuzzing. > > -- Sean Silva > > On Mon, Jan 16, 2017 at 5:18 AM, Vassil Vassilev via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > >> 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...

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: > > Dear All, > > > > On Wednesday, October 23 at 5 pm we will...

On 10/24/13 2:13 AM, Rafael Espíndola 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: &g...

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

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

Hey All, My name is Charles, and I'm interested in working on LLVM for GSOC. I watched the 2016 LLVM conference ThinLTO talk and found it super interesting. I'd like to work on it for GSOC. Since I'm currently working on my proposal, I talked\ with Mehdi on IRC to learn more about the project and find what kind of contribution would be useful. He mentioned that the big pieces of work