log.go

// Package ipfslog implements an append-only log CRDT on IPFS
package ipfslog // import "berty.tech/go-ipfs-log"

import (
	"context"
	"strconv"
	"strings"
	"sync"
	"time"

	"github.com/iancoleman/orderedmap"
	"github.com/ipfs/go-cid"
	cbornode "github.com/ipfs/go-ipld-cbor"
	core_iface "github.com/ipfs/interface-go-ipfs-core"
	"github.com/polydawn/refmt/obj/atlas"

	"berty.tech/go-ipfs-log/accesscontroller"
	"berty.tech/go-ipfs-log/entry"
	"berty.tech/go-ipfs-log/entry/sorting"
	"berty.tech/go-ipfs-log/errmsg"
	"berty.tech/go-ipfs-log/identityprovider"
	"berty.tech/go-ipfs-log/iface"
)

type Snapshot = iface.Snapshot
type JSONLog = iface.JSONLog
type LogOptions = iface.LogOptions
type IteratorOptions = iface.IteratorOptions

type Entry = iface.IPFSLogEntry
type Log = iface.IPFSLog
type AppendOptions = iface.AppendOptions
type SortFn = iface.EntrySortFn

type IPFSLog struct {
	Storage          core_iface.CoreAPI
	ID               string
	AccessController accesscontroller.Interface
	SortFn           iface.EntrySortFn
	Identity         *identityprovider.Identity
	Entries          iface.IPFSLogOrderedEntries
	heads            iface.IPFSLogOrderedEntries
	Next             iface.IPFSLogOrderedEntries
	Clock            iface.IPFSLogLamportClock
	concurrency      uint
	lock             sync.RWMutex
}

func (l *IPFSLog) RawHeads() iface.IPFSLogOrderedEntries {
	l.lock.RLock()
	heads := l.heads
	l.lock.RUnlock()

	return heads
}

// maxInt Returns the larger of x or y
func maxInt(x, y int) int {
	if x < y {
		return y
	}
	return x
}

// minInt Returns the larger of x or y
func minInt(x, y int) int {
	if x > y {
		return y
	}
	return x
}

func maxClockTimeForEntries(entries []iface.IPFSLogEntry, defValue int) int {
	max := defValue
	for _, e := range entries {
		max = maxInt(e.GetClock().GetTime(), max)
	}

	return max
}

// NewLog Creates creates a new IPFSLog for a given identity
//
// Each IPFSLog gets a unique ID, which can be passed in the options as ID.
//
// Returns a log instance.
//
// ipfs is an instance of IPFS.
//
// identity is an instance of Identity and will be used to sign entries
// Usually this should be a user id or similar.
//
// options.AccessController is an instance of accesscontroller.Interface,
// which by default allows anyone to append to the IPFSLog.
func NewLog(services core_iface.CoreAPI, identity *identityprovider.Identity, options *LogOptions) (*IPFSLog, error) {
	if services == nil {
		return nil, errmsg.ErrIPFSNotDefined
	}

	if identity == nil {
		return nil, errmsg.ErrIdentityNotDefined
	}

	if options == nil {
		options = &LogOptions{}
	}

	if options.ID == "" {
		options.ID = strconv.FormatInt(time.Now().Unix()/1000, 10)
	}

	if options.SortFn == nil {
		options.SortFn = sorting.LastWriteWins
	}

	maxTime := 0
	if options.Clock != nil {
		maxTime = options.Clock.GetTime()
	}
	maxTime = maxClockTimeForEntries(options.Heads, maxTime)

	if options.AccessController == nil {
		options.AccessController = &accesscontroller.Default{}
	}

	if options.Entries == nil {
		options.Entries = entry.NewOrderedMap()
	}

	if len(options.Heads) == 0 && options.Entries.Len() > 0 {
		options.Heads = entry.FindHeads(options.Entries)
	}

	if options.Concurrency == 0 {
		options.Concurrency = 16
	}

	next := entry.NewOrderedMap()
	for _, key := range options.Entries.Keys() {
		e := options.Entries.UnsafeGet(key)
		for _, n := range e.GetNext() {
			next.Set(n.String(), e)
		}
	}

	return &IPFSLog{
		Storage:          services,
		ID:               options.ID,
		Identity:         identity,
		AccessController: options.AccessController,
		SortFn:           sorting.NoZeroes(options.SortFn),
		Entries:          options.Entries.Copy(),
		heads:            entry.NewOrderedMapFromEntries(options.Heads),
		Next:             next,
		Clock:            entry.NewLamportClock(identity.PublicKey, maxTime),
		concurrency:      options.Concurrency,
	}, nil
}

