SHA1 Hash:	41d41c7b57b0a08feff2ceff2a03178a321e1e85
Date:	2007-12-02 03:41:33
User:	aku
Comment:	Added progress output to the code loading up the graph to traverse, nodes, and arcs.
Timelines:	ancestors | descendants | both | trunk
Other Links:	files | ZIP archive | manifest

• branch=trunk inherited from [a28c83647d]
• sym-trunk inherited from [a28c83647d]

Modified tools/cvs2fossil/lib/c2f_cyclebreaker.tcl from [9dfc0b4e4f] to [c1b1baf75a].

@@ -173,19 +173,24 @@
 	    log write 3 cyclebreaker "Creating graph of changesets"
 	}
 
 	set dg [struct::graph dg]
 
+	set n 0
+	set max [llength $changesets]
+
 	foreach cset $changesets {
+	    log progress 2 cyclebreaker $n $max
 	    set tr [$cset timerange]
 	    $dg node insert $cset
 	    $dg node set    $cset timerange $tr
 	    $dg node set    $cset label     "[$cset str]\\n[join [struct::list map $tr {::clock format}] "\\n"]"
 	    $dg node set    $cset __id__    [$cset id]
 	    $dg node set    $cset shape     [expr {[$cset bysymbol]
 						   ? "ellipse"
 						   : "box"}]
+	    incr n
 	}
 
 	if {$log} {
 	    log write 3 cyclebreaker "Has [nsp [llength $changesets] changeset]"
 	}
@@ -192,11 +197,13 @@
 
 	# 2. Find for all relevant changeset their revisions and their
 	#    dependencies. Map the latter back to changesets and
 	#    construct the corresponding arcs.
 
+	set n 0
 	foreach cset $changesets {
+	    log progress 2 cyclebreaker $n $max
 	    foreach succ [$cset successors] {
 		# Changesets may have dependencies outside of the
 		# chosen set. These are ignored
 		if {![$dg node exists $succ]} continue
 		$dg arc insert $cset $succ
@@ -203,10 +210,11 @@
 		if {$succ eq $cset} {
 		    $cset loopcheck
 		    trouble fatal "[$cset str] depends on itself"
 		}
 	    }
+	    incr n
 	}
 
 	if {$log} {
 	    log write 3 cyclebreaker "Has [nsp [llength [$dg arcs]] dependency dependencies]"
 	}