<!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.8"/>
<title>OpenMAXBellagio: queue.c 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="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</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 style="padding-left: 0.5em;">
<div id="projectname">OpenMAXBellagio
 <span id="projectnumber">0.9.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.8 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</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>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</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('queue_8c_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">queue.c</div> </div>
</div><!--header-->
<div class="contents">
<a href="queue_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <stdio.h></span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <stdlib.h></span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <string.h></span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="queue_8h.html">queue.h</a>"</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="omx__comp__debug__levels_8h.html">omx_comp_debug_levels.h</a>"</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div>
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="queue_8h.html#a8f5abe559cd352d91efb79bc6e1788de"> 38</a></span> <span class="keywordtype">int</span> <a class="code" href="queue_8c.html#a8f5abe559cd352d91efb79bc6e1788de">queue_init</a>(<a class="code" href="structqueue__t.html">queue_t</a>* <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>) {</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordtype">int</span> i;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <a class="code" href="structqelem__t.html">qelem_t</a>* newelem;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="structqelem__t.html">qelem_t</a>* current;</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  i = pthread_mutex_init(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>, NULL);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">if</span> (i!=0) {</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">return</span> -1;</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>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a> = malloc(<span class="keyword">sizeof</span>(<a class="code" href="structqelem__t.html">qelem_t</a>));</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (!(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>)) {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  memset(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>, 0, <span class="keyword">sizeof</span>(<a class="code" href="structqelem__t.html">qelem_t</a>));</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  current = queue-><a class="code" href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">last</a> = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>;</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  queue-><a class="code" href="structqueue__t.html#a864e369824645b6d34066b354a516ca0">nelem</a> = 0;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (i = 0; i<<a class="code" href="queue_8h.html#a00fcf46a586e3c933f22d6d0b88262f1">MAX_QUEUE_ELEMENTS</a> - 2; i++) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  newelem = malloc(<span class="keyword">sizeof</span>(<a class="code" href="structqelem__t.html">qelem_t</a>));</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (!newelem) {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// the memory is not enough. Free all</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">while</span>(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>!=NULL) {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  current = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a>;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  free(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>);</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a> = current;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  memset(newelem, 0, <span class="keyword">sizeof</span>(<a class="code" href="structqelem__t.html">qelem_t</a>));</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  current-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a> = newelem;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  current = newelem;</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>  current-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a> = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="queue_8h.html#a7ed0f920c24a1c31472c8fc571100e37"> 77</a></span> <span class="keywordtype">void</span> <a class="code" href="queue_8c.html#a7ed0f920c24a1c31472c8fc571100e37">queue_deinit</a>(<a class="code" href="structqueue__t.html">queue_t</a>* <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>) {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">int</span> i;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="structqelem__t.html">qelem_t</a>* current;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  current = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>;</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">for</span> (i = 0; i<<a class="code" href="queue_8h.html#a00fcf46a586e3c933f22d6d0b88262f1">MAX_QUEUE_ELEMENTS</a> - 2; i++) {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (current != NULL) {</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  current = current-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a>;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  free(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a> = current;</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>  }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span>(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>) {</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  free(queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>);</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a> = NULL;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  pthread_mutex_destroy(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</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> </div>
<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="queue_8h.html#a29e8cac7d151c030f0e1ac1c07f18323"> 103</a></span> <span class="keywordtype">int</span> <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>(<a class="code" href="structqueue__t.html">queue_t</a>* <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>, <span class="keywordtype">void</span>* data) {</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (queue-><a class="code" href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">last</a>-><a class="code" href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">data</a> != NULL) {</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  pthread_mutex_lock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  queue-><a class="code" href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">last</a>-><a class="code" href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">data</a> = data;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  queue-><a class="code" href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">last</a> = queue-><a class="code" href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">last</a>-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a>;</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  queue-><a class="code" href="structqueue__t.html#a864e369824645b6d34066b354a516ca0">nelem</a>++;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  pthread_mutex_unlock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> }</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="queue_8h.html#ada3e91c280824049e9aaa8bb9439bc91"> 122</a></span> <span class="keywordtype">void</span>* <a class="code" href="queue_8c.html#ada3e91c280824049e9aaa8bb9439bc91">dequeue</a>(<a class="code" href="structqueue__t.html">queue_t</a>* <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>) {</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordtype">void</span>* data;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span> (queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>-><a class="code" href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">data</a> == NULL) {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  pthread_mutex_lock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  data = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>-><a class="code" href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">data</a>;</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>-><a class="code" href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">data</a> = NULL;</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a> = queue-><a class="code" href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">first</a>-><a class="code" href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">q_forw</a>;</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  queue-><a class="code" href="structqueue__t.html#a864e369824645b6d34066b354a516ca0">nelem</a>--;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  pthread_mutex_unlock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> data;</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> }</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="queue_8h.html#adebc8aa8d0be687bce26fb8c458c447a"> 143</a></span> <span class="keywordtype">int</span> <a class="code" href="queue_8c.html#adebc8aa8d0be687bce26fb8c458c447a">getquenelem</a>(<a class="code" href="structqueue__t.html">queue_t</a>* <a class="code" href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a>) {</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">int</span> qelem;</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  pthread_mutex_lock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  qelem = queue-><a class="code" href="structqueue__t.html#a864e369824645b6d34066b354a516ca0">nelem</a>;</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  pthread_mutex_unlock(&queue-><a class="code" href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">mutex</a>);</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> qelem;</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> }</div>
<div class="ttc" id="structqueue__t_html_a03830f3fe84c6d7c226f6c1e2bf4ecf0"><div class="ttname"><a href="structqueue__t.html#a03830f3fe84c6d7c226f6c1e2bf4ecf0">queue_t::last</a></div><div class="ttdeci">qelem_t * last</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00045">queue.h:45</a></div></div>
<div class="ttc" id="structqueue__t_html_a864e369824645b6d34066b354a516ca0"><div class="ttname"><a href="structqueue__t.html#a864e369824645b6d34066b354a516ca0">queue_t::nelem</a></div><div class="ttdeci">int nelem</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00046">queue.h:46</a></div></div>
<div class="ttc" id="omx__comp__debug__levels_8h_html"><div class="ttname"><a href="omx__comp__debug__levels_8h.html">omx_comp_debug_levels.h</a></div></div>
<div class="ttc" id="structqueue__t_html_a8cc672714ef51393d594e789f12e53f9"><div class="ttname"><a href="structqueue__t.html#a8cc672714ef51393d594e789f12e53f9">queue_t::first</a></div><div class="ttdeci">qelem_t * first</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00044">queue.h:44</a></div></div>
<div class="ttc" id="queue_8c_html_a7ed0f920c24a1c31472c8fc571100e37"><div class="ttname"><a href="queue_8c.html#a7ed0f920c24a1c31472c8fc571100e37">queue_deinit</a></div><div class="ttdeci">void queue_deinit(queue_t *queue)</div><div class="ttdef"><b>Definition:</b> <a href="queue_8c_source.html#l00077">queue.c:77</a></div></div>
<div class="ttc" id="queue_8h_html"><div class="ttname"><a href="queue_8h.html">queue.h</a></div></div>
<div class="ttc" id="queue_8c_html_a8f5abe559cd352d91efb79bc6e1788de"><div class="ttname"><a href="queue_8c.html#a8f5abe559cd352d91efb79bc6e1788de">queue_init</a></div><div class="ttdeci">int queue_init(queue_t *queue)</div><div class="ttdef"><b>Definition:</b> <a href="queue_8c_source.html#l00038">queue.c:38</a></div></div>
<div class="ttc" id="structqueue__t_html"><div class="ttname"><a href="structqueue__t.html">queue_t</a></div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00043">queue.h:43</a></div></div>
<div class="ttc" id="structqelem__t_html_a8dd9bf8307c20c63b1849bbb4484fd28"><div class="ttname"><a href="structqelem__t.html#a8dd9bf8307c20c63b1849bbb4484fd28">qelem_t::data</a></div><div class="ttdeci">void * data</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00038">queue.h:38</a></div></div>
<div class="ttc" id="queue_8c_html_a29e8cac7d151c030f0e1ac1c07f18323"><div class="ttname"><a href="queue_8c.html#a29e8cac7d151c030f0e1ac1c07f18323">queue</a></div><div class="ttdeci">int queue(queue_t *queue, void *data)</div><div class="ttdef"><b>Definition:</b> <a href="queue_8c_source.html#l00103">queue.c:103</a></div></div>
<div class="ttc" id="queue_8c_html_adebc8aa8d0be687bce26fb8c458c447a"><div class="ttname"><a href="queue_8c.html#adebc8aa8d0be687bce26fb8c458c447a">getquenelem</a></div><div class="ttdeci">int getquenelem(queue_t *queue)</div><div class="ttdef"><b>Definition:</b> <a href="queue_8c_source.html#l00143">queue.c:143</a></div></div>
<div class="ttc" id="structqelem__t_html"><div class="ttname"><a href="structqelem__t.html">qelem_t</a></div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00036">queue.h:36</a></div></div>
<div class="ttc" id="structqueue__t_html_a43ce8ac96ef09cae9df85ad837e0a4ea"><div class="ttname"><a href="structqueue__t.html#a43ce8ac96ef09cae9df85ad837e0a4ea">queue_t::mutex</a></div><div class="ttdeci">pthread_mutex_t mutex</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00047">queue.h:47</a></div></div>
<div class="ttc" id="queue_8c_html_ada3e91c280824049e9aaa8bb9439bc91"><div class="ttname"><a href="queue_8c.html#ada3e91c280824049e9aaa8bb9439bc91">dequeue</a></div><div class="ttdeci">void * dequeue(queue_t *queue)</div><div class="ttdef"><b>Definition:</b> <a href="queue_8c_source.html#l00122">queue.c:122</a></div></div>
<div class="ttc" id="structqelem__t_html_ad834720b84cbcefd88cf1757ab892679"><div class="ttname"><a href="structqelem__t.html#ad834720b84cbcefd88cf1757ab892679">qelem_t::q_forw</a></div><div class="ttdeci">qelem_t * q_forw</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00037">queue.h:37</a></div></div>
<div class="ttc" id="queue_8h_html_a00fcf46a586e3c933f22d6d0b88262f1"><div class="ttname"><a href="queue_8h.html#a00fcf46a586e3c933f22d6d0b88262f1">MAX_QUEUE_ELEMENTS</a></div><div class="ttdeci">#define MAX_QUEUE_ELEMENTS</div><div class="ttdef"><b>Definition:</b> <a href="queue_8h_source.html#l00032">queue.h:32</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<html>
<body>
<hr size="1"><small>Generated for OpenMAX Bellagio rel. 0.9.3 by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.1 </small>
<br>
<a href="http://sourceforge.net"><img src="http://sflogo.sourceforge.net/sflogo.php?group_id=160680&type=4" width="125" height="37" border="0" alt="SourceForge.net Logo" /></a>
</body>
</html>
distrib
>
Mageia
>
5
>
x86_64
>
media
>
core-release
>
by-pkgid
>
87aded5420321e37af1000cab6d33378
>
files
>
436