func (l *IPFSLog) SetIdentity(identity *identityprovider.Identity) {
	l.lock.Lock()
	defer l.lock.Unlock()

	l.Identity = identity

	// Find the latest clock from the heads
	t := l.Clock.GetTime()
	for _, h := range l.heads.Slice() {
		t = maxInt(t, h.GetClock().GetTime())
	}

	l.Clock = entry.NewLamportClock(identity.PublicKey, t)
}

// addToStack Add an entry to the stack and traversed nodes index
func (l *IPFSLog) addToStack(e iface.IPFSLogEntry, stack []iface.IPFSLogEntry, traversed *orderedmap.OrderedMap) []iface.IPFSLogEntry {
	// If we've already processed the entry, don't add it to the stack
	if _, ok := traversed.Get(e.GetHash().String()); ok {
		return stack
	}

	// Add the entry in front of the stack and sort
	stack = append([]iface.IPFSLogEntry{e}, stack...)
	sorting.Sort(l.SortFn, stack)
	sorting.Reverse(stack)

	// Add to the cache of processed entries
	traversed.Set(e.GetHash().String(), true)

	return stack
}

func (l *IPFSLog) traverse(rootEntries iface.IPFSLogOrderedEntries, amount int, endHash string) (iface.IPFSLogOrderedEntries, error) {
	// l.lock must be RLocked

	if rootEntries == nil {
		return nil, errmsg.ErrEntriesNotDefined
	}

	// Sort the given given root entries and use as the starting stack
	stack := rootEntries.Slice()

	sorting.Sort(l.SortFn, stack)
	sorting.Reverse(stack)

	// Cache for checking if we've processed an entry already
	traversed := orderedmap.New()
	// End result
	result := entry.NewOrderedMap()
	// We keep a counter to check if we have traversed requested amount of entries
	count := 0

	// Start traversal
	// Process stack until it's empty (traversed the full log)
	// or when we have the requested amount of entries
	// If requested entry amount is -1, traverse all
	for len(stack) > 0 && (amount < 0 || count < amount) {
		// Get the next element from the stack
		e := stack[0]
		stack = stack[1:]

		// Add to the result
		result.Set(e.GetHash().String(), e)
		traversed.Set(e.GetHash().String(), true)
		count++

		// If it is the specified end hash, break out of the while loop
		if e.GetHash().String() == endHash {
			break
		}

		// Add entry's next references to the stack
		for _, c := range e.GetNext() {
			next, ok := l.Entries.Get(c.String())
			if !ok {
				continue
			}

			stack = l.addToStack(next, stack, traversed)
		}
	}

	return result, nil
}

// If pointer count is 4, returns 2
// If pointer count is 8, returns 3 references
// If pointer count is 512, returns 9 references
// If pointer count is 2048, returns 11 references
func getEveryPow2(all iface.IPFSLogOrderedEntries, maxDistance int) []Entry {
	var entries []Entry

	for i := 1; i <= maxDistance; i *= 2 {
		idx := minInt(all.Len()-1, i-1)

		e := all.At(uint(idx))
		if e == nil {
			continue
		}

		entries = append(entries, e)
	}

	return entries
}

func (l *IPFSLog) Get(c cid.Cid) (Entry, bool) {
	l.lock.RLock()
	defer l.lock.RUnlock()

	return l.Entries.Get(c.String())
}

func (l *IPFSLog) Has(c cid.Cid) bool {
	l.lock.RLock()
	defer l.lock.RUnlock()

	_, ok := l.Entries.Get(c.String())

	return ok
}

