2005-05-09 04:08:39 +00:00
|
|
|
#!/bin/sh
|
|
|
|
# Tcl ignores the next line -*- tcl -*- \
|
2005-09-27 00:29:41 +00:00
|
|
|
exec wish "$0" -- "$@"
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2008-05-09 00:14:07 +00:00
|
|
|
# Copyright © 2005-2008 Paul Mackerras. All rights reserved.
|
2005-05-09 04:08:39 +00:00
|
|
|
# This program is free software; it may be used, copied, modified
|
|
|
|
# and distributed under the terms of the GNU General Public Licence,
|
|
|
|
# either version 2, or (at your option) any later version.
|
|
|
|
|
2005-07-28 07:28:44 +00:00
|
|
|
proc gitdir {} {
|
|
|
|
global env
|
|
|
|
if {[info exists env(GIT_DIR)]} {
|
|
|
|
return $env(GIT_DIR)
|
|
|
|
} else {
|
2007-01-09 14:30:19 +00:00
|
|
|
return [exec git rev-parse --git-dir]
|
2005-07-28 07:28:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
# A simple scheduler for compute-intensive stuff.
|
|
|
|
# The aim is to make sure that event handlers for GUI actions can
|
|
|
|
# run at least every 50-100 ms. Unfortunately fileevent handlers are
|
|
|
|
# run before X event handlers, so reading from a fast source can
|
|
|
|
# make the GUI completely unresponsive.
|
|
|
|
proc run args {
|
|
|
|
global isonrunq runq
|
|
|
|
|
|
|
|
set script $args
|
|
|
|
if {[info exists isonrunq($script)]} return
|
|
|
|
if {$runq eq {}} {
|
|
|
|
after idle dorunq
|
|
|
|
}
|
|
|
|
lappend runq [list {} $script]
|
|
|
|
set isonrunq($script) 1
|
|
|
|
}
|
|
|
|
|
|
|
|
proc filerun {fd script} {
|
|
|
|
fileevent $fd readable [list filereadable $fd $script]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc filereadable {fd script} {
|
|
|
|
global runq
|
|
|
|
|
|
|
|
fileevent $fd readable {}
|
|
|
|
if {$runq eq {}} {
|
|
|
|
after idle dorunq
|
|
|
|
}
|
|
|
|
lappend runq [list $fd $script]
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc nukefile {fd} {
|
|
|
|
global runq
|
|
|
|
|
|
|
|
for {set i 0} {$i < [llength $runq]} {} {
|
|
|
|
if {[lindex $runq $i 0] eq $fd} {
|
|
|
|
set runq [lreplace $runq $i $i]
|
|
|
|
} else {
|
|
|
|
incr i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
proc dorunq {} {
|
|
|
|
global isonrunq runq
|
|
|
|
|
|
|
|
set tstart [clock clicks -milliseconds]
|
|
|
|
set t0 $tstart
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
while {[llength $runq] > 0} {
|
2007-06-17 04:45:00 +00:00
|
|
|
set fd [lindex $runq 0 0]
|
|
|
|
set script [lindex $runq 0 1]
|
|
|
|
set repeat [eval $script]
|
|
|
|
set t1 [clock clicks -milliseconds]
|
|
|
|
set t [expr {$t1 - $t0}]
|
|
|
|
set runq [lrange $runq 1 end]
|
|
|
|
if {$repeat ne {} && $repeat} {
|
|
|
|
if {$fd eq {} || $repeat == 2} {
|
|
|
|
# script returns 1 if it wants to be readded
|
|
|
|
# file readers return 2 if they could do more straight away
|
|
|
|
lappend runq [list $fd $script]
|
|
|
|
} else {
|
|
|
|
fileevent $fd readable [list filereadable $fd $script]
|
|
|
|
}
|
|
|
|
} elseif {$fd eq {}} {
|
|
|
|
unset isonrunq($script)
|
|
|
|
}
|
|
|
|
set t0 $t1
|
|
|
|
if {$t1 - $tstart >= 80} break
|
|
|
|
}
|
|
|
|
if {$runq ne {}} {
|
|
|
|
after idle dorunq
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-26 06:00:00 +00:00
|
|
|
proc unmerged_files {files} {
|
|
|
|
global nr_unmerged
|
|
|
|
|
|
|
|
# find the list of unmerged files
|
|
|
|
set mlist {}
|
|
|
|
set nr_unmerged 0
|
|
|
|
if {[catch {
|
|
|
|
set fd [open "| git ls-files -u" r]
|
|
|
|
} err]} {
|
|
|
|
show_error {} . "[mc "Couldn't get list of unmerged files:"] $err"
|
|
|
|
exit 1
|
|
|
|
}
|
|
|
|
while {[gets $fd line] >= 0} {
|
|
|
|
set i [string first "\t" $line]
|
|
|
|
if {$i < 0} continue
|
|
|
|
set fname [string range $line [expr {$i+1}] end]
|
|
|
|
if {[lsearch -exact $mlist $fname] >= 0} continue
|
|
|
|
incr nr_unmerged
|
|
|
|
if {$files eq {} || [path_filter $files $fname]} {
|
|
|
|
lappend mlist $fname
|
|
|
|
}
|
|
|
|
}
|
|
|
|
catch {close $fd}
|
|
|
|
return $mlist
|
|
|
|
}
|
|
|
|
|
|
|
|
proc parseviewargs {n arglist} {
|
2008-05-09 00:14:07 +00:00
|
|
|
global vdatemode vmergeonly vflags vdflags vrevs vfiltered vorigargs
|
2008-04-26 06:00:00 +00:00
|
|
|
|
|
|
|
set vdatemode($n) 0
|
|
|
|
set vmergeonly($n) 0
|
2008-05-09 00:14:07 +00:00
|
|
|
set glflags {}
|
|
|
|
set diffargs {}
|
|
|
|
set nextisval 0
|
|
|
|
set revargs {}
|
|
|
|
set origargs $arglist
|
|
|
|
set allknown 1
|
|
|
|
set filtered 0
|
|
|
|
set i -1
|
|
|
|
foreach arg $arglist {
|
|
|
|
incr i
|
|
|
|
if {$nextisval} {
|
|
|
|
lappend glflags $arg
|
|
|
|
set nextisval 0
|
|
|
|
continue
|
|
|
|
}
|
2008-04-26 06:00:00 +00:00
|
|
|
switch -glob -- $arg {
|
|
|
|
"-d" -
|
|
|
|
"--date-order" {
|
|
|
|
set vdatemode($n) 1
|
2008-05-09 00:14:07 +00:00
|
|
|
# remove from origargs in case we hit an unknown option
|
|
|
|
set origargs [lreplace $origargs $i $i]
|
|
|
|
incr i -1
|
|
|
|
}
|
|
|
|
# These request or affect diff output, which we don't want.
|
|
|
|
# Some could be used to set our defaults for diff display.
|
|
|
|
"-[puabwcrRBMC]" -
|
|
|
|
"--no-renames" - "--full-index" - "--binary" - "--abbrev=*" -
|
|
|
|
"--find-copies-harder" - "-l*" - "--ext-diff" - "--no-ext-diff" -
|
|
|
|
"--src-prefix=*" - "--dst-prefix=*" - "--no-prefix" -
|
|
|
|
"-O*" - "--text" - "--full-diff" - "--ignore-space-at-eol" -
|
|
|
|
"--ignore-space-change" - "-U*" - "--unified=*" {
|
|
|
|
lappend diffargs $arg
|
|
|
|
}
|
|
|
|
# These cause our parsing of git log's output to fail, or else
|
|
|
|
# they're options we want to set ourselves, so ignore them.
|
|
|
|
"--raw" - "--patch-with-raw" - "--patch-with-stat" -
|
|
|
|
"--name-only" - "--name-status" - "--color" - "--color-words" -
|
|
|
|
"--log-size" - "--pretty=*" - "--decorate" - "--abbrev-commit" -
|
|
|
|
"--cc" - "-z" - "--header" - "--parents" - "--boundary" -
|
|
|
|
"--no-color" - "-g" - "--walk-reflogs" - "--no-walk" -
|
|
|
|
"--timestamp" - "relative-date" - "--date=*" - "--stdin" -
|
|
|
|
"--objects" - "--objects-edge" - "--reverse" {
|
|
|
|
}
|
|
|
|
# These are harmless, and some are even useful
|
|
|
|
"--stat=*" - "--numstat" - "--shortstat" - "--summary" -
|
|
|
|
"--check" - "--exit-code" - "--quiet" - "--topo-order" -
|
|
|
|
"--full-history" - "--dense" - "--sparse" -
|
|
|
|
"--follow" - "--left-right" - "--encoding=*" {
|
|
|
|
lappend glflags $arg
|
|
|
|
}
|
|
|
|
# These mean that we get a subset of the commits
|
|
|
|
"--diff-filter=*" - "--no-merges" - "--unpacked" -
|
|
|
|
"--max-count=*" - "--skip=*" - "--since=*" - "--after=*" -
|
|
|
|
"--until=*" - "--before=*" - "--max-age=*" - "--min-age=*" -
|
|
|
|
"--author=*" - "--committer=*" - "--grep=*" - "-[iE]" -
|
|
|
|
"--remove-empty" - "--first-parent" - "--cherry-pick" -
|
|
|
|
"-S*" - "--pickaxe-all" - "--pickaxe-regex" - {
|
|
|
|
set filtered 1
|
|
|
|
lappend glflags $arg
|
|
|
|
}
|
|
|
|
# This appears to be the only one that has a value as a
|
|
|
|
# separate word following it
|
|
|
|
"-n" {
|
|
|
|
set filtered 1
|
|
|
|
set nextisval 1
|
|
|
|
lappend glflags $arg
|
|
|
|
}
|
|
|
|
"--not" {
|
|
|
|
set notflag [expr {!$notflag}]
|
|
|
|
lappend revargs $arg
|
|
|
|
}
|
|
|
|
"--all" {
|
|
|
|
lappend revargs $arg
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
|
|
|
"--merge" {
|
|
|
|
set vmergeonly($n) 1
|
2008-05-09 00:14:07 +00:00
|
|
|
# git rev-parse doesn't understand --merge
|
|
|
|
lappend revargs --gitk-symmetric-diff-marker MERGE_HEAD...HEAD
|
|
|
|
}
|
|
|
|
# Other flag arguments including -<n>
|
|
|
|
"-*" {
|
|
|
|
if {[string is digit -strict [string range $arg 1 end]]} {
|
|
|
|
set filtered 1
|
|
|
|
} else {
|
|
|
|
# a flag argument that we don't recognize;
|
|
|
|
# that means we can't optimize
|
|
|
|
set allknown 0
|
|
|
|
}
|
|
|
|
lappend glflags $arg
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
2008-05-09 00:14:07 +00:00
|
|
|
# Non-flag arguments specify commits or ranges of commits
|
2008-04-26 06:00:00 +00:00
|
|
|
default {
|
2008-05-09 00:14:07 +00:00
|
|
|
if {[string match "*...*" $arg]} {
|
|
|
|
lappend revargs --gitk-symmetric-diff-marker
|
|
|
|
}
|
|
|
|
lappend revargs $arg
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set vdflags($n) $diffargs
|
|
|
|
set vflags($n) $glflags
|
|
|
|
set vrevs($n) $revargs
|
|
|
|
set vfiltered($n) $filtered
|
|
|
|
set vorigargs($n) $origargs
|
|
|
|
return $allknown
|
|
|
|
}
|
|
|
|
|
|
|
|
proc parseviewrevs {view revs} {
|
|
|
|
global vposids vnegids
|
|
|
|
|
|
|
|
if {$revs eq {}} {
|
|
|
|
set revs HEAD
|
|
|
|
}
|
|
|
|
if {[catch {set ids [eval exec git rev-parse $revs]} err]} {
|
|
|
|
# we get stdout followed by stderr in $err
|
|
|
|
# for an unknown rev, git rev-parse echoes it and then errors out
|
|
|
|
set errlines [split $err "\n"]
|
|
|
|
set badrev {}
|
|
|
|
for {set l 0} {$l < [llength $errlines]} {incr l} {
|
|
|
|
set line [lindex $errlines $l]
|
|
|
|
if {!([string length $line] == 40 && [string is xdigit $line])} {
|
|
|
|
if {[string match "fatal:*" $line]} {
|
|
|
|
if {[string match "fatal: ambiguous argument*" $line]
|
|
|
|
&& $badrev ne {}} {
|
|
|
|
if {[llength $badrev] == 1} {
|
|
|
|
set err "unknown revision $badrev"
|
|
|
|
} else {
|
|
|
|
set err "unknown revisions: [join $badrev ", "]"
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set err [join [lrange $errlines $l end] "\n"]
|
|
|
|
}
|
|
|
|
break
|
|
|
|
}
|
|
|
|
lappend badrev $line
|
|
|
|
}
|
|
|
|
}
|
|
|
|
error_popup "Error parsing revisions: $err"
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
set ret {}
|
|
|
|
set pos {}
|
|
|
|
set neg {}
|
|
|
|
set sdm 0
|
|
|
|
foreach id [split $ids "\n"] {
|
|
|
|
if {$id eq "--gitk-symmetric-diff-marker"} {
|
|
|
|
set sdm 4
|
|
|
|
} elseif {[string match "^*" $id]} {
|
|
|
|
if {$sdm != 1} {
|
|
|
|
lappend ret $id
|
|
|
|
if {$sdm == 3} {
|
|
|
|
set sdm 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lappend neg [string range $id 1 end]
|
|
|
|
} else {
|
|
|
|
if {$sdm != 2} {
|
|
|
|
lappend ret $id
|
|
|
|
} else {
|
|
|
|
lset ret end [lindex $ret end]...$id
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
2008-05-09 00:14:07 +00:00
|
|
|
lappend pos $id
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
2008-05-09 00:14:07 +00:00
|
|
|
incr sdm -1
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
2008-05-09 00:14:07 +00:00
|
|
|
set vposids($view) $pos
|
|
|
|
set vnegids($view) $neg
|
|
|
|
return $ret
|
2008-04-26 06:00:00 +00:00
|
|
|
}
|
|
|
|
|
2008-03-04 10:14:17 +00:00
|
|
|
# Start off a git log process and arrange to read its output
|
2006-05-02 01:15:29 +00:00
|
|
|
proc start_rev_list {view} {
|
2008-05-11 12:13:02 +00:00
|
|
|
global startmsecs commitidx viewcomplete curview
|
2008-04-26 06:00:00 +00:00
|
|
|
global commfd leftover tclencoding
|
2008-05-09 00:14:07 +00:00
|
|
|
global viewargs viewargscmd viewfiles vfilelimit
|
2008-05-26 00:11:33 +00:00
|
|
|
global showlocalchanges commitinterest
|
2008-04-26 06:00:00 +00:00
|
|
|
global viewactive loginstance viewinstances vmergeonly
|
2008-01-13 06:26:30 +00:00
|
|
|
global pending_select mainheadid
|
2008-05-09 00:14:07 +00:00
|
|
|
global vcanopt vflags vrevs vorigargs
|
2005-06-16 00:27:23 +00:00
|
|
|
|
|
|
|
set startmsecs [clock clicks -milliseconds]
|
2006-05-02 01:15:29 +00:00
|
|
|
set commitidx($view) 0
|
2008-04-26 06:00:00 +00:00
|
|
|
# these are set this way for the error exits
|
|
|
|
set viewcomplete($view) 1
|
|
|
|
set viewactive($view) 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
varcinit $view
|
|
|
|
|
2008-02-21 20:23:31 +00:00
|
|
|
set args $viewargs($view)
|
|
|
|
if {$viewargscmd($view) ne {}} {
|
|
|
|
if {[catch {
|
|
|
|
set str [exec sh -c $viewargscmd($view)]
|
|
|
|
} err]} {
|
|
|
|
error_popup "Error executing --argscmd command: $err"
|
2008-04-26 06:00:00 +00:00
|
|
|
return 0
|
2008-02-21 20:23:31 +00:00
|
|
|
}
|
|
|
|
set args [concat $args [split $str "\n"]]
|
|
|
|
}
|
2008-05-09 00:14:07 +00:00
|
|
|
set vcanopt($view) [parseviewargs $view $args]
|
2008-04-26 06:00:00 +00:00
|
|
|
|
|
|
|
set files $viewfiles($view)
|
|
|
|
if {$vmergeonly($view)} {
|
|
|
|
set files [unmerged_files $files]
|
|
|
|
if {$files eq {}} {
|
|
|
|
global nr_unmerged
|
|
|
|
if {$nr_unmerged == 0} {
|
|
|
|
error_popup [mc "No files selected: --merge specified but\
|
|
|
|
no files are unmerged."]
|
|
|
|
} else {
|
|
|
|
error_popup [mc "No files selected: --merge specified but\
|
|
|
|
no unmerged files are within file limit."]
|
|
|
|
}
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set vfilelimit($view) $files
|
|
|
|
|
2008-05-09 00:14:07 +00:00
|
|
|
if {$vcanopt($view)} {
|
|
|
|
set revs [parseviewrevs $view $vrevs($view)]
|
|
|
|
if {$revs eq {}} {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
set args [concat $vflags($view) $revs]
|
|
|
|
} else {
|
|
|
|
set args $vorigargs($view)
|
|
|
|
}
|
|
|
|
|
2006-02-06 22:10:18 +00:00
|
|
|
if {[catch {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set fd [open [concat | git log --no-color -z --pretty=raw --parents \
|
2008-04-26 06:00:00 +00:00
|
|
|
--boundary $args "--" $files] r]
|
2006-02-06 22:10:18 +00:00
|
|
|
} err]} {
|
2007-12-19 23:25:50 +00:00
|
|
|
error_popup "[mc "Error executing git log:"] $err"
|
2008-04-26 06:00:00 +00:00
|
|
|
return 0
|
2005-05-15 12:55:47 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i [incr loginstance]
|
|
|
|
set viewinstances($view) [list $i]
|
|
|
|
set commfd($i) $fd
|
|
|
|
set leftover($i) {}
|
2008-05-26 00:11:33 +00:00
|
|
|
if {$showlocalchanges && $mainheadid ne {}} {
|
2007-09-14 23:33:39 +00:00
|
|
|
lappend commitinterest($mainheadid) {dodiffindex}
|
|
|
|
}
|
2007-07-17 22:42:04 +00:00
|
|
|
fconfigure $fd -blocking 0 -translation lf -eofchar {}
|
2005-12-07 12:28:22 +00:00
|
|
|
if {$tclencoding != {}} {
|
2006-05-02 01:15:29 +00:00
|
|
|
fconfigure $fd -encoding $tclencoding
|
2005-12-07 12:28:22 +00:00
|
|
|
}
|
2008-02-24 01:16:56 +00:00
|
|
|
filerun $fd [list getcommitlines $fd $i $view 0]
|
2007-11-07 17:42:55 +00:00
|
|
|
nowbusy $view [mc "Reading"]
|
2007-09-27 01:00:25 +00:00
|
|
|
if {$view == $curview} {
|
2008-01-13 06:26:30 +00:00
|
|
|
set pending_select $mainheadid
|
2007-09-27 01:00:25 +00:00
|
|
|
}
|
2008-04-26 06:00:00 +00:00
|
|
|
set viewcomplete($view) 0
|
|
|
|
set viewactive($view) 1
|
|
|
|
return 1
|
2005-12-01 11:42:46 +00:00
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc stop_rev_list {view} {
|
|
|
|
global commfd viewinstances leftover
|
2006-04-16 23:56:02 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
foreach inst $viewinstances($view) {
|
|
|
|
set fd $commfd($inst)
|
|
|
|
catch {
|
|
|
|
set pid [pid $fd]
|
|
|
|
exec kill $pid
|
|
|
|
}
|
|
|
|
catch {close $fd}
|
|
|
|
nukefile $fd
|
|
|
|
unset commfd($inst)
|
|
|
|
unset leftover($inst)
|
2006-04-16 23:56:02 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set viewinstances($view) {}
|
2006-04-16 23:56:02 +00:00
|
|
|
}
|
|
|
|
|
2006-04-23 12:45:55 +00:00
|
|
|
proc getcommits {} {
|
2008-04-26 06:00:00 +00:00
|
|
|
global canv curview need_redisplay viewactive
|
2005-12-01 11:42:46 +00:00
|
|
|
|
2006-05-02 01:15:29 +00:00
|
|
|
initlayout
|
2008-04-26 06:00:00 +00:00
|
|
|
if {[start_rev_list $curview]} {
|
|
|
|
show_status [mc "Reading commits..."]
|
|
|
|
set need_redisplay 1
|
|
|
|
} else {
|
|
|
|
show_status [mc "No commits selected"]
|
|
|
|
}
|
2005-05-15 12:55:47 +00:00
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc updatecommits {} {
|
2008-05-09 00:14:07 +00:00
|
|
|
global curview vcanopt vorigargs vfilelimit viewinstances
|
2008-05-26 00:11:33 +00:00
|
|
|
global viewactive viewcomplete loginstance tclencoding
|
2008-03-02 23:19:35 +00:00
|
|
|
global startmsecs commfd showneartags showlocalchanges leftover
|
2008-01-13 06:26:30 +00:00
|
|
|
global mainheadid pending_select
|
2008-03-11 11:21:39 +00:00
|
|
|
global isworktree
|
2008-05-09 00:14:07 +00:00
|
|
|
global varcid vposids vnegids vflags vrevs
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
2008-03-11 11:21:39 +00:00
|
|
|
set isworktree [expr {[exec git rev-parse --is-inside-work-tree] == "true"}]
|
2007-12-29 10:13:34 +00:00
|
|
|
set oldmainid $mainheadid
|
2007-12-26 12:03:43 +00:00
|
|
|
rereadrefs
|
2007-12-29 10:13:34 +00:00
|
|
|
if {$showlocalchanges} {
|
|
|
|
if {$mainheadid ne $oldmainid} {
|
|
|
|
dohidelocalchanges
|
|
|
|
}
|
|
|
|
if {[commitinview $mainheadid $curview]} {
|
|
|
|
dodiffindex
|
|
|
|
}
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set view $curview
|
2008-05-09 00:14:07 +00:00
|
|
|
if {$vcanopt($view)} {
|
|
|
|
set oldpos $vposids($view)
|
|
|
|
set oldneg $vnegids($view)
|
|
|
|
set revs [parseviewrevs $view $vrevs($view)]
|
|
|
|
if {$revs eq {}} {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
# note: getting the delta when negative refs change is hard,
|
|
|
|
# and could require multiple git log invocations, so in that
|
|
|
|
# case we ask git log for all the commits (not just the delta)
|
|
|
|
if {$oldneg eq $vnegids($view)} {
|
|
|
|
set newrevs {}
|
|
|
|
set npos 0
|
|
|
|
# take out positive refs that we asked for before or
|
|
|
|
# that we have already seen
|
|
|
|
foreach rev $revs {
|
|
|
|
if {[string length $rev] == 40} {
|
|
|
|
if {[lsearch -exact $oldpos $rev] < 0
|
|
|
|
&& ![info exists varcid($view,$rev)]} {
|
|
|
|
lappend newrevs $rev
|
|
|
|
incr npos
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
lappend $newrevs $rev
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$npos == 0} return
|
|
|
|
set revs $newrevs
|
|
|
|
set vposids($view) [lsort -unique [concat $oldpos $vposids($view)]]
|
|
|
|
}
|
|
|
|
set args [concat $vflags($view) $revs --not $oldpos]
|
|
|
|
} else {
|
|
|
|
set args $vorigargs($view)
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[catch {
|
|
|
|
set fd [open [concat | git log --no-color -z --pretty=raw --parents \
|
2008-05-09 00:14:07 +00:00
|
|
|
--boundary $args "--" $vfilelimit($view)] r]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
} err]} {
|
|
|
|
error_popup "Error executing git log: $err"
|
2008-05-09 00:14:07 +00:00
|
|
|
return
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
if {$viewactive($view) == 0} {
|
|
|
|
set startmsecs [clock clicks -milliseconds]
|
|
|
|
}
|
|
|
|
set i [incr loginstance]
|
|
|
|
lappend viewinstances($view) $i
|
|
|
|
set commfd($i) $fd
|
|
|
|
set leftover($i) {}
|
|
|
|
fconfigure $fd -blocking 0 -translation lf -eofchar {}
|
|
|
|
if {$tclencoding != {}} {
|
|
|
|
fconfigure $fd -encoding $tclencoding
|
|
|
|
}
|
2008-02-24 01:16:56 +00:00
|
|
|
filerun $fd [list getcommitlines $fd $i $view 1]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
incr viewactive($view)
|
|
|
|
set viewcomplete($view) 0
|
2008-01-13 06:26:30 +00:00
|
|
|
set pending_select $mainheadid
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
nowbusy $view "Reading"
|
|
|
|
if {$showneartags} {
|
|
|
|
getallcommits
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc reloadcommits {} {
|
|
|
|
global curview viewcomplete selectedline currentid thickerline
|
|
|
|
global showneartags treediffs commitinterest cached_commitrow
|
2008-05-11 12:13:02 +00:00
|
|
|
global targetid
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
if {!$viewcomplete($curview)} {
|
|
|
|
stop_rev_list $curview
|
|
|
|
}
|
|
|
|
resetvarcs $curview
|
2008-05-20 10:51:06 +00:00
|
|
|
set selectedline {}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
catch {unset currentid}
|
|
|
|
catch {unset thickerline}
|
|
|
|
catch {unset treediffs}
|
|
|
|
readrefs
|
|
|
|
changedrefs
|
|
|
|
if {$showneartags} {
|
|
|
|
getallcommits
|
|
|
|
}
|
|
|
|
clear_display
|
|
|
|
catch {unset commitinterest}
|
|
|
|
catch {unset cached_commitrow}
|
2008-01-01 22:59:39 +00:00
|
|
|
catch {unset targetid}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
setcanvscroll
|
|
|
|
getcommits
|
2008-01-15 11:30:40 +00:00
|
|
|
return 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
|
2007-07-31 11:03:06 +00:00
|
|
|
# This makes a string representation of a positive integer which
|
|
|
|
# sorts as a string in numerical order
|
|
|
|
proc strrep {n} {
|
|
|
|
if {$n < 16} {
|
|
|
|
return [format "%x" $n]
|
|
|
|
} elseif {$n < 256} {
|
|
|
|
return [format "x%.2x" $n]
|
|
|
|
} elseif {$n < 65536} {
|
|
|
|
return [format "y%.4x" $n]
|
|
|
|
}
|
|
|
|
return [format "z%.8x" $n]
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
# Procedures used in reordering commits from git log (without
|
|
|
|
# --topo-order) into the order for display.
|
|
|
|
|
|
|
|
proc varcinit {view} {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
global varcstart vupptr vdownptr vleftptr vbackptr varctok varcrow
|
|
|
|
global vtokmod varcmod vrowmod varcix vlastins
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set varcstart($view) {{}}
|
|
|
|
set vupptr($view) {0}
|
|
|
|
set vdownptr($view) {0}
|
|
|
|
set vleftptr($view) {0}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set vbackptr($view) {0}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set varctok($view) {{}}
|
|
|
|
set varcrow($view) {{}}
|
|
|
|
set vtokmod($view) {}
|
|
|
|
set varcmod($view) 0
|
2007-12-12 07:13:51 +00:00
|
|
|
set vrowmod($view) 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set varcix($view) {{}}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set vlastins($view) {0}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc resetvarcs {view} {
|
|
|
|
global varcid varccommits parents children vseedcount ordertok
|
|
|
|
|
|
|
|
foreach vid [array names varcid $view,*] {
|
|
|
|
unset varcid($vid)
|
|
|
|
unset children($vid)
|
|
|
|
unset parents($vid)
|
|
|
|
}
|
|
|
|
# some commits might have children but haven't been seen yet
|
|
|
|
foreach vid [array names children $view,*] {
|
|
|
|
unset children($vid)
|
|
|
|
}
|
|
|
|
foreach va [array names varccommits $view,*] {
|
|
|
|
unset varccommits($va)
|
|
|
|
}
|
|
|
|
foreach vd [array names vseedcount $view,*] {
|
|
|
|
unset vseedcount($vd)
|
|
|
|
}
|
2007-12-10 23:45:38 +00:00
|
|
|
catch {unset ordertok}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
|
2008-03-02 23:19:35 +00:00
|
|
|
# returns a list of the commits with no children
|
|
|
|
proc seeds {v} {
|
|
|
|
global vdownptr vleftptr varcstart
|
|
|
|
|
|
|
|
set ret {}
|
|
|
|
set a [lindex $vdownptr($v) 0]
|
|
|
|
while {$a != 0} {
|
|
|
|
lappend ret [lindex $varcstart($v) $a]
|
|
|
|
set a [lindex $vleftptr($v) $a]
|
|
|
|
}
|
|
|
|
return $ret
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc newvarc {view id} {
|
2008-04-26 06:00:00 +00:00
|
|
|
global varcid varctok parents children vdatemode
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
global vupptr vdownptr vleftptr vbackptr varcrow varcix varcstart
|
|
|
|
global commitdata commitinfo vseedcount varccommits vlastins
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set a [llength $varctok($view)]
|
|
|
|
set vid $view,$id
|
2008-04-26 06:00:00 +00:00
|
|
|
if {[llength $children($vid)] == 0 || $vdatemode($view)} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![info exists commitinfo($id)]} {
|
|
|
|
parsecommit $id $commitdata($id) 1
|
|
|
|
}
|
|
|
|
set cdate [lindex $commitinfo($id) 4]
|
|
|
|
if {![string is integer -strict $cdate]} {
|
|
|
|
set cdate 0
|
|
|
|
}
|
|
|
|
if {![info exists vseedcount($view,$cdate)]} {
|
|
|
|
set vseedcount($view,$cdate) -1
|
|
|
|
}
|
|
|
|
set c [incr vseedcount($view,$cdate)]
|
|
|
|
set cdate [expr {$cdate ^ 0xffffffff}]
|
|
|
|
set tok "s[strrep $cdate][strrep $c]"
|
|
|
|
} else {
|
|
|
|
set tok {}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
}
|
|
|
|
set ka 0
|
|
|
|
if {[llength $children($vid)] > 0} {
|
|
|
|
set kid [lindex $children($vid) end]
|
|
|
|
set k $varcid($view,$kid)
|
|
|
|
if {[string compare [lindex $varctok($view) $k] $tok] > 0} {
|
|
|
|
set ki $kid
|
|
|
|
set ka $k
|
|
|
|
set tok [lindex $varctok($view) $k]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
}
|
|
|
|
if {$ka != 0} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i [lsearch -exact $parents($view,$ki) $id]
|
|
|
|
set j [expr {[llength $parents($view,$ki)] - 1 - $i}]
|
|
|
|
append tok [strrep $j]
|
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set c [lindex $vlastins($view) $ka]
|
|
|
|
if {$c == 0 || [string compare $tok [lindex $varctok($view) $c]] < 0} {
|
|
|
|
set c $ka
|
|
|
|
set b [lindex $vdownptr($view) $ka]
|
|
|
|
} else {
|
|
|
|
set b [lindex $vleftptr($view) $c]
|
|
|
|
}
|
|
|
|
while {$b != 0 && [string compare $tok [lindex $varctok($view) $b]] >= 0} {
|
|
|
|
set c $b
|
|
|
|
set b [lindex $vleftptr($view) $c]
|
|
|
|
}
|
|
|
|
if {$c == $ka} {
|
|
|
|
lset vdownptr($view) $ka $a
|
|
|
|
lappend vbackptr($view) 0
|
|
|
|
} else {
|
|
|
|
lset vleftptr($view) $c $a
|
|
|
|
lappend vbackptr($view) $c
|
|
|
|
}
|
|
|
|
lset vlastins($view) $ka $a
|
|
|
|
lappend vupptr($view) $ka
|
|
|
|
lappend vleftptr($view) $b
|
|
|
|
if {$b != 0} {
|
|
|
|
lset vbackptr($view) $b $a
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
lappend varctok($view) $tok
|
|
|
|
lappend varcstart($view) $id
|
|
|
|
lappend vdownptr($view) 0
|
|
|
|
lappend varcrow($view) {}
|
|
|
|
lappend varcix($view) {}
|
2007-12-12 07:13:51 +00:00
|
|
|
set varccommits($view,$a) {}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
lappend vlastins($view) 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
return $a
|
|
|
|
}
|
|
|
|
|
|
|
|
proc splitvarc {p v} {
|
|
|
|
global varcid varcstart varccommits varctok
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
global vupptr vdownptr vleftptr vbackptr varcix varcrow vlastins
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set oa $varcid($v,$p)
|
|
|
|
set ac $varccommits($v,$oa)
|
|
|
|
set i [lsearch -exact $varccommits($v,$oa) $p]
|
|
|
|
if {$i <= 0} return
|
|
|
|
set na [llength $varctok($v)]
|
|
|
|
# "%" sorts before "0"...
|
|
|
|
set tok "[lindex $varctok($v) $oa]%[strrep $i]"
|
|
|
|
lappend varctok($v) $tok
|
|
|
|
lappend varcrow($v) {}
|
|
|
|
lappend varcix($v) {}
|
|
|
|
set varccommits($v,$oa) [lrange $ac 0 [expr {$i - 1}]]
|
|
|
|
set varccommits($v,$na) [lrange $ac $i end]
|
|
|
|
lappend varcstart($v) $p
|
|
|
|
foreach id $varccommits($v,$na) {
|
|
|
|
set varcid($v,$id) $na
|
|
|
|
}
|
|
|
|
lappend vdownptr($v) [lindex $vdownptr($v) $oa]
|
2008-02-17 23:44:33 +00:00
|
|
|
lappend vlastins($v) [lindex $vlastins($v) $oa]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
lset vdownptr($v) $oa $na
|
2008-02-17 23:44:33 +00:00
|
|
|
lset vlastins($v) $oa 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
lappend vupptr($v) $oa
|
|
|
|
lappend vleftptr($v) 0
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
lappend vbackptr($v) 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
for {set b [lindex $vdownptr($v) $na]} {$b != 0} {set b [lindex $vleftptr($v) $b]} {
|
|
|
|
lset vupptr($v) $b $na
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc renumbervarc {a v} {
|
|
|
|
global parents children varctok varcstart varccommits
|
2008-04-26 06:00:00 +00:00
|
|
|
global vupptr vdownptr vleftptr vbackptr vlastins varcid vtokmod vdatemode
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set t1 [clock clicks -milliseconds]
|
|
|
|
set todo {}
|
|
|
|
set isrelated($a) 1
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set kidchanged($a) 1
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set ntot 0
|
|
|
|
while {$a != 0} {
|
|
|
|
if {[info exists isrelated($a)]} {
|
|
|
|
lappend todo $a
|
|
|
|
set id [lindex $varccommits($v,$a) end]
|
|
|
|
foreach p $parents($v,$id) {
|
|
|
|
if {[info exists varcid($v,$p)]} {
|
|
|
|
set isrelated($varcid($v,$p)) 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
incr ntot
|
|
|
|
set b [lindex $vdownptr($v) $a]
|
|
|
|
if {$b == 0} {
|
|
|
|
while {$a != 0} {
|
|
|
|
set b [lindex $vleftptr($v) $a]
|
|
|
|
if {$b != 0} break
|
|
|
|
set a [lindex $vupptr($v) $a]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set a $b
|
|
|
|
}
|
|
|
|
foreach a $todo {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {![info exists kidchanged($a)]} continue
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set id [lindex $varcstart($v) $a]
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {[llength $children($v,$id)] > 1} {
|
|
|
|
set children($v,$id) [lsort -command [list vtokcmp $v] \
|
|
|
|
$children($v,$id)]
|
|
|
|
}
|
|
|
|
set oldtok [lindex $varctok($v) $a]
|
2008-04-26 06:00:00 +00:00
|
|
|
if {!$vdatemode($v)} {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set tok {}
|
|
|
|
} else {
|
|
|
|
set tok $oldtok
|
|
|
|
}
|
|
|
|
set ka 0
|
2008-01-06 02:54:58 +00:00
|
|
|
set kid [last_real_child $v,$id]
|
|
|
|
if {$kid ne {}} {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set k $varcid($v,$kid)
|
|
|
|
if {[string compare [lindex $varctok($v) $k] $tok] > 0} {
|
|
|
|
set ki $kid
|
|
|
|
set ka $k
|
|
|
|
set tok [lindex $varctok($v) $k]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {$ka != 0} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i [lsearch -exact $parents($v,$ki) $id]
|
|
|
|
set j [expr {[llength $parents($v,$ki)] - 1 - $i}]
|
|
|
|
append tok [strrep $j]
|
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {$tok eq $oldtok} {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
set id [lindex $varccommits($v,$a) end]
|
|
|
|
foreach p $parents($v,$id) {
|
|
|
|
if {[info exists varcid($v,$p)]} {
|
|
|
|
set kidchanged($varcid($v,$p)) 1
|
|
|
|
} else {
|
|
|
|
set sortkids($p) 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
lset varctok($v) $a $tok
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set b [lindex $vupptr($v) $a]
|
|
|
|
if {$b != $ka} {
|
2007-12-10 23:45:38 +00:00
|
|
|
if {[string compare [lindex $varctok($v) $ka] $vtokmod($v)] < 0} {
|
|
|
|
modify_arc $v $ka
|
2007-12-06 09:50:31 +00:00
|
|
|
}
|
2007-12-10 23:45:38 +00:00
|
|
|
if {[string compare [lindex $varctok($v) $b] $vtokmod($v)] < 0} {
|
|
|
|
modify_arc $v $b
|
2007-12-06 09:50:31 +00:00
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set c [lindex $vbackptr($v) $a]
|
|
|
|
set d [lindex $vleftptr($v) $a]
|
|
|
|
if {$c == 0} {
|
|
|
|
lset vdownptr($v) $b $d
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
} else {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
lset vleftptr($v) $c $d
|
|
|
|
}
|
|
|
|
if {$d != 0} {
|
|
|
|
lset vbackptr($v) $d $c
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
2008-02-17 23:44:33 +00:00
|
|
|
if {[lindex $vlastins($v) $b] == $a} {
|
|
|
|
lset vlastins($v) $b $c
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
lset vupptr($v) $a $ka
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set c [lindex $vlastins($v) $ka]
|
|
|
|
if {$c == 0 || \
|
|
|
|
[string compare $tok [lindex $varctok($v) $c]] < 0} {
|
|
|
|
set c $ka
|
|
|
|
set b [lindex $vdownptr($v) $ka]
|
|
|
|
} else {
|
|
|
|
set b [lindex $vleftptr($v) $c]
|
|
|
|
}
|
|
|
|
while {$b != 0 && \
|
|
|
|
[string compare $tok [lindex $varctok($v) $b]] >= 0} {
|
|
|
|
set c $b
|
|
|
|
set b [lindex $vleftptr($v) $c]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {$c == $ka} {
|
|
|
|
lset vdownptr($v) $ka $a
|
|
|
|
lset vbackptr($v) $a 0
|
|
|
|
} else {
|
|
|
|
lset vleftptr($v) $c $a
|
|
|
|
lset vbackptr($v) $a $c
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
lset vleftptr($v) $a $b
|
|
|
|
if {$b != 0} {
|
|
|
|
lset vbackptr($v) $b $a
|
|
|
|
}
|
|
|
|
lset vlastins($v) $ka $a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach id [array names sortkids] {
|
|
|
|
if {[llength $children($v,$id)] > 1} {
|
|
|
|
set children($v,$id) [lsort -command [list vtokcmp $v] \
|
|
|
|
$children($v,$id)]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
set t2 [clock clicks -milliseconds]
|
|
|
|
#puts "renumbervarc did [llength $todo] of $ntot arcs in [expr {$t2-$t1}]ms"
|
|
|
|
}
|
|
|
|
|
2008-02-24 01:16:56 +00:00
|
|
|
# Fix up the graph after we have found out that in view $v,
|
|
|
|
# $p (a commit that we have already seen) is actually the parent
|
|
|
|
# of the last commit in arc $a.
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc fix_reversal {p a v} {
|
2007-12-18 22:35:33 +00:00
|
|
|
global varcid varcstart varctok vupptr
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set pa $varcid($v,$p)
|
|
|
|
if {$p ne [lindex $varcstart($v) $pa]} {
|
|
|
|
splitvarc $p $v
|
|
|
|
set pa $varcid($v,$p)
|
|
|
|
}
|
2007-12-18 22:35:33 +00:00
|
|
|
# seeds always need to be renumbered
|
|
|
|
if {[lindex $vupptr($v) $pa] == 0 ||
|
|
|
|
[string compare [lindex $varctok($v) $a] \
|
|
|
|
[lindex $varctok($v) $pa]] > 0} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
renumbervarc $pa $v
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc insertrow {id p v} {
|
2008-02-13 11:12:31 +00:00
|
|
|
global cmitlisted children parents varcid varctok vtokmod
|
|
|
|
global varccommits ordertok commitidx numcommits curview
|
|
|
|
global targetid targetrow
|
|
|
|
|
|
|
|
readcommit $id
|
|
|
|
set vid $v,$id
|
|
|
|
set cmitlisted($vid) 1
|
|
|
|
set children($vid) {}
|
|
|
|
set parents($vid) [list $p]
|
|
|
|
set a [newvarc $v $id]
|
|
|
|
set varcid($vid) $a
|
|
|
|
if {[string compare [lindex $varctok($v) $a] $vtokmod($v)] < 0} {
|
|
|
|
modify_arc $v $a
|
|
|
|
}
|
|
|
|
lappend varccommits($v,$a) $id
|
|
|
|
set vp $v,$p
|
|
|
|
if {[llength [lappend children($vp) $id]] > 1} {
|
|
|
|
set children($vp) [lsort -command [list vtokcmp $v] $children($vp)]
|
|
|
|
catch {unset ordertok}
|
|
|
|
}
|
|
|
|
fix_reversal $p $a $v
|
|
|
|
incr commitidx($v)
|
|
|
|
if {$v == $curview} {
|
|
|
|
set numcommits $commitidx($v)
|
|
|
|
setcanvscroll
|
|
|
|
if {[info exists targetid]} {
|
|
|
|
if {![comes_before $targetid $p]} {
|
|
|
|
incr targetrow
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc insertfakerow {id p} {
|
2007-12-10 23:45:38 +00:00
|
|
|
global varcid varccommits parents children cmitlisted
|
2008-02-13 11:12:31 +00:00
|
|
|
global commitidx varctok vtokmod targetid targetrow curview numcommits
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
2008-02-13 11:12:31 +00:00
|
|
|
set v $curview
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set a $varcid($v,$p)
|
|
|
|
set i [lsearch -exact $varccommits($v,$a) $p]
|
|
|
|
if {$i < 0} {
|
2008-02-13 11:12:31 +00:00
|
|
|
puts "oops: insertfakerow can't find [shortids $p] on arc $a"
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
set children($v,$id) {}
|
|
|
|
set parents($v,$id) [list $p]
|
|
|
|
set varcid($v,$id) $a
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend children($v,$p) $id
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set cmitlisted($v,$id) 1
|
2008-02-13 11:12:31 +00:00
|
|
|
set numcommits [incr commitidx($v)]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
# note we deliberately don't update varcstart($v) even if $i == 0
|
|
|
|
set varccommits($v,$a) [linsert $varccommits($v,$a) $i $id]
|
2008-03-04 10:32:38 +00:00
|
|
|
modify_arc $v $a $i
|
2008-01-01 22:59:39 +00:00
|
|
|
if {[info exists targetid]} {
|
|
|
|
if {![comes_before $targetid $p]} {
|
|
|
|
incr targetrow
|
|
|
|
}
|
|
|
|
}
|
2008-02-13 11:12:31 +00:00
|
|
|
setcanvscroll
|
2007-12-10 23:45:38 +00:00
|
|
|
drawvisible
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
|
2008-02-13 11:12:31 +00:00
|
|
|
proc removefakerow {id} {
|
2007-12-10 23:45:38 +00:00
|
|
|
global varcid varccommits parents children commitidx
|
2007-12-26 12:03:43 +00:00
|
|
|
global varctok vtokmod cmitlisted currentid selectedline
|
2008-02-13 11:12:31 +00:00
|
|
|
global targetid curview numcommits
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
2008-02-13 11:12:31 +00:00
|
|
|
set v $curview
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[llength $parents($v,$id)] != 1} {
|
2008-02-13 11:12:31 +00:00
|
|
|
puts "oops: removefakerow [shortids $id] has [llength $parents($v,$id)] parents"
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
set p [lindex $parents($v,$id) 0]
|
|
|
|
set a $varcid($v,$id)
|
|
|
|
set i [lsearch -exact $varccommits($v,$a) $id]
|
|
|
|
if {$i < 0} {
|
2008-02-13 11:12:31 +00:00
|
|
|
puts "oops: removefakerow can't find [shortids $id] on arc $a"
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
unset varcid($v,$id)
|
|
|
|
set varccommits($v,$a) [lreplace $varccommits($v,$a) $i $i]
|
|
|
|
unset parents($v,$id)
|
|
|
|
unset children($v,$id)
|
|
|
|
unset cmitlisted($v,$id)
|
2008-02-13 11:12:31 +00:00
|
|
|
set numcommits [incr commitidx($v) -1]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set j [lsearch -exact $children($v,$p) $id]
|
|
|
|
if {$j >= 0} {
|
|
|
|
set children($v,$p) [lreplace $children($v,$p) $j $j]
|
|
|
|
}
|
2008-03-04 10:32:38 +00:00
|
|
|
modify_arc $v $a $i
|
2007-12-26 12:03:43 +00:00
|
|
|
if {[info exist currentid] && $id eq $currentid} {
|
|
|
|
unset currentid
|
2008-05-20 10:51:06 +00:00
|
|
|
set selectedline {}
|
2007-12-26 12:03:43 +00:00
|
|
|
}
|
2008-01-01 22:59:39 +00:00
|
|
|
if {[info exists targetid] && $targetid eq $id} {
|
|
|
|
set targetid $p
|
|
|
|
}
|
2008-02-13 11:12:31 +00:00
|
|
|
setcanvscroll
|
2007-12-10 23:45:38 +00:00
|
|
|
drawvisible
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
|
2008-01-06 02:54:58 +00:00
|
|
|
proc first_real_child {vp} {
|
|
|
|
global children nullid nullid2
|
|
|
|
|
|
|
|
foreach id $children($vp) {
|
|
|
|
if {$id ne $nullid && $id ne $nullid2} {
|
|
|
|
return $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc last_real_child {vp} {
|
|
|
|
global children nullid nullid2
|
|
|
|
|
|
|
|
set kids $children($vp)
|
|
|
|
for {set i [llength $kids]} {[incr i -1] >= 0} {} {
|
|
|
|
set id [lindex $kids $i]
|
|
|
|
if {$id ne $nullid && $id ne $nullid2} {
|
|
|
|
return $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc vtokcmp {v a b} {
|
|
|
|
global varctok varcid
|
|
|
|
|
|
|
|
return [string compare [lindex $varctok($v) $varcid($v,$a)] \
|
|
|
|
[lindex $varctok($v) $varcid($v,$b)]]
|
|
|
|
}
|
|
|
|
|
2008-03-04 10:32:38 +00:00
|
|
|
# This assumes that if lim is not given, the caller has checked that
|
|
|
|
# arc a's token is less than $vtokmod($v)
|
2007-12-12 07:13:51 +00:00
|
|
|
proc modify_arc {v a {lim {}}} {
|
|
|
|
global varctok vtokmod varcmod varcrow vupptr curview vrowmod varccommits
|
2007-12-10 23:45:38 +00:00
|
|
|
|
2008-03-04 10:32:38 +00:00
|
|
|
if {$lim ne {}} {
|
|
|
|
set c [string compare [lindex $varctok($v) $a] $vtokmod($v)]
|
|
|
|
if {$c > 0} return
|
|
|
|
if {$c == 0} {
|
|
|
|
set r [lindex $varcrow($v) $a]
|
|
|
|
if {$r ne {} && $vrowmod($v) <= $r + $lim} return
|
|
|
|
}
|
|
|
|
}
|
2007-12-10 23:45:38 +00:00
|
|
|
set vtokmod($v) [lindex $varctok($v) $a]
|
|
|
|
set varcmod($v) $a
|
|
|
|
if {$v == $curview} {
|
|
|
|
while {$a != 0 && [lindex $varcrow($v) $a] eq {}} {
|
|
|
|
set a [lindex $vupptr($v) $a]
|
2007-12-12 07:13:51 +00:00
|
|
|
set lim {}
|
2007-12-10 23:45:38 +00:00
|
|
|
}
|
2007-12-12 07:13:51 +00:00
|
|
|
set r 0
|
|
|
|
if {$a != 0} {
|
|
|
|
if {$lim eq {}} {
|
|
|
|
set lim [llength $varccommits($v,$a)]
|
|
|
|
}
|
|
|
|
set r [expr {[lindex $varcrow($v) $a] + $lim}]
|
|
|
|
}
|
|
|
|
set vrowmod($v) $r
|
2007-12-11 09:09:53 +00:00
|
|
|
undolayout $r
|
2007-12-10 23:45:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc update_arcrows {v} {
|
2007-12-12 07:13:51 +00:00
|
|
|
global vtokmod varcmod vrowmod varcrow commitidx currentid selectedline
|
2007-12-18 22:35:33 +00:00
|
|
|
global varcid vrownum varcorder varcix varccommits
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global vupptr vdownptr vleftptr varctok
|
2007-12-18 22:35:33 +00:00
|
|
|
global displayorder parentlist curview cached_commitrow
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
2008-03-04 10:32:38 +00:00
|
|
|
if {$vrowmod($v) == $commitidx($v)} return
|
|
|
|
if {$v == $curview} {
|
|
|
|
if {[llength $displayorder] > $vrowmod($v)} {
|
|
|
|
set displayorder [lrange $displayorder 0 [expr {$vrowmod($v) - 1}]]
|
|
|
|
set parentlist [lrange $parentlist 0 [expr {$vrowmod($v) - 1}]]
|
|
|
|
}
|
|
|
|
catch {unset cached_commitrow}
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set narctot [expr {[llength $varctok($v)] - 1}]
|
|
|
|
set a $varcmod($v)
|
|
|
|
while {$a != 0 && [lindex $varcix($v) $a] eq {}} {
|
|
|
|
# go up the tree until we find something that has a row number,
|
|
|
|
# or we get to a seed
|
|
|
|
set a [lindex $vupptr($v) $a]
|
|
|
|
}
|
|
|
|
if {$a == 0} {
|
|
|
|
set a [lindex $vdownptr($v) 0]
|
|
|
|
if {$a == 0} return
|
|
|
|
set vrownum($v) {0}
|
|
|
|
set varcorder($v) [list $a]
|
|
|
|
lset varcix($v) $a 0
|
|
|
|
lset varcrow($v) $a 0
|
|
|
|
set arcn 0
|
|
|
|
set row 0
|
|
|
|
} else {
|
|
|
|
set arcn [lindex $varcix($v) $a]
|
|
|
|
if {[llength $vrownum($v)] > $arcn + 1} {
|
|
|
|
set vrownum($v) [lrange $vrownum($v) 0 $arcn]
|
|
|
|
set varcorder($v) [lrange $varcorder($v) 0 $arcn]
|
|
|
|
}
|
|
|
|
set row [lindex $varcrow($v) $a]
|
|
|
|
}
|
|
|
|
while {1} {
|
|
|
|
set p $a
|
|
|
|
incr row [llength $varccommits($v,$a)]
|
|
|
|
# go down if possible
|
|
|
|
set b [lindex $vdownptr($v) $a]
|
|
|
|
if {$b == 0} {
|
|
|
|
# if not, go left, or go up until we can go left
|
|
|
|
while {$a != 0} {
|
|
|
|
set b [lindex $vleftptr($v) $a]
|
|
|
|
if {$b != 0} break
|
|
|
|
set a [lindex $vupptr($v) $a]
|
|
|
|
}
|
|
|
|
if {$a == 0} break
|
|
|
|
}
|
|
|
|
set a $b
|
|
|
|
incr arcn
|
|
|
|
lappend vrownum($v) $row
|
|
|
|
lappend varcorder($v) $a
|
|
|
|
lset varcix($v) $a $arcn
|
|
|
|
lset varcrow($v) $a $row
|
|
|
|
}
|
2007-12-12 07:13:51 +00:00
|
|
|
set vtokmod($v) [lindex $varctok($v) $p]
|
|
|
|
set varcmod($v) $p
|
|
|
|
set vrowmod($v) $row
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[info exists currentid]} {
|
|
|
|
set selectedline [rowofcommit $currentid]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# Test whether view $v contains commit $id
|
|
|
|
proc commitinview {id v} {
|
|
|
|
global varcid
|
|
|
|
|
|
|
|
return [info exists varcid($v,$id)]
|
|
|
|
}
|
|
|
|
|
|
|
|
# Return the row number for commit $id in the current view
|
|
|
|
proc rowofcommit {id} {
|
|
|
|
global varcid varccommits varcrow curview cached_commitrow
|
2007-12-10 23:45:38 +00:00
|
|
|
global varctok vtokmod
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set v $curview
|
|
|
|
if {![info exists varcid($v,$id)]} {
|
|
|
|
puts "oops rowofcommit no arc for [shortids $id]"
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
set a $varcid($v,$id)
|
2007-12-26 12:03:43 +00:00
|
|
|
if {[string compare [lindex $varctok($v) $a] $vtokmod($v)] >= 0} {
|
2007-12-10 23:45:38 +00:00
|
|
|
update_arcrows $v
|
|
|
|
}
|
2007-12-30 11:41:14 +00:00
|
|
|
if {[info exists cached_commitrow($id)]} {
|
|
|
|
return $cached_commitrow($id)
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i [lsearch -exact $varccommits($v,$a) $id]
|
|
|
|
if {$i < 0} {
|
|
|
|
puts "oops didn't find commit [shortids $id] in arc $a"
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
incr i [lindex $varcrow($v) $a]
|
|
|
|
set cached_commitrow($id) $i
|
|
|
|
return $i
|
|
|
|
}
|
|
|
|
|
2008-01-01 22:59:39 +00:00
|
|
|
# Returns 1 if a is on an earlier row than b, otherwise 0
|
|
|
|
proc comes_before {a b} {
|
|
|
|
global varcid varctok curview
|
|
|
|
|
|
|
|
set v $curview
|
|
|
|
if {$a eq $b || ![info exists varcid($v,$a)] || \
|
|
|
|
![info exists varcid($v,$b)]} {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
if {$varcid($v,$a) != $varcid($v,$b)} {
|
|
|
|
return [expr {[string compare [lindex $varctok($v) $varcid($v,$a)] \
|
|
|
|
[lindex $varctok($v) $varcid($v,$b)]] < 0}]
|
|
|
|
}
|
|
|
|
return [expr {[rowofcommit $a] < [rowofcommit $b]}]
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc bsearch {l elt} {
|
|
|
|
if {[llength $l] == 0 || $elt <= [lindex $l 0]} {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
set lo 0
|
|
|
|
set hi [llength $l]
|
|
|
|
while {$hi - $lo > 1} {
|
|
|
|
set mid [expr {int(($lo + $hi) / 2)}]
|
|
|
|
set t [lindex $l $mid]
|
|
|
|
if {$elt < $t} {
|
|
|
|
set hi $mid
|
|
|
|
} elseif {$elt > $t} {
|
|
|
|
set lo $mid
|
|
|
|
} else {
|
|
|
|
return $mid
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return $lo
|
|
|
|
}
|
|
|
|
|
|
|
|
# Make sure rows $start..$end-1 are valid in displayorder and parentlist
|
|
|
|
proc make_disporder {start end} {
|
|
|
|
global vrownum curview commitidx displayorder parentlist
|
2007-12-12 07:13:51 +00:00
|
|
|
global varccommits varcorder parents vrowmod varcrow
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global d_valid_start d_valid_end
|
|
|
|
|
2007-12-12 07:13:51 +00:00
|
|
|
if {$end > $vrowmod($curview)} {
|
2007-12-10 23:45:38 +00:00
|
|
|
update_arcrows $curview
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set ai [bsearch $vrownum($curview) $start]
|
|
|
|
set start [lindex $vrownum($curview) $ai]
|
|
|
|
set narc [llength $vrownum($curview)]
|
|
|
|
for {set r $start} {$ai < $narc && $r < $end} {incr ai} {
|
|
|
|
set a [lindex $varcorder($curview) $ai]
|
|
|
|
set l [llength $displayorder]
|
|
|
|
set al [llength $varccommits($curview,$a)]
|
|
|
|
if {$l < $r + $al} {
|
|
|
|
if {$l < $r} {
|
|
|
|
set pad [ntimes [expr {$r - $l}] {}]
|
|
|
|
set displayorder [concat $displayorder $pad]
|
|
|
|
set parentlist [concat $parentlist $pad]
|
|
|
|
} elseif {$l > $r} {
|
|
|
|
set displayorder [lrange $displayorder 0 [expr {$r - 1}]]
|
|
|
|
set parentlist [lrange $parentlist 0 [expr {$r - 1}]]
|
|
|
|
}
|
|
|
|
foreach id $varccommits($curview,$a) {
|
|
|
|
lappend displayorder $id
|
|
|
|
lappend parentlist $parents($curview,$id)
|
|
|
|
}
|
2008-01-12 10:46:31 +00:00
|
|
|
} elseif {[lindex $displayorder [expr {$r + $al - 1}]] eq {}} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i $r
|
|
|
|
foreach id $varccommits($curview,$a) {
|
|
|
|
lset displayorder $i $id
|
|
|
|
lset parentlist $i $parents($curview,$id)
|
|
|
|
incr i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
incr r $al
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc commitonrow {row} {
|
|
|
|
global displayorder
|
|
|
|
|
|
|
|
set id [lindex $displayorder $row]
|
|
|
|
if {$id eq {}} {
|
|
|
|
make_disporder $row [expr {$row + 1}]
|
|
|
|
set id [lindex $displayorder $row]
|
|
|
|
}
|
|
|
|
return $id
|
|
|
|
}
|
|
|
|
|
|
|
|
proc closevarcs {v} {
|
|
|
|
global varctok varccommits varcid parents children
|
2007-12-10 23:45:38 +00:00
|
|
|
global cmitlisted commitidx commitinterest vtokmod
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
|
|
|
|
set missing_parents 0
|
|
|
|
set scripts {}
|
|
|
|
set narcs [llength $varctok($v)]
|
|
|
|
for {set a 1} {$a < $narcs} {incr a} {
|
|
|
|
set id [lindex $varccommits($v,$a) end]
|
|
|
|
foreach p $parents($v,$id) {
|
|
|
|
if {[info exists varcid($v,$p)]} continue
|
|
|
|
# add p as a new commit
|
|
|
|
incr missing_parents
|
|
|
|
set cmitlisted($v,$p) 0
|
|
|
|
set parents($v,$p) {}
|
|
|
|
if {[llength $children($v,$p)] == 1 &&
|
|
|
|
[llength $parents($v,$id)] == 1} {
|
|
|
|
set b $a
|
|
|
|
} else {
|
|
|
|
set b [newvarc $v $p]
|
|
|
|
}
|
|
|
|
set varcid($v,$p) $b
|
2007-12-10 23:45:38 +00:00
|
|
|
if {[string compare [lindex $varctok($v) $b] $vtokmod($v)] < 0} {
|
|
|
|
modify_arc $v $b
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
2007-12-12 07:13:51 +00:00
|
|
|
lappend varccommits($v,$b) $p
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
incr commitidx($v)
|
|
|
|
if {[info exists commitinterest($p)]} {
|
|
|
|
foreach script $commitinterest($p) {
|
|
|
|
lappend scripts [string map [list "%I" $p] $script]
|
|
|
|
}
|
|
|
|
unset commitinterest($id)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$missing_parents > 0} {
|
|
|
|
foreach s $scripts {
|
|
|
|
eval $s
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-02-24 01:16:56 +00:00
|
|
|
# Use $rwid as a substitute for $id, i.e. reparent $id's children to $rwid
|
|
|
|
# Assumes we already have an arc for $rwid.
|
|
|
|
proc rewrite_commit {v id rwid} {
|
|
|
|
global children parents varcid varctok vtokmod varccommits
|
|
|
|
|
|
|
|
foreach ch $children($v,$id) {
|
|
|
|
# make $rwid be $ch's parent in place of $id
|
|
|
|
set i [lsearch -exact $parents($v,$ch) $id]
|
|
|
|
if {$i < 0} {
|
|
|
|
puts "oops rewrite_commit didn't find $id in parent list for $ch"
|
|
|
|
}
|
|
|
|
set parents($v,$ch) [lreplace $parents($v,$ch) $i $i $rwid]
|
|
|
|
# add $ch to $rwid's children and sort the list if necessary
|
|
|
|
if {[llength [lappend children($v,$rwid) $ch]] > 1} {
|
|
|
|
set children($v,$rwid) [lsort -command [list vtokcmp $v] \
|
|
|
|
$children($v,$rwid)]
|
|
|
|
}
|
|
|
|
# fix the graph after joining $id to $rwid
|
|
|
|
set a $varcid($v,$ch)
|
|
|
|
fix_reversal $rwid $a $v
|
2008-03-04 10:32:38 +00:00
|
|
|
# parentlist is wrong for the last element of arc $a
|
|
|
|
# even if displayorder is right, hence the 3rd arg here
|
|
|
|
modify_arc $v $a [expr {[llength $varccommits($v,$a)] - 1}]
|
2008-02-24 01:16:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc getcommitlines {fd inst view updating} {
|
2007-12-18 22:35:33 +00:00
|
|
|
global cmitlisted commitinterest leftover
|
2008-04-26 06:00:00 +00:00
|
|
|
global commitidx commitdata vdatemode
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global parents children curview hlview
|
2008-03-02 23:19:35 +00:00
|
|
|
global idpending ordertok
|
2008-04-26 06:00:00 +00:00
|
|
|
global varccommits varcid varctok vtokmod vfilelimit
|
2005-06-16 00:27:23 +00:00
|
|
|
|
2006-08-16 10:02:32 +00:00
|
|
|
set stuff [read $fd 500000]
|
2007-07-26 12:36:39 +00:00
|
|
|
# git log doesn't terminate the last commit with a null...
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$stuff == {} && $leftover($inst) ne {} && [eof $fd]} {
|
2007-07-26 12:36:39 +00:00
|
|
|
set stuff "\0"
|
|
|
|
}
|
2005-06-22 00:25:38 +00:00
|
|
|
if {$stuff == {}} {
|
2007-06-17 04:45:00 +00:00
|
|
|
if {![eof $fd]} {
|
|
|
|
return 1
|
|
|
|
}
|
2008-05-11 12:13:02 +00:00
|
|
|
global commfd viewcomplete viewactive viewname
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global viewinstances
|
|
|
|
unset commfd($inst)
|
|
|
|
set i [lsearch -exact $viewinstances($view) $inst]
|
|
|
|
if {$i >= 0} {
|
|
|
|
set viewinstances($view) [lreplace $viewinstances($view) $i $i]
|
2007-08-23 09:35:51 +00:00
|
|
|
}
|
2005-07-18 18:29:03 +00:00
|
|
|
# set it blocking so we wait for the process to terminate
|
2006-05-02 01:15:29 +00:00
|
|
|
fconfigure $fd -blocking 1
|
2006-05-02 23:32:53 +00:00
|
|
|
if {[catch {close $fd} err]} {
|
|
|
|
set fv {}
|
|
|
|
if {$view != $curview} {
|
|
|
|
set fv " for the \"$viewname($view)\" view"
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
2006-05-02 23:32:53 +00:00
|
|
|
if {[string range $err 0 4] == "usage"} {
|
|
|
|
set err "Gitk: error reading commits$fv:\
|
2008-03-04 10:14:17 +00:00
|
|
|
bad arguments to git log."
|
2006-05-02 23:32:53 +00:00
|
|
|
if {$viewname($view) eq "Command line"} {
|
|
|
|
append err \
|
2008-03-04 10:14:17 +00:00
|
|
|
" (Note: arguments to gitk are passed to git log\
|
2006-05-02 23:32:53 +00:00
|
|
|
to allow selection of commits to be displayed.)"
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set err "Error reading commits$fv: $err"
|
|
|
|
}
|
|
|
|
error_popup $err
|
2005-05-15 12:55:47 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[incr viewactive($view) -1] <= 0} {
|
|
|
|
set viewcomplete($view) 1
|
|
|
|
# Check if we have seen any ids listed as parents that haven't
|
|
|
|
# appeared in the list
|
|
|
|
closevarcs $view
|
|
|
|
notbusy $view
|
|
|
|
}
|
2006-05-02 23:32:53 +00:00
|
|
|
if {$view == $curview} {
|
2008-03-02 23:11:08 +00:00
|
|
|
run chewcommits
|
2005-05-12 23:46:16 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2005-05-12 23:46:16 +00:00
|
|
|
}
|
2005-06-22 00:25:38 +00:00
|
|
|
set start 0
|
2006-02-28 11:10:19 +00:00
|
|
|
set gotsome 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set scripts {}
|
2005-06-22 00:25:38 +00:00
|
|
|
while 1 {
|
|
|
|
set i [string first "\0" $stuff $start]
|
|
|
|
if {$i < 0} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
append leftover($inst) [string range $stuff $start end]
|
2006-02-19 11:44:47 +00:00
|
|
|
break
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
2005-06-22 00:25:38 +00:00
|
|
|
if {$start == 0} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set cmit $leftover($inst)
|
2006-02-28 11:10:19 +00:00
|
|
|
append cmit [string range $stuff 0 [expr {$i - 1}]]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set leftover($inst) {}
|
2006-02-28 11:10:19 +00:00
|
|
|
} else {
|
|
|
|
set cmit [string range $stuff $start [expr {$i - 1}]]
|
2005-06-22 00:25:38 +00:00
|
|
|
}
|
|
|
|
set start [expr {$i + 1}]
|
2005-08-18 10:40:39 +00:00
|
|
|
set j [string first "\n" $cmit]
|
|
|
|
set ok 0
|
2006-03-30 07:43:51 +00:00
|
|
|
set listed 1
|
2007-07-09 12:45:47 +00:00
|
|
|
if {$j >= 0 && [string match "commit *" $cmit]} {
|
|
|
|
set ids [string range $cmit 7 [expr {$j - 1}]]
|
2008-02-09 22:02:07 +00:00
|
|
|
if {[string match {[-^<>]*} $ids]} {
|
2007-07-09 12:45:47 +00:00
|
|
|
switch -- [string index $ids 0] {
|
|
|
|
"-" {set listed 0}
|
2008-02-09 22:02:07 +00:00
|
|
|
"^" {set listed 2}
|
|
|
|
"<" {set listed 3}
|
|
|
|
">" {set listed 4}
|
2007-07-09 12:45:47 +00:00
|
|
|
}
|
2006-03-30 07:43:51 +00:00
|
|
|
set ids [string range $ids 1 end]
|
|
|
|
}
|
2005-08-18 10:40:39 +00:00
|
|
|
set ok 1
|
|
|
|
foreach id $ids {
|
2006-02-28 11:10:19 +00:00
|
|
|
if {[string length $id] != 40} {
|
2005-08-18 10:40:39 +00:00
|
|
|
set ok 0
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {!$ok} {
|
2005-06-27 10:04:26 +00:00
|
|
|
set shortcmit $cmit
|
|
|
|
if {[string length $shortcmit] > 80} {
|
|
|
|
set shortcmit "[string range $shortcmit 0 80]..."
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Can't parse git log output:"] {$shortcmit}"
|
2005-06-22 00:25:38 +00:00
|
|
|
exit 1
|
|
|
|
}
|
2005-08-18 10:40:39 +00:00
|
|
|
set id [lindex $ids 0]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set vid $view,$id
|
2008-02-24 01:16:56 +00:00
|
|
|
|
|
|
|
if {!$listed && $updating && ![info exists varcid($vid)] &&
|
2008-04-26 06:00:00 +00:00
|
|
|
$vfilelimit($view) ne {}} {
|
2008-02-24 01:16:56 +00:00
|
|
|
# git log doesn't rewrite parents for unlisted commits
|
|
|
|
# when doing path limiting, so work around that here
|
|
|
|
# by working out the rewritten parent with git rev-list
|
|
|
|
# and if we already know about it, using the rewritten
|
|
|
|
# parent as a substitute parent for $id's children.
|
|
|
|
if {![catch {
|
|
|
|
set rwid [exec git rev-list --first-parent --max-count=1 \
|
2008-04-26 06:00:00 +00:00
|
|
|
$id -- $vfilelimit($view)]
|
2008-02-24 01:16:56 +00:00
|
|
|
}]} {
|
|
|
|
if {$rwid ne {} && [info exists varcid($view,$rwid)]} {
|
|
|
|
# use $rwid in place of $id
|
|
|
|
rewrite_commit $view $id $rwid
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-02-16 06:47:31 +00:00
|
|
|
set a 0
|
|
|
|
if {[info exists varcid($vid)]} {
|
|
|
|
if {$cmitlisted($vid) || !$listed} continue
|
|
|
|
set a $varcid($vid)
|
|
|
|
}
|
2006-03-30 07:43:51 +00:00
|
|
|
if {$listed} {
|
|
|
|
set olds [lrange $ids 1 end]
|
|
|
|
} else {
|
|
|
|
set olds {}
|
|
|
|
}
|
2006-03-17 23:04:48 +00:00
|
|
|
set commitdata($id) [string range $cmit [expr {$j + 1}] end]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set cmitlisted($vid) $listed
|
|
|
|
set parents($vid) $olds
|
|
|
|
if {![info exists children($vid)]} {
|
|
|
|
set children($vid) {}
|
2008-02-16 06:47:31 +00:00
|
|
|
} elseif {$a == 0 && [llength $children($vid)] == 1} {
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
set k [lindex $children($vid) 0]
|
|
|
|
if {[llength $parents($view,$k)] == 1 &&
|
2008-04-26 06:00:00 +00:00
|
|
|
(!$vdatemode($view) ||
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
$varcid($view,$k) == [llength $varctok($view)] - 1)} {
|
|
|
|
set a $varcid($view,$k)
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$a == 0} {
|
|
|
|
# new arc
|
|
|
|
set a [newvarc $view $id]
|
|
|
|
}
|
2007-12-12 07:13:51 +00:00
|
|
|
if {[string compare [lindex $varctok($view) $a] $vtokmod($view)] < 0} {
|
|
|
|
modify_arc $view $a
|
|
|
|
}
|
2008-02-16 06:47:31 +00:00
|
|
|
if {![info exists varcid($vid)]} {
|
|
|
|
set varcid($vid) $a
|
|
|
|
lappend varccommits($view,$a) $id
|
|
|
|
incr commitidx($view)
|
|
|
|
}
|
2007-12-12 07:13:51 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set i 0
|
|
|
|
foreach p $olds {
|
|
|
|
if {$i == 0 || [lsearch -exact $olds $p] >= $i} {
|
|
|
|
set vp $view,$p
|
|
|
|
if {[llength [lappend children($vp) $id]] > 1 &&
|
|
|
|
[vtokcmp $view [lindex $children($vp) end-1] $id] > 0} {
|
|
|
|
set children($vp) [lsort -command [list vtokcmp $view] \
|
|
|
|
$children($vp)]
|
2007-12-10 23:45:38 +00:00
|
|
|
catch {unset ordertok}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
gitk: Implement date mode in the new framework
This restores date mode, which lists commits by date, as far as possible
given the constraint that parents come after all their children. To
implement this in the new framework, we (1) only join a new commit onto
an existing arc if the arc is the last arc created, (2) treat arcs as
seeds unless they have a child arc that comes later, and (3) never
decrease the token value for an arc.
This means we get lots of "seeds", which exposed some quadratic behaviour
in adding and removing seeds. To fix this, we add a vbackptr array, which
points to the arc whose vleftptr entry points to us, and a vlastins array,
which shows where in an arc's vdownptr/vleftptr list we last inserted a
parent, which acts as a hint of a good place to start looking for where to
insert a new child.
This also ensures the children array elements stay in sorted order at all
times. We weren't resorting the children lists when reassigning tokens
in renumbervarc. Since the children lists are now always sorted, we don't
have to search through all elements to find the one with the highest token;
we can just use the last element.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-19 23:03:35 +00:00
|
|
|
if {[info exists varcid($view,$p)]} {
|
|
|
|
fix_reversal $p $a $view
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
}
|
|
|
|
incr i
|
|
|
|
}
|
|
|
|
|
2007-09-14 23:33:39 +00:00
|
|
|
if {[info exists commitinterest($id)]} {
|
|
|
|
foreach script $commitinterest($id) {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
lappend scripts [string map [list "%I" $id] $script]
|
2007-09-14 23:33:39 +00:00
|
|
|
}
|
|
|
|
unset commitinterest($id)
|
|
|
|
}
|
2006-02-28 11:10:19 +00:00
|
|
|
set gotsome 1
|
|
|
|
}
|
|
|
|
if {$gotsome} {
|
2008-03-02 23:11:08 +00:00
|
|
|
global numcommits hlview
|
|
|
|
|
|
|
|
if {$view == $curview} {
|
|
|
|
set numcommits $commitidx($view)
|
|
|
|
run chewcommits
|
|
|
|
}
|
|
|
|
if {[info exists hlview] && $view == $hlview} {
|
|
|
|
# we never actually get here...
|
|
|
|
run vhighlightmore
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
foreach s $scripts {
|
|
|
|
eval $s
|
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 2
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
|
|
|
|
2008-03-02 23:11:08 +00:00
|
|
|
proc chewcommits {} {
|
2007-09-04 16:19:56 +00:00
|
|
|
global curview hlview viewcomplete
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global pending_select
|
2007-06-17 04:45:00 +00:00
|
|
|
|
2008-03-02 23:11:08 +00:00
|
|
|
layoutmore
|
|
|
|
if {$viewcomplete($curview)} {
|
|
|
|
global commitidx varctok
|
|
|
|
global numcommits startmsecs
|
|
|
|
|
|
|
|
if {[info exists pending_select]} {
|
|
|
|
set row [first_real_row]
|
|
|
|
selectline $row 1
|
2007-06-17 04:45:00 +00:00
|
|
|
}
|
2008-03-02 23:11:08 +00:00
|
|
|
if {$commitidx($curview) > 0} {
|
|
|
|
#set ms [expr {[clock clicks -milliseconds] - $startmsecs}]
|
|
|
|
#puts "overall $ms ms for $numcommits commits"
|
|
|
|
#puts "[llength $varctok($view)] arcs, $commitidx($view) commits"
|
|
|
|
} else {
|
|
|
|
show_status [mc "No commits selected"]
|
|
|
|
}
|
|
|
|
notbusy layout
|
2005-08-10 23:56:23 +00:00
|
|
|
}
|
2007-09-04 16:19:56 +00:00
|
|
|
return 0
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc readcommit {id} {
|
2006-05-24 07:57:40 +00:00
|
|
|
if {[catch {set contents [exec git cat-file commit $id]}]} return
|
2006-02-28 11:10:19 +00:00
|
|
|
parsecommit $id $contents 0
|
2005-06-22 00:25:38 +00:00
|
|
|
}
|
|
|
|
|
2006-02-28 11:10:19 +00:00
|
|
|
proc parsecommit {id contents listed} {
|
2005-11-29 21:15:51 +00:00
|
|
|
global commitinfo cdate
|
|
|
|
|
|
|
|
set inhdr 1
|
|
|
|
set comment {}
|
|
|
|
set headline {}
|
|
|
|
set auname {}
|
|
|
|
set audate {}
|
|
|
|
set comname {}
|
|
|
|
set comdate {}
|
2005-11-14 23:34:03 +00:00
|
|
|
set hdrend [string first "\n\n" $contents]
|
|
|
|
if {$hdrend < 0} {
|
|
|
|
# should never happen...
|
|
|
|
set hdrend [string length $contents]
|
|
|
|
}
|
|
|
|
set header [string range $contents 0 [expr {$hdrend - 1}]]
|
|
|
|
set comment [string range $contents [expr {$hdrend + 2}] end]
|
|
|
|
foreach line [split $header "\n"] {
|
|
|
|
set tag [lindex $line 0]
|
|
|
|
if {$tag == "author"} {
|
|
|
|
set audate [lindex $line end-1]
|
|
|
|
set auname [lrange $line 1 end-2]
|
|
|
|
} elseif {$tag == "committer"} {
|
|
|
|
set comdate [lindex $line end-1]
|
|
|
|
set comname [lrange $line 1 end-2]
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
}
|
2005-11-14 23:34:03 +00:00
|
|
|
set headline {}
|
2006-09-27 00:56:02 +00:00
|
|
|
# take the first non-blank line of the comment as the headline
|
|
|
|
set headline [string trimleft $comment]
|
|
|
|
set i [string first "\n" $headline]
|
2005-11-14 23:34:03 +00:00
|
|
|
if {$i >= 0} {
|
2006-09-27 00:56:02 +00:00
|
|
|
set headline [string range $headline 0 $i]
|
|
|
|
}
|
|
|
|
set headline [string trimright $headline]
|
|
|
|
set i [string first "\r" $headline]
|
|
|
|
if {$i >= 0} {
|
|
|
|
set headline [string trimright [string range $headline 0 $i]]
|
2005-11-14 23:34:03 +00:00
|
|
|
}
|
|
|
|
if {!$listed} {
|
2008-03-04 10:14:17 +00:00
|
|
|
# git log indents the comment by 4 spaces;
|
2006-05-24 07:57:40 +00:00
|
|
|
# if we got this via git cat-file, add the indentation
|
2005-11-14 23:34:03 +00:00
|
|
|
set newcomment {}
|
|
|
|
foreach line [split $comment "\n"] {
|
|
|
|
append newcomment " "
|
|
|
|
append newcomment $line
|
2005-11-20 12:08:22 +00:00
|
|
|
append newcomment "\n"
|
2005-11-14 23:34:03 +00:00
|
|
|
}
|
|
|
|
set comment $newcomment
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
if {$comdate != {}} {
|
2005-05-31 12:14:42 +00:00
|
|
|
set cdate($id) $comdate
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
2005-05-11 23:44:54 +00:00
|
|
|
set commitinfo($id) [list $headline $auname $audate \
|
|
|
|
$comname $comdate $comment]
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
|
2006-03-17 23:04:48 +00:00
|
|
|
proc getcommit {id} {
|
2006-04-02 10:47:40 +00:00
|
|
|
global commitdata commitinfo
|
2006-03-02 11:56:44 +00:00
|
|
|
|
2006-03-17 23:04:48 +00:00
|
|
|
if {[info exists commitdata($id)]} {
|
|
|
|
parsecommit $id $commitdata($id) 1
|
2006-03-02 11:56:44 +00:00
|
|
|
} else {
|
|
|
|
readcommit $id
|
|
|
|
if {![info exists commitinfo($id)]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
set commitinfo($id) [list [mc "No commit information available"]]
|
2006-03-02 11:56:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
|
2005-05-21 07:35:37 +00:00
|
|
|
proc readrefs {} {
|
2006-09-11 00:36:53 +00:00
|
|
|
global tagids idtags headids idheads tagobjid
|
2006-09-07 00:21:39 +00:00
|
|
|
global otherrefids idotherrefs mainhead mainheadid
|
2005-08-19 13:11:39 +00:00
|
|
|
|
2005-11-29 21:15:51 +00:00
|
|
|
foreach v {tagids idtags headids idheads otherrefids idotherrefs} {
|
|
|
|
catch {unset $v}
|
|
|
|
}
|
2006-09-11 00:36:53 +00:00
|
|
|
set refd [open [list | git show-ref -d] r]
|
|
|
|
while {[gets $refd line] >= 0} {
|
|
|
|
if {[string index $line 40] ne " "} continue
|
|
|
|
set id [string range $line 0 39]
|
|
|
|
set ref [string range $line 41 end]
|
|
|
|
if {![string match "refs/*" $ref]} continue
|
|
|
|
set name [string range $ref 5 end]
|
|
|
|
if {[string match "remotes/*" $name]} {
|
|
|
|
if {![string match "*/HEAD" $name]} {
|
|
|
|
set headids($name) $id
|
|
|
|
lappend idheads($id) $name
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
2006-09-11 00:36:53 +00:00
|
|
|
} elseif {[string match "heads/*" $name]} {
|
|
|
|
set name [string range $name 6 end]
|
2005-11-19 07:54:17 +00:00
|
|
|
set headids($name) $id
|
|
|
|
lappend idheads($id) $name
|
2006-09-11 00:36:53 +00:00
|
|
|
} elseif {[string match "tags/*" $name]} {
|
|
|
|
# this lets refs/tags/foo^{} overwrite refs/tags/foo,
|
|
|
|
# which is what we want since the former is the commit ID
|
|
|
|
set name [string range $name 5 end]
|
|
|
|
if {[string match "*^{}" $name]} {
|
|
|
|
set name [string range $name 0 end-3]
|
|
|
|
} else {
|
|
|
|
set tagobjid($name) $id
|
|
|
|
}
|
|
|
|
set tagids($name) $id
|
|
|
|
lappend idtags($id) $name
|
2005-11-19 07:54:17 +00:00
|
|
|
} else {
|
|
|
|
set otherrefids($name) $id
|
|
|
|
lappend idotherrefs($id) $name
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
|
|
|
}
|
2007-07-29 20:28:40 +00:00
|
|
|
catch {close $refd}
|
2006-07-06 00:21:23 +00:00
|
|
|
set mainhead {}
|
2006-09-07 00:21:39 +00:00
|
|
|
set mainheadid {}
|
2006-07-06 00:21:23 +00:00
|
|
|
catch {
|
2008-05-26 00:11:33 +00:00
|
|
|
set mainheadid [exec git rev-parse HEAD]
|
2006-07-06 00:21:23 +00:00
|
|
|
set thehead [exec git symbolic-ref HEAD]
|
|
|
|
if {[string match "refs/heads/*" $thehead]} {
|
|
|
|
set mainhead [string range $thehead 11 end]
|
|
|
|
}
|
|
|
|
}
|
2005-05-21 07:35:37 +00:00
|
|
|
}
|
|
|
|
|
2007-07-13 09:49:37 +00:00
|
|
|
# skip over fake commits
|
|
|
|
proc first_real_row {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global nullid nullid2 numcommits
|
2007-07-13 09:49:37 +00:00
|
|
|
|
|
|
|
for {set row 0} {$row < $numcommits} {incr row} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set id [commitonrow $row]
|
2007-07-13 09:49:37 +00:00
|
|
|
if {$id ne $nullid && $id ne $nullid2} {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return $row
|
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# update things for a head moved to a child of its previous location
|
|
|
|
proc movehead {id name} {
|
|
|
|
global headids idheads
|
|
|
|
|
|
|
|
removehead $headids($name) $name
|
|
|
|
set headids($name) $id
|
|
|
|
lappend idheads($id) $name
|
|
|
|
}
|
|
|
|
|
|
|
|
# update things when a head has been removed
|
|
|
|
proc removehead {id name} {
|
|
|
|
global headids idheads
|
|
|
|
|
|
|
|
if {$idheads($id) eq $name} {
|
|
|
|
unset idheads($id)
|
|
|
|
} else {
|
|
|
|
set i [lsearch -exact $idheads($id) $name]
|
|
|
|
if {$i >= 0} {
|
|
|
|
set idheads($id) [lreplace $idheads($id) $i $i]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
unset headids($name)
|
|
|
|
}
|
|
|
|
|
2006-05-26 12:34:30 +00:00
|
|
|
proc show_error {w top msg} {
|
2005-05-17 23:23:07 +00:00
|
|
|
message $w.m -text $msg -justify center -aspect 400
|
|
|
|
pack $w.m -side top -fill x -padx 20 -pady 20
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.ok -text [mc OK] -command "destroy $top"
|
2005-05-17 23:23:07 +00:00
|
|
|
pack $w.ok -side bottom -fill x
|
2006-05-26 12:34:30 +00:00
|
|
|
bind $top <Visibility> "grab $top; focus $top"
|
|
|
|
bind $top <Key-Return> "destroy $top"
|
|
|
|
tkwait window $top
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
|
2006-05-02 23:32:53 +00:00
|
|
|
proc error_popup msg {
|
|
|
|
set w .error
|
|
|
|
toplevel $w
|
|
|
|
wm transient $w .
|
2006-05-26 12:34:30 +00:00
|
|
|
show_error $w $w $msg
|
2006-05-02 23:32:53 +00:00
|
|
|
}
|
|
|
|
|
2006-08-01 23:52:01 +00:00
|
|
|
proc confirm_popup msg {
|
|
|
|
global confirm_ok
|
|
|
|
set confirm_ok 0
|
|
|
|
set w .confirm
|
|
|
|
toplevel $w
|
|
|
|
wm transient $w .
|
|
|
|
message $w.m -text $msg -justify center -aspect 400
|
|
|
|
pack $w.m -side top -fill x -padx 20 -pady 20
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.ok -text [mc OK] -command "set confirm_ok 1; destroy $w"
|
2006-08-01 23:52:01 +00:00
|
|
|
pack $w.ok -side left -fill x
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.cancel -text [mc Cancel] -command "destroy $w"
|
2006-08-01 23:52:01 +00:00
|
|
|
pack $w.cancel -side right -fill x
|
|
|
|
bind $w <Visibility> "grab $w; focus $w"
|
|
|
|
tkwait window $w
|
|
|
|
return $confirm_ok
|
|
|
|
}
|
|
|
|
|
2008-01-06 04:54:46 +00:00
|
|
|
proc setoptions {} {
|
|
|
|
option add *Panedwindow.showHandle 1 startupFile
|
|
|
|
option add *Panedwindow.sashRelief raised startupFile
|
|
|
|
option add *Button.font uifont startupFile
|
|
|
|
option add *Checkbutton.font uifont startupFile
|
|
|
|
option add *Radiobutton.font uifont startupFile
|
|
|
|
option add *Menu.font uifont startupFile
|
|
|
|
option add *Menubutton.font uifont startupFile
|
|
|
|
option add *Label.font uifont startupFile
|
|
|
|
option add *Message.font uifont startupFile
|
|
|
|
option add *Entry.font uifont startupFile
|
|
|
|
}
|
|
|
|
|
2006-04-06 00:18:23 +00:00
|
|
|
proc makewindow {} {
|
2007-12-30 11:41:14 +00:00
|
|
|
global canv canv2 canv3 linespc charspc ctext cflist cscroll
|
2007-10-04 12:27:13 +00:00
|
|
|
global tabstop
|
2005-07-16 11:46:13 +00:00
|
|
|
global findtype findtypemenu findloc findstring fstring geometry
|
2005-05-21 07:35:37 +00:00
|
|
|
global entries sha1entry sha1string sha1but
|
2007-08-12 10:05:46 +00:00
|
|
|
global diffcontextstring diffcontext
|
2008-01-17 22:42:55 +00:00
|
|
|
global ignorespace
|
2005-08-07 05:27:57 +00:00
|
|
|
global maincursor textcursor curtextcursor
|
2006-09-07 00:21:39 +00:00
|
|
|
global rowctxmenu fakerowmenu mergemax wrapcomment
|
2006-05-26 00:43:47 +00:00
|
|
|
global highlight_files gdttype
|
2006-05-24 00:16:03 +00:00
|
|
|
global searchstring sstring
|
2007-05-20 16:12:48 +00:00
|
|
|
global bgcolor fgcolor bglist fglist diffcolors selectbgcolor
|
2007-09-27 01:00:25 +00:00
|
|
|
global headctxmenu progresscanv progressitem progresscoords statusw
|
|
|
|
global fprogitem fprogcoord lastprogupdate progupdatepending
|
2008-05-11 12:13:02 +00:00
|
|
|
global rprogitem rprogcoord rownumsel numcommits
|
2007-09-28 11:27:39 +00:00
|
|
|
global have_tk85
|
2005-05-12 23:46:16 +00:00
|
|
|
|
|
|
|
menu .bar
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar add cascade -label [mc "File"] -menu .bar.file
|
2005-05-12 23:46:16 +00:00
|
|
|
menu .bar.file
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.file add command -label [mc "Update"] -command updatecommits
|
2007-12-19 23:25:50 +00:00
|
|
|
.bar.file add command -label [mc "Reload"] -command reloadcommits
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.file add command -label [mc "Reread references"] -command rereadrefs
|
|
|
|
.bar.file add command -label [mc "List references"] -command showrefs
|
|
|
|
.bar.file add command -label [mc "Quit"] -command doquit
|
2005-11-29 22:28:16 +00:00
|
|
|
menu .bar.edit
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar add cascade -label [mc "Edit"] -menu .bar.edit
|
|
|
|
.bar.edit add command -label [mc "Preferences"] -command doprefs
|
2006-05-02 01:15:29 +00:00
|
|
|
|
2008-01-06 04:54:46 +00:00
|
|
|
menu .bar.view
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar add cascade -label [mc "View"] -menu .bar.view
|
|
|
|
.bar.view add command -label [mc "New view..."] -command {newview 0}
|
|
|
|
.bar.view add command -label [mc "Edit view..."] -command editview \
|
2006-05-02 01:15:29 +00:00
|
|
|
-state disabled
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.view add command -label [mc "Delete view"] -command delview -state disabled
|
2006-04-04 00:16:22 +00:00
|
|
|
.bar.view add separator
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.view add radiobutton -label [mc "All files"] -command {showview 0} \
|
2006-04-25 07:12:46 +00:00
|
|
|
-variable selectedview -value 0
|
2007-02-01 13:44:46 +00:00
|
|
|
|
2005-05-12 23:46:16 +00:00
|
|
|
menu .bar.help
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar add cascade -label [mc "Help"] -menu .bar.help
|
|
|
|
.bar.help add command -label [mc "About gitk"] -command about
|
|
|
|
.bar.help add command -label [mc "Key bindings"] -command keys
|
2008-01-06 04:54:46 +00:00
|
|
|
.bar.help configure
|
2005-05-12 23:46:16 +00:00
|
|
|
. configure -menu .bar
|
|
|
|
|
2007-02-01 13:46:38 +00:00
|
|
|
# the gui has upper and lower half, parts of a paned window.
|
2005-05-10 00:23:42 +00:00
|
|
|
panedwindow .ctop -orient vertical
|
2007-02-01 13:46:38 +00:00
|
|
|
|
|
|
|
# possibly use assumed geometry
|
2007-02-13 00:19:34 +00:00
|
|
|
if {![info exists geometry(pwsash0)]} {
|
2007-02-01 13:46:38 +00:00
|
|
|
set geometry(topheight) [expr {15 * $linespc}]
|
|
|
|
set geometry(topwidth) [expr {80 * $charspc}]
|
|
|
|
set geometry(botheight) [expr {15 * $linespc}]
|
|
|
|
set geometry(botwidth) [expr {50 * $charspc}]
|
2007-02-13 00:19:34 +00:00
|
|
|
set geometry(pwsash0) "[expr {40 * $charspc}] 2"
|
|
|
|
set geometry(pwsash1) "[expr {60 * $charspc}] 2"
|
2007-02-01 13:46:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
# the upper half will have a paned window, a scroll bar to the right, and some stuff below
|
|
|
|
frame .tf -height $geometry(topheight) -width $geometry(topwidth)
|
|
|
|
frame .tf.histframe
|
|
|
|
panedwindow .tf.histframe.pwclist -orient horizontal -sashpad 0 -handlesize 4
|
|
|
|
|
|
|
|
# create three canvases
|
|
|
|
set cscroll .tf.histframe.csb
|
|
|
|
set canv .tf.histframe.pwclist.canv
|
2007-02-13 00:19:34 +00:00
|
|
|
canvas $canv \
|
2007-05-20 16:12:48 +00:00
|
|
|
-selectbackground $selectbgcolor \
|
2006-07-05 12:56:37 +00:00
|
|
|
-background $bgcolor -bd 0 \
|
2006-02-19 11:44:47 +00:00
|
|
|
-yscrollincr $linespc -yscrollcommand "scrollcanv $cscroll"
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.histframe.pwclist add $canv
|
|
|
|
set canv2 .tf.histframe.pwclist.canv2
|
2007-02-13 00:19:34 +00:00
|
|
|
canvas $canv2 \
|
2007-05-20 16:12:48 +00:00
|
|
|
-selectbackground $selectbgcolor \
|
2006-07-05 12:56:37 +00:00
|
|
|
-background $bgcolor -bd 0 -yscrollincr $linespc
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.histframe.pwclist add $canv2
|
|
|
|
set canv3 .tf.histframe.pwclist.canv3
|
2007-02-13 00:19:34 +00:00
|
|
|
canvas $canv3 \
|
2007-05-20 16:12:48 +00:00
|
|
|
-selectbackground $selectbgcolor \
|
2006-07-05 12:56:37 +00:00
|
|
|
-background $bgcolor -bd 0 -yscrollincr $linespc
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.histframe.pwclist add $canv3
|
2007-02-13 00:19:34 +00:00
|
|
|
eval .tf.histframe.pwclist sash place 0 $geometry(pwsash0)
|
|
|
|
eval .tf.histframe.pwclist sash place 1 $geometry(pwsash1)
|
2007-02-01 13:46:38 +00:00
|
|
|
|
|
|
|
# a scroll bar to rule them
|
|
|
|
scrollbar $cscroll -command {allcanvs yview} -highlightthickness 0
|
|
|
|
pack $cscroll -side right -fill y
|
|
|
|
bind .tf.histframe.pwclist <Configure> {resizeclistpanes %W %w}
|
2006-07-05 12:56:37 +00:00
|
|
|
lappend bglist $canv $canv2 $canv3
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .tf.histframe.pwclist -fill both -expand 1 -side left
|
2005-05-15 05:56:51 +00:00
|
|
|
|
2007-02-01 13:46:38 +00:00
|
|
|
# we have two button bars at bottom of top frame. Bar 1
|
|
|
|
frame .tf.bar
|
|
|
|
frame .tf.lbar -height 15
|
|
|
|
|
|
|
|
set sha1entry .tf.bar.sha1
|
2005-05-21 07:35:37 +00:00
|
|
|
set entries $sha1entry
|
2007-02-01 13:46:38 +00:00
|
|
|
set sha1but .tf.bar.sha1label
|
2007-11-07 17:42:55 +00:00
|
|
|
button $sha1but -text [mc "SHA1 ID: "] -state disabled -relief flat \
|
2008-01-06 04:54:46 +00:00
|
|
|
-command gotocommit -width 8
|
2005-05-21 07:35:37 +00:00
|
|
|
$sha1but conf -disabledforeground [$sha1but cget -foreground]
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .tf.bar.sha1label -side left
|
2007-10-04 12:27:13 +00:00
|
|
|
entry $sha1entry -width 40 -font textfont -textvariable sha1string
|
2005-05-21 07:35:37 +00:00
|
|
|
trace add variable sha1string write sha1change
|
2005-05-15 05:56:51 +00:00
|
|
|
pack $sha1entry -side left -pady 2
|
2005-08-06 12:06:06 +00:00
|
|
|
|
|
|
|
image create bitmap bm-left -data {
|
|
|
|
#define left_width 16
|
|
|
|
#define left_height 16
|
|
|
|
static unsigned char left_bits[] = {
|
|
|
|
0x00, 0x00, 0xc0, 0x01, 0xe0, 0x00, 0x70, 0x00, 0x38, 0x00, 0x1c, 0x00,
|
|
|
|
0x0e, 0x00, 0xff, 0x7f, 0xff, 0x7f, 0xff, 0x7f, 0x0e, 0x00, 0x1c, 0x00,
|
|
|
|
0x38, 0x00, 0x70, 0x00, 0xe0, 0x00, 0xc0, 0x01};
|
|
|
|
}
|
|
|
|
image create bitmap bm-right -data {
|
|
|
|
#define right_width 16
|
|
|
|
#define right_height 16
|
|
|
|
static unsigned char right_bits[] = {
|
|
|
|
0x00, 0x00, 0xc0, 0x01, 0x80, 0x03, 0x00, 0x07, 0x00, 0x0e, 0x00, 0x1c,
|
|
|
|
0x00, 0x38, 0xff, 0x7f, 0xff, 0x7f, 0xff, 0x7f, 0x00, 0x38, 0x00, 0x1c,
|
|
|
|
0x00, 0x0e, 0x00, 0x07, 0x80, 0x03, 0xc0, 0x01};
|
|
|
|
}
|
2007-02-01 13:46:38 +00:00
|
|
|
button .tf.bar.leftbut -image bm-left -command goback \
|
2005-08-06 12:06:06 +00:00
|
|
|
-state disabled -width 26
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .tf.bar.leftbut -side left -fill y
|
|
|
|
button .tf.bar.rightbut -image bm-right -command goforw \
|
2005-08-06 12:06:06 +00:00
|
|
|
-state disabled -width 26
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .tf.bar.rightbut -side left -fill y
|
2005-08-06 12:06:06 +00:00
|
|
|
|
2008-05-11 12:13:02 +00:00
|
|
|
label .tf.bar.rowlabel -text [mc "Row"]
|
|
|
|
set rownumsel {}
|
|
|
|
label .tf.bar.rownum -width 7 -font textfont -textvariable rownumsel \
|
|
|
|
-relief sunken -anchor e
|
|
|
|
label .tf.bar.rowlabel2 -text "/"
|
|
|
|
label .tf.bar.numcommits -width 7 -font textfont -textvariable numcommits \
|
|
|
|
-relief sunken -anchor e
|
|
|
|
pack .tf.bar.rowlabel .tf.bar.rownum .tf.bar.rowlabel2 .tf.bar.numcommits \
|
|
|
|
-side left
|
|
|
|
global selectedline
|
2008-05-20 10:51:06 +00:00
|
|
|
trace add variable selectedline write selectedline_change
|
2008-05-11 12:13:02 +00:00
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
# Status label and progress bar
|
|
|
|
set statusw .tf.bar.status
|
2008-01-06 04:54:46 +00:00
|
|
|
label $statusw -width 15 -relief sunken
|
2007-09-27 01:00:25 +00:00
|
|
|
pack $statusw -side left -padx 5
|
2007-10-04 12:27:13 +00:00
|
|
|
set h [expr {[font metrics uifont -linespace] + 2}]
|
2007-09-27 01:00:25 +00:00
|
|
|
set progresscanv .tf.bar.progress
|
|
|
|
canvas $progresscanv -relief sunken -height $h -borderwidth 2
|
|
|
|
set progressitem [$progresscanv create rect -1 0 0 $h -fill green]
|
|
|
|
set fprogitem [$progresscanv create rect -1 0 0 $h -fill yellow]
|
2007-10-23 11:12:49 +00:00
|
|
|
set rprogitem [$progresscanv create rect -1 0 0 $h -fill red]
|
2007-09-27 01:00:25 +00:00
|
|
|
pack $progresscanv -side right -expand 1 -fill x
|
|
|
|
set progresscoords {0 0}
|
|
|
|
set fprogcoord 0
|
2007-10-23 11:12:49 +00:00
|
|
|
set rprogcoord 0
|
2007-09-27 01:00:25 +00:00
|
|
|
bind $progresscanv <Configure> adjustprogress
|
|
|
|
set lastprogupdate [clock clicks -milliseconds]
|
|
|
|
set progupdatepending 0
|
|
|
|
|
2007-09-22 02:49:33 +00:00
|
|
|
# build up the bottom bar of upper window
|
2008-01-06 04:54:46 +00:00
|
|
|
label .tf.lbar.flabel -text "[mc "Find"] "
|
|
|
|
button .tf.lbar.fnext -text [mc "next"] -command {dofind 1 1}
|
|
|
|
button .tf.lbar.fprev -text [mc "prev"] -command {dofind -1 1}
|
|
|
|
label .tf.lbar.flab2 -text " [mc "commit"] "
|
2007-09-22 02:49:33 +00:00
|
|
|
pack .tf.lbar.flabel .tf.lbar.fnext .tf.lbar.fprev .tf.lbar.flab2 \
|
|
|
|
-side left -fill y
|
2007-11-07 17:44:35 +00:00
|
|
|
set gdttype [mc "containing:"]
|
2007-09-22 02:49:33 +00:00
|
|
|
set gm [tk_optionMenu .tf.lbar.gdttype gdttype \
|
2007-11-07 17:44:35 +00:00
|
|
|
[mc "containing:"] \
|
|
|
|
[mc "touching paths:"] \
|
|
|
|
[mc "adding/removing string:"]]
|
2007-09-22 02:49:33 +00:00
|
|
|
trace add variable gdttype write gdttype_change
|
|
|
|
pack .tf.lbar.gdttype -side left -fill y
|
|
|
|
|
2005-05-15 05:56:51 +00:00
|
|
|
set findstring {}
|
2007-09-22 02:49:33 +00:00
|
|
|
set fstring .tf.lbar.findstring
|
2005-05-21 07:35:37 +00:00
|
|
|
lappend entries $fstring
|
2007-10-04 12:27:13 +00:00
|
|
|
entry $fstring -width 30 -font textfont -textvariable findstring
|
2006-05-26 00:43:47 +00:00
|
|
|
trace add variable findstring write find_change
|
2007-11-07 17:44:35 +00:00
|
|
|
set findtype [mc "Exact"]
|
2007-09-22 02:49:33 +00:00
|
|
|
set findtypemenu [tk_optionMenu .tf.lbar.findtype \
|
2007-11-07 17:44:35 +00:00
|
|
|
findtype [mc "Exact"] [mc "IgnCase"] [mc "Regexp"]]
|
2007-09-22 02:49:33 +00:00
|
|
|
trace add variable findtype write findcom_change
|
2007-11-07 17:44:35 +00:00
|
|
|
set findloc [mc "All fields"]
|
|
|
|
tk_optionMenu .tf.lbar.findloc findloc [mc "All fields"] [mc "Headline"] \
|
|
|
|
[mc "Comments"] [mc "Author"] [mc "Committer"]
|
2006-05-26 00:43:47 +00:00
|
|
|
trace add variable findloc write find_change
|
2007-09-22 02:49:33 +00:00
|
|
|
pack .tf.lbar.findloc -side right
|
|
|
|
pack .tf.lbar.findtype -side right
|
|
|
|
pack $fstring -side left -expand 1 -fill x
|
2007-02-01 13:46:38 +00:00
|
|
|
|
|
|
|
# Finish putting the upper half of the viewer together
|
|
|
|
pack .tf.lbar -in .tf -side bottom -fill x
|
|
|
|
pack .tf.bar -in .tf -side bottom -fill x
|
|
|
|
pack .tf.histframe -fill both -side top -expand 1
|
|
|
|
.ctop add .tf
|
2007-02-13 00:19:34 +00:00
|
|
|
.ctop paneconfigure .tf -height $geometry(topheight)
|
|
|
|
.ctop paneconfigure .tf -width $geometry(topwidth)
|
2007-02-01 13:46:38 +00:00
|
|
|
|
|
|
|
# now build up the bottom
|
|
|
|
panedwindow .pwbottom -orient horizontal
|
|
|
|
|
|
|
|
# lower left, a text box over search bar, scroll bar to the right
|
|
|
|
# if we know window height, then that will set the lower text height, otherwise
|
|
|
|
# we set lower text height which will drive window height
|
|
|
|
if {[info exists geometry(main)]} {
|
|
|
|
frame .bleft -width $geometry(botwidth)
|
|
|
|
} else {
|
|
|
|
frame .bleft -width $geometry(botwidth) -height $geometry(botheight)
|
|
|
|
}
|
|
|
|
frame .bleft.top
|
2007-04-19 01:39:12 +00:00
|
|
|
frame .bleft.mid
|
2008-03-08 12:27:23 +00:00
|
|
|
frame .bleft.bottom
|
2007-02-01 13:46:38 +00:00
|
|
|
|
2008-01-06 04:54:46 +00:00
|
|
|
button .bleft.top.search -text [mc "Search"] -command dosearch
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .bleft.top.search -side left -padx 5
|
|
|
|
set sstring .bleft.top.sstring
|
2007-10-04 12:27:13 +00:00
|
|
|
entry $sstring -width 20 -font textfont -textvariable searchstring
|
2006-05-24 00:16:03 +00:00
|
|
|
lappend entries $sstring
|
|
|
|
trace add variable searchstring write incrsearch
|
|
|
|
pack $sstring -side left -expand 1 -fill x
|
2008-01-06 04:54:46 +00:00
|
|
|
radiobutton .bleft.mid.diff -text [mc "Diff"] \
|
2007-04-19 01:39:12 +00:00
|
|
|
-command changediffdisp -variable diffelide -value {0 0}
|
2008-01-06 04:54:46 +00:00
|
|
|
radiobutton .bleft.mid.old -text [mc "Old version"] \
|
2007-04-19 01:39:12 +00:00
|
|
|
-command changediffdisp -variable diffelide -value {0 1}
|
2008-01-06 04:54:46 +00:00
|
|
|
radiobutton .bleft.mid.new -text [mc "New version"] \
|
2007-04-19 01:39:12 +00:00
|
|
|
-command changediffdisp -variable diffelide -value {1 0}
|
2008-01-06 04:54:46 +00:00
|
|
|
label .bleft.mid.labeldiffcontext -text " [mc "Lines of context"]: "
|
2007-04-19 01:39:12 +00:00
|
|
|
pack .bleft.mid.diff .bleft.mid.old .bleft.mid.new -side left
|
2007-10-04 12:27:13 +00:00
|
|
|
spinbox .bleft.mid.diffcontext -width 5 -font textfont \
|
2007-08-12 10:05:46 +00:00
|
|
|
-from 1 -increment 1 -to 10000000 \
|
|
|
|
-validate all -validatecommand "diffcontextvalidate %P" \
|
|
|
|
-textvariable diffcontextstring
|
|
|
|
.bleft.mid.diffcontext set $diffcontext
|
|
|
|
trace add variable diffcontextstring write diffcontextchange
|
|
|
|
lappend entries .bleft.mid.diffcontext
|
|
|
|
pack .bleft.mid.labeldiffcontext .bleft.mid.diffcontext -side left
|
2008-01-17 22:42:55 +00:00
|
|
|
checkbutton .bleft.mid.ignspace -text [mc "Ignore space change"] \
|
|
|
|
-command changeignorespace -variable ignorespace
|
|
|
|
pack .bleft.mid.ignspace -side left -padx 5
|
2008-03-08 12:27:23 +00:00
|
|
|
set ctext .bleft.bottom.ctext
|
2006-07-05 12:56:37 +00:00
|
|
|
text $ctext -background $bgcolor -foreground $fgcolor \
|
2007-10-04 12:27:13 +00:00
|
|
|
-state disabled -font textfont \
|
2008-03-08 12:27:23 +00:00
|
|
|
-yscrollcommand scrolltext -wrap none \
|
|
|
|
-xscrollcommand ".bleft.bottom.sbhorizontal set"
|
2007-09-28 11:27:39 +00:00
|
|
|
if {$have_tk85} {
|
|
|
|
$ctext conf -tabstyle wordprocessor
|
|
|
|
}
|
2008-03-08 12:27:23 +00:00
|
|
|
scrollbar .bleft.bottom.sb -command "$ctext yview"
|
|
|
|
scrollbar .bleft.bottom.sbhorizontal -command "$ctext xview" -orient h \
|
|
|
|
-width 10
|
2007-02-01 13:46:38 +00:00
|
|
|
pack .bleft.top -side top -fill x
|
2007-04-19 01:39:12 +00:00
|
|
|
pack .bleft.mid -side top -fill x
|
2008-03-08 12:27:23 +00:00
|
|
|
grid $ctext .bleft.bottom.sb -sticky nsew
|
|
|
|
grid .bleft.bottom.sbhorizontal -sticky ew
|
|
|
|
grid columnconfigure .bleft.bottom 0 -weight 1
|
|
|
|
grid rowconfigure .bleft.bottom 0 -weight 1
|
|
|
|
grid rowconfigure .bleft.bottom 1 -weight 0
|
|
|
|
pack .bleft.bottom -side top -fill both -expand 1
|
2006-07-05 12:56:37 +00:00
|
|
|
lappend bglist $ctext
|
|
|
|
lappend fglist $ctext
|
2005-05-11 00:45:38 +00:00
|
|
|
|
2006-05-15 15:13:14 +00:00
|
|
|
$ctext tag conf comment -wrap $wrapcomment
|
2007-10-04 12:27:13 +00:00
|
|
|
$ctext tag conf filesep -font textfontbold -back "#aaaaaa"
|
2006-07-05 12:56:37 +00:00
|
|
|
$ctext tag conf hunksep -fore [lindex $diffcolors 2]
|
|
|
|
$ctext tag conf d0 -fore [lindex $diffcolors 0]
|
|
|
|
$ctext tag conf d1 -fore [lindex $diffcolors 1]
|
2005-11-29 22:28:16 +00:00
|
|
|
$ctext tag conf m0 -fore red
|
|
|
|
$ctext tag conf m1 -fore blue
|
|
|
|
$ctext tag conf m2 -fore green
|
|
|
|
$ctext tag conf m3 -fore purple
|
|
|
|
$ctext tag conf m4 -fore brown
|
2006-02-06 22:13:52 +00:00
|
|
|
$ctext tag conf m5 -fore "#009090"
|
|
|
|
$ctext tag conf m6 -fore magenta
|
|
|
|
$ctext tag conf m7 -fore "#808000"
|
|
|
|
$ctext tag conf m8 -fore "#009000"
|
|
|
|
$ctext tag conf m9 -fore "#ff0080"
|
|
|
|
$ctext tag conf m10 -fore cyan
|
|
|
|
$ctext tag conf m11 -fore "#b07070"
|
|
|
|
$ctext tag conf m12 -fore "#70b0f0"
|
|
|
|
$ctext tag conf m13 -fore "#70f0b0"
|
|
|
|
$ctext tag conf m14 -fore "#f0b070"
|
|
|
|
$ctext tag conf m15 -fore "#ff70b0"
|
2005-11-29 22:28:16 +00:00
|
|
|
$ctext tag conf mmax -fore darkgrey
|
2006-02-06 22:13:52 +00:00
|
|
|
set mergemax 16
|
2007-10-04 12:27:13 +00:00
|
|
|
$ctext tag conf mresult -font textfontbold
|
|
|
|
$ctext tag conf msep -font textfontbold
|
2005-11-29 22:28:16 +00:00
|
|
|
$ctext tag conf found -back yellow
|
2005-05-11 23:44:54 +00:00
|
|
|
|
2007-02-01 13:46:38 +00:00
|
|
|
.pwbottom add .bleft
|
2007-02-13 00:19:34 +00:00
|
|
|
.pwbottom paneconfigure .bleft -width $geometry(botwidth)
|
2007-02-01 13:46:38 +00:00
|
|
|
|
|
|
|
# lower right
|
|
|
|
frame .bright
|
|
|
|
frame .bright.mode
|
2007-11-07 17:42:55 +00:00
|
|
|
radiobutton .bright.mode.patch -text [mc "Patch"] \
|
2006-04-30 23:50:57 +00:00
|
|
|
-command reselectline -variable cmitmode -value "patch"
|
2007-11-07 17:42:55 +00:00
|
|
|
radiobutton .bright.mode.tree -text [mc "Tree"] \
|
2006-04-30 23:50:57 +00:00
|
|
|
-command reselectline -variable cmitmode -value "tree"
|
2007-02-01 13:46:38 +00:00
|
|
|
grid .bright.mode.patch .bright.mode.tree -sticky ew
|
|
|
|
pack .bright.mode -side top -fill x
|
|
|
|
set cflist .bright.cfiles
|
2007-10-04 12:27:13 +00:00
|
|
|
set indent [font measure mainfont "nn"]
|
2007-02-01 13:46:38 +00:00
|
|
|
text $cflist \
|
2007-05-20 16:12:48 +00:00
|
|
|
-selectbackground $selectbgcolor \
|
2006-07-05 12:56:37 +00:00
|
|
|
-background $bgcolor -foreground $fgcolor \
|
2007-10-04 12:27:13 +00:00
|
|
|
-font mainfont \
|
2006-04-27 09:21:49 +00:00
|
|
|
-tabs [list $indent [expr {2 * $indent}]] \
|
2007-02-01 13:46:38 +00:00
|
|
|
-yscrollcommand ".bright.sb set" \
|
2006-04-27 09:21:49 +00:00
|
|
|
-cursor [. cget -cursor] \
|
|
|
|
-spacing1 1 -spacing3 1
|
2006-07-05 12:56:37 +00:00
|
|
|
lappend bglist $cflist
|
|
|
|
lappend fglist $cflist
|
2007-02-01 13:46:38 +00:00
|
|
|
scrollbar .bright.sb -command "$cflist yview"
|
|
|
|
pack .bright.sb -side right -fill y
|
2005-05-11 00:45:38 +00:00
|
|
|
pack $cflist -side left -fill both -expand 1
|
2006-05-02 09:55:31 +00:00
|
|
|
$cflist tag configure highlight \
|
|
|
|
-background [$cflist cget -selectbackground]
|
2007-10-04 12:27:13 +00:00
|
|
|
$cflist tag configure bold -font mainfontbold
|
2005-05-11 00:45:38 +00:00
|
|
|
|
2007-02-01 13:46:38 +00:00
|
|
|
.pwbottom add .bright
|
|
|
|
.ctop add .pwbottom
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2008-03-10 05:50:34 +00:00
|
|
|
# restore window width & height if known
|
2007-02-01 13:46:38 +00:00
|
|
|
if {[info exists geometry(main)]} {
|
2008-03-10 05:50:34 +00:00
|
|
|
if {[scan $geometry(main) "%dx%d" w h] >= 2} {
|
|
|
|
if {$w > [winfo screenwidth .]} {
|
|
|
|
set w [winfo screenwidth .]
|
|
|
|
}
|
|
|
|
if {$h > [winfo screenheight .]} {
|
|
|
|
set h [winfo screenheight .]
|
|
|
|
}
|
|
|
|
wm geometry . "${w}x$h"
|
|
|
|
}
|
2007-02-01 13:46:38 +00:00
|
|
|
}
|
|
|
|
|
2007-07-19 04:37:58 +00:00
|
|
|
if {[tk windowingsystem] eq {aqua}} {
|
|
|
|
set M1B M1
|
|
|
|
} else {
|
|
|
|
set M1B Control
|
|
|
|
}
|
|
|
|
|
2007-02-01 13:46:38 +00:00
|
|
|
bind .pwbottom <Configure> {resizecdetpanes %W %w}
|
|
|
|
pack .ctop -fill both -expand 1
|
2005-06-25 05:39:21 +00:00
|
|
|
bindall <1> {selcanvline %W %x %y}
|
|
|
|
#bindall <B1-Motion> {selcanvline %W %x %y}
|
2007-08-08 01:40:35 +00:00
|
|
|
if {[tk windowingsystem] == "win32"} {
|
|
|
|
bind . <MouseWheel> { windows_mousewheel_redirector %W %X %Y %D }
|
|
|
|
bind $ctext <MouseWheel> { windows_mousewheel_redirector %W %X %Y %D ; break }
|
|
|
|
} else {
|
|
|
|
bindall <ButtonRelease-4> "allcanvs yview scroll -5 units"
|
|
|
|
bindall <ButtonRelease-5> "allcanvs yview scroll 5 units"
|
2007-10-15 09:33:07 +00:00
|
|
|
if {[tk windowingsystem] eq "aqua"} {
|
|
|
|
bindall <MouseWheel> {
|
|
|
|
set delta [expr {- (%D)}]
|
|
|
|
allcanvs yview scroll $delta units
|
|
|
|
}
|
|
|
|
}
|
2007-08-08 01:40:35 +00:00
|
|
|
}
|
2006-03-30 22:55:11 +00:00
|
|
|
bindall <2> "canvscan mark %W %x %y"
|
|
|
|
bindall <B2-Motion> "canvscan dragto %W %x %y"
|
2006-04-05 00:24:03 +00:00
|
|
|
bindkey <Home> selfirstline
|
|
|
|
bindkey <End> sellastline
|
2005-05-18 22:51:00 +00:00
|
|
|
bind . <Key-Up> "selnextline -1"
|
|
|
|
bind . <Key-Down> "selnextline 1"
|
2007-10-27 11:16:56 +00:00
|
|
|
bind . <Shift-Key-Up> "dofind -1 0"
|
|
|
|
bind . <Shift-Key-Down> "dofind 1 0"
|
2006-04-05 00:24:03 +00:00
|
|
|
bindkey <Key-Right> "goforw"
|
|
|
|
bindkey <Key-Left> "goback"
|
|
|
|
bind . <Key-Prior> "selnextpage -1"
|
|
|
|
bind . <Key-Next> "selnextpage 1"
|
2007-07-19 04:37:58 +00:00
|
|
|
bind . <$M1B-Home> "allcanvs yview moveto 0.0"
|
|
|
|
bind . <$M1B-End> "allcanvs yview moveto 1.0"
|
|
|
|
bind . <$M1B-Key-Up> "allcanvs yview scroll -1 units"
|
|
|
|
bind . <$M1B-Key-Down> "allcanvs yview scroll 1 units"
|
|
|
|
bind . <$M1B-Key-Prior> "allcanvs yview scroll -1 pages"
|
|
|
|
bind . <$M1B-Key-Next> "allcanvs yview scroll 1 pages"
|
2005-05-31 12:14:42 +00:00
|
|
|
bindkey <Key-Delete> "$ctext yview scroll -1 pages"
|
|
|
|
bindkey <Key-BackSpace> "$ctext yview scroll -1 pages"
|
|
|
|
bindkey <Key-space> "$ctext yview scroll 1 pages"
|
2005-05-17 23:23:07 +00:00
|
|
|
bindkey p "selnextline -1"
|
|
|
|
bindkey n "selnextline 1"
|
2005-09-22 00:07:36 +00:00
|
|
|
bindkey z "goback"
|
|
|
|
bindkey x "goforw"
|
|
|
|
bindkey i "selnextline -1"
|
|
|
|
bindkey k "selnextline 1"
|
|
|
|
bindkey j "goback"
|
|
|
|
bindkey l "goforw"
|
2008-05-10 03:15:36 +00:00
|
|
|
bindkey b prevfile
|
2005-05-31 12:14:42 +00:00
|
|
|
bindkey d "$ctext yview scroll 18 units"
|
|
|
|
bindkey u "$ctext yview scroll -18 units"
|
2007-10-27 11:16:56 +00:00
|
|
|
bindkey / {dofind 1 1}
|
|
|
|
bindkey <Key-Return> {dofind 1 1}
|
|
|
|
bindkey ? {dofind -1 1}
|
2005-05-19 12:35:53 +00:00
|
|
|
bindkey f nextfile
|
2007-02-23 20:36:34 +00:00
|
|
|
bindkey <F5> updatecommits
|
2007-07-19 04:37:58 +00:00
|
|
|
bind . <$M1B-q> doquit
|
2007-10-27 11:16:56 +00:00
|
|
|
bind . <$M1B-f> {dofind 1 1}
|
|
|
|
bind . <$M1B-g> {dofind 1 0}
|
2007-07-19 04:37:58 +00:00
|
|
|
bind . <$M1B-r> dosearchback
|
|
|
|
bind . <$M1B-s> dosearch
|
|
|
|
bind . <$M1B-equal> {incrfont 1}
|
2008-01-11 12:39:33 +00:00
|
|
|
bind . <$M1B-plus> {incrfont 1}
|
2007-07-19 04:37:58 +00:00
|
|
|
bind . <$M1B-KP_Add> {incrfont 1}
|
|
|
|
bind . <$M1B-minus> {incrfont -1}
|
|
|
|
bind . <$M1B-KP_Subtract> {incrfont -1}
|
2007-02-09 03:22:24 +00:00
|
|
|
wm protocol . WM_DELETE_WINDOW doquit
|
2005-05-17 23:23:07 +00:00
|
|
|
bind . <Button-1> "click %W"
|
2007-10-27 11:16:56 +00:00
|
|
|
bind $fstring <Key-Return> {dofind 1 1}
|
2005-05-21 07:35:37 +00:00
|
|
|
bind $sha1entry <Key-Return> gotocommit
|
2005-06-25 06:37:13 +00:00
|
|
|
bind $sha1entry <<PasteSelection>> clearsha1
|
2006-04-27 09:21:49 +00:00
|
|
|
bind $cflist <1> {sel_flist %W %x %y; break}
|
|
|
|
bind $cflist <B1-Motion> {sel_flist %W %x %y; break}
|
2006-04-30 23:50:57 +00:00
|
|
|
bind $cflist <ButtonRelease-1> {treeclick %W %x %y}
|
2007-07-27 12:30:15 +00:00
|
|
|
bind $cflist <Button-3> {pop_flist_menu %W %X %Y %x %y}
|
2005-06-16 10:54:04 +00:00
|
|
|
|
|
|
|
set maincursor [. cget -cursor]
|
|
|
|
set textcursor [$ctext cget -cursor]
|
2005-08-07 05:27:57 +00:00
|
|
|
set curtextcursor $textcursor
|
2005-06-17 00:12:26 +00:00
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
set rowctxmenu .rowctxmenu
|
|
|
|
menu $rowctxmenu -tearoff 0
|
2007-11-07 17:42:55 +00:00
|
|
|
$rowctxmenu add command -label [mc "Diff this -> selected"] \
|
2005-06-25 05:39:21 +00:00
|
|
|
-command {diffvssel 0}
|
2007-11-07 17:42:55 +00:00
|
|
|
$rowctxmenu add command -label [mc "Diff selected -> this"] \
|
2005-06-25 05:39:21 +00:00
|
|
|
-command {diffvssel 1}
|
2007-11-07 17:42:55 +00:00
|
|
|
$rowctxmenu add command -label [mc "Make patch"] -command mkpatch
|
|
|
|
$rowctxmenu add command -label [mc "Create tag"] -command mktag
|
|
|
|
$rowctxmenu add command -label [mc "Write commit to file"] -command writecommit
|
|
|
|
$rowctxmenu add command -label [mc "Create new branch"] -command mkbranch
|
|
|
|
$rowctxmenu add command -label [mc "Cherry-pick this commit"] \
|
2006-08-06 11:08:05 +00:00
|
|
|
-command cherrypick
|
2007-11-07 17:42:55 +00:00
|
|
|
$rowctxmenu add command -label [mc "Reset HEAD branch to here"] \
|
2006-10-19 00:09:06 +00:00
|
|
|
-command resethead
|
2006-08-01 23:52:01 +00:00
|
|
|
|
2006-09-07 00:21:39 +00:00
|
|
|
set fakerowmenu .fakerowmenu
|
|
|
|
menu $fakerowmenu -tearoff 0
|
2007-11-07 17:42:55 +00:00
|
|
|
$fakerowmenu add command -label [mc "Diff this -> selected"] \
|
2006-09-07 00:21:39 +00:00
|
|
|
-command {diffvssel 0}
|
2007-11-07 17:42:55 +00:00
|
|
|
$fakerowmenu add command -label [mc "Diff selected -> this"] \
|
2006-09-07 00:21:39 +00:00
|
|
|
-command {diffvssel 1}
|
2007-11-07 17:42:55 +00:00
|
|
|
$fakerowmenu add command -label [mc "Make patch"] -command mkpatch
|
|
|
|
# $fakerowmenu add command -label [mc "Commit"] -command {mkcommit 0}
|
|
|
|
# $fakerowmenu add command -label [mc "Commit all"] -command {mkcommit 1}
|
|
|
|
# $fakerowmenu add command -label [mc "Revert local changes"] -command revertlocal
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2006-08-01 23:52:01 +00:00
|
|
|
set headctxmenu .headctxmenu
|
|
|
|
menu $headctxmenu -tearoff 0
|
2007-11-07 17:42:55 +00:00
|
|
|
$headctxmenu add command -label [mc "Check out this branch"] \
|
2006-08-01 23:52:01 +00:00
|
|
|
-command cobranch
|
2007-11-07 17:42:55 +00:00
|
|
|
$headctxmenu add command -label [mc "Remove this branch"] \
|
2006-08-01 23:52:01 +00:00
|
|
|
-command rmbranch
|
2007-07-27 12:30:15 +00:00
|
|
|
|
|
|
|
global flist_menu
|
|
|
|
set flist_menu .flistctxmenu
|
|
|
|
menu $flist_menu -tearoff 0
|
2007-11-07 17:42:55 +00:00
|
|
|
$flist_menu add command -label [mc "Highlight this too"] \
|
2007-07-27 12:30:15 +00:00
|
|
|
-command {flist_hl 0}
|
2007-11-07 17:42:55 +00:00
|
|
|
$flist_menu add command -label [mc "Highlight this only"] \
|
2007-07-27 12:30:15 +00:00
|
|
|
-command {flist_hl 1}
|
2008-03-24 11:55:36 +00:00
|
|
|
$flist_menu add command -label [mc "External diff"] \
|
|
|
|
-command {external_diff}
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
|
2007-08-08 01:40:35 +00:00
|
|
|
# Windows sends all mouse wheel events to the current focused window, not
|
|
|
|
# the one where the mouse hovers, so bind those events here and redirect
|
|
|
|
# to the correct window
|
|
|
|
proc windows_mousewheel_redirector {W X Y D} {
|
|
|
|
global canv canv2 canv3
|
|
|
|
set w [winfo containing -displayof $W $X $Y]
|
|
|
|
if {$w ne ""} {
|
|
|
|
set u [expr {$D < 0 ? 5 : -5}]
|
|
|
|
if {$w == $canv || $w == $canv2 || $w == $canv3} {
|
|
|
|
allcanvs yview scroll $u units
|
|
|
|
} else {
|
|
|
|
catch {
|
|
|
|
$w yview scroll $u units
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-05-11 12:13:02 +00:00
|
|
|
# Update row number label when selectedline changes
|
|
|
|
proc selectedline_change {n1 n2 op} {
|
|
|
|
global selectedline rownumsel
|
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} {
|
2008-05-11 12:13:02 +00:00
|
|
|
set rownumsel {}
|
|
|
|
} else {
|
|
|
|
set rownumsel [expr {$selectedline + 1}]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-03-30 22:55:11 +00:00
|
|
|
# mouse-2 makes all windows scan vertically, but only the one
|
|
|
|
# the cursor is in scans horizontally
|
|
|
|
proc canvscan {op w x y} {
|
|
|
|
global canv canv2 canv3
|
|
|
|
foreach c [list $canv $canv2 $canv3] {
|
|
|
|
if {$c == $w} {
|
|
|
|
$c scan $op $x $y
|
|
|
|
} else {
|
|
|
|
$c scan $op 0 $y
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-02-19 11:44:47 +00:00
|
|
|
proc scrollcanv {cscroll f0 f1} {
|
|
|
|
$cscroll set $f0 $f1
|
2007-12-30 11:41:14 +00:00
|
|
|
drawvisible
|
2006-05-19 23:38:11 +00:00
|
|
|
flushhighlights
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2005-05-17 23:23:07 +00:00
|
|
|
# when we make a key binding for the toplevel, make sure
|
|
|
|
# it doesn't get triggered when that key is pressed in the
|
|
|
|
# find string entry widget.
|
|
|
|
proc bindkey {ev script} {
|
2005-05-21 07:35:37 +00:00
|
|
|
global entries
|
2005-05-17 23:23:07 +00:00
|
|
|
bind . $ev $script
|
|
|
|
set escript [bind Entry $ev]
|
|
|
|
if {$escript == {}} {
|
|
|
|
set escript [bind Entry <Key>]
|
|
|
|
}
|
2005-05-21 07:35:37 +00:00
|
|
|
foreach e $entries {
|
|
|
|
bind $e $ev "$escript; break"
|
|
|
|
}
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
# set the focus back to the toplevel for any click outside
|
2005-05-21 07:35:37 +00:00
|
|
|
# the entry widgets
|
2005-05-17 23:23:07 +00:00
|
|
|
proc click {w} {
|
2007-08-08 01:40:34 +00:00
|
|
|
global ctext entries
|
|
|
|
foreach e [concat $entries $ctext] {
|
2005-05-21 07:35:37 +00:00
|
|
|
if {$w == $e} return
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
2005-05-21 07:35:37 +00:00
|
|
|
focus .
|
2005-05-16 23:54:58 +00:00
|
|
|
}
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
# Adjust the progress bar for a change in requested extent or canvas size
|
|
|
|
proc adjustprogress {} {
|
|
|
|
global progresscanv progressitem progresscoords
|
|
|
|
global fprogitem fprogcoord lastprogupdate progupdatepending
|
2007-10-23 11:12:49 +00:00
|
|
|
global rprogitem rprogcoord
|
2007-09-27 01:00:25 +00:00
|
|
|
|
|
|
|
set w [expr {[winfo width $progresscanv] - 4}]
|
|
|
|
set x0 [expr {$w * [lindex $progresscoords 0]}]
|
|
|
|
set x1 [expr {$w * [lindex $progresscoords 1]}]
|
|
|
|
set h [winfo height $progresscanv]
|
|
|
|
$progresscanv coords $progressitem $x0 0 $x1 $h
|
|
|
|
$progresscanv coords $fprogitem 0 0 [expr {$w * $fprogcoord}] $h
|
2007-10-23 11:12:49 +00:00
|
|
|
$progresscanv coords $rprogitem 0 0 [expr {$w * $rprogcoord}] $h
|
2007-09-27 01:00:25 +00:00
|
|
|
set now [clock clicks -milliseconds]
|
|
|
|
if {$now >= $lastprogupdate + 100} {
|
|
|
|
set progupdatepending 0
|
|
|
|
update
|
|
|
|
} elseif {!$progupdatepending} {
|
|
|
|
set progupdatepending 1
|
|
|
|
after [expr {$lastprogupdate + 100 - $now}] doprogupdate
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc doprogupdate {} {
|
|
|
|
global lastprogupdate progupdatepending
|
|
|
|
|
|
|
|
if {$progupdatepending} {
|
|
|
|
set progupdatepending 0
|
|
|
|
set lastprogupdate [clock clicks -milliseconds]
|
|
|
|
update
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-05-16 23:54:58 +00:00
|
|
|
proc savestuff {w} {
|
2007-09-28 11:27:39 +00:00
|
|
|
global canv canv2 canv3 mainfont textfont uifont tabstop
|
2005-11-29 22:28:16 +00:00
|
|
|
global stuffsaved findmergefiles maxgraphpct
|
2006-09-07 00:21:39 +00:00
|
|
|
global maxwidth showneartags showlocalchanges
|
2008-02-21 20:23:31 +00:00
|
|
|
global viewname viewfiles viewargs viewargscmd viewperm nextviewnum
|
2007-10-23 00:15:11 +00:00
|
|
|
global cmitmode wrapcomment datetimeformat limitdiffs
|
2007-08-12 10:05:46 +00:00
|
|
|
global colors bgcolor fgcolor diffcolors diffcontext selectbgcolor
|
2008-03-24 11:55:36 +00:00
|
|
|
global autoselect extdifftool
|
2005-07-28 03:16:51 +00:00
|
|
|
|
2005-05-16 23:54:58 +00:00
|
|
|
if {$stuffsaved} return
|
2005-05-17 23:23:07 +00:00
|
|
|
if {![winfo viewable .]} return
|
2005-05-16 23:54:58 +00:00
|
|
|
catch {
|
|
|
|
set f [open "~/.gitk-new" w]
|
2005-07-18 18:29:03 +00:00
|
|
|
puts $f [list set mainfont $mainfont]
|
|
|
|
puts $f [list set textfont $textfont]
|
2006-04-04 07:19:45 +00:00
|
|
|
puts $f [list set uifont $uifont]
|
2007-05-20 15:45:50 +00:00
|
|
|
puts $f [list set tabstop $tabstop]
|
2005-07-18 18:29:03 +00:00
|
|
|
puts $f [list set findmergefiles $findmergefiles]
|
2005-08-04 23:52:16 +00:00
|
|
|
puts $f [list set maxgraphpct $maxgraphpct]
|
2005-08-19 00:22:24 +00:00
|
|
|
puts $f [list set maxwidth $maxwidth]
|
2006-04-30 23:50:57 +00:00
|
|
|
puts $f [list set cmitmode $cmitmode]
|
2006-05-15 15:13:14 +00:00
|
|
|
puts $f [list set wrapcomment $wrapcomment]
|
2008-03-06 11:49:25 +00:00
|
|
|
puts $f [list set autoselect $autoselect]
|
2006-06-03 09:11:13 +00:00
|
|
|
puts $f [list set showneartags $showneartags]
|
2006-09-07 00:21:39 +00:00
|
|
|
puts $f [list set showlocalchanges $showlocalchanges]
|
2007-08-14 20:02:04 +00:00
|
|
|
puts $f [list set datetimeformat $datetimeformat]
|
2007-10-23 00:15:11 +00:00
|
|
|
puts $f [list set limitdiffs $limitdiffs]
|
2006-07-05 12:56:37 +00:00
|
|
|
puts $f [list set bgcolor $bgcolor]
|
|
|
|
puts $f [list set fgcolor $fgcolor]
|
|
|
|
puts $f [list set colors $colors]
|
|
|
|
puts $f [list set diffcolors $diffcolors]
|
2007-08-12 10:05:46 +00:00
|
|
|
puts $f [list set diffcontext $diffcontext]
|
2007-05-20 16:12:48 +00:00
|
|
|
puts $f [list set selectbgcolor $selectbgcolor]
|
2008-03-24 11:55:36 +00:00
|
|
|
puts $f [list set extdifftool $extdifftool]
|
2007-02-01 13:46:38 +00:00
|
|
|
|
2007-02-09 03:22:24 +00:00
|
|
|
puts $f "set geometry(main) [wm geometry .]"
|
2007-02-01 13:46:38 +00:00
|
|
|
puts $f "set geometry(topwidth) [winfo width .tf]"
|
|
|
|
puts $f "set geometry(topheight) [winfo height .tf]"
|
2007-02-13 00:19:34 +00:00
|
|
|
puts $f "set geometry(pwsash0) \"[.tf.histframe.pwclist sash coord 0]\""
|
|
|
|
puts $f "set geometry(pwsash1) \"[.tf.histframe.pwclist sash coord 1]\""
|
2007-02-01 13:46:38 +00:00
|
|
|
puts $f "set geometry(botwidth) [winfo width .bleft]"
|
|
|
|
puts $f "set geometry(botheight) [winfo height .bleft]"
|
|
|
|
|
2006-04-25 07:12:46 +00:00
|
|
|
puts -nonewline $f "set permviews {"
|
|
|
|
for {set v 0} {$v < $nextviewnum} {incr v} {
|
|
|
|
if {$viewperm($v)} {
|
2008-02-21 20:23:31 +00:00
|
|
|
puts $f "{[list $viewname($v) $viewfiles($v) $viewargs($v) $viewargscmd($v)]}"
|
2006-04-25 07:12:46 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
puts $f "}"
|
2005-05-16 23:54:58 +00:00
|
|
|
close $f
|
|
|
|
file rename -force "~/.gitk-new" "~/.gitk"
|
|
|
|
}
|
|
|
|
set stuffsaved 1
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
|
2005-05-15 23:19:18 +00:00
|
|
|
proc resizeclistpanes {win w} {
|
|
|
|
global oldwidth
|
2006-02-06 22:10:18 +00:00
|
|
|
if {[info exists oldwidth($win)]} {
|
2005-05-15 23:19:18 +00:00
|
|
|
set s0 [$win sash coord 0]
|
|
|
|
set s1 [$win sash coord 1]
|
|
|
|
if {$w < 60} {
|
|
|
|
set sash0 [expr {int($w/2 - 2)}]
|
|
|
|
set sash1 [expr {int($w*5/6 - 2)}]
|
|
|
|
} else {
|
|
|
|
set factor [expr {1.0 * $w / $oldwidth($win)}]
|
|
|
|
set sash0 [expr {int($factor * [lindex $s0 0])}]
|
|
|
|
set sash1 [expr {int($factor * [lindex $s1 0])}]
|
|
|
|
if {$sash0 < 30} {
|
|
|
|
set sash0 30
|
|
|
|
}
|
|
|
|
if {$sash1 < $sash0 + 20} {
|
2005-11-23 01:39:53 +00:00
|
|
|
set sash1 [expr {$sash0 + 20}]
|
2005-05-15 23:19:18 +00:00
|
|
|
}
|
|
|
|
if {$sash1 > $w - 10} {
|
2005-11-23 01:39:53 +00:00
|
|
|
set sash1 [expr {$w - 10}]
|
2005-05-15 23:19:18 +00:00
|
|
|
if {$sash0 > $sash1 - 20} {
|
2005-11-23 01:39:53 +00:00
|
|
|
set sash0 [expr {$sash1 - 20}]
|
2005-05-15 23:19:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
$win sash place 0 $sash0 [lindex $s0 1]
|
|
|
|
$win sash place 1 $sash1 [lindex $s1 1]
|
|
|
|
}
|
|
|
|
set oldwidth($win) $w
|
|
|
|
}
|
|
|
|
|
|
|
|
proc resizecdetpanes {win w} {
|
|
|
|
global oldwidth
|
2006-02-06 22:10:18 +00:00
|
|
|
if {[info exists oldwidth($win)]} {
|
2005-05-15 23:19:18 +00:00
|
|
|
set s0 [$win sash coord 0]
|
|
|
|
if {$w < 60} {
|
|
|
|
set sash0 [expr {int($w*3/4 - 2)}]
|
|
|
|
} else {
|
|
|
|
set factor [expr {1.0 * $w / $oldwidth($win)}]
|
|
|
|
set sash0 [expr {int($factor * [lindex $s0 0])}]
|
|
|
|
if {$sash0 < 45} {
|
|
|
|
set sash0 45
|
|
|
|
}
|
|
|
|
if {$sash0 > $w - 15} {
|
2005-11-23 01:39:53 +00:00
|
|
|
set sash0 [expr {$w - 15}]
|
2005-05-15 23:19:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
$win sash place 0 $sash0 [lindex $s0 1]
|
|
|
|
}
|
|
|
|
set oldwidth($win) $w
|
|
|
|
}
|
|
|
|
|
2005-05-10 12:08:22 +00:00
|
|
|
proc allcanvs args {
|
|
|
|
global canv canv2 canv3
|
|
|
|
eval $canv $args
|
|
|
|
eval $canv2 $args
|
|
|
|
eval $canv3 $args
|
|
|
|
}
|
|
|
|
|
|
|
|
proc bindall {event action} {
|
|
|
|
global canv canv2 canv3
|
|
|
|
bind $canv $event $action
|
|
|
|
bind $canv2 $event $action
|
|
|
|
bind $canv3 $event $action
|
|
|
|
}
|
|
|
|
|
2005-05-12 23:46:16 +00:00
|
|
|
proc about {} {
|
2007-03-27 10:36:12 +00:00
|
|
|
global uifont
|
2005-05-12 23:46:16 +00:00
|
|
|
set w .about
|
|
|
|
if {[winfo exists $w]} {
|
|
|
|
raise $w
|
|
|
|
return
|
|
|
|
}
|
|
|
|
toplevel $w
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $w [mc "About gitk"]
|
|
|
|
message $w.m -text [mc "
|
2006-02-19 11:44:47 +00:00
|
|
|
Gitk - a commit viewer for git
|
2005-05-12 23:46:16 +00:00
|
|
|
|
2008-05-09 00:14:07 +00:00
|
|
|
Copyright © 2005-2008 Paul Mackerras
|
2005-05-12 23:46:16 +00:00
|
|
|
|
2007-11-07 17:42:55 +00:00
|
|
|
Use and redistribute under the terms of the GNU General Public License"] \
|
2007-03-27 10:36:59 +00:00
|
|
|
-justify center -aspect 400 -border 2 -bg white -relief groove
|
|
|
|
pack $w.m -side top -fill x -padx 2 -pady 2
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.ok -text [mc "Close"] -command "destroy $w" -default active
|
2005-05-12 23:46:16 +00:00
|
|
|
pack $w.ok -side bottom
|
2007-03-27 10:36:59 +00:00
|
|
|
bind $w <Visibility> "focus $w.ok"
|
|
|
|
bind $w <Key-Escape> "destroy $w"
|
|
|
|
bind $w <Key-Return> "destroy $w"
|
2005-05-12 23:46:16 +00:00
|
|
|
}
|
|
|
|
|
2006-04-04 23:39:51 +00:00
|
|
|
proc keys {} {
|
|
|
|
set w .keys
|
|
|
|
if {[winfo exists $w]} {
|
|
|
|
raise $w
|
|
|
|
return
|
|
|
|
}
|
2007-07-19 04:37:58 +00:00
|
|
|
if {[tk windowingsystem] eq {aqua}} {
|
|
|
|
set M1T Cmd
|
|
|
|
} else {
|
|
|
|
set M1T Ctrl
|
|
|
|
}
|
2006-04-04 23:39:51 +00:00
|
|
|
toplevel $w
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $w [mc "Gitk key bindings"]
|
2008-01-15 22:31:49 +00:00
|
|
|
message $w.m -text "
|
|
|
|
[mc "Gitk key bindings:"]
|
|
|
|
|
|
|
|
[mc "<%s-Q> Quit" $M1T]
|
|
|
|
[mc "<Home> Move to first commit"]
|
|
|
|
[mc "<End> Move to last commit"]
|
|
|
|
[mc "<Up>, p, i Move up one commit"]
|
|
|
|
[mc "<Down>, n, k Move down one commit"]
|
|
|
|
[mc "<Left>, z, j Go back in history list"]
|
|
|
|
[mc "<Right>, x, l Go forward in history list"]
|
|
|
|
[mc "<PageUp> Move up one page in commit list"]
|
|
|
|
[mc "<PageDown> Move down one page in commit list"]
|
|
|
|
[mc "<%s-Home> Scroll to top of commit list" $M1T]
|
|
|
|
[mc "<%s-End> Scroll to bottom of commit list" $M1T]
|
|
|
|
[mc "<%s-Up> Scroll commit list up one line" $M1T]
|
|
|
|
[mc "<%s-Down> Scroll commit list down one line" $M1T]
|
|
|
|
[mc "<%s-PageUp> Scroll commit list up one page" $M1T]
|
|
|
|
[mc "<%s-PageDown> Scroll commit list down one page" $M1T]
|
|
|
|
[mc "<Shift-Up> Find backwards (upwards, later commits)"]
|
|
|
|
[mc "<Shift-Down> Find forwards (downwards, earlier commits)"]
|
|
|
|
[mc "<Delete>, b Scroll diff view up one page"]
|
|
|
|
[mc "<Backspace> Scroll diff view up one page"]
|
|
|
|
[mc "<Space> Scroll diff view down one page"]
|
|
|
|
[mc "u Scroll diff view up 18 lines"]
|
|
|
|
[mc "d Scroll diff view down 18 lines"]
|
|
|
|
[mc "<%s-F> Find" $M1T]
|
|
|
|
[mc "<%s-G> Move to next find hit" $M1T]
|
|
|
|
[mc "<Return> Move to next find hit"]
|
|
|
|
[mc "/ Move to next find hit, or redo find"]
|
|
|
|
[mc "? Move to previous find hit"]
|
|
|
|
[mc "f Scroll diff view to next file"]
|
|
|
|
[mc "<%s-S> Search for next hit in diff view" $M1T]
|
|
|
|
[mc "<%s-R> Search for previous hit in diff view" $M1T]
|
|
|
|
[mc "<%s-KP+> Increase font size" $M1T]
|
|
|
|
[mc "<%s-plus> Increase font size" $M1T]
|
|
|
|
[mc "<%s-KP-> Decrease font size" $M1T]
|
|
|
|
[mc "<%s-minus> Decrease font size" $M1T]
|
|
|
|
[mc "<F5> Update"]
|
|
|
|
" \
|
2007-03-27 10:36:59 +00:00
|
|
|
-justify left -bg white -border 2 -relief groove
|
|
|
|
pack $w.m -side top -fill both -padx 2 -pady 2
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.ok -text [mc "Close"] -command "destroy $w" -default active
|
2006-04-04 23:39:51 +00:00
|
|
|
pack $w.ok -side bottom
|
2007-03-27 10:36:59 +00:00
|
|
|
bind $w <Visibility> "focus $w.ok"
|
|
|
|
bind $w <Key-Escape> "destroy $w"
|
|
|
|
bind $w <Key-Return> "destroy $w"
|
2006-04-04 23:39:51 +00:00
|
|
|
}
|
|
|
|
|
2006-04-27 09:21:49 +00:00
|
|
|
# Procedures for manipulating the file list window at the
|
|
|
|
# bottom right of the overall window.
|
2006-04-30 23:50:57 +00:00
|
|
|
|
|
|
|
proc treeview {w l openlevs} {
|
|
|
|
global treecontents treediropen treeheight treeparent treeindex
|
|
|
|
|
|
|
|
set ix 0
|
|
|
|
set treeindex() 0
|
|
|
|
set lev 0
|
|
|
|
set prefix {}
|
|
|
|
set prefixend -1
|
|
|
|
set prefendstack {}
|
|
|
|
set htstack {}
|
|
|
|
set ht 0
|
|
|
|
set treecontents() {}
|
|
|
|
$w conf -state normal
|
|
|
|
foreach f $l {
|
|
|
|
while {[string range $f 0 $prefixend] ne $prefix} {
|
|
|
|
if {$lev <= $openlevs} {
|
|
|
|
$w mark set e:$treeindex($prefix) "end -1c"
|
|
|
|
$w mark gravity e:$treeindex($prefix) left
|
|
|
|
}
|
|
|
|
set treeheight($prefix) $ht
|
|
|
|
incr ht [lindex $htstack end]
|
|
|
|
set htstack [lreplace $htstack end end]
|
|
|
|
set prefixend [lindex $prefendstack end]
|
|
|
|
set prefendstack [lreplace $prefendstack end end]
|
|
|
|
set prefix [string range $prefix 0 $prefixend]
|
|
|
|
incr lev -1
|
|
|
|
}
|
|
|
|
set tail [string range $f [expr {$prefixend+1}] end]
|
|
|
|
while {[set slash [string first "/" $tail]] >= 0} {
|
|
|
|
lappend htstack $ht
|
|
|
|
set ht 0
|
|
|
|
lappend prefendstack $prefixend
|
|
|
|
incr prefixend [expr {$slash + 1}]
|
|
|
|
set d [string range $tail 0 $slash]
|
|
|
|
lappend treecontents($prefix) $d
|
|
|
|
set oldprefix $prefix
|
|
|
|
append prefix $d
|
|
|
|
set treecontents($prefix) {}
|
|
|
|
set treeindex($prefix) [incr ix]
|
|
|
|
set treeparent($prefix) $oldprefix
|
|
|
|
set tail [string range $tail [expr {$slash+1}] end]
|
|
|
|
if {$lev <= $openlevs} {
|
|
|
|
set ht 1
|
|
|
|
set treediropen($prefix) [expr {$lev < $openlevs}]
|
|
|
|
set bm [expr {$lev == $openlevs? "tri-rt": "tri-dn"}]
|
|
|
|
$w mark set d:$ix "end -1c"
|
|
|
|
$w mark gravity d:$ix left
|
|
|
|
set str "\n"
|
|
|
|
for {set i 0} {$i < $lev} {incr i} {append str "\t"}
|
|
|
|
$w insert end $str
|
|
|
|
$w image create end -align center -image $bm -padx 1 \
|
|
|
|
-name a:$ix
|
2006-05-20 12:56:27 +00:00
|
|
|
$w insert end $d [highlight_tag $prefix]
|
2006-04-30 23:50:57 +00:00
|
|
|
$w mark set s:$ix "end -1c"
|
|
|
|
$w mark gravity s:$ix left
|
|
|
|
}
|
|
|
|
incr lev
|
|
|
|
}
|
|
|
|
if {$tail ne {}} {
|
|
|
|
if {$lev <= $openlevs} {
|
|
|
|
incr ht
|
|
|
|
set str "\n"
|
|
|
|
for {set i 0} {$i < $lev} {incr i} {append str "\t"}
|
|
|
|
$w insert end $str
|
2006-05-20 12:56:27 +00:00
|
|
|
$w insert end $tail [highlight_tag $f]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
lappend treecontents($prefix) $tail
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while {$htstack ne {}} {
|
|
|
|
set treeheight($prefix) $ht
|
|
|
|
incr ht [lindex $htstack end]
|
|
|
|
set htstack [lreplace $htstack end end]
|
2007-07-05 11:33:02 +00:00
|
|
|
set prefixend [lindex $prefendstack end]
|
|
|
|
set prefendstack [lreplace $prefendstack end end]
|
|
|
|
set prefix [string range $prefix 0 $prefixend]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
$w conf -state disabled
|
|
|
|
}
|
|
|
|
|
|
|
|
proc linetoelt {l} {
|
|
|
|
global treeheight treecontents
|
|
|
|
|
|
|
|
set y 2
|
|
|
|
set prefix {}
|
|
|
|
while {1} {
|
|
|
|
foreach e $treecontents($prefix) {
|
|
|
|
if {$y == $l} {
|
|
|
|
return "$prefix$e"
|
|
|
|
}
|
|
|
|
set n 1
|
|
|
|
if {[string index $e end] eq "/"} {
|
|
|
|
set n $treeheight($prefix$e)
|
|
|
|
if {$y + $n > $l} {
|
|
|
|
append prefix $e
|
|
|
|
incr y
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
incr y $n
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-20 12:56:27 +00:00
|
|
|
proc highlight_tree {y prefix} {
|
|
|
|
global treeheight treecontents cflist
|
|
|
|
|
|
|
|
foreach e $treecontents($prefix) {
|
|
|
|
set path $prefix$e
|
|
|
|
if {[highlight_tag $path] ne {}} {
|
|
|
|
$cflist tag add bold $y.0 "$y.0 lineend"
|
|
|
|
}
|
|
|
|
incr y
|
|
|
|
if {[string index $e end] eq "/" && $treeheight($path) > 1} {
|
|
|
|
set y [highlight_tree $y $path]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return $y
|
|
|
|
}
|
|
|
|
|
2006-04-30 23:50:57 +00:00
|
|
|
proc treeclosedir {w dir} {
|
|
|
|
global treediropen treeheight treeparent treeindex
|
|
|
|
|
|
|
|
set ix $treeindex($dir)
|
|
|
|
$w conf -state normal
|
|
|
|
$w delete s:$ix e:$ix
|
|
|
|
set treediropen($dir) 0
|
|
|
|
$w image configure a:$ix -image tri-rt
|
|
|
|
$w conf -state disabled
|
|
|
|
set n [expr {1 - $treeheight($dir)}]
|
|
|
|
while {$dir ne {}} {
|
|
|
|
incr treeheight($dir) $n
|
|
|
|
set dir $treeparent($dir)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc treeopendir {w dir} {
|
|
|
|
global treediropen treeheight treeparent treecontents treeindex
|
|
|
|
|
|
|
|
set ix $treeindex($dir)
|
|
|
|
$w conf -state normal
|
|
|
|
$w image configure a:$ix -image tri-dn
|
|
|
|
$w mark set e:$ix s:$ix
|
|
|
|
$w mark gravity e:$ix right
|
|
|
|
set lev 0
|
|
|
|
set str "\n"
|
|
|
|
set n [llength $treecontents($dir)]
|
|
|
|
for {set x $dir} {$x ne {}} {set x $treeparent($x)} {
|
|
|
|
incr lev
|
|
|
|
append str "\t"
|
|
|
|
incr treeheight($x) $n
|
|
|
|
}
|
|
|
|
foreach e $treecontents($dir) {
|
2006-05-20 12:56:27 +00:00
|
|
|
set de $dir$e
|
2006-04-30 23:50:57 +00:00
|
|
|
if {[string index $e end] eq "/"} {
|
|
|
|
set iy $treeindex($de)
|
|
|
|
$w mark set d:$iy e:$ix
|
|
|
|
$w mark gravity d:$iy left
|
|
|
|
$w insert e:$ix $str
|
|
|
|
set treediropen($de) 0
|
|
|
|
$w image create e:$ix -align center -image tri-rt -padx 1 \
|
|
|
|
-name a:$iy
|
2006-05-20 12:56:27 +00:00
|
|
|
$w insert e:$ix $e [highlight_tag $de]
|
2006-04-30 23:50:57 +00:00
|
|
|
$w mark set s:$iy e:$ix
|
|
|
|
$w mark gravity s:$iy left
|
|
|
|
set treeheight($de) 1
|
|
|
|
} else {
|
|
|
|
$w insert e:$ix $str
|
2006-05-20 12:56:27 +00:00
|
|
|
$w insert e:$ix $e [highlight_tag $de]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
$w mark gravity e:$ix left
|
|
|
|
$w conf -state disabled
|
|
|
|
set treediropen($dir) 1
|
|
|
|
set top [lindex [split [$w index @0,0] .] 0]
|
|
|
|
set ht [$w cget -height]
|
|
|
|
set l [lindex [split [$w index s:$ix] .] 0]
|
|
|
|
if {$l < $top} {
|
|
|
|
$w yview $l.0
|
|
|
|
} elseif {$l + $n + 1 > $top + $ht} {
|
|
|
|
set top [expr {$l + $n + 2 - $ht}]
|
|
|
|
if {$l < $top} {
|
|
|
|
set top $l
|
|
|
|
}
|
|
|
|
$w yview $top.0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc treeclick {w x y} {
|
|
|
|
global treediropen cmitmode ctext cflist cflist_top
|
|
|
|
|
|
|
|
if {$cmitmode ne "tree"} return
|
|
|
|
if {![info exists cflist_top]} return
|
|
|
|
set l [lindex [split [$w index "@$x,$y"] "."] 0]
|
|
|
|
$cflist tag remove highlight $cflist_top.0 "$cflist_top.0 lineend"
|
|
|
|
$cflist tag add highlight $l.0 "$l.0 lineend"
|
|
|
|
set cflist_top $l
|
|
|
|
if {$l == 1} {
|
|
|
|
$ctext yview 1.0
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set e [linetoelt $l]
|
|
|
|
if {[string index $e end] ne "/"} {
|
|
|
|
showfile $e
|
|
|
|
} elseif {$treediropen($e)} {
|
|
|
|
treeclosedir $w $e
|
|
|
|
} else {
|
|
|
|
treeopendir $w $e
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc setfilelist {id} {
|
|
|
|
global treefilelist cflist
|
|
|
|
|
|
|
|
treeview $cflist $treefilelist($id) 0
|
|
|
|
}
|
|
|
|
|
|
|
|
image create bitmap tri-rt -background black -foreground blue -data {
|
|
|
|
#define tri-rt_width 13
|
|
|
|
#define tri-rt_height 13
|
|
|
|
static unsigned char tri-rt_bits[] = {
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x30, 0x00, 0x70, 0x00, 0xf0, 0x00,
|
|
|
|
0xf0, 0x01, 0xf0, 0x00, 0x70, 0x00, 0x30, 0x00, 0x10, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00};
|
|
|
|
} -maskdata {
|
|
|
|
#define tri-rt-mask_width 13
|
|
|
|
#define tri-rt-mask_height 13
|
|
|
|
static unsigned char tri-rt-mask_bits[] = {
|
|
|
|
0x08, 0x00, 0x18, 0x00, 0x38, 0x00, 0x78, 0x00, 0xf8, 0x00, 0xf8, 0x01,
|
|
|
|
0xf8, 0x03, 0xf8, 0x01, 0xf8, 0x00, 0x78, 0x00, 0x38, 0x00, 0x18, 0x00,
|
|
|
|
0x08, 0x00};
|
|
|
|
}
|
|
|
|
image create bitmap tri-dn -background black -foreground blue -data {
|
|
|
|
#define tri-dn_width 13
|
|
|
|
#define tri-dn_height 13
|
|
|
|
static unsigned char tri-dn_bits[] = {
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xfc, 0x07, 0xf8, 0x03,
|
|
|
|
0xf0, 0x01, 0xe0, 0x00, 0x40, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00};
|
|
|
|
} -maskdata {
|
|
|
|
#define tri-dn-mask_width 13
|
|
|
|
#define tri-dn-mask_height 13
|
|
|
|
static unsigned char tri-dn-mask_bits[] = {
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0x1f, 0xfe, 0x0f, 0xfc, 0x07,
|
|
|
|
0xf8, 0x03, 0xf0, 0x01, 0xe0, 0x00, 0x40, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00};
|
|
|
|
}
|
|
|
|
|
2007-08-20 09:36:20 +00:00
|
|
|
image create bitmap reficon-T -background black -foreground yellow -data {
|
|
|
|
#define tagicon_width 13
|
|
|
|
#define tagicon_height 9
|
|
|
|
static unsigned char tagicon_bits[] = {
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0xf0, 0x07, 0xf8, 0x07,
|
|
|
|
0xfc, 0x07, 0xf8, 0x07, 0xf0, 0x07, 0x00, 0x00, 0x00, 0x00};
|
|
|
|
} -maskdata {
|
|
|
|
#define tagicon-mask_width 13
|
|
|
|
#define tagicon-mask_height 9
|
|
|
|
static unsigned char tagicon-mask_bits[] = {
|
|
|
|
0x00, 0x00, 0xf0, 0x0f, 0xf8, 0x0f, 0xfc, 0x0f,
|
|
|
|
0xfe, 0x0f, 0xfc, 0x0f, 0xf8, 0x0f, 0xf0, 0x0f, 0x00, 0x00};
|
|
|
|
}
|
|
|
|
set rectdata {
|
|
|
|
#define headicon_width 13
|
|
|
|
#define headicon_height 9
|
|
|
|
static unsigned char headicon_bits[] = {
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0xf8, 0x07, 0xf8, 0x07,
|
|
|
|
0xf8, 0x07, 0xf8, 0x07, 0xf8, 0x07, 0x00, 0x00, 0x00, 0x00};
|
|
|
|
}
|
|
|
|
set rectmask {
|
|
|
|
#define headicon-mask_width 13
|
|
|
|
#define headicon-mask_height 9
|
|
|
|
static unsigned char headicon-mask_bits[] = {
|
|
|
|
0x00, 0x00, 0xfc, 0x0f, 0xfc, 0x0f, 0xfc, 0x0f,
|
|
|
|
0xfc, 0x0f, 0xfc, 0x0f, 0xfc, 0x0f, 0xfc, 0x0f, 0x00, 0x00};
|
|
|
|
}
|
|
|
|
image create bitmap reficon-H -background black -foreground green \
|
|
|
|
-data $rectdata -maskdata $rectmask
|
|
|
|
image create bitmap reficon-o -background black -foreground "#ddddff" \
|
|
|
|
-data $rectdata -maskdata $rectmask
|
|
|
|
|
2006-04-27 09:21:49 +00:00
|
|
|
proc init_flist {first} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global cflist cflist_top difffilestart
|
2006-04-27 09:21:49 +00:00
|
|
|
|
|
|
|
$cflist conf -state normal
|
|
|
|
$cflist delete 0.0 end
|
|
|
|
if {$first ne {}} {
|
|
|
|
$cflist insert end $first
|
|
|
|
set cflist_top 1
|
|
|
|
$cflist tag add highlight 1.0 "1.0 lineend"
|
|
|
|
} else {
|
|
|
|
catch {unset cflist_top}
|
|
|
|
}
|
|
|
|
$cflist conf -state disabled
|
|
|
|
set difffilestart {}
|
|
|
|
}
|
|
|
|
|
2006-05-20 11:31:52 +00:00
|
|
|
proc highlight_tag {f} {
|
|
|
|
global highlight_paths
|
|
|
|
|
|
|
|
foreach p $highlight_paths {
|
|
|
|
if {[string match $p $f]} {
|
|
|
|
return "bold"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc highlight_filelist {} {
|
2006-05-20 12:56:27 +00:00
|
|
|
global cmitmode cflist
|
2006-05-20 11:31:52 +00:00
|
|
|
|
2006-05-20 12:56:27 +00:00
|
|
|
$cflist conf -state normal
|
|
|
|
if {$cmitmode ne "tree"} {
|
2006-05-20 11:31:52 +00:00
|
|
|
set end [lindex [split [$cflist index end] .] 0]
|
|
|
|
for {set l 2} {$l < $end} {incr l} {
|
|
|
|
set line [$cflist get $l.0 "$l.0 lineend"]
|
|
|
|
if {[highlight_tag $line] ne {}} {
|
|
|
|
$cflist tag add bold $l.0 "$l.0 lineend"
|
|
|
|
}
|
|
|
|
}
|
2006-05-20 12:56:27 +00:00
|
|
|
} else {
|
|
|
|
highlight_tree 2 {}
|
2006-05-20 11:31:52 +00:00
|
|
|
}
|
2006-05-20 12:56:27 +00:00
|
|
|
$cflist conf -state disabled
|
2006-05-20 11:31:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc unhighlight_filelist {} {
|
2006-05-20 12:56:27 +00:00
|
|
|
global cflist
|
2006-05-20 11:31:52 +00:00
|
|
|
|
2006-05-20 12:56:27 +00:00
|
|
|
$cflist conf -state normal
|
|
|
|
$cflist tag remove bold 1.0 end
|
|
|
|
$cflist conf -state disabled
|
2006-05-20 11:31:52 +00:00
|
|
|
}
|
|
|
|
|
2006-04-30 23:50:57 +00:00
|
|
|
proc add_flist {fl} {
|
2006-05-20 12:56:27 +00:00
|
|
|
global cflist
|
2006-04-27 09:21:49 +00:00
|
|
|
|
2006-05-20 12:56:27 +00:00
|
|
|
$cflist conf -state normal
|
|
|
|
foreach f $fl {
|
|
|
|
$cflist insert end "\n"
|
|
|
|
$cflist insert end $f [highlight_tag $f]
|
2006-04-27 09:21:49 +00:00
|
|
|
}
|
2006-05-20 12:56:27 +00:00
|
|
|
$cflist conf -state disabled
|
2006-04-27 09:21:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc sel_flist {w x y} {
|
2006-05-20 12:56:27 +00:00
|
|
|
global ctext difffilestart cflist cflist_top cmitmode
|
2006-04-27 09:21:49 +00:00
|
|
|
|
2006-04-30 23:50:57 +00:00
|
|
|
if {$cmitmode eq "tree"} return
|
2006-04-27 09:21:49 +00:00
|
|
|
if {![info exists cflist_top]} return
|
|
|
|
set l [lindex [split [$w index "@$x,$y"] "."] 0]
|
2006-05-02 09:55:31 +00:00
|
|
|
$cflist tag remove highlight $cflist_top.0 "$cflist_top.0 lineend"
|
|
|
|
$cflist tag add highlight $l.0 "$l.0 lineend"
|
|
|
|
set cflist_top $l
|
2006-04-30 23:50:57 +00:00
|
|
|
if {$l == 1} {
|
|
|
|
$ctext yview 1.0
|
|
|
|
} else {
|
|
|
|
catch {$ctext yview [lindex $difffilestart [expr {$l - 2}]]}
|
2006-04-27 09:21:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-07-27 12:30:15 +00:00
|
|
|
proc pop_flist_menu {w X Y x y} {
|
|
|
|
global ctext cflist cmitmode flist_menu flist_menu_file
|
|
|
|
global treediffs diffids
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2007-07-27 12:30:15 +00:00
|
|
|
set l [lindex [split [$w index "@$x,$y"] "."] 0]
|
|
|
|
if {$l <= 1} return
|
|
|
|
if {$cmitmode eq "tree"} {
|
|
|
|
set e [linetoelt $l]
|
|
|
|
if {[string index $e end] eq "/"} return
|
|
|
|
} else {
|
|
|
|
set e [lindex $treediffs($diffids) [expr {$l-2}]]
|
|
|
|
}
|
|
|
|
set flist_menu_file $e
|
2008-03-24 11:55:36 +00:00
|
|
|
set xdiffstate "normal"
|
|
|
|
if {$cmitmode eq "tree"} {
|
|
|
|
set xdiffstate "disabled"
|
|
|
|
}
|
|
|
|
# Disable "External diff" item in tree mode
|
|
|
|
$flist_menu entryconf 2 -state $xdiffstate
|
2007-07-27 12:30:15 +00:00
|
|
|
tk_popup $flist_menu $X $Y
|
|
|
|
}
|
|
|
|
|
|
|
|
proc flist_hl {only} {
|
2007-09-27 01:00:25 +00:00
|
|
|
global flist_menu_file findstring gdttype
|
2007-07-27 12:30:15 +00:00
|
|
|
|
|
|
|
set x [shellquote $flist_menu_file]
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$only || $findstring eq {} || $gdttype ne [mc "touching paths:"]} {
|
2007-09-27 01:00:25 +00:00
|
|
|
set findstring $x
|
2007-07-27 12:30:15 +00:00
|
|
|
} else {
|
2007-09-27 01:00:25 +00:00
|
|
|
append findstring " " $x
|
2007-07-27 12:30:15 +00:00
|
|
|
}
|
2007-11-07 17:44:35 +00:00
|
|
|
set gdttype [mc "touching paths:"]
|
2007-07-27 12:30:15 +00:00
|
|
|
}
|
|
|
|
|
2008-03-24 11:55:36 +00:00
|
|
|
proc save_file_from_commit {filename output what} {
|
|
|
|
global nullfile
|
|
|
|
|
|
|
|
if {[catch {exec git show $filename -- > $output} err]} {
|
|
|
|
if {[string match "fatal: bad revision *" $err]} {
|
|
|
|
return $nullfile
|
|
|
|
}
|
|
|
|
error_popup "Error getting \"$filename\" from $what: $err"
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
return $output
|
|
|
|
}
|
|
|
|
|
|
|
|
proc external_diff_get_one_file {diffid filename diffdir} {
|
|
|
|
global nullid nullid2 nullfile
|
|
|
|
global gitdir
|
|
|
|
|
|
|
|
if {$diffid == $nullid} {
|
|
|
|
set difffile [file join [file dirname $gitdir] $filename]
|
|
|
|
if {[file exists $difffile]} {
|
|
|
|
return $difffile
|
|
|
|
}
|
|
|
|
return $nullfile
|
|
|
|
}
|
|
|
|
if {$diffid == $nullid2} {
|
|
|
|
set difffile [file join $diffdir "\[index\] [file tail $filename]"]
|
|
|
|
return [save_file_from_commit :$filename $difffile index]
|
|
|
|
}
|
|
|
|
set difffile [file join $diffdir "\[$diffid\] [file tail $filename]"]
|
|
|
|
return [save_file_from_commit $diffid:$filename $difffile \
|
|
|
|
"revision $diffid"]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc external_diff {} {
|
|
|
|
global gitktmpdir nullid nullid2
|
|
|
|
global flist_menu_file
|
|
|
|
global diffids
|
|
|
|
global diffnum
|
|
|
|
global gitdir extdifftool
|
|
|
|
|
|
|
|
if {[llength $diffids] == 1} {
|
|
|
|
# no reference commit given
|
|
|
|
set diffidto [lindex $diffids 0]
|
|
|
|
if {$diffidto eq $nullid} {
|
|
|
|
# diffing working copy with index
|
|
|
|
set diffidfrom $nullid2
|
|
|
|
} elseif {$diffidto eq $nullid2} {
|
|
|
|
# diffing index with HEAD
|
|
|
|
set diffidfrom "HEAD"
|
|
|
|
} else {
|
|
|
|
# use first parent commit
|
|
|
|
global parentlist selectedline
|
|
|
|
set diffidfrom [lindex $parentlist $selectedline 0]
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set diffidfrom [lindex $diffids 0]
|
|
|
|
set diffidto [lindex $diffids 1]
|
|
|
|
}
|
|
|
|
|
|
|
|
# make sure that several diffs wont collide
|
|
|
|
if {![info exists gitktmpdir]} {
|
|
|
|
set gitktmpdir [file join [file dirname $gitdir] \
|
|
|
|
[format ".gitk-tmp.%s" [pid]]]
|
|
|
|
if {[catch {file mkdir $gitktmpdir} err]} {
|
|
|
|
error_popup "Error creating temporary directory $gitktmpdir: $err"
|
|
|
|
unset gitktmpdir
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set diffnum 0
|
|
|
|
}
|
|
|
|
incr diffnum
|
|
|
|
set diffdir [file join $gitktmpdir $diffnum]
|
|
|
|
if {[catch {file mkdir $diffdir} err]} {
|
|
|
|
error_popup "Error creating temporary directory $diffdir: $err"
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
# gather files to diff
|
|
|
|
set difffromfile [external_diff_get_one_file $diffidfrom $flist_menu_file $diffdir]
|
|
|
|
set difftofile [external_diff_get_one_file $diffidto $flist_menu_file $diffdir]
|
|
|
|
|
|
|
|
if {$difffromfile ne {} && $difftofile ne {}} {
|
|
|
|
set cmd [concat | [shellsplit $extdifftool] \
|
|
|
|
[list $difffromfile $difftofile]]
|
|
|
|
if {[catch {set fl [open $cmd r]} err]} {
|
|
|
|
file delete -force $diffdir
|
|
|
|
error_popup [mc "$extdifftool: command failed: $err"]
|
|
|
|
} else {
|
|
|
|
fconfigure $fl -blocking 0
|
|
|
|
filerun $fl [list delete_at_eof $fl $diffdir]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# delete $dir when we see eof on $f (presumably because the child has exited)
|
|
|
|
proc delete_at_eof {f dir} {
|
|
|
|
while {[gets $f line] >= 0} {}
|
|
|
|
if {[eof $f]} {
|
|
|
|
if {[catch {close $f} err]} {
|
|
|
|
error_popup "External diff viewer failed: $err"
|
|
|
|
}
|
|
|
|
file delete -force $dir
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
|
2006-05-02 23:32:53 +00:00
|
|
|
# Functions for adding and removing shell-type quoting
|
|
|
|
|
|
|
|
proc shellquote {str} {
|
|
|
|
if {![string match "*\['\"\\ \t]*" $str]} {
|
|
|
|
return $str
|
|
|
|
}
|
|
|
|
if {![string match "*\['\"\\]*" $str]} {
|
|
|
|
return "\"$str\""
|
|
|
|
}
|
|
|
|
if {![string match "*'*" $str]} {
|
|
|
|
return "'$str'"
|
|
|
|
}
|
|
|
|
return "\"[string map {\" \\\" \\ \\\\} $str]\""
|
|
|
|
}
|
|
|
|
|
|
|
|
proc shellarglist {l} {
|
|
|
|
set str {}
|
|
|
|
foreach a $l {
|
|
|
|
if {$str ne {}} {
|
|
|
|
append str " "
|
|
|
|
}
|
|
|
|
append str [shellquote $a]
|
|
|
|
}
|
|
|
|
return $str
|
|
|
|
}
|
|
|
|
|
|
|
|
proc shelldequote {str} {
|
|
|
|
set ret {}
|
|
|
|
set used -1
|
|
|
|
while {1} {
|
|
|
|
incr used
|
|
|
|
if {![regexp -start $used -indices "\['\"\\\\ \t]" $str first]} {
|
|
|
|
append ret [string range $str $used end]
|
|
|
|
set used [string length $str]
|
|
|
|
break
|
|
|
|
}
|
|
|
|
set first [lindex $first 0]
|
|
|
|
set ch [string index $str $first]
|
|
|
|
if {$first > $used} {
|
|
|
|
append ret [string range $str $used [expr {$first - 1}]]
|
|
|
|
set used $first
|
|
|
|
}
|
|
|
|
if {$ch eq " " || $ch eq "\t"} break
|
|
|
|
incr used
|
|
|
|
if {$ch eq "'"} {
|
|
|
|
set first [string first "'" $str $used]
|
|
|
|
if {$first < 0} {
|
|
|
|
error "unmatched single-quote"
|
|
|
|
}
|
|
|
|
append ret [string range $str $used [expr {$first - 1}]]
|
|
|
|
set used $first
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
if {$ch eq "\\"} {
|
|
|
|
if {$used >= [string length $str]} {
|
|
|
|
error "trailing backslash"
|
|
|
|
}
|
|
|
|
append ret [string index $str $used]
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
# here ch == "\""
|
|
|
|
while {1} {
|
|
|
|
if {![regexp -start $used -indices "\[\"\\\\]" $str first]} {
|
|
|
|
error "unmatched double-quote"
|
|
|
|
}
|
|
|
|
set first [lindex $first 0]
|
|
|
|
set ch [string index $str $first]
|
|
|
|
if {$first > $used} {
|
|
|
|
append ret [string range $str $used [expr {$first - 1}]]
|
|
|
|
set used $first
|
|
|
|
}
|
|
|
|
if {$ch eq "\""} break
|
|
|
|
incr used
|
|
|
|
append ret [string index $str $used]
|
|
|
|
incr used
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return [list $used $ret]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc shellsplit {str} {
|
|
|
|
set l {}
|
|
|
|
while {1} {
|
|
|
|
set str [string trimleft $str]
|
|
|
|
if {$str eq {}} break
|
|
|
|
set dq [shelldequote $str]
|
|
|
|
set n [lindex $dq 0]
|
|
|
|
set word [lindex $dq 1]
|
|
|
|
set str [string range $str $n end]
|
|
|
|
lappend l $word
|
|
|
|
}
|
|
|
|
return $l
|
|
|
|
}
|
|
|
|
|
2006-04-27 09:21:49 +00:00
|
|
|
# Code to implement multiple views
|
|
|
|
|
2006-05-02 01:15:29 +00:00
|
|
|
proc newview {ishighlight} {
|
2008-01-06 04:54:46 +00:00
|
|
|
global nextviewnum newviewname newviewperm newishighlight
|
2008-02-21 20:23:31 +00:00
|
|
|
global newviewargs revtreeargs viewargscmd newviewargscmd curview
|
2006-04-04 00:16:22 +00:00
|
|
|
|
2006-05-02 01:15:29 +00:00
|
|
|
set newishighlight $ishighlight
|
2006-04-04 00:16:22 +00:00
|
|
|
set top .gitkview
|
|
|
|
if {[winfo exists $top]} {
|
|
|
|
raise $top
|
|
|
|
return
|
|
|
|
}
|
2008-03-03 20:12:47 +00:00
|
|
|
set newviewname($nextviewnum) "[mc "View"] $nextviewnum"
|
2006-04-25 11:21:10 +00:00
|
|
|
set newviewperm($nextviewnum) 0
|
2006-05-02 23:32:53 +00:00
|
|
|
set newviewargs($nextviewnum) [shellarglist $revtreeargs]
|
2008-02-21 20:23:31 +00:00
|
|
|
set newviewargscmd($nextviewnum) $viewargscmd($curview)
|
2007-11-07 17:42:55 +00:00
|
|
|
vieweditor $top $nextviewnum [mc "Gitk view definition"]
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc editview {} {
|
|
|
|
global curview
|
|
|
|
global viewname viewperm newviewname newviewperm
|
2008-02-21 20:23:31 +00:00
|
|
|
global viewargs newviewargs viewargscmd newviewargscmd
|
2006-04-25 11:21:10 +00:00
|
|
|
|
|
|
|
set top .gitkvedit-$curview
|
|
|
|
if {[winfo exists $top]} {
|
|
|
|
raise $top
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set newviewname($curview) $viewname($curview)
|
|
|
|
set newviewperm($curview) $viewperm($curview)
|
2006-05-02 23:32:53 +00:00
|
|
|
set newviewargs($curview) [shellarglist $viewargs($curview)]
|
2008-02-21 20:23:31 +00:00
|
|
|
set newviewargscmd($curview) $viewargscmd($curview)
|
2006-04-25 11:21:10 +00:00
|
|
|
vieweditor $top $curview "Gitk: edit view $viewname($curview)"
|
|
|
|
}
|
|
|
|
|
|
|
|
proc vieweditor {top n title} {
|
2008-01-09 03:19:47 +00:00
|
|
|
global newviewname newviewperm viewfiles bgcolor
|
2006-04-25 11:21:10 +00:00
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
toplevel $top
|
2006-04-25 11:21:10 +00:00
|
|
|
wm title $top $title
|
2008-01-06 04:54:46 +00:00
|
|
|
label $top.nl -text [mc "Name"]
|
|
|
|
entry $top.name -width 20 -textvariable newviewname($n)
|
2006-04-25 07:12:46 +00:00
|
|
|
grid $top.nl $top.name -sticky w -pady 5
|
2008-01-06 04:54:46 +00:00
|
|
|
checkbutton $top.perm -text [mc "Remember this view"] \
|
|
|
|
-variable newviewperm($n)
|
2006-04-25 07:12:46 +00:00
|
|
|
grid $top.perm - -pady 5 -sticky w
|
2008-01-06 04:54:46 +00:00
|
|
|
message $top.al -aspect 1000 \
|
2008-03-04 10:14:17 +00:00
|
|
|
-text [mc "Commits to include (arguments to git log):"]
|
2006-05-02 23:32:53 +00:00
|
|
|
grid $top.al - -sticky w -pady 5
|
|
|
|
entry $top.args -width 50 -textvariable newviewargs($n) \
|
2008-01-09 03:19:47 +00:00
|
|
|
-background $bgcolor
|
2006-05-02 23:32:53 +00:00
|
|
|
grid $top.args - -sticky ew -padx 5
|
2008-02-21 20:23:31 +00:00
|
|
|
|
|
|
|
message $top.ac -aspect 1000 \
|
|
|
|
-text [mc "Command to generate more commits to include:"]
|
|
|
|
grid $top.ac - -sticky w -pady 5
|
|
|
|
entry $top.argscmd -width 50 -textvariable newviewargscmd($n) \
|
|
|
|
-background white
|
|
|
|
grid $top.argscmd - -sticky ew -padx 5
|
|
|
|
|
2008-01-06 04:54:46 +00:00
|
|
|
message $top.l -aspect 1000 \
|
2007-11-07 17:42:55 +00:00
|
|
|
-text [mc "Enter files and directories to include, one per line:"]
|
2006-04-25 07:12:46 +00:00
|
|
|
grid $top.l - -sticky w
|
2008-01-09 03:19:47 +00:00
|
|
|
text $top.t -width 40 -height 10 -background $bgcolor -font uifont
|
2006-04-25 11:21:10 +00:00
|
|
|
if {[info exists viewfiles($n)]} {
|
|
|
|
foreach f $viewfiles($n) {
|
|
|
|
$top.t insert end $f
|
|
|
|
$top.t insert end "\n"
|
|
|
|
}
|
|
|
|
$top.t delete {end - 1c} end
|
|
|
|
$top.t mark set insert 0.0
|
|
|
|
}
|
2006-05-02 23:32:53 +00:00
|
|
|
grid $top.t - -sticky ew -padx 5
|
2006-04-04 00:16:22 +00:00
|
|
|
frame $top.buts
|
2008-01-06 04:54:46 +00:00
|
|
|
button $top.buts.ok -text [mc "OK"] -command [list newviewok $top $n]
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command [list destroy $top]
|
2006-04-04 00:16:22 +00:00
|
|
|
grid $top.buts.ok $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - -pady 10 -sticky ew
|
|
|
|
focus $top.t
|
|
|
|
}
|
|
|
|
|
2006-05-19 23:38:11 +00:00
|
|
|
proc doviewmenu {m first cmd op argv} {
|
2006-05-02 01:15:29 +00:00
|
|
|
set nmenu [$m index end]
|
|
|
|
for {set i $first} {$i <= $nmenu} {incr i} {
|
|
|
|
if {[$m entrycget $i -command] eq $cmd} {
|
2006-05-19 23:38:11 +00:00
|
|
|
eval $m $op $i $argv
|
2006-05-02 01:15:29 +00:00
|
|
|
break
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc allviewmenus {n op args} {
|
2007-09-22 02:49:33 +00:00
|
|
|
# global viewhlmenu
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2006-11-23 10:06:16 +00:00
|
|
|
doviewmenu .bar.view 5 [list showview $n] $op $args
|
2007-09-22 02:49:33 +00:00
|
|
|
# doviewmenu $viewhlmenu 1 [list addvhighlight $n] $op $args
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc newviewok {top n} {
|
2006-05-02 01:15:29 +00:00
|
|
|
global nextviewnum newviewperm newviewname newishighlight
|
2006-04-25 11:21:10 +00:00
|
|
|
global viewname viewfiles viewperm selectedview curview
|
2008-02-21 20:23:31 +00:00
|
|
|
global viewargs newviewargs viewargscmd newviewargscmd viewhlmenu
|
2006-04-04 00:16:22 +00:00
|
|
|
|
2006-05-02 23:32:53 +00:00
|
|
|
if {[catch {
|
|
|
|
set newargs [shellsplit $newviewargs($n)]
|
|
|
|
} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error in commit selection arguments:"] $err"
|
2006-05-02 23:32:53 +00:00
|
|
|
wm raise $top
|
|
|
|
focus $top
|
|
|
|
return
|
|
|
|
}
|
2006-04-04 00:16:22 +00:00
|
|
|
set files {}
|
2006-04-25 11:21:10 +00:00
|
|
|
foreach f [split [$top.t get 0.0 end] "\n"] {
|
2006-04-04 00:16:22 +00:00
|
|
|
set ft [string trim $f]
|
|
|
|
if {$ft ne {}} {
|
|
|
|
lappend files $ft
|
|
|
|
}
|
|
|
|
}
|
2006-04-25 11:21:10 +00:00
|
|
|
if {![info exists viewfiles($n)]} {
|
|
|
|
# creating a new view
|
|
|
|
incr nextviewnum
|
|
|
|
set viewname($n) $newviewname($n)
|
|
|
|
set viewperm($n) $newviewperm($n)
|
|
|
|
set viewfiles($n) $files
|
2006-05-02 23:32:53 +00:00
|
|
|
set viewargs($n) $newargs
|
2008-02-21 20:23:31 +00:00
|
|
|
set viewargscmd($n) $newviewargscmd($n)
|
2006-05-02 01:15:29 +00:00
|
|
|
addviewmenu $n
|
|
|
|
if {!$newishighlight} {
|
2007-06-17 04:45:00 +00:00
|
|
|
run showview $n
|
2006-05-02 01:15:29 +00:00
|
|
|
} else {
|
2007-06-17 04:45:00 +00:00
|
|
|
run addvhighlight $n
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
2006-04-25 11:21:10 +00:00
|
|
|
} else {
|
|
|
|
# editing an existing view
|
|
|
|
set viewperm($n) $newviewperm($n)
|
|
|
|
if {$newviewname($n) ne $viewname($n)} {
|
|
|
|
set viewname($n) $newviewname($n)
|
2006-11-23 10:06:16 +00:00
|
|
|
doviewmenu .bar.view 5 [list showview $n] \
|
2006-05-19 23:38:11 +00:00
|
|
|
entryconf [list -label $viewname($n)]
|
2007-09-22 02:49:33 +00:00
|
|
|
# doviewmenu $viewhlmenu 1 [list addvhighlight $n] \
|
|
|
|
# entryconf [list -label $viewname($n) -value $viewname($n)]
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
2008-02-21 20:23:31 +00:00
|
|
|
if {$files ne $viewfiles($n) || $newargs ne $viewargs($n) || \
|
|
|
|
$newviewargscmd($n) ne $viewargscmd($n)} {
|
2006-04-25 11:21:10 +00:00
|
|
|
set viewfiles($n) $files
|
2006-05-02 23:32:53 +00:00
|
|
|
set viewargs($n) $newargs
|
2008-02-21 20:23:31 +00:00
|
|
|
set viewargscmd($n) $newviewargscmd($n)
|
2006-04-25 11:21:10 +00:00
|
|
|
if {$curview == $n} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
run reloadcommits
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
catch {destroy $top}
|
2006-04-04 00:16:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc delview {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview viewperm hlview selectedhlview
|
2006-04-04 00:16:22 +00:00
|
|
|
|
|
|
|
if {$curview == 0} return
|
2006-05-19 23:38:11 +00:00
|
|
|
if {[info exists hlview] && $hlview == $curview} {
|
2007-11-07 17:44:35 +00:00
|
|
|
set selectedhlview [mc "None"]
|
2006-05-19 23:38:11 +00:00
|
|
|
unset hlview
|
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
allviewmenus $curview delete
|
2006-04-25 07:12:46 +00:00
|
|
|
set viewperm($curview) 0
|
2006-04-04 00:16:22 +00:00
|
|
|
showview 0
|
|
|
|
}
|
|
|
|
|
2006-05-02 01:15:29 +00:00
|
|
|
proc addviewmenu {n} {
|
2006-05-19 23:38:11 +00:00
|
|
|
global viewname viewhlmenu
|
2006-05-02 01:15:29 +00:00
|
|
|
|
|
|
|
.bar.view add radiobutton -label $viewname($n) \
|
|
|
|
-command [list showview $n] -variable selectedview -value $n
|
2007-09-22 02:49:33 +00:00
|
|
|
#$viewhlmenu add radiobutton -label $viewname($n) \
|
|
|
|
# -command [list addvhighlight $n] -variable selectedhlview
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
proc showview {n} {
|
2008-04-26 06:00:00 +00:00
|
|
|
global curview cached_commitrow ordertok
|
2007-09-04 16:19:56 +00:00
|
|
|
global displayorder parentlist rowidlist rowisopt rowfinal
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global colormap rowtextx nextcolor canvxmax
|
|
|
|
global numcommits viewcomplete
|
2006-04-04 00:16:22 +00:00
|
|
|
global selectedline currentid canv canvy0
|
2007-07-04 09:43:51 +00:00
|
|
|
global treediffs
|
2008-01-13 06:26:30 +00:00
|
|
|
global pending_select mainheadid
|
2007-08-29 11:45:21 +00:00
|
|
|
global commitidx
|
2008-01-13 06:26:30 +00:00
|
|
|
global selectedview
|
2007-08-23 12:24:38 +00:00
|
|
|
global hlview selectedhlview commitinterest
|
2006-04-04 00:16:22 +00:00
|
|
|
|
|
|
|
if {$n == $curview} return
|
|
|
|
set selid {}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
set span [$canv yview]
|
|
|
|
set ytop [expr {[lindex $span 0] * $ymax}]
|
|
|
|
set ybot [expr {[lindex $span 1] * $ymax}]
|
|
|
|
set yscreen [expr {($ybot - $ytop) / 2}]
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline ne {}} {
|
2006-04-04 00:16:22 +00:00
|
|
|
set selid $currentid
|
|
|
|
set y [yc $selectedline]
|
|
|
|
if {$ytop < $y && $y < $ybot} {
|
|
|
|
set yscreen [expr {$y - $ytop}]
|
|
|
|
}
|
2007-06-16 11:51:08 +00:00
|
|
|
} elseif {[info exists pending_select]} {
|
|
|
|
set selid $pending_select
|
|
|
|
unset pending_select
|
2006-04-04 00:16:22 +00:00
|
|
|
}
|
|
|
|
unselectline
|
2006-04-06 11:22:52 +00:00
|
|
|
normalline
|
2006-04-04 00:16:22 +00:00
|
|
|
catch {unset treediffs}
|
|
|
|
clear_display
|
2006-05-19 23:38:11 +00:00
|
|
|
if {[info exists hlview] && $hlview == $n} {
|
|
|
|
unset hlview
|
2007-11-07 17:44:35 +00:00
|
|
|
set selectedhlview [mc "None"]
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2007-08-23 12:24:38 +00:00
|
|
|
catch {unset commitinterest}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
catch {unset cached_commitrow}
|
2007-12-10 23:45:38 +00:00
|
|
|
catch {unset ordertok}
|
2006-04-04 00:16:22 +00:00
|
|
|
|
|
|
|
set curview $n
|
2006-04-25 07:12:46 +00:00
|
|
|
set selectedview $n
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.view entryconf [mc "Edit view..."] -state [expr {$n == 0? "disabled": "normal"}]
|
|
|
|
.bar.view entryconf [mc "Delete view"] -state [expr {$n == 0? "disabled": "normal"}]
|
2006-04-04 00:16:22 +00:00
|
|
|
|
2007-08-29 12:03:07 +00:00
|
|
|
run refill_reflist
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![info exists viewcomplete($n)]} {
|
2007-06-16 11:51:08 +00:00
|
|
|
if {$selid ne {}} {
|
|
|
|
set pending_select $selid
|
|
|
|
}
|
2006-04-23 12:45:55 +00:00
|
|
|
getcommits
|
2006-04-04 00:16:22 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set displayorder {}
|
|
|
|
set parentlist {}
|
|
|
|
set rowidlist {}
|
|
|
|
set rowisopt {}
|
|
|
|
set rowfinal {}
|
2007-09-04 16:19:56 +00:00
|
|
|
set numcommits $commitidx($n)
|
2006-04-16 23:56:02 +00:00
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
catch {unset colormap}
|
|
|
|
catch {unset rowtextx}
|
2006-05-02 01:15:29 +00:00
|
|
|
set nextcolor 0
|
|
|
|
set canvxmax [$canv cget -width]
|
2006-04-04 00:16:22 +00:00
|
|
|
set curview $n
|
|
|
|
set row 0
|
|
|
|
setcanvscroll
|
|
|
|
set yf 0
|
2007-06-16 11:51:08 +00:00
|
|
|
set row {}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$selid ne {} && [commitinview $selid $n]} {
|
|
|
|
set row [rowofcommit $selid]
|
2006-04-04 00:16:22 +00:00
|
|
|
# try to get the selected row in the same position on the screen
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
set ytop [expr {[yc $row] - $yscreen}]
|
|
|
|
if {$ytop < 0} {
|
|
|
|
set ytop 0
|
|
|
|
}
|
|
|
|
set yf [expr {$ytop * 1.0 / $ymax}]
|
|
|
|
}
|
|
|
|
allcanvs yview moveto $yf
|
|
|
|
drawvisible
|
2007-06-16 11:51:08 +00:00
|
|
|
if {$row ne {}} {
|
|
|
|
selectline $row 0
|
2008-01-13 06:26:30 +00:00
|
|
|
} elseif {$mainheadid ne {} && [commitinview $mainheadid $curview]} {
|
|
|
|
selectline [rowofcommit $mainheadid] 1
|
|
|
|
} elseif {!$viewcomplete($n)} {
|
|
|
|
if {$selid ne {}} {
|
|
|
|
set pending_select $selid
|
|
|
|
} else {
|
|
|
|
set pending_select $mainheadid
|
|
|
|
}
|
2007-06-16 11:51:08 +00:00
|
|
|
} else {
|
2007-07-13 09:49:37 +00:00
|
|
|
set row [first_real_row]
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$row < $numcommits} {
|
|
|
|
selectline $row 0
|
2007-06-16 11:51:08 +00:00
|
|
|
}
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {!$viewcomplete($n)} {
|
|
|
|
if {$numcommits == 0} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_status [mc "Reading commits..."]
|
2006-04-25 11:21:10 +00:00
|
|
|
}
|
2006-05-02 23:32:53 +00:00
|
|
|
} elseif {$numcommits == 0} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_status [mc "No commits selected"]
|
2006-04-21 00:35:31 +00:00
|
|
|
}
|
2006-04-04 00:16:22 +00:00
|
|
|
}
|
|
|
|
|
2006-05-19 23:38:11 +00:00
|
|
|
# Stuff relating to the highlighting facility
|
|
|
|
|
2008-01-07 11:16:31 +00:00
|
|
|
proc ishighlighted {id} {
|
2006-05-29 09:50:02 +00:00
|
|
|
global vhighlights fhighlights nhighlights rhighlights
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists nhighlights($id)] && $nhighlights($id) > 0} {
|
|
|
|
return $nhighlights($id)
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists vhighlights($id)] && $vhighlights($id) > 0} {
|
|
|
|
return $vhighlights($id)
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists fhighlights($id)] && $fhighlights($id) > 0} {
|
|
|
|
return $fhighlights($id)
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists rhighlights($id)] && $rhighlights($id) > 0} {
|
|
|
|
return $rhighlights($id)
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
2006-05-19 23:38:11 +00:00
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
proc bolden {row font} {
|
2006-05-30 11:33:07 +00:00
|
|
|
global canv linehtag selectedline boldrows
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend boldrows $row
|
2006-05-19 23:38:11 +00:00
|
|
|
$canv itemconf $linehtag($row) -font $font
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$row == $selectedline} {
|
2006-05-19 23:38:11 +00:00
|
|
|
$canv delete secsel
|
|
|
|
set t [eval $canv create rect [$canv bbox $linehtag($row)] \
|
|
|
|
-outline {{}} -tags secsel \
|
|
|
|
-fill [$canv cget -selectbackground]]
|
|
|
|
$canv lower $t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc bolden_name {row font} {
|
2006-05-30 11:33:07 +00:00
|
|
|
global canv2 linentag selectedline boldnamerows
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend boldnamerows $row
|
2006-05-19 23:38:11 +00:00
|
|
|
$canv2 itemconf $linentag($row) -font $font
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$row == $selectedline} {
|
2006-05-19 23:38:11 +00:00
|
|
|
$canv2 delete secsel
|
|
|
|
set t [eval $canv2 create rect [$canv2 bbox $linentag($row)] \
|
|
|
|
-outline {{}} -tags secsel \
|
|
|
|
-fill [$canv2 cget -selectbackground]]
|
|
|
|
$canv2 lower $t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
proc unbolden {} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global boldrows
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
set stillbold {}
|
|
|
|
foreach row $boldrows {
|
2008-01-07 11:16:31 +00:00
|
|
|
if {![ishighlighted [commitonrow $row]]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfont
|
2006-05-30 11:33:07 +00:00
|
|
|
} else {
|
|
|
|
lappend stillbold $row
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
}
|
2006-05-30 11:33:07 +00:00
|
|
|
set boldrows $stillbold
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc addvhighlight {n} {
|
2008-01-07 11:16:31 +00:00
|
|
|
global hlview viewcomplete curview vhl_done commitidx
|
2006-05-02 01:15:29 +00:00
|
|
|
|
|
|
|
if {[info exists hlview]} {
|
2006-05-19 23:38:11 +00:00
|
|
|
delvhighlight
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
set hlview $n
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$n != $curview && ![info exists viewcomplete($n)]} {
|
2006-05-02 01:15:29 +00:00
|
|
|
start_rev_list $n
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
set vhl_done $commitidx($hlview)
|
|
|
|
if {$vhl_done > 0} {
|
|
|
|
drawvisible
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-19 23:38:11 +00:00
|
|
|
proc delvhighlight {} {
|
|
|
|
global hlview vhighlights
|
2006-05-02 01:15:29 +00:00
|
|
|
|
|
|
|
if {![info exists hlview]} return
|
|
|
|
unset hlview
|
2006-05-30 11:33:07 +00:00
|
|
|
catch {unset vhighlights}
|
|
|
|
unbolden
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
|
2006-05-19 23:38:11 +00:00
|
|
|
proc vhighlightmore {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global hlview vhl_done commitidx vhighlights curview
|
2006-05-02 01:15:29 +00:00
|
|
|
|
|
|
|
set max $commitidx($hlview)
|
2006-05-19 23:38:11 +00:00
|
|
|
set vr [visiblerows]
|
|
|
|
set r0 [lindex $vr 0]
|
|
|
|
set r1 [lindex $vr 1]
|
|
|
|
for {set i $vhl_done} {$i < $max} {incr i} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set id [commitonrow $i $hlview]
|
|
|
|
if {[commitinview $id $curview]} {
|
|
|
|
set row [rowofcommit $id]
|
2006-05-19 23:38:11 +00:00
|
|
|
if {$r0 <= $row && $row <= $r1} {
|
|
|
|
if {![highlighted $row]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfontbold
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
set vhighlights($id) 1
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-05-19 23:38:11 +00:00
|
|
|
set vhl_done $max
|
2008-03-02 23:11:08 +00:00
|
|
|
return 0
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc askvhighlight {row id} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global hlview vhighlights iddrawn
|
2006-05-19 23:38:11 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $id $hlview]} {
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists iddrawn($id)] && ![ishighlighted $id]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfontbold
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
set vhighlights($id) 1
|
2006-05-19 23:38:11 +00:00
|
|
|
} else {
|
2008-01-07 11:16:31 +00:00
|
|
|
set vhighlights($id) 0
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-09-22 02:49:33 +00:00
|
|
|
proc hfiles_change {} {
|
2006-05-19 23:38:11 +00:00
|
|
|
global highlight_files filehighlight fhighlights fh_serial
|
2007-10-04 12:27:13 +00:00
|
|
|
global highlight_paths gdttype
|
2006-05-19 23:38:11 +00:00
|
|
|
|
|
|
|
if {[info exists filehighlight]} {
|
|
|
|
# delete previous highlights
|
|
|
|
catch {close $filehighlight}
|
|
|
|
unset filehighlight
|
2006-05-30 11:33:07 +00:00
|
|
|
catch {unset fhighlights}
|
|
|
|
unbolden
|
2006-05-20 11:31:52 +00:00
|
|
|
unhighlight_filelist
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2006-05-20 11:31:52 +00:00
|
|
|
set highlight_paths {}
|
2006-05-19 23:38:11 +00:00
|
|
|
after cancel do_file_hl $fh_serial
|
|
|
|
incr fh_serial
|
|
|
|
if {$highlight_files ne {}} {
|
|
|
|
after 300 do_file_hl $fh_serial
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-09-22 02:49:33 +00:00
|
|
|
proc gdttype_change {name ix op} {
|
|
|
|
global gdttype highlight_files findstring findpattern
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2007-09-22 02:49:33 +00:00
|
|
|
if {$findstring ne {}} {
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$gdttype eq [mc "containing:"]} {
|
2007-09-22 02:49:33 +00:00
|
|
|
if {$highlight_files ne {}} {
|
|
|
|
set highlight_files {}
|
|
|
|
hfiles_change
|
|
|
|
}
|
|
|
|
findcom_change
|
|
|
|
} else {
|
|
|
|
if {$findpattern ne {}} {
|
|
|
|
set findpattern {}
|
|
|
|
findcom_change
|
|
|
|
}
|
|
|
|
set highlight_files $findstring
|
|
|
|
hfiles_change
|
|
|
|
}
|
|
|
|
drawvisible
|
|
|
|
}
|
|
|
|
# enable/disable findtype/findloc menus too
|
|
|
|
}
|
|
|
|
|
|
|
|
proc find_change {name ix op} {
|
|
|
|
global gdttype findstring highlight_files
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$gdttype eq [mc "containing:"]} {
|
2007-09-22 02:49:33 +00:00
|
|
|
findcom_change
|
|
|
|
} else {
|
|
|
|
if {$highlight_files ne $findstring} {
|
|
|
|
set highlight_files $findstring
|
|
|
|
hfiles_change
|
|
|
|
}
|
|
|
|
}
|
|
|
|
drawvisible
|
|
|
|
}
|
|
|
|
|
2007-10-04 12:19:24 +00:00
|
|
|
proc findcom_change args {
|
2007-10-04 12:27:13 +00:00
|
|
|
global nhighlights boldnamerows
|
2007-09-22 02:49:33 +00:00
|
|
|
global findpattern findtype findstring gdttype
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2007-09-22 02:49:33 +00:00
|
|
|
# delete previous highlights, if any
|
|
|
|
foreach row $boldnamerows {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden_name $row mainfont
|
2007-09-22 02:49:33 +00:00
|
|
|
}
|
|
|
|
set boldnamerows {}
|
|
|
|
catch {unset nhighlights}
|
|
|
|
unbolden
|
|
|
|
unmarkmatches
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$gdttype ne [mc "containing:"] || $findstring eq {}} {
|
2007-09-22 02:49:33 +00:00
|
|
|
set findpattern {}
|
2007-11-07 17:44:35 +00:00
|
|
|
} elseif {$findtype eq [mc "Regexp"]} {
|
2007-09-22 02:49:33 +00:00
|
|
|
set findpattern $findstring
|
|
|
|
} else {
|
|
|
|
set e [string map {"*" "\\*" "?" "\\?" "\[" "\\\[" "\\" "\\\\"} \
|
|
|
|
$findstring]
|
|
|
|
set findpattern "*$e*"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-20 11:31:52 +00:00
|
|
|
proc makepatterns {l} {
|
|
|
|
set ret {}
|
|
|
|
foreach e $l {
|
|
|
|
set ee [string map {"*" "\\*" "?" "\\?" "\[" "\\\[" "\\" "\\\\"} $e]
|
|
|
|
if {[string index $ee end] eq "/"} {
|
|
|
|
lappend ret "$ee*"
|
|
|
|
} else {
|
|
|
|
lappend ret $ee
|
|
|
|
lappend ret "$ee/*"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return $ret
|
|
|
|
}
|
|
|
|
|
2006-05-19 23:38:11 +00:00
|
|
|
proc do_file_hl {serial} {
|
2006-05-30 11:33:07 +00:00
|
|
|
global highlight_files filehighlight highlight_paths gdttype fhl_list
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$gdttype eq [mc "touching paths:"]} {
|
2006-05-26 00:43:47 +00:00
|
|
|
if {[catch {set paths [shellsplit $highlight_files]}]} return
|
|
|
|
set highlight_paths [makepatterns $paths]
|
|
|
|
highlight_filelist
|
|
|
|
set gdtargs [concat -- $paths]
|
2007-11-07 17:44:35 +00:00
|
|
|
} elseif {$gdttype eq [mc "adding/removing string:"]} {
|
2006-05-26 00:43:47 +00:00
|
|
|
set gdtargs [list "-S$highlight_files"]
|
2007-09-22 02:49:33 +00:00
|
|
|
} else {
|
|
|
|
# must be "containing:", i.e. we're searching commit info
|
|
|
|
return
|
2006-05-26 00:43:47 +00:00
|
|
|
}
|
2007-03-19 23:00:37 +00:00
|
|
|
set cmd [concat | git diff-tree -r -s --stdin $gdtargs]
|
2006-05-19 23:38:11 +00:00
|
|
|
set filehighlight [open $cmd r+]
|
|
|
|
fconfigure $filehighlight -blocking 0
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $filehighlight readfhighlight
|
2006-05-30 11:33:07 +00:00
|
|
|
set fhl_list {}
|
2006-05-19 23:38:11 +00:00
|
|
|
drawvisible
|
|
|
|
flushhighlights
|
|
|
|
}
|
|
|
|
|
|
|
|
proc flushhighlights {} {
|
2006-05-30 11:33:07 +00:00
|
|
|
global filehighlight fhl_list
|
2006-05-19 23:38:11 +00:00
|
|
|
|
|
|
|
if {[info exists filehighlight]} {
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend fhl_list {}
|
2006-05-19 23:38:11 +00:00
|
|
|
puts $filehighlight ""
|
|
|
|
flush $filehighlight
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc askfilehighlight {row id} {
|
2006-05-30 11:33:07 +00:00
|
|
|
global filehighlight fhighlights fhl_list
|
2006-05-19 23:38:11 +00:00
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend fhl_list $id
|
2008-01-07 11:16:31 +00:00
|
|
|
set fhighlights($id) -1
|
2006-05-19 23:38:11 +00:00
|
|
|
puts $filehighlight $id
|
|
|
|
}
|
|
|
|
|
|
|
|
proc readfhighlight {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global filehighlight fhighlights curview iddrawn
|
2007-09-22 02:49:33 +00:00
|
|
|
global fhl_list find_dirn
|
2006-05-30 11:33:07 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
if {![info exists filehighlight]} {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
set nr 0
|
|
|
|
while {[incr nr] <= 100 && [gets $filehighlight line] >= 0} {
|
2006-05-30 11:33:07 +00:00
|
|
|
set line [string trim $line]
|
|
|
|
set i [lsearch -exact $fhl_list $line]
|
|
|
|
if {$i < 0} continue
|
|
|
|
for {set j 0} {$j < $i} {incr j} {
|
|
|
|
set id [lindex $fhl_list $j]
|
2008-01-07 11:16:31 +00:00
|
|
|
set fhighlights($id) 0
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2006-05-30 11:33:07 +00:00
|
|
|
set fhl_list [lrange $fhl_list [expr {$i+1}] end]
|
|
|
|
if {$line eq {}} continue
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $line $curview]} continue
|
|
|
|
set row [rowofcommit $line]
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists iddrawn($line)] && ![ishighlighted $line]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfontbold
|
2006-05-30 11:33:07 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
set fhighlights($line) 1
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2006-05-30 11:33:07 +00:00
|
|
|
if {[eof $filehighlight]} {
|
|
|
|
# strange...
|
2007-03-19 23:00:37 +00:00
|
|
|
puts "oops, git diff-tree died"
|
2006-05-30 11:33:07 +00:00
|
|
|
catch {close $filehighlight}
|
|
|
|
unset filehighlight
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
if {[info exists find_dirn]} {
|
2007-10-27 11:16:56 +00:00
|
|
|
run findmore
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
return 1
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
|
2007-07-04 09:43:51 +00:00
|
|
|
proc doesmatch {f} {
|
2007-09-22 02:49:33 +00:00
|
|
|
global findtype findpattern
|
2007-07-04 09:43:51 +00:00
|
|
|
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findtype eq [mc "Regexp"]} {
|
2007-09-22 02:49:33 +00:00
|
|
|
return [regexp $findpattern $f]
|
2007-11-07 17:44:35 +00:00
|
|
|
} elseif {$findtype eq [mc "IgnCase"]} {
|
2007-07-04 09:43:51 +00:00
|
|
|
return [string match -nocase $findpattern $f]
|
|
|
|
} else {
|
|
|
|
return [string match $findpattern $f]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-26 00:43:47 +00:00
|
|
|
proc askfindhighlight {row id} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global nhighlights commitinfo iddrawn
|
2007-07-04 09:43:51 +00:00
|
|
|
global findloc
|
|
|
|
global markingmatches
|
2006-05-19 23:38:11 +00:00
|
|
|
|
|
|
|
if {![info exists commitinfo($id)]} {
|
|
|
|
getcommit $id
|
|
|
|
}
|
2006-05-26 00:43:47 +00:00
|
|
|
set info $commitinfo($id)
|
2006-05-19 23:38:11 +00:00
|
|
|
set isbold 0
|
2007-11-07 17:44:35 +00:00
|
|
|
set fldtypes [list [mc Headline] [mc Author] [mc Date] [mc Committer] [mc CDate] [mc Comments]]
|
2006-05-26 00:43:47 +00:00
|
|
|
foreach f $info ty $fldtypes {
|
2007-11-07 17:44:35 +00:00
|
|
|
if {($findloc eq [mc "All fields"] || $findloc eq $ty) &&
|
2007-07-04 09:43:51 +00:00
|
|
|
[doesmatch $f]} {
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$ty eq [mc "Author"]} {
|
2006-05-26 00:43:47 +00:00
|
|
|
set isbold 2
|
2007-07-04 09:43:51 +00:00
|
|
|
break
|
2006-05-26 00:43:47 +00:00
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
set isbold 1
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
if {$isbold && [info exists iddrawn($id)]} {
|
2008-01-07 11:16:31 +00:00
|
|
|
if {![ishighlighted $id]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfontbold
|
2007-07-04 09:43:51 +00:00
|
|
|
if {$isbold > 1} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden_name $row mainfontbold
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
if {$markingmatches} {
|
2007-07-26 12:36:39 +00:00
|
|
|
markrowmatches $row $id
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
set nhighlights($id) $isbold
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
|
2007-07-26 12:36:39 +00:00
|
|
|
proc markrowmatches {row id} {
|
|
|
|
global canv canv2 linehtag linentag commitinfo findloc
|
2007-07-04 09:43:51 +00:00
|
|
|
|
2007-07-26 12:36:39 +00:00
|
|
|
set headline [lindex $commitinfo($id) 0]
|
|
|
|
set author [lindex $commitinfo($id) 1]
|
2007-07-04 09:43:51 +00:00
|
|
|
$canv delete match$row
|
|
|
|
$canv2 delete match$row
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findloc eq [mc "All fields"] || $findloc eq [mc "Headline"]} {
|
2007-07-26 12:36:39 +00:00
|
|
|
set m [findmatches $headline]
|
|
|
|
if {$m ne {}} {
|
|
|
|
markmatches $canv $row $headline $linehtag($row) $m \
|
|
|
|
[$canv itemcget $linehtag($row) -font] $row
|
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findloc eq [mc "All fields"] || $findloc eq [mc "Author"]} {
|
2007-07-26 12:36:39 +00:00
|
|
|
set m [findmatches $author]
|
|
|
|
if {$m ne {}} {
|
|
|
|
markmatches $canv2 $row $author $linentag($row) $m \
|
|
|
|
[$canv2 itemcget $linentag($row) -font] $row
|
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-29 09:50:02 +00:00
|
|
|
proc vrel_change {name ix op} {
|
|
|
|
global highlight_related
|
|
|
|
|
|
|
|
rhighlight_none
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$highlight_related ne [mc "None"]} {
|
2007-06-17 04:45:00 +00:00
|
|
|
run drawvisible
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# prepare for testing whether commits are descendents or ancestors of a
|
|
|
|
proc rhighlight_sel {a} {
|
|
|
|
global descendent desc_todo ancestor anc_todo
|
2008-01-07 11:16:31 +00:00
|
|
|
global highlight_related
|
2006-05-29 09:50:02 +00:00
|
|
|
|
|
|
|
catch {unset descendent}
|
|
|
|
set desc_todo [list $a]
|
|
|
|
catch {unset ancestor}
|
|
|
|
set anc_todo [list $a]
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$highlight_related ne [mc "None"]} {
|
2006-05-29 09:50:02 +00:00
|
|
|
rhighlight_none
|
2007-06-17 04:45:00 +00:00
|
|
|
run drawvisible
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc rhighlight_none {} {
|
|
|
|
global rhighlights
|
|
|
|
|
2006-05-30 11:33:07 +00:00
|
|
|
catch {unset rhighlights}
|
|
|
|
unbolden
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc is_descendent {a} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview children descendent desc_todo
|
2006-05-29 09:50:02 +00:00
|
|
|
|
|
|
|
set v $curview
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set la [rowofcommit $a]
|
2006-05-29 09:50:02 +00:00
|
|
|
set todo $desc_todo
|
|
|
|
set leftover {}
|
|
|
|
set done 0
|
|
|
|
for {set i 0} {$i < [llength $todo]} {incr i} {
|
|
|
|
set do [lindex $todo $i]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[rowofcommit $do] < $la} {
|
2006-05-29 09:50:02 +00:00
|
|
|
lappend leftover $do
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
foreach nk $children($v,$do) {
|
|
|
|
if {![info exists descendent($nk)]} {
|
|
|
|
set descendent($nk) 1
|
|
|
|
lappend todo $nk
|
|
|
|
if {$nk eq $a} {
|
|
|
|
set done 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$done} {
|
|
|
|
set desc_todo [concat $leftover [lrange $todo [expr {$i+1}] end]]
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set descendent($a) 0
|
|
|
|
set desc_todo $leftover
|
|
|
|
}
|
|
|
|
|
|
|
|
proc is_ancestor {a} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview parents ancestor anc_todo
|
2006-05-29 09:50:02 +00:00
|
|
|
|
|
|
|
set v $curview
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set la [rowofcommit $a]
|
2006-05-29 09:50:02 +00:00
|
|
|
set todo $anc_todo
|
|
|
|
set leftover {}
|
|
|
|
set done 0
|
|
|
|
for {set i 0} {$i < [llength $todo]} {incr i} {
|
|
|
|
set do [lindex $todo $i]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $do $v] || [rowofcommit $do] > $la} {
|
2006-05-29 09:50:02 +00:00
|
|
|
lappend leftover $do
|
|
|
|
continue
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
foreach np $parents($v,$do) {
|
2006-05-29 09:50:02 +00:00
|
|
|
if {![info exists ancestor($np)]} {
|
|
|
|
set ancestor($np) 1
|
|
|
|
lappend todo $np
|
|
|
|
if {$np eq $a} {
|
|
|
|
set done 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$done} {
|
|
|
|
set anc_todo [concat $leftover [lrange $todo [expr {$i+1}] end]]
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set ancestor($a) 0
|
|
|
|
set anc_todo $leftover
|
|
|
|
}
|
|
|
|
|
|
|
|
proc askrelhighlight {row id} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global descendent highlight_related iddrawn rhighlights
|
2006-05-29 09:50:02 +00:00
|
|
|
global selectedline ancestor
|
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} return
|
2006-05-29 09:50:02 +00:00
|
|
|
set isbold 0
|
2008-01-09 21:23:18 +00:00
|
|
|
if {$highlight_related eq [mc "Descendant"] ||
|
|
|
|
$highlight_related eq [mc "Not descendant"]} {
|
2006-05-29 09:50:02 +00:00
|
|
|
if {![info exists descendent($id)]} {
|
|
|
|
is_descendent $id
|
|
|
|
}
|
2008-01-09 21:23:18 +00:00
|
|
|
if {$descendent($id) == ($highlight_related eq [mc "Descendant"])} {
|
2006-05-29 09:50:02 +00:00
|
|
|
set isbold 1
|
|
|
|
}
|
2007-11-07 17:44:35 +00:00
|
|
|
} elseif {$highlight_related eq [mc "Ancestor"] ||
|
|
|
|
$highlight_related eq [mc "Not ancestor"]} {
|
2006-05-29 09:50:02 +00:00
|
|
|
if {![info exists ancestor($id)]} {
|
|
|
|
is_ancestor $id
|
|
|
|
}
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$ancestor($id) == ($highlight_related eq [mc "Ancestor"])} {
|
2006-05-29 09:50:02 +00:00
|
|
|
set isbold 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[info exists iddrawn($id)]} {
|
2008-01-07 11:16:31 +00:00
|
|
|
if {$isbold && ![ishighlighted $id]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
bolden $row mainfontbold
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
set rhighlights($id) $isbold
|
2006-05-29 09:50:02 +00:00
|
|
|
}
|
|
|
|
|
2006-05-02 01:15:29 +00:00
|
|
|
# Graph layout functions
|
|
|
|
|
2006-02-19 11:44:47 +00:00
|
|
|
proc shortids {ids} {
|
|
|
|
set res {}
|
|
|
|
foreach id $ids {
|
|
|
|
if {[llength $id] > 1} {
|
|
|
|
lappend res [shortids $id]
|
|
|
|
} elseif {[regexp {^[0-9a-f]{40}$} $id]} {
|
|
|
|
lappend res [string range $id 0 7]
|
|
|
|
} else {
|
|
|
|
lappend res $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return $res
|
|
|
|
}
|
|
|
|
|
|
|
|
proc ntimes {n o} {
|
|
|
|
set ret {}
|
2007-08-29 11:45:21 +00:00
|
|
|
set o [list $o]
|
|
|
|
for {set mask 1} {$mask <= $n} {incr mask $mask} {
|
|
|
|
if {($n & $mask) != 0} {
|
|
|
|
set ret [concat $ret $o]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
set o [concat $o $o]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
return $ret
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2007-12-10 23:45:38 +00:00
|
|
|
proc ordertoken {id} {
|
|
|
|
global ordertok curview varcid varcstart varctok curview parents children
|
|
|
|
global nullid nullid2
|
|
|
|
|
|
|
|
if {[info exists ordertok($id)]} {
|
|
|
|
return $ordertok($id)
|
|
|
|
}
|
|
|
|
set origid $id
|
|
|
|
set todo {}
|
|
|
|
while {1} {
|
|
|
|
if {[info exists varcid($curview,$id)]} {
|
|
|
|
set a $varcid($curview,$id)
|
|
|
|
set p [lindex $varcstart($curview) $a]
|
|
|
|
} else {
|
|
|
|
set p [lindex $children($curview,$id) 0]
|
|
|
|
}
|
|
|
|
if {[info exists ordertok($p)]} {
|
|
|
|
set tok $ordertok($p)
|
|
|
|
break
|
|
|
|
}
|
2008-01-06 02:54:58 +00:00
|
|
|
set id [first_real_child $curview,$p]
|
|
|
|
if {$id eq {}} {
|
2007-12-10 23:45:38 +00:00
|
|
|
# it's a root
|
2008-01-15 11:16:32 +00:00
|
|
|
set tok [lindex $varctok($curview) $varcid($curview,$p)]
|
2007-12-10 23:45:38 +00:00
|
|
|
break
|
|
|
|
}
|
|
|
|
if {[llength $parents($curview,$id)] == 1} {
|
|
|
|
lappend todo [list $p {}]
|
|
|
|
} else {
|
|
|
|
set j [lsearch -exact $parents($curview,$id) $p]
|
|
|
|
if {$j < 0} {
|
|
|
|
puts "oops didn't find [shortids $p] in parents of [shortids $id]"
|
|
|
|
}
|
|
|
|
lappend todo [list $p [strrep $j]]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for {set i [llength $todo]} {[incr i -1] >= 0} {} {
|
|
|
|
set p [lindex $todo $i 0]
|
|
|
|
append tok [lindex $todo $i 1]
|
|
|
|
set ordertok($p) $tok
|
|
|
|
}
|
|
|
|
set ordertok($origid) $tok
|
|
|
|
return $tok
|
|
|
|
}
|
|
|
|
|
2007-07-31 11:03:06 +00:00
|
|
|
# Work out where id should go in idlist so that order-token
|
|
|
|
# values increase from left to right
|
|
|
|
proc idcol {idlist id {i 0}} {
|
2007-12-10 23:45:38 +00:00
|
|
|
set t [ordertoken $id]
|
2007-12-12 07:13:51 +00:00
|
|
|
if {$i < 0} {
|
|
|
|
set i 0
|
|
|
|
}
|
2007-12-10 23:45:38 +00:00
|
|
|
if {$i >= [llength $idlist] || $t < [ordertoken [lindex $idlist $i]]} {
|
2007-07-31 11:03:06 +00:00
|
|
|
if {$i > [llength $idlist]} {
|
|
|
|
set i [llength $idlist]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-12-10 23:45:38 +00:00
|
|
|
while {[incr i -1] >= 0 && $t < [ordertoken [lindex $idlist $i]]} {}
|
2007-07-31 11:03:06 +00:00
|
|
|
incr i
|
|
|
|
} else {
|
2007-12-10 23:45:38 +00:00
|
|
|
if {$t > [ordertoken [lindex $idlist $i]]} {
|
2007-07-31 11:03:06 +00:00
|
|
|
while {[incr i] < [llength $idlist] &&
|
2007-12-10 23:45:38 +00:00
|
|
|
$t >= [ordertoken [lindex $idlist $i]]} {}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
return $i
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc initlayout {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global rowidlist rowisopt rowfinal displayorder parentlist
|
2006-05-02 01:15:29 +00:00
|
|
|
global numcommits canvxmax canv
|
2006-02-28 11:10:19 +00:00
|
|
|
global nextcolor
|
2006-05-02 01:15:29 +00:00
|
|
|
global colormap rowtextx
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2006-02-28 11:10:19 +00:00
|
|
|
set numcommits 0
|
|
|
|
set displayorder {}
|
2006-04-02 10:47:40 +00:00
|
|
|
set parentlist {}
|
2006-02-28 11:10:19 +00:00
|
|
|
set nextcolor 0
|
2007-08-29 11:45:21 +00:00
|
|
|
set rowidlist {}
|
|
|
|
set rowisopt {}
|
2007-09-04 16:19:56 +00:00
|
|
|
set rowfinal {}
|
2006-03-30 22:55:11 +00:00
|
|
|
set canvxmax [$canv cget -width]
|
2006-04-04 00:16:22 +00:00
|
|
|
catch {unset colormap}
|
|
|
|
catch {unset rowtextx}
|
2008-03-02 23:11:08 +00:00
|
|
|
setcanvscroll
|
2006-03-30 22:55:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc setcanvscroll {} {
|
|
|
|
global canv canv2 canv3 numcommits linespc canvxmax canvy0
|
2008-03-02 23:11:08 +00:00
|
|
|
global lastscrollset lastscrollrows
|
2006-03-30 22:55:11 +00:00
|
|
|
|
|
|
|
set ymax [expr {$canvy0 + ($numcommits - 0.5) * $linespc + 2}]
|
|
|
|
$canv conf -scrollregion [list 0 0 $canvxmax $ymax]
|
|
|
|
$canv2 conf -scrollregion [list 0 0 0 $ymax]
|
|
|
|
$canv3 conf -scrollregion [list 0 0 0 $ymax]
|
2008-03-02 23:11:08 +00:00
|
|
|
set lastscrollset [clock clicks -milliseconds]
|
|
|
|
set lastscrollrows $numcommits
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc visiblerows {} {
|
|
|
|
global canv numcommits linespc
|
|
|
|
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
if {$ymax eq {} || $ymax == 0} return
|
|
|
|
set f [$canv yview]
|
|
|
|
set y0 [expr {int([lindex $f 0] * $ymax)}]
|
|
|
|
set r0 [expr {int(($y0 - 3) / $linespc) - 1}]
|
|
|
|
if {$r0 < 0} {
|
|
|
|
set r0 0
|
|
|
|
}
|
|
|
|
set y1 [expr {int([lindex $f 1] * $ymax)}]
|
|
|
|
set r1 [expr {int(($y1 - 3) / $linespc) + 1}]
|
|
|
|
if {$r1 >= $numcommits} {
|
|
|
|
set r1 [expr {$numcommits - 1}]
|
|
|
|
}
|
|
|
|
return [list $r0 $r1]
|
|
|
|
}
|
|
|
|
|
2007-09-04 16:19:56 +00:00
|
|
|
proc layoutmore {} {
|
2007-12-06 09:50:31 +00:00
|
|
|
global commitidx viewcomplete curview
|
2008-05-20 10:51:06 +00:00
|
|
|
global numcommits pending_select curview
|
2008-03-02 23:11:08 +00:00
|
|
|
global lastscrollset lastscrollrows commitinterest
|
|
|
|
|
|
|
|
if {$lastscrollrows < 100 || $viewcomplete($curview) ||
|
|
|
|
[clock clicks -milliseconds] - $lastscrollset > 500} {
|
2006-10-31 04:00:53 +00:00
|
|
|
setcanvscroll
|
|
|
|
}
|
2006-04-06 00:18:23 +00:00
|
|
|
if {[info exists pending_select] &&
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
[commitinview $pending_select $curview]} {
|
|
|
|
selectline [rowofcommit $pending_select] 1
|
2006-04-06 00:18:23 +00:00
|
|
|
}
|
2008-03-02 23:11:08 +00:00
|
|
|
drawvisible
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc doshowlocalchanges {} {
|
2007-12-06 09:50:31 +00:00
|
|
|
global curview mainheadid
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2008-05-26 00:11:33 +00:00
|
|
|
if {$mainheadid eq {}} return
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $mainheadid $curview]} {
|
2006-09-07 00:21:39 +00:00
|
|
|
dodiffindex
|
2007-12-06 09:50:31 +00:00
|
|
|
} else {
|
|
|
|
lappend commitinterest($mainheadid) {dodiffindex}
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc dohidelocalchanges {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global nullid nullid2 lserial curview
|
2006-09-07 00:21:39 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $nullid $curview]} {
|
2008-02-13 11:12:31 +00:00
|
|
|
removefakerow $nullid
|
2007-07-13 09:49:37 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $nullid2 $curview]} {
|
2008-02-13 11:12:31 +00:00
|
|
|
removefakerow $nullid2
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
incr lserial
|
|
|
|
}
|
|
|
|
|
2007-07-13 09:49:37 +00:00
|
|
|
# spawn off a process to do git diff-index --cached HEAD
|
2006-09-07 00:21:39 +00:00
|
|
|
proc dodiffindex {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global lserial showlocalchanges
|
2008-03-10 10:54:56 +00:00
|
|
|
global isworktree
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2008-03-10 10:54:56 +00:00
|
|
|
if {!$showlocalchanges || !$isworktree} return
|
2006-09-07 00:21:39 +00:00
|
|
|
incr lserial
|
2007-07-13 09:49:37 +00:00
|
|
|
set fd [open "|git diff-index --cached HEAD" r]
|
2006-09-07 00:21:39 +00:00
|
|
|
fconfigure $fd -blocking 0
|
|
|
|
filerun $fd [list readdiffindex $fd $lserial]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc readdiffindex {fd serial} {
|
2007-12-26 12:03:43 +00:00
|
|
|
global mainheadid nullid nullid2 curview commitinfo commitdata lserial
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2007-07-13 09:49:37 +00:00
|
|
|
set isdiff 1
|
2006-09-07 00:21:39 +00:00
|
|
|
if {[gets $fd line] < 0} {
|
2007-07-13 09:49:37 +00:00
|
|
|
if {![eof $fd]} {
|
|
|
|
return 1
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
2007-07-13 09:49:37 +00:00
|
|
|
set isdiff 0
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
# we only need to see one line and we don't really care what it says...
|
|
|
|
close $fd
|
|
|
|
|
2007-12-18 22:35:33 +00:00
|
|
|
if {$serial != $lserial} {
|
|
|
|
return 0
|
2007-07-13 09:49:37 +00:00
|
|
|
}
|
|
|
|
|
2007-12-18 22:35:33 +00:00
|
|
|
# now see if there are any local changes not checked in to the index
|
|
|
|
set fd [open "|git diff-files" r]
|
|
|
|
fconfigure $fd -blocking 0
|
|
|
|
filerun $fd [list readdifffiles $fd $serial]
|
|
|
|
|
|
|
|
if {$isdiff && ![commitinview $nullid2 $curview]} {
|
2007-07-13 09:49:37 +00:00
|
|
|
# add the line for the changes in the index to the graph
|
2007-11-07 17:42:55 +00:00
|
|
|
set hl [mc "Local changes checked in to index but not committed"]
|
2007-07-13 09:49:37 +00:00
|
|
|
set commitinfo($nullid2) [list $hl {} {} {} {} " $hl\n"]
|
|
|
|
set commitdata($nullid2) "\n $hl\n"
|
2007-12-26 12:03:43 +00:00
|
|
|
if {[commitinview $nullid $curview]} {
|
2008-02-13 11:12:31 +00:00
|
|
|
removefakerow $nullid
|
2007-12-26 12:03:43 +00:00
|
|
|
}
|
2008-02-13 11:12:31 +00:00
|
|
|
insertfakerow $nullid2 $mainheadid
|
2007-12-18 22:35:33 +00:00
|
|
|
} elseif {!$isdiff && [commitinview $nullid2 $curview]} {
|
2008-02-13 11:12:31 +00:00
|
|
|
removefakerow $nullid2
|
2007-07-13 09:49:37 +00:00
|
|
|
}
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
proc readdifffiles {fd serial} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global mainheadid nullid nullid2 curview
|
2007-07-13 09:49:37 +00:00
|
|
|
global commitinfo commitdata lserial
|
|
|
|
|
|
|
|
set isdiff 1
|
|
|
|
if {[gets $fd line] < 0} {
|
|
|
|
if {![eof $fd]} {
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
set isdiff 0
|
|
|
|
}
|
|
|
|
# we only need to see one line and we don't really care what it says...
|
|
|
|
close $fd
|
|
|
|
|
2007-12-18 22:35:33 +00:00
|
|
|
if {$serial != $lserial} {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
if {$isdiff && ![commitinview $nullid $curview]} {
|
2006-09-07 00:21:39 +00:00
|
|
|
# add the line for the local diff to the graph
|
2007-11-07 17:42:55 +00:00
|
|
|
set hl [mc "Local uncommitted changes, not checked in to index"]
|
2006-09-07 00:21:39 +00:00
|
|
|
set commitinfo($nullid) [list $hl {} {} {} {} " $hl\n"]
|
|
|
|
set commitdata($nullid) "\n $hl\n"
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $nullid2 $curview]} {
|
|
|
|
set p $nullid2
|
|
|
|
} else {
|
|
|
|
set p $mainheadid
|
|
|
|
}
|
2008-02-13 11:12:31 +00:00
|
|
|
insertfakerow $nullid $p
|
2007-12-18 22:35:33 +00:00
|
|
|
} elseif {!$isdiff && [commitinview $nullid $curview]} {
|
2008-02-13 11:12:31 +00:00
|
|
|
removefakerow $nullid
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
return 0
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2007-08-24 12:16:42 +00:00
|
|
|
proc nextuse {id row} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview children
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2007-08-24 12:16:42 +00:00
|
|
|
if {[info exists children($curview,$id)]} {
|
|
|
|
foreach kid $children($curview,$id) {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $kid $curview]} {
|
2007-08-29 11:45:21 +00:00
|
|
|
return -1
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[rowofcommit $kid] > $row} {
|
|
|
|
return [rowofcommit $kid]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-08-24 12:16:42 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $id $curview]} {
|
|
|
|
return [rowofcommit $id]
|
2007-08-24 12:16:42 +00:00
|
|
|
}
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
|
2007-09-04 16:19:56 +00:00
|
|
|
proc prevuse {id row} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview children
|
2007-09-04 16:19:56 +00:00
|
|
|
|
|
|
|
set ret -1
|
|
|
|
if {[info exists children($curview,$id)]} {
|
|
|
|
foreach kid $children($curview,$id) {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $kid $curview]} break
|
|
|
|
if {[rowofcommit $kid] < $row} {
|
|
|
|
set ret [rowofcommit $kid]
|
2007-08-13 04:52:00 +00:00
|
|
|
}
|
|
|
|
}
|
2007-09-04 16:19:56 +00:00
|
|
|
}
|
|
|
|
return $ret
|
|
|
|
}
|
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
proc make_idlist {row} {
|
|
|
|
global displayorder parentlist uparrowlen downarrowlen mingaplen
|
2007-12-10 23:45:38 +00:00
|
|
|
global commitidx curview children
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
set r [expr {$row - $mingaplen - $downarrowlen - 1}]
|
|
|
|
if {$r < 0} {
|
|
|
|
set r 0
|
2007-08-24 12:16:42 +00:00
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
set ra [expr {$row - $downarrowlen}]
|
|
|
|
if {$ra < 0} {
|
|
|
|
set ra 0
|
|
|
|
}
|
|
|
|
set rb [expr {$row + $uparrowlen}]
|
|
|
|
if {$rb > $commitidx($curview)} {
|
|
|
|
set rb $commitidx($curview)
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
make_disporder $r [expr {$rb + 1}]
|
2007-08-29 11:45:21 +00:00
|
|
|
set ids {}
|
|
|
|
for {} {$r < $ra} {incr r} {
|
|
|
|
set nextid [lindex $displayorder [expr {$r + 1}]]
|
|
|
|
foreach p [lindex $parentlist $r] {
|
|
|
|
if {$p eq $nextid} continue
|
|
|
|
set rn [nextuse $p $r]
|
|
|
|
if {$rn >= $row &&
|
|
|
|
$rn <= $r + $downarrowlen + $mingaplen + $uparrowlen} {
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend ids [list [ordertoken $p] $p]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
}
|
|
|
|
for {} {$r < $row} {incr r} {
|
|
|
|
set nextid [lindex $displayorder [expr {$r + 1}]]
|
|
|
|
foreach p [lindex $parentlist $r] {
|
|
|
|
if {$p eq $nextid} continue
|
|
|
|
set rn [nextuse $p $r]
|
|
|
|
if {$rn < 0 || $rn >= $row} {
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend ids [list [ordertoken $p] $p]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
}
|
|
|
|
set id [lindex $displayorder $row]
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend ids [list [ordertoken $id] $id]
|
2007-08-29 11:45:21 +00:00
|
|
|
while {$r < $rb} {
|
|
|
|
foreach p [lindex $parentlist $r] {
|
|
|
|
set firstkid [lindex $children($curview,$p) 0]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[rowofcommit $firstkid] < $row} {
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend ids [list [ordertoken $p] $p]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
incr r
|
|
|
|
set id [lindex $displayorder $r]
|
|
|
|
if {$id ne {}} {
|
|
|
|
set firstkid [lindex $children($curview,$id) 0]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$firstkid ne {} && [rowofcommit $firstkid] < $row} {
|
2007-12-10 23:45:38 +00:00
|
|
|
lappend ids [list [ordertoken $id] $id]
|
2007-08-29 11:45:21 +00:00
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
set idlist {}
|
|
|
|
foreach idx [lsort -unique $ids] {
|
|
|
|
lappend idlist [lindex $idx 1]
|
|
|
|
}
|
|
|
|
return $idlist
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2007-09-04 16:19:56 +00:00
|
|
|
proc rowsequal {a b} {
|
|
|
|
while {[set i [lsearch -exact $a {}]] >= 0} {
|
|
|
|
set a [lreplace $a $i $i]
|
|
|
|
}
|
|
|
|
while {[set i [lsearch -exact $b {}]] >= 0} {
|
|
|
|
set b [lreplace $b $i $i]
|
|
|
|
}
|
|
|
|
return [expr {$a eq $b}]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2007-09-04 16:19:56 +00:00
|
|
|
proc makeupline {id row rend col} {
|
|
|
|
global rowidlist uparrowlen downarrowlen mingaplen
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2007-09-04 16:19:56 +00:00
|
|
|
for {set r $rend} {1} {set r $rstart} {
|
|
|
|
set rstart [prevuse $id $r]
|
|
|
|
if {$rstart < 0} return
|
|
|
|
if {$rstart < $row} break
|
|
|
|
}
|
|
|
|
if {$rstart + $uparrowlen + $mingaplen + $downarrowlen < $rend} {
|
|
|
|
set rstart [expr {$rend - $uparrowlen - 1}]
|
2006-04-02 10:47:40 +00:00
|
|
|
}
|
2007-09-04 16:19:56 +00:00
|
|
|
for {set r $rstart} {[incr r] <= $row} {} {
|
|
|
|
set idlist [lindex $rowidlist $r]
|
|
|
|
if {$idlist ne {} && [lsearch -exact $idlist $id] < 0} {
|
|
|
|
set col [idcol $idlist $id $col]
|
|
|
|
lset rowidlist $r [linsert $idlist $col $id]
|
|
|
|
changedrow $r
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
proc layoutrows {row endrow} {
|
2007-09-04 16:19:56 +00:00
|
|
|
global rowidlist rowisopt rowfinal displayorder
|
2007-08-29 11:45:21 +00:00
|
|
|
global uparrowlen downarrowlen maxwidth mingaplen
|
|
|
|
global children parentlist
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global commitidx viewcomplete curview
|
2006-02-19 11:44:47 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
make_disporder [expr {$row - 1}] [expr {$endrow + $uparrowlen}]
|
2007-08-29 11:45:21 +00:00
|
|
|
set idlist {}
|
|
|
|
if {$row > 0} {
|
2007-09-14 23:04:11 +00:00
|
|
|
set rm1 [expr {$row - 1}]
|
|
|
|
foreach id [lindex $rowidlist $rm1] {
|
2007-08-29 11:45:21 +00:00
|
|
|
if {$id ne {}} {
|
|
|
|
lappend idlist $id
|
|
|
|
}
|
|
|
|
}
|
2007-09-14 23:04:11 +00:00
|
|
|
set final [lindex $rowfinal $rm1]
|
2006-04-02 10:47:40 +00:00
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
for {} {$row < $endrow} {incr row} {
|
|
|
|
set rm1 [expr {$row - 1}]
|
2007-09-14 23:04:11 +00:00
|
|
|
if {$rm1 < 0 || $idlist eq {}} {
|
2007-08-29 11:45:21 +00:00
|
|
|
set idlist [make_idlist $row]
|
2007-09-04 16:19:56 +00:00
|
|
|
set final 1
|
2007-08-29 11:45:21 +00:00
|
|
|
} else {
|
|
|
|
set id [lindex $displayorder $rm1]
|
|
|
|
set col [lsearch -exact $idlist $id]
|
|
|
|
set idlist [lreplace $idlist $col $col]
|
|
|
|
foreach p [lindex $parentlist $rm1] {
|
|
|
|
if {[lsearch -exact $idlist $p] < 0} {
|
|
|
|
set col [idcol $idlist $p $col]
|
|
|
|
set idlist [linsert $idlist $col $p]
|
2007-09-04 16:19:56 +00:00
|
|
|
# if not the first child, we have to insert a line going up
|
|
|
|
if {$id ne [lindex $children($curview,$p) 0]} {
|
|
|
|
makeupline $p $rm1 $row $col
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
set id [lindex $displayorder $row]
|
|
|
|
if {$row > $downarrowlen} {
|
|
|
|
set termrow [expr {$row - $downarrowlen - 1}]
|
|
|
|
foreach p [lindex $parentlist $termrow] {
|
|
|
|
set i [lsearch -exact $idlist $p]
|
|
|
|
if {$i < 0} continue
|
|
|
|
set nr [nextuse $p $termrow]
|
|
|
|
if {$nr < 0 || $nr >= $row + $mingaplen + $uparrowlen} {
|
|
|
|
set idlist [lreplace $idlist $i $i]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set col [lsearch -exact $idlist $id]
|
|
|
|
if {$col < 0} {
|
|
|
|
set col [idcol $idlist $id]
|
|
|
|
set idlist [linsert $idlist $col $id]
|
2007-09-04 16:19:56 +00:00
|
|
|
if {$children($curview,$id) ne {}} {
|
|
|
|
makeupline $id $rm1 $row $col
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
}
|
|
|
|
set r [expr {$row + $uparrowlen - 1}]
|
|
|
|
if {$r < $commitidx($curview)} {
|
|
|
|
set x $col
|
|
|
|
foreach p [lindex $parentlist $r] {
|
|
|
|
if {[lsearch -exact $idlist $p] >= 0} continue
|
|
|
|
set fk [lindex $children($curview,$p) 0]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[rowofcommit $fk] < $row} {
|
2007-08-29 11:45:21 +00:00
|
|
|
set x [idcol $idlist $p $x]
|
|
|
|
set idlist [linsert $idlist $x $p]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[incr r] < $commitidx($curview)} {
|
|
|
|
set p [lindex $displayorder $r]
|
|
|
|
if {[lsearch -exact $idlist $p] < 0} {
|
|
|
|
set fk [lindex $children($curview,$p) 0]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$fk ne {} && [rowofcommit $fk] < $row} {
|
2007-08-29 11:45:21 +00:00
|
|
|
set x [idcol $idlist $p $x]
|
|
|
|
set idlist [linsert $idlist $x $p]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2007-09-04 16:19:56 +00:00
|
|
|
if {$final && !$viewcomplete($curview) &&
|
|
|
|
$row + $uparrowlen + $mingaplen + $downarrowlen
|
|
|
|
>= $commitidx($curview)} {
|
|
|
|
set final 0
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
set l [llength $rowidlist]
|
|
|
|
if {$row == $l} {
|
|
|
|
lappend rowidlist $idlist
|
|
|
|
lappend rowisopt 0
|
2007-09-04 16:19:56 +00:00
|
|
|
lappend rowfinal $final
|
2007-08-29 11:45:21 +00:00
|
|
|
} elseif {$row < $l} {
|
2007-09-04 16:19:56 +00:00
|
|
|
if {![rowsequal $idlist [lindex $rowidlist $row]]} {
|
2007-08-29 11:45:21 +00:00
|
|
|
lset rowidlist $row $idlist
|
|
|
|
changedrow $row
|
|
|
|
}
|
2007-09-14 23:04:11 +00:00
|
|
|
lset rowfinal $row $final
|
2007-08-29 11:45:21 +00:00
|
|
|
} else {
|
2007-09-04 16:19:56 +00:00
|
|
|
set pad [ntimes [expr {$row - $l}] {}]
|
|
|
|
set rowidlist [concat $rowidlist $pad]
|
2007-08-29 11:45:21 +00:00
|
|
|
lappend rowidlist $idlist
|
2007-09-04 16:19:56 +00:00
|
|
|
set rowfinal [concat $rowfinal $pad]
|
|
|
|
lappend rowfinal $final
|
2007-08-29 11:45:21 +00:00
|
|
|
set rowisopt [concat $rowisopt [ntimes [expr {$row - $l + 1}] 0]]
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
return $row
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
proc changedrow {row} {
|
|
|
|
global displayorder iddrawn rowisopt need_redisplay
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
set l [llength $rowisopt]
|
|
|
|
if {$row < $l} {
|
|
|
|
lset rowisopt $row 0
|
|
|
|
if {$row + 1 < $l} {
|
|
|
|
lset rowisopt [expr {$row + 1}] 0
|
|
|
|
if {$row + 2 < $l} {
|
|
|
|
lset rowisopt [expr {$row + 2}] 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set id [lindex $displayorder $row]
|
|
|
|
if {[info exists iddrawn($id)]} {
|
|
|
|
set need_redisplay 1
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc insert_pad {row col npad} {
|
2007-07-31 11:03:06 +00:00
|
|
|
global rowidlist
|
2006-02-19 11:44:47 +00:00
|
|
|
|
|
|
|
set pad [ntimes $npad {}]
|
2007-08-12 02:42:57 +00:00
|
|
|
set idlist [lindex $rowidlist $row]
|
|
|
|
set bef [lrange $idlist 0 [expr {$col - 1}]]
|
|
|
|
set aft [lrange $idlist $col end]
|
|
|
|
set i [lsearch -exact $aft {}]
|
|
|
|
if {$i > 0} {
|
|
|
|
set aft [lreplace $aft $i $i]
|
|
|
|
}
|
|
|
|
lset rowidlist $row [concat $bef $pad $aft]
|
2007-08-29 11:45:21 +00:00
|
|
|
changedrow $row
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc optimize_rows {row col endrow} {
|
2007-08-29 11:45:21 +00:00
|
|
|
global rowidlist rowisopt displayorder curview children
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2007-07-31 11:03:06 +00:00
|
|
|
if {$row < 1} {
|
|
|
|
set row 1
|
|
|
|
}
|
2007-08-29 11:45:21 +00:00
|
|
|
for {} {$row < $endrow} {incr row; set col 0} {
|
|
|
|
if {[lindex $rowisopt $row]} continue
|
2006-02-19 11:44:47 +00:00
|
|
|
set haspad 0
|
2007-07-31 11:03:06 +00:00
|
|
|
set y0 [expr {$row - 1}]
|
|
|
|
set ym [expr {$row - 2}]
|
2007-08-29 11:45:21 +00:00
|
|
|
set idlist [lindex $rowidlist $row]
|
|
|
|
set previdlist [lindex $rowidlist $y0]
|
|
|
|
if {$idlist eq {} || $previdlist eq {}} continue
|
|
|
|
if {$ym >= 0} {
|
|
|
|
set pprevidlist [lindex $rowidlist $ym]
|
|
|
|
if {$pprevidlist eq {}} continue
|
|
|
|
} else {
|
|
|
|
set pprevidlist {}
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
set x0 -1
|
|
|
|
set xm -1
|
|
|
|
for {} {$col < [llength $idlist]} {incr col} {
|
|
|
|
set id [lindex $idlist $col]
|
|
|
|
if {[lindex $previdlist $col] eq $id} continue
|
|
|
|
if {$id eq {}} {
|
2006-02-19 11:44:47 +00:00
|
|
|
set haspad 1
|
|
|
|
continue
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
set x0 [lsearch -exact $previdlist $id]
|
|
|
|
if {$x0 < 0} continue
|
|
|
|
set z [expr {$x0 - $col}]
|
2006-02-19 11:44:47 +00:00
|
|
|
set isarrow 0
|
2007-07-31 11:03:06 +00:00
|
|
|
set z0 {}
|
|
|
|
if {$ym >= 0} {
|
|
|
|
set xm [lsearch -exact $pprevidlist $id]
|
|
|
|
if {$xm >= 0} {
|
|
|
|
set z0 [expr {$xm - $x0}]
|
|
|
|
}
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
if {$z0 eq {}} {
|
2007-08-22 12:35:28 +00:00
|
|
|
# if row y0 is the first child of $id then it's not an arrow
|
|
|
|
if {[lindex $children($curview,$id) 0] ne
|
|
|
|
[lindex $displayorder $y0]} {
|
2006-02-19 11:44:47 +00:00
|
|
|
set isarrow 1
|
|
|
|
}
|
|
|
|
}
|
2007-08-12 02:42:57 +00:00
|
|
|
if {!$isarrow && $id ne [lindex $displayorder $row] &&
|
|
|
|
[lsearch -exact [lindex $rowidlist [expr {$row+1}]] $id] < 0} {
|
|
|
|
set isarrow 1
|
|
|
|
}
|
2006-09-14 23:45:23 +00:00
|
|
|
# Looking at lines from this row to the previous row,
|
|
|
|
# make them go straight up if they end in an arrow on
|
|
|
|
# the previous row; otherwise make them go straight up
|
|
|
|
# or at 45 degrees.
|
2006-02-19 11:44:47 +00:00
|
|
|
if {$z < -1 || ($z < 0 && $isarrow)} {
|
2006-09-14 23:45:23 +00:00
|
|
|
# Line currently goes left too much;
|
|
|
|
# insert pads in the previous row, then optimize it
|
2006-02-19 11:44:47 +00:00
|
|
|
set npad [expr {-1 - $z + $isarrow}]
|
|
|
|
insert_pad $y0 $x0 $npad
|
|
|
|
if {$y0 > 0} {
|
|
|
|
optimize_rows $y0 $x0 $row
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
set previdlist [lindex $rowidlist $y0]
|
|
|
|
set x0 [lsearch -exact $previdlist $id]
|
|
|
|
set z [expr {$x0 - $col}]
|
|
|
|
if {$z0 ne {}} {
|
|
|
|
set pprevidlist [lindex $rowidlist $ym]
|
|
|
|
set xm [lsearch -exact $pprevidlist $id]
|
|
|
|
set z0 [expr {$xm - $x0}]
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
} elseif {$z > 1 || ($z > 0 && $isarrow)} {
|
2006-09-14 23:45:23 +00:00
|
|
|
# Line currently goes right too much;
|
2007-07-31 11:03:06 +00:00
|
|
|
# insert pads in this line
|
2006-02-19 11:44:47 +00:00
|
|
|
set npad [expr {$z - 1 + $isarrow}]
|
2007-08-12 02:42:57 +00:00
|
|
|
insert_pad $row $col $npad
|
|
|
|
set idlist [lindex $rowidlist $row]
|
2006-02-19 11:44:47 +00:00
|
|
|
incr col $npad
|
2007-07-31 11:03:06 +00:00
|
|
|
set z [expr {$x0 - $col}]
|
2006-02-19 11:44:47 +00:00
|
|
|
set haspad 1
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
if {$z0 eq {} && !$isarrow && $ym >= 0} {
|
2006-03-18 12:11:37 +00:00
|
|
|
# this line links to its first child on row $row-2
|
2007-07-31 11:03:06 +00:00
|
|
|
set id [lindex $displayorder $ym]
|
|
|
|
set xc [lsearch -exact $pprevidlist $id]
|
2006-03-18 12:11:37 +00:00
|
|
|
if {$xc >= 0} {
|
|
|
|
set z0 [expr {$xc - $x0}]
|
|
|
|
}
|
|
|
|
}
|
2006-09-14 23:45:23 +00:00
|
|
|
# avoid lines jigging left then immediately right
|
2006-02-19 11:44:47 +00:00
|
|
|
if {$z0 ne {} && $z < 0 && $z0 > 0} {
|
|
|
|
insert_pad $y0 $x0 1
|
2007-07-31 11:03:06 +00:00
|
|
|
incr x0
|
|
|
|
optimize_rows $y0 $x0 $row
|
|
|
|
set previdlist [lindex $rowidlist $y0]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if {!$haspad} {
|
2006-09-14 23:45:23 +00:00
|
|
|
# Find the first column that doesn't have a line going right
|
2006-02-19 11:44:47 +00:00
|
|
|
for {set col [llength $idlist]} {[incr col -1] >= 0} {} {
|
2007-07-31 11:03:06 +00:00
|
|
|
set id [lindex $idlist $col]
|
|
|
|
if {$id eq {}} break
|
|
|
|
set x0 [lsearch -exact $previdlist $id]
|
|
|
|
if {$x0 < 0} {
|
2006-03-18 12:11:37 +00:00
|
|
|
# check if this is the link to the first child
|
2007-08-22 12:35:28 +00:00
|
|
|
set kid [lindex $displayorder $y0]
|
|
|
|
if {[lindex $children($curview,$id) 0] eq $kid} {
|
2006-03-18 12:11:37 +00:00
|
|
|
# it is, work out offset to child
|
2007-08-22 12:35:28 +00:00
|
|
|
set x0 [lsearch -exact $previdlist $kid]
|
2006-03-18 12:11:37 +00:00
|
|
|
}
|
|
|
|
}
|
2007-07-31 11:03:06 +00:00
|
|
|
if {$x0 <= $col} break
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2006-09-14 23:45:23 +00:00
|
|
|
# Insert a pad at that column as long as it has a line and
|
2007-07-31 11:03:06 +00:00
|
|
|
# isn't the last column
|
|
|
|
if {$x0 >= 0 && [incr col] < [llength $idlist]} {
|
2006-02-19 11:44:47 +00:00
|
|
|
set idlist [linsert $idlist $col {}]
|
2007-08-29 11:45:21 +00:00
|
|
|
lset rowidlist $row $idlist
|
|
|
|
changedrow $row
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc xc {row col} {
|
|
|
|
global canvx0 linespc
|
|
|
|
return [expr {$canvx0 + $col * $linespc}]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc yc {row} {
|
|
|
|
global canvy0 linespc
|
|
|
|
return [expr {$canvy0 + $row * $linespc}]
|
|
|
|
}
|
|
|
|
|
2006-03-02 12:00:44 +00:00
|
|
|
proc linewidth {id} {
|
|
|
|
global thickerline lthickness
|
|
|
|
|
|
|
|
set wid $lthickness
|
|
|
|
if {[info exists thickerline] && $id eq $thickerline} {
|
|
|
|
set wid [expr {2 * $lthickness}]
|
|
|
|
}
|
|
|
|
return $wid
|
|
|
|
}
|
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
proc rowranges {id} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview children uparrowlen downarrowlen
|
2007-08-22 12:35:28 +00:00
|
|
|
global rowidlist
|
2006-04-04 00:16:22 +00:00
|
|
|
|
2007-08-22 12:35:28 +00:00
|
|
|
set kids $children($curview,$id)
|
|
|
|
if {$kids eq {}} {
|
|
|
|
return {}
|
2006-10-14 09:21:02 +00:00
|
|
|
}
|
2007-08-22 12:35:28 +00:00
|
|
|
set ret {}
|
|
|
|
lappend kids $id
|
|
|
|
foreach child $kids {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $child $curview]} break
|
|
|
|
set row [rowofcommit $child]
|
2007-08-22 12:35:28 +00:00
|
|
|
if {![info exists prev]} {
|
|
|
|
lappend ret [expr {$row + 1}]
|
2006-10-15 08:03:46 +00:00
|
|
|
} else {
|
2007-08-22 12:35:28 +00:00
|
|
|
if {$row <= $prevrow} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
puts "oops children of [shortids $id] out of order [shortids $child] $row <= [shortids $prev] $prevrow"
|
2007-08-22 12:35:28 +00:00
|
|
|
}
|
|
|
|
# see if the line extends the whole way from prevrow to row
|
|
|
|
if {$row > $prevrow + $uparrowlen + $downarrowlen &&
|
|
|
|
[lsearch -exact [lindex $rowidlist \
|
|
|
|
[expr {int(($row + $prevrow) / 2)}]] $id] < 0} {
|
|
|
|
# it doesn't, see where it ends
|
|
|
|
set r [expr {$prevrow + $downarrowlen}]
|
|
|
|
if {[lsearch -exact [lindex $rowidlist $r] $id] < 0} {
|
|
|
|
while {[incr r -1] > $prevrow &&
|
|
|
|
[lsearch -exact [lindex $rowidlist $r] $id] < 0} {}
|
|
|
|
} else {
|
|
|
|
while {[incr r] <= $row &&
|
|
|
|
[lsearch -exact [lindex $rowidlist $r] $id] >= 0} {}
|
|
|
|
incr r -1
|
|
|
|
}
|
|
|
|
lappend ret $r
|
|
|
|
# see where it starts up again
|
|
|
|
set r [expr {$row - $uparrowlen}]
|
|
|
|
if {[lsearch -exact [lindex $rowidlist $r] $id] < 0} {
|
|
|
|
while {[incr r] < $row &&
|
|
|
|
[lsearch -exact [lindex $rowidlist $r] $id] < 0} {}
|
|
|
|
} else {
|
|
|
|
while {[incr r -1] >= $prevrow &&
|
|
|
|
[lsearch -exact [lindex $rowidlist $r] $id] >= 0} {}
|
|
|
|
incr r
|
|
|
|
}
|
|
|
|
lappend ret $r
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$child eq $id} {
|
|
|
|
lappend ret $row
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set prev $child
|
2007-08-22 12:35:28 +00:00
|
|
|
set prevrow $row
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-08-22 12:35:28 +00:00
|
|
|
return $ret
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc drawlineseg {id row endrow arrowlow} {
|
|
|
|
global rowidlist displayorder iddrawn linesegs
|
2007-08-12 02:42:57 +00:00
|
|
|
global canv colormap linespc curview maxlinelen parentlist
|
2006-10-15 08:03:46 +00:00
|
|
|
|
|
|
|
set cols [list [lsearch -exact [lindex $rowidlist $row] $id]]
|
|
|
|
set le [expr {$row + 1}]
|
|
|
|
set arrowhigh 1
|
2006-02-19 11:44:47 +00:00
|
|
|
while {1} {
|
2006-10-15 08:03:46 +00:00
|
|
|
set c [lsearch -exact [lindex $rowidlist $le] $id]
|
|
|
|
if {$c < 0} {
|
|
|
|
incr le -1
|
|
|
|
break
|
|
|
|
}
|
|
|
|
lappend cols $c
|
|
|
|
set x [lindex $displayorder $le]
|
|
|
|
if {$x eq $id} {
|
|
|
|
set arrowhigh 0
|
|
|
|
break
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
if {[info exists iddrawn($x)] || $le == $endrow} {
|
|
|
|
set c [lsearch -exact [lindex $rowidlist [expr {$le+1}]] $id]
|
|
|
|
if {$c >= 0} {
|
|
|
|
lappend cols $c
|
|
|
|
set arrowhigh 0
|
|
|
|
}
|
|
|
|
break
|
|
|
|
}
|
|
|
|
incr le
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
if {$le <= $row} {
|
|
|
|
return $row
|
|
|
|
}
|
|
|
|
|
|
|
|
set lines {}
|
|
|
|
set i 0
|
|
|
|
set joinhigh 0
|
|
|
|
if {[info exists linesegs($id)]} {
|
|
|
|
set lines $linesegs($id)
|
|
|
|
foreach li $lines {
|
|
|
|
set r0 [lindex $li 0]
|
|
|
|
if {$r0 > $row} {
|
|
|
|
if {$r0 == $le && [lindex $li 1] - $row <= $maxlinelen} {
|
|
|
|
set joinhigh 1
|
|
|
|
}
|
|
|
|
break
|
|
|
|
}
|
|
|
|
incr i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set joinlow 0
|
|
|
|
if {$i > 0} {
|
|
|
|
set li [lindex $lines [expr {$i-1}]]
|
|
|
|
set r1 [lindex $li 1]
|
|
|
|
if {$r1 == $row && $le - [lindex $li 0] <= $maxlinelen} {
|
|
|
|
set joinlow 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
set x [lindex $cols [expr {$le - $row}]]
|
|
|
|
set xp [lindex $cols [expr {$le - 1 - $row}]]
|
|
|
|
set dir [expr {$xp - $x}]
|
|
|
|
if {$joinhigh} {
|
|
|
|
set ith [lindex $lines $i 2]
|
|
|
|
set coords [$canv coords $ith]
|
|
|
|
set ah [$canv itemcget $ith -arrow]
|
|
|
|
set arrowhigh [expr {$ah eq "first" || $ah eq "both"}]
|
|
|
|
set x2 [lindex $cols [expr {$le + 1 - $row}]]
|
|
|
|
if {$x2 ne {} && $x - $x2 == $dir} {
|
|
|
|
set coords [lrange $coords 0 end-2]
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set coords [list [xc $le $x] [yc $le]]
|
|
|
|
}
|
|
|
|
if {$joinlow} {
|
|
|
|
set itl [lindex $lines [expr {$i-1}] 2]
|
|
|
|
set al [$canv itemcget $itl -arrow]
|
|
|
|
set arrowlow [expr {$al eq "last" || $al eq "both"}]
|
2007-08-12 02:42:57 +00:00
|
|
|
} elseif {$arrowlow} {
|
|
|
|
if {[lsearch -exact [lindex $rowidlist [expr {$row-1}]] $id] >= 0 ||
|
|
|
|
[lsearch -exact [lindex $parentlist [expr {$row-1}]] $id] >= 0} {
|
|
|
|
set arrowlow 0
|
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
|
|
|
set arrow [lindex {none first last both} [expr {$arrowhigh + 2*$arrowlow}]]
|
|
|
|
for {set y $le} {[incr y -1] > $row} {} {
|
|
|
|
set x $xp
|
|
|
|
set xp [lindex $cols [expr {$y - 1 - $row}]]
|
|
|
|
set ndir [expr {$xp - $x}]
|
|
|
|
if {$dir != $ndir || $xp < 0} {
|
|
|
|
lappend coords [xc $y $x] [yc $y]
|
|
|
|
}
|
|
|
|
set dir $ndir
|
|
|
|
}
|
|
|
|
if {!$joinlow} {
|
|
|
|
if {$xp < 0} {
|
|
|
|
# join parent line to first child
|
|
|
|
set ch [lindex $displayorder $row]
|
|
|
|
set xc [lsearch -exact [lindex $rowidlist $row] $ch]
|
|
|
|
if {$xc < 0} {
|
|
|
|
puts "oops: drawlineseg: child $ch not on row $row"
|
2007-08-12 02:42:57 +00:00
|
|
|
} elseif {$xc != $x} {
|
|
|
|
if {($arrowhigh && $le == $row + 1) || $dir == 0} {
|
|
|
|
set d [expr {int(0.5 * $linespc)}]
|
|
|
|
set x1 [xc $row $x]
|
|
|
|
if {$xc < $x} {
|
|
|
|
set x2 [expr {$x1 - $d}]
|
|
|
|
} else {
|
|
|
|
set x2 [expr {$x1 + $d}]
|
|
|
|
}
|
|
|
|
set y2 [yc $row]
|
|
|
|
set y1 [expr {$y2 + $d}]
|
|
|
|
lappend coords $x1 $y1 $x2 $y2
|
|
|
|
} elseif {$xc < $x - 1} {
|
2006-10-15 08:03:46 +00:00
|
|
|
lappend coords [xc $row [expr {$x-1}]] [yc $row]
|
|
|
|
} elseif {$xc > $x + 1} {
|
|
|
|
lappend coords [xc $row [expr {$x+1}]] [yc $row]
|
|
|
|
}
|
|
|
|
set x $xc
|
2006-03-18 12:11:37 +00:00
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
lappend coords [xc $row $x] [yc $row]
|
|
|
|
} else {
|
|
|
|
set xn [xc $row $xp]
|
|
|
|
set yn [yc $row]
|
2007-08-12 02:42:57 +00:00
|
|
|
lappend coords $xn $yn
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
|
|
|
if {!$joinhigh} {
|
|
|
|
assigncolor $id
|
|
|
|
set t [$canv create line $coords -width [linewidth $id] \
|
|
|
|
-fill $colormap($id) -tags lines.$id -arrow $arrow]
|
|
|
|
$canv lower $t
|
|
|
|
bindline $t $id
|
|
|
|
set lines [linsert $lines $i [list $row $le $t]]
|
|
|
|
} else {
|
|
|
|
$canv coords $ith $coords
|
|
|
|
if {$arrow ne $ah} {
|
|
|
|
$canv itemconf $ith -arrow $arrow
|
|
|
|
}
|
|
|
|
lset lines $i 0 $row
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set xo [lsearch -exact [lindex $rowidlist [expr {$row - 1}]] $id]
|
|
|
|
set ndir [expr {$xo - $xp}]
|
|
|
|
set clow [$canv coords $itl]
|
|
|
|
if {$dir == $ndir} {
|
|
|
|
set clow [lrange $clow 2 end]
|
|
|
|
}
|
|
|
|
set coords [concat $coords $clow]
|
|
|
|
if {!$joinhigh} {
|
|
|
|
lset lines [expr {$i-1}] 1 $le
|
|
|
|
} else {
|
|
|
|
# coalesce two pieces
|
|
|
|
$canv delete $ith
|
|
|
|
set b [lindex $lines [expr {$i-1}] 0]
|
|
|
|
set e [lindex $lines $i 1]
|
|
|
|
set lines [lreplace $lines [expr {$i-1}] $i [list $b $e $itl]]
|
|
|
|
}
|
|
|
|
$canv coords $itl $coords
|
|
|
|
if {$arrow ne $al} {
|
|
|
|
$canv itemconf $itl -arrow $arrow
|
2006-03-30 23:45:14 +00:00
|
|
|
}
|
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
|
|
|
|
set linesegs($id) $lines
|
|
|
|
return $le
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
proc drawparentlinks {id row} {
|
|
|
|
global rowidlist canv colormap curview parentlist
|
2007-08-01 12:27:57 +00:00
|
|
|
global idpos linespc
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
set rowids [lindex $rowidlist $row]
|
|
|
|
set col [lsearch -exact $rowids $id]
|
|
|
|
if {$col < 0} return
|
|
|
|
set olds [lindex $parentlist $row]
|
2006-02-19 11:44:47 +00:00
|
|
|
set row2 [expr {$row + 1}]
|
|
|
|
set x [xc $row $col]
|
|
|
|
set y [yc $row]
|
|
|
|
set y2 [yc $row2]
|
2007-08-12 02:42:57 +00:00
|
|
|
set d [expr {int(0.5 * $linespc)}]
|
2007-08-01 12:27:57 +00:00
|
|
|
set ymid [expr {$y + $d}]
|
2006-02-28 11:10:19 +00:00
|
|
|
set ids [lindex $rowidlist $row2]
|
2006-02-19 11:44:47 +00:00
|
|
|
# rmx = right-most X coord used
|
|
|
|
set rmx 0
|
|
|
|
foreach p $olds {
|
2006-03-30 22:54:24 +00:00
|
|
|
set i [lsearch -exact $ids $p]
|
|
|
|
if {$i < 0} {
|
|
|
|
puts "oops, parent $p of $id not in list"
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
set x2 [xc $row2 $i]
|
|
|
|
if {$x2 > $rmx} {
|
|
|
|
set rmx $x2
|
|
|
|
}
|
2007-08-01 12:27:57 +00:00
|
|
|
set j [lsearch -exact $rowids $p]
|
|
|
|
if {$j < 0} {
|
2006-03-18 12:11:37 +00:00
|
|
|
# drawlineseg will do this one for us
|
|
|
|
continue
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
assigncolor $p
|
|
|
|
# should handle duplicated parents here...
|
|
|
|
set coords [list $x $y]
|
2007-08-01 12:27:57 +00:00
|
|
|
if {$i != $col} {
|
|
|
|
# if attaching to a vertical segment, draw a smaller
|
|
|
|
# slant for visual distinctness
|
|
|
|
if {$i == $j} {
|
|
|
|
if {$i < $col} {
|
|
|
|
lappend coords [expr {$x2 + $d}] $y $x2 $ymid
|
|
|
|
} else {
|
|
|
|
lappend coords [expr {$x2 - $d}] $y $x2 $ymid
|
|
|
|
}
|
|
|
|
} elseif {$i < $col && $i < $j} {
|
|
|
|
# segment slants towards us already
|
|
|
|
lappend coords [xc $row $j] $y
|
|
|
|
} else {
|
|
|
|
if {$i < $col - 1} {
|
|
|
|
lappend coords [expr {$x2 + $linespc}] $y
|
|
|
|
} elseif {$i > $col + 1} {
|
|
|
|
lappend coords [expr {$x2 - $linespc}] $y
|
|
|
|
}
|
|
|
|
lappend coords $x2 $y2
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
lappend coords $x2 $y2
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2006-03-02 12:00:44 +00:00
|
|
|
set t [$canv create line $coords -width [linewidth $p] \
|
2006-02-19 11:44:47 +00:00
|
|
|
-fill $colormap($p) -tags lines.$p]
|
|
|
|
$canv lower $t
|
|
|
|
bindline $t $p
|
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
if {$rmx > [lindex $idpos($id) 1]} {
|
|
|
|
lset idpos($id) 1 $rmx
|
|
|
|
redrawtags $id
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2006-03-02 12:00:44 +00:00
|
|
|
proc drawlines {id} {
|
2006-10-15 08:03:46 +00:00
|
|
|
global canv
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
$canv itemconf lines.$id -width [linewidth $id]
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
proc drawcmittext {id row col} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global linespc canv canv2 canv3 fgcolor curview
|
|
|
|
global cmitlisted commitinfo rowidlist parentlist
|
2006-02-19 11:44:47 +00:00
|
|
|
global rowtextx idpos idtags idheads idotherrefs
|
2007-08-29 11:45:21 +00:00
|
|
|
global linehtag linentag linedtag selectedline
|
2008-05-26 00:11:33 +00:00
|
|
|
global canvxmax boldrows boldnamerows fgcolor
|
|
|
|
global mainheadid nullid nullid2 circleitem circlecolors
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2008-02-09 22:02:07 +00:00
|
|
|
# listed is 0 for boundary, 1 for normal, 2 for negative, 3 for left, 4 for right
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set listed $cmitlisted($curview,$id)
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$id eq $nullid} {
|
|
|
|
set ofill red
|
2007-07-13 09:49:37 +00:00
|
|
|
} elseif {$id eq $nullid2} {
|
2007-07-22 12:05:30 +00:00
|
|
|
set ofill green
|
2008-05-26 00:11:33 +00:00
|
|
|
} elseif {$id eq $mainheadid} {
|
|
|
|
set ofill yellow
|
2006-09-07 00:21:39 +00:00
|
|
|
} else {
|
2008-05-26 00:11:33 +00:00
|
|
|
set ofill [lindex $circlecolors $listed]
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
set x [xc $row $col]
|
|
|
|
set y [yc $row]
|
|
|
|
set orad [expr {$linespc / 3}]
|
2008-02-09 22:02:07 +00:00
|
|
|
if {$listed <= 2} {
|
2007-07-09 12:45:47 +00:00
|
|
|
set t [$canv create oval [expr {$x - $orad}] [expr {$y - $orad}] \
|
|
|
|
[expr {$x + $orad - 1}] [expr {$y + $orad - 1}] \
|
|
|
|
-fill $ofill -outline $fgcolor -width 1 -tags circle]
|
2008-02-09 22:02:07 +00:00
|
|
|
} elseif {$listed == 3} {
|
2007-07-09 12:45:47 +00:00
|
|
|
# triangle pointing left for left-side commits
|
|
|
|
set t [$canv create polygon \
|
|
|
|
[expr {$x - $orad}] $y \
|
|
|
|
[expr {$x + $orad - 1}] [expr {$y - $orad}] \
|
|
|
|
[expr {$x + $orad - 1}] [expr {$y + $orad - 1}] \
|
|
|
|
-fill $ofill -outline $fgcolor -width 1 -tags circle]
|
|
|
|
} else {
|
|
|
|
# triangle pointing right for right-side commits
|
|
|
|
set t [$canv create polygon \
|
|
|
|
[expr {$x + $orad - 1}] $y \
|
|
|
|
[expr {$x - $orad}] [expr {$y - $orad}] \
|
|
|
|
[expr {$x - $orad}] [expr {$y + $orad - 1}] \
|
|
|
|
-fill $ofill -outline $fgcolor -width 1 -tags circle]
|
|
|
|
}
|
2008-05-26 00:11:33 +00:00
|
|
|
set circleitem($row) $t
|
2006-02-19 11:44:47 +00:00
|
|
|
$canv raise $t
|
|
|
|
$canv bind $t <1> {selcanvline {} %x %y}
|
2006-10-15 08:03:46 +00:00
|
|
|
set rmx [llength [lindex $rowidlist $row]]
|
|
|
|
set olds [lindex $parentlist $row]
|
|
|
|
if {$olds ne {}} {
|
|
|
|
set nextids [lindex $rowidlist [expr {$row + 1}]]
|
|
|
|
foreach p $olds {
|
|
|
|
set i [lsearch -exact $nextids $p]
|
|
|
|
if {$i > $rmx} {
|
|
|
|
set rmx $i
|
|
|
|
}
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
set xt [xc $row $rmx]
|
2006-02-19 11:44:47 +00:00
|
|
|
set rowtextx($row) $xt
|
|
|
|
set idpos($id) [list $x $xt $y]
|
|
|
|
if {[info exists idtags($id)] || [info exists idheads($id)]
|
|
|
|
|| [info exists idotherrefs($id)]} {
|
|
|
|
set xt [drawtags $id $x $xt $y]
|
|
|
|
}
|
|
|
|
set headline [lindex $commitinfo($id) 0]
|
|
|
|
set name [lindex $commitinfo($id) 1]
|
|
|
|
set date [lindex $commitinfo($id) 2]
|
|
|
|
set date [formatdate $date]
|
2007-10-04 12:27:13 +00:00
|
|
|
set font mainfont
|
|
|
|
set nfont mainfont
|
2008-01-07 11:16:31 +00:00
|
|
|
set isbold [ishighlighted $id]
|
2006-05-19 23:38:11 +00:00
|
|
|
if {$isbold > 0} {
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend boldrows $row
|
2007-10-04 12:27:13 +00:00
|
|
|
set font mainfontbold
|
2006-05-19 23:38:11 +00:00
|
|
|
if {$isbold > 1} {
|
2006-05-30 11:33:07 +00:00
|
|
|
lappend boldnamerows $row
|
2007-10-04 12:27:13 +00:00
|
|
|
set nfont mainfontbold
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
2006-07-05 12:56:37 +00:00
|
|
|
set linehtag($row) [$canv create text $xt $y -anchor w -fill $fgcolor \
|
|
|
|
-text $headline -font $font -tags text]
|
2006-02-19 11:44:47 +00:00
|
|
|
$canv bind $linehtag($row) <Button-3> "rowmenu %X %Y $id"
|
2006-07-05 12:56:37 +00:00
|
|
|
set linentag($row) [$canv2 create text 3 $y -anchor w -fill $fgcolor \
|
|
|
|
-text $name -font $nfont -tags text]
|
|
|
|
set linedtag($row) [$canv3 create text 3 $y -anchor w -fill $fgcolor \
|
2007-10-04 12:27:13 +00:00
|
|
|
-text $date -font mainfont -tags text]
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline == $row} {
|
2007-08-29 11:45:21 +00:00
|
|
|
make_secsel $row
|
|
|
|
}
|
2007-10-04 12:27:13 +00:00
|
|
|
set xr [expr {$xt + [font measure $font $headline]}]
|
2006-03-30 22:55:11 +00:00
|
|
|
if {$xr > $canvxmax} {
|
|
|
|
set canvxmax $xr
|
|
|
|
setcanvscroll
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc drawcmitrow {row} {
|
2007-08-29 11:45:21 +00:00
|
|
|
global displayorder rowidlist nrows_drawn
|
2007-07-26 12:36:39 +00:00
|
|
|
global iddrawn markingmatches
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global commitinfo numcommits
|
2007-09-22 02:49:33 +00:00
|
|
|
global filehighlight fhighlights findpattern nhighlights
|
2006-05-19 23:38:11 +00:00
|
|
|
global hlview vhighlights
|
2006-05-29 09:50:02 +00:00
|
|
|
global highlight_related rhighlights
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2006-02-28 11:10:19 +00:00
|
|
|
if {$row >= $numcommits} return
|
2006-02-19 11:44:47 +00:00
|
|
|
|
|
|
|
set id [lindex $displayorder $row]
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists hlview] && ![info exists vhighlights($id)]} {
|
2006-05-19 23:38:11 +00:00
|
|
|
askvhighlight $row $id
|
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {[info exists filehighlight] && ![info exists fhighlights($id)]} {
|
2006-05-19 23:38:11 +00:00
|
|
|
askfilehighlight $row $id
|
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {$findpattern ne {} && ![info exists nhighlights($id)]} {
|
2006-05-26 00:43:47 +00:00
|
|
|
askfindhighlight $row $id
|
2006-05-19 23:38:11 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {$highlight_related ne [mc "None"] && ![info exists rhighlights($id)]} {
|
2006-05-29 09:50:02 +00:00
|
|
|
askrelhighlight $row $id
|
|
|
|
}
|
2007-07-26 12:36:39 +00:00
|
|
|
if {![info exists iddrawn($id)]} {
|
|
|
|
set col [lsearch -exact [lindex $rowidlist $row] $id]
|
|
|
|
if {$col < 0} {
|
|
|
|
puts "oops, row $row id $id not in list"
|
|
|
|
return
|
|
|
|
}
|
|
|
|
if {![info exists commitinfo($id)]} {
|
|
|
|
getcommit $id
|
|
|
|
}
|
|
|
|
assigncolor $id
|
|
|
|
drawcmittext $id $row $col
|
|
|
|
set iddrawn($id) 1
|
2007-08-29 11:45:21 +00:00
|
|
|
incr nrows_drawn
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
2007-07-26 12:36:39 +00:00
|
|
|
if {$markingmatches} {
|
|
|
|
markrowmatches $row $id
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
proc drawcommits {row {endrow {}}} {
|
2007-08-29 11:45:21 +00:00
|
|
|
global numcommits iddrawn displayorder curview need_redisplay
|
2007-09-04 16:19:56 +00:00
|
|
|
global parentlist rowidlist rowfinal uparrowlen downarrowlen nrows_drawn
|
2006-02-19 11:44:47 +00:00
|
|
|
|
|
|
|
if {$row < 0} {
|
|
|
|
set row 0
|
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
if {$endrow eq {}} {
|
|
|
|
set endrow $row
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
if {$endrow >= $numcommits} {
|
|
|
|
set endrow [expr {$numcommits - 1}]
|
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
set rl1 [expr {$row - $downarrowlen - 3}]
|
|
|
|
if {$rl1 < 0} {
|
|
|
|
set rl1 0
|
|
|
|
}
|
|
|
|
set ro1 [expr {$row - 3}]
|
|
|
|
if {$ro1 < 0} {
|
|
|
|
set ro1 0
|
|
|
|
}
|
|
|
|
set r2 [expr {$endrow + $uparrowlen + 3}]
|
|
|
|
if {$r2 > $numcommits} {
|
|
|
|
set r2 $numcommits
|
|
|
|
}
|
|
|
|
for {set r $rl1} {$r < $r2} {incr r} {
|
2007-09-04 16:19:56 +00:00
|
|
|
if {[lindex $rowidlist $r] ne {} && [lindex $rowfinal $r]} {
|
2007-08-29 11:45:21 +00:00
|
|
|
if {$rl1 < $r} {
|
|
|
|
layoutrows $rl1 $r
|
|
|
|
}
|
|
|
|
set rl1 [expr {$r + 1}]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$rl1 < $r} {
|
|
|
|
layoutrows $rl1 $r
|
|
|
|
}
|
|
|
|
optimize_rows $ro1 0 $r2
|
|
|
|
if {$need_redisplay || $nrows_drawn > 2000} {
|
|
|
|
clear_display
|
|
|
|
drawvisible
|
|
|
|
}
|
|
|
|
|
2006-10-15 08:03:46 +00:00
|
|
|
# make the lines join to already-drawn rows either side
|
|
|
|
set r [expr {$row - 1}]
|
|
|
|
if {$r < 0 || ![info exists iddrawn([lindex $displayorder $r])]} {
|
|
|
|
set r $row
|
|
|
|
}
|
|
|
|
set er [expr {$endrow + 1}]
|
|
|
|
if {$er >= $numcommits ||
|
|
|
|
![info exists iddrawn([lindex $displayorder $er])]} {
|
|
|
|
set er $endrow
|
|
|
|
}
|
|
|
|
for {} {$r <= $er} {incr r} {
|
|
|
|
set id [lindex $displayorder $r]
|
|
|
|
set wasdrawn [info exists iddrawn($id)]
|
2007-07-04 09:43:51 +00:00
|
|
|
drawcmitrow $r
|
2006-10-15 08:03:46 +00:00
|
|
|
if {$r == $er} break
|
|
|
|
set nextid [lindex $displayorder [expr {$r + 1}]]
|
2007-10-21 02:58:42 +00:00
|
|
|
if {$wasdrawn && [info exists iddrawn($nextid)]} continue
|
2006-10-15 08:03:46 +00:00
|
|
|
drawparentlinks $id $r
|
|
|
|
|
|
|
|
set rowids [lindex $rowidlist $r]
|
|
|
|
foreach lid $rowids {
|
|
|
|
if {$lid eq {}} continue
|
2007-10-21 02:58:42 +00:00
|
|
|
if {[info exists lineend($lid)] && $lineend($lid) > $r} continue
|
2006-10-15 08:03:46 +00:00
|
|
|
if {$lid eq $id} {
|
|
|
|
# see if this is the first child of any of its parents
|
|
|
|
foreach p [lindex $parentlist $r] {
|
|
|
|
if {[lsearch -exact $rowids $p] < 0} {
|
|
|
|
# make this line extend up to the child
|
2007-10-21 02:58:42 +00:00
|
|
|
set lineend($p) [drawlineseg $p $r $er 0]
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
|
|
|
}
|
2007-10-21 02:58:42 +00:00
|
|
|
} else {
|
|
|
|
set lineend($lid) [drawlineseg $lid $r $er 1]
|
2006-10-15 08:03:46 +00:00
|
|
|
}
|
|
|
|
}
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc undolayout {row} {
|
|
|
|
global uparrowlen mingaplen downarrowlen
|
|
|
|
global rowidlist rowisopt rowfinal need_redisplay
|
|
|
|
|
|
|
|
set r [expr {$row - ($uparrowlen + $mingaplen + $downarrowlen)}]
|
|
|
|
if {$r < 0} {
|
|
|
|
set r 0
|
|
|
|
}
|
|
|
|
if {[llength $rowidlist] > $r} {
|
|
|
|
incr r -1
|
|
|
|
set rowidlist [lrange $rowidlist 0 $r]
|
|
|
|
set rowfinal [lrange $rowfinal 0 $r]
|
|
|
|
set rowisopt [lrange $rowisopt 0 $r]
|
|
|
|
set need_redisplay 1
|
|
|
|
run drawvisible
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-12-30 11:41:14 +00:00
|
|
|
proc drawvisible {} {
|
|
|
|
global canv linespc curview vrowmod selectedline targetrow targetid
|
2008-01-01 22:59:39 +00:00
|
|
|
global need_redisplay cscroll numcommits
|
2006-10-15 08:03:46 +00:00
|
|
|
|
2007-12-30 11:41:14 +00:00
|
|
|
set fs [$canv yview]
|
2006-10-15 08:03:46 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
2008-01-15 11:45:36 +00:00
|
|
|
if {$ymax eq {} || $ymax == 0 || $numcommits == 0} return
|
2007-12-30 11:41:14 +00:00
|
|
|
set f0 [lindex $fs 0]
|
|
|
|
set f1 [lindex $fs 1]
|
2006-10-15 08:03:46 +00:00
|
|
|
set y0 [expr {int($f0 * $ymax)}]
|
|
|
|
set y1 [expr {int($f1 * $ymax)}]
|
2007-12-30 11:41:14 +00:00
|
|
|
|
|
|
|
if {[info exists targetid]} {
|
2008-01-01 22:59:39 +00:00
|
|
|
if {[commitinview $targetid $curview]} {
|
|
|
|
set r [rowofcommit $targetid]
|
|
|
|
if {$r != $targetrow} {
|
|
|
|
# Fix up the scrollregion and change the scrolling position
|
|
|
|
# now that our target row has moved.
|
|
|
|
set diff [expr {($r - $targetrow) * $linespc}]
|
|
|
|
set targetrow $r
|
|
|
|
setcanvscroll
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
incr y0 $diff
|
|
|
|
incr y1 $diff
|
|
|
|
set f0 [expr {$y0 / $ymax}]
|
|
|
|
set f1 [expr {$y1 / $ymax}]
|
|
|
|
allcanvs yview moveto $f0
|
|
|
|
$cscroll set $f0 $f1
|
|
|
|
set need_redisplay 1
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unset targetid
|
2007-12-30 11:41:14 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
set row [expr {int(($y0 - 3) / $linespc) - 1}]
|
2006-10-15 08:03:46 +00:00
|
|
|
set endrow [expr {int(($y1 - 3) / $linespc) + 1}]
|
2007-12-30 11:41:14 +00:00
|
|
|
if {$endrow >= $vrowmod($curview)} {
|
|
|
|
update_arcrows $curview
|
|
|
|
}
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline ne {} &&
|
2007-12-30 11:41:14 +00:00
|
|
|
$row <= $selectedline && $selectedline <= $endrow} {
|
|
|
|
set targetrow $selectedline
|
2008-03-02 23:11:08 +00:00
|
|
|
} elseif {[info exists targetid]} {
|
2007-12-30 11:41:14 +00:00
|
|
|
set targetrow [expr {int(($row + $endrow) / 2)}]
|
|
|
|
}
|
2008-03-02 23:11:08 +00:00
|
|
|
if {[info exists targetrow]} {
|
|
|
|
if {$targetrow >= $numcommits} {
|
|
|
|
set targetrow [expr {$numcommits - 1}]
|
|
|
|
}
|
|
|
|
set targetid [commitonrow $targetrow]
|
2008-01-01 22:59:39 +00:00
|
|
|
}
|
2006-10-15 08:03:46 +00:00
|
|
|
drawcommits $row $endrow
|
|
|
|
}
|
|
|
|
|
2006-02-19 11:44:47 +00:00
|
|
|
proc clear_display {} {
|
2007-08-29 11:45:21 +00:00
|
|
|
global iddrawn linesegs need_redisplay nrows_drawn
|
2006-05-29 09:50:02 +00:00
|
|
|
global vhighlights fhighlights nhighlights rhighlights
|
2008-05-22 11:12:19 +00:00
|
|
|
global linehtag linentag linedtag boldrows boldnamerows
|
2006-02-19 11:44:47 +00:00
|
|
|
|
|
|
|
allcanvs delete all
|
|
|
|
catch {unset iddrawn}
|
2006-10-15 08:03:46 +00:00
|
|
|
catch {unset linesegs}
|
2008-05-18 23:48:45 +00:00
|
|
|
catch {unset linehtag}
|
|
|
|
catch {unset linentag}
|
|
|
|
catch {unset linedtag}
|
2008-05-22 11:12:19 +00:00
|
|
|
set boldrows {}
|
|
|
|
set boldnamerows {}
|
2006-05-19 23:38:11 +00:00
|
|
|
catch {unset vhighlights}
|
|
|
|
catch {unset fhighlights}
|
|
|
|
catch {unset nhighlights}
|
2006-05-29 09:50:02 +00:00
|
|
|
catch {unset rhighlights}
|
2007-08-29 11:45:21 +00:00
|
|
|
set need_redisplay 0
|
|
|
|
set nrows_drawn 0
|
2006-02-19 11:44:47 +00:00
|
|
|
}
|
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
proc findcrossings {id} {
|
2007-07-31 11:03:06 +00:00
|
|
|
global rowidlist parentlist numcommits displayorder
|
2006-04-04 00:16:22 +00:00
|
|
|
|
|
|
|
set cross {}
|
|
|
|
set ccross {}
|
|
|
|
foreach {s e} [rowranges $id] {
|
|
|
|
if {$e >= $numcommits} {
|
|
|
|
set e [expr {$numcommits - 1}]
|
|
|
|
}
|
2006-04-06 00:18:23 +00:00
|
|
|
if {$e <= $s} continue
|
2006-04-04 00:16:22 +00:00
|
|
|
for {set row $e} {[incr row -1] >= $s} {} {
|
2007-07-31 11:03:06 +00:00
|
|
|
set x [lsearch -exact [lindex $rowidlist $row] $id]
|
|
|
|
if {$x < 0} break
|
2006-04-04 00:16:22 +00:00
|
|
|
set olds [lindex $parentlist $row]
|
|
|
|
set kid [lindex $displayorder $row]
|
|
|
|
set kidx [lsearch -exact [lindex $rowidlist $row] $kid]
|
|
|
|
if {$kidx < 0} continue
|
|
|
|
set nextrow [lindex $rowidlist [expr {$row + 1}]]
|
|
|
|
foreach p $olds {
|
|
|
|
set px [lsearch -exact $nextrow $p]
|
|
|
|
if {$px < 0} continue
|
|
|
|
if {($kidx < $x && $x < $px) || ($px < $x && $x < $kidx)} {
|
|
|
|
if {[lsearch -exact $ccross $p] >= 0} continue
|
|
|
|
if {$x == $px + ($kidx < $px? -1: 1)} {
|
|
|
|
lappend ccross $p
|
|
|
|
} elseif {[lsearch -exact $cross $p] < 0} {
|
|
|
|
lappend cross $p
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return [concat $ccross {{}} $cross]
|
|
|
|
}
|
|
|
|
|
2005-05-11 23:44:54 +00:00
|
|
|
proc assigncolor {id} {
|
2006-02-28 00:27:12 +00:00
|
|
|
global colormap colors nextcolor
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global parents children children curview
|
2005-06-22 09:53:32 +00:00
|
|
|
|
2006-02-06 22:10:18 +00:00
|
|
|
if {[info exists colormap($id)]} return
|
2005-05-11 23:44:54 +00:00
|
|
|
set ncolors [llength $colors]
|
2006-05-02 01:15:29 +00:00
|
|
|
if {[info exists children($curview,$id)]} {
|
|
|
|
set kids $children($curview,$id)
|
2006-04-02 10:47:40 +00:00
|
|
|
} else {
|
|
|
|
set kids {}
|
|
|
|
}
|
|
|
|
if {[llength $kids] == 1} {
|
|
|
|
set child [lindex $kids 0]
|
2005-06-16 00:27:23 +00:00
|
|
|
if {[info exists colormap($child)]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
&& [llength $parents($curview,$child)] == 1} {
|
2005-06-16 00:27:23 +00:00
|
|
|
set colormap($id) $colormap($child)
|
|
|
|
return
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
|
|
|
set badcolors {}
|
2006-04-04 00:16:22 +00:00
|
|
|
set origbad {}
|
|
|
|
foreach x [findcrossings $id] {
|
|
|
|
if {$x eq {}} {
|
|
|
|
# delimiter between corner crossings and other crossings
|
|
|
|
if {[llength $badcolors] >= $ncolors - 1} break
|
|
|
|
set origbad $badcolors
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
2006-04-04 00:16:22 +00:00
|
|
|
if {[info exists colormap($x)]
|
|
|
|
&& [lsearch -exact $badcolors $colormap($x)] < 0} {
|
|
|
|
lappend badcolors $colormap($x)
|
2005-06-22 09:53:32 +00:00
|
|
|
}
|
|
|
|
}
|
2006-04-04 00:16:22 +00:00
|
|
|
if {[llength $badcolors] >= $ncolors} {
|
|
|
|
set badcolors $origbad
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
2006-04-04 00:16:22 +00:00
|
|
|
set origbad $badcolors
|
2005-06-22 09:53:32 +00:00
|
|
|
if {[llength $badcolors] < $ncolors - 1} {
|
2006-04-02 10:47:40 +00:00
|
|
|
foreach child $kids {
|
2005-06-22 09:53:32 +00:00
|
|
|
if {[info exists colormap($child)]
|
|
|
|
&& [lsearch -exact $badcolors $colormap($child)] < 0} {
|
|
|
|
lappend badcolors $colormap($child)
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
foreach p $parents($curview,$child) {
|
2006-04-02 10:47:40 +00:00
|
|
|
if {[info exists colormap($p)]
|
|
|
|
&& [lsearch -exact $badcolors $colormap($p)] < 0} {
|
|
|
|
lappend badcolors $colormap($p)
|
2005-06-22 09:53:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[llength $badcolors] >= $ncolors} {
|
|
|
|
set badcolors $origbad
|
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
|
|
|
for {set i 0} {$i <= $ncolors} {incr i} {
|
|
|
|
set c [lindex $colors $nextcolor]
|
|
|
|
if {[incr nextcolor] >= $ncolors} {
|
|
|
|
set nextcolor 0
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
if {[lsearch -exact $badcolors $c]} break
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
set colormap($id) $c
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
|
|
|
|
2005-06-21 00:01:38 +00:00
|
|
|
proc bindline {t id} {
|
|
|
|
global canv
|
|
|
|
|
|
|
|
$canv bind $t <Enter> "lineenter %x %y $id"
|
|
|
|
$canv bind $t <Motion> "linemotion %x %y $id"
|
|
|
|
$canv bind $t <Leave> "lineleave $id"
|
2005-08-07 23:47:22 +00:00
|
|
|
$canv bind $t <Button-1> "lineclick %x %y $id 1"
|
2005-06-21 00:01:38 +00:00
|
|
|
}
|
|
|
|
|
2005-06-27 12:56:40 +00:00
|
|
|
proc drawtags {id x xt y1} {
|
2006-07-06 00:21:23 +00:00
|
|
|
global idtags idheads idotherrefs mainhead
|
2005-06-27 12:56:40 +00:00
|
|
|
global linespc lthickness
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global canv rowtextx curview fgcolor bgcolor
|
2005-06-27 12:56:40 +00:00
|
|
|
|
|
|
|
set marks {}
|
|
|
|
set ntags 0
|
2005-08-19 12:14:28 +00:00
|
|
|
set nheads 0
|
2005-06-27 12:56:40 +00:00
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
set marks $idtags($id)
|
|
|
|
set ntags [llength $marks]
|
|
|
|
}
|
|
|
|
if {[info exists idheads($id)]} {
|
|
|
|
set marks [concat $marks $idheads($id)]
|
2005-08-19 12:14:28 +00:00
|
|
|
set nheads [llength $idheads($id)]
|
|
|
|
}
|
|
|
|
if {[info exists idotherrefs($id)]} {
|
|
|
|
set marks [concat $marks $idotherrefs($id)]
|
2005-06-27 12:56:40 +00:00
|
|
|
}
|
|
|
|
if {$marks eq {}} {
|
|
|
|
return $xt
|
|
|
|
}
|
|
|
|
|
|
|
|
set delta [expr {int(0.5 * ($linespc - $lthickness))}]
|
2005-11-23 01:39:53 +00:00
|
|
|
set yt [expr {$y1 - 0.5 * $linespc}]
|
|
|
|
set yb [expr {$yt + $linespc - 1}]
|
2005-06-27 12:56:40 +00:00
|
|
|
set xvals {}
|
|
|
|
set wvals {}
|
2006-07-06 00:21:23 +00:00
|
|
|
set i -1
|
2005-06-27 12:56:40 +00:00
|
|
|
foreach tag $marks {
|
2006-07-06 00:21:23 +00:00
|
|
|
incr i
|
|
|
|
if {$i >= $ntags && $i < $ntags + $nheads && $tag eq $mainhead} {
|
2007-10-04 12:27:13 +00:00
|
|
|
set wid [font measure mainfontbold $tag]
|
2006-07-06 00:21:23 +00:00
|
|
|
} else {
|
2007-10-04 12:27:13 +00:00
|
|
|
set wid [font measure mainfont $tag]
|
2006-07-06 00:21:23 +00:00
|
|
|
}
|
2005-06-27 12:56:40 +00:00
|
|
|
lappend xvals $xt
|
|
|
|
lappend wvals $wid
|
|
|
|
set xt [expr {$xt + $delta + $wid + $lthickness + $linespc}]
|
|
|
|
}
|
|
|
|
set t [$canv create line $x $y1 [lindex $xvals end] $y1 \
|
|
|
|
-width $lthickness -fill black -tags tag.$id]
|
|
|
|
$canv lower $t
|
|
|
|
foreach tag $marks x $xvals wid $wvals {
|
2005-11-23 01:39:53 +00:00
|
|
|
set xl [expr {$x + $delta}]
|
|
|
|
set xr [expr {$x + $delta + $wid + $lthickness}]
|
2007-10-04 12:27:13 +00:00
|
|
|
set font mainfont
|
2005-06-27 12:56:40 +00:00
|
|
|
if {[incr ntags -1] >= 0} {
|
|
|
|
# draw a tag
|
2005-11-23 01:39:53 +00:00
|
|
|
set t [$canv create polygon $x [expr {$yt + $delta}] $xl $yt \
|
|
|
|
$xr $yt $xr $yb $xl $yb $x [expr {$yb - $delta}] \
|
2005-08-19 13:11:39 +00:00
|
|
|
-width 1 -outline black -fill yellow -tags tag.$id]
|
|
|
|
$canv bind $t <1> [list showtag $tag 1]
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set rowtextx([rowofcommit $id]) [expr {$xr + $linespc}]
|
2005-06-27 12:56:40 +00:00
|
|
|
} else {
|
2005-08-19 12:14:28 +00:00
|
|
|
# draw a head or other ref
|
|
|
|
if {[incr nheads -1] >= 0} {
|
|
|
|
set col green
|
2006-07-06 00:21:23 +00:00
|
|
|
if {$tag eq $mainhead} {
|
2007-10-04 12:27:13 +00:00
|
|
|
set font mainfontbold
|
2006-07-06 00:21:23 +00:00
|
|
|
}
|
2005-08-19 12:14:28 +00:00
|
|
|
} else {
|
|
|
|
set col "#ddddff"
|
|
|
|
}
|
2005-11-23 01:39:53 +00:00
|
|
|
set xl [expr {$xl - $delta/2}]
|
2005-06-27 12:56:40 +00:00
|
|
|
$canv create polygon $x $yt $xr $yt $xr $yb $x $yb \
|
2005-08-19 12:14:28 +00:00
|
|
|
-width 1 -outline black -fill $col -tags tag.$id
|
2006-04-18 21:53:07 +00:00
|
|
|
if {[regexp {^(remotes/.*/|remotes/)} $tag match remoteprefix]} {
|
2007-10-04 12:27:13 +00:00
|
|
|
set rwid [font measure mainfont $remoteprefix]
|
2006-04-18 21:53:07 +00:00
|
|
|
set xi [expr {$x + 1}]
|
|
|
|
set yti [expr {$yt + 1}]
|
|
|
|
set xri [expr {$x + $rwid}]
|
|
|
|
$canv create polygon $xi $yti $xri $yti $xri $yb $xi $yb \
|
|
|
|
-width 0 -fill "#ffddaa" -tags tag.$id
|
|
|
|
}
|
2005-06-27 12:56:40 +00:00
|
|
|
}
|
2006-07-05 12:56:37 +00:00
|
|
|
set t [$canv create text $xl $y1 -anchor w -text $tag -fill $fgcolor \
|
2006-07-06 00:21:23 +00:00
|
|
|
-font $font -tags [list tag.$id text]]
|
2005-08-19 13:11:39 +00:00
|
|
|
if {$ntags >= 0} {
|
|
|
|
$canv bind $t <1> [list showtag $tag 1]
|
2006-08-01 23:52:01 +00:00
|
|
|
} elseif {$nheads >= 0} {
|
|
|
|
$canv bind $t <Button-3> [list headmenu %X %Y $id $tag]
|
2005-08-19 13:11:39 +00:00
|
|
|
}
|
2005-06-27 12:56:40 +00:00
|
|
|
}
|
|
|
|
return $xt
|
|
|
|
}
|
|
|
|
|
2005-08-04 23:52:16 +00:00
|
|
|
proc xcoord {i level ln} {
|
|
|
|
global canvx0 xspc1 xspc2
|
|
|
|
|
|
|
|
set x [expr {$canvx0 + $i * $xspc1($ln)}]
|
|
|
|
if {$i > 0 && $i == $level} {
|
|
|
|
set x [expr {$x + 0.5 * ($xspc2 - $xspc1($ln))}]
|
|
|
|
} elseif {$i > $level} {
|
|
|
|
set x [expr {$x + $xspc2 - $xspc1($ln)}]
|
|
|
|
}
|
|
|
|
return $x
|
|
|
|
}
|
2005-06-16 00:27:23 +00:00
|
|
|
|
2006-05-02 23:32:53 +00:00
|
|
|
proc show_status {msg} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global canv fgcolor
|
2006-05-02 23:32:53 +00:00
|
|
|
|
|
|
|
clear_display
|
2007-10-04 12:27:13 +00:00
|
|
|
$canv create text 3 3 -anchor nw -text $msg -font mainfont \
|
2006-07-05 12:56:37 +00:00
|
|
|
-tags text -fill $fgcolor
|
2006-05-02 23:32:53 +00:00
|
|
|
}
|
|
|
|
|
2005-08-07 05:27:57 +00:00
|
|
|
# Don't change the text pane cursor if it is currently the hand cursor,
|
|
|
|
# showing that we are over a sha1 ID link.
|
|
|
|
proc settextcursor {c} {
|
|
|
|
global ctext curtextcursor
|
|
|
|
|
|
|
|
if {[$ctext cget -cursor] == $curtextcursor} {
|
|
|
|
$ctext config -cursor $c
|
|
|
|
}
|
|
|
|
set curtextcursor $c
|
2005-06-16 00:27:23 +00:00
|
|
|
}
|
|
|
|
|
2007-10-23 11:12:49 +00:00
|
|
|
proc nowbusy {what {name {}}} {
|
|
|
|
global isbusy busyname statusw
|
2006-05-02 01:15:29 +00:00
|
|
|
|
|
|
|
if {[array names isbusy] eq {}} {
|
|
|
|
. config -cursor watch
|
|
|
|
settextcursor watch
|
|
|
|
}
|
|
|
|
set isbusy($what) 1
|
2007-10-23 11:12:49 +00:00
|
|
|
set busyname($what) $name
|
|
|
|
if {$name ne {}} {
|
|
|
|
$statusw conf -text $name
|
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc notbusy {what} {
|
2007-10-23 11:12:49 +00:00
|
|
|
global isbusy maincursor textcursor busyname statusw
|
2006-05-02 01:15:29 +00:00
|
|
|
|
2007-10-23 11:12:49 +00:00
|
|
|
catch {
|
|
|
|
unset isbusy($what)
|
|
|
|
if {$busyname($what) ne {} &&
|
|
|
|
[$statusw cget -text] eq $busyname($what)} {
|
|
|
|
$statusw conf -text {}
|
|
|
|
}
|
|
|
|
}
|
2006-05-02 01:15:29 +00:00
|
|
|
if {[array names isbusy] eq {}} {
|
|
|
|
. config -cursor $maincursor
|
|
|
|
settextcursor $textcursor
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-05-17 23:23:07 +00:00
|
|
|
proc findmatches {f} {
|
2007-07-04 09:43:51 +00:00
|
|
|
global findtype findstring
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findtype == [mc "Regexp"]} {
|
2007-07-04 09:43:51 +00:00
|
|
|
set matches [regexp -indices -all -inline $findstring $f]
|
2005-05-17 23:23:07 +00:00
|
|
|
} else {
|
2007-07-04 09:43:51 +00:00
|
|
|
set fs $findstring
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findtype == [mc "IgnCase"]} {
|
2007-07-04 09:43:51 +00:00
|
|
|
set f [string tolower $f]
|
|
|
|
set fs [string tolower $fs]
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
set matches {}
|
|
|
|
set i 0
|
2007-07-04 09:43:51 +00:00
|
|
|
set l [string length $fs]
|
|
|
|
while {[set j [string first $fs $f $i]] >= 0} {
|
|
|
|
lappend matches [list $j [expr {$j+$l-1}]]
|
|
|
|
set i [expr {$j + $l}]
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return $matches
|
|
|
|
}
|
|
|
|
|
2007-10-27 11:16:56 +00:00
|
|
|
proc dofind {{dirn 1} {wrap 1}} {
|
2007-07-04 09:43:51 +00:00
|
|
|
global findstring findstartline findcurline selectedline numcommits
|
2007-10-27 11:16:56 +00:00
|
|
|
global gdttype filehighlight fh_serial find_dirn findallowwrap
|
2005-07-16 11:46:13 +00:00
|
|
|
|
2007-10-27 11:16:56 +00:00
|
|
|
if {[info exists find_dirn]} {
|
|
|
|
if {$find_dirn == $dirn} return
|
|
|
|
stopfinding
|
|
|
|
}
|
2005-05-17 23:23:07 +00:00
|
|
|
focus .
|
2007-07-04 09:43:51 +00:00
|
|
|
if {$findstring eq {} || $numcommits == 0} return
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} {
|
2007-10-27 11:16:56 +00:00
|
|
|
set findstartline [lindex [visiblerows] [expr {$dirn < 0}]]
|
2005-05-15 05:56:51 +00:00
|
|
|
} else {
|
2007-07-04 09:43:51 +00:00
|
|
|
set findstartline $selectedline
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
set findcurline $findstartline
|
2007-11-07 17:44:35 +00:00
|
|
|
nowbusy finding [mc "Searching"]
|
|
|
|
if {$gdttype ne [mc "containing:"] && ![info exists filehighlight]} {
|
2007-09-22 02:49:33 +00:00
|
|
|
after cancel do_file_hl $fh_serial
|
|
|
|
do_file_hl $fh_serial
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
2007-10-27 11:16:56 +00:00
|
|
|
set find_dirn $dirn
|
|
|
|
set findallowwrap $wrap
|
|
|
|
run findmore
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
proc stopfinding {} {
|
|
|
|
global find_dirn findcurline fprogcoord
|
2007-07-04 09:43:51 +00:00
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
if {[info exists find_dirn]} {
|
|
|
|
unset find_dirn
|
|
|
|
unset findcurline
|
|
|
|
notbusy finding
|
|
|
|
set fprogcoord 0
|
|
|
|
adjustprogress
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc findmore {} {
|
2007-09-22 02:49:33 +00:00
|
|
|
global commitdata commitinfo numcommits findpattern findloc
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global findstartline findcurline findallowwrap
|
2007-09-27 01:00:25 +00:00
|
|
|
global find_dirn gdttype fhighlights fprogcoord
|
2008-01-02 10:44:06 +00:00
|
|
|
global curview varcorder vrownum varccommits vrowmod
|
2007-07-04 09:43:51 +00:00
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
if {![info exists find_dirn]} {
|
2007-07-04 09:43:51 +00:00
|
|
|
return 0
|
|
|
|
}
|
2007-11-07 17:44:35 +00:00
|
|
|
set fldtypes [list [mc "Headline"] [mc "Author"] [mc "Date"] [mc "Committer"] [mc "CDate"] [mc "Comments"]]
|
2007-07-04 09:43:51 +00:00
|
|
|
set l $findcurline
|
2007-10-27 11:16:56 +00:00
|
|
|
set moretodo 0
|
|
|
|
if {$find_dirn > 0} {
|
|
|
|
incr l
|
|
|
|
if {$l >= $numcommits} {
|
|
|
|
set l 0
|
|
|
|
}
|
|
|
|
if {$l <= $findstartline} {
|
|
|
|
set lim [expr {$findstartline + 1}]
|
|
|
|
} else {
|
|
|
|
set lim $numcommits
|
|
|
|
set moretodo $findallowwrap
|
2006-03-02 11:56:44 +00:00
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
} else {
|
2007-10-27 11:16:56 +00:00
|
|
|
if {$l == 0} {
|
|
|
|
set l $numcommits
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
2007-10-27 11:16:56 +00:00
|
|
|
incr l -1
|
|
|
|
if {$l >= $findstartline} {
|
|
|
|
set lim [expr {$findstartline - 1}]
|
2007-09-27 01:00:25 +00:00
|
|
|
} else {
|
2007-10-27 11:16:56 +00:00
|
|
|
set lim -1
|
|
|
|
set moretodo $findallowwrap
|
2007-09-27 01:00:25 +00:00
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
}
|
2007-10-27 11:16:56 +00:00
|
|
|
set n [expr {($lim - $l) * $find_dirn}]
|
|
|
|
if {$n > 500} {
|
|
|
|
set n 500
|
|
|
|
set moretodo 1
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
2008-01-02 10:44:06 +00:00
|
|
|
if {$l + ($find_dirn > 0? $n: 1) > $vrowmod($curview)} {
|
|
|
|
update_arcrows $curview
|
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
set found 0
|
|
|
|
set domore 1
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set ai [bsearch $vrownum($curview) $l]
|
|
|
|
set a [lindex $varcorder($curview) $ai]
|
|
|
|
set arow [lindex $vrownum($curview) $ai]
|
|
|
|
set ids [lindex $varccommits($curview,$a)]
|
|
|
|
set arowend [expr {$arow + [llength $ids]}]
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$gdttype eq [mc "containing:"]} {
|
2007-10-27 11:16:56 +00:00
|
|
|
for {} {$n > 0} {incr n -1; incr l $find_dirn} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$l < $arow || $l >= $arowend} {
|
|
|
|
incr ai $find_dirn
|
|
|
|
set a [lindex $varcorder($curview) $ai]
|
|
|
|
set arow [lindex $vrownum($curview) $ai]
|
|
|
|
set ids [lindex $varccommits($curview,$a)]
|
|
|
|
set arowend [expr {$arow + [llength $ids]}]
|
|
|
|
}
|
|
|
|
set id [lindex $ids [expr {$l - $arow}]]
|
2007-10-27 11:16:56 +00:00
|
|
|
# shouldn't happen unless git log doesn't give all the commits...
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![info exists commitdata($id)] ||
|
|
|
|
![doesmatch $commitdata($id)]} {
|
|
|
|
continue
|
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
if {![info exists commitinfo($id)]} {
|
|
|
|
getcommit $id
|
|
|
|
}
|
|
|
|
set info $commitinfo($id)
|
|
|
|
foreach f $info ty $fldtypes {
|
2007-11-07 17:44:35 +00:00
|
|
|
if {($findloc eq [mc "All fields"] || $findloc eq $ty) &&
|
2007-09-22 02:49:33 +00:00
|
|
|
[doesmatch $f]} {
|
|
|
|
set found 1
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$found} break
|
2007-07-04 09:43:51 +00:00
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
} else {
|
2007-10-27 11:16:56 +00:00
|
|
|
for {} {$n > 0} {incr n -1; incr l $find_dirn} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {$l < $arow || $l >= $arowend} {
|
|
|
|
incr ai $find_dirn
|
|
|
|
set a [lindex $varcorder($curview) $ai]
|
|
|
|
set arow [lindex $vrownum($curview) $ai]
|
|
|
|
set ids [lindex $varccommits($curview,$a)]
|
|
|
|
set arowend [expr {$arow + [llength $ids]}]
|
|
|
|
}
|
|
|
|
set id [lindex $ids [expr {$l - $arow}]]
|
2008-01-07 11:16:31 +00:00
|
|
|
if {![info exists fhighlights($id)]} {
|
|
|
|
# this sets fhighlights($id) to -1
|
2007-09-22 02:49:33 +00:00
|
|
|
askfilehighlight $l $id
|
2008-01-02 10:44:06 +00:00
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {$fhighlights($id) > 0} {
|
2008-01-02 10:44:06 +00:00
|
|
|
set found $domore
|
|
|
|
break
|
|
|
|
}
|
2008-01-07 11:16:31 +00:00
|
|
|
if {$fhighlights($id) < 0} {
|
2007-09-22 02:49:33 +00:00
|
|
|
if {$domore} {
|
|
|
|
set domore 0
|
2007-10-27 11:16:56 +00:00
|
|
|
set findcurline [expr {$l - $find_dirn}]
|
2007-09-22 02:49:33 +00:00
|
|
|
}
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2007-10-27 11:16:56 +00:00
|
|
|
if {$found || ($domore && !$moretodo)} {
|
2007-07-04 09:43:51 +00:00
|
|
|
unset findcurline
|
2007-09-22 02:49:33 +00:00
|
|
|
unset find_dirn
|
2007-07-04 09:43:51 +00:00
|
|
|
notbusy finding
|
2007-09-27 01:00:25 +00:00
|
|
|
set fprogcoord 0
|
|
|
|
adjustprogress
|
|
|
|
if {$found} {
|
|
|
|
findselectline $l
|
|
|
|
} else {
|
|
|
|
bell
|
|
|
|
}
|
2007-07-04 09:43:51 +00:00
|
|
|
return 0
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
2007-09-22 02:49:33 +00:00
|
|
|
if {!$domore} {
|
|
|
|
flushhighlights
|
2007-09-27 01:00:25 +00:00
|
|
|
} else {
|
2007-10-27 11:16:56 +00:00
|
|
|
set findcurline [expr {$l - $find_dirn}]
|
2007-09-22 02:49:33 +00:00
|
|
|
}
|
2007-10-27 11:16:56 +00:00
|
|
|
set n [expr {($findcurline - $findstartline) * $find_dirn - 1}]
|
2007-09-27 01:00:25 +00:00
|
|
|
if {$n < 0} {
|
|
|
|
incr n $numcommits
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
2007-09-27 01:00:25 +00:00
|
|
|
set fprogcoord [expr {$n * 1.0 / $numcommits}]
|
|
|
|
adjustprogress
|
|
|
|
return $domore
|
2005-05-17 23:23:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc findselectline {l} {
|
2007-09-22 02:49:33 +00:00
|
|
|
global findloc commentend ctext findcurline markingmatches gdttype
|
2007-07-26 12:36:39 +00:00
|
|
|
|
|
|
|
set markingmatches 1
|
|
|
|
set findcurline $l
|
2005-08-06 12:06:06 +00:00
|
|
|
selectline $l 1
|
2007-11-07 17:44:35 +00:00
|
|
|
if {$findloc == [mc "All fields"] || $findloc == [mc "Comments"]} {
|
2005-05-17 23:23:07 +00:00
|
|
|
# highlight the matches in the comments
|
|
|
|
set f [$ctext get 1.0 $commentend]
|
|
|
|
set matches [findmatches $f]
|
|
|
|
foreach match $matches {
|
|
|
|
set start [lindex $match 0]
|
2005-11-23 01:39:53 +00:00
|
|
|
set end [expr {[lindex $match 1] + 1}]
|
2005-05-17 23:23:07 +00:00
|
|
|
$ctext tag add found "1.0 + $start c" "1.0 + $end c"
|
|
|
|
}
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
2007-07-26 12:36:39 +00:00
|
|
|
drawvisible
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
|
|
|
|
2007-07-04 09:43:51 +00:00
|
|
|
# mark the bits of a headline or author that match a find string
|
2007-07-26 12:36:39 +00:00
|
|
|
proc markmatches {canv l str tag matches font row} {
|
|
|
|
global selectedline
|
|
|
|
|
2005-05-15 05:56:51 +00:00
|
|
|
set bbox [$canv bbox $tag]
|
|
|
|
set x0 [lindex $bbox 0]
|
|
|
|
set y0 [lindex $bbox 1]
|
|
|
|
set y1 [lindex $bbox 3]
|
|
|
|
foreach match $matches {
|
|
|
|
set start [lindex $match 0]
|
|
|
|
set end [lindex $match 1]
|
|
|
|
if {$start > $end} continue
|
2005-11-23 01:39:53 +00:00
|
|
|
set xoff [font measure $font [string range $str 0 [expr {$start-1}]]]
|
|
|
|
set xlen [font measure $font [string range $str 0 [expr {$end}]]]
|
|
|
|
set t [$canv create rect [expr {$x0+$xoff}] $y0 \
|
|
|
|
[expr {$x0+$xlen+2}] $y1 \
|
2007-07-04 09:43:51 +00:00
|
|
|
-outline {} -tags [list match$l matches] -fill yellow]
|
2005-05-15 05:56:51 +00:00
|
|
|
$canv lower $t
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$row == $selectedline} {
|
2007-07-26 12:36:39 +00:00
|
|
|
$canv raise $t secsel
|
|
|
|
}
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc unmarkmatches {} {
|
2007-09-27 01:00:25 +00:00
|
|
|
global markingmatches
|
2007-07-04 09:43:51 +00:00
|
|
|
|
2005-05-15 05:56:51 +00:00
|
|
|
allcanvs delete matches
|
2007-07-04 09:43:51 +00:00
|
|
|
set markingmatches 0
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2005-05-15 05:56:51 +00:00
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc selcanvline {w x y} {
|
2005-08-07 23:47:22 +00:00
|
|
|
global canv canvy0 ctext linespc
|
2006-02-19 11:44:47 +00:00
|
|
|
global rowtextx
|
2005-05-09 04:08:39 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
2005-05-31 12:14:42 +00:00
|
|
|
if {$ymax == {}} return
|
2005-05-09 04:08:39 +00:00
|
|
|
set yfrac [lindex [$canv yview] 0]
|
|
|
|
set y [expr {$y + $yfrac * $ymax}]
|
|
|
|
set l [expr {int(($y - $canvy0) / $linespc + 0.5)}]
|
|
|
|
if {$l < 0} {
|
|
|
|
set l 0
|
|
|
|
}
|
2005-06-25 05:39:21 +00:00
|
|
|
if {$w eq $canv} {
|
2007-12-26 12:03:43 +00:00
|
|
|
set xmax [lindex [$canv cget -scrollregion] 2]
|
|
|
|
set xleft [expr {[lindex [$canv xview] 0] * $xmax}]
|
|
|
|
if {![info exists rowtextx($l)] || $xleft + $x < $rowtextx($l)} return
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
2005-05-15 05:56:51 +00:00
|
|
|
unmarkmatches
|
2005-08-06 12:06:06 +00:00
|
|
|
selectline $l 1
|
2005-05-10 01:02:55 +00:00
|
|
|
}
|
|
|
|
|
2005-08-09 03:04:20 +00:00
|
|
|
proc commit_descriptor {p} {
|
|
|
|
global commitinfo
|
2006-05-14 23:56:08 +00:00
|
|
|
if {![info exists commitinfo($p)]} {
|
|
|
|
getcommit $p
|
|
|
|
}
|
2005-08-09 03:04:20 +00:00
|
|
|
set l "..."
|
2006-05-14 23:56:08 +00:00
|
|
|
if {[llength $commitinfo($p)] > 1} {
|
2005-08-09 03:04:20 +00:00
|
|
|
set l [lindex $commitinfo($p) 0]
|
|
|
|
}
|
2006-06-03 09:11:13 +00:00
|
|
|
return "$p ($l)\n"
|
2005-08-09 03:04:20 +00:00
|
|
|
}
|
|
|
|
|
2005-08-19 13:11:39 +00:00
|
|
|
# append some text to the ctext widget, and make any SHA1 ID
|
|
|
|
# that we know about be a clickable link.
|
2006-05-15 15:13:14 +00:00
|
|
|
proc appendwithlinks {text tags} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global ctext linknum curview pendinglinks
|
2005-08-19 13:11:39 +00:00
|
|
|
|
|
|
|
set start [$ctext index "end - 1c"]
|
2006-05-15 15:13:14 +00:00
|
|
|
$ctext insert end $text $tags
|
2005-08-19 13:11:39 +00:00
|
|
|
set links [regexp -indices -all -inline {[0-9a-f]{40}} $text]
|
|
|
|
foreach l $links {
|
|
|
|
set s [lindex $l 0]
|
|
|
|
set e [lindex $l 1]
|
|
|
|
set linkid [string range $text $s $e]
|
|
|
|
incr e
|
2007-09-27 00:35:05 +00:00
|
|
|
$ctext tag delete link$linknum
|
2005-08-19 13:11:39 +00:00
|
|
|
$ctext tag add link$linknum "$start + $s c" "$start + $e c"
|
2007-08-23 12:24:38 +00:00
|
|
|
setlink $linkid link$linknum
|
2005-08-19 13:11:39 +00:00
|
|
|
incr linknum
|
|
|
|
}
|
2007-08-23 12:24:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc setlink {id lk} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview ctext pendinglinks commitinterest
|
2007-08-23 12:24:38 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $id $curview]} {
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext tag conf $lk -foreground blue -underline 1
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
$ctext tag bind $lk <1> [list selectline [rowofcommit $id] 1]
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext tag bind $lk <Enter> {linkcursor %W 1}
|
|
|
|
$ctext tag bind $lk <Leave> {linkcursor %W -1}
|
|
|
|
} else {
|
|
|
|
lappend pendinglinks($id) $lk
|
|
|
|
lappend commitinterest($id) {makelink %I}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc makelink {id} {
|
|
|
|
global pendinglinks
|
|
|
|
|
|
|
|
if {![info exists pendinglinks($id)]} return
|
|
|
|
foreach lk $pendinglinks($id) {
|
|
|
|
setlink $id $lk
|
|
|
|
}
|
|
|
|
unset pendinglinks($id)
|
|
|
|
}
|
|
|
|
|
|
|
|
proc linkcursor {w inc} {
|
|
|
|
global linkentercount curtextcursor
|
|
|
|
|
|
|
|
if {[incr linkentercount $inc] > 0} {
|
|
|
|
$w configure -cursor hand2
|
|
|
|
} else {
|
|
|
|
$w configure -cursor $curtextcursor
|
|
|
|
if {$linkentercount < 0} {
|
|
|
|
set linkentercount 0
|
|
|
|
}
|
|
|
|
}
|
2005-08-19 13:11:39 +00:00
|
|
|
}
|
|
|
|
|
2006-04-05 00:24:03 +00:00
|
|
|
proc viewnextline {dir} {
|
|
|
|
global canv linespc
|
|
|
|
|
|
|
|
$canv delete hover
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
set wnow [$canv yview]
|
|
|
|
set wtop [expr {[lindex $wnow 0] * $ymax}]
|
|
|
|
set newtop [expr {$wtop + $dir * $linespc}]
|
|
|
|
if {$newtop < 0} {
|
|
|
|
set newtop 0
|
|
|
|
} elseif {$newtop > $ymax} {
|
|
|
|
set newtop $ymax
|
|
|
|
}
|
|
|
|
allcanvs yview moveto [expr {$newtop * 1.0 / $ymax}]
|
|
|
|
}
|
|
|
|
|
2006-06-04 01:50:38 +00:00
|
|
|
# add a list of tag or branch names at position pos
|
|
|
|
# returns the number of names inserted
|
2007-06-16 10:29:25 +00:00
|
|
|
proc appendrefs {pos ids var} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global ctext linknum curview $var maxrefs
|
2006-06-03 09:11:13 +00:00
|
|
|
|
2006-06-04 01:50:38 +00:00
|
|
|
if {[catch {$ctext index $pos}]} {
|
|
|
|
return 0
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
$ctext conf -state normal
|
|
|
|
$ctext delete $pos "$pos lineend"
|
|
|
|
set tags {}
|
|
|
|
foreach id $ids {
|
|
|
|
foreach tag [set $var\($id\)] {
|
|
|
|
lappend tags [list $tag $id]
|
|
|
|
}
|
|
|
|
}
|
2007-06-16 11:21:57 +00:00
|
|
|
if {[llength $tags] > $maxrefs} {
|
|
|
|
$ctext insert $pos "many ([llength $tags])"
|
|
|
|
} else {
|
|
|
|
set tags [lsort -index 0 -decreasing $tags]
|
|
|
|
set sep {}
|
|
|
|
foreach ti $tags {
|
|
|
|
set id [lindex $ti 1]
|
|
|
|
set lk link$linknum
|
|
|
|
incr linknum
|
|
|
|
$ctext tag delete $lk
|
|
|
|
$ctext insert $pos $sep
|
|
|
|
$ctext insert $pos [lindex $ti 0] $lk
|
2007-08-23 12:24:38 +00:00
|
|
|
setlink $id $lk
|
2007-06-16 11:21:57 +00:00
|
|
|
set sep ", "
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
$ctext conf -state disabled
|
2006-06-04 01:50:38 +00:00
|
|
|
return [llength $tags]
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# called when we have finished computing the nearby tags
|
|
|
|
proc dispneartags {delay} {
|
|
|
|
global selectedline currentid showneartags tagphase
|
2006-08-06 11:08:05 +00:00
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {} || !$showneartags} return
|
2007-06-16 10:29:25 +00:00
|
|
|
after cancel dispnexttag
|
|
|
|
if {$delay} {
|
|
|
|
after 200 dispnexttag
|
|
|
|
set tagphase -1
|
|
|
|
} else {
|
|
|
|
after idle dispnexttag
|
|
|
|
set tagphase 0
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc dispnexttag {} {
|
|
|
|
global selectedline currentid showneartags tagphase ctext
|
2006-06-03 09:11:13 +00:00
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {} || !$showneartags} return
|
2007-06-16 10:29:25 +00:00
|
|
|
switch -- $tagphase {
|
|
|
|
0 {
|
|
|
|
set dtags [desctags $currentid]
|
|
|
|
if {$dtags ne {}} {
|
|
|
|
appendrefs precedes $dtags idtags
|
|
|
|
}
|
|
|
|
}
|
|
|
|
1 {
|
|
|
|
set atags [anctags $currentid]
|
|
|
|
if {$atags ne {}} {
|
|
|
|
appendrefs follows $atags idtags
|
|
|
|
}
|
|
|
|
}
|
|
|
|
2 {
|
|
|
|
set dheads [descheads $currentid]
|
|
|
|
if {$dheads ne {}} {
|
|
|
|
if {[appendrefs branch $dheads idheads] > 1
|
|
|
|
&& [$ctext get "branch -3c"] eq "h"} {
|
|
|
|
# turn "Branch" into "Branches"
|
|
|
|
$ctext conf -state normal
|
|
|
|
$ctext insert "branch -2c" "es"
|
|
|
|
$ctext conf -state disabled
|
|
|
|
}
|
|
|
|
}
|
2006-06-04 01:50:38 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {[incr tagphase] <= 2} {
|
|
|
|
after idle dispnexttag
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
proc make_secsel {l} {
|
|
|
|
global linehtag linentag linedtag canv canv2 canv3
|
|
|
|
|
|
|
|
if {![info exists linehtag($l)]} return
|
|
|
|
$canv delete secsel
|
|
|
|
set t [eval $canv create rect [$canv bbox $linehtag($l)] -outline {{}} \
|
|
|
|
-tags secsel -fill [$canv cget -selectbackground]]
|
|
|
|
$canv lower $t
|
|
|
|
$canv2 delete secsel
|
|
|
|
set t [eval $canv2 create rect [$canv2 bbox $linentag($l)] -outline {{}} \
|
|
|
|
-tags secsel -fill [$canv2 cget -selectbackground]]
|
|
|
|
$canv2 lower $t
|
|
|
|
$canv3 delete secsel
|
|
|
|
set t [eval $canv3 create rect [$canv3 bbox $linedtag($l)] -outline {{}} \
|
|
|
|
-tags secsel -fill [$canv3 cget -selectbackground]]
|
|
|
|
$canv3 lower $t
|
|
|
|
}
|
|
|
|
|
2005-08-06 12:06:06 +00:00
|
|
|
proc selectline {l isnew} {
|
2007-08-29 11:45:21 +00:00
|
|
|
global canv ctext commitinfo selectedline
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global canvy0 linespc parents children curview
|
2006-04-27 09:21:49 +00:00
|
|
|
global currentid sha1entry
|
2006-02-19 11:44:47 +00:00
|
|
|
global commentend idtags linknum
|
2006-04-06 00:18:23 +00:00
|
|
|
global mergemax numcommits pending_select
|
2007-06-16 10:29:25 +00:00
|
|
|
global cmitmode showneartags allcommits
|
2008-03-07 11:51:55 +00:00
|
|
|
global targetrow targetid lastscrollrows
|
2008-03-06 11:49:25 +00:00
|
|
|
global autoselect
|
2005-08-06 12:06:06 +00:00
|
|
|
|
2006-04-06 00:18:23 +00:00
|
|
|
catch {unset pending_select}
|
2005-06-17 00:12:26 +00:00
|
|
|
$canv delete hover
|
2005-08-30 00:57:11 +00:00
|
|
|
normalline
|
2007-08-20 09:36:20 +00:00
|
|
|
unsel_reflist
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2006-02-28 11:10:19 +00:00
|
|
|
if {$l < 0 || $l >= $numcommits} return
|
2008-03-02 23:11:08 +00:00
|
|
|
set id [commitonrow $l]
|
|
|
|
set targetid $id
|
|
|
|
set targetrow $l
|
2008-03-07 11:51:55 +00:00
|
|
|
set selectedline $l
|
|
|
|
set currentid $id
|
|
|
|
if {$lastscrollrows < $numcommits} {
|
|
|
|
setcanvscroll
|
|
|
|
}
|
2008-03-02 23:11:08 +00:00
|
|
|
|
2005-05-10 01:02:55 +00:00
|
|
|
set y [expr {$canvy0 + $l * $linespc}]
|
2005-05-18 22:51:00 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
2005-05-19 10:56:42 +00:00
|
|
|
set ytop [expr {$y - $linespc - 1}]
|
|
|
|
set ybot [expr {$y + $linespc + 1}]
|
2005-05-10 01:02:55 +00:00
|
|
|
set wnow [$canv yview]
|
2005-11-23 01:39:53 +00:00
|
|
|
set wtop [expr {[lindex $wnow 0] * $ymax}]
|
|
|
|
set wbot [expr {[lindex $wnow 1] * $ymax}]
|
2005-05-19 10:56:42 +00:00
|
|
|
set wh [expr {$wbot - $wtop}]
|
|
|
|
set newtop $wtop
|
2005-05-18 22:51:00 +00:00
|
|
|
if {$ytop < $wtop} {
|
2005-05-19 10:56:42 +00:00
|
|
|
if {$ybot < $wtop} {
|
|
|
|
set newtop [expr {$y - $wh / 2.0}]
|
|
|
|
} else {
|
|
|
|
set newtop $ytop
|
|
|
|
if {$newtop > $wtop - $linespc} {
|
|
|
|
set newtop [expr {$wtop - $linespc}]
|
|
|
|
}
|
2005-05-18 22:51:00 +00:00
|
|
|
}
|
2005-05-19 10:56:42 +00:00
|
|
|
} elseif {$ybot > $wbot} {
|
|
|
|
if {$ytop > $wbot} {
|
|
|
|
set newtop [expr {$y - $wh / 2.0}]
|
|
|
|
} else {
|
|
|
|
set newtop [expr {$ybot - $wh}]
|
|
|
|
if {$newtop < $wtop + $linespc} {
|
|
|
|
set newtop [expr {$wtop + $linespc}]
|
|
|
|
}
|
2005-05-18 22:51:00 +00:00
|
|
|
}
|
2005-05-19 10:56:42 +00:00
|
|
|
}
|
|
|
|
if {$newtop != $wtop} {
|
|
|
|
if {$newtop < 0} {
|
|
|
|
set newtop 0
|
|
|
|
}
|
2005-11-23 01:39:53 +00:00
|
|
|
allcanvs yview moveto [expr {$newtop * 1.0 / $ymax}]
|
2006-02-19 11:44:47 +00:00
|
|
|
drawvisible
|
2005-05-10 01:02:55 +00:00
|
|
|
}
|
2005-08-06 12:06:06 +00:00
|
|
|
|
2007-08-29 11:45:21 +00:00
|
|
|
make_secsel $l
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2005-08-07 23:47:22 +00:00
|
|
|
if {$isnew} {
|
2007-12-26 12:03:43 +00:00
|
|
|
addtohistory [list selbyid $id]
|
2005-08-06 12:06:06 +00:00
|
|
|
}
|
|
|
|
|
2005-05-15 05:56:51 +00:00
|
|
|
$sha1entry delete 0 end
|
|
|
|
$sha1entry insert 0 $id
|
2008-03-06 11:49:25 +00:00
|
|
|
if {$autoselect} {
|
|
|
|
$sha1entry selection from 0
|
|
|
|
$sha1entry selection to end
|
|
|
|
}
|
2006-05-29 09:50:02 +00:00
|
|
|
rhighlight_sel $id
|
2005-05-15 05:56:51 +00:00
|
|
|
|
2005-05-10 01:02:55 +00:00
|
|
|
$ctext conf -state normal
|
2006-05-24 00:16:03 +00:00
|
|
|
clear_ctext
|
2005-08-19 13:11:39 +00:00
|
|
|
set linknum 0
|
2008-03-07 10:19:18 +00:00
|
|
|
if {![info exists commitinfo($id)]} {
|
|
|
|
getcommit $id
|
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
set info $commitinfo($id)
|
2005-11-14 23:34:03 +00:00
|
|
|
set date [formatdate [lindex $info 2]]
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "[mc "Author"]: [lindex $info 1] $date\n"
|
2005-11-14 23:34:03 +00:00
|
|
|
set date [formatdate [lindex $info 4]]
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "[mc "Committer"]: [lindex $info 3] $date\n"
|
2005-05-21 07:35:37 +00:00
|
|
|
if {[info exists idtags($id)]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end [mc "Tags:"]
|
2005-05-21 07:35:37 +00:00
|
|
|
foreach tag $idtags($id) {
|
|
|
|
$ctext insert end " $tag"
|
|
|
|
}
|
|
|
|
$ctext insert end "\n"
|
|
|
|
}
|
2007-02-01 13:44:46 +00:00
|
|
|
|
2006-05-15 15:13:14 +00:00
|
|
|
set headers {}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set olds $parents($curview,$id)
|
2006-04-02 10:47:40 +00:00
|
|
|
if {[llength $olds] > 1} {
|
2006-02-06 22:13:52 +00:00
|
|
|
set np 0
|
2006-04-02 10:47:40 +00:00
|
|
|
foreach p $olds {
|
2006-02-06 22:13:52 +00:00
|
|
|
if {$np >= $mergemax} {
|
|
|
|
set tag mmax
|
|
|
|
} else {
|
|
|
|
set tag m$np
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "[mc "Parent"]: " $tag
|
2006-05-15 15:13:14 +00:00
|
|
|
appendwithlinks [commit_descriptor $p] {}
|
2006-02-06 22:13:52 +00:00
|
|
|
incr np
|
|
|
|
}
|
|
|
|
} else {
|
2006-04-02 10:47:40 +00:00
|
|
|
foreach p $olds {
|
2007-11-07 17:42:55 +00:00
|
|
|
append headers "[mc "Parent"]: [commit_descriptor $p]"
|
2005-08-09 03:04:20 +00:00
|
|
|
}
|
|
|
|
}
|
2006-02-06 22:13:52 +00:00
|
|
|
|
2007-06-17 23:48:23 +00:00
|
|
|
foreach c $children($curview,$id) {
|
2007-11-07 17:42:55 +00:00
|
|
|
append headers "[mc "Child"]: [commit_descriptor $c]"
|
2005-08-07 20:58:56 +00:00
|
|
|
}
|
2005-08-06 12:06:06 +00:00
|
|
|
|
|
|
|
# make anything that looks like a SHA1 ID be a clickable link
|
2006-05-15 15:13:14 +00:00
|
|
|
appendwithlinks $headers {}
|
2006-06-03 09:11:13 +00:00
|
|
|
if {$showneartags} {
|
|
|
|
if {![info exists allcommits]} {
|
|
|
|
getallcommits
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "[mc "Branch"]: "
|
2006-06-04 01:50:38 +00:00
|
|
|
$ctext mark set branch "end -1c"
|
|
|
|
$ctext mark gravity branch left
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n[mc "Follows"]: "
|
2006-06-03 09:11:13 +00:00
|
|
|
$ctext mark set follows "end -1c"
|
|
|
|
$ctext mark gravity follows left
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n[mc "Precedes"]: "
|
2006-06-03 09:11:13 +00:00
|
|
|
$ctext mark set precedes "end -1c"
|
|
|
|
$ctext mark gravity precedes left
|
|
|
|
$ctext insert end "\n"
|
2007-06-16 10:29:25 +00:00
|
|
|
dispneartags 1
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
$ctext insert end "\n"
|
2006-09-27 00:56:02 +00:00
|
|
|
set comment [lindex $info 5]
|
|
|
|
if {[string first "\r" $comment] >= 0} {
|
|
|
|
set comment [string map {"\r" "\n "} $comment]
|
|
|
|
}
|
|
|
|
appendwithlinks $comment {comment}
|
2005-08-06 12:06:06 +00:00
|
|
|
|
2005-05-17 23:23:07 +00:00
|
|
|
$ctext tag remove found 1.0 end
|
2005-05-10 01:02:55 +00:00
|
|
|
$ctext conf -state disabled
|
2005-05-17 23:23:07 +00:00
|
|
|
set commentend [$ctext index "end - 1c"]
|
2005-05-10 01:02:55 +00:00
|
|
|
|
2007-11-07 17:44:35 +00:00
|
|
|
init_flist [mc "Comments"]
|
2006-04-30 23:50:57 +00:00
|
|
|
if {$cmitmode eq "tree"} {
|
|
|
|
gettree $id
|
|
|
|
} elseif {[llength $olds] <= 1} {
|
2005-11-28 09:41:56 +00:00
|
|
|
startdiff $id
|
2006-03-30 09:50:40 +00:00
|
|
|
} else {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
mergediff $id
|
2005-07-20 13:13:46 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-05 00:24:03 +00:00
|
|
|
proc selfirstline {} {
|
|
|
|
unmarkmatches
|
|
|
|
selectline 0 1
|
|
|
|
}
|
|
|
|
|
|
|
|
proc sellastline {} {
|
|
|
|
global numcommits
|
|
|
|
unmarkmatches
|
|
|
|
set l [expr {$numcommits - 1}]
|
|
|
|
selectline $l 1
|
|
|
|
}
|
|
|
|
|
2005-07-20 13:13:46 +00:00
|
|
|
proc selnextline {dir} {
|
|
|
|
global selectedline
|
2007-08-08 01:40:34 +00:00
|
|
|
focus .
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} return
|
2005-11-23 01:39:53 +00:00
|
|
|
set l [expr {$selectedline + $dir}]
|
2005-07-20 13:13:46 +00:00
|
|
|
unmarkmatches
|
2005-08-06 12:06:06 +00:00
|
|
|
selectline $l 1
|
|
|
|
}
|
|
|
|
|
2006-04-05 00:24:03 +00:00
|
|
|
proc selnextpage {dir} {
|
|
|
|
global canv linespc selectedline numcommits
|
|
|
|
|
|
|
|
set lpp [expr {([winfo height $canv] - 2) / $linespc}]
|
|
|
|
if {$lpp < 1} {
|
|
|
|
set lpp 1
|
|
|
|
}
|
|
|
|
allcanvs yview scroll [expr {$dir * $lpp}] units
|
2006-05-19 23:58:49 +00:00
|
|
|
drawvisible
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} return
|
2006-04-05 00:24:03 +00:00
|
|
|
set l [expr {$selectedline + $dir * $lpp}]
|
|
|
|
if {$l < 0} {
|
|
|
|
set l 0
|
|
|
|
} elseif {$l >= $numcommits} {
|
|
|
|
set l [expr $numcommits - 1]
|
|
|
|
}
|
|
|
|
unmarkmatches
|
2007-02-01 13:44:46 +00:00
|
|
|
selectline $l 1
|
2006-04-05 00:24:03 +00:00
|
|
|
}
|
|
|
|
|
2005-08-07 23:47:22 +00:00
|
|
|
proc unselectline {} {
|
2006-04-04 00:16:22 +00:00
|
|
|
global selectedline currentid
|
2005-08-07 23:47:22 +00:00
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
set selectedline {}
|
2006-04-04 00:16:22 +00:00
|
|
|
catch {unset currentid}
|
2005-08-07 23:47:22 +00:00
|
|
|
allcanvs delete secsel
|
2006-05-29 09:50:02 +00:00
|
|
|
rhighlight_none
|
2005-08-07 23:47:22 +00:00
|
|
|
}
|
|
|
|
|
2006-04-30 23:50:57 +00:00
|
|
|
proc reselectline {} {
|
|
|
|
global selectedline
|
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline ne {}} {
|
2006-04-30 23:50:57 +00:00
|
|
|
selectline $selectedline 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-08-07 23:47:22 +00:00
|
|
|
proc addtohistory {cmd} {
|
2006-04-21 00:35:31 +00:00
|
|
|
global history historyindex curview
|
2005-08-07 23:47:22 +00:00
|
|
|
|
2006-04-21 00:35:31 +00:00
|
|
|
set elt [list $curview $cmd]
|
2005-08-07 23:47:22 +00:00
|
|
|
if {$historyindex > 0
|
2006-04-21 00:35:31 +00:00
|
|
|
&& [lindex $history [expr {$historyindex - 1}]] == $elt} {
|
2005-08-07 23:47:22 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
if {$historyindex < [llength $history]} {
|
2006-04-21 00:35:31 +00:00
|
|
|
set history [lreplace $history $historyindex end $elt]
|
2005-08-07 23:47:22 +00:00
|
|
|
} else {
|
2006-04-21 00:35:31 +00:00
|
|
|
lappend history $elt
|
2005-08-07 23:47:22 +00:00
|
|
|
}
|
|
|
|
incr historyindex
|
|
|
|
if {$historyindex > 1} {
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.leftbut conf -state normal
|
2005-08-07 23:47:22 +00:00
|
|
|
} else {
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.leftbut conf -state disabled
|
2005-08-07 23:47:22 +00:00
|
|
|
}
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.rightbut conf -state disabled
|
2005-08-07 23:47:22 +00:00
|
|
|
}
|
|
|
|
|
2006-04-21 00:35:31 +00:00
|
|
|
proc godo {elt} {
|
|
|
|
global curview
|
|
|
|
|
|
|
|
set view [lindex $elt 0]
|
|
|
|
set cmd [lindex $elt 1]
|
|
|
|
if {$curview != $view} {
|
|
|
|
showview $view
|
|
|
|
}
|
|
|
|
eval $cmd
|
|
|
|
}
|
|
|
|
|
2005-08-06 12:06:06 +00:00
|
|
|
proc goback {} {
|
|
|
|
global history historyindex
|
2007-08-08 01:40:34 +00:00
|
|
|
focus .
|
2005-08-06 12:06:06 +00:00
|
|
|
|
|
|
|
if {$historyindex > 1} {
|
|
|
|
incr historyindex -1
|
2006-04-21 00:35:31 +00:00
|
|
|
godo [lindex $history [expr {$historyindex - 1}]]
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.rightbut conf -state normal
|
2005-08-06 12:06:06 +00:00
|
|
|
}
|
|
|
|
if {$historyindex <= 1} {
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.leftbut conf -state disabled
|
2005-08-06 12:06:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc goforw {} {
|
|
|
|
global history historyindex
|
2007-08-08 01:40:34 +00:00
|
|
|
focus .
|
2005-08-06 12:06:06 +00:00
|
|
|
|
|
|
|
if {$historyindex < [llength $history]} {
|
2005-08-07 23:47:22 +00:00
|
|
|
set cmd [lindex $history $historyindex]
|
2005-08-06 12:06:06 +00:00
|
|
|
incr historyindex
|
2006-04-21 00:35:31 +00:00
|
|
|
godo $cmd
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.leftbut conf -state normal
|
2005-08-06 12:06:06 +00:00
|
|
|
}
|
|
|
|
if {$historyindex >= [llength $history]} {
|
2007-02-01 13:46:38 +00:00
|
|
|
.tf.bar.rightbut conf -state disabled
|
2005-08-06 12:06:06 +00:00
|
|
|
}
|
2005-07-17 07:39:44 +00:00
|
|
|
}
|
|
|
|
|
2006-04-30 23:50:57 +00:00
|
|
|
proc gettree {id} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global treefilelist treeidlist diffids diffmergeid treepending
|
|
|
|
global nullid nullid2
|
2006-04-30 23:50:57 +00:00
|
|
|
|
|
|
|
set diffids $id
|
|
|
|
catch {unset diffmergeid}
|
|
|
|
if {![info exists treefilelist($id)]} {
|
|
|
|
if {![info exists treepending]} {
|
2007-07-13 09:49:37 +00:00
|
|
|
if {$id eq $nullid} {
|
|
|
|
set cmd [list | git ls-files]
|
|
|
|
} elseif {$id eq $nullid2} {
|
|
|
|
set cmd [list | git ls-files --stage -t]
|
2006-09-07 00:21:39 +00:00
|
|
|
} else {
|
2007-07-13 09:49:37 +00:00
|
|
|
set cmd [list | git ls-tree -r $id]
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
if {[catch {set gtf [open $cmd r]}]} {
|
2006-04-30 23:50:57 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
set treepending $id
|
|
|
|
set treefilelist($id) {}
|
|
|
|
set treeidlist($id) {}
|
|
|
|
fconfigure $gtf -blocking 0
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $gtf [list gettreeline $gtf $id]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
setfilelist $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc gettreeline {gtf id} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global treefilelist treeidlist treepending cmitmode diffids nullid nullid2
|
2006-04-30 23:50:57 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
set nl 0
|
|
|
|
while {[incr nl] <= 1000 && [gets $gtf line] >= 0} {
|
2007-07-13 09:49:37 +00:00
|
|
|
if {$diffids eq $nullid} {
|
|
|
|
set fname $line
|
|
|
|
} else {
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
set i [string first "\t" $line]
|
|
|
|
if {$i < 0} continue
|
|
|
|
set fname [string range $line [expr {$i+1}] end]
|
2008-04-27 23:40:50 +00:00
|
|
|
set line [string range $line 0 [expr {$i-1}]]
|
|
|
|
if {$diffids ne $nullid2 && [lindex $line 1] ne "blob"} continue
|
|
|
|
set sha1 [lindex $line 2]
|
2006-09-07 00:21:39 +00:00
|
|
|
if {[string index $fname 0] eq "\""} {
|
|
|
|
set fname [lindex $fname 0]
|
|
|
|
}
|
|
|
|
lappend treeidlist($id) $sha1
|
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
lappend treefilelist($id) $fname
|
|
|
|
}
|
|
|
|
if {![eof $gtf]} {
|
|
|
|
return [expr {$nl >= 1000? 2: 1}]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
close $gtf
|
|
|
|
unset treepending
|
|
|
|
if {$cmitmode ne "tree"} {
|
|
|
|
if {![info exists diffmergeid]} {
|
|
|
|
gettreediffs $diffids
|
|
|
|
}
|
|
|
|
} elseif {$id ne $diffids} {
|
|
|
|
gettree $diffids
|
|
|
|
} else {
|
|
|
|
setfilelist $id
|
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc showfile {f} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global treefilelist treeidlist diffids nullid nullid2
|
2006-04-30 23:50:57 +00:00
|
|
|
global ctext commentend
|
|
|
|
|
|
|
|
set i [lsearch -exact $treefilelist($diffids) $f]
|
|
|
|
if {$i < 0} {
|
|
|
|
puts "oops, $f not in list for id $diffids"
|
|
|
|
return
|
|
|
|
}
|
2007-07-13 09:49:37 +00:00
|
|
|
if {$diffids eq $nullid} {
|
|
|
|
if {[catch {set bf [open $f r]} err]} {
|
|
|
|
puts "oops, can't read $f: $err"
|
2006-09-07 00:21:39 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
} else {
|
2007-07-13 09:49:37 +00:00
|
|
|
set blob [lindex $treeidlist($diffids) $i]
|
|
|
|
if {[catch {set bf [open [concat | git cat-file blob $blob] r]} err]} {
|
|
|
|
puts "oops, error reading blob $blob: $err"
|
2006-09-07 00:21:39 +00:00
|
|
|
return
|
|
|
|
}
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
fconfigure $bf -blocking 0
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $bf [list getblobline $bf $diffids]
|
2006-04-30 23:50:57 +00:00
|
|
|
$ctext config -state normal
|
2006-05-24 00:16:03 +00:00
|
|
|
clear_ctext $commentend
|
2006-04-30 23:50:57 +00:00
|
|
|
$ctext insert end "\n"
|
|
|
|
$ctext insert end "$f\n" filesep
|
|
|
|
$ctext config -state disabled
|
|
|
|
$ctext yview $commentend
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs 0
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc getblobline {bf id} {
|
|
|
|
global diffids cmitmode ctext
|
|
|
|
|
|
|
|
if {$id ne $diffids || $cmitmode ne "tree"} {
|
|
|
|
catch {close $bf}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
$ctext config -state normal
|
2007-06-17 04:45:00 +00:00
|
|
|
set nl 0
|
|
|
|
while {[incr nl] <= 1000 && [gets $bf line] >= 0} {
|
2006-04-30 23:50:57 +00:00
|
|
|
$ctext insert end "$line\n"
|
|
|
|
}
|
|
|
|
if {[eof $bf]} {
|
|
|
|
# delete last newline
|
|
|
|
$ctext delete "end - 2c" "end - 1c"
|
|
|
|
close $bf
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
$ctext config -state disabled
|
2007-06-17 04:45:00 +00:00
|
|
|
return [expr {$nl >= 1000? 2: 1}]
|
2006-04-30 23:50:57 +00:00
|
|
|
}
|
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
proc mergediff {id} {
|
2007-10-06 10:22:00 +00:00
|
|
|
global diffmergeid mdifffd
|
2006-04-27 09:21:49 +00:00
|
|
|
global diffids
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global parents
|
2008-02-13 16:27:30 +00:00
|
|
|
global diffcontext
|
2008-04-26 06:00:00 +00:00
|
|
|
global limitdiffs vfilelimit curview
|
2005-07-17 07:39:44 +00:00
|
|
|
|
2005-07-20 13:13:46 +00:00
|
|
|
set diffmergeid $id
|
2006-03-21 23:21:45 +00:00
|
|
|
set diffids $id
|
2006-02-06 22:13:52 +00:00
|
|
|
# this doesn't seem to actually affect anything...
|
2008-02-13 16:27:30 +00:00
|
|
|
set cmd [concat | git diff-tree --no-commit-id --cc -U$diffcontext $id]
|
2008-04-26 06:00:00 +00:00
|
|
|
if {$limitdiffs && $vfilelimit($curview) ne {}} {
|
|
|
|
set cmd [concat $cmd -- $vfilelimit($curview)]
|
2007-10-23 12:37:23 +00:00
|
|
|
}
|
2006-02-06 22:13:52 +00:00
|
|
|
if {[catch {set mdf [open $cmd r]} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error getting merge diffs:"] $err"
|
2006-02-06 22:13:52 +00:00
|
|
|
return
|
2005-07-28 03:15:47 +00:00
|
|
|
}
|
2006-02-06 22:13:52 +00:00
|
|
|
fconfigure $mdf -blocking 0
|
|
|
|
set mdifffd($id) $mdf
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set np [llength $parents($curview,$id)]
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs $np
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $mdf [list getmergediffline $mdf $id $np]
|
2005-07-28 03:15:47 +00:00
|
|
|
}
|
|
|
|
|
2006-04-02 10:47:40 +00:00
|
|
|
proc getmergediffline {mdf id np} {
|
2007-06-17 04:45:00 +00:00
|
|
|
global diffmergeid ctext cflist mergemax
|
2006-03-21 23:21:45 +00:00
|
|
|
global difffilestart mdifffd
|
2005-07-28 03:15:47 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
$ctext conf -state normal
|
|
|
|
set nr 0
|
|
|
|
while {[incr nr] <= 1000 && [gets $mdf line] >= 0} {
|
|
|
|
if {![info exists diffmergeid] || $id != $diffmergeid
|
|
|
|
|| $mdf != $mdifffd($id)} {
|
2006-02-06 22:13:52 +00:00
|
|
|
close $mdf
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2005-07-28 03:15:47 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
if {[regexp {^diff --cc (.*)} $line match fname]} {
|
|
|
|
# start of a new file
|
|
|
|
$ctext insert end "\n"
|
|
|
|
set here [$ctext index "end - 1c"]
|
|
|
|
lappend difffilestart $here
|
|
|
|
add_flist [list $fname]
|
|
|
|
set l [expr {(78 - [string length $fname]) / 2}]
|
|
|
|
set pad [string range "----------------------------------------" 1 $l]
|
|
|
|
$ctext insert end "$pad $fname $pad\n" filesep
|
|
|
|
} elseif {[regexp {^@@} $line]} {
|
|
|
|
$ctext insert end "$line\n" hunksep
|
|
|
|
} elseif {[regexp {^[0-9a-f]{40}$} $line] || [regexp {^index} $line]} {
|
|
|
|
# do nothing
|
|
|
|
} else {
|
|
|
|
# parse the prefix - one ' ', '-' or '+' for each parent
|
|
|
|
set spaces {}
|
|
|
|
set minuses {}
|
|
|
|
set pluses {}
|
|
|
|
set isbad 0
|
|
|
|
for {set j 0} {$j < $np} {incr j} {
|
|
|
|
set c [string range $line $j $j]
|
|
|
|
if {$c == " "} {
|
|
|
|
lappend spaces $j
|
|
|
|
} elseif {$c == "-"} {
|
|
|
|
lappend minuses $j
|
|
|
|
} elseif {$c == "+"} {
|
|
|
|
lappend pluses $j
|
|
|
|
} else {
|
|
|
|
set isbad 1
|
|
|
|
break
|
|
|
|
}
|
2005-07-29 14:23:03 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
set tags {}
|
|
|
|
set num {}
|
|
|
|
if {!$isbad && $minuses ne {} && $pluses eq {}} {
|
|
|
|
# line doesn't appear in result, parents in $minuses have the line
|
|
|
|
set num [lindex $minuses 0]
|
|
|
|
} elseif {!$isbad && $pluses ne {} && $minuses eq {}} {
|
|
|
|
# line appears in result, parents in $pluses don't have the line
|
|
|
|
lappend tags mresult
|
|
|
|
set num [lindex $spaces 0]
|
2005-07-29 14:23:03 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
if {$num ne {}} {
|
|
|
|
if {$num >= $mergemax} {
|
|
|
|
set num "max"
|
|
|
|
}
|
|
|
|
lappend tags m$num
|
|
|
|
}
|
|
|
|
$ctext insert end "$line\n" $tags
|
2005-07-29 14:23:03 +00:00
|
|
|
}
|
2005-07-28 03:15:47 +00:00
|
|
|
}
|
|
|
|
$ctext conf -state disabled
|
2007-06-17 04:45:00 +00:00
|
|
|
if {[eof $mdf]} {
|
|
|
|
close $mdf
|
|
|
|
return 0
|
2005-07-29 14:23:03 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return [expr {$nr >= 1000? 2: 1}]
|
2005-07-29 14:23:03 +00:00
|
|
|
}
|
|
|
|
|
2005-07-20 13:13:46 +00:00
|
|
|
proc startdiff {ids} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global treediffs diffids treepending diffmergeid nullid nullid2
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs 1
|
2005-07-17 15:11:44 +00:00
|
|
|
set diffids $ids
|
2005-07-20 13:13:46 +00:00
|
|
|
catch {unset diffmergeid}
|
2007-07-13 09:49:37 +00:00
|
|
|
if {![info exists treediffs($ids)] ||
|
|
|
|
[lsearch -exact $ids $nullid] >= 0 ||
|
|
|
|
[lsearch -exact $ids $nullid2] >= 0} {
|
2005-06-25 05:39:21 +00:00
|
|
|
if {![info exists treepending]} {
|
2005-07-17 01:53:55 +00:00
|
|
|
gettreediffs $ids
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
} else {
|
2005-07-17 01:53:55 +00:00
|
|
|
addtocflist $ids
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-10-23 00:15:11 +00:00
|
|
|
proc path_filter {filter name} {
|
|
|
|
foreach p $filter {
|
|
|
|
set l [string length $p]
|
2007-10-24 00:16:56 +00:00
|
|
|
if {[string index $p end] eq "/"} {
|
|
|
|
if {[string compare -length $l $p $name] == 0} {
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if {[string compare -length $l $p $name] == 0 &&
|
|
|
|
([string length $name] == $l ||
|
|
|
|
[string index $name $l] eq "/")} {
|
|
|
|
return 1
|
|
|
|
}
|
2007-10-23 00:15:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc addtocflist {ids} {
|
2007-10-24 00:16:56 +00:00
|
|
|
global treediffs
|
2007-10-23 00:15:11 +00:00
|
|
|
|
2007-10-24 00:16:56 +00:00
|
|
|
add_flist $treediffs($ids)
|
2005-06-25 05:39:21 +00:00
|
|
|
getblobdiffs $ids
|
2005-05-11 00:45:38 +00:00
|
|
|
}
|
|
|
|
|
2006-09-07 00:21:39 +00:00
|
|
|
proc diffcmd {ids flags} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global nullid nullid2
|
2006-09-07 00:21:39 +00:00
|
|
|
|
|
|
|
set i [lsearch -exact $ids $nullid]
|
2007-07-13 09:49:37 +00:00
|
|
|
set j [lsearch -exact $ids $nullid2]
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$i >= 0} {
|
2007-07-13 09:49:37 +00:00
|
|
|
if {[llength $ids] > 1 && $j < 0} {
|
|
|
|
# comparing working directory with some specific revision
|
|
|
|
set cmd [concat | git diff-index $flags]
|
|
|
|
if {$i == 0} {
|
|
|
|
lappend cmd -R [lindex $ids 1]
|
|
|
|
} else {
|
|
|
|
lappend cmd [lindex $ids 0]
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
# comparing working directory with index
|
|
|
|
set cmd [concat | git diff-files $flags]
|
|
|
|
if {$j == 1} {
|
|
|
|
lappend cmd -R
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} elseif {$j >= 0} {
|
|
|
|
set cmd [concat | git diff-index --cached $flags]
|
2006-09-07 00:21:39 +00:00
|
|
|
if {[llength $ids] > 1} {
|
2007-07-13 09:49:37 +00:00
|
|
|
# comparing index with specific revision
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$i == 0} {
|
|
|
|
lappend cmd -R [lindex $ids 1]
|
|
|
|
} else {
|
|
|
|
lappend cmd [lindex $ids 0]
|
|
|
|
}
|
|
|
|
} else {
|
2007-07-13 09:49:37 +00:00
|
|
|
# comparing index with HEAD
|
2006-09-07 00:21:39 +00:00
|
|
|
lappend cmd HEAD
|
|
|
|
}
|
|
|
|
} else {
|
2007-07-13 09:49:37 +00:00
|
|
|
set cmd [concat | git diff-tree -r $flags $ids]
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
return $cmd
|
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc gettreediffs {ids} {
|
2006-04-02 10:47:40 +00:00
|
|
|
global treediff treepending
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
set treepending $ids
|
2005-07-20 13:13:46 +00:00
|
|
|
set treediff {}
|
2007-07-13 09:49:37 +00:00
|
|
|
if {[catch {set gdtf [open [diffcmd $ids {--no-commit-id}] r]}]} return
|
2005-05-11 00:45:38 +00:00
|
|
|
fconfigure $gdtf -blocking 0
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $gdtf [list gettreediffline $gdtf $ids]
|
2005-05-11 00:45:38 +00:00
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc gettreediffline {gdtf ids} {
|
2005-07-20 13:13:46 +00:00
|
|
|
global treediff treediffs treepending diffids diffmergeid
|
2008-04-26 06:00:00 +00:00
|
|
|
global cmitmode vfilelimit curview limitdiffs
|
2005-07-20 13:13:46 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
set nr 0
|
|
|
|
while {[incr nr] <= 1000 && [gets $gdtf line] >= 0} {
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
set i [string first "\t" $line]
|
|
|
|
if {$i >= 0} {
|
|
|
|
set file [string range $line [expr {$i+1}] end]
|
|
|
|
if {[string index $file 0] eq "\""} {
|
|
|
|
set file [lindex $file 0]
|
|
|
|
}
|
|
|
|
lappend treediff $file
|
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
}
|
|
|
|
if {![eof $gdtf]} {
|
|
|
|
return [expr {$nr >= 1000? 2: 1}]
|
|
|
|
}
|
|
|
|
close $gdtf
|
2008-04-26 06:00:00 +00:00
|
|
|
if {$limitdiffs && $vfilelimit($curview) ne {}} {
|
2007-10-24 00:16:56 +00:00
|
|
|
set flist {}
|
|
|
|
foreach f $treediff {
|
2008-04-26 06:00:00 +00:00
|
|
|
if {[path_filter $vfilelimit($curview) $f]} {
|
2007-10-24 00:16:56 +00:00
|
|
|
lappend flist $f
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set treediffs($ids) $flist
|
|
|
|
} else {
|
|
|
|
set treediffs($ids) $treediff
|
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
unset treepending
|
|
|
|
if {$cmitmode eq "tree"} {
|
|
|
|
gettree $diffids
|
|
|
|
} elseif {$ids != $diffids} {
|
|
|
|
if {![info exists diffmergeid]} {
|
|
|
|
gettreediffs $diffids
|
2005-07-16 11:46:13 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
} else {
|
|
|
|
addtocflist $ids
|
2005-05-11 00:45:38 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2005-05-11 00:45:38 +00:00
|
|
|
}
|
|
|
|
|
2007-08-12 10:05:46 +00:00
|
|
|
# empty string or positive integer
|
|
|
|
proc diffcontextvalidate {v} {
|
|
|
|
return [regexp {^(|[1-9][0-9]*)$} $v]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc diffcontextchange {n1 n2 op} {
|
|
|
|
global diffcontextstring diffcontext
|
|
|
|
|
|
|
|
if {[string is integer -strict $diffcontextstring]} {
|
|
|
|
if {$diffcontextstring > 0} {
|
|
|
|
set diffcontext $diffcontextstring
|
|
|
|
reselectline
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-17 22:42:55 +00:00
|
|
|
proc changeignorespace {} {
|
|
|
|
reselectline
|
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc getblobdiffs {ids} {
|
2007-10-06 10:22:00 +00:00
|
|
|
global blobdifffd diffids env
|
2007-06-17 04:45:00 +00:00
|
|
|
global diffinhdr treediffs
|
2007-08-12 10:05:46 +00:00
|
|
|
global diffcontext
|
2008-01-17 22:42:55 +00:00
|
|
|
global ignorespace
|
2008-04-26 06:00:00 +00:00
|
|
|
global limitdiffs vfilelimit curview
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2007-10-23 00:15:11 +00:00
|
|
|
set cmd [diffcmd $ids "-p -C --no-commit-id -U$diffcontext"]
|
2008-01-17 22:42:55 +00:00
|
|
|
if {$ignorespace} {
|
|
|
|
append cmd " -w"
|
|
|
|
}
|
2008-04-26 06:00:00 +00:00
|
|
|
if {$limitdiffs && $vfilelimit($curview) ne {}} {
|
|
|
|
set cmd [concat $cmd -- $vfilelimit($curview)]
|
2007-10-23 00:15:11 +00:00
|
|
|
}
|
|
|
|
if {[catch {set bdf [open $cmd r]} err]} {
|
2005-05-11 23:44:54 +00:00
|
|
|
puts "error getting diffs: $err"
|
|
|
|
return
|
|
|
|
}
|
2005-07-17 15:11:44 +00:00
|
|
|
set diffinhdr 0
|
2005-05-11 23:44:54 +00:00
|
|
|
fconfigure $bdf -blocking 0
|
2005-06-25 05:39:21 +00:00
|
|
|
set blobdifffd($ids) $bdf
|
2007-06-17 04:45:00 +00:00
|
|
|
filerun $bdf [list getblobdiffline $bdf $diffids]
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
|
|
|
|
2006-05-02 09:55:31 +00:00
|
|
|
proc setinlist {var i val} {
|
|
|
|
global $var
|
|
|
|
|
|
|
|
while {[llength [set $var]] < $i} {
|
|
|
|
lappend $var {}
|
|
|
|
}
|
|
|
|
if {[llength [set $var]] == $i} {
|
|
|
|
lappend $var $val
|
|
|
|
} else {
|
|
|
|
lset $var $i $val
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
proc makediffhdr {fname ids} {
|
|
|
|
global ctext curdiffstart treediffs
|
|
|
|
|
|
|
|
set i [lsearch -exact $treediffs($ids) $fname]
|
|
|
|
if {$i >= 0} {
|
|
|
|
setinlist difffilestart $i $curdiffstart
|
|
|
|
}
|
|
|
|
set l [expr {(78 - [string length $fname]) / 2}]
|
|
|
|
set pad [string range "----------------------------------------" 1 $l]
|
|
|
|
$ctext insert $curdiffstart "$pad $fname $pad" filesep
|
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc getblobdiffline {bdf ids} {
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
global diffids blobdifffd ctext curdiffstart
|
2005-07-20 16:25:54 +00:00
|
|
|
global diffnexthead diffnextnote difffilestart
|
2007-06-17 04:45:00 +00:00
|
|
|
global diffinhdr treediffs
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
set nr 0
|
2005-05-11 23:44:54 +00:00
|
|
|
$ctext conf -state normal
|
2007-06-17 04:45:00 +00:00
|
|
|
while {[incr nr] <= 1000 && [gets $bdf line] >= 0} {
|
|
|
|
if {$ids != $diffids || $bdf != $blobdifffd($ids)} {
|
|
|
|
close $bdf
|
|
|
|
return 0
|
2006-05-02 09:55:31 +00:00
|
|
|
}
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
if {![string compare -length 11 "diff --git " $line]} {
|
|
|
|
# trim off "diff --git "
|
|
|
|
set line [string range $line 11 end]
|
|
|
|
set diffinhdr 1
|
2007-06-17 04:45:00 +00:00
|
|
|
# start of a new file
|
|
|
|
$ctext insert end "\n"
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
set curdiffstart [$ctext index "end - 1c"]
|
|
|
|
$ctext insert end "\n" filesep
|
|
|
|
# If the name hasn't changed the length will be odd,
|
|
|
|
# the middle char will be a space, and the two bits either
|
|
|
|
# side will be a/name and b/name, or "a/name" and "b/name".
|
|
|
|
# If the name has changed we'll get "rename from" and
|
2007-08-16 12:32:29 +00:00
|
|
|
# "rename to" or "copy from" and "copy to" lines following this,
|
|
|
|
# and we'll use them to get the filenames.
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
# This complexity is necessary because spaces in the filename(s)
|
|
|
|
# don't get escaped.
|
|
|
|
set l [string length $line]
|
|
|
|
set i [expr {$l / 2}]
|
|
|
|
if {!(($l & 1) && [string index $line $i] eq " " &&
|
|
|
|
[string range $line 2 [expr {$i - 1}]] eq \
|
|
|
|
[string range $line [expr {$i + 3}] end])} {
|
|
|
|
continue
|
2006-05-02 09:55:31 +00:00
|
|
|
}
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
# unescape if quoted and chop off the a/ from the front
|
|
|
|
if {[string index $line 0] eq "\""} {
|
|
|
|
set fname [string range [lindex $line 0] 2 end]
|
|
|
|
} else {
|
|
|
|
set fname [string range $line 2 [expr {$i - 1}]]
|
2007-06-17 04:45:00 +00:00
|
|
|
}
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
makediffhdr $fname $ids
|
|
|
|
|
|
|
|
} elseif {[regexp {^@@ -([0-9]+)(,[0-9]+)? \+([0-9]+)(,[0-9]+)? @@(.*)} \
|
2007-06-17 04:45:00 +00:00
|
|
|
$line match f1l f1c f2l f2c rest]} {
|
|
|
|
$ctext insert end "$line\n" hunksep
|
|
|
|
set diffinhdr 0
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
|
|
|
|
} elseif {$diffinhdr} {
|
2007-10-02 14:16:54 +00:00
|
|
|
if {![string compare -length 12 "rename from " $line]} {
|
2007-08-16 12:32:29 +00:00
|
|
|
set fname [string range $line [expr 6 + [string first " from " $line] ] end]
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
if {[string index $fname 0] eq "\""} {
|
|
|
|
set fname [lindex $fname 0]
|
|
|
|
}
|
|
|
|
set i [lsearch -exact $treediffs($ids) $fname]
|
|
|
|
if {$i >= 0} {
|
|
|
|
setinlist difffilestart $i $curdiffstart
|
|
|
|
}
|
2007-08-16 12:32:29 +00:00
|
|
|
} elseif {![string compare -length 10 $line "rename to "] ||
|
|
|
|
![string compare -length 8 $line "copy to "]} {
|
|
|
|
set fname [string range $line [expr 4 + [string first " to " $line] ] end]
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
if {[string index $fname 0] eq "\""} {
|
|
|
|
set fname [lindex $fname 0]
|
|
|
|
}
|
|
|
|
makediffhdr $fname $ids
|
|
|
|
} elseif {[string compare -length 3 $line "---"] == 0} {
|
|
|
|
# do nothing
|
|
|
|
continue
|
|
|
|
} elseif {[string compare -length 3 $line "+++"] == 0} {
|
|
|
|
set diffinhdr 0
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
$ctext insert end "$line\n" filesep
|
|
|
|
|
2005-05-11 23:44:54 +00:00
|
|
|
} else {
|
2007-06-17 04:45:00 +00:00
|
|
|
set x [string range $line 0 0]
|
|
|
|
if {$x == "-" || $x == "+"} {
|
|
|
|
set tag [expr {$x == "+"}]
|
|
|
|
$ctext insert end "$line\n" d$tag
|
|
|
|
} elseif {$x == " "} {
|
|
|
|
$ctext insert end "$line\n"
|
|
|
|
} else {
|
gitk: Improve handling of whitespace and special chars in filenames
The main thing here is better parsing of the diff --git lines in the
output of git diff-tree -p. We now cope with filenames in quotes with
special chars escaped. If the filenames contain spaces they aren't
quoted, however, which can create difficulties in parsing. We get
around the difficulties by detecting the case when the filename hasn't
changed (chop the part after "diff --git " in two and see if the halves
match apart from a/ in one and b/ in the other), and if it hasn't
changed, we just use one half. If the filename has changed we wait
for the "rename from" and "rename to" lines, which give the old and
new filenames unambiguously.
This also improves the parsing of the output of git diff-tree.
Instead of using lindex to extract the filename, we take the part from
the first tab on, and if it starts with a quote, we use [lindex $str 0]
to remove the quotes and convert the escapes.
This also gets rid of some unused tagging of the diff text, uses
[string compare] instead of [regexp] in some places, and fixes the
regexp for detecting the @@ hunk-separator lines (the regexp wasn't
accepting a single number, as in "-0,0 +1" for example).
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-06-23 10:28:15 +00:00
|
|
|
# "\ No newline at end of file",
|
|
|
|
# or something else we don't recognize
|
|
|
|
$ctext insert end "$line\n" hunksep
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
$ctext conf -state disabled
|
2007-06-17 04:45:00 +00:00
|
|
|
if {[eof $bdf]} {
|
|
|
|
close $bdf
|
|
|
|
return 0
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return [expr {$nr >= 1000? 2: 1}]
|
2005-05-11 23:44:54 +00:00
|
|
|
}
|
|
|
|
|
2007-04-19 01:39:12 +00:00
|
|
|
proc changediffdisp {} {
|
|
|
|
global ctext diffelide
|
|
|
|
|
|
|
|
$ctext tag conf d0 -elide [lindex $diffelide 0]
|
|
|
|
$ctext tag conf d1 -elide [lindex $diffelide 1]
|
|
|
|
}
|
|
|
|
|
2008-05-10 03:15:36 +00:00
|
|
|
proc highlightfile {loc cline} {
|
|
|
|
global ctext cflist cflist_top
|
|
|
|
|
|
|
|
$ctext yview $loc
|
|
|
|
$cflist tag remove highlight $cflist_top.0 "$cflist_top.0 lineend"
|
|
|
|
$cflist tag add highlight $cline.0 "$cline.0 lineend"
|
|
|
|
$cflist see $cline.0
|
|
|
|
set cflist_top $cline
|
|
|
|
}
|
|
|
|
|
2006-09-27 03:32:19 +00:00
|
|
|
proc prevfile {} {
|
2008-05-10 03:15:36 +00:00
|
|
|
global difffilestart ctext cmitmode
|
|
|
|
|
|
|
|
if {$cmitmode eq "tree"} return
|
|
|
|
set prev 0.0
|
|
|
|
set prevline 1
|
2006-09-27 03:32:19 +00:00
|
|
|
set here [$ctext index @0,0]
|
|
|
|
foreach loc $difffilestart {
|
|
|
|
if {[$ctext compare $loc >= $here]} {
|
2008-05-10 03:15:36 +00:00
|
|
|
highlightfile $prev $prevline
|
2006-09-27 03:32:19 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
set prev $loc
|
2008-05-10 03:15:36 +00:00
|
|
|
incr prevline
|
2006-09-27 03:32:19 +00:00
|
|
|
}
|
2008-05-10 03:15:36 +00:00
|
|
|
highlightfile $prev $prevline
|
2006-09-27 03:32:19 +00:00
|
|
|
}
|
|
|
|
|
2005-05-19 12:35:53 +00:00
|
|
|
proc nextfile {} {
|
2008-05-10 03:15:36 +00:00
|
|
|
global difffilestart ctext cmitmode
|
|
|
|
|
|
|
|
if {$cmitmode eq "tree"} return
|
2005-05-19 12:35:53 +00:00
|
|
|
set here [$ctext index @0,0]
|
2008-05-10 03:15:36 +00:00
|
|
|
set line 1
|
2006-04-27 09:21:49 +00:00
|
|
|
foreach loc $difffilestart {
|
2008-05-10 03:15:36 +00:00
|
|
|
incr line
|
2006-04-27 09:21:49 +00:00
|
|
|
if {[$ctext compare $loc > $here]} {
|
2008-05-10 03:15:36 +00:00
|
|
|
highlightfile $loc $line
|
2006-09-27 03:32:19 +00:00
|
|
|
return
|
2005-05-19 12:35:53 +00:00
|
|
|
}
|
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
|
|
|
|
2006-05-24 00:16:03 +00:00
|
|
|
proc clear_ctext {{first 1.0}} {
|
|
|
|
global ctext smarktop smarkbot
|
2007-08-23 12:24:38 +00:00
|
|
|
global pendinglinks
|
2006-05-24 00:16:03 +00:00
|
|
|
|
2006-05-25 11:25:13 +00:00
|
|
|
set l [lindex [split $first .] 0]
|
|
|
|
if {![info exists smarktop] || [$ctext compare $first < $smarktop.0]} {
|
|
|
|
set smarktop $l
|
2006-05-24 00:16:03 +00:00
|
|
|
}
|
2006-05-25 11:25:13 +00:00
|
|
|
if {![info exists smarkbot] || [$ctext compare $first < $smarkbot.0]} {
|
|
|
|
set smarkbot $l
|
2006-05-24 00:16:03 +00:00
|
|
|
}
|
|
|
|
$ctext delete $first end
|
2007-08-23 12:24:38 +00:00
|
|
|
if {$first eq "1.0"} {
|
|
|
|
catch {unset pendinglinks}
|
|
|
|
}
|
2006-05-24 00:16:03 +00:00
|
|
|
}
|
|
|
|
|
2007-09-28 11:27:39 +00:00
|
|
|
proc settabs {{firstab {}}} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global firsttabstop tabstop ctext have_tk85
|
2007-09-28 11:27:39 +00:00
|
|
|
|
|
|
|
if {$firstab ne {} && $have_tk85} {
|
|
|
|
set firsttabstop $firstab
|
|
|
|
}
|
2007-10-04 12:27:13 +00:00
|
|
|
set w [font measure textfont "0"]
|
2007-09-28 11:27:39 +00:00
|
|
|
if {$firsttabstop != 0} {
|
2007-10-04 12:19:24 +00:00
|
|
|
$ctext conf -tabs [list [expr {($firsttabstop + $tabstop) * $w}] \
|
|
|
|
[expr {($firsttabstop + 2 * $tabstop) * $w}]]
|
2007-09-28 11:27:39 +00:00
|
|
|
} elseif {$have_tk85 || $tabstop != 8} {
|
|
|
|
$ctext conf -tabs [expr {$tabstop * $w}]
|
|
|
|
} else {
|
|
|
|
$ctext conf -tabs {}
|
|
|
|
}
|
2006-05-24 00:16:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc incrsearch {name ix op} {
|
2006-05-25 11:25:13 +00:00
|
|
|
global ctext searchstring searchdirn
|
2006-05-24 00:16:03 +00:00
|
|
|
|
|
|
|
$ctext tag remove found 1.0 end
|
2006-05-25 11:25:13 +00:00
|
|
|
if {[catch {$ctext index anchor}]} {
|
|
|
|
# no anchor set, use start of selection, or of visible area
|
|
|
|
set sel [$ctext tag ranges sel]
|
|
|
|
if {$sel ne {}} {
|
|
|
|
$ctext mark set anchor [lindex $sel 0]
|
|
|
|
} elseif {$searchdirn eq "-forwards"} {
|
|
|
|
$ctext mark set anchor @0,0
|
|
|
|
} else {
|
|
|
|
$ctext mark set anchor @0,[winfo height $ctext]
|
|
|
|
}
|
|
|
|
}
|
2006-05-24 00:16:03 +00:00
|
|
|
if {$searchstring ne {}} {
|
2006-05-25 11:25:13 +00:00
|
|
|
set here [$ctext search $searchdirn -- $searchstring anchor]
|
|
|
|
if {$here ne {}} {
|
|
|
|
$ctext see $here
|
|
|
|
}
|
2006-05-24 00:16:03 +00:00
|
|
|
searchmarkvisible 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc dosearch {} {
|
2006-05-25 11:25:13 +00:00
|
|
|
global sstring ctext searchstring searchdirn
|
2006-05-24 00:16:03 +00:00
|
|
|
|
|
|
|
focus $sstring
|
|
|
|
$sstring icursor end
|
2006-05-25 11:25:13 +00:00
|
|
|
set searchdirn -forwards
|
|
|
|
if {$searchstring ne {}} {
|
|
|
|
set sel [$ctext tag ranges sel]
|
|
|
|
if {$sel ne {}} {
|
|
|
|
set start "[lindex $sel 0] + 1c"
|
|
|
|
} elseif {[catch {set start [$ctext index anchor]}]} {
|
|
|
|
set start "@0,0"
|
|
|
|
}
|
|
|
|
set match [$ctext search -count mlen -- $searchstring $start]
|
|
|
|
$ctext tag remove sel 1.0 end
|
|
|
|
if {$match eq {}} {
|
|
|
|
bell
|
|
|
|
return
|
|
|
|
}
|
|
|
|
$ctext see $match
|
|
|
|
set mend "$match + $mlen c"
|
|
|
|
$ctext tag add sel $match $mend
|
|
|
|
$ctext mark unset anchor
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc dosearchback {} {
|
|
|
|
global sstring ctext searchstring searchdirn
|
|
|
|
|
|
|
|
focus $sstring
|
|
|
|
$sstring icursor end
|
|
|
|
set searchdirn -backwards
|
|
|
|
if {$searchstring ne {}} {
|
|
|
|
set sel [$ctext tag ranges sel]
|
|
|
|
if {$sel ne {}} {
|
|
|
|
set start [lindex $sel 0]
|
|
|
|
} elseif {[catch {set start [$ctext index anchor]}]} {
|
|
|
|
set start @0,[winfo height $ctext]
|
|
|
|
}
|
|
|
|
set match [$ctext search -backwards -count ml -- $searchstring $start]
|
|
|
|
$ctext tag remove sel 1.0 end
|
|
|
|
if {$match eq {}} {
|
|
|
|
bell
|
|
|
|
return
|
|
|
|
}
|
|
|
|
$ctext see $match
|
|
|
|
set mend "$match + $ml c"
|
|
|
|
$ctext tag add sel $match $mend
|
|
|
|
$ctext mark unset anchor
|
2006-05-24 00:16:03 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc searchmark {first last} {
|
|
|
|
global ctext searchstring
|
|
|
|
|
|
|
|
set mend $first.0
|
|
|
|
while {1} {
|
|
|
|
set match [$ctext search -count mlen -- $searchstring $mend $last.end]
|
|
|
|
if {$match eq {}} break
|
|
|
|
set mend "$match + $mlen c"
|
|
|
|
$ctext tag add found $match $mend
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc searchmarkvisible {doall} {
|
|
|
|
global ctext smarktop smarkbot
|
|
|
|
|
|
|
|
set topline [lindex [split [$ctext index @0,0] .] 0]
|
|
|
|
set botline [lindex [split [$ctext index @0,[winfo height $ctext]] .] 0]
|
|
|
|
if {$doall || $botline < $smarktop || $topline > $smarkbot} {
|
|
|
|
# no overlap with previous
|
|
|
|
searchmark $topline $botline
|
|
|
|
set smarktop $topline
|
|
|
|
set smarkbot $botline
|
|
|
|
} else {
|
|
|
|
if {$topline < $smarktop} {
|
|
|
|
searchmark $topline [expr {$smarktop-1}]
|
|
|
|
set smarktop $topline
|
|
|
|
}
|
|
|
|
if {$botline > $smarkbot} {
|
|
|
|
searchmark [expr {$smarkbot+1}] $botline
|
|
|
|
set smarkbot $botline
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc scrolltext {f0 f1} {
|
2006-05-25 11:25:13 +00:00
|
|
|
global searchstring
|
2006-05-24 00:16:03 +00:00
|
|
|
|
2008-03-08 12:27:23 +00:00
|
|
|
.bleft.bottom.sb set $f0 $f1
|
2006-05-24 00:16:03 +00:00
|
|
|
if {$searchstring ne {}} {
|
|
|
|
searchmarkvisible 0
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
proc setcoords {} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global linespc charspc canvx0 canvy0
|
2005-08-17 23:30:10 +00:00
|
|
|
global xspc1 xspc2 lthickness
|
2005-08-04 23:52:16 +00:00
|
|
|
|
2007-10-04 12:27:13 +00:00
|
|
|
set linespc [font metrics mainfont -linespace]
|
|
|
|
set charspc [font measure mainfont "m"]
|
2006-02-19 11:44:47 +00:00
|
|
|
set canvy0 [expr {int(3 + 0.5 * $linespc)}]
|
|
|
|
set canvx0 [expr {int(3 + 0.5 * $linespc)}]
|
2005-08-17 23:30:10 +00:00
|
|
|
set lthickness [expr {int($linespc / 9) + 1}]
|
2005-08-04 23:52:16 +00:00
|
|
|
set xspc1(0) $linespc
|
|
|
|
set xspc2 $linespc
|
2005-05-12 23:46:16 +00:00
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
proc redisplay {} {
|
2006-03-30 22:55:11 +00:00
|
|
|
global canv
|
2006-02-19 11:44:47 +00:00
|
|
|
global selectedline
|
|
|
|
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
if {$ymax eq {} || $ymax == 0} return
|
|
|
|
set span [$canv yview]
|
|
|
|
clear_display
|
2006-03-30 22:55:11 +00:00
|
|
|
setcanvscroll
|
2006-02-19 11:44:47 +00:00
|
|
|
allcanvs yview moveto [lindex $span 0]
|
|
|
|
drawvisible
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline ne {}} {
|
2006-02-19 11:44:47 +00:00
|
|
|
selectline $selectedline 0
|
2006-08-06 11:08:05 +00:00
|
|
|
allcanvs yview moveto [lindex $span 0]
|
2005-05-15 12:55:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-10-06 08:27:37 +00:00
|
|
|
proc parsefont {f n} {
|
|
|
|
global fontattr
|
|
|
|
|
|
|
|
set fontattr($f,family) [lindex $n 0]
|
|
|
|
set s [lindex $n 1]
|
|
|
|
if {$s eq {} || $s == 0} {
|
|
|
|
set s 10
|
|
|
|
} elseif {$s < 0} {
|
|
|
|
set s [expr {int(-$s / [winfo fpixels . 1p] + 0.5)}]
|
2007-10-04 12:27:13 +00:00
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
set fontattr($f,size) $s
|
|
|
|
set fontattr($f,weight) normal
|
|
|
|
set fontattr($f,slant) roman
|
|
|
|
foreach style [lrange $n 2 end] {
|
|
|
|
switch -- $style {
|
|
|
|
"normal" -
|
|
|
|
"bold" {set fontattr($f,weight) $style}
|
|
|
|
"roman" -
|
|
|
|
"italic" {set fontattr($f,slant) $style}
|
|
|
|
}
|
2007-10-04 12:27:13 +00:00
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc fontflags {f {isbold 0}} {
|
|
|
|
global fontattr
|
|
|
|
|
|
|
|
return [list -family $fontattr($f,family) -size $fontattr($f,size) \
|
|
|
|
-weight [expr {$isbold? "bold": $fontattr($f,weight)}] \
|
|
|
|
-slant $fontattr($f,slant)]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc fontname {f} {
|
|
|
|
global fontattr
|
|
|
|
|
|
|
|
set n [list $fontattr($f,family) $fontattr($f,size)]
|
|
|
|
if {$fontattr($f,weight) eq "bold"} {
|
|
|
|
lappend n "bold"
|
2007-10-04 12:27:13 +00:00
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
if {$fontattr($f,slant) eq "italic"} {
|
|
|
|
lappend n "italic"
|
2007-10-04 12:27:13 +00:00
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
return $n
|
2007-10-04 12:27:13 +00:00
|
|
|
}
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
proc incrfont {inc} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global mainfont textfont ctext canv cflist showrefstop
|
2007-10-06 08:27:37 +00:00
|
|
|
global stopped entries fontattr
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
unmarkmatches
|
2007-10-06 08:27:37 +00:00
|
|
|
set s $fontattr(mainfont,size)
|
2007-10-04 12:27:13 +00:00
|
|
|
incr s $inc
|
|
|
|
if {$s < 1} {
|
|
|
|
set s 1
|
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
set fontattr(mainfont,size) $s
|
2007-10-04 12:27:13 +00:00
|
|
|
font config mainfont -size $s
|
|
|
|
font config mainfontbold -size $s
|
2007-10-06 08:27:37 +00:00
|
|
|
set mainfont [fontname mainfont]
|
|
|
|
set s $fontattr(textfont,size)
|
2007-10-04 12:27:13 +00:00
|
|
|
incr s $inc
|
|
|
|
if {$s < 1} {
|
|
|
|
set s 1
|
|
|
|
}
|
2007-10-06 08:27:37 +00:00
|
|
|
set fontattr(textfont,size) $s
|
2007-10-04 12:27:13 +00:00
|
|
|
font config textfont -size $s
|
|
|
|
font config textfontbold -size $s
|
2007-10-06 08:27:37 +00:00
|
|
|
set textfont [fontname textfont]
|
2005-05-15 12:55:47 +00:00
|
|
|
setcoords
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs
|
2005-05-15 12:55:47 +00:00
|
|
|
redisplay
|
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2005-06-25 06:37:13 +00:00
|
|
|
proc clearsha1 {} {
|
|
|
|
global sha1entry sha1string
|
|
|
|
if {[string length $sha1string] == 40} {
|
|
|
|
$sha1entry delete 0 end
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-05-21 07:35:37 +00:00
|
|
|
proc sha1change {n1 n2 op} {
|
|
|
|
global sha1string currentid sha1but
|
|
|
|
if {$sha1string == {}
|
|
|
|
|| ([info exists currentid] && $sha1string == $currentid)} {
|
|
|
|
set state disabled
|
|
|
|
} else {
|
|
|
|
set state normal
|
|
|
|
}
|
|
|
|
if {[$sha1but cget -state] == $state} return
|
|
|
|
if {$state == "normal"} {
|
2007-11-07 17:42:55 +00:00
|
|
|
$sha1but conf -state normal -relief raised -text "[mc "Goto:"] "
|
2005-05-21 07:35:37 +00:00
|
|
|
} else {
|
2007-11-07 17:42:55 +00:00
|
|
|
$sha1but conf -state disabled -relief flat -text "[mc "SHA1 ID:"] "
|
2005-05-21 07:35:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc gotocommit {} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global sha1string tagids headids curview varcid
|
2005-07-18 16:16:35 +00:00
|
|
|
|
2005-05-21 07:35:37 +00:00
|
|
|
if {$sha1string == {}
|
|
|
|
|| ([info exists currentid] && $sha1string == $currentid)} return
|
|
|
|
if {[info exists tagids($sha1string)]} {
|
|
|
|
set id $tagids($sha1string)
|
2006-03-30 05:13:12 +00:00
|
|
|
} elseif {[info exists headids($sha1string)]} {
|
|
|
|
set id $headids($sha1string)
|
2005-05-21 07:35:37 +00:00
|
|
|
} else {
|
|
|
|
set id [string tolower $sha1string]
|
2005-07-18 16:16:35 +00:00
|
|
|
if {[regexp {^[0-9a-f]{4,39}$} $id]} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set matches [array names varcid "$curview,$id*"]
|
2005-07-18 16:16:35 +00:00
|
|
|
if {$matches ne {}} {
|
|
|
|
if {[llength $matches] > 1} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "Short SHA1 id %s is ambiguous" $id]
|
2005-07-18 16:16:35 +00:00
|
|
|
return
|
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set id [lindex [split [lindex $matches 0] ","] 1]
|
2005-07-18 16:16:35 +00:00
|
|
|
}
|
|
|
|
}
|
2005-05-21 07:35:37 +00:00
|
|
|
}
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $id $curview]} {
|
|
|
|
selectline [rowofcommit $id] 1
|
2005-05-21 07:35:37 +00:00
|
|
|
return
|
|
|
|
}
|
2005-07-18 16:16:35 +00:00
|
|
|
if {[regexp {^[0-9a-fA-F]{4,}$} $sha1string]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
set msg [mc "SHA1 id %s is not known" $sha1string]
|
2005-05-21 07:35:37 +00:00
|
|
|
} else {
|
2007-11-07 17:42:55 +00:00
|
|
|
set msg [mc "Tag/Head %s is not known" $sha1string]
|
2005-05-21 07:35:37 +00:00
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup $msg
|
2005-05-21 07:35:37 +00:00
|
|
|
}
|
|
|
|
|
2005-06-17 00:12:26 +00:00
|
|
|
proc lineenter {x y id} {
|
|
|
|
global hoverx hovery hoverid hovertimer
|
|
|
|
global commitinfo canv
|
|
|
|
|
2006-03-02 11:56:44 +00:00
|
|
|
if {![info exists commitinfo($id)] && ![getcommit $id]} return
|
2005-06-17 00:12:26 +00:00
|
|
|
set hoverx $x
|
|
|
|
set hovery $y
|
|
|
|
set hoverid $id
|
|
|
|
if {[info exists hovertimer]} {
|
|
|
|
after cancel $hovertimer
|
|
|
|
}
|
|
|
|
set hovertimer [after 500 linehover]
|
|
|
|
$canv delete hover
|
|
|
|
}
|
|
|
|
|
|
|
|
proc linemotion {x y id} {
|
|
|
|
global hoverx hovery hoverid hovertimer
|
|
|
|
|
|
|
|
if {[info exists hoverid] && $id == $hoverid} {
|
|
|
|
set hoverx $x
|
|
|
|
set hovery $y
|
|
|
|
if {[info exists hovertimer]} {
|
|
|
|
after cancel $hovertimer
|
|
|
|
}
|
|
|
|
set hovertimer [after 500 linehover]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc lineleave {id} {
|
|
|
|
global hoverid hovertimer canv
|
|
|
|
|
|
|
|
if {[info exists hoverid] && $id == $hoverid} {
|
|
|
|
$canv delete hover
|
|
|
|
if {[info exists hovertimer]} {
|
|
|
|
after cancel $hovertimer
|
|
|
|
unset hovertimer
|
|
|
|
}
|
|
|
|
unset hoverid
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc linehover {} {
|
|
|
|
global hoverx hovery hoverid hovertimer
|
|
|
|
global canv linespc lthickness
|
2007-10-04 12:27:13 +00:00
|
|
|
global commitinfo
|
2005-06-17 00:12:26 +00:00
|
|
|
|
|
|
|
set text [lindex $commitinfo($hoverid) 0]
|
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
if {$ymax == {}} return
|
|
|
|
set yfrac [lindex [$canv yview] 0]
|
|
|
|
set x [expr {$hoverx + 2 * $linespc}]
|
|
|
|
set y [expr {$hovery + $yfrac * $ymax - $linespc / 2}]
|
|
|
|
set x0 [expr {$x - 2 * $lthickness}]
|
|
|
|
set y0 [expr {$y - 2 * $lthickness}]
|
2007-10-04 12:27:13 +00:00
|
|
|
set x1 [expr {$x + [font measure mainfont $text] + 2 * $lthickness}]
|
2005-06-17 00:12:26 +00:00
|
|
|
set y1 [expr {$y + $linespc + 2 * $lthickness}]
|
|
|
|
set t [$canv create rectangle $x0 $y0 $x1 $y1 \
|
|
|
|
-fill \#ffff80 -outline black -width 1 -tags hover]
|
|
|
|
$canv raise $t
|
2006-07-05 12:56:37 +00:00
|
|
|
set t [$canv create text $x $y -anchor nw -text $text -tags hover \
|
2007-10-04 12:27:13 +00:00
|
|
|
-font mainfont]
|
2005-06-17 00:12:26 +00:00
|
|
|
$canv raise $t
|
|
|
|
}
|
|
|
|
|
2005-08-30 00:57:11 +00:00
|
|
|
proc clickisonarrow {id y} {
|
2006-04-04 00:16:22 +00:00
|
|
|
global lthickness
|
2005-08-30 00:57:11 +00:00
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
set ranges [rowranges $id]
|
2005-08-30 00:57:11 +00:00
|
|
|
set thresh [expr {2 * $lthickness + 6}]
|
2006-04-04 00:16:22 +00:00
|
|
|
set n [expr {[llength $ranges] - 1}]
|
2006-02-27 23:02:03 +00:00
|
|
|
for {set i 1} {$i < $n} {incr i} {
|
2006-04-04 00:16:22 +00:00
|
|
|
set row [lindex $ranges $i]
|
2006-02-27 23:02:03 +00:00
|
|
|
if {abs([yc $row] - $y) < $thresh} {
|
|
|
|
return $i
|
2005-08-30 00:57:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
|
2006-02-27 23:02:03 +00:00
|
|
|
proc arrowjump {id n y} {
|
2006-04-04 00:16:22 +00:00
|
|
|
global canv
|
2005-08-30 00:57:11 +00:00
|
|
|
|
2006-02-27 23:02:03 +00:00
|
|
|
# 1 <-> 2, 3 <-> 4, etc...
|
|
|
|
set n [expr {(($n - 1) ^ 1) + 1}]
|
2006-04-04 00:16:22 +00:00
|
|
|
set row [lindex [rowranges $id] $n]
|
2006-02-27 23:02:03 +00:00
|
|
|
set yt [yc $row]
|
2005-08-30 00:57:11 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
if {$ymax eq {} || $ymax <= 0} return
|
|
|
|
set view [$canv yview]
|
|
|
|
set yspan [expr {[lindex $view 1] - [lindex $view 0]}]
|
|
|
|
set yfrac [expr {$yt / $ymax - $yspan / 2}]
|
|
|
|
if {$yfrac < 0} {
|
|
|
|
set yfrac 0
|
|
|
|
}
|
2006-02-27 23:02:03 +00:00
|
|
|
allcanvs yview moveto $yfrac
|
2005-08-30 00:57:11 +00:00
|
|
|
}
|
|
|
|
|
2005-08-07 23:47:22 +00:00
|
|
|
proc lineclick {x y id isnew} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global ctext commitinfo children canv thickerline curview
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2006-03-02 11:56:44 +00:00
|
|
|
if {![info exists commitinfo($id)] && ![getcommit $id]} return
|
2005-06-25 05:39:21 +00:00
|
|
|
unmarkmatches
|
2005-08-07 23:47:22 +00:00
|
|
|
unselectline
|
2005-08-30 00:57:11 +00:00
|
|
|
normalline
|
|
|
|
$canv delete hover
|
|
|
|
# draw this line thicker than normal
|
|
|
|
set thickerline $id
|
2006-03-02 12:00:44 +00:00
|
|
|
drawlines $id
|
2005-08-07 23:47:22 +00:00
|
|
|
if {$isnew} {
|
2005-08-30 00:57:11 +00:00
|
|
|
set ymax [lindex [$canv cget -scrollregion] 3]
|
|
|
|
if {$ymax eq {}} return
|
|
|
|
set yfrac [lindex [$canv yview] 0]
|
|
|
|
set y [expr {$y + $yfrac * $ymax}]
|
|
|
|
}
|
|
|
|
set dirn [clickisonarrow $id $y]
|
|
|
|
if {$dirn ne {}} {
|
|
|
|
arrowjump $id $dirn $y
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
if {$isnew} {
|
|
|
|
addtohistory [list lineclick $x $y $id 0]
|
2005-08-07 23:47:22 +00:00
|
|
|
}
|
2005-06-25 05:39:21 +00:00
|
|
|
# fill the details pane with info about this line
|
|
|
|
$ctext conf -state normal
|
2006-05-24 00:16:03 +00:00
|
|
|
clear_ctext
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs 0
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "[mc "Parent"]:\t"
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext insert end $id link0
|
|
|
|
setlink $id link0
|
2005-06-25 05:39:21 +00:00
|
|
|
set info $commitinfo($id)
|
2005-08-07 23:47:22 +00:00
|
|
|
$ctext insert end "\n\t[lindex $info 0]\n"
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\t[mc "Author"]:\t[lindex $info 1]\n"
|
2005-11-14 23:34:03 +00:00
|
|
|
set date [formatdate [lindex $info 2]]
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\t[mc "Date"]:\t$date\n"
|
2006-05-02 01:15:29 +00:00
|
|
|
set kids $children($curview,$id)
|
2006-04-02 10:47:40 +00:00
|
|
|
if {$kids ne {}} {
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n[mc "Children"]:"
|
2005-08-07 23:47:22 +00:00
|
|
|
set i 0
|
2006-04-02 10:47:40 +00:00
|
|
|
foreach child $kids {
|
2005-08-07 23:47:22 +00:00
|
|
|
incr i
|
2006-03-02 11:56:44 +00:00
|
|
|
if {![info exists commitinfo($child)] && ![getcommit $child]} continue
|
2005-06-25 05:39:21 +00:00
|
|
|
set info $commitinfo($child)
|
2005-08-07 23:47:22 +00:00
|
|
|
$ctext insert end "\n\t"
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext insert end $child link$i
|
|
|
|
setlink $child link$i
|
2005-08-07 23:47:22 +00:00
|
|
|
$ctext insert end "\n\t[lindex $info 0]"
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n\t[mc "Author"]:\t[lindex $info 1]"
|
2005-11-14 23:34:03 +00:00
|
|
|
set date [formatdate [lindex $info 2]]
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n\t[mc "Date"]:\t$date\n"
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
$ctext conf -state disabled
|
2006-04-27 09:21:49 +00:00
|
|
|
init_flist {}
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
|
2005-08-30 00:57:11 +00:00
|
|
|
proc normalline {} {
|
|
|
|
global thickerline
|
|
|
|
if {[info exists thickerline]} {
|
2006-03-02 12:00:44 +00:00
|
|
|
set id $thickerline
|
2005-08-30 00:57:11 +00:00
|
|
|
unset thickerline
|
2006-03-02 12:00:44 +00:00
|
|
|
drawlines $id
|
2005-08-30 00:57:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
proc selbyid {id} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview
|
|
|
|
if {[commitinview $id $curview]} {
|
|
|
|
selectline [rowofcommit $id] 1
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mstime {} {
|
|
|
|
global startmstime
|
|
|
|
if {![info exists startmstime]} {
|
|
|
|
set startmstime [clock clicks -milliseconds]
|
|
|
|
}
|
|
|
|
return [format "%.3f" [expr {([clock click -milliseconds] - $startmstime) / 1000.0}]]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc rowmenu {x y id} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global rowctxmenu selectedline rowmenuid curview
|
2007-07-13 09:49:37 +00:00
|
|
|
global nullid nullid2 fakerowmenu mainhead
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2006-09-07 00:21:39 +00:00
|
|
|
set rowmenuid $id
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {} || [rowofcommit $id] eq $selectedline} {
|
2005-06-25 05:39:21 +00:00
|
|
|
set state disabled
|
|
|
|
} else {
|
|
|
|
set state normal
|
|
|
|
}
|
2007-07-13 09:49:37 +00:00
|
|
|
if {$id ne $nullid && $id ne $nullid2} {
|
2006-09-07 00:21:39 +00:00
|
|
|
set menu $rowctxmenu
|
2008-05-02 15:46:20 +00:00
|
|
|
if {$mainhead ne {}} {
|
|
|
|
$menu entryconfigure 7 -label [mc "Reset %s branch to here" $mainhead]
|
|
|
|
} else {
|
|
|
|
$menu entryconfigure 7 -label [mc "Detached head: can't reset" $mainhead] -state disabled
|
|
|
|
}
|
2006-09-07 00:21:39 +00:00
|
|
|
} else {
|
|
|
|
set menu $fakerowmenu
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
$menu entryconfigure [mc "Diff this -> selected"] -state $state
|
|
|
|
$menu entryconfigure [mc "Diff selected -> this"] -state $state
|
|
|
|
$menu entryconfigure [mc "Make patch"] -state $state
|
2006-09-07 00:21:39 +00:00
|
|
|
tk_popup $menu $x $y
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc diffvssel {dirn} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global rowmenuid selectedline
|
2005-06-25 05:39:21 +00:00
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
if {$selectedline eq {}} return
|
2005-06-25 05:39:21 +00:00
|
|
|
if {$dirn} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set oldid [commitonrow $selectedline]
|
2005-06-25 05:39:21 +00:00
|
|
|
set newid $rowmenuid
|
|
|
|
} else {
|
|
|
|
set oldid $rowmenuid
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set newid [commitonrow $selectedline]
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
2005-08-07 23:47:22 +00:00
|
|
|
addtohistory [list doseldiff $oldid $newid]
|
|
|
|
doseldiff $oldid $newid
|
|
|
|
}
|
|
|
|
|
|
|
|
proc doseldiff {oldid newid} {
|
2006-04-27 09:21:49 +00:00
|
|
|
global ctext
|
2005-08-07 23:47:22 +00:00
|
|
|
global commitinfo
|
|
|
|
|
2005-06-25 05:39:21 +00:00
|
|
|
$ctext conf -state normal
|
2006-05-24 00:16:03 +00:00
|
|
|
clear_ctext
|
2007-11-07 17:42:55 +00:00
|
|
|
init_flist [mc "Top"]
|
|
|
|
$ctext insert end "[mc "From"] "
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext insert end $oldid link0
|
|
|
|
setlink $oldid link0
|
2005-08-07 23:47:22 +00:00
|
|
|
$ctext insert end "\n "
|
2005-06-25 05:39:21 +00:00
|
|
|
$ctext insert end [lindex $commitinfo($oldid) 0]
|
2007-11-07 17:42:55 +00:00
|
|
|
$ctext insert end "\n\n[mc "To"] "
|
2007-08-23 12:24:38 +00:00
|
|
|
$ctext insert end $newid link1
|
|
|
|
setlink $newid link1
|
2005-08-07 23:47:22 +00:00
|
|
|
$ctext insert end "\n "
|
2005-06-25 05:39:21 +00:00
|
|
|
$ctext insert end [lindex $commitinfo($newid) 0]
|
|
|
|
$ctext insert end "\n"
|
|
|
|
$ctext conf -state disabled
|
|
|
|
$ctext tag remove found 1.0 end
|
2005-11-28 09:41:56 +00:00
|
|
|
startdiff [list $oldid $newid]
|
2005-06-25 05:39:21 +00:00
|
|
|
}
|
|
|
|
|
2005-06-27 09:27:32 +00:00
|
|
|
proc mkpatch {} {
|
|
|
|
global rowmenuid currentid commitinfo patchtop patchnum
|
|
|
|
|
|
|
|
if {![info exists currentid]} return
|
|
|
|
set oldid $currentid
|
|
|
|
set oldhead [lindex $commitinfo($oldid) 0]
|
|
|
|
set newid $rowmenuid
|
|
|
|
set newhead [lindex $commitinfo($newid) 0]
|
|
|
|
set top .patch
|
|
|
|
set patchtop $top
|
|
|
|
catch {destroy $top}
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.title -text [mc "Generate patch"]
|
2005-06-28 23:47:48 +00:00
|
|
|
grid $top.title - -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.from -text [mc "From:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.fromsha1 -width 40 -relief flat
|
2005-06-27 09:27:32 +00:00
|
|
|
$top.fromsha1 insert 0 $oldid
|
|
|
|
$top.fromsha1 conf -state readonly
|
|
|
|
grid $top.from $top.fromsha1 -sticky w
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.fromhead -width 60 -relief flat
|
2005-06-27 09:27:32 +00:00
|
|
|
$top.fromhead insert 0 $oldhead
|
|
|
|
$top.fromhead conf -state readonly
|
|
|
|
grid x $top.fromhead -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.to -text [mc "To:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.tosha1 -width 40 -relief flat
|
2005-06-27 09:27:32 +00:00
|
|
|
$top.tosha1 insert 0 $newid
|
|
|
|
$top.tosha1 conf -state readonly
|
|
|
|
grid $top.to $top.tosha1 -sticky w
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.tohead -width 60 -relief flat
|
2005-06-27 09:27:32 +00:00
|
|
|
$top.tohead insert 0 $newhead
|
|
|
|
$top.tohead conf -state readonly
|
|
|
|
grid x $top.tohead -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.rev -text [mc "Reverse"] -command mkpatchrev -padx 5
|
2005-06-27 09:27:32 +00:00
|
|
|
grid $top.rev x -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.flab -text [mc "Output file:"]
|
2005-06-27 09:27:32 +00:00
|
|
|
entry $top.fname -width 60
|
|
|
|
$top.fname insert 0 [file normalize "patch$patchnum.patch"]
|
|
|
|
incr patchnum
|
2005-06-27 12:56:40 +00:00
|
|
|
grid $top.flab $top.fname -sticky w
|
2005-06-27 09:27:32 +00:00
|
|
|
frame $top.buts
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.buts.gen -text [mc "Generate"] -command mkpatchgo
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command mkpatchcan
|
2005-06-27 09:27:32 +00:00
|
|
|
grid $top.buts.gen $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - -pady 10 -sticky ew
|
2005-06-27 12:56:40 +00:00
|
|
|
focus $top.fname
|
2005-06-27 09:27:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc mkpatchrev {} {
|
|
|
|
global patchtop
|
|
|
|
|
|
|
|
set oldid [$patchtop.fromsha1 get]
|
|
|
|
set oldhead [$patchtop.fromhead get]
|
|
|
|
set newid [$patchtop.tosha1 get]
|
|
|
|
set newhead [$patchtop.tohead get]
|
|
|
|
foreach e [list fromsha1 fromhead tosha1 tohead] \
|
|
|
|
v [list $newid $newhead $oldid $oldhead] {
|
|
|
|
$patchtop.$e conf -state normal
|
|
|
|
$patchtop.$e delete 0 end
|
|
|
|
$patchtop.$e insert 0 $v
|
|
|
|
$patchtop.$e conf -state readonly
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mkpatchgo {} {
|
2007-07-13 09:49:37 +00:00
|
|
|
global patchtop nullid nullid2
|
2005-06-27 09:27:32 +00:00
|
|
|
|
|
|
|
set oldid [$patchtop.fromsha1 get]
|
|
|
|
set newid [$patchtop.tosha1 get]
|
|
|
|
set fname [$patchtop.fname get]
|
2007-07-13 09:49:37 +00:00
|
|
|
set cmd [diffcmd [list $oldid $newid] -p]
|
2007-09-15 02:08:38 +00:00
|
|
|
# trim off the initial "|"
|
|
|
|
set cmd [lrange $cmd 1 end]
|
2006-09-07 00:21:39 +00:00
|
|
|
lappend cmd >$fname &
|
|
|
|
if {[catch {eval exec $cmd} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error creating patch:"] $err"
|
2005-06-27 09:27:32 +00:00
|
|
|
}
|
|
|
|
catch {destroy $patchtop}
|
|
|
|
unset patchtop
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mkpatchcan {} {
|
|
|
|
global patchtop
|
|
|
|
|
|
|
|
catch {destroy $patchtop}
|
|
|
|
unset patchtop
|
|
|
|
}
|
|
|
|
|
2005-06-27 12:56:40 +00:00
|
|
|
proc mktag {} {
|
|
|
|
global rowmenuid mktagtop commitinfo
|
|
|
|
|
|
|
|
set top .maketag
|
|
|
|
set mktagtop $top
|
|
|
|
catch {destroy $top}
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.title -text [mc "Create tag"]
|
2005-06-28 23:47:48 +00:00
|
|
|
grid $top.title - -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.id -text [mc "ID:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.sha1 -width 40 -relief flat
|
2005-06-27 12:56:40 +00:00
|
|
|
$top.sha1 insert 0 $rowmenuid
|
|
|
|
$top.sha1 conf -state readonly
|
|
|
|
grid $top.id $top.sha1 -sticky w
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.head -width 60 -relief flat
|
2005-06-27 12:56:40 +00:00
|
|
|
$top.head insert 0 [lindex $commitinfo($rowmenuid) 0]
|
|
|
|
$top.head conf -state readonly
|
|
|
|
grid x $top.head -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.tlab -text [mc "Tag name:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.tag -width 60
|
2005-06-27 12:56:40 +00:00
|
|
|
grid $top.tlab $top.tag -sticky w
|
|
|
|
frame $top.buts
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.buts.gen -text [mc "Create"] -command mktaggo
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command mktagcan
|
2005-06-27 12:56:40 +00:00
|
|
|
grid $top.buts.gen $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - -pady 10 -sticky ew
|
|
|
|
focus $top.tag
|
|
|
|
}
|
|
|
|
|
|
|
|
proc domktag {} {
|
|
|
|
global mktagtop env tagids idtags
|
|
|
|
|
|
|
|
set id [$mktagtop.sha1 get]
|
|
|
|
set tag [$mktagtop.tag get]
|
|
|
|
if {$tag == {}} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "No tag name specified"]
|
2005-06-27 12:56:40 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
if {[info exists tagids($tag)]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "Tag \"%s\" already exists" $tag]
|
2005-06-27 12:56:40 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
if {[catch {
|
2008-02-11 10:57:40 +00:00
|
|
|
exec git tag $tag $id
|
2005-06-27 12:56:40 +00:00
|
|
|
} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error creating tag:"] $err"
|
2005-06-27 12:56:40 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
set tagids($tag) $id
|
|
|
|
lappend idtags($id) $tag
|
2005-08-19 12:14:28 +00:00
|
|
|
redrawtags $id
|
2006-08-08 10:55:36 +00:00
|
|
|
addedtag $id
|
2007-08-20 09:36:20 +00:00
|
|
|
dispneartags 0
|
|
|
|
run refill_reflist
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc redrawtags {id} {
|
2008-05-26 00:11:33 +00:00
|
|
|
global canv linehtag idpos currentid curview cmitlisted
|
|
|
|
global canvxmax iddrawn circleitem mainheadid circlecolors
|
2005-08-19 12:14:28 +00:00
|
|
|
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {![commitinview $id $curview]} return
|
2006-10-15 08:03:46 +00:00
|
|
|
if {![info exists iddrawn($id)]} return
|
2007-12-26 12:03:43 +00:00
|
|
|
set row [rowofcommit $id]
|
2008-05-26 00:11:33 +00:00
|
|
|
if {$id eq $mainheadid} {
|
|
|
|
set ofill yellow
|
|
|
|
} else {
|
|
|
|
set ofill [lindex $circlecolors $cmitlisted($curview,$id)]
|
|
|
|
}
|
|
|
|
$canv itemconf $circleitem($row) -fill $ofill
|
2005-06-27 12:56:40 +00:00
|
|
|
$canv delete tag.$id
|
|
|
|
set xt [eval drawtags $id $idpos($id)]
|
2007-12-26 12:03:43 +00:00
|
|
|
$canv coords $linehtag($row) $xt [lindex $idpos($id) 2]
|
|
|
|
set text [$canv itemcget $linehtag($row) -text]
|
|
|
|
set font [$canv itemcget $linehtag($row) -font]
|
|
|
|
set xr [expr {$xt + [font measure $font $text]}]
|
2006-06-03 09:11:13 +00:00
|
|
|
if {$xr > $canvxmax} {
|
|
|
|
set canvxmax $xr
|
|
|
|
setcanvscroll
|
|
|
|
}
|
2007-12-26 12:03:43 +00:00
|
|
|
if {[info exists currentid] && $currentid == $id} {
|
|
|
|
make_secsel $row
|
2005-06-27 12:56:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mktagcan {} {
|
|
|
|
global mktagtop
|
|
|
|
|
|
|
|
catch {destroy $mktagtop}
|
|
|
|
unset mktagtop
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mktaggo {} {
|
|
|
|
domktag
|
|
|
|
mktagcan
|
|
|
|
}
|
|
|
|
|
2005-06-28 23:47:48 +00:00
|
|
|
proc writecommit {} {
|
|
|
|
global rowmenuid wrcomtop commitinfo wrcomcmd
|
|
|
|
|
|
|
|
set top .writecommit
|
|
|
|
set wrcomtop $top
|
|
|
|
catch {destroy $top}
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.title -text [mc "Write commit to file"]
|
2005-06-28 23:47:48 +00:00
|
|
|
grid $top.title - -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.id -text [mc "ID:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.sha1 -width 40 -relief flat
|
|
|
|
$top.sha1 insert 0 $rowmenuid
|
|
|
|
$top.sha1 conf -state readonly
|
|
|
|
grid $top.id $top.sha1 -sticky w
|
|
|
|
entry $top.head -width 60 -relief flat
|
|
|
|
$top.head insert 0 [lindex $commitinfo($rowmenuid) 0]
|
|
|
|
$top.head conf -state readonly
|
|
|
|
grid x $top.head -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.clab -text [mc "Command:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.cmd -width 60 -textvariable wrcomcmd
|
|
|
|
grid $top.clab $top.cmd -sticky w -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.flab -text [mc "Output file:"]
|
2005-06-28 23:47:48 +00:00
|
|
|
entry $top.fname -width 60
|
|
|
|
$top.fname insert 0 [file normalize "commit-[string range $rowmenuid 0 6]"]
|
|
|
|
grid $top.flab $top.fname -sticky w
|
|
|
|
frame $top.buts
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.buts.gen -text [mc "Write"] -command wrcomgo
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command wrcomcan
|
2005-06-28 23:47:48 +00:00
|
|
|
grid $top.buts.gen $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - -pady 10 -sticky ew
|
|
|
|
focus $top.fname
|
|
|
|
}
|
|
|
|
|
|
|
|
proc wrcomgo {} {
|
|
|
|
global wrcomtop
|
|
|
|
|
|
|
|
set id [$wrcomtop.sha1 get]
|
|
|
|
set cmd "echo $id | [$wrcomtop.cmd get]"
|
|
|
|
set fname [$wrcomtop.fname get]
|
|
|
|
if {[catch {exec sh -c $cmd >$fname &} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error writing commit:"] $err"
|
2005-06-28 23:47:48 +00:00
|
|
|
}
|
|
|
|
catch {destroy $wrcomtop}
|
|
|
|
unset wrcomtop
|
|
|
|
}
|
|
|
|
|
|
|
|
proc wrcomcan {} {
|
|
|
|
global wrcomtop
|
|
|
|
|
|
|
|
catch {destroy $wrcomtop}
|
|
|
|
unset wrcomtop
|
|
|
|
}
|
|
|
|
|
2006-08-01 23:41:04 +00:00
|
|
|
proc mkbranch {} {
|
|
|
|
global rowmenuid mkbrtop
|
|
|
|
|
|
|
|
set top .makebranch
|
|
|
|
catch {destroy $top}
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.title -text [mc "Create new branch"]
|
2006-08-01 23:41:04 +00:00
|
|
|
grid $top.title - -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.id -text [mc "ID:"]
|
2006-08-01 23:41:04 +00:00
|
|
|
entry $top.sha1 -width 40 -relief flat
|
|
|
|
$top.sha1 insert 0 $rowmenuid
|
|
|
|
$top.sha1 conf -state readonly
|
|
|
|
grid $top.id $top.sha1 -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.nlab -text [mc "Name:"]
|
2006-08-01 23:41:04 +00:00
|
|
|
entry $top.name -width 40
|
|
|
|
grid $top.nlab $top.name -sticky w
|
|
|
|
frame $top.buts
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.buts.go -text [mc "Create"] -command [list mkbrgo $top]
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command "catch {destroy $top}"
|
2006-08-01 23:41:04 +00:00
|
|
|
grid $top.buts.go $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - -pady 10 -sticky ew
|
|
|
|
focus $top.name
|
|
|
|
}
|
|
|
|
|
|
|
|
proc mkbrgo {top} {
|
|
|
|
global headids idheads
|
|
|
|
|
|
|
|
set name [$top.name get]
|
|
|
|
set id [$top.sha1 get]
|
|
|
|
if {$name eq {}} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "Please specify a name for the new branch"]
|
2006-08-01 23:41:04 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
catch {destroy $top}
|
|
|
|
nowbusy newbranch
|
|
|
|
update
|
|
|
|
if {[catch {
|
|
|
|
exec git branch $name $id
|
|
|
|
} err]} {
|
|
|
|
notbusy newbranch
|
|
|
|
error_popup $err
|
|
|
|
} else {
|
2007-06-16 10:29:25 +00:00
|
|
|
set headids($name) $id
|
|
|
|
lappend idheads($id) $name
|
2006-08-06 11:08:05 +00:00
|
|
|
addedhead $id $name
|
2006-08-01 23:41:04 +00:00
|
|
|
notbusy newbranch
|
|
|
|
redrawtags $id
|
2007-06-16 10:29:25 +00:00
|
|
|
dispneartags 0
|
2007-08-20 09:36:20 +00:00
|
|
|
run refill_reflist
|
2006-08-01 23:41:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-08-06 11:08:05 +00:00
|
|
|
proc cherrypick {} {
|
2008-03-02 23:19:35 +00:00
|
|
|
global rowmenuid curview
|
2008-02-13 11:12:31 +00:00
|
|
|
global mainhead mainheadid
|
2006-08-06 11:08:05 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set oldhead [exec git rev-parse HEAD]
|
|
|
|
set dheads [descheads $rowmenuid]
|
|
|
|
if {$dheads ne {} && [lsearch -exact $dheads $oldhead] >= 0} {
|
2007-11-07 17:42:55 +00:00
|
|
|
set ok [confirm_popup [mc "Commit %s is already\
|
|
|
|
included in branch %s -- really re-apply it?" \
|
|
|
|
[string range $rowmenuid 0 7] $mainhead]]
|
2006-08-06 11:08:05 +00:00
|
|
|
if {!$ok} return
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
nowbusy cherrypick [mc "Cherry-picking"]
|
2006-08-06 11:08:05 +00:00
|
|
|
update
|
|
|
|
# Unfortunately git-cherry-pick writes stuff to stderr even when
|
|
|
|
# no error occurs, and exec takes that as an indication of error...
|
|
|
|
if {[catch {exec sh -c "git cherry-pick -r $rowmenuid 2>&1"} err]} {
|
|
|
|
notbusy cherrypick
|
|
|
|
error_popup $err
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set newhead [exec git rev-parse HEAD]
|
|
|
|
if {$newhead eq $oldhead} {
|
|
|
|
notbusy cherrypick
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "No changes committed"]
|
2006-08-06 11:08:05 +00:00
|
|
|
return
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
addnewchild $newhead $oldhead
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $oldhead $curview]} {
|
|
|
|
insertrow $newhead $oldhead $curview
|
2006-08-06 11:08:05 +00:00
|
|
|
if {$mainhead ne {}} {
|
2007-06-16 10:29:25 +00:00
|
|
|
movehead $newhead $mainhead
|
2006-08-06 11:08:05 +00:00
|
|
|
movedhead $newhead $mainhead
|
|
|
|
}
|
2008-05-26 00:11:33 +00:00
|
|
|
set mainheadid $newhead
|
2006-08-06 11:08:05 +00:00
|
|
|
redrawtags $oldhead
|
|
|
|
redrawtags $newhead
|
2008-01-15 11:16:32 +00:00
|
|
|
selbyid $newhead
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
|
|
|
notbusy cherrypick
|
|
|
|
}
|
|
|
|
|
2006-10-19 00:09:06 +00:00
|
|
|
proc resethead {} {
|
2008-02-13 11:12:31 +00:00
|
|
|
global mainhead rowmenuid confirm_ok resettype
|
2006-10-19 00:09:06 +00:00
|
|
|
|
|
|
|
set confirm_ok 0
|
|
|
|
set w ".confirmreset"
|
|
|
|
toplevel $w
|
|
|
|
wm transient $w .
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $w [mc "Confirm reset"]
|
2006-10-19 00:09:06 +00:00
|
|
|
message $w.m -text \
|
2007-11-07 17:42:55 +00:00
|
|
|
[mc "Reset branch %s to %s?" $mainhead [string range $rowmenuid 0 7]] \
|
2006-10-19 00:09:06 +00:00
|
|
|
-justify center -aspect 1000
|
|
|
|
pack $w.m -side top -fill x -padx 20 -pady 20
|
|
|
|
frame $w.f -relief sunken -border 2
|
2007-11-07 17:42:55 +00:00
|
|
|
message $w.f.rt -text [mc "Reset type:"] -aspect 1000
|
2006-10-19 00:09:06 +00:00
|
|
|
grid $w.f.rt -sticky w
|
|
|
|
set resettype mixed
|
|
|
|
radiobutton $w.f.soft -value soft -variable resettype -justify left \
|
2007-11-07 17:42:55 +00:00
|
|
|
-text [mc "Soft: Leave working tree and index untouched"]
|
2006-10-19 00:09:06 +00:00
|
|
|
grid $w.f.soft -sticky w
|
|
|
|
radiobutton $w.f.mixed -value mixed -variable resettype -justify left \
|
2007-11-07 17:42:55 +00:00
|
|
|
-text [mc "Mixed: Leave working tree untouched, reset index"]
|
2006-10-19 00:09:06 +00:00
|
|
|
grid $w.f.mixed -sticky w
|
|
|
|
radiobutton $w.f.hard -value hard -variable resettype -justify left \
|
2007-11-07 17:42:55 +00:00
|
|
|
-text [mc "Hard: Reset working tree and index\n(discard ALL local changes)"]
|
2006-10-19 00:09:06 +00:00
|
|
|
grid $w.f.hard -sticky w
|
|
|
|
pack $w.f -side top -fill x
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.ok -text [mc OK] -command "set confirm_ok 1; destroy $w"
|
2006-10-19 00:09:06 +00:00
|
|
|
pack $w.ok -side left -fill x -padx 20 -pady 20
|
2007-11-07 17:42:55 +00:00
|
|
|
button $w.cancel -text [mc Cancel] -command "destroy $w"
|
2006-10-19 00:09:06 +00:00
|
|
|
pack $w.cancel -side right -fill x -padx 20 -pady 20
|
|
|
|
bind $w <Visibility> "grab $w; focus $w"
|
|
|
|
tkwait window $w
|
|
|
|
if {!$confirm_ok} return
|
2007-06-26 01:09:49 +00:00
|
|
|
if {[catch {set fd [open \
|
2008-05-12 00:18:38 +00:00
|
|
|
[list | git reset --$resettype $rowmenuid 2>@1] r]} err]} {
|
2006-10-19 00:09:06 +00:00
|
|
|
error_popup $err
|
|
|
|
} else {
|
2007-06-26 01:09:49 +00:00
|
|
|
dohidelocalchanges
|
2007-10-23 11:12:49 +00:00
|
|
|
filerun $fd [list readresetstat $fd]
|
2007-11-07 17:42:55 +00:00
|
|
|
nowbusy reset [mc "Resetting"]
|
2008-01-15 11:16:32 +00:00
|
|
|
selbyid $rowmenuid
|
2007-06-26 01:09:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-10-23 11:12:49 +00:00
|
|
|
proc readresetstat {fd} {
|
|
|
|
global mainhead mainheadid showlocalchanges rprogcoord
|
2007-06-26 01:09:49 +00:00
|
|
|
|
|
|
|
if {[gets $fd line] >= 0} {
|
|
|
|
if {[regexp {([0-9]+)% \(([0-9]+)/([0-9]+)\)} $line match p m n]} {
|
2007-10-23 11:12:49 +00:00
|
|
|
set rprogcoord [expr {1.0 * $m / $n}]
|
|
|
|
adjustprogress
|
2007-06-26 01:09:49 +00:00
|
|
|
}
|
|
|
|
return 1
|
|
|
|
}
|
2007-10-23 11:12:49 +00:00
|
|
|
set rprogcoord 0
|
|
|
|
adjustprogress
|
2007-06-26 01:09:49 +00:00
|
|
|
notbusy reset
|
|
|
|
if {[catch {close $fd} err]} {
|
|
|
|
error_popup $err
|
|
|
|
}
|
|
|
|
set oldhead $mainheadid
|
|
|
|
set newhead [exec git rev-parse HEAD]
|
|
|
|
if {$newhead ne $oldhead} {
|
|
|
|
movehead $newhead $mainhead
|
|
|
|
movedhead $newhead $mainhead
|
|
|
|
set mainheadid $newhead
|
2006-10-19 00:09:06 +00:00
|
|
|
redrawtags $oldhead
|
2007-06-26 01:09:49 +00:00
|
|
|
redrawtags $newhead
|
2006-10-19 00:09:06 +00:00
|
|
|
}
|
|
|
|
if {$showlocalchanges} {
|
|
|
|
doshowlocalchanges
|
|
|
|
}
|
2007-06-26 01:09:49 +00:00
|
|
|
return 0
|
2006-10-19 00:09:06 +00:00
|
|
|
}
|
|
|
|
|
2006-08-01 23:52:01 +00:00
|
|
|
# context menu for a head
|
|
|
|
proc headmenu {x y id head} {
|
2007-06-17 07:08:35 +00:00
|
|
|
global headmenuid headmenuhead headctxmenu mainhead
|
2006-08-01 23:52:01 +00:00
|
|
|
|
2007-09-27 01:00:25 +00:00
|
|
|
stopfinding
|
2006-08-01 23:52:01 +00:00
|
|
|
set headmenuid $id
|
|
|
|
set headmenuhead $head
|
2007-06-17 07:08:35 +00:00
|
|
|
set state normal
|
|
|
|
if {$head eq $mainhead} {
|
|
|
|
set state disabled
|
|
|
|
}
|
|
|
|
$headctxmenu entryconfigure 0 -state $state
|
|
|
|
$headctxmenu entryconfigure 1 -state $state
|
2006-08-01 23:52:01 +00:00
|
|
|
tk_popup $headctxmenu $x $y
|
|
|
|
}
|
|
|
|
|
|
|
|
proc cobranch {} {
|
2008-05-26 00:11:33 +00:00
|
|
|
global headmenuid headmenuhead headids
|
2006-09-07 00:21:39 +00:00
|
|
|
global showlocalchanges mainheadid
|
2006-08-01 23:52:01 +00:00
|
|
|
|
|
|
|
# check the tree is clean first??
|
2007-11-07 17:42:55 +00:00
|
|
|
nowbusy checkout [mc "Checking out"]
|
2006-08-01 23:52:01 +00:00
|
|
|
update
|
2006-09-07 00:21:39 +00:00
|
|
|
dohidelocalchanges
|
2006-08-01 23:52:01 +00:00
|
|
|
if {[catch {
|
2008-05-12 00:18:38 +00:00
|
|
|
set fd [open [list | git checkout $headmenuhead 2>@1] r]
|
2006-08-01 23:52:01 +00:00
|
|
|
} err]} {
|
|
|
|
notbusy checkout
|
|
|
|
error_popup $err
|
2008-05-12 00:18:38 +00:00
|
|
|
if {$showlocalchanges} {
|
|
|
|
dodiffindex
|
|
|
|
}
|
2006-08-01 23:52:01 +00:00
|
|
|
} else {
|
2008-05-12 00:18:38 +00:00
|
|
|
filerun $fd [list readcheckoutstat $fd $headmenuhead $headmenuid]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc readcheckoutstat {fd newhead newheadid} {
|
|
|
|
global mainhead mainheadid headids showlocalchanges progresscoords
|
|
|
|
|
|
|
|
if {[gets $fd line] >= 0} {
|
|
|
|
if {[regexp {([0-9]+)% \(([0-9]+)/([0-9]+)\)} $line match p m n]} {
|
|
|
|
set progresscoords [list 0 [expr {1.0 * $m / $n}]]
|
|
|
|
adjustprogress
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
2008-05-12 00:18:38 +00:00
|
|
|
return 1
|
|
|
|
}
|
|
|
|
set progresscoords {0 0}
|
|
|
|
adjustprogress
|
|
|
|
notbusy checkout
|
|
|
|
if {[catch {close $fd} err]} {
|
|
|
|
error_popup $err
|
|
|
|
}
|
2008-05-26 00:11:33 +00:00
|
|
|
set oldmainid $mainheadid
|
2008-05-12 00:18:38 +00:00
|
|
|
set mainhead $newhead
|
|
|
|
set mainheadid $newheadid
|
2008-05-26 00:11:33 +00:00
|
|
|
redrawtags $oldmainid
|
2008-05-12 00:18:38 +00:00
|
|
|
redrawtags $newheadid
|
|
|
|
selbyid $newheadid
|
2006-10-19 00:09:06 +00:00
|
|
|
if {$showlocalchanges} {
|
|
|
|
dodiffindex
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc rmbranch {} {
|
2007-06-16 10:29:25 +00:00
|
|
|
global headmenuid headmenuhead mainhead
|
2007-08-15 00:09:47 +00:00
|
|
|
global idheads
|
2006-08-01 23:52:01 +00:00
|
|
|
|
|
|
|
set head $headmenuhead
|
|
|
|
set id $headmenuid
|
2007-06-17 07:08:35 +00:00
|
|
|
# this check shouldn't be needed any more...
|
2006-08-01 23:52:01 +00:00
|
|
|
if {$head eq $mainhead} {
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup [mc "Cannot delete the currently checked-out branch"]
|
2006-08-01 23:52:01 +00:00
|
|
|
return
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set dheads [descheads $id]
|
2007-08-17 07:57:31 +00:00
|
|
|
if {[llength $dheads] == 1 && $idheads($dheads) eq $head} {
|
2006-08-01 23:52:01 +00:00
|
|
|
# the stuff on this branch isn't on any other branch
|
2007-11-07 17:42:55 +00:00
|
|
|
if {![confirm_popup [mc "The commits on branch %s aren't on any other\
|
|
|
|
branch.\nReally delete branch %s?" $head $head]]} return
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
|
|
|
nowbusy rmbranch
|
|
|
|
update
|
|
|
|
if {[catch {exec git branch -D $head} err]} {
|
|
|
|
notbusy rmbranch
|
|
|
|
error_popup $err
|
|
|
|
return
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
removehead $id $head
|
2006-08-06 11:08:05 +00:00
|
|
|
removedhead $id $head
|
2006-08-01 23:52:01 +00:00
|
|
|
redrawtags $id
|
|
|
|
notbusy rmbranch
|
2007-06-16 10:29:25 +00:00
|
|
|
dispneartags 0
|
2007-08-20 09:36:20 +00:00
|
|
|
run refill_reflist
|
|
|
|
}
|
|
|
|
|
|
|
|
# Display a list of tags and heads
|
|
|
|
proc showrefs {} {
|
2007-10-04 12:27:13 +00:00
|
|
|
global showrefstop bgcolor fgcolor selectbgcolor
|
|
|
|
global bglist fglist reflistfilter reflist maincursor
|
2007-08-20 09:36:20 +00:00
|
|
|
|
|
|
|
set top .showrefs
|
|
|
|
set showrefstop $top
|
|
|
|
if {[winfo exists $top]} {
|
|
|
|
raise $top
|
|
|
|
refill_reflist
|
|
|
|
return
|
|
|
|
}
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $top [mc "Tags and heads: %s" [file tail [pwd]]]
|
2007-08-20 09:36:20 +00:00
|
|
|
text $top.list -background $bgcolor -foreground $fgcolor \
|
2007-10-04 12:27:13 +00:00
|
|
|
-selectbackground $selectbgcolor -font mainfont \
|
2007-08-20 09:36:20 +00:00
|
|
|
-xscrollcommand "$top.xsb set" -yscrollcommand "$top.ysb set" \
|
|
|
|
-width 30 -height 20 -cursor $maincursor \
|
|
|
|
-spacing1 1 -spacing3 1 -state disabled
|
|
|
|
$top.list tag configure highlight -background $selectbgcolor
|
|
|
|
lappend bglist $top.list
|
|
|
|
lappend fglist $top.list
|
|
|
|
scrollbar $top.ysb -command "$top.list yview" -orient vertical
|
|
|
|
scrollbar $top.xsb -command "$top.list xview" -orient horizontal
|
|
|
|
grid $top.list $top.ysb -sticky nsew
|
|
|
|
grid $top.xsb x -sticky ew
|
|
|
|
frame $top.f
|
2008-01-06 04:54:46 +00:00
|
|
|
label $top.f.l -text "[mc "Filter"]: "
|
|
|
|
entry $top.f.e -width 20 -textvariable reflistfilter
|
2007-08-20 09:36:20 +00:00
|
|
|
set reflistfilter "*"
|
|
|
|
trace add variable reflistfilter write reflistfilter_change
|
|
|
|
pack $top.f.e -side right -fill x -expand 1
|
|
|
|
pack $top.f.l -side left
|
|
|
|
grid $top.f - -sticky ew -pady 2
|
2008-01-06 04:54:46 +00:00
|
|
|
button $top.close -command [list destroy $top] -text [mc "Close"]
|
2007-08-20 09:36:20 +00:00
|
|
|
grid $top.close -
|
|
|
|
grid columnconfigure $top 0 -weight 1
|
|
|
|
grid rowconfigure $top 0 -weight 1
|
|
|
|
bind $top.list <1> {break}
|
|
|
|
bind $top.list <B1-Motion> {break}
|
|
|
|
bind $top.list <ButtonRelease-1> {sel_reflist %W %x %y; break}
|
|
|
|
set reflist {}
|
|
|
|
refill_reflist
|
|
|
|
}
|
|
|
|
|
|
|
|
proc sel_reflist {w x y} {
|
|
|
|
global showrefstop reflist headids tagids otherrefids
|
|
|
|
|
|
|
|
if {![winfo exists $showrefstop]} return
|
|
|
|
set l [lindex [split [$w index "@$x,$y"] "."] 0]
|
|
|
|
set ref [lindex $reflist [expr {$l-1}]]
|
|
|
|
set n [lindex $ref 0]
|
|
|
|
switch -- [lindex $ref 1] {
|
|
|
|
"H" {selbyid $headids($n)}
|
|
|
|
"T" {selbyid $tagids($n)}
|
|
|
|
"o" {selbyid $otherrefids($n)}
|
|
|
|
}
|
|
|
|
$showrefstop.list tag add highlight $l.0 "$l.0 lineend"
|
|
|
|
}
|
|
|
|
|
|
|
|
proc unsel_reflist {} {
|
|
|
|
global showrefstop
|
|
|
|
|
|
|
|
if {![info exists showrefstop] || ![winfo exists $showrefstop]} return
|
|
|
|
$showrefstop.list tag remove highlight 0.0 end
|
|
|
|
}
|
|
|
|
|
|
|
|
proc reflistfilter_change {n1 n2 op} {
|
|
|
|
global reflistfilter
|
|
|
|
|
|
|
|
after cancel refill_reflist
|
|
|
|
after 200 refill_reflist
|
|
|
|
}
|
|
|
|
|
|
|
|
proc refill_reflist {} {
|
|
|
|
global reflist reflistfilter showrefstop headids tagids otherrefids
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
global curview commitinterest
|
2007-08-20 09:36:20 +00:00
|
|
|
|
|
|
|
if {![info exists showrefstop] || ![winfo exists $showrefstop]} return
|
|
|
|
set refs {}
|
|
|
|
foreach n [array names headids] {
|
|
|
|
if {[string match $reflistfilter $n]} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $headids($n) $curview]} {
|
2007-08-20 09:36:20 +00:00
|
|
|
lappend refs [list $n H]
|
|
|
|
} else {
|
|
|
|
set commitinterest($headids($n)) {run refill_reflist}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach n [array names tagids] {
|
|
|
|
if {[string match $reflistfilter $n]} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $tagids($n) $curview]} {
|
2007-08-20 09:36:20 +00:00
|
|
|
lappend refs [list $n T]
|
|
|
|
} else {
|
|
|
|
set commitinterest($tagids($n)) {run refill_reflist}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach n [array names otherrefids] {
|
|
|
|
if {[string match $reflistfilter $n]} {
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
if {[commitinview $otherrefids($n) $curview]} {
|
2007-08-20 09:36:20 +00:00
|
|
|
lappend refs [list $n o]
|
|
|
|
} else {
|
|
|
|
set commitinterest($otherrefids($n)) {run refill_reflist}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set refs [lsort -index 0 $refs]
|
|
|
|
if {$refs eq $reflist} return
|
|
|
|
|
|
|
|
# Update the contents of $showrefstop.list according to the
|
|
|
|
# differences between $reflist (old) and $refs (new)
|
|
|
|
$showrefstop.list conf -state normal
|
|
|
|
$showrefstop.list insert end "\n"
|
|
|
|
set i 0
|
|
|
|
set j 0
|
|
|
|
while {$i < [llength $reflist] || $j < [llength $refs]} {
|
|
|
|
if {$i < [llength $reflist]} {
|
|
|
|
if {$j < [llength $refs]} {
|
|
|
|
set cmp [string compare [lindex $reflist $i 0] \
|
|
|
|
[lindex $refs $j 0]]
|
|
|
|
if {$cmp == 0} {
|
|
|
|
set cmp [string compare [lindex $reflist $i 1] \
|
|
|
|
[lindex $refs $j 1]]
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set cmp -1
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set cmp 1
|
|
|
|
}
|
|
|
|
switch -- $cmp {
|
|
|
|
-1 {
|
|
|
|
$showrefstop.list delete "[expr {$j+1}].0" "[expr {$j+2}].0"
|
|
|
|
incr i
|
|
|
|
}
|
|
|
|
0 {
|
|
|
|
incr i
|
|
|
|
incr j
|
|
|
|
}
|
|
|
|
1 {
|
|
|
|
set l [expr {$j + 1}]
|
|
|
|
$showrefstop.list image create $l.0 -align baseline \
|
|
|
|
-image reficon-[lindex $refs $j 1] -padx 2
|
|
|
|
$showrefstop.list insert $l.1 "[lindex $refs $j 0]\n"
|
|
|
|
incr j
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set reflist $refs
|
|
|
|
# delete last newline
|
|
|
|
$showrefstop.list delete end-2c end-1c
|
|
|
|
$showrefstop.list conf -state disabled
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
|
|
|
|
2006-06-03 09:11:13 +00:00
|
|
|
# Stuff for finding nearby tags
|
|
|
|
proc getallcommits {} {
|
2007-08-30 11:54:17 +00:00
|
|
|
global allcommits nextarc seeds allccache allcwait cachedarcs allcupdate
|
|
|
|
global idheads idtags idotherrefs allparents tagobjid
|
2005-08-19 12:14:28 +00:00
|
|
|
|
2007-08-13 05:02:02 +00:00
|
|
|
if {![info exists allcommits]} {
|
|
|
|
set nextarc 0
|
|
|
|
set allcommits 0
|
|
|
|
set seeds {}
|
2007-08-30 11:54:17 +00:00
|
|
|
set allcwait 0
|
|
|
|
set cachedarcs 0
|
|
|
|
set allccache [file join [gitdir] "gitk.cache"]
|
|
|
|
if {![catch {
|
|
|
|
set f [open $allccache r]
|
|
|
|
set allcwait 1
|
|
|
|
getcache $f
|
|
|
|
}]} return
|
2007-08-13 05:02:02 +00:00
|
|
|
}
|
2006-06-06 23:19:45 +00:00
|
|
|
|
2007-08-30 11:54:17 +00:00
|
|
|
if {$allcwait} {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set cmd [list | git rev-list --parents]
|
|
|
|
set allcupdate [expr {$seeds ne {}}]
|
|
|
|
if {!$allcupdate} {
|
|
|
|
set ids "--all"
|
|
|
|
} else {
|
|
|
|
set refs [concat [array names idheads] [array names idtags] \
|
|
|
|
[array names idotherrefs]]
|
|
|
|
set ids {}
|
|
|
|
set tagobjs {}
|
|
|
|
foreach name [array names tagobjid] {
|
|
|
|
lappend tagobjs $tagobjid($name)
|
|
|
|
}
|
|
|
|
foreach id [lsort -unique $refs] {
|
|
|
|
if {![info exists allparents($id)] &&
|
|
|
|
[lsearch -exact $tagobjs $id] < 0} {
|
|
|
|
lappend ids $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$ids ne {}} {
|
|
|
|
foreach id $seeds {
|
|
|
|
lappend ids "^$id"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$ids ne {}} {
|
|
|
|
set fd [open [concat $cmd $ids] r]
|
|
|
|
fconfigure $fd -blocking 0
|
|
|
|
incr allcommits
|
|
|
|
nowbusy allcommits
|
|
|
|
filerun $fd [list getallclines $fd]
|
|
|
|
} else {
|
|
|
|
dispneartags 0
|
2006-06-06 23:19:45 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
# Since most commits have 1 parent and 1 child, we group strings of
|
|
|
|
# such commits into "arcs" joining branch/merge points (BMPs), which
|
|
|
|
# are commits that either don't have 1 parent or don't have 1 child.
|
|
|
|
#
|
|
|
|
# arcnos(id) - incoming arcs for BMP, arc we're on for other nodes
|
|
|
|
# arcout(id) - outgoing arcs for BMP
|
|
|
|
# arcids(a) - list of IDs on arc including end but not start
|
|
|
|
# arcstart(a) - BMP ID at start of arc
|
|
|
|
# arcend(a) - BMP ID at end of arc
|
|
|
|
# growing(a) - arc a is still growing
|
|
|
|
# arctags(a) - IDs out of arcids (excluding end) that have tags
|
|
|
|
# archeads(a) - IDs out of arcids (excluding end) that have heads
|
|
|
|
# The start of an arc is at the descendent end, so "incoming" means
|
|
|
|
# coming from descendents, and "outgoing" means going towards ancestors.
|
|
|
|
|
|
|
|
proc getallclines {fd} {
|
2007-08-30 11:54:17 +00:00
|
|
|
global allparents allchildren idtags idheads nextarc
|
2007-06-16 10:29:25 +00:00
|
|
|
global arcnos arcids arctags arcout arcend arcstart archeads growing
|
2007-08-30 11:54:17 +00:00
|
|
|
global seeds allcommits cachedarcs allcupdate
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set nid 0
|
2007-06-17 04:45:00 +00:00
|
|
|
while {[incr nid] <= 1000 && [gets $fd line] >= 0} {
|
2007-06-16 10:29:25 +00:00
|
|
|
set id [lindex $line 0]
|
|
|
|
if {[info exists allparents($id)]} {
|
|
|
|
# seen it already
|
|
|
|
continue
|
|
|
|
}
|
2007-08-30 11:54:17 +00:00
|
|
|
set cachedarcs 0
|
2007-06-16 10:29:25 +00:00
|
|
|
set olds [lrange $line 1 end]
|
|
|
|
set allparents($id) $olds
|
|
|
|
if {![info exists allchildren($id)]} {
|
|
|
|
set allchildren($id) {}
|
|
|
|
set arcnos($id) {}
|
|
|
|
lappend seeds $id
|
|
|
|
} else {
|
|
|
|
set a $arcnos($id)
|
|
|
|
if {[llength $olds] == 1 && [llength $a] == 1} {
|
|
|
|
lappend arcids($a) $id
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
lappend arctags($a) $id
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {[info exists idheads($id)]} {
|
|
|
|
lappend archeads($a) $id
|
|
|
|
}
|
|
|
|
if {[info exists allparents($olds)]} {
|
|
|
|
# seen parent already
|
|
|
|
if {![info exists arcout($olds)]} {
|
|
|
|
splitarc $olds
|
|
|
|
}
|
|
|
|
lappend arcids($a) $olds
|
|
|
|
set arcend($a) $olds
|
|
|
|
unset growing($a)
|
|
|
|
}
|
|
|
|
lappend allchildren($olds) $id
|
|
|
|
lappend arcnos($olds) $a
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach a $arcnos($id) {
|
|
|
|
lappend arcids($a) $id
|
|
|
|
set arcend($a) $id
|
|
|
|
unset growing($a)
|
|
|
|
}
|
|
|
|
|
|
|
|
set ao {}
|
|
|
|
foreach p $olds {
|
|
|
|
lappend allchildren($p) $id
|
|
|
|
set a [incr nextarc]
|
|
|
|
set arcstart($a) $id
|
|
|
|
set archeads($a) {}
|
|
|
|
set arctags($a) {}
|
|
|
|
set archeads($a) {}
|
|
|
|
set arcids($a) {}
|
|
|
|
lappend ao $a
|
|
|
|
set growing($a) 1
|
|
|
|
if {[info exists allparents($p)]} {
|
|
|
|
# seen it already, may need to make a new branch
|
|
|
|
if {![info exists arcout($p)]} {
|
|
|
|
splitarc $p
|
|
|
|
}
|
|
|
|
lappend arcids($a) $p
|
|
|
|
set arcend($a) $p
|
|
|
|
unset growing($a)
|
|
|
|
}
|
|
|
|
lappend arcnos($p) $a
|
|
|
|
}
|
|
|
|
set arcout($id) $ao
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
2007-06-18 12:39:21 +00:00
|
|
|
if {$nid > 0} {
|
|
|
|
global cached_dheads cached_dtags cached_atags
|
|
|
|
catch {unset cached_dheads}
|
|
|
|
catch {unset cached_dtags}
|
|
|
|
catch {unset cached_atags}
|
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
if {![eof $fd]} {
|
|
|
|
return [expr {$nid >= 1000? 2: 1}]
|
|
|
|
}
|
2007-08-30 11:54:17 +00:00
|
|
|
set cacheok 1
|
|
|
|
if {[catch {
|
|
|
|
fconfigure $fd -blocking 1
|
|
|
|
close $fd
|
|
|
|
} err]} {
|
|
|
|
# got an error reading the list of commits
|
|
|
|
# if we were updating, try rereading the whole thing again
|
|
|
|
if {$allcupdate} {
|
|
|
|
incr allcommits -1
|
|
|
|
dropcache $err
|
|
|
|
return
|
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
error_popup "[mc "Error reading commit topology information;\
|
2007-08-30 11:54:17 +00:00
|
|
|
branch and preceding/following tag information\
|
2007-11-07 17:42:55 +00:00
|
|
|
will be incomplete."]\n($err)"
|
2007-08-30 11:54:17 +00:00
|
|
|
set cacheok 0
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {[incr allcommits -1] == 0} {
|
|
|
|
notbusy allcommits
|
2007-08-30 11:54:17 +00:00
|
|
|
if {$cacheok} {
|
|
|
|
run savecache
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
|
|
|
dispneartags 0
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc recalcarc {a} {
|
|
|
|
global arctags archeads arcids idtags idheads
|
2006-06-03 09:11:13 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set at {}
|
|
|
|
set ah {}
|
|
|
|
foreach id [lrange $arcids($a) 0 end-1] {
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
lappend at $id
|
|
|
|
}
|
|
|
|
if {[info exists idheads($id)]} {
|
|
|
|
lappend ah $id
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set arctags($a) $at
|
|
|
|
set archeads($a) $ah
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc splitarc {p} {
|
2007-08-30 11:54:17 +00:00
|
|
|
global arcnos arcids nextarc arctags archeads idtags idheads
|
2007-06-16 10:29:25 +00:00
|
|
|
global arcstart arcend arcout allparents growing
|
2006-08-01 23:38:10 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set a $arcnos($p)
|
|
|
|
if {[llength $a] != 1} {
|
|
|
|
puts "oops splitarc called but [llength $a] arcs already"
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set a [lindex $a 0]
|
|
|
|
set i [lsearch -exact $arcids($a) $p]
|
|
|
|
if {$i < 0} {
|
|
|
|
puts "oops splitarc $p not in arc $a"
|
|
|
|
return
|
|
|
|
}
|
|
|
|
set na [incr nextarc]
|
|
|
|
if {[info exists arcend($a)]} {
|
|
|
|
set arcend($na) $arcend($a)
|
|
|
|
} else {
|
|
|
|
set l [lindex $allparents([lindex $arcids($a) end]) 0]
|
|
|
|
set j [lsearch -exact $arcnos($l) $a]
|
|
|
|
set arcnos($l) [lreplace $arcnos($l) $j $j $na]
|
|
|
|
}
|
|
|
|
set tail [lrange $arcids($a) [expr {$i+1}] end]
|
|
|
|
set arcids($a) [lrange $arcids($a) 0 $i]
|
|
|
|
set arcend($a) $p
|
|
|
|
set arcstart($na) $p
|
|
|
|
set arcout($p) $na
|
|
|
|
set arcids($na) $tail
|
|
|
|
if {[info exists growing($a)]} {
|
|
|
|
set growing($na) 1
|
|
|
|
unset growing($a)
|
|
|
|
}
|
|
|
|
|
|
|
|
foreach id $tail {
|
|
|
|
if {[llength $arcnos($id)] == 1} {
|
|
|
|
set arcnos($id) $na
|
2006-08-01 23:38:10 +00:00
|
|
|
} else {
|
2007-06-16 10:29:25 +00:00
|
|
|
set j [lsearch -exact $arcnos($id) $a]
|
|
|
|
set arcnos($id) [lreplace $arcnos($id) $j $j $na]
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
# reconstruct tags and heads lists
|
|
|
|
if {$arctags($a) ne {} || $archeads($a) ne {}} {
|
|
|
|
recalcarc $a
|
|
|
|
recalcarc $na
|
|
|
|
} else {
|
|
|
|
set arctags($na) {}
|
|
|
|
set archeads($na) {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
# Update things for a new commit added that is a child of one
|
|
|
|
# existing commit. Used when cherry-picking.
|
|
|
|
proc addnewchild {id p} {
|
2007-08-30 11:54:17 +00:00
|
|
|
global allparents allchildren idtags nextarc
|
2007-06-16 10:29:25 +00:00
|
|
|
global arcnos arcids arctags arcout arcend arcstart archeads growing
|
2007-08-29 12:41:34 +00:00
|
|
|
global seeds allcommits
|
2007-06-16 10:29:25 +00:00
|
|
|
|
2007-10-20 12:10:52 +00:00
|
|
|
if {![info exists allcommits] || ![info exists arcnos($p)]} return
|
2007-06-16 10:29:25 +00:00
|
|
|
set allparents($id) [list $p]
|
|
|
|
set allchildren($id) {}
|
|
|
|
set arcnos($id) {}
|
|
|
|
lappend seeds $id
|
|
|
|
lappend allchildren($p) $id
|
|
|
|
set a [incr nextarc]
|
|
|
|
set arcstart($a) $id
|
|
|
|
set archeads($a) {}
|
|
|
|
set arctags($a) {}
|
|
|
|
set arcids($a) [list $p]
|
|
|
|
set arcend($a) $p
|
|
|
|
if {![info exists arcout($p)]} {
|
|
|
|
splitarc $p
|
|
|
|
}
|
|
|
|
lappend arcnos($p) $a
|
|
|
|
set arcout($id) [list $a]
|
|
|
|
}
|
|
|
|
|
2007-08-30 11:54:17 +00:00
|
|
|
# This implements a cache for the topology information.
|
|
|
|
# The cache saves, for each arc, the start and end of the arc,
|
|
|
|
# the ids on the arc, and the outgoing arcs from the end.
|
|
|
|
proc readcache {f} {
|
|
|
|
global arcnos arcids arcout arcstart arcend arctags archeads nextarc
|
|
|
|
global idtags idheads allparents cachedarcs possible_seeds seeds growing
|
|
|
|
global allcwait
|
|
|
|
|
|
|
|
set a $nextarc
|
|
|
|
set lim $cachedarcs
|
|
|
|
if {$lim - $a > 500} {
|
|
|
|
set lim [expr {$a + 500}]
|
|
|
|
}
|
|
|
|
if {[catch {
|
|
|
|
if {$a == $lim} {
|
|
|
|
# finish reading the cache and setting up arctags, etc.
|
|
|
|
set line [gets $f]
|
|
|
|
if {$line ne "1"} {error "bad final version"}
|
|
|
|
close $f
|
|
|
|
foreach id [array names idtags] {
|
|
|
|
if {[info exists arcnos($id)] && [llength $arcnos($id)] == 1 &&
|
|
|
|
[llength $allparents($id)] == 1} {
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {$arctags($a) eq {}} {
|
|
|
|
recalcarc $a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach id [array names idheads] {
|
|
|
|
if {[info exists arcnos($id)] && [llength $arcnos($id)] == 1 &&
|
|
|
|
[llength $allparents($id)] == 1} {
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {$archeads($a) eq {}} {
|
|
|
|
recalcarc $a
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach id [lsort -unique $possible_seeds] {
|
|
|
|
if {$arcnos($id) eq {}} {
|
|
|
|
lappend seeds $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set allcwait 0
|
|
|
|
} else {
|
|
|
|
while {[incr a] <= $lim} {
|
|
|
|
set line [gets $f]
|
|
|
|
if {[llength $line] != 3} {error "bad line"}
|
|
|
|
set s [lindex $line 0]
|
|
|
|
set arcstart($a) $s
|
|
|
|
lappend arcout($s) $a
|
|
|
|
if {![info exists arcnos($s)]} {
|
|
|
|
lappend possible_seeds $s
|
|
|
|
set arcnos($s) {}
|
|
|
|
}
|
|
|
|
set e [lindex $line 1]
|
|
|
|
if {$e eq {}} {
|
|
|
|
set growing($a) 1
|
|
|
|
} else {
|
|
|
|
set arcend($a) $e
|
|
|
|
if {![info exists arcout($e)]} {
|
|
|
|
set arcout($e) {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set arcids($a) [lindex $line 2]
|
|
|
|
foreach id $arcids($a) {
|
|
|
|
lappend allparents($s) $id
|
|
|
|
set s $id
|
|
|
|
lappend arcnos($id) $a
|
|
|
|
}
|
|
|
|
if {![info exists allparents($s)]} {
|
|
|
|
set allparents($s) {}
|
|
|
|
}
|
|
|
|
set arctags($a) {}
|
|
|
|
set archeads($a) {}
|
|
|
|
}
|
|
|
|
set nextarc [expr {$a - 1}]
|
|
|
|
}
|
|
|
|
} err]} {
|
|
|
|
dropcache $err
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
if {!$allcwait} {
|
|
|
|
getallcommits
|
|
|
|
}
|
|
|
|
return $allcwait
|
|
|
|
}
|
|
|
|
|
|
|
|
proc getcache {f} {
|
|
|
|
global nextarc cachedarcs possible_seeds
|
|
|
|
|
|
|
|
if {[catch {
|
|
|
|
set line [gets $f]
|
|
|
|
if {[llength $line] != 2 || [lindex $line 0] ne "1"} {error "bad version"}
|
|
|
|
# make sure it's an integer
|
|
|
|
set cachedarcs [expr {int([lindex $line 1])}]
|
|
|
|
if {$cachedarcs < 0} {error "bad number of arcs"}
|
|
|
|
set nextarc 0
|
|
|
|
set possible_seeds {}
|
|
|
|
run readcache $f
|
|
|
|
} err]} {
|
|
|
|
dropcache $err
|
|
|
|
}
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
proc dropcache {err} {
|
|
|
|
global allcwait nextarc cachedarcs seeds
|
|
|
|
|
|
|
|
#puts "dropping cache ($err)"
|
|
|
|
foreach v {arcnos arcout arcids arcstart arcend growing \
|
|
|
|
arctags archeads allparents allchildren} {
|
|
|
|
global $v
|
|
|
|
catch {unset $v}
|
|
|
|
}
|
|
|
|
set allcwait 0
|
|
|
|
set nextarc 0
|
|
|
|
set cachedarcs 0
|
|
|
|
set seeds {}
|
|
|
|
getallcommits
|
|
|
|
}
|
|
|
|
|
|
|
|
proc writecache {f} {
|
|
|
|
global cachearc cachedarcs allccache
|
|
|
|
global arcstart arcend arcnos arcids arcout
|
|
|
|
|
|
|
|
set a $cachearc
|
|
|
|
set lim $cachedarcs
|
|
|
|
if {$lim - $a > 1000} {
|
|
|
|
set lim [expr {$a + 1000}]
|
|
|
|
}
|
|
|
|
if {[catch {
|
|
|
|
while {[incr a] <= $lim} {
|
|
|
|
if {[info exists arcend($a)]} {
|
|
|
|
puts $f [list $arcstart($a) $arcend($a) $arcids($a)]
|
|
|
|
} else {
|
|
|
|
puts $f [list $arcstart($a) {} $arcids($a)]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} err]} {
|
|
|
|
catch {close $f}
|
|
|
|
catch {file delete $allccache}
|
|
|
|
#puts "writing cache failed ($err)"
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
set cachearc [expr {$a - 1}]
|
|
|
|
if {$a > $cachedarcs} {
|
|
|
|
puts $f "1"
|
|
|
|
close $f
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
|
|
|
|
proc savecache {} {
|
|
|
|
global nextarc cachedarcs cachearc allccache
|
|
|
|
|
|
|
|
if {$nextarc == $cachedarcs} return
|
|
|
|
set cachearc 0
|
|
|
|
set cachedarcs $nextarc
|
|
|
|
catch {
|
|
|
|
set f [open $allccache w]
|
|
|
|
puts $f [list 1 $cachedarcs]
|
|
|
|
run writecache $f
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# Returns 1 if a is an ancestor of b, -1 if b is an ancestor of a,
|
|
|
|
# or 0 if neither is true.
|
|
|
|
proc anc_or_desc {a b} {
|
|
|
|
global arcout arcstart arcend arcnos cached_isanc
|
|
|
|
|
|
|
|
if {$arcnos($a) eq $arcnos($b)} {
|
|
|
|
# Both are on the same arc(s); either both are the same BMP,
|
|
|
|
# or if one is not a BMP, the other is also not a BMP or is
|
|
|
|
# the BMP at end of the arc (and it only has 1 incoming arc).
|
2007-07-04 11:57:04 +00:00
|
|
|
# Or both can be BMPs with no incoming arcs.
|
|
|
|
if {$a eq $b || $arcnos($a) eq {}} {
|
2007-06-16 10:29:25 +00:00
|
|
|
return 0
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
# assert {[llength $arcnos($a)] == 1}
|
|
|
|
set arc [lindex $arcnos($a) 0]
|
|
|
|
set i [lsearch -exact $arcids($arc) $a]
|
|
|
|
set j [lsearch -exact $arcids($arc) $b]
|
|
|
|
if {$i < 0 || $i > $j} {
|
|
|
|
return 1
|
|
|
|
} else {
|
|
|
|
return -1
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
|
|
|
|
if {![info exists arcout($a)]} {
|
|
|
|
set arc [lindex $arcnos($a) 0]
|
|
|
|
if {[info exists arcend($arc)]} {
|
|
|
|
set aend $arcend($arc)
|
|
|
|
} else {
|
|
|
|
set aend {}
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set a $arcstart($arc)
|
|
|
|
} else {
|
|
|
|
set aend $a
|
|
|
|
}
|
|
|
|
if {![info exists arcout($b)]} {
|
|
|
|
set arc [lindex $arcnos($b) 0]
|
|
|
|
if {[info exists arcend($arc)]} {
|
|
|
|
set bend $arcend($arc)
|
|
|
|
} else {
|
|
|
|
set bend {}
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set b $arcstart($arc)
|
|
|
|
} else {
|
|
|
|
set bend $b
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {$a eq $bend} {
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
if {$b eq $aend} {
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
if {[info exists cached_isanc($a,$bend)]} {
|
|
|
|
if {$cached_isanc($a,$bend)} {
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[info exists cached_isanc($b,$aend)]} {
|
|
|
|
if {$cached_isanc($b,$aend)} {
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
if {[info exists cached_isanc($a,$bend)]} {
|
|
|
|
return 0
|
|
|
|
}
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set todo [list $a $b]
|
|
|
|
set anc($a) a
|
|
|
|
set anc($b) b
|
|
|
|
for {set i 0} {$i < [llength $todo]} {incr i} {
|
|
|
|
set x [lindex $todo $i]
|
|
|
|
if {$anc($x) eq {}} {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
foreach arc $arcnos($x) {
|
|
|
|
set xd $arcstart($arc)
|
|
|
|
if {$xd eq $bend} {
|
|
|
|
set cached_isanc($a,$bend) 1
|
|
|
|
set cached_isanc($b,$aend) 0
|
|
|
|
return 1
|
|
|
|
} elseif {$xd eq $aend} {
|
|
|
|
set cached_isanc($b,$aend) 1
|
|
|
|
set cached_isanc($a,$bend) 0
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
if {![info exists anc($xd)]} {
|
|
|
|
set anc($xd) $anc($x)
|
|
|
|
lappend todo $xd
|
|
|
|
} elseif {$anc($xd) ne $anc($x)} {
|
|
|
|
set anc($xd) {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set cached_isanc($a,$bend) 0
|
|
|
|
set cached_isanc($b,$aend) 0
|
|
|
|
return 0
|
|
|
|
}
|
2006-06-03 09:11:13 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# This identifies whether $desc has an ancestor that is
|
|
|
|
# a growing tip of the graph and which is not an ancestor of $anc
|
|
|
|
# and returns 0 if so and 1 if not.
|
|
|
|
# If we subsequently discover a tag on such a growing tip, and that
|
|
|
|
# turns out to be a descendent of $anc (which it could, since we
|
|
|
|
# don't necessarily see children before parents), then $desc
|
|
|
|
# isn't a good choice to display as a descendent tag of
|
|
|
|
# $anc (since it is the descendent of another tag which is
|
|
|
|
# a descendent of $anc). Similarly, $anc isn't a good choice to
|
|
|
|
# display as a ancestor tag of $desc.
|
|
|
|
#
|
|
|
|
proc is_certain {desc anc} {
|
|
|
|
global arcnos arcout arcstart arcend growing problems
|
|
|
|
|
|
|
|
set certain {}
|
|
|
|
if {[llength $arcnos($anc)] == 1} {
|
|
|
|
# tags on the same arc are certain
|
|
|
|
if {$arcnos($desc) eq $arcnos($anc)} {
|
|
|
|
return 1
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {![info exists arcout($anc)]} {
|
|
|
|
# if $anc is partway along an arc, use the start of the arc instead
|
|
|
|
set a [lindex $arcnos($anc) 0]
|
|
|
|
set anc $arcstart($a)
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
|
|
|
if {[llength $arcnos($desc)] > 1 || [info exists arcout($desc)]} {
|
|
|
|
set x $desc
|
|
|
|
} else {
|
|
|
|
set a [lindex $arcnos($desc) 0]
|
|
|
|
set x $arcend($a)
|
|
|
|
}
|
|
|
|
if {$x == $anc} {
|
|
|
|
return 1
|
|
|
|
}
|
|
|
|
set anclist [list $x]
|
|
|
|
set dl($x) 1
|
|
|
|
set nnh 1
|
|
|
|
set ngrowanc 0
|
|
|
|
for {set i 0} {$i < [llength $anclist] && ($nnh > 0 || $ngrowanc > 0)} {incr i} {
|
|
|
|
set x [lindex $anclist $i]
|
|
|
|
if {$dl($x)} {
|
|
|
|
incr nnh -1
|
|
|
|
}
|
|
|
|
set done($x) 1
|
|
|
|
foreach a $arcout($x) {
|
|
|
|
if {[info exists growing($a)]} {
|
|
|
|
if {![info exists growanc($x)] && $dl($x)} {
|
|
|
|
set growanc($x) 1
|
|
|
|
incr ngrowanc
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
set y $arcend($a)
|
|
|
|
if {[info exists dl($y)]} {
|
|
|
|
if {$dl($y)} {
|
|
|
|
if {!$dl($x)} {
|
|
|
|
set dl($y) 0
|
|
|
|
if {![info exists done($y)]} {
|
|
|
|
incr nnh -1
|
|
|
|
}
|
|
|
|
if {[info exists growanc($x)]} {
|
|
|
|
incr ngrowanc -1
|
|
|
|
}
|
|
|
|
set xl [list $y]
|
|
|
|
for {set k 0} {$k < [llength $xl]} {incr k} {
|
|
|
|
set z [lindex $xl $k]
|
|
|
|
foreach c $arcout($z) {
|
|
|
|
if {[info exists arcend($c)]} {
|
|
|
|
set v $arcend($c)
|
|
|
|
if {[info exists dl($v)] && $dl($v)} {
|
|
|
|
set dl($v) 0
|
|
|
|
if {![info exists done($v)]} {
|
|
|
|
incr nnh -1
|
|
|
|
}
|
|
|
|
if {[info exists growanc($v)]} {
|
|
|
|
incr ngrowanc -1
|
|
|
|
}
|
|
|
|
lappend xl $v
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} elseif {$y eq $anc || !$dl($x)} {
|
|
|
|
set dl($y) 0
|
|
|
|
lappend anclist $y
|
|
|
|
} else {
|
|
|
|
set dl($y) 1
|
|
|
|
lappend anclist $y
|
|
|
|
incr nnh
|
|
|
|
}
|
|
|
|
}
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
foreach x [array names growanc] {
|
|
|
|
if {$dl($x)} {
|
|
|
|
return 0
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-17 04:45:00 +00:00
|
|
|
return 0
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
return 1
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc validate_arctags {a} {
|
|
|
|
global arctags idtags
|
2006-06-03 09:11:13 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
set i -1
|
|
|
|
set na $arctags($a)
|
|
|
|
foreach id $arctags($a) {
|
|
|
|
incr i
|
|
|
|
if {![info exists idtags($id)]} {
|
|
|
|
set na [lreplace $na $i $i]
|
|
|
|
incr i -1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set arctags($a) $na
|
|
|
|
}
|
|
|
|
|
|
|
|
proc validate_archeads {a} {
|
|
|
|
global archeads idheads
|
|
|
|
|
|
|
|
set i -1
|
|
|
|
set na $archeads($a)
|
|
|
|
foreach id $archeads($a) {
|
|
|
|
incr i
|
|
|
|
if {![info exists idheads($id)]} {
|
|
|
|
set na [lreplace $na $i $i]
|
|
|
|
incr i -1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set archeads($a) $na
|
|
|
|
}
|
|
|
|
|
|
|
|
# Return the list of IDs that have tags that are descendents of id,
|
|
|
|
# ignoring IDs that are descendents of IDs already reported.
|
|
|
|
proc desctags {id} {
|
|
|
|
global arcnos arcstart arcids arctags idtags allparents
|
|
|
|
global growing cached_dtags
|
|
|
|
|
|
|
|
if {![info exists allparents($id)]} {
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
set t1 [clock clicks -milliseconds]
|
|
|
|
set argid $id
|
|
|
|
if {[llength $arcnos($id)] == 1 && [llength $allparents($id)] == 1} {
|
|
|
|
# part-way along an arc; check that arc first
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {$arctags($a) ne {}} {
|
|
|
|
validate_arctags $a
|
|
|
|
set i [lsearch -exact $arcids($a) $id]
|
|
|
|
set tid {}
|
|
|
|
foreach t $arctags($a) {
|
|
|
|
set j [lsearch -exact $arcids($a) $t]
|
|
|
|
if {$j >= $i} break
|
|
|
|
set tid $t
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {$tid ne {}} {
|
|
|
|
return $tid
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set id $arcstart($a)
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
return $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[info exists cached_dtags($id)]} {
|
|
|
|
return $cached_dtags($id)
|
|
|
|
}
|
|
|
|
|
|
|
|
set origid $id
|
|
|
|
set todo [list $id]
|
|
|
|
set queued($id) 1
|
|
|
|
set nc 1
|
|
|
|
for {set i 0} {$i < [llength $todo] && $nc > 0} {incr i} {
|
|
|
|
set id [lindex $todo $i]
|
|
|
|
set done($id) 1
|
|
|
|
set ta [info exists hastaggedancestor($id)]
|
|
|
|
if {!$ta} {
|
|
|
|
incr nc -1
|
|
|
|
}
|
|
|
|
# ignore tags on starting node
|
|
|
|
if {!$ta && $i > 0} {
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
set tagloc($id) $id
|
|
|
|
set ta 1
|
|
|
|
} elseif {[info exists cached_dtags($id)]} {
|
|
|
|
set tagloc($id) $cached_dtags($id)
|
|
|
|
set ta 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach a $arcnos($id) {
|
|
|
|
set d $arcstart($a)
|
|
|
|
if {!$ta && $arctags($a) ne {}} {
|
|
|
|
validate_arctags $a
|
|
|
|
if {$arctags($a) ne {}} {
|
|
|
|
lappend tagloc($id) [lindex $arctags($a) end]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$ta || $arctags($a) ne {}} {
|
|
|
|
set tomark [list $d]
|
|
|
|
for {set j 0} {$j < [llength $tomark]} {incr j} {
|
|
|
|
set dd [lindex $tomark $j]
|
|
|
|
if {![info exists hastaggedancestor($dd)]} {
|
|
|
|
if {[info exists done($dd)]} {
|
|
|
|
foreach b $arcnos($dd) {
|
|
|
|
lappend tomark $arcstart($b)
|
|
|
|
}
|
|
|
|
if {[info exists tagloc($dd)]} {
|
|
|
|
unset tagloc($dd)
|
|
|
|
}
|
|
|
|
} elseif {[info exists queued($dd)]} {
|
|
|
|
incr nc -1
|
|
|
|
}
|
|
|
|
set hastaggedancestor($dd) 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {![info exists queued($d)]} {
|
|
|
|
lappend todo $d
|
|
|
|
set queued($d) 1
|
|
|
|
if {![info exists hastaggedancestor($d)]} {
|
|
|
|
incr nc
|
|
|
|
}
|
|
|
|
}
|
2006-06-03 09:11:13 +00:00
|
|
|
}
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set tags {}
|
|
|
|
foreach id [array names tagloc] {
|
|
|
|
if {![info exists hastaggedancestor($id)]} {
|
|
|
|
foreach t $tagloc($id) {
|
|
|
|
if {[lsearch -exact $tags $t] < 0} {
|
|
|
|
lappend tags $t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set t2 [clock clicks -milliseconds]
|
|
|
|
set loopix $i
|
2005-08-19 12:14:28 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# remove tags that are descendents of other tags
|
|
|
|
for {set i 0} {$i < [llength $tags]} {incr i} {
|
|
|
|
set a [lindex $tags $i]
|
|
|
|
for {set j 0} {$j < $i} {incr j} {
|
|
|
|
set b [lindex $tags $j]
|
|
|
|
set r [anc_or_desc $a $b]
|
|
|
|
if {$r == 1} {
|
|
|
|
set tags [lreplace $tags $j $j]
|
|
|
|
incr j -1
|
|
|
|
incr i -1
|
|
|
|
} elseif {$r == -1} {
|
|
|
|
set tags [lreplace $tags $i $i]
|
|
|
|
incr i -1
|
|
|
|
break
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
if {[array names growing] ne {}} {
|
|
|
|
# graph isn't finished, need to check if any tag could get
|
|
|
|
# eclipsed by another tag coming later. Simply ignore any
|
|
|
|
# tags that could later get eclipsed.
|
|
|
|
set ctags {}
|
|
|
|
foreach t $tags {
|
|
|
|
if {[is_certain $t $origid]} {
|
|
|
|
lappend ctags $t
|
|
|
|
}
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {$tags eq $ctags} {
|
|
|
|
set cached_dtags($origid) $tags
|
|
|
|
} else {
|
|
|
|
set tags $ctags
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
} else {
|
|
|
|
set cached_dtags($origid) $tags
|
|
|
|
}
|
|
|
|
set t3 [clock clicks -milliseconds]
|
|
|
|
if {0 && $t3 - $t1 >= 100} {
|
|
|
|
puts "iterating descendents ($loopix/[llength $todo] nodes) took\
|
|
|
|
[expr {$t2-$t1}]+[expr {$t3-$t2}]ms, $nc candidates left"
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
return $tags
|
|
|
|
}
|
2006-08-08 10:55:36 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc anctags {id} {
|
|
|
|
global arcnos arcids arcout arcend arctags idtags allparents
|
|
|
|
global growing cached_atags
|
|
|
|
|
|
|
|
if {![info exists allparents($id)]} {
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
set t1 [clock clicks -milliseconds]
|
|
|
|
set argid $id
|
|
|
|
if {[llength $arcnos($id)] == 1 && [llength $allparents($id)] == 1} {
|
|
|
|
# part-way along an arc; check that arc first
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {$arctags($a) ne {}} {
|
|
|
|
validate_arctags $a
|
|
|
|
set i [lsearch -exact $arcids($a) $id]
|
|
|
|
foreach t $arctags($a) {
|
|
|
|
set j [lsearch -exact $arcids($a) $t]
|
|
|
|
if {$j > $i} {
|
|
|
|
return $t
|
|
|
|
}
|
|
|
|
}
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {![info exists arcend($a)]} {
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
set id $arcend($a)
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
return $id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[info exists cached_atags($id)]} {
|
|
|
|
return $cached_atags($id)
|
|
|
|
}
|
|
|
|
|
|
|
|
set origid $id
|
|
|
|
set todo [list $id]
|
|
|
|
set queued($id) 1
|
|
|
|
set taglist {}
|
|
|
|
set nc 1
|
|
|
|
for {set i 0} {$i < [llength $todo] && $nc > 0} {incr i} {
|
|
|
|
set id [lindex $todo $i]
|
|
|
|
set done($id) 1
|
|
|
|
set td [info exists hastaggeddescendent($id)]
|
|
|
|
if {!$td} {
|
|
|
|
incr nc -1
|
|
|
|
}
|
|
|
|
# ignore tags on starting node
|
|
|
|
if {!$td && $i > 0} {
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
set tagloc($id) $id
|
|
|
|
set td 1
|
|
|
|
} elseif {[info exists cached_atags($id)]} {
|
|
|
|
set tagloc($id) $cached_atags($id)
|
|
|
|
set td 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
foreach a $arcout($id) {
|
|
|
|
if {!$td && $arctags($a) ne {}} {
|
|
|
|
validate_arctags $a
|
|
|
|
if {$arctags($a) ne {}} {
|
|
|
|
lappend tagloc($id) [lindex $arctags($a) 0]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {![info exists arcend($a)]} continue
|
|
|
|
set d $arcend($a)
|
|
|
|
if {$td || $arctags($a) ne {}} {
|
|
|
|
set tomark [list $d]
|
|
|
|
for {set j 0} {$j < [llength $tomark]} {incr j} {
|
|
|
|
set dd [lindex $tomark $j]
|
|
|
|
if {![info exists hastaggeddescendent($dd)]} {
|
|
|
|
if {[info exists done($dd)]} {
|
|
|
|
foreach b $arcout($dd) {
|
|
|
|
if {[info exists arcend($b)]} {
|
|
|
|
lappend tomark $arcend($b)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {[info exists tagloc($dd)]} {
|
|
|
|
unset tagloc($dd)
|
|
|
|
}
|
|
|
|
} elseif {[info exists queued($dd)]} {
|
|
|
|
incr nc -1
|
|
|
|
}
|
|
|
|
set hastaggeddescendent($dd) 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {![info exists queued($d)]} {
|
|
|
|
lappend todo $d
|
|
|
|
set queued($d) 1
|
|
|
|
if {![info exists hastaggeddescendent($d)]} {
|
|
|
|
incr nc
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
set t2 [clock clicks -milliseconds]
|
|
|
|
set loopix $i
|
|
|
|
set tags {}
|
|
|
|
foreach id [array names tagloc] {
|
|
|
|
if {![info exists hastaggeddescendent($id)]} {
|
|
|
|
foreach t $tagloc($id) {
|
|
|
|
if {[lsearch -exact $tags $t] < 0} {
|
|
|
|
lappend tags $t
|
|
|
|
}
|
|
|
|
}
|
2006-08-08 10:55:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# remove tags that are ancestors of other tags
|
|
|
|
for {set i 0} {$i < [llength $tags]} {incr i} {
|
|
|
|
set a [lindex $tags $i]
|
|
|
|
for {set j 0} {$j < $i} {incr j} {
|
|
|
|
set b [lindex $tags $j]
|
|
|
|
set r [anc_or_desc $a $b]
|
|
|
|
if {$r == -1} {
|
|
|
|
set tags [lreplace $tags $j $j]
|
|
|
|
incr j -1
|
|
|
|
incr i -1
|
|
|
|
} elseif {$r == 1} {
|
|
|
|
set tags [lreplace $tags $i $i]
|
|
|
|
incr i -1
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if {[array names growing] ne {}} {
|
|
|
|
# graph isn't finished, need to check if any tag could get
|
|
|
|
# eclipsed by another tag coming later. Simply ignore any
|
|
|
|
# tags that could later get eclipsed.
|
|
|
|
set ctags {}
|
|
|
|
foreach t $tags {
|
|
|
|
if {[is_certain $origid $t]} {
|
|
|
|
lappend ctags $t
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$tags eq $ctags} {
|
|
|
|
set cached_atags($origid) $tags
|
|
|
|
} else {
|
|
|
|
set tags $ctags
|
2006-08-01 23:41:04 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
} else {
|
|
|
|
set cached_atags($origid) $tags
|
|
|
|
}
|
|
|
|
set t3 [clock clicks -milliseconds]
|
|
|
|
if {0 && $t3 - $t1 >= 100} {
|
|
|
|
puts "iterating ancestors ($loopix/[llength $todo] nodes) took\
|
|
|
|
[expr {$t2-$t1}]+[expr {$t3-$t2}]ms, $nc candidates left"
|
2006-08-01 23:41:04 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
return $tags
|
2006-08-01 23:41:04 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
# Return the list of IDs that have heads that are descendents of id,
|
|
|
|
# including id itself if it has a head.
|
|
|
|
proc descheads {id} {
|
|
|
|
global arcnos arcstart arcids archeads idheads cached_dheads
|
|
|
|
global allparents
|
2006-08-06 11:08:05 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
if {![info exists allparents($id)]} {
|
|
|
|
return {}
|
|
|
|
}
|
2007-06-18 12:39:21 +00:00
|
|
|
set aret {}
|
2007-06-16 10:29:25 +00:00
|
|
|
if {[llength $arcnos($id)] == 1 && [llength $allparents($id)] == 1} {
|
|
|
|
# part-way along an arc; check it first
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {$archeads($a) ne {}} {
|
|
|
|
validate_archeads $a
|
|
|
|
set i [lsearch -exact $arcids($a) $id]
|
|
|
|
foreach t $archeads($a) {
|
|
|
|
set j [lsearch -exact $arcids($a) $t]
|
|
|
|
if {$j > $i} break
|
2007-06-18 12:39:21 +00:00
|
|
|
lappend aret $t
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set id $arcstart($a)
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set origid $id
|
|
|
|
set todo [list $id]
|
|
|
|
set seen($id) 1
|
2007-06-18 12:39:21 +00:00
|
|
|
set ret {}
|
2007-06-16 10:29:25 +00:00
|
|
|
for {set i 0} {$i < [llength $todo]} {incr i} {
|
|
|
|
set id [lindex $todo $i]
|
|
|
|
if {[info exists cached_dheads($id)]} {
|
|
|
|
set ret [concat $ret $cached_dheads($id)]
|
|
|
|
} else {
|
|
|
|
if {[info exists idheads($id)]} {
|
|
|
|
lappend ret $id
|
|
|
|
}
|
|
|
|
foreach a $arcnos($id) {
|
|
|
|
if {$archeads($a) ne {}} {
|
2007-06-26 01:09:49 +00:00
|
|
|
validate_archeads $a
|
|
|
|
if {$archeads($a) ne {}} {
|
|
|
|
set ret [concat $ret $archeads($a)]
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
}
|
|
|
|
set d $arcstart($a)
|
|
|
|
if {![info exists seen($d)]} {
|
|
|
|
lappend todo $d
|
|
|
|
set seen($d) 1
|
|
|
|
}
|
|
|
|
}
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
set ret [lsort -unique $ret]
|
|
|
|
set cached_dheads($origid) $ret
|
2007-06-18 12:39:21 +00:00
|
|
|
return [concat $ret $aret]
|
2006-08-01 23:52:01 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc addedtag {id} {
|
|
|
|
global arcnos arcout cached_dtags cached_atags
|
2006-08-06 11:08:05 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
if {![info exists arcnos($id)]} return
|
|
|
|
if {![info exists arcout($id)]} {
|
|
|
|
recalcarc [lindex $arcnos($id) 0]
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
catch {unset cached_dtags}
|
|
|
|
catch {unset cached_atags}
|
2006-08-06 11:08:05 +00:00
|
|
|
}
|
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
proc addedhead {hid head} {
|
|
|
|
global arcnos arcout cached_dheads
|
|
|
|
|
|
|
|
if {![info exists arcnos($hid)]} return
|
|
|
|
if {![info exists arcout($hid)]} {
|
|
|
|
recalcarc [lindex $arcnos($hid) 0]
|
|
|
|
}
|
|
|
|
catch {unset cached_dheads}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc removedhead {hid head} {
|
|
|
|
global cached_dheads
|
|
|
|
|
|
|
|
catch {unset cached_dheads}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc movedhead {hid head} {
|
|
|
|
global arcnos arcout cached_dheads
|
2006-08-01 23:38:10 +00:00
|
|
|
|
2007-06-16 10:29:25 +00:00
|
|
|
if {![info exists arcnos($hid)]} return
|
|
|
|
if {![info exists arcout($hid)]} {
|
|
|
|
recalcarc [lindex $arcnos($hid) 0]
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
catch {unset cached_dheads}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc changedrefs {} {
|
|
|
|
global cached_dheads cached_dtags cached_atags
|
|
|
|
global arctags archeads arcnos arcout idheads idtags
|
|
|
|
|
|
|
|
foreach id [concat [array names idheads] [array names idtags]] {
|
|
|
|
if {[info exists arcnos($id)] && ![info exists arcout($id)]} {
|
|
|
|
set a [lindex $arcnos($id) 0]
|
|
|
|
if {![info exists donearc($a)]} {
|
|
|
|
recalcarc $a
|
|
|
|
set donearc($a) 1
|
|
|
|
}
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-16 10:29:25 +00:00
|
|
|
catch {unset cached_dtags}
|
|
|
|
catch {unset cached_atags}
|
|
|
|
catch {unset cached_dheads}
|
2006-08-01 23:38:10 +00:00
|
|
|
}
|
|
|
|
|
2005-08-19 12:14:28 +00:00
|
|
|
proc rereadrefs {} {
|
2007-12-26 12:03:43 +00:00
|
|
|
global idtags idheads idotherrefs mainheadid
|
2005-08-19 12:14:28 +00:00
|
|
|
|
|
|
|
set refids [concat [array names idtags] \
|
|
|
|
[array names idheads] [array names idotherrefs]]
|
|
|
|
foreach id $refids {
|
|
|
|
if {![info exists ref($id)]} {
|
|
|
|
set ref($id) [listrefs $id]
|
|
|
|
}
|
|
|
|
}
|
2007-12-26 12:03:43 +00:00
|
|
|
set oldmainhead $mainheadid
|
2005-08-19 12:14:28 +00:00
|
|
|
readrefs
|
2006-08-01 23:38:10 +00:00
|
|
|
changedrefs
|
2005-08-19 12:14:28 +00:00
|
|
|
set refids [lsort -unique [concat $refids [array names idtags] \
|
|
|
|
[array names idheads] [array names idotherrefs]]]
|
|
|
|
foreach id $refids {
|
|
|
|
set v [listrefs $id]
|
2008-05-26 00:11:33 +00:00
|
|
|
if {![info exists ref($id)] || $ref($id) != $v} {
|
2005-08-19 12:14:28 +00:00
|
|
|
redrawtags $id
|
|
|
|
}
|
|
|
|
}
|
2008-05-26 00:11:33 +00:00
|
|
|
if {$oldmainhead ne $mainheadid} {
|
|
|
|
redrawtags $oldmainhead
|
|
|
|
redrawtags $mainheadid
|
|
|
|
}
|
2007-08-20 09:36:20 +00:00
|
|
|
run refill_reflist
|
2005-08-19 12:14:28 +00:00
|
|
|
}
|
|
|
|
|
2006-06-11 16:50:47 +00:00
|
|
|
proc listrefs {id} {
|
|
|
|
global idtags idheads idotherrefs
|
|
|
|
|
|
|
|
set x {}
|
|
|
|
if {[info exists idtags($id)]} {
|
|
|
|
set x $idtags($id)
|
|
|
|
}
|
|
|
|
set y {}
|
|
|
|
if {[info exists idheads($id)]} {
|
|
|
|
set y $idheads($id)
|
|
|
|
}
|
|
|
|
set z {}
|
|
|
|
if {[info exists idotherrefs($id)]} {
|
|
|
|
set z $idotherrefs($id)
|
|
|
|
}
|
|
|
|
return [list $x $y $z]
|
|
|
|
}
|
|
|
|
|
2005-08-19 13:11:39 +00:00
|
|
|
proc showtag {tag isnew} {
|
2006-09-11 00:36:53 +00:00
|
|
|
global ctext tagcontents tagids linknum tagobjid
|
2005-08-19 13:11:39 +00:00
|
|
|
|
|
|
|
if {$isnew} {
|
|
|
|
addtohistory [list showtag $tag 0]
|
|
|
|
}
|
|
|
|
$ctext conf -state normal
|
2006-05-24 00:16:03 +00:00
|
|
|
clear_ctext
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs 0
|
2005-08-19 13:11:39 +00:00
|
|
|
set linknum 0
|
2006-09-11 00:36:53 +00:00
|
|
|
if {![info exists tagcontents($tag)]} {
|
|
|
|
catch {
|
|
|
|
set tagcontents($tag) [exec git cat-file tag $tagobjid($tag)]
|
|
|
|
}
|
|
|
|
}
|
2005-08-19 13:11:39 +00:00
|
|
|
if {[info exists tagcontents($tag)]} {
|
|
|
|
set text $tagcontents($tag)
|
|
|
|
} else {
|
2007-11-07 17:42:55 +00:00
|
|
|
set text "[mc "Tag"]: $tag\n[mc "Id"]: $tagids($tag)"
|
2005-08-19 13:11:39 +00:00
|
|
|
}
|
2006-05-15 15:13:14 +00:00
|
|
|
appendwithlinks $text {}
|
2005-08-19 13:11:39 +00:00
|
|
|
$ctext conf -state disabled
|
2006-04-27 09:21:49 +00:00
|
|
|
init_flist {}
|
2005-08-19 13:11:39 +00:00
|
|
|
}
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
proc doquit {} {
|
|
|
|
global stopped
|
2008-03-24 11:55:36 +00:00
|
|
|
global gitktmpdir
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
set stopped 100
|
2007-02-09 03:22:24 +00:00
|
|
|
savestuff .
|
2005-05-15 12:55:47 +00:00
|
|
|
destroy .
|
2008-03-24 11:55:36 +00:00
|
|
|
|
|
|
|
if {[info exists gitktmpdir]} {
|
|
|
|
catch {file delete -force $gitktmpdir}
|
|
|
|
}
|
2005-05-15 12:55:47 +00:00
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2007-10-06 10:16:06 +00:00
|
|
|
proc mkfontdisp {font top which} {
|
|
|
|
global fontattr fontpref $font
|
|
|
|
|
|
|
|
set fontpref($font) [set $font]
|
|
|
|
button $top.${font}but -text $which -font optionfont \
|
|
|
|
-command [list choosefont $font $which]
|
|
|
|
label $top.$font -relief flat -font $font \
|
|
|
|
-text $fontattr($font,family) -justify left
|
|
|
|
grid x $top.${font}but $top.$font -sticky w
|
|
|
|
}
|
|
|
|
|
|
|
|
proc choosefont {font which} {
|
|
|
|
global fontparam fontlist fonttop fontattr
|
|
|
|
|
|
|
|
set fontparam(which) $which
|
|
|
|
set fontparam(font) $font
|
|
|
|
set fontparam(family) [font actual $font -family]
|
|
|
|
set fontparam(size) $fontattr($font,size)
|
|
|
|
set fontparam(weight) $fontattr($font,weight)
|
|
|
|
set fontparam(slant) $fontattr($font,slant)
|
|
|
|
set top .gitkfont
|
|
|
|
set fonttop $top
|
|
|
|
if {![winfo exists $top]} {
|
|
|
|
font create sample
|
|
|
|
eval font config sample [font actual $font]
|
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $top [mc "Gitk font chooser"]
|
2008-01-06 04:54:46 +00:00
|
|
|
label $top.l -textvariable fontparam(which)
|
2007-10-06 10:16:06 +00:00
|
|
|
pack $top.l -side top
|
|
|
|
set fontlist [lsort [font families]]
|
|
|
|
frame $top.f
|
|
|
|
listbox $top.f.fam -listvariable fontlist \
|
|
|
|
-yscrollcommand [list $top.f.sb set]
|
|
|
|
bind $top.f.fam <<ListboxSelect>> selfontfam
|
|
|
|
scrollbar $top.f.sb -command [list $top.f.fam yview]
|
|
|
|
pack $top.f.sb -side right -fill y
|
|
|
|
pack $top.f.fam -side left -fill both -expand 1
|
|
|
|
pack $top.f -side top -fill both -expand 1
|
|
|
|
frame $top.g
|
|
|
|
spinbox $top.g.size -from 4 -to 40 -width 4 \
|
|
|
|
-textvariable fontparam(size) \
|
|
|
|
-validatecommand {string is integer -strict %s}
|
|
|
|
checkbutton $top.g.bold -padx 5 \
|
2007-11-07 17:42:55 +00:00
|
|
|
-font {{Times New Roman} 12 bold} -text [mc "B"] -indicatoron 0 \
|
2007-10-06 10:16:06 +00:00
|
|
|
-variable fontparam(weight) -onvalue bold -offvalue normal
|
|
|
|
checkbutton $top.g.ital -padx 5 \
|
2007-11-07 17:42:55 +00:00
|
|
|
-font {{Times New Roman} 12 italic} -text [mc "I"] -indicatoron 0 \
|
2007-10-06 10:16:06 +00:00
|
|
|
-variable fontparam(slant) -onvalue italic -offvalue roman
|
|
|
|
pack $top.g.size $top.g.bold $top.g.ital -side left
|
|
|
|
pack $top.g -side top
|
|
|
|
canvas $top.c -width 150 -height 50 -border 2 -relief sunk \
|
|
|
|
-background white
|
|
|
|
$top.c create text 100 25 -anchor center -text $which -font sample \
|
|
|
|
-fill black -tags text
|
|
|
|
bind $top.c <Configure> [list centertext $top.c]
|
|
|
|
pack $top.c -side top -fill x
|
|
|
|
frame $top.buts
|
2008-01-06 04:54:46 +00:00
|
|
|
button $top.buts.ok -text [mc "OK"] -command fontok -default active
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command fontcan -default normal
|
2007-10-06 10:16:06 +00:00
|
|
|
grid $top.buts.ok $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
pack $top.buts -side bottom -fill x
|
|
|
|
trace add variable fontparam write chg_fontparam
|
|
|
|
} else {
|
|
|
|
raise $top
|
|
|
|
$top.c itemconf text -text $which
|
|
|
|
}
|
|
|
|
set i [lsearch -exact $fontlist $fontparam(family)]
|
|
|
|
if {$i >= 0} {
|
|
|
|
$top.f.fam selection set $i
|
|
|
|
$top.f.fam see $i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc centertext {w} {
|
|
|
|
$w coords text [expr {[winfo width $w] / 2}] [expr {[winfo height $w] / 2}]
|
|
|
|
}
|
|
|
|
|
|
|
|
proc fontok {} {
|
|
|
|
global fontparam fontpref prefstop
|
|
|
|
|
|
|
|
set f $fontparam(font)
|
|
|
|
set fontpref($f) [list $fontparam(family) $fontparam(size)]
|
|
|
|
if {$fontparam(weight) eq "bold"} {
|
|
|
|
lappend fontpref($f) "bold"
|
|
|
|
}
|
|
|
|
if {$fontparam(slant) eq "italic"} {
|
|
|
|
lappend fontpref($f) "italic"
|
|
|
|
}
|
|
|
|
set w $prefstop.$f
|
|
|
|
$w conf -text $fontparam(family) -font $fontpref($f)
|
|
|
|
|
|
|
|
fontcan
|
|
|
|
}
|
|
|
|
|
|
|
|
proc fontcan {} {
|
|
|
|
global fonttop fontparam
|
|
|
|
|
|
|
|
if {[info exists fonttop]} {
|
|
|
|
catch {destroy $fonttop}
|
|
|
|
catch {font delete sample}
|
|
|
|
unset fonttop
|
|
|
|
unset fontparam
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc selfontfam {} {
|
|
|
|
global fonttop fontparam
|
|
|
|
|
|
|
|
set i [$fonttop.f.fam curselection]
|
|
|
|
if {$i ne {}} {
|
|
|
|
set fontparam(family) [$fonttop.f.fam get $i]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc chg_fontparam {v sub op} {
|
|
|
|
global fontparam
|
|
|
|
|
|
|
|
font config sample -$sub $fontparam($sub)
|
|
|
|
}
|
|
|
|
|
2005-11-29 22:28:16 +00:00
|
|
|
proc doprefs {} {
|
2007-10-06 10:22:00 +00:00
|
|
|
global maxwidth maxgraphpct
|
2006-09-07 00:21:39 +00:00
|
|
|
global oldprefs prefstop showneartags showlocalchanges
|
2007-05-20 16:12:48 +00:00
|
|
|
global bgcolor fgcolor ctext diffcolors selectbgcolor
|
2008-03-24 11:55:36 +00:00
|
|
|
global tabstop limitdiffs autoselect extdifftool
|
2005-11-14 23:34:03 +00:00
|
|
|
|
2005-11-29 22:28:16 +00:00
|
|
|
set top .gitkprefs
|
|
|
|
set prefstop $top
|
|
|
|
if {[winfo exists $top]} {
|
|
|
|
raise $top
|
|
|
|
return
|
2005-11-20 22:56:07 +00:00
|
|
|
}
|
2007-10-23 12:40:50 +00:00
|
|
|
foreach v {maxwidth maxgraphpct showneartags showlocalchanges \
|
2007-10-23 00:33:38 +00:00
|
|
|
limitdiffs tabstop} {
|
2005-11-29 22:28:16 +00:00
|
|
|
set oldprefs($v) [set $v]
|
2005-11-14 23:34:03 +00:00
|
|
|
}
|
2005-11-29 22:28:16 +00:00
|
|
|
toplevel $top
|
2007-11-07 17:42:55 +00:00
|
|
|
wm title $top [mc "Gitk preferences"]
|
|
|
|
label $top.ldisp -text [mc "Commit list display options"]
|
2005-11-29 22:28:16 +00:00
|
|
|
grid $top.ldisp - -sticky w -pady 10
|
|
|
|
label $top.spacer -text " "
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.maxwidthl -text [mc "Maximum graph width (lines)"] \
|
2005-11-29 22:28:16 +00:00
|
|
|
-font optionfont
|
|
|
|
spinbox $top.maxwidth -from 0 -to 100 -width 4 -textvariable maxwidth
|
|
|
|
grid $top.spacer $top.maxwidthl $top.maxwidth -sticky w
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.maxpctl -text [mc "Maximum graph width (% of pane)"] \
|
2005-11-29 22:28:16 +00:00
|
|
|
-font optionfont
|
|
|
|
spinbox $top.maxpct -from 1 -to 100 -width 4 -textvariable maxgraphpct
|
|
|
|
grid x $top.maxpctl $top.maxpct -sticky w
|
2006-09-07 00:21:39 +00:00
|
|
|
frame $top.showlocal
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.showlocal.l -text [mc "Show local changes"] -font optionfont
|
2006-09-07 00:21:39 +00:00
|
|
|
checkbutton $top.showlocal.b -variable showlocalchanges
|
|
|
|
pack $top.showlocal.b $top.showlocal.l -side left
|
|
|
|
grid x $top.showlocal -sticky w
|
2008-03-06 11:49:25 +00:00
|
|
|
frame $top.autoselect
|
|
|
|
label $top.autoselect.l -text [mc "Auto-select SHA1"] -font optionfont
|
|
|
|
checkbutton $top.autoselect.b -variable autoselect
|
|
|
|
pack $top.autoselect.b $top.autoselect.l -side left
|
|
|
|
grid x $top.autoselect -sticky w
|
2006-07-05 12:56:37 +00:00
|
|
|
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.ddisp -text [mc "Diff display options"]
|
2005-11-29 22:28:16 +00:00
|
|
|
grid $top.ddisp - -sticky w -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.tabstopl -text [mc "Tab spacing"] -font optionfont
|
2007-10-23 00:33:38 +00:00
|
|
|
spinbox $top.tabstop -from 1 -to 20 -width 4 -textvariable tabstop
|
|
|
|
grid x $top.tabstopl $top.tabstop -sticky w
|
2006-06-03 09:11:13 +00:00
|
|
|
frame $top.ntag
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.ntag.l -text [mc "Display nearby tags"] -font optionfont
|
2006-06-03 09:11:13 +00:00
|
|
|
checkbutton $top.ntag.b -variable showneartags
|
|
|
|
pack $top.ntag.b $top.ntag.l -side left
|
|
|
|
grid x $top.ntag -sticky w
|
2007-10-23 00:15:11 +00:00
|
|
|
frame $top.ldiff
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.ldiff.l -text [mc "Limit diffs to listed paths"] -font optionfont
|
2007-10-23 00:15:11 +00:00
|
|
|
checkbutton $top.ldiff.b -variable limitdiffs
|
|
|
|
pack $top.ldiff.b $top.ldiff.l -side left
|
|
|
|
grid x $top.ldiff -sticky w
|
2006-07-05 12:56:37 +00:00
|
|
|
|
2008-03-24 11:55:36 +00:00
|
|
|
entry $top.extdifft -textvariable extdifftool
|
|
|
|
frame $top.extdifff
|
|
|
|
label $top.extdifff.l -text [mc "External diff tool" ] -font optionfont \
|
|
|
|
-padx 10
|
|
|
|
button $top.extdifff.b -text [mc "Choose..."] -font optionfont \
|
|
|
|
-command choose_extdiff
|
|
|
|
pack $top.extdifff.l $top.extdifff.b -side left
|
|
|
|
grid x $top.extdifff $top.extdifft -sticky w
|
|
|
|
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.cdisp -text [mc "Colors: press to choose"]
|
2006-07-05 12:56:37 +00:00
|
|
|
grid $top.cdisp - -sticky w -pady 10
|
|
|
|
label $top.bg -padx 40 -relief sunk -background $bgcolor
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.bgbut -text [mc "Background"] -font optionfont \
|
2008-03-26 18:45:26 +00:00
|
|
|
-command [list choosecolor bgcolor {} $top.bg background setbg]
|
2006-07-05 12:56:37 +00:00
|
|
|
grid x $top.bgbut $top.bg -sticky w
|
|
|
|
label $top.fg -padx 40 -relief sunk -background $fgcolor
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.fgbut -text [mc "Foreground"] -font optionfont \
|
2008-03-26 18:45:26 +00:00
|
|
|
-command [list choosecolor fgcolor {} $top.fg foreground setfg]
|
2006-07-05 12:56:37 +00:00
|
|
|
grid x $top.fgbut $top.fg -sticky w
|
|
|
|
label $top.diffold -padx 40 -relief sunk -background [lindex $diffcolors 0]
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.diffoldbut -text [mc "Diff: old lines"] -font optionfont \
|
2006-07-05 12:56:37 +00:00
|
|
|
-command [list choosecolor diffcolors 0 $top.diffold "diff old lines" \
|
|
|
|
[list $ctext tag conf d0 -foreground]]
|
|
|
|
grid x $top.diffoldbut $top.diffold -sticky w
|
|
|
|
label $top.diffnew -padx 40 -relief sunk -background [lindex $diffcolors 1]
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.diffnewbut -text [mc "Diff: new lines"] -font optionfont \
|
2006-07-05 12:56:37 +00:00
|
|
|
-command [list choosecolor diffcolors 1 $top.diffnew "diff new lines" \
|
|
|
|
[list $ctext tag conf d1 -foreground]]
|
|
|
|
grid x $top.diffnewbut $top.diffnew -sticky w
|
|
|
|
label $top.hunksep -padx 40 -relief sunk -background [lindex $diffcolors 2]
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.hunksepbut -text [mc "Diff: hunk header"] -font optionfont \
|
2006-07-05 12:56:37 +00:00
|
|
|
-command [list choosecolor diffcolors 2 $top.hunksep \
|
|
|
|
"diff hunk header" \
|
|
|
|
[list $ctext tag conf hunksep -foreground]]
|
|
|
|
grid x $top.hunksepbut $top.hunksep -sticky w
|
2007-05-20 16:12:48 +00:00
|
|
|
label $top.selbgsep -padx 40 -relief sunk -background $selectbgcolor
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.selbgbut -text [mc "Select bg"] -font optionfont \
|
2008-03-26 18:45:26 +00:00
|
|
|
-command [list choosecolor selectbgcolor {} $top.selbgsep background setselbg]
|
2007-05-20 16:12:48 +00:00
|
|
|
grid x $top.selbgbut $top.selbgsep -sticky w
|
2006-07-05 12:56:37 +00:00
|
|
|
|
2007-11-07 17:42:55 +00:00
|
|
|
label $top.cfont -text [mc "Fonts: press to choose"]
|
2007-10-06 10:16:06 +00:00
|
|
|
grid $top.cfont - -sticky w -pady 10
|
2007-11-07 17:42:55 +00:00
|
|
|
mkfontdisp mainfont $top [mc "Main font"]
|
|
|
|
mkfontdisp textfont $top [mc "Diff display font"]
|
|
|
|
mkfontdisp uifont $top [mc "User interface font"]
|
2007-10-06 10:16:06 +00:00
|
|
|
|
2005-11-29 22:28:16 +00:00
|
|
|
frame $top.buts
|
2007-11-07 17:42:55 +00:00
|
|
|
button $top.buts.ok -text [mc "OK"] -command prefsok -default active
|
|
|
|
button $top.buts.can -text [mc "Cancel"] -command prefscan -default normal
|
2005-11-29 22:28:16 +00:00
|
|
|
grid $top.buts.ok $top.buts.can
|
|
|
|
grid columnconfigure $top.buts 0 -weight 1 -uniform a
|
|
|
|
grid columnconfigure $top.buts 1 -weight 1 -uniform a
|
|
|
|
grid $top.buts - - -pady 10 -sticky ew
|
2007-03-27 10:36:59 +00:00
|
|
|
bind $top <Visibility> "focus $top.buts.ok"
|
2005-11-29 22:28:16 +00:00
|
|
|
}
|
|
|
|
|
2008-03-24 11:55:36 +00:00
|
|
|
proc choose_extdiff {} {
|
|
|
|
global extdifftool
|
|
|
|
|
|
|
|
set prog [tk_getOpenFile -title "External diff tool" -multiple false]
|
|
|
|
if {$prog ne {}} {
|
|
|
|
set extdifftool $prog
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-05 12:56:37 +00:00
|
|
|
proc choosecolor {v vi w x cmd} {
|
|
|
|
global $v
|
|
|
|
|
|
|
|
set c [tk_chooseColor -initialcolor [lindex [set $v] $vi] \
|
2007-11-07 17:42:55 +00:00
|
|
|
-title [mc "Gitk: choose color for %s" $x]]
|
2006-07-05 12:56:37 +00:00
|
|
|
if {$c eq {}} return
|
|
|
|
$w conf -background $c
|
|
|
|
lset $v $vi $c
|
|
|
|
eval $cmd $c
|
|
|
|
}
|
|
|
|
|
2007-05-20 16:12:48 +00:00
|
|
|
proc setselbg {c} {
|
|
|
|
global bglist cflist
|
|
|
|
foreach w $bglist {
|
|
|
|
$w configure -selectbackground $c
|
|
|
|
}
|
|
|
|
$cflist tag configure highlight \
|
|
|
|
-background [$cflist cget -selectbackground]
|
|
|
|
allcanvs itemconf secsel -fill $c
|
|
|
|
}
|
|
|
|
|
2006-07-05 12:56:37 +00:00
|
|
|
proc setbg {c} {
|
|
|
|
global bglist
|
|
|
|
|
|
|
|
foreach w $bglist {
|
|
|
|
$w conf -background $c
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc setfg {c} {
|
|
|
|
global fglist canv
|
|
|
|
|
|
|
|
foreach w $fglist {
|
|
|
|
$w conf -foreground $c
|
|
|
|
}
|
|
|
|
allcanvs itemconf text -fill $c
|
|
|
|
$canv itemconf circle -outline $c
|
|
|
|
}
|
|
|
|
|
2005-11-29 22:28:16 +00:00
|
|
|
proc prefscan {} {
|
2007-10-23 00:33:38 +00:00
|
|
|
global oldprefs prefstop
|
2005-11-29 22:28:16 +00:00
|
|
|
|
2007-10-23 12:40:50 +00:00
|
|
|
foreach v {maxwidth maxgraphpct showneartags showlocalchanges \
|
2007-10-23 00:33:38 +00:00
|
|
|
limitdiffs tabstop} {
|
|
|
|
global $v
|
2005-11-29 22:28:16 +00:00
|
|
|
set $v $oldprefs($v)
|
|
|
|
}
|
|
|
|
catch {destroy $prefstop}
|
|
|
|
unset prefstop
|
2007-10-06 10:16:06 +00:00
|
|
|
fontcan
|
2005-11-29 22:28:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
proc prefsok {} {
|
|
|
|
global maxwidth maxgraphpct
|
2006-09-07 00:21:39 +00:00
|
|
|
global oldprefs prefstop showneartags showlocalchanges
|
2007-10-06 10:16:06 +00:00
|
|
|
global fontpref mainfont textfont uifont
|
2007-10-27 11:23:20 +00:00
|
|
|
global limitdiffs treediffs
|
2005-11-29 22:28:16 +00:00
|
|
|
|
|
|
|
catch {destroy $prefstop}
|
|
|
|
unset prefstop
|
2007-10-06 10:16:06 +00:00
|
|
|
fontcan
|
|
|
|
set fontchanged 0
|
|
|
|
if {$mainfont ne $fontpref(mainfont)} {
|
|
|
|
set mainfont $fontpref(mainfont)
|
|
|
|
parsefont mainfont $mainfont
|
|
|
|
eval font configure mainfont [fontflags mainfont]
|
|
|
|
eval font configure mainfontbold [fontflags mainfont 1]
|
|
|
|
setcoords
|
|
|
|
set fontchanged 1
|
|
|
|
}
|
|
|
|
if {$textfont ne $fontpref(textfont)} {
|
|
|
|
set textfont $fontpref(textfont)
|
|
|
|
parsefont textfont $textfont
|
|
|
|
eval font configure textfont [fontflags textfont]
|
|
|
|
eval font configure textfontbold [fontflags textfont 1]
|
|
|
|
}
|
|
|
|
if {$uifont ne $fontpref(uifont)} {
|
|
|
|
set uifont $fontpref(uifont)
|
|
|
|
parsefont uifont $uifont
|
|
|
|
eval font configure uifont [fontflags uifont]
|
|
|
|
}
|
2007-09-28 11:27:39 +00:00
|
|
|
settabs
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$showlocalchanges != $oldprefs(showlocalchanges)} {
|
|
|
|
if {$showlocalchanges} {
|
|
|
|
doshowlocalchanges
|
|
|
|
} else {
|
|
|
|
dohidelocalchanges
|
|
|
|
}
|
|
|
|
}
|
2007-10-24 00:16:56 +00:00
|
|
|
if {$limitdiffs != $oldprefs(limitdiffs)} {
|
|
|
|
# treediffs elements are limited by path
|
|
|
|
catch {unset treediffs}
|
|
|
|
}
|
2007-10-06 10:16:06 +00:00
|
|
|
if {$fontchanged || $maxwidth != $oldprefs(maxwidth)
|
2005-11-29 22:28:16 +00:00
|
|
|
|| $maxgraphpct != $oldprefs(maxgraphpct)} {
|
|
|
|
redisplay
|
2007-10-23 00:15:11 +00:00
|
|
|
} elseif {$showneartags != $oldprefs(showneartags) ||
|
|
|
|
$limitdiffs != $oldprefs(limitdiffs)} {
|
2006-06-03 09:11:13 +00:00
|
|
|
reselectline
|
2005-11-29 22:28:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proc formatdate {d} {
|
2007-08-14 20:02:04 +00:00
|
|
|
global datetimeformat
|
2006-09-07 00:21:39 +00:00
|
|
|
if {$d ne {}} {
|
2007-08-14 20:02:04 +00:00
|
|
|
set d [clock format $d -format $datetimeformat]
|
2006-09-07 00:21:39 +00:00
|
|
|
}
|
|
|
|
return $d
|
2005-11-14 23:34:03 +00:00
|
|
|
}
|
|
|
|
|
2005-12-07 12:28:22 +00:00
|
|
|
# This list of encoding names and aliases is distilled from
|
|
|
|
# http://www.iana.org/assignments/character-sets.
|
|
|
|
# Not all of them are supported by Tcl.
|
|
|
|
set encoding_aliases {
|
|
|
|
{ ANSI_X3.4-1968 iso-ir-6 ANSI_X3.4-1986 ISO_646.irv:1991 ASCII
|
|
|
|
ISO646-US US-ASCII us IBM367 cp367 csASCII }
|
|
|
|
{ ISO-10646-UTF-1 csISO10646UTF1 }
|
|
|
|
{ ISO_646.basic:1983 ref csISO646basic1983 }
|
|
|
|
{ INVARIANT csINVARIANT }
|
|
|
|
{ ISO_646.irv:1983 iso-ir-2 irv csISO2IntlRefVersion }
|
|
|
|
{ BS_4730 iso-ir-4 ISO646-GB gb uk csISO4UnitedKingdom }
|
|
|
|
{ NATS-SEFI iso-ir-8-1 csNATSSEFI }
|
|
|
|
{ NATS-SEFI-ADD iso-ir-8-2 csNATSSEFIADD }
|
|
|
|
{ NATS-DANO iso-ir-9-1 csNATSDANO }
|
|
|
|
{ NATS-DANO-ADD iso-ir-9-2 csNATSDANOADD }
|
|
|
|
{ SEN_850200_B iso-ir-10 FI ISO646-FI ISO646-SE se csISO10Swedish }
|
|
|
|
{ SEN_850200_C iso-ir-11 ISO646-SE2 se2 csISO11SwedishForNames }
|
|
|
|
{ KS_C_5601-1987 iso-ir-149 KS_C_5601-1989 KSC_5601 korean csKSC56011987 }
|
|
|
|
{ ISO-2022-KR csISO2022KR }
|
|
|
|
{ EUC-KR csEUCKR }
|
|
|
|
{ ISO-2022-JP csISO2022JP }
|
|
|
|
{ ISO-2022-JP-2 csISO2022JP2 }
|
|
|
|
{ JIS_C6220-1969-jp JIS_C6220-1969 iso-ir-13 katakana x0201-7
|
|
|
|
csISO13JISC6220jp }
|
|
|
|
{ JIS_C6220-1969-ro iso-ir-14 jp ISO646-JP csISO14JISC6220ro }
|
|
|
|
{ IT iso-ir-15 ISO646-IT csISO15Italian }
|
|
|
|
{ PT iso-ir-16 ISO646-PT csISO16Portuguese }
|
|
|
|
{ ES iso-ir-17 ISO646-ES csISO17Spanish }
|
|
|
|
{ greek7-old iso-ir-18 csISO18Greek7Old }
|
|
|
|
{ latin-greek iso-ir-19 csISO19LatinGreek }
|
|
|
|
{ DIN_66003 iso-ir-21 de ISO646-DE csISO21German }
|
|
|
|
{ NF_Z_62-010_(1973) iso-ir-25 ISO646-FR1 csISO25French }
|
|
|
|
{ Latin-greek-1 iso-ir-27 csISO27LatinGreek1 }
|
|
|
|
{ ISO_5427 iso-ir-37 csISO5427Cyrillic }
|
|
|
|
{ JIS_C6226-1978 iso-ir-42 csISO42JISC62261978 }
|
|
|
|
{ BS_viewdata iso-ir-47 csISO47BSViewdata }
|
|
|
|
{ INIS iso-ir-49 csISO49INIS }
|
|
|
|
{ INIS-8 iso-ir-50 csISO50INIS8 }
|
|
|
|
{ INIS-cyrillic iso-ir-51 csISO51INISCyrillic }
|
|
|
|
{ ISO_5427:1981 iso-ir-54 ISO5427Cyrillic1981 }
|
|
|
|
{ ISO_5428:1980 iso-ir-55 csISO5428Greek }
|
|
|
|
{ GB_1988-80 iso-ir-57 cn ISO646-CN csISO57GB1988 }
|
|
|
|
{ GB_2312-80 iso-ir-58 chinese csISO58GB231280 }
|
|
|
|
{ NS_4551-1 iso-ir-60 ISO646-NO no csISO60DanishNorwegian
|
|
|
|
csISO60Norwegian1 }
|
|
|
|
{ NS_4551-2 ISO646-NO2 iso-ir-61 no2 csISO61Norwegian2 }
|
|
|
|
{ NF_Z_62-010 iso-ir-69 ISO646-FR fr csISO69French }
|
|
|
|
{ videotex-suppl iso-ir-70 csISO70VideotexSupp1 }
|
|
|
|
{ PT2 iso-ir-84 ISO646-PT2 csISO84Portuguese2 }
|
|
|
|
{ ES2 iso-ir-85 ISO646-ES2 csISO85Spanish2 }
|
|
|
|
{ MSZ_7795.3 iso-ir-86 ISO646-HU hu csISO86Hungarian }
|
|
|
|
{ JIS_C6226-1983 iso-ir-87 x0208 JIS_X0208-1983 csISO87JISX0208 }
|
|
|
|
{ greek7 iso-ir-88 csISO88Greek7 }
|
|
|
|
{ ASMO_449 ISO_9036 arabic7 iso-ir-89 csISO89ASMO449 }
|
|
|
|
{ iso-ir-90 csISO90 }
|
|
|
|
{ JIS_C6229-1984-a iso-ir-91 jp-ocr-a csISO91JISC62291984a }
|
|
|
|
{ JIS_C6229-1984-b iso-ir-92 ISO646-JP-OCR-B jp-ocr-b
|
|
|
|
csISO92JISC62991984b }
|
|
|
|
{ JIS_C6229-1984-b-add iso-ir-93 jp-ocr-b-add csISO93JIS62291984badd }
|
|
|
|
{ JIS_C6229-1984-hand iso-ir-94 jp-ocr-hand csISO94JIS62291984hand }
|
|
|
|
{ JIS_C6229-1984-hand-add iso-ir-95 jp-ocr-hand-add
|
|
|
|
csISO95JIS62291984handadd }
|
|
|
|
{ JIS_C6229-1984-kana iso-ir-96 csISO96JISC62291984kana }
|
|
|
|
{ ISO_2033-1983 iso-ir-98 e13b csISO2033 }
|
|
|
|
{ ANSI_X3.110-1983 iso-ir-99 CSA_T500-1983 NAPLPS csISO99NAPLPS }
|
|
|
|
{ ISO_8859-1:1987 iso-ir-100 ISO_8859-1 ISO-8859-1 latin1 l1 IBM819
|
|
|
|
CP819 csISOLatin1 }
|
|
|
|
{ ISO_8859-2:1987 iso-ir-101 ISO_8859-2 ISO-8859-2 latin2 l2 csISOLatin2 }
|
|
|
|
{ T.61-7bit iso-ir-102 csISO102T617bit }
|
|
|
|
{ T.61-8bit T.61 iso-ir-103 csISO103T618bit }
|
|
|
|
{ ISO_8859-3:1988 iso-ir-109 ISO_8859-3 ISO-8859-3 latin3 l3 csISOLatin3 }
|
|
|
|
{ ISO_8859-4:1988 iso-ir-110 ISO_8859-4 ISO-8859-4 latin4 l4 csISOLatin4 }
|
|
|
|
{ ECMA-cyrillic iso-ir-111 KOI8-E csISO111ECMACyrillic }
|
|
|
|
{ CSA_Z243.4-1985-1 iso-ir-121 ISO646-CA csa7-1 ca csISO121Canadian1 }
|
|
|
|
{ CSA_Z243.4-1985-2 iso-ir-122 ISO646-CA2 csa7-2 csISO122Canadian2 }
|
|
|
|
{ CSA_Z243.4-1985-gr iso-ir-123 csISO123CSAZ24341985gr }
|
|
|
|
{ ISO_8859-6:1987 iso-ir-127 ISO_8859-6 ISO-8859-6 ECMA-114 ASMO-708
|
|
|
|
arabic csISOLatinArabic }
|
|
|
|
{ ISO_8859-6-E csISO88596E ISO-8859-6-E }
|
|
|
|
{ ISO_8859-6-I csISO88596I ISO-8859-6-I }
|
|
|
|
{ ISO_8859-7:1987 iso-ir-126 ISO_8859-7 ISO-8859-7 ELOT_928 ECMA-118
|
|
|
|
greek greek8 csISOLatinGreek }
|
|
|
|
{ T.101-G2 iso-ir-128 csISO128T101G2 }
|
|
|
|
{ ISO_8859-8:1988 iso-ir-138 ISO_8859-8 ISO-8859-8 hebrew
|
|
|
|
csISOLatinHebrew }
|
|
|
|
{ ISO_8859-8-E csISO88598E ISO-8859-8-E }
|
|
|
|
{ ISO_8859-8-I csISO88598I ISO-8859-8-I }
|
|
|
|
{ CSN_369103 iso-ir-139 csISO139CSN369103 }
|
|
|
|
{ JUS_I.B1.002 iso-ir-141 ISO646-YU js yu csISO141JUSIB1002 }
|
|
|
|
{ ISO_6937-2-add iso-ir-142 csISOTextComm }
|
|
|
|
{ IEC_P27-1 iso-ir-143 csISO143IECP271 }
|
|
|
|
{ ISO_8859-5:1988 iso-ir-144 ISO_8859-5 ISO-8859-5 cyrillic
|
|
|
|
csISOLatinCyrillic }
|
|
|
|
{ JUS_I.B1.003-serb iso-ir-146 serbian csISO146Serbian }
|
|
|
|
{ JUS_I.B1.003-mac macedonian iso-ir-147 csISO147Macedonian }
|
|
|
|
{ ISO_8859-9:1989 iso-ir-148 ISO_8859-9 ISO-8859-9 latin5 l5 csISOLatin5 }
|
|
|
|
{ greek-ccitt iso-ir-150 csISO150 csISO150GreekCCITT }
|
|
|
|
{ NC_NC00-10:81 cuba iso-ir-151 ISO646-CU csISO151Cuba }
|
|
|
|
{ ISO_6937-2-25 iso-ir-152 csISO6937Add }
|
|
|
|
{ GOST_19768-74 ST_SEV_358-88 iso-ir-153 csISO153GOST1976874 }
|
|
|
|
{ ISO_8859-supp iso-ir-154 latin1-2-5 csISO8859Supp }
|
|
|
|
{ ISO_10367-box iso-ir-155 csISO10367Box }
|
|
|
|
{ ISO-8859-10 iso-ir-157 l6 ISO_8859-10:1992 csISOLatin6 latin6 }
|
|
|
|
{ latin-lap lap iso-ir-158 csISO158Lap }
|
|
|
|
{ JIS_X0212-1990 x0212 iso-ir-159 csISO159JISX02121990 }
|
|
|
|
{ DS_2089 DS2089 ISO646-DK dk csISO646Danish }
|
|
|
|
{ us-dk csUSDK }
|
|
|
|
{ dk-us csDKUS }
|
|
|
|
{ JIS_X0201 X0201 csHalfWidthKatakana }
|
|
|
|
{ KSC5636 ISO646-KR csKSC5636 }
|
|
|
|
{ ISO-10646-UCS-2 csUnicode }
|
|
|
|
{ ISO-10646-UCS-4 csUCS4 }
|
|
|
|
{ DEC-MCS dec csDECMCS }
|
|
|
|
{ hp-roman8 roman8 r8 csHPRoman8 }
|
|
|
|
{ macintosh mac csMacintosh }
|
|
|
|
{ IBM037 cp037 ebcdic-cp-us ebcdic-cp-ca ebcdic-cp-wt ebcdic-cp-nl
|
|
|
|
csIBM037 }
|
|
|
|
{ IBM038 EBCDIC-INT cp038 csIBM038 }
|
|
|
|
{ IBM273 CP273 csIBM273 }
|
|
|
|
{ IBM274 EBCDIC-BE CP274 csIBM274 }
|
|
|
|
{ IBM275 EBCDIC-BR cp275 csIBM275 }
|
|
|
|
{ IBM277 EBCDIC-CP-DK EBCDIC-CP-NO csIBM277 }
|
|
|
|
{ IBM278 CP278 ebcdic-cp-fi ebcdic-cp-se csIBM278 }
|
|
|
|
{ IBM280 CP280 ebcdic-cp-it csIBM280 }
|
|
|
|
{ IBM281 EBCDIC-JP-E cp281 csIBM281 }
|
|
|
|
{ IBM284 CP284 ebcdic-cp-es csIBM284 }
|
|
|
|
{ IBM285 CP285 ebcdic-cp-gb csIBM285 }
|
|
|
|
{ IBM290 cp290 EBCDIC-JP-kana csIBM290 }
|
|
|
|
{ IBM297 cp297 ebcdic-cp-fr csIBM297 }
|
|
|
|
{ IBM420 cp420 ebcdic-cp-ar1 csIBM420 }
|
|
|
|
{ IBM423 cp423 ebcdic-cp-gr csIBM423 }
|
|
|
|
{ IBM424 cp424 ebcdic-cp-he csIBM424 }
|
|
|
|
{ IBM437 cp437 437 csPC8CodePage437 }
|
|
|
|
{ IBM500 CP500 ebcdic-cp-be ebcdic-cp-ch csIBM500 }
|
|
|
|
{ IBM775 cp775 csPC775Baltic }
|
|
|
|
{ IBM850 cp850 850 csPC850Multilingual }
|
|
|
|
{ IBM851 cp851 851 csIBM851 }
|
|
|
|
{ IBM852 cp852 852 csPCp852 }
|
|
|
|
{ IBM855 cp855 855 csIBM855 }
|
|
|
|
{ IBM857 cp857 857 csIBM857 }
|
|
|
|
{ IBM860 cp860 860 csIBM860 }
|
|
|
|
{ IBM861 cp861 861 cp-is csIBM861 }
|
|
|
|
{ IBM862 cp862 862 csPC862LatinHebrew }
|
|
|
|
{ IBM863 cp863 863 csIBM863 }
|
|
|
|
{ IBM864 cp864 csIBM864 }
|
|
|
|
{ IBM865 cp865 865 csIBM865 }
|
|
|
|
{ IBM866 cp866 866 csIBM866 }
|
|
|
|
{ IBM868 CP868 cp-ar csIBM868 }
|
|
|
|
{ IBM869 cp869 869 cp-gr csIBM869 }
|
|
|
|
{ IBM870 CP870 ebcdic-cp-roece ebcdic-cp-yu csIBM870 }
|
|
|
|
{ IBM871 CP871 ebcdic-cp-is csIBM871 }
|
|
|
|
{ IBM880 cp880 EBCDIC-Cyrillic csIBM880 }
|
|
|
|
{ IBM891 cp891 csIBM891 }
|
|
|
|
{ IBM903 cp903 csIBM903 }
|
|
|
|
{ IBM904 cp904 904 csIBBM904 }
|
|
|
|
{ IBM905 CP905 ebcdic-cp-tr csIBM905 }
|
|
|
|
{ IBM918 CP918 ebcdic-cp-ar2 csIBM918 }
|
|
|
|
{ IBM1026 CP1026 csIBM1026 }
|
|
|
|
{ EBCDIC-AT-DE csIBMEBCDICATDE }
|
|
|
|
{ EBCDIC-AT-DE-A csEBCDICATDEA }
|
|
|
|
{ EBCDIC-CA-FR csEBCDICCAFR }
|
|
|
|
{ EBCDIC-DK-NO csEBCDICDKNO }
|
|
|
|
{ EBCDIC-DK-NO-A csEBCDICDKNOA }
|
|
|
|
{ EBCDIC-FI-SE csEBCDICFISE }
|
|
|
|
{ EBCDIC-FI-SE-A csEBCDICFISEA }
|
|
|
|
{ EBCDIC-FR csEBCDICFR }
|
|
|
|
{ EBCDIC-IT csEBCDICIT }
|
|
|
|
{ EBCDIC-PT csEBCDICPT }
|
|
|
|
{ EBCDIC-ES csEBCDICES }
|
|
|
|
{ EBCDIC-ES-A csEBCDICESA }
|
|
|
|
{ EBCDIC-ES-S csEBCDICESS }
|
|
|
|
{ EBCDIC-UK csEBCDICUK }
|
|
|
|
{ EBCDIC-US csEBCDICUS }
|
|
|
|
{ UNKNOWN-8BIT csUnknown8BiT }
|
|
|
|
{ MNEMONIC csMnemonic }
|
|
|
|
{ MNEM csMnem }
|
|
|
|
{ VISCII csVISCII }
|
|
|
|
{ VIQR csVIQR }
|
|
|
|
{ KOI8-R csKOI8R }
|
|
|
|
{ IBM00858 CCSID00858 CP00858 PC-Multilingual-850+euro }
|
|
|
|
{ IBM00924 CCSID00924 CP00924 ebcdic-Latin9--euro }
|
|
|
|
{ IBM01140 CCSID01140 CP01140 ebcdic-us-37+euro }
|
|
|
|
{ IBM01141 CCSID01141 CP01141 ebcdic-de-273+euro }
|
|
|
|
{ IBM01142 CCSID01142 CP01142 ebcdic-dk-277+euro ebcdic-no-277+euro }
|
|
|
|
{ IBM01143 CCSID01143 CP01143 ebcdic-fi-278+euro ebcdic-se-278+euro }
|
|
|
|
{ IBM01144 CCSID01144 CP01144 ebcdic-it-280+euro }
|
|
|
|
{ IBM01145 CCSID01145 CP01145 ebcdic-es-284+euro }
|
|
|
|
{ IBM01146 CCSID01146 CP01146 ebcdic-gb-285+euro }
|
|
|
|
{ IBM01147 CCSID01147 CP01147 ebcdic-fr-297+euro }
|
|
|
|
{ IBM01148 CCSID01148 CP01148 ebcdic-international-500+euro }
|
|
|
|
{ IBM01149 CCSID01149 CP01149 ebcdic-is-871+euro }
|
|
|
|
{ IBM1047 IBM-1047 }
|
|
|
|
{ PTCP154 csPTCP154 PT154 CP154 Cyrillic-Asian }
|
|
|
|
{ Amiga-1251 Ami1251 Amiga1251 Ami-1251 }
|
|
|
|
{ UNICODE-1-1 csUnicode11 }
|
|
|
|
{ CESU-8 csCESU-8 }
|
|
|
|
{ BOCU-1 csBOCU-1 }
|
|
|
|
{ UNICODE-1-1-UTF-7 csUnicode11UTF7 }
|
|
|
|
{ ISO-8859-14 iso-ir-199 ISO_8859-14:1998 ISO_8859-14 latin8 iso-celtic
|
|
|
|
l8 }
|
|
|
|
{ ISO-8859-15 ISO_8859-15 Latin-9 }
|
|
|
|
{ ISO-8859-16 iso-ir-226 ISO_8859-16:2001 ISO_8859-16 latin10 l10 }
|
|
|
|
{ GBK CP936 MS936 windows-936 }
|
|
|
|
{ JIS_Encoding csJISEncoding }
|
|
|
|
{ Shift_JIS MS_Kanji csShiftJIS }
|
|
|
|
{ Extended_UNIX_Code_Packed_Format_for_Japanese csEUCPkdFmtJapanese
|
|
|
|
EUC-JP }
|
|
|
|
{ Extended_UNIX_Code_Fixed_Width_for_Japanese csEUCFixWidJapanese }
|
|
|
|
{ ISO-10646-UCS-Basic csUnicodeASCII }
|
|
|
|
{ ISO-10646-Unicode-Latin1 csUnicodeLatin1 ISO-10646 }
|
|
|
|
{ ISO-Unicode-IBM-1261 csUnicodeIBM1261 }
|
|
|
|
{ ISO-Unicode-IBM-1268 csUnicodeIBM1268 }
|
|
|
|
{ ISO-Unicode-IBM-1276 csUnicodeIBM1276 }
|
|
|
|
{ ISO-Unicode-IBM-1264 csUnicodeIBM1264 }
|
|
|
|
{ ISO-Unicode-IBM-1265 csUnicodeIBM1265 }
|
|
|
|
{ ISO-8859-1-Windows-3.0-Latin-1 csWindows30Latin1 }
|
|
|
|
{ ISO-8859-1-Windows-3.1-Latin-1 csWindows31Latin1 }
|
|
|
|
{ ISO-8859-2-Windows-Latin-2 csWindows31Latin2 }
|
|
|
|
{ ISO-8859-9-Windows-Latin-5 csWindows31Latin5 }
|
|
|
|
{ Adobe-Standard-Encoding csAdobeStandardEncoding }
|
|
|
|
{ Ventura-US csVenturaUS }
|
|
|
|
{ Ventura-International csVenturaInternational }
|
|
|
|
{ PC8-Danish-Norwegian csPC8DanishNorwegian }
|
|
|
|
{ PC8-Turkish csPC8Turkish }
|
|
|
|
{ IBM-Symbols csIBMSymbols }
|
|
|
|
{ IBM-Thai csIBMThai }
|
|
|
|
{ HP-Legal csHPLegal }
|
|
|
|
{ HP-Pi-font csHPPiFont }
|
|
|
|
{ HP-Math8 csHPMath8 }
|
|
|
|
{ Adobe-Symbol-Encoding csHPPSMath }
|
|
|
|
{ HP-DeskTop csHPDesktop }
|
|
|
|
{ Ventura-Math csVenturaMath }
|
|
|
|
{ Microsoft-Publishing csMicrosoftPublishing }
|
|
|
|
{ Windows-31J csWindows31J }
|
|
|
|
{ GB2312 csGB2312 }
|
|
|
|
{ Big5 csBig5 }
|
|
|
|
}
|
|
|
|
|
|
|
|
proc tcl_encoding {enc} {
|
|
|
|
global encoding_aliases
|
|
|
|
set names [encoding names]
|
|
|
|
set lcnames [string tolower $names]
|
|
|
|
set enc [string tolower $enc]
|
|
|
|
set i [lsearch -exact $lcnames $enc]
|
|
|
|
if {$i < 0} {
|
|
|
|
# look for "isonnn" instead of "iso-nnn" or "iso_nnn"
|
|
|
|
if {[regsub {^iso[-_]} $enc iso encx]} {
|
|
|
|
set i [lsearch -exact $lcnames $encx]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$i < 0} {
|
|
|
|
foreach l $encoding_aliases {
|
|
|
|
set ll [string tolower $l]
|
|
|
|
if {[lsearch -exact $ll $enc] < 0} continue
|
|
|
|
# look through the aliases for one that tcl knows about
|
|
|
|
foreach e $ll {
|
|
|
|
set i [lsearch -exact $lcnames $e]
|
|
|
|
if {$i < 0} {
|
|
|
|
if {[regsub {^iso[-_]} $e iso ex]} {
|
|
|
|
set i [lsearch -exact $lcnames $ex]
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$i >= 0} break
|
|
|
|
}
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if {$i >= 0} {
|
|
|
|
return [lindex $names $i]
|
|
|
|
}
|
|
|
|
return {}
|
|
|
|
}
|
|
|
|
|
2007-10-20 11:21:03 +00:00
|
|
|
# First check that Tcl/Tk is recent enough
|
|
|
|
if {[catch {package require Tk 8.4} err]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_error {} . [mc "Sorry, gitk cannot run with this version of Tcl/Tk.\n\
|
|
|
|
Gitk requires at least Tcl/Tk 8.4."]
|
2007-10-20 11:21:03 +00:00
|
|
|
exit 1
|
|
|
|
}
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
# defaults...
|
2006-05-24 07:57:40 +00:00
|
|
|
set wrcomcmd "git diff-tree --stdin -p --pretty"
|
2005-11-28 00:12:51 +00:00
|
|
|
|
2005-12-07 12:28:22 +00:00
|
|
|
set gitencoding {}
|
2005-11-28 00:12:51 +00:00
|
|
|
catch {
|
2007-02-14 21:54:34 +00:00
|
|
|
set gitencoding [exec git config --get i18n.commitencoding]
|
2005-11-28 00:12:51 +00:00
|
|
|
}
|
|
|
|
if {$gitencoding == ""} {
|
2005-12-07 12:28:22 +00:00
|
|
|
set gitencoding "utf-8"
|
|
|
|
}
|
|
|
|
set tclencoding [tcl_encoding $gitencoding]
|
|
|
|
if {$tclencoding == {}} {
|
|
|
|
puts stderr "Warning: encoding $gitencoding is not supported by Tcl/Tk"
|
2005-11-28 00:12:51 +00:00
|
|
|
}
|
2005-05-09 04:08:39 +00:00
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
set mainfont {Helvetica 9}
|
|
|
|
set textfont {Courier 9}
|
2006-04-04 07:19:45 +00:00
|
|
|
set uifont {Helvetica 9 bold}
|
2007-05-20 15:45:50 +00:00
|
|
|
set tabstop 8
|
2005-07-16 11:46:13 +00:00
|
|
|
set findmergefiles 0
|
2005-08-04 23:52:16 +00:00
|
|
|
set maxgraphpct 50
|
2005-08-17 23:30:10 +00:00
|
|
|
set maxwidth 16
|
2005-11-14 23:34:03 +00:00
|
|
|
set revlistorder 0
|
2005-11-20 22:56:07 +00:00
|
|
|
set fastdate 0
|
2007-07-31 11:03:06 +00:00
|
|
|
set uparrowlen 5
|
|
|
|
set downarrowlen 5
|
|
|
|
set mingaplen 100
|
2006-04-30 23:50:57 +00:00
|
|
|
set cmitmode "patch"
|
2006-05-15 15:13:14 +00:00
|
|
|
set wrapcomment "none"
|
2006-06-03 09:11:13 +00:00
|
|
|
set showneartags 1
|
2007-06-16 11:21:57 +00:00
|
|
|
set maxrefs 20
|
2006-10-15 08:03:46 +00:00
|
|
|
set maxlinelen 200
|
2006-09-07 00:21:39 +00:00
|
|
|
set showlocalchanges 1
|
2007-10-23 00:15:11 +00:00
|
|
|
set limitdiffs 1
|
2007-08-14 20:02:04 +00:00
|
|
|
set datetimeformat "%Y-%m-%d %H:%M:%S"
|
2008-03-06 11:49:25 +00:00
|
|
|
set autoselect 1
|
2005-05-15 12:55:47 +00:00
|
|
|
|
2008-03-24 11:55:36 +00:00
|
|
|
set extdifftool "meld"
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
set colors {green red blue magenta darkgrey brown orange}
|
2006-07-05 12:56:37 +00:00
|
|
|
set bgcolor white
|
|
|
|
set fgcolor black
|
|
|
|
set diffcolors {red "#00a000" blue}
|
2007-08-12 10:05:46 +00:00
|
|
|
set diffcontext 3
|
2008-01-17 22:42:55 +00:00
|
|
|
set ignorespace 0
|
2007-05-20 16:12:48 +00:00
|
|
|
set selectbgcolor gray85
|
2005-05-15 12:55:47 +00:00
|
|
|
|
2008-05-26 00:11:33 +00:00
|
|
|
set circlecolors {white blue gray blue blue}
|
|
|
|
|
2007-11-07 17:40:59 +00:00
|
|
|
## For msgcat loading, first locate the installation location.
|
|
|
|
if { [info exists ::env(GITK_MSGSDIR)] } {
|
|
|
|
## Msgsdir was manually set in the environment.
|
|
|
|
set gitk_msgsdir $::env(GITK_MSGSDIR)
|
|
|
|
} else {
|
|
|
|
## Let's guess the prefix from argv0.
|
|
|
|
set gitk_prefix [file dirname [file dirname [file normalize $argv0]]]
|
|
|
|
set gitk_libdir [file join $gitk_prefix share gitk lib]
|
|
|
|
set gitk_msgsdir [file join $gitk_libdir msgs]
|
|
|
|
unset gitk_prefix
|
|
|
|
}
|
|
|
|
|
|
|
|
## Internationalization (i18n) through msgcat and gettext. See
|
|
|
|
## http://www.gnu.org/software/gettext/manual/html_node/Tcl.html
|
|
|
|
package require msgcat
|
|
|
|
namespace import ::msgcat::mc
|
|
|
|
## And eventually load the actual message catalog
|
|
|
|
::msgcat::mcload $gitk_msgsdir
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
catch {source ~/.gitk}
|
|
|
|
|
2005-11-29 22:28:16 +00:00
|
|
|
font create optionfont -family sans-serif -size -12
|
2005-05-18 22:51:00 +00:00
|
|
|
|
2007-10-06 08:27:37 +00:00
|
|
|
parsefont mainfont $mainfont
|
|
|
|
eval font create mainfont [fontflags mainfont]
|
|
|
|
eval font create mainfontbold [fontflags mainfont 1]
|
|
|
|
|
|
|
|
parsefont textfont $textfont
|
|
|
|
eval font create textfont [fontflags textfont]
|
|
|
|
eval font create textfontbold [fontflags textfont 1]
|
|
|
|
|
|
|
|
parsefont uifont $uifont
|
|
|
|
eval font create uifont [fontflags uifont]
|
2005-05-18 22:51:00 +00:00
|
|
|
|
2008-01-06 04:54:46 +00:00
|
|
|
setoptions
|
|
|
|
|
2007-07-12 12:29:49 +00:00
|
|
|
# check that we can find a .git directory somewhere...
|
2007-07-29 20:29:45 +00:00
|
|
|
if {[catch {set gitdir [gitdir]}]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_error {} . [mc "Cannot find a git repository here."]
|
2007-07-29 20:29:45 +00:00
|
|
|
exit 1
|
|
|
|
}
|
2007-07-12 12:29:49 +00:00
|
|
|
if {![file isdirectory $gitdir]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_error {} . [mc "Cannot find the git directory \"%s\"." $gitdir]
|
2007-07-12 12:29:49 +00:00
|
|
|
exit 1
|
|
|
|
}
|
|
|
|
|
2005-05-15 12:55:47 +00:00
|
|
|
set revtreeargs {}
|
2007-07-12 12:29:49 +00:00
|
|
|
set cmdline_files {}
|
|
|
|
set i 0
|
2008-02-21 20:23:31 +00:00
|
|
|
set revtreeargscmd {}
|
2005-05-15 12:55:47 +00:00
|
|
|
foreach arg $argv {
|
2008-02-21 20:23:31 +00:00
|
|
|
switch -glob -- $arg {
|
2007-07-13 03:45:55 +00:00
|
|
|
"" { }
|
2007-07-12 12:29:49 +00:00
|
|
|
"--" {
|
|
|
|
set cmdline_files [lrange $argv [expr {$i + 1}] end]
|
|
|
|
break
|
|
|
|
}
|
2008-02-21 20:23:31 +00:00
|
|
|
"--argscmd=*" {
|
|
|
|
set revtreeargscmd [string range $arg 10 end]
|
|
|
|
}
|
2005-05-15 12:55:47 +00:00
|
|
|
default {
|
|
|
|
lappend revtreeargs $arg
|
|
|
|
}
|
|
|
|
}
|
2007-07-12 12:29:49 +00:00
|
|
|
incr i
|
2005-05-09 04:08:39 +00:00
|
|
|
}
|
2005-05-15 12:55:47 +00:00
|
|
|
|
2007-07-12 12:29:49 +00:00
|
|
|
if {$i >= [llength $argv] && $revtreeargs ne {}} {
|
2008-04-26 06:00:00 +00:00
|
|
|
# no -- on command line, but some arguments (other than --argscmd)
|
2006-05-02 23:32:53 +00:00
|
|
|
if {[catch {
|
2006-05-24 07:57:40 +00:00
|
|
|
set f [eval exec git rev-parse --no-revs --no-flags $revtreeargs]
|
2006-05-02 23:32:53 +00:00
|
|
|
set cmdline_files [split $f "\n"]
|
|
|
|
set n [llength $cmdline_files]
|
|
|
|
set revtreeargs [lrange $revtreeargs 0 end-$n]
|
2007-07-12 12:29:49 +00:00
|
|
|
# Unfortunately git rev-parse doesn't produce an error when
|
|
|
|
# something is both a revision and a filename. To be consistent
|
|
|
|
# with git log and git rev-list, check revtreeargs for filenames.
|
|
|
|
foreach arg $revtreeargs {
|
|
|
|
if {[file exists $arg]} {
|
2007-11-07 17:42:55 +00:00
|
|
|
show_error {} . [mc "Ambiguous argument '%s': both revision\
|
|
|
|
and filename" $arg]
|
2007-07-12 12:29:49 +00:00
|
|
|
exit 1
|
|
|
|
}
|
|
|
|
}
|
2006-05-02 23:32:53 +00:00
|
|
|
} err]} {
|
|
|
|
# unfortunately we get both stdout and stderr in $err,
|
|
|
|
# so look for "fatal:".
|
|
|
|
set i [string first "fatal:" $err]
|
|
|
|
if {$i > 0} {
|
2006-05-26 07:07:15 +00:00
|
|
|
set err [string range $err [expr {$i + 6}] end]
|
2006-05-02 23:32:53 +00:00
|
|
|
}
|
2007-11-07 17:42:55 +00:00
|
|
|
show_error {} . "[mc "Bad arguments to gitk:"]\n$err"
|
2006-05-02 23:32:53 +00:00
|
|
|
exit 1
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-09-07 00:21:39 +00:00
|
|
|
set nullid "0000000000000000000000000000000000000000"
|
2007-07-13 09:49:37 +00:00
|
|
|
set nullid2 "0000000000000000000000000000000000000001"
|
2008-03-24 11:55:36 +00:00
|
|
|
set nullfile "/dev/null"
|
2007-07-13 09:49:37 +00:00
|
|
|
|
2007-09-28 11:27:39 +00:00
|
|
|
set have_tk85 [expr {[package vcompare $tk_version "8.5"] >= 0}]
|
2006-09-07 00:21:39 +00:00
|
|
|
|
2007-06-17 04:45:00 +00:00
|
|
|
set runq {}
|
2005-08-06 12:06:06 +00:00
|
|
|
set history {}
|
|
|
|
set historyindex 0
|
2006-05-19 23:38:11 +00:00
|
|
|
set fh_serial 0
|
|
|
|
set nhl_names {}
|
2006-05-20 11:31:52 +00:00
|
|
|
set highlight_paths {}
|
2007-09-22 02:49:33 +00:00
|
|
|
set findpattern {}
|
2006-05-25 11:25:13 +00:00
|
|
|
set searchdirn -forwards
|
2006-05-30 11:33:07 +00:00
|
|
|
set boldrows {}
|
|
|
|
set boldnamerows {}
|
2007-04-19 01:39:12 +00:00
|
|
|
set diffelide {0 0}
|
2007-07-04 09:43:51 +00:00
|
|
|
set markingmatches 0
|
2007-08-23 12:24:38 +00:00
|
|
|
set linkentercount 0
|
2007-08-29 11:45:21 +00:00
|
|
|
set need_redisplay 0
|
|
|
|
set nrows_drawn 0
|
2007-09-28 11:27:39 +00:00
|
|
|
set firsttabstop 0
|
2006-02-19 11:44:47 +00:00
|
|
|
|
2006-04-04 00:16:22 +00:00
|
|
|
set nextviewnum 1
|
|
|
|
set curview 0
|
2006-04-25 07:12:46 +00:00
|
|
|
set selectedview 0
|
2007-11-07 17:44:35 +00:00
|
|
|
set selectedhlview [mc "None"]
|
|
|
|
set highlight_related [mc "None"]
|
2007-09-22 02:49:33 +00:00
|
|
|
set highlight_files {}
|
2006-04-04 00:16:22 +00:00
|
|
|
set viewfiles(0) {}
|
2006-04-25 07:12:46 +00:00
|
|
|
set viewperm(0) 0
|
2006-05-02 23:32:53 +00:00
|
|
|
set viewargs(0) {}
|
2008-02-21 20:23:31 +00:00
|
|
|
set viewargscmd(0) {}
|
2006-04-04 00:16:22 +00:00
|
|
|
|
2008-05-20 10:51:06 +00:00
|
|
|
set selectedline {}
|
2008-05-11 12:13:02 +00:00
|
|
|
set numcommits 0
|
gitk: Use git log without --topo-order and reorganize the commits ourselves
This very large patch implements code to organize the commits from
git log into "arcs" (sequences of commits where each pair of adjacent
commits are the only parent and child of each other), and orders the
arcs so as to get a topological ordering of the commits. This means
we can use git log without --topo-order and display the commits as we
get them, incrementally, which makes the cold-cache start up time much
faster, particularly on unpacked repos.
One beneficial effect of this is that the File->Update menu item now
just adds any new commits to the existing graph instead of rereading
the whole thing from scratch, which is much faster. (If you do want
to reread the whole graph from scratch you can use File->Reload.)
At an implementation level, this means that the displayorder and
parentlist lists are no longer fully valid at all times, and the
commitrow array has gone. New procedures commitinview and commitonrow
replace the commitrow array, and make_disporder ensures that
displayorder and parentlist are valid for a range of rows.
The overall time to load the kernel repository has gone up a bit, from
~9 seconds to ~11 seconds on my G5, but I think that is worth it given
that the time to get a window up with commits displayed in it has gone
from ~3 seconds to under 1 second.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-12-02 23:33:01 +00:00
|
|
|
set loginstance 0
|
2006-05-02 23:32:53 +00:00
|
|
|
set cmdlineok 0
|
2005-05-15 12:55:47 +00:00
|
|
|
set stopped 0
|
2005-05-16 23:54:58 +00:00
|
|
|
set stuffsaved 0
|
2005-06-27 09:27:32 +00:00
|
|
|
set patchnum 0
|
2006-09-07 00:21:39 +00:00
|
|
|
set lserial 0
|
2008-03-10 10:54:56 +00:00
|
|
|
set isworktree [expr {[exec git rev-parse --is-inside-work-tree] == "true"}]
|
2005-05-15 12:55:47 +00:00
|
|
|
setcoords
|
2006-04-06 00:18:23 +00:00
|
|
|
makewindow
|
2007-07-23 11:35:03 +00:00
|
|
|
# wait for the window to become visible
|
|
|
|
tkwait visibility .
|
2006-12-10 20:31:46 +00:00
|
|
|
wm title . "[file tail $argv0]: [file tail [pwd]]"
|
2005-05-21 07:35:37 +00:00
|
|
|
readrefs
|
2006-04-23 12:45:55 +00:00
|
|
|
|
2008-02-21 20:23:31 +00:00
|
|
|
if {$cmdline_files ne {} || $revtreeargs ne {} || $revtreeargscmd ne {}} {
|
2006-04-04 00:16:22 +00:00
|
|
|
# create a view for the files/dirs specified on the command line
|
|
|
|
set curview 1
|
2006-04-25 07:12:46 +00:00
|
|
|
set selectedview 1
|
2006-04-04 00:16:22 +00:00
|
|
|
set nextviewnum 2
|
2007-11-07 17:42:55 +00:00
|
|
|
set viewname(1) [mc "Command line"]
|
2006-04-04 00:16:22 +00:00
|
|
|
set viewfiles(1) $cmdline_files
|
2006-05-02 23:32:53 +00:00
|
|
|
set viewargs(1) $revtreeargs
|
2008-02-21 20:23:31 +00:00
|
|
|
set viewargscmd(1) $revtreeargscmd
|
2006-04-25 07:12:46 +00:00
|
|
|
set viewperm(1) 0
|
2008-04-26 06:00:00 +00:00
|
|
|
set vdatemode(1) 0
|
2006-05-02 01:15:29 +00:00
|
|
|
addviewmenu 1
|
2007-11-07 17:42:55 +00:00
|
|
|
.bar.view entryconf [mc "Edit view..."] -state normal
|
|
|
|
.bar.view entryconf [mc "Delete view"] -state normal
|
2006-04-04 00:16:22 +00:00
|
|
|
}
|
2006-04-25 07:12:46 +00:00
|
|
|
|
|
|
|
if {[info exists permviews]} {
|
|
|
|
foreach v $permviews {
|
|
|
|
set n $nextviewnum
|
|
|
|
incr nextviewnum
|
|
|
|
set viewname($n) [lindex $v 0]
|
|
|
|
set viewfiles($n) [lindex $v 1]
|
2006-05-02 23:32:53 +00:00
|
|
|
set viewargs($n) [lindex $v 2]
|
2008-02-21 20:23:31 +00:00
|
|
|
set viewargscmd($n) [lindex $v 3]
|
2006-04-25 07:12:46 +00:00
|
|
|
set viewperm($n) 1
|
2006-05-02 01:15:29 +00:00
|
|
|
addviewmenu $n
|
2006-04-25 07:12:46 +00:00
|
|
|
}
|
|
|
|
}
|
2006-04-23 12:45:55 +00:00
|
|
|
getcommits
|