pktgen: Add imix distribution bins
In order to represent the distribution of imix packet sizes, a pre-computed data structure is used. It features 100 (IMIX_PRECISION) "bins". Contiguous ranges of these bins represent the respective packet size of each imix entry. This is done to avoid the overhead of selecting the correct imix packet size based on the corresponding weights. Example: imix_weights 40,7 576,4 1500,1 total_weight = 7 + 4 + 1 = 12 pkt_size 40 occurs 7/total_weight = 58% of the time pkt_size 576 occurs 4/total_weight = 33% of the time pkt_size 1500 occurs 1/total_weight = 9% of the time We generate a random number between 0-100 and select the corresponding packet size based on the specified weights. Eg. random number = 358723895 % 100 = 65 Selects the packet size corresponding to index:65 in the pre-computed imix_distribution array. An example of the pre-computed array is below: The imix_distribution will look like the following: 0 -> 0 (index of imix_entry.size == 40) 1 -> 0 (index of imix_entry.size == 40) 2 -> 0 (index of imix_entry.size == 40) [...] -> 0 (index of imix_entry.size == 40) 57 -> 0 (index of imix_entry.size == 40) 58 -> 1 (index of imix_entry.size == 576) [...] -> 1 (index of imix_entry.size == 576) 90 -> 1 (index of imix_entry.size == 576) 91 -> 2 (index of imix_entry.size == 1500) [...] -> 2 (index of imix_entry.size == 1500) 99 -> 2 (index of imix_entry.size == 1500) Create and use "bin" representation of the imix distribution. Signed-off-by: Nick Richardson <richardsonnick@google.com> Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
Родитель
52a62f8603
Коммит
9014903132
|
@ -177,6 +177,7 @@
|
|||
#define MPLS_STACK_BOTTOM htonl(0x00000100)
|
||||
/* Max number of internet mix entries that can be specified in imix_weights. */
|
||||
#define MAX_IMIX_ENTRIES 20
|
||||
#define IMIX_PRECISION 100 /* Precision of IMIX distribution */
|
||||
|
||||
#define func_enter() pr_debug("entering %s\n", __func__);
|
||||
|
||||
|
@ -354,6 +355,8 @@ struct pktgen_dev {
|
|||
/* IMIX */
|
||||
unsigned int n_imix_entries;
|
||||
struct imix_pkt imix_entries[MAX_IMIX_ENTRIES];
|
||||
/* Maps 0-IMIX_PRECISION range to imix_entry based on probability*/
|
||||
__u8 imix_distribution[IMIX_PRECISION];
|
||||
|
||||
/* MPLS */
|
||||
unsigned int nr_labels; /* Depth of stack, 0 = no MPLS */
|
||||
|
@ -483,6 +486,7 @@ static void pktgen_stop_all_threads(struct pktgen_net *pn);
|
|||
|
||||
static void pktgen_stop(struct pktgen_thread *t);
|
||||
static void pktgen_clear_counters(struct pktgen_dev *pkt_dev);
|
||||
static void fill_imix_distribution(struct pktgen_dev *pkt_dev);
|
||||
|
||||
/* Module parameters, defaults. */
|
||||
static int pg_count_d __read_mostly = 1000;
|
||||
|
@ -1046,6 +1050,8 @@ static ssize_t pktgen_if_write(struct file *file,
|
|||
if (len < 0)
|
||||
return len;
|
||||
|
||||
fill_imix_distribution(pkt_dev);
|
||||
|
||||
i += len;
|
||||
return count;
|
||||
}
|
||||
|
@ -2568,6 +2574,14 @@ static void mod_cur_headers(struct pktgen_dev *pkt_dev)
|
|||
t = pkt_dev->min_pkt_size;
|
||||
}
|
||||
pkt_dev->cur_pkt_size = t;
|
||||
} else if (pkt_dev->n_imix_entries > 0) {
|
||||
struct imix_pkt *entry;
|
||||
__u32 t = prandom_u32() % IMIX_PRECISION;
|
||||
__u8 entry_index = pkt_dev->imix_distribution[t];
|
||||
|
||||
entry = &pkt_dev->imix_entries[entry_index];
|
||||
entry->count_so_far++;
|
||||
pkt_dev->cur_pkt_size = entry->size;
|
||||
}
|
||||
|
||||
set_cur_queue_map(pkt_dev);
|
||||
|
@ -2636,6 +2650,33 @@ static void free_SAs(struct pktgen_dev *pkt_dev)
|
|||
}
|
||||
}
|
||||
|
||||
static void fill_imix_distribution(struct pktgen_dev *pkt_dev)
|
||||
{
|
||||
int cumulative_probabilites[MAX_IMIX_ENTRIES];
|
||||
int j = 0;
|
||||
__u64 cumulative_prob = 0;
|
||||
__u64 total_weight = 0;
|
||||
int i = 0;
|
||||
|
||||
for (i = 0; i < pkt_dev->n_imix_entries; i++)
|
||||
total_weight += pkt_dev->imix_entries[i].weight;
|
||||
|
||||
/* Fill cumulative_probabilites with sum of normalized probabilities */
|
||||
for (i = 0; i < pkt_dev->n_imix_entries - 1; i++) {
|
||||
cumulative_prob += div64_u64(pkt_dev->imix_entries[i].weight *
|
||||
IMIX_PRECISION,
|
||||
total_weight);
|
||||
cumulative_probabilites[i] = cumulative_prob;
|
||||
}
|
||||
cumulative_probabilites[pkt_dev->n_imix_entries - 1] = 100;
|
||||
|
||||
for (i = 0; i < IMIX_PRECISION; i++) {
|
||||
if (i == cumulative_probabilites[j])
|
||||
j++;
|
||||
pkt_dev->imix_distribution[i] = j;
|
||||
}
|
||||
}
|
||||
|
||||
static int process_ipsec(struct pktgen_dev *pkt_dev,
|
||||
struct sk_buff *skb, __be16 protocol)
|
||||
{
|
||||
|
|
Загрузка…
Ссылка в новой задаче