// Append Appends an entry to the log Returns the latest Entry
//
// payload is the data that will be in the Entry
func (l *IPFSLog) Append(ctx context.Context, payload []byte, opts *AppendOptions) (iface.IPFSLogEntry, error) {
	l.lock.Lock()
	defer l.lock.Unlock()

	// next and refs are empty slices instead of nil
	next := []cid.Cid{}
	refs := []cid.Cid{}

	// Update the clock (find the latest clock)
	heads := l.sortedHeads(l.heads.Slice())

	if opts == nil {
		opts = &AppendOptions{}
	}

	pointerCount := 1
	if opts.PointerCount != 0 {
		pointerCount = opts.PointerCount
	}

	// const newTime = Math.max(this.clock.time, this.heads.reduce(maxClockTimeReducer, 0)) + 1
	// this._clock = new Clock(this.clock.id, newTime)

	newTime := maxClockTimeForEntries(heads.Slice(), 0)
	newTime = maxInt(l.Clock.GetTime(), newTime) + 1

	clockID := l.Clock.GetID()

	l.Clock = entry.NewLamportClock(clockID, newTime)

	// Get the required amount of hashes to next entries (as per current state of the log)
	all, err := l.traverse(heads, maxInt(pointerCount, heads.Len()), "")
	if err != nil {
		return nil, errmsg.ErrLogAppendFailed.Wrap(err)
	}

	references := getEveryPow2(all, minInt(pointerCount, all.Len()))

	// Always include the last known reference
	if all.Len() < pointerCount {
		ref := all.At(uint(all.Len() - 1))
		if ref != nil {
			references = append(references, ref)
		}
	}

	for _, h := range heads.Slice() {
		next = append([]cid.Cid{h.GetHash()}, next...)
	}

	for _, r := range references {
		isInNext := false
		for _, n := range next {
			if r.GetHash().Equals(n) {
				isInNext = true
				break
			}
		}

		if !isInNext {
			refs = append(refs, r.GetHash())
		}
	}

	// TODO: ensure port of ```Object.keys(Object.assign({}, this._headsIndex, references))``` is correctly implemented

	// @TODO: Split Entry.create into creating object, checking permission, signing and then posting to IPFS
	// Create the entry and add it to the internal cache
	e, err := entry.CreateEntry(ctx, l.Storage, l.Identity, &entry.Entry{
		LogID:   l.ID,
		Payload: payload,
		Next:    next,
		Clock:   entry.NewLamportClock(l.Clock.GetID(), l.Clock.GetTime()),
		Refs:    refs,
	}, &iface.CreateEntryOptions{
		Pin: opts.Pin,
	})

	if err != nil {
		return nil, errmsg.ErrLogAppendFailed.Wrap(err)
	}

	if err := l.AccessController.CanAppend(e, l.Identity.Provider, &CanAppendContext{log: l}); err != nil {
		return nil, errmsg.ErrLogAppendDenied.Wrap(err)
	}

	l.Entries.Set(e.Hash.String(), e)

	for _, nextEntryCid := range next {
		l.Next.Set(nextEntryCid.String(), e)
	}

	l.heads = entry.NewOrderedMapFromEntries([]iface.IPFSLogEntry{e})

	return e, nil
}

type CanAppendContext struct {
	log *IPFSLog
}

func (c *CanAppendContext) GetLogEntries() []accesscontroller.LogEntry {
	logEntries := c.log.Entries.Slice()

	var entries = make([]accesscontroller.LogEntry, len(logEntries))
	for i := range logEntries {
		entries[i] = logEntries[i]
	}

	return entries
}

