summaryrefslogtreecommitdiffstats
path: root/src/vnet/vnet_all_api_h.h
AgeCommit message (Expand)AuthorFilesLines
2019-09-25api: split api generated filesOle Troan1-1/+0
2019-09-16api: autogenerate api trace print/endianOle Troan1-0/+4
2019-08-22dns: make the dns name resolver a pluginDave Barach1-1/+0
2019-07-05sctp: move to plugins, disabled by defaultFlorin Coras1-1/+0
2019-06-18ipsec: ipsec-tun protectNeale Ranns1-1/+0
2019-01-25deprecate tapcliDamjan Marion1-1/+0
2019-01-21virtio: Native virtio driverMohsin Kazmi1-0/+1
2018-11-22Add RFC5424 syslog protocol support (VPP-1139)Matus Fabian1-0/+1
2018-09-10vxlan-gbp: Add support for vxlan gbpMohsin Kazmi1-0/+1
2018-07-07PipesNeale Ranns1-0/+1
2018-06-25MAP: Move MAP-E/T to a plugin.Ole Troan1-1/+0
2018-06-21Implement DHCPv6 IA NA client (VPP-1094)Juraj Sloboda1-0/+1
2018-06-08Implement DHCPv6 PD client (VPP-718, VPP-1050)Juraj Sloboda1-0/+1
2018-05-04Flow: Rename IPFIX exporter.Ole Troan1-1/+1
2018-03-21bond: Add bonding driver and LACP protocolSteven1-0/+1
2018-03-16QoS recording and markingNeale Ranns1-0/+1
2018-03-16IPv6 ND Router discovery control plane (VPP-1095)Juraj Sloboda1-0/+1
2018-03-14IPIP: Add IP{v4,v6} over IP{v4,v6} configured tunnel support.Ole Troan1-0/+1
2018-03-01SCTP: API to add a sub-connectionMarco Varlese1-0/+1
2017-12-18SR-MPLS: binary API and automated steeringPablo Camarillo1-18/+17
2017-12-04tap_v2: move code to vnet/devices/tapDamjan Marion1-1/+1
2017-11-30virtio: fast TAP interfaces with vhost-net backendDamjan Marion1-0/+1
2017-11-10Break up vpe.apiNeale Ranns1-0/+3
2017-11-09BIERNeale Ranns1-0/+1
2017-11-07UDP Encapsulation.Neale Ranns1-0/+1
2017-10-13VPP-1027: DNS name resolverDave Barach1-0/+1
2017-10-06Initial GENEVE TUNNEL implementation and tests.Marco Varlese1-0/+1
2017-08-17TCP source address automationDave Barach1-0/+1
2017-07-05Add API support for LLDP config/interface setSteve Shin1-0/+1
2017-06-08P2P Ethernet - APIPavel Kotucek1-0/+1
2017-05-05First commit SR MPLSPablo Camarillo1-1/+1
2017-03-01dpdk: be a pluginDamjan Marion1-3/+0
2017-03-01VPP-598: tcp stack initial commitDave Barach1-0/+1
2017-02-21Add Overlay Network Engine APIFilip Tehlar1-0/+1
2017-01-27API refactoring : policerPavel Kotucek1-0/+1
2017-01-27API refactoring : copPavel Kotucek1-0/+1
2017-01-26API refactoring : dhcpPavel Kotucek1-0/+1
2017-01-25API refactoring : flowPavel Kotucek1-0/+1
2017-01-25API refactoring : classifyPavel Kotucek1-0/+1
2017-01-10API refactoring : l2, mpls, srPavel Kotucek1-0/+2
2017-01-10API refactoring : dpdkPavel Kotucek1-0/+3
2016-12-28Reorganize source tree to use single autotools instanceDamjan Marion1-0/+57
span>); } hash_set_mem (tm->key_hash, random_vec8, i + 1); vec_add1 (tm->keys, random_vec8); } fformat (stdout, "Add items...\n"); for (i = 0; i < tm->nitems; i++) { kv.key = (u64) 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 */ ); } } 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 = (u64) 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)); } } 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_mem (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; 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 = (u64) 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 = (u64) 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); } } } } fformat (stdout, "After deletions, should be empty...\n"); fformat (stdout, "%U", BV (format_bihash), h, 0 /* very verbose */ ); 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; 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, "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, "vec64")) which = 1; else if (unformat (i, "cache")) which = 2; else if (unformat (i, "verbose")) tm->verbose = 1; else return clib_error_return (0, "unknown input '%U'", format_unformat_error, i); } switch (which) { case 0: error = test_bihash (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, 3ULL << 30); tm->input = &i; tm->seed = 0xdeaddabe; tm->nbuckets = 2; tm->nitems = 5; tm->verbose = 1; tm->search_iter = 1; tm->careful_delete_tests = 0; tm->key_hash = hash_create_string (0, sizeof (uword)); 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: */