table.go 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198
  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. package rawdb
  17. import (
  18. "github.com/ethereum/go-ethereum/ethdb"
  19. )
  20. // table is a wrapper around a database that prefixes each key access with a pre-
  21. // configured string.
  22. type table struct {
  23. db ethdb.Database
  24. prefix string
  25. }
  26. // NewTable returns a database object that prefixes all keys with a given string.
  27. func NewTable(db ethdb.Database, prefix string) ethdb.Database {
  28. return &table{
  29. db: db,
  30. prefix: prefix,
  31. }
  32. }
  33. // Close is a noop to implement the Database interface.
  34. func (t *table) Close() error {
  35. return nil
  36. }
  37. // Has retrieves if a prefixed version of a key is present in the database.
  38. func (t *table) Has(key []byte) (bool, error) {
  39. return t.db.Has(append([]byte(t.prefix), key...))
  40. }
  41. // Get retrieves the given prefixed key if it's present in the database.
  42. func (t *table) Get(key []byte) ([]byte, error) {
  43. return t.db.Get(append([]byte(t.prefix), key...))
  44. }
  45. // HasAncient is a noop passthrough that just forwards the request to the underlying
  46. // database.
  47. func (t *table) HasAncient(kind string, number uint64) (bool, error) {
  48. return t.db.HasAncient(kind, number)
  49. }
  50. // Ancient is a noop passthrough that just forwards the request to the underlying
  51. // database.
  52. func (t *table) Ancient(kind string, number uint64) ([]byte, error) {
  53. return t.db.Ancient(kind, number)
  54. }
  55. // Ancients is a noop passthrough that just forwards the request to the underlying
  56. // database.
  57. func (t *table) Ancients() (uint64, error) {
  58. return t.db.Ancients()
  59. }
  60. // AppendAncient is a noop passthrough that just forwards the request to the underlying
  61. // database.
  62. func (t *table) AppendAncient(number uint64, hash, header, body, receipts, td []byte) error {
  63. return t.db.AppendAncient(number, hash, header, body, receipts, td)
  64. }
  65. // TruncateAncients is a noop passthrough that just forwards the request to the underlying
  66. // database.
  67. func (t *table) TruncateAncients(items uint64) error {
  68. return t.db.TruncateAncients(items)
  69. }
  70. // Sync is a noop passthrough that just forwards the request to the underlying
  71. // database.
  72. func (t *table) Sync() error {
  73. return t.db.Sync()
  74. }
  75. // Put inserts the given value into the database at a prefixed version of the
  76. // provided key.
  77. func (t *table) Put(key []byte, value []byte) error {
  78. return t.db.Put(append([]byte(t.prefix), key...), value)
  79. }
  80. // Delete removes the given prefixed key from the database.
  81. func (t *table) Delete(key []byte) error {
  82. return t.db.Delete(append([]byte(t.prefix), key...))
  83. }
  84. // NewIterator creates a binary-alphabetical iterator over the entire keyspace
  85. // contained within the database.
  86. func (t *table) NewIterator() ethdb.Iterator {
  87. return t.NewIteratorWithPrefix(nil)
  88. }
  89. // NewIteratorWithStart creates a binary-alphabetical iterator over a subset of
  90. // database content starting at a particular initial key (or after, if it does
  91. // not exist).
  92. func (t *table) NewIteratorWithStart(start []byte) ethdb.Iterator {
  93. return t.db.NewIteratorWithStart(start)
  94. }
  95. // NewIteratorWithPrefix creates a binary-alphabetical iterator over a subset
  96. // of database content with a particular key prefix.
  97. func (t *table) NewIteratorWithPrefix(prefix []byte) ethdb.Iterator {
  98. return t.db.NewIteratorWithPrefix(append([]byte(t.prefix), prefix...))
  99. }
  100. // Stat returns a particular internal stat of the database.
  101. func (t *table) Stat(property string) (string, error) {
  102. return t.db.Stat(property)
  103. }
  104. // Compact flattens the underlying data store for the given key range. In essence,
  105. // deleted and overwritten versions are discarded, and the data is rearranged to
  106. // reduce the cost of operations needed to access them.
  107. //
  108. // A nil start is treated as a key before all keys in the data store; a nil limit
  109. // is treated as a key after all keys in the data store. If both is nil then it
  110. // will compact entire data store.
  111. func (t *table) Compact(start []byte, limit []byte) error {
  112. // If no start was specified, use the table prefix as the first value
  113. if start == nil {
  114. start = []byte(t.prefix)
  115. }
  116. // If no limit was specified, use the first element not matching the prefix
  117. // as the limit
  118. if limit == nil {
  119. limit = []byte(t.prefix)
  120. for i := len(limit) - 1; i >= 0; i-- {
  121. // Bump the current character, stopping if it doesn't overflow
  122. limit[i]++
  123. if limit[i] > 0 {
  124. break
  125. }
  126. // Character overflown, proceed to the next or nil if the last
  127. if i == 0 {
  128. limit = nil
  129. }
  130. }
  131. }
  132. // Range correctly calculated based on table prefix, delegate down
  133. return t.db.Compact(start, limit)
  134. }
  135. // NewBatch creates a write-only database that buffers changes to its host db
  136. // until a final write is called, each operation prefixing all keys with the
  137. // pre-configured string.
  138. func (t *table) NewBatch() ethdb.Batch {
  139. return &tableBatch{t.db.NewBatch(), t.prefix}
  140. }
  141. // tableBatch is a wrapper around a database batch that prefixes each key access
  142. // with a pre-configured string.
  143. type tableBatch struct {
  144. batch ethdb.Batch
  145. prefix string
  146. }
  147. // Put inserts the given value into the batch for later committing.
  148. func (b *tableBatch) Put(key, value []byte) error {
  149. return b.batch.Put(append([]byte(b.prefix), key...), value)
  150. }
  151. // Delete inserts the a key removal into the batch for later committing.
  152. func (b *tableBatch) Delete(key []byte) error {
  153. return b.batch.Delete(append([]byte(b.prefix), key...))
  154. }
  155. // ValueSize retrieves the amount of data queued up for writing.
  156. func (b *tableBatch) ValueSize() int {
  157. return b.batch.ValueSize()
  158. }
  159. // Write flushes any accumulated data to disk.
  160. func (b *tableBatch) Write() error {
  161. return b.batch.Write()
  162. }
  163. // Reset resets the batch for reuse.
  164. func (b *tableBatch) Reset() {
  165. b.batch.Reset()
  166. }
  167. // Replay replays the batch contents.
  168. func (b *tableBatch) Replay(w ethdb.KeyValueWriter) error {
  169. return b.batch.Replay(w)
  170. }