Circularbuffer.cs 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  1. using System;
  2. using System.Collections.Generic;
  3. namespace Model
  4. {
  5. public class CircularBuffer
  6. {
  7. public int ChunkSize = 8192;
  8. private readonly Queue<byte[]> bufferQueue = new Queue<byte[]>();
  9. private readonly Queue<byte[]> bufferCache = new Queue<byte[]>();
  10. public int LastIndex { get; set; }
  11. public int FirstIndex { get; set; }
  12. private byte[] lastBuffer;
  13. public CircularBuffer()
  14. {
  15. this.AddLast();
  16. }
  17. public CircularBuffer(int chunkSize)
  18. {
  19. this.ChunkSize = chunkSize;
  20. this.AddLast();
  21. }
  22. public int Count
  23. {
  24. get
  25. {
  26. int c = 0;
  27. if (this.bufferQueue.Count == 0)
  28. {
  29. c = 0;
  30. }
  31. else
  32. {
  33. c = (this.bufferQueue.Count - 1) * ChunkSize + this.LastIndex - this.FirstIndex;
  34. }
  35. if (c < 0)
  36. {
  37. Log.Error("TBuffer count < 0: {0}, {1}, {2}".Fmt(this.bufferQueue.Count, this.LastIndex, this.FirstIndex));
  38. }
  39. return c;
  40. }
  41. }
  42. public void AddLast()
  43. {
  44. byte[] buffer;
  45. if (this.bufferCache.Count > 0)
  46. {
  47. buffer = this.bufferCache.Dequeue();
  48. }
  49. else
  50. {
  51. buffer = new byte[ChunkSize];
  52. }
  53. this.bufferQueue.Enqueue(buffer);
  54. this.lastBuffer = buffer;
  55. }
  56. public void RemoveFirst()
  57. {
  58. this.bufferCache.Enqueue(bufferQueue.Dequeue());
  59. }
  60. public byte[] First
  61. {
  62. get
  63. {
  64. if (this.bufferQueue.Count == 0)
  65. {
  66. this.AddLast();
  67. }
  68. return this.bufferQueue.Peek();
  69. }
  70. }
  71. public byte[] Last
  72. {
  73. get
  74. {
  75. if (this.bufferQueue.Count == 0)
  76. {
  77. this.AddLast();
  78. }
  79. return this.lastBuffer;
  80. }
  81. }
  82. public void RecvFrom(byte[] buffer, int count)
  83. {
  84. if (this.Count < count)
  85. {
  86. throw new Exception($"bufferList size < n, bufferList: {this.Count} buffer length: {buffer.Length} {count}");
  87. }
  88. int alreadyCopyCount = 0;
  89. while (alreadyCopyCount < count)
  90. {
  91. int n = count - alreadyCopyCount;
  92. if (ChunkSize - this.FirstIndex > n)
  93. {
  94. Array.Copy(this.First, this.FirstIndex, buffer, alreadyCopyCount, n);
  95. this.FirstIndex += n;
  96. alreadyCopyCount += n;
  97. }
  98. else
  99. {
  100. Array.Copy(this.First, this.FirstIndex, buffer, alreadyCopyCount, ChunkSize - this.FirstIndex);
  101. alreadyCopyCount += ChunkSize - this.FirstIndex;
  102. this.FirstIndex = 0;
  103. this.RemoveFirst();
  104. }
  105. }
  106. }
  107. public void SendTo(byte[] buffer)
  108. {
  109. int alreadyCopyCount = 0;
  110. while (alreadyCopyCount < buffer.Length)
  111. {
  112. if (this.LastIndex == ChunkSize)
  113. {
  114. this.AddLast();
  115. this.LastIndex = 0;
  116. }
  117. int n = buffer.Length - alreadyCopyCount;
  118. if (ChunkSize - this.LastIndex > n)
  119. {
  120. Array.Copy(buffer, alreadyCopyCount, this.lastBuffer, this.LastIndex, n);
  121. this.LastIndex += buffer.Length - alreadyCopyCount;
  122. alreadyCopyCount += n;
  123. }
  124. else
  125. {
  126. Array.Copy(buffer, alreadyCopyCount, this.lastBuffer, this.LastIndex, ChunkSize - this.LastIndex);
  127. alreadyCopyCount += ChunkSize - this.LastIndex;
  128. this.LastIndex = ChunkSize;
  129. }
  130. }
  131. }
  132. public void SendTo(byte[] buffer, int offset, int count)
  133. {
  134. int alreadyCopyCount = 0;
  135. while (alreadyCopyCount < count)
  136. {
  137. if (this.LastIndex == ChunkSize)
  138. {
  139. this.AddLast();
  140. this.LastIndex = 0;
  141. }
  142. int n = count - alreadyCopyCount;
  143. if (ChunkSize - this.LastIndex > n)
  144. {
  145. Array.Copy(buffer, alreadyCopyCount + offset, this.lastBuffer, this.LastIndex, n);
  146. this.LastIndex += count - alreadyCopyCount;
  147. alreadyCopyCount += n;
  148. }
  149. else
  150. {
  151. Array.Copy(buffer, alreadyCopyCount + offset, this.lastBuffer, this.LastIndex, ChunkSize - this.LastIndex);
  152. alreadyCopyCount += ChunkSize - this.LastIndex;
  153. this.LastIndex = ChunkSize;
  154. }
  155. }
  156. }
  157. }
  158. }