tester.go 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  1. // Copyright 2015 The etcd Authors
  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 main
  15. import (
  16. "fmt"
  17. "time"
  18. )
  19. type tester struct {
  20. failures []failure
  21. cluster *cluster
  22. limit int
  23. consistencyCheck bool
  24. status Status
  25. currentRevision int64
  26. }
  27. // compactQPS is rough number of compact requests per second.
  28. // Previous tests showed etcd can compact about 60,000 entries per second.
  29. const compactQPS = 50000
  30. func (tt *tester) runLoop() {
  31. tt.status.Since = time.Now()
  32. tt.status.RoundLimit = tt.limit
  33. tt.status.cluster = tt.cluster
  34. for _, f := range tt.failures {
  35. tt.status.Failures = append(tt.status.Failures, f.Desc())
  36. }
  37. var (
  38. round int
  39. prevCompactRev int64
  40. )
  41. for {
  42. tt.status.setRound(round)
  43. tt.status.setCase(-1) // -1 so that logPrefix doesn't print out 'case'
  44. roundTotalCounter.Inc()
  45. var failed bool
  46. for j, f := range tt.failures {
  47. caseTotalCounter.WithLabelValues(f.Desc()).Inc()
  48. tt.status.setCase(j)
  49. if err := tt.cluster.WaitHealth(); err != nil {
  50. plog.Printf("%s wait full health error: %v", tt.logPrefix(), err)
  51. if err := tt.cleanup(); err != nil {
  52. return
  53. }
  54. failed = true
  55. break
  56. }
  57. plog.Printf("%s injecting failure %q", tt.logPrefix(), f.Desc())
  58. if err := f.Inject(tt.cluster, round); err != nil {
  59. plog.Printf("%s injection error: %v", tt.logPrefix(), err)
  60. if err := tt.cleanup(); err != nil {
  61. return
  62. }
  63. failed = true
  64. break
  65. }
  66. plog.Printf("%s injected failure", tt.logPrefix())
  67. plog.Printf("%s recovering failure %q", tt.logPrefix(), f.Desc())
  68. if err := f.Recover(tt.cluster, round); err != nil {
  69. plog.Printf("%s recovery error: %v", tt.logPrefix(), err)
  70. if err := tt.cleanup(); err != nil {
  71. return
  72. }
  73. failed = true
  74. break
  75. }
  76. plog.Printf("%s recovered failure", tt.logPrefix())
  77. if tt.cluster.v2Only {
  78. plog.Printf("%s succeed!", tt.logPrefix())
  79. continue
  80. }
  81. if !tt.consistencyCheck {
  82. if err := tt.updateRevision(); err != nil {
  83. plog.Warningf("%s functional-tester returning with tt.updateRevision error (%v)", tt.logPrefix(), err)
  84. return
  85. }
  86. continue
  87. }
  88. var err error
  89. failed, err = tt.checkConsistency()
  90. if err != nil {
  91. plog.Warningf("%s functional-tester returning with tt.checkConsistency error (%v)", tt.logPrefix(), err)
  92. return
  93. }
  94. if failed {
  95. break
  96. }
  97. plog.Printf("%s succeed!", tt.logPrefix())
  98. }
  99. // -1 so that logPrefix doesn't print out 'case'
  100. tt.status.setCase(-1)
  101. if failed {
  102. continue
  103. }
  104. revToCompact := max(0, tt.currentRevision-10000)
  105. compactN := revToCompact - prevCompactRev
  106. timeout := 10 * time.Second
  107. if prevCompactRev != 0 && compactN > 0 {
  108. timeout += time.Duration(compactN/compactQPS) * time.Second
  109. }
  110. prevCompactRev = revToCompact
  111. plog.Printf("%s compacting %d entries (timeout %v)", tt.logPrefix(), compactN, timeout)
  112. if err := tt.compact(revToCompact, timeout); err != nil {
  113. plog.Warningf("%s functional-tester returning with error (%v)", tt.logPrefix(), err)
  114. return
  115. }
  116. if round > 0 && round%500 == 0 { // every 500 rounds
  117. if err := tt.defrag(); err != nil {
  118. plog.Warningf("%s functional-tester returning with error (%v)", tt.logPrefix(), err)
  119. return
  120. }
  121. }
  122. round++
  123. if round == tt.limit {
  124. plog.Printf("%s functional-tester is finished", tt.logPrefix())
  125. break
  126. }
  127. }
  128. }
  129. func (tt *tester) updateRevision() error {
  130. revs, _, err := tt.cluster.getRevisionHash()
  131. for _, rev := range revs {
  132. tt.currentRevision = rev
  133. break // just need get one of the current revisions
  134. }
  135. return err
  136. }
  137. func (tt *tester) checkConsistency() (failed bool, err error) {
  138. tt.cancelStressers()
  139. defer tt.startStressers()
  140. plog.Printf("%s updating current revisions...", tt.logPrefix())
  141. var (
  142. revs map[string]int64
  143. hashes map[string]int64
  144. rerr error
  145. ok bool
  146. )
  147. for i := 0; i < 7; i++ {
  148. time.Sleep(time.Second)
  149. revs, hashes, rerr = tt.cluster.getRevisionHash()
  150. if rerr != nil {
  151. plog.Printf("%s #%d failed to get current revisions (%v)", tt.logPrefix(), i, rerr)
  152. continue
  153. }
  154. if tt.currentRevision, ok = getSameValue(revs); ok {
  155. break
  156. }
  157. plog.Printf("%s #%d inconsistent current revisions %+v", tt.logPrefix(), i, revs)
  158. }
  159. plog.Printf("%s updated current revisions with %d", tt.logPrefix(), tt.currentRevision)
  160. if !ok || rerr != nil {
  161. plog.Printf("%s checking current revisions failed [revisions: %v]", tt.logPrefix(), revs)
  162. failed = true
  163. err = tt.cleanup()
  164. return
  165. }
  166. plog.Printf("%s all members are consistent with current revisions [revisions: %v]", tt.logPrefix(), revs)
  167. plog.Printf("%s checking current storage hashes...", tt.logPrefix())
  168. if _, ok = getSameValue(hashes); !ok {
  169. plog.Printf("%s checking current storage hashes failed [hashes: %v]", tt.logPrefix(), hashes)
  170. failed = true
  171. err = tt.cleanup()
  172. return
  173. }
  174. plog.Printf("%s all members are consistent with storage hashes", tt.logPrefix())
  175. return
  176. }
  177. func (tt *tester) compact(rev int64, timeout time.Duration) error {
  178. plog.Printf("%s compacting storage (current revision %d, compact revision %d)", tt.logPrefix(), tt.currentRevision, rev)
  179. if err := tt.cluster.compactKV(rev, timeout); err != nil {
  180. if cerr := tt.cleanup(); cerr != nil {
  181. return fmt.Errorf("%s, %s", err, cerr)
  182. }
  183. return err
  184. }
  185. plog.Printf("%s compacted storage (compact revision %d)", tt.logPrefix(), rev)
  186. plog.Printf("%s checking compaction (compact revision %d)", tt.logPrefix(), rev)
  187. if err := tt.cluster.checkCompact(rev); err != nil {
  188. plog.Printf("%s checkCompact error (%v)", tt.logPrefix(), err)
  189. if cerr := tt.cleanup(); cerr != nil {
  190. return fmt.Errorf("%s, %s", err, cerr)
  191. }
  192. return err
  193. }
  194. plog.Printf("%s confirmed compaction (compact revision %d)", tt.logPrefix(), rev)
  195. return nil
  196. }
  197. func (tt *tester) defrag() error {
  198. plog.Printf("%s defragmenting...", tt.logPrefix())
  199. if err := tt.cluster.defrag(); err != nil {
  200. plog.Printf("%s defrag error (%v)", tt.logPrefix(), err)
  201. if cerr := tt.cleanup(); cerr != nil {
  202. return fmt.Errorf("%s, %s", err, cerr)
  203. }
  204. return err
  205. }
  206. plog.Printf("%s defragmented...", tt.logPrefix())
  207. return nil
  208. }
  209. func (tt *tester) logPrefix() string {
  210. var (
  211. rd = tt.status.getRound()
  212. cs = tt.status.getCase()
  213. prefix = fmt.Sprintf("[round#%d case#%d]", rd, cs)
  214. )
  215. if cs == -1 {
  216. prefix = fmt.Sprintf("[round#%d]", rd)
  217. }
  218. return prefix
  219. }
  220. func (tt *tester) cleanup() error {
  221. roundFailedTotalCounter.Inc()
  222. desc := "compact/defrag"
  223. if tt.status.Case != -1 {
  224. desc = tt.failures[tt.status.Case].Desc()
  225. }
  226. caseFailedTotalCounter.WithLabelValues(desc).Inc()
  227. plog.Printf("%s cleaning up...", tt.logPrefix())
  228. if err := tt.cluster.Cleanup(); err != nil {
  229. plog.Printf("%s cleanup error: %v", tt.logPrefix(), err)
  230. return err
  231. }
  232. return tt.cluster.Bootstrap()
  233. }
  234. func (tt *tester) cancelStressers() {
  235. plog.Printf("%s canceling the stressers...", tt.logPrefix())
  236. for _, s := range tt.cluster.Stressers {
  237. s.Cancel()
  238. }
  239. plog.Printf("%s canceled stressers", tt.logPrefix())
  240. }
  241. func (tt *tester) startStressers() {
  242. plog.Printf("%s starting the stressers...", tt.logPrefix())
  243. for _, s := range tt.cluster.Stressers {
  244. go s.Stress()
  245. }
  246. plog.Printf("%s started stressers", tt.logPrefix())
  247. }