Compare commits
134 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
b1cc3e404d | ||
|
|
b16425b966 | ||
|
|
f04f9216e7 | ||
|
|
e7e67e08cf | ||
|
|
29a66d1820 | ||
|
|
08f30d213e | ||
|
|
cf3b4efcaf | ||
|
|
ca991e8eb6 | ||
|
|
8d327b2f4b | ||
|
|
14b828acf5 | ||
|
|
00439572fb | ||
|
|
37bf2f9503 | ||
|
|
e6d04f280e | ||
|
|
033594dcd6 | ||
|
|
c9e99b39db | ||
|
|
3ec3578fe9 | ||
|
|
628ab3426c | ||
|
|
6e296c5c49 | ||
|
|
f0033600ca | ||
|
|
dfc48d3ec4 | ||
|
|
46dd393ad1 | ||
|
|
67a2bcf7e7 | ||
|
|
643f78a8f9 | ||
|
|
7b4617fa6e | ||
|
|
440a1c1a5a | ||
|
|
e0a5698af9 | ||
|
|
667c6a9418 | ||
|
|
426ebe9e55 | ||
|
|
cad52160a4 | ||
|
|
b5a08dcaaa | ||
|
|
9831436a6f | ||
|
|
d7974d2277 | ||
|
|
8009448a20 | ||
|
|
92496b5494 | ||
|
|
e153340e5a | ||
|
|
6ddb575a8d | ||
|
|
b3d85b3dee | ||
|
|
bea727bbd1 | ||
|
|
9091e50b29 | ||
|
|
a0b3b11e63 | ||
|
|
1766ab0fcf | ||
|
|
924534b811 | ||
|
|
5ddbe21740 | ||
|
|
2cf56e3813 | ||
|
|
5a6d4bdf06 | ||
|
|
fb8ecaccad | ||
|
|
348b9201a6 | ||
|
|
b4ab25ffda | ||
|
|
c724ad0d22 | ||
|
|
ff25e9673c | ||
|
|
afcde25c66 | ||
|
|
fb85ebd768 | ||
|
|
870aa9e7de | ||
|
|
73e5246a65 | ||
|
|
83a7594d41 | ||
|
|
3655c1cdd4 | ||
|
|
1543f4a136 | ||
|
|
d6e0b4e5a7 | ||
|
|
5eff744da0 | ||
|
|
a8ae38caae | ||
|
|
23f03cb301 | ||
|
|
1c907dba61 | ||
|
|
86805e711c | ||
|
|
f868375825 | ||
|
|
8f7ba15bfb | ||
|
|
ae25e25d1a | ||
|
|
0f09109d9f | ||
|
|
67951e2c09 | ||
|
|
ad88cb11c5 | ||
|
|
10944c9d86 | ||
|
|
b340dd202e | ||
|
|
c4bfcd0671 | ||
|
|
36bab4873c | ||
|
|
056eac16ae | ||
|
|
038b7f7cc9 | ||
|
|
019d945bf5 | ||
|
|
799731b9e5 | ||
|
|
06f861b665 | ||
|
|
88cd5dcebf | ||
|
|
9949dd29e5 | ||
|
|
75d3ffe549 | ||
|
|
8028fee095 | ||
|
|
bd441bb43e | ||
|
|
10a4d040b4 | ||
|
|
d204c18f7a | ||
|
|
b41162260a | ||
|
|
9cb0b7bcae | ||
|
|
6f951560f5 | ||
|
|
5d8ad3eb9c | ||
|
|
5b04f30433 | ||
|
|
078355866b | ||
|
|
1805dd530f | ||
|
|
2055d2e652 | ||
|
|
63d4b33fcf | ||
|
|
19c1c0e32e | ||
|
|
088f141a17 | ||
|
|
758714796c | ||
|
|
ed3563b69e | ||
|
|
db11d7248a | ||
|
|
68abb41a9b | ||
|
|
7333c60a00 | ||
|
|
f62e35b87a | ||
|
|
5652e6f751 | ||
|
|
fa428a337b | ||
|
|
e0f0e24c2d | ||
|
|
1aa1093d28 | ||
|
|
f4f9847100 | ||
|
|
83b0d39470 | ||
|
|
b7772ebfe3 | ||
|
|
e449699cc1 | ||
|
|
7d345d4817 | ||
|
|
3c03b9e581 | ||
|
|
f6990413f7 | ||
|
|
3f7f6c6a1d | ||
|
|
05eac5f7ca | ||
|
|
1f385a8224 | ||
|
|
b42583c8bf | ||
|
|
45ce89d41a | ||
|
|
a20203df14 | ||
|
|
d4ebfff511 | ||
|
|
e310d23e36 | ||
|
|
7e7f6811b4 | ||
|
|
daa83089b3 | ||
|
|
7ef01bd895 | ||
|
|
05ed406b31 | ||
|
|
92cac2f002 | ||
|
|
a22bf1e2bf | ||
|
|
7bcaf9264a | ||
|
|
c1db98f9ae | ||
|
|
40c5ff1bfe | ||
|
|
ebda3c73ae | ||
|
|
03f8d08574 | ||
|
|
4ff5ee2b99 | ||
|
|
2b1b4a8339 |
@@ -1 +1 @@
|
||||
0.7.7: QmcTcsTvfaeEBRFo1TkFgT8sRmgi1n1LTZpecfVP8fzpGD
|
||||
0.9.3: QmTbxNB1NwDesLmKTscr4udL2tVP7MaxvXnD1D9yX7g3PN
|
||||
|
||||
26
.travis.yml
26
.travis.yml
@@ -1,24 +1,32 @@
|
||||
os:
|
||||
- linux
|
||||
- osx
|
||||
|
||||
language: go
|
||||
|
||||
go:
|
||||
- 1.7
|
||||
- 1.11.x
|
||||
|
||||
install: true
|
||||
env:
|
||||
global:
|
||||
- GOTFLAGS="-race"
|
||||
matrix:
|
||||
- BUILD_DEPTYPE=gx
|
||||
- BUILD_DEPTYPE=gomod
|
||||
|
||||
before_install:
|
||||
- make deps
|
||||
|
||||
# disable travis install
|
||||
install:
|
||||
- true
|
||||
|
||||
script:
|
||||
- go vet
|
||||
- $GOPATH/bin/goveralls -service="travis-ci"
|
||||
- bash <(curl -s https://raw.githubusercontent.com/ipfs/ci-helpers/master/travis-ci/run-standard-tests.sh)
|
||||
|
||||
|
||||
cache:
|
||||
directories:
|
||||
- $GOPATH/src/gx
|
||||
directories:
|
||||
- $GOPATH/src/gx
|
||||
- $GOPATH/pkg/mod
|
||||
- $HOME/.cache/go-build
|
||||
|
||||
notifications:
|
||||
email: false
|
||||
|
||||
59
README.md
59
README.md
@@ -4,13 +4,15 @@ go-cid
|
||||
[](http://ipn.io)
|
||||
[](http://ipfs.io/)
|
||||
[](http://webchat.freenode.net/?channels=%23ipfs)
|
||||
[](https://github.com/RichardLitt/standard-readme)
|
||||
[](https://godoc.org/github.com/ipfs/go-cid)
|
||||
[](https://coveralls.io/github/ipfs/go-cid?branch=master)
|
||||
[](https://travis-ci.org/ipfs/go-cid)
|
||||
|
||||
> A package to handle content IDs in go.
|
||||
> A package to handle content IDs in Go.
|
||||
|
||||
This is an implementation in go of the [CID spec](https://github.com/ipld/cid).
|
||||
It is used in go-ipfs and related packages to refer to a typed hunk of data.
|
||||
This is an implementation in Go of the [CID spec](https://github.com/ipld/cid).
|
||||
It is used in `go-ipfs` and related packages to refer to a typed hunk of data.
|
||||
|
||||
|
||||
## Table of Contents
|
||||
@@ -23,29 +25,56 @@ It is used in go-ipfs and related packages to refer to a typed hunk of data.
|
||||
|
||||
## Install
|
||||
|
||||
`go-cid` is a standard Go module which can be installed with:
|
||||
|
||||
```sh
|
||||
go get github.com/ipfs/go-cid
|
||||
```
|
||||
|
||||
Note that `go-cid` is packaged with Gx, so it is recommended to use Gx to install and use it (see Usage section).
|
||||
|
||||
## Usage
|
||||
|
||||
### Using Gx and Gx-go
|
||||
|
||||
This module is packaged with [Gx](https://github.com/whyrusleeping/gx). In order to use it in your own project it is recommended that you:
|
||||
|
||||
```sh
|
||||
go get -u github.com/whyrusleeping/gx
|
||||
go get -u github.com/whyrusleeping/gx-go
|
||||
cd <your-project-repository>
|
||||
gx init
|
||||
gx import github.com/ipfs/go-cid
|
||||
gx install --global
|
||||
gx-go --rewrite
|
||||
```
|
||||
|
||||
Please check [Gx](https://github.com/whyrusleeping/gx) and [Gx-go](https://github.com/whyrusleeping/gx-go) documentation for more information.
|
||||
|
||||
### Running tests
|
||||
|
||||
Before running tests, please run:
|
||||
|
||||
```sh
|
||||
make deps
|
||||
```
|
||||
|
||||
## Examples
|
||||
This will make sure that dependencies are rewritten to known working versions.
|
||||
|
||||
To use CIDs, import it in your code like:
|
||||
```go
|
||||
import "github.com/ipfs/go-cid"
|
||||
```
|
||||
### Examples
|
||||
|
||||
Then, depending on how you want to use it, something like one of the following examples should work:
|
||||
#### Parsing string input from users
|
||||
|
||||
### Parsing string input from users
|
||||
```go
|
||||
// Create a cid from a marshaled string
|
||||
c, err := cid.Decode("zdvgqEMYmNeH5fKciougvQcfzMcNjF3Z1tPouJ8C7pc3pe63k")
|
||||
c, err := cid.Decode("bafzbeigai3eoy2ccc7ybwjfz5r3rdxqrinwi4rwytly24tdbh6yk7zslrm")
|
||||
if err != nil {...}
|
||||
|
||||
fmt.Println("Got CID: ", c)
|
||||
```
|
||||
|
||||
### Creating a CID from scratch
|
||||
#### Creating a CID from scratch
|
||||
|
||||
```go
|
||||
// Create a cid manually by specifying the 'prefix' parameters
|
||||
pref := cid.Prefix{
|
||||
@@ -62,7 +91,8 @@ if err != nil {...}
|
||||
fmt.Println("Created CID: ", c)
|
||||
```
|
||||
|
||||
### Check if two CIDs match
|
||||
#### Check if two CIDs match
|
||||
|
||||
```go
|
||||
// To test if two cid's are equivalent, be sure to use the 'Equals' method:
|
||||
if c1.Equals(c2) {
|
||||
@@ -70,7 +100,8 @@ if c1.Equals(c2) {
|
||||
}
|
||||
```
|
||||
|
||||
### Check if some data matches a given CID
|
||||
#### Check if some data matches a given CID
|
||||
|
||||
```go
|
||||
// To check if some data matches a given cid,
|
||||
// Get your CIDs prefix, and use that to sum the data in question:
|
||||
|
||||
168
_rsrch/cidiface/README.md
Normal file
168
_rsrch/cidiface/README.md
Normal file
@@ -0,0 +1,168 @@
|
||||
What golang Kinds work best to implement CIDs?
|
||||
==============================================
|
||||
|
||||
There are many possible ways to implement CIDs. This package explores them.
|
||||
|
||||
### criteria
|
||||
|
||||
There's a couple different criteria to consider:
|
||||
|
||||
- We want the best performance when operating on the type (getters, mostly);
|
||||
- We want to minimize the number of memory allocations we need;
|
||||
- We want types which can be used as map keys, because this is common.
|
||||
|
||||
The priority of these criteria is open to argument, but it's probably
|
||||
mapkeys > minalloc > anythingelse.
|
||||
(Mapkeys and minalloc are also quite entangled, since if we don't pick a
|
||||
representation that can work natively as a map key, we'll end up needing
|
||||
a `KeyRepr()` method which gives us something that does work as a map key,
|
||||
an that will almost certainly involve a malloc itself.)
|
||||
|
||||
### options
|
||||
|
||||
There are quite a few different ways to go:
|
||||
|
||||
- Option A: CIDs as a struct; multihash as bytes.
|
||||
- Option B: CIDs as a string.
|
||||
- Option C: CIDs as an interface with multiple implementors.
|
||||
- Option D: CIDs as a struct; multihash also as a struct or string.
|
||||
- Option E: CIDs as a struct; content as strings plus offsets.
|
||||
- Option F: CIDs as a struct wrapping only a string.
|
||||
|
||||
The current approach on the master branch is Option A.
|
||||
|
||||
Option D is distinctive from Option A because multihash as bytes transitively
|
||||
causes the CID struct to be non-comparible and thus not suitable for map keys
|
||||
as per https://golang.org/ref/spec#KeyType . (It's also a bit more work to
|
||||
pursue Option D because it's just a bigger splash radius of change; but also,
|
||||
something we might also want to do soon, because we *do* also have these same
|
||||
map-key-usability concerns with multihash alone.)
|
||||
|
||||
Option E is distinctive from Option D because Option E would always maintain
|
||||
the binary format of the cid internally, and so could yield it again without
|
||||
malloc, while still potentially having faster access to components than
|
||||
Option B since it wouldn't need to re-parse varints to access later fields.
|
||||
|
||||
Option F is actually a varation of Option B; it's distinctive from the other
|
||||
struct options because it is proposing *literally* `struct{ x string }` as
|
||||
the type, with no additional fields for components nor offsets.
|
||||
|
||||
Option C is the avoid-choices choice, but note that interfaces are not free;
|
||||
since "minimize mallocs" is one of our major goals, we cannot use interfaces
|
||||
whimsically.
|
||||
|
||||
Note there is no proposal for migrating to `type Cid []bytes`, because that
|
||||
is generally considered to be strictly inferior to `type Cid string`.
|
||||
|
||||
|
||||
Discoveries
|
||||
-----------
|
||||
|
||||
### using interfaces as map keys forgoes a lot of safety checks
|
||||
|
||||
Using interfaces as map keys pushes a bunch of type checking to runtime.
|
||||
E.g., it's totally valid at compile time to push a type which is non-comparable
|
||||
into a map key; it will panic at *runtime* instead of failing at compile-time.
|
||||
|
||||
There's also no way to define equality checks between implementors of the
|
||||
interface: golang will always use its innate concept of comparison for the
|
||||
concrete types. This means its effectively *never safe* to use two different
|
||||
concrete implementations of an interface in the same map; you may add elements
|
||||
which are semantically "equal" in your mind, and end up very confused later
|
||||
when both impls of the same "equal" object have been stored.
|
||||
|
||||
### sentinel values are possible in any impl, but some are clearer than others
|
||||
|
||||
When using `*Cid`, the nil value is a clear sentinel for 'invalid';
|
||||
when using `type Cid string`, the zero value is a clear sentinel;
|
||||
when using `type Cid struct` per Option A or D... the only valid check is
|
||||
for a nil multihash field, since version=0 and codec=0 are both valid values.
|
||||
When using `type Cid struct{string}` per Option F, zero is a clear sentinel.
|
||||
|
||||
### usability as a map key is important
|
||||
|
||||
We already covered this in the criteria section, but for clarity:
|
||||
|
||||
- Option A: ❌
|
||||
- Option B: ✔
|
||||
- Option C: ~ (caveats, and depends on concrete impl)
|
||||
- Option D: ✔
|
||||
- Option E: ✔
|
||||
- Option F: ✔
|
||||
|
||||
### living without offsets requires parsing
|
||||
|
||||
Since CID (and multihash!) are defined using varints, they require parsing;
|
||||
we can't just jump into the string at a known offset in order to yield e.g.
|
||||
the multicodec number.
|
||||
|
||||
In order to get to the 'meat' of the CID (the multihash content), we first
|
||||
must parse:
|
||||
|
||||
- the CID version varint;
|
||||
- the multicodec varint;
|
||||
- the multihash type enum varint;
|
||||
- and the multihash length varint.
|
||||
|
||||
Since there are many applications where we want to jump straight to the
|
||||
multihash content (for example, when doing CAS sharding -- see the
|
||||
[disclaimer](https://github.com/multiformats/multihash#disclaimers) about
|
||||
bias in leading bytes), this overhead may be interesting.
|
||||
|
||||
How much this overhead is significant is hard to say from microbenchmarking;
|
||||
it depends largely on usage patterns. If these traversals are a significant
|
||||
timesink, it would be an argument for Option D/E.
|
||||
If these traversals are *not* a significant timesink, we might be wiser
|
||||
to keep to Option B/F, because keeping a struct full of offsets will add several
|
||||
words of memory usage per CID, and we keep a *lot* of CIDs.
|
||||
|
||||
### interfaces cause boxing which is a significant performance cost
|
||||
|
||||
See `BenchmarkCidMap_CidStr` and friends.
|
||||
|
||||
Long story short: using interfaces *anywhere* will cause the compiler to
|
||||
implicitly generate boxing and unboxing code (e.g. `runtime.convT2E`);
|
||||
this is both another function call, and more concerningly, results in
|
||||
large numbers of unbatchable memory allocations.
|
||||
|
||||
Numbers without context are dangerous, but if you need one: 33%.
|
||||
It's a big deal.
|
||||
|
||||
This means attempts to "use interfaces, but switch to concrete impls when
|
||||
performance is important" are a red herring: it doesn't work that way.
|
||||
|
||||
This is not a general inditement against using interfaces -- but
|
||||
if a situation is at the scale where it's become important to mind whether
|
||||
or not pointers are a performance impact, then that situation also
|
||||
is one where you have to think twice before using interfaces.
|
||||
|
||||
### struct wrappers can be used in place of typedefs with zero overhead
|
||||
|
||||
See `TestSizeOf`.
|
||||
|
||||
Using the `unsafe.Sizeof` feature to inspect what the Go runtime thinks,
|
||||
we can see that `type Foo string` and `type Foo struct{x string}` consume
|
||||
precisely the same amount of memory.
|
||||
|
||||
This is interesting because it means we can choose between either
|
||||
type definition with no significant overhead anywhere we use it:
|
||||
thus, we can choose freely between Option B and Option F based on which
|
||||
we feel is more pleasant to work with.
|
||||
|
||||
Option F (a struct wrapper) means we can prevent casting into our Cid type.
|
||||
Option B (typedef string) can be declared a `const`.
|
||||
Are there any other concerns that would separate the two choices?
|
||||
|
||||
### one way or another: let's get rid of that star
|
||||
|
||||
We should switch completely to handling `Cid` and remove `*Cid` completely.
|
||||
Regardless of whether we do this by migrating to interface, or string
|
||||
implementations, or simply structs with no pointers... once we get there,
|
||||
refactoring to any of the *others* can become a no-op from the perspective
|
||||
of any downstream code that uses CIDs.
|
||||
|
||||
(This means all access via functions, never references to fields -- even if
|
||||
we were to use a struct implementation. *Pretend* there's a interface,
|
||||
in other words.)
|
||||
|
||||
There are probably `gofix` incantations which can help us with this migration.
|
||||
48
_rsrch/cidiface/cid.go
Normal file
48
_rsrch/cidiface/cid.go
Normal file
@@ -0,0 +1,48 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
// Cid represents a self-describing content adressed identifier.
|
||||
//
|
||||
// A CID is composed of:
|
||||
//
|
||||
// - a Version of the CID itself,
|
||||
// - a Multicodec (indicates the encoding of the referenced content),
|
||||
// - and a Multihash (which identifies the referenced content).
|
||||
//
|
||||
// (Note that the Multihash further contains its own version and hash type
|
||||
// indicators.)
|
||||
type Cid interface {
|
||||
// n.b. 'yields' means "without copy", 'produces' means a malloc.
|
||||
|
||||
Version() uint64 // Yields the version prefix as a uint.
|
||||
Multicodec() uint64 // Yields the multicodec as a uint.
|
||||
Multihash() mh.Multihash // Yields the multihash segment.
|
||||
|
||||
String() string // Produces the CID formatted as b58 string.
|
||||
Bytes() []byte // Produces the CID formatted as raw binary.
|
||||
|
||||
Prefix() Prefix // Produces a tuple of non-content metadata.
|
||||
|
||||
// some change notes:
|
||||
// - `KeyString() CidString` is gone because we're natively a map key now, you're welcome.
|
||||
// - `StringOfBase(mbase.Encoding) (string, error)` is skipped, maybe it can come back but maybe it should be a formatter's job.
|
||||
// - `Equals(o Cid) bool` is gone because it's now `==`, you're welcome.
|
||||
|
||||
// TODO: make a multi-return method for {v,mc,mh} decomposition. CidStr will be able to implement this more efficiently than if one makes a series of the individual getter calls.
|
||||
}
|
||||
|
||||
// Prefix represents all the metadata of a Cid,
|
||||
// that is, the Version, the Codec, the Multihash type
|
||||
// and the Multihash length. It does not contains
|
||||
// any actual content information.
|
||||
// NOTE: The use -1 in MhLength to mean default length is deprecated,
|
||||
// use the V0Builder or V1Builder structures instead
|
||||
type Prefix struct {
|
||||
Version uint64
|
||||
Codec uint64
|
||||
MhType uint64
|
||||
MhLength int
|
||||
}
|
||||
71
_rsrch/cidiface/cidBoxingBench_test.go
Normal file
71
_rsrch/cidiface/cidBoxingBench_test.go
Normal file
@@ -0,0 +1,71 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"testing"
|
||||
)
|
||||
|
||||
// BenchmarkCidMap_CidStr estimates how fast it is to insert primitives into a map
|
||||
// keyed by CidStr (concretely).
|
||||
//
|
||||
// We do 100 insertions per benchmark run to make sure the map initialization
|
||||
// doesn't dominate the results.
|
||||
//
|
||||
// Sample results on linux amd64 go1.11beta:
|
||||
//
|
||||
// BenchmarkCidMap_CidStr-8 100000 16317 ns/op
|
||||
// BenchmarkCidMap_CidIface-8 100000 20516 ns/op
|
||||
//
|
||||
// With benchmem on:
|
||||
//
|
||||
// BenchmarkCidMap_CidStr-8 100000 15579 ns/op 11223 B/op 207 allocs/op
|
||||
// BenchmarkCidMap_CidIface-8 100000 19500 ns/op 12824 B/op 307 allocs/op
|
||||
// BenchmarkCidMap_StrPlusHax-8 200000 10451 ns/op 7589 B/op 202 allocs/op
|
||||
//
|
||||
// We can see here that the impact of interface boxing is significant:
|
||||
// it increases the time taken to do the inserts to 133%, largely because
|
||||
// the implied `runtime.convT2E` calls cause another malloc each.
|
||||
//
|
||||
// There are also significant allocations in both cases because
|
||||
// A) we cannot create a multihash without allocations since they are []byte;
|
||||
// B) the map has to be grown several times;
|
||||
// C) something I haven't quite put my finger on yet.
|
||||
// Ideally we'd drive those down further as well.
|
||||
//
|
||||
// Pre-allocating the map reduces allocs by a very small percentage by *count*,
|
||||
// but reduces the time taken by 66% overall (presumably because when a map
|
||||
// re-arranges itself, it involves more or less an O(n) copy of the content
|
||||
// in addition to the alloc itself). This isn't topical to the question of
|
||||
// whether or not interfaces are a good idea; just for contextualizing.
|
||||
//
|
||||
func BenchmarkCidMap_CidStr(b *testing.B) {
|
||||
for i := 0; i < b.N; i++ {
|
||||
mp := map[CidStr]int{}
|
||||
for x := 0; x < 100; x++ {
|
||||
mp[NewCidStr(0, uint64(x), []byte{})] = x
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// BenchmarkCidMap_CidIface is in the family of BenchmarkCidMap_CidStr:
|
||||
// it is identical except the map key type is declared as an interface
|
||||
// (which forces all insertions to be boxed, changing performance).
|
||||
func BenchmarkCidMap_CidIface(b *testing.B) {
|
||||
for i := 0; i < b.N; i++ {
|
||||
mp := map[Cid]int{}
|
||||
for x := 0; x < 100; x++ {
|
||||
mp[NewCidStr(0, uint64(x), []byte{})] = x
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// BenchmarkCidMap_CidStrAvoidMapGrowth is in the family of BenchmarkCidMap_CidStr:
|
||||
// it is identical except the map is created with a size hint that removes
|
||||
// some allocations (5, in practice, apparently).
|
||||
func BenchmarkCidMap_CidStrAvoidMapGrowth(b *testing.B) {
|
||||
for i := 0; i < b.N; i++ {
|
||||
mp := make(map[CidStr]int, 100)
|
||||
for x := 0; x < 100; x++ {
|
||||
mp[NewCidStr(0, uint64(x), []byte{})] = x
|
||||
}
|
||||
}
|
||||
}
|
||||
161
_rsrch/cidiface/cidString.go
Normal file
161
_rsrch/cidiface/cidString.go
Normal file
@@ -0,0 +1,161 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"encoding/binary"
|
||||
"fmt"
|
||||
|
||||
mbase "github.com/multiformats/go-multibase"
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
//=================
|
||||
// def & accessors
|
||||
//=================
|
||||
|
||||
var _ Cid = CidStr("")
|
||||
var _ map[CidStr]struct{} = nil
|
||||
|
||||
// CidStr is a representation of a Cid as a string type containing binary.
|
||||
//
|
||||
// Using golang's string type is preferable over byte slices even for binary
|
||||
// data because golang strings are immutable, usable as map keys,
|
||||
// trivially comparable with built-in equals operators, etc.
|
||||
//
|
||||
// Please do not cast strings or bytes into the CidStr type directly;
|
||||
// use a parse method which validates the data and yields a CidStr.
|
||||
type CidStr string
|
||||
|
||||
// EmptyCidStr is a constant for a zero/uninitialized/sentinelvalue cid;
|
||||
// it is declared mainly for readability in checks for sentinel values.
|
||||
const EmptyCidStr = CidStr("")
|
||||
|
||||
func (c CidStr) Version() uint64 {
|
||||
bytes := []byte(c)
|
||||
v, _ := binary.Uvarint(bytes)
|
||||
return v
|
||||
}
|
||||
|
||||
func (c CidStr) Multicodec() uint64 {
|
||||
bytes := []byte(c)
|
||||
_, n := binary.Uvarint(bytes) // skip version length
|
||||
codec, _ := binary.Uvarint(bytes[n:])
|
||||
return codec
|
||||
}
|
||||
|
||||
func (c CidStr) Multihash() mh.Multihash {
|
||||
bytes := []byte(c)
|
||||
_, n1 := binary.Uvarint(bytes) // skip version length
|
||||
_, n2 := binary.Uvarint(bytes[n1:]) // skip codec length
|
||||
return mh.Multihash(bytes[n1+n2:]) // return slice of remainder
|
||||
}
|
||||
|
||||
// String returns the default string representation of a Cid.
|
||||
// Currently, Base58 is used as the encoding for the multibase string.
|
||||
func (c CidStr) String() string {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.Multihash().B58String()
|
||||
case 1:
|
||||
mbstr, err := mbase.Encode(mbase.Base58BTC, []byte(c))
|
||||
if err != nil {
|
||||
panic("should not error with hardcoded mbase: " + err.Error())
|
||||
}
|
||||
return mbstr
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
// Bytes produces a raw binary format of the CID.
|
||||
//
|
||||
// (For CidStr, this method is only distinct from casting because of
|
||||
// compatibility with v0 CIDs.)
|
||||
func (c CidStr) Bytes() []byte {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.Multihash()
|
||||
case 1:
|
||||
return []byte(c)
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
// Prefix builds and returns a Prefix out of a Cid.
|
||||
func (c CidStr) Prefix() Prefix {
|
||||
dec, _ := mh.Decode(c.Multihash()) // assuming we got a valid multiaddr, this will not error
|
||||
return Prefix{
|
||||
MhType: dec.Code,
|
||||
MhLength: dec.Length,
|
||||
Version: c.Version(),
|
||||
Codec: c.Multicodec(),
|
||||
}
|
||||
}
|
||||
|
||||
//==================================
|
||||
// parsers & validators & factories
|
||||
//==================================
|
||||
|
||||
func NewCidStr(version uint64, codecType uint64, mhash mh.Multihash) CidStr {
|
||||
hashlen := len(mhash)
|
||||
// two 8 bytes (max) numbers plus hash
|
||||
buf := make([]byte, 2*binary.MaxVarintLen64+hashlen)
|
||||
n := binary.PutUvarint(buf, version)
|
||||
n += binary.PutUvarint(buf[n:], codecType)
|
||||
cn := copy(buf[n:], mhash)
|
||||
if cn != hashlen {
|
||||
panic("copy hash length is inconsistent")
|
||||
}
|
||||
return CidStr(buf[:n+hashlen])
|
||||
}
|
||||
|
||||
// CidStrParse takes a binary byte slice, parses it, and returns either
|
||||
// a valid CidStr, or the zero CidStr and an error.
|
||||
//
|
||||
// For CidV1, the data buffer is in the form:
|
||||
//
|
||||
// <version><codec-type><multihash>
|
||||
//
|
||||
// CidV0 are also supported. In particular, data buffers starting
|
||||
// with length 34 bytes, which starts with bytes [18,32...] are considered
|
||||
// binary multihashes.
|
||||
//
|
||||
// The multicodec bytes are not parsed to verify they're a valid varint;
|
||||
// no further reification is performed.
|
||||
//
|
||||
// Multibase encoding should already have been unwrapped before parsing;
|
||||
// if you have a multibase-enveloped string, use CidStrDecode instead.
|
||||
//
|
||||
// CidStrParse is the inverse of Cid.Bytes().
|
||||
func CidStrParse(data []byte) (CidStr, error) {
|
||||
if len(data) == 34 && data[0] == 18 && data[1] == 32 {
|
||||
h, err := mh.Cast(data)
|
||||
if err != nil {
|
||||
return EmptyCidStr, err
|
||||
}
|
||||
return NewCidStr(0, DagProtobuf, h), nil
|
||||
}
|
||||
|
||||
vers, n := binary.Uvarint(data)
|
||||
if err := uvError(n); err != nil {
|
||||
return EmptyCidStr, err
|
||||
}
|
||||
|
||||
if vers != 0 && vers != 1 {
|
||||
return EmptyCidStr, fmt.Errorf("invalid cid version number: %d", vers)
|
||||
}
|
||||
|
||||
_, cn := binary.Uvarint(data[n:])
|
||||
if err := uvError(cn); err != nil {
|
||||
return EmptyCidStr, err
|
||||
}
|
||||
|
||||
rest := data[n+cn:]
|
||||
h, err := mh.Cast(rest)
|
||||
if err != nil {
|
||||
return EmptyCidStr, err
|
||||
}
|
||||
|
||||
// REVIEW: if the data is longer than the mh.len expects, we silently ignore it? should we?
|
||||
return CidStr(data[0 : n+cn+len(h)]), nil
|
||||
}
|
||||
164
_rsrch/cidiface/cidStruct.go
Normal file
164
_rsrch/cidiface/cidStruct.go
Normal file
@@ -0,0 +1,164 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"encoding/binary"
|
||||
"fmt"
|
||||
|
||||
mbase "github.com/multiformats/go-multibase"
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
//=================
|
||||
// def & accessors
|
||||
//=================
|
||||
|
||||
var _ Cid = CidStruct{}
|
||||
|
||||
//var _ map[CidStruct]struct{} = nil // Will not compile! See struct def docs.
|
||||
//var _ map[Cid]struct{} = map[Cid]struct{}{CidStruct{}: struct{}{}} // Legal to compile...
|
||||
// but you'll get panics: "runtime error: hash of unhashable type cid.CidStruct"
|
||||
|
||||
// CidStruct represents a CID in a struct format.
|
||||
//
|
||||
// This format complies with the exact same Cid interface as the CidStr
|
||||
// implementation, but completely pre-parses the Cid metadata.
|
||||
// CidStruct is a tad quicker in case of repeatedly accessed fields,
|
||||
// but requires more reshuffling to parse and to serialize.
|
||||
// CidStruct is not usable as a map key, because it contains a Multihash
|
||||
// reference, which is a slice, and thus not "comparable" as a primitive.
|
||||
//
|
||||
// Beware of zero-valued CidStruct: it is difficult to distinguish an
|
||||
// incorrectly-initialized "invalid" CidStruct from one representing a v0 cid.
|
||||
type CidStruct struct {
|
||||
version uint64
|
||||
codec uint64
|
||||
hash mh.Multihash
|
||||
}
|
||||
|
||||
// EmptyCidStruct is a constant for a zero/uninitialized/sentinelvalue cid;
|
||||
// it is declared mainly for readability in checks for sentinel values.
|
||||
//
|
||||
// Note: it's not actually a const; the compiler does not allow const structs.
|
||||
var EmptyCidStruct = CidStruct{}
|
||||
|
||||
func (c CidStruct) Version() uint64 {
|
||||
return c.version
|
||||
}
|
||||
|
||||
func (c CidStruct) Multicodec() uint64 {
|
||||
return c.codec
|
||||
}
|
||||
|
||||
func (c CidStruct) Multihash() mh.Multihash {
|
||||
return c.hash
|
||||
}
|
||||
|
||||
// String returns the default string representation of a Cid.
|
||||
// Currently, Base58 is used as the encoding for the multibase string.
|
||||
func (c CidStruct) String() string {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.Multihash().B58String()
|
||||
case 1:
|
||||
mbstr, err := mbase.Encode(mbase.Base58BTC, c.Bytes())
|
||||
if err != nil {
|
||||
panic("should not error with hardcoded mbase: " + err.Error())
|
||||
}
|
||||
return mbstr
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
// Bytes produces a raw binary format of the CID.
|
||||
func (c CidStruct) Bytes() []byte {
|
||||
switch c.version {
|
||||
case 0:
|
||||
return []byte(c.hash)
|
||||
case 1:
|
||||
// two 8 bytes (max) numbers plus hash
|
||||
buf := make([]byte, 2*binary.MaxVarintLen64+len(c.hash))
|
||||
n := binary.PutUvarint(buf, c.version)
|
||||
n += binary.PutUvarint(buf[n:], c.codec)
|
||||
cn := copy(buf[n:], c.hash)
|
||||
if cn != len(c.hash) {
|
||||
panic("copy hash length is inconsistent")
|
||||
}
|
||||
return buf[:n+len(c.hash)]
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
// Prefix builds and returns a Prefix out of a Cid.
|
||||
func (c CidStruct) Prefix() Prefix {
|
||||
dec, _ := mh.Decode(c.hash) // assuming we got a valid multiaddr, this will not error
|
||||
return Prefix{
|
||||
MhType: dec.Code,
|
||||
MhLength: dec.Length,
|
||||
Version: c.version,
|
||||
Codec: c.codec,
|
||||
}
|
||||
}
|
||||
|
||||
//==================================
|
||||
// parsers & validators & factories
|
||||
//==================================
|
||||
|
||||
// CidStructParse takes a binary byte slice, parses it, and returns either
|
||||
// a valid CidStruct, or the zero CidStruct and an error.
|
||||
//
|
||||
// For CidV1, the data buffer is in the form:
|
||||
//
|
||||
// <version><codec-type><multihash>
|
||||
//
|
||||
// CidV0 are also supported. In particular, data buffers starting
|
||||
// with length 34 bytes, which starts with bytes [18,32...] are considered
|
||||
// binary multihashes.
|
||||
//
|
||||
// The multicodec bytes are not parsed to verify they're a valid varint;
|
||||
// no further reification is performed.
|
||||
//
|
||||
// Multibase encoding should already have been unwrapped before parsing;
|
||||
// if you have a multibase-enveloped string, use CidStructDecode instead.
|
||||
//
|
||||
// CidStructParse is the inverse of Cid.Bytes().
|
||||
func CidStructParse(data []byte) (CidStruct, error) {
|
||||
if len(data) == 34 && data[0] == 18 && data[1] == 32 {
|
||||
h, err := mh.Cast(data)
|
||||
if err != nil {
|
||||
return EmptyCidStruct, err
|
||||
}
|
||||
return CidStruct{
|
||||
codec: DagProtobuf,
|
||||
version: 0,
|
||||
hash: h,
|
||||
}, nil
|
||||
}
|
||||
|
||||
vers, n := binary.Uvarint(data)
|
||||
if err := uvError(n); err != nil {
|
||||
return EmptyCidStruct, err
|
||||
}
|
||||
|
||||
if vers != 0 && vers != 1 {
|
||||
return EmptyCidStruct, fmt.Errorf("invalid cid version number: %d", vers)
|
||||
}
|
||||
|
||||
codec, cn := binary.Uvarint(data[n:])
|
||||
if err := uvError(cn); err != nil {
|
||||
return EmptyCidStruct, err
|
||||
}
|
||||
|
||||
rest := data[n+cn:]
|
||||
h, err := mh.Cast(rest)
|
||||
if err != nil {
|
||||
return EmptyCidStruct, err
|
||||
}
|
||||
|
||||
return CidStruct{
|
||||
version: vers,
|
||||
codec: codec,
|
||||
hash: h,
|
||||
}, nil
|
||||
}
|
||||
76
_rsrch/cidiface/enums.go
Normal file
76
_rsrch/cidiface/enums.go
Normal file
@@ -0,0 +1,76 @@
|
||||
package cid
|
||||
|
||||
// These are multicodec-packed content types. The should match
|
||||
// the codes described in the authoritative document:
|
||||
// https://github.com/multiformats/multicodec/blob/master/table.csv
|
||||
const (
|
||||
Raw = 0x55
|
||||
|
||||
DagProtobuf = 0x70
|
||||
DagCBOR = 0x71
|
||||
|
||||
GitRaw = 0x78
|
||||
|
||||
EthBlock = 0x90
|
||||
EthBlockList = 0x91
|
||||
EthTxTrie = 0x92
|
||||
EthTx = 0x93
|
||||
EthTxReceiptTrie = 0x94
|
||||
EthTxReceipt = 0x95
|
||||
EthStateTrie = 0x96
|
||||
EthAccountSnapshot = 0x97
|
||||
EthStorageTrie = 0x98
|
||||
BitcoinBlock = 0xb0
|
||||
BitcoinTx = 0xb1
|
||||
ZcashBlock = 0xc0
|
||||
ZcashTx = 0xc1
|
||||
DecredBlock = 0xe0
|
||||
DecredTx = 0xe1
|
||||
)
|
||||
|
||||
// Codecs maps the name of a codec to its type
|
||||
var Codecs = map[string]uint64{
|
||||
"v0": DagProtobuf,
|
||||
"raw": Raw,
|
||||
"protobuf": DagProtobuf,
|
||||
"cbor": DagCBOR,
|
||||
"git-raw": GitRaw,
|
||||
"eth-block": EthBlock,
|
||||
"eth-block-list": EthBlockList,
|
||||
"eth-tx-trie": EthTxTrie,
|
||||
"eth-tx": EthTx,
|
||||
"eth-tx-receipt-trie": EthTxReceiptTrie,
|
||||
"eth-tx-receipt": EthTxReceipt,
|
||||
"eth-state-trie": EthStateTrie,
|
||||
"eth-account-snapshot": EthAccountSnapshot,
|
||||
"eth-storage-trie": EthStorageTrie,
|
||||
"bitcoin-block": BitcoinBlock,
|
||||
"bitcoin-tx": BitcoinTx,
|
||||
"zcash-block": ZcashBlock,
|
||||
"zcash-tx": ZcashTx,
|
||||
"decred-block": DecredBlock,
|
||||
"decred-tx": DecredTx,
|
||||
}
|
||||
|
||||
// CodecToStr maps the numeric codec to its name
|
||||
var CodecToStr = map[uint64]string{
|
||||
Raw: "raw",
|
||||
DagProtobuf: "protobuf",
|
||||
DagCBOR: "cbor",
|
||||
GitRaw: "git-raw",
|
||||
EthBlock: "eth-block",
|
||||
EthBlockList: "eth-block-list",
|
||||
EthTxTrie: "eth-tx-trie",
|
||||
EthTx: "eth-tx",
|
||||
EthTxReceiptTrie: "eth-tx-receipt-trie",
|
||||
EthTxReceipt: "eth-tx-receipt",
|
||||
EthStateTrie: "eth-state-trie",
|
||||
EthAccountSnapshot: "eth-account-snapshot",
|
||||
EthStorageTrie: "eth-storage-trie",
|
||||
BitcoinBlock: "bitcoin-block",
|
||||
BitcoinTx: "bitcoin-tx",
|
||||
ZcashBlock: "zcash-block",
|
||||
ZcashTx: "zcash-tx",
|
||||
DecredBlock: "decred-block",
|
||||
DecredTx: "decred-tx",
|
||||
}
|
||||
24
_rsrch/cidiface/errors.go
Normal file
24
_rsrch/cidiface/errors.go
Normal file
@@ -0,0 +1,24 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"errors"
|
||||
)
|
||||
|
||||
var (
|
||||
// ErrVarintBuffSmall means that a buffer passed to the cid parser was not
|
||||
// long enough, or did not contain an invalid cid
|
||||
ErrVarintBuffSmall = errors.New("reading varint: buffer too small")
|
||||
|
||||
// ErrVarintTooBig means that the varint in the given cid was above the
|
||||
// limit of 2^64
|
||||
ErrVarintTooBig = errors.New("reading varint: varint bigger than 64bits" +
|
||||
" and not supported")
|
||||
|
||||
// ErrCidTooShort means that the cid passed to decode was not long
|
||||
// enough to be a valid Cid
|
||||
ErrCidTooShort = errors.New("cid too short")
|
||||
|
||||
// ErrInvalidEncoding means that selected encoding is not supported
|
||||
// by this Cid version
|
||||
ErrInvalidEncoding = errors.New("invalid base encoding")
|
||||
)
|
||||
12
_rsrch/cidiface/misc.go
Normal file
12
_rsrch/cidiface/misc.go
Normal file
@@ -0,0 +1,12 @@
|
||||
package cid
|
||||
|
||||
func uvError(read int) error {
|
||||
switch {
|
||||
case read == 0:
|
||||
return ErrVarintBuffSmall
|
||||
case read < 0:
|
||||
return ErrVarintTooBig
|
||||
default:
|
||||
return nil
|
||||
}
|
||||
}
|
||||
74
builder.go
Normal file
74
builder.go
Normal file
@@ -0,0 +1,74 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
type Builder interface {
|
||||
Sum(data []byte) (Cid, error)
|
||||
GetCodec() uint64
|
||||
WithCodec(uint64) Builder
|
||||
}
|
||||
|
||||
type V0Builder struct{}
|
||||
|
||||
type V1Builder struct {
|
||||
Codec uint64
|
||||
MhType uint64
|
||||
MhLength int // MhLength <= 0 means the default length
|
||||
}
|
||||
|
||||
func (p Prefix) GetCodec() uint64 {
|
||||
return p.Codec
|
||||
}
|
||||
|
||||
func (p Prefix) WithCodec(c uint64) Builder {
|
||||
if c == p.Codec {
|
||||
return p
|
||||
}
|
||||
p.Codec = c
|
||||
if c != DagProtobuf {
|
||||
p.Version = 1
|
||||
}
|
||||
return p
|
||||
}
|
||||
|
||||
func (p V0Builder) Sum(data []byte) (Cid, error) {
|
||||
hash, err := mh.Sum(data, mh.SHA2_256, -1)
|
||||
if err != nil {
|
||||
return Undef, err
|
||||
}
|
||||
return NewCidV0(hash), nil
|
||||
}
|
||||
|
||||
func (p V0Builder) GetCodec() uint64 {
|
||||
return DagProtobuf
|
||||
}
|
||||
|
||||
func (p V0Builder) WithCodec(c uint64) Builder {
|
||||
if c == DagProtobuf {
|
||||
return p
|
||||
}
|
||||
return V1Builder{Codec: c, MhType: mh.SHA2_256}
|
||||
}
|
||||
|
||||
func (p V1Builder) Sum(data []byte) (Cid, error) {
|
||||
mhLen := p.MhLength
|
||||
if mhLen <= 0 {
|
||||
mhLen = -1
|
||||
}
|
||||
hash, err := mh.Sum(data, p.MhType, mhLen)
|
||||
if err != nil {
|
||||
return Undef, err
|
||||
}
|
||||
return NewCidV1(p.Codec, hash), nil
|
||||
}
|
||||
|
||||
func (p V1Builder) GetCodec() uint64 {
|
||||
return p.Codec
|
||||
}
|
||||
|
||||
func (p V1Builder) WithCodec(c uint64) Builder {
|
||||
p.Codec = c
|
||||
return p
|
||||
}
|
||||
92
builder_test.go
Normal file
92
builder_test.go
Normal file
@@ -0,0 +1,92 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"testing"
|
||||
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
func TestV0Builder(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
|
||||
// Construct c1
|
||||
format := V0Builder{}
|
||||
c1, err := format.Sum(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
// Construct c2
|
||||
hash, err := mh.Sum(data, mh.SHA2_256, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c2 := NewCidV0(hash)
|
||||
|
||||
if !c1.Equals(c2) {
|
||||
t.Fatal("cids mismatch")
|
||||
}
|
||||
if c1.Prefix() != c2.Prefix() {
|
||||
t.Fatal("prefixes mismatch")
|
||||
}
|
||||
}
|
||||
|
||||
func TestV1Builder(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
|
||||
// Construct c1
|
||||
format := V1Builder{Codec: DagCBOR, MhType: mh.SHA2_256}
|
||||
c1, err := format.Sum(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
// Construct c2
|
||||
hash, err := mh.Sum(data, mh.SHA2_256, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c2 := NewCidV1(DagCBOR, hash)
|
||||
|
||||
if !c1.Equals(c2) {
|
||||
t.Fatal("cids mismatch")
|
||||
}
|
||||
if c1.Prefix() != c2.Prefix() {
|
||||
t.Fatal("prefixes mismatch")
|
||||
}
|
||||
}
|
||||
|
||||
func TestCodecChange(t *testing.T) {
|
||||
t.Run("Prefix-CidV0", func(t *testing.T) {
|
||||
p := Prefix{Version: 0, Codec: DagProtobuf, MhType: mh.SHA2_256, MhLength: mh.DefaultLengths[mh.SHA2_256]}
|
||||
testCodecChange(t, p)
|
||||
})
|
||||
t.Run("Prefix-CidV1", func(t *testing.T) {
|
||||
p := Prefix{Version: 1, Codec: DagProtobuf, MhType: mh.SHA2_256, MhLength: mh.DefaultLengths[mh.SHA2_256]}
|
||||
testCodecChange(t, p)
|
||||
})
|
||||
t.Run("V0Builder", func(t *testing.T) {
|
||||
testCodecChange(t, V0Builder{})
|
||||
})
|
||||
t.Run("V1Builder", func(t *testing.T) {
|
||||
testCodecChange(t, V1Builder{Codec: DagProtobuf, MhType: mh.SHA2_256})
|
||||
})
|
||||
}
|
||||
|
||||
func testCodecChange(t *testing.T, b Builder) {
|
||||
data := []byte("this is some test content")
|
||||
|
||||
if b.GetCodec() != DagProtobuf {
|
||||
t.Fatal("original builder not using Protobuf codec")
|
||||
}
|
||||
|
||||
b = b.WithCodec(Raw)
|
||||
c, err := b.Sum(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if c.Type() != Raw {
|
||||
t.Fatal("new cid codec did not change to Raw")
|
||||
}
|
||||
}
|
||||
495
cid.go
495
cid.go
@@ -1,8 +1,29 @@
|
||||
// Package cid implements the Content-IDentifiers specification
|
||||
// (https://github.com/ipld/cid) in Go. CIDs are
|
||||
// self-describing content-addressed identifiers useful for
|
||||
// distributed information systems. CIDs are used in the IPFS
|
||||
// (https://ipfs.io) project ecosystem.
|
||||
//
|
||||
// CIDs have two major versions. A CIDv0 corresponds to a multihash of type
|
||||
// DagProtobuf, is deprecated and exists for compatibility reasons. Usually,
|
||||
// CIDv1 should be used.
|
||||
//
|
||||
// A CIDv1 has four parts:
|
||||
//
|
||||
// <cidv1> ::= <multibase-prefix><cid-version><multicodec-packed-content-type><multihash-content-address>
|
||||
//
|
||||
// As shown above, the CID implementation relies heavily on Multiformats,
|
||||
// particularly Multibase
|
||||
// (https://github.com/multiformats/go-multibase), Multicodec
|
||||
// (https://github.com/multiformats/multicodec) and Multihash
|
||||
// implementations (https://github.com/multiformats/go-multihash).
|
||||
package cid
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"encoding"
|
||||
"encoding/binary"
|
||||
"encoding/json"
|
||||
"errors"
|
||||
"fmt"
|
||||
"strings"
|
||||
@@ -11,45 +32,166 @@ import (
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
// UnsupportedVersionString just holds an error message
|
||||
const UnsupportedVersionString = "<unsupported cid version>"
|
||||
|
||||
var (
|
||||
// ErrVarintBuffSmall means that a buffer passed to the cid parser was not
|
||||
// long enough, or did not contain an invalid cid
|
||||
ErrVarintBuffSmall = errors.New("reading varint: buffer too small")
|
||||
|
||||
// ErrVarintTooBig means that the varint in the given cid was above the
|
||||
// limit of 2^64
|
||||
ErrVarintTooBig = errors.New("reading varint: varint bigger than 64bits" +
|
||||
" and not supported")
|
||||
|
||||
// ErrCidTooShort means that the cid passed to decode was not long
|
||||
// enough to be a valid Cid
|
||||
ErrCidTooShort = errors.New("cid too short")
|
||||
|
||||
// ErrInvalidEncoding means that selected encoding is not supported
|
||||
// by this Cid version
|
||||
ErrInvalidEncoding = errors.New("invalid base encoding")
|
||||
)
|
||||
|
||||
// These are multicodec-packed content types. The should match
|
||||
// the codes described in the authoritative document:
|
||||
// https://github.com/multiformats/multicodec/blob/master/table.csv
|
||||
const (
|
||||
Raw = 0x55
|
||||
|
||||
DagProtobuf = 0x70
|
||||
DagCBOR = 0x71
|
||||
|
||||
EthereumBlock = 0x90
|
||||
EthereumTx = 0x91
|
||||
BitcoinBlock = 0xb0
|
||||
BitcoinTx = 0xb1
|
||||
ZcashBlock = 0xc0
|
||||
ZcashTx = 0xc1
|
||||
GitRaw = 0x78
|
||||
|
||||
EthBlock = 0x90
|
||||
EthBlockList = 0x91
|
||||
EthTxTrie = 0x92
|
||||
EthTx = 0x93
|
||||
EthTxReceiptTrie = 0x94
|
||||
EthTxReceipt = 0x95
|
||||
EthStateTrie = 0x96
|
||||
EthAccountSnapshot = 0x97
|
||||
EthStorageTrie = 0x98
|
||||
BitcoinBlock = 0xb0
|
||||
BitcoinTx = 0xb1
|
||||
ZcashBlock = 0xc0
|
||||
ZcashTx = 0xc1
|
||||
DecredBlock = 0xe0
|
||||
DecredTx = 0xe1
|
||||
DashBlock = 0xf0
|
||||
DashTx = 0xf1
|
||||
)
|
||||
|
||||
func NewCidV0(h mh.Multihash) *Cid {
|
||||
return &Cid{
|
||||
version: 0,
|
||||
codec: DagProtobuf,
|
||||
hash: h,
|
||||
// Codecs maps the name of a codec to its type
|
||||
var Codecs = map[string]uint64{
|
||||
"v0": DagProtobuf,
|
||||
"raw": Raw,
|
||||
"protobuf": DagProtobuf,
|
||||
"cbor": DagCBOR,
|
||||
"git-raw": GitRaw,
|
||||
"eth-block": EthBlock,
|
||||
"eth-block-list": EthBlockList,
|
||||
"eth-tx-trie": EthTxTrie,
|
||||
"eth-tx": EthTx,
|
||||
"eth-tx-receipt-trie": EthTxReceiptTrie,
|
||||
"eth-tx-receipt": EthTxReceipt,
|
||||
"eth-state-trie": EthStateTrie,
|
||||
"eth-account-snapshot": EthAccountSnapshot,
|
||||
"eth-storage-trie": EthStorageTrie,
|
||||
"bitcoin-block": BitcoinBlock,
|
||||
"bitcoin-tx": BitcoinTx,
|
||||
"zcash-block": ZcashBlock,
|
||||
"zcash-tx": ZcashTx,
|
||||
"decred-block": DecredBlock,
|
||||
"decred-tx": DecredTx,
|
||||
"dash-block": DashBlock,
|
||||
"dash-tx": DashTx,
|
||||
}
|
||||
|
||||
// CodecToStr maps the numeric codec to its name
|
||||
var CodecToStr = map[uint64]string{
|
||||
Raw: "raw",
|
||||
DagProtobuf: "protobuf",
|
||||
DagCBOR: "cbor",
|
||||
GitRaw: "git-raw",
|
||||
EthBlock: "eth-block",
|
||||
EthBlockList: "eth-block-list",
|
||||
EthTxTrie: "eth-tx-trie",
|
||||
EthTx: "eth-tx",
|
||||
EthTxReceiptTrie: "eth-tx-receipt-trie",
|
||||
EthTxReceipt: "eth-tx-receipt",
|
||||
EthStateTrie: "eth-state-trie",
|
||||
EthAccountSnapshot: "eth-account-snapshot",
|
||||
EthStorageTrie: "eth-storage-trie",
|
||||
BitcoinBlock: "bitcoin-block",
|
||||
BitcoinTx: "bitcoin-tx",
|
||||
ZcashBlock: "zcash-block",
|
||||
ZcashTx: "zcash-tx",
|
||||
DecredBlock: "decred-block",
|
||||
DecredTx: "decred-tx",
|
||||
DashBlock: "dash-block",
|
||||
DashTx: "dash-tx",
|
||||
}
|
||||
|
||||
// NewCidV0 returns a Cid-wrapped multihash.
|
||||
// They exist to allow IPFS to work with Cids while keeping
|
||||
// compatibility with the plain-multihash format used used in IPFS.
|
||||
// NewCidV1 should be used preferentially.
|
||||
func NewCidV0(mhash mh.Multihash) Cid {
|
||||
// Need to make sure hash is valid for CidV0 otherwise we will
|
||||
// incorrectly detect it as CidV1 in the Version() method
|
||||
dec, err := mh.Decode(mhash)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
}
|
||||
|
||||
func NewCidV1(c uint64, h mh.Multihash) *Cid {
|
||||
return &Cid{
|
||||
version: 1,
|
||||
codec: c,
|
||||
hash: h,
|
||||
if dec.Code != mh.SHA2_256 || dec.Length != 32 {
|
||||
panic("invalid hash for cidv0")
|
||||
}
|
||||
return Cid{string(mhash)}
|
||||
}
|
||||
|
||||
type Cid struct {
|
||||
version uint64
|
||||
codec uint64
|
||||
hash mh.Multihash
|
||||
// NewCidV1 returns a new Cid using the given multicodec-packed
|
||||
// content type.
|
||||
func NewCidV1(codecType uint64, mhash mh.Multihash) Cid {
|
||||
hashlen := len(mhash)
|
||||
// two 8 bytes (max) numbers plus hash
|
||||
buf := make([]byte, 2*binary.MaxVarintLen64+hashlen)
|
||||
n := binary.PutUvarint(buf, 1)
|
||||
n += binary.PutUvarint(buf[n:], codecType)
|
||||
cn := copy(buf[n:], mhash)
|
||||
if cn != hashlen {
|
||||
panic("copy hash length is inconsistent")
|
||||
}
|
||||
|
||||
return Cid{string(buf[:n+hashlen])}
|
||||
}
|
||||
|
||||
func Parse(v interface{}) (*Cid, error) {
|
||||
var _ encoding.BinaryMarshaler = Cid{}
|
||||
var _ encoding.BinaryUnmarshaler = (*Cid)(nil)
|
||||
var _ encoding.TextMarshaler = Cid{}
|
||||
var _ encoding.TextUnmarshaler = (*Cid)(nil)
|
||||
|
||||
// Cid represents a self-describing content addressed
|
||||
// identifier. It is formed by a Version, a Codec (which indicates
|
||||
// a multicodec-packed content type) and a Multihash.
|
||||
type Cid struct{ str string }
|
||||
|
||||
// Undef can be used to represent a nil or undefined Cid, using Cid{}
|
||||
// directly is also acceptable.
|
||||
var Undef = Cid{}
|
||||
|
||||
// Defined returns true if a Cid is defined
|
||||
// Calling any other methods on an undefined Cid will result in
|
||||
// undefined behavior.
|
||||
func (c Cid) Defined() bool {
|
||||
return c.str != ""
|
||||
}
|
||||
|
||||
// Parse is a short-hand function to perform Decode, Cast etc... on
|
||||
// a generic interface{} type.
|
||||
func Parse(v interface{}) (Cid, error) {
|
||||
switch v2 := v.(type) {
|
||||
case string:
|
||||
if strings.Contains(v2, "/ipfs/") {
|
||||
@@ -60,22 +202,34 @@ func Parse(v interface{}) (*Cid, error) {
|
||||
return Cast(v2)
|
||||
case mh.Multihash:
|
||||
return NewCidV0(v2), nil
|
||||
case *Cid:
|
||||
case Cid:
|
||||
return v2, nil
|
||||
default:
|
||||
return nil, fmt.Errorf("can't parse %+v as Cid", v2)
|
||||
return Undef, fmt.Errorf("can't parse %+v as Cid", v2)
|
||||
}
|
||||
}
|
||||
|
||||
func Decode(v string) (*Cid, error) {
|
||||
// Decode parses a Cid-encoded string and returns a Cid object.
|
||||
// For CidV1, a Cid-encoded string is primarily a multibase string:
|
||||
//
|
||||
// <multibase-type-code><base-encoded-string>
|
||||
//
|
||||
// The base-encoded string represents a:
|
||||
//
|
||||
// <version><codec-type><multihash>
|
||||
//
|
||||
// Decode will also detect and parse CidV0 strings. Strings
|
||||
// starting with "Qm" are considered CidV0 and treated directly
|
||||
// as B58-encoded multihashes.
|
||||
func Decode(v string) (Cid, error) {
|
||||
if len(v) < 2 {
|
||||
return nil, fmt.Errorf("cid too short")
|
||||
return Undef, ErrCidTooShort
|
||||
}
|
||||
|
||||
if len(v) == 46 && v[:2] == "Qm" {
|
||||
hash, err := mh.FromB58String(v)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
return NewCidV0(hash), nil
|
||||
@@ -83,17 +237,33 @@ func Decode(v string) (*Cid, error) {
|
||||
|
||||
_, data, err := mbase.Decode(v)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
return Cast(data)
|
||||
}
|
||||
|
||||
var (
|
||||
ErrVarintBuffSmall = errors.New("reading varint: buffer to small")
|
||||
ErrVarintTooBig = errors.New("reading varint: varint bigger than 64bits" +
|
||||
" and not supported")
|
||||
)
|
||||
// Extract the encoding from a Cid. If Decode on the same string did
|
||||
// not return an error neither will this function.
|
||||
func ExtractEncoding(v string) (mbase.Encoding, error) {
|
||||
if len(v) < 2 {
|
||||
return -1, ErrCidTooShort
|
||||
}
|
||||
|
||||
if len(v) == 46 && v[:2] == "Qm" {
|
||||
return mbase.Base58BTC, nil
|
||||
}
|
||||
|
||||
encoding := mbase.Encoding(v[0])
|
||||
|
||||
// check encoding is valid
|
||||
_, err := mbase.NewEncoder(encoding)
|
||||
if err != nil {
|
||||
return -1, err
|
||||
}
|
||||
|
||||
return encoding, nil
|
||||
}
|
||||
|
||||
func uvError(read int) error {
|
||||
switch {
|
||||
@@ -106,57 +276,99 @@ func uvError(read int) error {
|
||||
}
|
||||
}
|
||||
|
||||
func Cast(data []byte) (*Cid, error) {
|
||||
// Cast takes a Cid data slice, parses it and returns a Cid.
|
||||
// For CidV1, the data buffer is in the form:
|
||||
//
|
||||
// <version><codec-type><multihash>
|
||||
//
|
||||
// CidV0 are also supported. In particular, data buffers starting
|
||||
// with length 34 bytes, which starts with bytes [18,32...] are considered
|
||||
// binary multihashes.
|
||||
//
|
||||
// Please use decode when parsing a regular Cid string, as Cast does not
|
||||
// expect multibase-encoded data. Cast accepts the output of Cid.Bytes().
|
||||
func Cast(data []byte) (Cid, error) {
|
||||
if len(data) == 34 && data[0] == 18 && data[1] == 32 {
|
||||
h, err := mh.Cast(data)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
return &Cid{
|
||||
codec: DagProtobuf,
|
||||
version: 0,
|
||||
hash: h,
|
||||
}, nil
|
||||
return NewCidV0(h), nil
|
||||
}
|
||||
|
||||
vers, n := binary.Uvarint(data)
|
||||
if err := uvError(n); err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
if vers != 0 && vers != 1 {
|
||||
return nil, fmt.Errorf("invalid cid version number: %d", vers)
|
||||
if vers != 1 {
|
||||
return Undef, fmt.Errorf("expected 1 as the cid version number, got: %d", vers)
|
||||
}
|
||||
|
||||
codec, cn := binary.Uvarint(data[n:])
|
||||
_, cn := binary.Uvarint(data[n:])
|
||||
if err := uvError(cn); err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
rest := data[n+cn:]
|
||||
h, err := mh.Cast(rest)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
return &Cid{
|
||||
version: vers,
|
||||
codec: codec,
|
||||
hash: h,
|
||||
}, nil
|
||||
return Cid{string(data[0 : n+cn+len(h)])}, nil
|
||||
}
|
||||
|
||||
func (c *Cid) Type() uint64 {
|
||||
return c.codec
|
||||
// UnmarshalBinary is equivalent to Cast(). It implements the
|
||||
// encoding.BinaryUnmarshaler interface.
|
||||
func (c *Cid) UnmarshalBinary(data []byte) error {
|
||||
casted, err := Cast(data)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
c.str = casted.str
|
||||
return nil
|
||||
}
|
||||
|
||||
func (c *Cid) String() string {
|
||||
switch c.version {
|
||||
// UnmarshalText is equivalent to Decode(). It implements the
|
||||
// encoding.TextUnmarshaler interface.
|
||||
func (c *Cid) UnmarshalText(text []byte) error {
|
||||
decodedCid, err := Decode(string(text))
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
c.str = decodedCid.str
|
||||
return nil
|
||||
}
|
||||
|
||||
// Version returns the Cid version.
|
||||
func (c Cid) Version() uint64 {
|
||||
if len(c.str) == 34 && c.str[0] == 18 && c.str[1] == 32 {
|
||||
return 0
|
||||
}
|
||||
return 1
|
||||
}
|
||||
|
||||
// Type returns the multicodec-packed content type of a Cid.
|
||||
func (c Cid) Type() uint64 {
|
||||
if c.Version() == 0 {
|
||||
return DagProtobuf
|
||||
}
|
||||
_, n := uvarint(c.str)
|
||||
codec, _ := uvarint(c.str[n:])
|
||||
return codec
|
||||
}
|
||||
|
||||
// String returns the default string representation of a
|
||||
// Cid. Currently, Base58 is used as the encoding for the
|
||||
// multibase string.
|
||||
func (c Cid) String() string {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.hash.B58String()
|
||||
return c.Hash().B58String()
|
||||
case 1:
|
||||
mbstr, err := mbase.Encode(mbase.Base58BTC, c.bytesV1())
|
||||
mbstr, err := mbase.Encode(mbase.Base32, c.Bytes())
|
||||
if err != nil {
|
||||
panic("should not error with hardcoded mbase: " + err.Error())
|
||||
}
|
||||
@@ -167,95 +379,171 @@ func (c *Cid) String() string {
|
||||
}
|
||||
}
|
||||
|
||||
func (c *Cid) Hash() mh.Multihash {
|
||||
return c.hash
|
||||
}
|
||||
|
||||
func (c *Cid) Bytes() []byte {
|
||||
switch c.version {
|
||||
// String returns the string representation of a Cid
|
||||
// encoded is selected base
|
||||
func (c Cid) StringOfBase(base mbase.Encoding) (string, error) {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.bytesV0()
|
||||
if base != mbase.Base58BTC {
|
||||
return "", ErrInvalidEncoding
|
||||
}
|
||||
return c.Hash().B58String(), nil
|
||||
case 1:
|
||||
return c.bytesV1()
|
||||
return mbase.Encode(base, c.Bytes())
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
func (c *Cid) bytesV0() []byte {
|
||||
return []byte(c.hash)
|
||||
// Encode return the string representation of a Cid in a given base
|
||||
// when applicable. Version 0 Cid's are always in Base58 as they do
|
||||
// not take a multibase prefix.
|
||||
func (c Cid) Encode(base mbase.Encoder) string {
|
||||
switch c.Version() {
|
||||
case 0:
|
||||
return c.Hash().B58String()
|
||||
case 1:
|
||||
return base.Encode(c.Bytes())
|
||||
default:
|
||||
panic("not possible to reach this point")
|
||||
}
|
||||
}
|
||||
|
||||
func (c *Cid) bytesV1() []byte {
|
||||
// two 8 bytes (max) numbers plus hash
|
||||
buf := make([]byte, 2*binary.MaxVarintLen64+len(c.hash))
|
||||
n := binary.PutUvarint(buf, c.version)
|
||||
n += binary.PutUvarint(buf[n:], c.codec)
|
||||
cn := copy(buf[n:], c.hash)
|
||||
if cn != len(c.hash) {
|
||||
panic("copy hash length is inconsistent")
|
||||
// Hash returns the multihash contained by a Cid.
|
||||
func (c Cid) Hash() mh.Multihash {
|
||||
bytes := c.Bytes()
|
||||
|
||||
if c.Version() == 0 {
|
||||
return mh.Multihash(bytes)
|
||||
}
|
||||
|
||||
return buf[:n+len(c.hash)]
|
||||
// skip version length
|
||||
_, n1 := binary.Uvarint(bytes)
|
||||
// skip codec length
|
||||
_, n2 := binary.Uvarint(bytes[n1:])
|
||||
|
||||
return mh.Multihash(bytes[n1+n2:])
|
||||
}
|
||||
|
||||
func (c *Cid) Equals(o *Cid) bool {
|
||||
return c.codec == o.codec &&
|
||||
c.version == o.version &&
|
||||
bytes.Equal(c.hash, o.hash)
|
||||
// Bytes returns the byte representation of a Cid.
|
||||
// The output of bytes can be parsed back into a Cid
|
||||
// with Cast().
|
||||
func (c Cid) Bytes() []byte {
|
||||
return []byte(c.str)
|
||||
}
|
||||
|
||||
// MarshalBinary is equivalent to Bytes(). It implements the
|
||||
// encoding.BinaryMarshaler interface.
|
||||
func (c Cid) MarshalBinary() ([]byte, error) {
|
||||
return c.Bytes(), nil
|
||||
}
|
||||
|
||||
// MarshalText is equivalent to String(). It implements the
|
||||
// encoding.TextMarshaler interface.
|
||||
func (c Cid) MarshalText() ([]byte, error) {
|
||||
return []byte(c.String()), nil
|
||||
}
|
||||
|
||||
// Equals checks that two Cids are the same.
|
||||
// In order for two Cids to be considered equal, the
|
||||
// Version, the Codec and the Multihash must match.
|
||||
func (c Cid) Equals(o Cid) bool {
|
||||
return c == o
|
||||
}
|
||||
|
||||
// UnmarshalJSON parses the JSON representation of a Cid.
|
||||
func (c *Cid) UnmarshalJSON(b []byte) error {
|
||||
if len(b) < 2 {
|
||||
return fmt.Errorf("invalid cid json blob")
|
||||
}
|
||||
out, err := Decode(string(b[1 : len(b)-1]))
|
||||
obj := struct {
|
||||
CidTarget string `json:"/"`
|
||||
}{}
|
||||
objptr := &obj
|
||||
err := json.Unmarshal(b, &objptr)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
if objptr == nil {
|
||||
*c = Cid{}
|
||||
return nil
|
||||
}
|
||||
|
||||
if obj.CidTarget == "" {
|
||||
return fmt.Errorf("cid was incorrectly formatted")
|
||||
}
|
||||
|
||||
out, err := Decode(obj.CidTarget)
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
|
||||
c.version = out.version
|
||||
c.hash = out.hash
|
||||
c.codec = out.codec
|
||||
*c = out
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
func (c *Cid) MarshalJSON() ([]byte, error) {
|
||||
return []byte(fmt.Sprintf("\"%s\"", c.String())), nil
|
||||
// MarshalJSON procudes a JSON representation of a Cid, which looks as follows:
|
||||
//
|
||||
// { "/": "<cid-string>" }
|
||||
//
|
||||
// Note that this formatting comes from the IPLD specification
|
||||
// (https://github.com/ipld/specs/tree/master/ipld)
|
||||
func (c Cid) MarshalJSON() ([]byte, error) {
|
||||
if !c.Defined() {
|
||||
return []byte("null"), nil
|
||||
}
|
||||
return []byte(fmt.Sprintf("{\"/\":\"%s\"}", c.String())), nil
|
||||
}
|
||||
|
||||
func (c *Cid) KeyString() string {
|
||||
return string(c.Bytes())
|
||||
// KeyString returns the binary representation of the Cid as a string
|
||||
func (c Cid) KeyString() string {
|
||||
return c.str
|
||||
}
|
||||
|
||||
func (c *Cid) Loggable() map[string]interface{} {
|
||||
// Loggable returns a Loggable (as defined by
|
||||
// https://godoc.org/github.com/ipfs/go-log).
|
||||
func (c Cid) Loggable() map[string]interface{} {
|
||||
return map[string]interface{}{
|
||||
"cid": c,
|
||||
}
|
||||
}
|
||||
|
||||
func (c *Cid) Prefix() Prefix {
|
||||
dec, _ := mh.Decode(c.hash) // assuming we got a valid multiaddr, this will not error
|
||||
// Prefix builds and returns a Prefix out of a Cid.
|
||||
func (c Cid) Prefix() Prefix {
|
||||
dec, _ := mh.Decode(c.Hash()) // assuming we got a valid multiaddr, this will not error
|
||||
return Prefix{
|
||||
MhType: dec.Code,
|
||||
MhLength: dec.Length,
|
||||
Version: c.version,
|
||||
Codec: c.codec,
|
||||
Version: c.Version(),
|
||||
Codec: c.Type(),
|
||||
}
|
||||
}
|
||||
|
||||
// Prefix represents all the metadata of a cid, minus any actual content information
|
||||
// Prefix represents all the metadata of a Cid,
|
||||
// that is, the Version, the Codec, the Multihash type
|
||||
// and the Multihash length. It does not contains
|
||||
// any actual content information.
|
||||
// NOTE: The use -1 in MhLength to mean default length is deprecated,
|
||||
// use the V0Builder or V1Builder structures instead
|
||||
type Prefix struct {
|
||||
Version uint64
|
||||
Codec uint64
|
||||
MhType int
|
||||
MhType uint64
|
||||
MhLength int
|
||||
}
|
||||
|
||||
func (p Prefix) Sum(data []byte) (*Cid, error) {
|
||||
hash, err := mh.Sum(data, p.MhType, p.MhLength)
|
||||
// Sum uses the information in a prefix to perform a multihash.Sum()
|
||||
// and return a newly constructed Cid with the resulting multihash.
|
||||
func (p Prefix) Sum(data []byte) (Cid, error) {
|
||||
length := p.MhLength
|
||||
if p.MhType == mh.ID {
|
||||
length = -1
|
||||
}
|
||||
|
||||
hash, err := mh.Sum(data, p.MhType, length)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
return Undef, err
|
||||
}
|
||||
|
||||
switch p.Version {
|
||||
@@ -264,10 +552,13 @@ func (p Prefix) Sum(data []byte) (*Cid, error) {
|
||||
case 1:
|
||||
return NewCidV1(p.Codec, hash), nil
|
||||
default:
|
||||
return nil, fmt.Errorf("invalid cid version")
|
||||
return Undef, fmt.Errorf("invalid cid version")
|
||||
}
|
||||
}
|
||||
|
||||
// Bytes returns a byte representation of a Prefix. It looks like:
|
||||
//
|
||||
// <version><codec><mh-type><mh-length>
|
||||
func (p Prefix) Bytes() []byte {
|
||||
buf := make([]byte, 4*binary.MaxVarintLen64)
|
||||
n := binary.PutUvarint(buf, p.Version)
|
||||
@@ -277,6 +568,8 @@ func (p Prefix) Bytes() []byte {
|
||||
return buf[:n]
|
||||
}
|
||||
|
||||
// PrefixFromBytes parses a Prefix-byte representation onto a
|
||||
// Prefix.
|
||||
func PrefixFromBytes(buf []byte) (Prefix, error) {
|
||||
r := bytes.NewReader(buf)
|
||||
vers, err := binary.ReadUvarint(r)
|
||||
@@ -302,7 +595,7 @@ func PrefixFromBytes(buf []byte) (Prefix, error) {
|
||||
return Prefix{
|
||||
Version: vers,
|
||||
Codec: codec,
|
||||
MhType: int(mhtype),
|
||||
MhType: mhtype,
|
||||
MhLength: int(mhlen),
|
||||
}, nil
|
||||
}
|
||||
|
||||
@@ -23,7 +23,7 @@ func Fuzz(data []byte) int {
|
||||
if err != nil {
|
||||
panic(err.Error())
|
||||
}
|
||||
cid2 := &Cid{}
|
||||
cid2 := Cid{}
|
||||
err = cid2.UnmarshalJSON(json)
|
||||
if err != nil {
|
||||
panic(err.Error())
|
||||
|
||||
360
cid_test.go
360
cid_test.go
@@ -2,39 +2,112 @@ package cid
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"encoding/json"
|
||||
"fmt"
|
||||
"math/rand"
|
||||
"strings"
|
||||
"testing"
|
||||
|
||||
mbase "github.com/multiformats/go-multibase"
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
func assertEqual(t *testing.T, a, b *Cid) {
|
||||
if a.codec != b.codec {
|
||||
// Copying the "silly test" idea from
|
||||
// https://github.com/multiformats/go-multihash/blob/7aa9f26a231c6f34f4e9fad52bf580fd36627285/multihash_test.go#L13
|
||||
// Makes it so changing the table accidentally has to happen twice.
|
||||
var tCodecs = map[uint64]string{
|
||||
Raw: "raw",
|
||||
DagProtobuf: "protobuf",
|
||||
DagCBOR: "cbor",
|
||||
GitRaw: "git-raw",
|
||||
EthBlock: "eth-block",
|
||||
EthBlockList: "eth-block-list",
|
||||
EthTxTrie: "eth-tx-trie",
|
||||
EthTx: "eth-tx",
|
||||
EthTxReceiptTrie: "eth-tx-receipt-trie",
|
||||
EthTxReceipt: "eth-tx-receipt",
|
||||
EthStateTrie: "eth-state-trie",
|
||||
EthAccountSnapshot: "eth-account-snapshot",
|
||||
EthStorageTrie: "eth-storage-trie",
|
||||
BitcoinBlock: "bitcoin-block",
|
||||
BitcoinTx: "bitcoin-tx",
|
||||
ZcashBlock: "zcash-block",
|
||||
ZcashTx: "zcash-tx",
|
||||
DecredBlock: "decred-block",
|
||||
DecredTx: "decred-tx",
|
||||
DashBlock: "dash-block",
|
||||
DashTx: "dash-tx",
|
||||
}
|
||||
|
||||
func assertEqual(t *testing.T, a, b Cid) {
|
||||
if a.Type() != b.Type() {
|
||||
t.Fatal("mismatch on type")
|
||||
}
|
||||
|
||||
if a.version != b.version {
|
||||
if a.Version() != b.Version() {
|
||||
t.Fatal("mismatch on version")
|
||||
}
|
||||
|
||||
if !bytes.Equal(a.hash, b.hash) {
|
||||
if !bytes.Equal(a.Hash(), b.Hash()) {
|
||||
t.Fatal("multihash mismatch")
|
||||
}
|
||||
}
|
||||
|
||||
func TestTable(t *testing.T) {
|
||||
if len(tCodecs) != len(Codecs)-1 {
|
||||
t.Errorf("Item count mismatch in the Table of Codec. Should be %d, got %d", len(tCodecs)+1, len(Codecs))
|
||||
}
|
||||
|
||||
for k, v := range tCodecs {
|
||||
if Codecs[v] != k {
|
||||
t.Errorf("Table mismatch: 0x%x %s", k, v)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// The table returns cid.DagProtobuf for "v0"
|
||||
// so we test it apart
|
||||
func TestTableForV0(t *testing.T) {
|
||||
if Codecs["v0"] != DagProtobuf {
|
||||
t.Error("Table mismatch: Codecs[\"v0\"] should resolve to DagProtobuf (0x70)")
|
||||
}
|
||||
}
|
||||
|
||||
func TestPrefixSum(t *testing.T) {
|
||||
// Test creating CIDs both manually and with Prefix.
|
||||
// Tests: https://github.com/ipfs/go-cid/issues/83
|
||||
for _, hashfun := range []uint64{
|
||||
mh.ID, mh.SHA3, mh.SHA2_256,
|
||||
} {
|
||||
h1, err := mh.Sum([]byte("TEST"), hashfun, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c1 := NewCidV1(Raw, h1)
|
||||
|
||||
h2, err := mh.Sum([]byte("foobar"), hashfun, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c2 := NewCidV1(Raw, h2)
|
||||
|
||||
c3, err := c1.Prefix().Sum([]byte("foobar"))
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if !c2.Equals(c3) {
|
||||
t.Fatal("expected CIDs to be equal")
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestBasicMarshaling(t *testing.T) {
|
||||
h, err := mh.Sum([]byte("TEST"), mh.SHA3, 4)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
cid := &Cid{
|
||||
codec: 7,
|
||||
version: 1,
|
||||
hash: h,
|
||||
}
|
||||
cid := NewCidV1(7, h)
|
||||
|
||||
data := cid.Bytes()
|
||||
|
||||
@@ -54,6 +127,103 @@ func TestBasicMarshaling(t *testing.T) {
|
||||
assertEqual(t, cid, out2)
|
||||
}
|
||||
|
||||
func TestBasesMarshaling(t *testing.T) {
|
||||
h, err := mh.Sum([]byte("TEST"), mh.SHA3, 4)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
cid := NewCidV1(7, h)
|
||||
|
||||
data := cid.Bytes()
|
||||
|
||||
out, err := Cast(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
assertEqual(t, cid, out)
|
||||
|
||||
testBases := []mbase.Encoding{
|
||||
mbase.Base16,
|
||||
mbase.Base32,
|
||||
mbase.Base32hex,
|
||||
mbase.Base32pad,
|
||||
mbase.Base32hexPad,
|
||||
mbase.Base58BTC,
|
||||
mbase.Base58Flickr,
|
||||
mbase.Base64pad,
|
||||
mbase.Base64urlPad,
|
||||
mbase.Base64url,
|
||||
mbase.Base64,
|
||||
}
|
||||
|
||||
for _, b := range testBases {
|
||||
s, err := cid.StringOfBase(b)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if s[0] != byte(b) {
|
||||
t.Fatal("Invalid multibase header")
|
||||
}
|
||||
|
||||
out2, err := Decode(s)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
assertEqual(t, cid, out2)
|
||||
|
||||
encoder, err := mbase.NewEncoder(b)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
s2 := cid.Encode(encoder)
|
||||
if s != s2 {
|
||||
t.Fatalf("'%s' != '%s'", s, s2)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestBinaryMarshaling(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
hash, _ := mh.Sum(data, mh.SHA2_256, -1)
|
||||
c := NewCidV1(DagCBOR, hash)
|
||||
var c2 Cid
|
||||
|
||||
data, err := c.MarshalBinary()
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
err = c2.UnmarshalBinary(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if !c.Equals(c2) {
|
||||
t.Errorf("cids should be the same: %s %s", c, c2)
|
||||
}
|
||||
}
|
||||
|
||||
func TestTextMarshaling(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
hash, _ := mh.Sum(data, mh.SHA2_256, -1)
|
||||
c := NewCidV1(DagCBOR, hash)
|
||||
var c2 Cid
|
||||
|
||||
data, err := c.MarshalText()
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
err = c2.UnmarshalText(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if !c.Equals(c2) {
|
||||
t.Errorf("cids should be the same: %s %s", c, c2)
|
||||
}
|
||||
}
|
||||
|
||||
func TestEmptyString(t *testing.T) {
|
||||
_, err := Decode("")
|
||||
if err == nil {
|
||||
@@ -69,17 +239,33 @@ func TestV0Handling(t *testing.T) {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if cid.version != 0 {
|
||||
if cid.Version() != 0 {
|
||||
t.Fatal("should have gotten version 0 cid")
|
||||
}
|
||||
|
||||
if cid.hash.B58String() != old {
|
||||
t.Fatal("marshaling roundtrip failed")
|
||||
if cid.Hash().B58String() != old {
|
||||
t.Fatalf("marshaling roundtrip failed: %s != %s", cid.Hash().B58String(), old)
|
||||
}
|
||||
|
||||
if cid.String() != old {
|
||||
t.Fatal("marshaling roundtrip failed")
|
||||
}
|
||||
|
||||
new, err := cid.StringOfBase(mbase.Base58BTC)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if new != old {
|
||||
t.Fatal("StringOfBase roundtrip failed")
|
||||
}
|
||||
|
||||
encoder, err := mbase.NewEncoder(mbase.Base58BTC)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
if cid.Encode(encoder) != old {
|
||||
t.Fatal("Encode roundtrip failed")
|
||||
}
|
||||
}
|
||||
|
||||
func TestV0ErrorCases(t *testing.T) {
|
||||
@@ -90,6 +276,64 @@ func TestV0ErrorCases(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
func TestNewPrefixV1(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
|
||||
// Construct c1
|
||||
prefix := NewPrefixV1(DagCBOR, mh.SHA2_256)
|
||||
c1, err := prefix.Sum(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if c1.Prefix() != prefix {
|
||||
t.Fatal("prefix not preserved")
|
||||
}
|
||||
|
||||
// Construct c2
|
||||
hash, err := mh.Sum(data, mh.SHA2_256, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c2 := NewCidV1(DagCBOR, hash)
|
||||
|
||||
if !c1.Equals(c2) {
|
||||
t.Fatal("cids mismatch")
|
||||
}
|
||||
if c1.Prefix() != c2.Prefix() {
|
||||
t.Fatal("prefixes mismatch")
|
||||
}
|
||||
}
|
||||
|
||||
func TestNewPrefixV0(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
|
||||
// Construct c1
|
||||
prefix := NewPrefixV0(mh.SHA2_256)
|
||||
c1, err := prefix.Sum(data)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if c1.Prefix() != prefix {
|
||||
t.Fatal("prefix not preserved")
|
||||
}
|
||||
|
||||
// Construct c2
|
||||
hash, err := mh.Sum(data, mh.SHA2_256, -1)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
c2 := NewCidV0(hash)
|
||||
|
||||
if !c1.Equals(c2) {
|
||||
t.Fatal("cids mismatch")
|
||||
}
|
||||
if c1.Prefix() != c2.Prefix() {
|
||||
t.Fatal("prefixes mismatch")
|
||||
}
|
||||
}
|
||||
|
||||
func TestPrefixRoundtrip(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
hash, _ := mh.Sum(data, mh.SHA2_256, -1)
|
||||
@@ -122,9 +366,7 @@ func TestPrefixRoundtrip(t *testing.T) {
|
||||
func Test16BytesVarint(t *testing.T) {
|
||||
data := []byte("this is some test content")
|
||||
hash, _ := mh.Sum(data, mh.SHA2_256, -1)
|
||||
c := NewCidV1(DagCBOR, hash)
|
||||
|
||||
c.codec = 1 << 63
|
||||
c := NewCidV1(1<<63, hash)
|
||||
_ = c.Bytes()
|
||||
}
|
||||
|
||||
@@ -167,8 +409,8 @@ func TestParse(t *testing.T) {
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
if cid.version != 0 {
|
||||
return fmt.Errorf("expected version 0, got %s", string(cid.version))
|
||||
if cid.Version() != 0 {
|
||||
return fmt.Errorf("expected version 0, got %s", string(cid.Version()))
|
||||
}
|
||||
actual := cid.Hash().B58String()
|
||||
if actual != expected {
|
||||
@@ -188,3 +430,87 @@ func TestParse(t *testing.T) {
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func TestHexDecode(t *testing.T) {
|
||||
hexcid := "f015512209d8453505bdc6f269678e16b3e56c2a2948a41f2c792617cc9611ed363c95b63"
|
||||
c, err := Decode(hexcid)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if c.String() != "bafkreie5qrjvaw64n4tjm6hbnm7fnqvcssfed4whsjqxzslbd3jwhsk3mm" {
|
||||
t.Fatal("hash value failed to round trip decoding from hex")
|
||||
}
|
||||
}
|
||||
|
||||
func ExampleDecode() {
|
||||
encoded := "bafkreie5qrjvaw64n4tjm6hbnm7fnqvcssfed4whsjqxzslbd3jwhsk3mm"
|
||||
c, err := Decode(encoded)
|
||||
if err != nil {
|
||||
fmt.Printf("Error: %s", err)
|
||||
return
|
||||
}
|
||||
|
||||
fmt.Println(c)
|
||||
// Output: bafkreie5qrjvaw64n4tjm6hbnm7fnqvcssfed4whsjqxzslbd3jwhsk3mm
|
||||
}
|
||||
|
||||
func TestFromJson(t *testing.T) {
|
||||
cval := "bafkreie5qrjvaw64n4tjm6hbnm7fnqvcssfed4whsjqxzslbd3jwhsk3mm"
|
||||
jsoncid := []byte(`{"/":"` + cval + `"}`)
|
||||
var c Cid
|
||||
err := json.Unmarshal(jsoncid, &c)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
if c.String() != cval {
|
||||
t.Fatal("json parsing failed")
|
||||
}
|
||||
}
|
||||
|
||||
func TestJsonRoundTrip(t *testing.T) {
|
||||
exp, err := Decode("bafkreie5qrjvaw64n4tjm6hbnm7fnqvcssfed4whsjqxzslbd3jwhsk3mm")
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
// Verify it works for a *Cid.
|
||||
enc, err := json.Marshal(exp)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
var actual Cid
|
||||
err = json.Unmarshal(enc, &actual)
|
||||
if !exp.Equals(actual) {
|
||||
t.Fatal("cids not equal for *Cid")
|
||||
}
|
||||
|
||||
// Verify it works for a Cid.
|
||||
enc, err = json.Marshal(exp)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
var actual2 Cid
|
||||
err = json.Unmarshal(enc, &actual2)
|
||||
if !exp.Equals(actual2) {
|
||||
t.Fatal("cids not equal for Cid")
|
||||
}
|
||||
}
|
||||
|
||||
func BenchmarkStringV1(b *testing.B) {
|
||||
data := []byte("this is some test content")
|
||||
hash, _ := mh.Sum(data, mh.SHA2_256, -1)
|
||||
cid := NewCidV1(Raw, hash)
|
||||
|
||||
b.ReportAllocs()
|
||||
b.ResetTimer()
|
||||
|
||||
count := 0
|
||||
for i := 0; i < b.N; i++ {
|
||||
count += len(cid.String())
|
||||
}
|
||||
if count != 49*b.N {
|
||||
b.FailNow()
|
||||
}
|
||||
}
|
||||
|
||||
3
codecov.yml
Normal file
3
codecov.yml
Normal file
@@ -0,0 +1,3 @@
|
||||
coverage:
|
||||
range: "50...100"
|
||||
comment: off
|
||||
28
deprecated.go
Normal file
28
deprecated.go
Normal file
@@ -0,0 +1,28 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
// NewPrefixV0 returns a CIDv0 prefix with the specified multihash type.
|
||||
// DEPRECATED: Use V0Builder
|
||||
func NewPrefixV0(mhType uint64) Prefix {
|
||||
return Prefix{
|
||||
MhType: mhType,
|
||||
MhLength: mh.DefaultLengths[mhType],
|
||||
Version: 0,
|
||||
Codec: DagProtobuf,
|
||||
}
|
||||
}
|
||||
|
||||
// NewPrefixV1 returns a CIDv1 prefix with the specified codec and multihash
|
||||
// type.
|
||||
// DEPRECATED: Use V1Builder
|
||||
func NewPrefixV1(codecType uint64, mhType uint64) Prefix {
|
||||
return Prefix{
|
||||
MhType: mhType,
|
||||
MhLength: mh.DefaultLengths[mhType],
|
||||
Version: 1,
|
||||
Codec: codecType,
|
||||
}
|
||||
}
|
||||
6
go.mod
Normal file
6
go.mod
Normal file
@@ -0,0 +1,6 @@
|
||||
module github.com/ipfs/go-cid
|
||||
|
||||
require (
|
||||
github.com/multiformats/go-multibase v0.0.1
|
||||
github.com/multiformats/go-multihash v0.0.1
|
||||
)
|
||||
20
go.sum
Normal file
20
go.sum
Normal file
@@ -0,0 +1,20 @@
|
||||
github.com/gxed/hashland/keccakpg v0.0.1 h1:wrk3uMNaMxbXiHibbPO4S0ymqJMm41WiudyFSs7UnsU=
|
||||
github.com/gxed/hashland/keccakpg v0.0.1/go.mod h1:kRzw3HkwxFU1mpmPP8v1WyQzwdGfmKFJ6tItnhQ67kU=
|
||||
github.com/gxed/hashland/murmur3 v0.0.1 h1:SheiaIt0sda5K+8FLz952/1iWS9zrnKsEJaOJu4ZbSc=
|
||||
github.com/gxed/hashland/murmur3 v0.0.1/go.mod h1:KjXop02n4/ckmZSnY2+HKcLud/tcmvhST0bie/0lS48=
|
||||
github.com/minio/blake2b-simd v0.0.0-20160723061019-3f5f724cb5b1 h1:lYpkrQH5ajf0OXOcUbGjvZxxijuBwbbmlSxLiuofa+g=
|
||||
github.com/minio/blake2b-simd v0.0.0-20160723061019-3f5f724cb5b1/go.mod h1:pD8RvIylQ358TN4wwqatJ8rNavkEINozVn9DtGI3dfQ=
|
||||
github.com/minio/sha256-simd v0.0.0-20190131020904-2d45a736cd16 h1:5W7KhL8HVF3XCFOweFD3BNESdnO8ewyYTFT2R+/b8FQ=
|
||||
github.com/minio/sha256-simd v0.0.0-20190131020904-2d45a736cd16/go.mod h1:2FMWW+8GMoPweT6+pI63m9YE3Lmw4J71hV56Chs1E/U=
|
||||
github.com/mr-tron/base58 v1.1.0 h1:Y51FGVJ91WBqCEabAi5OPUz38eAx8DakuAm5svLcsfQ=
|
||||
github.com/mr-tron/base58 v1.1.0/go.mod h1:xcD2VGqlgYjBdcBLw+TuYLr8afG+Hj8g2eTVqeSzSU8=
|
||||
github.com/multiformats/go-base32 v0.0.3 h1:tw5+NhuwaOjJCC5Pp82QuXbrmLzWg7uxlMFp8Nq/kkI=
|
||||
github.com/multiformats/go-base32 v0.0.3/go.mod h1:pLiuGC8y0QR3Ue4Zug5UzK9LjgbkL8NSQj0zQ5Nz/AA=
|
||||
github.com/multiformats/go-multibase v0.0.1 h1:PN9/v21eLywrFWdFNsFKaU04kLJzuYzmrJR+ubhT9qA=
|
||||
github.com/multiformats/go-multibase v0.0.1/go.mod h1:bja2MqRZ3ggyXtZSEDKpl0uO/gviWFaSteVbWT51qgs=
|
||||
github.com/multiformats/go-multihash v0.0.1 h1:HHwN1K12I+XllBCrqKnhX949Orn4oawPkegHMu2vDqQ=
|
||||
github.com/multiformats/go-multihash v0.0.1/go.mod h1:w/5tugSrLEbWqlcgJabL3oHFKTwfvkofsjW2Qa1ct4U=
|
||||
golang.org/x/crypto v0.0.0-20190211182817-74369b46fc67 h1:ng3VDlRp5/DHpSWl02R4rM9I+8M2rhmsuLwAMmkLQWE=
|
||||
golang.org/x/crypto v0.0.0-20190211182817-74369b46fc67/go.mod h1:6SG95UA2DQfeDnfUPMdvaQW0Q7yPrPDi9nlGo2tz2b4=
|
||||
golang.org/x/sys v0.0.0-20190219092855-153ac476189d h1:Z0Ahzd7HltpJtjAHHxX8QFP3j1yYgiuvjbjRzDj/KH0=
|
||||
golang.org/x/sys v0.0.0-20190219092855-153ac476189d/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=
|
||||
10
package.json
10
package.json
@@ -9,15 +9,15 @@
|
||||
"gxDependencies": [
|
||||
{
|
||||
"author": "whyrusleeping",
|
||||
"hash": "QmYDds3421prZgqKbLpEK7T9Aa2eVdQ7o3YarX1LVLdP2J",
|
||||
"hash": "QmerPMzPk1mJVowm8KgmoknWa4yCYvvugMPsgWmDNUvDLW",
|
||||
"name": "go-multihash",
|
||||
"version": "1.0.0"
|
||||
"version": "1.0.9"
|
||||
},
|
||||
{
|
||||
"author": "whyrusleeping",
|
||||
"hash": "QmUq3H9YpcPphbRj6ct6rBgBE377A8wANP8zPMRqe1WYbf",
|
||||
"hash": "QmekxXDhCxCJRNuzmHreuaT3BsuJcsjcXWNrtV9C8DRHtd",
|
||||
"name": "go-multibase",
|
||||
"version": "0.2.1"
|
||||
"version": "0.3.0"
|
||||
}
|
||||
],
|
||||
"gxVersion": "0.8.0",
|
||||
@@ -25,6 +25,6 @@
|
||||
"license": "MIT",
|
||||
"name": "go-cid",
|
||||
"releaseCmd": "git commit -a -m \"gx publish $VERSION\"",
|
||||
"version": "0.7.7"
|
||||
"version": "0.9.3"
|
||||
}
|
||||
|
||||
|
||||
44
set.go
44
set.go
@@ -1,40 +1,49 @@
|
||||
package cid
|
||||
|
||||
// Set is a implementation of a set of Cids, that is, a structure
|
||||
// to which holds a single copy of every Cids that is added to it.
|
||||
type Set struct {
|
||||
set map[string]struct{}
|
||||
set map[Cid]struct{}
|
||||
}
|
||||
|
||||
// NewSet initializes and returns a new Set.
|
||||
func NewSet() *Set {
|
||||
return &Set{set: make(map[string]struct{})}
|
||||
return &Set{set: make(map[Cid]struct{})}
|
||||
}
|
||||
|
||||
func (s *Set) Add(c *Cid) {
|
||||
s.set[string(c.Bytes())] = struct{}{}
|
||||
// Add puts a Cid in the Set.
|
||||
func (s *Set) Add(c Cid) {
|
||||
s.set[c] = struct{}{}
|
||||
}
|
||||
|
||||
func (s *Set) Has(c *Cid) bool {
|
||||
_, ok := s.set[string(c.Bytes())]
|
||||
// Has returns if the Set contains a given Cid.
|
||||
func (s *Set) Has(c Cid) bool {
|
||||
_, ok := s.set[c]
|
||||
return ok
|
||||
}
|
||||
|
||||
func (s *Set) Remove(c *Cid) {
|
||||
delete(s.set, string(c.Bytes()))
|
||||
// Remove deletes a Cid from the Set.
|
||||
func (s *Set) Remove(c Cid) {
|
||||
delete(s.set, c)
|
||||
}
|
||||
|
||||
// Len returns how many elements the Set has.
|
||||
func (s *Set) Len() int {
|
||||
return len(s.set)
|
||||
}
|
||||
|
||||
func (s *Set) Keys() []*Cid {
|
||||
out := make([]*Cid, 0, len(s.set))
|
||||
for k, _ := range s.set {
|
||||
c, _ := Cast([]byte(k))
|
||||
out = append(out, c)
|
||||
// Keys returns the Cids in the set.
|
||||
func (s *Set) Keys() []Cid {
|
||||
out := make([]Cid, 0, len(s.set))
|
||||
for k := range s.set {
|
||||
out = append(out, k)
|
||||
}
|
||||
return out
|
||||
}
|
||||
|
||||
func (s *Set) Visit(c *Cid) bool {
|
||||
// Visit adds a Cid to the set only if it is
|
||||
// not in it already.
|
||||
func (s *Set) Visit(c Cid) bool {
|
||||
if !s.Has(c) {
|
||||
s.Add(c)
|
||||
return true
|
||||
@@ -43,9 +52,10 @@ func (s *Set) Visit(c *Cid) bool {
|
||||
return false
|
||||
}
|
||||
|
||||
func (s *Set) ForEach(f func(c *Cid) error) error {
|
||||
for cs, _ := range s.set {
|
||||
c, _ := Cast([]byte(cs))
|
||||
// ForEach allows to run a custom function on each
|
||||
// Cid in the set.
|
||||
func (s *Set) ForEach(f func(c Cid) error) error {
|
||||
for c := range s.set {
|
||||
err := f(c)
|
||||
if err != nil {
|
||||
return err
|
||||
|
||||
88
set_test.go
Normal file
88
set_test.go
Normal file
@@ -0,0 +1,88 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"crypto/rand"
|
||||
"errors"
|
||||
"testing"
|
||||
|
||||
mh "github.com/multiformats/go-multihash"
|
||||
)
|
||||
|
||||
func makeRandomCid(t *testing.T) Cid {
|
||||
p := make([]byte, 256)
|
||||
_, err := rand.Read(p)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
h, err := mh.Sum(p, mh.SHA3, 4)
|
||||
if err != nil {
|
||||
t.Fatal(err)
|
||||
}
|
||||
|
||||
cid := NewCidV1(7, h)
|
||||
|
||||
return cid
|
||||
}
|
||||
|
||||
func TestSet(t *testing.T) {
|
||||
cid := makeRandomCid(t)
|
||||
cid2 := makeRandomCid(t)
|
||||
s := NewSet()
|
||||
|
||||
s.Add(cid)
|
||||
|
||||
if !s.Has(cid) {
|
||||
t.Error("should have the CID")
|
||||
}
|
||||
|
||||
if s.Len() != 1 {
|
||||
t.Error("should report 1 element")
|
||||
}
|
||||
|
||||
keys := s.Keys()
|
||||
|
||||
if len(keys) != 1 || !keys[0].Equals(cid) {
|
||||
t.Error("key should correspond to Cid")
|
||||
}
|
||||
|
||||
if s.Visit(cid) {
|
||||
t.Error("visit should return false")
|
||||
}
|
||||
|
||||
foreach := []Cid{}
|
||||
foreachF := func(c Cid) error {
|
||||
foreach = append(foreach, c)
|
||||
return nil
|
||||
}
|
||||
|
||||
if err := s.ForEach(foreachF); err != nil {
|
||||
t.Error(err)
|
||||
}
|
||||
|
||||
if len(foreach) != 1 {
|
||||
t.Error("ForEach should have visited 1 element")
|
||||
}
|
||||
|
||||
foreachErr := func(c Cid) error {
|
||||
return errors.New("test")
|
||||
}
|
||||
|
||||
if err := s.ForEach(foreachErr); err == nil {
|
||||
t.Error("Should have returned an error")
|
||||
}
|
||||
|
||||
if !s.Visit(cid2) {
|
||||
t.Error("should have visited a new Cid")
|
||||
}
|
||||
|
||||
if s.Len() != 2 {
|
||||
t.Error("len should be 2 now")
|
||||
}
|
||||
|
||||
s.Remove(cid2)
|
||||
|
||||
if s.Len() != 1 {
|
||||
t.Error("len should be 1 now")
|
||||
}
|
||||
}
|
||||
34
varint.go
Normal file
34
varint.go
Normal file
@@ -0,0 +1,34 @@
|
||||
package cid
|
||||
|
||||
// Version of varint function that work with a string rather than
|
||||
// []byte to avoid unnecessary allocation
|
||||
|
||||
// Copyright 2011 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license as given at https://golang.org/LICENSE
|
||||
|
||||
// uvarint decodes a uint64 from buf and returns that value and the
|
||||
// number of characters read (> 0). If an error occurred, the value is 0
|
||||
// and the number of bytes n is <= 0 meaning:
|
||||
//
|
||||
// n == 0: buf too small
|
||||
// n < 0: value larger than 64 bits (overflow)
|
||||
// and -n is the number of bytes read
|
||||
//
|
||||
func uvarint(buf string) (uint64, int) {
|
||||
var x uint64
|
||||
var s uint
|
||||
// we have a binary string so we can't use a range loope
|
||||
for i := 0; i < len(buf); i++ {
|
||||
b := buf[i]
|
||||
if b < 0x80 {
|
||||
if i > 9 || i == 9 && b > 1 {
|
||||
return 0, -(i + 1) // overflow
|
||||
}
|
||||
return x | uint64(b)<<s, i + 1
|
||||
}
|
||||
x |= uint64(b&0x7f) << s
|
||||
s += 7
|
||||
}
|
||||
return 0, 0
|
||||
}
|
||||
22
varint_test.go
Normal file
22
varint_test.go
Normal file
@@ -0,0 +1,22 @@
|
||||
package cid
|
||||
|
||||
import (
|
||||
"encoding/binary"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestUvarintRoundTrip(t *testing.T) {
|
||||
testCases := []uint64{0, 1, 2, 127, 128, 129, 255, 256, 257, 1<<63 - 1}
|
||||
for _, tc := range testCases {
|
||||
buf := make([]byte, 16)
|
||||
binary.PutUvarint(buf, tc)
|
||||
v, l1 := uvarint(string(buf))
|
||||
_, l2 := binary.Uvarint(buf)
|
||||
if tc != v {
|
||||
t.Errorf("roundtrip failed expected %d but got %d", tc, v)
|
||||
}
|
||||
if l1 != l2 {
|
||||
t.Errorf("length incorrect expected %d but got %d", l2, l1)
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user