<!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"/>
<title>Universal Software Radio Peripheral: circular_linked_list.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.3 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>circular_linked_list.h</h1><a href="circular__linked__list_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c++ -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/*</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright 2006,2009,2010 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment"> * </span>
<a name="l00005"></a>00005 <span class="comment"> * This file is part of GNU Radio.</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * GNU Radio is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00010"></a>00010 <span class="comment"> * any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> * </span>
<a name="l00012"></a>00012 <span class="comment"> * GNU Radio is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> * </span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with GNU Radio; see the file COPYING. If not, write to</span>
<a name="l00019"></a>00019 <span class="comment"> * the Free Software Foundation, Inc., 51 Franklin Street,</span>
<a name="l00020"></a>00020 <span class="comment"> * Boston, MA 02110-1301, USA.</span>
<a name="l00021"></a>00021 <span class="comment"> */</span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="preprocessor">#ifndef _CIRCULAR_LINKED_LIST_H_</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#define _CIRCULAR_LINKED_LIST_H_</span>
<a name="l00025"></a>00025 <span class="preprocessor"></span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <gruel/thread.h></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include <stdexcept></span>
<a name="l00028"></a>00028
<a name="l00029"></a><a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">00029</a> <span class="preprocessor">#define __INLINE__ inline</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span>
<a name="l00031"></a>00031 <span class="preprocessor">#ifndef DO_DEBUG</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#define DO_DEBUG 0</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span>
<a name="l00035"></a>00035 <span class="preprocessor">#if DO_DEBUG</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor">#define DEBUG(X) do{X} while(0);</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00038"></a><a class="code" href="circular__linked__list_8h.html#aef41e8aaf4c60819b30faf396cdf4978">00038</a> <span class="preprocessor"></span><span class="preprocessor">#define DEBUG(X) do{} while(0);</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span>
<a name="l00041"></a>00041 <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">class </span><a class="code" href="classs__both.html">s_both</a>;
<a name="l00042"></a>00042
<a name="l00043"></a><a class="code" href="classs__node.html">00043</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">class </span><a class="code" href="classs__node.html">s_node</a>
<a name="l00044"></a>00044 {
<a name="l00045"></a>00045 <span class="keyword">typedef</span> <a class="code" href="classs__node.html">s_node<T></a>* <a class="code" href="classs__node.html">s_node_ptr</a>;
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <span class="keyword">private</span>:
<a name="l00048"></a>00048 T d_object;
<a name="l00049"></a>00049 <span class="keywordtype">bool</span> d_available;
<a name="l00050"></a>00050 <a class="code" href="classs__node.html">s_node_ptr</a> d_prev, d_next;
<a name="l00051"></a>00051 <a class="code" href="classs__both.html">s_both<T></a>* d_both;
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="keyword">public</span>:
<a name="l00054"></a><a class="code" href="classs__node.html#afbe3c276a0423decc8af7aaf90433f4c">00054</a> <a class="code" href="classs__node.html#a5ca67627e354cc80b7ec005f6fcc53f3">s_node</a> (T l_object,
<a name="l00055"></a>00055 <a class="code" href="classs__node.html">s_node_ptr</a> l_prev = NULL,
<a name="l00056"></a>00056 <a class="code" href="classs__node.html">s_node_ptr</a> l_next = NULL)
<a name="l00057"></a>00057 : d_object (l_object), d_available (TRUE), d_prev (l_prev),
<a name="l00058"></a>00058 d_next (l_next), d_both (0) {};
<a name="l00059"></a>00059
<a name="l00060"></a><a class="code" href="classs__node.html#a2a29651bdde8d34fd8464c998d1ae1dd">00060</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html#a2a29651bdde8d34fd8464c998d1ae1dd">s_node</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_prev, <a class="code" href="classs__node.html">s_node_ptr</a> l_next = NULL) {
<a name="l00061"></a>00061 <a class="code" href="classs__node.html#a5ca67627e354cc80b7ec005f6fcc53f3">s_node</a> ((T) NULL, l_prev, l_next); };
<a name="l00062"></a><a class="code" href="classs__node.html#a5ca67627e354cc80b7ec005f6fcc53f3">00062</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html#a5ca67627e354cc80b7ec005f6fcc53f3">s_node</a> () { <a class="code" href="classs__node.html#a5ca67627e354cc80b7ec005f6fcc53f3">s_node</a> (NULL, NULL, NULL); };
<a name="l00063"></a><a class="code" href="classs__node.html#a8ae901b835a536058e95002760ead401">00063</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html#a8ae901b835a536058e95002760ead401">~s_node</a> () {};
<a name="l00064"></a>00064
<a name="l00065"></a><a class="code" href="classs__node.html#a4aaf8f0ea1cf81523e4d80796f1bc8ab">00065</a> <span class="keywordtype">void</span> <span class="keyword">remove</span> () {
<a name="l00066"></a>00066 d_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (d_next);
<a name="l00067"></a>00067 d_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (d_prev);
<a name="l00068"></a>00068 d_prev = d_next = <span class="keyword">this</span>;
<a name="l00069"></a>00069 };
<a name="l00070"></a>00070
<a name="l00071"></a><a class="code" href="classs__node.html#a6d608ac8cebbbd59d758811fad7a705d">00071</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#a6d608ac8cebbbd59d758811fad7a705d">insert_before</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_next) {
<a name="l00072"></a>00072 <span class="keywordflow">if</span> (l_next) {
<a name="l00073"></a>00073 <a class="code" href="classs__node.html">s_node_ptr</a> l_prev = l_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> ();
<a name="l00074"></a>00074 d_next = l_next;
<a name="l00075"></a>00075 d_prev = l_prev;
<a name="l00076"></a>00076 l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (<span class="keyword">this</span>);
<a name="l00077"></a>00077 l_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (<span class="keyword">this</span>);
<a name="l00078"></a>00078 } <span class="keywordflow">else</span>
<a name="l00079"></a>00079 d_next = d_prev = <span class="keyword">this</span>;
<a name="l00080"></a>00080 };
<a name="l00081"></a>00081
<a name="l00082"></a><a class="code" href="classs__node.html#a670d64f28a305d0c6d6cb1cea15574de">00082</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#a670d64f28a305d0c6d6cb1cea15574de">insert_after</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_prev) {
<a name="l00083"></a>00083 <span class="keywordflow">if</span> (l_prev) {
<a name="l00084"></a>00084 <a class="code" href="classs__node.html">s_node_ptr</a> l_next = l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> ();
<a name="l00085"></a>00085 d_prev = l_prev;
<a name="l00086"></a>00086 d_next = l_next;
<a name="l00087"></a>00087 l_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (<span class="keyword">this</span>);
<a name="l00088"></a>00088 l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (<span class="keyword">this</span>);
<a name="l00089"></a>00089 } <span class="keywordflow">else</span>
<a name="l00090"></a>00090 d_prev = d_next = <span class="keyword">this</span>;
<a name="l00091"></a>00091 };
<a name="l00092"></a>00092
<a name="l00093"></a><a class="code" href="classs__node.html#a8051b14d5a222a3f9c60836f38216755">00093</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> T <a class="code" href="classs__node.html#a8051b14d5a222a3f9c60836f38216755">object</a> () { <span class="keywordflow">return</span> (d_object); };
<a name="l00094"></a><a class="code" href="classs__node.html#ae58bc285b15ad2cd041e6b6118609f1b">00094</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#ae58bc285b15ad2cd041e6b6118609f1b">object</a> (T l_object) { d_object = l_object; };
<a name="l00095"></a><a class="code" href="classs__node.html#aa8220eb78502b97b61a24cefca6f77b9">00095</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">bool</span> <a class="code" href="classs__node.html#aa8220eb78502b97b61a24cefca6f77b9">available</a> () { <span class="keywordflow">return</span> (d_available); };
<a name="l00096"></a><a class="code" href="classs__node.html#ad71bf0bba7b638ef8772796e14b1040f">00096</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#ad71bf0bba7b638ef8772796e14b1040f">set_available</a> () { d_available = TRUE; };
<a name="l00097"></a><a class="code" href="classs__node.html#a54fe1a9f52fd4d2c31ed9926ef9ff376">00097</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#a54fe1a9f52fd4d2c31ed9926ef9ff376">set_available</a> (<span class="keywordtype">bool</span> l_avail) { d_available = l_avail; };
<a name="l00098"></a><a class="code" href="classs__node.html#ae78f39a138892b241295a9e7f9a470d5">00098</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#ae78f39a138892b241295a9e7f9a470d5">set_not_available</a> () { d_available = FALSE; };
<a name="l00099"></a><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">00099</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html">s_node_ptr</a> <a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> () { <span class="keywordflow">return</span> (d_next); };
<a name="l00100"></a><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">00100</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html">s_node_ptr</a> <a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> () { <span class="keywordflow">return</span> (d_prev); };
<a name="l00101"></a><a class="code" href="classs__node.html#ac3b0c2f62a6d14dcf295ae0238a6b5be">00101</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__both.html">s_both<T></a>* <a class="code" href="classs__node.html#ac3b0c2f62a6d14dcf295ae0238a6b5be">both</a> () { <span class="keywordflow">return</span> (d_both); };
<a name="l00102"></a><a class="code" href="classs__node.html#aaaf2f3c58455d6814dba0040d603c7d7">00102</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#aaaf2f3c58455d6814dba0040d603c7d7">next</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_next) { d_next = l_next; };
<a name="l00103"></a><a class="code" href="classs__node.html#a54fbb84a674624a3a93bb77eddd8d776">00103</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#a54fbb84a674624a3a93bb77eddd8d776">prev</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_prev) { d_prev = l_prev; };
<a name="l00104"></a><a class="code" href="classs__node.html#a709ea4820a298a701697f7f40545d2de">00104</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classs__node.html#a709ea4820a298a701697f7f40545d2de">both</a> (<a class="code" href="classs__both.html">s_both<T></a>* l_both) { d_both = l_both; };
<a name="l00105"></a>00105 };
<a name="l00106"></a>00106
<a name="l00107"></a><a class="code" href="classcircular__linked__list.html">00107</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">class </span><a class="code" href="classcircular__linked__list.html">circular_linked_list</a> {
<a name="l00108"></a>00108 <span class="keyword">typedef</span> <a class="code" href="classs__node.html">s_node<T></a>* <a class="code" href="classs__node.html">s_node_ptr</a>;
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <span class="keyword">private</span>:
<a name="l00111"></a>00111 <a class="code" href="classs__node.html">s_node_ptr</a> d_current, d_iterate, d_available, d_inUse;
<a name="l00112"></a>00112 <span class="keywordtype">size_t</span> d_n_nodes, d_n_used;
<a name="l00113"></a>00113 gruel::mutex* d_internal;
<a name="l00114"></a>00114 gruel::condition_variable* d_ioBlock;
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="keyword">public</span>:
<a name="l00117"></a><a class="code" href="classcircular__linked__list.html#acf64b05d565fd8ef5ee74ceba8adbee3">00117</a> <a class="code" href="classcircular__linked__list.html#acf64b05d565fd8ef5ee74ceba8adbee3">circular_linked_list</a> (<span class="keywordtype">size_t</span> n_nodes) {
<a name="l00118"></a>00118 <span class="keywordflow">if</span> (n_nodes == 0)
<a name="l00119"></a>00119 <span class="keywordflow">throw</span> std::runtime_error (<span class="stringliteral">"circular_linked_list(): n_nodes == 0"</span>);
<a name="l00120"></a>00120
<a name="l00121"></a>00121 d_iterate = NULL;
<a name="l00122"></a>00122 d_n_nodes = n_nodes;
<a name="l00123"></a>00123 d_n_used = 0;
<a name="l00124"></a>00124 <a class="code" href="classs__node.html">s_node_ptr</a> l_prev, l_next;
<a name="l00125"></a>00125 d_inUse = d_current = l_next = l_prev = NULL;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 l_prev = <span class="keyword">new</span> <a class="code" href="classs__node.html">s_node<T></a> ();
<a name="l00128"></a>00128 l_prev-><a class="code" href="classs__node.html#ad71bf0bba7b638ef8772796e14b1040f">set_available</a> ();
<a name="l00129"></a>00129 l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (l_prev);
<a name="l00130"></a>00130 l_prev-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (l_prev);
<a name="l00131"></a>00131 <span class="keywordflow">if</span> (n_nodes > 1) {
<a name="l00132"></a>00132 l_next = <span class="keyword">new</span> <a class="code" href="classs__node.html">s_node<T></a> (l_prev, l_prev);
<a name="l00133"></a>00133 l_next-><a class="code" href="classs__node.html#ad71bf0bba7b638ef8772796e14b1040f">set_available</a> ();
<a name="l00134"></a>00134 l_next-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (l_prev);
<a name="l00135"></a>00135 l_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (l_prev);
<a name="l00136"></a>00136 l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (l_next);
<a name="l00137"></a>00137 l_prev-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (l_next);
<a name="l00138"></a>00138 <span class="keywordflow">if</span> (n_nodes > 2) {
<a name="l00139"></a>00139 <span class="keywordtype">size_t</span> n = n_nodes - 2;
<a name="l00140"></a>00140 <span class="keywordflow">while</span> (n-- > 0) {
<a name="l00141"></a>00141 d_current = <span class="keyword">new</span> <a class="code" href="classs__node.html">s_node<T></a> (l_prev, l_next);
<a name="l00142"></a>00142 d_current-><a class="code" href="classs__node.html#ad71bf0bba7b638ef8772796e14b1040f">set_available</a> ();
<a name="l00143"></a>00143 d_current-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (l_prev);
<a name="l00144"></a>00144 d_current-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (l_next);
<a name="l00145"></a>00145 l_prev-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> (d_current);
<a name="l00146"></a>00146 l_next-><a class="code" href="classs__node.html#acf2f3ec45ec25871a9485813f3277c8a">prev</a> (d_current);
<a name="l00147"></a>00147 l_next = d_current;
<a name="l00148"></a>00148 d_current = NULL;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 }
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 d_available = d_current = l_prev;
<a name="l00153"></a>00153 d_ioBlock = <span class="keyword">new</span> gruel::condition_variable ();
<a name="l00154"></a>00154 d_internal = <span class="keyword">new</span> gruel::mutex ();
<a name="l00155"></a>00155 };
<a name="l00156"></a>00156
<a name="l00157"></a><a class="code" href="classcircular__linked__list.html#a15bd158de560ec8314cee16062c5a737">00157</a> <a class="code" href="classcircular__linked__list.html#a15bd158de560ec8314cee16062c5a737">~circular_linked_list</a> () {
<a name="l00158"></a>00158 <a class="code" href="classcircular__linked__list.html#aace2f5222a9d5b500b94001e81ec0159">iterate_start</a> ();
<a name="l00159"></a>00159 <a class="code" href="classs__node.html">s_node_ptr</a> l_node = <a class="code" href="classcircular__linked__list.html#a873b3b21f61ac088ec8e69a413289d8c">iterate_next</a> ();
<a name="l00160"></a>00160 <span class="keywordflow">while</span> (l_node) {
<a name="l00161"></a>00161 <span class="keyword">delete</span> l_node;
<a name="l00162"></a>00162 l_node = <a class="code" href="classcircular__linked__list.html#a873b3b21f61ac088ec8e69a413289d8c">iterate_next</a> ();
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164 <span class="keyword">delete</span> d_ioBlock;
<a name="l00165"></a>00165 d_ioBlock = NULL;
<a name="l00166"></a>00166 <span class="keyword">delete</span> d_internal;
<a name="l00167"></a>00167 d_internal = NULL;
<a name="l00168"></a>00168 d_available = d_inUse = d_iterate = d_current = NULL;
<a name="l00169"></a>00169 d_n_used = d_n_nodes = 0;
<a name="l00170"></a>00170 };
<a name="l00171"></a>00171
<a name="l00172"></a><a class="code" href="classcircular__linked__list.html#a7217a832472b5bfa0425c8ad60ef1e93">00172</a> <a class="code" href="classs__node.html">s_node_ptr</a> <a class="code" href="classcircular__linked__list.html#a7217a832472b5bfa0425c8ad60ef1e93">find_next_available_node</a> () {
<a name="l00173"></a>00173 gruel::scoped_lock l (*d_internal);
<a name="l00174"></a>00174 <span class="comment">// find an available node</span>
<a name="l00175"></a>00175 <a class="code" href="classs__node.html">s_node_ptr</a> l_node = d_available;
<a name="l00176"></a>00176 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"w "</span>);
<a name="l00177"></a>00177 <span class="keywordflow">while</span> (! l_node) {
<a name="l00178"></a>00178 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"x"</span> << std::endl);
<a name="l00179"></a>00179 <span class="comment">// the ioBlock condition will automatically unlock() d_internal</span>
<a name="l00180"></a>00180 d_ioBlock->wait (l);
<a name="l00181"></a>00181 <span class="comment">// and lock() is here</span>
<a name="l00182"></a>00182 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"y"</span> << std::endl);
<a name="l00183"></a>00183 l_node = d_available;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"::f_n_a_n: #u = "</span> << <a class="code" href="classcircular__linked__list.html#a931507cc0f607c024e1e78dc277f7a60">num_used</a>()
<a name="l00186"></a>00186 << <span class="stringliteral">", node = "</span> << l_node << std::endl);
<a name="l00187"></a>00187 <span class="comment">// remove this one from the current available list</span>
<a name="l00188"></a>00188 <span class="keywordflow">if</span> (<a class="code" href="classcircular__linked__list.html#a36366dfac0c6f915123557f86ad98210">num_available</a> () == 1) {
<a name="l00189"></a>00189 <span class="comment">// last one, just set available to NULL</span>
<a name="l00190"></a>00190 d_available = NULL;
<a name="l00191"></a>00191 } <span class="keywordflow">else</span>
<a name="l00192"></a>00192 d_available = l_node-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> ();
<a name="l00193"></a>00193 l_node-><a class="code" href="classs__node.html#a4aaf8f0ea1cf81523e4d80796f1bc8ab">remove</a> ();
<a name="l00194"></a>00194 <span class="comment">// add is to the inUse list</span>
<a name="l00195"></a>00195 <span class="keywordflow">if</span> (! d_inUse)
<a name="l00196"></a>00196 d_inUse = l_node;
<a name="l00197"></a>00197 <span class="keywordflow">else</span>
<a name="l00198"></a>00198 l_node-><a class="code" href="classs__node.html#a6d608ac8cebbbd59d758811fad7a705d">insert_before</a> (d_inUse);
<a name="l00199"></a>00199 d_n_used++;
<a name="l00200"></a>00200 l_node-><a class="code" href="classs__node.html#ae78f39a138892b241295a9e7f9a470d5">set_not_available</a> ();
<a name="l00201"></a>00201 <span class="keywordflow">return</span> (l_node);
<a name="l00202"></a>00202 };
<a name="l00203"></a>00203
<a name="l00204"></a><a class="code" href="classcircular__linked__list.html#ac46c781dd6e3c9933628a55b3b35a1e5">00204</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#ac46c781dd6e3c9933628a55b3b35a1e5">make_node_available</a> (<a class="code" href="classs__node.html">s_node_ptr</a> l_node) {
<a name="l00205"></a>00205 <span class="keywordflow">if</span> (!l_node) <span class="keywordflow">return</span>;
<a name="l00206"></a>00206 gruel::scoped_lock l (*d_internal);
<a name="l00207"></a>00207 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"::m_n_a: #u = "</span> << <a class="code" href="classcircular__linked__list.html#a931507cc0f607c024e1e78dc277f7a60">num_used</a>()
<a name="l00208"></a>00208 << <span class="stringliteral">", node = "</span> << l_node << std::endl);
<a name="l00209"></a>00209 <span class="comment">// remove this node from the inUse list</span>
<a name="l00210"></a>00210 <span class="keywordflow">if</span> (<a class="code" href="classcircular__linked__list.html#a931507cc0f607c024e1e78dc277f7a60">num_used</a> () == 1) {
<a name="l00211"></a>00211 <span class="comment">// last one, just set inUse to NULL</span>
<a name="l00212"></a>00212 d_inUse = NULL;
<a name="l00213"></a>00213 } <span class="keywordflow">else</span>
<a name="l00214"></a>00214 d_inUse = l_node-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> ();
<a name="l00215"></a>00215 l_node-><a class="code" href="classs__node.html#a4aaf8f0ea1cf81523e4d80796f1bc8ab">remove</a> ();
<a name="l00216"></a>00216 <span class="comment">// add this node to the available list</span>
<a name="l00217"></a>00217 <span class="keywordflow">if</span> (! d_available)
<a name="l00218"></a>00218 d_available = l_node;
<a name="l00219"></a>00219 <span class="keywordflow">else</span>
<a name="l00220"></a>00220 l_node-><a class="code" href="classs__node.html#a6d608ac8cebbbd59d758811fad7a705d">insert_before</a> (d_available);
<a name="l00221"></a>00221 d_n_used--;
<a name="l00222"></a>00222
<a name="l00223"></a>00223 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"s"</span> << d_n_used);
<a name="l00224"></a>00224 <span class="comment">// signal the condition when new data arrives</span>
<a name="l00225"></a>00225 d_ioBlock->notify_one ();
<a name="l00226"></a>00226 <a class="code" href="circular__buffer_8h.html#aef41e8aaf4c60819b30faf396cdf4978">DEBUG</a> (std::cerr << <span class="stringliteral">"t "</span>);
<a name="l00227"></a>00227 };
<a name="l00228"></a>00228
<a name="l00229"></a><a class="code" href="classcircular__linked__list.html#aace2f5222a9d5b500b94001e81ec0159">00229</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#aace2f5222a9d5b500b94001e81ec0159">iterate_start</a> () { d_iterate = d_current; };
<a name="l00230"></a>00230
<a name="l00231"></a><a class="code" href="classcircular__linked__list.html#a873b3b21f61ac088ec8e69a413289d8c">00231</a> <a class="code" href="classs__node.html">s_node_ptr</a> <a class="code" href="classcircular__linked__list.html#a873b3b21f61ac088ec8e69a413289d8c">iterate_next</a> () {
<a name="l00232"></a>00232 <span class="preprocessor">#if 0</span>
<a name="l00233"></a>00233 <span class="preprocessor"></span><span class="comment">// lock the mutex for thread safety</span>
<a name="l00234"></a>00234 gruel::scoped_lock l (*d_internal);
<a name="l00235"></a>00235 <span class="preprocessor">#endif</span>
<a name="l00236"></a>00236 <span class="preprocessor"></span> <a class="code" href="classs__node.html">s_node_ptr</a> l_this = NULL;
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (d_iterate) {
<a name="l00238"></a>00238 l_this = d_iterate;
<a name="l00239"></a>00239 d_iterate = d_iterate-><a class="code" href="classs__node.html#aa2ae7bb98c523f2d35a3f3a6219fb6e6">next</a> ();
<a name="l00240"></a>00240 <span class="keywordflow">if</span> (d_iterate == d_current)
<a name="l00241"></a>00241 d_iterate = NULL;
<a name="l00242"></a>00242 }
<a name="l00243"></a>00243 <span class="keywordflow">return</span> (l_this);
<a name="l00244"></a>00244 };
<a name="l00245"></a>00245
<a name="l00246"></a><a class="code" href="classcircular__linked__list.html#ae05f5b91c596af7298cd3653f37a1819">00246</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> T <a class="code" href="classcircular__linked__list.html#ae05f5b91c596af7298cd3653f37a1819">object</a> () { <span class="keywordflow">return</span> (d_current->d_object); };
<a name="l00247"></a><a class="code" href="classcircular__linked__list.html#a66686696b22067ab971c4405c5eba07a">00247</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#a66686696b22067ab971c4405c5eba07a">object</a> (T l_object) { d_current->d_object = l_object; };
<a name="l00248"></a><a class="code" href="classcircular__linked__list.html#a0fb587a6d98581abe786c0d13997a33d">00248</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">size_t</span> <a class="code" href="classcircular__linked__list.html#a0fb587a6d98581abe786c0d13997a33d">num_nodes</a> () { <span class="keywordflow">return</span> (d_n_nodes); };
<a name="l00249"></a><a class="code" href="classcircular__linked__list.html#a931507cc0f607c024e1e78dc277f7a60">00249</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">size_t</span> <a class="code" href="classcircular__linked__list.html#a931507cc0f607c024e1e78dc277f7a60">num_used</a> () { <span class="keywordflow">return</span> (d_n_used); };
<a name="l00250"></a><a class="code" href="classcircular__linked__list.html#a4a60e56f5ed3f46d7a5a163f061ccf3b">00250</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#a4a60e56f5ed3f46d7a5a163f061ccf3b">num_used</a> (<span class="keywordtype">size_t</span> l_n_used) { d_n_used = l_n_used; };
<a name="l00251"></a><a class="code" href="classcircular__linked__list.html#a36366dfac0c6f915123557f86ad98210">00251</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">size_t</span> <a class="code" href="classcircular__linked__list.html#a36366dfac0c6f915123557f86ad98210">num_available</a> () { <span class="keywordflow">return</span> (d_n_nodes - d_n_used); };
<a name="l00252"></a><a class="code" href="classcircular__linked__list.html#a1146ad60360cf75a2f0ccb9cf155eefc">00252</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#a1146ad60360cf75a2f0ccb9cf155eefc">num_used_inc</a> (<span class="keywordtype">void</span>) {
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (d_n_used < d_n_nodes) ++d_n_used;
<a name="l00254"></a>00254 };
<a name="l00255"></a><a class="code" href="classcircular__linked__list.html#a16c2ec8f271a11d1e619ead67a5ff779">00255</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <a class="code" href="classcircular__linked__list.html#a16c2ec8f271a11d1e619ead67a5ff779">num_used_dec</a> (<span class="keywordtype">void</span>) {
<a name="l00256"></a>00256 <span class="keywordflow">if</span> (d_n_used != 0) --d_n_used;
<a name="l00257"></a>00257 <span class="comment">// signal the condition that new data has arrived</span>
<a name="l00258"></a>00258 d_ioBlock->notify_one ();
<a name="l00259"></a>00259 };
<a name="l00260"></a><a class="code" href="classcircular__linked__list.html#a89aa83f4cce7dce63bac75d8161c193f">00260</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">bool</span> <a class="code" href="classcircular__linked__list.html#a89aa83f4cce7dce63bac75d8161c193f">in_use</a> () { <span class="keywordflow">return</span> (d_n_used != 0); };
<a name="l00261"></a>00261 };
<a name="l00262"></a>00262
<a name="l00263"></a><a class="code" href="classs__both.html">00263</a> <span class="keyword">template</span> <<span class="keyword">class</span> T> <span class="keyword">class </span><a class="code" href="classs__both.html">s_both</a>
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 <span class="keyword">private</span>:
<a name="l00266"></a>00266 <a class="code" href="classs__node.html">s_node<T></a>* d_node;
<a name="l00267"></a>00267 <span class="keywordtype">void</span>* d_this;
<a name="l00268"></a>00268 <span class="keyword">public</span>:
<a name="l00269"></a><a class="code" href="classs__both.html#aee4f424cd523397428aff39a30aac4df">00269</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__both.html#aee4f424cd523397428aff39a30aac4df">s_both</a> (<a class="code" href="classs__node.html">s_node<T></a>* l_node, <span class="keywordtype">void</span>* l_this)
<a name="l00270"></a>00270 : d_node (l_node), d_this (l_this) {};
<a name="l00271"></a><a class="code" href="classs__both.html#a6b939d9e03d2bd426c95a6084634cc8f">00271</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__both.html#a6b939d9e03d2bd426c95a6084634cc8f">~s_both</a> () {};
<a name="l00272"></a><a class="code" href="classs__both.html#ab9720e2c280172daa9c536c8de34f4a6">00272</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <a class="code" href="classs__node.html">s_node<T></a>* <a class="code" href="classs__both.html#ab9720e2c280172daa9c536c8de34f4a6">node</a> () { <span class="keywordflow">return</span> (d_node); };
<a name="l00273"></a><a class="code" href="classs__both.html#a12266700e2cd36fa5fc127e345014d10">00273</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span>* <a class="code" href="classs__both.html#a12266700e2cd36fa5fc127e345014d10">This</a> () { <span class="keywordflow">return</span> (d_this); };
<a name="l00274"></a><a class="code" href="classs__both.html#ac50997822c5ec236770136a594278098">00274</a> <a class="code" href="circular__linked__list_8h.html#a1b7c2cc6285d73f0449071856f1f5af7">__INLINE__</a> <span class="keywordtype">void</span> <span class="keyword">set</span> (<a class="code" href="classs__node.html">s_node<T></a>* l_node, <span class="keywordtype">void</span>* l_this) {
<a name="l00275"></a>00275 d_node = l_node; d_this = l_this;};
<a name="l00276"></a>00276 };
<a name="l00277"></a>00277
<a name="l00278"></a>00278 <span class="preprocessor">#endif </span><span class="comment">/* _CIRCULAR_LINKED_LIST_H_ */</span>
</pre></div></div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Wed Dec 29 19:44:18 2010 for Universal Software Radio Peripheral by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.2
>
i586
>
media
>
contrib-backports
>
by-pkgid
>
e1990170655e25252b23301d6cebc16d
>
files
>
30
