sstrings.inc 26 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165
  1. {
  2. This file is part of the Free Pascal run time library.
  3. Copyright (c) 1999-2000 by the Free Pascal development team
  4. See the file COPYING.FPC, included in this distribution,
  5. for details about the copyright.
  6. This program is distributed in the hope that it will be useful,
  7. but WITHOUT ANY WARRANTY; without even the implied warranty of
  8. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  9. **********************************************************************}
  10. {****************************************************************************
  11. subroutines for string handling
  12. ****************************************************************************}
  13. procedure fpc_Shortstr_SetLength(var s:shortstring;len:SizeInt);[Public,Alias : 'FPC_SHORTSTR_SETLENGTH']; compilerproc;
  14. begin
  15. if Len>255 then
  16. Len:=255;
  17. s[0]:=chr(len);
  18. end;
  19. function fpc_shortstr_copy(const s : shortstring;index : SizeInt;count : SizeInt): shortstring;compilerproc;
  20. begin
  21. if count<0 then
  22. count:=0;
  23. if index>1 then
  24. dec(index)
  25. else
  26. index:=0;
  27. if index>length(s) then
  28. count:=0
  29. else
  30. if count>length(s)-index then
  31. count:=length(s)-index;
  32. fpc_shortstr_Copy[0]:=chr(Count);
  33. Move(s[Index+1],fpc_shortstr_Copy[1],Count);
  34. end;
  35. procedure delete(var s : shortstring;index : SizeInt;count : SizeInt);
  36. begin
  37. if index<=0 then
  38. exit;
  39. if (Index<=Length(s)) and (Count>0) then
  40. begin
  41. if Count>length(s)-Index then
  42. Count:=length(s)-Index+1;
  43. s[0]:=Chr(length(s)-Count);
  44. if Index<=Length(s) then
  45. Move(s[Index+Count],s[Index],Length(s)-Index+1);
  46. end;
  47. end;
  48. procedure insert(const source : shortstring;var s : shortstring;index : SizeInt);
  49. var
  50. cut,srclen,indexlen : SizeInt;
  51. begin
  52. if index<1 then
  53. index:=1;
  54. if index>length(s) then
  55. index:=length(s)+1;
  56. indexlen:=Length(s)-Index+1;
  57. srclen:=length(Source);
  58. if SizeInt(length(source)+length(s))>=sizeof(s) then
  59. begin
  60. cut:=SizeInt(length(source)+length(s))-sizeof(s)+1;
  61. if cut>indexlen then
  62. begin
  63. dec(srclen,cut-indexlen);
  64. indexlen:=0;
  65. end
  66. else
  67. dec(indexlen,cut);
  68. end;
  69. move(s[Index],s[Index+srclen],indexlen);
  70. move(Source[1],s[Index],srclen);
  71. s[0]:=chr(index+srclen+indexlen-1);
  72. end;
  73. procedure insert(source : Char;var s : shortstring;index : SizeInt);
  74. var
  75. indexlen : SizeInt;
  76. begin
  77. if index<1 then
  78. index:=1;
  79. if index>length(s) then
  80. index:=length(s)+1;
  81. indexlen:=Length(s)-Index+1;
  82. if (length(s)+1=sizeof(s)) and (indexlen>0) then
  83. dec(indexlen);
  84. move(s[Index],s[Index+1],indexlen);
  85. s[Index]:=Source;
  86. s[0]:=chr(index+indexlen);
  87. end;
  88. function pos(const substr : shortstring;const s : shortstring):SizeInt;
  89. var
  90. i,MaxLen : SizeInt;
  91. pc : pchar;
  92. begin
  93. Pos:=0;
  94. if Length(SubStr)>0 then
  95. begin
  96. MaxLen:=Length(s)-Length(SubStr);
  97. i:=0;
  98. pc:=@s[1];
  99. while (i<=MaxLen) do
  100. begin
  101. inc(i);
  102. if (SubStr[1]=pc^) and
  103. (CompareChar(Substr[1],pc^,Length(SubStr))=0) then
  104. begin
  105. Pos:=i;
  106. exit;
  107. end;
  108. inc(pc);
  109. end;
  110. end;
  111. end;
  112. {Faster when looking for a single char...}
  113. function pos(c:char;const s:shortstring):SizeInt;
  114. var
  115. i : SizeInt;
  116. pc : pchar;
  117. begin
  118. pc:=@s[1];
  119. for i:=1 to length(s) do
  120. begin
  121. if pc^=c then
  122. begin
  123. pos:=i;
  124. exit;
  125. end;
  126. inc(pc);
  127. end;
  128. pos:=0;
  129. end;
  130. function fpc_char_copy(c:char;index : SizeInt;count : SizeInt): shortstring;compilerproc;
  131. begin
  132. if (index=1) and (Count>0) then
  133. fpc_char_Copy:=c
  134. else
  135. fpc_char_Copy:='';
  136. end;
  137. function pos(const substr : shortstring;c:char): SizeInt;
  138. begin
  139. if (length(substr)=1) and (substr[1]=c) then
  140. Pos:=1
  141. else
  142. Pos:=0;
  143. end;
  144. {$ifdef IBM_CHAR_SET}
  145. const
  146. UpCaseTbl : shortstring[7]=#154#142#153#144#128#143#165;
  147. LoCaseTbl : shortstring[7]=#129#132#148#130#135#134#164;
  148. {$endif}
  149. function upcase(c : char) : char;
  150. {$IFDEF IBM_CHAR_SET}
  151. var
  152. i : longint;
  153. {$ENDIF}
  154. begin
  155. if (c in ['a'..'z']) then
  156. upcase:=char(byte(c)-32)
  157. else
  158. {$IFDEF IBM_CHAR_SET}
  159. begin
  160. i:=Pos(c,LoCaseTbl);
  161. if i>0 then
  162. upcase:=UpCaseTbl[i]
  163. else
  164. upcase:=c;
  165. end;
  166. {$ELSE}
  167. upcase:=c;
  168. {$ENDIF}
  169. end;
  170. function upcase(const s : shortstring) : shortstring;
  171. var
  172. i : longint;
  173. begin
  174. upcase[0]:=s[0];
  175. for i := 1 to length (s) do
  176. upcase[i] := upcase (s[i]);
  177. end;
  178. function lowercase(c : char) : char;overload;
  179. {$IFDEF IBM_CHAR_SET}
  180. var
  181. i : longint;
  182. {$ENDIF}
  183. begin
  184. if (c in ['A'..'Z']) then
  185. lowercase:=char(byte(c)+32)
  186. else
  187. {$IFDEF IBM_CHAR_SET}
  188. begin
  189. i:=Pos(c,UpCaseTbl);
  190. if i>0 then
  191. lowercase:=LoCaseTbl[i]
  192. else
  193. lowercase:=c;
  194. end;
  195. {$ELSE}
  196. lowercase:=c;
  197. {$ENDIF}
  198. end;
  199. function lowercase(const s : shortstring) : shortstring; overload;
  200. var
  201. i : longint;
  202. begin
  203. lowercase [0]:=s[0];
  204. for i:=1 to length(s) do
  205. lowercase[i]:=lowercase (s[i]);
  206. end;
  207. const
  208. HexTbl : array[0..15] of char='0123456789ABCDEF';
  209. function hexstr(val : longint;cnt : byte) : shortstring;
  210. var
  211. i : longint;
  212. begin
  213. hexstr[0]:=char(cnt);
  214. for i:=cnt downto 1 do
  215. begin
  216. hexstr[i]:=hextbl[val and $f];
  217. val:=val shr 4;
  218. end;
  219. end;
  220. function octstr(val : longint;cnt : byte) : shortstring;
  221. var
  222. i : longint;
  223. begin
  224. octstr[0]:=char(cnt);
  225. for i:=cnt downto 1 do
  226. begin
  227. octstr[i]:=hextbl[val and 7];
  228. val:=val shr 3;
  229. end;
  230. end;
  231. function binstr(val : longint;cnt : byte) : shortstring;
  232. var
  233. i : longint;
  234. begin
  235. binstr[0]:=char(cnt);
  236. for i:=cnt downto 1 do
  237. begin
  238. binstr[i]:=char(48+val and 1);
  239. val:=val shr 1;
  240. end;
  241. end;
  242. function hexstr(val : int64;cnt : byte) : shortstring;
  243. var
  244. i : longint;
  245. begin
  246. hexstr[0]:=char(cnt);
  247. for i:=cnt downto 1 do
  248. begin
  249. hexstr[i]:=hextbl[val and $f];
  250. val:=val shr 4;
  251. end;
  252. end;
  253. function octstr(val : int64;cnt : byte) : shortstring;
  254. var
  255. i : longint;
  256. begin
  257. octstr[0]:=char(cnt);
  258. for i:=cnt downto 1 do
  259. begin
  260. octstr[i]:=hextbl[val and 7];
  261. val:=val shr 3;
  262. end;
  263. end;
  264. function binstr(val : int64;cnt : byte) : shortstring;
  265. var
  266. i : longint;
  267. begin
  268. binstr[0]:=char(cnt);
  269. for i:=cnt downto 1 do
  270. begin
  271. binstr[i]:=char(48+val and 1);
  272. val:=val shr 1;
  273. end;
  274. end;
  275. function hexstr(val : pointer) : shortstring;
  276. var
  277. i : longint;
  278. v : ptrint;
  279. begin
  280. v:=ptrint(val);
  281. hexstr[0]:=chr(sizeof(pointer)*2);
  282. for i:=sizeof(pointer)*2 downto 1 do
  283. begin
  284. hexstr[i]:=hextbl[v and $f];
  285. v:=v shr 4;
  286. end;
  287. end;
  288. function space (b : byte): shortstring;
  289. begin
  290. space[0] := chr(b);
  291. FillChar (Space[1],b,' ');
  292. end;
  293. {*****************************************************************************
  294. Str() Helpers
  295. *****************************************************************************}
  296. procedure fpc_shortstr_SInt(v : valSInt;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_SINT']; compilerproc;
  297. begin
  298. int_str(v,s);
  299. if length(s)<len then
  300. s:=space(len-length(s))+s;
  301. end;
  302. procedure fpc_shortstr_UInt(v : valUInt;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_UINT']; compilerproc;
  303. begin
  304. int_str(v,s);
  305. if length(s)<len then
  306. s:=space(len-length(s))+s;
  307. end;
  308. {$ifndef CPU64}
  309. procedure fpc_shortstr_qword(v : qword;len : longint;out s : shortstring);[public,alias:'FPC_SHORTSTR_QWORD']; compilerproc;
  310. begin
  311. int_str(v,s);
  312. if length(s)<len then
  313. s:=space(len-length(s))+s;
  314. end;
  315. procedure fpc_shortstr_int64(v : int64;len : longint;out s : shortstring);[public,alias:'FPC_SHORTSTR_INT64']; compilerproc;
  316. begin
  317. int_str(v,s);
  318. if length(s)<len then
  319. s:=space(len-length(s))+s;
  320. end;
  321. {$endif CPU64}
  322. { fpc_shortstr_sInt must appear before this file is included, because }
  323. { it's used inside real2str.inc and otherwise the searching via the }
  324. { compilerproc name will fail (JM) }
  325. {$I real2str.inc}
  326. procedure fpc_ShortStr_Float(d : ValReal;len,fr,rt : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_FLOAT']; compilerproc;
  327. begin
  328. str_real(len,fr,d,treal_type(rt),s);
  329. end;
  330. procedure fpc_ShortStr_Currency(c : currency; len,f : SizeInt; out s : shortstring);[public,alias:'FPC_SHORTSTR_CURRENCY']; compilerproc;
  331. const
  332. MinLen = 8; { Minimal string length in scientific format }
  333. var
  334. buf : array[1..19] of char;
  335. i,j,k,reslen,tlen,sign,r,point : longint;
  336. ic : qword;
  337. begin
  338. { default value for length is -32767 }
  339. if len=-32767 then
  340. len:=25;
  341. if PInt64(@c)^ >= 0 then
  342. begin
  343. ic:=QWord(PInt64(@c)^);
  344. sign:=0;
  345. end
  346. else
  347. begin
  348. sign:=1;
  349. ic:=QWord(-PInt64(@c)^);
  350. end;
  351. { converting to integer string }
  352. tlen:=0;
  353. repeat
  354. Inc(tlen);
  355. buf[tlen]:=Chr(ic mod 10 + $30);
  356. ic:=ic div 10;
  357. until ic = 0;
  358. { calculating:
  359. reslen - length of result string,
  360. r - rounding or appending zeroes,
  361. point - place of decimal point }
  362. reslen:=tlen;
  363. if f <> 0 then
  364. Inc(reslen); { adding decimal point length }
  365. if f < 0 then
  366. begin
  367. { scientific format }
  368. Inc(reslen,5); { adding length of sign and exponent }
  369. if len < MinLen then
  370. len:=MinLen;
  371. r:=reslen-len;
  372. if reslen < len then
  373. reslen:=len;
  374. if r > 0 then
  375. begin
  376. reslen:=len;
  377. point:=tlen - r;
  378. end
  379. else
  380. point:=tlen;
  381. end
  382. else
  383. begin
  384. { fixed format }
  385. Inc(reslen, sign);
  386. { prepending fractional part with zeroes }
  387. while tlen < 5 do
  388. begin
  389. Inc(reslen);
  390. Inc(tlen);
  391. buf[tlen]:='0';
  392. end;
  393. { Currency have 4 digits in fractional part }
  394. r:=4 - f;
  395. point:=f;
  396. if point <> 0 then
  397. begin
  398. if point > 4 then
  399. point:=4;
  400. Inc(point);
  401. end;
  402. Dec(reslen,r);
  403. end;
  404. { rounding string if r > 0 }
  405. if r > 0 then
  406. begin
  407. i:=1;
  408. k:=0;
  409. for j:=0 to r do
  410. begin
  411. buf[i]:=chr(ord(buf[i]) + k);
  412. if buf[i] >= '5' then
  413. k:=1
  414. else
  415. k:=0;
  416. Inc(i);
  417. if i>tlen then
  418. break;
  419. end;
  420. end;
  421. { preparing result string }
  422. if reslen<len then
  423. reslen:=len;
  424. if reslen>High(s) then
  425. begin
  426. if r < 0 then
  427. Inc(r, reslen - High(s));
  428. reslen:=High(s);
  429. end;
  430. SetLength(s,reslen);
  431. j:=reslen;
  432. if f<0 then
  433. begin
  434. { writing power of 10 part }
  435. if PInt64(@c)^ = 0 then
  436. k:=0
  437. else
  438. k:=tlen-5;
  439. if k >= 0 then
  440. s[j-2]:='+'
  441. else
  442. begin
  443. s[j-2]:='-';
  444. k:=-k;
  445. end;
  446. s[j]:=Chr(k mod 10 + $30);
  447. Dec(j);
  448. s[j]:=Chr(k div 10 + $30);
  449. Dec(j,2);
  450. s[j]:='E';
  451. Dec(j);
  452. end;
  453. { writing extra zeroes if r < 0 }
  454. while r < 0 do
  455. begin
  456. s[j]:='0';
  457. Dec(j);
  458. Inc(r);
  459. end;
  460. { writing digits and decimal point }
  461. for i:=r + 1 to tlen do
  462. begin
  463. Dec(point);
  464. if point = 0 then
  465. begin
  466. s[j]:='.';
  467. Dec(j);
  468. end;
  469. s[j]:=buf[i];
  470. Dec(j);
  471. end;
  472. { writing sign }
  473. if sign = 1 then
  474. begin
  475. s[j]:='-';
  476. Dec(j);
  477. end;
  478. { writing spaces }
  479. while j > 0 do
  480. begin
  481. s[j]:=' ';
  482. Dec(j);
  483. end;
  484. end;
  485. {
  486. Array Of Char Str() helpers
  487. }
  488. procedure fpc_chararray_sint(v : valsint;len : SizeInt;out a:array of char);compilerproc;
  489. var
  490. ss : shortstring;
  491. maxlen : SizeInt;
  492. begin
  493. int_str(v,ss);
  494. if length(ss)<len then
  495. ss:=space(len-length(ss))+ss;
  496. if length(ss)<high(a)+1 then
  497. maxlen:=length(ss)
  498. else
  499. maxlen:=high(a)+1;
  500. move(ss[1],pchar(@a)^,maxlen);
  501. end;
  502. procedure fpc_chararray_uint(v : valuint;len : SizeInt;out a : array of char);compilerproc;
  503. var
  504. ss : shortstring;
  505. maxlen : SizeInt;
  506. begin
  507. int_str(v,ss);
  508. if length(ss)<len then
  509. ss:=space(len-length(ss))+ss;
  510. if length(ss)<high(a)+1 then
  511. maxlen:=length(ss)
  512. else
  513. maxlen:=high(a)+1;
  514. move(ss[1],pchar(@a)^,maxlen);
  515. end;
  516. {$ifndef CPU64}
  517. procedure fpc_chararray_qword(v : qword;len : SizeInt;out a : array of char);compilerproc;
  518. var
  519. ss : shortstring;
  520. maxlen : SizeInt;
  521. begin
  522. int_str(v,ss);
  523. if length(ss)<len then
  524. ss:=space(len-length(ss))+ss;
  525. if length(ss)<high(a)+1 then
  526. maxlen:=length(ss)
  527. else
  528. maxlen:=high(a)+1;
  529. move(ss[1],pchar(@a)^,maxlen);
  530. end;
  531. procedure fpc_chararray_int64(v : int64;len : SizeInt;out a : array of char);compilerproc;
  532. var
  533. ss : shortstring;
  534. maxlen : SizeInt;
  535. begin
  536. int_str(v,ss);
  537. if length(ss)<len then
  538. ss:=space(len-length(ss))+ss;
  539. if length(ss)<high(a)+1 then
  540. maxlen:=length(ss)
  541. else
  542. maxlen:=high(a)+1;
  543. move(ss[1],pchar(@a)^,maxlen);
  544. end;
  545. {$endif CPU64}
  546. procedure fpc_chararray_Float(d : ValReal;len,fr,rt : SizeInt;out a : array of char);compilerproc;
  547. var
  548. ss : shortstring;
  549. maxlen : SizeInt;
  550. begin
  551. str_real(len,fr,d,treal_type(rt),ss);
  552. if length(ss)<high(a)+1 then
  553. maxlen:=length(ss)
  554. else
  555. maxlen:=high(a)+1;
  556. move(ss[1],pchar(@a)^,maxlen);
  557. end;
  558. {$ifdef FPC_HAS_STR_CURRENCY}
  559. procedure fpc_chararray_Currency(c : Currency;len,fr : SizeInt;out a : array of char);compilerproc;
  560. var
  561. ss : shortstring;
  562. maxlen : SizeInt;
  563. begin
  564. str(c:len:fr,ss);
  565. if length(ss)<high(a)+1 then
  566. maxlen:=length(ss)
  567. else
  568. maxlen:=high(a)+1;
  569. move(ss[1],pchar(@a)^,maxlen);
  570. end;
  571. {$endif FPC_HAS_STR_CURRENCY}
  572. {*****************************************************************************
  573. Val() Functions
  574. *****************************************************************************}
  575. Function InitVal(const s:shortstring;out negativ:boolean;out base:byte):ValSInt;
  576. var
  577. Code : SizeInt;
  578. begin
  579. {Skip Spaces and Tab}
  580. code:=1;
  581. while (code<=length(s)) and (s[code] in [' ',#9]) do
  582. inc(code);
  583. {Sign}
  584. negativ:=false;
  585. case s[code] of
  586. '-' : begin
  587. negativ:=true;
  588. inc(code);
  589. end;
  590. '+' : inc(code);
  591. end;
  592. {Base}
  593. base:=10;
  594. if code<=length(s) then
  595. begin
  596. case s[code] of
  597. '$',
  598. 'X',
  599. 'x' : begin
  600. base:=16;
  601. inc(code);
  602. end;
  603. '%' : begin
  604. base:=2;
  605. inc(code);
  606. end;
  607. '&' : begin
  608. Base:=8;
  609. inc(code);
  610. end;
  611. '0' : begin
  612. if (code < length(s)) and (s[code+1] in ['x', 'X']) then
  613. begin
  614. inc(code, 2);
  615. base := 16;
  616. end;
  617. end;
  618. end;
  619. end;
  620. { strip leading zeros }
  621. while ((code < length(s)) and (s[code] = '0')) do begin
  622. inc(code);
  623. end;
  624. InitVal:=code;
  625. end;
  626. Function fpc_Val_SInt_ShortStr(DestSize: SizeInt; Const S: ShortString; out Code: ValSInt): ValSInt; [public, alias:'FPC_VAL_SINT_SHORTSTR']; compilerproc;
  627. var
  628. u, temp, prev, maxPrevValue, maxNewValue: ValUInt;
  629. base : byte;
  630. negative : boolean;
  631. begin
  632. fpc_Val_SInt_ShortStr := 0;
  633. Temp:=0;
  634. Code:=InitVal(s,negative,base);
  635. if Code>length(s) then
  636. exit;
  637. maxPrevValue := ValUInt(MaxUIntValue) div ValUInt(Base);
  638. if (base = 10) then
  639. maxNewValue := MaxSIntValue + ord(negative)
  640. else
  641. maxNewValue := MaxUIntValue;
  642. while Code<=Length(s) do
  643. begin
  644. case s[Code] of
  645. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  646. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  647. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  648. #0 : break;
  649. else
  650. u:=16;
  651. end;
  652. Prev := Temp;
  653. Temp := Temp*ValUInt(base);
  654. If (u >= base) or
  655. (ValUInt(maxNewValue-u) < Temp) or
  656. (prev > maxPrevValue) Then
  657. Begin
  658. fpc_Val_SInt_ShortStr := 0;
  659. Exit
  660. End;
  661. Temp:=Temp+u;
  662. inc(code);
  663. end;
  664. code := 0;
  665. fpc_Val_SInt_ShortStr := ValSInt(Temp);
  666. If Negative Then
  667. fpc_Val_SInt_ShortStr := -fpc_Val_SInt_ShortStr;
  668. If Not(Negative) and (base <> 10) Then
  669. {sign extend the result to allow proper range checking}
  670. Case DestSize of
  671. 1: fpc_Val_SInt_ShortStr := shortint(fpc_Val_SInt_ShortStr);
  672. 2: fpc_Val_SInt_ShortStr := smallint(fpc_Val_SInt_ShortStr);
  673. {$ifdef cpu64}
  674. 4: fpc_Val_SInt_ShortStr := longint(fpc_Val_SInt_ShortStr);
  675. {$endif cpu64}
  676. End;
  677. end;
  678. { we need this for fpc_Val_SInt_Ansistr and fpc_Val_SInt_WideStr because }
  679. { we have to pass the DestSize parameter on (JM) }
  680. Function int_Val_SInt_ShortStr(DestSize: SizeInt; Const S: ShortString; out Code: ValSInt): ValSInt; [external name 'FPC_VAL_SINT_SHORTSTR'];
  681. Function fpc_Val_UInt_Shortstr(Const S: ShortString; out Code: ValSInt): ValUInt; [public, alias:'FPC_VAL_UINT_SHORTSTR']; compilerproc;
  682. var
  683. u, prev : ValUInt;
  684. base : byte;
  685. negative : boolean;
  686. begin
  687. fpc_Val_UInt_Shortstr:=0;
  688. Code:=InitVal(s,negative,base);
  689. If Negative or (Code>length(s)) Then
  690. Exit;
  691. while Code<=Length(s) do
  692. begin
  693. case s[Code] of
  694. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  695. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  696. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  697. #0 : break;
  698. else
  699. u:=16;
  700. end;
  701. prev := fpc_Val_UInt_Shortstr;
  702. If (u>=base) or
  703. (ValUInt(MaxUIntValue-u) div ValUInt(Base)<prev) then
  704. begin
  705. fpc_Val_UInt_Shortstr:=0;
  706. exit;
  707. end;
  708. fpc_Val_UInt_Shortstr:=fpc_Val_UInt_Shortstr*ValUInt(base) + u;
  709. inc(code);
  710. end;
  711. code := 0;
  712. end;
  713. {$ifndef CPU64}
  714. Function fpc_val_int64_shortstr(Const S: ShortString; out Code: ValSInt): Int64; [public, alias:'FPC_VAL_INT64_SHORTSTR']; compilerproc;
  715. var u, temp, prev, maxprevvalue, maxnewvalue : qword;
  716. base : byte;
  717. negative : boolean;
  718. const maxint64=qword($7fffffffffffffff);
  719. maxqword=qword($ffffffffffffffff);
  720. begin
  721. fpc_val_int64_shortstr := 0;
  722. Temp:=0;
  723. Code:=InitVal(s,negative,base);
  724. if Code>length(s) then
  725. exit;
  726. maxprevvalue := maxqword div base;
  727. if (base = 10) then
  728. maxnewvalue := maxint64 + ord(negative)
  729. else
  730. maxnewvalue := maxqword;
  731. while Code<=Length(s) do
  732. begin
  733. case s[Code] of
  734. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  735. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  736. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  737. #0 : break;
  738. else
  739. u:=16;
  740. end;
  741. Prev:=Temp;
  742. Temp:=Temp*qword(base);
  743. If (u >= base) or
  744. (qword(maxnewvalue-u) < temp) or
  745. (prev > maxprevvalue) Then
  746. Begin
  747. fpc_val_int64_shortstr := 0;
  748. Exit
  749. End;
  750. Temp:=Temp+u;
  751. inc(code);
  752. end;
  753. code:=0;
  754. fpc_val_int64_shortstr:=int64(Temp);
  755. If Negative Then
  756. fpc_val_int64_shortstr:=-fpc_val_int64_shortstr;
  757. end;
  758. Function fpc_val_qword_shortstr(Const S: ShortString; out Code: ValSInt): QWord; [public, alias:'FPC_VAL_QWORD_SHORTSTR']; compilerproc;
  759. type qwordrec = packed record
  760. l1,l2: longint;
  761. end;
  762. var
  763. u, prev, maxqword: QWord;
  764. base : byte;
  765. negative : boolean;
  766. begin
  767. fpc_val_qword_shortstr:=0;
  768. Code:=InitVal(s,negative,base);
  769. If Negative or (Code>length(s)) Then
  770. Exit;
  771. with qwordrec(maxqword) do
  772. begin
  773. l1 := longint($ffffffff);
  774. l2 := longint($ffffffff);
  775. end;
  776. while Code<=Length(s) do
  777. begin
  778. case s[Code] of
  779. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  780. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  781. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  782. #0 : break;
  783. else
  784. u:=16;
  785. end;
  786. prev := fpc_val_qword_shortstr;
  787. If (u>=base) or
  788. ((QWord(maxqword-u) div QWord(base))<prev) then
  789. Begin
  790. fpc_val_qword_shortstr := 0;
  791. Exit
  792. End;
  793. fpc_val_qword_shortstr:=fpc_val_qword_shortstr*QWord(base) + u;
  794. inc(code);
  795. end;
  796. code := 0;
  797. end;
  798. {$endif CPU64}
  799. const
  800. {$ifdef FPC_HAS_TYPE_EXTENDED}
  801. valmaxexpnorm=4932;
  802. {$else}
  803. {$ifdef FPC_HAS_TYPE_DOUBLE}
  804. valmaxexpnorm=308;
  805. {$else}
  806. {$ifdef FPC_HAS_TYPE_SINGLE}
  807. valmaxexpnorm=38;
  808. {$else}
  809. {$error Unknown floating point precision }
  810. {$endif}
  811. {$endif}
  812. {$endif}
  813. Function fpc_Val_Real_ShortStr(const s : shortstring; out Code : ValSInt): ValReal; [public, alias:'FPC_VAL_REAL_SHORTSTR']; compilerproc;
  814. var
  815. hd,
  816. esign,sign : valreal;
  817. exponent,i : SizeInt;
  818. flags : byte;
  819. begin
  820. fpc_Val_Real_ShortStr:=0.0;
  821. code:=1;
  822. exponent:=0;
  823. esign:=1;
  824. flags:=0;
  825. sign:=1;
  826. while (code<=length(s)) and (s[code] in [' ',#9]) do
  827. inc(code);
  828. if code<=length(s) then
  829. case s[code] of
  830. '+' : inc(code);
  831. '-' : begin
  832. sign:=-1;
  833. inc(code);
  834. end;
  835. end;
  836. while (Code<=Length(s)) and (s[code] in ['0'..'9']) do
  837. begin
  838. { Read integer part }
  839. flags:=flags or 1;
  840. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*10+(ord(s[code])-ord('0'));
  841. inc(code);
  842. end;
  843. { Decimal ? }
  844. if (length(s)>=code) and (s[code]='.') then
  845. begin
  846. hd:=1.0;
  847. inc(code);
  848. while (length(s)>=code) and (s[code] in ['0'..'9']) do
  849. begin
  850. { Read fractional part. }
  851. flags:=flags or 2;
  852. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*10+(ord(s[code])-ord('0'));
  853. hd:=hd*10.0;
  854. inc(code);
  855. end;
  856. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr/hd;
  857. end;
  858. { Again, read integer and fractional part}
  859. if flags=0 then
  860. begin
  861. fpc_Val_Real_ShortStr:=0.0;
  862. exit;
  863. end;
  864. { Exponent ? }
  865. if (length(s)>=code) and (upcase(s[code])='E') then
  866. begin
  867. inc(code);
  868. if Length(s) >= code then
  869. if s[code]='+' then
  870. inc(code)
  871. else
  872. if s[code]='-' then
  873. begin
  874. esign:=-1;
  875. inc(code);
  876. end;
  877. if (length(s)<code) or not(s[code] in ['0'..'9']) then
  878. begin
  879. fpc_Val_Real_ShortStr:=0.0;
  880. exit;
  881. end;
  882. while (length(s)>=code) and (s[code] in ['0'..'9']) do
  883. begin
  884. exponent:=exponent*10;
  885. exponent:=exponent+ord(s[code])-ord('0');
  886. inc(code);
  887. end;
  888. end;
  889. { evaluate sign }
  890. { (before exponent, because the exponent may turn it into a denormal) }
  891. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*sign;
  892. { Calculate Exponent }
  893. hd:=1.0;
  894. { the magnitude range maximum (normal) is lower in absolute value than the }
  895. { the magnitude range minimum (denormal). E.g. an extended value can go }
  896. { up to 1E4932, but "down" to 1E-4951. So make sure that we don't try to }
  897. { calculate 1E4951 as factor, since that would overflow and result in 0. }
  898. if (exponent>valmaxexpnorm-2) then
  899. begin
  900. for i:=1 to valmaxexpnorm-2 do
  901. hd:=hd*10.0;
  902. if esign>0 then
  903. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*hd
  904. else
  905. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr/hd;
  906. dec(exponent,valmaxexpnorm-2);
  907. hd:=1.0;
  908. end;
  909. for i:=1 to exponent do
  910. hd:=hd*10.0;
  911. if esign>0 then
  912. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*hd
  913. else
  914. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr/hd;
  915. { Not all characters are read ? }
  916. if length(s)>=code then
  917. begin
  918. fpc_Val_Real_ShortStr:=0.0;
  919. exit;
  920. end;
  921. { success ! }
  922. code:=0;
  923. end;
  924. Function fpc_Val_Currency_ShortStr(const s : shortstring; out Code : ValSInt): currency; [public, alias:'FPC_VAL_CURRENCY_SHORTSTR']; compilerproc;
  925. const
  926. MaxInt64 : Int64 = $7FFFFFFFFFFFFFFF;
  927. Int64Edge : Int64 = ($7FFFFFFFFFFFFFFF - 10) div 10;
  928. Int64Edge2 : Int64 = $7FFFFFFFFFFFFFFF div 10;
  929. var
  930. res : Int64;
  931. i,j,power,sign,len : longint;
  932. FracOverflow : boolean;
  933. begin
  934. fpc_Val_Currency_ShortStr:=0;
  935. res:=0;
  936. len:=Length(s);
  937. Code:=1;
  938. sign:=1;
  939. power:=0;
  940. while True do
  941. if Code > len then
  942. exit
  943. else
  944. if s[Code] in [' ', #9] then
  945. Inc(Code)
  946. else
  947. break;
  948. { Read sign }
  949. case s[Code] of
  950. '+' : Inc(Code);
  951. '-' : begin
  952. sign:=-1;
  953. inc(code);
  954. end;
  955. end;
  956. { Read digits }
  957. FracOverflow:=False;
  958. i:=0;
  959. while Code <= len do
  960. begin
  961. case s[Code] of
  962. '0'..'9':
  963. begin
  964. j:=Ord(s[code])-Ord('0');
  965. { check overflow }
  966. if (res <= Int64Edge) or (res <= (MaxInt64 - j) div 10) then
  967. begin
  968. res:=res*10 + j;
  969. Inc(i);
  970. end
  971. else
  972. if power = 0 then
  973. { exit if integer part overflow }
  974. exit
  975. else
  976. begin
  977. if not FracOverflow and (j >= 5) and (res < MaxInt64) then
  978. { round if first digit of fractional part overflow }
  979. Inc(res);
  980. FracOverflow:=True;
  981. end;
  982. end;
  983. '.':
  984. begin
  985. if power = 0 then
  986. begin
  987. power:=1;
  988. i:=0;
  989. end
  990. else
  991. exit;
  992. end;
  993. else
  994. break;
  995. end;
  996. Inc(Code);
  997. end;
  998. if (i = 0) and (power = 0) then
  999. exit;
  1000. if power <> 0 then
  1001. power:=i;
  1002. power:=4 - power;
  1003. { Exponent? }
  1004. if Code <= len then
  1005. if s[Code] in ['E', 'e'] then
  1006. begin
  1007. Inc(Code);
  1008. if Code > len then
  1009. exit;
  1010. i:=1;
  1011. case s[Code] of
  1012. '+':
  1013. Inc(Code);
  1014. '-':
  1015. begin
  1016. i:=-1;
  1017. Inc(Code);
  1018. end;
  1019. end;
  1020. { read exponent }
  1021. j:=0;
  1022. while Code <= len do
  1023. if s[Code] in ['0'..'9'] then
  1024. begin
  1025. if j > 4951 then
  1026. exit;
  1027. j:=j*10 + (Ord(s[code])-Ord('0'));
  1028. Inc(Code);
  1029. end
  1030. else
  1031. exit;
  1032. power:=power + j*i;
  1033. end
  1034. else
  1035. exit;
  1036. if power > 0 then
  1037. begin
  1038. for i:=1 to power do
  1039. if res <= Int64Edge2 then
  1040. res:=res*10
  1041. else
  1042. exit;
  1043. end
  1044. else
  1045. for i:=1 to -power do
  1046. begin
  1047. if res <= MaxInt64 - 5 then
  1048. Inc(res, 5);
  1049. res:=res div 10;
  1050. end;
  1051. res:=res*sign;
  1052. fpc_Val_Currency_ShortStr:=PCurrency(@res)^;
  1053. Code:=0;
  1054. end;
  1055. Procedure SetString (Out S : Shortstring; Buf : PChar; Len : SizeInt);
  1056. begin
  1057. If Len > High(S) then
  1058. Len := High(S);
  1059. SetLength(S,Len);
  1060. If Buf<>Nil then
  1061. begin
  1062. Move (Buf[0],S[1],Len);
  1063. end;
  1064. end;