tester.go 7.6 KB

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