• A
    tipc: Optimization to multicast name lookup algorithm · 968edbe1
    Allan Stephens 提交于
    This patch simplifies and speeds up TIPC's algorithm for identifying
    on-node and off-node destinations that overlap a multicast name
    sequence range.  Rather than traversing the list of all known name
    publications within the cluster, it now traverses the (potentially
    much shorter) list of name publications made by the node itself, and
    determines if any off-node destinations exist by comparing the sizes
    of the two lists.  (Since the node list must be a subset of the
    cluster list, a difference in sizes means that at least one off-node
    destination must exist.)
    Signed-off-by: NAllan Stephens <allan.stephens@windriver.com>
    Signed-off-by: NDavid S. Miller <davem@davemloft.net>
    968edbe1
name_table.c 28.2 KB