1 // Testing tool for Keep services.
3 // keepexercise helps measure throughput and test reliability under
4 // various usage patterns.
6 // By default, it reads and writes blocks containing 2^26 NUL
7 // bytes. This generates network traffic without consuming much disk
10 // For a more realistic test, enable -vary-request. Warning: this will
11 // fill your storage volumes with random data if you leave it running,
12 // which can cost you money or leave you with too little room for
26 "git.curoverse.com/arvados.git/sdk/go/arvadosclient"
27 "git.curoverse.com/arvados.git/sdk/go/keepclient"
30 // Command line config knobs
32 BlockSize = flag.Int("block-size", keepclient.BLOCKSIZE, "bytes per read/write op")
33 ReadThreads = flag.Int("rthreads", 1, "number of concurrent readers")
34 WriteThreads = flag.Int("wthreads", 1, "number of concurrent writers")
35 VaryRequest = flag.Bool("vary-request", false, "vary the data for each request: consumes disk space, exercises write behavior")
36 VaryThread = flag.Bool("vary-thread", false, "use -wthreads different data blocks")
37 Replicas = flag.Int("replicas", 1, "replication level for writing")
38 StatsInterval = flag.Duration("stats-interval", time.Second, "time interval between IO stats reports, or 0 to disable")
44 arv, err := arvadosclient.MakeArvadosClient()
48 kc, err := keepclient.MakeKeepClient(&arv)
52 kc.Want_replicas = *Replicas
53 kc.Client.Timeout = 10 * time.Minute
55 nextBuf := make(chan []byte, *WriteThreads)
56 nextLocator := make(chan string, *ReadThreads+*WriteThreads)
58 go countBeans(nextLocator)
59 for i := 0; i < *WriteThreads; i++ {
60 go makeBufs(nextBuf, i)
61 go doWrites(kc, nextBuf, nextLocator)
63 for i := 0; i < *ReadThreads; i++ {
64 go doReads(kc, nextLocator)
69 // Send 1234 to bytesInChan when we receive 1234 bytes from keepstore.
70 var bytesInChan = make(chan uint64)
71 var bytesOutChan = make(chan uint64)
73 // Send struct{}{} to errorsChan when an error happens.
74 var errorsChan = make(chan struct{})
76 func countBeans(nextLocator chan string) {
78 var tickChan <-chan time.Time
79 if *StatsInterval > 0 {
80 tickChan = time.NewTicker(*StatsInterval).C
88 elapsed := time.Since(t0)
89 log.Printf("%v elapsed: read %v bytes (%.1f MiB/s), wrote %v bytes (%.1f MiB/s), errors %d",
91 bytesIn, (float64(bytesIn) / elapsed.Seconds() / 1048576),
92 bytesOut, (float64(bytesOut) / elapsed.Seconds() / 1048576),
95 case i := <-bytesInChan:
97 case o := <-bytesOutChan:
105 func makeBufs(nextBuf chan []byte, threadID int) {
106 buf := make([]byte, *BlockSize)
108 binary.PutVarint(buf, int64(threadID))
112 if _, err := io.ReadFull(rand.Reader, buf); err != nil {
120 func doWrites(kc *keepclient.KeepClient, nextBuf chan []byte, nextLocator chan string) {
121 for buf := range nextBuf {
122 locator, _, err := kc.PutB(buf)
125 errorsChan <- struct{}{}
128 bytesOutChan <- uint64(len(buf))
129 for cap(nextLocator) > len(nextLocator)+*WriteThreads {
130 // Give the readers something to do, unless
131 // they have lots queued up already.
132 nextLocator <- locator
137 func doReads(kc *keepclient.KeepClient, nextLocator chan string) {
138 for locator := range nextLocator {
139 rdr, size, url, err := kc.Get(locator)
142 errorsChan <- struct{}{}
145 n, err := io.Copy(ioutil.Discard, rdr)
147 if n != size || err != nil {
148 log.Printf("Got %d bytes (expected %d) from %s: %v", n, size, url, err)
149 errorsChan <- struct{}{}
151 // Note we don't count the bytes received in
152 // partial/corrupt responses: we are measuring
153 // throughput, not resource consumption.
155 bytesInChan <- uint64(n)