surrealpatch/kvs/mysql/tx.go

364 lines
6.6 KiB
Go
Raw Normal View History

// Copyright © 2016 Abcum Ltd
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
2016-07-16 13:43:53 +00:00
package mysql
2016-05-17 21:17:42 +00:00
import (
"bytes"
"math"
2016-07-16 13:43:53 +00:00
"database/sql"
2016-07-16 13:43:53 +00:00
"github.com/abcum/surreal/kvs"
"github.com/abcum/surreal/util/cryp"
"github.com/abcum/surreal/util/snap"
2016-05-17 21:17:42 +00:00
)
2016-05-19 11:32:55 +00:00
// TX is a distributed database transaction.
type TX struct {
2016-07-16 13:43:53 +00:00
ds *DS
ck []byte
2016-07-16 13:43:53 +00:00
tx *sql.Tx
2016-05-17 21:17:42 +00:00
}
// All retrieves all key:value items in the db.
2016-07-16 13:43:53 +00:00
func (tx *TX) All() (kvs []kvs.KV, err error) {
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
res, err := tx.tx.Query("SELECT `key`, `val` FROM kv ORDER BY `key` ASC")
if err != nil {
return
}
defer res.Close()
for res.Next() {
var key, val []byte
err := res.Scan(&key, &val)
if err != nil {
return nil, err
}
kv, err := get(tx, key, val)
if err != nil {
2016-07-16 13:43:53 +00:00
return nil, err
}
kvs = append(kvs, kv)
2016-07-16 13:43:53 +00:00
}
2016-07-16 13:43:53 +00:00
err = res.Err()
if err != nil {
return nil, err
}
2016-05-17 21:17:42 +00:00
return
}
// Get retrieves a single key:value item.
2016-07-16 13:43:53 +00:00
func (tx *TX) Get(key []byte) (kv kvs.KV, err error) {
row := tx.tx.QueryRow("SELECT `val` FROM kv WHERE `key` = ?", key)
var val []byte
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
row.Scan(&val)
2016-05-17 21:17:42 +00:00
return get(tx, key, val)
2016-05-17 21:17:42 +00:00
}
// MGet retrieves multiple key:value items.
2016-07-16 13:43:53 +00:00
func (tx *TX) MGet(keys ...[]byte) (kvs []kvs.KV, err error) {
2016-07-16 13:43:53 +00:00
/*
res, err := tx.tx.Query("SELECT `key`, `val` FROM kv WHERE `key` IN (?)", keys)
if err != nil {
2016-07-16 13:43:53 +00:00
return
}
2016-07-16 13:43:53 +00:00
defer res.Close()
2016-07-16 13:43:53 +00:00
for res.Next() {
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
var key, val []byte
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
err := res.Scan(&key, &val)
if err != nil {
return nil, err
}
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
kv, err := get(tx, key, val)
if err != nil {
return nil, err
}
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
kvs = append(kvs, kv)
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
}
2016-07-16 13:43:53 +00:00
err = res.Err()
if err != nil {
return nil, err
}
2016-07-16 13:43:53 +00:00
*/
2016-07-16 13:43:53 +00:00
for _, key := range keys {
kv, _ := tx.Get(key)
kvs = append(kvs, kv)
2016-05-17 21:17:42 +00:00
}
return
}
2016-07-16 13:43:53 +00:00
// PGet retrieves the range of rows which are prefixed with `pre`.
func (tx *TX) PGet(pre []byte) (kvs []kvs.KV, err error) {
end := append(pre, 0xff)
return tx.RGet(pre, end, 0)
}
2016-05-17 21:17:42 +00:00
// RGet retrieves the range of `max` rows between `beg` (inclusive) and
// `end` (exclusive). To return the range in descending order, ensure
// that `end` sorts lower than `beg` in the key value store.
2016-07-16 13:43:53 +00:00
func (tx *TX) RGet(beg, end []byte, max uint64) (kvs []kvs.KV, err error) {
2016-05-17 21:17:42 +00:00
if max == 0 {
max = math.MaxUint64
}
2016-07-16 13:43:53 +00:00
res, err := tx.tx.Query("SELECT `key`, `val` FROM kv WHERE `key` BETWEEN ? AND ? ORDER BY `key` ASC LIMIT ?", beg, end, int(max))
if err != nil {
return nil, err
}
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
defer res.Close()
2016-07-16 13:43:53 +00:00
for res.Next() {
2016-07-16 13:43:53 +00:00
var key, val []byte
2016-07-16 13:43:53 +00:00
err := res.Scan(&key, &val)
if err != nil {
return nil, err
2016-05-17 21:17:42 +00:00
}
2016-07-16 13:43:53 +00:00
kv, err := get(tx, key, val)
if err != nil {
return nil, err
}
2016-07-16 13:43:53 +00:00
kvs = append(kvs, kv)
2016-07-16 13:43:53 +00:00
}
2016-07-16 13:43:53 +00:00
err = res.Err()
if err != nil {
return nil, err
2016-05-17 21:17:42 +00:00
}
return
}
// Put sets the value for a key.
2016-05-19 11:32:55 +00:00
func (tx *TX) Put(key, val []byte) (err error) {
2016-05-17 21:17:42 +00:00
if val, err = snap.Encode(val); err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.DBError{err}
return
}
2016-07-18 22:00:01 +00:00
if val, err = cryp.Encrypt(tx.ds.ck, val); err != nil {
err = &kvs.CKError{err}
return
}
if val, err = cryp.Encrypt(tx.ck, val); err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.CKError{err}
return
}
2016-07-16 13:43:53 +00:00
if _, err = tx.tx.Exec("INSERT INTO kv (`key`, `val`) VALUES (?, ?) ON DUPLICATE KEY UPDATE `val` = ?", key, val, val); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
return
}
// CPut conditionally sets the value for a key if the existing value is equal
// to the expected value. To conditionally set a value only if there is no
// existing entry pass nil for the expected value.
2016-05-19 11:32:55 +00:00
func (tx *TX) CPut(key, val, exp []byte) (err error) {
2016-05-17 21:17:42 +00:00
now, _ := tx.Get(key)
2016-07-16 13:43:53 +00:00
act := now.(*KV).val
2016-07-16 13:43:53 +00:00
if !bytes.Equal(act, exp) {
err = &kvs.KVError{err, key, act, exp}
return
}
if val, err = snap.Encode(val); err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.DBError{err}
return
}
2016-05-17 21:17:42 +00:00
2016-07-18 22:00:01 +00:00
if val, err = cryp.Encrypt(tx.ds.ck, val); err != nil {
err = &kvs.CKError{err}
return
}
if val, err = cryp.Encrypt(tx.ck, val); err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.CKError{err}
2016-05-17 21:17:42 +00:00
return
}
2016-07-16 13:43:53 +00:00
if _, err = tx.tx.Exec("INSERT INTO kv (`key`, `val`) VALUES (?, ?) ON DUPLICATE KEY UPDATE `val` = ?", key, val, val); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
return
}
// Del deletes a single key:value item.
2016-05-19 11:32:55 +00:00
func (tx *TX) Del(key []byte) (err error) {
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
if _, err = tx.tx.Exec("DELETE FROM kv WHERE `key` = ?", key); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
return
}
// CDel conditionally deletes a key if the existing value is equal to the
// expected value.
2016-05-19 11:32:55 +00:00
func (tx *TX) CDel(key, exp []byte) (err error) {
2016-05-17 21:17:42 +00:00
now, _ := tx.Get(key)
2016-07-16 13:43:53 +00:00
act := now.(*KV).val
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
if !bytes.Equal(act, exp) {
err = &kvs.KVError{err, key, act, exp}
2016-05-17 21:17:42 +00:00
return
}
2016-07-16 13:43:53 +00:00
if _, err = tx.tx.Exec("DELETE FROM kv WHERE `key` = ?", key); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
return
}
// MDel deletes multiple key:value items.
2016-05-19 11:32:55 +00:00
func (tx *TX) MDel(keys ...[]byte) (err error) {
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
/*
if _, err = tx.tx.Exec("DELETE FROM kv WHERE `key` IN (?)", keys); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
2016-07-16 13:43:53 +00:00
*/
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
for _, key := range keys {
err = tx.Del(key)
2016-05-17 21:17:42 +00:00
}
return
}
// PDel deletes the range of rows which are prefixed with `pre`.
2016-05-19 11:32:55 +00:00
func (tx *TX) PDel(pre []byte) (err error) {
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
end := append(pre, 0xff)
2016-05-17 21:17:42 +00:00
2016-07-16 13:43:53 +00:00
return tx.RDel(pre, end, 0)
2016-05-17 21:17:42 +00:00
}
2016-05-17 21:17:42 +00:00
// RDel deletes the range of `max` rows between `beg` (inclusive) and
// `end` (exclusive). To delete the range in descending order, ensure
// that `end` sorts lower than `beg` in the key value store.
2016-05-19 11:32:55 +00:00
func (tx *TX) RDel(beg, end []byte, max uint64) (err error) {
2016-05-17 21:17:42 +00:00
if max == 0 {
max = math.MaxUint64
}
2016-07-16 13:43:53 +00:00
if _, err = tx.tx.Exec("DELETE FROM kv WHERE `key` BETWEEN ? AND ? ORDER BY `key` ASC LIMIT ?", beg, end, int(max)); err != nil {
err = &kvs.DBError{err}
2016-05-17 21:17:42 +00:00
return
}
return
}
2016-05-19 11:32:55 +00:00
func (tx *TX) Close() (err error) {
2016-05-17 21:17:42 +00:00
return tx.Rollback()
}
2016-05-19 11:32:55 +00:00
func (tx *TX) Commit() (err error) {
2016-05-17 21:17:42 +00:00
return tx.tx.Commit()
}
2016-05-19 11:32:55 +00:00
func (tx *TX) Rollback() (err error) {
2016-05-17 21:17:42 +00:00
return tx.tx.Rollback()
}
func get(tx *TX, key, val []byte) (kv *KV, err error) {
2016-05-17 21:17:42 +00:00
kv = &KV{
2016-05-18 00:21:54 +00:00
exi: (val != nil),
key: key,
val: val,
2016-05-17 21:17:42 +00:00
}
kv.val, err = cryp.Decrypt(tx.ck, kv.val)
if err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.CKError{err}
return
}
2016-05-17 21:17:42 +00:00
2016-07-18 22:00:01 +00:00
kv.val, err = cryp.Decrypt(tx.ds.ck, kv.val)
if err != nil {
err = &kvs.CKError{err}
return
}
kv.val, err = snap.Decode(kv.val)
if err != nil {
2016-07-16 13:43:53 +00:00
err = &kvs.DBError{err}
return
}
2016-05-17 21:17:42 +00:00
return
}