Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Programmable RSS: handle single queue separately #3

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
55 changes: 55 additions & 0 deletions programmable_rss/rss_user.c
Original file line number Diff line number Diff line change
Expand Up @@ -53,6 +53,46 @@ static int get_interface_rx_channels(int ifindex)
return cmd.combined_count + cmd.rx_count;
}

static int poll_stats_single_queue(int indirect_map_fd, int queue, int poll_secs)
{
struct indirect_queue indirect_lookup;
int value = 0, prev = 0;
struct timespec t1, t2;
double time_taken;
long queue_rate;
int i = 0;

/* use thousand separators in printf */
setlocale(LC_NUMERIC, "en_US");

clock_gettime(CLOCK_MONOTONIC_RAW, &t1);

while (true) {
printf("-------------------------------------------------\n\n");
if (bpf_map_lookup_elem(indirect_map_fd,
&i, &indirect_lookup) != 0) {
printf("Err lookup failed\n");
return 0;
}

value = indirect_lookup.packet_cnt;

/* calc sample period to allow rate to be obtained */
clock_gettime(CLOCK_MONOTONIC_RAW, &t2);
time_taken = (t2.tv_sec + 1.0e-9 * t2.tv_nsec) -
(t1.tv_sec + 1.0e-9 * t1.tv_nsec);

queue_rate = (value - prev) / time_taken;
printf("RSS Queue %d: %'ld\n", queue, queue_rate);
prev = value;
value = 0;

t1 = t2;
usleep(poll_secs * 1000 * 1000);
}
}


static int poll_stats(int indirect_map_fd, int queues_enabled, int poll_secs)
{
struct indirect_queue indirect_lookup;
Expand Down Expand Up @@ -231,6 +271,21 @@ int main(int argc, char **argv)
return -1;
}

/* use indirection map for stats in the single queue case */
if (mapctrl.select_mode == QUEUE_STATIC) {
indirect_rec.queue_num = mapctrl.queue_static;
i = 0;

if (bpf_map_update_elem(indirect_map_fd, &i, &indirect_rec,
BPF_ANY) != 0) {
printf("Err: Map update failed\n");
return -1;
}

poll_stats_single_queue(indirect_map_fd, mapctrl.queue_static, 1);
return 0;
}

/* fill ctrl map with hash mode queues */
key = 0;
if (bpf_map_update_elem(ctrl_map_fd, &key, &mapctrl, BPF_ANY) != 0) {
Expand Down