aboutsummaryrefslogtreecommitdiffstats
path: root/extras
AgeCommit message (Expand)AuthorFilesLines
2019-08-21libmemif: introduce 'memif_per_thread_' namespaceJakub Grajciar9-113/+1314
2019-08-20api: Cleanup APIs interface.apiJakub Grajciar4-15/+19
2019-08-12papi: Revert vpp-api-python to py2, add py3 pkgIan Wells1-2/+29
2019-08-10http_static: tls supportDave Barach2-0/+13
2019-08-07vom: export/install cmake filesNeale Ranns6-1/+169
2019-07-31qos: Store functionNeale Ranns7-1/+653
2019-07-26libmemif: fix autoconnectJakub Grajciar1-4/+4
2019-07-26dhcp ip: DSCP settings for transmitted DHCP packetsNeale Ranns8-17/+174
2019-07-25vom: QoS supportNeale Ranns17-0/+2132
2019-07-25libmemif: fix chained buffer flagJakub Grajciar1-0/+1
2019-07-12docs: how to enable coredump with systemdBenoît Ganne1-0/+5
2019-07-11vom: Fix reference to flags in GBP bridge-domainNeale Ranns1-1/+1
2019-07-10emacs: update the vat plugin generatorDave Barach1-17/+1
2019-07-09misc: extras update list_api_changes.py to PY3Paul Vinciguerra1-11/+14
2019-07-05misc: allow second ':' in commit messageDamjan Marion1-1/+1
2019-07-03fib: allow route delete with no paths and multipath=0 to remove theNeale Ranns1-1/+2
2019-07-02gbp: add anonymous l3-out subnetsBenoît Ganne2-6/+20
2019-07-02libmemif: version 3.0Jakub Grajciar12-339/+423
2019-07-02vom: Fix [m]route dumpNeale Ranns1-36/+2
2019-07-01libmemif: icmp-responder example buffer management fixJakub Grajciar1-5/+8
2019-07-01gbp: VRF scoped contractsNeale Ranns16-53/+152
2019-06-26api: refactor format_vl_api_prefix_t return keysPaul Vinciguerra1-2/+2
2019-06-26vom: Add getter for interface admin stateMohsin Kazmi2-0/+11
2019-06-25build: fix error messages in check_commit_msg.shDave Barach1-4/+3
2019-06-19l2: BD ARP termination entry API updateNeale Ranns2-10/+11
2019-06-18fib: fib api updatesNeale Ranns21-474/+593
2019-06-14misc: Update MAINTAINERS to include interface commonNeale Ranns1-1/+1
2019-06-12misc: add check_commit_msg.sh scriptDamjan Marion1-0/+50
2019-06-07build: add -Wall and -fno-common, fix reported issuesBenoît Ganne8-45/+14
2019-06-04vom: Add bridge domain unknown unicast flooding flagMohsin Kazmi4-5/+54
2019-06-03vom: Add bridge domain arp unicast forwarding flagMohsin Kazmi4-3/+48
2019-05-31VPP-1640 - Missing rules in vpp-selinux-policyBilly McFall1-1/+2
2019-05-31VPP-1679 - SElinux rules are not set accordinglyBilly McFall1-2/+4
2019-05-31VPP-1640 - Missing rules in vpp-selinux-policyBilly McFall1-0/+212
2019-05-29emacs-skeleton: improve generated .api filesDave Barach3-29/+58
2019-05-29Break out the broom for some cleanup workDave Barach3-17/+27
2019-05-23rpm: VPP-1674: exclude external headers from rpmBenoît Ganne2-2/+2
2019-05-22stats: support multiple works for error countersOle Troan2-5/+5
2019-05-18emacs-lisp: add missing '\' in templateDave Barach1-8/+7
2019-05-02Add the packages for 19.04jdenisco2-6/+6
2019-05-01Freshen RPM dependencies in vpp specfile.Thomas F Herbert1-19/+16
2019-05-01vpp_config: Update deprecated platform.linux_distribution()Paul Vinciguerra2-8/+9
2019-05-01vpp_config: correct usage of 'is' for equality tests.Paul Vinciguerra2-16/+16
2019-04-24NAT: VPP-1531 api cleanup & updateFilip Varga3-11/+17
2019-04-23Revert "NAT: VPP-1531 api cleanup & update"Ole Trøan3-17/+11
2019-04-23NAT: VPP-1531 api cleanup & updateFilip Varga3-11/+17
2019-04-19Doxygen cleanup.Dave Wallace1-1/+1
2019-04-18Extras: Fix list_api_changes script for 19.08Dave Wallace1-2/+2
2019-04-16Static http serverDave Barach1-0/+6
2019-04-11Make the loss / delay sim available as an output featureDave Barach1-0/+25
n">uword *key_hash; u64 *keys; uword hash_memory_size; BVT (clib_bihash) hash; clib_time_t clib_time; void *global_heap; unformat_input_t *input; } test_main_t; test_main_t test_main; uword vl (void *v) { return vec_len (v); } static clib_error_t * test_bihash_vec64 (test_main_t * tm) { u32 user_buckets = 1228800; u32 user_memory_size = 209715200; BVT (clib_bihash_kv) kv; int i, j; f64 before; f64 *cum_times = 0; BVT (clib_bihash) * h; h = &tm->hash; #if BIHASH_32_64_SVM BV (clib_bihash_master_init_svm) (h, "test", user_buckets, 0x30000000 /* base_addr */ , user_memory_size); #else BV (clib_bihash_init) (h, "test", user_buckets, user_memory_size); #endif before = clib_time_now (&tm->clib_time); for (j = 0; j < 10; j++) { for (i = 1; i <= j * 1000 + 1; i++) { kv.key = i; kv.value = 1; BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ ); } vec_add1 (cum_times, clib_time_now (&tm->clib_time) - before); } for (j = 0; j < vec_len (cum_times); j++) fformat (stdout, "Cum time for %d: %.4f (us)\n", (j + 1) * 1000, cum_times[j] * 1e6); return 0; } static int stale_cb (BVT (clib_bihash_kv) * kv, void *ctx) { test_main_t *tm = ctx; tm->noverwritten++; return 1; } static clib_error_t * test_bihash_stale_overwrite (test_main_t * tm) { BVT (clib_bihash) * h; BVT (clib_bihash_kv) kv; int i; tm->noverwritten = 0; h = &tm->hash; #if BIHASH_32_64_SVM BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets, 0x30000000 /* base_addr */ , tm->hash_memory_size); #else BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size); #endif fformat (stdout, "Add %d items to %d buckets\n", tm->nitems, tm->nbuckets); for (i = 0; i < tm->nitems; i++) { kv.key = i; kv.value = 1; BV (clib_bihash_add_or_overwrite_stale) (h, &kv, stale_cb, tm); } fformat (stdout, "%d items overwritten\n", tm->noverwritten); fformat (stdout, "%U", BV (format_bihash), h, 0); return 0; } void * test_bihash_thread_fn (void *arg) { BVT (clib_bihash) * h; BVT (clib_bihash_kv) kv; test_main_t *tm = &test_main; int i, j; u32 my_thread_index = (u32) (u64) arg; __os_thread_index = my_thread_index; clib_mem_set_per_cpu_heap (tm->global_heap); while (tm->thread_barrier) ; h = &tm->hash; for (i = 0; i < tm->ncycles; i++) { for (j = 0; j < tm->nitems; j++) { kv.key = ((u64) my_thread_index << 32) | (u64) j; kv.value = ((u64) my_thread_index << 32) | (u64) j; (void) __atomic_add_fetch (&tm->sequence_number, 1, __ATOMIC_ACQUIRE); BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ ); } for (j = 0; j < tm->nitems; j++) { kv.key = ((u64) my_thread_index << 32) | (u64) j; kv.value = ((u64) my_thread_index << 32) | (u64) j; (void) __atomic_add_fetch (&tm->sequence_number, 1, __ATOMIC_ACQUIRE); BV (clib_bihash_add_del) (h, &kv, 0 /* is_add */ ); } } (void) __atomic_sub_fetch (&tm->threads_running, 1, __ATOMIC_ACQUIRE); while (1) { struct timespec ts, tsrem; ts.tv_sec = 1; ts.tv_nsec = 0; while (nanosleep (&ts, &tsrem) < 0) ts = tsrem; } return (0); /* not so much */ } static clib_error_t * test_bihash_threads (test_main_t * tm) { int i; pthread_t handle; BVT (clib_bihash) * h; int rv; h = &tm->hash; #if BIHASH_32_64_SVM BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets, 0x30000000 /* base_addr */ , tm->hash_memory_size); #else BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size); #endif tm->thread_barrier = 1; /* Start the worker threads */ for (i = 0; i < tm->nthreads; i++) { rv = pthread_create (&handle, NULL, test_bihash_thread_fn, (void *) (u64) i); if (rv) { clib_unix_warning ("pthread_create returned %d", rv); } } tm->threads_running = i; tm->sequence_number = 0; CLIB_MEMORY_BARRIER (); /* start the workers */ tm->thread_barrier = 0; while (tm->threads_running) { struct timespec ts, tsrem; ts.tv_sec = 0; ts.tv_nsec = 20 * 1000 * 1000; /* sleep for 20ms at a time */ while (nanosleep (&ts, &tsrem) < 0) ts = tsrem; } return 0; } static clib_error_t * test_bihash (test_main_t * tm) { int i, j; uword *p; uword total_searches; f64 before, delta; BVT (clib_bihash) * h; BVT (clib_bihash_kv) kv; u32 acycle; h = &tm->hash; #if BIHASH_32_64_SVM BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets, 0x30000000 /* base_addr */ , tm->hash_memory_size); #else BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size); #endif for (acycle = 0; acycle < tm->ncycles; acycle++) { if ((acycle % tm->report_every_n) == 0) { fformat (stdout, "Cycle %lld out of %lld...\n", acycle, tm->ncycles); fformat (stdout, "Pick %lld unique %s keys...\n", tm->nitems, tm->non_random_keys ? "non-random" : "random"); } for (i = 0; i < tm->nitems; i++) { u64 rndkey; if (tm->non_random_keys == 0) { again: rndkey = random_u64 (&tm->seed); p = hash_get (tm->key_hash, rndkey); if (p) goto again; } else rndkey = (u64) (i + 1) << 16; rndkey += acycle; hash_set (tm->key_hash, rndkey, i + 1); vec_add1 (tm->keys, rndkey); } if ((acycle % tm->report_every_n) == 0) fformat (stdout, "Add items...\n"); for (i = 0; i < tm->nitems; i++) { kv.key = tm->keys[i]; kv.value = i + 1; BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ ); if (tm->verbose > 1) { fformat (stdout, "--------------------\n"); fformat (stdout, "After adding key %llu value %lld...\n", tm->keys[i], (u64) (i + 1)); fformat (stdout, "%U", BV (format_bihash), h, 2 /* very verbose */ ); } } if ((acycle % tm->report_every_n) == 0) { fformat (stdout, "%U", BV (format_bihash), h, 0 /* very verbose */ ); fformat (stdout, "Search for items %d times...\n", tm->search_iter); } before = clib_time_now (&tm->clib_time); for (j = 0; j < tm->search_iter; j++) { for (i = 0; i < tm->nitems; i++) { kv.key = tm->keys[i]; if (BV (clib_bihash_search) (h, &kv, &kv) < 0) if (BV (clib_bihash_search) (h, &kv, &kv) < 0) clib_warning ("[%d] search for key %lld failed unexpectedly\n", i, tm->keys[i]); if (kv.value != (u64) (i + 1)) clib_warning ("[%d] search for key %lld returned %lld, not %lld\n", i, tm->keys, kv.value, (u64) (i + 1)); } } if ((acycle % tm->report_every_n) == 0) { delta = clib_time_now (&tm->clib_time) - before; total_searches = (uword) tm->search_iter * (uword) tm->nitems; if (delta > 0) fformat (stdout, "%.f searches per second\n", ((f64) total_searches) / delta); fformat (stdout, "%lld searches in %.6f seconds\n", total_searches, delta); fformat (stdout, "Standard E-hash search for items %d times...\n", tm->search_iter); } before = clib_time_now (&tm->clib_time); for (j = 0; j < tm->search_iter; j++) { for (i = 0; i < tm->nitems; i++) { p = hash_get (tm->key_hash, tm->keys[i]); if (p == 0 || p[0] != (uword) (i + 1)) clib_warning ("ugh, couldn't find %lld\n", tm->keys[i]); } } delta = clib_time_now (&tm->clib_time) - before; total_searches = (uword) tm->search_iter * (uword) tm->nitems; if ((acycle % tm->report_every_n) == 0) { fformat (stdout, "%lld searches in %.6f seconds\n", total_searches, delta); if (delta > 0) fformat (stdout, "%.f searches per second\n", ((f64) total_searches) / delta); fformat (stdout, "Delete items...\n"); } for (i = 0; i < tm->nitems; i++) { int j; int rv; kv.key = tm->keys[i]; kv.value = (u64) (i + 1); rv = BV (clib_bihash_add_del) (h, &kv, 0 /* is_add */ ); if (rv < 0) clib_warning ("delete key %lld not ok but should be", tm->keys[i]); if (tm->careful_delete_tests) { for (j = 0; j < tm->nitems; j++) { kv.key = tm->keys[j]; rv = BV (clib_bihash_search) (h, &kv, &kv); if (j <= i && rv >= 0) { clib_warning ("i %d j %d search ok but should not be, value %lld", i, j, kv.value); } if (j > i && rv < 0) { clib_warning ("i %d j %d search not ok but should be", i, j); } } } } if ((acycle % tm->report_every_n) == 0) { struct rusage r_usage; getrusage (RUSAGE_SELF, &r_usage); fformat (stdout, "Kernel RSS: %ld bytes\n", r_usage.ru_maxrss); fformat (stdout, "%U\n", BV (format_bihash), h, 0 /* verbose */ ); } /* Clean up side-bet hash table and random key vector */ hash_free (tm->key_hash); vec_reset_length (tm->keys); /* Recreate hash table if we're going to need it again */ if (acycle != (tm->ncycles - 1)) tm->key_hash = hash_create (tm->nitems, sizeof (uword)); } fformat (stdout, "End of run, should be empty...\n"); fformat (stdout, "%U", BV (format_bihash), h, 0 /* very verbose */ ); BV (clib_bihash_free) (h); return 0; } clib_error_t * test_bihash_main (test_main_t * tm) { unformat_input_t *i = tm->input; clib_error_t *error; int which = 0; tm->report_every_n = 1; tm->hash_memory_size = 1ULL << 30; while (unformat_check_input (i) != UNFORMAT_END_OF_INPUT) { if (unformat (i, "seed %u", &tm->seed)) ; else if (unformat (i, "nbuckets %d", &tm->nbuckets)) ; else if (unformat (i, "non-random-keys")) tm->non_random_keys = 1; else if (unformat (i, "nitems %d", &tm->nitems)) ; else if (unformat (i, "ncycles %d", &tm->ncycles)) ; else if (unformat (i, "careful %d", &tm->careful_delete_tests)) ; else if (unformat (i, "verbose %d", &tm->verbose)) ; else if (unformat (i, "search %d", &tm->search_iter)) ; else if (unformat (i, "report-every %d", &tm->report_every_n)) ; else if (unformat (i, "memory-size %U", unformat_memory_size, &tm->hash_memory_size)) ; else if (unformat (i, "vec64")) which = 1; else if (unformat (i, "threads %u", &tm->nthreads)) which = 2; else if (unformat (i, "verbose")) tm->verbose = 1; else if (unformat (i, "stale-overwrite")) which = 3; else return clib_error_return (0, "unknown input '%U'", format_unformat_error, i); } /* Preallocate hash table, key vector */ tm->key_hash = hash_create (tm->nitems, sizeof (uword)); vec_validate (tm->keys, tm->nitems - 1); _vec_len (tm->keys) = 0; switch (which) { case 0: error = test_bihash (tm); break; case 1: error = test_bihash_vec64 (tm); break; case 2: error = test_bihash_threads (tm); break; case 3: error = test_bihash_stale_overwrite (tm); break; default: return clib_error_return (0, "no such test?"); } return error; } #ifdef CLIB_UNIX int main (int argc, char *argv[]) { unformat_input_t i; clib_error_t *error; test_main_t *tm = &test_main; clib_mem_init (0, 4095ULL << 20); tm->global_heap = clib_mem_get_per_cpu_heap (); tm->input = &i; tm->seed = 0xdeaddabe; tm->nbuckets = 2; tm->nitems = 5; tm->ncycles = 1; tm->verbose = 1; tm->search_iter = 1; tm->careful_delete_tests = 0; clib_time_init (&tm->clib_time); unformat_init_command_line (&i, argv); error = test_bihash_main (tm); unformat_free (&i); if (error) { clib_error_report (error); return 1; } return 0; } #endif /* CLIB_UNIX */ /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */