From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from na01-bn1-obe.outbound.protection.outlook.com (mail-bn1on0079.outbound.protection.outlook.com [157.56.110.79]) by dpdk.org (Postfix) with ESMTP id 4C2D12C67 for ; Fri, 11 Mar 2016 04:53:45 +0100 (CET) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=CAVIUMNETWORKS.onmicrosoft.com; s=selector1-caviumnetworks-com; h=From:To:Date:Subject:Message-ID:Content-Type:MIME-Version; bh=sWKIQfmHOfblVadk9KGtgSYk0teF0wHPAZBUxj6qxYU=; b=LughFV+2P79eZuZi8bsXi8xW7WMDtStOh9KBJ7JBLNHn5kTRi2fqgbC82QM227A9wW1E0ojhVWC3NB9RrEOkqxacIRxovVTltWxdInGtFOQTCt/3uo6hKU1ngkBoIZtFswUn4xa1B3HBD2D6ks+5332WmIUF6dAkg+crfwDa0AY= Authentication-Results: dpdk.org; dkim=none (message not signed) header.d=none;dpdk.org; dmarc=none action=none header.from=caviumnetworks.com; Received: from localhost.localdomain (110.170.137.253) by BLUPR0701MB1714.namprd07.prod.outlook.com (10.163.85.140) with Microsoft SMTP Server (TLS) id 15.1.415.20; Fri, 11 Mar 2016 03:53:40 +0000 From: Jerin Jacob To: Date: Fri, 11 Mar 2016 09:22:57 +0530 Message-ID: <1457668379-7316-2-git-send-email-jerin.jacob@caviumnetworks.com> X-Mailer: git-send-email 2.1.0 In-Reply-To: <1457668379-7316-1-git-send-email-jerin.jacob@caviumnetworks.com> References: <1455280123-9311-1-git-send-email-jerin.jacob@caviumnetworks.com> <1457668379-7316-1-git-send-email-jerin.jacob@caviumnetworks.com> MIME-Version: 1.0 Content-Type: text/plain X-Originating-IP: [110.170.137.253] X-ClientProxiedBy: SIXPR04CA0075.apcprd04.prod.outlook.com (10.141.119.33) To BLUPR0701MB1714.namprd07.prod.outlook.com (25.163.85.140) X-Microsoft-Exchange-Diagnostics: 1; BLUPR0701MB1714; 2:f3KAj3ip3PtMuQXumpN9QIk8FBE/uxErVSIMVQlivwXAhN5bulk30RAoSy0UPiG5ushG7AUZ2KlQkKQso+OMoxyiqgSEXQcTzHwp62lYO/SWYA1fuJx17eAhY3PwPRl/tCNFpM2DkyUAuObFogBcDA==; 3:DqW8agoxdQ/UNQBltsD4NhGW6G36IDZD4l0zIAqYv9ehVODTIqqpWv2lsC1KUqh23gIhTW7ZjTGPaJKG1ibV2KHMsqQFu2XWPhRbvSsh1JeqDIUHGdBFw5flua6nW8mE; 25:xYpsSMnYASrNhZAiI272lW3eaLw26mmiVLy4eZhqt6I7tbVYRyFt0nS8VfL/Du9NGp+1/Lat1MYJb3KXsM4ZZ1hVq1KmDyNijhK966urfZKnZiZZc+50jW3qOTJaKHtxXBXM0rq9+prFvD46nb69oSXfQxrljd8u3oZF71LHWZh2/int5fRr/RaCqmG4Xu/cxvMDlD/IwMPMiDnasOJiV1iwnvhs+eRtzEVEQGPfjZMLluLefcPEmfV7Ogv6CqKSRLt4ItFQc0K1L9vKRGS98NVSVA7MHjLSd1qilFlyQaPExdtvtW24x5Bkef+FtLBFdHvrYnLcmn+I5F1kcSLoQA== X-Microsoft-Antispam: UriScan:;BCL:0;PCL:0;RULEID:;SRVR:BLUPR0701MB1714; X-MS-Office365-Filtering-Correlation-Id: 9634fb68-4fff-4609-6ad7-08d34960bdba X-Microsoft-Exchange-Diagnostics: 1; BLUPR0701MB1714; 20:gsdFy/FvxNhrtiLirQVUgiAvHVapRDw2YhlutJlO87BUvdYZigWs3SfuEjybbf2DhbDPKnBChJVETzFq4jFHDHrw0Ys8pLucsICc4TnHjYUws8wK1gqcHVxuszoAop1BJaj4s+ngL9AkYVMPxhwO34BI3jXJo8DHN5oKX8E2+IgCscaKeMX9+5zje1ESYzv2l5VJIOzSyaGvnQghLXaj1fpR1LF3CDmjMXXc8hZowcwLgqERMu5+vXO2I5quH8e+2Ie4jXJ7azOOeT2m01jH2/NK9ThPAV9jZE5XumowT40RoIc2Vo29hpqcB4ucuOR3Qwt3AqUXKX6DgjPHl2iGjZFU7yKJ4aA7x/BlVVZ8FrndGScK6gck7ESjYoIxeCtBzTc4RmKE5GcZqnQ80P6TLYXl0xzXBLYm8+alnCj0qPdol4jS+b8xgKVjbT/AKuP8979P5Udsq8RuuAdH8lmgKUq9soJAQSxZG1PLAWWYa8AhYkHzbqYKu5uVHUfM8K7Cwv+OKuR2Wx1gXObQYFErCAyQhKTIItnUbJK2ndobkqowOuG+aiHZ0zo9u8+/K9ywhLKXcZP0tP2Yw9e6YFEe+wJJzXRVFKHlCC14r8Tk1X4= X-Microsoft-Antispam-PRVS: X-Exchange-Antispam-Report-Test: UriScan:; X-Exchange-Antispam-Report-CFA-Test: BCL:0; PCL:0; RULEID:(601004)(2401047)(5005006)(8121501046)(3002001)(10201501046); SRVR:BLUPR0701MB1714; BCL:0; PCL:0; RULEID:; SRVR:BLUPR0701MB1714; X-Microsoft-Exchange-Diagnostics: 1; BLUPR0701MB1714; 4:t49MfrnncBLx6JOxkpHHRIhKtTsQ9Ok8z+qkGn7jgKzUWwLAxxACtkQUxbkUABudqD9uyTpVzeMeIYB75c/TBLparnHICxECRFwrdjNTfBtzGERsKk9Vz4+CMf5xEyUkPDeuL8hTqZphyQGKu35SiWsKqj5aRO3LYGMkv6PCiBosJnBnPFITbH9sCB8lP1zerREMcUXrZ+u/Px0aV4LrlM2P+b8zrTgCoSkVwwCAXo8ELlKnCjxn7gbcl9s0I/eMtUmb9ybIcsBX2oVpPcZUfuDoa6PCJRel9koWpkc15EfDGmuk1Vclu+g/aP27J8Bihb4TLivmqa14Sqs59UMXkD7aBmy66V2/SzIJKEo3jRj7h7qGi7uoaBBIf7wOnmRJ X-Forefront-PRVS: 087894CD3C X-Forefront-Antispam-Report: SFV:NSPM; SFS:(10009020)(4630300001)(6009001)(6069001)(48376002)(33646002)(5003940100001)(2906002)(47776003)(5008740100001)(4001430100002)(66066001)(189998001)(107886002)(50466002)(229853001)(6116002)(50986999)(2351001)(586003)(77096005)(3846002)(19580395003)(76176999)(36756003)(2950100001)(92566002)(4326007)(19580405001)(110136002)(81166005)(86362001)(50226001)(1096002)(5004730100002)(42186005); DIR:OUT; SFP:1101; SCL:1; SRVR:BLUPR0701MB1714; H:localhost.localdomain; FPR:; SPF:None; MLV:sfv; LANG:en; X-Microsoft-Exchange-Diagnostics: =?us-ascii?Q?1; BLUPR0701MB1714; 23:uhO/m9TKrZhy5TuSkB/kejmbqbu06Wk6BvgX6dd?= =?us-ascii?Q?vAEpLo7CTX5Gsy8d4D0nmVjDXlSFvT0hIlTXrpmPaDLHmPnjA0dJ/BCcetW2?= =?us-ascii?Q?p+SNCDN3kK6fhkeV5y8okI9pxQ450DWe17yrYrEs/pAso0YdsBLnkvk2VYnq?= =?us-ascii?Q?q2PeT3nuvyOz2oixbdJyXutGoA/LGsVt6kycMhemlDvmWzypSQ4Wmvn4Jw6/?= =?us-ascii?Q?s913zVrQVw83whb76V48ou7oL6zv3K0MQ44Zwb+W5Myd9Nc2XYr+WfDZ4PEL?= =?us-ascii?Q?SdNc/0hzlxJllG7efV40i0zXjZlrzzBVsMYUwEgGzuX7X3WHyR0IZwtki1z3?= =?us-ascii?Q?Cn536Ry2f6V9vB1c4/lVVgEgluOvAgpH8O34iIDaSj0xiKBsgvlRt20GwpyL?= =?us-ascii?Q?DbUX5OgKie9LoNvb0gyILn/hWxXHn7+oehKdb7Zgg4k8UVsPwoWPzzT1Iq+e?= =?us-ascii?Q?35F2blwau8sHGe1x9vjBtYK/PC1Hb0j3vNX1b2iswxT4Anz1R8AB2gDfv8aY?= =?us-ascii?Q?KvmIIYTefG8IFFeu2qUCNtLz5fYNktWG1FnnYjX2pVwUzP81Yj51aqtKMOG/?= =?us-ascii?Q?AUZo1EYE+BKUItyW3D/1qvaqTrdMaEhzExBXyGqvZVguCsjSrfbNaUp3KJHs?= =?us-ascii?Q?sPfMOKiREPOKwdEvlG3J+PH4tokhK88UuuoL/UCSAEkaSC7NPtVzIB/8O1ML?= =?us-ascii?Q?x4SzQLIA3Qxd92y/sPqiXQ4zE9CeCbX5Vdj3JPkn559949aZ/oYg52P6kO0m?= =?us-ascii?Q?Btpdpinys+a/6Grp3zvl3YGUlo9OvJmvwPD4ZThankzqu/jmiGN+DwnGcY+d?= =?us-ascii?Q?nJW9QkCh2ewJvdUx1l5eyICIfpW7CEghLjyk6pqVbZSsABn68ZI3LoDeCLt5?= =?us-ascii?Q?tPBRvL7kqGEtO11EAWTH4dglCapTvw4Rq4rRnqYcrYQbU937fCTidHWcBIZI?= =?us-ascii?Q?ozSRBL9c/vBhkF21jAWDrqu5euERBt8b7iLQctSs9Ng=3D=3D?= X-Microsoft-Exchange-Diagnostics: 1; BLUPR0701MB1714; 5:uQa/e28BQk9KEJSR24XRzJ06tP5iCTup45gHqhumjnXDnMIcIT856Qpp8BcxYIq8bn0rrqIgyF0P55sA/17If+J/y/eVagP0dhSWsSlrPsAsET37SlHR1gc9Xuwe6kgc+057sCUvwdPgqgyn43exEA==; 24:wlhiqVWEIF8WjQvBgiyd2Yuab2syhiIhPmY3MKYjtlwNHf3QD9PETWRpqkI1HMSd0wXmUCe5+zvCpcMkcB+S+mWpbBKoMNL+1d3oI53vWWk= SpamDiagnosticOutput: 1:23 SpamDiagnosticMetadata: NSPM X-OriginatorOrg: caviumnetworks.com X-MS-Exchange-CrossTenant-OriginalArrivalTime: 11 Mar 2016 03:53:40.1450 (UTC) X-MS-Exchange-CrossTenant-FromEntityHeader: Hosted X-MS-Exchange-Transport-CrossTenantHeadersStamped: BLUPR0701MB1714 Cc: viktorin@rehivetech.com Subject: [dpdk-dev] [PATCH v5 1/3] lpm: make rte_lpm_lookupx4 API definition architecture agnostic X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: patches and discussions about DPDK List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 11 Mar 2016 03:53:45 -0000 -Used architecture agnostic xmm_t to represent 128 bit SIMD variable -Introduced vect_* API abstraction in app/test to test rte_lpm_lookupx4 API in architecture agnostic way -Moved rte_lpm_lookupx4 SSE implementation to architecture specific rte_lpm_sse.h file to accommodate new rte_lpm_lookupx4 implementation for a different architecture. Signed-off-by: Jerin Jacob Acked-by: Konstantin Ananyev --- MAINTAINERS | 1 + app/test/test_lpm.c | 21 +++--- app/test/test_xmmt_ops.h | 47 ++++++++++++++ lib/librte_lpm/Makefile | 1 + lib/librte_lpm/rte_lpm.h | 99 +--------------------------- lib/librte_lpm/rte_lpm_sse.h | 149 +++++++++++++++++++++++++++++++++++++++++++ 6 files changed, 212 insertions(+), 106 deletions(-) create mode 100644 app/test/test_xmmt_ops.h create mode 100644 lib/librte_lpm/rte_lpm_sse.h diff --git a/MAINTAINERS b/MAINTAINERS index 59e981f..fc03ce8 100644 --- a/MAINTAINERS +++ b/MAINTAINERS @@ -458,6 +458,7 @@ F: lib/librte_lpm/ F: doc/guides/prog_guide/lpm* F: app/test/test_lpm* F: app/test/test_func_reentrancy.c +F: app/test/test_xmmt_ops.h Traffic metering M: Cristian Dumitrescu diff --git a/app/test/test_lpm.c b/app/test/test_lpm.c index aaf95ec..40fbbc6 100644 --- a/app/test/test_lpm.c +++ b/app/test/test_lpm.c @@ -49,6 +49,7 @@ #include "rte_lpm.h" #include "test_lpm_routes.h" +#include "test_xmmt_ops.h" #define TEST_LPM_ASSERT(cond) do { \ if (!(cond)) { \ @@ -345,7 +346,7 @@ test6(void) int32_t test7(void) { - __m128i ipx4; + xmm_t ipx4; uint32_t hop[4]; struct rte_lpm *lpm = NULL; struct rte_lpm_config config; @@ -366,7 +367,7 @@ test7(void) status = rte_lpm_lookup(lpm, ip, &next_hop_return); TEST_LPM_ASSERT((status == 0) && (next_hop_return == next_hop_add)); - ipx4 = _mm_set_epi32(ip, ip + 0x100, ip - 0x100, ip); + ipx4 = vect_set_epi32(ip, ip + 0x100, ip - 0x100, ip); rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX); TEST_LPM_ASSERT(hop[0] == next_hop_add); TEST_LPM_ASSERT(hop[1] == UINT32_MAX); @@ -396,7 +397,7 @@ test7(void) int32_t test8(void) { - __m128i ipx4; + xmm_t ipx4; uint32_t hop[4]; struct rte_lpm *lpm = NULL; struct rte_lpm_config config; @@ -428,7 +429,7 @@ test8(void) TEST_LPM_ASSERT((status == 0) && (next_hop_return == next_hop_add)); - ipx4 = _mm_set_epi32(ip2, ip1, ip2, ip1); + ipx4 = vect_set_epi32(ip2, ip1, ip2, ip1); rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX); TEST_LPM_ASSERT(hop[0] == UINT32_MAX); TEST_LPM_ASSERT(hop[1] == next_hop_add); @@ -455,7 +456,7 @@ test8(void) status = rte_lpm_lookup(lpm, ip1, &next_hop_return); TEST_LPM_ASSERT(status == -ENOENT); - ipx4 = _mm_set_epi32(ip1, ip1, ip2, ip2); + ipx4 = vect_set_epi32(ip1, ip1, ip2, ip2); rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX); if (depth != 1) { TEST_LPM_ASSERT(hop[0] == next_hop_add); @@ -912,7 +913,7 @@ test11(void) int32_t test12(void) { - __m128i ipx4; + xmm_t ipx4; uint32_t hop[4]; struct rte_lpm *lpm = NULL; struct rte_lpm_config config; @@ -939,7 +940,7 @@ test12(void) TEST_LPM_ASSERT((status == 0) && (next_hop_return == next_hop_add)); - ipx4 = _mm_set_epi32(ip, ip + 1, ip, ip - 1); + ipx4 = vect_set_epi32(ip, ip + 1, ip, ip - 1); rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX); TEST_LPM_ASSERT(hop[0] == UINT32_MAX); TEST_LPM_ASSERT(hop[1] == next_hop_add); @@ -1386,10 +1387,10 @@ perf_test(void) begin = rte_rdtsc(); for (j = 0; j < BATCH_SIZE; j += RTE_DIM(next_hops)) { unsigned k; - __m128i ipx4; + xmm_t ipx4; - ipx4 = _mm_loadu_si128((__m128i *)(ip_batch + j)); - ipx4 = *(__m128i *)(ip_batch + j); + ipx4 = vect_loadu_sil128((xmm_t *)(ip_batch + j)); + ipx4 = *(xmm_t *)(ip_batch + j); rte_lpm_lookupx4(lpm, ipx4, next_hops, UINT32_MAX); for (k = 0; k < RTE_DIM(next_hops); k++) if (unlikely(next_hops[k] == UINT32_MAX)) diff --git a/app/test/test_xmmt_ops.h b/app/test/test_xmmt_ops.h new file mode 100644 index 0000000..c055912 --- /dev/null +++ b/app/test/test_xmmt_ops.h @@ -0,0 +1,47 @@ +/*- + * BSD LICENSE + * + * Copyright(c) 2015 Cavium Networks. All rights reserved. + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * + * * Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * * Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in + * the documentation and/or other materials provided with the + * distribution. + * * Neither the name of Cavium Networks nor the names of its + * contributors may be used to endorse or promote products derived + * from this software without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT + * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + +#ifndef _TEST_XMMT_OPS_H_ +#define _TEST_XMMT_OPS_H_ + +#include + +/* vect_* abstraction implementation using SSE */ + +/* loads the xmm_t value from address p(does not need to be 16-byte aligned)*/ +#define vect_loadu_sil128(p) _mm_loadu_si128(p) + +/* sets the 4 signed 32-bit integer values and returns the xmm_t variable */ +#define vect_set_epi32(i3, i2, i1, i0) _mm_set_epi32(i3, i2, i1, i0) + +#endif /* _TEST_XMMT_OPS_H_ */ diff --git a/lib/librte_lpm/Makefile b/lib/librte_lpm/Makefile index 688cfc9..aa51fe4 100644 --- a/lib/librte_lpm/Makefile +++ b/lib/librte_lpm/Makefile @@ -46,6 +46,7 @@ SRCS-$(CONFIG_RTE_LIBRTE_LPM) := rte_lpm.c rte_lpm6.c # install this header file SYMLINK-$(CONFIG_RTE_LIBRTE_LPM)-include := rte_lpm.h rte_lpm6.h +SYMLINK-$(CONFIG_RTE_LIBRTE_LPM)-include += rte_lpm_sse.h # this lib needs eal DEPDIRS-$(CONFIG_RTE_LIBRTE_LPM) += lib/librte_eal diff --git a/lib/librte_lpm/rte_lpm.h b/lib/librte_lpm/rte_lpm.h index c2b429f..cc55439 100644 --- a/lib/librte_lpm/rte_lpm.h +++ b/lib/librte_lpm/rte_lpm.h @@ -475,103 +475,10 @@ rte_lpm_lookup_bulk_func(const struct rte_lpm *lpm, const uint32_t *ips, * if lookup would fail. */ static inline void -rte_lpm_lookupx4(const struct rte_lpm *lpm, __m128i ip, uint32_t hop[4], - uint32_t defv) -{ - __m128i i24; - rte_xmm_t i8; - uint32_t tbl[4]; - uint64_t idx, pt, pt2; - const uint32_t *ptbl; +rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], + uint32_t defv); - const __m128i mask8 = - _mm_set_epi32(UINT8_MAX, UINT8_MAX, UINT8_MAX, UINT8_MAX); - - /* - * RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries - * as one 64-bit value (0x0300000003000000). - */ - const uint64_t mask_xv = - ((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK | - (uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32); - - /* - * RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries - * as one 64-bit value (0x0100000001000000). - */ - const uint64_t mask_v = - ((uint64_t)RTE_LPM_LOOKUP_SUCCESS | - (uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32); - - /* get 4 indexes for tbl24[]. */ - i24 = _mm_srli_epi32(ip, CHAR_BIT); - - /* extract values from tbl24[] */ - idx = _mm_cvtsi128_si64(i24); - i24 = _mm_srli_si128(i24, sizeof(uint64_t)); - - ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx]; - tbl[0] = *ptbl; - ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32]; - tbl[1] = *ptbl; - - idx = _mm_cvtsi128_si64(i24); - - ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx]; - tbl[2] = *ptbl; - ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32]; - tbl[3] = *ptbl; - - /* get 4 indexes for tbl8[]. */ - i8.x = _mm_and_si128(ip, mask8); - - pt = (uint64_t)tbl[0] | - (uint64_t)tbl[1] << 32; - pt2 = (uint64_t)tbl[2] | - (uint64_t)tbl[3] << 32; - - /* search successfully finished for all 4 IP addresses. */ - if (likely((pt & mask_xv) == mask_v) && - likely((pt2 & mask_xv) == mask_v)) { - *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES; - *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES; - return; - } - - if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == - RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { - i8.u32[0] = i8.u32[0] + - (uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; - ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]]; - tbl[0] = *ptbl; - } - if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == - RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { - i8.u32[1] = i8.u32[1] + - (uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; - ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]]; - tbl[1] = *ptbl; - } - if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == - RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { - i8.u32[2] = i8.u32[2] + - (uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; - ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]]; - tbl[2] = *ptbl; - } - if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == - RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { - i8.u32[3] = i8.u32[3] + - (uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; - ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]]; - tbl[3] = *ptbl; - } - - hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv; - hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv; - hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv; - hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv; -} +#include "rte_lpm_sse.h" #ifdef __cplusplus } diff --git a/lib/librte_lpm/rte_lpm_sse.h b/lib/librte_lpm/rte_lpm_sse.h new file mode 100644 index 0000000..da83099 --- /dev/null +++ b/lib/librte_lpm/rte_lpm_sse.h @@ -0,0 +1,149 @@ +/*- + * BSD LICENSE + * + * Copyright(c) 2010-2014 Intel Corporation. All rights reserved. + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * + * * Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * * Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in + * the documentation and/or other materials provided with the + * distribution. + * * Neither the name of Intel Corporation nor the names of its + * contributors may be used to endorse or promote products derived + * from this software without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT + * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + +#ifndef _RTE_LPM_SSE_H_ +#define _RTE_LPM_SSE_H_ + +#include +#include +#include +#include + +#ifdef __cplusplus +extern "C" { +#endif + +static inline void +rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], + uint32_t defv) +{ + __m128i i24; + rte_xmm_t i8; + uint32_t tbl[4]; + uint64_t idx, pt, pt2; + const uint32_t *ptbl; + + const __m128i mask8 = + _mm_set_epi32(UINT8_MAX, UINT8_MAX, UINT8_MAX, UINT8_MAX); + + /* + * RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries + * as one 64-bit value (0x0300000003000000). + */ + const uint64_t mask_xv = + ((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK | + (uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32); + + /* + * RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries + * as one 64-bit value (0x0100000001000000). + */ + const uint64_t mask_v = + ((uint64_t)RTE_LPM_LOOKUP_SUCCESS | + (uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32); + + /* get 4 indexes for tbl24[]. */ + i24 = _mm_srli_epi32(ip, CHAR_BIT); + + /* extract values from tbl24[] */ + idx = _mm_cvtsi128_si64(i24); + i24 = _mm_srli_si128(i24, sizeof(uint64_t)); + + ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx]; + tbl[0] = *ptbl; + ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32]; + tbl[1] = *ptbl; + + idx = _mm_cvtsi128_si64(i24); + + ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx]; + tbl[2] = *ptbl; + ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32]; + tbl[3] = *ptbl; + + /* get 4 indexes for tbl8[]. */ + i8.x = _mm_and_si128(ip, mask8); + + pt = (uint64_t)tbl[0] | + (uint64_t)tbl[1] << 32; + pt2 = (uint64_t)tbl[2] | + (uint64_t)tbl[3] << 32; + + /* search successfully finished for all 4 IP addresses. */ + if (likely((pt & mask_xv) == mask_v) && + likely((pt2 & mask_xv) == mask_v)) { + *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES; + *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES; + return; + } + + if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == + RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { + i8.u32[0] = i8.u32[0] + + (uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; + ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]]; + tbl[0] = *ptbl; + } + if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == + RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { + i8.u32[1] = i8.u32[1] + + (uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; + ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]]; + tbl[1] = *ptbl; + } + if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == + RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { + i8.u32[2] = i8.u32[2] + + (uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; + ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]]; + tbl[2] = *ptbl; + } + if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) == + RTE_LPM_VALID_EXT_ENTRY_BITMASK)) { + i8.u32[3] = i8.u32[3] + + (uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES; + ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]]; + tbl[3] = *ptbl; + } + + hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv; + hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv; + hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv; + hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv; +} + +#ifdef __cplusplus +} +#endif + +#endif /* _RTE_LPM_SSE_H_ */ -- 2.1.0