BlockingQueue.cs 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. /*
  2. * Copyright (c) Contributors, http://opensimulator.org/
  3. * See CONTRIBUTORS.TXT for a full list of copyright holders.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. * * Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * * Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. * * Neither the name of the OpenSimulator Project nor the
  13. * names of its contributors may be used to endorse or promote products
  14. * derived from this software without specific prior written permission.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE DEVELOPERS ``AS IS'' AND ANY
  17. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  18. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19. * DISCLAIMED. IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY
  20. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  21. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  22. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  23. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  24. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  25. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. using System.Collections.Generic;
  28. using System.Threading;
  29. namespace OpenSim.Framework
  30. {
  31. public class BlockingQueue<T>
  32. {
  33. private readonly Queue<T> m_pqueue = new Queue<T>();
  34. private readonly Queue<T> m_queue = new Queue<T>();
  35. private readonly object m_queueSync = new object();
  36. public void PriorityEnqueue(T value)
  37. {
  38. lock (m_queueSync)
  39. {
  40. m_pqueue.Enqueue(value);
  41. Monitor.Pulse(m_queueSync);
  42. }
  43. }
  44. public void Enqueue(T value)
  45. {
  46. lock (m_queueSync)
  47. {
  48. m_queue.Enqueue(value);
  49. Monitor.Pulse(m_queueSync);
  50. }
  51. }
  52. public T Dequeue()
  53. {
  54. lock (m_queueSync)
  55. {
  56. while (m_queue.Count < 1 && m_pqueue.Count < 1)
  57. {
  58. Monitor.Wait(m_queueSync);
  59. }
  60. if (m_pqueue.Count > 0)
  61. return m_pqueue.Dequeue();
  62. if (m_queue.Count > 0)
  63. return m_queue.Dequeue();
  64. return default(T);
  65. }
  66. }
  67. public T Dequeue(int msTimeout)
  68. {
  69. lock (m_queueSync)
  70. {
  71. if (m_queue.Count < 1 && m_pqueue.Count < 1)
  72. {
  73. if(!Monitor.Wait(m_queueSync, msTimeout))
  74. return default(T);
  75. }
  76. if (m_pqueue.Count > 0)
  77. return m_pqueue.Dequeue();
  78. if (m_queue.Count > 0)
  79. return m_queue.Dequeue();
  80. return default(T);
  81. }
  82. }
  83. /// <summary>
  84. /// Indicate whether this queue contains the given item.
  85. /// </summary>
  86. /// <remarks>
  87. /// This method is not thread-safe. Do not rely on the result without consistent external locking.
  88. /// </remarks>
  89. public bool Contains(T item)
  90. {
  91. lock (m_queueSync)
  92. {
  93. if (m_queue.Count < 1 && m_pqueue.Count < 1)
  94. return false;
  95. if (m_pqueue.Contains(item))
  96. return true;
  97. return m_queue.Contains(item);
  98. }
  99. }
  100. /// <summary>
  101. /// Return a count of the number of requests on this queue.
  102. /// </summary>
  103. public int Count()
  104. {
  105. lock (m_queueSync)
  106. return m_queue.Count + m_pqueue.Count;
  107. }
  108. /// <summary>
  109. /// Return the array of items on this queue.
  110. /// </summary>
  111. /// <remarks>
  112. /// This method is not thread-safe. Do not rely on the result without consistent external locking.
  113. /// </remarks>
  114. public T[] GetQueueArray()
  115. {
  116. lock (m_queueSync)
  117. {
  118. if (m_queue.Count < 1 && m_pqueue.Count < 1)
  119. return new T[0];
  120. return m_queue.ToArray();
  121. }
  122. }
  123. public void Clear()
  124. {
  125. lock (m_queueSync)
  126. {
  127. m_pqueue.Clear();
  128. m_queue.Clear();
  129. Monitor.Pulse(m_queueSync);
  130. }
  131. }
  132. }
  133. }