summaryrefslogtreecommitdiffstats
path: root/src/vnet/bonding/node.c
AgeCommit message (Expand)AuthorFilesLines
2020-07-28bonding lacp: replace slave string with memberSteven Luong1-44/+48
2020-02-18misc: fix coverity warningsDave Barach1-2/+2
2020-01-09bonding: process lacp when bond is admin downMatthew Smith1-1/+0
2019-12-17bonding: drop traffic on backup interface for active-backup modeSteven Luong1-1/+12
2019-10-16bonding: graph node running after bond-input in feature arc may crashSteven Luong1-3/+35
2019-08-17bonding lacp: deleting virtual interface which was enslaved may cause crashSteven Luong1-20/+13
2019-07-25bonding: incorrect RX counters for bond interfaceSteven Luong1-39/+36
2019-02-14Add -fno-common compile optionBenoît Ganne1-0/+2
2019-01-23bond: packet drops on VPP bond interface [VPP-1544]Steven1-17/+16
2018-11-18add vlib_prefetch_buffer_data(...) macroDamjan Marion1-8/+4
2018-11-14Remove c-11 memcpy checks from perf-critical codeDave Barach1-2/+2
2018-08-13Multiarch handling in different constructor macrosDamjan Marion1-5/+0
2018-07-19Remove unused argument to vlib_feature_nextDamjan Marion1-1/+1
2018-07-11avoid using thread local storage for thread indexDamjan Marion1-2/+2
2018-06-05bond: send gratuitous arp when the active slave went down in active-backup modeSteven1-3/+1
2018-05-30bonding: fix packet trace in bond-inputDamjan Marion1-5/+1
2018-05-29Add VLIB_NODE_FN() macro to simplify multiversioning of node functionsDamjan Marion1-21/+5
2018-05-27bond-input performance optimizationDamjan Marion1-291/+261
2018-05-25bond: performance harvestingSteven1-13/+15
2018-04-24lacp: deleting the bond subinterface may cause lacp to lose the partner [VPP-...Steven1-2/+1
2018-03-30bond: show trace causes a crash if the interface is deletedSteven1-6/+16
2018-03-21bond: Add bonding driver and LACP protocolSteven1-0/+509
n">n; i++) { row = 0; vec_validate (row, n - 1); rv[i] = row; } return rv; } __clib_export void clib_ptclosure_free (u8 ** ptc) { u8 *row; int n = vec_len (ptc); int i; ASSERT (n > 0); for (i = 0; i < n; i++) { row = ptc[i]; vec_free (row); } vec_free (ptc); } void clib_ptclosure_copy (u8 ** dst, u8 ** src) { int i, n; u8 *src_row, *dst_row; n = vec_len (dst); for (i = 0; i < vec_len (dst); i++) { src_row = src[i]; dst_row = dst[i]; clib_memcpy (dst_row, src_row, n); } } /* * compute the positive transitive closure * of a relation via Warshall's algorithm. * * Ref: * Warshall, Stephen (January 1962). "A theorem on Boolean matrices". * Journal of the ACM 9 (1): 11–12. * * foo[i][j] = 1 means that item i * "bears the relation" to item j. * * For example: "item i must be before item j" * * You could use a bitmap, but since the algorithm is * O(n**3) in the first place, large N is inadvisable... * */ __clib_export u8 ** clib_ptclosure (u8 ** orig) { int i, j, k; int n; u8 **prev, **cur; n = vec_len (orig); prev = clib_ptclosure_alloc (n); cur = clib_ptclosure_alloc (n); clib_ptclosure_copy (prev, orig); for (k = 0; k < n; k++) { for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { cur[i][j] = prev[i][j] || (prev[i][k] && prev[k][j]); } } clib_ptclosure_copy (prev, cur); } clib_ptclosure_free (prev); return cur; } /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */