batch_tx.go 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186
  1. // Copyright 2015 CoreOS, Inc.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package backend
  15. import (
  16. "bytes"
  17. "log"
  18. "sync"
  19. "sync/atomic"
  20. "github.com/boltdb/bolt"
  21. )
  22. type BatchTx interface {
  23. Lock()
  24. Unlock()
  25. UnsafeCreateBucket(name []byte)
  26. UnsafePut(bucketName []byte, key []byte, value []byte)
  27. UnsafeSeqPut(bucketName []byte, key []byte, value []byte)
  28. UnsafeRange(bucketName []byte, key, endKey []byte, limit int64) (keys [][]byte, vals [][]byte)
  29. UnsafeDelete(bucketName []byte, key []byte)
  30. UnsafeForEach(bucketName []byte, visitor func(k, v []byte) error) error
  31. Commit()
  32. CommitAndStop()
  33. }
  34. type batchTx struct {
  35. sync.Mutex
  36. tx *bolt.Tx
  37. backend *backend
  38. pending int
  39. }
  40. func newBatchTx(backend *backend) *batchTx {
  41. tx := &batchTx{backend: backend}
  42. tx.Commit()
  43. return tx
  44. }
  45. func (t *batchTx) UnsafeCreateBucket(name []byte) {
  46. _, err := t.tx.CreateBucket(name)
  47. if err != nil && err != bolt.ErrBucketExists {
  48. log.Fatalf("storage: cannot create bucket %s (%v)", string(name), err)
  49. }
  50. t.pending++
  51. }
  52. // UnsafePut must be called holding the lock on the tx.
  53. func (t *batchTx) UnsafePut(bucketName []byte, key []byte, value []byte) {
  54. t.unsafePut(bucketName, key, value, false)
  55. }
  56. // UnsafeSeqPut must be called holding the lock on the tx.
  57. func (t *batchTx) UnsafeSeqPut(bucketName []byte, key []byte, value []byte) {
  58. t.unsafePut(bucketName, key, value, true)
  59. }
  60. func (t *batchTx) unsafePut(bucketName []byte, key []byte, value []byte, seq bool) {
  61. bucket := t.tx.Bucket(bucketName)
  62. if bucket == nil {
  63. log.Fatalf("storage: bucket %s does not exist", string(bucketName))
  64. }
  65. if seq {
  66. // it is useful to increase fill percent when the workloads are mostly append-only.
  67. // this can delay the page split and reduce space usage.
  68. bucket.FillPercent = 0.9
  69. }
  70. if err := bucket.Put(key, value); err != nil {
  71. log.Fatalf("storage: cannot put key into bucket (%v)", err)
  72. }
  73. t.pending++
  74. }
  75. // UnsafeRange must be called holding the lock on the tx.
  76. func (t *batchTx) UnsafeRange(bucketName []byte, key, endKey []byte, limit int64) (keys [][]byte, vs [][]byte) {
  77. bucket := t.tx.Bucket(bucketName)
  78. if bucket == nil {
  79. log.Fatalf("storage: bucket %s does not exist", string(bucketName))
  80. }
  81. if len(endKey) == 0 {
  82. if v := bucket.Get(key); v == nil {
  83. return keys, vs
  84. } else {
  85. return append(keys, key), append(vs, v)
  86. }
  87. }
  88. c := bucket.Cursor()
  89. for ck, cv := c.Seek(key); ck != nil && bytes.Compare(ck, endKey) < 0; ck, cv = c.Next() {
  90. vs = append(vs, cv)
  91. keys = append(keys, ck)
  92. if limit > 0 && limit == int64(len(keys)) {
  93. break
  94. }
  95. }
  96. return keys, vs
  97. }
  98. // UnsafeDelete must be called holding the lock on the tx.
  99. func (t *batchTx) UnsafeDelete(bucketName []byte, key []byte) {
  100. bucket := t.tx.Bucket(bucketName)
  101. if bucket == nil {
  102. log.Fatalf("storage: bucket %s does not exist", string(bucketName))
  103. }
  104. err := bucket.Delete(key)
  105. if err != nil {
  106. log.Fatalf("storage: cannot delete key from bucket (%v)", err)
  107. }
  108. t.pending++
  109. }
  110. // UnsafeForEach must be called holding the lock on the tx.
  111. func (t *batchTx) UnsafeForEach(bucketName []byte, visitor func(k, v []byte) error) error {
  112. b := t.tx.Bucket(bucketName)
  113. if b == nil {
  114. // bucket does not exist
  115. return nil
  116. }
  117. return b.ForEach(visitor)
  118. }
  119. // Commit commits a previous tx and begins a new writable one.
  120. func (t *batchTx) Commit() {
  121. t.Lock()
  122. defer t.Unlock()
  123. t.commit(false)
  124. }
  125. // CommitAndStop commits the previous tx and do not create a new one.
  126. func (t *batchTx) CommitAndStop() {
  127. t.Lock()
  128. defer t.Unlock()
  129. t.commit(true)
  130. }
  131. func (t *batchTx) Unlock() {
  132. if t.pending >= t.backend.batchLimit {
  133. t.commit(false)
  134. t.pending = 0
  135. }
  136. t.Mutex.Unlock()
  137. }
  138. func (t *batchTx) commit(stop bool) {
  139. var err error
  140. // commit the last tx
  141. if t.tx != nil {
  142. if t.pending == 0 && !stop {
  143. return
  144. }
  145. err = t.tx.Commit()
  146. atomic.AddInt64(&t.backend.commits, 1)
  147. t.pending = 0
  148. if err != nil {
  149. log.Fatalf("storage: cannot commit tx (%s)", err)
  150. }
  151. }
  152. if stop {
  153. return
  154. }
  155. t.backend.mu.RLock()
  156. defer t.backend.mu.RUnlock()
  157. // begin a new tx
  158. t.tx, err = t.backend.db.Begin(true)
  159. if err != nil {
  160. log.Fatalf("storage: cannot begin tx (%s)", err)
  161. }
  162. atomic.StoreInt64(&t.backend.size, t.tx.Size())
  163. }