2006-12-03 10:01:43 +00:00
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
import os, random, sha
|
2007-01-21 22:01:34 +00:00
|
|
|
from zope.interface import implements
|
2007-03-30 17:52:19 +00:00
|
|
|
from twisted.python import log
|
2006-12-03 10:01:43 +00:00
|
|
|
from twisted.internet import defer
|
|
|
|
from twisted.application import service
|
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
from allmydata.util import idlib, mathutil, hashutil
|
2007-03-30 20:20:01 +00:00
|
|
|
from allmydata.util.assertutil import _assert
|
2007-04-12 20:13:25 +00:00
|
|
|
from allmydata import codec, hashtree
|
2007-03-30 17:52:19 +00:00
|
|
|
from allmydata.Crypto.Cipher import AES
|
2007-01-17 04:29:59 +00:00
|
|
|
from allmydata.uri import unpack_uri
|
2007-01-21 22:01:34 +00:00
|
|
|
from allmydata.interfaces import IDownloadTarget, IDownloader
|
2006-12-03 10:01:43 +00:00
|
|
|
|
|
|
|
class NotEnoughPeersError(Exception):
|
|
|
|
pass
|
|
|
|
|
|
|
|
class HaveAllPeersError(Exception):
|
|
|
|
# we use this to jump out of the loop
|
|
|
|
pass
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
|
|
|
|
class Output:
|
|
|
|
def __init__(self, downloadable, key):
|
|
|
|
self.downloadable = downloadable
|
|
|
|
self._decryptor = AES.new(key=key, mode=AES.MODE_CTR,
|
|
|
|
counterstart="\x00"*16)
|
|
|
|
self._verifierid_hasher = sha.new(netstring("allmydata_v1_verifierid"))
|
|
|
|
self._fileid_hasher = sha.new(netstring("allmydata_v1_fileid"))
|
2007-03-30 20:20:01 +00:00
|
|
|
self.length = 0
|
|
|
|
|
|
|
|
def open(self):
|
|
|
|
self.downloadable.open()
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
def write(self, crypttext):
|
2007-03-30 20:20:01 +00:00
|
|
|
self.length += len(crypttext)
|
2007-03-30 17:52:19 +00:00
|
|
|
self._verifierid_hasher.update(crypttext)
|
|
|
|
plaintext = self._decryptor.decrypt(crypttext)
|
|
|
|
self._fileid_hasher.update(plaintext)
|
|
|
|
self.downloadable.write(plaintext)
|
2007-03-30 20:20:01 +00:00
|
|
|
|
|
|
|
def close(self):
|
|
|
|
self.verifierid = self._verifierid_hasher.digest()
|
|
|
|
self.fileid = self._fileid_hasher.digest()
|
2007-03-30 17:52:19 +00:00
|
|
|
self.downloadable.close()
|
2007-03-30 20:20:01 +00:00
|
|
|
|
|
|
|
def finish(self):
|
2007-03-30 17:52:19 +00:00
|
|
|
return self.downloadable.finish()
|
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
class ValidatedBucket:
|
2007-04-13 02:41:48 +00:00
|
|
|
def __init__(self, sharenum, bucket,
|
|
|
|
share_hash_tree, roothash,
|
|
|
|
num_blocks):
|
2007-04-12 20:07:40 +00:00
|
|
|
self.sharenum = sharenum
|
|
|
|
self.bucket = bucket
|
2007-04-13 02:41:48 +00:00
|
|
|
self._share_hash = None # None means not validated yet
|
2007-04-12 20:07:40 +00:00
|
|
|
self.share_hash_tree = share_hash_tree
|
2007-04-13 02:41:48 +00:00
|
|
|
self._roothash = roothash
|
2007-04-12 20:13:25 +00:00
|
|
|
self.block_hash_tree = hashtree.IncompleteHashTree(num_blocks)
|
2007-04-12 20:07:40 +00:00
|
|
|
|
|
|
|
def get_block(self, blocknum):
|
2007-04-13 02:41:48 +00:00
|
|
|
# the first time we use this bucket, we need to fetch enough elements
|
|
|
|
# of the share hash tree to validate it from our share hash up to the
|
|
|
|
# hashroot.
|
|
|
|
if not self._share_hash:
|
|
|
|
d1 = self.bucket.callRemote('get_share_hashes')
|
|
|
|
else:
|
|
|
|
d1 = defer.succeed(None)
|
|
|
|
|
|
|
|
# we might need to grab some elements of our block hash tree, to
|
2007-04-12 20:07:40 +00:00
|
|
|
# validate the requested block up to the share hash
|
2007-04-13 02:41:48 +00:00
|
|
|
needed = self.block_hash_tree.needed_hashes(blocknum)
|
|
|
|
if needed:
|
|
|
|
# TODO: get fewer hashes, callRemote('get_block_hashes', needed)
|
2007-04-12 20:07:40 +00:00
|
|
|
d2 = self.bucket.callRemote('get_block_hashes')
|
|
|
|
else:
|
2007-04-13 02:41:48 +00:00
|
|
|
d2 = defer.succeed([])
|
|
|
|
|
|
|
|
d3 = self.bucket.callRemote('get_block', blocknum)
|
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
d = defer.gatherResults([d1, d2, d3])
|
2007-04-13 02:41:48 +00:00
|
|
|
d.addCallback(self._got_data, blocknum)
|
2007-04-12 20:07:40 +00:00
|
|
|
return d
|
|
|
|
|
2007-04-13 02:41:48 +00:00
|
|
|
def _got_data(self, res, blocknum):
|
|
|
|
sharehashes, blockhashes, blockdata = res
|
|
|
|
|
2007-04-16 20:08:19 +00:00
|
|
|
try:
|
|
|
|
if not self._share_hash:
|
|
|
|
sh = dict(sharehashes)
|
|
|
|
sh[0] = self._roothash # always use our own root, from the URI
|
|
|
|
sht = self.share_hash_tree
|
|
|
|
if sht.get_leaf_index(self.sharenum) not in sh:
|
|
|
|
raise hashutil.NotEnoughHashesError
|
|
|
|
sht.set_hashes(sh)
|
|
|
|
self._share_hash = sht.get_leaf(self.sharenum)
|
|
|
|
|
2007-04-18 03:27:56 +00:00
|
|
|
#log.msg("checking block_hash(shareid=%d, blocknum=%d) len=%d" %
|
|
|
|
# (self.sharenum, blocknum, len(blockdata)))
|
|
|
|
blockhash = hashtree.block_hash(blockdata)
|
2007-04-16 20:08:19 +00:00
|
|
|
# we always validate the blockhash
|
|
|
|
bh = dict(enumerate(blockhashes))
|
|
|
|
# replace blockhash root with validated value
|
|
|
|
bh[0] = self._share_hash
|
|
|
|
self.block_hash_tree.set_hashes(bh, {blocknum: blockhash})
|
|
|
|
|
2007-04-16 23:30:21 +00:00
|
|
|
except (hashtree.BadHashError, hashtree.NotEnoughHashesError):
|
2007-04-16 20:08:19 +00:00
|
|
|
# log.WEIRD: indicates undetected disk/network error, or more
|
|
|
|
# likely a programming error
|
2007-04-18 03:25:52 +00:00
|
|
|
log.msg("hash failure in block=%d, shnum=%d on %s" %
|
|
|
|
(blocknum, self.sharenum, self.bucket))
|
|
|
|
#log.msg(" block length: %d" % len(blockdata))
|
|
|
|
#log.msg(" block hash: %s" % idlib.b2a_or_none(blockhash)) # not safe
|
|
|
|
#log.msg(" block data: %r" % (blockdata,))
|
|
|
|
#log.msg(" root hash: %s" % idlib.b2a(self._roothash))
|
|
|
|
#log.msg(" share hash tree:\n" + self.share_hash_tree.dump())
|
|
|
|
#log.msg(" block hash tree:\n" + self.block_hash_tree.dump())
|
|
|
|
#lines = []
|
|
|
|
#for i,h in sorted(sharehashes):
|
|
|
|
# lines.append("%3d: %s" % (i, idlib.b2a_or_none(h)))
|
|
|
|
#log.msg(" sharehashes:\n" + "\n".join(lines) + "\n")
|
|
|
|
#lines = []
|
|
|
|
#for i,h in enumerate(blockhashes):
|
|
|
|
# lines.append("%3d: %s" % (i, idlib.b2a_or_none(h)))
|
|
|
|
#log.msg(" blockhashes:\n" + "\n".join(lines) + "\n")
|
2007-04-16 20:08:19 +00:00
|
|
|
raise
|
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
# If we made it here, the block is good. If the hash trees didn't
|
|
|
|
# like what they saw, they would have raised a BadHashError, causing
|
|
|
|
# our caller to see a Failure and thus ignore this block (as well as
|
|
|
|
# dropping this bucket).
|
|
|
|
return blockdata
|
|
|
|
|
|
|
|
|
2007-03-30 23:50:50 +00:00
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
class BlockDownloader:
|
2007-04-12 20:07:40 +00:00
|
|
|
def __init__(self, vbucket, blocknum, parent):
|
|
|
|
self.vbucket = vbucket
|
2007-03-30 17:52:19 +00:00
|
|
|
self.blocknum = blocknum
|
|
|
|
self.parent = parent
|
|
|
|
|
|
|
|
def start(self, segnum):
|
2007-04-12 20:07:40 +00:00
|
|
|
d = self.vbucket.get_block(segnum)
|
2007-03-30 17:52:19 +00:00
|
|
|
d.addCallbacks(self._hold_block, self._got_block_error)
|
|
|
|
return d
|
|
|
|
|
|
|
|
def _hold_block(self, data):
|
|
|
|
self.parent.hold_block(self.blocknum, data)
|
|
|
|
|
|
|
|
def _got_block_error(self, f):
|
2007-03-30 20:20:01 +00:00
|
|
|
log.msg("BlockDownloader[%d] got error: %s" % (self.blocknum, f))
|
2007-04-12 20:07:40 +00:00
|
|
|
self.parent.bucket_failed(self.blocknum, self.vbucket)
|
2007-03-30 17:52:19 +00:00
|
|
|
|
|
|
|
class SegmentDownloader:
|
2007-03-30 20:20:01 +00:00
|
|
|
def __init__(self, parent, segmentnumber, needed_shares):
|
|
|
|
self.parent = parent
|
2007-03-30 17:52:19 +00:00
|
|
|
self.segmentnumber = segmentnumber
|
|
|
|
self.needed_blocks = needed_shares
|
|
|
|
self.blocks = {} # k: blocknum, v: data
|
|
|
|
|
|
|
|
def start(self):
|
|
|
|
return self._download()
|
|
|
|
|
|
|
|
def _download(self):
|
|
|
|
d = self._try()
|
|
|
|
def _done(res):
|
|
|
|
if len(self.blocks) >= self.needed_blocks:
|
2007-03-30 20:20:01 +00:00
|
|
|
# we only need self.needed_blocks blocks
|
|
|
|
# we want to get the smallest blockids, because they are
|
|
|
|
# more likely to be fast "primary blocks"
|
|
|
|
blockids = sorted(self.blocks.keys())[:self.needed_blocks]
|
|
|
|
blocks = []
|
|
|
|
for blocknum in blockids:
|
|
|
|
blocks.append(self.blocks[blocknum])
|
|
|
|
return (blocks, blockids)
|
2007-03-30 17:52:19 +00:00
|
|
|
else:
|
|
|
|
return self._download()
|
|
|
|
d.addCallback(_done)
|
|
|
|
return d
|
|
|
|
|
|
|
|
def _try(self):
|
2007-04-12 20:07:40 +00:00
|
|
|
# fill our set of active buckets, maybe raising NotEnoughPeersError
|
|
|
|
active_buckets = self.parent._activate_enough_buckets()
|
2007-03-30 17:52:19 +00:00
|
|
|
# Now we have enough buckets, in self.parent.active_buckets.
|
2007-03-30 20:20:01 +00:00
|
|
|
|
|
|
|
# in test cases, bd.start might mutate active_buckets right away, so
|
|
|
|
# we need to put off calling start() until we've iterated all the way
|
2007-04-12 20:07:40 +00:00
|
|
|
# through it.
|
2007-03-30 20:20:01 +00:00
|
|
|
downloaders = []
|
2007-04-12 20:07:40 +00:00
|
|
|
for blocknum, vbucket in active_buckets.iteritems():
|
|
|
|
bd = BlockDownloader(vbucket, blocknum, self)
|
2007-03-30 20:20:01 +00:00
|
|
|
downloaders.append(bd)
|
|
|
|
l = [bd.start(self.segmentnumber) for bd in downloaders]
|
2007-04-12 20:07:40 +00:00
|
|
|
return defer.DeferredList(l, fireOnOneErrback=True)
|
2007-03-30 17:52:19 +00:00
|
|
|
|
|
|
|
def hold_block(self, blocknum, data):
|
|
|
|
self.blocks[blocknum] = data
|
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
def bucket_failed(self, shnum, vbucket):
|
2007-03-30 17:52:19 +00:00
|
|
|
del self.parent.active_buckets[shnum]
|
|
|
|
s = self.parent._share_buckets[shnum]
|
2007-04-12 20:07:40 +00:00
|
|
|
# s is a set of ValidatedBucket instances
|
|
|
|
s.remove(vbucket)
|
|
|
|
# ... which might now be empty
|
2007-03-30 17:52:19 +00:00
|
|
|
if not s:
|
2007-04-12 20:07:40 +00:00
|
|
|
# there are no more buckets which can provide this share, so
|
|
|
|
# remove the key. This may prompt us to use a different share.
|
2007-03-30 17:52:19 +00:00
|
|
|
del self.parent._share_buckets[shnum]
|
2007-04-12 20:07:40 +00:00
|
|
|
|
2006-12-03 10:01:43 +00:00
|
|
|
class FileDownloader:
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
def __init__(self, client, uri, downloadable):
|
|
|
|
self._client = client
|
|
|
|
self._downloadable = downloadable
|
2007-03-30 23:50:50 +00:00
|
|
|
(codec_name, codec_params, tail_codec_params, verifierid, roothash, needed_shares, total_shares, size, segment_size) = unpack_uri(uri)
|
2006-12-03 10:01:43 +00:00
|
|
|
assert isinstance(verifierid, str)
|
2007-01-16 04:22:22 +00:00
|
|
|
assert len(verifierid) == 20
|
2006-12-03 10:01:43 +00:00
|
|
|
self._verifierid = verifierid
|
2007-03-30 17:52:19 +00:00
|
|
|
self._roothash = roothash
|
2007-03-30 23:50:50 +00:00
|
|
|
|
|
|
|
self._codec = codec.get_decoder_by_name(codec_name)
|
|
|
|
self._codec.set_serialized_params(codec_params)
|
|
|
|
self._tail_codec = codec.get_decoder_by_name(codec_name)
|
|
|
|
self._tail_codec.set_serialized_params(tail_codec_params)
|
|
|
|
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
self._total_segments = mathutil.div_ceil(size, segment_size)
|
|
|
|
self._current_segnum = 0
|
|
|
|
self._segment_size = segment_size
|
2007-03-30 20:20:01 +00:00
|
|
|
self._size = size
|
2007-03-30 23:50:50 +00:00
|
|
|
self._num_needed_shares = self._codec.get_needed_shares()
|
2007-03-30 20:20:01 +00:00
|
|
|
|
|
|
|
key = "\x00" * 16
|
|
|
|
self._output = Output(downloadable, key)
|
2007-03-30 17:52:19 +00:00
|
|
|
|
2007-04-12 20:13:25 +00:00
|
|
|
self._share_hashtree = hashtree.IncompleteHashTree(total_shares)
|
2007-04-12 20:07:40 +00:00
|
|
|
self._share_hashtree.set_hashes({0: roothash})
|
2007-04-07 05:51:19 +00:00
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
self.active_buckets = {} # k: shnum, v: bucket
|
|
|
|
self._share_buckets = {} # k: shnum, v: set of buckets
|
2006-12-03 10:01:43 +00:00
|
|
|
|
|
|
|
def start(self):
|
2007-01-16 04:22:22 +00:00
|
|
|
log.msg("starting download [%s]" % (idlib.b2a(self._verifierid),))
|
2007-03-30 17:52:19 +00:00
|
|
|
|
2007-04-12 20:07:40 +00:00
|
|
|
# first step: who should we download from?
|
2007-03-30 17:52:19 +00:00
|
|
|
d = defer.maybeDeferred(self._get_all_shareholders)
|
|
|
|
d.addCallback(self._got_all_shareholders)
|
2007-04-12 20:07:40 +00:00
|
|
|
# once we know that, we can download blocks from them
|
2007-03-30 17:52:19 +00:00
|
|
|
d.addCallback(self._download_all_segments)
|
|
|
|
d.addCallback(self._done)
|
|
|
|
return d
|
2006-12-03 10:01:43 +00:00
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
def _get_all_shareholders(self):
|
|
|
|
dl = []
|
|
|
|
for (permutedpeerid, peerid, connection) in self._client.get_permuted_peers(self._verifierid):
|
2007-03-30 23:50:50 +00:00
|
|
|
d = connection.callRemote("get_service", "storageserver")
|
|
|
|
d.addCallback(lambda ss: ss.callRemote("get_buckets",
|
|
|
|
self._verifierid))
|
2007-03-30 17:52:19 +00:00
|
|
|
d.addCallbacks(self._got_response, self._got_error,
|
|
|
|
callbackArgs=(connection,))
|
|
|
|
dl.append(d)
|
|
|
|
return defer.DeferredList(dl)
|
|
|
|
|
|
|
|
def _got_response(self, buckets, connection):
|
2007-03-31 01:00:40 +00:00
|
|
|
_assert(isinstance(buckets, dict), buckets) # soon foolscap will check this for us with its DictOf schema constraint
|
2007-03-30 23:50:50 +00:00
|
|
|
for sharenum, bucket in buckets.iteritems():
|
2007-04-12 20:07:40 +00:00
|
|
|
self.add_share_bucket(sharenum, bucket)
|
|
|
|
|
|
|
|
def add_share_bucket(self, sharenum, bucket):
|
|
|
|
vbucket = ValidatedBucket(sharenum, bucket,
|
|
|
|
self._share_hashtree,
|
2007-04-13 02:41:48 +00:00
|
|
|
self._roothash,
|
2007-04-12 20:07:40 +00:00
|
|
|
self._total_segments)
|
|
|
|
self._share_buckets.setdefault(sharenum, set()).add(vbucket)
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
def _got_error(self, f):
|
|
|
|
self._client.log("Somebody failed. -- %s" % (f,))
|
|
|
|
|
|
|
|
def _got_all_shareholders(self, res):
|
2007-03-30 20:20:01 +00:00
|
|
|
if len(self._share_buckets) < self._num_needed_shares:
|
2007-03-30 17:52:19 +00:00
|
|
|
raise NotEnoughPeersError
|
2007-04-12 20:07:40 +00:00
|
|
|
for s in self._share_buckets.values():
|
|
|
|
for vb in s:
|
|
|
|
assert isinstance(vb, ValidatedBucket), \
|
|
|
|
"vb is %s but should be a ValidatedBucket" % (vb,)
|
|
|
|
|
|
|
|
|
|
|
|
def _activate_enough_buckets(self):
|
|
|
|
"""either return a mapping from shnum to a ValidatedBucket that can
|
|
|
|
provide data for that share, or raise NotEnoughPeersError"""
|
|
|
|
|
|
|
|
while len(self.active_buckets) < self._num_needed_shares:
|
|
|
|
# need some more
|
|
|
|
handled_shnums = set(self.active_buckets.keys())
|
|
|
|
available_shnums = set(self._share_buckets.keys())
|
|
|
|
potential_shnums = list(available_shnums - handled_shnums)
|
|
|
|
if not potential_shnums:
|
|
|
|
raise NotEnoughPeersError
|
|
|
|
# choose a random share
|
|
|
|
shnum = random.choice(potential_shnums)
|
|
|
|
# and a random bucket that will provide it
|
|
|
|
validated_bucket = random.choice(list(self._share_buckets[shnum]))
|
|
|
|
self.active_buckets[shnum] = validated_bucket
|
|
|
|
return self.active_buckets
|
2006-12-03 10:01:43 +00:00
|
|
|
|
2007-03-30 20:20:01 +00:00
|
|
|
|
2007-03-30 23:50:50 +00:00
|
|
|
def _download_all_segments(self, res):
|
2007-04-12 20:07:40 +00:00
|
|
|
# the promise: upon entry to this function, self._share_buckets
|
|
|
|
# contains enough buckets to complete the download, and some extra
|
|
|
|
# ones to tolerate some buckets dropping out or having errors.
|
|
|
|
# self._share_buckets is a dictionary that maps from shnum to a set
|
|
|
|
# of ValidatedBuckets, which themselves are wrappers around
|
|
|
|
# RIBucketReader references.
|
|
|
|
self.active_buckets = {} # k: shnum, v: ValidatedBucket instance
|
|
|
|
self._output.open()
|
|
|
|
|
2007-03-30 23:50:50 +00:00
|
|
|
d = defer.succeed(None)
|
|
|
|
for segnum in range(self._total_segments-1):
|
|
|
|
d.addCallback(self._download_segment, segnum)
|
|
|
|
d.addCallback(self._download_tail_segment, self._total_segments-1)
|
|
|
|
return d
|
|
|
|
|
|
|
|
def _download_segment(self, res, segnum):
|
|
|
|
segmentdler = SegmentDownloader(self, segnum, self._num_needed_shares)
|
|
|
|
d = segmentdler.start()
|
|
|
|
d.addCallback(lambda (shares, shareids):
|
|
|
|
self._codec.decode(shares, shareids))
|
2007-03-30 17:52:19 +00:00
|
|
|
def _done(res):
|
2007-03-30 23:50:50 +00:00
|
|
|
for buf in res:
|
|
|
|
self._output.write(buf)
|
2007-03-30 17:52:19 +00:00
|
|
|
d.addCallback(_done)
|
2006-12-03 10:01:43 +00:00
|
|
|
return d
|
|
|
|
|
2007-03-30 23:50:50 +00:00
|
|
|
def _download_tail_segment(self, res, segnum):
|
2007-03-30 20:20:01 +00:00
|
|
|
segmentdler = SegmentDownloader(self, segnum, self._num_needed_shares)
|
2007-03-30 17:52:19 +00:00
|
|
|
d = segmentdler.start()
|
2007-03-30 20:20:01 +00:00
|
|
|
d.addCallback(lambda (shares, shareids):
|
2007-03-30 23:50:50 +00:00
|
|
|
self._tail_codec.decode(shares, shareids))
|
2007-03-30 17:52:19 +00:00
|
|
|
def _done(res):
|
2007-03-30 23:50:50 +00:00
|
|
|
# trim off any padding added by the upload side
|
|
|
|
data = ''.join(res)
|
2007-04-17 20:39:35 +00:00
|
|
|
# we never send empty segments. If the data was an exact multiple
|
|
|
|
# of the segment size, the last segment will be full.
|
|
|
|
pad_size = mathutil.pad_size(self._size, self._segment_size)
|
|
|
|
tail_size = self._segment_size - pad_size
|
2007-03-30 23:50:50 +00:00
|
|
|
self._output.write(data[:tail_size])
|
2007-03-30 17:52:19 +00:00
|
|
|
d.addCallback(_done)
|
2006-12-03 10:01:43 +00:00
|
|
|
return d
|
|
|
|
|
2007-03-30 17:52:19 +00:00
|
|
|
def _done(self, res):
|
2007-03-30 20:20:01 +00:00
|
|
|
self._output.close()
|
|
|
|
#print "VERIFIERID: %s" % idlib.b2a(self._output.verifierid)
|
|
|
|
#print "FILEID: %s" % idlib.b2a(self._output.fileid)
|
|
|
|
#assert self._verifierid == self._output.verifierid
|
|
|
|
#assert self._fileid = self._output.fileid
|
|
|
|
_assert(self._output.length == self._size,
|
|
|
|
got=self._output.length, expected=self._size)
|
2007-03-30 17:52:19 +00:00
|
|
|
return self._output.finish()
|
2007-01-16 04:22:22 +00:00
|
|
|
|
2006-12-03 10:01:43 +00:00
|
|
|
|
|
|
|
def netstring(s):
|
|
|
|
return "%d:%s," % (len(s), s)
|
|
|
|
|
2006-12-04 05:42:19 +00:00
|
|
|
class FileName:
|
|
|
|
implements(IDownloadTarget)
|
|
|
|
def __init__(self, filename):
|
|
|
|
self._filename = filename
|
|
|
|
def open(self):
|
|
|
|
self.f = open(self._filename, "wb")
|
|
|
|
return self.f
|
|
|
|
def write(self, data):
|
|
|
|
self.f.write(data)
|
|
|
|
def close(self):
|
|
|
|
self.f.close()
|
|
|
|
def fail(self):
|
|
|
|
self.f.close()
|
|
|
|
os.unlink(self._filename)
|
|
|
|
def register_canceller(self, cb):
|
|
|
|
pass # we won't use it
|
|
|
|
def finish(self):
|
|
|
|
pass
|
|
|
|
|
|
|
|
class Data:
|
|
|
|
implements(IDownloadTarget)
|
|
|
|
def __init__(self):
|
|
|
|
self._data = []
|
|
|
|
def open(self):
|
|
|
|
pass
|
|
|
|
def write(self, data):
|
|
|
|
self._data.append(data)
|
|
|
|
def close(self):
|
|
|
|
self.data = "".join(self._data)
|
|
|
|
del self._data
|
|
|
|
def fail(self):
|
|
|
|
del self._data
|
|
|
|
def register_canceller(self, cb):
|
|
|
|
pass # we won't use it
|
|
|
|
def finish(self):
|
|
|
|
return self.data
|
|
|
|
|
|
|
|
class FileHandle:
|
2007-04-16 20:07:36 +00:00
|
|
|
"""Use me to download data to a pre-defined filehandle-like object. I
|
|
|
|
will use the target's write() method. I will *not* close the filehandle:
|
|
|
|
I leave that up to the originator of the filehandle. The download process
|
|
|
|
will return the filehandle when it completes.
|
|
|
|
"""
|
2006-12-04 05:42:19 +00:00
|
|
|
implements(IDownloadTarget)
|
|
|
|
def __init__(self, filehandle):
|
|
|
|
self._filehandle = filehandle
|
|
|
|
def open(self):
|
|
|
|
pass
|
|
|
|
def write(self, data):
|
|
|
|
self._filehandle.write(data)
|
|
|
|
def close(self):
|
|
|
|
# the originator of the filehandle reserves the right to close it
|
|
|
|
pass
|
|
|
|
def fail(self):
|
|
|
|
pass
|
|
|
|
def register_canceller(self, cb):
|
|
|
|
pass
|
|
|
|
def finish(self):
|
2007-04-16 20:07:36 +00:00
|
|
|
return self._filehandle
|
2006-12-04 05:42:19 +00:00
|
|
|
|
2006-12-03 10:01:43 +00:00
|
|
|
class Downloader(service.MultiService):
|
|
|
|
"""I am a service that allows file downloading.
|
|
|
|
"""
|
2006-12-04 11:06:09 +00:00
|
|
|
implements(IDownloader)
|
2006-12-03 10:01:43 +00:00
|
|
|
name = "downloader"
|
|
|
|
|
2007-01-16 04:22:22 +00:00
|
|
|
def download(self, uri, t):
|
2006-12-03 10:01:43 +00:00
|
|
|
assert self.parent
|
|
|
|
assert self.running
|
2006-12-04 05:42:19 +00:00
|
|
|
t = IDownloadTarget(t)
|
|
|
|
assert t.write
|
|
|
|
assert t.close
|
2007-03-30 23:50:50 +00:00
|
|
|
dl = FileDownloader(self.parent, uri, t)
|
2006-12-03 10:01:43 +00:00
|
|
|
d = dl.start()
|
|
|
|
return d
|
|
|
|
|
2006-12-04 05:42:19 +00:00
|
|
|
# utility functions
|
2007-01-16 04:22:22 +00:00
|
|
|
def download_to_data(self, uri):
|
|
|
|
return self.download(uri, Data())
|
|
|
|
def download_to_filename(self, uri, filename):
|
|
|
|
return self.download(uri, FileName(filename))
|
|
|
|
def download_to_filehandle(self, uri, filehandle):
|
|
|
|
return self.download(uri, FileHandle(filehandle))
|
2006-12-04 05:42:19 +00:00
|
|
|
|
2006-12-03 10:01:43 +00:00
|
|
|
|