elastic_buffer.cc 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321
  1. /*
  2. * =====================================================================================
  3. *
  4. * Filename: elastic_buffer.cc
  5. *
  6. * Description: elastic buffer for replication between slave and master
  7. *
  8. * Version: 1.0
  9. * Created: 09/08/2020 10:02:05 PM
  10. * Revision: none
  11. * Compiler: gcc
  12. *
  13. * Author: Norton, yangshuang68@jd.com
  14. * Company: JD.com, Inc.
  15. *
  16. * =====================================================================================
  17. */
  18. #include "elastic_buffer.h"
  19. #include "log.h"
  20. #include <string.h>
  21. #include <assert.h>
  22. ElasticBuffer::~ElasticBuffer()
  23. {
  24. while (mHeadBuffer)
  25. {
  26. mWritingBuffer = mHeadBuffer;
  27. mHeadBuffer = mHeadBuffer->sNext;
  28. delete mWritingBuffer;
  29. }
  30. }
  31. int ElasticBuffer::appendStrValue(const std::string& value)
  32. {
  33. // encode value datalen, now use fixed int
  34. int dataLen = sizeof(int);
  35. char* writePos = getWritingPos(dataLen, true);
  36. if (!writePos) return -1;
  37. dataLen = value.length();
  38. *(int*)writePos = dataLen;
  39. writePos = drawingWritingPos(sizeof(int));
  40. writePos = getWritingPos(dataLen);
  41. if (!writePos) return -1;
  42. int curLen;
  43. while (dataLen > 0)
  44. {
  45. curLen = BUFFER_SIZE - mWritingBuffer->sDataLen;
  46. curLen = curLen > dataLen ? dataLen : curLen;
  47. memcpy((void*)writePos, (void*)value.data(), curLen);
  48. drawingWritingPos(curLen);
  49. dataLen -= curLen;
  50. }
  51. return 0;
  52. }
  53. int ElasticBuffer::getStrValue(std::string& value)
  54. {
  55. value.clear();
  56. bool bRet = [this]()->bool {
  57. // check whether has enough reading space
  58. return (NULL == mReadingBuffer->sNext && mReadLen == mReadingBuffer->sDataLen);
  59. }();
  60. if (bRet) return 1;
  61. // need to handle atomic value split in the tail of buffer --- TCP sticky packet
  62. int ret, dataLen;
  63. char* rPos = getReadingPos();
  64. if (mReadLen + sizeof(int) > BUFFER_SIZE)
  65. {
  66. // skip to the next buffer
  67. rPos = drawingReadingPos(BUFFER_SIZE - mReadLen);
  68. }
  69. dataLen = *(int*)rPos;
  70. assert(dataLen >= 0);
  71. rPos = drawingReadingPos(sizeof(int));
  72. // if (unlikely(0 == dataLen))
  73. if (0 == dataLen)
  74. {
  75. value = "";
  76. }
  77. else
  78. {
  79. // assign string value
  80. ret = assignStrValue(value, dataLen);
  81. // assert(ret > 0);
  82. }
  83. drawingReadingPos(dataLen);
  84. return 0;
  85. }
  86. // make sure enough space for store 'dataLen' raw contents after the following
  87. // write
  88. char* ElasticBuffer::getWritingPos(int dataLen, bool atomicLen)
  89. {
  90. int ret = expandElasticBuffer(dataLen);
  91. if (ret < 0) return NULL;
  92. // if the remaining space is not enough for storing the atomic value,
  93. // skip to the next buffer
  94. if (atomicLen && mWritingBuffer->sDataLen + dataLen > BUFFER_SIZE)
  95. {
  96. mWritingBuffer = mWritingBuffer->sNext;
  97. }
  98. return mWritingBuffer->sData + mWritingBuffer->sDataLen;
  99. }
  100. char* ElasticBuffer::drawingWritingPos(int dataLen)
  101. {
  102. int skipLen = mWritingBuffer->sDataLen + dataLen;
  103. while (skipLen >= BUFFER_SIZE)
  104. {
  105. assert(mWritingBuffer);
  106. skipLen -= BUFFER_SIZE;
  107. mWritingBuffer = mWritingBuffer->sNext;
  108. }
  109. if (!mWritingBuffer) return NULL;
  110. mWritingBuffer->sDataLen = skipLen;
  111. return mWritingBuffer->sData + mWritingBuffer->sDataLen;
  112. }
  113. char* ElasticBuffer::drawingReadingPos(int dataLen)
  114. {
  115. mReadLen += dataLen;
  116. if (mReadLen < BUFFER_SIZE) return mReadingBuffer->sData + mReadLen;
  117. while (mReadLen >= BUFFER_SIZE)
  118. {
  119. assert(mReadingBuffer);
  120. mReadLen -= BUFFER_SIZE;
  121. mReadingBuffer = mReadingBuffer->sNext;
  122. }
  123. return mReadingBuffer ? mReadingBuffer->sData + mReadLen : NULL;
  124. }
  125. // for binary stream copy
  126. int ElasticBuffer::assignStrValue(
  127. std::string& value,
  128. int dataLen)
  129. {
  130. // assign length of memory from reading pos
  131. int readLen = mReadLen;
  132. int skipLen = mReadLen + dataLen;
  133. char* readPos = getReadingPos();
  134. if (skipLen <= BUFFER_SIZE)
  135. {
  136. value.append((const char*)readPos, dataLen);
  137. return 0;
  138. }
  139. Buffer_t* curBuffer = mReadingBuffer;
  140. while (skipLen > BUFFER_SIZE)
  141. {
  142. assert(readPos);
  143. value.append((const char*)readPos, BUFFER_SIZE - readLen);
  144. readLen = 0;
  145. skipLen -= BUFFER_SIZE;
  146. curBuffer = nextBuffer(curBuffer);
  147. readPos = curBuffer ? curBuffer->sData : NULL;
  148. }
  149. assert(readPos);
  150. value.append((const char*)readPos, skipLen);
  151. return 0;
  152. }
  153. int ElasticBuffer::expandElasticBuffer(int dataLen)
  154. {
  155. // has enough remaining space
  156. if (mWritingBuffer && BUFFER_SIZE - mWritingBuffer->sDataLen >= dataLen) return 0;
  157. // if the single key is too large, just report error
  158. if (dataLen > BUFFER_SIZE)
  159. {
  160. log_error("too large size for one key, dataLen:%d", dataLen);
  161. }
  162. Buffer_t* curBuffer = mWritingBuffer;
  163. int totalLen = (curBuffer ? curBuffer->sDataLen : 0) + dataLen;
  164. while (totalLen > BUFFER_SIZE || !mHeadBuffer)
  165. {
  166. Buffer_t * nBuffer = []() ->Buffer_t* {
  167. Buffer_t * newBuffer = new Buffer_t();
  168. if (!newBuffer) return NULL;
  169. newBuffer->sDataLen = 0;
  170. newBuffer->sNext = NULL;
  171. newBuffer->sData = new char[BUFFER_SIZE];
  172. return newBuffer;
  173. }();
  174. if (!nBuffer || !nBuffer->sData)
  175. {
  176. log_error("create buffer unit failed, errno:%d", errno);
  177. return -1;
  178. }
  179. mCacheBufferNum++;
  180. // if (unlikely(!mHeadBuffer))
  181. if (!mHeadBuffer)
  182. {
  183. mHeadBuffer = mReadingBuffer = mWritingBuffer = nBuffer;
  184. }
  185. else
  186. {
  187. curBuffer->sNext = nBuffer;
  188. }
  189. curBuffer = nBuffer;
  190. totalLen -= BUFFER_SIZE;
  191. }
  192. return 0;
  193. }
  194. char* ElasticBuffer::encodeLength(char *p, uint32_t len)
  195. {
  196. if(len < 240)
  197. {
  198. p[0] = len;
  199. return p+1;
  200. }
  201. else if(len < (13<<8))
  202. {
  203. p[0] = 0xF0 + (len>>8);
  204. p[1] = len & 0xFF;
  205. return p+2;
  206. }
  207. else if(len < (1<<16))
  208. {
  209. p[0] = 253;
  210. p[1] = len >> 8;
  211. p[2] = len & 0xFF;
  212. return p+3;
  213. }
  214. else if(len < (1<<24))
  215. {
  216. p[0] = 254;
  217. p[1] = len >> 16;
  218. p[2] = len >> 8;
  219. p[3] = len & 0xFF;
  220. return p+4;
  221. }
  222. else
  223. {
  224. p[0] = 255;
  225. p[1] = len >> 24;
  226. p[2] = len >> 16;
  227. p[3] = len >> 8;
  228. p[4] = len & 0xFF;
  229. return p+5;
  230. }
  231. return 0;
  232. }
  233. int ElasticBuffer::decodeLength(
  234. char* &cur,
  235. int pLen,
  236. uint32_t &len)
  237. {
  238. int ret = -1;
  239. len = *cur++;
  240. pLen--;
  241. if (len < 240)
  242. {
  243. }
  244. else if(len <= 252)
  245. {
  246. if(!cur) goto ReportError;
  247. len = ((len & 0xF)<<8) + *cur++;
  248. pLen--;
  249. }
  250. else if(len == 253)
  251. {
  252. if (pLen < 2) goto ReportError;
  253. len = (cur[0]<<8) + cur[1];
  254. cur += 2;
  255. pLen -= 2;
  256. }
  257. else if(len == 254)
  258. {
  259. if (pLen < 3) goto ReportError;
  260. len = (cur[0]<<16) + (cur[1]<<8) + cur[2];
  261. cur += 3;
  262. pLen -= 3;
  263. }
  264. else
  265. {
  266. if (pLen < 4) goto ReportError;
  267. len = (cur[0]<<24) + (cur[1]<<16) + (cur[2]<<8) + cur[3];
  268. cur += 4;
  269. pLen -= 4;
  270. if (len > (64<<20))
  271. {
  272. log_error("too large packet, len:%d", len);
  273. return -1;
  274. }
  275. }
  276. ret = 0;
  277. if (ret != 0)
  278. {
  279. ReportError:
  280. log_error("invalid data len when decode!");
  281. }
  282. return ret;
  283. }