src/allmydata/test/test_mutable.py

   1 import os, re, base64
   2 from cStringIO import StringIO
   3
   4 from twisted.trial import unittest
   5 from twisted.internet import defer, reactor
   6
   7 from allmydata import uri, client
   8 from allmydata.nodemaker import NodeMaker
   9 from allmydata.util import base32, consumer, fileutil, mathutil
  10 from allmydata.util.fileutil import abspath_expanduser_unicode
  11 from allmydata.util.hashutil import tagged_hash, ssk_writekey_hash, \
  12      ssk_pubkey_fingerprint_hash
  13 from allmydata.util.consumer import MemoryConsumer
  14 from allmydata.util.deferredutil import gatherResults
  15 from allmydata.interfaces import IRepairResults, ICheckAndRepairResults, \
  16      NotEnoughSharesError, SDMF_VERSION, MDMF_VERSION, DownloadStopped
  17 from allmydata.monitor import Monitor
  18 from allmydata.test.common import ShouldFailMixin
  19 from allmydata.test.no_network import GridTestMixin
  20 from foolscap.api import eventually, fireEventually
  21 from foolscap.logging import log
  22 from allmydata.storage_client import StorageFarmBroker
  23 from allmydata.storage.common import storage_index_to_dir
  24 from allmydata.scripts import debug
  25
  26 from allmydata.mutable.filenode import MutableFileNode, BackoffAgent
  27 from allmydata.mutable.common import \
  28      MODE_CHECK, MODE_ANYTHING, MODE_WRITE, MODE_READ, \
  29      NeedMoreDataError, UnrecoverableFileError, UncoordinatedWriteError, \
  30      NotEnoughServersError, CorruptShareError
  31 from allmydata.mutable.retrieve import Retrieve
  32 from allmydata.mutable.publish import Publish, MutableFileHandle, \
  33                                       MutableData, \
  34                                       DEFAULT_MAX_SEGMENT_SIZE
  35 from allmydata.mutable.servermap import ServerMap, ServermapUpdater
  36 from allmydata.mutable.layout import unpack_header, MDMFSlotReadProxy
  37 from allmydata.mutable.repairer import MustForceRepairError
  38
  39 import allmydata.test.common_util as testutil
  40 from allmydata.test.common import TEST_RSA_KEY_SIZE
  41 from allmydata.test.test_download import PausingConsumer, \
  42      PausingAndStoppingConsumer, StoppingConsumer, \
  43      ImmediatelyStoppingConsumer
  44
  45 def eventuaaaaaly(res=None):
  46     d = fireEventually(res)
  47     d.addCallback(fireEventually)
  48     d.addCallback(fireEventually)
  49     return d
  50
  51
  52 # this "FakeStorage" exists to put the share data in RAM and avoid using real
  53 # network connections, both to speed up the tests and to reduce the amount of
  54 # non-mutable.py code being exercised.
  55
  56 class FakeStorage:
  57     # this class replaces the collection of storage servers, allowing the
  58     # tests to examine and manipulate the published shares. It also lets us
  59     # control the order in which read queries are answered, to exercise more
  60     # of the error-handling code in Retrieve .
  61     #
  62     # Note that we ignore the storage index: this FakeStorage instance can
  63     # only be used for a single storage index.
  64
  65
  66     def __init__(self):
  67         self._peers = {}
  68         # _sequence is used to cause the responses to occur in a specific
  69         # order. If it is in use, then we will defer queries instead of
  70         # answering them right away, accumulating the Deferreds in a dict. We
  71         # don't know exactly how many queries we'll get, so exactly one
  72         # second after the first query arrives, we will release them all (in
  73         # order).
  74         self._sequence = None
  75         self._pending = {}
  76         self._pending_timer = None
  77
  78     def read(self, peerid, storage_index):
  79         shares = self._peers.get(peerid, {})
  80         if self._sequence is None:
  81             return eventuaaaaaly(shares)
  82         d = defer.Deferred()
  83         if not self._pending:
  84             self._pending_timer = reactor.callLater(1.0, self._fire_readers)
  85         if peerid not in self._pending:
  86             self._pending[peerid] = []
  87         self._pending[peerid].append( (d, shares) )
  88         return d
  89
  90     def _fire_readers(self):
  91         self._pending_timer = None
  92         pending = self._pending
  93         self._pending = {}
  94         for peerid in self._sequence:
  95             if peerid in pending:
  96                 for (d, shares) in pending.pop(peerid):
  97                     eventually(d.callback, shares)
  98         for peerid in pending:
  99             for (d, shares) in pending[peerid]:
 100                 eventually(d.callback, shares)
 101
 102     def write(self, peerid, storage_index, shnum, offset, data):
 103         if peerid not in self._peers:
 104             self._peers[peerid] = {}
 105         shares = self._peers[peerid]
 106         f = StringIO()
 107         f.write(shares.get(shnum, ""))
 108         f.seek(offset)
 109         f.write(data)
 110         shares[shnum] = f.getvalue()
 111
 112
 113 class FakeStorageServer:
 114     def __init__(self, peerid, storage):
 115         self.peerid = peerid
 116         self.storage = storage
 117         self.queries = 0
 118     def callRemote(self, methname, *args, **kwargs):
 119         self.queries += 1
 120         def _call():
 121             meth = getattr(self, methname)
 122             return meth(*args, **kwargs)
 123         d = fireEventually()
 124         d.addCallback(lambda res: _call())
 125         return d
 126
 127     def callRemoteOnly(self, methname, *args, **kwargs):
 128         self.queries += 1
 129         d = self.callRemote(methname, *args, **kwargs)
 130         d.addBoth(lambda ignore: None)
 131         pass
 132
 133     def advise_corrupt_share(self, share_type, storage_index, shnum, reason):
 134         pass
 135
 136     def slot_readv(self, storage_index, shnums, readv):
 137         d = self.storage.read(self.peerid, storage_index)
 138         def _read(shares):
 139             response = {}
 140             for shnum in shares:
 141                 if shnums and shnum not in shnums:
 142                     continue
 143                 vector = response[shnum] = []
 144                 for (offset, length) in readv:
 145                     assert isinstance(offset, (int, long)), offset
 146                     assert isinstance(length, (int, long)), length
 147                     vector.append(shares[shnum][offset:offset+length])
 148             return response
 149         d.addCallback(_read)
 150         return d
 151
 152     def slot_testv_and_readv_and_writev(self, storage_index, secrets,
 153                                         tw_vectors, read_vector):
 154         # always-pass: parrot the test vectors back to them.
 155         readv = {}
 156         for shnum, (testv, writev, new_length) in tw_vectors.items():
 157             for (offset, length, op, specimen) in testv:
 158                 assert op in ("le", "eq", "ge")
 159             # TODO: this isn't right, the read is controlled by read_vector,
 160             # not by testv
 161             readv[shnum] = [ specimen
 162                              for (offset, length, op, specimen)
 163                              in testv ]
 164             for (offset, data) in writev:
 165                 self.storage.write(self.peerid, storage_index, shnum,
 166                                    offset, data)
 167         answer = (True, readv)
 168         return fireEventually(answer)
 169
 170
 171 def flip_bit(original, byte_offset):
 172     return (original[:byte_offset] +
 173             chr(ord(original[byte_offset]) ^ 0x01) +
 174             original[byte_offset+1:])
 175
 176 def add_two(original, byte_offset):
 177     # It isn't enough to simply flip the bit for the version number,
 178     # because 1 is a valid version number. So we add two instead.
 179     return (original[:byte_offset] +
 180             chr(ord(original[byte_offset]) ^ 0x02) +
 181             original[byte_offset+1:])
 182
 183 def corrupt(res, s, offset, shnums_to_corrupt=None, offset_offset=0):
 184     # if shnums_to_corrupt is None, corrupt all shares. Otherwise it is a
 185     # list of shnums to corrupt.
 186     ds = []
 187     for peerid in s._peers:
 188         shares = s._peers[peerid]
 189         for shnum in shares:
 190             if (shnums_to_corrupt is not None
 191                 and shnum not in shnums_to_corrupt):
 192                 continue
 193             data = shares[shnum]
 194             # We're feeding the reader all of the share data, so it
 195             # won't need to use the rref that we didn't provide, nor the
 196             # storage index that we didn't provide. We do this because
 197             # the reader will work for both MDMF and SDMF.
 198             reader = MDMFSlotReadProxy(None, None, shnum, data)
 199             # We need to get the offsets for the next part.
 200             d = reader.get_verinfo()
 201             def _do_corruption(verinfo, data, shnum, shares):
 202                 (seqnum,
 203                  root_hash,
 204                  IV,
 205                  segsize,
 206                  datalen,
 207                  k, n, prefix, o) = verinfo
 208                 if isinstance(offset, tuple):
 209                     offset1, offset2 = offset
 210                 else:
 211                     offset1 = offset
 212                     offset2 = 0
 213                 if offset1 == "pubkey" and IV:
 214                     real_offset = 107
 215                 elif offset1 in o:
 216                     real_offset = o[offset1]
 217                 else:
 218                     real_offset = offset1
 219                 real_offset = int(real_offset) + offset2 + offset_offset
 220                 assert isinstance(real_offset, int), offset
 221                 if offset1 == 0: # verbyte
 222                     f = add_two
 223                 else:
 224                     f = flip_bit
 225                 shares[shnum] = f(data, real_offset)
 226             d.addCallback(_do_corruption, data, shnum, shares)
 227             ds.append(d)
 228     dl = defer.DeferredList(ds)
 229     dl.addCallback(lambda ignored: res)
 230     return dl
 231
 232 def make_storagebroker(s=None, num_peers=10):
 233     if not s:
 234         s = FakeStorage()
 235     peerids = [tagged_hash("peerid", "%d" % i)[:20]
 236                for i in range(num_peers)]
 237     storage_broker = StorageFarmBroker(None, True)
 238     for peerid in peerids:
 239         fss = FakeStorageServer(peerid, s)
 240         ann = {"anonymous-storage-FURL": "pb://%s@nowhere/fake" % base32.b2a(peerid),
 241                "permutation-seed-base32": base32.b2a(peerid) }
 242         storage_broker.test_add_rref(peerid, fss, ann)
 243     return storage_broker
 244
 245 def make_nodemaker(s=None, num_peers=10, keysize=TEST_RSA_KEY_SIZE):
 246     storage_broker = make_storagebroker(s, num_peers)
 247     sh = client.SecretHolder("lease secret", "convergence secret")
 248     keygen = client.KeyGenerator()
 249     if keysize:
 250         keygen.set_default_keysize(keysize)
 251     nodemaker = NodeMaker(storage_broker, sh, None,
 252                           None, None,
 253                           {"k": 3, "n": 10}, SDMF_VERSION, keygen)
 254     return nodemaker
 255
 256 class Filenode(unittest.TestCase, testutil.ShouldFailMixin):
 257     # this used to be in Publish, but we removed the limit. Some of
 258     # these tests test whether the new code correctly allows files
 259     # larger than the limit.
 260     OLD_MAX_SEGMENT_SIZE = 3500000
 261     def setUp(self):
 262         self._storage = s = FakeStorage()
 263         self.nodemaker = make_nodemaker(s)
 264
 265     def test_create(self):
 266         d = self.nodemaker.create_mutable_file()
 267         def _created(n):
 268             self.failUnless(isinstance(n, MutableFileNode))
 269             self.failUnlessEqual(n.get_storage_index(), n._storage_index)
 270             sb = self.nodemaker.storage_broker
 271             peer0 = sorted(sb.get_all_serverids())[0]
 272             shnums = self._storage._peers[peer0].keys()
 273             self.failUnlessEqual(len(shnums), 1)
 274         d.addCallback(_created)
 275         return d
 276
 277
 278     def test_create_mdmf(self):
 279         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 280         def _created(n):
 281             self.failUnless(isinstance(n, MutableFileNode))
 282             self.failUnlessEqual(n.get_storage_index(), n._storage_index)
 283             sb = self.nodemaker.storage_broker
 284             peer0 = sorted(sb.get_all_serverids())[0]
 285             shnums = self._storage._peers[peer0].keys()
 286             self.failUnlessEqual(len(shnums), 1)
 287         d.addCallback(_created)
 288         return d
 289
 290     def test_single_share(self):
 291         # Make sure that we tolerate publishing a single share.
 292         self.nodemaker.default_encoding_parameters['k'] = 1
 293         self.nodemaker.default_encoding_parameters['happy'] = 1
 294         self.nodemaker.default_encoding_parameters['n'] = 1
 295         d = defer.succeed(None)
 296         for v in (SDMF_VERSION, MDMF_VERSION):
 297             d.addCallback(lambda ignored, v=v:
 298                 self.nodemaker.create_mutable_file(version=v))
 299             def _created(n):
 300                 self.failUnless(isinstance(n, MutableFileNode))
 301                 self._node = n
 302                 return n
 303             d.addCallback(_created)
 304             d.addCallback(lambda n:
 305                 n.overwrite(MutableData("Contents" * 50000)))
 306             d.addCallback(lambda ignored:
 307                 self._node.download_best_version())
 308             d.addCallback(lambda contents:
 309                 self.failUnlessEqual(contents, "Contents" * 50000))
 310         return d
 311
 312     def test_max_shares(self):
 313         self.nodemaker.default_encoding_parameters['n'] = 255
 314         d = self.nodemaker.create_mutable_file(version=SDMF_VERSION)
 315         def _created(n):
 316             self.failUnless(isinstance(n, MutableFileNode))
 317             self.failUnlessEqual(n.get_storage_index(), n._storage_index)
 318             sb = self.nodemaker.storage_broker
 319             num_shares = sum([len(self._storage._peers[x].keys()) for x \
 320                               in sb.get_all_serverids()])
 321             self.failUnlessEqual(num_shares, 255)
 322             self._node = n
 323             return n
 324         d.addCallback(_created)
 325         # Now we upload some contents
 326         d.addCallback(lambda n:
 327             n.overwrite(MutableData("contents" * 50000)))
 328         # ...then download contents
 329         d.addCallback(lambda ignored:
 330             self._node.download_best_version())
 331         # ...and check to make sure everything went okay.
 332         d.addCallback(lambda contents:
 333             self.failUnlessEqual("contents" * 50000, contents))
 334         return d
 335
 336     def test_max_shares_mdmf(self):
 337         # Test how files behave when there are 255 shares.
 338         self.nodemaker.default_encoding_parameters['n'] = 255
 339         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 340         def _created(n):
 341             self.failUnless(isinstance(n, MutableFileNode))
 342             self.failUnlessEqual(n.get_storage_index(), n._storage_index)
 343             sb = self.nodemaker.storage_broker
 344             num_shares = sum([len(self._storage._peers[x].keys()) for x \
 345                               in sb.get_all_serverids()])
 346             self.failUnlessEqual(num_shares, 255)
 347             self._node = n
 348             return n
 349         d.addCallback(_created)
 350         d.addCallback(lambda n:
 351             n.overwrite(MutableData("contents" * 50000)))
 352         d.addCallback(lambda ignored:
 353             self._node.download_best_version())
 354         d.addCallback(lambda contents:
 355             self.failUnlessEqual(contents, "contents" * 50000))
 356         return d
 357
 358     def test_mdmf_filenode_cap(self):
 359         # Test that an MDMF filenode, once created, returns an MDMF URI.
 360         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 361         def _created(n):
 362             self.failUnless(isinstance(n, MutableFileNode))
 363             cap = n.get_cap()
 364             self.failUnless(isinstance(cap, uri.WriteableMDMFFileURI))
 365             rcap = n.get_readcap()
 366             self.failUnless(isinstance(rcap, uri.ReadonlyMDMFFileURI))
 367             vcap = n.get_verify_cap()
 368             self.failUnless(isinstance(vcap, uri.MDMFVerifierURI))
 369         d.addCallback(_created)
 370         return d
 371
 372
 373     def test_create_from_mdmf_writecap(self):
 374         # Test that the nodemaker is capable of creating an MDMF
 375         # filenode given an MDMF cap.
 376         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 377         def _created(n):
 378             self.failUnless(isinstance(n, MutableFileNode))
 379             s = n.get_uri()
 380             self.failUnless(s.startswith("URI:MDMF"))
 381             n2 = self.nodemaker.create_from_cap(s)
 382             self.failUnless(isinstance(n2, MutableFileNode))
 383             self.failUnlessEqual(n.get_storage_index(), n2.get_storage_index())
 384             self.failUnlessEqual(n.get_uri(), n2.get_uri())
 385         d.addCallback(_created)
 386         return d
 387
 388
 389     def test_create_from_mdmf_readcap(self):
 390         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 391         def _created(n):
 392             self.failUnless(isinstance(n, MutableFileNode))
 393             s = n.get_readonly_uri()
 394             n2 = self.nodemaker.create_from_cap(s)
 395             self.failUnless(isinstance(n2, MutableFileNode))
 396
 397             # Check that it's a readonly node
 398             self.failUnless(n2.is_readonly())
 399         d.addCallback(_created)
 400         return d
 401
 402
 403     def test_internal_version_from_cap(self):
 404         # MutableFileNodes and MutableFileVersions have an internal
 405         # switch that tells them whether they're dealing with an SDMF or
 406         # MDMF mutable file when they start doing stuff. We want to make
 407         # sure that this is set appropriately given an MDMF cap.
 408         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 409         def _created(n):
 410             self.uri = n.get_uri()
 411             self.failUnlessEqual(n._protocol_version, MDMF_VERSION)
 412
 413             n2 = self.nodemaker.create_from_cap(self.uri)
 414             self.failUnlessEqual(n2._protocol_version, MDMF_VERSION)
 415         d.addCallback(_created)
 416         return d
 417
 418
 419     def test_serialize(self):
 420         n = MutableFileNode(None, None, {"k": 3, "n": 10}, None)
 421         calls = []
 422         def _callback(*args, **kwargs):
 423             self.failUnlessEqual(args, (4,) )
 424             self.failUnlessEqual(kwargs, {"foo": 5})
 425             calls.append(1)
 426             return 6
 427         d = n._do_serialized(_callback, 4, foo=5)
 428         def _check_callback(res):
 429             self.failUnlessEqual(res, 6)
 430             self.failUnlessEqual(calls, [1])
 431         d.addCallback(_check_callback)
 432
 433         def _errback():
 434             raise ValueError("heya")
 435         d.addCallback(lambda res:
 436                       self.shouldFail(ValueError, "_check_errback", "heya",
 437                                       n._do_serialized, _errback))
 438         return d
 439
 440     def test_upload_and_download(self):
 441         d = self.nodemaker.create_mutable_file()
 442         def _created(n):
 443             d = defer.succeed(None)
 444             d.addCallback(lambda res: n.get_servermap(MODE_READ))
 445             d.addCallback(lambda smap: smap.dump(StringIO()))
 446             d.addCallback(lambda sio:
 447                           self.failUnless("3-of-10" in sio.getvalue()))
 448             d.addCallback(lambda res: n.overwrite(MutableData("contents 1")))
 449             d.addCallback(lambda res: self.failUnlessIdentical(res, None))
 450             d.addCallback(lambda res: n.download_best_version())
 451             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 1"))
 452             d.addCallback(lambda res: n.get_size_of_best_version())
 453             d.addCallback(lambda size:
 454                           self.failUnlessEqual(size, len("contents 1")))
 455             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
 456             d.addCallback(lambda res: n.download_best_version())
 457             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 2"))
 458             d.addCallback(lambda res: n.get_servermap(MODE_WRITE))
 459             d.addCallback(lambda smap: n.upload(MutableData("contents 3"), smap))
 460             d.addCallback(lambda res: n.download_best_version())
 461             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 3"))
 462             d.addCallback(lambda res: n.get_servermap(MODE_ANYTHING))
 463             d.addCallback(lambda smap:
 464                           n.download_version(smap,
 465                                              smap.best_recoverable_version()))
 466             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 3"))
 467             # test a file that is large enough to overcome the
 468             # mapupdate-to-retrieve data caching (i.e. make the shares larger
 469             # than the default readsize, which is 2000 bytes). A 15kB file
 470             # will have 5kB shares.
 471             d.addCallback(lambda res: n.overwrite(MutableData("large size file" * 1000)))
 472             d.addCallback(lambda res: n.download_best_version())
 473             d.addCallback(lambda res:
 474                           self.failUnlessEqual(res, "large size file" * 1000))
 475             return d
 476         d.addCallback(_created)
 477         return d
 478
 479
 480     def test_upload_and_download_mdmf(self):
 481         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 482         def _created(n):
 483             d = defer.succeed(None)
 484             d.addCallback(lambda ignored:
 485                 n.get_servermap(MODE_READ))
 486             def _then(servermap):
 487                 dumped = servermap.dump(StringIO())
 488                 self.failUnlessIn("3-of-10", dumped.getvalue())
 489             d.addCallback(_then)
 490             # Now overwrite the contents with some new contents. We want
 491             # to make them big enough to force the file to be uploaded
 492             # in more than one segment.
 493             big_contents = "contents1" * 100000 # about 900 KiB
 494             big_contents_uploadable = MutableData(big_contents)
 495             d.addCallback(lambda ignored:
 496                 n.overwrite(big_contents_uploadable))
 497             d.addCallback(lambda ignored:
 498                 n.download_best_version())
 499             d.addCallback(lambda data:
 500                 self.failUnlessEqual(data, big_contents))
 501             # Overwrite the contents again with some new contents. As
 502             # before, they need to be big enough to force multiple
 503             # segments, so that we make the downloader deal with
 504             # multiple segments.
 505             bigger_contents = "contents2" * 1000000 # about 9MiB
 506             bigger_contents_uploadable = MutableData(bigger_contents)
 507             d.addCallback(lambda ignored:
 508                 n.overwrite(bigger_contents_uploadable))
 509             d.addCallback(lambda ignored:
 510                 n.download_best_version())
 511             d.addCallback(lambda data:
 512                 self.failUnlessEqual(data, bigger_contents))
 513             return d
 514         d.addCallback(_created)
 515         return d
 516
 517
 518     def test_retrieve_producer_mdmf(self):
 519         # We should make sure that the retriever is able to pause and stop
 520         # correctly.
 521         data = "contents1" * 100000
 522         d = self.nodemaker.create_mutable_file(MutableData(data),
 523                                                version=MDMF_VERSION)
 524         d.addCallback(lambda node: node.get_best_mutable_version())
 525         d.addCallback(self._test_retrieve_producer, "MDMF", data)
 526         return d
 527
 528     # note: SDMF has only one big segment, so we can't use the usual
 529     # after-the-first-write() trick to pause or stop the download.
 530     # Disabled until we find a better approach.
 531     def OFF_test_retrieve_producer_sdmf(self):
 532         data = "contents1" * 100000
 533         d = self.nodemaker.create_mutable_file(MutableData(data),
 534                                                version=SDMF_VERSION)
 535         d.addCallback(lambda node: node.get_best_mutable_version())
 536         d.addCallback(self._test_retrieve_producer, "SDMF", data)
 537         return d
 538
 539     def _test_retrieve_producer(self, version, kind, data):
 540         # Now we'll retrieve it into a pausing consumer.
 541         c = PausingConsumer()
 542         d = version.read(c)
 543         d.addCallback(lambda ign: self.failUnlessEqual(c.size, len(data)))
 544
 545         c2 = PausingAndStoppingConsumer()
 546         d.addCallback(lambda ign:
 547                       self.shouldFail(DownloadStopped, kind+"_pause_stop",
 548                                       "our Consumer called stopProducing()",
 549                                       version.read, c2))
 550
 551         c3 = StoppingConsumer()
 552         d.addCallback(lambda ign:
 553                       self.shouldFail(DownloadStopped, kind+"_stop",
 554                                       "our Consumer called stopProducing()",
 555                                       version.read, c3))
 556
 557         c4 = ImmediatelyStoppingConsumer()
 558         d.addCallback(lambda ign:
 559                       self.shouldFail(DownloadStopped, kind+"_stop_imm",
 560                                       "our Consumer called stopProducing()",
 561                                       version.read, c4))
 562
 563         def _then(ign):
 564             c5 = MemoryConsumer()
 565             d1 = version.read(c5)
 566             c5.producer.stopProducing()
 567             return self.shouldFail(DownloadStopped, kind+"_stop_imm2",
 568                                    "our Consumer called stopProducing()",
 569                                    lambda: d1)
 570         d.addCallback(_then)
 571         return d
 572
 573     def test_download_from_mdmf_cap(self):
 574         # We should be able to download an MDMF file given its cap
 575         d = self.nodemaker.create_mutable_file(version=MDMF_VERSION)
 576         def _created(node):
 577             self.uri = node.get_uri()
 578             # also confirm that the cap has no extension fields
 579             pieces = self.uri.split(":")
 580             self.failUnlessEqual(len(pieces), 4)
 581
 582             return node.overwrite(MutableData("contents1" * 100000))
 583         def _then(ignored):
 584             node = self.nodemaker.create_from_cap(self.uri)
 585             return node.download_best_version()
 586         def _downloaded(data):
 587             self.failUnlessEqual(data, "contents1" * 100000)
 588         d.addCallback(_created)
 589         d.addCallback(_then)
 590         d.addCallback(_downloaded)
 591         return d
 592
 593
 594     def test_mdmf_write_count(self):
 595         # Publishing an MDMF file should only cause one write for each
 596         # share that is to be published. Otherwise, we introduce
 597         # undesirable semantics that are a regression from SDMF
 598         upload = MutableData("MDMF" * 100000) # about 400 KiB
 599         d = self.nodemaker.create_mutable_file(upload,
 600                                                version=MDMF_VERSION)
 601         def _check_server_write_counts(ignored):
 602             sb = self.nodemaker.storage_broker
 603             for server in sb.servers.itervalues():
 604                 self.failUnlessEqual(server.get_rref().queries, 1)
 605         d.addCallback(_check_server_write_counts)
 606         return d
 607
 608
 609     def test_create_with_initial_contents(self):
 610         upload1 = MutableData("contents 1")
 611         d = self.nodemaker.create_mutable_file(upload1)
 612         def _created(n):
 613             d = n.download_best_version()
 614             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 1"))
 615             upload2 = MutableData("contents 2")
 616             d.addCallback(lambda res: n.overwrite(upload2))
 617             d.addCallback(lambda res: n.download_best_version())
 618             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 2"))
 619             return d
 620         d.addCallback(_created)
 621         return d
 622
 623
 624     def test_create_mdmf_with_initial_contents(self):
 625         initial_contents = "foobarbaz" * 131072 # 900KiB
 626         initial_contents_uploadable = MutableData(initial_contents)
 627         d = self.nodemaker.create_mutable_file(initial_contents_uploadable,
 628                                                version=MDMF_VERSION)
 629         def _created(n):
 630             d = n.download_best_version()
 631             d.addCallback(lambda data:
 632                 self.failUnlessEqual(data, initial_contents))
 633             uploadable2 = MutableData(initial_contents + "foobarbaz")
 634             d.addCallback(lambda ignored:
 635                 n.overwrite(uploadable2))
 636             d.addCallback(lambda ignored:
 637                 n.download_best_version())
 638             d.addCallback(lambda data:
 639                 self.failUnlessEqual(data, initial_contents +
 640                                            "foobarbaz"))
 641             return d
 642         d.addCallback(_created)
 643         return d
 644
 645     def test_create_with_initial_contents_function(self):
 646         data = "initial contents"
 647         def _make_contents(n):
 648             self.failUnless(isinstance(n, MutableFileNode))
 649             key = n.get_writekey()
 650             self.failUnless(isinstance(key, str), key)
 651             self.failUnlessEqual(len(key), 16) # AES key size
 652             return MutableData(data)
 653         d = self.nodemaker.create_mutable_file(_make_contents)
 654         def _created(n):
 655             return n.download_best_version()
 656         d.addCallback(_created)
 657         d.addCallback(lambda data2: self.failUnlessEqual(data2, data))
 658         return d
 659
 660
 661     def test_create_mdmf_with_initial_contents_function(self):
 662         data = "initial contents" * 100000
 663         def _make_contents(n):
 664             self.failUnless(isinstance(n, MutableFileNode))
 665             key = n.get_writekey()
 666             self.failUnless(isinstance(key, str), key)
 667             self.failUnlessEqual(len(key), 16)
 668             return MutableData(data)
 669         d = self.nodemaker.create_mutable_file(_make_contents,
 670                                                version=MDMF_VERSION)
 671         d.addCallback(lambda n:
 672             n.download_best_version())
 673         d.addCallback(lambda data2:
 674             self.failUnlessEqual(data2, data))
 675         return d
 676
 677
 678     def test_create_with_too_large_contents(self):
 679         BIG = "a" * (self.OLD_MAX_SEGMENT_SIZE + 1)
 680         BIG_uploadable = MutableData(BIG)
 681         d = self.nodemaker.create_mutable_file(BIG_uploadable)
 682         def _created(n):
 683             other_BIG_uploadable = MutableData(BIG)
 684             d = n.overwrite(other_BIG_uploadable)
 685             return d
 686         d.addCallback(_created)
 687         return d
 688
 689     def failUnlessCurrentSeqnumIs(self, n, expected_seqnum, which):
 690         d = n.get_servermap(MODE_READ)
 691         d.addCallback(lambda servermap: servermap.best_recoverable_version())
 692         d.addCallback(lambda verinfo:
 693                       self.failUnlessEqual(verinfo[0], expected_seqnum, which))
 694         return d
 695
 696     def test_modify(self):
 697         def _modifier(old_contents, servermap, first_time):
 698             new_contents = old_contents + "line2"
 699             return new_contents
 700         def _non_modifier(old_contents, servermap, first_time):
 701             return old_contents
 702         def _none_modifier(old_contents, servermap, first_time):
 703             return None
 704         def _error_modifier(old_contents, servermap, first_time):
 705             raise ValueError("oops")
 706         def _toobig_modifier(old_contents, servermap, first_time):
 707             new_content = "b" * (self.OLD_MAX_SEGMENT_SIZE + 1)
 708             return new_content
 709         calls = []
 710         def _ucw_error_modifier(old_contents, servermap, first_time):
 711             # simulate an UncoordinatedWriteError once
 712             calls.append(1)
 713             if len(calls) <= 1:
 714                 raise UncoordinatedWriteError("simulated")
 715             new_contents = old_contents + "line3"
 716             return new_contents
 717         def _ucw_error_non_modifier(old_contents, servermap, first_time):
 718             # simulate an UncoordinatedWriteError once, and don't actually
 719             # modify the contents on subsequent invocations
 720             calls.append(1)
 721             if len(calls) <= 1:
 722                 raise UncoordinatedWriteError("simulated")
 723             return old_contents
 724
 725         initial_contents = "line1"
 726         d = self.nodemaker.create_mutable_file(MutableData(initial_contents))
 727         def _created(n):
 728             d = n.modify(_modifier)
 729             d.addCallback(lambda res: n.download_best_version())
 730             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 731             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "m"))
 732
 733             d.addCallback(lambda res: n.modify(_non_modifier))
 734             d.addCallback(lambda res: n.download_best_version())
 735             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 736             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "non"))
 737
 738             d.addCallback(lambda res: n.modify(_none_modifier))
 739             d.addCallback(lambda res: n.download_best_version())
 740             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 741             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "none"))
 742
 743             d.addCallback(lambda res:
 744                           self.shouldFail(ValueError, "error_modifier", None,
 745                                           n.modify, _error_modifier))
 746             d.addCallback(lambda res: n.download_best_version())
 747             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 748             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "err"))
 749
 750
 751             d.addCallback(lambda res: n.download_best_version())
 752             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 753             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "big"))
 754
 755             d.addCallback(lambda res: n.modify(_ucw_error_modifier))
 756             d.addCallback(lambda res: self.failUnlessEqual(len(calls), 2))
 757             d.addCallback(lambda res: n.download_best_version())
 758             d.addCallback(lambda res: self.failUnlessEqual(res,
 759                                                            "line1line2line3"))
 760             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 3, "ucw"))
 761
 762             def _reset_ucw_error_modifier(res):
 763                 calls[:] = []
 764                 return res
 765             d.addCallback(_reset_ucw_error_modifier)
 766
 767             # in practice, this n.modify call should publish twice: the first
 768             # one gets a UCWE, the second does not. But our test jig (in
 769             # which the modifier raises the UCWE) skips over the first one,
 770             # so in this test there will be only one publish, and the seqnum
 771             # will only be one larger than the previous test, not two (i.e. 4
 772             # instead of 5).
 773             d.addCallback(lambda res: n.modify(_ucw_error_non_modifier))
 774             d.addCallback(lambda res: self.failUnlessEqual(len(calls), 2))
 775             d.addCallback(lambda res: n.download_best_version())
 776             d.addCallback(lambda res: self.failUnlessEqual(res,
 777                                                            "line1line2line3"))
 778             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 4, "ucw"))
 779             d.addCallback(lambda res: n.modify(_toobig_modifier))
 780             return d
 781         d.addCallback(_created)
 782         return d
 783
 784
 785     def test_modify_backoffer(self):
 786         def _modifier(old_contents, servermap, first_time):
 787             return old_contents + "line2"
 788         calls = []
 789         def _ucw_error_modifier(old_contents, servermap, first_time):
 790             # simulate an UncoordinatedWriteError once
 791             calls.append(1)
 792             if len(calls) <= 1:
 793                 raise UncoordinatedWriteError("simulated")
 794             return old_contents + "line3"
 795         def _always_ucw_error_modifier(old_contents, servermap, first_time):
 796             raise UncoordinatedWriteError("simulated")
 797         def _backoff_stopper(node, f):
 798             return f
 799         def _backoff_pauser(node, f):
 800             d = defer.Deferred()
 801             reactor.callLater(0.5, d.callback, None)
 802             return d
 803
 804         # the give-up-er will hit its maximum retry count quickly
 805         giveuper = BackoffAgent()
 806         giveuper._delay = 0.1
 807         giveuper.factor = 1
 808
 809         d = self.nodemaker.create_mutable_file(MutableData("line1"))
 810         def _created(n):
 811             d = n.modify(_modifier)
 812             d.addCallback(lambda res: n.download_best_version())
 813             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 814             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "m"))
 815
 816             d.addCallback(lambda res:
 817                           self.shouldFail(UncoordinatedWriteError,
 818                                           "_backoff_stopper", None,
 819                                           n.modify, _ucw_error_modifier,
 820                                           _backoff_stopper))
 821             d.addCallback(lambda res: n.download_best_version())
 822             d.addCallback(lambda res: self.failUnlessEqual(res, "line1line2"))
 823             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 2, "stop"))
 824
 825             def _reset_ucw_error_modifier(res):
 826                 calls[:] = []
 827                 return res
 828             d.addCallback(_reset_ucw_error_modifier)
 829             d.addCallback(lambda res: n.modify(_ucw_error_modifier,
 830                                                _backoff_pauser))
 831             d.addCallback(lambda res: n.download_best_version())
 832             d.addCallback(lambda res: self.failUnlessEqual(res,
 833                                                            "line1line2line3"))
 834             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 3, "pause"))
 835
 836             d.addCallback(lambda res:
 837                           self.shouldFail(UncoordinatedWriteError,
 838                                           "giveuper", None,
 839                                           n.modify, _always_ucw_error_modifier,
 840                                           giveuper.delay))
 841             d.addCallback(lambda res: n.download_best_version())
 842             d.addCallback(lambda res: self.failUnlessEqual(res,
 843                                                            "line1line2line3"))
 844             d.addCallback(lambda res: self.failUnlessCurrentSeqnumIs(n, 3, "giveup"))
 845
 846             return d
 847         d.addCallback(_created)
 848         return d
 849
 850     def test_upload_and_download_full_size_keys(self):
 851         self.nodemaker.key_generator = client.KeyGenerator()
 852         d = self.nodemaker.create_mutable_file()
 853         def _created(n):
 854             d = defer.succeed(None)
 855             d.addCallback(lambda res: n.get_servermap(MODE_READ))
 856             d.addCallback(lambda smap: smap.dump(StringIO()))
 857             d.addCallback(lambda sio:
 858                           self.failUnless("3-of-10" in sio.getvalue()))
 859             d.addCallback(lambda res: n.overwrite(MutableData("contents 1")))
 860             d.addCallback(lambda res: self.failUnlessIdentical(res, None))
 861             d.addCallback(lambda res: n.download_best_version())
 862             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 1"))
 863             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
 864             d.addCallback(lambda res: n.download_best_version())
 865             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 2"))
 866             d.addCallback(lambda res: n.get_servermap(MODE_WRITE))
 867             d.addCallback(lambda smap: n.upload(MutableData("contents 3"), smap))
 868             d.addCallback(lambda res: n.download_best_version())
 869             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 3"))
 870             d.addCallback(lambda res: n.get_servermap(MODE_ANYTHING))
 871             d.addCallback(lambda smap:
 872                           n.download_version(smap,
 873                                              smap.best_recoverable_version()))
 874             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 3"))
 875             return d
 876         d.addCallback(_created)
 877         return d
 878
 879
 880     def test_size_after_servermap_update(self):
 881         # a mutable file node should have something to say about how big
 882         # it is after a servermap update is performed, since this tells
 883         # us how large the best version of that mutable file is.
 884         d = self.nodemaker.create_mutable_file()
 885         def _created(n):
 886             self.n = n
 887             return n.get_servermap(MODE_READ)
 888         d.addCallback(_created)
 889         d.addCallback(lambda ignored:
 890             self.failUnlessEqual(self.n.get_size(), 0))
 891         d.addCallback(lambda ignored:
 892             self.n.overwrite(MutableData("foobarbaz")))
 893         d.addCallback(lambda ignored:
 894             self.failUnlessEqual(self.n.get_size(), 9))
 895         d.addCallback(lambda ignored:
 896             self.nodemaker.create_mutable_file(MutableData("foobarbaz")))
 897         d.addCallback(_created)
 898         d.addCallback(lambda ignored:
 899             self.failUnlessEqual(self.n.get_size(), 9))
 900         return d
 901
 902
 903 class PublishMixin:
 904     def publish_one(self):
 905         # publish a file and create shares, which can then be manipulated
 906         # later.
 907         self.CONTENTS = "New contents go here" * 1000
 908         self.uploadable = MutableData(self.CONTENTS)
 909         self._storage = FakeStorage()
 910         self._nodemaker = make_nodemaker(self._storage)
 911         self._storage_broker = self._nodemaker.storage_broker
 912         d = self._nodemaker.create_mutable_file(self.uploadable)
 913         def _created(node):
 914             self._fn = node
 915             self._fn2 = self._nodemaker.create_from_cap(node.get_uri())
 916         d.addCallback(_created)
 917         return d
 918
 919     def publish_mdmf(self):
 920         # like publish_one, except that the result is guaranteed to be
 921         # an MDMF file.
 922         # self.CONTENTS should have more than one segment.
 923         self.CONTENTS = "This is an MDMF file" * 100000
 924         self.uploadable = MutableData(self.CONTENTS)
 925         self._storage = FakeStorage()
 926         self._nodemaker = make_nodemaker(self._storage)
 927         self._storage_broker = self._nodemaker.storage_broker
 928         d = self._nodemaker.create_mutable_file(self.uploadable, version=MDMF_VERSION)
 929         def _created(node):
 930             self._fn = node
 931             self._fn2 = self._nodemaker.create_from_cap(node.get_uri())
 932         d.addCallback(_created)
 933         return d
 934
 935
 936     def publish_sdmf(self):
 937         # like publish_one, except that the result is guaranteed to be
 938         # an SDMF file
 939         self.CONTENTS = "This is an SDMF file" * 1000
 940         self.uploadable = MutableData(self.CONTENTS)
 941         self._storage = FakeStorage()
 942         self._nodemaker = make_nodemaker(self._storage)
 943         self._storage_broker = self._nodemaker.storage_broker
 944         d = self._nodemaker.create_mutable_file(self.uploadable, version=SDMF_VERSION)
 945         def _created(node):
 946             self._fn = node
 947             self._fn2 = self._nodemaker.create_from_cap(node.get_uri())
 948         d.addCallback(_created)
 949         return d
 950
 951     def publish_empty_sdmf(self):
 952         self.CONTENTS = ""
 953         self.uploadable = MutableData(self.CONTENTS)
 954         self._storage = FakeStorage()
 955         self._nodemaker = make_nodemaker(self._storage, keysize=None)
 956         self._storage_broker = self._nodemaker.storage_broker
 957         d = self._nodemaker.create_mutable_file(self.uploadable,
 958                                                 version=SDMF_VERSION)
 959         def _created(node):
 960             self._fn = node
 961             self._fn2 = self._nodemaker.create_from_cap(node.get_uri())
 962         d.addCallback(_created)
 963         return d
 964
 965
 966     def publish_multiple(self, version=0):
 967         self.CONTENTS = ["Contents 0",
 968                          "Contents 1",
 969                          "Contents 2",
 970                          "Contents 3a",
 971                          "Contents 3b"]
 972         self.uploadables = [MutableData(d) for d in self.CONTENTS]
 973         self._copied_shares = {}
 974         self._storage = FakeStorage()
 975         self._nodemaker = make_nodemaker(self._storage)
 976         d = self._nodemaker.create_mutable_file(self.uploadables[0], version=version) # seqnum=1
 977         def _created(node):
 978             self._fn = node
 979             # now create multiple versions of the same file, and accumulate
 980             # their shares, so we can mix and match them later.
 981             d = defer.succeed(None)
 982             d.addCallback(self._copy_shares, 0)
 983             d.addCallback(lambda res: node.overwrite(self.uploadables[1])) #s2
 984             d.addCallback(self._copy_shares, 1)
 985             d.addCallback(lambda res: node.overwrite(self.uploadables[2])) #s3
 986             d.addCallback(self._copy_shares, 2)
 987             d.addCallback(lambda res: node.overwrite(self.uploadables[3])) #s4a
 988             d.addCallback(self._copy_shares, 3)
 989             # now we replace all the shares with version s3, and upload a new
 990             # version to get s4b.
 991             rollback = dict([(i,2) for i in range(10)])
 992             d.addCallback(lambda res: self._set_versions(rollback))
 993             d.addCallback(lambda res: node.overwrite(self.uploadables[4])) #s4b
 994             d.addCallback(self._copy_shares, 4)
 995             # we leave the storage in state 4
 996             return d
 997         d.addCallback(_created)
 998         return d
 999
