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