337 lines
38 KiB
HTML
337 lines
38 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.10"/>
|
|
<title>ESP8266_RTOS_SDK: include/espressif/queue.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { init_search(); });
|
|
</script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">ESP8266_RTOS_SDK
|
|
 <span id="projectnumber">v1.4.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.10 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="modules.html"><span>Modules</span></a></li>
|
|
<li><a href="annotated.html"><span>Data Structures</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_cf4dbf1328d2cf10d3f3933741525dc7.html">espressif</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">queue.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * ESPRSSIF MIT License</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * Copyright (c) 2015 <ESPRESSIF SYSTEMS (SHANGHAI) PTE LTD></span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Permission is hereby granted for use on ESPRESSIF SYSTEMS ESP8266 only, in which case,</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * it is free of charge, to any person obtaining a copy of this software and associated</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * documentation files (the "Software"), to deal in the Software without restriction, including</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * and/or sell copies of the Software, and to permit persons to whom the Software is furnished</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * to do so, subject to the following conditions:</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * The above copyright notice and this permission notice shall be included in all copies or</span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * substantial portions of the Software.</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#ifndef _SYS_QUEUE_H_</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#define _SYS_QUEUE_H_</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#ifdef __cplusplus</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#define QMD_SAVELINK(name, link)</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define TRASHIT(x)</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * Singly-linked List declarations.</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#define SLIST_HEAD(name, type) \</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor"> struct name { \</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor"> struct type *slh_first; </span><span class="comment">/* first element */</span><span class="preprocessor"> \</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor"> }</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#define SLIST_HEAD_INITIALIZER(head) \</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor"> { NULL }</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#define SLIST_ENTRY(type) \</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor"> struct { \</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor"> struct type *sle_next; </span><span class="comment">/* next element */</span><span class="preprocessor"> \</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor"> }</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * Singly-linked List functions.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#define SLIST_EMPTY(head) ((head)->slh_first == NULL)</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#define SLIST_FIRST(head) ((head)->slh_first)</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#define SLIST_FOREACH(var, head, field) \</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"> for ((var) = SLIST_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor"> (var); \</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor"> (var) = SLIST_NEXT((var), field))</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#define SLIST_FOREACH_SAFE(var, head, field, tvar) \</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"> for ((var) = SLIST_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor"> (var) && ((tvar) = SLIST_NEXT((var), field), 1); \</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"> (var) = (tvar))</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#define SLIST_FOREACH_PREVPTR(var, varp, head, field) \</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> for ((varp) = &SLIST_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor"> ((var) = *(varp)) != NULL; \</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"> (varp) = &SLIST_NEXT((var), field))</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#define SLIST_INIT(head) do { \</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor"> SLIST_FIRST((head)) = NULL; \</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor">#define SLIST_INSERT_AFTER(slistelm, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> SLIST_NEXT((slistelm), field) = (elm); \</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor">#define SLIST_INSERT_HEAD(head, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor"> SLIST_FIRST((head)) = (elm); \</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor">#define SLIST_NEXT(elm, field) ((elm)->field.sle_next)</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#define SLIST_REMOVE(head, elm, type, field) do { \</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor"> QMD_SAVELINK(oldnext, (elm)->field.sle_next); \</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor"> if (SLIST_FIRST((head)) == (elm)) { \</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor"> SLIST_REMOVE_HEAD((head), field); \</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor"> else { \</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor"> struct type *curelm = SLIST_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor"> while (SLIST_NEXT(curelm, field) != (elm)) \</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor"> curelm = SLIST_NEXT(curelm, field); \</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor"> SLIST_REMOVE_AFTER(curelm, field); \</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor"> TRASHIT(*oldnext); \</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#define SLIST_REMOVE_AFTER(elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor"> SLIST_NEXT(elm, field) = \</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor"> SLIST_NEXT(SLIST_NEXT(elm, field), field); \</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor">#define SLIST_REMOVE_HEAD(head, field) do { \</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor"> SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * Singly-linked Tail queue declarations.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor">#define STAILQ_HEAD(name, type) \</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor"> struct name { \</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"> struct type *stqh_first; </span><span class="comment">/* first element */</span><span class="preprocessor"> \</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor"> struct type **stqh_last; </span><span class="comment">/* addr of last next element */</span><span class="preprocessor"> \</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"> }</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor">#define STAILQ_HEAD_INITIALIZER(head) \</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor"> { NULL, &(head).stqh_first }</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#define STAILQ_ENTRY(type) \</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor"> struct { \</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor"> struct type *stqe_next; </span><span class="comment">/* next element */</span><span class="preprocessor"> \</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor"> }</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * Singly-linked Tail queue functions.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#define STAILQ_CONCAT(head1, head2) do { \</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor"> if (!STAILQ_EMPTY((head2))) { \</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor"> *(head1)->stqh_last = (head2)->stqh_first; \</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor"> (head1)->stqh_last = (head2)->stqh_last; \</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor"> STAILQ_INIT((head2)); \</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="preprocessor">#define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor">#define STAILQ_FIRST(head) ((head)->stqh_first)</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="preprocessor">#define STAILQ_FOREACH(var, head, field) \</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor"> for((var) = STAILQ_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="preprocessor"> (var); \</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor"> (var) = STAILQ_NEXT((var), field))</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor">#define STAILQ_FOREACH_SAFE(var, head, field, tvar) \</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor"> for ((var) = STAILQ_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor"> (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor"> (var) = (tvar))</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#define STAILQ_INIT(head) do { \</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor"> STAILQ_FIRST((head)) = NULL; \</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor">#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor"> if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_NEXT((elm), field); \</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor"> STAILQ_NEXT((tqelm), field) = (elm); \</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#define STAILQ_INSERT_HEAD(head, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="preprocessor"> if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_NEXT((elm), field); \</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor"> STAILQ_FIRST((head)) = (elm); \</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#define STAILQ_INSERT_TAIL(head, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor"> STAILQ_NEXT((elm), field) = NULL; \</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="preprocessor"> *(head)->stqh_last = (elm); \</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_NEXT((elm), field); \</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#define STAILQ_LAST(head, type, field) \</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor"> (STAILQ_EMPTY((head))? \</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor"> NULL : \</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor"> ((struct type *)(void *)\</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor"> ((char *)((head)->stqh_last) - __offsetof(struct type, field))))</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="preprocessor">#define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor">#define STAILQ_REMOVE(head, elm, type, field) do { \</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="preprocessor"> QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor"> if (STAILQ_FIRST((head)) == (elm)) { \</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor"> STAILQ_REMOVE_HEAD((head), field); \</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="preprocessor"> else { \</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="preprocessor"> struct type *curelm = STAILQ_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="preprocessor"> while (STAILQ_NEXT(curelm, field) != (elm)) \</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="preprocessor"> curelm = STAILQ_NEXT(curelm, field); \</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="preprocessor"> STAILQ_REMOVE_AFTER(head, curelm, field); \</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor"> TRASHIT(*oldnext); \</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#define STAILQ_REMOVE_HEAD(head, field) do { \</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor"> if ((STAILQ_FIRST((head)) = \</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor"> STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_FIRST((head)); \</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="preprocessor">#define STAILQ_REMOVE_AFTER(head, elm, field) do { \</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor"> if ((STAILQ_NEXT(elm, field) = \</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="preprocessor"> STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_NEXT((elm), field); \</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="preprocessor">#define STAILQ_SWAP(head1, head2, type) do { \</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="preprocessor"> struct type *swap_first = STAILQ_FIRST(head1); \</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="preprocessor"> struct type **swap_last = (head1)->stqh_last; \</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="preprocessor"> STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="preprocessor"> (head1)->stqh_last = (head2)->stqh_last; \</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="preprocessor"> STAILQ_FIRST(head2) = swap_first; \</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="preprocessor"> (head2)->stqh_last = swap_last; \</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="preprocessor"> if (STAILQ_EMPTY(head1)) \</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="preprocessor"> (head1)->stqh_last = &STAILQ_FIRST(head1); \</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="preprocessor"> if (STAILQ_EMPTY(head2)) \</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor"> (head2)->stqh_last = &STAILQ_FIRST(head2); \</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="preprocessor">#define STAILQ_INSERT_CHAIN_HEAD(head, elm_chead, elm_ctail, field) do { \</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="preprocessor"> if ((STAILQ_NEXT(elm_ctail, field) = STAILQ_FIRST(head)) == NULL ) { \</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="preprocessor"> (head)->stqh_last = &STAILQ_NEXT(elm_ctail, field); \</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="preprocessor"> STAILQ_FIRST(head) = (elm_chead); \</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor"> } while (0)</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#ifdef __cplusplus</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="preprocessor">#endif </span><span class="comment">/* !_SYS_QUEUE_H_ */</span><span class="preprocessor"></span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated on Tue Mar 1 2016 10:19:26 for ESP8266_RTOS_SDK by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.10
|
|
</small></address>
|
|
</body>
|
|
</html>
|