Displaying 7 results from an estimated 7 matches for "d2591".
Did you mean:
2591
2014 Jan 31
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...significant enhancement to
> the MergeFunctions pass that also allows merging of
> functions that are
> only similar but not identical
> (http://llvm-reviews.__chandle__rc.com/D2591
> <http://chandlerc.com/D2591>
> <http://llvm-reviews.__chandlerc.com/D2591
> <http://llvm-reviews.chandlerc.com/D2591>>).
>
>
> Our patch also changes the way that functions are
>...
2014 Feb 03
4
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...t;> the MergeFunctions pass that also allows
>>> merging of
>>> functions that are
>>> only similar but not identical
>>> (http://llvm-reviews.__chandle__rc.com/D2591
>>> <http://chandlerc.com/D2591>
>>> <http://llvm-reviews.__chandlerc.com/D2591
>>> <http://llvm-reviews.chandlerc.com/D2591>>).
>>>
>>>
>>> Our patch also chang...
2014 Jan 22
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
..." <tobias.von.koch at gmail.com>:
> Hi Stepan,
>
> As you've seen we have recently implemented a significant enhancement to
> the MergeFunctions pass that also allows merging of functions that are
> only similar but not identical
> (http://llvm-reviews.chandlerc.com/D2591).
>
> Our patch also changes the way that functions are compared quite
> significantly. This is necessary because we need to compare all
> functions in a bucket in order to get a similarity measure for each
> pair, so we can then decide which 'groups' of functions to merge.
&...
2014 Feb 27
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...geFunctions pass that
> also allows
> merging of
> functions that are
> only similar but not identical
>
> (http://llvm-reviews.__chandle____rc.com/D2591
> <http://chandle__rc.com/D2591>
> <http://chandlerc.com/D2591>
>
> <http://llvm-reviews.__chandle__rc.com/D2591
> <http://chandlerc.com/D2591>
> <http://llv...
2014 Jan 17
6
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi all,
I propose simple improvement for MergeFunctions pass, that reduced its
complexity from O(N^2) to O(log(N)), where N is number of functions in
module.
The idea, is to replace the result of comparison from "bool" to
"-1,0,1". In another words: define order relation on functions set.
To be sure, that functions could be comparable that way, we have to
prove that order
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...have recently implemented a
> significant enhancement to
> the MergeFunctions pass that also allows merging of
> functions that are
> only similar but not identical
> (http://llvm-reviews.__chandlerc.com/D2591
> <http://llvm-reviews.chandlerc.com/D2591>).
>
> Our patch also changes the way that functions are
> compared quite
> significantly. This is necessary because we need to
> compare all
>...
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...;>> Hi Stepan,
>>>
>>> As you've seen we have recently implemented a significant enhancement to
>>> the MergeFunctions pass that also allows merging of functions that are
>>> only similar but not identical
>>> (http://llvm-reviews.chandlerc.com/D2591).
>>>
>>> Our patch also changes the way that functions are compared quite
>>> significantly. This is necessary because we need to compare all
>>> functions in a bucket in order to get a similarity measure for each
>>> pair, so we can then decide which &...