<div dir="ltr">Hi,<div><br></div><div>With Dr. Butterfield's help, I've made the changes to implement the FIFO Queue using chain. I am not accustomed to coding for embedded systems, so I am not completely sure if I should be using <a href="https://richidubey.github.io/Strong-APA-Documentation/html/schedulerstrongapa_8c_source.html#l00179">malloc</a> or not. </div><div><br></div><div>Someone, please review the following changes:</div><div><br></div><div>FIFO Implementaion and Queue traversal: <a href="https://richidubey.github.io/Strong-APA-Documentation/html/schedulerstrongapa_8c_source.html#l00159">https://richidubey.github.io/Strong-APA-Documentation/html/schedulerstrongapa_8c_source.html#l00159</a><br></div><div><br></div><div>The structure I have defined to be used with Chain_Control: <a href="https://richidubey.github.io/Strong-APA-Documentation/html/structCPU.html">https://richidubey.github.io/Strong-APA-Documentation/html/structCPU.html</a></div><div><br></div><div>Thank you,</div><div>Richi.<br></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Fri, Jul 24, 2020 at 11:28 AM Richi Dubey <<a href="mailto:richidubey@gmail.com">richidubey@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr">Hi Andrew,<div><br></div><div>Your suggestion helps and I am going to work on it today. Thank you.</div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Thu, Jul 23, 2020 at 8:14 PM Andrew Butterfield <<a href="mailto:Andrew.Butterfield@cs.tcd.ie" target="_blank">Andrew.Butterfield@cs.tcd.ie</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div>Hi Richi,<div><br></div><div> a quick answer to 1 below<br><div><br><blockquote type="cite"><div>On 23 Jul 2020, at 15:20, Richi Dubey <<a href="mailto:richidubey@gmail.com" target="_blank">richidubey@gmail.com</a>> wrote:</div><div><div dir="ltr"><div>1)Both the algorithms require the use of a FIFO Queue to support the insert and dequeue operations.</div><div><br></div><div>I believe we can use chains and use the chain_append() and combination of _Chain_Extract  and _Chain_First or just _Chain_First and node->next to achieve the FIFO requirements. </div></div></div></blockquote><div><br></div><div><br></div>You might want to look at chain_get() - it removes the first element, so does a FIFO protocol in tandem with chain_append()</div><div><br></div><div>Regards,</div><div>  Andrew</div><div><br><blockquote type="cite"><div><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">
</blockquote></div>
_______________________________________________<br>devel mailing list<br><a href="mailto:devel@rtems.org" target="_blank">devel@rtems.org</a><br><a href="http://lists.rtems.org/mailman/listinfo/devel" target="_blank">http://lists.rtems.org/mailman/listinfo/devel</a></div></blockquote></div><br><div>
<div dir="auto" style="color:rgb(0,0,0);letter-spacing:normal;text-align:start;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;text-decoration:none">--------------------------------------------------------------------<br>Andrew Butterfield     Tel: +353-1-896-2517     Fax: +353-1-677-2204<br>Lero@TCD, Head of Software Foundations & Verification Research Group<br>School of Computer Science and Statistics,<br>Room G.39, O'Reilly Institute, Trinity College, University of Dublin<br>                         <a href="http://www.scss.tcd.ie/Andrew.Butterfield/" target="_blank">http://www.scss.tcd.ie/Andrew.Butterfield/</a><br>--------------------------------------------------------------------</div>
</div>
<br></div></div></blockquote></div>
</blockquote></div>