/* Iterator Provides entries values on a channel */
func (l *IPFSLog) Iterator(options *IteratorOptions, output chan<- iface.IPFSLogEntry) error {
	l.lock.RLock()
	amount := -1
	if options == nil {
		return errmsg.ErrIteratorOptionsNotDefined
	}

	if output == nil {
		return errmsg.ErrOutputChannelNotDefined
	}

	if options.Amount != nil {
		if *options.Amount == 0 {
			return nil
		}
		amount = *options.Amount
	}

	start := l.sortedHeads(l.heads.Slice()).Slice()

	if options.LTE != nil {
		start = nil

		for _, c := range options.LTE {
			e, ok := l.Entries.Get(c.String())
			if !ok {
				return errmsg.ErrFilterLTENotFound
			}
			start = append(start, e)
		}
	} else if options.LT != nil {
		for _, c := range options.LT {
			e, ok := l.Entries.Get(c.String())
			if !ok {
				return errmsg.ErrFilterLTNotFound
			}

			start = nil
			for _, n := range e.GetNext() {
				e, ok := l.Entries.Get(n.String())
				if !ok {
					return errmsg.ErrFilterLTNotFound
				}
				start = append(start, e)
			}
		}
	}

	endHash := ""
	if options.GTE.Defined() {
		endHash = options.GTE.String()
	} else if options.GT.Defined() {
		endHash = options.GT.String()
	}

	count := -1
	if endHash == "" && options.Amount != nil {
		count = amount
	}

	entriesMap, err := l.traverse(entry.NewOrderedMapFromEntries(start), count, endHash)
	l.lock.RUnlock()
	if err != nil {
		return errmsg.ErrLogTraverseFailed.Wrap(err)
	}

	entries := entriesMap.Slice()

	if options.GT.Defined() && len(entries) > 0 {
		entries = entries[:len(entries)-1]
	}

	// Deal with the amount argument working backwards from gt/gte
	if (options.GT.Defined() || options.GTE.Defined()) && amount > -1 {
		entries = entries[len(entries)-amount:]
	}

	for i := range entries {
		output <- entries[i]
	}

	close(output)

	return nil
}

// Join Joins the log with another log
//
// Returns a log instance.
//
// The size of the joined log can be specified by specifying the size argument, to include all values use -1
func (l *IPFSLog) Join(otherLog iface.IPFSLog, size int) (iface.IPFSLog, error) {
	// INFO: JS default size is -1

	if otherLog == nil || l == nil {
		return nil, errmsg.ErrLogJoinNotDefined
	}

	// joining same log instance
	if l == otherLog {
		return l, nil
	}

	// joining different logs
	if l.ID != otherLog.GetID() {
		return l, nil
	}

	l.lock.Lock()
	defer l.lock.Unlock()

	newItems := difference(otherLog.GetEntries(), otherLog.RawHeads(), l)

	wg := &sync.WaitGroup{}
	wg.Add(newItems.Len())
	var err error

	// TODO: use l.concurrency ?
	for _, k := range newItems.Keys() {
		go func(k string) {
			defer wg.Done()

			e := newItems.UnsafeGet(k)
			if e == nil {
				err = errmsg.ErrLogJoinFailed
				return
			}

			if inErr := l.AccessController.CanAppend(e, l.Identity.Provider, &CanAppendContext{log: l}); inErr != nil {
				err = inErr
				return
			}

			if inErr := e.Verify(l.Identity.Provider); inErr != nil {
				err = errmsg.ErrSigNotVerified.Wrap(inErr)
				return
			}
		}(k)
	}

	wg.Wait()
	if err != nil {
		return nil, errmsg.ErrLogJoinFailed.Wrap(err)
	}

	for _, k := range newItems.Keys() {
		e := newItems.UnsafeGet(k)
		for _, next := range e.GetNext() {
			l.Next.Set(next.String(), e)
		}

		l.Entries.Set(e.GetHash().String(), e)
	}

	nextsFromNewItems := orderedmap.New()
	for _, k := range newItems.Keys() {
		e := newItems.UnsafeGet(k)
		for _, n := range e.GetNext() {
			nextsFromNewItems.Set(n.String(), true)
		}
	}

	mergedHeads := entry.FindHeads(l.heads.Merge(otherLog.RawHeads()))

	for idx, e := range mergedHeads {
		// notReferencedByNewItems
		if _, ok := nextsFromNewItems.Get(e.GetHash().String()); ok {
			mergedHeads[idx] = nil
		}

		// notInCurrentNexts
		if _, ok := l.Next.Get(e.GetHash().String()); ok {
			mergedHeads[idx] = nil
		}
	}

	l.heads = entry.NewOrderedMapFromEntries(mergedHeads)

	if size > -1 {
		tmp := l.values().Slice()
		tmp = tmp[len(tmp)-size:]

		entries := entry.NewOrderedMapFromEntries(tmp)
		heads := entry.NewOrderedMapFromEntries(entry.FindHeads(entry.NewOrderedMapFromEntries(tmp)))

		l.Entries = entries
		l.heads = heads
	}

	// Find the latest clock from the heads
	headsSlice := l.heads.Slice()
	clockID := l.Clock.GetID()

	maxClock := maxClockTimeForEntries(headsSlice, 0)
	clockTime := maxInt(l.Clock.GetTime(), maxClock)

	l.Clock = entry.NewLamportClock(clockID, clockTime)

	return l, nil
}

