Patch Detail
get:
Show a patch.
patch:
Update a patch.
put:
Update a patch.
GET /api/patches/51875/?format=api
{ "id": 51875, "url": "http://patches.dpdk.org/api/patches/51875/?format=api", "web_url": "http://patches.dpdk.org/project/dpdk/patch/20190328232451.16988-5-anand.rawat@intel.com/", "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": "<20190328232451.16988-5-anand.rawat@intel.com>", "list_archive_url": "https://inbox.dpdk.org/dev/20190328232451.16988-5-anand.rawat@intel.com", "date": "2019-03-28T23:24:47", "name": "[v7,4/8] eal: sys/queue.h implementation for windows", "commit_ref": null, "pull_url": null, "state": "superseded", "archived": true, "hash": "d8f13bd52029bd0925023298a86ef7f45f31a73f", "submitter": { "id": 1231, "url": "http://patches.dpdk.org/api/people/1231/?format=api", "name": "Anand Rawat", "email": "anand.rawat@intel.com" }, "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/20190328232451.16988-5-anand.rawat@intel.com/mbox/", "series": [ { "id": 3980, "url": "http://patches.dpdk.org/api/series/3980/?format=api", "web_url": "http://patches.dpdk.org/project/dpdk/list/?series=3980", "date": "2019-03-28T23:24:43", "name": "HelloWorld example for windows", "version": 7, "mbox": "http://patches.dpdk.org/series/3980/mbox/" } ], "comments": "http://patches.dpdk.org/api/patches/51875/comments/", "check": "fail", "checks": "http://patches.dpdk.org/api/patches/51875/checks/", "tags": {}, "related": [], "headers": { "Return-Path": "<dev-bounces@dpdk.org>", "X-Original-To": "patchwork@dpdk.org", "Delivered-To": "patchwork@dpdk.org", "Received": [ "from [92.243.14.124] (localhost [127.0.0.1])\n\tby dpdk.org (Postfix) with ESMTP id 81B6D4C93;\n\tFri, 29 Mar 2019 00:25:15 +0100 (CET)", "from mga01.intel.com (mga01.intel.com [192.55.52.88])\n\tby dpdk.org (Postfix) with ESMTP id BC69C2BD3\n\tfor <dev@dpdk.org>; Fri, 29 Mar 2019 00:24:55 +0100 (CET)", "from orsmga005.jf.intel.com ([10.7.209.41])\n\tby fmsmga101.fm.intel.com with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384;\n\t28 Mar 2019 16:24:53 -0700", "from anandraw-devbx.amr.corp.intel.com ([10.19.242.57])\n\tby orsmga005.jf.intel.com with ESMTP; 28 Mar 2019 16:24:53 -0700" ], "X-Amp-Result": "SKIPPED(no attachment in message)", "X-Amp-File-Uploaded": "False", "X-ExtLoop1": "1", "X-IronPort-AV": "E=Sophos;i=\"5.60,282,1549958400\"; d=\"scan'208\";a=\"311303600\"", "From": "Anand Rawat <anand.rawat@intel.com>", "To": "dev@dpdk.org", "Cc": "anand.rawat@intel.com, pallavi.kadam@intel.com, ranjit.menon@intel.com, \n\tjeffrey.b.shaw@intel.com, bruce.richardson@intel.com, thomas@monjalon.net", "Date": "Thu, 28 Mar 2019 16:24:47 -0700", "Message-Id": "<20190328232451.16988-5-anand.rawat@intel.com>", "X-Mailer": "git-send-email 2.17.1.windows.2", "In-Reply-To": "<20190328232451.16988-1-anand.rawat@intel.com>", "References": "<20190306041634.12976-1-anand.rawat@intel.com>\n\t<20190328232451.16988-1-anand.rawat@intel.com>", "Subject": "[dpdk-dev] [PATCH v7 4/8] eal: sys/queue.h implementation for\n\twindows", "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\t<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\t<mailto:dev-request@dpdk.org?subject=subscribe>", "Errors-To": "dev-bounces@dpdk.org", "Sender": "\"dev\" <dev-bounces@dpdk.org>" }, "content": "Adding sys/queue.h on windows for supporting common code.\nThis implementation has BSD-3-Clause licensing.\n\nSigned-off-by: Ranjit Menon <ranjit.menon@intel.com>\nSigned-off-by: Anand Rawat <anand.rawat@intel.com>\nReviewed-by: Jeff Shaw <jeffrey.b.shaw@intel.com>\n---\n .../windows/eal/include/sys/queue.h | 320 ++++++++++++++++++\n 1 file changed, 320 insertions(+)\n create mode 100644 lib/librte_eal/windows/eal/include/sys/queue.h", "diff": "diff --git a/lib/librte_eal/windows/eal/include/sys/queue.h b/lib/librte_eal/windows/eal/include/sys/queue.h\nnew file mode 100644\nindex 000000000..5ee4916ad\n--- /dev/null\n+++ b/lib/librte_eal/windows/eal/include/sys/queue.h\n@@ -0,0 +1,320 @@\n+/*-\n+ * SPDX-License-Identifier: BSD-3-Clause\n+ *\n+ * Copyright (c) 1991, 1993\n+ *\tThe Regents of the University of California. All rights reserved.\n+ *\n+ * Redistribution and use in source and binary forms, with or without\n+ * modification, are permitted provided that the following conditions\n+ * are met:\n+ * 1. Redistributions of source code must retain the above copyright\n+ * notice, this list of conditions and the following disclaimer.\n+ * 2. Redistributions in binary form must reproduce the above copyright\n+ * notice, this list of conditions and the following disclaimer in the\n+ * documentation and/or other materials provided with the distribution.\n+ * 3. Neither the name of the University nor the names of its contributors\n+ * may be used to endorse or promote products derived from this software\n+ * without specific prior written permission.\n+ *\n+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n+ * SUCH DAMAGE.\n+ *\n+ */\n+\n+#ifndef _SYS_QUEUE_H_\n+#define\t_SYS_QUEUE_H_\n+\n+/*\n+ * This file defines tail queues.\n+ *\n+ * A tail queue is headed by a pair of pointers, one to the head of the\n+ * list and the other to the tail of the list. The elements are doubly\n+ * linked so that an arbitrary element can be removed without a need to\n+ * traverse the list. New elements can be added to the list before or\n+ * after an existing element, at the head of the list, or at the end of\n+ * the list. A tail queue may be traversed in either direction.\n+ *\n+ * Below is a summary of implemented functions where:\n+ * + means the macro is available\n+ * - means the macro is not available\n+ * s means the macro is available but is slow (runs in O(n) time)\n+ *\n+ *\t\t\t\tTAILQ\n+ * _HEAD\t\t\t+\n+ * _CLASS_HEAD\t\t\t+\n+ * _HEAD_INITIALIZER\t\t+\n+ * _ENTRY\t\t\t+\n+ * _CLASS_ENTRY\t\t\t+\n+ * _INIT\t\t\t+\n+ * _EMPTY\t\t\t+\n+ * _FIRST\t\t\t+\n+ * _NEXT\t\t\t+\n+ * _PREV\t\t\t+\n+ * _LAST\t\t\t+\n+ * _LAST_FAST\t\t\t+\n+ * _FOREACH\t\t\t+\n+ * _FOREACH_FROM\t\t+\n+ * _FOREACH_SAFE\t\t+\n+ * _FOREACH_FROM_SAFE\t\t+\n+ * _FOREACH_REVERSE\t\t+\n+ * _FOREACH_REVERSE_FROM\t+\n+ * _FOREACH_REVERSE_SAFE\t+\n+ * _FOREACH_REVERSE_FROM_SAFE\t+\n+ * _INSERT_HEAD\t\t\t+\n+ * _INSERT_BEFORE\t\t+\n+ * _INSERT_AFTER\t\t+\n+ * _INSERT_TAIL\t\t\t+\n+ * _CONCAT\t\t\t+\n+ * _REMOVE_AFTER\t\t-\n+ * _REMOVE_HEAD\t\t\t-\n+ * _REMOVE\t\t\t+\n+ * _SWAP\t\t\t+\n+ *\n+ */\n+\n+#ifdef __cplusplus\n+extern \"C\" {\n+#endif\n+\n+#define\tQMD_TRACE_ELEM(elem)\n+#define\tQMD_TRACE_HEAD(head)\n+#define\tTRACEBUF\n+#define\tTRACEBUF_INITIALIZER\n+\n+#define\tTRASHIT(x)\n+#define\tQMD_IS_TRASHED(x)\t0\n+\n+#define\tQMD_SAVELINK(name, link)\n+\n+#ifdef __cplusplus\n+/*\n+ * In C++ there can be structure lists and class lists:\n+ */\n+#define\tQUEUE_TYPEOF(type) type\n+#else\n+#define\tQUEUE_TYPEOF(type) struct type\n+#endif\n+\n+/*\n+ * Tail queue declarations.\n+ */\n+#define\tTAILQ_HEAD(name, type)\t\t\t\t\t\t\\\n+struct name {\t\t\t\t\t\t\t\t\\\n+\tstruct type *tqh_first;\t/* first element */\t\t\t\\\n+\tstruct type **tqh_last;\t/* addr of last next element */\t\t\\\n+\tTRACEBUF\t\t\t\t\t\t\t\\\n+}\n+\n+#define\tTAILQ_CLASS_HEAD(name, type)\t\t\t\t\t\\\n+struct name {\t\t\t\t\t\t\t\t\\\n+\tclass type *tqh_first;\t/* first element */\t\t\t\\\n+\tclass type **tqh_last;\t/* addr of last next element */\t\t\\\n+\tTRACEBUF\t\t\t\t\t\t\t\\\n+}\n+\n+#define\tTAILQ_HEAD_INITIALIZER(head)\t\t\t\t\t\\\n+\t{ NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }\n+\n+#define\tTAILQ_ENTRY(type)\t\t\t\t\t\t\\\n+struct {\t\t\t\t\t\t\t\t\\\n+\tstruct type *tqe_next;\t/* next element */\t\t\t\\\n+\tstruct type **tqe_prev;\t/* address of previous next element */\t\\\n+\tTRACEBUF\t\t\t\t\t\t\t\\\n+}\n+\n+#define\tTAILQ_CLASS_ENTRY(type)\t\t\t\t\t\t\\\n+struct {\t\t\t\t\t\t\t\t\\\n+\tclass type *tqe_next;\t/* next element */\t\t\t\\\n+\tclass type **tqe_prev;\t/* address of previous next element */\t\\\n+\tTRACEBUF\t\t\t\t\t\t\t\\\n+}\n+\n+/*\n+ * Tail queue functions.\n+ */\n+#define\tQMD_TAILQ_CHECK_HEAD(head, field)\n+#define\tQMD_TAILQ_CHECK_TAIL(head, headname)\n+#define\tQMD_TAILQ_CHECK_NEXT(elm, field)\n+#define\tQMD_TAILQ_CHECK_PREV(elm, field)\n+\n+#define\tTAILQ_CONCAT(head1, head2, field) do {\t\t\t\t\\\n+\tif (!TAILQ_EMPTY(head2)) {\t\t\t\t\t\\\n+\t\t*(head1)->tqh_last = (head2)->tqh_first;\t\t\\\n+\t\t(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;\t\\\n+\t\t(head1)->tqh_last = (head2)->tqh_last;\t\t\t\\\n+\t\tTAILQ_INIT((head2));\t\t\t\t\t\\\n+\t\tQMD_TRACE_HEAD(head1);\t\t\t\t\t\\\n+\t\tQMD_TRACE_HEAD(head2);\t\t\t\t\t\\\n+\t}\t\t\t\t\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_EMPTY(head)\t((head)->tqh_first == NULL)\n+\n+#define\tTAILQ_FIRST(head)\t((head)->tqh_first)\n+\n+#define\tTAILQ_FOREACH(var, head, field)\t\t\t\t\t\\\n+\tfor ((var) = TAILQ_FIRST((head));\t\t\t\t\\\n+\t (var);\t\t\t\t\t\t\t\\\n+\t (var) = TAILQ_NEXT((var), field))\n+\n+#define\tTAILQ_FOREACH_FROM(var, head, field)\t\t\t\t\\\n+\tfor ((var) = ((var) ? (var) : TAILQ_FIRST((head)));\t\t\\\n+\t (var);\t\t\t\t\t\t\t\\\n+\t (var) = TAILQ_NEXT((var), field))\n+\n+#define\tTAILQ_FOREACH_SAFE(var, head, field, tvar)\t\t\t\\\n+\tfor ((var) = TAILQ_FIRST((head));\t\t\t\t\\\n+\t (var) && ((tvar) = TAILQ_NEXT((var), field), 1);\t\t\\\n+\t (var) = (tvar))\n+\n+#define\tTAILQ_FOREACH_FROM_SAFE(var, head, field, tvar)\t\t\t\\\n+\tfor ((var) = ((var) ? (var) : TAILQ_FIRST((head)));\t\t\\\n+\t (var) && ((tvar) = TAILQ_NEXT((var), field), 1);\t\t\\\n+\t (var) = (tvar))\n+\n+#define\tTAILQ_FOREACH_REVERSE(var, head, headname, field)\t\t\\\n+\tfor ((var) = TAILQ_LAST((head), headname);\t\t\t\\\n+\t (var);\t\t\t\t\t\t\t\\\n+\t (var) = TAILQ_PREV((var), headname, field))\n+\n+#define\tTAILQ_FOREACH_REVERSE_FROM(var, head, headname, field)\t\t\\\n+\tfor ((var) = ((var) ? (var) : TAILQ_LAST((head), headname));\t\\\n+\t (var);\t\t\t\t\t\t\t\\\n+\t (var) = TAILQ_PREV((var), headname, field))\n+\n+#define\tTAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)\t\\\n+\tfor ((var) = TAILQ_LAST((head), headname);\t\t\t\\\n+\t (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);\t\\\n+\t (var) = (tvar))\n+\n+#define\tTAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \\\n+\tfor ((var) = ((var) ? (var) : TAILQ_LAST((head), headname));\t\\\n+\t (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);\t\\\n+\t (var) = (tvar))\n+\n+#define\tTAILQ_INIT(head) do {\t\t\t\t\t\t\\\n+\tTAILQ_FIRST((head)) = NULL;\t\t\t\t\t\\\n+\t(head)->tqh_last = &TAILQ_FIRST((head));\t\t\t\\\n+\tQMD_TRACE_HEAD(head);\t\t\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_INSERT_AFTER(head, listelm, elm, field) do {\t\t\\\n+\tQMD_TAILQ_CHECK_NEXT(listelm, field);\t\t\t\t\\\n+\tTAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field);\t\\\n+\tif (TAILQ_NEXT((listelm), field) != NULL)\t\t\t\\\n+\t\tTAILQ_NEXT((elm), field)->field.tqe_prev =\t\t\\\n+\t\t &TAILQ_NEXT((elm), field);\t\t\t\t\\\n+\telse {\t\t\t\t\t\t\t\t\\\n+\t\t(head)->tqh_last = &TAILQ_NEXT((elm), field);\t\t\\\n+\t\tQMD_TRACE_HEAD(head);\t\t\t\t\t\\\n+\t}\t\t\t\t\t\t\t\t\\\n+\tTAILQ_NEXT((listelm), field) = (elm);\t\t\t\t\\\n+\t(elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);\t\t\\\n+\tQMD_TRACE_ELEM(&(elm)->field);\t\t\t\t\t\\\n+\tQMD_TRACE_ELEM(&(listelm)->field);\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_INSERT_BEFORE(listelm, elm, field) do {\t\t\t\\\n+\tQMD_TAILQ_CHECK_PREV(listelm, field);\t\t\t\t\\\n+\t(elm)->field.tqe_prev = (listelm)->field.tqe_prev;\t\t\\\n+\tTAILQ_NEXT((elm), field) = (listelm);\t\t\t\t\\\n+\t*(listelm)->field.tqe_prev = (elm);\t\t\t\t\\\n+\t(listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);\t\t\\\n+\tQMD_TRACE_ELEM(&(elm)->field);\t\t\t\t\t\\\n+\tQMD_TRACE_ELEM(&(listelm)->field);\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_INSERT_HEAD(head, elm, field) do {\t\t\t\\\n+\tQMD_TAILQ_CHECK_HEAD(head, field);\t\t\t\t\\\n+\tTAILQ_NEXT((elm), field) = TAILQ_FIRST((head));\t\t\t\\\n+\tif (TAILQ_FIRST((head)) != NULL)\t\t\t\t\\\n+\t\tTAILQ_FIRST((head))->field.tqe_prev =\t\t\t\\\n+\t\t &TAILQ_NEXT((elm), field);\t\t\t\t\\\n+\telse\t\t\t\t\t\t\t\t\\\n+\t\t(head)->tqh_last = &TAILQ_NEXT((elm), field);\t\t\\\n+\tTAILQ_FIRST((head)) = (elm);\t\t\t\t\t\\\n+\t(elm)->field.tqe_prev = &TAILQ_FIRST((head));\t\t\t\\\n+\tQMD_TRACE_HEAD(head);\t\t\t\t\t\t\\\n+\tQMD_TRACE_ELEM(&(elm)->field);\t\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_INSERT_TAIL(head, elm, field) do {\t\t\t\\\n+\tQMD_TAILQ_CHECK_TAIL(head, field);\t\t\t\t\\\n+\tTAILQ_NEXT((elm), field) = NULL;\t\t\t\t\\\n+\t(elm)->field.tqe_prev = (head)->tqh_last;\t\t\t\\\n+\t*(head)->tqh_last = (elm);\t\t\t\t\t\\\n+\t(head)->tqh_last = &TAILQ_NEXT((elm), field);\t\t\t\\\n+\tQMD_TRACE_HEAD(head);\t\t\t\t\t\t\\\n+\tQMD_TRACE_ELEM(&(elm)->field);\t\t\t\t\t\\\n+} while (0)\n+\n+#define\tTAILQ_LAST(head, headname)\t\t\t\t\t\\\n+\t(*(((struct headname *)((head)->tqh_last))->tqh_last))\n+\n+/*\n+ * The FAST function is fast in that it causes no data access other\n+ * then the access to the head. The standard LAST function above\n+ * will cause a data access of both the element you want and\n+ * the previous element. FAST is very useful for instances when\n+ * you may want to prefetch the last data element.\n+ */\n+#define\tTAILQ_LAST_FAST(head, type, field)\t\t\t\\\n+\t(TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last,\t\\\n+\tQUEUE_TYPEOF(type), field.tqe_next))\n+\n+#define\tTAILQ_NEXT(elm, field) ((elm)->field.tqe_next)\n+\n+#define\tTAILQ_PREV(elm, headname, field)\t\t\t\t\\\n+\t(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))\n+\n+#define\tTAILQ_REMOVE(head, elm, field) do {\t\t\t\t\\\n+\tQMD_SAVELINK(oldnext, (elm)->field.tqe_next);\t\t\t\\\n+\tQMD_SAVELINK(oldprev, (elm)->field.tqe_prev);\t\t\t\\\n+\tQMD_TAILQ_CHECK_NEXT(elm, field);\t\t\t\t\\\n+\tQMD_TAILQ_CHECK_PREV(elm, field);\t\t\t\t\\\n+\tif ((TAILQ_NEXT((elm), field)) != NULL)\t\t\t\t\\\n+\t\tTAILQ_NEXT((elm), field)->field.tqe_prev =\t\t\\\n+\t\t (elm)->field.tqe_prev;\t\t\t\t\\\n+\telse {\t\t\t\t\t\t\t\t\\\n+\t\t(head)->tqh_last = (elm)->field.tqe_prev;\t\t\\\n+\t\tQMD_TRACE_HEAD(head);\t\t\t\t\t\\\n+\t}\t\t\t\t\t\t\t\t\\\n+\t*(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);\t\t\\\n+\tTRASHIT(*oldnext);\t\t\t\t\t\t\\\n+\tTRASHIT(*oldprev);\t\t\t\t\t\t\\\n+\tQMD_TRACE_ELEM(&(elm)->field);\t\t\t\t\t\\\n+} while (0)\n+\n+#define TAILQ_SWAP(head1, head2, type, field) do {\t\t\t\\\n+\tQUEUE_TYPEOF(type) * swap_first = (head1)->tqh_first;\t\t\\\n+\tQUEUE_TYPEOF(type) * *swap_last = (head1)->tqh_last;\t\t\\\n+\t(head1)->tqh_first = (head2)->tqh_first;\t\t\t\\\n+\t(head1)->tqh_last = (head2)->tqh_last;\t\t\t\t\\\n+\t(head2)->tqh_first = swap_first;\t\t\t\t\\\n+\t(head2)->tqh_last = swap_last;\t\t\t\t\t\\\n+\tswap_first = (head1)->tqh_first;\t\t\t\t\\\n+\tif (swap_first != NULL)\t\t\t\t\t\t\\\n+\t\tswap_first->field.tqe_prev = &(head1)->tqh_first;\t\\\n+\telse\t\t\t\t\t\t\t\t\\\n+\t\t(head1)->tqh_last = &(head1)->tqh_first;\t\t\\\n+\tswap_first = (head2)->tqh_first;\t\t\t\t\\\n+\tif (swap_first != NULL)\t\t\t\\\n+\t\tswap_first->field.tqe_prev = &(head2)->tqh_first;\t\\\n+\telse\t\t\t\t\t\t\t\t\\\n+\t\t(head2)->tqh_last = &(head2)->tqh_first;\t\t\\\n+} while (0)\n+\n+#ifdef __cplusplus\n+}\n+#endif\n+\n+#endif /* _SYS_QUEUE_H_ */\n", "prefixes": [ "v7", "4/8" ] }