Lines Matching full:traffic
87 # - "target": required, which queues we expect to get iperf traffic
88 # - "empty": optional, which queues should see no traffic at all
89 # - "noise": optional, which queues we expect to see low traffic;
100 ksft_ge(directed, 20000, f"traffic on {name}: " + str(cnts))
103 f"traffic on other queues ({name})':" + str(cnts))
106 f"traffic on inactive queues ({name}): " + str(cnts))
165 # Check we only get traffic on the first 2 queues
170 ksft_ge(cnts[0], 5000, "traffic on main context (1/2): " + str(cnts))
171 ksft_ge(cnts[1], 5000, "traffic on main context (2/2): " + str(cnts))
173 ksft_eq(sum(cnts[2:]), 0, "traffic on unused queues: " + str(cnts))
175 # Restore, and check traffic gets spread again
181 # First two queues get less traffic than all the rest
182 ksft_lt(sum(cnts[:2]), sum(cnts[2:]), "traffic distributed: " + str(cnts))
326 """Test that flows may be rehashed without impacting traffic.
330 the key does not cause link flaps or traffic disruption.
332 Disrupting traffic for key update is not a bug, but makes the key
429 Test separating traffic into RSS contexts.
451 # Use queues 0 and 1 for normal traffic
518 Test separating traffic into RSS contexts.
563 # Use queues 0 and 1 for normal traffic
633 ksft_ge(sum(cnts[ :4]), 20000, "traffic on main context: " + str(cnts))
634 ksft_ge(sum(cnts[ :2]), 7000, "traffic on main context (1/2): " + str(cnts))
635 ksft_ge(sum(cnts[2:4]), 7000, "traffic on main context (2/2): " + str(cnts))
637 ksft_eq(sum(cnts[4: ]), 0, "traffic on other queues: " + str(cnts))
639 # Now create a rule for context 1 and make sure traffic goes to a subset
651 ksft_lt(sum(cnts[ :2]), directed / 2, "traffic on main context: " + str(cnts))
652 ksft_ge(directed, 20000, "traffic on extra context: " + str(cnts))
654 ksft_eq(sum(cnts[4: ]), 0, "traffic on other queues: " + str(cnts))
728 # Use queue 0 for normal traffic