func difference(entriesA, headsA iface.IPFSLogOrderedEntries, logB *IPFSLog) iface.IPFSLogOrderedEntries {
	if entriesA == nil || entriesA.Len() == 0 || headsA.Len() == 0 || logB == nil {
		return entry.NewOrderedMap()
	}

	if logB.Entries == nil {
		logB.Entries = entry.NewOrderedMap()
	}

	stack := headsA.Keys()
	traversed := map[string]bool{}
	res := entry.NewOrderedMap()

	for {
		if len(stack) == 0 {
			break
		}
		hash := stack[0]
		stack = stack[1:]

		eA, okA := entriesA.Get(hash)
		_, okB := logB.Entries.Get(hash)

		if okA && !okB && eA.GetLogID() == logB.ID {
			res.Set(hash, eA)
			traversed[hash] = true
			for _, h := range eA.GetNext() {
				hash := h.String()
				_, okB := logB.Entries.Get(hash)
				_, okT := traversed[hash]
				if !okT && !okB {
					stack = append(stack, hash)
					traversed[hash] = true
				}
			}
		}
	}

	return res
}

// ToString Returns the log values as a nicely formatted string
//
// payloadMapper is a function to customize text representation,
// use nil to use the default mapper which convert the payload as a string
func (l *IPFSLog) ToString(payloadMapper func(iface.IPFSLogEntry) string) string {
	values := l.Values().Slice()
	sorting.Reverse(values)

	var lines []string

	for _, e := range values {
		parents := entry.FindChildren(e, l.Values().Slice())
		length := len(parents)
		padding := strings.Repeat("  ", maxInt(length-1, 0))
		if length > 0 {
			padding = padding + "└─"
		}

		payload := ""
		if payloadMapper != nil {
			payload = payloadMapper(e)
		} else {
			payload = string(e.GetPayload())
		}

		lines = append(lines, padding+payload)
	}

	return strings.Join(lines, "\n")
}

// ToSnapshot exports a Snapshot-able version of the log
func (l *IPFSLog) ToSnapshot() *Snapshot {
	l.lock.RLock()
	defer l.lock.RUnlock()

	heads := l.heads.Slice()

	return &Snapshot{
		ID:     l.ID,
		Heads:  entrySliceToCids(heads),
		Values: l.values().Slice(),
	}
}

func entrySliceToCids(slice []iface.IPFSLogEntry) []cid.Cid {
	var cids []cid.Cid

	for _, e := range slice {
		cids = append(cids, e.GetHash())
	}

	return cids
}

// func (l *IPFSLog) toBuffer() ([]byte, error) {
//	return json.Marshal(l.ToJSON())
// }

// ToMultihash Returns the multihash of the log
//
// Converting the log to a multihash will persist the contents of
// log.toJSON to IPFS, thus causing side effects
//
// The only supported format is dag-cbor and a CIDv1 is returned
func (l *IPFSLog) ToMultihash(ctx context.Context) (cid.Cid, error) {
	return toMultihash(ctx, l.Storage, l)
}

