search for: eqsat

...at would such a framework look like? Is there past literature on the subject? From what I know, many functional compilers using combinator based compilation were graph rewriting. Is there other prior art? Also, there is the idea of Equality Saturation ( http://www.cs.cornell.edu/~ross/publications/eqsat/) that I found out about recently. Could this be used to augment the InstCombine infrastructure? Thanks, ~Siddharth -- Sending this from my phone, please excuse any typos! -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev...

...few related problems that maybe you are really asking? 1. Is there a way to determine and apply the a maximal or nearly-maximal set of folds/graph transforms that could be applied to a given set of code in a sane and principled way -> yes (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) 2. Is there a way to determine all expressions in the program as it exists that are equivalent or equivalent under constant time constant folding/reassociation, in a reasonable time bound -> yes (not a single easy link, happy to talk about it) Your original question is basically equivalent...

...t maybe you are really asking? > 1. Is there a way to determine and apply the a maximal or nearly-maximal > set of folds/graph transforms that could be applied to a given set of code > in a sane and principled way -> yes > > (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) > > 2. Is there a way to determine all expressions in the program as it exists > that are equivalent or equivalent under constant time constant > folding/reassociation, in a reasonable time bound -> yes > > (not a single easy link, happy to talk about it) > > Your origi...

...> or nearly-maximal set of folds/graph transforms that > could be applied to a given set of code in a sane and > principled way -> yes > > (see, > e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/ > <http://www.cs.cornell.edu/%7Eross/publications/eqsat/>) > > 2. Is there a way to determine all expressions in the > program as it exists that are equivalent or equivalent > under constant time constant folding/...

...a way to determine and apply the a maximal or >>>> nearly-maximal set of folds/graph transforms that could be applied to a >>>> given set of code in a sane and principled way -> yes >>>> >>>> (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) >>>> >>>> 2. Is there a way to determine all expressions in the program as it >>>> exists that are equivalent or equivalent under constant time constant >>>> folding/reassociation, in a reasonable time bound -> yes >>>> >>>&g...

Saw this mentioned on Lambda, and thought it was worth pointing out (though I'm betting most of you are Lambda readers). Looks like it's a new approach to mapping out optimizations and picking the best ordering/grouping. http://www.cse.ucsd.edu/~rtate/publications/eqsat/ Just watched the video and am settling down to read the paper, and it looks interesting so far. Anyone more well-versed in compiler optimization theory see this and want to comment? Jonathan _________________________________________________________________ Express your personality in color! P...

...ly asking? >> 1. Is there a way to determine and apply the a maximal or nearly-maximal >> set of folds/graph transforms that could be applied to a given set of code >> in a sane and principled way -> yes >> >> (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) >> >> 2. Is there a way to determine all expressions in the program as it >> exists that are equivalent or equivalent under constant time constant >> folding/reassociation, in a reasonable time bound -> yes >> >> (not a single easy link, happy to talk about...

...st literature on the > > subject? From what I know, many functional compilers using combinator > > based compilation were graph rewriting. Is there other prior art? > > > > Also, there is the idea of Equality Saturation > > (http://www.cs.cornell.edu/~ross/publications/eqsat/) that I found out > > about recently. Could this be used to augment the InstCombine > > infrastructure? > > > > Thanks, > > ~Siddharth > > > > -- > > Sending this from my phone, please excuse any typos! > > > > > > _________________...

...gt; 1. Is there a way to determine and apply the a maximal or nearly-maximal >>> set of folds/graph transforms that could be applied to a given set of code >>> in a sane and principled way -> yes >>> >>> (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) >>> >>> 2. Is there a way to determine all expressions in the program as it >>> exists that are equivalent or equivalent under constant time constant >>> folding/reassociation, in a reasonable time bound -> yes >>> >>> (not a single easy li...

...ne and apply the a maximal or >>>>> nearly-maximal set of folds/graph transforms that could be applied to a >>>>> given set of code in a sane and principled way -> yes >>>>> >>>>> (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) >>>>> >>>>> 2. Is there a way to determine all expressions in the program as it >>>>> exists that are equivalent or equivalent under constant time constant >>>>> folding/reassociation, in a reasonable time bound -> yes >>>&gt...

...a maximal or >>>>>> nearly-maximal set of folds/graph transforms that could be applied to a >>>>>> given set of code in a sane and principled way -> yes >>>>>> >>>>>> (see, e.g., http://www.cs.cornell.edu/~ross/publications/eqsat/) >>>>>> >>>>>> 2. Is there a way to determine all expressions in the program as it >>>>>> exists that are equivalent or equivalent under constant time constant >>>>>> folding/reassociation, in a reasonable time bound -> yes...

On Tue, May 8, 2018 at 11:15 AM Daniel Berlin <dberlin at dberlin.org> wrote: > > > On Tue, May 8, 2018 at 10:38 AM, Hiroshi Yamauchi via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > >> ( >> ​I came across this issue in the context of >> D46336 <https://reviews.llvm.org/D46336>. >> ​ ​ >> Thanks, Sanjay, for starting this

On Tue, May 8, 2018 at 10:38 AM, Hiroshi Yamauchi via llvm-dev < llvm-dev at lists.llvm.org> wrote: > ( > ​I came across this issue in the context of > D46336 <https://reviews.llvm.org/D46336>. > ​ ​ > Thanks, Sanjay, for starting this discussion.) > > If > ​we will > move > ​reassociation, > or keep additional ones > ​,​ > out of instcombine,