Joachim Breitner writes:
> Hi,
>
> Am Dienstag, den 06.12.2016, 17:14 -0500 schrieb Ben Gamari:
>> Joachim Breitner writes:
>>
>> > Hi,
>> >
>> > Am Dienstag, den 06.12.2016, 19:27 + schrieb Michal Terepeta:
>> > > (isn't that's what
Hi,
Am Dienstag, den 06.12.2016, 17:14 -0500 schrieb Ben Gamari:
> Joachim Breitner writes:
>
> > Hi,
> >
> > Am Dienstag, den 06.12.2016, 19:27 + schrieb Michal Terepeta:
> > > (isn't that's what perf.haskell.org is doing?)
> >
> > for compiler performance, it
Joachim Breitner writes:
> Hi,
>
> Am Dienstag, den 06.12.2016, 19:27 + schrieb Michal Terepeta:
>> (isn't that's what perf.haskell.org is doing?)
>
> for compiler performance, it only reports the test suite perf test
> number so far.
>
> If someone modifies the
Johannes Waldmann writes:
> Hi,
>
>> ... to compile it with a profiled GHC and look at the report?
>
> How hard is it to build hackage or stackage
> with a profiled ghc? (Does it require ghc magic, or can I do it?)
>
Not terribly hard although it could be made
Hi,
Am Dienstag, den 06.12.2016, 19:27 + schrieb Michal Terepeta:
> (isn't that's what perf.haskell.org is doing?)
for compiler performance, it only reports the test suite perf test
number so far.
If someone modifies the nofib runner to give usable timing results for
the compiler, I can
Michal Terepeta writes:
>> On Tue, Dec 6, 2016 at 2:44 AM Ben Gamari wrote:
>>
>>I don't have a strong opinion on which of these would be better.
>>However, I would point out that currently the tests/perf/compiler tests
>>are extremely
> On Tue, Dec 6, 2016 at 2:44 AM Ben Gamari wrote:
> Michal Terepeta writes:
>
> [...]
>>
>> Looking at the comments on the proposal from Moritz, most people would
>> prefer to
>> extend/improve nofib or `tests/perf/compiler` tests. So I guess
* To access an unfolding, is `maybeUnfoldingTemplate (idUnfolding v)` the
recommended recipe?
You can see by looking at the code that idUnfolding returns nothing for a loop
breaker. You have to decide if that’s what you want; if not, use
realIdUnfolding.
* Is it the case that this recipe
Hi,
> ... to compile it with a profiled GHC and look at the report?
How hard is it to build hackage or stackage
with a profiled ghc? (Does it require ghc magic, or can I do it?)
> ... some obvious sub-optimal algorithms in GHC.
obvious to whom? you mean sub-optimality is already known,
or that
> | - One of the core issues I see in day to day programming (even though
> |not necessarily with haskell right now) is that the spare time I
> | have
> |to file bug reports, boil down performance regressions etc. and file
> |them with open source projects is not paid for and hence
| - One of the core issues I see in day to day programming (even though
|not necessarily with haskell right now) is that the spare time I
| have
|to file bug reports, boil down performance regressions etc. and file
|them with open source projects is not paid for and hence minimal.
|
11 matches
Mail list logo