← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/missing.py

  • Committer: Canonical.com Patch Queue Manager
  • Date: 2007-01-25 05:18:17 UTC
  • mfrom: (2241.1.3 repoformats)
  • Revision ID: pqm@pqm.ubuntu.com-20070125051817-53a80525dbdf87b4
(mbp) Change RepositoryFormat to use a registry (r=john)

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/missing.py
1
 
"""\
2
 
A plugin for displaying what revisions are in 'other' but not in local.
3
 
"""
4
 
 
5
 
def show_missing(br_local, br_remote, verbose=False, quiet=False):
6
 
    """Show the revisions which exist in br_remote, that 
7
 
    do not exist in br_local.
8
 
    """
9
 
    from bzrlib.log import show_one_log
10
 
    import sys
11
 
    local_history = br_local.revision_history()
12
 
    remote_history = br_remote.revision_history()
13
 
    if local_history == remote_history:
14
 
        if not quiet:
15
 
            print 'Trees are identical.'
16
 
        return 0
17
 
    if local_history[:len(remote_history)] == remote_history:
18
 
        # Local is not missing anything from remote, so consider it
19
 
        # up-to-date
20
 
        if not quiet:
21
 
            print 'Local tree has all of remote revisions (remote is missing local)'
22
 
        return 0
23
 
    if quiet:
24
 
        return 1
25
 
 
26
 
    # Check for divergence
27
 
    common_idx = min(len(local_history), len(remote_history)) - 1
28
 
    if common_idx >= 0 and local_history[common_idx] != remote_history[common_idx]:
29
 
        print 'Trees have diverged'
30
 
 
31
 
    local_rev_set = set(local_history)
32
 
 
33
 
    # Find the last common revision between the two trees
34
 
    revno = 0
35
 
    for revno, (local_rev, remote_rev) in enumerate(zip(local_history, remote_history)):
36
 
        if local_rev != remote_rev:
37
 
            break
38
 
 
39
 
    missing_remote = []
40
 
    for rno, rev_id in enumerate(remote_history[revno:]):
41
 
        # This assumes that you can have a revision in the
42
 
        # local history, which does not have the same ancestry
43
 
        # as the remote ancestry.
44
 
        # This may or may not be possible.
45
 
        # In the future this should also checked for merged revisions.
46
 
        if rev_id not in local_rev_set:
47
 
            missing_remote.append((rno+revno+1, rev_id))
48
 
 
49
 
    print 'Missing %d revisions' %  len(missing_remote)
50
 
    print
51
 
 
52
 
    if verbose:
53
 
        from bzrlib.diff import compare_trees
54
 
        from bzrlib.tree import EmptyTree
55
 
        show_ids = True
56
 
        last_tree = EmptyTree
57
 
        last_rev_id = None
58
 
    else:
59
 
        show_ids = False
60
 
    for revno, rev_id in missing_remote:
61
 
        rev = br_remote.get_revision(rev_id)
 
1
# Copyright (C) 2005, 2006 Canonical Ltd
 
2
#
 
3
# This program is free software; you can redistribute it and/or modify
 
4
# it under the terms of the GNU General Public License as published by
 
5
# the Free Software Foundation; either version 2 of the License, or
 
6
# (at your option) any later version.
 
7
#
 
8
# This program is distributed in the hope that it will be useful,
 
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
 
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 
11
# GNU General Public License for more details.
 
12
#
 
13
# You should have received a copy of the GNU General Public License
 
14
# along with this program; if not, write to the Free Software
 
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 
16
 
 
17
"""Display what revisions are missing in 'other' from 'this' and vice versa."""
 
18
 
 
19
import bzrlib.ui as ui
 
20
 
 
21
 
 
22
def iter_log_data(revisions, revision_source, verbose):
 
23
    last_tree = revision_source.revision_tree(None)
 
24
    last_rev_id = None
 
25
    for revno, rev_id in revisions:
 
26
        rev = revision_source.get_revision(rev_id)
62
27
        if verbose:
63
 
            parent_rev_id = rev.parents[0].revision_id
 
28
            remote_tree = revision_source.revision_tree(rev_id)
 
29
            parent_rev_id = rev.parent_ids[0]
64
30
            if last_rev_id == parent_rev_id:
65
31
                parent_tree = last_tree
66
32
            else:
67
 
                parent_tree = br_remote.revision_tree(parent_rev_id)
