Hello,
On Wed, Mar 25, 2009 at 11:35:41AM +0100, Bert Wesarg wrote:
> +$tg summary --graphviz |
> + tred |
> + gvpr -a "\"${name}\"" '
> +BEG_G {
> + node_t ctr;
> + edge_t e;
> +
> + ctr = isNode($, ARGV[0]);
> + for (e = fstedge(ctr); e; e = nxtedge(e,ctr)) {
> + if (e.head.name != ARGV[0])
> + printf("%s\n", e.head.name);
> + }
> + exit(0);
> +}
I don't know tred and gvpr, just looked shortly over the manpages.
Anyhow what I consider important is that the order of .topdeps is
stable. That is
t/topic1
master
t/topic2
must not be rewritten to
t/topic2
t/topic1
if master is redundant. Is this asserted?
Moreover I wonder if the gvpr program could be optimized when E is used
instead of BEG_G, but as I said above, I don't know how gvpr works.
And note that I intend to change the semantic of tg summary s.t. it only
recurses on the current branch instead of all branches. I think this
doesn't hurt here, though.
Best regards and thanks for your contribution,
Uwe
--
Pengutronix e.K. | Uwe Kleine-König |
Industrial Linux Solutions | http://www.pengutronix.de/ |
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
