Lines Matching full:traffic
78 # - "target": required, which queues we expect to get iperf traffic
79 # - "empty": optional, which queues should see no traffic at all
80 # - "noise": optional, which queues we expect to see low traffic;
91 ksft_ge(directed, 20000, f"traffic on {name}: " + str(cnts))
94 f"traffic on other queues ({name})':" + str(cnts))
97 f"traffic on inactive queues ({name}): " + str(cnts))
156 # Check we only get traffic on the first 2 queues
161 ksft_ge(cnts[0], 5000, "traffic on main context (1/2): " + str(cnts))
162 ksft_ge(cnts[1], 5000, "traffic on main context (2/2): " + str(cnts))
164 ksft_eq(sum(cnts[2:]), 0, "traffic on unused queues: " + str(cnts))
166 # Restore, and check traffic gets spread again
172 # First two queues get less traffic than all the rest
173 ksft_lt(sum(cnts[:2]), sum(cnts[2:]), "traffic distributed: " + str(cnts))
317 """Test that flows may be rehashed without impacting traffic.
321 the key does not cause link flaps or traffic disruption.
323 Disrupting traffic for key update is not a bug, but makes the key
420 Test separating traffic into RSS contexts.
442 # Use queues 0 and 1 for normal traffic
507 Test separating traffic into RSS contexts.
553 # Use queues 0 and 1 for normal traffic
624 ksft_ge(sum(cnts[ :4]), 20000, "traffic on main context: " + str(cnts))
625 ksft_ge(sum(cnts[ :2]), 7000, "traffic on main context (1/2): " + str(cnts))
626 ksft_ge(sum(cnts[2:4]), 7000, "traffic on main context (2/2): " + str(cnts))
628 ksft_eq(sum(cnts[4: ]), 0, "traffic on other queues: " + str(cnts))
630 # Now create a rule for context 1 and make sure traffic goes to a subset
642 ksft_lt(sum(cnts[ :2]), directed / 2, "traffic on main context: " + str(cnts))
643 ksft_ge(directed, 20000, "traffic on extra context: " + str(cnts))
645 ksft_eq(sum(cnts[4: ]), 0, "traffic on other queues: " + str(cnts))
696 # Use queue 0 for normal traffic