68
 
            revision_tree = br_remote.revision_tree(rev_id)
 
33
                parent_tree = revision_source.revision_tree(parent_rev_id)
 
34
            revision_tree = revision_source.revision_tree(rev_id)
69
35
            last_rev_id = rev_id
70
36
            last_tree = revision_tree
71
 
            delta = compare_trees(revision_tree, parent_tree)
 
37
            delta = revision_tree.changes_from(parent_tree)
72
38
        else:
73
39
            delta = None
74
 
 
75
 
        show_one_log(revno, rev, delta, verbose, sys.stdout, 'original')
76
 
    return 1
77
 
 
 
40
        yield revno, rev, delta
 
41
 
 
42
 
 
43
def find_unmerged(local_branch, remote_branch):
 
44
    progress = ui.ui_factory.nested_progress_bar()
 
45
    local_branch.lock_read()
 
46
    try:
 
47
        remote_branch.lock_read()
 
48
        try:
 
49
            local_rev_history, local_rev_history_map = \
 
50
                _get_history(local_branch, progress, "local", 0)
 
51
            remote_rev_history, remote_rev_history_map = \
 
52
                _get_history(remote_branch, progress, "remote", 1)
 
53
            result = _shortcut(local_rev_history, remote_rev_history)
 
54
            if result is not None:
 
55
                local_extra, remote_extra = result
 
56
                local_extra = sorted_revisions(local_extra, 
 
57
                                               local_rev_history_map)
 
58
                remote_extra = sorted_revisions(remote_extra, 
 
59
                                                remote_rev_history_map)
 
60
                return local_extra, remote_extra
 
61
 
 
62
            local_ancestry = _get_ancestry(local_branch.repository, progress, 
 
63
                                           "local", 2, local_rev_history)
 
64
            remote_ancestry = _get_ancestry(remote_branch.repository, progress,
 
65
                                            "remote", 3, remote_rev_history)
 
66
            progress.update('pondering', 4, 5)
 
67
            extras = local_ancestry.symmetric_difference(remote_ancestry) 
 
68
            local_extra = extras.intersection(set(local_rev_history))
 
69
            remote_extra = extras.intersection(set(remote_rev_history))
 
70
            local_extra = sorted_revisions(local_extra, local_rev_history_map)
 
71
            remote_extra = sorted_revisions(remote_extra, 
 
72
                                            remote_rev_history_map)
 
73
                    
 
74
        finally:
 
75
            remote_branch.unlock()
 
76
    finally:
 
77
        local_branch.unlock()
 
78
        progress.finished()
 
79
    return (local_extra, remote_extra)
 
80
 
 
81
def _shortcut(local_rev_history, remote_rev_history):
 
82
    local_history = set(local_rev_history)
 
83
    remote_history = set(remote_rev_history)
 
84
    if len(local_rev_history) == 0:
 
85
        return set(), remote_history
 
86
    elif len(remote_rev_history) == 0:
 
87
        return local_history, set()
 
88
    elif local_rev_history[-1] in remote_history:
 
89
        return set(), _after(remote_rev_history, local_rev_history)
 
90
    elif remote_rev_history[-1] in local_history:
 
91
        return _after(local_rev_history, remote_rev_history), set()
 
92
    else:
 
93
        return None
 
94
 
 
95
def _after(larger_history, smaller_history):
 
96
    return set(larger_history[larger_history.index(smaller_history[-1])+1:])
 
97
 
 
98
def _get_history(branch, progress, label, step):
 
99
    progress.update('%s history' % label, step, 5)
 
100
    rev_history = branch.revision_history()
 
101
    rev_history_map = dict(
 
102
        [(rev, rev_history.index(rev) + 1)
 
103
         for rev in rev_history])
 
104
    return rev_history, rev_history_map
 
105
 
 
106
def _get_ancestry(repository, progress, label, step, rev_history):
 
107
    progress.update('%s ancestry' % label, step, 5)
 
108
    if len(rev_history) > 0:
 
109
        ancestry = set(repository.get_ancestry(rev_history[-1]))
 
110
    else:
 
111
        ancestry = set()
 
112
    return ancestry
 
113
    
 
114
 
 
115
def sorted_revisions(revisions, history_map):
 
116
    revisions = [(history_map[r],r) for r in revisions]
 
117
    revisions.sort()
 
118
    return revisions