l.V(0).Info("0")
			l.V(1).Info("1")
			l.V(2).Info("2")
			l.V(3).Info("3")
			l.V(4).Info("4")

			matchBool(t, true, l.V(0).Enabled())
			matchBool(t, true, l.V(3).Enabled())
			matchBool(t, false, l.V(4).Enabled())
			matchBool(t, false, l.V(6).Enabled())
		})
		mustMatchLength(t, 4, lines)
		mustRegexMatchString(t, lines[0], "0")
		mustRegexMatchString(t, lines[1], "1")

// split up by the size of the execution queues.
// matchPool[i] machines have queue size matchSize[i].
// On a 64-bit system each queue entry is 16 bytes,
// so matchPool[0] has 16*2*128 = 4kB queues, etc.
// The final matchPool is a catch-all for very large queues.
var (
	matchSize = [...]int{128, 512, 2048, 16384, 0}
	matchPool [len(matchSize)]sync.Pool
)

// get returns a machine to use for matching re.