2 from zope.interface import Interface
3 from foolscap.schema import StringConstraint, ListOf, TupleOf, SetOf, DictOf, \
4 ChoiceOf, IntegerConstraint
5 from foolscap import RemoteInterface, Referenceable
9 Hash = StringConstraint(maxLength=HASH_SIZE,
10 minLength=HASH_SIZE)# binary format 32-byte SHA256 hash
11 Nodeid = StringConstraint(maxLength=20,
12 minLength=20) # binary format 20-byte SHA1 hash
13 FURL = StringConstraint(1000)
14 StorageIndex = StringConstraint(16)
15 URI = StringConstraint(300) # kind of arbitrary
17 MAX_BUCKETS = 256 # per peer -- zfec offers at most 256 shares per file
19 ShareData = StringConstraint(None)
20 URIExtensionData = StringConstraint(1000)
21 Number = IntegerConstraint(8) # 2**(8*8) == 16EiB ~= 18e18 ~= 18 exabytes
23 ReadSize = int # the 'int' constraint is 2**31 == 2Gib -- large files are processed in not-so-large increments
24 WriteEnablerSecret = Hash # used to protect mutable bucket modifications
25 LeaseRenewSecret = Hash # used to protect bucket lease renewal requests
26 LeaseCancelSecret = Hash # used to protect bucket lease cancellation requests
28 class RIStubClient(RemoteInterface):
29 """Each client publishes a service announcement for a dummy object called
30 the StubClient. This object doesn't actually offer any services, but the
31 announcement helps the Introducer keep track of which clients are
32 subscribed (so the grid admin can keep track of things like the size of
33 the grid and the client versions in use. This is the (empty)
34 RemoteInterface for the StubClient."""
36 class RIBucketWriter(RemoteInterface):
37 """ Objects of this kind live on the server side. """
38 def write(offset=Offset, data=ShareData):
43 If the data that has been written is incomplete or inconsistent then
44 the server will throw the data away, else it will store it for future
50 """Abandon all the data that has been written.
54 class RIBucketReader(RemoteInterface):
55 def read(offset=Offset, length=ReadSize):
58 def advise_corrupt_share(reason=str):
59 """Clients who discover hash failures in shares that they have
60 downloaded from me will use this method to inform me about the
61 failures. I will record their concern so that my operator can
62 manually inspect the shares in question. I return None.
64 This is a wrapper around RIStorageServer.advise_corrupt_share(),
65 which is tied to a specific share, and therefore does not need the
66 extra share-identifying arguments. Please see that method for full
70 TestVector = ListOf(TupleOf(Offset, ReadSize, str, str))
71 # elements are (offset, length, operator, specimen)
72 # operator is one of "lt, le, eq, ne, ge, gt"
73 # nop always passes and is used to fetch data while writing.
74 # you should use length==len(specimen) for everything except nop
75 DataVector = ListOf(TupleOf(Offset, ShareData))
76 # (offset, data). This limits us to 30 writes of 1MiB each per call
77 TestAndWriteVectorsForShares = DictOf(int,
80 ChoiceOf(None, Offset), # new_length
82 ReadVector = ListOf(TupleOf(Offset, ReadSize))
83 ReadData = ListOf(ShareData)
84 # returns data[offset:offset+length] for each element of TestVector
86 class RIStorageServer(RemoteInterface):
87 __remote_name__ = "RIStorageServer.tahoe.allmydata.com"
91 Return a tuple of (my_version, oldest_supported) strings. Each string can be parsed by
92 a pyutil.version_class.Version instance or a distutils.version.LooseVersion instance,
93 and then compared. The first goal is to make sure that nodes are not confused by
94 speaking to an incompatible peer. The second goal is to enable the development of
95 backwards-compatibility code.
97 The meaning of the oldest_supported element is that if you treat this storage server as
98 though it were of that version, then you will not be disappointed.
100 The precise meaning of this method might change in incompatible ways until we get the
101 whole compatibility scheme nailed down.
103 return TupleOf(str, str)
105 def allocate_buckets(storage_index=StorageIndex,
106 renew_secret=LeaseRenewSecret,
107 cancel_secret=LeaseCancelSecret,
108 sharenums=SetOf(int, maxLength=MAX_BUCKETS),
109 allocated_size=Offset, canary=Referenceable):
111 @param storage_index: the index of the bucket to be created or
113 @param sharenums: these are the share numbers (probably between 0 and
114 99) that the sender is proposing to store on this
116 @param renew_secret: This is the secret used to protect bucket refresh
117 This secret is generated by the client and
118 stored for later comparison by the server. Each
119 server is given a different secret.
120 @param cancel_secret: Like renew_secret, but protects bucket decref.
121 @param canary: If the canary is lost before close(), the bucket is
123 @return: tuple of (alreadygot, allocated), where alreadygot is what we
124 already have and is what we hereby agree to accept. New
125 leases are added for shares in both lists.
127 return TupleOf(SetOf(int, maxLength=MAX_BUCKETS),
128 DictOf(int, RIBucketWriter, maxKeys=MAX_BUCKETS))
130 def add_lease(storage_index=StorageIndex,
131 renew_secret=LeaseRenewSecret,
132 cancel_secret=LeaseCancelSecret):
134 Add a new lease on the given bucket. If the renew_secret matches an
135 existing lease, that lease will be renewed instead.
139 def renew_lease(storage_index=StorageIndex, renew_secret=LeaseRenewSecret):
141 Renew the lease on a given bucket. Some networks will use this, some
146 def cancel_lease(storage_index=StorageIndex,
147 cancel_secret=LeaseCancelSecret):
149 Cancel the lease on a given bucket. If this was the last lease on the
150 bucket, the bucket will be deleted.
154 def get_buckets(storage_index=StorageIndex):
155 return DictOf(int, RIBucketReader, maxKeys=MAX_BUCKETS)
159 def slot_readv(storage_index=StorageIndex,
160 shares=ListOf(int), readv=ReadVector):
161 """Read a vector from the numbered shares associated with the given
162 storage index. An empty shares list means to return data from all
163 known shares. Returns a dictionary with one key per share."""
164 return DictOf(int, ReadData) # shnum -> results
166 def slot_testv_and_readv_and_writev(storage_index=StorageIndex,
167 secrets=TupleOf(WriteEnablerSecret,
170 tw_vectors=TestAndWriteVectorsForShares,
173 """General-purpose test-and-set operation for mutable slots. Perform
174 a bunch of comparisons against the existing shares. If they all pass,
175 then apply a bunch of write vectors to those shares. Then use the
176 read vectors to extract data from all the shares and return the data.
178 This method is, um, large. The goal is to allow clients to update all
179 the shares associated with a mutable file in a single round trip.
181 @param storage_index: the index of the bucket to be created or
183 @param write_enabler: a secret that is stored along with the slot.
184 Writes are accepted from any caller who can
185 present the matching secret. A different secret
186 should be used for each slot*server pair.
187 @param renew_secret: This is the secret used to protect bucket refresh
188 This secret is generated by the client and
189 stored for later comparison by the server. Each
190 server is given a different secret.
191 @param cancel_secret: Like renew_secret, but protects bucket decref.
193 The 'secrets' argument is a tuple of (write_enabler, renew_secret,
194 cancel_secret). The first is required to perform any write. The
195 latter two are used when allocating new shares. To simply acquire a
196 new lease on existing shares, use an empty testv and an empty writev.
198 Each share can have a separate test vector (i.e. a list of
199 comparisons to perform). If all vectors for all shares pass, then all
200 writes for all shares are recorded. Each comparison is a 4-tuple of
201 (offset, length, operator, specimen), which effectively does a bool(
202 (read(offset, length)) OPERATOR specimen ) and only performs the
203 write if all these evaluate to True. Basic test-and-set uses 'eq'.
204 Write-if-newer uses a seqnum and (offset, length, 'lt', specimen).
205 Write-if-same-or-newer uses 'le'.
207 Reads from the end of the container are truncated, and missing shares
208 behave like empty ones, so to assert that a share doesn't exist (for
209 use when creating a new share), use (0, 1, 'eq', '').
211 The write vector will be applied to the given share, expanding it if
212 necessary. A write vector applied to a share number that did not
213 exist previously will cause that share to be created.
215 Each write vector is accompanied by a 'new_length' argument. If
216 new_length is not None, use it to set the size of the container. This
217 can be used to pre-allocate space for a series of upcoming writes, or
218 truncate existing data. If the container is growing, new_length will
219 be applied before datav. If the container is shrinking, it will be
222 The read vector is used to extract data from all known shares,
223 *before* any writes have been applied. The same vector is used for
224 all shares. This captures the state that was tested by the test
227 This method returns two values: a boolean and a dict. The boolean is
228 True if the write vectors were applied, False if not. The dict is
229 keyed by share number, and each value contains a list of strings, one
230 for each element of the read vector.
232 If the write_enabler is wrong, this will raise BadWriteEnablerError.
233 To enable share migration (using update_write_enabler), the exception
234 will have the nodeid used for the old write enabler embedded in it,
235 in the following string::
237 The write enabler was recorded by nodeid '%s'.
239 Note that the nodeid here is encoded using the same base32 encoding
240 used by Foolscap and allmydata.util.idlib.nodeid_b2a().
243 return TupleOf(bool, DictOf(int, ReadData))
245 def advise_corrupt_share(share_type=str, storage_index=StorageIndex,
246 shnum=int, reason=str):
247 """Clients who discover hash failures in shares that they have
248 downloaded from me will use this method to inform me about the
249 failures. I will record their concern so that my operator can
250 manually inspect the shares in question. I return None.
252 'share_type' is either 'mutable' or 'immutable'. 'storage_index' is a
253 (binary) storage index string, and 'shnum' is the integer share
254 number. 'reason' is a human-readable explanation of the problem,
255 probably including some expected hash values and the computed ones
256 which did not match. Corruption advisories for mutable shares should
257 include a hash of the public key (the same value that appears in the
258 mutable-file verify-cap), since the current share format does not
262 class IStorageBucketWriter(Interface):
264 Objects of this kind live on the client side.
266 def put_block(segmentnum=int, data=ShareData):
267 """@param data: For most segments, this data will be 'blocksize'
268 bytes in length. The last segment might be shorter.
269 @return: a Deferred that fires (with None) when the operation completes
272 def put_plaintext_hashes(hashes=ListOf(Hash)):
274 @return: a Deferred that fires (with None) when the operation completes
277 def put_crypttext_hashes(hashes=ListOf(Hash)):
279 @return: a Deferred that fires (with None) when the operation completes
282 def put_block_hashes(blockhashes=ListOf(Hash)):
284 @return: a Deferred that fires (with None) when the operation completes
287 def put_share_hashes(sharehashes=ListOf(TupleOf(int, Hash))):
289 @return: a Deferred that fires (with None) when the operation completes
292 def put_uri_extension(data=URIExtensionData):
293 """This block of data contains integrity-checking information (hashes
294 of plaintext, crypttext, and shares), as well as encoding parameters
295 that are necessary to recover the data. This is a serialized dict
296 mapping strings to other strings. The hash of this data is kept in
297 the URI and verified before any of the data is used. All buckets for
298 a given file contain identical copies of this data.
300 The serialization format is specified with the following pseudocode:
301 for k in sorted(dict.keys()):
302 assert re.match(r'^[a-zA-Z_\-]+$', k)
303 write(k + ':' + netstring(dict[k]))
305 @return: a Deferred that fires (with None) when the operation completes
309 """Finish writing and close the bucket. The share is not finalized
310 until this method is called: if the uploading client disconnects
311 before calling close(), the partially-written share will be
314 @return: a Deferred that fires (with None) when the operation completes
317 class IStorageBucketReader(Interface):
319 def get_block(blocknum=int):
320 """Most blocks will be the same size. The last block might be shorter
326 def get_plaintext_hashes():
328 @return: ListOf(Hash)
331 def get_crypttext_hashes():
333 @return: ListOf(Hash)
336 def get_block_hashes():
338 @return: ListOf(Hash)
341 def get_share_hashes():
343 @return: ListOf(TupleOf(int, Hash))
346 def get_uri_extension():
348 @return: URIExtensionData
353 # hm, we need a solution for forward references in schemas
354 from foolscap.schema import Any
356 FileNode_ = Any() # TODO: foolscap needs constraints on copyables
357 DirectoryNode_ = Any() # TODO: same
358 AnyNode_ = ChoiceOf(FileNode_, DirectoryNode_)
361 class IURI(Interface):
362 def init_from_string(uri):
363 """Accept a string (as created by my to_string() method) and populate
364 this instance with its data. I am not normally called directly,
365 please use the module-level uri.from_string() function to convert
366 arbitrary URI strings into IURI-providing instances."""
369 """Return False if this URI be used to modify the data. Return True
370 if this URI cannot be used to modify the data."""
373 """Return True if the data can be modified by *somebody* (perhaps
374 someone who has a more powerful URI than this one)."""
377 """Return another IURI instance, which represents a read-only form of
378 this one. If is_readonly() is True, this returns self."""
381 """Return an instance that provides IVerifierURI, which can be used
382 to check on the availability of the file or directory, without
383 providing enough capabilities to actually read or modify the
384 contents. This may return None if the file does not need checking or
385 verification (e.g. LIT URIs).
389 """Return a string of printable ASCII characters, suitable for
390 passing into init_from_string."""
392 class IVerifierURI(Interface):
393 def init_from_string(uri):
394 """Accept a string (as created by my to_string() method) and populate
395 this instance with its data. I am not normally called directly,
396 please use the module-level uri.from_string() function to convert
397 arbitrary URI strings into IURI-providing instances."""
400 """Return a string of printable ASCII characters, suitable for
401 passing into init_from_string."""
403 class IDirnodeURI(Interface):
404 """I am a URI which represents a dirnode."""
407 class IFileURI(Interface):
408 """I am a URI which represents a filenode."""
410 """Return the length (in bytes) of the file that I represent."""
412 class IMutableFileURI(Interface):
413 """I am a URI which represents a mutable filenode."""
414 class INewDirectoryURI(Interface):
416 class IReadonlyNewDirectoryURI(Interface):
420 class IFilesystemNode(Interface):
423 Return the URI that can be used by others to get access to this
424 node. If this node is read-only, the URI will only offer read-only
425 access. If this node is read-write, the URI will offer read-write
428 If you have read-write access to a node and wish to share merely
429 read-only access with others, use get_readonly_uri().
432 def get_readonly_uri():
433 """Return the directory URI that can be used by others to get
434 read-only access to this directory node. The result is a read-only
435 URI, regardless of whether this dirnode is read-only or read-write.
437 If you have merely read-only access to this dirnode,
438 get_readonly_uri() will return the same thing as get_uri().
442 """Return an IVerifierURI instance that represents the
443 'verifiy/refresh capability' for this node. The holder of this
444 capability will be able to renew the lease for this node, protecting
445 it from garbage-collection. They will also be able to ask a server if
446 it holds a share for the file or directory.
449 def get_storage_index():
450 """Return a string with the (binary) storage index in use on this
451 download. This may be None if there is no storage index (i.e. LIT
455 """Return True if this reference provides mutable access to the given
456 file or directory (i.e. if you can modify it), or False if not. Note
457 that even if this reference is read-only, someone else may hold a
458 read-write reference to it."""
461 """Return True if this file or directory is mutable (by *somebody*,
462 not necessarily you), False if it is is immutable. Note that a file
463 might be mutable overall, but your reference to it might be
464 read-only. On the other hand, all references to an immutable file
465 will be read-only; there are no read-write references to an immutable
469 class IMutableFilesystemNode(IFilesystemNode):
472 class IFileNode(IFilesystemNode):
473 def download(target):
474 """Download the file's contents to a given IDownloadTarget"""
476 def download_to_data():
477 """Download the file's contents. Return a Deferred that fires
478 with those contents."""
481 """Return the length (in bytes) of the data this node represents."""
483 def read(consumer, offset=0, size=None):
484 """Download a portion (possibly all) of the file's contents, making
485 them available to the given IConsumer. Return a Deferred that fires
486 (with the consumer) when the consumer is unregistered (either because
487 the last byte has been given to it, or because the consumer threw an
488 exception during write(), possibly because it no longer wants to
489 receive data). The portion downloaded will start at 'offset' and
490 contain 'size' bytes (or the remainder of the file if size==None).
492 The consumer will be used in non-streaming mode: an IPullProducer
493 will be attached to it.
495 The consumer will not receive data right away: several network trips
496 must occur first. The order of events will be::
498 consumer.registerProducer(p, streaming)
499 (if streaming == False)::
500 consumer does p.resumeProducing()
502 consumer does p.resumeProducing()
503 consumer.write(data).. (repeat until all data is written)
504 consumer.unregisterProducer()
505 deferred.callback(consumer)
507 If a download error occurs, or an exception is raised by
508 consumer.registerProducer() or consumer.write(), I will call
509 consumer.unregisterProducer() and then deliver the exception via
510 deferred.errback(). To cancel the download, the consumer should call
511 p.stopProducing(), which will result in an exception being delivered
512 via deferred.errback().
514 A simple download-to-memory consumer example would look like this::
516 class MemoryConsumer:
517 implements(IConsumer)
521 def registerProducer(self, p, streaming):
522 assert streaming == False
525 def write(self, data):
526 self.chunks.append(data)
527 def unregisterProducer(self):
529 d = filenode.read(MemoryConsumer())
530 d.addCallback(lambda mc: "".join(mc.chunks))
535 class IMutableFileNode(IFileNode, IMutableFilesystemNode):
536 """I provide access to a 'mutable file', which retains its identity
537 regardless of what contents are put in it.
539 The consistency-vs-availability problem means that there might be
540 multiple versions of a file present in the grid, some of which might be
541 unrecoverable (i.e. have fewer than 'k' shares). These versions are
542 loosely ordered: each has a sequence number and a hash, and any version
543 with seqnum=N was uploaded by a node which has seen at least one version
546 The 'servermap' (an instance of IMutableFileServerMap) is used to
547 describe the versions that are known to be present in the grid, and which
548 servers are hosting their shares. It is used to represent the 'state of
549 the world', and is used for this purpose by my test-and-set operations.
550 Downloading the contents of the mutable file will also return a
551 servermap. Uploading a new version into the mutable file requires a
552 servermap as input, and the semantics of the replace operation is
553 'replace the file with my new version if it looks like nobody else has
554 changed the file since my previous download'. Because the file is
555 distributed, this is not a perfect test-and-set operation, but it will do
556 its best. If the replace process sees evidence of a simultaneous write,
557 it will signal an UncoordinatedWriteError, so that the caller can take
561 Most readers will want to use the 'best' current version of the file, and
562 should use my 'download_best_version()' method.
564 To unconditionally replace the file, callers should use overwrite(). This
565 is the mode that user-visible mutable files will probably use.
567 To apply some delta to the file, call modify() with a callable modifier
568 function that can apply the modification that you want to make. This is
569 the mode that dirnodes will use, since most directory modification
570 operations can be expressed in terms of deltas to the directory state.
573 Three methods are available for users who need to perform more complex
574 operations. The first is get_servermap(), which returns an up-to-date
575 servermap using a specified mode. The second is download_version(), which
576 downloads a specific version (not necessarily the 'best' one). The third
577 is 'upload', which accepts new contents and a servermap (which must have
578 been updated with MODE_WRITE). The upload method will attempt to apply
579 the new contents as long as no other node has modified the file since the
580 servermap was updated. This might be useful to a caller who wants to
581 merge multiple versions into a single new one.
583 Note that each time the servermap is updated, a specific 'mode' is used,
584 which determines how many peers are queried. To use a servermap for my
585 replace() method, that servermap must have been updated in MODE_WRITE.
586 These modes are defined in allmydata.mutable.common, and consist of
587 MODE_READ, MODE_WRITE, MODE_ANYTHING, and MODE_CHECK. Please look in
588 allmydata/mutable/servermap.py for details about the differences.
590 Mutable files are currently limited in size (about 3.5MB max) and can
591 only be retrieved and updated all-at-once, as a single big string. Future
592 versions of our mutable files will remove this restriction.
595 def download_best_version():
596 """Download the 'best' available version of the file, meaning one of
597 the recoverable versions with the highest sequence number. If no
598 uncoordinated writes have occurred, and if enough shares are
599 available, then this will be the most recent version that has been
602 I update an internal servermap with MODE_READ, determine which
603 version of the file is indicated by
604 servermap.best_recoverable_version(), and return a Deferred that
605 fires with its contents. If no version is recoverable, the Deferred
606 will errback with UnrecoverableFileError.
609 def get_size_of_best_version():
610 """Find the size of the version that would be downloaded with
611 download_best_version(), without actually downloading the whole file.
613 I return a Deferred that fires with an integer.
616 def overwrite(new_contents):
617 """Unconditionally replace the contents of the mutable file with new
618 ones. This simply chains get_servermap(MODE_WRITE) and upload(). This
619 is only appropriate to use when the new contents of the file are
620 completely unrelated to the old ones, and you do not care about other
623 I return a Deferred that fires (with a PublishStatus object) when the
624 update has completed.
627 def modify(modifier_cb):
628 """Modify the contents of the file, by downloading the current
629 version, applying the modifier function (or bound method), then
630 uploading the new version. I return a Deferred that fires (with a
631 PublishStatus object) when the update is complete.
633 The modifier callable will be given two arguments: a string (with the
634 old contents) and a servermap. As with download_best_version(), the
635 old contents will be from the best recoverable version, but the
636 modifier can use the servermap to make other decisions (such as
637 refusing to apply the delta if there are multiple parallel versions,
638 or if there is evidence of a newer unrecoverable version).
640 The callable should return a string with the new contents. The
641 callable must be prepared to be called multiple times, and must
642 examine the input string to see if the change that it wants to make
643 is already present in the old version. If it does not need to make
644 any changes, it can either return None, or return its input string.
646 If the modifier raises an exception, it will be returned in the
651 def get_servermap(mode):
652 """Return a Deferred that fires with an IMutableFileServerMap
653 instance, updated using the given mode.
656 def download_version(servermap, version):
657 """Download a specific version of the file, using the servermap
658 as a guide to where the shares are located.
660 I return a Deferred that fires with the requested contents, or
661 errbacks with UnrecoverableFileError. Note that a servermap which was
662 updated with MODE_ANYTHING or MODE_READ may not know about shares for
663 all versions (those modes stop querying servers as soon as they can
664 fulfil their goals), so you may want to use MODE_CHECK (which checks
665 everything) to get increased visibility.
668 def upload(new_contents, servermap):
669 """Replace the contents of the file with new ones. This requires a
670 servermap that was previously updated with MODE_WRITE.
672 I attempt to provide test-and-set semantics, in that I will avoid
673 modifying any share that is different than the version I saw in the
674 servermap. However, if another node is writing to the file at the
675 same time as me, I may manage to update some shares while they update
676 others. If I see any evidence of this, I will signal
677 UncoordinatedWriteError, and the file will be left in an inconsistent
678 state (possibly the version you provided, possibly the old version,
679 possibly somebody else's version, and possibly a mix of shares from
682 The recommended response to UncoordinatedWriteError is to either
683 return it to the caller (since they failed to coordinate their
684 writes), or to attempt some sort of recovery. It may be sufficient to
685 wait a random interval (with exponential backoff) and repeat your
686 operation. If I do not signal UncoordinatedWriteError, then I was
687 able to write the new version without incident.
689 I return a Deferred that fires (with a PublishStatus object) when the
690 publish has completed. I will update the servermap in-place with the
691 location of all new shares.
695 """Return this filenode's writekey, or None if the node does not have
696 write-capability. This may be used to assist with data structures
697 that need to make certain data available only to writers, such as the
698 read-write child caps in dirnodes. The recommended process is to have
699 reader-visible data be submitted to the filenode in the clear (where
700 it will be encrypted by the filenode using the readkey), but encrypt
701 writer-visible data using this writekey.
704 class NotEnoughSharesError(Exception):
707 class ExistingChildError(Exception):
708 """A directory node was asked to add or replace a child that already
709 exists, and overwrite= was set to False."""
711 class NoSuchChildError(Exception):
712 """A directory node was asked to fetch a child which does not exist."""
714 class IDirectoryNode(IMutableFilesystemNode):
715 """I represent a name-to-child mapping, holding the tahoe equivalent of a
716 directory. All child names are unicode strings, and all children are some
717 sort of IFilesystemNode (either files or subdirectories).
722 The dirnode ('1') URI returned by this method can be used in
723 set_uri() on a different directory ('2') to 'mount' a reference to
724 this directory ('1') under the other ('2'). This URI is just a
725 string, so it can be passed around through email or other out-of-band
729 def get_readonly_uri():
731 The dirnode ('1') URI returned by this method can be used in
732 set_uri() on a different directory ('2') to 'mount' a reference to
733 this directory ('1') under the other ('2'). This URI is just a
734 string, so it can be passed around through email or other out-of-band
739 """I return a Deferred that fires with a dictionary mapping child
740 name (a unicode string) to (node, metadata_dict) tuples, in which
741 'node' is either an IFileNode or IDirectoryNode, and 'metadata_dict'
742 is a dictionary of metadata."""
745 """I return a Deferred that fires with a boolean, True if there
746 exists a child of the given name, False if not. The child name must
747 be a unicode string."""
750 """I return a Deferred that fires with a specific named child node,
751 either an IFileNode or an IDirectoryNode. The child name must be a
752 unicode string. I raise NoSuchChildError if I do not have a child by
755 def get_metadata_for(name):
756 """I return a Deferred that fires with the metadata dictionary for a
757 specific named child node. This metadata is stored in the *edge*, not
758 in the child, so it is attached to the parent dirnode rather than the
759 child dir-or-file-node. The child name must be a unicode string. I
760 raise NoSuchChildError if I do not have a child by that name."""
762 def set_metadata_for(name, metadata):
763 """I replace any existing metadata for the named child with the new
764 metadata. The child name must be a unicode string. This metadata is
765 stored in the *edge*, not in the child, so it is attached to the
766 parent dirnode rather than the child dir-or-file-node. I return a
767 Deferred (that fires with this dirnode) when the operation is
768 complete. I raise NoSuchChildError if I do not have a child by that
771 def get_child_at_path(path):
772 """Transform a child path into an IDirectoryNode or IFileNode.
774 I perform a recursive series of 'get' operations to find the named
775 descendant node. I return a Deferred that fires with the node, or
776 errbacks with NoSuchChildError if the node could not be found.
778 The path can be either a single string (slash-separated) or a list of
779 path-name elements. All elements must be unicode strings.
782 def get_child_and_metadata_at_path(path):
783 """Transform a child path into an IDirectoryNode/IFileNode and
786 I am like get_child_at_path(), but my Deferred fires with a tuple of
787 (node, metadata). The metadata comes from the last edge. If the path
788 is empty, the metadata will be an empty dictionary.
791 def set_uri(name, child_uri, metadata=None, overwrite=True):
792 """I add a child (by URI) at the specific name. I return a Deferred
793 that fires when the operation finishes. If overwrite= is True, I will
794 replace any existing child of the same name, otherwise an existing
795 child will cause me to return ExistingChildError. The child name must
798 The child_uri could be for a file, or for a directory (either
799 read-write or read-only, using a URI that came from get_uri() ).
801 If metadata= is provided, I will use it as the metadata for the named
802 edge. This will replace any existing metadata. If metadata= is left
803 as the default value of None, I will set ['mtime'] to the current
804 time, and I will set ['ctime'] to the current time if there was not
805 already a child by this name present. This roughly matches the
806 ctime/mtime semantics of traditional filesystems.
808 If this directory node is read-only, the Deferred will errback with a
811 def set_children(entries, overwrite=True):
812 """Add multiple (name, child_uri) pairs (or (name, child_uri,
813 metadata) triples) to a directory node. Returns a Deferred that fires
814 (with None) when the operation finishes. This is equivalent to
815 calling set_uri() multiple times, but is much more efficient. All
816 child names must be unicode strings.
819 def set_node(name, child, metadata=None, overwrite=True):
820 """I add a child at the specific name. I return a Deferred that fires
821 when the operation finishes. This Deferred will fire with the child
822 node that was just added. I will replace any existing child of the
823 same name. The child name must be a unicode string. The 'child'
824 instance must be an instance providing IDirectoryNode or IFileNode.
826 If metadata= is provided, I will use it as the metadata for the named
827 edge. This will replace any existing metadata. If metadata= is left
828 as the default value of None, I will set ['mtime'] to the current
829 time, and I will set ['ctime'] to the current time if there was not
830 already a child by this name present. This roughly matches the
831 ctime/mtime semantics of traditional filesystems.
833 If this directory node is read-only, the Deferred will errback with a
836 def set_nodes(entries, overwrite=True):
837 """Add multiple (name, child_node) pairs (or (name, child_node,
838 metadata) triples) to a directory node. Returns a Deferred that fires
839 (with None) when the operation finishes. This is equivalent to
840 calling set_node() multiple times, but is much more efficient. All
841 child names must be unicode strings."""
844 def add_file(name, uploadable, metadata=None, overwrite=True):
845 """I upload a file (using the given IUploadable), then attach the
846 resulting FileNode to the directory at the given name. I set metadata
847 the same way as set_uri and set_node. The child name must be a
850 I return a Deferred that fires (with the IFileNode of the uploaded
851 file) when the operation completes."""
854 """I remove the child at the specific name. I return a Deferred that
855 fires when the operation finishes. The child name must be a unicode
856 string. I raise NoSuchChildError if I do not have a child by that
859 def create_empty_directory(name, overwrite=True):
860 """I create and attach an empty directory at the given name. The
861 child name must be a unicode string. I return a Deferred that fires
862 when the operation finishes."""
864 def move_child_to(current_child_name, new_parent, new_child_name=None,
866 """I take one of my children and move them to a new parent. The child
867 is referenced by name. On the new parent, the child will live under
868 'new_child_name', which defaults to 'current_child_name'. TODO: what
869 should we do about metadata? I return a Deferred that fires when the
870 operation finishes. The child name must be a unicode string. I raise
871 NoSuchChildError if I do not have a child by that name."""
873 def build_manifest():
874 """I generate a table of everything reachable from this directory.
875 I also compute deep-stats as described below.
877 I return a Monitor. The Monitor's results will be a dictionary with
880 res['manifest']: a list of (path, cap) tuples for all nodes
881 (directories and files) reachable from this one.
882 'path' will be a tuple of unicode strings. The
883 origin dirnode will be represented by an empty path
885 res['storage-index']: a list of (base32) storage index strings,
886 one for each reachable node. This is a set:
887 duplicates have been removed.
888 res['stats']: a dictionary, the same that is generated by
889 start_deep_stats() below.
891 The Monitor will also have an .origin_si attribute with the (binary)
892 storage index of the starting point.
895 def start_deep_stats():
896 """Return a Monitor, examining all nodes (directories and files)
897 reachable from this one. The Monitor's results will be a dictionary
898 with the following keys::
900 count-immutable-files: count of how many CHK files are in the set
901 count-mutable-files: same, for mutable files (does not include
903 count-literal-files: same, for LIT files
904 count-files: sum of the above three
906 count-directories: count of directories
908 size-immutable-files: total bytes for all CHK files in the set
909 size-mutable-files (TODO): same, for current version of all mutable
910 files, does not include directories
911 size-literal-files: same, for LIT files
912 size-directories: size of mutable files used by directories
914 largest-directory: number of bytes in the largest directory
915 largest-directory-children: number of children in the largest
917 largest-immutable-file: number of bytes in the largest CHK file
919 size-mutable-files is not yet implemented, because it would involve
920 even more queries than deep_stats does.
922 The Monitor will also have an .origin_si attribute with the (binary)
923 storage index of the starting point.
925 This operation will visit every directory node underneath this one,
926 and can take a long time to run. On a typical workstation with good
927 bandwidth, this can examine roughly 15 directories per second (and
928 takes several minutes of 100% CPU for ~1700 directories).
931 class ICodecEncoder(Interface):
932 def set_params(data_size, required_shares, max_shares):
933 """Set up the parameters of this encoder.
935 This prepares the encoder to perform an operation that converts a
936 single block of data into a number of shares, such that a future
937 ICodecDecoder can use a subset of these shares to recover the
938 original data. This operation is invoked by calling encode(). Once
939 the encoding parameters are set up, the encode operation can be
940 invoked multiple times.
942 set_params() prepares the encoder to accept blocks of input data that
943 are exactly 'data_size' bytes in length. The encoder will be prepared
944 to produce 'max_shares' shares for each encode() operation (although
945 see the 'desired_share_ids' to use less CPU). The encoding math will
946 be chosen such that the decoder can get by with as few as
947 'required_shares' of these shares and still reproduce the original
948 data. For example, set_params(1000, 5, 5) offers no redundancy at
949 all, whereas set_params(1000, 1, 10) provides 10x redundancy.
951 Numerical Restrictions: 'data_size' is required to be an integral
952 multiple of 'required_shares'. In general, the caller should choose
953 required_shares and max_shares based upon their reliability
954 requirements and the number of peers available (the total storage
955 space used is roughly equal to max_shares*data_size/required_shares),
956 then choose data_size to achieve the memory footprint desired (larger
957 data_size means more efficient operation, smaller data_size means
958 smaller memory footprint).
960 In addition, 'max_shares' must be equal to or greater than
961 'required_shares'. Of course, setting them to be equal causes
962 encode() to degenerate into a particularly slow form of the 'split'
965 See encode() for more details about how these parameters are used.
967 set_params() must be called before any other ICodecEncoder methods
971 def get_encoder_type():
972 """Return a short string that describes the type of this encoder.
974 There is required to be a global table of encoder classes. This method
975 returns an index into this table; the value at this index is an
976 encoder class, and this encoder is an instance of that class.
979 def get_serialized_params(): # TODO: maybe, maybe not
980 """Return a string that describes the parameters of this encoder.
982 This string can be passed to the decoder to prepare it for handling
983 the encoded shares we create. It might contain more information than
984 was presented to set_params(), if there is some flexibility of
987 This string is intended to be embedded in the URI, so there are
988 several restrictions on its contents. At the moment I'm thinking that
989 this means it may contain hex digits and hyphens, and nothing else.
990 The idea is that the URI contains something like '%s:%s:%s' %
991 (encoder.get_encoder_name(), encoder.get_serialized_params(),
992 b2a(crypttext_hash)), and this is enough information to construct a
996 def get_block_size():
997 """Return the length of the shares that encode() will produce.
1000 def encode_proposal(data, desired_share_ids=None):
1001 """Encode some data.
1003 'data' must be a string (or other buffer object), and len(data) must
1004 be equal to the 'data_size' value passed earlier to set_params().
1006 This will return a Deferred that will fire with two lists. The first
1007 is a list of shares, each of which is a string (or other buffer
1008 object) such that len(share) is the same as what get_share_size()
1009 returned earlier. The second is a list of shareids, in which each is
1010 an integer. The lengths of the two lists will always be equal to each
1011 other. The user should take care to keep each share closely
1012 associated with its shareid, as one is useless without the other.
1014 The length of this output list will normally be the same as the value
1015 provided to the 'max_shares' parameter of set_params(). This may be
1016 different if 'desired_share_ids' is provided.
1018 'desired_share_ids', if provided, is required to be a sequence of
1019 ints, each of which is required to be >= 0 and < max_shares. If not
1020 provided, encode() will produce 'max_shares' shares, as if
1021 'desired_share_ids' were set to range(max_shares). You might use this
1022 if you initially thought you were going to use 10 peers, started
1023 encoding, and then two of the peers dropped out: you could use
1024 desired_share_ids= to skip the work (both memory and CPU) of
1025 producing shares for the peers which are no longer available.
1029 def encode(inshares, desired_share_ids=None):
1030 """Encode some data. This may be called multiple times. Each call is
1033 inshares is a sequence of length required_shares, containing buffers
1034 (i.e. strings), where each buffer contains the next contiguous
1035 non-overlapping segment of the input data. Each buffer is required to
1036 be the same length, and the sum of the lengths of the buffers is
1037 required to be exactly the data_size promised by set_params(). (This
1038 implies that the data has to be padded before being passed to
1039 encode(), unless of course it already happens to be an even multiple
1040 of required_shares in length.)
1042 ALSO: the requirement to break up your data into 'required_shares'
1043 chunks before calling encode() feels a bit surprising, at least from
1044 the point of view of a user who doesn't know how FEC works. It feels
1045 like an implementation detail that has leaked outside the
1046 abstraction barrier. Can you imagine a use case in which the data to
1047 be encoded might already be available in pre-segmented chunks, such
1048 that it is faster or less work to make encode() take a list rather
1049 than splitting a single string?
1051 ALSO ALSO: I think 'inshares' is a misleading term, since encode()
1052 is supposed to *produce* shares, so what it *accepts* should be
1053 something other than shares. Other places in this interface use the
1054 word 'data' for that-which-is-not-shares.. maybe we should use that
1057 'desired_share_ids', if provided, is required to be a sequence of
1058 ints, each of which is required to be >= 0 and < max_shares. If not
1059 provided, encode() will produce 'max_shares' shares, as if
1060 'desired_share_ids' were set to range(max_shares). You might use this
1061 if you initially thought you were going to use 10 peers, started
1062 encoding, and then two of the peers dropped out: you could use
1063 desired_share_ids= to skip the work (both memory and CPU) of
1064 producing shares for the peers which are no longer available.
1066 For each call, encode() will return a Deferred that fires with two
1067 lists, one containing shares and the other containing the shareids.
1068 The get_share_size() method can be used to determine the length of
1069 the share strings returned by encode(). Each shareid is a small
1070 integer, exactly as passed into 'desired_share_ids' (or
1071 range(max_shares), if desired_share_ids was not provided).
1073 The shares and their corresponding shareids are required to be kept
1074 together during storage and retrieval. Specifically, the share data is
1075 useless by itself: the decoder needs to be told which share is which
1076 by providing it with both the shareid and the actual share data.
1078 This function will allocate an amount of memory roughly equal to::
1080 (max_shares - required_shares) * get_share_size()
1082 When combined with the memory that the caller must allocate to
1083 provide the input data, this leads to a memory footprint roughly
1084 equal to the size of the resulting encoded shares (i.e. the expansion
1085 factor times the size of the input segment).
1090 # returning a list of (shareidN,shareN) tuples instead of a pair of
1091 # lists (shareids..,shares..). Brian thought the tuples would
1092 # encourage users to keep the share and shareid together throughout
1093 # later processing, Zooko pointed out that the code to iterate
1094 # through two lists is not really more complicated than using a list
1095 # of tuples and there's also a performance improvement
1097 # having 'data_size' not required to be an integral multiple of
1098 # 'required_shares'. Doing this would require encode() to perform
1099 # padding internally, and we'd prefer to have any padding be done
1100 # explicitly by the caller. Yes, it is an abstraction leak, but
1101 # hopefully not an onerous one.
1104 class ICodecDecoder(Interface):
1105 def set_serialized_params(params):
1106 """Set up the parameters of this encoder, from a string returned by
1107 encoder.get_serialized_params()."""
1109 def get_needed_shares():
1110 """Return the number of shares needed to reconstruct the data.
1111 set_serialized_params() is required to be called before this."""
1113 def decode(some_shares, their_shareids):
1114 """Decode a partial list of shares into data.
1116 'some_shares' is required to be a sequence of buffers of sharedata, a
1117 subset of the shares returned by ICodecEncode.encode(). Each share is
1118 required to be of the same length. The i'th element of their_shareids
1119 is required to be the shareid of the i'th buffer in some_shares.
1121 This returns a Deferred which fires with a sequence of buffers. This
1122 sequence will contain all of the segments of the original data, in
1123 order. The sum of the lengths of all of the buffers will be the
1124 'data_size' value passed into the original ICodecEncode.set_params()
1125 call. To get back the single original input block of data, use
1126 ''.join(output_buffers), or you may wish to simply write them in
1127 order to an output file.
1129 Note that some of the elements in the result sequence may be
1130 references to the elements of the some_shares input sequence. In
1131 particular, this means that if those share objects are mutable (e.g.
1132 arrays) and if they are changed, then both the input (the
1133 'some_shares' parameter) and the output (the value given when the
1134 deferred is triggered) will change.
1136 The length of 'some_shares' is required to be exactly the value of
1137 'required_shares' passed into the original ICodecEncode.set_params()
1141 class IEncoder(Interface):
1142 """I take an object that provides IEncryptedUploadable, which provides
1143 encrypted data, and a list of shareholders. I then encode, hash, and
1144 deliver shares to those shareholders. I will compute all the necessary
1145 Merkle hash trees that are necessary to validate the crypttext that
1146 eventually comes back from the shareholders. I provide the URI Extension
1147 Block Hash, and the encoding parameters, both of which must be included
1150 I do not choose shareholders, that is left to the IUploader. I must be
1151 given a dict of RemoteReferences to storage buckets that are ready and
1152 willing to receive data.
1156 """Specify the number of bytes that will be encoded. This must be
1157 peformed before get_serialized_params() can be called.
1159 def set_params(params):
1160 """Override the default encoding parameters. 'params' is a tuple of
1161 (k,d,n), where 'k' is the number of required shares, 'd' is the
1162 shares_of_happiness, and 'n' is the total number of shares that will
1165 Encoding parameters can be set in three ways. 1: The Encoder class
1166 provides defaults (3/7/10). 2: the Encoder can be constructed with
1167 an 'options' dictionary, in which the
1168 needed_and_happy_and_total_shares' key can be a (k,d,n) tuple. 3:
1169 set_params((k,d,n)) can be called.
1171 If you intend to use set_params(), you must call it before
1172 get_share_size or get_param are called.
1175 def set_encrypted_uploadable(u):
1176 """Provide a source of encrypted upload data. 'u' must implement
1177 IEncryptedUploadable.
1179 When this is called, the IEncryptedUploadable will be queried for its
1180 length and the storage_index that should be used.
1182 This returns a Deferred that fires with this Encoder instance.
1184 This must be performed before start() can be called.
1187 def get_param(name):
1188 """Return an encoding parameter, by name.
1190 'storage_index': return a string with the (16-byte truncated SHA-256
1191 hash) storage index to which these shares should be
1194 'share_counts': return a tuple describing how many shares are used:
1195 (needed_shares, shares_of_happiness, total_shares)
1197 'num_segments': return an int with the number of segments that
1200 'segment_size': return an int with the size of each segment.
1202 'block_size': return the size of the individual blocks that will
1203 be delivered to a shareholder's put_block() method. By
1204 knowing this, the shareholder will be able to keep all
1205 blocks in a single file and still provide random access
1206 when reading them. # TODO: can we avoid exposing this?
1208 'share_size': an int with the size of the data that will be stored
1209 on each shareholder. This is aggregate amount of data
1210 that will be sent to the shareholder, summed over all
1211 the put_block() calls I will ever make. It is useful to
1212 determine this size before asking potential
1213 shareholders whether they will grant a lease or not,
1214 since their answers will depend upon how much space we
1215 need. TODO: this might also include some amount of
1216 overhead, like the size of all the hashes. We need to
1217 decide whether this is useful or not.
1219 'serialized_params': a string with a concise description of the
1220 codec name and its parameters. This may be passed
1221 into the IUploadable to let it make sure that
1222 the same file encoded with different parameters
1223 will result in different storage indexes.
1225 Once this is called, set_size() and set_params() may not be called.
1228 def set_shareholders(shareholders):
1229 """Tell the encoder where to put the encoded shares. 'shareholders'
1230 must be a dictionary that maps share number (an integer ranging from
1231 0 to n-1) to an instance that provides IStorageBucketWriter. This
1232 must be performed before start() can be called."""
1235 """Begin the encode/upload process. This involves reading encrypted
1236 data from the IEncryptedUploadable, encoding it, uploading the shares
1237 to the shareholders, then sending the hash trees.
1239 set_encrypted_uploadable() and set_shareholders() must be called
1240 before this can be invoked.
1242 This returns a Deferred that fires with a tuple of
1243 (uri_extension_hash, needed_shares, total_shares, size) when the
1244 upload process is complete. This information, plus the encryption
1245 key, is sufficient to construct the URI.
1248 class IDecoder(Interface):
1249 """I take a list of shareholders and some setup information, then
1250 download, validate, decode, and decrypt data from them, writing the
1251 results to an output file.
1253 I do not locate the shareholders, that is left to the IDownloader. I must
1254 be given a dict of RemoteReferences to storage buckets that are ready to
1259 """I take a file-like object (providing write and close) to which all
1260 the plaintext data will be written.
1262 TODO: producer/consumer . Maybe write() should return a Deferred that
1263 indicates when it will accept more data? But probably having the
1264 IDecoder be a producer is easier to glue to IConsumer pieces.
1267 def set_shareholders(shareholders):
1268 """I take a dictionary that maps share identifiers (small integers)
1269 to RemoteReferences that provide RIBucketReader. This must be called
1273 """I start the download. This process involves retrieving data and
1274 hash chains from the shareholders, using the hashes to validate the
1275 data, decoding the shares into segments, decrypting the segments,
1276 then writing the resulting plaintext to the output file.
1278 I return a Deferred that will fire (with self) when the download is
1282 class IDownloadTarget(Interface):
1283 # Note that if the IDownloadTarget is also an IConsumer, the downloader
1284 # will register itself as a producer. This allows the target to invoke
1285 # downloader.pauseProducing, resumeProducing, and stopProducing.
1287 """Called before any calls to write() or close(). If an error
1288 occurs before any data is available, fail() may be called without
1289 a previous call to open().
1291 'size' is the length of the file being downloaded, in bytes."""
1294 """Output some data to the target."""
1296 """Inform the target that there is no more data to be written."""
1298 """fail() is called to indicate that the download has failed. 'why'
1299 is a Failure object indicating what went wrong. No further methods
1300 will be invoked on the IDownloadTarget after fail()."""
1301 def register_canceller(cb):
1302 """The FileDownloader uses this to register a no-argument function
1303 that the target can call to cancel the download. Once this canceller
1304 is invoked, no further calls to write() or close() will be made."""
1306 """When the FileDownloader is done, this finish() function will be
1307 called. Whatever it returns will be returned to the invoker of
1308 Downloader.download.
1311 class IDownloader(Interface):
1312 def download(uri, target):
1313 """Perform a CHK download, sending the data to the given target.
1314 'target' must provide IDownloadTarget.
1316 Returns a Deferred that fires (with the results of target.finish)
1317 when the download is finished, or errbacks if something went wrong."""
1319 class IEncryptedUploadable(Interface):
1320 def set_upload_status(upload_status):
1321 """Provide an IUploadStatus object that should be filled with status
1322 information. The IEncryptedUploadable is responsible for setting
1323 key-determination progress ('chk'), size, storage_index, and
1324 ciphertext-fetch progress. It may delegate some of this
1325 responsibility to others, in particular to the IUploadable."""
1328 """This behaves just like IUploadable.get_size()."""
1330 def get_all_encoding_parameters():
1331 """Return a Deferred that fires with a tuple of
1332 (k,happy,n,segment_size). The segment_size will be used as-is, and
1333 must match the following constraints: it must be a multiple of k, and
1334 it shouldn't be unreasonably larger than the file size (if
1335 segment_size is larger than filesize, the difference must be stored
1338 This usually passes through to the IUploadable method of the same
1341 The encoder strictly obeys the values returned by this method. To
1342 make an upload use non-default encoding parameters, you must arrange
1343 to control the values that this method returns.
1346 def get_storage_index():
1347 """Return a Deferred that fires with a 16-byte storage index.
1350 def read_encrypted(length, hash_only):
1351 """This behaves just like IUploadable.read(), but returns crypttext
1352 instead of plaintext. If hash_only is True, then this discards the
1353 data (and returns an empty list); this improves efficiency when
1354 resuming an interrupted upload (where we need to compute the
1355 plaintext hashes, but don't need the redundant encrypted data)."""
1357 def get_plaintext_hashtree_leaves(first, last, num_segments):
1358 """Get the leaf nodes of a merkle hash tree over the plaintext
1359 segments, i.e. get the tagged hashes of the given segments. The
1360 segment size is expected to be generated by the IEncryptedUploadable
1361 before any plaintext is read or ciphertext produced, so that the
1362 segment hashes can be generated with only a single pass.
1364 This returns a Deferred which fires with a sequence of hashes, using:
1366 tuple(segment_hashes[first:last])
1368 'num_segments' is used to assert that the number of segments that the
1369 IEncryptedUploadable handled matches the number of segments that the
1370 encoder was expecting.
1372 This method must not be called until the final byte has been read
1373 from read_encrypted(). Once this method is called, read_encrypted()
1374 can never be called again.
1377 def get_plaintext_hash():
1378 """Get the hash of the whole plaintext.
1380 This returns a Deferred which fires with a tagged SHA-256 hash of the
1381 whole plaintext, obtained from hashutil.plaintext_hash(data).
1385 """Just like IUploadable.close()."""
1387 class IUploadable(Interface):
1388 def set_upload_status(upload_status):
1389 """Provide an IUploadStatus object that should be filled with status
1390 information. The IUploadable is responsible for setting
1391 key-determination progress ('chk')."""
1393 def set_default_encoding_parameters(params):
1394 """Set the default encoding parameters, which must be a dict mapping
1395 strings to ints. The meaningful keys are 'k', 'happy', 'n', and
1396 'max_segment_size'. These might have an influence on the final
1397 encoding parameters returned by get_all_encoding_parameters(), if the
1398 Uploadable doesn't have more specific preferences.
1400 This call is optional: if it is not used, the Uploadable will use
1401 some built-in defaults. If used, this method must be called before
1402 any other IUploadable methods to have any effect.
1406 """Return a Deferred that will fire with the length of the data to be
1407 uploaded, in bytes. This will be called before the data is actually
1408 used, to compute encoding parameters.
1411 def get_all_encoding_parameters():
1412 """Return a Deferred that fires with a tuple of
1413 (k,happy,n,segment_size). The segment_size will be used as-is, and
1414 must match the following constraints: it must be a multiple of k, and
1415 it shouldn't be unreasonably larger than the file size (if
1416 segment_size is larger than filesize, the difference must be stored
1419 The relative values of k and n allow some IUploadables to request
1420 better redundancy than others (in exchange for consuming more space
1423 Larger values of segment_size reduce hash overhead, while smaller
1424 values reduce memory footprint and cause data to be delivered in
1425 smaller pieces (which may provide a smoother and more predictable
1426 download experience).
1428 The encoder strictly obeys the values returned by this method. To
1429 make an upload use non-default encoding parameters, you must arrange
1430 to control the values that this method returns. One way to influence
1431 them may be to call set_encoding_parameters() before calling
1432 get_all_encoding_parameters().
1435 def get_encryption_key():
1436 """Return a Deferred that fires with a 16-byte AES key. This key will
1437 be used to encrypt the data. The key will also be hashed to derive
1440 Uploadables which want to achieve convergence should hash their file
1441 contents and the serialized_encoding_parameters to form the key
1442 (which of course requires a full pass over the data). Uploadables can
1443 use the upload.ConvergentUploadMixin class to achieve this
1446 Uploadables which do not care about convergence (or do not wish to
1447 make multiple passes over the data) can simply return a
1448 strongly-random 16 byte string.
1450 get_encryption_key() may be called multiple times: the IUploadable is
1451 required to return the same value each time.
1455 """Return a Deferred that fires with a list of strings (perhaps with
1456 only a single element) which, when concatenated together, contain the
1457 next 'length' bytes of data. If EOF is near, this may provide fewer
1458 than 'length' bytes. The total number of bytes provided by read()
1459 before it signals EOF must equal the size provided by get_size().
1461 If the data must be acquired through multiple internal read
1462 operations, returning a list instead of a single string may help to
1463 reduce string copies.
1465 'length' will typically be equal to (min(get_size(),1MB)/req_shares),
1466 so a 10kB file means length=3kB, 100kB file means length=30kB,
1467 and >=1MB file means length=300kB.
1469 This method provides for a single full pass through the data. Later
1470 use cases may desire multiple passes or access to only parts of the
1471 data (such as a mutable file making small edits-in-place). This API
1472 will be expanded once those use cases are better understood.
1476 """The upload is finished, and whatever filehandle was in use may be
1479 class IUploadResults(Interface):
1480 """I am returned by upload() methods. I contain a number of public
1481 attributes which can be read to determine the results of the upload. Some
1482 of these are functional, some are timing information. All of these may be
1485 .file_size : the size of the file, in bytes
1486 .uri : the CHK read-cap for the file
1487 .ciphertext_fetched : how many bytes were fetched by the helper
1488 .sharemap : dict mapping share number to placement string
1489 .servermap : dict mapping server peerid to a set of share numbers
1490 .timings : dict of timing information, mapping name to seconds (float)
1491 total : total upload time, start to finish
1492 storage_index : time to compute the storage index
1493 peer_selection : time to decide which peers will be used
1494 contacting_helper : initial helper query to upload/no-upload decision
1495 existence_check : helper pre-upload existence check
1496 helper_total : initial helper query to helper finished pushing
1497 cumulative_fetch : helper waiting for ciphertext requests
1498 total_fetch : helper start to last ciphertext response
1499 cumulative_encoding : just time spent in zfec
1500 cumulative_sending : just time spent waiting for storage servers
1501 hashes_and_close : last segment push to shareholder close
1502 total_encode_and_push : first encode to shareholder close
1506 class IDownloadResults(Interface):
1507 """I am created internally by download() methods. I contain a number of
1508 public attributes which contain details about the download process.::
1510 .file_size : the size of the file, in bytes
1511 .servers_used : set of server peerids that were used during download
1512 .server_problems : dict mapping server peerid to a problem string. Only
1513 servers that had problems (bad hashes, disconnects) are
1515 .servermap : dict mapping server peerid to a set of share numbers. Only
1516 servers that had any shares are listed here.
1517 .timings : dict of timing information, mapping name to seconds (float)
1518 peer_selection : time to ask servers about shares
1519 servers_peer_selection : dict of peerid to DYHB-query time
1520 uri_extension : time to fetch a copy of the URI extension block
1521 hashtrees : time to fetch the hash trees
1522 segments : time to fetch, decode, and deliver segments
1523 cumulative_fetch : time spent waiting for storage servers
1524 cumulative_decode : just time spent in zfec
1525 cumulative_decrypt : just time spent in decryption
1526 total : total download time, start to finish
1527 fetch_per_server : dict of peerid to list of per-segment fetch times
1531 class IUploader(Interface):
1532 def upload(uploadable):
1533 """Upload the file. 'uploadable' must impement IUploadable. This
1534 returns a Deferred which fires with an UploadResults instance, from
1535 which the URI of the file can be obtained as results.uri ."""
1537 def upload_ssk(write_capability, new_version, uploadable):
1538 """TODO: how should this work?"""
1540 class ICheckable(Interface):
1541 def check(monitor, verify=False):
1542 """Check upon my health, optionally repairing any problems.
1544 This returns a Deferred that fires with an instance that provides
1545 ICheckerResults, or None if the object is non-distributed (i.e. LIT
1548 The monitor will be checked periodically to see if the operation has
1549 been cancelled. If so, no new queries will be sent, and the Deferred
1550 will fire (with a OperationCancelledError) immediately.
1552 Filenodes and dirnodes (which provide IFilesystemNode) are also
1553 checkable. Instances that represent verifier-caps will be checkable
1554 but not downloadable. Some objects (like LIT files) do not actually
1555 live in the grid, and their checkers return None (non-distributed
1556 files are always healthy).
1558 If verify=False, a relatively lightweight check will be performed: I
1559 will ask all servers if they have a share for me, and I will believe
1560 whatever they say. If there are at least N distinct shares on the
1561 grid, my results will indicate r.is_healthy()==True. This requires a
1562 roundtrip to each server, but does not transfer very much data, so
1563 the network bandwidth is fairly low.
1565 If verify=True, a more resource-intensive check will be performed:
1566 every share will be downloaded, and the hashes will be validated on
1567 every bit. I will ignore any shares that failed their hash checks. If
1568 there are at least N distinct valid shares on the grid, my results
1569 will indicate r.is_healthy()==True. This requires N/k times as much
1570 download bandwidth (and server disk IO) as a regular download. If a
1571 storage server is holding a corrupt share, or is experiencing memory
1572 failures during retrieval, or is malicious or buggy, then
1573 verification will detect the problem, but checking will not.
1575 TODO: any problems seen during checking will be reported to the
1576 health-manager.furl, a centralized object which is responsible for
1577 figuring out why files are unhealthy so corrective action can be
1581 def check_and_repair(monitor, verify=False):
1582 """Like check(), but if the file/directory is not healthy, attempt to
1585 Any non-healthy result will cause an immediate repair operation, to
1586 generate and upload new shares. After repair, the file will be as
1587 healthy as we can make it. Details about what sort of repair is done
1588 will be put in the check-and-repair results. The Deferred will not
1589 fire until the repair is complete.
1591 This returns a Deferred which fires with an instance of
1592 ICheckAndRepairResults."""
1594 class IDeepCheckable(Interface):
1595 def start_deep_check(verify=False):
1596 """Check upon the health of me and everything I can reach.
1598 This is a recursive form of check(), useable only on dirnodes.
1600 I return a Monitor, with results that are an IDeepCheckResults
1604 def start_deep_check_and_repair(verify=False):
1605 """Check upon the health of me and everything I can reach. Repair
1606 anything that isn't healthy.
1608 This is a recursive form of check_and_repair(), useable only on
1611 I return a Monitor, with results that are an
1612 IDeepCheckAndRepairResults object.
1615 class ICheckerResults(Interface):
1616 """I contain the detailed results of a check/verify operation.
1619 def get_storage_index():
1620 """Return a string with the (binary) storage index."""
1621 def get_storage_index_string():
1622 """Return a string with the (printable) abbreviated storage index."""
1624 """Return the (string) URI of the object that was checked."""
1627 """Return a boolean, True if the file/dir is fully healthy, False if
1628 it is damaged in any way. Non-distributed LIT files always return
1631 def is_recoverable():
1632 """Return a boolean, True if the file/dir can be recovered, False if
1633 not. Unrecoverable files are obviously unhealthy. Non-distributed LIT
1634 files always return True."""
1636 def needs_rebalancing():
1637 """Return a boolean, True if the file/dir's reliability could be
1638 improved by moving shares to new servers. Non-distributed LIT files
1639 always returne False."""
1643 """Return a dictionary that describes the state of the file/dir.
1644 Non-distributed LIT files always return an empty dictionary. Normal
1645 files and directories return a dictionary with the following keys
1646 (note that these use base32-encoded strings rather than binary ones)
1647 (also note that for mutable files, these counts are for the 'best'
1650 count-shares-good: the number of distinct good shares that were found
1651 count-shares-needed: 'k', the number of shares required for recovery
1652 count-shares-expected: 'N', the number of total shares generated
1653 count-good-share-hosts: the number of distinct storage servers with
1654 good shares. If this number is less than
1655 count-shares-good, then some shares are
1656 doubled up, increasing the correlation of
1657 failures. This indicates that one or more
1658 shares should be moved to an otherwise unused
1659 server, if one is available.
1660 count-corrupt-shares: the number of shares with integrity failures
1661 list-corrupt-shares: a list of 'share locators', one for each share
1662 that was found to be corrupt. Each share
1663 locator is a list of (serverid, storage_index,
1665 servers-responding: list of (binary) storage server identifiers,
1666 one for each server which responded to the share
1668 sharemap: dict mapping share identifier to list of serverids
1669 (binary strings). This indicates which servers are holding
1670 which shares. For immutable files, the shareid is an
1671 integer (the share number, from 0 to N-1). For mutable
1672 files, it is a string of the form 'seq%d-%s-sh%d',
1673 containing the sequence number, the roothash, and the
1676 The following keys are most relevant for mutable files, but immutable
1677 files will provide sensible values too::
1679 count-wrong-shares: the number of shares for versions other than the
1680 'best' one (which is defined as being the
1681 recoverable version with the highest sequence
1682 number, then the highest roothash). These are
1683 either leftover shares from an older version
1684 (perhaps on a server that was offline when an
1685 update occurred), shares from an unrecoverable
1686 newer version, or shares from an alternate
1687 current version that results from an
1688 uncoordinated write collision. For a healthy
1689 file, this will equal 0.
1691 count-recoverable-versions: the number of recoverable versions of
1692 the file. For a healthy file, this will
1695 count-unrecoverable-versions: the number of unrecoverable versions
1696 of the file. For a healthy file, this
1702 """Return a string with a brief (one-line) summary of the results."""
1705 """Return a list of strings with more detailed results."""
1707 class ICheckAndRepairResults(Interface):
1708 """I contain the detailed results of a check/verify/repair operation.
1710 The IFilesystemNode.check()/verify()/repair() methods all return
1711 instances that provide ICheckAndRepairResults.
1714 def get_storage_index():
1715 """Return a string with the (binary) storage index."""
1716 def get_storage_index_string():
1717 """Return a string with the (printable) abbreviated storage index."""
1718 def get_repair_attempted():
1719 """Return a boolean, True if a repair was attempted."""
1720 def get_repair_successful():
1721 """Return a boolean, True if repair was attempted and the file/dir
1722 was fully healthy afterwards. False if no repair was attempted or if
1723 a repair attempt failed."""
1724 def get_pre_repair_results():
1725 """Return an ICheckerResults instance that describes the state of the
1726 file/dir before any repair was attempted."""
1727 def get_post_repair_results():
1728 """Return an ICheckerResults instance that describes the state of the
1729 file/dir after any repair was attempted. If no repair was attempted,
1730 the pre-repair and post-repair results will be identical."""
1733 class IDeepCheckResults(Interface):
1734 """I contain the results of a deep-check operation.
1736 This is returned by a call to ICheckable.deep_check().
1739 def get_root_storage_index_string():
1740 """Return the storage index (abbreviated human-readable string) of
1741 the first object checked."""
1743 """Return a dictionary with the following keys::
1745 count-objects-checked: count of how many objects were checked
1746 count-objects-healthy: how many of those objects were completely
1748 count-objects-unhealthy: how many were damaged in some way
1749 count-objects-unrecoverable: how many were unrecoverable
1750 count-corrupt-shares: how many shares were found to have
1751 corruption, summed over all objects
1755 def get_corrupt_shares():
1756 """Return a set of (serverid, storage_index, sharenum) for all shares
1757 that were found to be corrupt. Both serverid and storage_index are
1760 def get_all_results():
1761 """Return a dictionary mapping pathname (a tuple of strings, ready to
1762 be slash-joined) to an ICheckerResults instance, one for each object
1763 that was checked."""
1765 def get_results_for_storage_index(storage_index):
1766 """Retrive the ICheckerResults instance for the given (binary)
1767 storage index. Raises KeyError if there are no results for that
1771 """Return a dictionary with the same keys as
1772 IDirectoryNode.deep_stats()."""
1774 class IDeepCheckAndRepairResults(Interface):
1775 """I contain the results of a deep-check-and-repair operation.
1777 This is returned by a call to ICheckable.deep_check_and_repair().
1780 def get_root_storage_index_string():
1781 """Return the storage index (abbreviated human-readable string) of
1782 the first object checked."""
1784 """Return a dictionary with the following keys::
1786 count-objects-checked: count of how many objects were checked
1787 count-objects-healthy-pre-repair: how many of those objects were
1788 completely healthy (before any
1790 count-objects-unhealthy-pre-repair: how many were damaged in
1792 count-objects-unrecoverable-pre-repair: how many were unrecoverable
1793 count-objects-healthy-post-repair: how many of those objects were
1794 completely healthy (after any
1796 count-objects-unhealthy-post-repair: how many were damaged in
1798 count-objects-unrecoverable-post-repair: how many were
1800 count-repairs-attempted: repairs were attempted on this many
1801 objects. The count-repairs- keys will
1802 always be provided, however unless
1803 repair=true is present, they will all
1805 count-repairs-successful: how many repairs resulted in healthy
1807 count-repairs-unsuccessful: how many repairs resulted did not
1808 results in completely healthy objects
1809 count-corrupt-shares-pre-repair: how many shares were found to
1810 have corruption, summed over all
1811 objects examined (before any
1813 count-corrupt-shares-post-repair: how many shares were found to
1814 have corruption, summed over all
1815 objects examined (after any
1820 """Return a dictionary with the same keys as
1821 IDirectoryNode.deep_stats()."""
1823 def get_corrupt_shares():
1824 """Return a set of (serverid, storage_index, sharenum) for all shares
1825 that were found to be corrupt before any repair was attempted. Both
1826 serverid and storage_index are binary.
1828 def get_remaining_corrupt_shares():
1829 """Return a set of (serverid, storage_index, sharenum) for all shares
1830 that were found to be corrupt after any repair was completed. Both
1831 serverid and storage_index are binary. These are shares that need
1832 manual inspection and probably deletion.
1834 def get_all_results():
1835 """Return a dictionary mapping pathname (a tuple of strings, ready to
1836 be slash-joined) to an ICheckAndRepairResults instance, one for each
1837 object that was checked."""
1840 class IRepairable(Interface):
1841 def repair(checker_results):
1842 """Attempt to repair the given object. Returns a Deferred that fires
1843 with a IRepairResults object.
1845 I must be called with an object that implements ICheckerResults, as
1846 proof that you have actually discovered a problem with this file. I
1847 will use the data in the checker results to guide the repair process,
1848 such as which servers provided bad data and should therefore be
1849 avoided. The ICheckerResults object is inside the
1850 ICheckAndRepairResults object, which is returned by the
1851 ICheckable.check() method::
1853 d = filenode.check(repair=False)
1854 def _got_results(check_and_repair_results):
1855 check_results = check_and_repair_results.get_pre_repair_results()
1856 return filenode.repair(check_results)
1857 d.addCallback(_got_results)
1861 class IRepairResults(Interface):
1862 """I contain the results of a repair operation."""
1865 class IClient(Interface):
1866 def upload(uploadable):
1867 """Upload some data into a CHK, get back the UploadResults for it.
1868 @param uploadable: something that implements IUploadable
1869 @return: a Deferred that fires with the UploadResults instance.
1870 To get the URI for this file, use results.uri .
1873 def create_mutable_file(contents=""):
1874 """Create a new mutable file with contents, get back the URI string.
1875 @param contents: the initial contents to place in the file.
1876 @return: a Deferred that fires with tne (string) SSK URI for the new
1880 def create_empty_dirnode():
1881 """Create a new dirnode, empty and unattached.
1882 @return: a Deferred that fires with the new IDirectoryNode instance.
1885 def create_node_from_uri(uri):
1886 """Create a new IFilesystemNode instance from the uri, synchronously.
1887 @param uri: a string or IURI-providing instance. This could be for a
1888 LiteralFileNode, a CHK file node, a mutable file node, or
1890 @return: an instance that provides IFilesystemNode (or more usefully one
1891 of its subclasses). File-specifying URIs will result in
1892 IFileNode or IMutableFileNode -providing instances, like
1893 FileNode, LiteralFileNode, or MutableFileNode.
1894 Directory-specifying URIs will result in
1895 IDirectoryNode-providing instances, like NewDirectoryNode.
1898 class IClientStatus(Interface):
1899 def list_all_uploads():
1900 """Return a list of uploader objects, one for each upload which
1901 currently has an object available (tracked with weakrefs). This is
1902 intended for debugging purposes."""
1903 def list_active_uploads():
1904 """Return a list of active IUploadStatus objects."""
1905 def list_recent_uploads():
1906 """Return a list of IUploadStatus objects for the most recently
1909 def list_all_downloads():
1910 """Return a list of downloader objects, one for each download which
1911 currently has an object available (tracked with weakrefs). This is
1912 intended for debugging purposes."""
1913 def list_active_downloads():
1914 """Return a list of active IDownloadStatus objects."""
1915 def list_recent_downloads():
1916 """Return a list of IDownloadStatus objects for the most recently
1917 started downloads."""
1919 class IUploadStatus(Interface):
1921 """Return a timestamp (float with seconds since epoch) indicating
1922 when the operation was started."""
1923 def get_storage_index():
1924 """Return a string with the (binary) storage index in use on this
1925 upload. Returns None if the storage index has not yet been
1928 """Return an integer with the number of bytes that will eventually
1929 be uploaded for this file. Returns None if the size is not yet known.
1932 """Return True if this upload is using a Helper, False if not."""
1934 """Return a string describing the current state of the upload
1937 """Returns a tuple of floats, (chk, ciphertext, encode_and_push),
1938 each from 0.0 to 1.0 . 'chk' describes how much progress has been
1939 made towards hashing the file to determine a CHK encryption key: if
1940 non-convergent encryption is in use, this will be trivial, otherwise
1941 the whole file must be hashed. 'ciphertext' describes how much of the
1942 ciphertext has been pushed to the helper, and is '1.0' for non-helper
1943 uploads. 'encode_and_push' describes how much of the encode-and-push
1944 process has finished: for helper uploads this is dependent upon the
1945 helper providing progress reports. It might be reasonable to add all
1946 three numbers and report the sum to the user."""
1948 """Return True if the upload is currently active, False if not."""
1950 """Return an instance of UploadResults (which contains timing and
1951 sharemap information). Might return None if the upload is not yet
1954 """Each upload status gets a unique number: this method returns that
1955 number. This provides a handle to this particular upload, so a web
1956 page can generate a suitable hyperlink."""
1958 class IDownloadStatus(Interface):
1960 """Return a timestamp (float with seconds since epoch) indicating
1961 when the operation was started."""
1962 def get_storage_index():
1963 """Return a string with the (binary) storage index in use on this
1964 download. This may be None if there is no storage index (i.e. LIT
1967 """Return an integer with the number of bytes that will eventually be
1968 retrieved for this file. Returns None if the size is not yet known.
1971 """Return True if this download is using a Helper, False if not."""
1973 """Return a string describing the current state of the download
1976 """Returns a float (from 0.0 to 1.0) describing the amount of the
1977 download that has completed. This value will remain at 0.0 until the
1978 first byte of plaintext is pushed to the download target."""
1980 """Return True if the download is currently active, False if not."""
1982 """Each download status gets a unique number: this method returns
1983 that number. This provides a handle to this particular download, so a
1984 web page can generate a suitable hyperlink."""
1986 class IServermapUpdaterStatus(Interface):
1988 class IPublishStatus(Interface):
1990 class IRetrieveStatus(Interface):
1993 class NotCapableError(Exception):
1994 """You have tried to write to a read-only node."""
1996 class BadWriteEnablerError(Exception):
1999 class RIControlClient(RemoteInterface):
2001 def wait_for_client_connections(num_clients=int):
2002 """Do not return until we have connections to at least NUM_CLIENTS
2006 def upload_from_file_to_uri(filename=str, convergence=ChoiceOf(None, StringConstraint(2**20))):
2007 """Upload a file to the grid. This accepts a filename (which must be
2008 absolute) that points to a file on the node's local disk. The node will
2009 read the contents of this file, upload it to the grid, then return the
2010 URI at which it was uploaded. If convergence is None then a random
2011 encryption key will be used, else the plaintext will be hashed, then
2012 that hash will be mixed together with the "convergence" string to form
2017 def download_from_uri_to_file(uri=URI, filename=str):
2018 """Download a file from the grid, placing it on the node's local disk
2019 at the given filename (which must be absolute[?]). Returns the
2020 absolute filename where the file was written."""
2025 def get_memory_usage():
2026 """Return a dict describes the amount of memory currently in use. The
2027 keys are 'VmPeak', 'VmSize', and 'VmData'. The values are integers,
2028 measuring memory consupmtion in bytes."""
2029 return DictOf(str, int)
2031 def speed_test(count=int, size=int, mutable=Any()):
2032 """Write 'count' tempfiles to disk, all of the given size. Measure
2033 how long (in seconds) it takes to upload them all to the servers.
2034 Then measure how long it takes to download all of them. If 'mutable'
2035 is 'create', time creation of mutable files. If 'mutable' is
2036 'upload', then time access to the same mutable file instead of
2039 Returns a tuple of (upload_time, download_time).
2041 return (float, float)
2043 def measure_peer_response_time():
2044 """Send a short message to each connected peer, and measure the time
2045 it takes for them to respond to it. This is a rough measure of the
2046 application-level round trip time.
2048 @return: a dictionary mapping peerid to a float (RTT time in seconds)
2051 return DictOf(Nodeid, float)
2053 UploadResults = Any() #DictOf(str, str)
2055 class RIEncryptedUploadable(RemoteInterface):
2056 __remote_name__ = "RIEncryptedUploadable.tahoe.allmydata.com"
2061 def get_all_encoding_parameters():
2062 return (int, int, int, long)
2064 def read_encrypted(offset=Offset, length=ReadSize):
2067 def get_plaintext_hashtree_leaves(first=int, last=int, num_segments=int):
2070 def get_plaintext_hash():
2077 class RICHKUploadHelper(RemoteInterface):
2078 __remote_name__ = "RIUploadHelper.tahoe.allmydata.com"
2080 def upload(reader=RIEncryptedUploadable):
2081 return UploadResults
2084 class RIHelper(RemoteInterface):
2085 __remote_name__ = "RIHelper.tahoe.allmydata.com"
2087 def upload_chk(si=StorageIndex):
2088 """See if a file with a given storage index needs uploading. The
2089 helper will ask the appropriate storage servers to see if the file
2090 has already been uploaded. If so, the helper will return a set of
2091 'upload results' that includes whatever hashes are needed to build
2092 the read-cap, and perhaps a truncated sharemap.
2094 If the file has not yet been uploaded (or if it was only partially
2095 uploaded), the helper will return an empty upload-results dictionary
2096 and also an RICHKUploadHelper object that will take care of the
2097 upload process. The client should call upload() on this object and
2098 pass it a reference to an RIEncryptedUploadable object that will
2099 provide ciphertext. When the upload is finished, the upload() method
2100 will finish and return the upload results.
2102 return (UploadResults, ChoiceOf(RICHKUploadHelper, None))
2105 class RIStatsProvider(RemoteInterface):
2106 __remote_name__ = "RIStatsProvider.tahoe.allmydata.com"
2108 Provides access to statistics and monitoring information.
2113 returns a dictionary containing 'counters' and 'stats', each a dictionary
2114 with string counter/stat name keys, and numeric values. counters are
2115 monotonically increasing measures of work done, and stats are instantaneous
2116 measures (potentially time averaged internally)
2118 return DictOf(str, DictOf(str, ChoiceOf(float, int, long)))
2120 class RIStatsGatherer(RemoteInterface):
2121 __remote_name__ = "RIStatsGatherer.tahoe.allmydata.com"
2123 Provides a monitoring service for centralised collection of stats
2126 def provide(provider=RIStatsProvider, nickname=str):
2128 @param provider: a stats collector instance which should be polled
2129 periodically by the gatherer to collect stats.
2130 @param nickname: a name useful to identify the provided client
2135 class IStatsProducer(Interface):
2138 returns a dictionary, with str keys representing the names of stats
2139 to be monitored, and numeric values.
2142 class RIKeyGenerator(RemoteInterface):
2143 __remote_name__ = "RIKeyGenerator.tahoe.allmydata.com"
2145 Provides a service offering to make RSA key pairs.
2148 def get_rsa_key_pair(key_size=int):
2150 @param key_size: the size of the signature key.
2151 @return: tuple(verifying_key, signing_key)
2153 return TupleOf(str, str)
2156 class FileTooLargeError(Exception):