github.com/bhs-gq/quorum-hotstuff@v21.1.0+incompatible/core/rawdb/table.go (about)

     1  // Copyright 2018 The go-ethereum Authors
     2  // This file is part of the go-ethereum library.
     3  //
     4  // The go-ethereum library is free software: you can redistribute it and/or modify
     5  // it under the terms of the GNU Lesser General Public License as published by
     6  // the Free Software Foundation, either version 3 of the License, or
     7  // (at your option) any later version.
     8  //
     9  // The go-ethereum library is distributed in the hope that it will be useful,
    10  // but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    12  // GNU Lesser General Public License for more details.
    13  //
    14  // You should have received a copy of the GNU Lesser General Public License
    15  // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
    16  
    17  package rawdb
    18  
    19  import (
    20  	"github.com/ethereum/go-ethereum/ethdb"
    21  )
    22  
    23  // table is a wrapper around a database that prefixes each key access with a pre-
    24  // configured string.
    25  type table struct {
    26  	db     ethdb.Database
    27  	prefix string
    28  }
    29  
    30  // NewTable returns a database object that prefixes all keys with a given string.
    31  func NewTable(db ethdb.Database, prefix string) ethdb.Database {
    32  	return &table{
    33  		db:     db,
    34  		prefix: prefix,
    35  	}
    36  }
    37  
    38  // Close is a noop to implement the Database interface.
    39  func (t *table) Close() error {
    40  	return nil
    41  }
    42  
    43  // Has retrieves if a prefixed version of a key is present in the database.
    44  func (t *table) Has(key []byte) (bool, error) {
    45  	return t.db.Has(append([]byte(t.prefix), key...))
    46  }
    47  
    48  // Get retrieves the given prefixed key if it's present in the database.
    49  func (t *table) Get(key []byte) ([]byte, error) {
    50  	return t.db.Get(append([]byte(t.prefix), key...))
    51  }
    52  
    53  // HasAncient is a noop passthrough that just forwards the request to the underlying
    54  // database.
    55  func (t *table) HasAncient(kind string, number uint64) (bool, error) {
    56  	return t.db.HasAncient(kind, number)
    57  }
    58  
    59  // Ancient is a noop passthrough that just forwards the request to the underlying
    60  // database.
    61  func (t *table) Ancient(kind string, number uint64) ([]byte, error) {
    62  	return t.db.Ancient(kind, number)
    63  }
    64  
    65  // Ancients is a noop passthrough that just forwards the request to the underlying
    66  // database.
    67  func (t *table) Ancients() (uint64, error) {
    68  	return t.db.Ancients()
    69  }
    70  
    71  // AncientSize is a noop passthrough that just forwards the request to the underlying
    72  // database.
    73  func (t *table) AncientSize(kind string) (uint64, error) {
    74  	return t.db.AncientSize(kind)
    75  }
    76  
    77  // AppendAncient is a noop passthrough that just forwards the request to the underlying
    78  // database.
    79  func (t *table) AppendAncient(number uint64, hash, header, body, receipts, td []byte) error {
    80  	return t.db.AppendAncient(number, hash, header, body, receipts, td)
    81  }
    82  
    83  // TruncateAncients is a noop passthrough that just forwards the request to the underlying
    84  // database.
    85  func (t *table) TruncateAncients(items uint64) error {
    86  	return t.db.TruncateAncients(items)
    87  }
    88  
    89  // Sync is a noop passthrough that just forwards the request to the underlying
    90  // database.
    91  func (t *table) Sync() error {
    92  	return t.db.Sync()
    93  }
    94  
    95  // Put inserts the given value into the database at a prefixed version of the
    96  // provided key.
    97  func (t *table) Put(key []byte, value []byte) error {
    98  	return t.db.Put(append([]byte(t.prefix), key...), value)
    99  }
   100  
   101  // Delete removes the given prefixed key from the database.
   102  func (t *table) Delete(key []byte) error {
   103  	return t.db.Delete(append([]byte(t.prefix), key...))
   104  }
   105  
   106  // NewIterator creates a binary-alphabetical iterator over the entire keyspace
   107  // contained within the database.
   108  func (t *table) NewIterator() ethdb.Iterator {
   109  	return t.NewIteratorWithPrefix(nil)
   110  }
   111  
   112  // NewIteratorWithStart creates a binary-alphabetical iterator over a subset of
   113  // database content starting at a particular initial key (or after, if it does
   114  // not exist).
   115  func (t *table) NewIteratorWithStart(start []byte) ethdb.Iterator {
   116  	return t.db.NewIteratorWithStart(start)
   117  }
   118  
   119  // NewIteratorWithPrefix creates a binary-alphabetical iterator over a subset
   120  // of database content with a particular key prefix.
   121  func (t *table) NewIteratorWithPrefix(prefix []byte) ethdb.Iterator {
   122  	return t.db.NewIteratorWithPrefix(append([]byte(t.prefix), prefix...))
   123  }
   124  
   125  // Stat returns a particular internal stat of the database.
   126  func (t *table) Stat(property string) (string, error) {
   127  	return t.db.Stat(property)
   128  }
   129  
   130  // Compact flattens the underlying data store for the given key range. In essence,
   131  // deleted and overwritten versions are discarded, and the data is rearranged to
   132  // reduce the cost of operations needed to access them.
   133  //
   134  // A nil start is treated as a key before all keys in the data store; a nil limit
   135  // is treated as a key after all keys in the data store. If both is nil then it
   136  // will compact entire data store.
   137  func (t *table) Compact(start []byte, limit []byte) error {
   138  	// If no start was specified, use the table prefix as the first value
   139  	if start == nil {
   140  		start = []byte(t.prefix)
   141  	}
   142  	// If no limit was specified, use the first element not matching the prefix
   143  	// as the limit
   144  	if limit == nil {
   145  		limit = []byte(t.prefix)
   146  		for i := len(limit) - 1; i >= 0; i-- {
   147  			// Bump the current character, stopping if it doesn't overflow
   148  			limit[i]++
   149  			if limit[i] > 0 {
   150  				break
   151  			}
   152  			// Character overflown, proceed to the next or nil if the last
   153  			if i == 0 {
   154  				limit = nil
   155  			}
   156  		}
   157  	}
   158  	// Range correctly calculated based on table prefix, delegate down
   159  	return t.db.Compact(start, limit)
   160  }
   161  
   162  // NewBatch creates a write-only database that buffers changes to its host db
   163  // until a final write is called, each operation prefixing all keys with the
   164  // pre-configured string.
   165  func (t *table) NewBatch() ethdb.Batch {
   166  	return &tableBatch{t.db.NewBatch(), t.prefix}
   167  }
   168  
   169  // tableBatch is a wrapper around a database batch that prefixes each key access
   170  // with a pre-configured string.
   171  type tableBatch struct {
   172  	batch  ethdb.Batch
   173  	prefix string
   174  }
   175  
   176  // Put inserts the given value into the batch for later committing.
   177  func (b *tableBatch) Put(key, value []byte) error {
   178  	return b.batch.Put(append([]byte(b.prefix), key...), value)
   179  }
   180  
   181  // Delete inserts the a key removal into the batch for later committing.
   182  func (b *tableBatch) Delete(key []byte) error {
   183  	return b.batch.Delete(append([]byte(b.prefix), key...))
   184  }
   185  
   186  // ValueSize retrieves the amount of data queued up for writing.
   187  func (b *tableBatch) ValueSize() int {
   188  	return b.batch.ValueSize()
   189  }
   190  
   191  // Write flushes any accumulated data to disk.
   192  func (b *tableBatch) Write() error {
   193  	return b.batch.Write()
   194  }
   195  
   196  // Reset resets the batch for reuse.
   197  func (b *tableBatch) Reset() {
   198  	b.batch.Reset()
   199  }
   200  
   201  // Replay replays the batch contents.
   202  func (b *tableBatch) Replay(w ethdb.KeyValueWriter) error {
   203  	return b.batch.Replay(w)
   204  }