15
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
import sys, os, os.path, random, time, sha, sets, types, re, shutil, tempfile
21
import traceback, socket, fnmatch, difflib, time
22
from binascii import hexlify
22
from bzrlib.trace import mutter, note
23
from bzrlib.osutils import isdir, quotefn, compact_date, rand_bytes, \
25
sha_file, appendpath, file_kind
26
from bzrlib.errors import BzrError, InvalidRevisionNumber, InvalidRevisionId
28
from bzrlib.textui import show_status
29
from bzrlib.revision import Revision
30
from bzrlib.xml import unpack_xml
31
from bzrlib.delta import compare_trees
32
from bzrlib.tree import EmptyTree, RevisionTree
25
from inventory import Inventory
26
from trace import mutter, note
27
from tree import Tree, EmptyTree, RevisionTree, WorkingTree
28
from inventory import InventoryEntry, Inventory
29
from osutils import isdir, quotefn, isfile, uuid, sha_file, username, \
30
format_date, compact_date, pumpfile, user_email, rand_bytes, splitpath, \
31
joinpath, sha_string, file_kind, local_time_offset, appendpath
32
from store import ImmutableStore
33
from revision import Revision
34
from errors import bailout, BzrError
35
from textui import show_status
36
from diff import diff_trees
34
38
BZR_BRANCH_FORMAT = "Bazaar-NG branch, format 0.0.4\n"
35
39
## TODO: Maybe include checks for common corruption of newlines, etc?
38
# TODO: Some operations like log might retrieve the same revisions
39
# repeatedly to calculate deltas. We could perhaps have a weakref
40
# cache in memory to make this faster.
43
def find_branch(f, **args):
44
if f and (f.startswith('http://') or f.startswith('https://')):
46
return remotebranch.RemoteBranch(f, **args)
48
return Branch(f, **args)
51
def find_cached_branch(f, cache_root, **args):
52
from remotebranch import RemoteBranch
53
br = find_branch(f, **args)
54
def cacheify(br, store_name):
55
from meta_store import CachedStore
56
cache_path = os.path.join(cache_root, store_name)
58
new_store = CachedStore(getattr(br, store_name), cache_path)
59
setattr(br, store_name, new_store)
61
if isinstance(br, RemoteBranch):
62
cacheify(br, 'inventory_store')
63
cacheify(br, 'text_store')
64
cacheify(br, 'revision_store')
68
def _relpath(base, path):
69
"""Return path relative to base, or raise exception.
71
The path may be either an absolute path or a path relative to the
72
current working directory.
74
Lifted out of Branch.relpath for ease of testing.
76
os.path.commonprefix (python2.4) has a bad bug that it works just
77
on string prefixes, assuming that '/u' is a prefix of '/u2'. This
78
avoids that problem."""
79
rp = os.path.abspath(path)
83
while len(head) >= len(base):
86
head, tail = os.path.split(head)
90
from errors import NotBranchError
91
raise NotBranchError("path %r is not within branch %r" % (rp, base))
96
43
def find_branch_root(f=None):
97
44
"""Find the branch root enclosing f, or pwd.
99
f may be a filename or a URL.
101
46
It is not necessary that f exists.
103
48
Basically we keep looking up until we find the control directory or
333
194
fmt = self.controlfile('branch-format', 'r').read()
334
195
fmt.replace('\r\n', '')
335
196
if fmt != BZR_BRANCH_FORMAT:
336
raise BzrError('sorry, branch format %r not supported' % fmt,
337
['use a different bzr version',
338
'or remove the .bzr directory and "bzr init" again'])
340
def get_root_id(self):
341
"""Return the id of this branches root"""
342
inv = self.read_working_inventory()
343
return inv.root.file_id
345
def set_root_id(self, file_id):
346
inv = self.read_working_inventory()
347
orig_root_id = inv.root.file_id
348
del inv._byid[inv.root.file_id]
349
inv.root.file_id = file_id
350
inv._byid[inv.root.file_id] = inv.root
353
if entry.parent_id in (None, orig_root_id):
354
entry.parent_id = inv.root.file_id
355
self._write_inventory(inv)
197
bailout('sorry, branch format %r not supported' % fmt,
198
['use a different bzr version',
199
'or remove the .bzr directory and "bzr init" again'])
357
202
def read_working_inventory(self):
358
203
"""Read the working inventory."""
359
from bzrlib.inventory import Inventory
360
from bzrlib.xml import unpack_xml
361
from time import time
365
# ElementTree does its own conversion from UTF-8, so open in
367
inv = unpack_xml(Inventory,
368
self.controlfile('inventory', 'rb'))
369
mutter("loaded inventory of %d items in %f"
370
% (len(inv), time() - before))
205
# ElementTree does its own conversion from UTF-8, so open in
207
inv = Inventory.read_xml(self.controlfile('inventory', 'rb'))
208
mutter("loaded inventory of %d items in %f"
209
% (len(inv), time.time() - before))
376
213
def _write_inventory(self, inv):
377
214
"""Update the working inventory.
408
241
This puts the files in the Added state, so that they will be
409
242
recorded by the next commit.
412
List of paths to add, relative to the base of the tree.
415
If set, use these instead of automatically generated ids.
416
Must be the same length as the list of files, but may
417
contain None for ids that are to be autogenerated.
419
244
TODO: Perhaps have an option to add the ids even if the files do
422
247
TODO: Perhaps return the ids of the files? But then again it
423
is easy to retrieve them if they're needed.
248
is easy to retrieve them if they're needed.
250
TODO: Option to specify file id.
425
252
TODO: Adding a directory should optionally recurse down and
426
add all non-ignored children. Perhaps do that in a
253
add all non-ignored children. Perhaps do that in a
256
>>> b = ScratchBranch(files=['foo'])
257
>>> 'foo' in b.unknowns()
262
>>> 'foo' in b.unknowns()
264
>>> bool(b.inventory.path2id('foo'))
270
Traceback (most recent call last):
272
BzrError: ('foo is already versioned', [])
274
>>> b.add(['nothere'])
275
Traceback (most recent call last):
276
BzrError: ('cannot add: not a regular file or directory: nothere', [])
429
279
# TODO: Re-adding a file that is removed in the working copy
430
280
# should probably put it back with the previous ID.
431
if isinstance(files, basestring):
432
assert(ids is None or isinstance(ids, basestring))
281
if isinstance(files, types.StringTypes):
438
ids = [None] * len(files)
440
assert(len(ids) == len(files))
444
inv = self.read_working_inventory()
445
for f,file_id in zip(files, ids):
446
if is_control_file(f):
447
raise BzrError("cannot add control file %s" % quotefn(f))
452
raise BzrError("cannot add top-level %r" % f)
454
fullpath = os.path.normpath(self.abspath(f))
457
kind = file_kind(fullpath)
459
# maybe something better?
460
raise BzrError('cannot add: not a regular file or directory: %s' % quotefn(f))
462
if kind != 'file' and kind != 'directory':
463
raise BzrError('cannot add: not a regular file or directory: %s' % quotefn(f))
466
file_id = gen_file_id(f)
467
inv.add_path(f, kind=kind, file_id=file_id)
470
print 'added', quotefn(f)
472
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
474
self._write_inventory(inv)
284
inv = self.read_working_inventory()
286
if is_control_file(f):
287
bailout("cannot add control file %s" % quotefn(f))
292
bailout("cannot add top-level %r" % f)
294
fullpath = os.path.normpath(self.abspath(f))
297
kind = file_kind(fullpath)
299
# maybe something better?
300
bailout('cannot add: not a regular file or directory: %s' % quotefn(f))
302
if kind != 'file' and kind != 'directory':
303
bailout('cannot add: not a regular file or directory: %s' % quotefn(f))
305
file_id = gen_file_id(f)
306
inv.add_path(f, kind=kind, file_id=file_id)
309
show_status('A', kind, quotefn(f))
311
mutter("add file %s file_id:{%s} kind=%r" % (f, file_id, kind))
313
self._write_inventory(inv)
479
316
def print_file(self, file, revno):
480
317
"""Print `file` to stdout."""
483
tree = self.revision_tree(self.lookup_revision(revno))
484
# use inventory as it was in that revision
485
file_id = tree.inventory.path2id(file)
487
raise BzrError("%r is not present in revision %s" % (file, revno))
488
tree.print_file(file_id)
318
tree = self.revision_tree(self.lookup_revision(revno))
319
# use inventory as it was in that revision
320
file_id = tree.inventory.path2id(file)
322
bailout("%r is not present in revision %d" % (file, revno))
323
tree.print_file(file_id)
493
326
def remove(self, files, verbose=False):
494
327
"""Mark nominated files for removal from the inventory.
566
405
return self.working_tree().unknowns()
569
def append_revision(self, *revision_ids):
570
from bzrlib.atomicfile import AtomicFile
572
for revision_id in revision_ids:
573
mutter("add {%s} to revision-history" % revision_id)
408
def commit(self, message, timestamp=None, timezone=None,
411
"""Commit working copy as a new revision.
413
The basic approach is to add all the file texts into the
414
store, then the inventory, then make a new revision pointing
415
to that inventory and store that.
417
This is not quite safe if the working copy changes during the
418
commit; for the moment that is simply not allowed. A better
419
approach is to make a temporary copy of the files before
420
computing their hashes, and then add those hashes in turn to
421
the inventory. This should mean at least that there are no
422
broken hash pointers. There is no way we can get a snapshot
423
of the whole directory at an instant. This would also have to
424
be robust against files disappearing, moving, etc. So the
425
whole thing is a bit hard.
427
timestamp -- if not None, seconds-since-epoch for a
428
postdated/predated commit.
431
## TODO: Show branch names
433
# TODO: Don't commit if there are no changes, unless forced?
435
# First walk over the working inventory; and both update that
436
# and also build a new revision inventory. The revision
437
# inventory needs to hold the text-id, sha1 and size of the
438
# actual file versions committed in the revision. (These are
439
# not present in the working inventory.) We also need to
440
# detect missing/deleted files, and remove them from the
443
work_inv = self.read_working_inventory()
445
basis = self.basis_tree()
446
basis_inv = basis.inventory
448
for path, entry in work_inv.iter_entries():
449
## TODO: Cope with files that have gone missing.
451
## TODO: Check that the file kind has not changed from the previous
452
## revision of this file (if any).
456
p = self.abspath(path)
457
file_id = entry.file_id
458
mutter('commit prep file %s, id %r ' % (p, file_id))
460
if not os.path.exists(p):
461
mutter(" file is missing, removing from inventory")
463
show_status('D', entry.kind, quotefn(path))
464
missing_ids.append(file_id)
467
# TODO: Handle files that have been deleted
469
# TODO: Maybe a special case for empty files? Seems a
470
# waste to store them many times.
474
if basis_inv.has_id(file_id):
475
old_kind = basis_inv[file_id].kind
476
if old_kind != entry.kind:
477
bailout("entry %r changed kind from %r to %r"
478
% (file_id, old_kind, entry.kind))
480
if entry.kind == 'directory':
482
bailout("%s is entered as directory but not a directory" % quotefn(p))
483
elif entry.kind == 'file':
485
bailout("%s is entered as file but is not a file" % quotefn(p))
487
content = file(p, 'rb').read()
489
entry.text_sha1 = sha_string(content)
490
entry.text_size = len(content)
492
old_ie = basis_inv.has_id(file_id) and basis_inv[file_id]
494
and (old_ie.text_size == entry.text_size)
495
and (old_ie.text_sha1 == entry.text_sha1)):
496
## assert content == basis.get_file(file_id).read()
497
entry.text_id = basis_inv[file_id].text_id
498
mutter(' unchanged from previous text_id {%s}' %
502
entry.text_id = gen_file_id(entry.name)
503
self.text_store.add(content, entry.text_id)
504
mutter(' stored with text_id {%s}' % entry.text_id)
508
elif (old_ie.name == entry.name
509
and old_ie.parent_id == entry.parent_id):
514
show_status(state, entry.kind, quotefn(path))
516
for file_id in missing_ids:
517
# have to do this later so we don't mess up the iterator.
518
# since parents may be removed before their children we
521
# FIXME: There's probably a better way to do this; perhaps
522
# the workingtree should know how to filter itself.
523
if work_inv.has_id(file_id):
524
del work_inv[file_id]
527
inv_id = rev_id = _gen_revision_id(time.time())
529
inv_tmp = tempfile.TemporaryFile()
530
inv.write_xml(inv_tmp)
532
self.inventory_store.add(inv_tmp, inv_id)
533
mutter('new inventory_id is {%s}' % inv_id)
535
self._write_inventory(work_inv)
537
if timestamp == None:
538
timestamp = time.time()
540
if committer == None:
541
committer = username()
544
timezone = local_time_offset()
546
mutter("building commit log message")
547
rev = Revision(timestamp=timestamp,
550
precursor = self.last_patch(),
555
rev_tmp = tempfile.TemporaryFile()
556
rev.write_xml(rev_tmp)
558
self.revision_store.add(rev_tmp, rev_id)
559
mutter("new revision_id is {%s}" % rev_id)
561
## XXX: Everything up to here can simply be orphaned if we abort
562
## the commit; it will leave junk files behind but that doesn't
565
## TODO: Read back the just-generated changeset, and make sure it
566
## applies and recreates the right state.
568
## TODO: Also calculate and store the inventory SHA1
569
mutter("committing patch r%d" % (self.revno() + 1))
572
self.append_revision(rev_id)
575
note("commited r%d" % self.revno())
578
def append_revision(self, revision_id):
579
mutter("add {%s} to revision-history" % revision_id)
575
580
rev_history = self.revision_history()
576
rev_history.extend(revision_ids)
578
f = AtomicFile(self.controlfilename('revision-history'))
580
for rev_id in rev_history:
587
def get_revision_xml(self, revision_id):
588
"""Return XML file object for revision object."""
589
if not revision_id or not isinstance(revision_id, basestring):
590
raise InvalidRevisionId(revision_id)
595
return self.revision_store[revision_id]
597
raise bzrlib.errors.NoSuchRevision(revision_id)
582
tmprhname = self.controlfilename('revision-history.tmp')
583
rhname = self.controlfilename('revision-history')
585
f = file(tmprhname, 'wt')
586
rev_history.append(revision_id)
587
f.write('\n'.join(rev_history))
591
if sys.platform == 'win32':
593
os.rename(tmprhname, rhname)
602
597
def get_revision(self, revision_id):
603
598
"""Return the Revision object for a named revision"""
604
xml_file = self.get_revision_xml(revision_id)
607
r = unpack_xml(Revision, xml_file)
608
except SyntaxError, e:
609
raise bzrlib.errors.BzrError('failed to unpack revision_xml',
599
r = Revision.read_xml(self.revision_store[revision_id])
613
600
assert r.revision_id == revision_id
617
def get_revision_delta(self, revno):
618
"""Return the delta for one revision.
620
The delta is relative to its mainline predecessor, or the
621
empty tree for revision 1.
623
assert isinstance(revno, int)
624
rh = self.revision_history()
625
if not (1 <= revno <= len(rh)):
626
raise InvalidRevisionNumber(revno)
628
# revno is 1-based; list is 0-based
630
new_tree = self.revision_tree(rh[revno-1])
632
old_tree = EmptyTree()
634
old_tree = self.revision_tree(rh[revno-2])
636
return compare_trees(old_tree, new_tree)
640
def get_revision_sha1(self, revision_id):
641
"""Hash the stored value of a revision, and return it."""
642
# In the future, revision entries will be signed. At that
643
# point, it is probably best *not* to include the signature
644
# in the revision hash. Because that lets you re-sign
645
# the revision, (add signatures/remove signatures) and still
646
# have all hash pointers stay consistent.
647
# But for now, just hash the contents.
648
return bzrlib.osutils.sha_file(self.get_revision_xml(revision_id))
651
604
def get_inventory(self, inventory_id):
652
605
"""Get Inventory object by hash.
654
607
TODO: Perhaps for this and similar methods, take a revision
655
608
parameter which can be either an integer revno or a
657
from bzrlib.inventory import Inventory
658
from bzrlib.xml import unpack_xml
660
return unpack_xml(Inventory, self.inventory_store[inventory_id])
663
def get_inventory_sha1(self, inventory_id):
664
"""Return the sha1 hash of the inventory entry
666
return sha_file(self.inventory_store[inventory_id])
610
i = Inventory.read_xml(self.inventory_store[inventory_id])
669
614
def get_revision_inventory(self, revision_id):
670
615
"""Return inventory of a past revision."""
671
# bzr 0.0.6 imposes the constraint that the inventory_id
672
# must be the same as its revision, so this is trivial.
673
616
if revision_id == None:
674
from bzrlib.inventory import Inventory
675
return Inventory(self.get_root_id())
677
return self.get_inventory(revision_id)
619
return self.get_inventory(self.get_revision(revision_id).inventory_id)
680
622
def revision_history(self):
742
634
That is equivalent to the number of revisions committed to
637
>>> b = ScratchBranch()
640
>>> b.commit('no foo')
745
644
return len(self.revision_history())
748
647
def last_patch(self):
749
648
"""Return last patch hash, or None if no history.
650
>>> ScratchBranch().last_patch() == None
751
653
ph = self.revision_history()
758
def missing_revisions(self, other, stop_revision=None):
760
If self and other have not diverged, return a list of the revisions
761
present in other, but missing from self.
763
>>> from bzrlib.commit import commit
764
>>> bzrlib.trace.silent = True
765
>>> br1 = ScratchBranch()
766
>>> br2 = ScratchBranch()
767
>>> br1.missing_revisions(br2)
769
>>> commit(br2, "lala!", rev_id="REVISION-ID-1")
770
>>> br1.missing_revisions(br2)
772
>>> br2.missing_revisions(br1)
774
>>> commit(br1, "lala!", rev_id="REVISION-ID-1")
775
>>> br1.missing_revisions(br2)
777
>>> commit(br2, "lala!", rev_id="REVISION-ID-2A")
778
>>> br1.missing_revisions(br2)
780
>>> commit(br1, "lala!", rev_id="REVISION-ID-2B")
781
>>> br1.missing_revisions(br2)
782
Traceback (most recent call last):
783
DivergedBranches: These branches have diverged.
785
self_history = self.revision_history()
786
self_len = len(self_history)
787
other_history = other.revision_history()
788
other_len = len(other_history)
789
common_index = min(self_len, other_len) -1
790
if common_index >= 0 and \
791
self_history[common_index] != other_history[common_index]:
792
raise DivergedBranches(self, other)
794
if stop_revision is None:
795
stop_revision = other_len
796
elif stop_revision > other_len:
797
raise NoSuchRevision(self, stop_revision)
799
return other_history[self_len:stop_revision]
802
def update_revisions(self, other, stop_revision=None):
803
"""Pull in all new revisions from other branch.
805
>>> from bzrlib.commit import commit
806
>>> bzrlib.trace.silent = True
807
>>> br1 = ScratchBranch(files=['foo', 'bar'])
810
>>> commit(br1, "lala!", rev_id="REVISION-ID-1", verbose=False)
811
>>> br2 = ScratchBranch()
812
>>> br2.update_revisions(br1)
816
>>> br2.revision_history()
818
>>> br2.update_revisions(br1)
822
>>> br1.text_store.total_size() == br2.text_store.total_size()
825
from bzrlib.progress import ProgressBar
829
pb.update('comparing histories')
830
revision_ids = self.missing_revisions(other, stop_revision)
832
if hasattr(other.revision_store, "prefetch"):
833
other.revision_store.prefetch(revision_ids)
834
if hasattr(other.inventory_store, "prefetch"):
835
inventory_ids = [other.get_revision(r).inventory_id
836
for r in revision_ids]
837
other.inventory_store.prefetch(inventory_ids)
842
for rev_id in revision_ids:
844
pb.update('fetching revision', i, len(revision_ids))
845
rev = other.get_revision(rev_id)
846
revisions.append(rev)
847
inv = other.get_inventory(str(rev.inventory_id))
848
for key, entry in inv.iter_entries():
849
if entry.text_id is None:
851
if entry.text_id not in self.text_store:
852
needed_texts.add(entry.text_id)
856
count = self.text_store.copy_multi(other.text_store, needed_texts)
857
print "Added %d texts." % count
858
inventory_ids = [ f.inventory_id for f in revisions ]
859
count = self.inventory_store.copy_multi(other.inventory_store,
861
print "Added %d inventories." % count
862
revision_ids = [ f.revision_id for f in revisions]
863
count = self.revision_store.copy_multi(other.revision_store,
865
for revision_id in revision_ids:
866
self.append_revision(revision_id)
867
print "Added %d revisions." % count
870
def commit(self, *args, **kw):
871
from bzrlib.commit import commit
872
commit(self, *args, **kw)
875
def lookup_revision(self, revision):
876
"""Return the revision identifier for a given revision information."""
877
revno, info = self.get_revision_info(revision)
880
def get_revision_info(self, revision):
881
"""Return (revno, revision id) for revision identifier.
883
revision can be an integer, in which case it is assumed to be revno (though
884
this will translate negative values into positive ones)
885
revision can also be a string, in which case it is parsed for something like
886
'date:' or 'revid:' etc.
891
try:# Convert to int if possible
892
revision = int(revision)
895
revs = self.revision_history()
896
if isinstance(revision, int):
899
# Mabye we should do this first, but we don't need it if revision == 0
901
revno = len(revs) + revision + 1
904
elif isinstance(revision, basestring):
905
for prefix, func in Branch.REVISION_NAMESPACES.iteritems():
906
if revision.startswith(prefix):
907
revno = func(self, revs, revision)
910
raise BzrError('No namespace registered for string: %r' % revision)
912
if revno is None or revno <= 0 or revno > len(revs):
913
raise BzrError("no such revision %s" % revision)
914
return revno, revs[revno-1]
916
def _namespace_revno(self, revs, revision):
917
"""Lookup a revision by revision number"""
918
assert revision.startswith('revno:')
920
return int(revision[6:])
923
REVISION_NAMESPACES['revno:'] = _namespace_revno
925
def _namespace_revid(self, revs, revision):
926
assert revision.startswith('revid:')
928
return revs.index(revision[6:]) + 1
931
REVISION_NAMESPACES['revid:'] = _namespace_revid
933
def _namespace_last(self, revs, revision):
934
assert revision.startswith('last:')
936
offset = int(revision[5:])
941
raise BzrError('You must supply a positive value for --revision last:XXX')
942
return len(revs) - offset + 1
943
REVISION_NAMESPACES['last:'] = _namespace_last
945
def _namespace_tag(self, revs, revision):
946
assert revision.startswith('tag:')
947
raise BzrError('tag: namespace registered, but not implemented.')
948
REVISION_NAMESPACES['tag:'] = _namespace_tag
950
def _namespace_date(self, revs, revision):
951
assert revision.startswith('date:')
953
# Spec for date revisions:
955
# value can be 'yesterday', 'today', 'tomorrow' or a YYYY-MM-DD string.
956
# it can also start with a '+/-/='. '+' says match the first
957
# entry after the given date. '-' is match the first entry before the date
958
# '=' is match the first entry after, but still on the given date.
960
# +2005-05-12 says find the first matching entry after May 12th, 2005 at 0:00
961
# -2005-05-12 says find the first matching entry before May 12th, 2005 at 0:00
962
# =2005-05-12 says find the first match after May 12th, 2005 at 0:00 but before
963
# May 13th, 2005 at 0:00
965
# So the proper way of saying 'give me all entries for today' is:
966
# -r {date:+today}:{date:-tomorrow}
967
# The default is '=' when not supplied
970
if val[:1] in ('+', '-', '='):
971
match_style = val[:1]
974
today = datetime.datetime.today().replace(hour=0,minute=0,second=0,microsecond=0)
975
if val.lower() == 'yesterday':
976
dt = today - datetime.timedelta(days=1)
977
elif val.lower() == 'today':
979
elif val.lower() == 'tomorrow':
980
dt = today + datetime.timedelta(days=1)
983
# This should be done outside the function to avoid recompiling it.
984
_date_re = re.compile(
985
r'(?P<date>(?P<year>\d\d\d\d)-(?P<month>\d\d)-(?P<day>\d\d))?'
987
r'(?P<time>(?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d))?)?'
989
m = _date_re.match(val)
990
if not m or (not m.group('date') and not m.group('time')):
991
raise BzrError('Invalid revision date %r' % revision)
994
year, month, day = int(m.group('year')), int(m.group('month')), int(m.group('day'))
996
year, month, day = today.year, today.month, today.day
998
hour = int(m.group('hour'))
999
minute = int(m.group('minute'))
1000
if m.group('second'):
1001
second = int(m.group('second'))
1005
hour, minute, second = 0,0,0
1007
dt = datetime.datetime(year=year, month=month, day=day,
1008
hour=hour, minute=minute, second=second)
1012
if match_style == '-':
1014
elif match_style == '=':
1015
last = dt + datetime.timedelta(days=1)
1018
for i in range(len(revs)-1, -1, -1):
1019
r = self.get_revision(revs[i])
1020
# TODO: Handle timezone.
1021
dt = datetime.datetime.fromtimestamp(r.timestamp)
1022
if first >= dt and (last is None or dt >= last):
1025
for i in range(len(revs)):
1026
r = self.get_revision(revs[i])
1027
# TODO: Handle timezone.
1028
dt = datetime.datetime.fromtimestamp(r.timestamp)
1029
if first <= dt and (last is None or dt <= last):
1031
REVISION_NAMESPACES['date:'] = _namespace_date
660
def lookup_revision(self, revno):
661
"""Return revision hash for revision number."""
666
# list is 0-based; revisions are 1-based
667
return self.revision_history()[revno-1]
669
raise BzrError("no such revision %s" % revno)
1033
672
def revision_tree(self, revision_id):
1034
673
"""Return Tree for a revision on this branch.
1036
675
`revision_id` may be None for the null revision, in which case
1037
676
an `EmptyTree` is returned."""
1038
# TODO: refactor this to use an existing revision object
1039
# so we don't need to read it in twice.
1040
678
if revision_id == None:
1041
679
return EmptyTree()
713
def write_log(self, show_timezone='original', verbose=False):
714
"""Write out human-readable log of commits to this branch
716
utc -- If true, show dates in universal time, not local time."""
717
## TODO: Option to choose either original, utc or local timezone
720
for p in self.revision_history():
722
print 'revno:', revno
723
## TODO: Show hash if --id is given.
724
##print 'revision-hash:', p
725
rev = self.get_revision(p)
726
print 'committer:', rev.committer
727
print 'timestamp: %s' % (format_date(rev.timestamp, rev.timezone or 0,
730
## opportunistic consistency check, same as check_patch_chaining
731
if rev.precursor != precursor:
732
bailout("mismatched precursor!")
736
print ' (no message)'
738
for l in rev.message.split('\n'):
741
if verbose == True and precursor != None:
742
print 'changed files:'
743
tree = self.revision_tree(p)
744
prevtree = self.revision_tree(precursor)
746
for file_state, fid, old_name, new_name, kind in \
747
diff_trees(prevtree, tree, ):
748
if file_state == 'A' or file_state == 'M':
749
show_status(file_state, kind, new_name)
750
elif file_state == 'D':
751
show_status(file_state, kind, old_name)
752
elif file_state == 'R':
753
show_status(file_state, kind,
754
old_name + ' => ' + new_name)
1066
760
def rename_one(self, from_rel, to_rel):
1067
761
"""Rename one file.
1069
763
This can change the directory or the filename or both.
765
tree = self.working_tree()
767
if not tree.has_filename(from_rel):
768
bailout("can't rename: old working file %r does not exist" % from_rel)
769
if tree.has_filename(to_rel):
770
bailout("can't rename: new working file %r already exists" % to_rel)
772
file_id = inv.path2id(from_rel)
774
bailout("can't rename: old name %r is not versioned" % from_rel)
776
if inv.path2id(to_rel):
777
bailout("can't rename: new name %r is already versioned" % to_rel)
779
to_dir, to_tail = os.path.split(to_rel)
780
to_dir_id = inv.path2id(to_dir)
781
if to_dir_id == None and to_dir != '':
782
bailout("can't determine destination directory id for %r" % to_dir)
784
mutter("rename_one:")
785
mutter(" file_id {%s}" % file_id)
786
mutter(" from_rel %r" % from_rel)
787
mutter(" to_rel %r" % to_rel)
788
mutter(" to_dir %r" % to_dir)
789
mutter(" to_dir_id {%s}" % to_dir_id)
791
inv.rename(file_id, to_dir_id, to_tail)
793
print "%s => %s" % (from_rel, to_rel)
795
from_abs = self.abspath(from_rel)
796
to_abs = self.abspath(to_rel)
1073
tree = self.working_tree()
1074
inv = tree.inventory
1075
if not tree.has_filename(from_rel):
1076
raise BzrError("can't rename: old working file %r does not exist" % from_rel)
1077
if tree.has_filename(to_rel):
1078
raise BzrError("can't rename: new working file %r already exists" % to_rel)
1080
file_id = inv.path2id(from_rel)
1082
raise BzrError("can't rename: old name %r is not versioned" % from_rel)
1084
if inv.path2id(to_rel):
1085
raise BzrError("can't rename: new name %r is already versioned" % to_rel)
1087
to_dir, to_tail = os.path.split(to_rel)
1088
to_dir_id = inv.path2id(to_dir)
1089
if to_dir_id == None and to_dir != '':
1090
raise BzrError("can't determine destination directory id for %r" % to_dir)
1092
mutter("rename_one:")
1093
mutter(" file_id {%s}" % file_id)
1094
mutter(" from_rel %r" % from_rel)
1095
mutter(" to_rel %r" % to_rel)
1096
mutter(" to_dir %r" % to_dir)
1097
mutter(" to_dir_id {%s}" % to_dir_id)
1099
inv.rename(file_id, to_dir_id, to_tail)
1101
print "%s => %s" % (from_rel, to_rel)
1103
from_abs = self.abspath(from_rel)
1104
to_abs = self.abspath(to_rel)
1106
os.rename(from_abs, to_abs)
1108
raise BzrError("failed to rename %r to %r: %s"
1109
% (from_abs, to_abs, e[1]),
1110
["rename rolled back"])
1112
self._write_inventory(inv)
798
os.rename(from_abs, to_abs)
800
bailout("failed to rename %r to %r: %s"
801
% (from_abs, to_abs, e[1]),
802
["rename rolled back"])
804
self._write_inventory(inv)
1117
808
def move(self, from_paths, to_name):
1125
816
Note that to_name is only the last component of the new name;
1126
817
this doesn't change the directory.
1130
## TODO: Option to move IDs only
1131
assert not isinstance(from_paths, basestring)
1132
tree = self.working_tree()
1133
inv = tree.inventory
1134
to_abs = self.abspath(to_name)
1135
if not isdir(to_abs):
1136
raise BzrError("destination %r is not a directory" % to_abs)
1137
if not tree.has_filename(to_name):
1138
raise BzrError("destination %r not in working directory" % to_abs)
1139
to_dir_id = inv.path2id(to_name)
1140
if to_dir_id == None and to_name != '':
1141
raise BzrError("destination %r is not a versioned directory" % to_name)
1142
to_dir_ie = inv[to_dir_id]
1143
if to_dir_ie.kind not in ('directory', 'root_directory'):
1144
raise BzrError("destination %r is not a directory" % to_abs)
1146
to_idpath = inv.get_idpath(to_dir_id)
1148
for f in from_paths:
1149
if not tree.has_filename(f):
1150
raise BzrError("%r does not exist in working tree" % f)
1151
f_id = inv.path2id(f)
1153
raise BzrError("%r is not versioned" % f)
1154
name_tail = splitpath(f)[-1]
1155
dest_path = appendpath(to_name, name_tail)
1156
if tree.has_filename(dest_path):
1157
raise BzrError("destination %r already exists" % dest_path)
1158
if f_id in to_idpath:
1159
raise BzrError("can't move %r to a subdirectory of itself" % f)
1161
# OK, so there's a race here, it's possible that someone will
1162
# create a file in this interval and then the rename might be
1163
# left half-done. But we should have caught most problems.
1165
for f in from_paths:
1166
name_tail = splitpath(f)[-1]
1167
dest_path = appendpath(to_name, name_tail)
1168
print "%s => %s" % (f, dest_path)
1169
inv.rename(inv.path2id(f), to_dir_id, name_tail)
1171
os.rename(self.abspath(f), self.abspath(dest_path))
1173
raise BzrError("failed to rename %r to %r: %s" % (f, dest_path, e[1]),
1174
["rename rolled back"])
1176
self._write_inventory(inv)
1181
def revert(self, filenames, old_tree=None, backups=True):
1182
"""Restore selected files to the versions from a previous tree.
1185
If true (default) backups are made of files before
1188
from bzrlib.errors import NotVersionedError, BzrError
1189
from bzrlib.atomicfile import AtomicFile
1190
from bzrlib.osutils import backup_file
819
## TODO: Option to move IDs only
820
assert not isinstance(from_paths, basestring)
821
tree = self.working_tree()
823
to_abs = self.abspath(to_name)
824
if not isdir(to_abs):
825
bailout("destination %r is not a directory" % to_abs)
826
if not tree.has_filename(to_name):
827
bailout("destination %r not in working directory" % to_abs)
828
to_dir_id = inv.path2id(to_name)
829
if to_dir_id == None and to_name != '':
830
bailout("destination %r is not a versioned directory" % to_name)
831
to_dir_ie = inv[to_dir_id]
832
if to_dir_ie.kind not in ('directory', 'root_directory'):
833
bailout("destination %r is not a directory" % to_abs)
835
to_idpath = Set(inv.get_idpath(to_dir_id))
838
if not tree.has_filename(f):
839
bailout("%r does not exist in working tree" % f)
840
f_id = inv.path2id(f)
842
bailout("%r is not versioned" % f)
843
name_tail = splitpath(f)[-1]
844
dest_path = appendpath(to_name, name_tail)
845
if tree.has_filename(dest_path):
846
bailout("destination %r already exists" % dest_path)
847
if f_id in to_idpath:
848
bailout("can't move %r to a subdirectory of itself" % f)
850
# OK, so there's a race here, it's possible that someone will
851
# create a file in this interval and then the rename might be
852
# left half-done. But we should have caught most problems.
855
name_tail = splitpath(f)[-1]
856
dest_path = appendpath(to_name, name_tail)
857
print "%s => %s" % (f, dest_path)
858
inv.rename(inv.path2id(f), to_dir_id, name_tail)
860
os.rename(self.abspath(f), self.abspath(dest_path))
862
bailout("failed to rename %r to %r: %s" % (f, dest_path, e[1]),
863
["rename rolled back"])
865
self._write_inventory(inv)
869
def show_status(self, show_all=False):
870
"""Display single-line status for non-ignored working files.
872
The list is show sorted in order by file name.
874
>>> b = ScratchBranch(files=['foo', 'foo~'])
880
>>> b.commit("add foo")
882
>>> os.unlink(b.abspath('foo'))
1192
inv = self.read_working_inventory()
1193
if old_tree is None:
1194
old_tree = self.basis_tree()
1195
old_inv = old_tree.inventory
1198
for fn in filenames:
1199
file_id = inv.path2id(fn)
1201
raise NotVersionedError("not a versioned file", fn)
1202
if not old_inv.has_id(file_id):
1203
raise BzrError("file not present in old tree", fn, file_id)
1204
nids.append((fn, file_id))
1206
# TODO: Rename back if it was previously at a different location
1208
# TODO: If given a directory, restore the entire contents from
1209
# the previous version.
1211
# TODO: Make a backup to a temporary file.
1213
# TODO: If the file previously didn't exist, delete it?
1214
for fn, file_id in nids:
1217
f = AtomicFile(fn, 'wb')
1219
f.write(old_tree.get_file(file_id).read())
1225
def pending_merges(self):
1226
"""Return a list of pending merges.
1228
These are revisions that have been merged into the working
1229
directory but not yet committed.
886
TODO: Get state for single files.
1231
cfn = self.controlfilename('pending-merges')
1232
if not os.path.exists(cfn):
1235
for l in self.controlfile('pending-merges', 'r').readlines():
1236
p.append(l.rstrip('\n'))
1240
def add_pending_merge(self, revision_id):
1241
from bzrlib.revision import validate_revision_id
1243
validate_revision_id(revision_id)
1245
p = self.pending_merges()
1246
if revision_id in p:
1248
p.append(revision_id)
1249
self.set_pending_merges(p)
1252
def set_pending_merges(self, rev_list):
1253
from bzrlib.atomicfile import AtomicFile
1256
f = AtomicFile(self.controlfilename('pending-merges'))
889
# We have to build everything into a list first so that it can
890
# sorted by name, incorporating all the different sources.
892
# FIXME: Rather than getting things in random order and then sorting,
893
# just step through in order.
895
# Interesting case: the old ID for a file has been removed,
896
# but a new file has been created under that name.
898
old = self.basis_tree()
899
new = self.working_tree()
901
for fs, fid, oldname, newname, kind in diff_trees(old, new):
903
show_status(fs, kind,
904
oldname + ' => ' + newname)
905
elif fs == 'A' or fs == 'M':
906
show_status(fs, kind, newname)
908
show_status(fs, kind, oldname)
911
show_status(fs, kind, newname)
914
show_status(fs, kind, newname)
916
show_status(fs, kind, newname)
918
bailout("weird file state %r" % ((fs, fid),))
1268
922
class ScratchBranch(Branch):