From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mails.dpdk.org (mails.dpdk.org [217.70.189.124]) by inbox.dpdk.org (Postfix) with ESMTP id 5C1A2A054F; Tue, 16 Mar 2021 19:24:50 +0100 (CET) Received: from [217.70.189.124] (localhost [127.0.0.1]) by mails.dpdk.org (Postfix) with ESMTP id EF5D540A4B; Tue, 16 Mar 2021 19:24:49 +0100 (CET) Received: from mga07.intel.com (mga07.intel.com [134.134.136.100]) by mails.dpdk.org (Postfix) with ESMTP id 938624069F for ; Tue, 16 Mar 2021 19:24:48 +0100 (CET) IronPort-SDR: kwIhxaJOv+scoZqkPDGt2RN9KsWTXLBbDe85cpuw7Dx48Y9i1OtmwDZ6W6hsB7p9PK7IWgO8KZ xSY2tFcw9FHw== X-IronPort-AV: E=McAfee;i="6000,8403,9925"; a="253329728" X-IronPort-AV: E=Sophos;i="5.81,254,1610438400"; d="scan'208";a="253329728" Received: from orsmga007.jf.intel.com ([10.7.209.58]) by orsmga105.jf.intel.com with ESMTP/TLS/ECDHE-RSA-AES256-GCM-SHA384; 16 Mar 2021 11:24:47 -0700 IronPort-SDR: nMjoosmh2EWXAHUzQWVtH4CH+ErgvR6bTwQJd9Brg1XHDWqla2VfBFtR0gLK/ub81SxS+cOyan Csfgzz4cGwyw== X-ExtLoop1: 1 X-IronPort-AV: E=Sophos;i="5.81,254,1610438400"; d="scan'208";a="411155895" Received: from silpixa00400072.ir.intel.com ([10.237.222.213]) by orsmga007.jf.intel.com with ESMTP; 16 Mar 2021 11:24:45 -0700 From: Vladimir Medvedkin To: dev@dpdk.org Cc: konstantin.ananyev@intel.com, andrey.chilikin@intel.com, ray.kinsella@intel.com, yipeng1.wang@intel.com, sameh.gobriel@intel.com, bruce.richardson@intel.com Date: Tue, 16 Mar 2021 18:24:34 +0000 Message-Id: <1615919077-77774-1-git-send-email-vladimir.medvedkin@intel.com> X-Mailer: git-send-email 2.7.4 Subject: [dpdk-dev] [PATCH v1 0/3] Predictable RSS feature X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: DPDK patches and discussions List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: dev-bounces@dpdk.org Sender: "dev" This patch series introduces predictable RSS feature. It is based on the idea of searching for partial hash collisions within Toeplitz hash. The Toeplitz hash function is a homomorphism between (G, ^) and (H, ^), where (G, ^) - is a group of tuples and (H, ^) is a group of hashes with respect to XOR operation. So tuples and hashes could be treated as n-dimension and 32-dimension vector spaces over GF(2). So, f(x ^ y) == f(x) ^ f(y) where f - is the toeplitz hash function and x, y are tuples. The ability to predict partial collisions allows user to compute input hash value with desired LSB values. Usually number of LSB's are defined by the size of RSS Redirection Table. There could be number of use cases, for example: 1) NAT. Using this library it is possible to select a new port number on a translation in the way that rss hash for original tuple will have the same LSB's as rss hash for reverse tuple. 2) IPSec/MPLS/Vxlan. It is possible to choose tunnel id to be pinned to a desired queue. 3) TCP stack. It is possible to choose a source port number for outgoing connections in the way that received replies will be assigned to desired queue. 4) RSS hash key generation. Hash key initialization with random values does not guarantee an uniform distribution amongst queues. This library uses mathematically proved algorithm to complete the rss hash key to provide the best distribution. Vladimir Medvedkin (3): hash: add predictable RSS API hash: add predictable RSS implementation test/hash: add additional thash tests app/test/test_thash.c | 383 +++++++++++++++++++++++++++- lib/librte_hash/meson.build | 3 +- lib/librte_hash/rte_thash.c | 596 ++++++++++++++++++++++++++++++++++++++++++++ lib/librte_hash/rte_thash.h | 138 ++++++++++ lib/librte_hash/version.map | 7 + 5 files changed, 1120 insertions(+), 7 deletions(-) create mode 100644 lib/librte_hash/rte_thash.c -- 2.7.4