// NewFromMultihash Creates a IPFSLog from a hash
//
// Creating a log from a hash will retrieve entries from IPFS, thus causing side effects
func NewFromMultihash(ctx context.Context, services core_iface.CoreAPI, identity *identityprovider.Identity, hash cid.Cid, logOptions *LogOptions, fetchOptions *FetchOptions) (*IPFSLog, error) {
	if services == nil {
		return nil, errmsg.ErrIPFSNotDefined
	}

	if identity == nil {
		return nil, errmsg.ErrIdentityNotDefined
	}

	if logOptions == nil {
		return nil, errmsg.ErrLogOptionsNotDefined
	}

	if fetchOptions == nil {
		return nil, errmsg.ErrFetchOptionsNotDefined
	}

	data, err := fromMultihash(ctx, services, hash, &FetchOptions{
		Length:       fetchOptions.Length,
		Exclude:      fetchOptions.Exclude,
		ProgressChan: fetchOptions.ProgressChan,
		Timeout:      fetchOptions.Timeout,
		Concurrency:  fetchOptions.Concurrency,
		SortFn:       fetchOptions.SortFn,
	})

	if err != nil {
		return nil, errmsg.ErrLogFromMultiHash.Wrap(err)
	}

	entries := entry.NewOrderedMapFromEntries(data.Values)

	var heads []iface.IPFSLogEntry
	for _, h := range data.Heads {
		head, ok := entries.Get(h.String())
		if !ok {
			// TODO: log
			continue
		}

		heads = append(heads, head)
	}

	return NewLog(services, identity, &LogOptions{
		ID:               data.ID,
		AccessController: logOptions.AccessController,
		Entries:          entry.NewOrderedMapFromEntries(data.Values),
		Heads:            heads,
		SortFn:           logOptions.SortFn,
	})
}

// NewFromEntryHash Creates a IPFSLog from a hash of an Entry
//
// Creating a log from a hash will retrieve entries from IPFS, thus causing side effects
func NewFromEntryHash(ctx context.Context, services core_iface.CoreAPI, identity *identityprovider.Identity, hash cid.Cid, logOptions *LogOptions, fetchOptions *FetchOptions) (*IPFSLog, error) {
	if logOptions == nil {
		return nil, errmsg.ErrLogOptionsNotDefined
	}

	if fetchOptions == nil {
		return nil, errmsg.ErrFetchOptionsNotDefined
	}

	// TODO: need to verify the entries with 'key'
	entries, err := fromEntryHash(ctx, services, []cid.Cid{hash}, &FetchOptions{
		Length:       fetchOptions.Length,
		Exclude:      fetchOptions.Exclude,
		ProgressChan: fetchOptions.ProgressChan,
		Timeout:      fetchOptions.Timeout,
		Concurrency:  fetchOptions.Concurrency,
	})
	if err != nil {
		return nil, errmsg.ErrLogFromEntryHash.Wrap(err)
	}

	return NewLog(services, identity, &LogOptions{
		ID:               logOptions.ID,
		AccessController: logOptions.AccessController,
		Entries:          entry.NewOrderedMapFromEntries(entries),
		SortFn:           logOptions.SortFn,
	})
}

// NewFromJSON Creates a IPFSLog from a JSON Snapshot
//
// Creating a log from a JSON Snapshot will retrieve entries from IPFS, thus causing side effects
func NewFromJSON(ctx context.Context, services core_iface.CoreAPI, identity *identityprovider.Identity, jsonLog *JSONLog, logOptions *LogOptions, fetchOptions *entry.FetchOptions) (*IPFSLog, error) {
	if logOptions == nil {
		return nil, errmsg.ErrLogOptionsNotDefined
	}

	if fetchOptions == nil {
		return nil, errmsg.ErrFetchOptionsNotDefined
	}

	// TODO: need to verify the entries with 'key'

	snapshot, err := fromJSON(ctx, services, jsonLog, &entry.FetchOptions{
		Length:       fetchOptions.Length,
		Timeout:      fetchOptions.Timeout,
		ProgressChan: fetchOptions.ProgressChan,
	})
	if err != nil {
		return nil, errmsg.ErrLogFromJSON.Wrap(err)
	}

	return NewLog(services, identity, &LogOptions{
		ID:               snapshot.ID,
		AccessController: logOptions.AccessController,
		Entries:          entry.NewOrderedMapFromEntries(snapshot.Values),
		SortFn:           logOptions.SortFn,
	})
}

