From patchwork Sat Sep 9 11:21:00 2017 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Shreyansh Jain X-Patchwork-Id: 28534 X-Patchwork-Delegate: ferruh.yigit@amd.com Return-Path: X-Original-To: patchwork@dpdk.org Delivered-To: patchwork@dpdk.org Received: from [92.243.14.124] (localhost [127.0.0.1]) by dpdk.org (Postfix) with ESMTP id A7C331B1B7; Sat, 9 Sep 2017 13:10:56 +0200 (CEST) Received: from NAM01-SN1-obe.outbound.protection.outlook.com (mail-sn1nam01on0043.outbound.protection.outlook.com [104.47.32.43]) by dpdk.org (Postfix) with ESMTP id 930D91B18C for ; Sat, 9 Sep 2017 13:10:52 +0200 (CEST) Received: from BN3PR03CA0098.namprd03.prod.outlook.com (10.174.66.16) by CY4PR03MB3317.namprd03.prod.outlook.com (10.171.246.150) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384_P256) id 15.20.13.10; Sat, 9 Sep 2017 11:10:50 +0000 Received: from BN1BFFO11FD010.protection.gbl (2a01:111:f400:7c10::1:120) by BN3PR03CA0098.outlook.office365.com (2603:10b6:400:4::16) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384_P256) id 15.20.35.12 via Frontend Transport; Sat, 9 Sep 2017 11:10:50 +0000 Authentication-Results: spf=fail (sender IP is 192.88.168.50) smtp.mailfrom=nxp.com; nxp.com; dkim=none (message not signed) header.d=none;nxp.com; dmarc=fail action=none header.from=nxp.com; Received-SPF: Fail (protection.outlook.com: domain of nxp.com does not designate 192.88.168.50 as permitted sender) receiver=protection.outlook.com; client-ip=192.88.168.50; helo=tx30smr01.am.freescale.net; Received: from tx30smr01.am.freescale.net (192.88.168.50) by BN1BFFO11FD010.mail.protection.outlook.com (10.58.144.73) with Microsoft SMTP Server (version=TLS1_0, cipher=TLS_RSA_WITH_AES_256_CBC_SHA) id 15.1.1385.11 via Frontend Transport; Sat, 9 Sep 2017 11:10:50 +0000 Received: from Tophie.ap.freescale.net ([10.232.14.39]) by tx30smr01.am.freescale.net (8.14.3/8.14.0) with ESMTP id v89BAUh9026326; Sat, 9 Sep 2017 04:10:48 -0700 From: Shreyansh Jain To: CC: , Date: Sat, 9 Sep 2017 16:51:00 +0530 Message-ID: <20170909112132.13936-10-shreyansh.jain@nxp.com> X-Mailer: git-send-email 2.9.3 In-Reply-To: <20170909112132.13936-1-shreyansh.jain@nxp.com> References: <20170823141213.25476-1-shreyansh.jain@nxp.com> <20170909112132.13936-1-shreyansh.jain@nxp.com> X-EOPAttributedMessage: 0 X-Matching-Connectors: 131494290505480304; (91ab9b29-cfa4-454e-5278-08d120cd25b8); () X-Forefront-Antispam-Report: CIP:192.88.168.50; IPV:NLI; CTRY:US; EFV:NLI; SFV:NSPM; SFS:(10009020)(6009001)(336005)(39380400002)(39860400002)(2980300002)(1109001)(1110001)(339900001)(189002)(199003)(53936002)(2906002)(8656003)(54906002)(50226002)(85426001)(1076002)(47776003)(68736007)(498600001)(36756003)(97736004)(5003940100001)(356003)(2950100002)(6666003)(33646002)(77096006)(189998001)(105606002)(50466002)(48376002)(8676002)(81156014)(81166006)(305945005)(106466001)(8936002)(6916009)(2351001)(104016004)(86362001)(110136004)(5660300001)(76176999)(50986999)(4326008); DIR:OUT; SFP:1101; SCL:1; SRVR:CY4PR03MB3317; H:tx30smr01.am.freescale.net; FPR:; SPF:Fail; PTR:InfoDomainNonexistent; MX:1; A:1; LANG:en; X-Microsoft-Exchange-Diagnostics: 1; BN1BFFO11FD010; 1:uYqTDVyVb4TqTAMSmaNCj9G3DywT9ZeKfMzTsk9BJMB+/GEgjZ6Nj6ANlO/5IgdPvnnAJMXfpmDEVPCueYENhSQBq3nelBaaDGR+17hJFVqweU/J+EftXc4us60GJgwU MIME-Version: 1.0 X-MS-PublicTrafficType: Email X-MS-Office365-Filtering-Correlation-Id: e03945b9-1542-4d4e-3870-08d4f7736e09 X-Microsoft-Antispam: UriScan:; BCL:0; PCL:0; RULEID:(300000500095)(300135000095)(300000501095)(300135300095)(300000502095)(300135100095)(22001)(300000503095)(300135400095)(2017052603199)(201703131430075)(201703131517081)(300000504095)(300135200095)(300000505095)(300135600095)(300000506095)(300135500095); SRVR:CY4PR03MB3317; X-Microsoft-Exchange-Diagnostics: 1; CY4PR03MB3317; 3:NUfYHaPOKWE70tzCwd7gSHKJ+EgrjkWBzuEqF35wnjjq6hpN83AtFjHNMGZxuT8aIH7IG1hZDqzquvuJRfLA9Qb0WGJjFnEbwal80EYSelfCR56diedYOREeYJOmmK6+JKS71duD03m7WBJ2LljU6AYq/754fuO0YnNHVbZa3Adecba5xIXclD7ZoV7Sb+Zsv6Zs3MwHGhT43+JgpKQSnQoWI7gbpkuaMHXnU5f64p45uCYYlLCJIGuEJKPKFIxie/sKhgLZuekzJBZMsd4drtjALwqaA53R0oJmv13iKuqeUgJ/0WrwKct6NB4PQ+66IRdSumWhNO523gsFnJ5mpXhMa03fA5dd8Q+PyIe+8FI=; 25:O8xGychAO6b5KLuMNAe+JrlL3t5mJ3Dn8SkF1nqm8Pr7Rtx+GuPwPLVz5bLZNxsvQDX45NtwEF6TBS2GfS8x1bQfMV3Sw7OYpWRygGYN8FOyKGCrrk8luaMBY35/djplqrKcczNj3ZZq0fAP8I7F0pqapVHz3lOQu2MF91ICeT+EsWQP+Gtxt13YV0ZacQ+MCBL+WqDwakTg2hEiFZkD1N6rRAamyIubPfszZC1VOM64WWK0Z8GAZX9eXHG8GZR8m2Z9wKNQJo6h/mji3YwrijHRheCYpx3u+fx5t0TXnS1lA105IchOj+cKaSWyoINhOm+/2sGgNN+/jcbWvuqpsw== X-MS-TrafficTypeDiagnostic: CY4PR03MB3317: X-Microsoft-Exchange-Diagnostics: 1; CY4PR03MB3317; 31:Ad/Q+Lq+/bn7Bu8OoytOQ7eZJvZ5DPcrVXpxfLndzbT0CAWzPzB3mYGkw9kpmEu5SZpfus23nY5pP39VOe2SHSVLsQg5bN3AfyCLiUzEIHgG7yhdvEgruU+QSnI9TpRMNYO8knjvXW09jeLLZ7VqM/ldQE3lCQfQY5DP77XUoLMPvJEmQXz+TsxvtG+ipow69dvd1fFJLx0uLFt7/5YnJ8EP70gdu7+l2TEnV2m0GkY=; 4:DmfkDGZKiXaRTuOx7+jEf/WtpZl0Oon7zqUv/sLCRJcZ40lkU6v34u3+Oaa9dKW8QEj7c6xbP3uOW1Y6CKMu+qd0UPq2qntUxEsXAwbqVutWaVQFNr5MfVvc0cIArAuhCqtdAD+cIRE+AZxhqXbAzqD2vhMk/qSXVs/IvADl+zvkifrDQnqVRw2RKWlTNCn0KbBYjTqLcNmpLrEKLtIAg/qABGKt4V+HfQHk7+6d0bbgNYouMs6VdciWCrRd/Dezsi3l4c23N8HG4Au2DdMefXnoY7nQEi0uML1kysOa87k= X-Exchange-Antispam-Report-Test: UriScan:(185117386973197); X-Microsoft-Antispam-PRVS: X-Exchange-Antispam-Report-CFA-Test: BCL:0; PCL:0; RULEID:(100000700101)(100105000095)(100000701101)(100105300095)(100000702101)(100105100095)(6095135)(2401047)(8121501046)(5005006)(3002001)(100000703101)(100105400095)(10201501046)(93006095)(93001095)(6055026)(6096035)(20161123563025)(20161123559100)(20161123565025)(20161123561025)(201703131430075)(201703131433075)(201703131448075)(201703161259150)(201703151042153)(20161123556025)(201708071742011)(100000704101)(100105200095)(100000705101)(100105500095); SRVR:CY4PR03MB3317; BCL:0; PCL:0; RULEID:(100000800101)(100110000095)(100000801101)(100110300095)(100000802101)(100110100095)(100000803101)(100110400095)(400006)(100000804101)(100110200095)(100000805101)(100110500095); SRVR:CY4PR03MB3317; X-Forefront-PRVS: 0425A67DEF X-Microsoft-Exchange-Diagnostics: =?us-ascii?Q?1; CY4PR03MB3317; 23:yKXb5t/HYaKcH0yNPonurMFCyZpAKh2D+pXgpuxza?= HZO/Y1VvNDDVBTzNO94Vkr51jzLLdSCvIhjq6psjDlUblQ2lAAvawPs71u6FVtlksezHZ0rt3Y4oz/GltWkqI2J5UeYKsE4bYv+GbRXEmrmNTRaVsv/eUyjQdtLsI+kp/eoBXTSqJ+yuMCvIQuv6DDclnhwwvZ5bWPBFJyeFyvbgzqLofOOljPsi2HcR1r+bbbA5KwoU03sgLn717H5NBmMjRRJyObE1egOEVkcriK86AGvSTKPMcIu1zb55/ZQ1FVi6bzuaqtZC8XyBJ3TZi0rcbiqe0Yad9ftW+8k1q27hdsZFPdQrClitm67T0lg6BswnpTjpypKWpluoykJep4Hgeh32j1/TiLwYyrtpUCtq1r59QlkOXjYFowwK8NV6819giUD8MxzTaXFhJb0tCB9dxWHRXUWUXup9FZBJptuzJ72xmu8nVEmZ1ZzAnyAHgMuIYa7WPX6t0y7UNxveD4DjQbvKEXf5vts9S7xLUPjG9RZTrUfbZeLziG4bPHNLG5ZESlMSDkUtYQV9BYBLt//P6hZVhB8eAuThnpHR6qUk1KApdyWOvo9KoH9YBmBwzhOxjATbB3yVa7Mnk6MMLMPejbHCtvwYE4ivbw8Gf3+lsH9HCXVxHHwlenPpB0cg1tOmJwTlRtkclnGljwg+PP++pHwXJIVNqicxYAJGXOiqtqQU7qXXTCNhgwNx8caltuIZRUpqR7Hfue2r9Sy26tv6K/8GVj3Ji66xIaqcU2sWqJEiOVDDNE0OSDw2WwgE3xIArXs9FfU2g9bmSprDzRCk+k2rKPFPwvBx0Je7MG1/W4OdcAiNU1HxrqKF0CR64kSoIHCWzD8SZDusxFNL0Vcp1GR54TDtldaP7OUF6yJGi0kiK/eeTjCTMKWRgVul7jW6/p2cF9AGr+dUdBpQxmhxBKsPlavjxbgMA7RGvbHvmMsQNNv9+keYxdBt3SeUcrCwluByoOOVqzWJFqTW4W5kAadtZrZRLmtwy7p2o86pn2JNKtVURXyz1NQnvoHg5vue8pCcSHQ9THPflb2FBhdfusSjphgXnkCMR/GG4/3vbZrMyBOF5YL3RS605y2wS/sY0JsZkQxrHyxtRQHZ43x X-Microsoft-Exchange-Diagnostics: 1; CY4PR03MB3317; 6:fH4xp3KGHiWgPFrS8NHMNU53PFCjZHZBq6JvUAP9z9Aadn+wRx/ChQkR1FeOo541l3X+RGhhfraG/om8cwGANAgJM6SqliRmaIyGK70+ZvNfJ4dsunplJtT5Qn3AaCljX9b9L5GrkjjgmRFyNEzITDJuo9iL511kx+GkJ8v2XOlh5oHkTlXVc3BmgP4UEgmIFqMBNUvbkoYZT3PkGhGLXKxCi1o/1YEiQ7VFsUgfyon1X1APpUMnNBj8/a97tMAqviWlwbOgTh9Vn4UEoQ5cOrL0MsNgGheWBOuFm5MlmDPMaiXd215NqIGj7hV7ftgI9AHqwbvDWAXh1HTJ9Fr1hA==; 5:3zmVF2CJ3cPCbCSr90QdHRX0g4ditSp/wmyYbRLK22EAXqzaAcPLtNtx2eyN1ql5YinN1SwEpjs8z5Pt3tU0Ns2drHDdxt8jpXYWm3uFdFdOm98Vx2xmpMKZ90bBnCU237OGnV0i04a/hNuOLlfQ8Q==; 24:oXb/LO6SWU08kaORjRo8u9bzX+w1nLtBnx1u42RZzmwbrVYQG1g94BGweKsSu3Bod5P3v22MQPcxX5GiDQbDjZSqSS7pOaXnBXpd25LrGTI=; 7:+TgRds4Wiu65FuW+vmN5QtnchQvawbYahvYaelQ4rtdLPC5PtYaF3kkLV26PauFVUGO+pJCrInj8NpUaY/CmhIhaSQJ1JcEwwqVZx2xrYIzzVOFCiP3HLghuztMWcGesB27/SfFeeFvzp7BSkHkyRgyKIOZJu/VHs1D/uk+/Nl3nz/yMi2Ui6PH2ZjZ70Eq1vv3xZQZHx0QFE4GB8+jRqiyhyXWMbEnL8NZYyTykmZo= SpamDiagnosticOutput: 1:99 SpamDiagnosticMetadata: NSPM X-MS-Exchange-CrossTenant-OriginalArrivalTime: 09 Sep 2017 11:10:50.2204 (UTC) X-MS-Exchange-CrossTenant-Id: 5afe0b00-7697-4969-b663-5eab37d5f47e X-MS-Exchange-CrossTenant-OriginalAttributedTenantConnectingIp: TenantId=5afe0b00-7697-4969-b663-5eab37d5f47e; Ip=[192.88.168.50]; Helo=[tx30smr01.am.freescale.net] X-MS-Exchange-CrossTenant-FromEntityHeader: HybridOnPrem X-MS-Exchange-Transport-CrossTenantHeadersStamped: CY4PR03MB3317 Subject: [dpdk-dev] [PATCH v4 09/41] bus/dpaa: add routines for managing a RB tree X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.15 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" QMAN frames are managed over a RB tree data structure. This patch introduces necessary routines for implementing a RB tree. Signed-off-by: Geoff Thorpe Signed-off-by: Hemant Agrawal Signed-off-by: Shreyansh Jain --- drivers/bus/dpaa/include/dpaa_rbtree.h | 143 +++++++++++++++++++++++++++++++++ 1 file changed, 143 insertions(+) create mode 100644 drivers/bus/dpaa/include/dpaa_rbtree.h diff --git a/drivers/bus/dpaa/include/dpaa_rbtree.h b/drivers/bus/dpaa/include/dpaa_rbtree.h new file mode 100644 index 0000000..f8c9b59 --- /dev/null +++ b/drivers/bus/dpaa/include/dpaa_rbtree.h @@ -0,0 +1,143 @@ +/*- + * BSD LICENSE + * + * Copyright 2017 NXP. + * + * 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 NXP 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 __DPAA_RBTREE_H +#define __DPAA_RBTREE_H + +#include +/************/ +/* RB-trees */ +/************/ + +/* Linux has a good RB-tree implementation, that we can't use (GPL). It also has + * a flat/hooked-in interface that virtually requires license-contamination in + * order to write a caller-compatible implementation. Instead, I've created an + * RB-tree encapsulation on top of linux's primitives (it does some of the work + * the client logic would normally do), and this gives us something we can + * reimplement on LWE. Unfortunately there's no good+free RB-tree + * implementations out there that are license-compatible and "flat" (ie. no + * dynamic allocation). I did find a malloc-based one that I could convert, but + * that will be a task for later on. For now, LWE's RB-tree is implemented using + * an ordered linked-list. + * + * Note, the only linux-esque type is "struct rb_node", because it's used + * statically in the exported header, so it can't be opaque. Our version doesn't + * include a "rb_parent_color" field because we're doing linked-list instead of + * a true rb-tree. + */ + +struct rb_node { + struct rb_node *prev, *next; +}; + +struct dpa_rbtree { + struct rb_node *head, *tail; +}; + +#define DPAA_RBTREE { NULL, NULL } +static inline void dpa_rbtree_init(struct dpa_rbtree *tree) +{ + tree->head = tree->tail = NULL; +} + +#define QMAN_NODE2OBJ(ptr, type, node_field) \ + (type *)((char *)ptr - offsetof(type, node_field)) + +#define IMPLEMENT_DPAA_RBTREE(name, type, node_field, val_field) \ +static inline int name##_push(struct dpa_rbtree *tree, type *obj) \ +{ \ + struct rb_node *node = tree->head; \ + if (!node) { \ + tree->head = tree->tail = &obj->node_field; \ + obj->node_field.prev = obj->node_field.next = NULL; \ + return 0; \ + } \ + while (node) { \ + type *item = QMAN_NODE2OBJ(node, type, node_field); \ + if (obj->val_field == item->val_field) \ + return -EBUSY; \ + if (obj->val_field < item->val_field) { \ + if (tree->head == node) \ + tree->head = &obj->node_field; \ + else \ + node->prev->next = &obj->node_field; \ + obj->node_field.prev = node->prev; \ + obj->node_field.next = node; \ + node->prev = &obj->node_field; \ + return 0; \ + } \ + node = node->next; \ + } \ + obj->node_field.prev = tree->tail; \ + obj->node_field.next = NULL; \ + tree->tail->next = &obj->node_field; \ + tree->tail = &obj->node_field; \ + return 0; \ +} \ +static inline void name##_del(struct dpa_rbtree *tree, type *obj) \ +{ \ + if (tree->head == &obj->node_field) { \ + if (tree->tail == &obj->node_field) \ + /* Only item in the list */ \ + tree->head = tree->tail = NULL; \ + else { \ + /* Is the head, next != NULL */ \ + tree->head = tree->head->next; \ + tree->head->prev = NULL; \ + } \ + } else { \ + if (tree->tail == &obj->node_field) { \ + /* Is the tail, prev != NULL */ \ + tree->tail = tree->tail->prev; \ + tree->tail->next = NULL; \ + } else { \ + /* Is neither the head nor the tail */ \ + obj->node_field.prev->next = obj->node_field.next; \ + obj->node_field.next->prev = obj->node_field.prev; \ + } \ + } \ +} \ +static inline type *name##_find(struct dpa_rbtree *tree, u32 val) \ +{ \ + struct rb_node *node = tree->head; \ + while (node) { \ + type *item = QMAN_NODE2OBJ(node, type, node_field); \ + if (val == item->val_field) \ + return item; \ + if (val < item->val_field) \ + return NULL; \ + node = node->next; \ + } \ + return NULL; \ +} + +#endif /* __DPAA_RBTREE_H */