1000
1001     def _copy_shares(self, ignored, index):
1002         shares = self._storage._peers
1003         # we need a deep copy
1004         new_shares = {}
1005         for peerid in shares:
1006             new_shares[peerid] = {}
1007             for shnum in shares[peerid]:
1008                 new_shares[peerid][shnum] = shares[peerid][shnum]
1009         self._copied_shares[index] = new_shares
1010
1011     def _set_versions(self, versionmap):
1012         # versionmap maps shnums to which version (0,1,2,3,4) we want the
1013         # share to be at. Any shnum which is left out of the map will stay at
1014         # its current version.
1015         shares = self._storage._peers
1016         oldshares = self._copied_shares
1017         for peerid in shares:
1018             for shnum in shares[peerid]:
1019                 if shnum in versionmap:
1020                     index = versionmap[shnum]
1021                     shares[peerid][shnum] = oldshares[index][peerid][shnum]
1022
1023 class Servermap(unittest.TestCase, PublishMixin):
1024     def setUp(self):
1025         return self.publish_one()
1026
1027     def make_servermap(self, mode=MODE_CHECK, fn=None, sb=None,
1028                        update_range=None):
1029         if fn is None:
1030             fn = self._fn
1031         if sb is None:
1032             sb = self._storage_broker
1033         smu = ServermapUpdater(fn, sb, Monitor(),
1034                                ServerMap(), mode, update_range=update_range)
1035         d = smu.update()
1036         return d
1037
1038     def update_servermap(self, oldmap, mode=MODE_CHECK):
1039         smu = ServermapUpdater(self._fn, self._storage_broker, Monitor(),
1040                                oldmap, mode)
1041         d = smu.update()
1042         return d
1043
1044     def failUnlessOneRecoverable(self, sm, num_shares):
1045         self.failUnlessEqual(len(sm.recoverable_versions()), 1)
1046         self.failUnlessEqual(len(sm.unrecoverable_versions()), 0)
1047         best = sm.best_recoverable_version()
1048         self.failIfEqual(best, None)
1049         self.failUnlessEqual(sm.recoverable_versions(), set([best]))
1050         self.failUnlessEqual(len(sm.shares_available()), 1)
1051         self.failUnlessEqual(sm.shares_available()[best], (num_shares, 3, 10))
1052         shnum, servers = sm.make_sharemap().items()[0]
1053         server = list(servers)[0]
1054         self.failUnlessEqual(sm.version_on_server(server, shnum), best)
1055         self.failUnlessEqual(sm.version_on_server(server, 666), None)
1056         return sm
1057
1058     def test_basic(self):
1059         d = defer.succeed(None)
1060         ms = self.make_servermap
1061         us = self.update_servermap
1062
1063         d.addCallback(lambda res: ms(mode=MODE_CHECK))
1064         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1065         d.addCallback(lambda res: ms(mode=MODE_WRITE))
1066         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1067         d.addCallback(lambda res: ms(mode=MODE_READ))
1068         # this mode stops at k+epsilon, and epsilon=k, so 6 shares
1069         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 6))
1070         d.addCallback(lambda res: ms(mode=MODE_ANYTHING))
1071         # this mode stops at 'k' shares
1072         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 3))
1073
1074         # and can we re-use the same servermap? Note that these are sorted in
1075         # increasing order of number of servers queried, since once a server
1076         # gets into the servermap, we'll always ask it for an update.
1077         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 3))
1078         d.addCallback(lambda sm: us(sm, mode=MODE_READ))
1079         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 6))
1080         d.addCallback(lambda sm: us(sm, mode=MODE_WRITE))
1081         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1082         d.addCallback(lambda sm: us(sm, mode=MODE_CHECK))
1083         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1084         d.addCallback(lambda sm: us(sm, mode=MODE_ANYTHING))
1085         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1086
1087         return d
1088
1089     def test_fetch_privkey(self):
1090         d = defer.succeed(None)
1091         # use the sibling filenode (which hasn't been used yet), and make
1092         # sure it can fetch the privkey. The file is small, so the privkey
1093         # will be fetched on the first (query) pass.
1094         d.addCallback(lambda res: self.make_servermap(MODE_WRITE, self._fn2))
1095         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1096
1097         # create a new file, which is large enough to knock the privkey out
1098         # of the early part of the file
1099         LARGE = "These are Larger contents" * 200 # about 5KB
1100         LARGE_uploadable = MutableData(LARGE)
1101         d.addCallback(lambda res: self._nodemaker.create_mutable_file(LARGE_uploadable))
1102         def _created(large_fn):
1103             large_fn2 = self._nodemaker.create_from_cap(large_fn.get_uri())
1104             return self.make_servermap(MODE_WRITE, large_fn2)
1105         d.addCallback(_created)
1106         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 10))
1107         return d
1108
1109
1110     def test_mark_bad(self):
1111         d = defer.succeed(None)
1112         ms = self.make_servermap
1113
1114         d.addCallback(lambda res: ms(mode=MODE_READ))
1115         d.addCallback(lambda sm: self.failUnlessOneRecoverable(sm, 6))
1116         def _made_map(sm):
1117             v = sm.best_recoverable_version()
1118             vm = sm.make_versionmap()
1119             shares = list(vm[v])
1120             self.failUnlessEqual(len(shares), 6)
1121             self._corrupted = set()
1122             # mark the first 5 shares as corrupt, then update the servermap.
1123             # The map should not have the marked shares it in any more, and
1124             # new shares should be found to replace the missing ones.
1125             for (shnum, server, timestamp) in shares:
1126                 if shnum < 5:
1127                     self._corrupted.add( (server, shnum) )
1128                     sm.mark_bad_share(server, shnum, "")
1129             return self.update_servermap(sm, MODE_WRITE)
1130         d.addCallback(_made_map)
1131         def _check_map(sm):
1132             # this should find all 5 shares that weren't marked bad
1133             v = sm.best_recoverable_version()
1134             vm = sm.make_versionmap()
1135             shares = list(vm[v])
1136             for (server, shnum) in self._corrupted:
1137                 server_shares = sm.debug_shares_on_server(server)
1138                 self.failIf(shnum in server_shares,
1139                             "%d was in %s" % (shnum, server_shares))
1140             self.failUnlessEqual(len(shares), 5)
1141         d.addCallback(_check_map)
1142         return d
1143
1144     def failUnlessNoneRecoverable(self, sm):
1145         self.failUnlessEqual(len(sm.recoverable_versions()), 0)
1146         self.failUnlessEqual(len(sm.unrecoverable_versions()), 0)
1147         best = sm.best_recoverable_version()
1148         self.failUnlessEqual(best, None)
1149         self.failUnlessEqual(len(sm.shares_available()), 0)
1150
1151     def test_no_shares(self):
1152         self._storage._peers = {} # delete all shares
1153         ms = self.make_servermap
1154         d = defer.succeed(None)
1155 #
1156         d.addCallback(lambda res: ms(mode=MODE_CHECK))
1157         d.addCallback(lambda sm: self.failUnlessNoneRecoverable(sm))
1158
1159         d.addCallback(lambda res: ms(mode=MODE_ANYTHING))
1160         d.addCallback(lambda sm: self.failUnlessNoneRecoverable(sm))
1161
1162         d.addCallback(lambda res: ms(mode=MODE_WRITE))
1163         d.addCallback(lambda sm: self.failUnlessNoneRecoverable(sm))
1164
1165         d.addCallback(lambda res: ms(mode=MODE_READ))
1166         d.addCallback(lambda sm: self.failUnlessNoneRecoverable(sm))
1167
1168         return d
1169
1170     def failUnlessNotQuiteEnough(self, sm):
1171         self.failUnlessEqual(len(sm.recoverable_versions()), 0)
1172         self.failUnlessEqual(len(sm.unrecoverable_versions()), 1)
1173         best = sm.best_recoverable_version()
1174         self.failUnlessEqual(best, None)
1175         self.failUnlessEqual(len(sm.shares_available()), 1)
1176         self.failUnlessEqual(sm.shares_available().values()[0], (2,3,10) )
1177         return sm
1178
1179     def test_not_quite_enough_shares(self):
1180         s = self._storage
1181         ms = self.make_servermap
1182         num_shares = len(s._peers)
1183         for peerid in s._peers:
1184             s._peers[peerid] = {}
1185             num_shares -= 1
1186             if num_shares == 2:
1187                 break
1188         # now there ought to be only two shares left
1189         assert len([peerid for peerid in s._peers if s._peers[peerid]]) == 2
1190
1191         d = defer.succeed(None)
1192
1193         d.addCallback(lambda res: ms(mode=MODE_CHECK))
1194         d.addCallback(lambda sm: self.failUnlessNotQuiteEnough(sm))
1195         d.addCallback(lambda sm:
1196                       self.failUnlessEqual(len(sm.make_sharemap()), 2))
1197         d.addCallback(lambda res: ms(mode=MODE_ANYTHING))
1198         d.addCallback(lambda sm: self.failUnlessNotQuiteEnough(sm))
1199         d.addCallback(lambda res: ms(mode=MODE_WRITE))
1200         d.addCallback(lambda sm: self.failUnlessNotQuiteEnough(sm))
1201         d.addCallback(lambda res: ms(mode=MODE_READ))
1202         d.addCallback(lambda sm: self.failUnlessNotQuiteEnough(sm))
1203
1204         return d
1205
1206
1207     def test_servermapupdater_finds_mdmf_files(self):
1208         # setUp already published an MDMF file for us. We just need to
1209         # make sure that when we run the ServermapUpdater, the file is
1210         # reported to have one recoverable version.
1211         d = defer.succeed(None)
1212         d.addCallback(lambda ignored:
1213             self.publish_mdmf())
1214         d.addCallback(lambda ignored:
1215             self.make_servermap(mode=MODE_CHECK))
1216         # Calling make_servermap also updates the servermap in the mode
1217         # that we specify, so we just need to see what it says.
1218         def _check_servermap(sm):
1219             self.failUnlessEqual(len(sm.recoverable_versions()), 1)
1220         d.addCallback(_check_servermap)
1221         return d
1222
1223
1224     def test_fetch_update(self):
1225         d = defer.succeed(None)
1226         d.addCallback(lambda ignored:
1227             self.publish_mdmf())
1228         d.addCallback(lambda ignored:
1229             self.make_servermap(mode=MODE_WRITE, update_range=(1, 2)))
1230         def _check_servermap(sm):
1231             # 10 shares
1232             self.failUnlessEqual(len(sm.update_data), 10)
1233             # one version
1234             for data in sm.update_data.itervalues():
1235                 self.failUnlessEqual(len(data), 1)
1236         d.addCallback(_check_servermap)
1237         return d
1238
1239
1240     def test_servermapupdater_finds_sdmf_files(self):
1241         d = defer.succeed(None)
1242         d.addCallback(lambda ignored:
1243             self.publish_sdmf())
1244         d.addCallback(lambda ignored:
1245             self.make_servermap(mode=MODE_CHECK))
1246         d.addCallback(lambda servermap:
1247             self.failUnlessEqual(len(servermap.recoverable_versions()), 1))
1248         return d
1249
1250
1251 class Roundtrip(unittest.TestCase, testutil.ShouldFailMixin, PublishMixin):
1252     def setUp(self):
1253         return self.publish_one()
1254
1255     def make_servermap(self, mode=MODE_READ, oldmap=None, sb=None):
1256         if oldmap is None:
1257             oldmap = ServerMap()
1258         if sb is None:
1259             sb = self._storage_broker
1260         smu = ServermapUpdater(self._fn, sb, Monitor(), oldmap, mode)
1261         d = smu.update()
1262         return d
1263
1264     def abbrev_verinfo(self, verinfo):
1265         if verinfo is None:
1266             return None
1267         (seqnum, root_hash, IV, segsize, datalength, k, N, prefix,
1268          offsets_tuple) = verinfo
1269         return "%d-%s" % (seqnum, base32.b2a(root_hash)[:4])
1270
1271     def abbrev_verinfo_dict(self, verinfo_d):
1272         output = {}
1273         for verinfo,value in verinfo_d.items():
1274             (seqnum, root_hash, IV, segsize, datalength, k, N, prefix,
1275              offsets_tuple) = verinfo
1276             output["%d-%s" % (seqnum, base32.b2a(root_hash)[:4])] = value
1277         return output
1278
1279     def dump_servermap(self, servermap):
1280         print "SERVERMAP", servermap
1281         print "RECOVERABLE", [self.abbrev_verinfo(v)
1282                               for v in servermap.recoverable_versions()]
1283         print "BEST", self.abbrev_verinfo(servermap.best_recoverable_version())
1284         print "available", self.abbrev_verinfo_dict(servermap.shares_available())
1285
1286     def do_download(self, servermap, version=None):
1287         if version is None:
1288             version = servermap.best_recoverable_version()
1289         r = Retrieve(self._fn, self._storage_broker, servermap, version)
1290         c = consumer.MemoryConsumer()
1291         d = r.download(consumer=c)
1292         d.addCallback(lambda mc: "".join(mc.chunks))
1293         return d
1294
1295
1296     def test_basic(self):
1297         d = self.make_servermap()
1298         def _do_retrieve(servermap):
1299             self._smap = servermap
1300             #self.dump_servermap(servermap)
1301             self.failUnlessEqual(len(servermap.recoverable_versions()), 1)
1302             return self.do_download(servermap)
1303         d.addCallback(_do_retrieve)
1304         def _retrieved(new_contents):
1305             self.failUnlessEqual(new_contents, self.CONTENTS)
1306         d.addCallback(_retrieved)
1307         # we should be able to re-use the same servermap, both with and
1308         # without updating it.
1309         d.addCallback(lambda res: self.do_download(self._smap))
1310         d.addCallback(_retrieved)
1311         d.addCallback(lambda res: self.make_servermap(oldmap=self._smap))
1312         d.addCallback(lambda res: self.do_download(self._smap))
1313         d.addCallback(_retrieved)
1314         # clobbering the pubkey should make the servermap updater re-fetch it
1315         def _clobber_pubkey(res):
1316             self._fn._pubkey = None
1317         d.addCallback(_clobber_pubkey)
1318         d.addCallback(lambda res: self.make_servermap(oldmap=self._smap))
1319         d.addCallback(lambda res: self.do_download(self._smap))
1320         d.addCallback(_retrieved)
1321         return d
1322
1323     def test_all_shares_vanished(self):
1324         d = self.make_servermap()
1325         def _remove_shares(servermap):
1326             for shares in self._storage._peers.values():
1327                 shares.clear()
1328             d1 = self.shouldFail(NotEnoughSharesError,
1329                                  "test_all_shares_vanished",
1330                                  "ran out of servers",
1331                                  self.do_download, servermap)
1332             return d1
1333         d.addCallback(_remove_shares)
1334         return d
1335
1336     def test_all_but_two_shares_vanished_updated_servermap(self):
1337         # tests error reporting for ticket #1742
1338         d = self.make_servermap()
1339         def _remove_shares(servermap):
1340             self._version = servermap.best_recoverable_version()
1341             for shares in self._storage._peers.values()[2:]:
1342                 shares.clear()
1343             return self.make_servermap(servermap)
1344         d.addCallback(_remove_shares)
1345         def _check(updated_servermap):
1346             d1 = self.shouldFail(NotEnoughSharesError,
1347                                  "test_all_but_two_shares_vanished_updated_servermap",
1348                                  "ran out of servers",
1349                                  self.do_download, updated_servermap, version=self._version)
1350             return d1
1351         d.addCallback(_check)
1352         return d
1353
1354     def test_no_servers(self):
1355         sb2 = make_storagebroker(num_peers=0)
1356         # if there are no servers, then a MODE_READ servermap should come
1357         # back empty
1358         d = self.make_servermap(sb=sb2)
1359         def _check_servermap(servermap):
1360             self.failUnlessEqual(servermap.best_recoverable_version(), None)
1361             self.failIf(servermap.recoverable_versions())
1362             self.failIf(servermap.unrecoverable_versions())
1363             self.failIf(servermap.all_servers())
1364         d.addCallback(_check_servermap)
1365         return d
1366
1367     def test_no_servers_download(self):
1368         sb2 = make_storagebroker(num_peers=0)
1369         self._fn._storage_broker = sb2
1370         d = self.shouldFail(UnrecoverableFileError,
1371                             "test_no_servers_download",
1372                             "no recoverable versions",
1373                             self._fn.download_best_version)
1374         def _restore(res):
1375             # a failed download that occurs while we aren't connected to
1376             # anybody should not prevent a subsequent download from working.
1377             # This isn't quite the webapi-driven test that #463 wants, but it
1378             # should be close enough.
1379             self._fn._storage_broker = self._storage_broker
1380             return self._fn.download_best_version()
1381         def _retrieved(new_contents):
1382             self.failUnlessEqual(new_contents, self.CONTENTS)
1383         d.addCallback(_restore)
1384         d.addCallback(_retrieved)
1385         return d
1386
1387
1388     def _test_corrupt_all(self, offset, substring,
1389                           should_succeed=False,
1390                           corrupt_early=True,
1391                           failure_checker=None,
1392                           fetch_privkey=False):
1393         d = defer.succeed(None)
1394         if corrupt_early:
1395             d.addCallback(corrupt, self._storage, offset)
1396         d.addCallback(lambda res: self.make_servermap())
1397         if not corrupt_early:
1398             d.addCallback(corrupt, self._storage, offset)
1399         def _do_retrieve(servermap):
1400             ver = servermap.best_recoverable_version()
1401             if ver is None and not should_succeed:
1402                 # no recoverable versions == not succeeding. The problem
1403                 # should be noted in the servermap's list of problems.
1404                 if substring:
1405                     allproblems = [str(f) for f in servermap.get_problems()]
1406                     self.failUnlessIn(substring, "".join(allproblems))
1407                 return servermap
1408             if should_succeed:
1409                 d1 = self._fn.download_version(servermap, ver,
1410                                                fetch_privkey)
1411                 d1.addCallback(lambda new_contents:
1412                                self.failUnlessEqual(new_contents, self.CONTENTS))
1413             else:
1414                 d1 = self.shouldFail(NotEnoughSharesError,
1415                                      "_corrupt_all(offset=%s)" % (offset,),
1416                                      substring,
1417                                      self._fn.download_version, servermap,
1418                                                                 ver,
1419                                                                 fetch_privkey)
1420             if failure_checker:
1421                 d1.addCallback(failure_checker)
1422             d1.addCallback(lambda res: servermap)
1423             return d1
1424         d.addCallback(_do_retrieve)
1425         return d
1426
1427     def test_corrupt_all_verbyte(self):
1428         # when the version byte is not 0 or 1, we hit an UnknownVersionError
1429         # error in unpack_share().
1430         d = self._test_corrupt_all(0, "UnknownVersionError")
1431         def _check_servermap(servermap):
1432             # and the dump should mention the problems
1433             s = StringIO()
1434             dump = servermap.dump(s).getvalue()
1435             self.failUnless("30 PROBLEMS" in dump, dump)
1436         d.addCallback(_check_servermap)
1437         return d
1438
1439     def test_corrupt_all_seqnum(self):
1440         # a corrupt sequence number will trigger a bad signature
1441         return self._test_corrupt_all(1, "signature is invalid")
1442
1443     def test_corrupt_all_R(self):
1444         # a corrupt root hash will trigger a bad signature
1445         return self._test_corrupt_all(9, "signature is invalid")
1446
1447     def test_corrupt_all_IV(self):
1448         # a corrupt salt/IV will trigger a bad signature
1449         return self._test_corrupt_all(41, "signature is invalid")
1450
1451     def test_corrupt_all_k(self):
1452         # a corrupt 'k' will trigger a bad signature
1453         return self._test_corrupt_all(57, "signature is invalid")
1454
1455     def test_corrupt_all_N(self):
1456         # a corrupt 'N' will trigger a bad signature
1457         return self._test_corrupt_all(58, "signature is invalid")
1458
1459     def test_corrupt_all_segsize(self):
1460         # a corrupt segsize will trigger a bad signature
1461         return self._test_corrupt_all(59, "signature is invalid")
1462
1463     def test_corrupt_all_datalen(self):
1464         # a corrupt data length will trigger a bad signature
1465         return self._test_corrupt_all(67, "signature is invalid")
1466
1467     def test_corrupt_all_pubkey(self):
1468         # a corrupt pubkey won't match the URI's fingerprint. We need to
1469         # remove the pubkey from the filenode, or else it won't bother trying
1470         # to update it.
1471         self._fn._pubkey = None
1472         return self._test_corrupt_all("pubkey",
1473                                       "pubkey doesn't match fingerprint")
1474
1475     def test_corrupt_all_sig(self):
1476         # a corrupt signature is a bad one
1477         # the signature runs from about [543:799], depending upon the length
1478         # of the pubkey
1479         return self._test_corrupt_all("signature", "signature is invalid")
1480
1481     def test_corrupt_all_share_hash_chain_number(self):
1482         # a corrupt share hash chain entry will show up as a bad hash. If we
1483         # mangle the first byte, that will look like a bad hash number,
1484         # causing an IndexError
1485         return self._test_corrupt_all("share_hash_chain", "corrupt hashes")
1486
1487     def test_corrupt_all_share_hash_chain_hash(self):
1488         # a corrupt share hash chain entry will show up as a bad hash. If we
1489         # mangle a few bytes in, that will look like a bad hash.
1490         return self._test_corrupt_all(("share_hash_chain",4), "corrupt hashes")
1491
1492     def test_corrupt_all_block_hash_tree(self):
1493         return self._test_corrupt_all("block_hash_tree",
1494                                       "block hash tree failure")
1495
1496     def test_corrupt_all_block(self):
1497         return self._test_corrupt_all("share_data", "block hash tree failure")
1498
1499     def test_corrupt_all_encprivkey(self):
1500         # a corrupted privkey won't even be noticed by the reader, only by a
1501         # writer.
1502         return self._test_corrupt_all("enc_privkey", None, should_succeed=True)
1503
1504
1505     def test_corrupt_all_encprivkey_late(self):
1506         # this should work for the same reason as above, but we corrupt
1507         # after the servermap update to exercise the error handling
1508         # code.
1509         # We need to remove the privkey from the node, or the retrieve
1510         # process won't know to update it.
1511         self._fn._privkey = None
1512         return self._test_corrupt_all("enc_privkey",
1513                                       None, # this shouldn't fail
1514                                       should_succeed=True,
1515                                       corrupt_early=False,
1516                                       fetch_privkey=True)
1517
1518
1519     # disabled until retrieve tests checkstring on each blockfetch. I didn't
1520     # just use a .todo because the failing-but-ignored test emits about 30kB
1521     # of noise.
1522     def OFF_test_corrupt_all_seqnum_late(self):
1523         # corrupting the seqnum between mapupdate and retrieve should result
1524         # in NotEnoughSharesError, since each share will look invalid
1525         def _check(res):
1526             f = res[0]
1527             self.failUnless(f.check(NotEnoughSharesError))
1528             self.failUnless("uncoordinated write" in str(f))
1529         return self._test_corrupt_all(1, "ran out of servers",
1530                                       corrupt_early=False,
1531                                       failure_checker=_check)
1532
1533
1534     def test_corrupt_all_block_late(self):
1535         def _check(res):
1536             f = res[0]
1537             self.failUnless(f.check(NotEnoughSharesError))
1538         return self._test_corrupt_all("share_data", "block hash tree failure",
1539                                       corrupt_early=False,
1540                                       failure_checker=_check)
1541
1542
1543     def test_basic_pubkey_at_end(self):
1544         # we corrupt the pubkey in all but the last 'k' shares, allowing the
1545         # download to succeed but forcing a bunch of retries first. Note that
1546         # this is rather pessimistic: our Retrieve process will throw away
1547         # the whole share if the pubkey is bad, even though the rest of the
1548         # share might be good.
1549
1550         self._fn._pubkey = None
1551         k = self._fn.get_required_shares()
1552         N = self._fn.get_total_shares()
1553         d = defer.succeed(None)
1554         d.addCallback(corrupt, self._storage, "pubkey",
1555                       shnums_to_corrupt=range(0, N-k))
1556         d.addCallback(lambda res: self.make_servermap())
1557         def _do_retrieve(servermap):
1558             self.failUnless(servermap.get_problems())
1559             self.failUnless("pubkey doesn't match fingerprint"
1560                             in str(servermap.get_problems()[0]))
1561             ver = servermap.best_recoverable_version()
1562             r = Retrieve(self._fn, self._storage_broker, servermap, ver)
1563             c = consumer.MemoryConsumer()
1564             return r.download(c)
1565         d.addCallback(_do_retrieve)
1566         d.addCallback(lambda mc: "".join(mc.chunks))
1567         d.addCallback(lambda new_contents:
1568                       self.failUnlessEqual(new_contents, self.CONTENTS))
1569         return d
1570
1571
1572     def _test_corrupt_some(self, offset, mdmf=False):
1573         if mdmf:
1574             d = self.publish_mdmf()
1575         else:
1576             d = defer.succeed(None)
1577         d.addCallback(lambda ignored:
1578             corrupt(None, self._storage, offset, range(5)))
1579         d.addCallback(lambda ignored:
1580             self.make_servermap())
1581         def _do_retrieve(servermap):
1582             ver = servermap.best_recoverable_version()
1583             self.failUnless(ver)
1584             return self._fn.download_best_version()
1585         d.addCallback(_do_retrieve)
1586         d.addCallback(lambda new_contents:
1587             self.failUnlessEqual(new_contents, self.CONTENTS))
1588         return d
1589
1590
1591     def test_corrupt_some(self):
1592         # corrupt the data of first five shares (so the servermap thinks
1593         # they're good but retrieve marks them as bad), so that the
1594         # MODE_READ set of 6 will be insufficient, forcing node.download to
1595         # retry with more servers.
1596         return self._test_corrupt_some("share_data")
1597
1598
1599     def test_download_fails(self):
1600         d = corrupt(None, self._storage, "signature")
1601         d.addCallback(lambda ignored:
1602             self.shouldFail(UnrecoverableFileError, "test_download_anyway",
1603                             "no recoverable versions",
1604                             self._fn.download_best_version))
1605         return d
1606
1607
1608
1609     def test_corrupt_mdmf_block_hash_tree(self):
1610         d = self.publish_mdmf()
1611         d.addCallback(lambda ignored:
1612             self._test_corrupt_all(("block_hash_tree", 12 * 32),
1613                                    "block hash tree failure",
1614                                    corrupt_early=True,
1615                                    should_succeed=False))
1616         return d
1617
1618
1619     def test_corrupt_mdmf_block_hash_tree_late(self):
1620         # Note - there is no SDMF counterpart to this test, as the SDMF
1621         # files are guaranteed to have exactly one block, and therefore
1622         # the block hash tree fits within the initial read (#1240).
1623         d = self.publish_mdmf()
1624         d.addCallback(lambda ignored:
1625             self._test_corrupt_all(("block_hash_tree", 12 * 32),
1626                                    "block hash tree failure",
1627                                    corrupt_early=False,
1628                                    should_succeed=False))
1629         return d
1630
1631
1632     def test_corrupt_mdmf_share_data(self):
1633         d = self.publish_mdmf()
1634         d.addCallback(lambda ignored:
1635             # TODO: Find out what the block size is and corrupt a
1636             # specific block, rather than just guessing.
1637             self._test_corrupt_all(("share_data", 12 * 40),
1638                                     "block hash tree failure",
1639                                     corrupt_early=True,
1640                                     should_succeed=False))
1641         return d
1642
1643
1644     def test_corrupt_some_mdmf(self):
1645         return self._test_corrupt_some(("share_data", 12 * 40),
1646                                        mdmf=True)
1647
1648
1649 class CheckerMixin:
1650     def check_good(self, r, where):
1651         self.failUnless(r.is_healthy(), where)
1652         return r
1653
1654     def check_bad(self, r, where):
1655         self.failIf(r.is_healthy(), where)
1656         return r
1657
1658     def check_expected_failure(self, r, expected_exception, substring, where):
1659         for (peerid, storage_index, shnum, f) in r.get_share_problems():
1660             if f.check(expected_exception):
1661                 self.failUnless(substring in str(f),
1662                                 "%s: substring '%s' not in '%s'" %
1663                                 (where, substring, str(f)))
1664                 return
1665         self.fail("%s: didn't see expected exception %s in problems %s" %
1666                   (where, expected_exception, r.get_share_problems()))
1667
1668
1669 class Checker(unittest.TestCase, CheckerMixin, PublishMixin):
1670     def setUp(self):
1671         return self.publish_one()
1672
1673
1674     def test_check_good(self):
1675         d = self._fn.check(Monitor())
1676         d.addCallback(self.check_good, "test_check_good")
1677         return d
1678
1679     def test_check_mdmf_good(self):
1680         d = self.publish_mdmf()
1681         d.addCallback(lambda ignored:
1682             self._fn.check(Monitor()))
1683         d.addCallback(self.check_good, "test_check_mdmf_good")
1684         return d
1685
1686     def test_check_no_shares(self):
1687         for shares in self._storage._peers.values():
1688             shares.clear()
1689         d = self._fn.check(Monitor())
1690         d.addCallback(self.check_bad, "test_check_no_shares")
1691         return d
1692
1693     def test_check_mdmf_no_shares(self):
1694         d = self.publish_mdmf()
1695         def _then(ignored):
1696             for share in self._storage._peers.values():
1697                 share.clear()
1698         d.addCallback(_then)
1699         d.addCallback(lambda ignored:
1700             self._fn.check(Monitor()))
1701         d.addCallback(self.check_bad, "test_check_mdmf_no_shares")
1702         return d
1703
1704     def test_check_not_enough_shares(self):
1705         for shares in self._storage._peers.values():
1706             for shnum in shares.keys():
1707                 if shnum > 0:
1708                     del shares[shnum]
1709         d = self._fn.check(Monitor())
1710         d.addCallback(self.check_bad, "test_check_not_enough_shares")
1711         return d
1712
1713     def test_check_mdmf_not_enough_shares(self):
1714         d = self.publish_mdmf()
1715         def _then(ignored):
1716             for shares in self._storage._peers.values():
1717                 for shnum in shares.keys():
1718                     if shnum > 0:
1719                         del shares[shnum]
1720         d.addCallback(_then)
1721         d.addCallback(lambda ignored:
1722             self._fn.check(Monitor()))
1723         d.addCallback(self.check_bad, "test_check_mdmf_not_enougH_shares")
1724         return d
1725
1726
1727     def test_check_all_bad_sig(self):
1728         d = corrupt(None, self._storage, 1) # bad sig
1729         d.addCallback(lambda ignored:
1730             self._fn.check(Monitor()))
1731         d.addCallback(self.check_bad, "test_check_all_bad_sig")
1732         return d
1733
1734     def test_check_mdmf_all_bad_sig(self):
1735         d = self.publish_mdmf()
1736         d.addCallback(lambda ignored:
1737             corrupt(None, self._storage, 1))
1738         d.addCallback(lambda ignored:
1739             self._fn.check(Monitor()))
1740         d.addCallback(self.check_bad, "test_check_mdmf_all_bad_sig")
1741         return d
1742
1743     def test_verify_mdmf_all_bad_sharedata(self):
1744         d = self.publish_mdmf()
1745         # On 8 of the shares, corrupt the beginning of the share data.
1746         # The signature check during the servermap update won't catch this.
1747         d.addCallback(lambda ignored:
1748             corrupt(None, self._storage, "share_data", range(8)))
1749         # On 2 of the shares, corrupt the end of the share data.
1750         # The signature check during the servermap update won't catch
1751         # this either, and the retrieval process will have to process
1752         # all of the segments before it notices.
1753         d.addCallback(lambda ignored:
1754             # the block hash tree comes right after the share data, so if we
1755             # corrupt a little before the block hash tree, we'll corrupt in the
1756             # last block of each share.
1757             corrupt(None, self._storage, "block_hash_tree", [8, 9], -5))
1758         d.addCallback(lambda ignored:
1759             self._fn.check(Monitor(), verify=True))
1760         # The verifier should flag the file as unhealthy, and should
1761         # list all 10 shares as bad.
1762         d.addCallback(self.check_bad, "test_verify_mdmf_all_bad_sharedata")
1763         def _check_num_bad(r):
1764             self.failIf(r.is_recoverable())
1765             smap = r.get_servermap()
1766             self.failUnlessEqual(len(smap.get_bad_shares()), 10)
1767         d.addCallback(_check_num_bad)
1768         return d
1769
1770     def test_check_all_bad_blocks(self):
1771         d = corrupt(None, self._storage, "share_data", [9]) # bad blocks
1772         # the Checker won't notice this.. it doesn't look at actual data
1773         d.addCallback(lambda ignored:
1774             self._fn.check(Monitor()))
1775         d.addCallback(self.check_good, "test_check_all_bad_blocks")
1776         return d
1777
1778
1779     def test_check_mdmf_all_bad_blocks(self):
1780         d = self.publish_mdmf()
1781         d.addCallback(lambda ignored:
1782             corrupt(None, self._storage, "share_data"))
1783         d.addCallback(lambda ignored:
1784             self._fn.check(Monitor()))
1785         d.addCallback(self.check_good, "test_check_mdmf_all_bad_blocks")
1786         return d
1787
1788     def test_verify_good(self):
1789         d = self._fn.check(Monitor(), verify=True)
1790         d.addCallback(self.check_good, "test_verify_good")
1791         return d
1792
1793     def test_verify_all_bad_sig(self):
1794         d = corrupt(None, self._storage, 1) # bad sig
1795         d.addCallback(lambda ignored:
1796             self._fn.check(Monitor(), verify=True))
1797         d.addCallback(self.check_bad, "test_verify_all_bad_sig")
1798         return d
1799
1800     def test_verify_one_bad_sig(self):
1801         d = corrupt(None, self._storage, 1, [9]) # bad sig
1802         d.addCallback(lambda ignored:
1803             self._fn.check(Monitor(), verify=True))
1804         d.addCallback(self.check_bad, "test_verify_one_bad_sig")
1805         return d
1806
1807     def test_verify_one_bad_block(self):
1808         d = corrupt(None, self._storage, "share_data", [9]) # bad blocks
1809         # the Verifier *will* notice this, since it examines every byte
1810         d.addCallback(lambda ignored:
1811             self._fn.check(Monitor(), verify=True))
1812         d.addCallback(self.check_bad, "test_verify_one_bad_block")
1813         d.addCallback(self.check_expected_failure,
1814                       CorruptShareError, "block hash tree failure",
1815                       "test_verify_one_bad_block")
1816         return d
1817
1818     def test_verify_one_bad_sharehash(self):
1819         d = corrupt(None, self._storage, "share_hash_chain", [9], 5)
1820         d.addCallback(lambda ignored:
1821             self._fn.check(Monitor(), verify=True))
1822         d.addCallback(self.check_bad, "test_verify_one_bad_sharehash")
1823         d.addCallback(self.check_expected_failure,
1824                       CorruptShareError, "corrupt hashes",
1825                       "test_verify_one_bad_sharehash")
1826         return d
1827
1828     def test_verify_one_bad_encprivkey(self):
1829         d = corrupt(None, self._storage, "enc_privkey", [9]) # bad privkey
1830         d.addCallback(lambda ignored:
1831             self._fn.check(Monitor(), verify=True))
1832         d.addCallback(self.check_bad, "test_verify_one_bad_encprivkey")
1833         d.addCallback(self.check_expected_failure,
1834                       CorruptShareError, "invalid privkey",
1835                       "test_verify_one_bad_encprivkey")
1836         return d
1837
1838     def test_verify_one_bad_encprivkey_uncheckable(self):
1839         d = corrupt(None, self._storage, "enc_privkey", [9]) # bad privkey
1840         readonly_fn = self._fn.get_readonly()
1841         # a read-only node has no way to validate the privkey
1842         d.addCallback(lambda ignored:
1843             readonly_fn.check(Monitor(), verify=True))
1844         d.addCallback(self.check_good,
1845                       "test_verify_one_bad_encprivkey_uncheckable")
1846         return d
1847
1848
1849     def test_verify_mdmf_good(self):
1850         d = self.publish_mdmf()
1851         d.addCallback(lambda ignored:
1852             self._fn.check(Monitor(), verify=True))
1853         d.addCallback(self.check_good, "test_verify_mdmf_good")
1854         return d
1855
1856
1857     def test_verify_mdmf_one_bad_block(self):
1858         d = self.publish_mdmf()
1859         d.addCallback(lambda ignored:
1860             corrupt(None, self._storage, "share_data", [1]))
1861         d.addCallback(lambda ignored:
1862             self._fn.check(Monitor(), verify=True))
1863         # We should find one bad block here
1864         d.addCallback(self.check_bad, "test_verify_mdmf_one_bad_block")
1865         d.addCallback(self.check_expected_failure,
1866                       CorruptShareError, "block hash tree failure",
1867                       "test_verify_mdmf_one_bad_block")
1868         return d
1869
1870
1871     def test_verify_mdmf_bad_encprivkey(self):
1872         d = self.publish_mdmf()
1873         d.addCallback(lambda ignored:
1874             corrupt(None, self._storage, "enc_privkey", [0]))
1875         d.addCallback(lambda ignored:
1876             self._fn.check(Monitor(), verify=True))
1877         d.addCallback(self.check_bad, "test_verify_mdmf_bad_encprivkey")
1878         d.addCallback(self.check_expected_failure,
1879                       CorruptShareError, "privkey",
1880                       "test_verify_mdmf_bad_encprivkey")
1881         return d
1882
1883
1884     def test_verify_mdmf_bad_sig(self):
1885         d = self.publish_mdmf()
1886         d.addCallback(lambda ignored:
1887             corrupt(None, self._storage, 1, [1]))
1888         d.addCallback(lambda ignored:
1889             self._fn.check(Monitor(), verify=True))
1890         d.addCallback(self.check_bad, "test_verify_mdmf_bad_sig")
1891         return d
1892
1893
1894     def test_verify_mdmf_bad_encprivkey_uncheckable(self):
1895         d = self.publish_mdmf()
1896         d.addCallback(lambda ignored:
1897             corrupt(None, self._storage, "enc_privkey", [1]))
1898         d.addCallback(lambda ignored:
1899             self._fn.get_readonly())
1900         d.addCallback(lambda fn:
1901             fn.check(Monitor(), verify=True))
1902         d.addCallback(self.check_good,
1903                       "test_verify_mdmf_bad_encprivkey_uncheckable")
1904         return d
1905
1906
1907 class Repair(unittest.TestCase, PublishMixin, ShouldFailMixin):
1908
1909     def get_shares(self, s):
1910         all_shares = {} # maps (peerid, shnum) to share data
1911         for peerid in s._peers:
1912             shares = s._peers[peerid]
1913             for shnum in shares:
1914                 data = shares[shnum]
1915                 all_shares[ (peerid, shnum) ] = data
1916         return all_shares
1917
1918     def copy_shares(self, ignored=None):
1919         self.old_shares.append(self.get_shares(self._storage))
1920
1921     def test_repair_nop(self):
1922         self.old_shares = []
1923         d = self.publish_one()
1924         d.addCallback(self.copy_shares)
1925         d.addCallback(lambda res: self._fn.check(Monitor()))
1926         d.addCallback(lambda check_results: self._fn.repair(check_results))
1927         def _check_results(rres):
1928             self.failUnless(IRepairResults.providedBy(rres))
1929             self.failUnless(rres.get_successful())
1930             # TODO: examine results
1931
1932             self.copy_shares()
1933
1934             initial_shares = self.old_shares[0]
1935             new_shares = self.old_shares[1]
1936             # TODO: this really shouldn't change anything. When we implement
1937             # a "minimal-bandwidth" repairer", change this test to assert:
1938             #self.failUnlessEqual(new_shares, initial_shares)
1939
1940             # all shares should be in the same place as before
1941             self.failUnlessEqual(set(initial_shares.keys()),
1942                                  set(new_shares.keys()))
1943             # but they should all be at a newer seqnum. The IV will be
1944             # different, so the roothash will be too.
1945             for key in initial_shares:
1946                 (version0,
1947                  seqnum0,
1948                  root_hash0,
1949                  IV0,
1950                  k0, N0, segsize0, datalen0,
1951                  o0) = unpack_header(initial_shares[key])
1952                 (version1,
1953                  seqnum1,
1954                  root_hash1,
1955                  IV1,
1956                  k1, N1, segsize1, datalen1,
1957                  o1) = unpack_header(new_shares[key])
1958                 self.failUnlessEqual(version0, version1)
1959                 self.failUnlessEqual(seqnum0+1, seqnum1)
1960                 self.failUnlessEqual(k0, k1)
1961                 self.failUnlessEqual(N0, N1)
1962                 self.failUnlessEqual(segsize0, segsize1)
1963                 self.failUnlessEqual(datalen0, datalen1)
1964         d.addCallback(_check_results)
1965         return d
1966
1967     def failIfSharesChanged(self, ignored=None):
1968         old_shares = self.old_shares[-2]
1969         current_shares = self.old_shares[-1]
1970         self.failUnlessEqual(old_shares, current_shares)
1971
1972
1973     def _test_whether_repairable(self, publisher, nshares, expected_result):
1974         d = publisher()
1975         def _delete_some_shares(ign):
1976             shares = self._storage._peers
1977             for peerid in shares:
1978                 for shnum in list(shares[peerid]):
1979                     if shnum >= nshares:
1980                         del shares[peerid][shnum]
1981         d.addCallback(_delete_some_shares)
1982         d.addCallback(lambda ign: self._fn.check(Monitor()))
1983         def _check(cr):
1984             self.failIf(cr.is_healthy())
1985             self.failUnlessEqual(cr.is_recoverable(), expected_result)
1986             return cr
1987         d.addCallback(_check)
1988         d.addCallback(lambda check_results: self._fn.repair(check_results))
1989         d.addCallback(lambda crr: self.failUnlessEqual(crr.get_successful(), expected_result))
1990         return d
1991
1992     def test_unrepairable_0shares(self):
1993         return self._test_whether_repairable(self.publish_one, 0, False)
1994
1995     def test_mdmf_unrepairable_0shares(self):
1996         return self._test_whether_repairable(self.publish_mdmf, 0, False)
1997
1998     def test_unrepairable_1share(self):
1999         return self._test_whether_repairable(self.publish_one, 1, False)
2000
2001     def test_mdmf_unrepairable_1share(self):
2002         return self._test_whether_repairable(self.publish_mdmf, 1, False)
2003
2004     def test_repairable_5shares(self):
2005         return self._test_whether_repairable(self.publish_one, 5, True)
2006
2007     def test_mdmf_repairable_5shares(self):
2008         return self._test_whether_repairable(self.publish_mdmf, 5, True)
2009
2010     def _test_whether_checkandrepairable(self, publisher, nshares, expected_result):
2011         """
2012         Like the _test_whether_repairable tests, but invoking check_and_repair
2013         instead of invoking check and then invoking repair.
2014         """
2015         d = publisher()
2016         def _delete_some_shares(ign):
2017             shares = self._storage._peers
2018             for peerid in shares:
2019                 for shnum in list(shares[peerid]):
2020                     if shnum >= nshares:
2021                         del shares[peerid][shnum]
2022         d.addCallback(_delete_some_shares)
2023         d.addCallback(lambda ign: self._fn.check_and_repair(Monitor()))
2024         d.addCallback(lambda crr: self.failUnlessEqual(crr.get_repair_successful(), expected_result))
2025         return d
2026
2027     def test_unrepairable_0shares_checkandrepair(self):
2028         return self._test_whether_checkandrepairable(self.publish_one, 0, False)
2029
2030     def test_mdmf_unrepairable_0shares_checkandrepair(self):
2031         return self._test_whether_checkandrepairable(self.publish_mdmf, 0, False)
2032
2033     def test_unrepairable_1share_checkandrepair(self):
2034         return self._test_whether_checkandrepairable(self.publish_one, 1, False)
2035
2036     def test_mdmf_unrepairable_1share_checkandrepair(self):
2037         return self._test_whether_checkandrepairable(self.publish_mdmf, 1, False)
2038
2039     def test_repairable_5shares_checkandrepair(self):
2040         return self._test_whether_checkandrepairable(self.publish_one, 5, True)
2041
2042     def test_mdmf_repairable_5shares_checkandrepair(self):
2043         return self._test_whether_checkandrepairable(self.publish_mdmf, 5, True)
2044
2045
2046     def test_merge(self):
2047         self.old_shares = []
2048         d = self.publish_multiple()
2049         # repair will refuse to merge multiple highest seqnums unless you
2050         # pass force=True
2051         d.addCallback(lambda res:
2052                       self._set_versions({0:3,2:3,4:3,6:3,8:3,
2053                                           1:4,3:4,5:4,7:4,9:4}))
2054         d.addCallback(self.copy_shares)
2055         d.addCallback(lambda res: self._fn.check(Monitor()))
2056         def _try_repair(check_results):
2057             ex = "There were multiple recoverable versions with identical seqnums, so force=True must be passed to the repair() operation"
2058             d2 = self.shouldFail(MustForceRepairError, "test_merge", ex,
2059                                  self._fn.repair, check_results)
2060             d2.addCallback(self.copy_shares)
2061             d2.addCallback(self.failIfSharesChanged)
2062             d2.addCallback(lambda res: check_results)
2063             return d2
2064         d.addCallback(_try_repair)
2065         d.addCallback(lambda check_results:
2066                       self._fn.repair(check_results, force=True))
2067         # this should give us 10 shares of the highest roothash
2068         def _check_repair_results(rres):
2069             self.failUnless(rres.get_successful())
2070             pass # TODO
2071         d.addCallback(_check_repair_results)
2072         d.addCallback(lambda res: self._fn.get_servermap(MODE_CHECK))
2073         def _check_smap(smap):
2074             self.failUnlessEqual(len(smap.recoverable_versions()), 1)
2075             self.failIf(smap.unrecoverable_versions())
2076             # now, which should have won?
2077             roothash_s4a = self.get_roothash_for(3)
2078             roothash_s4b = self.get_roothash_for(4)
2079             if roothash_s4b > roothash_s4a:
2080                 expected_contents = self.CONTENTS[4]
2081             else:
2082                 expected_contents = self.CONTENTS[3]
2083             new_versionid = smap.best_recoverable_version()
2084             self.failUnlessEqual(new_versionid[0], 5) # seqnum 5
2085             d2 = self._fn.download_version(smap, new_versionid)
2086             d2.addCallback(self.failUnlessEqual, expected_contents)
2087             return d2
2088         d.addCallback(_check_smap)
2089         return d
2090
2091     def test_non_merge(self):
2092         self.old_shares = []
2093         d = self.publish_multiple()
2094         # repair should not refuse a repair that doesn't need to merge. In
2095         # this case, we combine v2 with v3. The repair should ignore v2 and
2096         # copy v3 into a new v5.
2097         d.addCallback(lambda res:
2098                       self._set_versions({0:2,2:2,4:2,6:2,8:2,
2099                                           1:3,3:3,5:3,7:3,9:3}))
2100         d.addCallback(lambda res: self._fn.check(Monitor()))
2101         d.addCallback(lambda check_results: self._fn.repair(check_results))
2102         # this should give us 10 shares of v3
2103         def _check_repair_results(rres):
2104             self.failUnless(rres.get_successful())
2105             pass # TODO
2106         d.addCallback(_check_repair_results)
2107         d.addCallback(lambda res: self._fn.get_servermap(MODE_CHECK))
2108         def _check_smap(smap):
2109             self.failUnlessEqual(len(smap.recoverable_versions()), 1)
2110             self.failIf(smap.unrecoverable_versions())
2111             # now, which should have won?
2112             expected_contents = self.CONTENTS[3]
2113             new_versionid = smap.best_recoverable_version()
2114             self.failUnlessEqual(new_versionid[0], 5) # seqnum 5
2115             d2 = self._fn.download_version(smap, new_versionid)
2116             d2.addCallback(self.failUnlessEqual, expected_contents)
2117             return d2
2118         d.addCallback(_check_smap)
2119         return d
2120
2121     def get_roothash_for(self, index):
2122         # return the roothash for the first share we see in the saved set
2123         shares = self._copied_shares[index]
2124         for peerid in shares:
2125             for shnum in shares[peerid]:
2126                 share = shares[peerid][shnum]
2127                 (version, seqnum, root_hash, IV, k, N, segsize, datalen, o) = \
2128                           unpack_header(share)
2129                 return root_hash
2130
2131     def test_check_and_repair_readcap(self):
2132         # we can't currently repair from a mutable readcap: #625
2133         self.old_shares = []
2134         d = self.publish_one()
2135         d.addCallback(self.copy_shares)
2136         def _get_readcap(res):
2137             self._fn3 = self._fn.get_readonly()
2138             # also delete some shares
2139             for peerid,shares in self._storage._peers.items():
2140                 shares.pop(0, None)
2141         d.addCallback(_get_readcap)
2142         d.addCallback(lambda res: self._fn3.check_and_repair(Monitor()))
2143         def _check_results(crr):
2144             self.failUnless(ICheckAndRepairResults.providedBy(crr))
2145             # we should detect the unhealthy, but skip over mutable-readcap
2146             # repairs until #625 is fixed
2147             self.failIf(crr.get_pre_repair_results().is_healthy())
2148             self.failIf(crr.get_repair_attempted())
2149             self.failIf(crr.get_post_repair_results().is_healthy())
2150         d.addCallback(_check_results)
2151         return d
2152
2153     def test_repair_empty(self):
2154         # bug 1689: delete one share of an empty mutable file, then repair.
2155         # In the buggy version, the check that precedes the retrieve+publish
2156         # cycle uses MODE_READ, instead of MODE_REPAIR, and fails to get the
2157         # privkey that repair needs.
2158         d = self.publish_empty_sdmf()
2159         def _delete_one_share(ign):
2160             shares = self._storage._peers
2161             for peerid in shares:
2162                 for shnum in list(shares[peerid]):
2163                     if shnum == 0:
2164                         del shares[peerid][shnum]
2165         d.addCallback(_delete_one_share)
2166         d.addCallback(lambda ign: self._fn2.check(Monitor()))
2167         d.addCallback(lambda check_results: self._fn2.repair(check_results))
2168         def _check(crr):
2169             self.failUnlessEqual(crr.get_successful(), True)
2170         d.addCallback(_check)
2171         return d
2172
2173 class DevNullDictionary(dict):
2174     def __setitem__(self, key, value):
2175         return
2176
2177 class MultipleEncodings(unittest.TestCase):
2178     def setUp(self):
2179         self.CONTENTS = "New contents go here"
2180         self.uploadable = MutableData(self.CONTENTS)
2181         self._storage = FakeStorage()
2182         self._nodemaker = make_nodemaker(self._storage, num_peers=20)
2183         self._storage_broker = self._nodemaker.storage_broker
2184         d = self._nodemaker.create_mutable_file(self.uploadable)
2185         def _created(node):
2186             self._fn = node
2187         d.addCallback(_created)
2188         return d
2189
2190     def _encode(self, k, n, data, version=SDMF_VERSION):
2191         # encode 'data' into a peerid->shares dict.
2192
2193         fn = self._fn
2194         # disable the nodecache, since for these tests we explicitly need
2195         # multiple nodes pointing at the same file
2196         self._nodemaker._node_cache = DevNullDictionary()
2197         fn2 = self._nodemaker.create_from_cap(fn.get_uri())
2198         # then we copy over other fields that are normally fetched from the
2199         # existing shares
2200         fn2._pubkey = fn._pubkey
2201         fn2._privkey = fn._privkey
2202         fn2._encprivkey = fn._encprivkey
2203         # and set the encoding parameters to something completely different
2204         fn2._required_shares = k
2205         fn2._total_shares = n
2206
2207         s = self._storage
2208         s._peers = {} # clear existing storage
2209         p2 = Publish(fn2, self._storage_broker, None)
2210         uploadable = MutableData(data)
2211         d = p2.publish(uploadable)
2212         def _published(res):
2213             shares = s._peers
2214             s._peers = {}
2215             return shares
2216         d.addCallback(_published)
2217         return d
2218
2219     def make_servermap(self, mode=MODE_READ, oldmap=None):
2220         if oldmap is None:
2221             oldmap = ServerMap()
2222         smu = ServermapUpdater(self._fn, self._storage_broker, Monitor(),
2223                                oldmap, mode)
2224         d = smu.update()
2225         return d
2226
2227     def test_multiple_encodings(self):
2228         # we encode the same file in two different ways (3-of-10 and 4-of-9),
2229         # then mix up the shares, to make sure that download survives seeing
2230         # a variety of encodings. This is actually kind of tricky to set up.
2231
2232         contents1 = "Contents for encoding 1 (3-of-10) go here"*1000
2233         contents2 = "Contents for encoding 2 (4-of-9) go here"*1000
2234         contents3 = "Contents for encoding 3 (4-of-7) go here"*1000
2235
2236         # we make a retrieval object that doesn't know what encoding
2237         # parameters to use
2238         fn3 = self._nodemaker.create_from_cap(self._fn.get_uri())
2239
2240         # now we upload a file through fn1, and grab its shares
2241         d = self._encode(3, 10, contents1)
2242         def _encoded_1(shares):
2243             self._shares1 = shares
2244         d.addCallback(_encoded_1)
2245         d.addCallback(lambda res: self._encode(4, 9, contents2))
2246         def _encoded_2(shares):
2247             self._shares2 = shares
2248         d.addCallback(_encoded_2)
2249         d.addCallback(lambda res: self._encode(4, 7, contents3))
2250         def _encoded_3(shares):
2251             self._shares3 = shares
2252         d.addCallback(_encoded_3)
2253
2254         def _merge(res):
2255             log.msg("merging sharelists")
2256             # we merge the shares from the two sets, leaving each shnum in
2257             # its original location, but using a share from set1 or set2
2258             # according to the following sequence:
2259             #
2260             #  4-of-9  a  s2
2261             #  4-of-9  b  s2
2262             #  4-of-7  c   s3
2263             #  4-of-9  d  s2
2264             #  3-of-9  e s1
2265             #  3-of-9  f s1
2266             #  3-of-9  g s1
2267             #  4-of-9  h  s2
2268             #
2269             # so that neither form can be recovered until fetch [f], at which
2270             # point version-s1 (the 3-of-10 form) should be recoverable. If
2271             # the implementation latches on to the first version it sees,
2272             # then s2 will be recoverable at fetch [g].
2273
2274             # Later, when we implement code that handles multiple versions,
2275             # we can use this framework to assert that all recoverable
2276             # versions are retrieved, and test that 'epsilon' does its job
2277
2278             places = [2, 2, 3, 2, 1, 1, 1, 2]
2279
2280             sharemap = {}
2281             sb = self._storage_broker
2282
2283             for peerid in sorted(sb.get_all_serverids()):
2284                 for shnum in self._shares1.get(peerid, {}):
2285                     if shnum < len(places):
2286                         which = places[shnum]
2287                     else:
2288                         which = "x"
2289                     self._storage._peers[peerid] = peers = {}
2290                     in_1 = shnum in self._shares1[peerid]
2291                     in_2 = shnum in self._shares2.get(peerid, {})
2292                     in_3 = shnum in self._shares3.get(peerid, {})
2293                     if which == 1:
2294                         if in_1:
2295                             peers[shnum] = self._shares1[peerid][shnum]
2296                             sharemap[shnum] = peerid
2297                     elif which == 2:
2298                         if in_2:
2299                             peers[shnum] = self._shares2[peerid][shnum]
2300                             sharemap[shnum] = peerid
2301                     elif which == 3:
2302                         if in_3:
2303                             peers[shnum] = self._shares3[peerid][shnum]
2304                             sharemap[shnum] = peerid
2305
2306             # we don't bother placing any other shares
2307             # now sort the sequence so that share 0 is returned first
2308             new_sequence = [sharemap[shnum]
2309                             for shnum in sorted(sharemap.keys())]
2310             self._storage._sequence = new_sequence
2311             log.msg("merge done")
2312         d.addCallback(_merge)
2313         d.addCallback(lambda res: fn3.download_best_version())
2314         def _retrieved(new_contents):
2315             # the current specified behavior is "first version recoverable"
2316             self.failUnlessEqual(new_contents, contents1)
2317         d.addCallback(_retrieved)
2318         return d
2319
2320
2321 class MultipleVersions(unittest.TestCase, PublishMixin, CheckerMixin):
2322
2323     def setUp(self):
2324         return self.publish_multiple()
2325
2326     def test_multiple_versions(self):
2327         # if we see a mix of versions in the grid, download_best_version
2328         # should get the latest one
2329         self._set_versions(dict([(i,2) for i in (0,2,4,6,8)]))
2330         d = self._fn.download_best_version()
2331         d.addCallback(lambda res: self.failUnlessEqual(res, self.CONTENTS[4]))
2332         # and the checker should report problems
2333         d.addCallback(lambda res: self._fn.check(Monitor()))
2334         d.addCallback(self.check_bad, "test_multiple_versions")
2335
2336         # but if everything is at version 2, that's what we should download
2337         d.addCallback(lambda res:
2338                       self._set_versions(dict([(i,2) for i in range(10)])))
2339         d.addCallback(lambda res: self._fn.download_best_version())
2340         d.addCallback(lambda res: self.failUnlessEqual(res, self.CONTENTS[2]))
2341         # if exactly one share is at version 3, we should still get v2
2342         d.addCallback(lambda res:
2343                       self._set_versions({0:3}))
2344         d.addCallback(lambda res: self._fn.download_best_version())
2345         d.addCallback(lambda res: self.failUnlessEqual(res, self.CONTENTS[2]))
2346         # but the servermap should see the unrecoverable version. This
2347         # depends upon the single newer share being queried early.
2348         d.addCallback(lambda res: self._fn.get_servermap(MODE_READ))
2349         def _check_smap(smap):
2350             self.failUnlessEqual(len(smap.unrecoverable_versions()), 1)
2351             newer = smap.unrecoverable_newer_versions()
2352             self.failUnlessEqual(len(newer), 1)
2353             verinfo, health = newer.items()[0]
2354             self.failUnlessEqual(verinfo[0], 4)
2355             self.failUnlessEqual(health, (1,3))
2356             self.failIf(smap.needs_merge())
2357         d.addCallback(_check_smap)
2358         # if we have a mix of two parallel versions (s4a and s4b), we could
2359         # recover either
2360         d.addCallback(lambda res:
2361                       self._set_versions({0:3,2:3,4:3,6:3,8:3,
2362                                           1:4,3:4,5:4,7:4,9:4}))
2363         d.addCallback(lambda res: self._fn.get_servermap(MODE_READ))
2364         def _check_smap_mixed(smap):
2365             self.failUnlessEqual(len(smap.unrecoverable_versions()), 0)
2366             newer = smap.unrecoverable_newer_versions()
2367             self.failUnlessEqual(len(newer), 0)
2368             self.failUnless(smap.needs_merge())
2369         d.addCallback(_check_smap_mixed)
2370         d.addCallback(lambda res: self._fn.download_best_version())
2371         d.addCallback(lambda res: self.failUnless(res == self.CONTENTS[3] or
2372                                                   res == self.CONTENTS[4]))
2373         return d
2374
2375     def test_replace(self):
2376         # if we see a mix of versions in the grid, we should be able to
2377         # replace them all with a newer version
2378
2379         # if exactly one share is at version 3, we should download (and
2380         # replace) v2, and the result should be v4. Note that the index we
2381         # give to _set_versions is different than the sequence number.
2382         target = dict([(i,2) for i in range(10)]) # seqnum3
2383         target[0] = 3 # seqnum4
2384         self._set_versions(target)
2385
2386         def _modify(oldversion, servermap, first_time):
2387             return oldversion + " modified"
2388         d = self._fn.modify(_modify)
2389         d.addCallback(lambda res: self._fn.download_best_version())
2390         expected = self.CONTENTS[2] + " modified"
2391         d.addCallback(lambda res: self.failUnlessEqual(res, expected))
2392         # and the servermap should indicate that the outlier was replaced too
2393         d.addCallback(lambda res: self._fn.get_servermap(MODE_CHECK))
2394         def _check_smap(smap):
2395             self.failUnlessEqual(smap.highest_seqnum(), 5)
2396             self.failUnlessEqual(len(smap.unrecoverable_versions()), 0)
2397             self.failUnlessEqual(len(smap.recoverable_versions()), 1)
2398         d.addCallback(_check_smap)
2399         return d
2400
2401
2402 class Exceptions(unittest.TestCase):
2403     def test_repr(self):
2404         nmde = NeedMoreDataError(100, 50, 100)
2405         self.failUnless("NeedMoreDataError" in repr(nmde), repr(nmde))
2406         ucwe = UncoordinatedWriteError()
2407         self.failUnless("UncoordinatedWriteError" in repr(ucwe), repr(ucwe))
2408
2409
2410 class SameKeyGenerator:
2411     def __init__(self, pubkey, privkey):
2412         self.pubkey = pubkey
2413         self.privkey = privkey
2414     def generate(self, keysize=None):
2415         return defer.succeed( (self.pubkey, self.privkey) )
2416
2417 class FirstServerGetsKilled:
2418     done = False
2419     def notify(self, retval, wrapper, methname):
2420         if not self.done:
2421             wrapper.broken = True
2422             self.done = True
2423         return retval
2424
2425 class FirstServerGetsDeleted:
2426     def __init__(self):
2427         self.done = False
2428         self.silenced = None
2429     def notify(self, retval, wrapper, methname):
2430         if not self.done:
2431             # this query will work, but later queries should think the share
2432             # has been deleted
2433             self.done = True
2434             self.silenced = wrapper
2435             return retval
2436         if wrapper == self.silenced:
2437             assert methname == "slot_testv_and_readv_and_writev"
2438             return (True, {})
2439         return retval
2440
2441 class Problems(GridTestMixin, unittest.TestCase, testutil.ShouldFailMixin):
2442     def do_publish_surprise(self, version):
2443         self.basedir = "mutable/Problems/test_publish_surprise_%s" % version
2444         self.set_up_grid()
2445         nm = self.g.clients[0].nodemaker
2446         d = nm.create_mutable_file(MutableData("contents 1"),
2447                                     version=version)
2448         def _created(n):
2449             d = defer.succeed(None)
2450             d.addCallback(lambda res: n.get_servermap(MODE_WRITE))
2451             def _got_smap1(smap):
2452                 # stash the old state of the file
2453                 self.old_map = smap
2454             d.addCallback(_got_smap1)
2455             # then modify the file, leaving the old map untouched
2456             d.addCallback(lambda res: log.msg("starting winning write"))
2457             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
2458             # now attempt to modify the file with the old servermap. This
2459             # will look just like an uncoordinated write, in which every
2460             # single share got updated between our mapupdate and our publish
2461             d.addCallback(lambda res: log.msg("starting doomed write"))
2462             d.addCallback(lambda res:
2463                           self.shouldFail(UncoordinatedWriteError,
2464                                           "test_publish_surprise", None,
2465                                           n.upload,
2466                                           MutableData("contents 2a"), self.old_map))
2467             return d
2468         d.addCallback(_created)
2469         return d
2470
2471     def test_publish_surprise_sdmf(self):
2472         return self.do_publish_surprise(SDMF_VERSION)
2473
2474     def test_publish_surprise_mdmf(self):
2475         return self.do_publish_surprise(MDMF_VERSION)
2476
2477     def test_retrieve_surprise(self):
2478         self.basedir = "mutable/Problems/test_retrieve_surprise"
2479         self.set_up_grid()
2480         nm = self.g.clients[0].nodemaker
2481         d = nm.create_mutable_file(MutableData("contents 1"*4000))
2482         def _created(n):
2483             d = defer.succeed(None)
2484             d.addCallback(lambda res: n.get_servermap(MODE_READ))
2485             def _got_smap1(smap):
2486                 # stash the old state of the file
2487                 self.old_map = smap
2488             d.addCallback(_got_smap1)
2489             # then modify the file, leaving the old map untouched
2490             d.addCallback(lambda res: log.msg("starting winning write"))
2491             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
2492             # now attempt to retrieve the old version with the old servermap.
2493             # This will look like someone has changed the file since we
2494             # updated the servermap.
2495             d.addCallback(lambda res: log.msg("starting doomed read"))
2496             d.addCallback(lambda res:
2497                           self.shouldFail(NotEnoughSharesError,
2498                                           "test_retrieve_surprise",
2499                                           "ran out of servers: have 0 of 1",
2500                                           n.download_version,
2501                                           self.old_map,
2502                                           self.old_map.best_recoverable_version(),
2503                                           ))
2504             return d
2505         d.addCallback(_created)
2506         return d
2507
2508
2509     def test_unexpected_shares(self):
2510         # upload the file, take a servermap, shut down one of the servers,
2511         # upload it again (causing shares to appear on a new server), then
2512         # upload using the old servermap. The last upload should fail with an
2513         # UncoordinatedWriteError, because of the shares that didn't appear
2514         # in the servermap.
2515         self.basedir = "mutable/Problems/test_unexpected_shares"
2516         self.set_up_grid()
2517         nm = self.g.clients[0].nodemaker
2518         d = nm.create_mutable_file(MutableData("contents 1"))
2519         def _created(n):
2520             d = defer.succeed(None)
2521             d.addCallback(lambda res: n.get_servermap(MODE_WRITE))
2522             def _got_smap1(smap):
2523                 # stash the old state of the file
2524                 self.old_map = smap
2525                 # now shut down one of the servers
2526                 peer0 = list(smap.make_sharemap()[0])[0].get_serverid()
2527                 self.g.remove_server(peer0)
2528                 # then modify the file, leaving the old map untouched
2529                 log.msg("starting winning write")
2530                 return n.overwrite(MutableData("contents 2"))
2531             d.addCallback(_got_smap1)
2532             # now attempt to modify the file with the old servermap. This
2533             # will look just like an uncoordinated write, in which every
2534             # single share got updated between our mapupdate and our publish
2535             d.addCallback(lambda res: log.msg("starting doomed write"))
2536             d.addCallback(lambda res:
2537                           self.shouldFail(UncoordinatedWriteError,
2538                                           "test_surprise", None,
2539                                           n.upload,
2540                                           MutableData("contents 2a"), self.old_map))
2541             return d
2542         d.addCallback(_created)
2543         return d
2544
2545     def test_multiply_placed_shares(self):
2546         self.basedir = "mutable/Problems/test_multiply_placed_shares"
2547         self.set_up_grid()
2548         nm = self.g.clients[0].nodemaker
2549         d = nm.create_mutable_file(MutableData("contents 1"))
2550         # remove one of the servers and reupload the file.
2551         def _created(n):
2552             self._node = n
2553
2554             servers = self.g.get_all_serverids()
2555             self.ss = self.g.remove_server(servers[len(servers)-1])
2556
2557             new_server = self.g.make_server(len(servers)-1)
2558             self.g.add_server(len(servers)-1, new_server)
2559
2560             return self._node.download_best_version()
2561         d.addCallback(_created)
2562         d.addCallback(lambda data: MutableData(data))
2563         d.addCallback(lambda data: self._node.overwrite(data))
2564
2565         # restore the server we removed earlier, then download+upload
2566         # the file again
2567         def _overwritten(ign):
2568             self.g.add_server(len(self.g.servers_by_number), self.ss)
2569             return self._node.download_best_version()
2570         d.addCallback(_overwritten)
2571         d.addCallback(lambda data: MutableData(data))
2572         d.addCallback(lambda data: self._node.overwrite(data))
2573         d.addCallback(lambda ignored:
2574             self._node.get_servermap(MODE_CHECK))
2575         def _overwritten_again(smap):
2576             # Make sure that all shares were updated by making sure that
2577             # there aren't any other versions in the sharemap.
2578             self.failUnlessEqual(len(smap.recoverable_versions()), 1)
2579             self.failUnlessEqual(len(smap.unrecoverable_versions()), 0)
2580         d.addCallback(_overwritten_again)
2581         return d
2582
2583     def test_bad_server(self):
2584         # Break one server, then create the file: the initial publish should
2585         # complete with an alternate server. Breaking a second server should
2586         # not prevent an update from succeeding either.
2587         self.basedir = "mutable/Problems/test_bad_server"
2588         self.set_up_grid()
2589         nm = self.g.clients[0].nodemaker
2590
2591         # to make sure that one of the initial peers is broken, we have to
2592         # get creative. We create an RSA key and compute its storage-index.
2593         # Then we make a KeyGenerator that always returns that one key, and
2594         # use it to create the mutable file. This will get easier when we can
2595         # use #467 static-server-selection to disable permutation and force
2596         # the choice of server for share[0].
2597
2598         d = nm.key_generator.generate(TEST_RSA_KEY_SIZE)
2599         def _got_key( (pubkey, privkey) ):
2600             nm.key_generator = SameKeyGenerator(pubkey, privkey)
2601             pubkey_s = pubkey.serialize()
2602             privkey_s = privkey.serialize()
2603             u = uri.WriteableSSKFileURI(ssk_writekey_hash(privkey_s),
2604                                         ssk_pubkey_fingerprint_hash(pubkey_s))
2605             self._storage_index = u.get_storage_index()
2606         d.addCallback(_got_key)
2607         def _break_peer0(res):
2608             si = self._storage_index
2609             servers = nm.storage_broker.get_servers_for_psi(si)
2610             self.g.break_server(servers[0].get_serverid())
2611             self.server1 = servers[1]
2612         d.addCallback(_break_peer0)
2613         # now "create" the file, using the pre-established key, and let the
2614         # initial publish finally happen
2615         d.addCallback(lambda res: nm.create_mutable_file(MutableData("contents 1")))
2616         # that ought to work
2617         def _got_node(n):
2618             d = n.download_best_version()
2619             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 1"))
2620             # now break the second peer
2621             def _break_peer1(res):
2622                 self.g.break_server(self.server1.get_serverid())
2623             d.addCallback(_break_peer1)
2624             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
2625             # that ought to work too
2626             d.addCallback(lambda res: n.download_best_version())
2627             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 2"))
2628             def _explain_error(f):
2629                 print f
2630                 if f.check(NotEnoughServersError):
2631                     print "first_error:", f.value.first_error
2632                 return f
2633             d.addErrback(_explain_error)
2634             return d
2635         d.addCallback(_got_node)
2636         return d
2637
2638     def test_bad_server_overlap(self):
2639         # like test_bad_server, but with no extra unused servers to fall back
2640         # upon. This means that we must re-use a server which we've already
2641         # used. If we don't remember the fact that we sent them one share
2642         # already, we'll mistakenly think we're experiencing an
2643         # UncoordinatedWriteError.
2644
2645         # Break one server, then create the file: the initial publish should
2646         # complete with an alternate server. Breaking a second server should
2647         # not prevent an update from succeeding either.
2648         self.basedir = "mutable/Problems/test_bad_server_overlap"
2649         self.set_up_grid()
2650         nm = self.g.clients[0].nodemaker
2651         sb = nm.storage_broker
2652
2653         peerids = [s.get_serverid() for s in sb.get_connected_servers()]
2654         self.g.break_server(peerids[0])
2655
2656         d = nm.create_mutable_file(MutableData("contents 1"))
2657         def _created(n):
2658             d = n.download_best_version()
2659             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 1"))
2660             # now break one of the remaining servers
2661             def _break_second_server(res):
2662                 self.g.break_server(peerids[1])
2663             d.addCallback(_break_second_server)
2664             d.addCallback(lambda res: n.overwrite(MutableData("contents 2")))
2665             # that ought to work too
2666             d.addCallback(lambda res: n.download_best_version())
2667             d.addCallback(lambda res: self.failUnlessEqual(res, "contents 2"))
2668             return d
2669         d.addCallback(_created)
2670         return d
2671
2672     def test_publish_all_servers_bad(self):
2673         # Break all servers: the publish should fail
2674         self.basedir = "mutable/Problems/test_publish_all_servers_bad"
2675         self.set_up_grid()
2676         nm = self.g.clients[0].nodemaker
2677         for s in nm.storage_broker.get_connected_servers():
2678             s.get_rref().broken = True
2679
2680         d = self.shouldFail(NotEnoughServersError,
2681                             "test_publish_all_servers_bad",
2682                             "ran out of good servers",
2683                             nm.create_mutable_file, MutableData("contents"))
2684         return d
2685
2686     def test_publish_no_servers(self):
2687         # no servers at all: the publish should fail
2688         self.basedir = "mutable/Problems/test_publish_no_servers"
2689         self.set_up_grid(num_servers=0)
2690         nm = self.g.clients[0].nodemaker
2691
2692         d = self.shouldFail(NotEnoughServersError,
2693                             "test_publish_no_servers",
2694                             "Ran out of non-bad servers",
2695                             nm.create_mutable_file, MutableData("contents"))
2696         return d
2697
2698
2699     def test_privkey_query_error(self):
2700         # when a servermap is updated with MODE_WRITE, it tries to get the
2701         # privkey. Something might go wrong during this query attempt.
2702         # Exercise the code in _privkey_query_failed which tries to handle
2703         # such an error.
2704         self.basedir = "mutable/Problems/test_privkey_query_error"
2705         self.set_up_grid(num_servers=20)
2706         nm = self.g.clients[0].nodemaker
2707         nm._node_cache = DevNullDictionary() # disable the nodecache
2708
2709         # we need some contents that are large enough to push the privkey out
2710         # of the early part of the file
2711         LARGE = "These are Larger contents" * 2000 # about 50KB
2712         LARGE_uploadable = MutableData(LARGE)
2713         d = nm.create_mutable_file(LARGE_uploadable)
2714         def _created(n):
2715             self.uri = n.get_uri()
2716             self.n2 = nm.create_from_cap(self.uri)
2717
2718             # When a mapupdate is performed on a node that doesn't yet know
2719             # the privkey, a short read is sent to a batch of servers, to get
2720             # the verinfo and (hopefully, if the file is short enough) the
2721             # encprivkey. Our file is too large to let this first read
2722             # contain the encprivkey. Each non-encprivkey-bearing response
2723             # that arrives (until the node gets the encprivkey) will trigger
2724             # a second read to specifically read the encprivkey.
2725             #
2726             # So, to exercise this case:
2727             #  1. notice which server gets a read() call first
2728             #  2. tell that server to start throwing errors
2729             killer = FirstServerGetsKilled()
2730             for s in nm.storage_broker.get_connected_servers():
2731                 s.get_rref().post_call_notifier = killer.notify
2732         d.addCallback(_created)
2733
2734         # now we update a servermap from a new node (which doesn't have the
2735         # privkey yet, forcing it to use a separate privkey query). Note that
2736         # the map-update will succeed, since we'll just get a copy from one
2737         # of the other shares.
2738         d.addCallback(lambda res: self.n2.get_servermap(MODE_WRITE))
2739
2740         return d
2741
2742     def test_privkey_query_missing(self):
2743         # like test_privkey_query_error, but the shares are deleted by the
2744         # second query, instead of raising an exception.
2745         self.basedir = "mutable/Problems/test_privkey_query_missing"
2746         self.set_up_grid(num_servers=20)
2747         nm = self.g.clients[0].nodemaker
2748         LARGE = "These are Larger contents" * 2000 # about 50KiB
2749         LARGE_uploadable = MutableData(LARGE)
2750         nm._node_cache = DevNullDictionary() # disable the nodecache
2751
2752         d = nm.create_mutable_file(LARGE_uploadable)
2753         def _created(n):
2754             self.uri = n.get_uri()
2755             self.n2 = nm.create_from_cap(self.uri)
2756             deleter = FirstServerGetsDeleted()
2757             for s in nm.storage_broker.get_connected_servers():
2758                 s.get_rref().post_call_notifier = deleter.notify
2759         d.addCallback(_created)
2760         d.addCallback(lambda res: self.n2.get_servermap(MODE_WRITE))
2761         return d
2762
2763
2764     def test_block_and_hash_query_error(self):
2765         # This tests for what happens when a query to a remote server
2766         # fails in either the hash validation step or the block getting
2767         # step (because of batching, this is the same actual query).
2768         # We need to have the storage server persist up until the point
2769         # that its prefix is validated, then suddenly die. This
2770         # exercises some exception handling code in Retrieve.
2771         self.basedir = "mutable/Problems/test_block_and_hash_query_error"
2772         self.set_up_grid(num_servers=20)
2773         nm = self.g.clients[0].nodemaker
2774         CONTENTS = "contents" * 2000
2775         CONTENTS_uploadable = MutableData(CONTENTS)
2776         d = nm.create_mutable_file(CONTENTS_uploadable)
2777         def _created(node):
2778             self._node = node
2779         d.addCallback(_created)
2780         d.addCallback(lambda ignored:
2781             self._node.get_servermap(MODE_READ))
2782         def _then(servermap):
2783             # we have our servermap. Now we set up the servers like the
2784             # tests above -- the first one that gets a read call should
2785             # start throwing errors, but only after returning its prefix
2786             # for validation. Since we'll download without fetching the
2787             # private key, the next query to the remote server will be
2788             # for either a block and salt or for hashes, either of which
2789             # will exercise the error handling code.
2790             killer = FirstServerGetsKilled()
2791             for s in nm.storage_broker.get_connected_servers():
2792                 s.get_rref().post_call_notifier = killer.notify
2793             ver = servermap.best_recoverable_version()
2794             assert ver
2795             return self._node.download_version(servermap, ver)
2796         d.addCallback(_then)
2797         d.addCallback(lambda data:
2798             self.failUnlessEqual(data, CONTENTS))
2799         return d
2800
2801     def test_1654(self):
2802         # test that the Retrieve object unconditionally verifies the block
2803         # hash tree root for mutable shares. The failure mode is that
2804         # carefully crafted shares can cause undetected corruption (the
2805         # retrieve appears to finish successfully, but the result is
2806         # corrupted). When fixed, these shares always cause a
2807         # CorruptShareError, which results in NotEnoughSharesError in this
2808         # 2-of-2 file.
2809         self.basedir = "mutable/Problems/test_1654"
2810         self.set_up_grid(num_servers=2)
2811         cap = uri.from_string(TEST_1654_CAP)
2812         si = cap.get_storage_index()
2813
2814         for share, shnum in [(TEST_1654_SH0, 0), (TEST_1654_SH1, 1)]:
2815             sharedata = base64.b64decode(share)
2816             storedir = self.get_serverdir(shnum)
2817             storage_path = os.path.join(storedir, "shares",
2818                                         storage_index_to_dir(si))
2819             fileutil.make_dirs(storage_path)
2820             fileutil.write(os.path.join(storage_path, "%d" % shnum),
2821                            sharedata)
2822
2823         nm = self.g.clients[0].nodemaker
2824         n = nm.create_from_cap(TEST_1654_CAP)
2825         # to exercise the problem correctly, we must ensure that sh0 is
2826         # processed first, and sh1 second. NoNetworkGrid has facilities to
2827         # stall the first request from a single server, but it's not
2828         # currently easy to extend that to stall the second request (mutable
2829         # retrievals will see two: first the mapupdate, then the fetch).
2830         # However, repeated executions of this run without the #1654 fix
2831         # suggests that we're failing reliably even without explicit stalls,
2832         # probably because the servers are queried in a fixed order. So I'm
2833         # ok with relying upon that.
2834         d = self.shouldFail(NotEnoughSharesError, "test #1654 share corruption",
2835                             "ran out of servers",
2836                             n.download_best_version)
2837         return d
2838
2839
2840 TEST_1654_CAP = "URI:SSK:6jthysgozssjnagqlcxjq7recm:yxawei54fmf2ijkrvs2shs6iey4kpdp6joi7brj2vrva6sp5nf3a"
2841
2842 TEST_1654_SH0 = """\
2843 VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA46m9s5j6lnzsOHytBTs2JOo
2844 AkWe8058hyrDa8igfBSqZMKO3aDOrFuRVt0ySYZ6oihFqPJRAAAAAAAAB8YAAAAA
2845 AAAJmgAAAAFPNgDkK8brSCzKz6n8HFqzbnAlALvnaB0Qpa1Bjo9jiZdmeMyneHR+
2846 UoJcDb1Ls+lVLeUqP2JitBEXdCzcF/X2YMDlmKb2zmPqWfOw4fK0FOzYk6gCRZ7z
2847 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2848 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2849 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2850 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2851 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2852 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABCDwr
2853 uIlhFlv21pDqyMeA9X1wHp98a1CKY4qfC7gn5exyODAcnhZKHCV18XBerbZLAgIA
2854 AAAAAAAAJgAAAAAAAAAmAAABjwAAAo8AAALTAAAC8wAAAAAAAAMGAAAAAAAAB8Yw
2855 ggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQCXKMor062nfxHVutMbqNcj
2856 vVC92wXTcQulenNWEX+0huK54igTAG60p0lZ6FpBJ9A+dlStT386bn5I6qe50ky5
2857 CFodQSsQX+1yByMFlzqPDo4rclk/6oVySLypxnt/iBs3FPZ4zruhYXcITc6zaYYU
2858 Xqaw/C86g6M06MWQKsGev7PS3tH7q+dtovWzDgU13Q8PG2whGvGNfxPOmEX4j0wL
2859 FCBavpFnLpo3bJrj27V33HXxpPz3NP+fkaG0pKH03ANd/yYHfGf74dC+eD5dvWBM
2860 DU6fZQN4k/T+cth+qzjS52FPPTY9IHXIb4y+1HryVvxcx6JDifKoOzpFc3SDbBAP
2861 AgERKDjOFxVClH81DF/QkqpP0glOh6uTsFNx8Nes02q0d7iip2WqfG9m2+LmiWy8
2862 Pg7RlQQy2M45gert1EDsH4OI69uxteviZP1Mo0wD6HjmWUbGIQRmsT3DmYEZCCMA
2863 /KjhNmlov2+OhVxIaHwE7aN840IfkGdJ/JssB6Z/Ym3+ou4+jAYKhifPQGrpBVjd
2864 73oH6w9StnoGYIrEEQw8LFc4jnAFYciKlPuo6E6E3zDseE7gwkcOpCtVVksZu6Ii
2865 GQgIV8vjFbNz9M//RMXOBTwKFDiG08IAPh7fv2uKzFis0TFrR7sQcMQ/kZZCLPPi
2866 ECIX95NRoFRlxK/1kZ1+FuuDQgABz9+5yd/pjkVybmvc7Jr70bOVpxvRoI2ZEgh/
2867 +QdxfcwAAm5iDnzPtsVdcbuNkKprfI8N4n+QmUOSMbAJ7M8r1cp4z9+5yd/pjkVy
2868 bmvc7Jr70bOVpxvRoI2ZEgh/+QdxfcxGzRV0shAW86irr5bDQOyyknYk0p2xw2Wn
2869 z6QccyXyobXPOFLO3ZBPnKaE58aaN7x3srQZYUKafet5ZMDX8fsQf2mbxnaeG5NF
2870 eO6wG++WBUo9leddnzKBnRcMGRAtJEjwfKMVPE8SmuTlL6kRc7n8wvY2ygClWlRm
2871 d7o95tZfoO+mexB/DLEpWLtlAiqh8yJ8cWaC5rYz4ZC2+z7QkeKXCHWAN3i4C++u
2872 dfZoD7qWnyAldYTydADwL885dVY7WN6NX9YtQrG3JGrp3wZvFrX5x9Jv7hls0A6l
2873 2xI4NlcSSrgWIjzrGdwQEjIUDyfc7DWroEpJEfIaSnjkeTT0D8WV5NqzWH8UwWoF
2874 wjwDltaQ3Y8O/wJPGBqBAJEob+p6QxvP5T2W1jnOvbgsMZLNDuY6FF1XcuR7yvNF
2875 sXKP6aXMV8BKSlrehFlpBMTu4HvJ1rZlKuxgR1A9njiaKD2U0NitCKMIpIXQxT6L
2876 eZn9M8Ky68m0Zjdw/WCsKz22GTljSM5Nfme32BrW+4G+R55ECwZ1oh08nrnWjXmw
2877 PlSHj2lwpnsuOG2fwJkyMnIIoIUII31VLATeLERD9HfMK8/+uZqJ2PftT2fhHL/u
2878 CDCIdEWSUBBHpA7p8BbgiZKCpYzf+pbS2/EJGL8gQAvSH1atGv/o0BiAd10MzTXC
2879 Xn5xDB1Yh+FtYPYloBGAwmxKieDMnsjy6wp5ovdmOc2y6KBr27DzgEGchLyOxHV4
2880 Q7u0Hkm7Om33ir1TUgK6bdPFL8rGNDOZq/SR4yn4qSsQTPD6Y/HQSK5GzkU4dGLw
2881 tU6GNpu142QE36NfWkoUWHKf1YgIYrlAGJWlj93et54ZGUZGVN7pAspZ+mvoMnDU
2882 Jh46nrQsEJiQz8AqgREck4Fi4S7Rmjh/AhXmzFWFca3YD0BmuYU6fxGTRPZ70eys
2883 LV5qPTmTGpX+bpvufAp0vznkiOdqTn1flnxdslM2AukiD6OwkX1dBH8AvzObhbz0
2884 ABhx3c+cAhAnYhJmsYaAwbpWpp8CM5opmsRgwgaz8f8lxiRfXbrWD8vdd4dm2B9J
2885 jaiGCR8/UXHFBGZhCgLB2S+BNXKynIeP+POGQtMIIERUtwOIKt1KfZ9jZwf/ulJK
2886 fv/VmBPmGu+CHvFIlHAzlxwJeUz8wSltUeeHjADZ9Wag5ESN3R6hsmJL+KL4av5v
2887 DFobNPiNWbc+4H+3wg1R0oK/uTQb8u1S7uWIGVmi5fJ4rVVZ/VKKtHGVwm/8OGKF
2888 tcrJFJcJADFVkgpsqN8UINsMJLxfJRoBgABEWih5DTRwNXK76Ma2LjDBrEvxhw8M
2889 7SLKhi5vH7/Cs7jfLZFgh2T6flDV4VM/EA7CYEHgEb8MFmioFGOmhUpqifkA3SdX
2890 jGi2KuZZ5+O+sHFWXsUjiFPEzUJF+syPEzH1aF5R+F8pkhifeYh0KP6OHd6Sgn8s
2891 TStXB+q0MndBXw5ADp/Jac1DVaSWruVAdjemQ+si1olk8xH+uTMXU7PgV9WkpIiy
2892 4BhnFU9IbCr/m7806c13xfeelaffP2pr7EDdgwz5K89VWCa3k9OSDnMtj2CQXlC7
2893 bQHi/oRGA1aHSn84SIt+HpAfRoVdr4N90bYWmYQNqfKoyWCbEr+dge/GSD1nddAJ
2894 72mXGlqyLyWYuAAAAAA="""
2895
2896 TEST_1654_SH1 = """\
2897 VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA45R4Y4kuV458rSTGDVTqdzz
2898 9Fig3NQ3LermyD+0XLeqbC7KNgvv6cNzMZ9psQQ3FseYsIR1AAAAAAAAB8YAAAAA
2899 AAAJmgAAAAFPNgDkd/Y9Z+cuKctZk9gjwF8thT+fkmNCsulILsJw5StGHAA1f7uL
2900 MG73c5WBcesHB2epwazfbD3/0UZTlxXWXotywVHhjiS5XjnytJMYNVOp3PP0WKDc
2901 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2902 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2903 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2904 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2905 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
2906 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABCDwr
2907 uIlhFlv21pDqyMeA9X1wHp98a1CKY4qfC7gn5exyODAcnhZKHCV18XBerbZLAgIA
2908 AAAAAAAAJgAAAAAAAAAmAAABjwAAAo8AAALTAAAC8wAAAAAAAAMGAAAAAAAAB8Yw
2909 ggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQCXKMor062nfxHVutMbqNcj
2910 vVC92wXTcQulenNWEX+0huK54igTAG60p0lZ6FpBJ9A+dlStT386bn5I6qe50ky5
2911 CFodQSsQX+1yByMFlzqPDo4rclk/6oVySLypxnt/iBs3FPZ4zruhYXcITc6zaYYU
2912 Xqaw/C86g6M06MWQKsGev7PS3tH7q+dtovWzDgU13Q8PG2whGvGNfxPOmEX4j0wL
2913 FCBavpFnLpo3bJrj27V33HXxpPz3NP+fkaG0pKH03ANd/yYHfGf74dC+eD5dvWBM
2914 DU6fZQN4k/T+cth+qzjS52FPPTY9IHXIb4y+1HryVvxcx6JDifKoOzpFc3SDbBAP
2915 AgERKDjOFxVClH81DF/QkqpP0glOh6uTsFNx8Nes02q0d7iip2WqfG9m2+LmiWy8
2916 Pg7RlQQy2M45gert1EDsH4OI69uxteviZP1Mo0wD6HjmWUbGIQRmsT3DmYEZCCMA
2917 /KjhNmlov2+OhVxIaHwE7aN840IfkGdJ/JssB6Z/Ym3+ou4+jAYKhifPQGrpBVjd
2918 73oH6w9StnoGYIrEEQw8LFc4jnAFYciKlPuo6E6E3zDseE7gwkcOpCtVVksZu6Ii
2919 GQgIV8vjFbNz9M//RMXOBTwKFDiG08IAPh7fv2uKzFis0TFrR7sQcMQ/kZZCLPPi
2920 ECIX95NRoFRlxK/1kZ1+FuuDQgABz9+5yd/pjkVybmvc7Jr70bOVpxvRoI2ZEgh/
2921 +QdxfcwAAm5iDnzPtsVdcbuNkKprfI8N4n+QmUOSMbAJ7M8r1cp40cTBnAw+rMKC
2922 98P4pURrotx116Kd0i3XmMZu81ew57H3Zb73r+syQCXZNOP0xhMDclIt0p2xw2Wn
2923 z6QccyXyobXPOFLO3ZBPnKaE58aaN7x3srQZYUKafet5ZMDX8fsQf2mbxnaeG5NF
2924 eO6wG++WBUo9leddnzKBnRcMGRAtJEjwfKMVPE8SmuTlL6kRc7n8wvY2ygClWlRm
2925 d7o95tZfoO+mexB/DLEpWLtlAiqh8yJ8cWaC5rYz4ZC2+z7QkeKXCHWAN3i4C++u
2926 dfZoD7qWnyAldYTydADwL885dVY7WN6NX9YtQrG3JGrp3wZvFrX5x9Jv7hls0A6l
2927 2xI4NlcSSrgWIjzrGdwQEjIUDyfc7DWroEpJEfIaSnjkeTT0D8WV5NqzWH8UwWoF
2928 wjwDltaQ3Y8O/wJPGBqBAJEob+p6QxvP5T2W1jnOvbgsMZLNDuY6FF1XcuR7yvNF
2929 sXKP6aXMV8BKSlrehFlpBMTu4HvJ1rZlKuxgR1A9njiaKD2U0NitCKMIpIXQxT6L
2930 eZn9M8Ky68m0Zjdw/WCsKz22GTljSM5Nfme32BrW+4G+R55ECwZ1oh08nrnWjXmw
2931 PlSHj2lwpnsuOG2fwJkyMnIIoIUII31VLATeLERD9HfMK8/+uZqJ2PftT2fhHL/u
2932 CDCIdEWSUBBHpA7p8BbgiZKCpYzf+pbS2/EJGL8gQAvSH1atGv/o0BiAd10MzTXC
2933 Xn5xDB1Yh+FtYPYloBGAwmxKieDMnsjy6wp5ovdmOc2y6KBr27DzgEGchLyOxHV4
2934 Q7u0Hkm7Om33ir1TUgK6bdPFL8rGNDOZq/SR4yn4qSsQTPD6Y/HQSK5GzkU4dGLw
2935 tU6GNpu142QE36NfWkoUWHKf1YgIYrlAGJWlj93et54ZGUZGVN7pAspZ+mvoMnDU
2936 Jh46nrQsEJiQz8AqgREck4Fi4S7Rmjh/AhXmzFWFca3YD0BmuYU6fxGTRPZ70eys
2937 LV5qPTmTGpX+bpvufAp0vznkiOdqTn1flnxdslM2AukiD6OwkX1dBH8AvzObhbz0
2938 ABhx3c+cAhAnYhJmsYaAwbpWpp8CM5opmsRgwgaz8f8lxiRfXbrWD8vdd4dm2B9J
2939 jaiGCR8/UXHFBGZhCgLB2S+BNXKynIeP+POGQtMIIERUtwOIKt1KfZ9jZwf/ulJK
2940 fv/VmBPmGu+CHvFIlHAzlxwJeUz8wSltUeeHjADZ9Wag5ESN3R6hsmJL+KL4av5v
2941 DFobNPiNWbc+4H+3wg1R0oK/uTQb8u1S7uWIGVmi5fJ4rVVZ/VKKtHGVwm/8OGKF
2942 tcrJFJcJADFVkgpsqN8UINsMJLxfJRoBgABEWih5DTRwNXK76Ma2LjDBrEvxhw8M
2943 7SLKhi5vH7/Cs7jfLZFgh2T6flDV4VM/EA7CYEHgEb8MFmioFGOmhUpqifkA3SdX
2944 jGi2KuZZ5+O+sHFWXsUjiFPEzUJF+syPEzH1aF5R+F8pkhifeYh0KP6OHd6Sgn8s
2945 TStXB+q0MndBXw5ADp/Jac1DVaSWruVAdjemQ+si1olk8xH+uTMXU7PgV9WkpIiy
2946 4BhnFU9IbCr/m7806c13xfeelaffP2pr7EDdgwz5K89VWCa3k9OSDnMtj2CQXlC7
2947 bQHi/oRGA1aHSn84SIt+HpAfRoVdr4N90bYWmYQNqfKoyWCbEr+dge/GSD1nddAJ
2948 72mXGlqyLyWYuAAAAAA="""
2949
2950
2951 class FileHandle(unittest.TestCase):
2952     def setUp(self):
2953         self.test_data = "Test Data" * 50000
2954         self.sio = StringIO(self.test_data)
2955         self.uploadable = MutableFileHandle(self.sio)
2956
2957
2958     def test_filehandle_read(self):
2959         self.basedir = "mutable/FileHandle/test_filehandle_read"
2960         chunk_size = 10
2961         for i in xrange(0, len(self.test_data), chunk_size):
2962             data = self.uploadable.read(chunk_size)
2963             data = "".join(data)
2964             start = i
2965             end = i + chunk_size
2966             self.failUnlessEqual(data, self.test_data[start:end])
2967
2968
2969     def test_filehandle_get_size(self):
2970         self.basedir = "mutable/FileHandle/test_filehandle_get_size"
2971         actual_size = len(self.test_data)
2972         size = self.uploadable.get_size()
2973         self.failUnlessEqual(size, actual_size)
2974
2975
2976     def test_filehandle_get_size_out_of_order(self):
2977         # We should be able to call get_size whenever we want without
2978         # disturbing the location of the seek pointer.
2979         chunk_size = 100
2980         data = self.uploadable.read(chunk_size)
2981         self.failUnlessEqual("".join(data), self.test_data[:chunk_size])
2982
2983         # Now get the size.
2984         size = self.uploadable.get_size()
2985         self.failUnlessEqual(size, len(self.test_data))
2986
2987         # Now get more data. We should be right where we left off.
2988         more_data = self.uploadable.read(chunk_size)
2989         start = chunk_size
2990         end = chunk_size * 2
2991         self.failUnlessEqual("".join(more_data), self.test_data[start:end])
2992
2993
2994     def test_filehandle_file(self):
2995         # Make sure that the MutableFileHandle works on a file as well
2996         # as a StringIO object, since in some cases it will be asked to
2997         # deal with files.
2998         self.basedir = self.mktemp()
2999         # necessary? What am I doing wrong here?
3000         os.mkdir(self.basedir)
3001         f_path = os.path.join(self.basedir, "test_file")
3002         f = open(f_path, "w")
3003         f.write(self.test_data)
3004         f.close()
3005         f = open(f_path, "r")
3006
3007         uploadable = MutableFileHandle(f)
3008
3009         data = uploadable.read(len(self.test_data))
3010         self.failUnlessEqual("".join(data), self.test_data)
3011         size = uploadable.get_size()
3012         self.failUnlessEqual(size, len(self.test_data))
3013
3014
3015     def test_close(self):
3016         # Make sure that the MutableFileHandle closes its handle when
3017         # told to do so.
3018         self.uploadable.close()
3019         self.failUnless(self.sio.closed)
3020
3021
3022 class DataHandle(unittest.TestCase):
3023     def setUp(self):
3024         self.test_data = "Test Data" * 50000
3025         self.uploadable = MutableData(self.test_data)
3026
3027
3028     def test_datahandle_read(self):
3029         chunk_size = 10
3030         for i in xrange(0, len(self.test_data), chunk_size):
3031             data = self.uploadable.read(chunk_size)
3032             data = "".join(data)
3033             start = i
3034             end = i + chunk_size
3035             self.failUnlessEqual(data, self.test_data[start:end])
3036
3037
3038     def test_datahandle_get_size(self):
3039         actual_size = len(self.test_data)
3040         size = self.uploadable.get_size()
3041         self.failUnlessEqual(size, actual_size)
3042
3043
3044     def test_datahandle_get_size_out_of_order(self):
3045         # We should be able to call get_size whenever we want without
3046         # disturbing the location of the seek pointer.
3047         chunk_size = 100
3048         data = self.uploadable.read(chunk_size)
3049         self.failUnlessEqual("".join(data), self.test_data[:chunk_size])
3050
3051         # Now get the size.
3052         size = self.uploadable.get_size()
3053         self.failUnlessEqual(size, len(self.test_data))
3054
3055         # Now get more data. We should be right where we left off.
3056         more_data = self.uploadable.read(chunk_size)
3057         start = chunk_size
3058         end = chunk_size * 2
3059         self.failUnlessEqual("".join(more_data), self.test_data[start:end])
3060
3061
3062 class Version(GridTestMixin, unittest.TestCase, testutil.ShouldFailMixin, \
3063               PublishMixin):
3064     def setUp(self):
3065         GridTestMixin.setUp(self)
3066         self.basedir = self.mktemp()
3067         self.set_up_grid()
3068         self.c = self.g.clients[0]
3069         self.nm = self.c.nodemaker
3070         self.data = "test data" * 100000 # about 900 KiB; MDMF
3071         self.small_data = "test data" * 10 # 90 B; SDMF
3072
3073
3074     def do_upload_mdmf(self):
3075         d = self.nm.create_mutable_file(MutableData(self.data),
3076                                         version=MDMF_VERSION)
3077         def _then(n):
3078             assert isinstance(n, MutableFileNode)
3079             assert n._protocol_version == MDMF_VERSION
3080             self.mdmf_node = n
3081             return n
3082         d.addCallback(_then)
3083         return d
3084
3085     def do_upload_sdmf(self, data=None):
3086         if data is None:
3087             data = self.small_data
3088         d = self.nm.create_mutable_file(MutableData(data))
3089         def _then(n):
3090             assert isinstance(n, MutableFileNode)
3091             assert n._protocol_version == SDMF_VERSION
3092             self.sdmf_node = n
3093             return n
3094         d.addCallback(_then)
3095         return d
3096
3097     def do_upload_empty_sdmf(self):
3098         d = self.nm.create_mutable_file(MutableData(""))
3099         def _then(n):
3100             assert isinstance(n, MutableFileNode)
3101             self.sdmf_zero_length_node = n
3102             assert n._protocol_version == SDMF_VERSION
3103             return n
3104         d.addCallback(_then)
3105         return d
3106
3107     def do_upload(self):
3108         d = self.do_upload_mdmf()
3109         d.addCallback(lambda ign: self.do_upload_sdmf())
3110         return d
3111
3112     def test_debug(self):
3113         d = self.do_upload_mdmf()
3114         def _debug(n):
3115             fso = debug.FindSharesOptions()
3116             storage_index = base32.b2a(n.get_storage_index())
3117             fso.si_s = storage_index
3118             fso.nodedirs = [os.path.dirname(abspath_expanduser_unicode(unicode(storedir)))
3119                             for (i,ss,storedir)
3120                             in self.iterate_servers()]
3121             fso.stdout = StringIO()
3122             fso.stderr = StringIO()
3123             debug.find_shares(fso)
3124             sharefiles = fso.stdout.getvalue().splitlines()
3125             expected = self.nm.default_encoding_parameters["n"]
3126             self.failUnlessEqual(len(sharefiles), expected)
3127
3128             do = debug.DumpOptions()
3129             do["filename"] = sharefiles[0]
3130             do.stdout = StringIO()
3131             debug.dump_share(do)
3132             output = do.stdout.getvalue()
3133             lines = set(output.splitlines())
3134             self.failUnless("Mutable slot found:" in lines, output)
3135             self.failUnless(" share_type: MDMF" in lines, output)
3136             self.failUnless(" num_extra_leases: 0" in lines, output)
3137             self.failUnless(" MDMF contents:" in lines, output)
3138             self.failUnless("  seqnum: 1" in lines, output)
3139             self.failUnless("  required_shares: 3" in lines, output)
3140             self.failUnless("  total_shares: 10" in lines, output)
3141             self.failUnless("  segsize: 131073" in lines, output)
3142             self.failUnless("  datalen: %d" % len(self.data) in lines, output)
3143             vcap = n.get_verify_cap().to_string()
3144             self.failUnless("  verify-cap: %s" % vcap in lines, output)
3145
3146             cso = debug.CatalogSharesOptions()
3147             cso.nodedirs = fso.nodedirs
3148             cso.stdout = StringIO()
3149             cso.stderr = StringIO()
3150             debug.catalog_shares(cso)
3151             shares = cso.stdout.getvalue().splitlines()
3152             oneshare = shares[0] # all shares should be MDMF
3153             self.failIf(oneshare.startswith("UNKNOWN"), oneshare)
3154             self.failUnless(oneshare.startswith("MDMF"), oneshare)
3155             fields = oneshare.split()
3156             self.failUnlessEqual(fields[0], "MDMF")
3157             self.failUnlessEqual(fields[1], storage_index)
3158             self.failUnlessEqual(fields[2], "3/10")
3159             self.failUnlessEqual(fields[3], "%d" % len(self.data))
3160             self.failUnless(fields[4].startswith("#1:"), fields[3])
3161             # the rest of fields[4] is the roothash, which depends upon
3162             # encryption salts and is not constant. fields[5] is the
3163             # remaining time on the longest lease, which is timing dependent.
3164             # The rest of the line is the quoted pathname to the share.
3165         d.addCallback(_debug)
3166         return d
3167
3168     def test_get_sequence_number(self):
3169         d = self.do_upload()
3170         d.addCallback(lambda ign: self.mdmf_node.get_best_readable_version())
3171         d.addCallback(lambda bv:
3172             self.failUnlessEqual(bv.get_sequence_number(), 1))
3173         d.addCallback(lambda ignored:
3174             self.sdmf_node.get_best_readable_version())
3175         d.addCallback(lambda bv:
3176             self.failUnlessEqual(bv.get_sequence_number(), 1))
3177         # Now update. The sequence number in both cases should be 1 in
3178         # both cases.
3179         def _do_update(ignored):
3180             new_data = MutableData("foo bar baz" * 100000)
3181             new_small_data = MutableData("foo bar baz" * 10)
3182             d1 = self.mdmf_node.overwrite(new_data)
3183             d2 = self.sdmf_node.overwrite(new_small_data)
3184             dl = gatherResults([d1, d2])
3185             return dl
3186         d.addCallback(_do_update)
3187         d.addCallback(lambda ignored:
3188             self.mdmf_node.get_best_readable_version())
3189         d.addCallback(lambda bv:
3190             self.failUnlessEqual(bv.get_sequence_number(), 2))
3191         d.addCallback(lambda ignored:
3192             self.sdmf_node.get_best_readable_version())
3193         d.addCallback(lambda bv:
3194             self.failUnlessEqual(bv.get_sequence_number(), 2))
3195         return d
3196
3197
3198     def test_cap_after_upload(self):
3199         # If we create a new mutable file and upload things to it, and
3200         # it's an MDMF file, we should get an MDMF cap back from that
3201         # file and should be able to use that.
3202         # That's essentially what MDMF node is, so just check that.
3203         d = self.do_upload_mdmf()
3204         def _then(ign):
3205             mdmf_uri = self.mdmf_node.get_uri()
3206             cap = uri.from_string(mdmf_uri)
3207             self.failUnless(isinstance(cap, uri.WriteableMDMFFileURI))
3208             readonly_mdmf_uri = self.mdmf_node.get_readonly_uri()
3209             cap = uri.from_string(readonly_mdmf_uri)
3210             self.failUnless(isinstance(cap, uri.ReadonlyMDMFFileURI))
3211         d.addCallback(_then)
3212         return d
3213
3214     def test_mutable_version(self):
3215         # assert that getting parameters from the IMutableVersion object
3216         # gives us the same data as getting them from the filenode itself
3217         d = self.do_upload()
3218         d.addCallback(lambda ign: self.mdmf_node.get_best_mutable_version())
3219         def _check_mdmf(bv):
3220             n = self.mdmf_node
3221             self.failUnlessEqual(bv.get_writekey(), n.get_writekey())
3222             self.failUnlessEqual(bv.get_storage_index(), n.get_storage_index())
3223             self.failIf(bv.is_readonly())
3224         d.addCallback(_check_mdmf)
3225         d.addCallback(lambda ign: self.sdmf_node.get_best_mutable_version())
3226         def _check_sdmf(bv):
3227             n = self.sdmf_node
3228             self.failUnlessEqual(bv.get_writekey(), n.get_writekey())
3229             self.failUnlessEqual(bv.get_storage_index(), n.get_storage_index())
3230             self.failIf(bv.is_readonly())
3231         d.addCallback(_check_sdmf)
3232         return d
3233
3234
3235     def test_get_readonly_version(self):
3236         d = self.do_upload()
3237         d.addCallback(lambda ign: self.mdmf_node.get_best_readable_version())
3238         d.addCallback(lambda bv: self.failUnless(bv.is_readonly()))
3239
3240         # Attempting to get a mutable version of a mutable file from a
3241         # filenode initialized with a readcap should return a readonly
3242         # version of that same node.
3243         d.addCallback(lambda ign: self.mdmf_node.get_readonly())
3244         d.addCallback(lambda ro: ro.get_best_mutable_version())
3245         d.addCallback(lambda v: self.failUnless(v.is_readonly()))
3246
3247         d.addCallback(lambda ign: self.sdmf_node.get_best_readable_version())
3248         d.addCallback(lambda bv: self.failUnless(bv.is_readonly()))
3249
3250         d.addCallback(lambda ign: self.sdmf_node.get_readonly())
3251         d.addCallback(lambda ro: ro.get_best_mutable_version())
3252         d.addCallback(lambda v: self.failUnless(v.is_readonly()))
3253         return d
3254
3255
3256     def test_toplevel_overwrite(self):
3257         new_data = MutableData("foo bar baz" * 100000)
3258         new_small_data = MutableData("foo bar baz" * 10)
3259         d = self.do_upload()
3260         d.addCallback(lambda ign: self.mdmf_node.overwrite(new_data))
3261         d.addCallback(lambda ignored:
3262             self.mdmf_node.download_best_version())
3263         d.addCallback(lambda data:
3264             self.failUnlessEqual(data, "foo bar baz" * 100000))
3265         d.addCallback(lambda ignored:
3266             self.sdmf_node.overwrite(new_small_data))
3267         d.addCallback(lambda ignored:
3268             self.sdmf_node.download_best_version())
3269         d.addCallback(lambda data:
3270             self.failUnlessEqual(data, "foo bar baz" * 10))
3271         return d
3272
3273
3274     def test_toplevel_modify(self):
3275         d = self.do_upload()
3276         def modifier(old_contents, servermap, first_time):
3277             return old_contents + "modified"
3278         d.addCallback(lambda ign: self.mdmf_node.modify(modifier))
3279         d.addCallback(lambda ignored:
3280             self.mdmf_node.download_best_version())
3281         d.addCallback(lambda data:
3282             self.failUnlessIn("modified", data))
3283         d.addCallback(lambda ignored:
3284             self.sdmf_node.modify(modifier))
3285         d.addCallback(lambda ignored:
3286             self.sdmf_node.download_best_version())
3287         d.addCallback(lambda data:
3288             self.failUnlessIn("modified", data))
3289         return d
3290
3291
3292     def test_version_modify(self):
3293         # TODO: When we can publish multiple versions, alter this test
3294         # to modify a version other than the best usable version, then
3295         # test to see that the best recoverable version is that.
3296         d = self.do_upload()
3297         def modifier(old_contents, servermap, first_time):
3298             return old_contents + "modified"
3299         d.addCallback(lambda ign: self.mdmf_node.modify(modifier))
3300         d.addCallback(lambda ignored:
3301             self.mdmf_node.download_best_version())
3302         d.addCallback(lambda data:
3303             self.failUnlessIn("modified", data))
3304         d.addCallback(lambda ignored:
3305             self.sdmf_node.modify(modifier))
3306         d.addCallback(lambda ignored:
3307             self.sdmf_node.download_best_version())
3308         d.addCallback(lambda data:
3309             self.failUnlessIn("modified", data))
3310         return d
3311
3312
3313     def test_download_version(self):
3314         d = self.publish_multiple()
3315         # We want to have two recoverable versions on the grid.
3316         d.addCallback(lambda res:
3317                       self._set_versions({0:0,2:0,4:0,6:0,8:0,
3318                                           1:1,3:1,5:1,7:1,9:1}))
3319         # Now try to download each version. We should get the plaintext
3320         # associated with that version.
3321         d.addCallback(lambda ignored:
3322             self._fn.get_servermap(mode=MODE_READ))
3323         def _got_servermap(smap):
3324             versions = smap.recoverable_versions()
3325             assert len(versions) == 2
3326
3327             self.servermap = smap
3328             self.version1, self.version2 = versions
3329             assert self.version1 != self.version2
3330
3331             self.version1_seqnum = self.version1[0]
3332             self.version2_seqnum = self.version2[0]
3333             self.version1_index = self.version1_seqnum - 1
3334             self.version2_index = self.version2_seqnum - 1
3335
3336         d.addCallback(_got_servermap)
3337         d.addCallback(lambda ignored:
3338             self._fn.download_version(self.servermap, self.version1))
3339         d.addCallback(lambda results:
3340             self.failUnlessEqual(self.CONTENTS[self.version1_index],
3341                                  results))
3342         d.addCallback(lambda ignored:
3343             self._fn.download_version(self.servermap, self.version2))
3344         d.addCallback(lambda results:
3345             self.failUnlessEqual(self.CONTENTS[self.version2_index],
3346                                  results))
3347         return d
3348
3349
3350     def test_download_nonexistent_version(self):
3351         d = self.do_upload_mdmf()
3352         d.addCallback(lambda ign: self.mdmf_node.get_servermap(mode=MODE_WRITE))
3353         def _set_servermap(servermap):
3354             self.servermap = servermap
3355         d.addCallback(_set_servermap)
3356         d.addCallback(lambda ignored:
3357            self.shouldFail(UnrecoverableFileError, "nonexistent version",
3358                            None,
3359                            self.mdmf_node.download_version, self.servermap,
3360                            "not a version"))
3361         return d
3362
3363
3364     def _test_partial_read(self, node, expected, modes, step):
3365         d = node.get_best_readable_version()
3366         for (name, offset, length) in modes:
3367             d.addCallback(self._do_partial_read, name, expected, offset, length)
3368         # then read only a few bytes at a time, and see that the results are
3369         # what we expect.
3370         def _read_data(version):
3371             c = consumer.MemoryConsumer()
3372             d2 = defer.succeed(None)
3373             for i in xrange(0, len(expected), step):
3374                 d2.addCallback(lambda ignored, i=i: version.read(c, i, step))
3375             d2.addCallback(lambda ignored:
3376                 self.failUnlessEqual(expected, "".join(c.chunks)))
3377             return d2
3378         d.addCallback(_read_data)
3379         return d
3380
3381     def _do_partial_read(self, version, name, expected, offset, length):
3382         c = consumer.MemoryConsumer()
3383         d = version.read(c, offset, length)
3384         expected_range = expected[offset:offset+length]
3385         d.addCallback(lambda ignored: "".join(c.chunks))
3386         def _check(results):
3387             if results != expected_range:
3388                 print "got: %s ... %s" % (results[:20], results[-20:])
3389                 print "exp: %s ... %s" % (expected_range[:20], expected_range[-20:])
3390                 self.fail("results[%s] != expected_range" % name)
3391             return version # daisy-chained to next call
3392         d.addCallback(_check)
3393         return d
3394
3395     def test_partial_read_mdmf(self):
3396         segment_boundary = mathutil.next_multiple(128 * 1024, 3)
3397         modes = [("start_on_segment_boundary",              segment_boundary, 50),
3398                  ("ending_one_byte_after_segment_boundary", segment_boundary-50, 51),
3399                  ("zero_length_at_start",                   0, 0),
3400                  ("zero_length_in_middle",                  50, 0),
3401                  ("zero_length_at_segment_boundary",        segment_boundary, 0),
3402                  ("complete_file",                          0, len(self.data)),
3403                  ("complete_file_past_end",                 0, len(self.data)+1),
3404                  ]
3405         d = self.do_upload_mdmf()
3406         d.addCallback(self._test_partial_read, self.data, modes, 10000)
3407         return d
3408
3409     def test_partial_read_sdmf_90(self):
3410         modes = [("start_at_middle",           50, 40),
3411                  ("zero_length_at_start",      0, 0),
3412                  ("zero_length_in_middle",     50, 0),
3413                  ("complete_file",             0, 90),
3414                  ]
3415         d = self.do_upload_sdmf()
3416         d.addCallback(self._test_partial_read, self.small_data, modes, 10)
3417         return d
3418
3419     def test_partial_read_sdmf_100(self):
3420         data = "test data "*10
3421         modes = [("start_at_middle",           50, 50),
3422                  ("zero_length_at_start",      0, 0),
3423                  ("zero_length_in_middle",     50, 0),
3424                  ("complete_file",             0, 100),
3425                  ]
3426         d = self.do_upload_sdmf(data=data)
3427         d.addCallback(self._test_partial_read, data, modes, 10)
3428         return d
3429
3430     def test_partial_read_sdmf_2(self):
3431         data = "hi"
3432         modes = [("one_byte",                  0, 1),
3433                  ("last_byte",                 1, 1),
3434                  ("complete_file",             0, 2),
3435                  ]
3436         d = self.do_upload_sdmf(data=data)
3437         d.addCallback(self._test_partial_read, data, modes, 1)
3438         return d
3439
3440
3441     def _test_read_and_download(self, node, expected):
3442         d = node.get_best_readable_version()
3443         def _read_data(version):
3444             c = consumer.MemoryConsumer()
3445             d2 = defer.succeed(None)
3446             d2.addCallback(lambda ignored: version.read(c))
3447             d2.addCallback(lambda ignored:
3448                 self.failUnlessEqual(expected, "".join(c.chunks)))
3449             return d2
3450         d.addCallback(_read_data)
3451         d.addCallback(lambda ignored: node.download_best_version())
3452         d.addCallback(lambda data: self.failUnlessEqual(expected, data))
3453         return d
3454
3455     def test_read_and_download_mdmf(self):
3456         d = self.do_upload_mdmf()
3457         d.addCallback(self._test_read_and_download, self.data)
3458         return d
3459
3460     def test_read_and_download_sdmf(self):
3461         d = self.do_upload_sdmf()
3462         d.addCallback(self._test_read_and_download, self.small_data)
3463         return d
3464
3465     def test_read_and_download_sdmf_zero_length(self):
3466         d = self.do_upload_empty_sdmf()
3467         d.addCallback(self._test_read_and_download, "")
3468         return d
3469
3470
3471 class Update(GridTestMixin, unittest.TestCase, testutil.ShouldFailMixin):
3472     timeout = 400 # these tests are too big, 120s is not enough on slow
3473                   # platforms
3474     def setUp(self):
3475         GridTestMixin.setUp(self)
3476         self.basedir = self.mktemp()
3477         self.set_up_grid(num_servers=13)
3478         self.c = self.g.clients[0]
3479         self.nm = self.c.nodemaker
3480         self.data = "testdata " * 100000 # about 900 KiB; MDMF
3481         self.small_data = "test data" * 10 # 90 B; SDMF
3482
3483
3484     def do_upload_sdmf(self):
3485         d = self.nm.create_mutable_file(MutableData(self.small_data))
3486         def _then(n):
3487             assert isinstance(n, MutableFileNode)
3488             self.sdmf_node = n
3489             # Make SDMF node that has 255 shares.
3490             self.nm.default_encoding_parameters['n'] = 255
3491             self.nm.default_encoding_parameters['k'] = 127
3492             return self.nm.create_mutable_file(MutableData(self.small_data))
3493         d.addCallback(_then)
3494         def _then2(n):
3495             assert isinstance(n, MutableFileNode)
3496             self.sdmf_max_shares_node = n
3497         d.addCallback(_then2)
3498         return d
3499
3500     def do_upload_mdmf(self):
3501         d = self.nm.create_mutable_file(MutableData(self.data),
3502                                         version=MDMF_VERSION)
3503         def _then(n):
3504             assert isinstance(n, MutableFileNode)
3505             self.mdmf_node = n
3506             # Make MDMF node that has 255 shares.
3507             self.nm.default_encoding_parameters['n'] = 255
3508             self.nm.default_encoding_parameters['k'] = 127
3509             return self.nm.create_mutable_file(MutableData(self.data),
3510                                                version=MDMF_VERSION)
3511         d.addCallback(_then)
3512         def _then2(n):
3513             assert isinstance(n, MutableFileNode)
3514             self.mdmf_max_shares_node = n
3515         d.addCallback(_then2)
3516         return d
3517
3518     def _test_replace(self, offset, new_data):
3519         expected = self.data[:offset]+new_data+self.data[offset+len(new_data):]
3520         d0 = self.do_upload_mdmf()
3521         def _run(ign):
3522             d = defer.succeed(None)
3523             for node in (self.mdmf_node, self.mdmf_max_shares_node):
3524                 # close over 'node'.
3525                 d.addCallback(lambda ign, node=node:
3526                               node.get_best_mutable_version())
3527                 d.addCallback(lambda mv:
3528                               mv.update(MutableData(new_data), offset))
3529                 d.addCallback(lambda ign, node=node:
3530                               node.download_best_version())
3531                 def _check(results):
3532                     if results != expected:
3533                         print
3534                         print "got: %s ... %s" % (results[:20], results[-20:])
3535                         print "exp: %s ... %s" % (expected[:20], expected[-20:])
3536                         self.fail("results != expected")
3537                 d.addCallback(_check)
3538             return d
3539         d0.addCallback(_run)
3540         return d0
3541
3542     def test_append(self):
3543         # We should be able to append data to a mutable file and get
3544         # what we expect.
3545         return self._test_replace(len(self.data), "appended")
3546
3547     def test_replace_middle(self):
3548         # We should be able to replace data in the middle of a mutable
3549         # file and get what we expect back.
3550         return self._test_replace(100, "replaced")
3551
3552     def test_replace_beginning(self):
3553         # We should be able to replace data at the beginning of the file
3554         # without truncating the file
3555         return self._test_replace(0, "beginning")
3556
3557     def test_replace_segstart1(self):
3558         return self._test_replace(128*1024+1, "NNNN")
3559
3560     def test_replace_zero_length_beginning(self):
3561         return self._test_replace(0, "")
3562
3563     def test_replace_zero_length_middle(self):
3564         return self._test_replace(50, "")
3565
3566     def test_replace_zero_length_segstart1(self):
3567         return self._test_replace(128*1024+1, "")
3568
3569     def test_replace_and_extend(self):
3570         # We should be able to replace data in the middle of a mutable
3571         # file and extend that mutable file and get what we expect.
3572         return self._test_replace(100, "modified " * 100000)
3573
3574
3575     def _check_differences(self, got, expected):
3576         # displaying arbitrary file corruption is tricky for a
3577         # 1MB file of repeating data,, so look for likely places
3578         # with problems and display them separately
3579         gotmods = [mo.span() for mo in re.finditer('([A-Z]+)', got)]
3580         expmods = [mo.span() for mo in re.finditer('([A-Z]+)', expected)]
3581         gotspans = ["%d:%d=%s" % (start,end,got[start:end])
3582                     for (start,end) in gotmods]
3583         expspans = ["%d:%d=%s" % (start,end,expected[start:end])
3584                     for (start,end) in expmods]
3585         #print "expecting: %s" % expspans
3586
3587         SEGSIZE = 128*1024
3588         if got != expected:
3589             print "differences:"
3590             for segnum in range(len(expected)//SEGSIZE):
3591                 start = segnum * SEGSIZE
3592                 end = (segnum+1) * SEGSIZE
3593                 got_ends = "%s .. %s" % (got[start:start+20], got[end-20:end])
3594                 exp_ends = "%s .. %s" % (expected[start:start+20], expected[end-20:end])
3595                 if got_ends != exp_ends:
3596                     print "expected[%d]: %s" % (start, exp_ends)
3597                     print "got     [%d]: %s" % (start, got_ends)
3598             if expspans != gotspans:
3599                 print "expected: %s" % expspans
3600                 print "got     : %s" % gotspans
3601             open("EXPECTED","wb").write(expected)
3602             open("GOT","wb").write(got)
3603             print "wrote data to EXPECTED and GOT"
3604             self.fail("didn't get expected data")
3605
3606
3607     def test_replace_locations(self):
3608         # exercise fencepost conditions
3609         SEGSIZE = 128*1024
3610         suspects = range(SEGSIZE-3, SEGSIZE+1)+range(2*SEGSIZE-3, 2*SEGSIZE+1)
3611         letters = iter("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
3612         d0 = self.do_upload_mdmf()
3613         def _run(ign):
3614             expected = self.data
3615             d = defer.succeed(None)
3616             for offset in suspects:
3617                 new_data = letters.next()*2 # "AA", then "BB", etc
3618                 expected = expected[:offset]+new_data+expected[offset+2:]
3619                 d.addCallback(lambda ign:
3620                               self.mdmf_node.get_best_mutable_version())
3621                 def _modify(mv, offset=offset, new_data=new_data):
3622                     # close over 'offset','new_data'
3623                     md = MutableData(new_data)
3624                     return mv.update(md, offset)
3625                 d.addCallback(_modify)
3626                 d.addCallback(lambda ignored:
3627                               self.mdmf_node.download_best_version())
3628                 d.addCallback(self._check_differences, expected)
3629             return d
3630         d0.addCallback(_run)
3631         return d0
3632
3633     def test_replace_locations_max_shares(self):
3634         # exercise fencepost conditions
3635         SEGSIZE = 128*1024
3636         suspects = range(SEGSIZE-3, SEGSIZE+1)+range(2*SEGSIZE-3, 2*SEGSIZE+1)
3637         letters = iter("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
3638         d0 = self.do_upload_mdmf()
3639         def _run(ign):
3640             expected = self.data
3641             d = defer.succeed(None)
3642             for offset in suspects:
3643                 new_data = letters.next()*2 # "AA", then "BB", etc
3644                 expected = expected[:offset]+new_data+expected[offset+2:]
3645                 d.addCallback(lambda ign:
3646                               self.mdmf_max_shares_node.get_best_mutable_version())
3647                 def _modify(mv, offset=offset, new_data=new_data):
3648                     # close over 'offset','new_data'
3649                     md = MutableData(new_data)
3650                     return mv.update(md, offset)
3651                 d.addCallback(_modify)
3652                 d.addCallback(lambda ignored:
3653                               self.mdmf_max_shares_node.download_best_version())
3654                 d.addCallback(self._check_differences, expected)
3655             return d
3656         d0.addCallback(_run)
3657         return d0
3658
3659
3660     def test_append_power_of_two(self):
3661         # If we attempt to extend a mutable file so that its segment
3662         # count crosses a power-of-two boundary, the update operation
3663         # should know how to reencode the file.
3664
3665         # Note that the data populating self.mdmf_node is about 900 KiB
3666         # long -- this is 7 segments in the default segment size. So we
3667         # need to add 2 segments worth of data to push it over a
3668         # power-of-two boundary.
3669         segment = "a" * DEFAULT_MAX_SEGMENT_SIZE
3670         new_data = self.data + (segment * 2)
3671         d0 = self.do_upload_mdmf()
3672         def _run(ign):
3673             d = defer.succeed(None)
3674             for node in (self.mdmf_node, self.mdmf_max_shares_node):
3675                 # close over 'node'.
3676                 d.addCallback(lambda ign, node=node:
3677                               node.get_best_mutable_version())
3678                 d.addCallback(lambda mv:
3679                               mv.update(MutableData(segment * 2), len(self.data)))
3680                 d.addCallback(lambda ign, node=node:
3681                               node.download_best_version())
3682                 d.addCallback(lambda results:
3683                               self.failUnlessEqual(results, new_data))
3684             return d
3685         d0.addCallback(_run)
3686         return d0
3687
3688     def test_update_sdmf(self):
3689         # Running update on a single-segment file should still work.
3690         new_data = self.small_data + "appended"
3691         d0 = self.do_upload_sdmf()
3692         def _run(ign):
3693             d = defer.succeed(None)
3694             for node in (self.sdmf_node, self.sdmf_max_shares_node):
3695                 # close over 'node'.
3696                 d.addCallback(lambda ign, node=node:
3697                               node.get_best_mutable_version())
3698                 d.addCallback(lambda mv:
3699                               mv.update(MutableData("appended"), len(self.small_data)))
3700                 d.addCallback(lambda ign, node=node:
3701                               node.download_best_version())
3702                 d.addCallback(lambda results:
3703                               self.failUnlessEqual(results, new_data))
3704             return d
3705         d0.addCallback(_run)
3706         return d0
3707
3708     def test_replace_in_last_segment(self):
3709         # The wrapper should know how to handle the tail segment
3710         # appropriately.
3711         replace_offset = len(self.data) - 100
3712         new_data = self.data[:replace_offset] + "replaced"
3713         rest_offset = replace_offset + len("replaced")
3714         new_data += self.data[rest_offset:]
3715         d0 = self.do_upload_mdmf()
3716         def _run(ign):
3717             d = defer.succeed(None)
3718             for node in (self.mdmf_node, self.mdmf_max_shares_node):
3719                 # close over 'node'.
3720                 d.addCallback(lambda ign, node=node:
3721                               node.get_best_mutable_version())
3722                 d.addCallback(lambda mv:
3723                               mv.update(MutableData("replaced"), replace_offset))
3724                 d.addCallback(lambda ign, node=node:
3725                               node.download_best_version())
3726                 d.addCallback(lambda results:
3727                               self.failUnlessEqual(results, new_data))
3728             return d
3729         d0.addCallback(_run)
3730         return d0
3731
3732     def test_multiple_segment_replace(self):
3733         replace_offset = 2 * DEFAULT_MAX_SEGMENT_SIZE
3734         new_data = self.data[:replace_offset]
3735         new_segment = "a" * DEFAULT_MAX_SEGMENT_SIZE
3736         new_data += 2 * new_segment
3737         new_data += "replaced"
3738         rest_offset = len(new_data)
3739         new_data += self.data[rest_offset:]
3740         d0 = self.do_upload_mdmf()
3741         def _run(ign):
3742             d = defer.succeed(None)
3743             for node in (self.mdmf_node, self.mdmf_max_shares_node):
3744                 # close over 'node'.
3745                 d.addCallback(lambda ign, node=node:
3746                               node.get_best_mutable_version())
3747                 d.addCallback(lambda mv:
3748                               mv.update(MutableData((2 * new_segment) + "replaced"),
3749                                         replace_offset))
3750                 d.addCallback(lambda ignored, node=node:
3751                               node.download_best_version())
3752                 d.addCallback(lambda results:
3753                               self.failUnlessEqual(results, new_data))
3754             return d
3755         d0.addCallback(_run)
3756         return d0
3757
3758 class Interoperability(GridTestMixin, unittest.TestCase, testutil.ShouldFailMixin):
3759     sdmf_old_shares = {}
3760     sdmf_old_shares[0] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcABOOLy8EETxh7h7/z9d62EiPu9CNpRrCOLxUhn+JUS+DuAAhgcAb/adrQFrhlrRNoRpvjDuxmFebA4F0qCyqWssm61AAQ/EX4eC/1+hGOQ/h4EiKUkqxdsfzdcPlDvd11SGWZ0VHsUclZChTzuBAU2zLTXm+cG8IFhO50ly6Ey/DB44NtMKVaVzO0nU8DE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3761     sdmf_old_shares[1] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcABOOLy8EETxh7h7/z9d62EiPu9CNpRrCOLxUhn+JUS+DuAAhgcAb/adrQFrhlrRNoRpvjDuxmFebA4F0qCyqWssm61AAP7FHJWQoU87gQFNsy015vnBvCBYTudJcuhMvwweODbTD8Rfh4L/X6EY5D+HgSIpSSrF2x/N1w+UO93XVIZZnRUeePDXEwhqYDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3762     sdmf_old_shares[2] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcABOOLy8EETxh7h7/z9d62EiPu9CNpRrCOLxUhn+JUS+DuAAd8jdiCodW233N1acXhZGnulDKR3hiNsMdEIsijRPemewASoSCFpVj4utEE+eVFM146xfgC6DX39GaQ2zT3YKsWX3GiLwKtGffwqV7IlZIcBEVqMfTXSTZsY+dZm1MxxCZH0Zd33VY0yggDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3763     sdmf_old_shares[3] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcABOOLy8EETxh7h7/z9d62EiPu9CNpRrCOLxUhn+JUS+DuAAd8jdiCodW233N1acXhZGnulDKR3hiNsMdEIsijRPemewARoi8CrRn38KleyJWSHARFajH010k2bGPnWZtTMcQmR9GhIIWlWPi60QT55UUzXjrF+ALoNff0ZpDbNPdgqxZfcSNSplrHqtsDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3764     sdmf_old_shares[4] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcAA6dlE140Fc7FgB77PeM5Phv+bypQEYtyfLQHxd+OxlG3AAoIM8M4XulprmLd4gGMobS2Bv9CmwB5LpK/ySHE1QWjdwAUMA7/aVz7Mb1em0eks+biC8ZuVUhuAEkTVOAF4YulIjE8JlfW0dS1XKk62u0586QxiN38NTsluUDx8EAPTL66yRsfb1f3rRIDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3765     sdmf_old_shares[5] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcAA6dlE140Fc7FgB77PeM5Phv+bypQEYtyfLQHxd+OxlG3AAoIM8M4XulprmLd4gGMobS2Bv9CmwB5LpK/ySHE1QWjdwATPCZX1tHUtVypOtrtOfOkMYjd/DU7JblA8fBAD0y+uskwDv9pXPsxvV6bR6Sz5uILxm5VSG4ASRNU4AXhi6UiMUKZHBmcmEgDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3766     sdmf_old_shares[6] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcAA6dlE140Fc7FgB77PeM5Phv+bypQEYtyfLQHxd+OxlG3AAlyHZU7RfTJjbHu1gjabWZsTu+7nAeRVG6/ZSd4iMQ1ZgAWDSFSPvKzcFzRcuRlVgKUf0HBce1MCF8SwpUbPPEyfVJty4xLZ7DvNU/Eh/R6BarsVAagVXdp+GtEu0+fok7nilT4LchmHo8DE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3767     sdmf_old_shares[7] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgACtTh7+7gs/l5w1lOkgbF6w7rkXLNslK7L2KYF4SPFLUcAA6dlE140Fc7FgB77PeM5Phv+bypQEYtyfLQHxd+OxlG3AAlyHZU7RfTJjbHu1gjabWZsTu+7nAeRVG6/ZSd4iMQ1ZgAVbcuMS2ew7zVPxIf0egWq7FQGoFV3afhrRLtPn6JO54oNIVI+8rNwXNFy5GVWApR/QcFx7UwIXxLClRs88TJ9UtLnNF4/mM0DE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3768     sdmf_old_shares[8] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgABUSzNKiMx0E91q51/WH6ASL0fDEOLef9oxuyBX5F5cpoABojmWkDX3k3FKfgNHIeptE3lxB8HHzxDfSD250psyfNCAAwGsKbMxbmI2NpdTozZ3SICrySwgGkatA1gsDOJmOnTzgAYmqKY7A9vQChuYa17fYSyKerIb3682jxiIneQvCMWCK5WcuI4PMeIsUAj8yxdxHvV+a9vtSCEsDVvymrrooDKX1GK98t37yoDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3769     sdmf_old_shares[9] = "VGFob2UgbXV0YWJsZSBjb250YWluZXIgdjEKdQlEA47ESLbTdKdpLJXCpBxd5OH239tl5hvAiz1dvGdE5rIOpf8cbfxbPcwNF+Y5dM92uBVbmV6KAAAAAAAAB/wAAAAAAAAJ0AAAAAFOWSw7jSx7WXzaMpdleJYXwYsRCV82jNA5oex9m2YhXSnb2POh+vvC1LE1NAfRc9GOb2zQG84Xdsx1Jub2brEeKkyt0sRIttN0p2kslcKkHF3k4fbf22XmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABamJprL6ecrsOoFKdrXUmWveLq8nzEGDOjFnyK9detI3noX3uyK2MwSnFdAfyN0tuAwoAAAAAAAAAFQAAAAAAAAAVAAABjwAAAo8AAAMXAAADNwAAAAAAAAM+AAAAAAAAB/wwggEgMA0GCSqGSIb3DQEBAQUAA4IBDQAwggEIAoIBAQC1IkainlJF12IBXBQdpRK1zXB7a26vuEYqRmQM09YjC6sQjCs0F2ICk8n9m/2Kw4l16eIEboB2Au9pODCE+u/dEAakEFh4qidTMn61rbGUbsLK8xzuWNW22ezzz9/nPia0HDrulXt51/FYtfnnAuD1RJGXJv/8tDllE9FL/18TzlH4WuB6Fp8FTgv7QdbZAfWJHDGFIpVCJr1XxOCsSZNFJIqGwZnD2lsChiWw5OJDbKd8otqN1hIbfHyMyfMOJ/BzRzvZXaUt4Dv5nf93EmQDWClxShRwpuX/NkZ5B2K9OFonFTbOCexm/MjMAdCBqebKKaiHFkiknUCn9eJQpZ5bAgERgV50VKj+AVTDfgTpqfO2vfo4wrufi6ZBb8QV7hllhUFBjYogQ9C96dnS7skv0s+cqFuUjwMILr5/rsbEmEMGvl0T0ytyAbtlXuowEFVj/YORNknM4yjY72YUtEPTlMpk0Cis7aIgTvu5qWMPER26PMApZuRqiwRsGIkaJIvOVOTHHjFYe3/YzdMkc7OZtqRMfQLtwVl2/zKQQV8b/a9vaT6q3mRLRd4P3esaAFe/+7sR/t+9tmB+a8kxtKM6kmaVQJMbXJZ4aoHGfeLX0m35Rcvu2Bmph7QfSDjk/eaE3q55zYSoGWShmlhlw4Kwg84sMuhmcVhLvo0LovR8bKmbdgABUSzNKiMx0E91q51/WH6ASL0fDEOLef9oxuyBX5F5cpoABojmWkDX3k3FKfgNHIeptE3lxB8HHzxDfSD250psyfNCAAwGsKbMxbmI2NpdTozZ3SICrySwgGkatA1gsDOJmOnTzgAXVnLiODzHiLFAI/MsXcR71fmvb7UghLA1b8pq66KAyl+aopjsD29AKG5hrXt9hLIp6shvfrzaPGIid5C8IxYIrjgBj1YohGgDE0Wua7Lx6Bnad5n91qmHAnwSEJE5YIhQM634omd6cq9Wk4seJCUIn+ucoknrpxp0IR9QMxpKSMRHRUg2K8ZegnY3YqFunRZKCfsq9ufQEKgjZN12AFqi551KPBdn4/3V5HK6xTv0P4robSsE/BvuIfByvRf/W7ZrDx+CFC4EEcsBOACOZCrkhhqd5TkYKbe9RA+vs56+9N5qZGurkxcoKviiyEncxvTuShD65DK/6x6kMDMgQv/EdZDI3x9GtHTnRBYXwDGnPJ19w+q2zC3e2XarbxTGYQIPEC5mYx0gAA0sbjf018NGfwBhl6SB54iGsa8uLvR3jHv6OSRJgwxL6j7P0Ts4Hv2EtO12P0Lv21pwi3JC1O/WviSrKCvrQD5lMHL9Uym3hwFi2zu0mqwZvxOAbGy7kfOPXkLYKOHTZLthzKj3PsdjeceWBfYIvPGKYcd6wDr36d1aXSYS4IWeApTS2AQ2lu0DUcgSefAvsA8NkgOklvJY1cjTMSg6j6cxQo48Bvl8RAWGLbr4h2S/8KwDGxwLsSv0Gop/gnFc3GzCsmL0EkEyHHWkCA8YRXCghfW80KLDV495ff7yF5oiwK56GniqowZ3RG9Jxp5MXoJQgsLV1VMQFMAmsY69yz8eoxRH3wl9L0dMyndLulhWWzNwPMQ2I0yAWdzA/pksVmwTJTFenB3MHCiWc5rEwJ3yofe6NZZnZQrYyL9r1TNnVwfTwRUiykPiLSk4x9Mi6DX7RamDAxc8u3gDVfjPsTOTagBOEGUWlGAL54KE/E6sgCQ5DEAt12chk8AxbjBFLPgV+/idrzS0lZHOL+IVBI9D0i3Bq1yZcSIqcjZB0M3IbxbPm4gLAYOWEiTUN2ecsEHHg9nt6rhgffVoqSbCCFPbpC0xf7WOC3+BQORIZECOCC7cUAciXq3xn+GuxpFE40RWRJeKAK7bBQ21X89ABIXlQFkFddZ9kRvlZ2Pnl0oeF+2pjnZu0Yc2czNfZEQF2P7BKIdLrgMgxG89snxAY8qAYTCKyQw6xTG87wkjDcpy1wzsZLP3WsOuO7cAm7b27xU0jRKq8Cw4d1hDoyRG+RdS53F8RFJzVMaNNYgxU2tfRwUvXpTRXiOheeRVvh25+YGVnjakUXjx/dSDnOw4ETHGHD+7styDkeSfc3BdSZxswzc6OehgMI+xsCxeeRym15QUm9hxvg8X7Bfz/0WulgFwgzrm11TVynZYOmvyHpiZKoqQyQyKahIrfhwuchCr7lMsZ4a+umIkNkKxCLZnI+T7jd+eGFMgKItjz3kTTxRl3IhaJG3LbPmwRUJynMxQKdMi4Uf0qy0U7+i8hIJ9m50QXc+3tw2bwDSbx22XYJ9Wf14gxx5G5SPTb1JVCbhe4fxNt91xIxCow2zk62tzbYfRe6dfmDmgYHkv2PIEtMJZK8iKLDjFfu2ZUxsKT2A5g1q17og6o9MeXeuFS3mzJXJYFQZd+3UzlFR9qwkFkby9mg5y4XSeMvRLOHPt/H/r5SpEqBE6a9MadZYt61FBV152CUEzd43ihXtrAa0XH9HdsiySBcWI1SpM3mv9rRP0DiLjMUzHw/K1D8TE2f07zW4t/9kvE11tFj/NpICixQAAAAA="
3770     sdmf_old_cap = "URI:SSK:gmjgofw6gan57gwpsow6gtrz3e:5adm6fayxmu3e4lkmfvt6lkkfix34ai2wop2ioqr4bgvvhiol3kq"
3771     sdmf_old_contents = "This is a test file.\n"
3772     def copy_sdmf_shares(self):
3773         # We'll basically be short-circuiting the upload process.
3774         servernums = self.g.servers_by_number.keys()
3775         assert len(servernums) == 10
3776
3777         assignments = zip(self.sdmf_old_shares.keys(), servernums)
3778         # Get the storage index.
3779         cap = uri.from_string(self.sdmf_old_cap)
3780         si = cap.get_storage_index()
3781
3782         # Now execute each assignment by writing the storage.
3783         for (share, servernum) in assignments:
3784             sharedata = base64.b64decode(self.sdmf_old_shares[share])
3785             storedir = self.get_serverdir(servernum)
3786             storage_path = os.path.join(storedir, "shares",
3787                                         storage_index_to_dir(si))
3788             fileutil.make_dirs(storage_path)
3789             fileutil.write(os.path.join(storage_path, "%d" % share),
3790                            sharedata)
3791         # ...and verify that the shares are there.
3792         shares = self.find_uri_shares(self.sdmf_old_cap)
3793         assert len(shares) == 10
3794
3795     def test_new_downloader_can_read_old_shares(self):
3796         self.basedir = "mutable/Interoperability/new_downloader_can_read_old_shares"
3797         self.set_up_grid()
3798         self.copy_sdmf_shares()
3799         nm = self.g.clients[0].nodemaker
3800         n = nm.create_from_cap(self.sdmf_old_cap)
3801         d = n.download_best_version()
3802         d.addCallback(self.failUnlessEqual, self.sdmf_old_contents)
3803         return d
3804
3805 class DifferentEncoding(unittest.TestCase):
3806     def setUp(self):
3807         self._storage = s = FakeStorage()
3808         self.nodemaker = make_nodemaker(s)
3809
3810     def test_filenode(self):
3811         # create a file with 3-of-20, then modify it with a client configured
3812         # to do 3-of-10. #1510 tracks a failure here
3813         self.nodemaker.default_encoding_parameters["n"] = 20
3814         d = self.nodemaker.create_mutable_file("old contents")
3815         def _created(n):
3816             filecap = n.get_cap().to_string()
3817             del n # we want a new object, not the cached one
3818             self.nodemaker.default_encoding_parameters["n"] = 10
3819             n2 = self.nodemaker.create_from_cap(filecap)
3820             return n2
3821         d.addCallback(_created)
3822         def modifier(old_contents, servermap, first_time):
3823             return "new contents"
3824         d.addCallback(lambda n: n.modify(modifier))
3825         return d