// NewFromEntry Creates a IPFSLog from an Entry
//
// Creating a log from an entry will retrieve entries from IPFS, thus causing side effects
func NewFromEntry(ctx context.Context, services core_iface.CoreAPI, identity *identityprovider.Identity, sourceEntries []iface.IPFSLogEntry, logOptions *LogOptions, fetchOptions *entry.FetchOptions) (*IPFSLog, error) {
	if logOptions == nil {
		return nil, errmsg.ErrLogOptionsNotDefined
	}

	if fetchOptions == nil {
		return nil, errmsg.ErrFetchOptionsNotDefined
	}

	// TODO: need to verify the entries with 'key'
	snapshot, err := fromEntry(ctx, services, sourceEntries, &entry.FetchOptions{
		Length:       fetchOptions.Length,
		Exclude:      fetchOptions.Exclude,
		ProgressChan: fetchOptions.ProgressChan,
		Timeout:      fetchOptions.Timeout,
		Concurrency:  fetchOptions.Concurrency,
	})
	if err != nil {
		return nil, errmsg.ErrLogFromEntry.Wrap(err)
	}

	return NewLog(services, identity, &LogOptions{
		ID:               snapshot.ID,
		AccessController: logOptions.AccessController,
		Entries:          entry.NewOrderedMapFromEntries(snapshot.Values),
		SortFn:           logOptions.SortFn,
	})
}

// Values Returns an Array of entries in the log
//
// The values are in linearized order according to their Lamport clocks
func (l *IPFSLog) Values() iface.IPFSLogOrderedEntries {
	l.lock.RLock()
	defer l.lock.RUnlock()

	return l.values()
}

func (l *IPFSLog) values() iface.IPFSLogOrderedEntries {
	heads := l.heads

	if heads == nil {
		return entry.NewOrderedMap()
	}

	stack, _ := l.traverse(heads, -1, "")

	stack = stack.Reverse()

	return stack
}

// ToJSON Returns a log in a JSON serializable structure
func (l *IPFSLog) ToJSON() *JSONLog {
	l.lock.RLock()
	heads := l.heads
	l.lock.RUnlock()

	stack := heads.Slice()
	sorting.Sort(l.SortFn, stack)
	sorting.Reverse(stack)

	var hashes []cid.Cid
	for _, e := range stack {
		hashes = append(hashes, e.GetHash())
	}

	return &JSONLog{
		ID:    l.ID,
		Heads: hashes,
	}
}

func (l *IPFSLog) GetID() string {
	return l.ID
}

func (l *IPFSLog) GetEntries() iface.IPFSLogOrderedEntries {
	l.lock.RLock()
	defer l.lock.RUnlock()

	return l.Entries.Copy()
}

// Heads Returns the heads of the log
//
// Heads are the entries that are not referenced by other entries in the log
func (l *IPFSLog) Heads() iface.IPFSLogOrderedEntries {
	l.lock.RLock()
	heads := l.heads.Slice()
	l.lock.RUnlock()

	return l.sortedHeads(heads)
}

func (l *IPFSLog) sortedHeads(heads []iface.IPFSLogEntry) iface.IPFSLogOrderedEntries {
	sorting.Sort(l.SortFn, heads)
	sorting.Reverse(heads)

	return entry.NewOrderedMapFromEntries(heads)
}

var atlasJSONLog = atlas.BuildEntry(JSONLog{}).
	StructMap().
	AddField("ID", atlas.StructMapEntry{SerialName: "id"}).
	AddField("Heads", atlas.StructMapEntry{SerialName: "heads"}).
	Complete()

func init() {
	cbornode.RegisterCborType(atlasJSONLog)
}

var _ iface.IPFSLog = (*IPFSLog)(nil)