zt/zttest/zt-traffic-test/loop4/generator.go

/*
	Copyright NetFoundry Inc.

	Licensed under the Apache License, Version 2.0 (the "License");
	you may not use this file except in compliance with the License.
	You may obtain a copy of the License at

	https://www.apache.org/licenses/LICENSE-2.0

	Unless required by applicable law or agreed to in writing, software
	distributed under the License is distributed on an "AS IS" BASIS,
	WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
	See the License for the specific language governing permissions and
	limitations under the License.
*/

package loop4

import (
	"crypto/sha512"
	"math/rand"

	"github.com/michaelquigley/pfxlog"
	"github.com/hanzozt/foundation/v2/info"
)

type randomHashedBlockGenerator struct {
	count       int
	minSize     int
	maxSize     int
	latencyFreq int
	blocks      chan Block
	pool        [][]byte
	rxNotifier  RxNotifier
}

func newRandomHashedBlockGenerator(count, minSize, maxSize, latencyFreq int, rxNotifer RxNotifier) *randomHashedBlockGenerator {
	g := &randomHashedBlockGenerator{
		count:       count,
		minSize:     minSize,
		maxSize:     maxSize,
		latencyFreq: latencyFreq,
		blocks:      make(chan Block),
		pool:        newPool(),
		rxNotifier:  rxNotifer,
	}
	return g
}

func (g *randomHashedBlockGenerator) run() {
	log := pfxlog.Logger()
	log.Debug("started")
	defer log.Debug("complete")

	for i := 0; i < g.count; i++ {
		size := g.minSize
		distance := g.maxSize - g.minSize
		if distance > 0 {
			size += rand.Intn(distance)
		}
		data := make([]byte, size)
		for idx := 0; idx < size; {
			bucket := g.pool[rand.Intn(len(g.pool))]
			for i := 0; i < len(bucket) && idx < size; i++ {
				data[idx] = bucket[i]
				idx++
			}
		}
		hash := sha512.Sum512(data)
		blockType := BlockTypePlain
		if g.latencyFreq > 0 && i%g.latencyFreq == 0 {
			blockType = BlockTypeLatencyRequest
		}
		g.rxNotifier.OkToSend()
		g.blocks <- &RandHashedBlock{
			Type:     blockType,
			Sequence: uint32(i),
			Data:     data,
			Hash:     hash[:],
		}
	}
}

func newPool() [][]byte {
	log := pfxlog.Logger()
	start := info.NowInMilliseconds()
	log.Debug("building")
	defer func() {
		log.Debugf("complete (%d)", info.NowInMilliseconds()-start)
	}()

	buckets := 64
	pool := make([][]byte, buckets)
	for i := 0; i < buckets; i++ {
		length := 4096
		pool[i] = make([]byte, 0)
		for j := 0; j < length; j++ {
			pool[i] = append(pool[i], byte(rand.Intn(255)))
		}
	}
	return pool
}

func newSeqGenerator(count, minSize, maxSize int, rxNotifier RxNotifier) *seqGenerator {
	g := &seqGenerator{
		count:      count,
		minSize:    minSize,
		maxSize:    maxSize,
		blocks:     make(chan Block),
		rxNotifier: rxNotifier,
	}
	return g
}

func (g *seqGenerator) run() {
	log := pfxlog.Logger()
	log.Debug("started")
	defer log.Debug("complete")

	var seq uint64

	for i := 0; i < g.count; i++ {
		size := g.minSize
		distance := g.maxSize - g.minSize
		if distance > 0 {
			size += rand.Intn(distance)
		}
		data := make([]byte, size)
		for idx := 0; idx < size; idx++ {
			data[idx] = byte(seq)
			seq++
		}
		g.rxNotifier.OkToSend()
		g.blocks <- SeqBlock(data)
	}
}

type seqGenerator struct {
	count      int
	minSize    int
	maxSize    int
	blocks     chan Block
	rxNotifier RxNotifier
}