296 lines
8.2 KiB
Go
296 lines
8.2 KiB
Go
|
// Copyright (C) 2018 Storj Labs, Inc.
|
||
|
// See LICENSE for copying information.
|
||
|
|
||
|
package postgreskv
|
||
|
|
||
|
import (
|
||
|
"database/sql"
|
||
|
"fmt"
|
||
|
|
||
|
"github.com/lib/pq"
|
||
|
"github.com/zeebo/errs"
|
||
|
|
||
|
"storj.io/storj/pkg/utils"
|
||
|
"storj.io/storj/storage"
|
||
|
"storj.io/storj/storage/postgreskv/schema"
|
||
|
)
|
||
|
|
||
|
const (
|
||
|
defaultBatchSize = 10000
|
||
|
defaultBucket = ""
|
||
|
)
|
||
|
|
||
|
// Client is the entrypoint into a postgreskv data store
|
||
|
type Client struct {
|
||
|
URL string
|
||
|
pgConn *sql.DB
|
||
|
}
|
||
|
|
||
|
// New instantiates a new postgreskv client given db URL
|
||
|
func New(dbURL string) (*Client, error) {
|
||
|
pgConn, err := sql.Open("postgres", dbURL)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
err = schema.PrepareDB(pgConn)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
return &Client{
|
||
|
URL: dbURL,
|
||
|
pgConn: pgConn,
|
||
|
}, nil
|
||
|
}
|
||
|
|
||
|
// Put sets the value for the provided key.
|
||
|
func (client *Client) Put(key storage.Key, value storage.Value) error {
|
||
|
return client.PutPath(storage.Key(defaultBucket), key, value)
|
||
|
}
|
||
|
|
||
|
// PutPath sets the value for the provided key (in the given bucket).
|
||
|
func (client *Client) PutPath(bucket, key storage.Key, value storage.Value) error {
|
||
|
if key.IsZero() {
|
||
|
return Error.New("invalid key")
|
||
|
}
|
||
|
q := `
|
||
|
INSERT INTO pathdata (bucket, fullpath, metadata)
|
||
|
VALUES ($1::BYTEA, $2::BYTEA, $3::BYTEA)
|
||
|
ON CONFLICT (bucket, fullpath) DO UPDATE SET metadata = EXCLUDED.metadata
|
||
|
`
|
||
|
_, err := client.pgConn.Exec(q, []byte(bucket), []byte(key), []byte(value))
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
// Get looks up the provided key and returns its value (or an error).
|
||
|
func (client *Client) Get(key storage.Key) (storage.Value, error) {
|
||
|
return client.GetPath(storage.Key(defaultBucket), key)
|
||
|
}
|
||
|
|
||
|
// GetPath looks up the provided key (in the given bucket) and returns its value (or an error).
|
||
|
func (client *Client) GetPath(bucket, key storage.Key) (storage.Value, error) {
|
||
|
q := "SELECT metadata FROM pathdata WHERE bucket = $1::BYTEA AND fullpath = $2::BYTEA"
|
||
|
row := client.pgConn.QueryRow(q, []byte(bucket), []byte(key))
|
||
|
var val []byte
|
||
|
err := row.Scan(&val)
|
||
|
if err == sql.ErrNoRows {
|
||
|
return nil, storage.ErrKeyNotFound.New(key.String())
|
||
|
}
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
return val, nil
|
||
|
}
|
||
|
|
||
|
// Delete deletes the given key and its associated value.
|
||
|
func (client *Client) Delete(key storage.Key) error {
|
||
|
return client.DeletePath(storage.Key(defaultBucket), key)
|
||
|
}
|
||
|
|
||
|
// DeletePath deletes the given key (in the given bucket) and its associated value.
|
||
|
func (client *Client) DeletePath(bucket, key storage.Key) error {
|
||
|
q := "DELETE FROM pathdata WHERE bucket = $1::BYTEA AND fullpath = $2::BYTEA"
|
||
|
result, err := client.pgConn.Exec(q, []byte(bucket), []byte(key))
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
numRows, err := result.RowsAffected()
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if numRows == 0 {
|
||
|
return storage.ErrKeyNotFound.New(key.String())
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
// List returns either a list of known keys, in order, or an error.
|
||
|
func (client *Client) List(first storage.Key, limit int) (storage.Keys, error) {
|
||
|
return storage.ListKeys(client, first, limit)
|
||
|
}
|
||
|
|
||
|
// ReverseList returns either a list of known keys, in reverse order, or an error.
|
||
|
// Starts from first and iterates backwards
|
||
|
func (client *Client) ReverseList(first storage.Key, limit int) (storage.Keys, error) {
|
||
|
return storage.ReverseListKeys(client, first, limit)
|
||
|
}
|
||
|
|
||
|
// Close closes the client
|
||
|
func (client *Client) Close() error {
|
||
|
return client.pgConn.Close()
|
||
|
}
|
||
|
|
||
|
// GetAll finds all values for the provided keys (up to storage.LookupLimit).
|
||
|
// If more keys are provided than the maximum, an error will be returned.
|
||
|
func (client *Client) GetAll(keys storage.Keys) (storage.Values, error) {
|
||
|
return client.GetAllPath(storage.Key(defaultBucket), keys)
|
||
|
}
|
||
|
|
||
|
// GetAllPath finds all values for the provided keys (up to storage.LookupLimit)
|
||
|
// in the given bucket. if more keys are provided than the maximum, an error
|
||
|
// will be returned.
|
||
|
func (client *Client) GetAllPath(bucket storage.Key, keys storage.Keys) (storage.Values, error) {
|
||
|
if len(keys) > storage.LookupLimit {
|
||
|
return nil, storage.ErrLimitExceeded
|
||
|
}
|
||
|
|
||
|
q := `
|
||
|
SELECT metadata
|
||
|
FROM pathdata pd
|
||
|
RIGHT JOIN
|
||
|
unnest($2::BYTEA[]) WITH ORDINALITY pk(request, ord)
|
||
|
ON (pd.fullpath = pk.request AND pd.bucket = $1::BYTEA)
|
||
|
ORDER BY pk.ord
|
||
|
`
|
||
|
rows, err := client.pgConn.Query(q, []byte(bucket), pq.ByteaArray(keys.ByteSlices()))
|
||
|
if err != nil {
|
||
|
return nil, errs.Wrap(err)
|
||
|
}
|
||
|
values := make([]storage.Value, 0, len(keys))
|
||
|
for rows.Next() {
|
||
|
var value []byte
|
||
|
if err := rows.Scan(&value); err != nil {
|
||
|
return nil, errs.Wrap(utils.CombineErrors(err, rows.Close()))
|
||
|
}
|
||
|
values = append(values, storage.Value(value))
|
||
|
}
|
||
|
return values, utils.CombineErrors(rows.Err(), rows.Close())
|
||
|
}
|
||
|
|
||
|
type orderedPostgresIterator struct {
|
||
|
client *Client
|
||
|
opts *storage.IterateOptions
|
||
|
bucket storage.Key
|
||
|
delimiter byte
|
||
|
batchSize int
|
||
|
curIndex int
|
||
|
curRows *sql.Rows
|
||
|
lastKeySeen storage.Key
|
||
|
errEncountered error
|
||
|
nextQuery func() (*sql.Rows, error)
|
||
|
}
|
||
|
|
||
|
// Next fills in info for the next item in an ongoing listing.
|
||
|
func (opi *orderedPostgresIterator) Next(item *storage.ListItem) bool {
|
||
|
if !opi.curRows.Next() {
|
||
|
if err := opi.curRows.Close(); err != nil {
|
||
|
opi.errEncountered = errs.Wrap(err)
|
||
|
return false
|
||
|
}
|
||
|
if opi.curIndex < opi.batchSize {
|
||
|
return false
|
||
|
}
|
||
|
if err := opi.curRows.Err(); err != nil {
|
||
|
opi.errEncountered = errs.Wrap(err)
|
||
|
return false
|
||
|
}
|
||
|
newRows, err := opi.nextQuery()
|
||
|
if err != nil {
|
||
|
opi.errEncountered = errs.Wrap(err)
|
||
|
return false
|
||
|
}
|
||
|
opi.curRows = newRows
|
||
|
opi.curIndex = 0
|
||
|
if !opi.curRows.Next() {
|
||
|
if err := opi.curRows.Close(); err != nil {
|
||
|
opi.errEncountered = errs.Wrap(err)
|
||
|
}
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
var k, v []byte
|
||
|
err := opi.curRows.Scan(&k, &v)
|
||
|
if err != nil {
|
||
|
opi.errEncountered = utils.CombineErrors(errs.Wrap(err), errs.Wrap(opi.curRows.Close()))
|
||
|
return false
|
||
|
}
|
||
|
item.Key = storage.Key(k)
|
||
|
item.Value = storage.Value(v)
|
||
|
opi.curIndex++
|
||
|
if opi.curIndex == 1 && opi.lastKeySeen.Equal(item.Key) {
|
||
|
return opi.Next(item)
|
||
|
}
|
||
|
if !opi.opts.Recurse && item.Key[len(item.Key)-1] == opi.delimiter && !item.Key.Equal(opi.opts.Prefix) {
|
||
|
item.IsPrefix = true
|
||
|
// i don't think this makes the most sense, but it's necessary to pass the storage testsuite
|
||
|
item.Value = nil
|
||
|
} else {
|
||
|
item.IsPrefix = false
|
||
|
}
|
||
|
opi.lastKeySeen = item.Key
|
||
|
return true
|
||
|
}
|
||
|
|
||
|
func (opi *orderedPostgresIterator) doNextQuery() (*sql.Rows, error) {
|
||
|
start := opi.lastKeySeen
|
||
|
if start == nil {
|
||
|
start = opi.opts.First
|
||
|
}
|
||
|
var query string
|
||
|
if !opi.opts.Recurse {
|
||
|
if opi.opts.Reverse {
|
||
|
query = "SELECT p, m FROM list_directory_reverse($1::BYTEA, $2::BYTEA, $3::BYTEA, $4) ld(p, m)"
|
||
|
} else {
|
||
|
query = "SELECT p, m FROM list_directory($1::BYTEA, $2::BYTEA, $3::BYTEA, $4) ld(p, m)"
|
||
|
}
|
||
|
} else {
|
||
|
startCmp := ">="
|
||
|
orderDir := ""
|
||
|
if opi.opts.Reverse {
|
||
|
startCmp = "<="
|
||
|
orderDir = " DESC"
|
||
|
}
|
||
|
query = fmt.Sprintf(`
|
||
|
SELECT fullpath, metadata
|
||
|
FROM pathdata
|
||
|
WHERE bucket = $1::BYTEA
|
||
|
AND ($2::BYTEA = ''::BYTEA OR fullpath >= $2::BYTEA)
|
||
|
AND ($2::BYTEA = ''::BYTEA OR fullpath < bytea_increment($2::BYTEA))
|
||
|
AND ($3::BYTEA = ''::BYTEA OR fullpath %s $3::BYTEA)
|
||
|
ORDER BY fullpath%s
|
||
|
LIMIT $4
|
||
|
`, startCmp, orderDir)
|
||
|
}
|
||
|
return opi.client.pgConn.Query(query, []byte(opi.bucket), []byte(opi.opts.Prefix), []byte(start), opi.batchSize+1)
|
||
|
}
|
||
|
|
||
|
func (opi *orderedPostgresIterator) Close() error {
|
||
|
return utils.CombineErrors(opi.errEncountered, opi.curRows.Close())
|
||
|
}
|
||
|
|
||
|
func newOrderedPostgresIterator(pgClient *Client, opts storage.IterateOptions, batchSize int) (*orderedPostgresIterator, error) {
|
||
|
if opts.Prefix == nil {
|
||
|
opts.Prefix = storage.Key("")
|
||
|
}
|
||
|
if opts.First == nil {
|
||
|
opts.First = storage.Key("")
|
||
|
}
|
||
|
opi := &orderedPostgresIterator{
|
||
|
client: pgClient,
|
||
|
opts: &opts,
|
||
|
bucket: storage.Key(defaultBucket),
|
||
|
delimiter: byte('/'),
|
||
|
batchSize: batchSize,
|
||
|
curIndex: 0,
|
||
|
}
|
||
|
opi.nextQuery = opi.doNextQuery
|
||
|
newRows, err := opi.nextQuery()
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
opi.curRows = newRows
|
||
|
return opi, nil
|
||
|
}
|
||
|
|
||
|
// Iterate iterates over items based on opts
|
||
|
func (client *Client) Iterate(opts storage.IterateOptions, fn func(storage.Iterator) error) (err error) {
|
||
|
opi, err := newOrderedPostgresIterator(client, opts, defaultBatchSize)
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
defer func() {
|
||
|
err = utils.CombineErrors(err, opi.Close())
|
||
|
}()
|
||
|
|
||
|
return fn(opi)
|
||
|
}
|