From: David S. Miller Date: Mon, 23 Oct 2017 04:23:07 +0000 (+0100) Subject: Merge branch 'mlxsw-Add-support-for-non-equal-cost-multi-path' X-Git-Tag: v4.15-rc1~84^2~354 X-Git-Url: https://repo.jachan.dev/linux.git/commitdiff_plain/fbd15f48e052b3f6bdb21857e8bcaac63bfbb3fd Merge branch 'mlxsw-Add-support-for-non-equal-cost-multi-path' Jiri Pirko says: ==================== mlxsw: Add support for non-equal-cost multi-path Ido says: In the device, nexthops are stored as adjacency entries in an array called the KVD linear (KVDL). When a multi-path route is hit the packet's headers are hashed and then converted to an index into KVDL based on the adjacency group's size and base index. Up until now the driver ignored the `weight` parameter for multi-path routes and allocated only one adjacency entry for each nexthop with a limit of 32 nexthops in a group. This set makes the driver take the `weight` parameter into account when allocating adjacency entries. First patch teaches dpipe to show the size of the adjacency group, so that users will be able to determine the actual weight of each nexthop. The second patch refactors the KVDL allocator, making it more receptive towards the addition of another partition later in the set. Patches 3-5 introduce small changes towards the actual change in the sixth patch that populates the adjacency entries according to their relative weight. Last two patches finally add another partition to the KVDL, which allows us to allocate more than 32 entries per-group and thus support more nexthops and also provide higher accuracy with regards to the requested weights. ==================== Signed-off-by: David S. Miller --- fbd15f48e052b3f6bdb21857e8bcaac63bfbb3fd