aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/net/tipc/topsrv.c
diff options
context:
space:
mode:
authorJon Maloy <jmaloy@redhat.com>2020-11-25 13:29:14 -0500
committerJakub Kicinski <kuba@kernel.org>2020-11-27 17:34:01 -0800
commit5f75e0a0e92a6c6ef93d61fb4d1d2a185cdbc2f9 (patch)
treeac8ba77cffe46b36e41b4c40eb55402209ae559c /net/tipc/topsrv.c
parenttipc: refactor tipc_sk_bind() function (diff)
downloadwireguard-linux-5f75e0a0e92a6c6ef93d61fb4d1d2a185cdbc2f9.tar.xz
wireguard-linux-5f75e0a0e92a6c6ef93d61fb4d1d2a185cdbc2f9.zip
tipc: make node number calculation reproducible
The 32-bit node number, aka node hash or node address, is calculated based on the 128-bit node identity when it is not set explicitly by the user. In future commits we will need to perform this hash operation on peer nodes while feeling safe that we obtain the same result. We do this by interpreting the initial hash as a network byte order number. Whenever we need to use the number locally on a node we must therefore translate it to host byte order to obtain an architecure independent result. Furthermore, given the context where we use this number, we must not allow it to be zero unless the node identity also is zero. Hence, in the rare cases when the xor-ed hash value may end up as zero we replace it with a fix number, knowing that the code anyway is capable of handling hash collisions. Acked-by: Ying Xue <ying.xue@windriver.com> Signed-off-by: Jon Maloy <jmaloy@redhat.com> Signed-off-by: Jakub Kicinski <kuba@kernel.org>
Diffstat (limited to 'net/tipc/topsrv.c')
0 files changed, 0 insertions, 0 deletions