Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 | /* Copyright (c) 2016 Facebook * * This program is free software; you can redistribute it and/or * modify it under the terms of version 2 of the GNU General Public * License as published by the Free Software Foundation. */ #define _GNU_SOURCE #include <sched.h> #include <stdio.h> #include <sys/types.h> #include <asm/unistd.h> #include <unistd.h> #include <assert.h> #include <sys/wait.h> #include <stdlib.h> #include <signal.h> #include <linux/bpf.h> #include <string.h> #include <time.h> #include <sys/resource.h> #include "libbpf.h" #include "bpf_load.h" #define MAX_CNT 1000000 static __u64 time_get_ns(void) { struct timespec ts; clock_gettime(CLOCK_MONOTONIC, &ts); return ts.tv_sec * 1000000000ull + ts.tv_nsec; } #define HASH_PREALLOC (1 << 0) #define PERCPU_HASH_PREALLOC (1 << 1) #define HASH_KMALLOC (1 << 2) #define PERCPU_HASH_KMALLOC (1 << 3) static int test_flags = ~0; static void test_hash_prealloc(int cpu) { __u64 start_time; int i; start_time = time_get_ns(); for (i = 0; i < MAX_CNT; i++) syscall(__NR_getuid); printf("%d:hash_map_perf pre-alloc %lld events per sec\n", cpu, MAX_CNT * 1000000000ll / (time_get_ns() - start_time)); } static void test_percpu_hash_prealloc(int cpu) { __u64 start_time; int i; start_time = time_get_ns(); for (i = 0; i < MAX_CNT; i++) syscall(__NR_geteuid); printf("%d:percpu_hash_map_perf pre-alloc %lld events per sec\n", cpu, MAX_CNT * 1000000000ll / (time_get_ns() - start_time)); } static void test_hash_kmalloc(int cpu) { __u64 start_time; int i; start_time = time_get_ns(); for (i = 0; i < MAX_CNT; i++) syscall(__NR_getgid); printf("%d:hash_map_perf kmalloc %lld events per sec\n", cpu, MAX_CNT * 1000000000ll / (time_get_ns() - start_time)); } static void test_percpu_hash_kmalloc(int cpu) { __u64 start_time; int i; start_time = time_get_ns(); for (i = 0; i < MAX_CNT; i++) syscall(__NR_getegid); printf("%d:percpu_hash_map_perf kmalloc %lld events per sec\n", cpu, MAX_CNT * 1000000000ll / (time_get_ns() - start_time)); } static void loop(int cpu) { cpu_set_t cpuset; CPU_ZERO(&cpuset); CPU_SET(cpu, &cpuset); sched_setaffinity(0, sizeof(cpuset), &cpuset); if (test_flags & HASH_PREALLOC) test_hash_prealloc(cpu); if (test_flags & PERCPU_HASH_PREALLOC) test_percpu_hash_prealloc(cpu); if (test_flags & HASH_KMALLOC) test_hash_kmalloc(cpu); if (test_flags & PERCPU_HASH_KMALLOC) test_percpu_hash_kmalloc(cpu); } static void run_perf_test(int tasks) { pid_t pid[tasks]; int i; for (i = 0; i < tasks; i++) { pid[i] = fork(); if (pid[i] == 0) { loop(i); exit(0); } else if (pid[i] == -1) { printf("couldn't spawn #%d process\n", i); exit(1); } } for (i = 0; i < tasks; i++) { int status; assert(waitpid(pid[i], &status, 0) == pid[i]); assert(status == 0); } } int main(int argc, char **argv) { struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY}; char filename[256]; int num_cpu = 8; snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]); setrlimit(RLIMIT_MEMLOCK, &r); if (argc > 1) test_flags = atoi(argv[1]) ? : test_flags; if (argc > 2) num_cpu = atoi(argv[2]) ? : num_cpu; if (load_bpf_file(filename)) { printf("%s", bpf_log_buf); return 1; } run_perf_test(num_cpu); return 0; } |