Displaying 11 results from an estimated 11 matches for "vvasilev".
2015 Mar 10
2
[LLVMdev] Google Summer of Code
> 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.
>>
>&g...
2015 Mar 11
2
[LLVMdev] Google Summer of Code
> 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:
>>>>
>>>...
2015 Mar 09
2
[LLVMdev] Google Summer of Code
...xamples 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.
>>
>> On Wed, Ma...
2015 Mar 04
2
[LLVMdev] Google Summer of 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 submitting...
2013 Oct 24
0
[LLVMdev] LLVM use chains
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* getelement...
2013 Oct 24
2
[LLVMdev] LLVM use chains
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
2012 Jul 12
1
[LLVMdev] llvm::DenseSet with reverse iterator
...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
> element is unique. I ha...
2013 Oct 24
2
[LLVMdev] LLVM use chains
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:
>> %call = call...
2015 Feb 17
3
[LLVMdev] Google Summer of Code
John,
Yes, I'm taking care about application as usual.
On Tue, Feb 17, 2015 at 4:48 AM, Eric Christopher <echristo at gmail.com> wrote:
> I believe Anton was going to do so.
>
>
> On Mon, Feb 16, 2015, 5:14 PM John Criswell <jtcriswel at gmail.com> wrote:
>>
>> Dear All,
>>
>> Has someone registered LLVM as an organization for Google Summer of
2012 Jul 12
0
[LLVMdev] llvm::DenseSet with reverse iterator
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
2012 Jul 12
2
[LLVMdev] llvm::DenseSet with reverse iterator
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