2019-12-03 17:40:04 +00:00
|
|
|
// Copyright (C) 2019 Storj Labs, Inc.
|
|
|
|
// See LICENSE for copying information.
|
|
|
|
|
|
|
|
package cockroachkv
|
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
|
|
|
"context"
|
|
|
|
"database/sql"
|
|
|
|
|
|
|
|
"github.com/lib/pq"
|
2019-11-08 20:40:39 +00:00
|
|
|
"github.com/spacemonkeygo/monkit/v3"
|
2019-12-03 17:40:04 +00:00
|
|
|
"github.com/zeebo/errs"
|
|
|
|
|
|
|
|
"storj.io/storj/private/dbutil"
|
2020-01-10 20:11:08 +00:00
|
|
|
"storj.io/storj/private/dbutil/pgutil"
|
2020-01-19 14:41:23 +00:00
|
|
|
"storj.io/storj/private/dbutil/txutil"
|
|
|
|
"storj.io/storj/private/tagsql"
|
2019-12-03 17:40:04 +00:00
|
|
|
"storj.io/storj/storage"
|
2019-12-05 17:22:27 +00:00
|
|
|
"storj.io/storj/storage/cockroachkv/schema"
|
2019-12-03 17:40:04 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
mon = monkit.Package()
|
|
|
|
)
|
|
|
|
|
|
|
|
// Client is the entrypoint into a cockroachkv data store
|
|
|
|
type Client struct {
|
2020-04-24 20:15:27 +01:00
|
|
|
db tagsql.DB
|
|
|
|
dbURL string
|
2020-01-22 19:00:46 +00:00
|
|
|
lookupLimit int
|
2019-12-03 17:40:04 +00:00
|
|
|
}
|
|
|
|
|
2019-12-11 19:04:09 +00:00
|
|
|
// New instantiates a new cockroachkv client given db URL
|
2019-12-03 17:40:04 +00:00
|
|
|
func New(dbURL string) (*Client, error) {
|
2020-01-10 20:11:08 +00:00
|
|
|
dbURL = pgutil.CheckApplicationName(dbURL)
|
|
|
|
|
2020-01-19 14:41:23 +00:00
|
|
|
db, err := tagsql.Open("cockroach", dbURL)
|
2019-12-03 17:40:04 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
2020-03-23 19:58:36 +00:00
|
|
|
dbutil.Configure(db, "cockroachkv", mon)
|
2019-12-05 17:22:27 +00:00
|
|
|
|
2020-04-24 20:15:27 +01:00
|
|
|
return NewWith(db, dbURL), nil
|
2019-12-05 17:22:27 +00:00
|
|
|
}
|
2019-12-03 17:40:04 +00:00
|
|
|
|
2020-01-22 19:00:46 +00:00
|
|
|
// NewWith instantiates a new cockroachkv client given db.
|
2020-04-24 20:15:27 +01:00
|
|
|
func NewWith(db tagsql.DB, dbURL string) *Client {
|
|
|
|
return &Client{db: db, dbURL: dbURL, lookupLimit: storage.DefaultLookupLimit}
|
|
|
|
}
|
|
|
|
|
|
|
|
// MigrateToLatest migrates to latest schema version.
|
|
|
|
func (client *Client) MigrateToLatest(ctx context.Context) error {
|
|
|
|
return schema.PrepareDB(ctx, client.db)
|
2019-12-03 17:40:04 +00:00
|
|
|
}
|
|
|
|
|
2020-01-22 19:00:46 +00:00
|
|
|
// SetLookupLimit sets the lookup limit.
|
|
|
|
func (client *Client) SetLookupLimit(v int) { client.lookupLimit = v }
|
|
|
|
|
|
|
|
// LookupLimit returns the maximum limit that is allowed.
|
|
|
|
func (client *Client) LookupLimit() int { return client.lookupLimit }
|
|
|
|
|
2019-12-03 17:40:04 +00:00
|
|
|
// Close closes the client
|
|
|
|
func (client *Client) Close() error {
|
2019-12-05 17:22:27 +00:00
|
|
|
return client.db.Close()
|
2019-12-03 17:40:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Put sets the value for the provided key.
|
|
|
|
func (client *Client) Put(ctx context.Context, key storage.Key, value storage.Value) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
if key.IsZero() {
|
|
|
|
return storage.ErrEmptyKey.New("")
|
|
|
|
}
|
|
|
|
|
|
|
|
q := `
|
|
|
|
INSERT INTO pathdata (fullpath, metadata)
|
|
|
|
VALUES ($1:::BYTEA, $2:::BYTEA)
|
|
|
|
ON CONFLICT (fullpath) DO UPDATE SET metadata = EXCLUDED.metadata
|
|
|
|
`
|
|
|
|
|
2020-01-19 14:41:23 +00:00
|
|
|
_, err = client.db.ExecContext(ctx, q, []byte(key), []byte(value))
|
2019-12-03 17:40:04 +00:00
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get looks up the provided key and returns its value (or an error).
|
|
|
|
func (client *Client) Get(ctx context.Context, key storage.Key) (_ storage.Value, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
if key.IsZero() {
|
|
|
|
return nil, storage.ErrEmptyKey.New("")
|
|
|
|
}
|
|
|
|
|
|
|
|
q := "SELECT metadata FROM pathdata WHERE fullpath = $1:::BYTEA"
|
2020-01-19 14:41:23 +00:00
|
|
|
row := client.db.QueryRowContext(ctx, q, []byte(key))
|
2019-12-03 17:40:04 +00:00
|
|
|
|
|
|
|
var val []byte
|
|
|
|
err = row.Scan(&val)
|
|
|
|
if err == sql.ErrNoRows {
|
|
|
|
return nil, storage.ErrKeyNotFound.New("%q", key)
|
|
|
|
}
|
|
|
|
|
|
|
|
return val, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
2020-01-22 19:00:46 +00:00
|
|
|
// GetAll finds all values for the provided keys (up to LookupLimit).
|
2019-12-03 17:40:04 +00:00
|
|
|
// If more keys are provided than the maximum, an error will be returned.
|
|
|
|
func (client *Client) GetAll(ctx context.Context, keys storage.Keys) (_ storage.Values, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2020-01-22 19:00:46 +00:00
|
|
|
if len(keys) > client.lookupLimit {
|
2019-12-03 17:40:04 +00:00
|
|
|
return nil, storage.ErrLimitExceeded
|
|
|
|
}
|
|
|
|
|
|
|
|
q := `
|
|
|
|
SELECT metadata
|
|
|
|
FROM pathdata pd
|
|
|
|
RIGHT JOIN
|
|
|
|
unnest($1:::BYTEA[]) WITH ORDINALITY pk(request, ord)
|
|
|
|
ON (pd.fullpath = pk.request)
|
|
|
|
ORDER BY pk.ord
|
|
|
|
`
|
2020-01-19 14:41:23 +00:00
|
|
|
rows, err := client.db.QueryContext(ctx, q, pq.ByteaArray(keys.ByteSlices()))
|
2019-12-03 17:40:04 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, errs.Wrap(err)
|
|
|
|
}
|
|
|
|
defer func() { err = errs.Combine(err, Error.Wrap(rows.Close())) }()
|
|
|
|
|
|
|
|
values := make([]storage.Value, 0, len(keys))
|
|
|
|
for rows.Next() {
|
|
|
|
var value []byte
|
|
|
|
if err := rows.Scan(&value); err != nil {
|
|
|
|
return nil, Error.Wrap(err)
|
|
|
|
}
|
|
|
|
values = append(values, storage.Value(value))
|
|
|
|
}
|
|
|
|
|
|
|
|
return values, Error.Wrap(rows.Err())
|
|
|
|
}
|
|
|
|
|
|
|
|
// Delete deletes the given key and its associated value.
|
|
|
|
func (client *Client) Delete(ctx context.Context, key storage.Key) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
if key.IsZero() {
|
|
|
|
return storage.ErrEmptyKey.New("")
|
|
|
|
}
|
|
|
|
|
|
|
|
q := "DELETE FROM pathdata WHERE fullpath = $1:::BYTEA"
|
2020-01-19 14:41:23 +00:00
|
|
|
result, err := client.db.ExecContext(ctx, q, []byte(key))
|
2019-12-03 17:40:04 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
numRows, err := result.RowsAffected()
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
if numRows == 0 {
|
|
|
|
return storage.ErrKeyNotFound.New("%q", key)
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2020-01-28 20:52:04 +00:00
|
|
|
// DeleteMultiple deletes keys ignoring missing keys
|
|
|
|
func (client *Client) DeleteMultiple(ctx context.Context, keys []storage.Key) (_ storage.Items, err error) {
|
|
|
|
defer mon.Task()(&ctx, len(keys))(&err)
|
|
|
|
|
|
|
|
rows, err := client.db.QueryContext(ctx, `
|
|
|
|
DELETE FROM pathdata
|
|
|
|
WHERE fullpath = any($1::BYTEA[])
|
|
|
|
RETURNING fullpath, metadata`,
|
|
|
|
pq.ByteaArray(storage.Keys(keys).ByteSlices()))
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
defer func() {
|
|
|
|
err = errs.Combine(err, rows.Close())
|
|
|
|
}()
|
|
|
|
|
|
|
|
var items storage.Items
|
|
|
|
for rows.Next() {
|
|
|
|
var key, value []byte
|
|
|
|
err := rows.Scan(&key, &value)
|
|
|
|
if err != nil {
|
|
|
|
return items, err
|
|
|
|
}
|
|
|
|
items = append(items, storage.ListItem{
|
|
|
|
Key: key,
|
|
|
|
Value: value,
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
return items, rows.Err()
|
|
|
|
}
|
|
|
|
|
2019-12-03 17:40:04 +00:00
|
|
|
// List returns either a list of known keys, in order, or an error.
|
|
|
|
func (client *Client) List(ctx context.Context, first storage.Key, limit int) (_ storage.Keys, err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
return storage.ListKeys(ctx, client, first, limit)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Iterate calls the callback with an iterator over the keys.
|
|
|
|
func (client *Client) Iterate(ctx context.Context, opts storage.IterateOptions, fn func(context.Context, storage.Iterator) error) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
2019-12-17 17:05:38 +00:00
|
|
|
|
2020-01-22 19:00:46 +00:00
|
|
|
if opts.Limit <= 0 || opts.Limit > client.lookupLimit {
|
|
|
|
opts.Limit = client.lookupLimit
|
2019-12-17 17:05:38 +00:00
|
|
|
}
|
|
|
|
|
2020-05-05 07:51:24 +01:00
|
|
|
return client.IterateWithoutLookupLimit(ctx, opts, fn)
|
|
|
|
}
|
|
|
|
|
|
|
|
// IterateWithoutLookupLimit calls the callback with an iterator over the keys, but doesn't enforce default limit on opts.
|
|
|
|
func (client *Client) IterateWithoutLookupLimit(ctx context.Context, opts storage.IterateOptions, fn func(context.Context, storage.Iterator) error) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
2020-01-19 19:56:51 +00:00
|
|
|
opi, err := newOrderedCockroachIterator(ctx, client, opts)
|
2019-12-03 17:40:04 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
defer func() {
|
|
|
|
err = errs.Combine(err, opi.Close())
|
|
|
|
}()
|
|
|
|
|
|
|
|
return fn(ctx, opi)
|
|
|
|
}
|
|
|
|
|
|
|
|
// CompareAndSwap atomically compares and swaps oldValue with newValue
|
|
|
|
func (client *Client) CompareAndSwap(ctx context.Context, key storage.Key, oldValue, newValue storage.Value) (err error) {
|
|
|
|
defer mon.Task()(&ctx)(&err)
|
|
|
|
|
|
|
|
if key.IsZero() {
|
|
|
|
return storage.ErrEmptyKey.New("")
|
|
|
|
}
|
|
|
|
|
|
|
|
if oldValue == nil && newValue == nil {
|
|
|
|
q := "SELECT metadata FROM pathdata WHERE fullpath = $1:::BYTEA"
|
2020-01-19 14:41:23 +00:00
|
|
|
row := client.db.QueryRowContext(ctx, q, []byte(key))
|
2019-12-03 17:40:04 +00:00
|
|
|
|
|
|
|
var val []byte
|
|
|
|
err = row.Scan(&val)
|
|
|
|
if err == sql.ErrNoRows {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
return storage.ErrValueChanged.New("%q", key)
|
|
|
|
}
|
|
|
|
|
|
|
|
if oldValue == nil {
|
|
|
|
q := `
|
|
|
|
INSERT INTO pathdata (fullpath, metadata) VALUES ($1:::BYTEA, $2:::BYTEA)
|
|
|
|
ON CONFLICT DO NOTHING
|
|
|
|
RETURNING 1
|
|
|
|
`
|
2020-01-19 14:41:23 +00:00
|
|
|
row := client.db.QueryRowContext(ctx, q, []byte(key), []byte(newValue))
|
2019-12-03 17:40:04 +00:00
|
|
|
|
|
|
|
var val []byte
|
|
|
|
err = row.Scan(&val)
|
|
|
|
if err == sql.ErrNoRows {
|
|
|
|
return storage.ErrValueChanged.New("%q", key)
|
|
|
|
}
|
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
2020-01-19 14:41:23 +00:00
|
|
|
return txutil.WithTx(ctx, client.db, nil, func(ctx context.Context, txn tagsql.Tx) error {
|
2019-12-03 17:40:04 +00:00
|
|
|
q := "SELECT metadata FROM pathdata WHERE fullpath = $1:::BYTEA;"
|
|
|
|
row := txn.QueryRowContext(ctx, q, []byte(key))
|
|
|
|
|
|
|
|
var metadata []byte
|
|
|
|
err = row.Scan(&metadata)
|
|
|
|
if err == sql.ErrNoRows {
|
|
|
|
// Row not found for this fullpath.
|
|
|
|
// Potentially because another concurrent transaction changed the row.
|
|
|
|
return storage.ErrKeyNotFound.New("%q", key)
|
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if equal := bytes.Compare(metadata, oldValue); equal != 0 {
|
|
|
|
// If the row is found but the metadata has been already changed
|
|
|
|
// we can't continue to delete it.
|
|
|
|
return storage.ErrValueChanged.New("%q", key)
|
|
|
|
}
|
|
|
|
|
|
|
|
var res sql.Result
|
|
|
|
if newValue == nil {
|
|
|
|
q = `
|
|
|
|
DELETE FROM pathdata
|
|
|
|
WHERE pathdata.fullpath = $1:::BYTEA
|
|
|
|
AND pathdata.metadata = $2:::BYTEA
|
|
|
|
`
|
|
|
|
|
|
|
|
res, err = txn.ExecContext(ctx, q, []byte(key), []byte(oldValue))
|
|
|
|
} else {
|
|
|
|
q = `
|
|
|
|
UPDATE pathdata
|
|
|
|
SET metadata = $3:::BYTEA
|
|
|
|
WHERE pathdata.fullpath = $1:::BYTEA
|
|
|
|
AND pathdata.metadata = $2:::BYTEA
|
|
|
|
`
|
|
|
|
res, err = txn.ExecContext(ctx, q, []byte(key), []byte(oldValue), []byte(newValue))
|
|
|
|
}
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
affected, err := res.RowsAffected()
|
|
|
|
if err != nil {
|
|
|
|
return Error.Wrap(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if affected != 1 {
|
|
|
|
return storage.ErrValueChanged.New("%q", key)
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
})
|
|
|
|
}
|