hbuf.h 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275
  1. #ifndef HV_BUF_H_
  2. #define HV_BUF_H_
  3. /*
  4. * @功能:此头文件提供了一些常用的buffer
  5. *
  6. */
  7. #include "hdef.h" // for MAX
  8. #include "hbase.h" // for HV_ALLOC, HV_FREE
  9. typedef struct hbuf_s {
  10. char* base;
  11. size_t len;
  12. #ifdef __cplusplus
  13. hbuf_s() {
  14. base = NULL;
  15. len = 0;
  16. }
  17. hbuf_s(void* data, size_t len) {
  18. this->base = (char*)data;
  19. this->len = len;
  20. }
  21. #endif
  22. } hbuf_t;
  23. // offset_buf_t 多了一个offset偏移量成员变量,
  24. // 通常用于一次未操作完,记录下一次操作的起点
  25. typedef struct offset_buf_s {
  26. char* base;
  27. size_t len;
  28. size_t offset;
  29. #ifdef __cplusplus
  30. offset_buf_s() {
  31. base = NULL;
  32. len = offset = 0;
  33. }
  34. offset_buf_s(void* data, size_t len) {
  35. this->base = (char*)data;
  36. this->len = len;
  37. }
  38. #endif
  39. } offset_buf_t;
  40. #ifdef __cplusplus
  41. class HBuf : public hbuf_t {
  42. public:
  43. HBuf() : hbuf_t() {
  44. cleanup_ = false;
  45. }
  46. // 浅拷贝构造函数
  47. HBuf(void* data, size_t len) : hbuf_t(data, len) {
  48. cleanup_ = false;
  49. }
  50. HBuf(size_t cap) { resize(cap); }
  51. virtual ~HBuf() {
  52. cleanup();
  53. }
  54. void* data() { return base; }
  55. size_t size() { return len; }
  56. bool isNull() { return base == NULL || len == 0; }
  57. void cleanup() {
  58. if (cleanup_) {
  59. HV_FREE(base);
  60. len = 0;
  61. cleanup_ = false;
  62. }
  63. }
  64. void resize(size_t cap) {
  65. if (cap == len) return;
  66. if (base == NULL) {
  67. HV_ALLOC(base, cap);
  68. }
  69. else {
  70. base = (char*)safe_realloc(base, cap, len);
  71. }
  72. len = cap;
  73. cleanup_ = true;
  74. }
  75. // 深拷贝
  76. void copy(void* data, size_t len) {
  77. resize(len);
  78. memcpy(base, data, len);
  79. }
  80. void copy(hbuf_t* buf) {
  81. copy(buf->base, buf->len);
  82. }
  83. private:
  84. bool cleanup_; // cleanup_变量用来记录buf是浅拷贝还是深拷贝,如果是深拷贝,析构时需释放掉分配内存
  85. };
  86. // 可变长buffer类型,支持push_front/push_back/pop_front/pop_back操作
  87. // VL: Variable-Length
  88. class HVLBuf : public HBuf {
  89. public:
  90. HVLBuf() : HBuf() {_offset = _size = 0;}
  91. HVLBuf(void* data, size_t len) : HBuf(data, len) {_offset = 0; _size = len;}
  92. HVLBuf(size_t cap) : HBuf(cap) {_offset = _size = 0;}
  93. virtual ~HVLBuf() {}
  94. // 返回当前起点
  95. char* data() { return base + _offset; }
  96. // 返回有效长度
  97. size_t size() { return _size; }
  98. void push_front(void* ptr, size_t len) {
  99. // 如果插入长度超过了剩余空间,则重新分配足够空间
  100. if (len > this->len - _size) {
  101. size_t newsize = MAX(this->len, len)*2;
  102. base = (char*)safe_realloc(base, newsize, this->len);
  103. this->len = newsize;
  104. }
  105. // 如果前面空间不足,则需要先整体后移
  106. if (_offset < len) {
  107. // move => end
  108. memmove(base+this->len-_size, data(), _size);
  109. _offset = this->len-_size;
  110. }
  111. // 插入到当前起点的前面
  112. memcpy(data()-len, ptr, len);
  113. // 记录新的起点位置
  114. _offset -= len;
  115. // 有效长度增加
  116. _size += len;
  117. }
  118. void push_back(void* ptr, size_t len) {
  119. // 如果插入长度超过了剩余空间,则重新分配足够空间
  120. if (len > this->len - _size) {
  121. size_t newsize = MAX(this->len, len)*2;
  122. base = (char*)safe_realloc(base, newsize, this->len);
  123. this->len = newsize;
  124. }
  125. // 如果后面空间不足,则需要先整体前移
  126. else if (len > this->len - _offset - _size) {
  127. // move => start
  128. memmove(base, data(), _size);
  129. _offset = 0;
  130. }
  131. // 插入到后面
  132. memcpy(data()+_size, ptr, len);
  133. // 起点位置不变,有效长度增加
  134. _size += len;
  135. }
  136. void pop_front(void* ptr, size_t len) {
  137. if (len <= _size) {
  138. // 将数据从开始位置拷贝出来
  139. if (ptr) {
  140. memcpy(ptr, data(), len);
  141. }
  142. // 起点位置后移
  143. _offset += len;
  144. // 如果起点位置已经到了结尾,则重置为0
  145. if (_offset >= this->len) _offset = 0;
  146. // 有效长度减少
  147. _size -= len;
  148. }
  149. }
  150. void pop_back(void* ptr, size_t len) {
  151. if (len <= _size) {
  152. // 将数据从尾部拷贝出来
  153. if (ptr) {
  154. memcpy(ptr, data()+_size-len, len);
  155. }
  156. // 起点位置不变,有效长度减少
  157. _size -= len;
  158. }
  159. }
  160. void clear() {
  161. // 清除操作:将起点位置和有效长度重置为0
  162. _offset = _size = 0;
  163. }
  164. // 一些别名函数
  165. void prepend(void* ptr, size_t len) {
  166. push_front(ptr, len);
  167. }
  168. void append(void* ptr, size_t len) {
  169. push_back(ptr, len);
  170. }
  171. void insert(void* ptr, size_t len) {
  172. push_back(ptr, len);
  173. }
  174. void remove(size_t len) {
  175. pop_front(NULL, len);
  176. }
  177. private:
  178. size_t _offset; // _offet用来记录当前起点的偏移量
  179. size_t _size; // _size用来记录有效长度
  180. };
  181. // 环形buffer:有序从环形buffer中分配与释放内存,避免频繁调用系统调用
  182. class HRingBuf : public HBuf {
  183. public:
  184. HRingBuf() : HBuf() {_head = _tail = _size = 0;}
  185. HRingBuf(size_t cap) : HBuf(cap) {_head = _tail = _size = 0;}
  186. virtual ~HRingBuf() {}
  187. char* alloc(size_t len) {
  188. char* ret = NULL;
  189. // 如果头指针在尾指针前面或者已用长度等于0
  190. if (_head < _tail || _size == 0) {
  191. // [_tail, this->len) && [0, _head)
  192. // 如果尾指针后面剩余空间足够,则从尾指针后开始分配空间
  193. if (this->len - _tail >= len) {
  194. ret = base + _tail;
  195. _tail += len;
  196. if (_tail == this->len) _tail = 0;
  197. }
  198. // 如果头指针前面剩余空间足够,则从0开始分配空间
  199. else if (_head >= len) {
  200. ret = base;
  201. _tail = len;
  202. }
  203. }
  204. else {
  205. // [_tail, _head)
  206. // 如果尾指针到头指针间的空间足够,则从尾指针后开始分配空间
  207. if (_head - _tail >= len) {
  208. ret = base + _tail;
  209. _tail += len;
  210. }
  211. }
  212. // 分配到了空间,已用长度增加
  213. _size += ret ? len : 0;
  214. return ret;
  215. }
  216. void free(size_t len) {
  217. // 已用长度减少
  218. _size -= len;
  219. // 如果释放的长度小于头指针后面的长度,头指针后移,
  220. if (len <= this->len - _head) {
  221. _head += len;
  222. if (_head == this->len) _head = 0;
  223. }
  224. // 否则说明头指针已抵尾部,这块释放的内存是从0开始分配的,头指针置为len即可
  225. else {
  226. _head = len;
  227. }
  228. }
  229. void clear() {_head = _tail = _size = 0;}
  230. size_t size() {return _size;}
  231. private:
  232. size_t _head; // 头指针,用来记录读位置
  233. size_t _tail; // 尾指针,用来记录写位置
  234. size_t _size; // 用来记录已用长度
  235. };
  236. #endif
  237. #endif // HV_BUF_H_