src/allmydata/test/test_mutable.py

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