jstring.cpp 52 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173
  1. /*##############################################################################
  2. Copyright (C) 2011 HPCC Systems.
  3. All rights reserved. This program is free software: you can redistribute it and/or modify
  4. it under the terms of the GNU Affero General Public License as
  5. published by the Free Software Foundation, either version 3 of the
  6. License, or (at your option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU Affero General Public License for more details.
  11. You should have received a copy of the GNU Affero General Public License
  12. along with this program. If not, see <http://www.gnu.org/licenses/>.
  13. ############################################################################## */
  14. #include "platform.h"
  15. #include <stdio.h>
  16. #include <stdlib.h>
  17. #include <stdarg.h>
  18. #include <assert.h>
  19. #include <string.h>
  20. #include <ctype.h>
  21. #include <time.h>
  22. #include <math.h>
  23. #include "jstring.hpp"
  24. #include "jexcept.hpp"
  25. #include "jhash.hpp"
  26. #include "jlog.hpp"
  27. #include "jfile.hpp"
  28. #include "jdebug.hpp"
  29. #include "jutil.hpp"
  30. #define DOUBLE_FORMAT "%.16g"
  31. #define FLOAT_FORMAT "%.7g"
  32. #ifndef va_copy
  33. /* WARNING - DANGER - ASSUMES TYPICAL STACK MACHINE */
  34. #define va_copy(dst, src) ((void)((dst) = (src)))
  35. #endif
  36. static const char * TheNullStr = "";
  37. #define FIRST_CHUNK_SIZE 8
  38. #define DOUBLE_LIMIT 0x100000 // must be a power of 2
  39. #define DETACH_GRANULARITY 16
  40. //===========================================================================
  41. StringBuffer::StringBuffer()
  42. {
  43. init();
  44. }
  45. #if 0
  46. StringBuffer::StringBuffer(int initial)
  47. {
  48. init();
  49. ensureCapacity(initial);
  50. }
  51. #endif
  52. StringBuffer::StringBuffer(String & value)
  53. {
  54. init();
  55. append(value);
  56. }
  57. StringBuffer::StringBuffer(const char *value)
  58. {
  59. init();
  60. append(value);
  61. }
  62. StringBuffer::StringBuffer(unsigned len, const char *value)
  63. {
  64. init();
  65. append(len, value);
  66. }
  67. StringBuffer::StringBuffer(const StringBuffer & value)
  68. {
  69. init();
  70. append(value);
  71. }
  72. void StringBuffer::setBuffer(size32_t buffLen, char * newBuff, size32_t strLen)
  73. {
  74. assertex(buffLen>0 && newBuff!=NULL && strLen<buffLen);
  75. if (buffer)
  76. free(buffer);
  77. buffer = newBuff;
  78. maxLen=buffLen;
  79. curLen=strLen;
  80. }
  81. void StringBuffer::_realloc(size32_t newLen)
  82. {
  83. if (newLen >= maxLen)
  84. {
  85. size32_t newMax = maxLen;
  86. if (newMax == 0)
  87. newMax = FIRST_CHUNK_SIZE;
  88. if (newLen > DOUBLE_LIMIT)
  89. {
  90. newMax = (newLen + DOUBLE_LIMIT) & ~(DOUBLE_LIMIT-1);
  91. if (newLen >= newMax)
  92. throw MakeStringException(MSGAUD_operator, -1, "StringBuffer::_realloc: Request for %d bytes oldMax = %d", newLen, maxLen);
  93. }
  94. else
  95. {
  96. while (newLen >= newMax)
  97. newMax += newMax;
  98. }
  99. char * newStr;
  100. if(!newMax || !(newStr=(char *)realloc(buffer, newMax)))
  101. {
  102. DBGLOG("StringBuffer::_realloc: Failed to realloc = %d, oldMax = %d", newMax, maxLen);
  103. PrintStackReport();
  104. PrintMemoryReport();
  105. throw MakeStringException(MSGAUD_operator, -1, "StringBuffer::_realloc: Failed to realloc = %d, oldMax = %d", newMax, maxLen);
  106. }
  107. buffer = newStr;
  108. maxLen = newMax;
  109. }
  110. }
  111. char * StringBuffer::detach()
  112. {
  113. if (buffer)
  114. {
  115. if (maxLen>curLen+1+DETACH_GRANULARITY)
  116. buffer = (char *)realloc(buffer,curLen+1); // shrink
  117. buffer[curLen] = '\0'; // There is always room for this null
  118. char *ret = buffer;
  119. init();
  120. return ret;
  121. }
  122. return strdup(TheNullStr);
  123. }
  124. StringBuffer & StringBuffer::append(char value)
  125. {
  126. ensureCapacity(1);
  127. buffer[curLen] = value;
  128. ++curLen;
  129. return *this;
  130. }
  131. StringBuffer & StringBuffer::append(unsigned char value)
  132. {
  133. ensureCapacity(1);
  134. buffer[curLen] = value;
  135. ++curLen;
  136. return *this;
  137. }
  138. StringBuffer & StringBuffer::append(const char * value)
  139. {
  140. if (value)
  141. {
  142. size32_t SourceLen = (size32_t)::strlen(value);
  143. ensureCapacity(SourceLen);
  144. memcpy(buffer + curLen, value, SourceLen);
  145. curLen += SourceLen;
  146. }
  147. return *this;
  148. }
  149. StringBuffer & StringBuffer::append(unsigned len, const char * value)
  150. {
  151. if (len)
  152. {
  153. ensureCapacity(len);
  154. memcpy(buffer + curLen, value, len);
  155. curLen += len;
  156. }
  157. return *this;
  158. }
  159. StringBuffer & StringBuffer::append(const unsigned char * value)
  160. {
  161. return append((const char *) value);
  162. }
  163. StringBuffer & StringBuffer::append(const char * value, int offset, int len)
  164. {
  165. ensureCapacity(len);
  166. memcpy(buffer + curLen, value+offset, len);
  167. curLen += len;
  168. return *this;
  169. }
  170. StringBuffer & StringBuffer::append(const IAtom * value)
  171. {
  172. if (value)
  173. append(value->getAtomNamePtr());
  174. return *this;
  175. }
  176. StringBuffer & StringBuffer::append(double value)
  177. {
  178. int len = length();
  179. int newlen = appendf(DOUBLE_FORMAT, value).length();
  180. while (len < newlen)
  181. {
  182. switch (charAt(len))
  183. {
  184. case '.':
  185. case 'E':
  186. case 'e':
  187. return *this;
  188. }
  189. len++;
  190. }
  191. return append(".0");
  192. }
  193. StringBuffer & StringBuffer::append(float value)
  194. {
  195. int len = length();
  196. int newlen = appendf(FLOAT_FORMAT, value).length();
  197. while (len < newlen)
  198. {
  199. switch (charAt(len))
  200. {
  201. case '.':
  202. case 'E':
  203. case 'e':
  204. return *this;
  205. }
  206. len++;
  207. }
  208. return append(".0");
  209. }
  210. StringBuffer & StringBuffer::append(int value)
  211. {
  212. char temp[12];
  213. unsigned written = numtostr(temp, value);
  214. return append(written, temp);
  215. }
  216. StringBuffer & StringBuffer::append(unsigned value)
  217. {
  218. char temp[12];
  219. unsigned written = numtostr(temp, value);
  220. return append(written, temp);
  221. }
  222. StringBuffer & StringBuffer::appendlong(long value)
  223. {
  224. char temp[24];
  225. unsigned written = numtostr(temp, value);
  226. return append(written, temp);
  227. }
  228. StringBuffer & StringBuffer::appendulong(unsigned long value)
  229. {
  230. char temp[24];
  231. unsigned written = numtostr(temp, value);
  232. return append(written, temp);
  233. }
  234. StringBuffer & StringBuffer::append(__int64 value)
  235. {
  236. char temp[24];
  237. unsigned written = numtostr(temp, value);
  238. return append(written, temp);
  239. }
  240. StringBuffer & StringBuffer::append(unsigned __int64 value)
  241. {
  242. char temp[24];
  243. unsigned written = numtostr(temp, value);
  244. return append(written, temp);
  245. }
  246. StringBuffer & StringBuffer::append(const String & value)
  247. {
  248. size32_t SourceLen = value.length();
  249. ensureCapacity(SourceLen);
  250. value.getChars(0, SourceLen, buffer, curLen);
  251. curLen += SourceLen;
  252. return *this;
  253. }
  254. StringBuffer & StringBuffer::append(const IStringVal & value)
  255. {
  256. return append(value.str());
  257. }
  258. StringBuffer & StringBuffer::append(const IStringVal * value)
  259. {
  260. if (value)
  261. return append(value->str());
  262. else
  263. return *this;
  264. }
  265. StringBuffer & StringBuffer::append(const StringBuffer & value)
  266. {
  267. size32_t SourceLen = value.length();
  268. ensureCapacity(SourceLen);
  269. value.getChars(0, SourceLen, buffer + curLen);
  270. curLen += SourceLen;
  271. return *this;
  272. }
  273. StringBuffer & StringBuffer::appendf(const char *format, ...)
  274. {
  275. va_list args;
  276. va_start(args, format);
  277. valist_appendf(format, args);
  278. va_end(args);
  279. return *this;
  280. }
  281. StringBuffer & StringBuffer::appendLower(unsigned len, const char * value)
  282. {
  283. if (len)
  284. {
  285. ensureCapacity(len);
  286. const byte * from = reinterpret_cast<const byte *>(value);
  287. for (unsigned i = 0; i < len; i++)
  288. buffer[curLen + i] = tolower(from[i]);
  289. curLen += len;
  290. }
  291. return *this;
  292. }
  293. StringBuffer & StringBuffer::setf(const char *format, ...)
  294. {
  295. clear();
  296. va_list args;
  297. va_start(args, format);
  298. valist_appendf(format, args);
  299. va_end(args);
  300. return *this;
  301. }
  302. StringBuffer & StringBuffer::limited_valist_appendf(unsigned szLimit, const char *format, va_list args)
  303. {
  304. #define BUF_SIZE 1024
  305. #define MAX_BUF_SIZE (1024*1024) // limit buffer size to 1MB when doubling
  306. // handle string that is bigger that BUF_SIZE bytes
  307. unsigned size = (0 == szLimit||szLimit>BUF_SIZE)?BUF_SIZE:szLimit;
  308. int len;
  309. va_list args2;
  310. va_copy(args2, args);
  311. try { ensureCapacity(size); }
  312. catch (IException *e)
  313. {
  314. StringBuffer eMsg;
  315. IException *e2 = MakeStringException(-1, "StringBuffer::valist_appendf(\"%s\"): vsnprintf failed or result exceeds limit (%d): %s", format, size, e->errorMessage(eMsg).str());
  316. e->Release();
  317. throw e2;
  318. }
  319. len = _vsnprintf(buffer+curLen,size,format,args);
  320. if (len >= 0)
  321. {
  322. if ((unsigned)len >= size)
  323. {
  324. if (szLimit && (unsigned)len >= szLimit)
  325. {
  326. if ((unsigned)len>szLimit)
  327. {
  328. len = size;
  329. if (len>3) memcpy(buffer+len-3, "...", 3);
  330. }
  331. }
  332. else
  333. {
  334. ensureCapacity(len);
  335. // no need for _vsnprintf since the buffer is already made big enough
  336. vsprintf(buffer+curLen,format,args2);
  337. }
  338. }
  339. }
  340. else if (size == szLimit)
  341. {
  342. len = size;
  343. if (len>3) memcpy(buffer+len-3, "...", 3);
  344. }
  345. else
  346. {
  347. size = BUF_SIZE * 2;
  348. loop
  349. {
  350. if (0 != szLimit && size>szLimit) size = szLimit; // if so, will be last attempt
  351. if (size>MAX_BUF_SIZE)
  352. {
  353. WARNLOG("StringBuffer::valist_appendf(\"%s\"): vsnprintf exceeds limit (%d)", format, size);
  354. size = szLimit = MAX_BUF_SIZE;
  355. }
  356. try { ensureCapacity(size); }
  357. catch (IException *e)
  358. {
  359. StringBuffer eMsg;
  360. IException *e2 = MakeStringException(-1, "StringBuffer::valist_appendf(\"%s\"): vsnprintf failed (%d): %s", format, size, e->errorMessage(eMsg).str());
  361. e->Release();
  362. throw e2;
  363. }
  364. va_list args3;
  365. va_copy(args3, args2);
  366. len = _vsnprintf(buffer+curLen,size,format,args3);
  367. va_end(args3);
  368. if (len>=0) // NB: len>size not possible, 1st _vsnprintf would have handled.
  369. break;
  370. if (size == szLimit)
  371. {
  372. len = size;
  373. if (len>3) memcpy(buffer+len-3, "...", 3);
  374. break;
  375. }
  376. size <<= 1;
  377. }
  378. }
  379. va_end(args2);
  380. curLen += len;
  381. return *this;
  382. }
  383. StringBuffer & StringBuffer::appendN(size32_t count, char fill)
  384. {
  385. ensureCapacity(count);
  386. memset(buffer+curLen, fill, count);
  387. curLen += count;
  388. return *this;
  389. }
  390. void StringBuffer::setLength(unsigned len)
  391. {
  392. if (len > curLen)
  393. {
  394. ensureCapacity(len-curLen);
  395. }
  396. curLen = len;
  397. }
  398. char * StringBuffer::reserve(size32_t size)
  399. {
  400. ensureCapacity(size);
  401. char *ret = buffer+curLen;
  402. curLen += size;
  403. return ret;
  404. }
  405. char * StringBuffer::reserveTruncate(size32_t size)
  406. {
  407. size32_t newMax = curLen+size+1;
  408. if (newMax != maxLen) {
  409. char * newStr = (char *) realloc(buffer, newMax);
  410. if (!newStr)
  411. throw MakeStringException(-1, "StringBuffer::_realloc: Failed to realloc newMax = %d, oldMax = %d", newMax, maxLen);
  412. buffer = newStr;
  413. maxLen = newMax;
  414. }
  415. char *ret = buffer+curLen;
  416. curLen += size;
  417. return ret;
  418. }
  419. void StringBuffer::swapWith(StringBuffer &other)
  420. {
  421. size32_t tmpsz = curLen;
  422. curLen = other.curLen;
  423. other.curLen = tmpsz;
  424. tmpsz = maxLen;
  425. maxLen = other.maxLen;
  426. other.maxLen = tmpsz;
  427. char *tmpbuf = buffer;
  428. buffer = other.buffer;
  429. other.buffer = tmpbuf;
  430. }
  431. void StringBuffer::kill()
  432. {
  433. if (buffer)
  434. free(buffer);
  435. init();
  436. }
  437. void StringBuffer::getChars(int srcBegin, int srcEnd, char * target) const
  438. {
  439. const int len = srcEnd - srcBegin;
  440. if (target && buffer && len > 0)
  441. memcpy(target, buffer + srcBegin, len);
  442. }
  443. void StringBuffer::_insert(unsigned offset, size32_t insertLen)
  444. {
  445. ensureCapacity(insertLen);
  446. memmove(buffer + offset + insertLen, buffer + offset, curLen - offset);
  447. curLen += insertLen;
  448. }
  449. StringBuffer & StringBuffer::insert(int offset, char value)
  450. {
  451. _insert(offset, 1);
  452. buffer[offset] = value;
  453. return *this;
  454. }
  455. StringBuffer & StringBuffer::insert(int offset, const char * value)
  456. {
  457. if (!value) return *this;
  458. unsigned len = (size32_t)strlen(value);
  459. _insert(offset, len);
  460. memcpy(buffer + offset, value, len);
  461. return *this;
  462. }
  463. StringBuffer & StringBuffer::insert(int offset, double value)
  464. {
  465. char temp[36];
  466. sprintf(temp, "%f", value);
  467. insert(offset, temp);
  468. return *this;
  469. }
  470. StringBuffer & StringBuffer::insert(int offset, float value)
  471. {
  472. return insert(offset, (double)value);
  473. }
  474. StringBuffer & StringBuffer::insert(int offset, int value)
  475. {
  476. char temp[12];
  477. numtostr(temp, value);
  478. return insert(offset, temp);
  479. }
  480. StringBuffer & StringBuffer::insert(int offset, unsigned value)
  481. {
  482. char temp[12];
  483. numtostr(temp, value);
  484. return insert(offset, temp);
  485. }
  486. #if 0
  487. StringBuffer & StringBuffer::insert(int offset, long value)
  488. {
  489. char temp[24];
  490. numtostr(temp, value);
  491. return insert(offset, temp);
  492. }
  493. #endif
  494. StringBuffer & StringBuffer::insert(int offset, __int64 value)
  495. {
  496. char temp[24];
  497. numtostr(temp, value);
  498. return insert(offset, temp);
  499. }
  500. StringBuffer & StringBuffer::insert(int offset, const String & value)
  501. {
  502. size32_t len = value.length();
  503. _insert(offset, len);
  504. value.getChars(0, len, buffer, offset);
  505. return *this;
  506. }
  507. StringBuffer & StringBuffer::insert(int offset, const StringBuffer & value)
  508. {
  509. size32_t len = value.length();
  510. _insert(offset, len);
  511. value.getChars(0, len, buffer+offset);
  512. return *this;
  513. }
  514. StringBuffer & StringBuffer::insert(int offset, const IStringVal & value)
  515. {
  516. return insert(offset, value.str());
  517. }
  518. StringBuffer & StringBuffer::insert(int offset, const IStringVal * value)
  519. {
  520. if (value)
  521. return insert(offset, value->str());
  522. else
  523. return *this;
  524. }
  525. StringBuffer & StringBuffer::newline()
  526. {
  527. return append("\n");
  528. }
  529. StringBuffer & StringBuffer::pad(unsigned count)
  530. {
  531. ensureCapacity(count);
  532. memset(buffer + curLen, ' ', count);
  533. curLen += count;
  534. return *this;
  535. }
  536. StringBuffer & StringBuffer::padTo(unsigned count)
  537. {
  538. if (curLen<count)
  539. pad(count-curLen);
  540. return *this;
  541. }
  542. StringBuffer & StringBuffer::clip()
  543. {
  544. while (curLen && isspace(buffer[curLen-1]))
  545. curLen--;
  546. return *this;
  547. }
  548. StringBuffer & StringBuffer::trim()
  549. {
  550. return clip().trimLeft();
  551. }
  552. StringBuffer & StringBuffer::trimLeft()
  553. {
  554. char *p;
  555. if (curLen==0)
  556. return *this;
  557. buffer[curLen] = 0;
  558. for(p = buffer;isspace(*p);p++)
  559. ;
  560. if (p!=buffer)
  561. {
  562. curLen -= p-buffer;
  563. memmove(buffer,p,curLen);
  564. }
  565. return *this;
  566. }
  567. StringBuffer & StringBuffer::remove(unsigned start, unsigned len)
  568. {
  569. if (start > curLen) start = curLen;
  570. if (start + len > curLen) len = curLen - start;
  571. unsigned start2 = start + len;
  572. memmove(buffer + start, buffer + start2, curLen - start2);
  573. setLength(curLen - len);
  574. return *this;
  575. }
  576. StringBuffer &StringBuffer::reverse()
  577. {
  578. unsigned max = curLen/2;
  579. char * end = buffer + curLen;
  580. unsigned idx;
  581. for (idx = 0; idx < max; idx++)
  582. {
  583. char temp = buffer[idx];
  584. end--;
  585. buffer[idx] = *end;
  586. *end = temp;
  587. }
  588. return *this;
  589. }
  590. MemoryBuffer & StringBuffer::deserialize(MemoryBuffer & in)
  591. {
  592. unsigned len;
  593. in.read(len);
  594. append(len, (const char *)in.readDirect(len));
  595. return in;
  596. }
  597. MemoryBuffer & StringBuffer::serialize(MemoryBuffer & out) const
  598. {
  599. return out.append(curLen).append(curLen, buffer);
  600. }
  601. StringBuffer &StringBuffer::loadFile(const char *filename, bool binaryMode)
  602. {
  603. FILE *in = fopen(filename, binaryMode?"rb":"rt");
  604. if (in)
  605. {
  606. char buffer[1024];
  607. int bytes;
  608. for (;;)
  609. {
  610. bytes = (size32_t)fread(buffer, 1, sizeof(buffer), in);
  611. if (!bytes)
  612. break;
  613. append(buffer, 0, bytes);
  614. }
  615. fclose(in);
  616. return *this;
  617. }
  618. else
  619. throw MakeStringException(errno, "File %s could not be opened", filename);
  620. }
  621. StringBuffer & StringBuffer::loadFile(IFile* f)
  622. {
  623. if(!f)
  624. return *this;
  625. Owned<IFileIO> io = f->open(IFOread);
  626. if(!io)
  627. throw MakeStringException(errno, "file %s could not be opened for reading", f->queryFilename());
  628. char buf[2048];
  629. const unsigned requestedSize = sizeof(buf);
  630. offset_t pos = 0;
  631. loop
  632. {
  633. size32_t len = io->read(pos, requestedSize, buf);
  634. if (len == 0)
  635. break;
  636. append(len, buf);
  637. pos += len;
  638. if (len != requestedSize)
  639. break;
  640. }
  641. return *this;
  642. }
  643. void StringBuffer::setCharAt(unsigned offset, char value)
  644. {
  645. if (offset < curLen)
  646. buffer[offset] = value;
  647. }
  648. StringBuffer & StringBuffer::toLowerCase()
  649. {
  650. if (buffer)
  651. {
  652. int l = curLen;
  653. for (int i = 0; i < l; i++)
  654. if (isupper(buffer[i]))
  655. buffer[i] = tolower(buffer[i]);
  656. }
  657. return *this;
  658. }
  659. StringBuffer & StringBuffer::toUpperCase()
  660. {
  661. if (buffer)
  662. {
  663. int l = curLen;
  664. for (int i = 0; i < l; i++)
  665. if (islower(buffer[i]))
  666. buffer[i] = toupper(buffer[i]);
  667. }
  668. return *this;
  669. }
  670. StringBuffer & StringBuffer::replace(char oldChar, char newChar)
  671. {
  672. if (buffer)
  673. {
  674. int l = curLen;
  675. for (int i = 0; i < l; i++)
  676. if (buffer[i] == oldChar)
  677. {
  678. buffer[i] = newChar;
  679. if (newChar == '\0')
  680. {
  681. curLen = i;
  682. break;
  683. }
  684. }
  685. }
  686. return *this;
  687. }
  688. // this method will replace all occurrances of "oldStr" with "newStr"
  689. StringBuffer & StringBuffer::replaceString(const char* oldStr, const char* newStr)
  690. {
  691. if (buffer)
  692. {
  693. const char* s = str(); // get null terminated version of the string
  694. int left = length();
  695. int oldStr_len = (size32_t)strlen(oldStr);
  696. StringBuffer tempbuff;
  697. while (left >= oldStr_len)
  698. {
  699. if ( memcmp(s, oldStr, oldStr_len) == 0)
  700. {
  701. tempbuff.append(newStr);
  702. s += oldStr_len;
  703. left -= oldStr_len;
  704. }
  705. else
  706. {
  707. tempbuff.append(*s);
  708. s++;
  709. left--;
  710. }
  711. }
  712. // there are no more possible replacements, make sure we keep the end of the original buffer
  713. tempbuff.append(s);
  714. //*this = tempbuff;
  715. swapWith(tempbuff);
  716. }
  717. return *this;
  718. }
  719. const char * StringBuffer::toCharArray() const
  720. {
  721. if (buffer)
  722. {
  723. buffer[curLen] = '\0'; // There is always room for this null
  724. return buffer;
  725. }
  726. return TheNullStr;
  727. }
  728. //===========================================================================
  729. VStringBuffer::VStringBuffer(const char* format, ...)
  730. {
  731. va_list args;
  732. va_start(args,format);
  733. valist_appendf(format,args);
  734. va_end(args);
  735. }
  736. //===========================================================================
  737. String::String()
  738. {
  739. text = (char *)TheNullStr;
  740. }
  741. String::String(const char * value)
  742. {
  743. text = (value ? strdup(value) : (char *)TheNullStr);
  744. }
  745. String::String(const char * value, int offset, int _count)
  746. {
  747. text = (char *)malloc(_count+1);
  748. memcpy(text, value+offset, _count);
  749. text[_count]=0;
  750. }
  751. String::String(String & value)
  752. {
  753. text = strdup(value.toCharArray());
  754. }
  755. String::String(StringBuffer & value)
  756. {
  757. unsigned len = value.length();
  758. text = (char *)malloc(len+1);
  759. value.getChars(0,len,text);
  760. text[len] = 0;
  761. }
  762. String::~String()
  763. {
  764. if (text != TheNullStr) free(text);
  765. }
  766. char String::charAt(size32_t index) const
  767. {
  768. return text[index];
  769. }
  770. int String::compareTo(const String & value) const
  771. {
  772. return strcmp(text, value.toCharArray());
  773. }
  774. int String::compareTo(const char* value) const
  775. {
  776. return strcmp(text,value);
  777. }
  778. String * String::concat(const String & value) const
  779. {
  780. StringBuffer temp(toCharArray());
  781. temp.append(value);
  782. return new String(temp.str());
  783. }
  784. bool String::endsWith(const String & value) const
  785. {
  786. unsigned lenValue = value.length();
  787. unsigned len = (size32_t)strlen(text);
  788. if (len >= lenValue)
  789. return (memcmp(text+(len-lenValue),value.toCharArray(),lenValue) == 0);
  790. return false;
  791. }
  792. bool String::endsWith(const char* value) const
  793. {
  794. return ::endsWith(this->text, value);
  795. }
  796. bool String::equals(String & value) const
  797. {
  798. return strcmp(text, value.toCharArray())==0;
  799. }
  800. bool String::equalsIgnoreCase(const String & value) const
  801. {
  802. return stricmp(text, value.toCharArray())==0;
  803. }
  804. void String::getBytes(int srcBegin, int srcEnd, void * dest, int dstBegin) const
  805. {
  806. memcpy((char *)dest+dstBegin, text+srcBegin, srcEnd-srcBegin);
  807. }
  808. void String::getChars(int srcBegin, int srcEnd, void * dest, int dstBegin) const
  809. {
  810. memcpy((char *)dest+dstBegin, text+srcBegin, srcEnd-srcBegin);
  811. }
  812. int String::hashCode() const
  813. {
  814. return (int)hashc((const byte *)text,length(),0);
  815. }
  816. int String::indexOf(int ch) const
  817. {
  818. char * match = strchr(text, ch);
  819. return match ? (int)(match - text) : -1;
  820. }
  821. int String::indexOf(int ch, int from) const
  822. {
  823. char * match = strchr(text + from, ch);
  824. return match ? (int)(match - text) : -1;
  825. }
  826. int String::indexOf(const String & search) const
  827. {
  828. const char * str = search.toCharArray();
  829. const char * match = strstr(text, str);
  830. return match ? (int)(match - text) : -1;
  831. }
  832. int String::indexOf(const String & search, int from) const
  833. {
  834. const char * str = search.toCharArray();
  835. const char * match = strstr(text + from, str);
  836. return match ? (int)(match - text) : -1;
  837. }
  838. int String::lastIndexOf(int ch) const
  839. {
  840. char * match = strrchr(text, ch);
  841. return match ? (int)(match - text) : -1;
  842. }
  843. int String::lastIndexOf(int ch, int from) const
  844. {
  845. for (;(from > 0);--from)
  846. if (text[from] == ch)
  847. return from;
  848. return -1;
  849. }
  850. int String::lastIndexOf(const String & search) const
  851. {
  852. assertex(!"TBD");
  853. return -1;
  854. }
  855. int String::lastIndexOf(const String & search, int from) const
  856. {
  857. assertex(!"TBD");
  858. return -1;
  859. }
  860. size32_t String::length() const
  861. {
  862. return (size32_t)strlen(text);
  863. }
  864. bool String::startsWith(String & value) const
  865. {
  866. unsigned lenValue = value.length();
  867. const char * search = value.toCharArray();
  868. return (memcmp(text, search, lenValue) == 0);
  869. }
  870. bool String::startsWith(String & value, int offset) const
  871. {
  872. unsigned lenValue = value.length();
  873. const char * search = value.toCharArray();
  874. return (memcmp(text + offset, search, lenValue) == 0);
  875. }
  876. bool String::startsWith(const char* value) const
  877. {
  878. return ::startsWith(this->text,value);
  879. }
  880. String * String::substring(int beginIndex) const
  881. {
  882. return new String(text+beginIndex);
  883. }
  884. String * String::substring(int beginIndex, int endIndex) const
  885. {
  886. return new String(text, beginIndex, endIndex - beginIndex);
  887. }
  888. const char *String::toCharArray() const
  889. {
  890. return text;
  891. }
  892. String * String::toLowerCase() const
  893. {
  894. String *ret = new String();
  895. size32_t l = length();
  896. if (l)
  897. {
  898. ret->text = (char *)malloc(l+1);
  899. for (unsigned i = 0; i < l; i++)
  900. ret->text[i] = tolower(text[i]);
  901. ret->text[l]=0;
  902. }
  903. return ret;
  904. }
  905. String * String::toString()
  906. {
  907. Link();
  908. return this;
  909. }
  910. String * String::toUpperCase() const
  911. {
  912. String *ret = new String();
  913. size32_t l = length();
  914. if (l)
  915. {
  916. ret->text = (char *)malloc(l+1);
  917. for (unsigned i = 0; i < l; i++)
  918. ret->text[i] = toupper(text[i]);
  919. ret->text[l]=0;
  920. }
  921. return ret;
  922. }
  923. String * String::trim() const
  924. {
  925. size32_t l = length();
  926. while (l && isspace(text[l-1]))
  927. l--;
  928. return new String(text, 0, l);
  929. }
  930. //------------------------------------------------
  931. #if 0
  932. String & String::valueOf(char value)
  933. {
  934. return * new String(&value, 0, 1);
  935. }
  936. String & String::valueOf(const char * value)
  937. {
  938. return * new String(value);
  939. }
  940. String & String::valueOf(const char * value, int offset, int count)
  941. {
  942. return * new String(value, offset, count);
  943. }
  944. String & String::valueOf(double value)
  945. {
  946. StringBuffer temp;
  947. return temp.append(value).toString();
  948. }
  949. String & String::valueOf(float value)
  950. {
  951. StringBuffer temp;
  952. return temp.append(value).toString();
  953. }
  954. String & String::valueOf(int value)
  955. {
  956. StringBuffer temp;
  957. return temp.append(value).toString();
  958. }
  959. String & String::valueOf(long value)
  960. {
  961. StringBuffer temp;
  962. return temp.append(value).toString();
  963. }
  964. #endif
  965. //------------------------------------------------
  966. StringAttr::StringAttr(const char * _text)
  967. {
  968. text = _text ? strdup(_text) : NULL;
  969. }
  970. StringAttr::StringAttr(const char * _text, unsigned _len)
  971. {
  972. text = NULL;
  973. set(_text, _len);
  974. }
  975. StringAttr::StringAttr(const StringAttr & src)
  976. {
  977. text = NULL;
  978. set(src.get());
  979. }
  980. void StringAttr::set(const char * _text)
  981. {
  982. free(text);
  983. text = _text ? strdup(_text) : NULL;
  984. }
  985. void StringAttr::set(const char * _text, unsigned _len)
  986. {
  987. if (text)
  988. free(text);
  989. text = (char *)malloc(_len+1);
  990. memcpy(text, _text, _len);
  991. text[_len] = 0;
  992. }
  993. void StringAttr::setown(const char * _text)
  994. {
  995. if (text)
  996. free(text);
  997. text = (char *)_text;
  998. }
  999. void StringAttr::toUpperCase()
  1000. {
  1001. if (text)
  1002. {
  1003. char * cur = text;
  1004. char next;
  1005. while ((next = *cur) != 0)
  1006. {
  1007. if (islower(next))
  1008. *cur = toupper(next);
  1009. cur++;
  1010. }
  1011. }
  1012. }
  1013. StringAttrItem::StringAttrItem(const char *_text, unsigned _len)
  1014. {
  1015. text.set(_text, _len);
  1016. }
  1017. inline char hex(char c, char lower)
  1018. {
  1019. if (c < 10)
  1020. return '0' + c;
  1021. else if (lower)
  1022. return 'a' + c - 10;
  1023. else
  1024. return 'A' + c - 10;
  1025. }
  1026. StringBuffer & StringBuffer::appendhex(unsigned char c, char lower)
  1027. {
  1028. append(hex(c>>4, lower));
  1029. append(hex(c&0xF, lower));
  1030. return *this;
  1031. }
  1032. void appendURL(StringBuffer *dest, const char *src, size32_t len, char lower)
  1033. {
  1034. if (len == (size32_t)-1)
  1035. len = (size32_t)strlen(src);
  1036. while (len)
  1037. {
  1038. // isalnum seems to give weird results for chars > 127....
  1039. unsigned char c = (unsigned char) *src;
  1040. if (c == ' ')
  1041. dest->append('+');
  1042. else if (c & 0x80 || !isalnum(*src))
  1043. {
  1044. dest->append('%');
  1045. dest->appendhex(c, lower);
  1046. }
  1047. else
  1048. dest->append(c);
  1049. src++;
  1050. len--;
  1051. }
  1052. }
  1053. static StringBuffer & appendStringExpandControl(StringBuffer &out, unsigned len, const char * src, bool addBreak, bool isCpp)
  1054. {
  1055. const int minBreakPos = 0;
  1056. const int commaBreakPos = 70;
  1057. const int maxBreakPos = 120;
  1058. const char * startLine = src;
  1059. out.ensureCapacity(len+2);
  1060. for (; len > 0; --len)
  1061. {
  1062. unsigned char c = *src++;
  1063. bool insertBreak = false;
  1064. bool allowBreak = true;
  1065. switch (c)
  1066. {
  1067. case '\n':
  1068. {
  1069. out.append("\\n");
  1070. if (src-startLine > minBreakPos)
  1071. insertBreak = true;
  1072. break;
  1073. }
  1074. case ',':
  1075. {
  1076. out.append(c);
  1077. if (src-startLine > commaBreakPos)
  1078. insertBreak = true;
  1079. break;
  1080. }
  1081. case '\r': out.append("\\r"); break;
  1082. case '\t': out.append("\\t"); break;
  1083. case '"':
  1084. if (isCpp)
  1085. out.append("\\");
  1086. out.append(c);
  1087. break;
  1088. case '\'':
  1089. if (!isCpp)
  1090. out.append("\\");
  1091. out.append(c);
  1092. break;
  1093. case '\\': out.append("\\\\"); break;
  1094. case '?':
  1095. if (isCpp)
  1096. {
  1097. //stop trigraphs being generated.... quote the second ?
  1098. out.append(c);
  1099. if ((len!=1) && (*src == '?'))
  1100. {
  1101. out.append('\\');
  1102. allowBreak = false;
  1103. }
  1104. }
  1105. else
  1106. out.append(c);
  1107. break;
  1108. default:
  1109. if ((c >= ' ') && (c <= 126))
  1110. out.append(c);
  1111. else
  1112. out.appendf("\\%03o", c);
  1113. break;
  1114. }
  1115. if (addBreak && (insertBreak || (allowBreak && src-startLine >= maxBreakPos)))
  1116. {
  1117. out.append("\"").newline().append("\t\t\"");
  1118. startLine = src;
  1119. }
  1120. }
  1121. return out;
  1122. }
  1123. StringBuffer & appendStringAsCPP(StringBuffer &out, unsigned len, const char * src, bool addBreak)
  1124. {
  1125. return appendStringExpandControl(out, len, src, addBreak, true);
  1126. }
  1127. StringBuffer & appendStringAsECL(StringBuffer &out, unsigned len, const char * src)
  1128. {
  1129. return appendStringExpandControl(out, len, src, false, false);
  1130. }
  1131. StringBuffer & appendStringAsQuotedCPP(StringBuffer &out, unsigned len, const char * src, bool addBreak)
  1132. {
  1133. out.ensureCapacity(len+2);
  1134. out.append('\"');
  1135. appendStringAsCPP(out, len, src, addBreak);
  1136. return out.append('\"');
  1137. }
  1138. StringBuffer & appendStringAsQuotedECL(StringBuffer &out, unsigned len, const char * src)
  1139. {
  1140. out.ensureCapacity(len+2);
  1141. out.append('\'');
  1142. appendStringAsECL(out, len, src);
  1143. return out.append('\'');
  1144. }
  1145. void extractItem(StringBuffer & res, const char * src, const char * sep, int whichItem, bool caps)
  1146. {
  1147. bool isSeparator[256];
  1148. memset(isSeparator,0,sizeof(isSeparator));
  1149. unsigned char * finger = (unsigned char *)sep;
  1150. while (*finger !=0)
  1151. isSeparator[*finger++] = true;
  1152. isSeparator[0]=true;
  1153. finger = (unsigned char *)src;
  1154. unsigned char next;
  1155. loop
  1156. {
  1157. while (isSeparator[(next = *finger)])
  1158. {
  1159. if (next == 0) return;
  1160. finger++;
  1161. }
  1162. if (whichItem == 0)
  1163. {
  1164. while (!isSeparator[(next = *finger)])
  1165. {
  1166. if (caps)
  1167. next = toupper(next);
  1168. res.append(next);
  1169. finger++;
  1170. }
  1171. return;
  1172. }
  1173. while (!isSeparator[*finger])
  1174. finger++;
  1175. whichItem--;
  1176. }
  1177. }
  1178. int utf8CharLen(const unsigned char *ch)
  1179. {
  1180. //return 1 if this is an ascii character,
  1181. //or 0 if its not a valid utf-8 character
  1182. if (*ch < 128)
  1183. return 1;
  1184. if (*ch < 192)
  1185. return 0;
  1186. unsigned char len = 1;
  1187. for (unsigned char lead = *ch << 1; (lead & 0x80); lead <<=1)
  1188. len++;
  1189. for (unsigned pos = 1; pos < len; pos++)
  1190. if ((ch[pos] < 128) || (ch[pos] >= 192))
  1191. return 0; //its not a valid utf-8 character after all
  1192. return len;
  1193. }
  1194. const char *encodeXML(const char *x, StringBuffer &ret, unsigned flags, unsigned len, bool utf8)
  1195. {
  1196. while (len)
  1197. {
  1198. switch(*x)
  1199. {
  1200. case '&':
  1201. ret.append("&amp;");
  1202. break;
  1203. case '<':
  1204. ret.append("&lt;");
  1205. break;
  1206. case '>':
  1207. ret.append("&gt;");
  1208. break;
  1209. case '\"':
  1210. ret.append("&quot;");
  1211. break;
  1212. case '\'':
  1213. ret.append("&apos;");
  1214. break;
  1215. case ' ':
  1216. ret.append(flags & ENCODE_SPACES?"&#32;":" ");
  1217. break;
  1218. case '\n':
  1219. ret.append(flags & ENCODE_NEWLINES?"&#10;":"\n");
  1220. break;
  1221. case '\r':
  1222. ret.append(flags & ENCODE_NEWLINES?"&#13;":"\r");
  1223. break;
  1224. case '\t':
  1225. ret.append(flags & ENCODE_SPACES?"&#9;":"\t");
  1226. break;
  1227. case '\0':
  1228. if (len == (unsigned) -1)
  1229. return x;
  1230. ret.append("&#xe000;"); // hack!!! Characters below 0x20 are not legal in strict xml, even encoded.
  1231. break;
  1232. default:
  1233. if (*x >= ' ' && ((byte)*x) < 128)
  1234. ret.append(*x);
  1235. else if (*x < ' ' && *x > 0)
  1236. ret.append("&#xe0").appendhex(*x, true).append(';'); // HACK
  1237. else if (utf8)
  1238. {
  1239. unsigned chlen = utf8CharLen((const unsigned char *)x);
  1240. if (chlen==0)
  1241. ret.append("&#").append((unsigned int)*(unsigned char *) x).append(';');
  1242. else
  1243. {
  1244. ret.append(*x);
  1245. while(--chlen)
  1246. {
  1247. if (len != (unsigned) -1)
  1248. len--;
  1249. ret.append(*(++x));
  1250. }
  1251. }
  1252. }
  1253. else
  1254. ret.append("&#").append((unsigned int)*(unsigned char *) x).append(';');
  1255. break;
  1256. }
  1257. if (len != (unsigned) -1)
  1258. len--;
  1259. ++x;
  1260. }
  1261. return x;
  1262. }
  1263. const char *encodeXML(const char *x, IIOStream &out, unsigned flags, unsigned len, bool utf8)
  1264. {
  1265. while (len)
  1266. {
  1267. switch(*x)
  1268. {
  1269. case '&':
  1270. writeStringToStream(out, "&amp;");
  1271. break;
  1272. case '<':
  1273. writeStringToStream(out, "&lt;");
  1274. break;
  1275. case '>':
  1276. writeStringToStream(out, "&gt;");
  1277. break;
  1278. case '\"':
  1279. writeStringToStream(out, "&quot;");
  1280. break;
  1281. case '\'':
  1282. writeStringToStream(out, "&apos;");
  1283. break;
  1284. case ' ':
  1285. writeStringToStream(out, flags & ENCODE_SPACES?"&#32;":" ");
  1286. break;
  1287. case '\n':
  1288. writeStringToStream(out, flags & ENCODE_NEWLINES?"&#10;":"\n");
  1289. break;
  1290. case '\r':
  1291. writeStringToStream(out, flags & ENCODE_NEWLINES?"&#13;":"\r");
  1292. break;
  1293. case '\t':
  1294. writeStringToStream(out, flags & ENCODE_SPACES?"&#9;":"\t");
  1295. break;
  1296. case '\0':
  1297. if (len == (unsigned) -1)
  1298. return x;
  1299. writeStringToStream(out, "&#xe000;"); // hack!!! Characters below 0x20 are not legal in strict xml, even encoded.
  1300. break;
  1301. default:
  1302. if (*x >= ' ' && ((byte)*x) < 128)
  1303. writeCharToStream(out, *x);
  1304. else if (*x < ' ' && *x > 0)
  1305. {
  1306. writeStringToStream(out, "&#xe0");
  1307. unsigned char c = *(unsigned char *)x;
  1308. writeCharToStream(out, hex(c>>4, true));
  1309. writeCharToStream(out, hex(c&0xF, true));
  1310. writeCharToStream(out, ';'); // HACK
  1311. }
  1312. else if (utf8)
  1313. {
  1314. int chlen = utf8CharLen((const unsigned char *)x);
  1315. if (chlen==0)
  1316. {
  1317. writeStringToStream(out, "&#");
  1318. char tmp[12];
  1319. unsigned written = numtostr(tmp, *(unsigned char *)x);
  1320. out.write(written, tmp);
  1321. writeCharToStream(out, ';');
  1322. }
  1323. else
  1324. {
  1325. writeCharToStream(out, *x);
  1326. while(--chlen)
  1327. {
  1328. if (len != (unsigned) -1)
  1329. len--;
  1330. writeCharToStream(out, *(++x));
  1331. }
  1332. }
  1333. }
  1334. else
  1335. {
  1336. writeStringToStream(out, "&#");
  1337. char tmp[12];
  1338. unsigned written = numtostr(tmp, *(unsigned char *)x);
  1339. out.write(written, tmp);
  1340. writeCharToStream(out, ';');
  1341. }
  1342. break;
  1343. }
  1344. if (len != (unsigned) -1)
  1345. len--;
  1346. ++x;
  1347. }
  1348. return x;
  1349. }
  1350. static void writeUtf8(unsigned c, StringBuffer &out)
  1351. {
  1352. if (c < 0x80)
  1353. out.append((char)c);
  1354. else if (c < 0x800)
  1355. {
  1356. out.append((char)(0xC0 | (c>>6)));
  1357. out.append((char)(0x80 | (c & 0x3F)));
  1358. }
  1359. else if (c < 0x10000)
  1360. {
  1361. out.append((char) (0xE0 | (c>>12)));
  1362. out.append((char) (0x80 | (c>>6 & 0x3F)));
  1363. out.append((char) (0x80 | (c & 0x3F)));
  1364. }
  1365. else if (c < 0x200000)
  1366. {
  1367. out.append((char) (0xF0 | (c>>18)));
  1368. out.append((char) (0x80 | (c>>12 & 0x3F)));
  1369. out.append((char) (0x80 | (c>>6 & 0x3F)));
  1370. out.append((char) (0x80 | (c & 0x3F)));
  1371. }
  1372. else if (c < 0x4000000)
  1373. {
  1374. out.append((char) (0xF8 | (c>>24)));
  1375. out.append((char) (0x80 | (c>>18 & 0x3F)));
  1376. out.append((char) (0x80 | (c>>12 & 0x3F)));
  1377. out.append((char) (0x80 | (c>>6 & 0x3F)));
  1378. out.append((char) (0x80 | (c & 0x3F)));
  1379. }
  1380. else if (c < 0x80000000)
  1381. {
  1382. out.append((char) (0xFC | (c>>30)));
  1383. out.append((char) (0x80 | (c>>24 & 0x3F)));
  1384. out.append((char) (0x80 | (c>>18 & 0x3F)));
  1385. out.append((char) (0x80 | (c>>12 & 0x3F)));
  1386. out.append((char) (0x80 | (c>>6 & 0x3F)));
  1387. out.append((char) (0x80 | (c & 0x3F)));
  1388. }
  1389. else
  1390. assertex(false);
  1391. }
  1392. void decodeXML(ISimpleReadStream &in, StringBuffer &out, unsigned len)
  1393. {
  1394. // TODO
  1395. UNIMPLEMENTED;
  1396. }
  1397. #define XMLSTRICT
  1398. const char *decodeXML(const char *x, StringBuffer &ret, unsigned len, const char **errMark, IEntityHelper *entityHelper)
  1399. {
  1400. if (!x)
  1401. return x;
  1402. if ((unsigned)-1 == len)
  1403. len = (unsigned)strlen(x);
  1404. const char *end = x+len;
  1405. try
  1406. {
  1407. while (x<end && *x)
  1408. {
  1409. if ('&' == *x)
  1410. {
  1411. switch (*(x+1))
  1412. {
  1413. case 'a':
  1414. case 'A':
  1415. {
  1416. switch (*(x+2))
  1417. {
  1418. case 'm':
  1419. case 'M':
  1420. {
  1421. char c1 = *(x+3);
  1422. if (('p' == c1 || 'P' == c1) && ';' == *(x+4))
  1423. {
  1424. x += 5;
  1425. ret.append('&');
  1426. continue;
  1427. }
  1428. break;
  1429. }
  1430. case 'p':
  1431. case 'P':
  1432. {
  1433. char c1 = *(x+3);
  1434. char c2 = *(x+4);
  1435. if (('o' == c1 || 'O' == c1) && ('s' == c2 || 'S' == c2) && ';' == *(x+5))
  1436. {
  1437. x += 6;
  1438. ret.append('\'');
  1439. continue;
  1440. }
  1441. break;
  1442. }
  1443. }
  1444. break;
  1445. }
  1446. case 'l':
  1447. case 'L':
  1448. {
  1449. char c1 = *(x+2);
  1450. if (('t' == c1 || 'T' == c1) && ';' == *(x+3))
  1451. {
  1452. x += 4;
  1453. ret.append('<');
  1454. continue;
  1455. }
  1456. break;
  1457. }
  1458. case 'g':
  1459. case 'G':
  1460. {
  1461. char c1 = *(x+2);
  1462. if (('t' == c1 || 'T' == c1) && ';' == *(x+3))
  1463. {
  1464. x += 4;
  1465. ret.append('>');
  1466. continue;
  1467. }
  1468. break;
  1469. }
  1470. case 'q':
  1471. case 'Q':
  1472. {
  1473. char c1 = *(x+2);
  1474. char c2 = *(x+3);
  1475. char c3 = *(x+4);
  1476. if (('u' == c1 || 'U' == c1) && ('o' == c2 || 'O' == c2) && ('t' == c3 || 'T' == c3) && ';' == *(x+5))
  1477. {
  1478. x += 6;
  1479. ret.append('"');
  1480. continue;
  1481. }
  1482. break;
  1483. }
  1484. case 'n':
  1485. case 'N':
  1486. {
  1487. char c1 = *(x+2);
  1488. char c2 = *(x+3);
  1489. char c3 = *(x+4);
  1490. if (('b' == c1 || 'B' == c1) && ('s' == c2 || 'S' == c2) && ('p' == c3 || 'P' == c3) && ';' == *(x+5))
  1491. {
  1492. x += 6;
  1493. writeUtf8(0xa0, ret);
  1494. continue;
  1495. }
  1496. break;
  1497. }
  1498. default:
  1499. {
  1500. x++;
  1501. if (*x == '#')
  1502. {
  1503. x++;
  1504. bool hex;
  1505. if (*x == 'x' || *x == 'X') // strictly not sure about X.
  1506. {
  1507. hex = true;
  1508. x++;
  1509. }
  1510. else
  1511. hex = false;
  1512. char *endptr;
  1513. unsigned val = 0;
  1514. if (hex)
  1515. val = strtoul(x,&endptr,16);
  1516. else
  1517. val = strtoul(x,&endptr,10);
  1518. if (x==endptr || *endptr != ';') {
  1519. #ifndef XMLSTRICT
  1520. LOG(MCerror, unknownJob, "&# syntax error");
  1521. ret.append(*x);
  1522. #endif
  1523. }
  1524. else // always convert to utf-8. Should potentially throw error if not marked as utf-8 encoded doc and out of ascii range.
  1525. writeUtf8(val, ret);
  1526. x = endptr+1;
  1527. continue;
  1528. }
  1529. else
  1530. {
  1531. if ('\0' == *x)
  1532. --x;
  1533. else
  1534. {
  1535. bool error = false;
  1536. if (entityHelper)
  1537. {
  1538. const char *start=x;
  1539. loop
  1540. {
  1541. ++x;
  1542. if ('\0' == *x) throw MakeStringException(-1, "missing ';'");
  1543. if (';' == *x) break;
  1544. }
  1545. StringBuffer entity(x-start, start);
  1546. if (!entityHelper->find(entity, ret))
  1547. {
  1548. error = true;
  1549. x = start;
  1550. }
  1551. }
  1552. else
  1553. error = true;
  1554. if (error)
  1555. {
  1556. #ifdef XMLSTRICT
  1557. throw MakeStringException(-1, "invalid escaped sequence");
  1558. #endif
  1559. ret.append('&');
  1560. }
  1561. }
  1562. }
  1563. break;
  1564. }
  1565. }
  1566. if (x>=end)
  1567. throw MakeStringException(-1, "invalid escaped sequence");
  1568. }
  1569. ret.append(*x);
  1570. ++x;
  1571. }
  1572. }
  1573. catch (IException *)
  1574. {
  1575. if (errMark) *errMark = x;
  1576. throw;
  1577. }
  1578. return x;
  1579. }
  1580. StringBuffer & appendXMLOpenTag(StringBuffer &xml, const char *tag, const char *prefix, bool complete, bool close, const char *uri)
  1581. {
  1582. if (!tag || !*tag)
  1583. return xml;
  1584. xml.append('<');
  1585. appendXMLTagName(xml, tag, prefix);
  1586. if (uri && *uri)
  1587. {
  1588. xml.append(" xmlns");
  1589. if (prefix && *prefix)
  1590. xml.append(':').append(prefix);
  1591. xml.append("=\"").append(uri).append('\"');
  1592. }
  1593. if (complete)
  1594. {
  1595. if (close)
  1596. xml.append('/');
  1597. xml.append('>');
  1598. }
  1599. return xml;
  1600. }
  1601. jlib_decl StringBuffer &appendJSONName(StringBuffer &s, const char *name)
  1602. {
  1603. if (!name || !*name)
  1604. return s;
  1605. if (s.length() && !strchr("{[:", s.charAt(s.length()-1)))
  1606. s.append(", ");
  1607. return encodeJSON(s.append('"'), name).append("\": ");
  1608. }
  1609. StringBuffer &encodeJSON(StringBuffer &s, const char *value)
  1610. {
  1611. if (!value)
  1612. return s;
  1613. for (; *value; value++)
  1614. {
  1615. switch (*value)
  1616. {
  1617. case '\b':
  1618. s.append("\\b");
  1619. break;
  1620. case '\f':
  1621. s.append("\\f");
  1622. break;
  1623. case '\n':
  1624. s.append("\\n");
  1625. break;
  1626. case '\r':
  1627. s.append("\\r");
  1628. break;
  1629. case '\t':
  1630. s.append("\\t");
  1631. break;
  1632. case '\"':
  1633. case '\\':
  1634. case '/':
  1635. s.append('\\'); //fall through
  1636. default:
  1637. s.append(*value);
  1638. }
  1639. }
  1640. return s;
  1641. }
  1642. void decodeCppEscapeSequence(StringBuffer & out, const char * in, bool errorIfInvalid)
  1643. {
  1644. out.ensureCapacity((size32_t)strlen(in));
  1645. while (*in)
  1646. {
  1647. char c = *in++;
  1648. if (c == '\\')
  1649. {
  1650. char next = *in;
  1651. if (next)
  1652. {
  1653. in++;
  1654. switch (next)
  1655. {
  1656. case 'a': c = '\a'; break;
  1657. case 'b': c = '\b'; break;
  1658. case 'f': c = '\f'; break;
  1659. case 'n': c = '\n'; break;
  1660. case 'r': c = '\r'; break;
  1661. case 't': c = '\t'; break;
  1662. case 'v': c = '\v'; break;
  1663. case '\\':
  1664. case '\'':
  1665. case '?':
  1666. case '\"': break;
  1667. case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7':
  1668. {
  1669. c = next - '0';
  1670. if (*in >= '0' && *in <= '7')
  1671. {
  1672. c = c << 3 | (*in++-'0');
  1673. if (*in >= '0' && *in <= '7')
  1674. c = c << 3 | (*in++-'0');
  1675. }
  1676. break;
  1677. }
  1678. case 'x':
  1679. c = 0;
  1680. while (isxdigit(*in))
  1681. {
  1682. next = *in++;
  1683. c = c << 4;
  1684. if (next >= '0' && next <= '9') c |= (next - '0');
  1685. else if (next >= 'A' && next <= 'F') c |= (next - 'A' + 10);
  1686. else if (next >= 'a' && next <= 'f') c |= (next - 'a' + 10);
  1687. }
  1688. break;
  1689. default:
  1690. if (errorIfInvalid)
  1691. throw MakeStringException(1, "unrecognised character escape sequence '\\%c'", next);
  1692. in--; // keep it as is.
  1693. break;
  1694. }
  1695. }
  1696. }
  1697. out.append(c);
  1698. }
  1699. }
  1700. bool isPrintable(unsigned len, const char * src)
  1701. {
  1702. while (len--)
  1703. {
  1704. if (!isprint(*((unsigned char *)src)))
  1705. return false;
  1706. src++;
  1707. }
  1708. return true;
  1709. }
  1710. //make this as fast as possible...
  1711. StringBuffer & appendStringAsSQL(StringBuffer & out, unsigned len, const char * src)
  1712. {
  1713. if (!isPrintable(len, src))
  1714. {
  1715. out.append("X'");
  1716. appendDataAsHex(out, len, src);
  1717. return out.append('\'');
  1718. }
  1719. out.ensureCapacity(2 + len);
  1720. out.append('\'');
  1721. loop
  1722. {
  1723. char * next = (char *)memchr(src, '\'', len);
  1724. if (!next)
  1725. break;
  1726. unsigned chunk=(size32_t)(next-src)+1;
  1727. out.append(chunk, src).append('\'');
  1728. len -= chunk;
  1729. src += chunk;
  1730. }
  1731. return out.append(len, src).append('\'');
  1732. }
  1733. static const char * hexText = "0123456789ABCDEF";
  1734. StringBuffer & appendDataAsHex(StringBuffer &out, unsigned len, const void * data)
  1735. {
  1736. char * target = (char *)out.reserve(len*2);
  1737. unsigned char * start = (unsigned char *)data;
  1738. for (unsigned count=len; count> 0; --count)
  1739. {
  1740. unsigned next = *start++;
  1741. *target++ = hexText[next >>4];
  1742. *target++ = hexText[next & 15];
  1743. }
  1744. return out;
  1745. }
  1746. bool strToBool(size_t len, const char * text)
  1747. {
  1748. switch (len)
  1749. {
  1750. case 4:
  1751. if (memicmp(text, "true", 4) == 0)
  1752. return true;
  1753. break;
  1754. case 3:
  1755. if (memicmp(text, "yes", 3) == 0)
  1756. return true;
  1757. break;
  1758. case 2:
  1759. if (memicmp(text, "on", 2) == 0)
  1760. return true;
  1761. break;
  1762. case 1:
  1763. if ((memicmp(text, "t", 1) == 0) || (memicmp(text, "y", 1) == 0))
  1764. return true;
  1765. break;
  1766. }
  1767. while (len && isspace(*text))
  1768. {
  1769. len--;
  1770. text++;
  1771. }
  1772. while (len-- && isdigit(*text))
  1773. {
  1774. if (*text++ != '0') return true;
  1775. }
  1776. return false;
  1777. }
  1778. bool strToBool(const char * text)
  1779. {
  1780. return strToBool(strlen(text), text);
  1781. }
  1782. bool clipStrToBool(size_t len, const char * text)
  1783. {
  1784. while (len && *text==' ')
  1785. {
  1786. len--;
  1787. text++;
  1788. }
  1789. while (len && text[len-1]== ' ')
  1790. len--;
  1791. return strToBool(len, text);
  1792. }
  1793. bool clipStrToBool(const char * text)
  1794. {
  1795. return clipStrToBool(strlen(text), text);
  1796. }
  1797. StringBuffer & ncnameEscape(char const * in, StringBuffer & out)
  1798. {
  1799. if(!isalpha(*in))
  1800. {
  1801. out.appendf("_%02X", static_cast<unsigned char>(*in));
  1802. in++;
  1803. }
  1804. char const * finger = in;
  1805. while(*finger)
  1806. {
  1807. if(!isalnum(*finger))
  1808. {
  1809. if(finger>in)
  1810. out.append((size32_t)(finger-in), in);
  1811. out.appendf("_%02X", static_cast<unsigned char>(*finger));
  1812. in = ++finger;
  1813. }
  1814. else
  1815. {
  1816. finger++;
  1817. }
  1818. }
  1819. if(finger>in)
  1820. out.append((size32_t)(finger-in), in);
  1821. return out;
  1822. }
  1823. StringBuffer & ncnameUnescape(char const * in, StringBuffer & out)
  1824. {
  1825. char const * finger = in;
  1826. while(*finger)
  1827. {
  1828. if(*finger == '_')
  1829. {
  1830. if(finger>in)
  1831. out.append((size32_t)(finger-in), in);
  1832. unsigned char chr = 16 * hex2num(finger[1]) + hex2num(finger[2]);
  1833. out.append(static_cast<char>(chr));
  1834. in = (finger+=3);
  1835. }
  1836. else
  1837. {
  1838. finger++;
  1839. }
  1840. }
  1841. if(finger>in)
  1842. out.append((size32_t)(finger-in), in);
  1843. return out;
  1844. }
  1845. bool startsWith(const char* src, const char* dst)
  1846. {
  1847. while (*dst && *dst == *src) { src++; dst++; }
  1848. return *dst==0;
  1849. }
  1850. bool startsWithIgnoreCase(const char* src, const char* dst)
  1851. {
  1852. while (*dst && tolower(*dst) == tolower(*src)) { src++; dst++; }
  1853. return *dst==0;
  1854. }
  1855. bool endsWith(const char* src, const char* dst)
  1856. {
  1857. size_t srcLen = strlen(src);
  1858. size_t dstLen = strlen(dst);
  1859. if (dstLen<=srcLen)
  1860. return memcmp(dst, src+srcLen-dstLen, dstLen)==0;
  1861. return false;
  1862. }
  1863. bool endsWithIgnoreCase(const char* src, const char* dst)
  1864. {
  1865. size_t srcLen = strlen(src);
  1866. size_t dstLen = strlen(dst);
  1867. if (dstLen<=srcLen)
  1868. return memicmp(dst, src+srcLen-dstLen, dstLen)==0;
  1869. return false;
  1870. }
  1871. char *j_strtok_r(char *str, const char *delim, char **saveptr)
  1872. {
  1873. if (!str)
  1874. str = *saveptr;
  1875. char c;
  1876. loop {
  1877. c = *str;
  1878. if (!c) {
  1879. *saveptr = str;
  1880. return NULL;
  1881. }
  1882. if (!strchr(delim,c))
  1883. break;
  1884. str++;
  1885. }
  1886. char *ret=str;
  1887. do {
  1888. c = *(++str);
  1889. } while (c&&!strchr(delim,c));
  1890. if (c)
  1891. *(str++) = 0;
  1892. *saveptr = str;
  1893. return ret;
  1894. }
  1895. int j_memicmp (const void *s1, const void *s2, size32_t len)
  1896. {
  1897. const byte *b1 = (const byte *)s1;
  1898. const byte *b2 = (const byte *)s2;
  1899. int ret = 0;
  1900. while (len&&((ret = tolower(*b1)-tolower(*b2)) == 0)) {
  1901. b1++;
  1902. b2++;
  1903. len--;
  1904. }
  1905. return ret;
  1906. }
  1907. size32_t memcount(size32_t len, const char * str, char search)
  1908. {
  1909. size32_t count = 0;
  1910. for (size32_t i=0; i < len; i++)
  1911. {
  1912. if (str[i] == search)
  1913. count++;
  1914. }
  1915. return count;
  1916. }
  1917. StringBuffer & elideString(StringBuffer & s, unsigned maxLength)
  1918. {
  1919. if (s.length() > maxLength)
  1920. {
  1921. s.setLength(maxLength);
  1922. s.append("...");
  1923. }
  1924. return s;
  1925. }