&gt;&gt; &gt; While this is restrictive, in the way you mention, I think it&#39;s a<br>
&gt;&gt; &gt; welcome simplification<br>
&gt;&gt; &gt; ( compared to implementing a real-time-capable-linked-list + other<br>
&gt;&gt; &gt; rt-structures ),<br>
&gt;&gt; &gt; if your use-case doesn&#39;t require direct calls to the list (for any<br>
&gt;&gt; &gt; reason),<br>
&gt;&gt; &gt; then you could request insert/remove/update operations through the<br>
&gt;&gt; &gt; rt-ring-buffer.<br>
&gt;&gt;<br>
&gt;&gt; you can&#39;t perform insert/remove/update operations on a &quot;normal&quot; linked<br>
&gt;&gt; list in an RT thread.<br>
&gt;<br>
&gt; Sorry, what do you need instead? ( trying hard to absorb all this.. )<br>
<br>
<div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">either<br>
<br>
    (1) a lock free data structure<br>
    (2) perform the modifications on a copy in a non-RT context and<br>
then make the result<br>
           available to the RT context (i.e. RCU)<br>
</blockquote></div><div><br></div><div>Sounds like it will be worth learning about both. I gather the Ardour source is a good example of RCU correct? Can anyone point me at documentation or examples of a lock free data structure?</div>
<div><br></div><div>thanks</div><div>Iain</div><div><br></div>