# Copyright 2002 Ben Escoto
#
# This file is part of duplicity.
#
# Duplicity is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by the
# Free Software Foundation; either version 3 of the License, or (at your
# option) any later version.
#
# Duplicity is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with duplicity; if not, write to the Free Software Foundation,
# Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
"""Classes and functions on collections of backup volumes"""
import gzip, types
import log, file_naming, path, dup_time, globals, manifest
class CollectionsError(Exception):
pass
class BackupSet:
"""Backup set - the backup information produced by one session"""
def __init__(self, backend):
"""Initialize new backup set, only backend is required at first"""
self.backend = backend
self.info_set = None
self.volume_name_dict = {} # dict from volume number to filename
self.remote_manifest_name = None
self.local_manifest_path = None
self.time = None # will be set if is full backup set
self.start_time, self.end_time = None, None # will be set if inc
def is_complete(self):
"""Assume complete if found manifest file"""
return self.remote_manifest_name
def add_filename(self, filename):
"""Add a filename to given set. Return true if it fits.
The filename will match the given set if it has the right
times and is of the right type. The information will be set
from the first filename given.
"""
pr = file_naming.parse(filename)
if not pr or not (pr.type == "full" or pr.type == "inc"):
return None
if not self.info_set:
self.set_info(pr)
else:
if pr.type != self.type:
return None
if pr.time != self.time:
return None
if (pr.start_time != self.start_time or
pr.end_time != self.end_time):
return None
if pr.manifest:
self.set_manifest(filename)
else:
assert pr.volume_number is not None
assert not self.volume_name_dict.has_key(pr.volume_number), \
(self.volume_name_dict, filename)
self.volume_name_dict[pr.volume_number] = filename
return 1
def set_info(self, pr):
"""Set BackupSet information from ParseResults object"""
assert not self.info_set
self.type = pr.type
self.time = pr.time
self.start_time, self.end_time = pr.start_time, pr.end_time
self.time = pr.time
self.info_set = 1
def set_manifest(self, remote_filename):
"""Add local and remote manifest filenames to backup set"""
assert not self.remote_manifest_name, (self.remote_manifest_name,
remote_filename)
self.remote_manifest_name = remote_filename
if not globals.archive_dir:
return
for local_filename in globals.archive_dir.listdir():
pr = file_naming.parse(local_filename)
if (pr and pr.manifest and pr.type == self.type and
pr.time == self.time and pr.start_time == self.start_time
and pr.end_time == self.end_time):
self.local_manifest_path = \
globals.archive_dir.append(local_filename)
break
def delete(self):
"""Remove all files in set"""
l = self.get_filenames()
l.reverse() # delete starting with manifest
self.backend.delete(l)
def __str__(self):
"""For now just list files in set"""
filelist = []
if self.remote_manifest_name:
filelist.append(self.remote_manifest_name)
filelist.extend(self.volume_name_dict.values())
return "[%s]" % ", ".join(filelist)
def get_timestr(self):
"""Return time string suitable for log statements"""
return dup_time.timetopretty(self.time or self.end_time)
def check_manifests(self):
"""Make sure remote manifest is equal to local one"""
if not self.remote_manifest_name and not self.local_manifest_path:
log.FatalError("Fatal Error: No manifests found for most recent backup")
assert self.remote_manifest_name, "if only one, should be remote"
remote_manifest = self.get_remote_manifest()
if self.local_manifest_path:
local_manifest = self.get_local_manifest()
if remote_manifest and self.local_manifest_path and local_manifest:
if remote_manifest != local_manifest:
log.FatalError("Fatal Error: Remote manifest does not match local one. Either the "
"remote backup set or the local archive directory has been corrupted.")
if not remote_manifest:
if self.local_manifest_path:
remote_manifest = local_manifest
else:
log.FatalError("Fatal Error: Neither remote nor local manifest is readable.")
remote_manifest.check_dirinfo()
def get_local_manifest(self):
"""Return manifest object by reading local manifest file"""
assert self.local_manifest_path
manifest_buffer = self.local_manifest_path.get_data()
return manifest.Manifest().from_string(manifest_buffer)
def get_remote_manifest(self):
"""Return manifest by reading remote manifest on backend"""
assert self.remote_manifest_name
# Following by MDR. Should catch if remote encrypted with
# public key w/o secret key
try:
manifest_buffer = self.backend.get_data(self.remote_manifest_name)
except IOError, message:
if message.args[0] == "GnuPG exited non-zero, with code 131072":
return None
else:
raise
return manifest.Manifest().from_string(manifest_buffer)
def get_manifest(self):
"""Return manifest object, showing preference for local copy"""
if self.local_manifest_path:
return self.get_local_manifest()
else:
return self.get_remote_manifest()
def get_filenames(self):
"""Return sorted list of (remote) filenames of files in set"""
assert self.info_set
volume_num_list = self.volume_name_dict.keys()
volume_num_list.sort()
volume_filenames = map(lambda x: self.volume_name_dict[x],
volume_num_list)
if self.remote_manifest_name:
return [self.remote_manifest_name] + volume_filenames
else:
return volume_filenames
def get_time(self):
"""Return time if full backup, or end_time if incremental"""
if self.time:
return self.time
if self.end_time:
return self.end_time
assert 0, "Neither self.time nor self.end_time set"
def __len__(self):
"""Return the number of volumes in the set"""
return len(self.volume_name_dict.keys())
class BackupChain:
"""BackupChain - a number of linked BackupSets
A BackupChain always starts with a full backup set and continues
with incremental ones.
"""
def __init__(self, backend):
"""Initialize new chain, only backend is required at first"""
self.backend = backend
self.fullset = None
self.incset_list = [] # sorted list of BackupSets
self.start_time, self.end_time = None, None
def set_full(self, fullset):
"""Add full backup set"""
assert not self.fullset and isinstance(fullset, BackupSet)
self.fullset = fullset
assert fullset.time
self.start_time, self.end_time = fullset.time, fullset.time
def add_inc(self, incset):
"""Add incset to self. Return None if incset does not match"""
if self.end_time == incset.start_time:
self.incset_list.append(incset)
else:
if (self.incset_list
and incset.start_time == self.incset_list[-1].start_time
and incset.end_time > self.incset_list[-1]):
log.Log("Preferring Backupset over previous one!", 8)
self.incset_list[-1] = incset
else:
log.Log("Ignoring incremental Backupset (start_time: %s; needed: %s)" %
(dup_time.timetopretty(incset.start_time),
dup_time.timetopretty(self.end_time)), 8)
return None
self.end_time = incset.end_time
log.Log("Added incremental Backupset (start_time: %s / end_time: %s)" %
(dup_time.timetopretty(incset.start_time),
dup_time.timetopretty(incset.end_time)), 8)
assert self.end_time
return 1
def delete(self):
"""Delete all sets in chain, in reverse order"""
for i in range(len(self.incset_list)-1, -1, -1):
self.incset_list[i].delete()
if self.fullset:
self.fullset.delete()
def get_sets_at_time(self, time):
"""Return a list of sets in chain earlier or equal to time"""
older_incsets = filter(lambda s: s.end_time <= time, self.incset_list)
return [self.fullset] + older_incsets
def get_last(self):
"""Return last BackupSet in chain"""
if self.incset_list:
return self.incset_list[-1]
else:
return self.fullset
def get_first(self):
"""Return first BackupSet in chain (ie the full backup)"""
return self.fullset
def __str__(self):
"""Return string representation, for testing purposes"""
set_schema = "%20s %30s %15s"
l = ["-------------------------",
"Chain start time: " + dup_time.timetopretty(self.start_time),
"Chain end time: " + dup_time.timetopretty(self.end_time),
"Number of contained backup sets: %d" %
(len(self.incset_list)+1,),
"Total number of contained volumes: %d" %
(self.get_num_volumes(),),
set_schema % ("Type of backup set:", "Time:", "Num volumes:")]
for s in self.get_all_sets():
if s.time:
type = "Full"
time = s.time
else:
type = "Incremental"
time = s.end_time
l.append(set_schema % (type, dup_time.timetopretty(time), len(s)))
l.append("-------------------------")
return "\n".join(l)
def get_num_volumes(self):
"""Return the total number of volumes in the chain"""
n = 0
for s in self.get_all_sets():
n += len(s)
return n
def get_all_sets(self):
"""Return list of all backup sets in chain"""
if self.fullset:
return [self.fullset] + self.incset_list
else:
return self.incset_list
class SignatureChain:
"""A number of linked signatures
Analog to BackupChain - start with a full-sig, and continue with
new-sigs.
"""
def __init__(self, local, location):
"""Return new SignatureChain.
local should be true iff the signature chain resides in
globals.archive_dir and false if the chain is in
globals.backend.
"""
if local:
self.archive_dir, self.backend = location, None
else:
self.archive_dir, self.backend = None, location
self.fullsig = None # filename of full signature
self.inclist = [] # list of filenames of incremental signatures
self.start_time, self.end_time = None, None
def __str__(self):
"""Local or Remote and List of files in the set"""
if self.archive_dir:
place = "local"
else:
place = "remote"
filelist = []
if self.fullsig:
filelist.append(self.fullsig)
filelist.extend(self.inclist)
return "%s: [%s]" % (place, ", ".join(filelist))
def check_times(self, time_list):
"""Check to make sure times are in whole seconds"""
for time in time_list:
if type(time) not in (types.LongType, types.IntType):
assert 0, "Time %s in %s wrong type" % (time, time_list)
def islocal(self):
"""Return true if represents a signature chain in archive_dir"""
if self.archive_dir:
return True
else:
return False
def add_filename(self, filename, pr = None):
"""Add new sig filename to current chain. Return true if fits"""
if not pr:
pr = file_naming.parse(filename)
if not pr:
return None
if self.fullsig:
if pr.type != "new-sig":
return None
if pr.start_time != self.end_time:
return None
self.inclist.append(filename)
self.check_times([pr.end_time])
self.end_time = pr.end_time
return 1
else:
if pr.type != "full-sig":
return None
self.fullsig = filename
self.check_times([pr.time, pr.time])
self.start_time, self.end_time = pr.time, pr.time
return 1
def get_fileobjs(self):
"""Return ordered list of signature fileobjs opened for reading"""
assert self.fullsig
if self.archive_dir: # local
def filename_to_fileobj(filename):
"""Open filename in archive_dir, return filtered fileobj"""
sig_dp = path.DupPath(self.archive_dir.name, (filename,))
return sig_dp.filtered_open("rb")
else:
filename_to_fileobj = self.backend.get_fileobj_read
return map(filename_to_fileobj, [self.fullsig] + self.inclist)
def delete(self):
"""Remove all files in signature set"""
# Try to delete in opposite order, so something useful even if aborted
if self.archive_dir:
for i in range(len(self.inclist)-1, -1, -1):
self.archive_dir.append(self.inclist[i]).delete()
self.archive_dir.append(self.fullsig).delete()
else:
assert self.backend
inclist_copy = self.inclist[:]
inclist_copy.reverse()
inclist_copy.append(self.fullsig)
self.backend.delete(inclist_copy)
def get_filenames(self):
"""Return ordered list of filenames in set"""
if self.fullsig:
l = [self.fullsig]
else:
l = []
l.extend(self.inclist)
return l
class CollectionsStatus:
"""Hold information about available chains and sets"""
def __init__(self, backend, archive_dir = None):
"""Make new object. Does not set values"""
self.backend, self.archive_dir = backend, archive_dir
# Will hold (signature chain, backup chain) pair of active
# (most recent) chains
self.matched_chain_pair = None
# These should be sorted by end_time
self.all_backup_chains = None
self.other_backup_chains = None
self.other_sig_chains = None
# Other misc paths and sets which shouldn't be there
self.orphaned_sig_names = None
self.orphaned_backup_sets = None
self.incomplete_backup_sets = None
# True if set_values() below has run
self.values_set = None
def __str__(self):
"""Return string summary of the collection"""
l = ["Connecting with backend: %s" %
(self.backend.__class__.__name__,),
"Archive dir: %s" % (self.archive_dir,)]
l.append("\nFound %d backup chains without signatures."
% len(self.other_backup_chains))
for i in range(len(self.other_backup_chains)):
l.append("Signature-less chain %d of %d:" %
(i+1, len(self.other_backup_chains)))
l.append(str(self.other_backup_chains[i]))
l.append("")
if self.matched_chain_pair:
l.append("\nFound a complete backup chain with matching "
"signature chain:")
l.append(str(self.matched_chain_pair[1]))
else:
l.append("No backup chains with active signatures found")
if self.orphaned_backup_sets or self.incomplete_backup_sets:
l.append("Also found %d backup sets not part of any chain,"
% (len(self.orphaned_backup_sets),))
l.append("and %d incomplete backup sets."
% (len(self.incomplete_backup_sets),))
l.append("These may be deleted by running duplicity with the "
"--cleanup option.")
else:
l.append("No orphaned or incomplete backup sets found.")
return "\n".join(l)
def set_values(self, sig_chain_warning = 1):
"""Set values from archive_dir and backend.
if archive_dir is None, omit any local chains. Returns self
for convenience. If sig_chain_warning is set to None, do not
warn about unnecessary sig chains. This is because there may
naturally be some unecessary ones after a full backup.
"""
self.values_set = 1
backend_filename_list = self.backend.list()
(backup_chains, self.orphaned_backup_sets,
self.incomplete_backup_sets) = \
self.get_backup_chains(backend_filename_list)
backup_chains = self.get_sorted_chains(backup_chains)
self.all_backup_chains = backup_chains
if self.archive_dir:
local_sig_chains, local_orphaned_sig_names = \
self.get_signature_chains(True)
else:
local_sig_chains, local_orphaned_sig_names = [], []
remote_sig_chains, remote_orphaned_sig_names = \
self.get_signature_chains(False, filelist = backend_filename_list)
self.orphaned_sig_names = (local_orphaned_sig_names +
remote_orphaned_sig_names)
self.set_matched_chain_pair(local_sig_chains + remote_sig_chains,
backup_chains)
self.warn(sig_chain_warning)
return self
def set_matched_chain_pair(self, sig_chains, backup_chains):
"""Set self.matched_chain_pair and self.other_sig/backup_chains
The latest matched_chain_pair will be set. If there are both
remote and local signature chains capable of matching the
latest backup chain, use the local sig chain (it does not need
to be downloaded).
"""
self.other_sig_chains = sig_chains
self.other_backup_chains = backup_chains[:]
self.matched_chain_pair = None
if sig_chains and backup_chains:
latest_backup_chain = backup_chains[-1]
sig_chains = self.get_sorted_chains(sig_chains)
for i in range(len(sig_chains)-1, -1, -1):
if sig_chains[i].end_time == latest_backup_chain.end_time:
pass
# See if the set before last matches:
elif (len(latest_backup_chain.get_all_sets()) >= 2 and
sig_chains[i].end_time == latest_backup_chain.get_all_sets()[-2].end_time):
# It matches, remove the last backup set:
log.Warn("Warning, discarding last backup set, because of missing signature file.")
self.incomplete_backup_sets.append(latest_backup_chain.incset_list[-1])
latest_backup_chain.incset_list = latest_backup_chain.incset_list[:-1]
else:
continue
# Found a matching pair:
if self.matched_chain_pair == None:
self.matched_chain_pair = (sig_chains[i], latest_backup_chain)
del sig_chains[i]
break
if self.matched_chain_pair:
# if we have local and remote sig chains, remove both from the other_sig_chains list
matched_sig_chain = self.matched_chain_pair[0]
if len(self.other_sig_chains) > 1:
for sig_chain in self.other_sig_chains[1:]:
if (sig_chain.islocal() != matched_sig_chain.islocal() and
sig_chain.start_time == matched_sig_chain.start_time and
sig_chain.end_time == matched_sig_chain.end_time):
self.other_sig_chains.remove(sig_chain)
self.other_sig_chains.remove(matched_sig_chain)
self.other_backup_chains.remove(self.matched_chain_pair[1])
def warn(self, sig_chain_warning):
"""Log various error messages if find incomplete/orphaned files"""
assert self.values_set
if self.orphaned_sig_names:
log.Log("Warning, found the following orphaned signature files:\n"
+ "\n".join(self.orphaned_sig_names), 2)
if self.other_sig_chains and sig_chain_warning:
if self.matched_chain_pair:
log.Log("Warning, found unnecessary signature chain(s)", 2)
else:
log.Log("Warning, found signatures but no corresponding "
"backup files", 2)
if self.incomplete_backup_sets:
log.Log("Warning, found incomplete backup sets, probably left "
"from aborted session", 2)
if self.orphaned_backup_sets:
log.Log("Warning, found the following orphaned backup files:\n"
+ "\n".join(map(lambda x: str(x),
self.orphaned_backup_sets)), 2)
def get_backup_chains(self, filename_list):
"""Split given filename_list into chains
Return value will be pair (list of chains, list of sets, list
of incomplete sets), where the list of sets will comprise sets
not fitting into any chain, and the incomplete sets are sets
missing files.
"""
# First put filenames in set form
sets = []
def add_to_sets(filename):
"""Try adding filename to existing sets, or make new one"""
for set in sets:
if set.add_filename(filename):
break
else:
new_set = BackupSet(self.backend)
if new_set.add_filename(filename):
sets.append(new_set)
else:
log.Log("Ignoring file '%s'" % filename, 9)
map(add_to_sets, filename_list)
sets, incomplete_sets = self.get_sorted_sets(sets)
chains, orphaned_sets = [], []
def add_to_chains(set):
"""Try adding set to existing chains, or make new one"""
if set.type == "full":
new_chain = BackupChain(self.backend)
new_chain.set_full(set)
chains.append(new_chain)
else:
assert set.type == "inc"
for chain in chains:
if chain.add_inc(set):
break
else:
orphaned_sets.append(set)
map(add_to_chains, sets)
return (chains, orphaned_sets, incomplete_sets)
def get_sorted_sets(self, set_list):
"""Sort set list by end time, return (sorted list, incomplete)"""
time_set_pairs, incomplete_sets = [], []
for set in set_list:
if not set.is_complete():
incomplete_sets.append(set)
elif set.type == "full":
time_set_pairs.append((set.time, set))
else:
time_set_pairs.append((set.end_time, set))
time_set_pairs.sort()
return (map(lambda p: p[1], time_set_pairs), incomplete_sets)
def get_signature_chains(self, local, filelist = None):
"""Find chains in archive_dir (if local is true) or backend
Use filelist if given, otherwise regenerate. Return value is
pair (list of chains, list of signature paths not in any
chains).
"""
def get_filelist():
if filelist is not None:
return filelist
elif local:
return self.archive_dir.listdir()
else:
return self.backend.list()
def get_new_sigchain():
"""Return new empty signature chain"""
if local:
return SignatureChain(True, self.archive_dir)
else:
return SignatureChain(False, self.backend)
# Build initial chains from full sig filenames
chains, new_sig_filenames = [], []
for filename in get_filelist():
pr = file_naming.parse(filename)
if pr:
if pr.type == "full-sig":
new_chain = get_new_sigchain()
assert new_chain.add_filename(filename, pr)
chains.append(new_chain)
elif pr.type == "new-sig":
new_sig_filenames.append(filename)
# Try adding new signatures to existing chains
orphaned_filenames = []
new_sig_filenames.sort()
for sig_filename in new_sig_filenames:
for chain in chains:
if chain.add_filename(sig_filename):
break
else:
orphaned_filenames.append(sig_filename)
return (chains, orphaned_filenames)
def get_sorted_chains(self, chain_list):
"""Return chains sorted by end_time. If tie, local goes last"""
# Build dictionary from end_times to lists of corresponding chains
endtime_chain_dict = {}
for chain in chain_list:
if endtime_chain_dict.has_key(chain.end_time):
endtime_chain_dict[chain.end_time].append(chain)
else:
endtime_chain_dict[chain.end_time] = [chain]
# Use dictionary to build final sorted list
sorted_end_times = endtime_chain_dict.keys()
sorted_end_times.sort()
sorted_chain_list = []
for end_time in sorted_end_times:
chain_list = endtime_chain_dict[end_time]
if len(chain_list) == 1:
sorted_chain_list.append(chain_list[0])
else:
assert len(chain_list) == 2
if chain_list[0].backend: # is remote, goes first
assert chain_list[1].archive_dir # other is local
sorted_chain_list.append(chain_list[0])
sorted_chain_list.append(chain_list[1])
else: # is local, goes second
assert chain_list[1].backend # other is remote
sorted_chain_list.append(chain_list[1])
sorted_chain_list.append(chain_list[0])
return sorted_chain_list
def get_backup_chain_at_time(self, time):
"""Return backup chain covering specified time
Tries to find the backup chain covering the given time. If
there is none, return the earliest chain before, and failing
that, the earliest chain.
"""
if not self.all_backup_chains:
raise CollectionsError("No backup chains found")
covering_chains = filter(lambda c: c.start_time <= time <= c.end_time,
self.all_backup_chains)
if len(covering_chains) > 1:
raise CollectionsError("Two chains cover the given time")
elif len(covering_chains) == 1:
return covering_chains[0]
old_chains = filter(lambda c: c.end_time < time,
self.all_backup_chains)
if old_chains:
return old_chains[-1]
else:
return self.all_backup_chains[0] # no chains are old enough
def cleanup_signatures(self):
"""Delete unnecessary older signatures"""
map(SignatureChain.delete, self.other_sig_chains)
def get_extraneous(self):
"""Return list of the names of extraneous duplicity files
A duplicity file is considered extraneous if it is
recognizable as a duplicity file, but isn't part of some
complete backup set, or current signature chain.
"""
assert self.values_set
filenames = []
ext_containers = (self.other_sig_chains, self.orphaned_backup_sets,
self.incomplete_backup_sets)
for set_or_chain_list in ext_containers:
for set_or_chain in set_or_chain_list:
filenames.extend(set_or_chain.get_filenames())
filenames.extend(self.orphaned_sig_names)
return filenames
def sort_sets(self, setlist):
"""Return new list containing same elems of setlist, sorted by time"""
pairs = map(lambda s: (s.get_time(), s), setlist)
pairs.sort()
return map(lambda p: p[1], pairs)
def get_chains_older_than(self, t):
"""Return a list of chains older than time t"""
assert self.values_set
return filter(lambda c: c.end_time < t, self.all_backup_chains)
def get_last_full_backup_time(self):
"""Return the time of the last full backup, or 0 if
there is none."""
return self.get_nth_last_full_backup_time(1)
def get_nth_last_full_backup_time(self, n):
"""Return the time of the nth to last full backup, or 0
if there is none."""
chain = self.get_nth_last_backup_chain(n)
if chain is None:
return 0
else:
return chain.get_first().time
def get_last_backup_chain(self):
"""Return the last full backup of the collection, or None
if there is no full backup chain."""
return self.get_nth_last_backup_chain(1)
def get_nth_last_backup_chain(self,n):
"""Return the nth-to-last full backup of the collection, or None
if there is less than n backup chains.
NOTE: n = 1 -> time of latest available chain (n = 0 is not
a valid input). Thus the second-to-last is obtained with n=2
rather than n=1."""
assert self.values_set
assert n > 0
if len(self.all_backup_chains) < n:
return None
sorted = self.all_backup_chains[:]
sorted.sort(reverse = True,
key = lambda chain: chain.get_first().time)
return sorted[n - 1]
def get_older_than(self, t):
"""Returns a list of backup sets older than the given time t
All of the times will be associated with an intact chain.
Furthermore, none of the times will be of a set which a newer
set may depend on. For instance, if set A is a full set older
than t, and set B is an incremental based on A which is newer
than tt, then the time of set A will not be returned.
"""
old_sets = []
for chain in self.get_chains_older_than(t):
if (not self.matched_chain_pair or
chain is not self.matched_chain_pair[1]):
# don't delete the active (matched) chain
old_sets.extend(chain.get_all_sets())
return self.sort_sets(old_sets)
def get_older_than_required(self, t):
"""Returns list of old backup sets required by new sets
This function is similar to the previous one, but it only
returns the times of sets which are old but part of the chains
where the newer end of the chain is newer than t.
"""
assert self.values_set
new_chains = filter(lambda c: c.end_time >= t, self.all_backup_chains)
result_sets = []
for chain in new_chains:
old_sets = filter(lambda s: s.get_time() < t, chain.get_all_sets())
result_sets.extend(old_sets)
return self.sort_sets(result_sets)
syntax highlighted by Code2HTML, v. 0.9.1