Patch Detail
get:
Show a patch.
patch:
Update a patch.
put:
Update a patch.
GET /api/patches/82376/?format=api
{ "id": 82376, "url": "http://patches.dpdk.org/api/patches/82376/?format=api", "web_url": "http://patches.dpdk.org/project/dpdk/patch/20201027210115.2529025-12-thomas@monjalon.net/", "project": { "id": 1, "url": "http://patches.dpdk.org/api/projects/1/?format=api", "name": "DPDK", "link_name": "dpdk", "list_id": "dev.dpdk.org", "list_email": "dev@dpdk.org", "web_url": "http://core.dpdk.org", "scm_url": "git://dpdk.org/dpdk", "webscm_url": "http://git.dpdk.org/dpdk", "list_archive_url": "https://inbox.dpdk.org/dev", "list_archive_url_format": "https://inbox.dpdk.org/dev/{}", "commit_url_format": "" }, "msgid": "<20201027210115.2529025-12-thomas@monjalon.net>", "list_archive_url": "https://inbox.dpdk.org/dev/20201027210115.2529025-12-thomas@monjalon.net", "date": "2020-10-27T21:01:11", "name": "[v3,11/15] test/graph: switch user data to dynamic mbuf field", "commit_ref": null, "pull_url": null, "state": "superseded", "archived": true, "hash": "5b577b65a14a1c75397f82bd0e68634f9052adee", "submitter": { "id": 685, "url": "http://patches.dpdk.org/api/people/685/?format=api", "name": "Thomas Monjalon", "email": "thomas@monjalon.net" }, "delegate": { "id": 1, "url": "http://patches.dpdk.org/api/users/1/?format=api", "username": "tmonjalo", "first_name": "Thomas", "last_name": "Monjalon", "email": "thomas@monjalon.net" }, "mbox": "http://patches.dpdk.org/project/dpdk/patch/20201027210115.2529025-12-thomas@monjalon.net/mbox/", "series": [ { "id": 13393, "url": "http://patches.dpdk.org/api/series/13393/?format=api", "web_url": "http://patches.dpdk.org/project/dpdk/list/?series=13393", "date": "2020-10-27T21:01:00", "name": "remove mbuf userdata", "version": 3, "mbox": "http://patches.dpdk.org/series/13393/mbox/" } ], "comments": "http://patches.dpdk.org/api/patches/82376/comments/", "check": "success", "checks": "http://patches.dpdk.org/api/patches/82376/checks/", "tags": {}, "related": [], "headers": { "Return-Path": "<dev-bounces@dpdk.org>", "X-Original-To": "patchwork@inbox.dpdk.org", "Delivered-To": "patchwork@inbox.dpdk.org", "Received": [ "from dpdk.org (dpdk.org [92.243.14.124])\n\tby inbox.dpdk.org (Postfix) with ESMTP id CAAF1A04B5;\n\tTue, 27 Oct 2020 22:05:13 +0100 (CET)", "from [92.243.14.124] (localhost [127.0.0.1])\n\tby dpdk.org (Postfix) with ESMTP id C7B0E58E6;\n\tTue, 27 Oct 2020 22:02:16 +0100 (CET)", "from out5-smtp.messagingengine.com (out5-smtp.messagingengine.com\n [66.111.4.29]) by dpdk.org (Postfix) with ESMTP id 14B2F4CA7\n for <dev@dpdk.org>; Tue, 27 Oct 2020 22:02:10 +0100 (CET)", "from compute2.internal (compute2.nyi.internal [10.202.2.42])\n by mailout.nyi.internal (Postfix) with ESMTP id A20135C00D6;\n Tue, 27 Oct 2020 17:02:09 -0400 (EDT)", "from mailfrontend1 ([10.202.2.162])\n by compute2.internal (MEProxy); Tue, 27 Oct 2020 17:02:09 -0400", "from xps.monjalon.net (184.203.134.77.rev.sfr.net [77.134.203.184])\n by mail.messagingengine.com (Postfix) with ESMTPA id 60CFD3280059;\n Tue, 27 Oct 2020 17:02:08 -0400 (EDT)" ], "DKIM-Signature": [ "v=1; a=rsa-sha256; c=relaxed/relaxed; d=monjalon.net; h=\n from:to:cc:subject:date:message-id:in-reply-to:references\n :mime-version:content-transfer-encoding; s=fm2; bh=gCnFlPwlPHUt5\n Qjmew/qeycaqOI5GSF2L7hRxaoB3vc=; b=ZgTw9/ND0qkT0N/NsCO1lbjS5KVIO\n AjYkfIY1DYkUk/1Pym1553WuhTHpElHmImivTsdY0athbdnRpye03Ad5qNo8H0zb\n sdUxPTwuLbr9inryfwpyWpCknQTCmhG/t5LZt8BCl1SGcl6h28h7Oofl9cnkw7st\n 9V0qr3QbKybkkcfWu1WFNJcHmfJu25dO7lG2FojMR/7z4gpnqDzCzJyIIxRvUgB/\n z2AIu5YAl/l5UET594KCEgABpTha8dZMQIH4sX1BTQ6sJf6S44Oe2i2NwU8HeFUv\n 7abZCxIDAVh71JpNGJmAsYof1bPV0YxJJzsofrjzMNAX/UYNZYEV3K1Wg==", "v=1; a=rsa-sha256; c=relaxed/relaxed; d=\n messagingengine.com; h=cc:content-transfer-encoding:date:from\n :in-reply-to:message-id:mime-version:references:subject:to\n :x-me-proxy:x-me-proxy:x-me-sender:x-me-sender:x-sasl-enc; s=\n fm1; bh=gCnFlPwlPHUt5Qjmew/qeycaqOI5GSF2L7hRxaoB3vc=; b=Gn8myYf/\n MO1tuID7i5WBvM2qFVl+g20/CbYy8ECMbetEtIWWkBilnC+glBfeoIzHJc2yPYi+\n TAAVwZUXiWoITl+kOtpwqA69uRGA63y8JGweXyW8B3AjrC2R8jYnKaMPMaBTdiwW\n igOETwG/59XQTxJQKPCvg+CLV5b9M5/mXSXFWUZjrStwNcwpa/PvpFdqGzNRqv3h\n ikqhxtETlvXRndIJdEw0vJCJwZpifIpIGA9xeWElo5LGGrH/+f8YGp1q1AkF32IT\n MnhcXY3bj/rQEt6yFFJtnrCLRU/RIRFF3KrYUJixaV96efwmj7QwCETN1+31W5Q+\n /mA4iEmgJbMuOQ==" ], "X-ME-Sender": "<xms:0YqYX1LSKYyaV4cddEKnKxP2qvpbFt7LiTGLBStScJwoceQViE0CnQ>\n <xme:0YqYXxJVUohSDWGT7teJNM9zkWO9_Y8ysVgOTd2mHMh9Wk4UX7OAQwXZ9myZGTtqT\n D5EKdH-NBUmkabCBA>", "X-ME-Proxy-Cause": "\n gggruggvucftvghtrhhoucdtuddrgedujedrkeelgddugeegucetufdoteggodetrfdotf\n fvucfrrhhofhhilhgvmecuhfgrshhtofgrihhlpdfqfgfvpdfurfetoffkrfgpnffqhgen\n uceurghilhhouhhtmecufedttdenucesvcftvggtihhpihgvnhhtshculddquddttddmne\n cujfgurhephffvufffkffojghfggfgsedtkeertdertddtnecuhfhrohhmpefvhhhomhgr\n shcuofhonhhjrghlohhnuceothhhohhmrghssehmohhnjhgrlhhonhdrnhgvtheqnecugg\n ftrfgrthhtvghrnhepvdehgfeivdejgedtveehfefhteelfefgieevgfffveefjeegtdfg\n uedthedtgeevnecukfhppeejjedrudefgedrvddtfedrudekgeenucevlhhushhtvghruf\n hiiigvpeejnecurfgrrhgrmhepmhgrihhlfhhrohhmpehthhhomhgrshesmhhonhhjrghl\n ohhnrdhnvght", "X-ME-Proxy": "<xmx:0YqYX9u8dAM5qrSTSufJ7z7kUS98lApQNWm41xUZIO4JR2i41Kc-yA>\n <xmx:0YqYX2aXKKN3a-u2DnoBQl1ApgD5pXdnq2e3SOm6flYgUuzw2FbsJw>\n <xmx:0YqYX8bemTLt-HLIKSQrMlQL3MNrTqYJl1onPP87faKL5GTn8BogYQ>\n <xmx:0YqYX85HI4DfD9_PwUVyS2e3wtkUR_hsDVD9OdiwPkNA8YNPrJ-e9g>", "From": "Thomas Monjalon <thomas@monjalon.net>", "To": "dev@dpdk.org", "Cc": "ferruh.yigit@intel.com, david.marchand@redhat.com,\n bruce.richardson@intel.com, olivier.matz@6wind.com,\n andrew.rybchenko@oktetlabs.ru, akhil.goyal@nxp.com,\n Jerin Jacob <jerinj@marvell.com>, Kiran Kumar K <kirankumark@marvell.com>,\n Nithin Dabilpuram <ndabilpuram@marvell.com>", "Date": "Tue, 27 Oct 2020 22:01:11 +0100", "Message-Id": "<20201027210115.2529025-12-thomas@monjalon.net>", "X-Mailer": "git-send-email 2.28.0", "In-Reply-To": "<20201027210115.2529025-1-thomas@monjalon.net>", "References": "<20201026052105.1561859-1-thomas@monjalon.net>\n <20201027210115.2529025-1-thomas@monjalon.net>", "MIME-Version": "1.0", "Content-Transfer-Encoding": "8bit", "Subject": "[dpdk-dev] [PATCH v3 11/15] test/graph: switch user data to dynamic\n\tmbuf field", "X-BeenThere": "dev@dpdk.org", "X-Mailman-Version": "2.1.15", "Precedence": "list", "List-Id": "DPDK patches and discussions <dev.dpdk.org>", "List-Unsubscribe": "<https://mails.dpdk.org/options/dev>,\n <mailto:dev-request@dpdk.org?subject=unsubscribe>", "List-Archive": "<http://mails.dpdk.org/archives/dev/>", "List-Post": "<mailto:dev@dpdk.org>", "List-Help": "<mailto:dev-request@dpdk.org?subject=help>", "List-Subscribe": "<https://mails.dpdk.org/listinfo/dev>,\n <mailto:dev-request@dpdk.org?subject=subscribe>", "Errors-To": "dev-bounces@dpdk.org", "Sender": "\"dev\" <dev-bounces@dpdk.org>" }, "content": "The test used the deprecated mbuf field udata64.\nIt is moved to a dynamic field in order to allow removal of udata64.\n\nSigned-off-by: Thomas Monjalon <thomas@monjalon.net>\n---\n app/test/test_graph.c | 94 ++++++++++++++++++++++++++-----------------\n 1 file changed, 56 insertions(+), 38 deletions(-)", "diff": "diff --git a/app/test/test_graph.c b/app/test/test_graph.c\nindex ed69eda997..164486911f 100644\n--- a/app/test/test_graph.c\n+++ b/app/test/test_graph.c\n@@ -12,6 +12,7 @@\n #include <rte_graph.h>\n #include <rte_graph_worker.h>\n #include <rte_mbuf.h>\n+#include <rte_mbuf_dyn.h>\n #include <rte_random.h>\n \n #include \"test.h\"\n@@ -39,6 +40,11 @@ static uint16_t test_node3_worker(struct rte_graph *graph,\n #define MBUFF_SIZE 512\n #define MAX_NODES 4\n \n+typedef uint64_t graph_dynfield_t;\n+static int graph_dynfield_offset = -1;\n+#define GRAPH_FIELD(mbuf) (*RTE_MBUF_DYNFIELD(mbuf, \\\n+\t\tgraph_dynfield_offset, graph_dynfield_t *))\n+\n static struct rte_mbuf mbuf[MAX_NODES + 1][MBUFF_SIZE];\n static void *mbuf_p[MAX_NODES + 1][MBUFF_SIZE];\n static rte_graph_t graph_id;\n@@ -162,9 +168,9 @@ test_node_worker_source(struct rte_graph *graph, struct rte_node *node,\n \tnext_stream = rte_node_next_stream_get(graph, node, next, obj_node0);\n \tfor (i = 0; i < obj_node0; i++) {\n \t\tdata = &mbuf[0][i];\n-\t\tdata->udata64 = ((uint64_t)tm->test_node[0].idx << 32) | i;\n+\t\tGRAPH_FIELD(data) = ((uint64_t)tm->test_node[0].idx << 32) | i;\n \t\tif ((i + 1) == obj_node0)\n-\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\tnext_stream[i] = &mbuf[0][i];\n \t}\n \trte_node_next_stream_put(graph, node, next, obj_node0);\n@@ -175,9 +181,9 @@ test_node_worker_source(struct rte_graph *graph, struct rte_node *node,\n \tnext_stream = rte_node_next_stream_get(graph, node, next, obj_node1);\n \tfor (i = 0; i < obj_node1; i++) {\n \t\tdata = &mbuf[0][obj_node0 + i];\n-\t\tdata->udata64 = ((uint64_t)tm->test_node[1].idx << 32) | i;\n+\t\tGRAPH_FIELD(data) = ((uint64_t)tm->test_node[1].idx << 32) | i;\n \t\tif ((i + 1) == obj_node1)\n-\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\tnext_stream[i] = &mbuf[0][obj_node0 + i];\n \t}\n \n@@ -205,23 +211,23 @@ test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \n \t\tfor (i = 0; i < nb_objs; i++) {\n \t\t\tdata = (struct rte_mbuf *)objs[i];\n-\t\t\tif ((data->udata64 >> 32) != tm->test_node[0].idx) {\n+\t\t\tif ((GRAPH_FIELD(data) >> 32) != tm->test_node[0].idx) {\n \t\t\t\tprintf(\"Data idx miss match at node 0, expected\"\n \t\t\t\t \" = %u got = %u\\n\",\n \t\t\t\t tm->test_node[0].idx,\n-\t\t\t\t (uint32_t)(data->udata64 >> 32));\n+\t\t\t\t (uint32_t)(GRAPH_FIELD(data) >> 32));\n \t\t\t\tgoto end;\n \t\t\t}\n \n-\t\t\tif ((data->udata64 & 0xffff) != (i - count)) {\n+\t\t\tif ((GRAPH_FIELD(data) & 0xffff) != (i - count)) {\n \t\t\t\tprintf(\"Expected buff count miss match at \"\n \t\t\t\t \"node 0\\n\");\n \t\t\t\tgoto end;\n \t\t\t}\n \n-\t\t\tif (data->udata64 & (0x1 << 16))\n+\t\t\tif (GRAPH_FIELD(data) & (0x1 << 16))\n \t\t\t\tcount = i + 1;\n-\t\t\tif (data->udata64 & (0x1 << 17))\n+\t\t\tif (GRAPH_FIELD(data) & (0x1 << 17))\n \t\t\t\tsecond_pass = 1;\n \t\t}\n \n@@ -233,12 +239,12 @@ test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \t\tobj_node0 = nb_objs * obj_node0 * 0.01;\n \t\tfor (i = 0; i < obj_node0; i++) {\n \t\t\tdata = &mbuf[1][i];\n-\t\t\tdata->udata64 =\n+\t\t\tGRAPH_FIELD(data) =\n \t\t\t\t((uint64_t)tm->test_node[1].idx << 32) | i;\n \t\t\tif ((i + 1) == obj_node0)\n-\t\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\t\tif (second_pass)\n-\t\t\t\tdata->udata64 |= (1 << 17);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 17);\n \t\t}\n \t\trte_node_enqueue(graph, node, 0, (void **)&mbuf_p[1][0],\n \t\t\t\t obj_node0);\n@@ -246,12 +252,12 @@ test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \t\tobj_node1 = nb_objs - obj_node0;\n \t\tfor (i = 0; i < obj_node1; i++) {\n \t\t\tdata = &mbuf[1][obj_node0 + i];\n-\t\t\tdata->udata64 =\n+\t\t\tGRAPH_FIELD(data) =\n \t\t\t\t((uint64_t)tm->test_node[2].idx << 32) | i;\n \t\t\tif ((i + 1) == obj_node1)\n-\t\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\t\tif (second_pass)\n-\t\t\t\tdata->udata64 |= (1 << 17);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 17);\n \t\t}\n \t\trte_node_enqueue(graph, node, 1, (void **)&mbuf_p[1][obj_node0],\n \t\t\t\t obj_node1);\n@@ -285,22 +291,22 @@ test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \tfn_calls[2] += 1;\n \tfor (i = 0; i < nb_objs; i++) {\n \t\tdata = (struct rte_mbuf *)objs[i];\n-\t\tif ((data->udata64 >> 32) != tm->test_node[1].idx) {\n+\t\tif ((GRAPH_FIELD(data) >> 32) != tm->test_node[1].idx) {\n \t\t\tprintf(\"Data idx miss match at node 1, expected = %u\"\n \t\t\t \" got = %u\\n\",\n \t\t\t tm->test_node[1].idx,\n-\t\t\t (uint32_t)(data->udata64 >> 32));\n+\t\t\t (uint32_t)(GRAPH_FIELD(data) >> 32));\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif ((data->udata64 & 0xffff) != (i - count)) {\n+\t\tif ((GRAPH_FIELD(data) & 0xffff) != (i - count)) {\n \t\t\tprintf(\"Expected buff count miss match at node 1\\n\");\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif (data->udata64 & (0x1 << 16))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 16))\n \t\t\tcount = i + 1;\n-\t\tif (data->udata64 & (0x1 << 17))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 17))\n \t\t\tsecond_pass = 1;\n \t}\n \n@@ -312,11 +318,11 @@ test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \tobj_node0 = nb_objs;\n \tfor (i = 0; i < obj_node0; i++) {\n \t\tdata = &mbuf[2][i];\n-\t\tdata->udata64 = ((uint64_t)tm->test_node[2].idx << 32) | i;\n+\t\tGRAPH_FIELD(data) = ((uint64_t)tm->test_node[2].idx << 32) | i;\n \t\tif ((i + 1) == obj_node0)\n-\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\tif (second_pass)\n-\t\t\tdata->udata64 |= (1 << 17);\n+\t\t\tGRAPH_FIELD(data) |= (1 << 17);\n \t}\n \trte_node_enqueue(graph, node, 0, (void **)&mbuf_p[2][0], obj_node0);\n \n@@ -339,22 +345,22 @@ test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \tfn_calls[3] += 1;\n \tfor (i = 0; i < nb_objs; i++) {\n \t\tdata = (struct rte_mbuf *)objs[i];\n-\t\tif ((data->udata64 >> 32) != tm->test_node[2].idx) {\n+\t\tif ((GRAPH_FIELD(data) >> 32) != tm->test_node[2].idx) {\n \t\t\tprintf(\"Data idx miss match at node 2, expected = %u\"\n \t\t\t \" got = %u\\n\",\n \t\t\t tm->test_node[2].idx,\n-\t\t\t (uint32_t)(data->udata64 >> 32));\n+\t\t\t (uint32_t)(GRAPH_FIELD(data) >> 32));\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif ((data->udata64 & 0xffff) != (i - count)) {\n+\t\tif ((GRAPH_FIELD(data) & 0xffff) != (i - count)) {\n \t\t\tprintf(\"Expected buff count miss match at node 2\\n\");\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif (data->udata64 & (0x1 << 16))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 16))\n \t\t\tcount = i + 1;\n-\t\tif (data->udata64 & (0x1 << 17))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 17))\n \t\t\tsecond_pass = 1;\n \t}\n \n@@ -367,10 +373,10 @@ test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \t\tobj_node0 = nb_objs;\n \t\tfor (i = 0; i < obj_node0; i++) {\n \t\t\tdata = &mbuf[3][i];\n-\t\t\tdata->udata64 =\n+\t\t\tGRAPH_FIELD(data) =\n \t\t\t\t((uint64_t)tm->test_node[3].idx << 32) | i;\n \t\t\tif ((i + 1) == obj_node0)\n-\t\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\t}\n \t\trte_node_enqueue(graph, node, 0, (void **)&mbuf_p[3][0],\n \t\t\t\t obj_node0);\n@@ -395,22 +401,22 @@ test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \tfn_calls[4] += 1;\n \tfor (i = 0; i < nb_objs; i++) {\n \t\tdata = (struct rte_mbuf *)objs[i];\n-\t\tif ((data->udata64 >> 32) != tm->test_node[3].idx) {\n+\t\tif ((GRAPH_FIELD(data) >> 32) != tm->test_node[3].idx) {\n \t\t\tprintf(\"Data idx miss match at node 3, expected = %u\"\n \t\t\t \" got = %u\\n\",\n \t\t\t tm->test_node[3].idx,\n-\t\t\t (uint32_t)(data->udata64 >> 32));\n+\t\t\t (uint32_t)(GRAPH_FIELD(data) >> 32));\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif ((data->udata64 & 0xffff) != (i - count)) {\n+\t\tif ((GRAPH_FIELD(data) & 0xffff) != (i - count)) {\n \t\t\tprintf(\"Expected buff count miss match at node 3\\n\");\n \t\t\tgoto end;\n \t\t}\n \n-\t\tif (data->udata64 & (0x1 << 16))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 16))\n \t\t\tcount = i + 1;\n-\t\tif (data->udata64 & (0x1 << 17))\n+\t\tif (GRAPH_FIELD(data) & (0x1 << 17))\n \t\t\tsecond_pass = 1;\n \t}\n \n@@ -426,11 +432,11 @@ test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs,\n \t\tobj_node0 = nb_objs * 2;\n \t\tfor (i = 0; i < obj_node0; i++) {\n \t\t\tdata = &mbuf[4][i];\n-\t\t\tdata->udata64 =\n+\t\t\tGRAPH_FIELD(data) =\n \t\t\t\t((uint64_t)tm->test_node[0].idx << 32) | i;\n-\t\t\tdata->udata64 |= (1 << 17);\n+\t\t\tGRAPH_FIELD(data) |= (1 << 17);\n \t\t\tif ((i + 1) == obj_node0)\n-\t\t\t\tdata->udata64 |= (1 << 16);\n+\t\t\t\tGRAPH_FIELD(data) |= (1 << 16);\n \t\t}\n \t\trte_node_enqueue(graph, node, 0, (void **)&mbuf_p[4][0],\n \t\t\t\t obj_node0);\n@@ -765,6 +771,18 @@ graph_setup(void)\n {\n \tint i, j;\n \n+\tstatic const struct rte_mbuf_dynfield graph_dynfield_desc = {\n+\t\t.name = \"test_graph_dynfield\",\n+\t\t.size = sizeof(graph_dynfield_t),\n+\t\t.align = __alignof__(graph_dynfield_t),\n+\t};\n+\tgraph_dynfield_offset =\n+\t\trte_mbuf_dynfield_register(&graph_dynfield_desc);\n+\tif (graph_dynfield_offset < 0) {\n+\t\tprintf(\"Cannot register mbuf field\\n\");\n+\t\treturn TEST_FAILED;\n+\t}\n+\n \tfor (i = 0; i <= MAX_NODES; i++) {\n \t\tfor (j = 0; j < MBUFF_SIZE; j++)\n \t\t\tmbuf_p[i][j] = &mbuf[i][j];\n", "prefixes": [ "v3", "11/15" ] }