jbuff.cpp 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500
  1. /*##############################################################################
  2. HPCC SYSTEMS software Copyright (C) 2012 HPCC Systems®.
  3. Licensed under the Apache License, Version 2.0 (the "License");
  4. you may not use this file except in compliance with the License.
  5. You may obtain a copy of the License at
  6. http://www.apache.org/licenses/LICENSE-2.0
  7. Unless required by applicable law or agreed to in writing, software
  8. distributed under the License is distributed on an "AS IS" BASIS,
  9. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. See the License for the specific language governing permissions and
  11. limitations under the License.
  12. ############################################################################## */
  13. #include "platform.h"
  14. #include <stdio.h>
  15. #include <stdlib.h>
  16. #include <stdarg.h>
  17. #include <assert.h>
  18. #include <string.h>
  19. #include <ctype.h>
  20. #include <time.h>
  21. #include <math.h>
  22. #ifndef WIN32
  23. #include <sys/mman.h>
  24. #define LARGEMEM_USE_MMAP_SIZE 0x10000 // in largemem use mmap for chunks bigger than 64K
  25. #endif
  26. #include "jbuff.hpp"
  27. #include "jexcept.hpp"
  28. #include "jmisc.hpp"
  29. #include "jutil.hpp"
  30. #include "jvmem.hpp"
  31. #ifdef _DEBUG
  32. #define KILL_CLEARS_MEMORY
  33. //#define TRACE_LARGEMEM
  34. //#define TRACE_LARGEMEM_ALLOC
  35. #define TRACE_LARGEMEM_OOM
  36. #endif
  37. #if 1
  38. #define ChunkSize 0x10000
  39. #define DOUBLE_LIMIT 0x7fffffff // avoid doubling hitting 0 and infinite loop
  40. #else
  41. #define ChunkSize 2048
  42. #define DOUBLE_LIMIT 4096
  43. #endif
  44. #define FIRST_CHUNK_SIZE 8
  45. #define DETACH_GRANULARITY 16
  46. #ifdef _DEBUG
  47. #define CHECKREADPOS(len) assertex(readPos+(len)<=length())
  48. #else
  49. #define CHECKREADPOS(len)
  50. #endif
  51. //-----------------------------------------------------------------------
  52. jlib_decl void *checked_realloc(void *orig, size_t newlen, size_t origlen,int errcode)
  53. {
  54. if (newlen==0) {
  55. free(orig);
  56. return NULL;
  57. }
  58. if (orig==NULL)
  59. return checked_malloc(newlen,errcode);
  60. void *ret = realloc(orig, newlen);
  61. if (!ret)
  62. RaiseOutOfMemException(errcode, newlen, origlen);
  63. return ret;
  64. }
  65. class jlib_thrown_decl COutOfMemException: public CInterface, implements IOutOfMemException
  66. {
  67. int errcode;
  68. size_t wanted;
  69. size_t got;
  70. static int recursion;
  71. bool expected;
  72. public:
  73. IMPLEMENT_IINTERFACE;
  74. COutOfMemException(int _errcode,size_t _wanted,size_t _got,bool _expected)
  75. {
  76. errcode = _errcode;
  77. wanted = _wanted;
  78. expected = _expected;
  79. got = _got;
  80. // DebugBreak();
  81. if ((recursion++==0)&&!expected) {
  82. // Bit risky if *very* out of memory so protect against recursion and catch exceptions
  83. try {
  84. // try to log
  85. PROGLOG("Jbuff: Out of Memory (%d,%" I64F "d,%" I64F "dk)",_errcode,(unsigned __int64)wanted,(unsigned __int64) (got/1024));
  86. PrintStackReport();
  87. PrintMemoryReport();
  88. }
  89. catch (...) {
  90. }
  91. }
  92. recursion--;
  93. };
  94. int errorCode() const { return errcode; }
  95. StringBuffer & errorMessage(StringBuffer &str) const
  96. {
  97. str.append("Jbuff: Out of Memory (").append((unsigned __int64)wanted);
  98. if (got)
  99. str.append(',').append((unsigned __int64)got);
  100. return str.append(")");
  101. }
  102. MessageAudience errorAudience() const { return MSGAUD_user; }
  103. };
  104. int COutOfMemException::recursion=0;
  105. IOutOfMemException *createOutOfMemException(int errcode,size_t wanted,size_t got,bool expected)
  106. {
  107. return new COutOfMemException(errcode,wanted,got,expected);
  108. }
  109. void RaiseOutOfMemException(int errcode, size_t wanted, size_t got,bool expected)
  110. {
  111. throw createOutOfMemException(errcode, wanted, got,expected);
  112. }
  113. MemoryAttr::MemoryAttr(size_t _len)
  114. {
  115. ptr = checked_malloc(_len,-1);
  116. len = _len;
  117. }
  118. MemoryAttr::MemoryAttr(size_t _len, const void * _ptr)
  119. {
  120. len = 0;
  121. ptr = NULL;
  122. set(_len, _ptr);
  123. }
  124. MemoryAttr::MemoryAttr(const MemoryAttr & src)
  125. {
  126. len = 0;
  127. ptr = NULL;
  128. set(src.length(), src.get());
  129. }
  130. void MemoryAttr::set(size_t _len, const void * _ptr)
  131. {
  132. memcpy(allocate(_len), _ptr, _len);
  133. }
  134. void MemoryAttr::setOwn(size_t _len, void * _ptr)
  135. {
  136. free(ptr);
  137. len = _len;
  138. ptr = _ptr;
  139. }
  140. void MemoryAttr::clear()
  141. {
  142. free(ptr);
  143. ptr = NULL;
  144. len = 0;
  145. }
  146. void * MemoryAttr::detach()
  147. {
  148. void * ret=ptr;
  149. ptr = NULL;
  150. len = 0;
  151. return ret;
  152. }
  153. int MemoryAttr::compare(const MemoryAttr & m1, const MemoryAttr & m2)
  154. {
  155. size_t len1 = m1.length();
  156. size_t len2 = m2.length();
  157. size_t len = len1;
  158. if (len1 > len2)
  159. len = len2;
  160. int compare = memcmp(m1.get(), m2.get(), len);
  161. if (compare == 0)
  162. compare = (len1 > len2) ? +1 : (len1 < len2) ? -1 : 0;
  163. return compare;
  164. }
  165. void * MemoryAttr::allocate(size_t _len)
  166. {
  167. if (_len==len)
  168. return ptr;
  169. clear();
  170. ptr = checked_malloc(_len,-2);
  171. len = _len;
  172. return ptr;
  173. }
  174. void * MemoryAttr::ensure(size_t _len)
  175. {
  176. if (_len <=len)
  177. return ptr;
  178. return reallocate(_len);
  179. }
  180. void * MemoryAttr::reallocate(size_t _len)
  181. {
  182. if (_len==len)
  183. return ptr;
  184. ptr = checked_realloc(ptr, _len, len, -9);
  185. len = _len;
  186. return ptr;
  187. }
  188. //===========================================================================
  189. void MemoryBuffer::_realloc(size32_t newLen)
  190. {
  191. if (newLen > maxLen)
  192. {
  193. assertex(ownBuffer);
  194. size32_t newMax = maxLen;
  195. //double up to a certain size, otherwise go up in chunks.
  196. if (newLen < DOUBLE_LIMIT)
  197. {
  198. if (newMax == 0)
  199. newMax = FIRST_CHUNK_SIZE;
  200. while (newLen > newMax)
  201. {
  202. newMax += newMax;
  203. }
  204. }
  205. else
  206. /*** ((Size + 1) + (ChunkSize - 1)) & ~(ChunkSize-1) ***/
  207. newMax = (newLen + ChunkSize) & ~(ChunkSize-1);
  208. buffer =(char *)checked_realloc(buffer, newMax, maxLen, -7);
  209. maxLen = newMax;
  210. }
  211. }
  212. void MemoryBuffer::_reallocExact(size32_t newLen)
  213. {
  214. if (newLen > maxLen)
  215. {
  216. assertex(ownBuffer);
  217. buffer =(char *)checked_realloc(buffer, newLen, maxLen, -8);
  218. maxLen = newLen;
  219. }
  220. }
  221. void MemoryBuffer::init()
  222. {
  223. buffer = NULL;
  224. curLen = 0;
  225. maxLen = 0;
  226. ownBuffer = true;
  227. readPos = 0;
  228. swapEndian = false;
  229. }
  230. void *MemoryBuffer::insertDirect(unsigned offset, size32_t insertLen)
  231. {
  232. assertex(offset<=curLen);
  233. unsigned newLen = insertLen + curLen;
  234. _realloc(newLen);
  235. memmove(buffer + offset + insertLen, buffer + offset, curLen - offset);
  236. curLen += insertLen;
  237. return buffer+offset;
  238. }
  239. void * MemoryBuffer::ensureCapacity(unsigned max)
  240. {
  241. if (maxLen - curLen < max)
  242. _realloc(curLen + max);
  243. return buffer + curLen;
  244. }
  245. void MemoryBuffer::kill()
  246. {
  247. if (ownBuffer)
  248. free(buffer);
  249. }
  250. MemoryBuffer & MemoryBuffer::_remove(unsigned start, unsigned len)
  251. {
  252. if (start > curLen) start = curLen;
  253. if (start + len > curLen) len = curLen - start;
  254. unsigned start2 = start + len;
  255. memmove(buffer + start, buffer + start2, curLen - start2);
  256. setLength(curLen - len);
  257. return *this;
  258. }
  259. void * MemoryBuffer::reserve(unsigned size)
  260. {
  261. _realloc(curLen + size);
  262. void * ret = buffer + curLen;
  263. curLen += size;
  264. return ret;
  265. }
  266. void * MemoryBuffer::reserveTruncate(unsigned size)
  267. {
  268. curLen += size;
  269. _reallocExact(curLen);
  270. truncate();
  271. return buffer + curLen - size;
  272. }
  273. void MemoryBuffer::truncate()
  274. {
  275. if (maxLen>curLen) {
  276. if (curLen==0) {
  277. free(buffer);
  278. buffer = NULL;
  279. }
  280. else
  281. buffer = (char *)realloc(buffer, curLen);
  282. maxLen = curLen;
  283. }
  284. }
  285. void MemoryBuffer::resetBuffer()
  286. {
  287. kill();
  288. init();
  289. }
  290. MemoryBuffer & MemoryBuffer::_reverse()
  291. {
  292. unsigned max = curLen/2;
  293. char * end = buffer + curLen;
  294. unsigned idx;
  295. for (idx = 0; idx < max; idx++)
  296. {
  297. char temp = buffer[idx];
  298. end--;
  299. buffer[idx] = *end;
  300. *end = temp;
  301. }
  302. return *this;
  303. }
  304. void MemoryBuffer::setBuffer(size_t len, void * _buffer, bool takeOwnership)
  305. {
  306. assertex((size32_t)len == len);
  307. kill();
  308. buffer = (char *) _buffer;
  309. if (len) assertex(buffer);
  310. curLen = maxLen = (size32_t)len;
  311. ownBuffer = takeOwnership;
  312. readPos = 0;
  313. }
  314. void *MemoryBuffer::detach()
  315. {
  316. void *ret;
  317. if (ownBuffer) {
  318. if (maxLen>curLen+DETACH_GRANULARITY)
  319. buffer = (char *)realloc(buffer,curLen);
  320. ret = buffer;
  321. }
  322. else {
  323. ret = memcpy(checked_malloc(curLen,-3), buffer, curLen);
  324. }
  325. init();
  326. return ret;
  327. }
  328. void *MemoryBuffer::detachOwn()
  329. {
  330. assertex(ownBuffer);
  331. void *ret = buffer;
  332. init();
  333. return ret;
  334. }
  335. void MemoryBuffer::setLength(unsigned len)
  336. {
  337. if (len > curLen)
  338. {
  339. _realloc(len);
  340. memset(buffer + curLen, 0, len-curLen);
  341. }
  342. else
  343. {
  344. #ifdef KILL_CLEARS_MEMORY
  345. if (curLen)
  346. memset(buffer + len, 'x', curLen-len);
  347. #endif
  348. }
  349. curLen = len;
  350. }
  351. void MemoryBuffer::setWritePos(unsigned len)
  352. {
  353. if (len > curLen)
  354. _realloc(len);
  355. curLen = len;
  356. }
  357. #define SWAP(x, y, t) { t t_##x = x; x = y; y = t_##x; }
  358. void MemoryBuffer::swapWith(MemoryBuffer & other)
  359. {
  360. //swap two string buffers. Used for efficiently moving a string on in a pipeline etc.
  361. SWAP(buffer, other.buffer, char *);
  362. SWAP(curLen, other.curLen, size32_t);
  363. SWAP(maxLen, other.maxLen, size32_t);
  364. SWAP(readPos, other.readPos, size32_t);
  365. SWAP(swapEndian, other.swapEndian, bool);
  366. }
  367. //-----------------------------------------------------------------------
  368. MemoryBuffer::MemoryBuffer(size_t initial)
  369. {
  370. assertex((size32_t)initial == initial);
  371. init();
  372. _realloc((size32_t)initial);
  373. }
  374. MemoryBuffer::MemoryBuffer(MemoryBuffer & value __attribute__((unused)))
  375. {
  376. assertex(!"This should never be used");
  377. }
  378. MemoryBuffer::MemoryBuffer(size_t len, const void * newBuffer)
  379. {
  380. init();
  381. assertex((size32_t)len == len);
  382. append((size32_t)len, newBuffer);
  383. }
  384. MemoryBuffer & MemoryBuffer::append(char value)
  385. {
  386. _realloc(curLen + 1);
  387. buffer[curLen] = value;
  388. ++curLen;
  389. return *this;
  390. }
  391. MemoryBuffer & MemoryBuffer::append(unsigned char value)
  392. {
  393. _realloc(curLen + 1);
  394. buffer[curLen] = value;
  395. ++curLen;
  396. return *this;
  397. }
  398. MemoryBuffer & MemoryBuffer::append(bool value)
  399. {
  400. _realloc(curLen + 1);
  401. buffer[curLen] = (value==0)?0:1;
  402. ++curLen;
  403. return *this;
  404. }
  405. MemoryBuffer & MemoryBuffer::append(const char * value)
  406. {
  407. if (value)
  408. return append((size32_t)strlen(value)+1,value);
  409. else
  410. return append((char)0);
  411. }
  412. MemoryBuffer & MemoryBuffer::append(const unsigned char * value)
  413. {
  414. return append((const char *) value);
  415. }
  416. MemoryBuffer & MemoryBuffer::append(unsigned len, const void * value)
  417. {
  418. _realloc(curLen + len);
  419. memcpy(buffer + curLen, value, len);
  420. curLen += len;
  421. return *this;
  422. }
  423. MemoryBuffer & MemoryBuffer::append(double value)
  424. {
  425. return appendEndian(sizeof(value), &value);
  426. }
  427. MemoryBuffer & MemoryBuffer::append(float value)
  428. {
  429. return appendEndian(sizeof(value), &value);
  430. }
  431. MemoryBuffer & MemoryBuffer::append(short value)
  432. {
  433. return appendEndian(sizeof(value), &value);
  434. }
  435. MemoryBuffer & MemoryBuffer::append(unsigned short value)
  436. {
  437. return appendEndian(sizeof(value), &value);
  438. }
  439. MemoryBuffer & MemoryBuffer::append(int value)
  440. {
  441. return appendEndian(sizeof(value), &value);
  442. }
  443. MemoryBuffer & MemoryBuffer::append(unsigned value)
  444. {
  445. return appendEndian(sizeof(value), &value);
  446. }
  447. #if 0
  448. MemoryBuffer & MemoryBuffer::append(long value)
  449. {
  450. return appendEndian(sizeof(value), &value);
  451. }
  452. MemoryBuffer & MemoryBuffer::append(unsigned long value)
  453. {
  454. return appendEndian(sizeof(value), &value);
  455. }
  456. #endif
  457. MemoryBuffer & MemoryBuffer::append(__int64 value)
  458. {
  459. return appendEndian(sizeof(value), &value);
  460. }
  461. MemoryBuffer & MemoryBuffer::append(unsigned __int64 value)
  462. {
  463. return appendEndian(sizeof(value), &value);
  464. }
  465. MemoryBuffer & MemoryBuffer::append(const MemoryBuffer & value)
  466. {
  467. size32_t SourceLen = value.length();
  468. _realloc(curLen + SourceLen);
  469. memcpy(buffer + curLen, value.toByteArray(), SourceLen);
  470. curLen += SourceLen;
  471. return *this;
  472. }
  473. MemoryBuffer & MemoryBuffer::appendBytes(unsigned char value, unsigned count)
  474. {
  475. _realloc(curLen + count);
  476. memset(buffer+curLen, value, count);
  477. curLen+=count;
  478. return *this;
  479. }
  480. MemoryBuffer & MemoryBuffer::appendEndian(size32_t len, const void * value)
  481. {
  482. _realloc(curLen + len);
  483. if (swapEndian)
  484. _cpyrevn(buffer + curLen, value, len);
  485. else
  486. memcpy(buffer + curLen, value, len);
  487. curLen += len;
  488. return *this;
  489. }
  490. MemoryBuffer & MemoryBuffer::appendSwap(size32_t len, const void * value)
  491. {
  492. _realloc(curLen + len);
  493. _cpyrevn(buffer + curLen, value, len);
  494. curLen += len;
  495. return *this;
  496. }
  497. MemoryBuffer &MemoryBuffer::appendFile(const char *fileName)
  498. {
  499. char buf[1024];
  500. int h = _open(fileName, _O_BINARY | _O_RDONLY | _O_SEQUENTIAL);
  501. if (h == HFILE_ERROR)
  502. throw MakeStringException(0, "MemoryBuffer: Error reading file : %s", fileName);
  503. append(fileName);
  504. unsigned fileSize = _lseek(h, 0, FILE_END);
  505. _lseek(h, 0, FILE_BEGIN);
  506. append(fileSize);
  507. int r;
  508. while ((r = _read(h, buf, 1024)) != 0)
  509. {
  510. if (-1==r) throw makeErrnoException("MemoryBuffer::appendFile");
  511. append(r, buf);
  512. }
  513. _close(h);
  514. return *this;
  515. }
  516. MemoryBuffer & MemoryBuffer::read(char & value)
  517. {
  518. CHECKREADPOS(sizeof(value));
  519. value = buffer[readPos++];
  520. return *this;
  521. }
  522. MemoryBuffer & MemoryBuffer::read(unsigned char & value)
  523. {
  524. CHECKREADPOS(sizeof(value));
  525. value = buffer[readPos++];
  526. return *this;
  527. }
  528. MemoryBuffer & MemoryBuffer::read(bool & value)
  529. {
  530. CHECKREADPOS(sizeof(value));
  531. char _value = buffer[readPos++];
  532. value = (_value==0 ? false : true);
  533. return *this;
  534. }
  535. MemoryBuffer & MemoryBuffer::read(StringAttr & value)
  536. {
  537. char * src = buffer + readPos;
  538. size32_t len = (size32_t)strlen(src);
  539. CHECKREADPOS(len+1);
  540. value.set(src, len);
  541. readPos += (len+1);
  542. return *this;
  543. }
  544. MemoryBuffer & MemoryBuffer::read(StringBuffer & value)
  545. {
  546. char * src = buffer + readPos;
  547. size32_t len = (size32_t)strlen(src);
  548. CHECKREADPOS(len+1);
  549. value.append(len, src);
  550. readPos += (len+1);
  551. return *this;
  552. }
  553. MemoryBuffer & MemoryBuffer::read(const char * &value)
  554. {
  555. value = buffer+readPos;
  556. size32_t len = (size32_t)strlen(value);
  557. CHECKREADPOS(len+1);
  558. readPos += (len+1);
  559. return *this;
  560. }
  561. MemoryBuffer & MemoryBuffer::read(size32_t len, void * value)
  562. {
  563. CHECKREADPOS(len);
  564. memcpy(value, buffer + readPos, len);
  565. readPos += len;
  566. return *this;
  567. }
  568. MemoryBuffer & MemoryBuffer::read(double & value)
  569. {
  570. return readEndian(sizeof(value), &value);
  571. }
  572. MemoryBuffer & MemoryBuffer::read(float & value)
  573. {
  574. return readEndian(sizeof(value), &value);
  575. }
  576. MemoryBuffer & MemoryBuffer::read(short & value)
  577. {
  578. return readEndian(sizeof(value), &value);
  579. }
  580. MemoryBuffer & MemoryBuffer::read(unsigned short & value)
  581. {
  582. return readEndian(sizeof(value), &value);
  583. }
  584. MemoryBuffer & MemoryBuffer::read(int & value)
  585. {
  586. return readEndian(sizeof(value), &value);
  587. }
  588. MemoryBuffer & MemoryBuffer::read(unsigned & value)
  589. {
  590. return readEndian(sizeof(value), &value);
  591. }
  592. #if 0
  593. MemoryBuffer & MemoryBuffer::read(unsigned long & value)
  594. {
  595. return readEndian(sizeof(value), &value);
  596. }
  597. MemoryBuffer & MemoryBuffer::read(long & value)
  598. {
  599. return readEndian(sizeof(value), &value);
  600. }
  601. #endif
  602. MemoryBuffer & MemoryBuffer::read(unsigned __int64 & value)
  603. {
  604. return readEndian(sizeof(value), &value);
  605. }
  606. MemoryBuffer & MemoryBuffer::read(__int64 & value)
  607. {
  608. return readEndian(sizeof(value), &value);
  609. }
  610. const byte * MemoryBuffer::readDirect(size32_t len)
  611. {
  612. CHECKREADPOS(len);
  613. const byte * ret = (const byte *)buffer + readPos;
  614. readPos += len;
  615. return ret;
  616. }
  617. MemoryBuffer & MemoryBuffer::skip(unsigned len)
  618. {
  619. CHECKREADPOS(len);
  620. readPos += len;
  621. return *this;
  622. }
  623. void MemoryBuffer::writeDirect(size32_t pos,size32_t len,const void *buf)
  624. {
  625. assertex(pos+len<=curLen); // does not extend
  626. memcpy(buffer+pos,buf,len);
  627. }
  628. void MemoryBuffer::writeEndianDirect(size32_t pos,size32_t len,const void *buf)
  629. {
  630. assertex(pos+len<=curLen); // does not extend
  631. if (swapEndian)
  632. _cpyrevn(buffer+pos,buf,len);
  633. else
  634. memcpy(buffer+pos,buf,len);
  635. }
  636. MemoryBuffer & MemoryBuffer::readEndian(size32_t len, void * value)
  637. {
  638. CHECKREADPOS(len);
  639. if (swapEndian)
  640. _cpyrevn(value, buffer + readPos, len);
  641. else
  642. memcpy(value, buffer + readPos, len);
  643. readPos += len;
  644. return *this;
  645. }
  646. MemoryBuffer & MemoryBuffer::readSwap(size32_t len, void * value)
  647. {
  648. CHECKREADPOS(len);
  649. _cpyrevn(value, buffer + readPos, len);
  650. readPos += len;
  651. return *this;
  652. }
  653. MemoryBuffer &MemoryBuffer::readFile(StringAttr &fileName)
  654. {
  655. read(fileName);
  656. unsigned fileSize;
  657. read(fileSize);
  658. int h = _open(fileName.get(), _O_WRONLY|_O_CREAT|_O_TRUNC|_O_BINARY|_O_SEQUENTIAL, _S_IREAD | _S_IWRITE);
  659. if (h == HFILE_ERROR)
  660. throw MakeStringException(0, "MemoryBuffer: Unable to create file : %s, error=%d", fileName.get(), GetLastError());
  661. CHECKREADPOS(fileSize);
  662. int w;
  663. while (fileSize) {
  664. w = _write(h, buffer+readPos, fileSize);
  665. if (w == 0) {
  666. _close(h);
  667. throw MakeStringException(0, "MemoryBuffer: Disk full writing %d to file : %s", fileSize, fileName.get());
  668. }
  669. if (w == -1)
  670. {
  671. _close(h);
  672. throw MakeStringException(0, "MemoryBuffer: Error writing to file : %s, error=%d", fileName.get(), GetLastError());
  673. }
  674. readPos += (size32_t)w;
  675. fileSize -= (size32_t)w;
  676. }
  677. _close(h);
  678. return *this;
  679. }
  680. MemoryBuffer & MemoryBuffer::rewrite(size32_t pos)
  681. {
  682. assertex(pos<=maxLen);
  683. curLen = pos;
  684. if (readPos>pos)
  685. readPos = pos;
  686. return *this;
  687. }
  688. MemoryBuffer & MemoryBuffer::reset(size32_t pos)
  689. {
  690. CHECKREADPOS(pos-readPos);
  691. readPos = pos;
  692. return *this;
  693. }
  694. #if 0
  695. void MemoryBuffer::getBytes(int srcBegin, int srcEnd, char * target)
  696. {
  697. memcpy(target, buffer + srcBegin, srcEnd - srcBegin);
  698. }
  699. MemoryBuffer & MemoryBuffer::remove(unsigned start, unsigned len)
  700. {
  701. return (MemoryBuffer &)_remove(start, len);
  702. }
  703. #endif
  704. int MemoryBuffer::setEndian(int endian)
  705. {
  706. assertex((endian == __LITTLE_ENDIAN) || (endian == __BIG_ENDIAN));
  707. bool wasSwapped = setSwapEndian(endian != __BYTE_ORDER);
  708. return wasSwapped ? (__BYTE_ORDER ^ __LITTLE_ENDIAN ^ __BIG_ENDIAN) : __BYTE_ORDER;
  709. }
  710. bool MemoryBuffer::setSwapEndian(bool swap)
  711. {
  712. bool saved = swapEndian;
  713. swapEndian = swap;
  714. return saved;
  715. }
  716. MemoryBuffer & serialize(MemoryBuffer & buffer, const MemoryAttr & value)
  717. {
  718. size32_t length = (size32_t)value.length();
  719. buffer.append(length).append(length, value.get());
  720. return buffer;
  721. }
  722. MemoryBuffer & deserialize(MemoryBuffer & buffer, MemoryAttr & value)
  723. {
  724. unsigned length;
  725. buffer.read(length);
  726. void * target = value.allocate(length);
  727. buffer.read(length, target);
  728. return buffer;
  729. }
  730. MemoryBuffer & serialize(MemoryBuffer & buffer, const char * value)
  731. {
  732. if (value)
  733. {
  734. unsigned length = (size32_t)strlen(value);
  735. buffer.append(length).append(length, value);
  736. }
  737. else
  738. buffer.append((unsigned)-1);
  739. return buffer;
  740. }
  741. MemoryBuffer & deserialize(MemoryBuffer & buffer, StringAttr & value)
  742. {
  743. unsigned length;
  744. buffer.read(length);
  745. if (length == (unsigned)-1)
  746. value.clear();
  747. else
  748. {
  749. char * target = (char *)checked_malloc(length+1,-4);
  750. buffer.read(length, target);
  751. target[length] = 0;
  752. value.setown(target);
  753. }
  754. return buffer;
  755. }
  756. // =====================================================================================================
  757. const char * MemoryAttr2IStringVal::str() const
  758. {
  759. UNIMPLEMENTED;
  760. }
  761. // =====================================================================================================
  762. static memsize_t LMsemlimit=0;
  763. static memsize_t LMtotal=0;
  764. static CriticalSection LMsemsect;
  765. static Owned<ILargeMemLimitNotify> LMnotify;
  766. static bool LMlocked = false;
  767. void setLargeMemLimitNotify(memsize_t size,ILargeMemLimitNotify *notify)
  768. {
  769. CriticalBlock block(LMsemsect);
  770. LMsemlimit = size;
  771. LMnotify.set(notify);
  772. if (LMlocked&&(LMtotal<LMsemlimit))
  773. LMlocked = false;
  774. }
  775. inline void incLargeMemTotal(memsize_t sz)
  776. {
  777. if (sz) {
  778. CriticalBlock block(LMsemsect);
  779. LMtotal += sz;
  780. #ifdef TRACE_LARGEMEM
  781. if ((LMtotal/0x100000)!=((LMtotal-sz)/0x100000))
  782. PROGLOG("LARGEMEM(+): %" I64F "d",(offset_t)LMtotal);
  783. #endif
  784. if (!LMlocked&&LMnotify.get()&&(LMtotal>=LMsemlimit)) {
  785. LMlocked = true;
  786. DBGLOG("LargeMemTotal limit exceeded: %" I64F "d",(offset_t)LMtotal);
  787. if (!LMnotify->take(LMtotal)) {
  788. LMtotal -= sz;
  789. LMlocked = false;
  790. throw createOutOfMemException(-9,sz, LMtotal);
  791. }
  792. DBGLOG("LargeMem taken");
  793. }
  794. }
  795. }
  796. inline void decLargeMemTotal(memsize_t sz)
  797. {
  798. if (sz) {
  799. CriticalBlock block(LMsemsect);
  800. LMtotal -= sz;
  801. #ifdef TRACE_LARGEMEM
  802. if ((LMtotal/0x100000)!=((LMtotal+sz)/0x100000))
  803. PROGLOG("LARGEMEM(-): %" I64F "d",(offset_t)LMtotal);
  804. #endif
  805. if (LMlocked) {
  806. if (LMtotal<LMsemlimit) {
  807. DBGLOG("LargeMemTotal limit reduced to %" I64F "d",(offset_t)LMtotal);
  808. LMlocked = false;
  809. if (LMnotify.get())
  810. LMnotify->give(LMtotal);
  811. }
  812. }
  813. }
  814. }
  815. void CLargeMemoryAllocator::allocchunkmem()
  816. {
  817. #ifdef LARGEMEM_USE_MMAP_SIZE
  818. size32_t masize = VMPAGEROUND(chunk.max);
  819. if (masize>=LARGEMEM_USE_MMAP_SIZE) { // use mmap
  820. chunk.base = (byte *) mmap(NULL,masize,PROT_READ|PROT_WRITE,MAP_PRIVATE|MAP_NORESERVE|MAP_ANONYMOUS,-1,0);
  821. if (chunk.base == (byte *)MAP_FAILED)
  822. chunk.base = NULL;
  823. #ifdef TRACE_LARGEMEM_ALLOC
  824. PROGLOG("CLargeMemoryAllocator::allocchunkmem mmaped %d at %p",masize,chunk.base);
  825. #endif
  826. return;
  827. }
  828. #endif
  829. chunk.base = (byte *)malloc(chunk.max);
  830. #ifdef TRACE_LARGEMEM_ALLOC
  831. PROGLOG("CLargeMemoryAllocator::allocchunkmem malloced %d at %p",chunk.max,chunk.base);
  832. #endif
  833. }
  834. void CLargeMemoryAllocator::disposechunkmem()
  835. {
  836. #ifdef LARGEMEM_USE_MMAP_SIZE
  837. size32_t masize = VMPAGEROUND(chunk.max);
  838. if (masize>=LARGEMEM_USE_MMAP_SIZE) { // use mmap
  839. munmap(chunk.base,masize);
  840. return;
  841. }
  842. #endif
  843. free(chunk.base);
  844. }
  845. bool CLargeMemoryAllocator::newchunk(size32_t sz,size32_t extra,bool exceptionwanted)
  846. {
  847. size32_t newchunksz = (sz>chunkmin)?sz:chunkmin;
  848. if (maxallocated()+newchunksz+extra>totalmax) {
  849. #ifdef TRACE_LARGEMEM_OOM
  850. PrintStackReport();
  851. PROGLOG("OOM.1 wanted sz=%d, extra = %d, maxallocated=%" I64F "d, newchunksz=%u, totalmax=%" I64F "d",sz,extra,(offset_t)maxallocated(),newchunksz,(offset_t)totalmax);
  852. #endif
  853. if (exceptionwanted) {
  854. throw createOutOfMemException(-5,sz, maxallocated(),true);
  855. }
  856. return false;
  857. }
  858. if (chunk.size) {
  859. Chunk *p = new Chunk;
  860. *p = chunk;
  861. chunk.prev = p;
  862. atot += chunk.size;
  863. }
  864. else if (chunk.max) {
  865. decLargeMemTotal(chunk.max);
  866. amax -= chunk.max;
  867. disposechunkmem();
  868. }
  869. chunk.max = newchunksz;
  870. allocchunkmem();
  871. chunk.size = 0;
  872. if (!chunk.base) {
  873. // restore prev
  874. if (chunk.prev) {
  875. Chunk *p = chunk.prev;
  876. chunk = *p;
  877. atot -= chunk.size;
  878. delete p;
  879. }
  880. else
  881. chunk.max = 0;
  882. #ifdef TRACE_LARGEMEM_OOM
  883. PrintStackReport();
  884. PROGLOG("OOM.2 wanted sz=%d, extra = %d, maxallocated=%" I64F "d, newchunksz=%u, totalmax=%" I64F "d",sz,extra,(offset_t)maxallocated(),newchunksz,(offset_t)totalmax);
  885. #endif
  886. if (throwexception) {
  887. throw createOutOfMemException(-6,sz, maxallocated(),true);
  888. }
  889. return false;
  890. }
  891. amax += chunk.max;
  892. incLargeMemTotal(newchunksz);
  893. return true;
  894. }
  895. void CLargeMemoryAllocator::reset()
  896. {
  897. decLargeMemTotal(maxallocated());
  898. disposechunkmem();
  899. while (chunk.prev) {
  900. Chunk *p = chunk.prev;
  901. chunk = *chunk.prev;
  902. delete p;
  903. disposechunkmem();
  904. }
  905. chunk.max = 0;
  906. chunk.base = NULL;
  907. chunk.size = 0;
  908. atot = 0;
  909. amax = 0;
  910. }
  911. void CLargeMemoryAllocator::reduceSize(memsize_t amount)
  912. {
  913. if (amount<=chunk.size) {
  914. chunk.size-=amount;
  915. return;
  916. }
  917. memsize_t reduced = 0;
  918. do {
  919. amount -= chunk.size;
  920. reduced += chunk.max;
  921. disposechunkmem();
  922. amax -= chunk.max;
  923. Chunk *p = chunk.prev;
  924. chunk = *p;
  925. atot -= chunk.size;
  926. delete p;
  927. } while (amount>chunk.size);
  928. chunk.size-=amount;
  929. decLargeMemTotal(reduced);
  930. }
  931. void CLargeMemoryAllocator::setSize(memsize_t pos)
  932. {
  933. memsize_t sz = allocated();
  934. assertex(sz>=pos);
  935. reduceSize(sz-pos);
  936. }
  937. byte *CLargeMemoryAllocator::next(memsize_t pos,size32_t &size) // this should not be used for small jumps as it is slow
  938. {
  939. memsize_t sz = allocated();
  940. if (sz<=pos) {
  941. size = 0;
  942. return NULL;
  943. }
  944. memsize_t dif = sz-pos; // how much to go back
  945. Chunk *p = &chunk;
  946. while (dif>p->size) {
  947. dif -= p->size;
  948. p = p->prev;
  949. }
  950. size = (size32_t)dif; // must be smaller than chunk
  951. return p->base+p->size-dif;
  952. }
  953. CLargeMemoryAllocator::CLargeMemoryAllocator()
  954. {
  955. // values overwritten by init
  956. throwexception = true;
  957. totalmax = 0;
  958. chunkmin = 0x1000;
  959. chunk.prev = NULL;
  960. chunk.max = 0;
  961. chunk.base = NULL;
  962. chunk.size = 0;
  963. atot = 0;
  964. amax = 0;
  965. }
  966. void CLargeMemoryAllocator::init(memsize_t _totalmax,size32_t _chunkmin,bool _throwexception)
  967. {
  968. throwexception = _throwexception;
  969. totalmax = _totalmax;
  970. chunkmin = _chunkmin;
  971. chunk.prev = NULL;
  972. chunk.max = 0;
  973. chunk.base = NULL;
  974. chunk.size = 0;
  975. atot = 0;
  976. amax = 0;
  977. }
  978. MemoryBuffer &CLargeMemoryAllocator::serialize(MemoryBuffer &mb)
  979. {
  980. memsize_t al = allocated();
  981. size32_t sz = (size32_t)al;
  982. if (sz!=al)
  983. throw MakeStringException(-1,"CLargeMemoryAllocator::serialize overflow");
  984. byte *d = (byte *)mb.reserveTruncate(sz)+sz;
  985. Chunk *p = &chunk;
  986. while (sz&&p) {
  987. size32_t s = p->size;
  988. d -= s;
  989. memcpy(d,p->base,s);
  990. p = p->prev;
  991. sz -= s;
  992. }
  993. return mb;
  994. }
  995. MemoryBuffer &CLargeMemoryAllocator::deserialize(MemoryBuffer &mb,size32_t sz, size32_t extra)
  996. {
  997. mb.read(sz,alloc(sz,extra));
  998. return mb;
  999. }
  1000. void *CLargeMemoryAllocator::nextBuffer(void *prev,size32_t &sz)
  1001. { // not fast
  1002. Chunk *p = NULL;
  1003. Chunk *n = &chunk;
  1004. while (n&&(n->base!=prev)) {
  1005. p = n;
  1006. n = n->prev;
  1007. }
  1008. if (!p) {
  1009. sz = 0;
  1010. return NULL;
  1011. }
  1012. sz = p->size;
  1013. return p->base;
  1014. }
  1015. void CJMallocLargeMemoryAllocator::allocchunkmem()
  1016. {
  1017. chunk.base = (byte *)allocator->allocMem(chunk.max);
  1018. #ifdef TRACE_LARGEMEM_ALLOC
  1019. PROGLOG("CJMallocLargeMemoryAllocator::allocchunkmem malloced %d at %p",chunk.max,chunk.base);
  1020. #endif
  1021. }
  1022. void CJMallocLargeMemoryAllocator::disposechunkmem()
  1023. {
  1024. allocator->freeMem(chunk.base);
  1025. }
  1026. CFixedSizeAllocator::CFixedSizeAllocator()
  1027. {
  1028. chunklist = NULL;
  1029. }
  1030. CFixedSizeAllocator::CFixedSizeAllocator(size32_t _allocsize,size32_t _chunksize)
  1031. {
  1032. chunklist = NULL;
  1033. init(_allocsize,_chunksize);
  1034. }
  1035. void CFixedSizeAllocator::init(size32_t _allocsize,size32_t _chunksize)
  1036. {
  1037. kill();
  1038. allocsize = _allocsize;
  1039. assertex(allocsize);
  1040. if (allocsize<sizeof(void *))
  1041. allocsize = sizeof(void *);
  1042. chunksize = _chunksize;
  1043. if (chunksize<allocsize*16)
  1044. chunksize = allocsize+sizeof(void *); // give up on sublety
  1045. }
  1046. void CFixedSizeAllocator::kill()
  1047. {
  1048. while (chunklist) {
  1049. void *p = chunklist;
  1050. chunklist = *(void **)p;
  1051. freeChunk(p);
  1052. }
  1053. freelist = NULL;
  1054. numalloc = 0;
  1055. numfree = 0;
  1056. chunklist = NULL;
  1057. }
  1058. CFixedSizeAllocator::~CFixedSizeAllocator()
  1059. {
  1060. kill();
  1061. }
  1062. void *CFixedSizeAllocator::allocChunk()
  1063. {
  1064. return checked_malloc(chunksize,-5); // don't try to be clever and allocate less (fragmentation)
  1065. }
  1066. void CFixedSizeAllocator::freeChunk(void *p)
  1067. {
  1068. free(p);
  1069. }
  1070. void *CFixedSizeAllocator::alloc()
  1071. {
  1072. NonReentrantSpinBlock block(lock);
  1073. void *ret;
  1074. if (numfree) {
  1075. numfree--;
  1076. ret = freelist;
  1077. freelist = *(void **)freelist;
  1078. }
  1079. else {
  1080. void **newchunk = (void **)allocChunk();
  1081. unsigned num = (chunksize-sizeof(void *))/allocsize;
  1082. assertex(num);
  1083. *newchunk = chunklist;
  1084. chunklist = (void *)newchunk;
  1085. newchunk++;
  1086. ret = (void *)newchunk;
  1087. numfree+=num-1;
  1088. while (--num) { // we could do this on the fly but I think this marginally better
  1089. newchunk = (void **)(((byte *)newchunk)+allocsize);
  1090. *newchunk = freelist;
  1091. freelist = (void *)newchunk;
  1092. }
  1093. }
  1094. numalloc++;
  1095. return ret;
  1096. }
  1097. void CFixedSizeAllocator::dealloc(void *blk)
  1098. {
  1099. if (blk) {
  1100. NonReentrantSpinBlock block(lock);
  1101. *(void **)blk = freelist;
  1102. freelist = blk;
  1103. numfree++;
  1104. numalloc--;
  1105. }
  1106. }
  1107. void CFixedSizeAllocator::stats(size32_t &sizealloc, size32_t &sizeunused)
  1108. {
  1109. NonReentrantSpinBlock block(lock);
  1110. sizealloc = numalloc*allocsize;
  1111. sizeunused = numfree*allocsize;
  1112. }
  1113. //============================================================
  1114. #define LARGEST_CONTIGUOUS_BLOCK (0xffff0000)
  1115. void CContiguousLargeMemoryAllocator::init(size32_t _totalmax,size32_t _chunkmin,bool _throwexception)
  1116. {
  1117. throwexception = _throwexception;
  1118. totalmax = (_totalmax<LARGEST_CONTIGUOUS_BLOCK)?VMPAGEROUND(_totalmax):LARGEST_CONTIGUOUS_BLOCK;
  1119. chunkmin = _chunkmin;
  1120. ofs = 0;
  1121. mapped = 0;
  1122. base = NULL;
  1123. #ifdef WIN32
  1124. LARGE_INTEGER li;
  1125. li.QuadPart = totalmax;
  1126. hmap = CreateFileMapping(INVALID_HANDLE_VALUE, NULL, PAGE_READWRITE|SEC_RESERVE, li.HighPart, li.LowPart, NULL);
  1127. #endif
  1128. }
  1129. CContiguousLargeMemoryAllocator::CContiguousLargeMemoryAllocator()
  1130. {
  1131. // values overwritten by init
  1132. throwexception = true;
  1133. totalmax = 0;
  1134. chunkmin = 0x1000;
  1135. ofs = 0;
  1136. mapped = 0;
  1137. base = NULL;
  1138. }
  1139. CContiguousLargeMemoryAllocator::~CContiguousLargeMemoryAllocator()
  1140. {
  1141. reset();
  1142. #ifdef WIN32
  1143. if (hmap) {
  1144. if (base)
  1145. UnmapViewOfFile(base);
  1146. CloseHandle(hmap);
  1147. }
  1148. #endif
  1149. }
  1150. void *CContiguousLargeMemoryAllocator::getBase()
  1151. {
  1152. if (!base) {
  1153. #ifdef WIN32
  1154. if (hmap)
  1155. base = (byte *) MapViewOfFile(hmap, FILE_MAP_READ|FILE_MAP_WRITE, 0, 0, totalmax);
  1156. else
  1157. base = NULL;
  1158. #else
  1159. base = (byte *) mmap(NULL,totalmax,PROT_NONE,MAP_PRIVATE|MAP_NORESERVE|MAP_ANONYMOUS,-1,0);
  1160. // create initially with no access
  1161. if (base == (byte *)MAP_FAILED)
  1162. base = NULL;
  1163. #endif
  1164. }
  1165. return base;
  1166. }
  1167. bool CContiguousLargeMemoryAllocator::map(size32_t tot,size32_t sz)
  1168. {
  1169. getBase();
  1170. if (!base||(tot>totalmax)) {
  1171. outOfMem(sz);
  1172. return false;
  1173. }
  1174. if (tot>mapped) {
  1175. void * a = base+mapped;
  1176. size32_t tomap = VMPAGEROUND(chunkmin);
  1177. #ifdef WIN32
  1178. if (VirtualAlloc(a,tomap,MEM_COMMIT,PAGE_READWRITE)!=a) {
  1179. outOfMem(sz);
  1180. return false;
  1181. }
  1182. #else
  1183. if (mprotect(a,tomap,PROT_READ|PROT_WRITE)<0) {
  1184. int err = errno;
  1185. if ((err==ENOMEM)||(err==EFAULT)) {
  1186. outOfMem(sz);
  1187. return false;
  1188. }
  1189. WARNLOG("CContiguousLargeMemoryAllocator:map madvise err=%d",err);
  1190. }
  1191. #endif
  1192. mapped = mapped+tomap;
  1193. }
  1194. return true;
  1195. }
  1196. void CContiguousLargeMemoryAllocator::unmap()
  1197. {
  1198. // ensures above ofs is unmapped
  1199. size32_t ch = VMPAGEROUND(chunkmin);
  1200. size32_t newmapped = ((ofs+ch-1)/ch)*ch;
  1201. if (newmapped<mapped) {
  1202. void * a = base+newmapped;
  1203. #ifdef WIN32
  1204. if (newmapped==0) { // free completely
  1205. if (base) {
  1206. UnmapViewOfFile(base);
  1207. base = NULL;
  1208. }
  1209. }
  1210. else {
  1211. VirtualFree(a,mapped-newmapped,MEM_DECOMMIT); // can't fail
  1212. }
  1213. #else
  1214. if (newmapped==0) { // free completely
  1215. if (base) {
  1216. munmap(base,totalmax);
  1217. base = NULL;
  1218. }
  1219. }
  1220. else {
  1221. if (mprotect(a,mapped-newmapped,PROT_NONE)<0)
  1222. WARNLOG("CContiguousLargeMemoryAllocator:unmap mprotect err=%d",errno);
  1223. // if (madvise(a,mapped-newmapped,MADV_DONTNEED)<0) // not sure if this does anything but tell it anyway
  1224. // WARNLOG("CContiguousLargeMemoryAllocator:unmap madvise err=%d",errno);
  1225. }
  1226. #endif
  1227. mapped = newmapped;
  1228. }
  1229. }
  1230. void CContiguousLargeMemoryAllocator::reset()
  1231. {
  1232. reduceSize(ofs);
  1233. }
  1234. void CContiguousLargeMemoryAllocator::setSize(size32_t pos)
  1235. {
  1236. assertex(ofs>=pos);
  1237. reduceSize(ofs-pos);
  1238. }
  1239. void CContiguousLargeMemoryAllocator::reduceSize(size32_t amount)
  1240. {
  1241. assertex(ofs>=amount);
  1242. ofs-=amount;
  1243. unmap();
  1244. }
  1245. void *CContiguousLargeMemoryAllocator::nextBuffer(void *prev,size32_t &sz)
  1246. {
  1247. // have to be careful as approaches 4GB
  1248. byte *p = prev?((byte *)prev):base;
  1249. size32_t o = p-base;
  1250. size32_t r = (o<ofs)?ofs-o:0;
  1251. sz = (r<=chunkmin)?0:(r-chunkmin);
  1252. if (sz==0)
  1253. return NULL;
  1254. if (sz>chunkmin)
  1255. sz = chunkmin;
  1256. return p+chunkmin;
  1257. }
  1258. byte *CContiguousLargeMemoryAllocator::next(size32_t pos,size32_t &size)
  1259. {
  1260. if (ofs<=pos) {
  1261. size = 0;
  1262. return NULL;
  1263. }
  1264. size = ofs-pos;
  1265. return base+pos;
  1266. }
  1267. MemoryBuffer &CContiguousLargeMemoryAllocator::serialize(MemoryBuffer &mb)
  1268. {
  1269. memcpy(mb.reserveTruncate(ofs),base,ofs);
  1270. return mb;
  1271. }
  1272. MemoryBuffer &CContiguousLargeMemoryAllocator::deserialize(MemoryBuffer &mb,size32_t sz, size32_t extra)
  1273. {
  1274. mb.read(sz,alloc(sz,extra));
  1275. return mb;
  1276. }
  1277. void CContiguousLargeMemoryAllocator::outOfMem(size32_t sz)
  1278. {
  1279. if (throwexception) {
  1280. throw createOutOfMemException(-6,sz, ofs,true);
  1281. }
  1282. }