develooper Front page | perl.qa | Postings from June 2007

Re: Code coverage awesomeness

Thread Previous | Thread Next
From:
demerphq
Date:
June 18, 2007 00:32
Subject:
Re: Code coverage awesomeness
Message ID:
9b18b3110706180032x34057721qd8709494bae8e340@mail.gmail.com
On 6/18/07, A. Pagaltzis <pagaltzis@gmx.de> wrote:
> * Joshua ben Jore <twists@gmail.com> [2007-06-18 02:10]:
> > Probably but I'd ask Avar or Yves about that and I'm sure the
> > method would be entirely different. The 5.10 engine is
> > pluggable so I'm sure it's wrappable and therefore traceable.
>
> Cool. Because that's a subject that the existing coverage tools
> don't deal very well with – just because I used a regex once
> doesn't mean I actually have any significant coverage of the
> "code paths" in that regex. Yet all the tools operate on this
> assumption so far.

Its come up in discussion on p5p in the past. The basic idea would be
to count regops and then note which regops were not touched by
executing the pattern. It becomes a lot trickier when you consider the
TRIE regop, so i guess the thing to do would be under coverage you
would disable that optimisation. But the issue applies to any sort of
"dfa"isation of the engine, which potentially makes the problem very
hard indeed.

cheers,
Yves





-- 
perl -Mre=debug -e "/just|another|perl|hacker/"

Thread Previous | Thread Next


nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About