~bzr-pqm/bzr/bzr.dev

1658.1.9 by Martin Pool
Give an error for bzr diff on an nonexistent file (Malone #3619)
1
# Copyright (C) 2005, 2006 Canonical
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
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
1399.1.3 by Robert Collins
move change detection for text and metadata from delta to entry.detect_changes
17
from bzrlib.inventory import InventoryEntry
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
18
from bzrlib.trace import mutter
19
1732.1.29 by John Arbash Meinel
Update documentation and TODO for compare_trees
20
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
21
class TreeDelta(object):
22
    """Describes changes from one tree to another.
23
24
    Contains four lists:
25
26
    added
27
        (path, id, kind)
28
    removed
29
        (path, id, kind)
30
    renamed
1398 by Robert Collins
integrate in Gustavos x-bit patch
31
        (oldpath, newpath, id, kind, text_modified, meta_modified)
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
32
    modified
1398 by Robert Collins
integrate in Gustavos x-bit patch
33
        (path, id, kind, text_modified, meta_modified)
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
34
    unchanged
35
        (path, id, kind)
36
37
    Each id is listed only once.
38
39
    Files that are both modified and renamed are listed only in
1092.2.6 by Robert Collins
symlink support updated to work
40
    renamed, with the text_modified flag true. The text_modified
41
    applies either to the the content of the file or the target of the
42
    symbolic link, depending of the kind of file.
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
43
44
    Files are only considered renamed if their name has changed or
45
    their parent directory has changed.  Renaming a directory
46
    does not count as renaming all its contents.
47
48
    The lists are normally sorted when the delta is created.
49
    """
50
    def __init__(self):
51
        self.added = []
52
        self.removed = []
53
        self.renamed = []
54
        self.modified = []
55
        self.unchanged = []
56
57
    def __eq__(self, other):
58
        if not isinstance(other, TreeDelta):
59
            return False
60
        return self.added == other.added \
61
               and self.removed == other.removed \
62
               and self.renamed == other.renamed \
63
               and self.modified == other.modified \
64
               and self.unchanged == other.unchanged
65
66
    def __ne__(self, other):
67
        return not (self == other)
68
69
    def __repr__(self):
70
        return "TreeDelta(added=%r, removed=%r, renamed=%r, modified=%r," \
71
            " unchanged=%r)" % (self.added, self.removed, self.renamed,
72
            self.modified, self.unchanged)
73
74
    def has_changed(self):
1189 by Martin Pool
- BROKEN: partial support for commit into weave
75
        return bool(self.modified
76
                    or self.added
77
                    or self.removed
78
                    or self.renamed)
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
79
80
    def touches_file_id(self, file_id):
81
        """Return True if file_id is modified by this delta."""
82
        for l in self.added, self.removed, self.modified:
83
            for v in l:
84
                if v[1] == file_id:
85
                    return True
86
        for v in self.renamed:
87
            if v[2] == file_id:
88
                return True
89
        return False
90
            
91
92
    def show(self, to_file, show_ids=False, show_unchanged=False):
93
        def show_list(files):
1398 by Robert Collins
integrate in Gustavos x-bit patch
94
            for item in files:
95
                path, fid, kind = item[:3]
96
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
97
                if kind == 'directory':
98
                    path += '/'
99
                elif kind == 'symlink':
100
                    path += '@'
1398 by Robert Collins
integrate in Gustavos x-bit patch
101
102
                if len(item) == 5 and item[4]:
103
                    path += '*'
104
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
105
                if show_ids:
106
                    print >>to_file, '  %-30s %s' % (path, fid)
107
                else:
108
                    print >>to_file, ' ', path
109
            
110
        if self.removed:
111
            print >>to_file, 'removed:'
112
            show_list(self.removed)
113
                
114
        if self.added:
115
            print >>to_file, 'added:'
116
            show_list(self.added)
117
1185.36.2 by Daniel Silverstone
Allow the delta display routine to show when a file
118
        extra_modified = []
119
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
120
        if self.renamed:
121
            print >>to_file, 'renamed:'
1398 by Robert Collins
integrate in Gustavos x-bit patch
122
            for (oldpath, newpath, fid, kind,
123
                 text_modified, meta_modified) in self.renamed:
1185.36.2 by Daniel Silverstone
Allow the delta display routine to show when a file
124
                if text_modified or meta_modified:
125
                    extra_modified.append((newpath, fid, kind,
126
                                           text_modified, meta_modified))
1398 by Robert Collins
integrate in Gustavos x-bit patch
127
                if meta_modified:
128
                    newpath += '*'
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
129
                if show_ids:
130
                    print >>to_file, '  %s => %s %s' % (oldpath, newpath, fid)
131
                else:
132
                    print >>to_file, '  %s => %s' % (oldpath, newpath)
133
                    
1185.36.2 by Daniel Silverstone
Allow the delta display routine to show when a file
134
        if self.modified or extra_modified:
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
135
            print >>to_file, 'modified:'
136
            show_list(self.modified)
1185.36.2 by Daniel Silverstone
Allow the delta display routine to show when a file
137
            show_list(extra_modified)
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
138
            
139
        if show_unchanged and self.unchanged:
140
            print >>to_file, 'unchanged:'
141
            show_list(self.unchanged)
142
143
144
145
def compare_trees(old_tree, new_tree, want_unchanged=False, specific_files=None):
146
    """Describe changes from one tree to another.
147
148
    Returns a TreeDelta with details of added, modified, renamed, and
149
    deleted entries.
150
151
    The root entry is specifically exempt.
152
153
    This only considers versioned files.
154
155
    want_unchanged
156
        If true, also list files unchanged from one version to
157
        the next.
158
159
    specific_files
160
        If true, only check for changes to specified names or
1658.1.9 by Martin Pool
Give an error for bzr diff on an nonexistent file (Malone #3619)
161
        files within them.  Any unversioned files given have no effect
162
        (but this might change in the future).
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
163
    """
1662.1.9 by Martin Pool
Give a clear error for bzr status of an unversioned, nonexistent file. (Malone #3619)
164
    # NB: show_status depends on being able to pass in non-versioned files and
165
    # report them as unknown
1543.1.1 by Denys Duchier
lock operations for trees - use them for diff
166
    old_tree.lock_read()
167
    try:
168
        new_tree.lock_read()
169
        try:
170
            return _compare_trees(old_tree, new_tree, want_unchanged,
171
                                  specific_files)
172
        finally:
173
            new_tree.unlock()
174
    finally:
175
        old_tree.unlock()
176
177
178
def _compare_trees(old_tree, new_tree, want_unchanged, specific_files):
179
1732.1.5 by John Arbash Meinel
revert 1735
180
    from osutils import is_inside_any
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
181
    
182
    old_inv = old_tree.inventory
183
    new_inv = new_tree.inventory
184
    delta = TreeDelta()
185
    mutter('start compare_trees')
186
1658.1.9 by Martin Pool
Give an error for bzr diff on an nonexistent file (Malone #3619)
187
    # TODO: Rather than iterating over the whole tree and then filtering, we
188
    # could diff just the specified files (if any) and their subtrees.  
189
    # Perhaps should take a list of file-ids instead?   Need to indicate any
190
    # ids or names which were not found in the trees.
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
191
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
192
    old_files = old_tree.list_files()
193
    new_files = new_tree.list_files()
194
195
    more_old = True
196
    more_new = True
197
198
    added = {}
199
    removed = {}
200
201
    def get_next(iter):
202
        try:
203
            return iter.next()
204
        except StopIteration:
205
            return None, None, None, None, None
206
    old_path, old_class, old_kind, old_file_id, old_entry = get_next(old_files)
207
    new_path, new_class, new_kind, new_file_id, new_entry = get_next(new_files)
208
209
210
    def check_matching(old_path, old_entry, new_path, new_entry):
211
        """We have matched up 2 file_ids, check for changes."""
212
        assert old_entry.kind == new_entry.kind
213
214
        if old_entry.kind == 'root_directory':
215
            return
216
1732.1.15 by John Arbash Meinel
Re-add the specific files handling to _compare_trees
217
        if specific_files:
218
            if (not is_inside_any(specific_files, old_path)
219
                and not is_inside_any(specific_files, new_path)):
220
                return
221
222
        # temporary hack until all entries are populated before clients 
223
        # get them
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
224
        old_entry._read_tree_state(old_path, old_tree)
225
        new_entry._read_tree_state(new_path, new_tree)
226
        text_modified, meta_modified = new_entry.detect_changes(old_entry)
227
        
1732.1.15 by John Arbash Meinel
Re-add the specific files handling to _compare_trees
228
        # If the name changes, or the parent_id changes, we have a rename
229
        # (if we move a parent, that doesn't count as a rename for the file)
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
230
        if (old_entry.name != new_entry.name 
231
            or old_entry.parent_id != new_entry.parent_id):
232
            delta.renamed.append((old_path,
233
                                  new_path,
234
                                  old_entry.file_id, old_entry.kind,
235
                                  text_modified, meta_modified))
236
        elif text_modified or meta_modified:
237
            delta.modified.append((new_path, new_entry.file_id, new_entry.kind,
238
                                   text_modified, meta_modified))
239
        elif want_unchanged:
240
            delta.unchanged.append((new_path, new_entry.file_id, new_entry.kind))
241
242
243
    def handle_old(path, entry):
1732.1.29 by John Arbash Meinel
Update documentation and TODO for compare_trees
244
        """old entry without a new entry match
245
246
        Check to see if a matching new entry was already seen as an
247
        added file, and switch the pair into being a rename.
248
        Otherwise just mark the old entry being removed.
249
        """
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
250
        if entry.file_id in added:
251
            # Actually this is a rename, we found a new file_id earlier
252
            # at a different location, so it is no-longer added
253
            x_new_path, x_new_entry = added.pop(entry.file_id)
254
            check_matching(path, entry, x_new_path, x_new_entry)
255
        else:
256
            # We have an old_file_id which doesn't line up with a new_file_id
257
            # So this file looks to be removed
258
            assert entry.file_id not in removed
259
            removed[entry.file_id] = path, entry
260
261
    def handle_new(path, entry):
1732.1.29 by John Arbash Meinel
Update documentation and TODO for compare_trees
262
        """new entry without an old entry match
263
        
264
        Check to see if a matching old entry was already seen as a
265
        removal, and change the pair into a rename.
266
        Otherwise just mark the new entry as an added file.
267
        """
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
268
        if entry.file_id in removed:
269
            # We saw this file_id earlier at an old different location
270
            # it is no longer removed, just renamed
271
            x_old_path, x_old_entry = removed.pop(entry.file_id)
272
            check_matching(x_old_path, x_old_entry, path, entry)
273
        else:
274
            # We have a new file which does not match an old file
275
            # mark it as added
276
            assert entry.file_id not in added
277
            added[entry.file_id] = path, entry
278
279
    while old_path or new_path:
280
        # list_files() returns files in alphabetical path sorted order
281
        if old_path == new_path:
282
            if old_file_id == new_file_id:
283
                # This is the common case, the files are in the same place
284
                # check if there were any content changes
285
286
                if old_file_id is None:
287
                    # We have 2 unversioned files, no deltas possible???
288
                    pass
289
                else:
290
                    check_matching(old_path, old_entry, new_path, new_entry)
291
            else:
292
                # The ids don't match, so we have to handle them both
293
                # separately.
294
                if old_file_id is not None:
295
                    handle_old(old_path, old_entry)
296
297
                if new_file_id is not None:
298
                    handle_new(new_path, new_entry)
299
300
            # The two entries were at the same path, so increment both sides
301
            old_path, old_class, old_kind, old_file_id, old_entry = get_next(old_files)
302
            new_path, new_class, new_kind, new_file_id, new_entry = get_next(new_files)
303
        elif new_path is None or (old_path is not None and old_path < new_path):
304
            # Assume we don't match, only process old_path
305
            if old_file_id is not None:
306
                handle_old(old_path, old_entry)
307
            # old_path came first, so increment it, trying to match up
308
            old_path, old_class, old_kind, old_file_id, old_entry = get_next(old_files)
309
        elif new_path is not None:
310
            # new_path came first, so increment it, trying to match up
311
            if new_file_id is not None:
312
                handle_new(new_path, new_entry)
313
            new_path, new_class, new_kind, new_file_id, new_entry = get_next(new_files)
314
315
    # Now we have a set of added and removed files, mark them all
316
    for old_path, old_entry in removed.itervalues():
1732.1.15 by John Arbash Meinel
Re-add the specific files handling to _compare_trees
317
        if specific_files:
318
            if not is_inside_any(specific_files, old_path):
319
                continue
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
320
        delta.removed.append((old_path, old_entry.file_id, old_entry.kind))
321
    for new_path, new_entry in added.itervalues():
1732.1.15 by John Arbash Meinel
Re-add the specific files handling to _compare_trees
322
        if specific_files:
323
            if not is_inside_any(specific_files, new_path):
324
                continue
1732.1.7 by John Arbash Meinel
Instead of iterating randomly in both trees, _compare_trees now iterates in order on both trees simultaneously.
325
        delta.added.append((new_path, new_entry.file_id, new_entry.kind))
326
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
327
    delta.removed.sort()
328
    delta.added.sort()
329
    delta.renamed.sort()
1732.1.29 by John Arbash Meinel
Update documentation and TODO for compare_trees
330
    # TODO: jam 20060529 These lists shouldn't need to be sorted
331
    #       since we added them in alphabetical order.
974.1.26 by aaron.bentley at utoronto
merged mbp@sourcefrog.net-20050817233101-0939da1cf91f2472
332
    delta.modified.sort()
333
    delta.unchanged.sort()
334
335
    return delta