/usr/share/doc/libosmocore/core/html/linuxlist_8h_source.html is in libosmocore-doc 0.9.0-7.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 | <!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.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libosmocore: include/osmocom/core/linuxlist.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="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</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">libosmocore
 <span id="projectnumber">0.9.0</span>
</div>
<div id="projectbrief">Osmocom core library</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',false,false,'search.php','Search');
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('linuxlist_8h_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">linuxlist.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="preprocessor">#pragma once</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include <stddef.h></span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> </div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#ifndef inline</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#define inline __inline__</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> prefetch(<span class="keyword">const</span> <span class="keywordtype">void</span> *x) {;}</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#define container_of(ptr, type, member) ({ \</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor"> const typeof( ((type *)0)->member ) *__mptr = (ptr); \</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor"> (type *)( (char *)__mptr - offsetof(type, member) );})</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">/*</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * These are non-NULL pointers that will result in page faults</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * under normal circumstances, used to verify that nobody uses</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * non-initialized llist entries.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#define LLIST_POISON1 ((void *) 0x00100100)</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#define LLIST_POISON2 ((void *) 0x00200200)</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="comment">/*</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * Simple doubly linked llist implementation.</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> *</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * Some of the internal functions ("__xxx") are useful when</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * manipulating whole llists rather than single entries, as</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * sometimes we already know the next/prev entries and we can</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * generate better code by using them directly rather than</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * using the generic single-entry routines.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> */</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="structllist__head.html"> 42</a></span> <span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *next, *prev;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</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 LLIST_HEAD_INIT(name) { &(name), &(name) }</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#define LLIST_HEAD(name) \</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor"> struct llist_head name = LLIST_HEAD_INIT(name)</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="preprocessor">#define INIT_LLIST_HEAD(ptr) do { \</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor"> (ptr)->next = (ptr); (ptr)->prev = (ptr); \</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">} while (0)</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">/*</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * Insert a new entry between two known consecutive entries. </span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> *</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * This is only for internal llist manipulation where we know</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * the prev/next entries already!</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> */</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> __llist_add(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *_new,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *prev,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *next)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  next->prev = _new;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _new->next = next;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _new->prev = prev;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  prev->next = _new;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> }</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_add(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *_new, <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  __llist_add(_new, head, head->next);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_add_tail(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *_new, <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  __llist_add(_new, head->prev, head);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">/*</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * Delete a llist entry by making the prev/next entries</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * point to each other.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> *</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * This is only for internal llist manipulation where we know</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> * the prev/next entries already!</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> */</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> __llist_del(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> * prev, <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> * next)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  next->prev = prev;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  prev->next = next;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_del(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *entry)</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  __llist_del(entry->prev, entry->next);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  entry->next = (<span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *)LLIST_POISON1;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  entry->prev = (<span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *)LLIST_POISON2;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_del_init(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *entry)</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>  __llist_del(entry->prev, entry->next);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  INIT_LLIST_HEAD(entry); </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_move(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *llist, <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</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>  __llist_del(llist->prev, llist->next);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  llist_add(llist, head);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_move_tail(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *llist,</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> {</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  __llist_del(llist->prev, llist->next);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  llist_add_tail(llist, head);</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> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> llist_empty(<span class="keyword">const</span> <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> head->next == head;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> __llist_splice(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *llist,</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *first = llist->next;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *last = llist->prev;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">struct </span><a class="code" href="structllist__head.html">llist_head</a> *at = head->next;</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>  first->prev = head;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  head->next = first;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  last->next = at;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  at->prev = last;</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> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_splice(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *llist, <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</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="keywordflow">if</span> (!llist_empty(llist))</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  __llist_splice(llist, head);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> llist_splice_init(<span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *llist,</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">struct</span> <a class="code" href="structllist__head.html">llist_head</a> *head)</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="keywordflow">if</span> (!llist_empty(llist)) {</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  __llist_splice(llist, head);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  INIT_LLIST_HEAD(llist);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="preprocessor">#define llist_entry(ptr, type, member) \</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="preprocessor"> container_of(ptr, type, member)</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="preprocessor">#define llist_for_each(pos, head) \</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="preprocessor"> for (pos = (head)->next, prefetch(pos->next); pos != (head); \</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor"> pos = pos->next, prefetch(pos->next))</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor">#define __llist_for_each(pos, head) \</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor"> for (pos = (head)->next; pos != (head); pos = pos->next)</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="preprocessor">#define llist_for_each_prev(pos, head) \</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="preprocessor"> for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor"> pos = pos->prev, prefetch(pos->prev))</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="preprocessor">#define llist_for_each_safe(pos, n, head) \</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor"> for (pos = (head)->next, n = pos->next; pos != (head); \</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="preprocessor"> pos = n, n = pos->next)</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="preprocessor">#define llist_for_each_entry(pos, head, member) \</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="preprocessor"> for (pos = llist_entry((head)->next, typeof(*pos), member), \</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="preprocessor"> prefetch(pos->member.next); \</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="preprocessor"> &pos->member != (head); \</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="preprocessor"> pos = llist_entry(pos->member.next, typeof(*pos), member), \</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="preprocessor"> prefetch(pos->member.next))</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="preprocessor">#define llist_for_each_entry_reverse(pos, head, member) \</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor"> for (pos = llist_entry((head)->prev, typeof(*pos), member), \</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="preprocessor"> prefetch(pos->member.prev); \</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="preprocessor"> &pos->member != (head); \</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="preprocessor"> pos = llist_entry(pos->member.prev, typeof(*pos), member), \</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="preprocessor"> prefetch(pos->member.prev))</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="preprocessor">#define llist_for_each_entry_continue(pos, head, member) \</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="preprocessor"> for (pos = llist_entry(pos->member.next, typeof(*pos), member), \</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="preprocessor"> prefetch(pos->member.next); \</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="preprocessor"> &pos->member != (head); \</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="preprocessor"> pos = llist_entry(pos->member.next, typeof(*pos), member), \</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="preprocessor"> prefetch(pos->member.next))</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="preprocessor">#define llist_for_each_entry_safe(pos, n, head, member) \</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="preprocessor"> for (pos = llist_entry((head)->next, typeof(*pos), member), \</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="preprocessor"> n = llist_entry(pos->member.next, typeof(*pos), member); \</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="preprocessor"> &pos->member != (head); \</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="preprocessor"> pos = n, n = llist_entry(n->member.next, typeof(*n), member))</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="preprocessor">#define llist_for_each_rcu(pos, head) \</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="preprocessor"> for (pos = (head)->next, prefetch(pos->next); pos != (head); \</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="preprocessor"> pos = pos->next, ({ smp_read_barrier_depends(); 0;}), prefetch(pos->next))</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="preprocessor">#define __llist_for_each_rcu(pos, head) \</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="preprocessor"> for (pos = (head)->next; pos != (head); \</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="preprocessor"> pos = pos->next, ({ smp_read_barrier_depends(); 0;}))</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="preprocessor">#define llist_for_each_safe_rcu(pos, n, head) \</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="preprocessor"> for (pos = (head)->next, n = pos->next; pos != (head); \</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="preprocessor"> pos = n, ({ smp_read_barrier_depends(); 0;}), n = pos->next)</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="preprocessor">#define llist_for_each_entry_rcu(pos, head, member) \</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="preprocessor"> for (pos = llist_entry((head)->next, typeof(*pos), member), \</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="preprocessor"> prefetch(pos->member.next); \</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="preprocessor"> &pos->member != (head); \</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="preprocessor"> pos = llist_entry(pos->member.next, typeof(*pos), member), \</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="preprocessor"> ({ smp_read_barrier_depends(); 0;}), \</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="preprocessor"> prefetch(pos->member.next))</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="preprocessor">#define llist_for_each_continue_rcu(pos, head) \</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="preprocessor"> for ((pos) = (pos)->next, prefetch((pos)->next); (pos) != (head); \</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="preprocessor"> (pos) = (pos)->next, ({ smp_read_barrier_depends(); 0;}), prefetch((pos)->next))</span></div><div class="ttc" id="structllist__head_html"><div class="ttname"><a href="structllist__head.html">llist_head</a></div><div class="ttdef"><b>Definition:</b> linuxlist.h:42</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_abe9b486a10ccc5afdf8abc29637e0c1.html">osmocom</a></li><li class="navelem"><a class="el" href="dir_4a15838024bb755c6d5f76ba8bfaacdb.html">core</a></li><li class="navelem"><b>linuxlist.h</b></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li>
</ul>
</div>
</body>
</html>
|