sstrings.inc 53 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135
  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. {$ifndef FPC_HAS_SHORTSTR_SETLENGTH}
  14. {$define FPC_HAS_SHORTSTR_SETLENGTH}
  15. procedure fpc_Shortstr_SetLength(var s:shortstring;len:SizeInt);[Public,Alias : 'FPC_SHORTSTR_SETLENGTH']; compilerproc;
  16. begin
  17. if Len>255 then
  18. Len:=255;
  19. s[0]:=chr(len);
  20. end;
  21. {$endif FPC_HAS_SHORTSTR_SETLENGTH}
  22. {$ifndef FPC_HAS_SHORTSTR_COPY}
  23. {$define FPC_HAS_SHORTSTR_COPY}
  24. function fpc_shortstr_copy(const s : shortstring;index : SizeInt;count : SizeInt): shortstring;compilerproc;
  25. begin
  26. if count<0 then
  27. count:=0;
  28. if index>1 then
  29. dec(index)
  30. else
  31. index:=0;
  32. if index>length(s) then
  33. count:=0
  34. else
  35. if count>length(s)-index then
  36. count:=length(s)-index;
  37. fpc_shortstr_Copy[0]:=chr(Count);
  38. fpc_shortstr_shortstr_intern_charmove(s,Index+1,fpc_shortstr_Copy,1,Count);
  39. end;
  40. {$endif FPC_HAS_SHORTSTR_COPY}
  41. {$ifndef FPC_HAS_SHORTSTR_DELETE}
  42. {$define FPC_HAS_SHORTSTR_DELETE}
  43. procedure delete(var s : shortstring;index : SizeInt;count : SizeInt);
  44. begin
  45. if index<=0 then
  46. exit;
  47. if (Index<=Length(s)) and (Count>0) then
  48. begin
  49. if Count>length(s)-Index then
  50. Count:=length(s)-Index+1;
  51. s[0]:=Chr(length(s)-Count);
  52. if Index<=Length(s) then
  53. fpc_shortstr_shortstr_intern_charmove(s,Index+Count,s,Index,Length(s)-Index+1);
  54. end;
  55. end;
  56. {$endif FPC_HAS_SHORTSTR_DELETE}
  57. {$ifndef FPC_HAS_SHORTSTR_INSERT}
  58. {$define FPC_HAS_SHORTSTR_INSERT}
  59. procedure insert(const source : shortstring;var s : shortstring;index : SizeInt);
  60. var
  61. cut,srclen,indexlen : SizeInt;
  62. begin
  63. if index<1 then
  64. index:=1;
  65. if index>length(s) then
  66. begin
  67. index:=length(s)+1;
  68. if index>high(s) then
  69. exit;
  70. end;
  71. indexlen:=Length(s)-Index+1;
  72. srclen:=length(Source);
  73. if sizeInt(length(source))+sizeint(length(s))>=sizeof(s) then
  74. begin
  75. cut:=sizeInt(length(source))+sizeint(length(s))-sizeof(s)+1;
  76. if cut>indexlen then
  77. begin
  78. dec(srclen,cut-indexlen);
  79. indexlen:=0;
  80. end
  81. else
  82. dec(indexlen,cut);
  83. end;
  84. fpc_shortstr_shortstr_intern_charmove(s,Index,s,Index+srclen,indexlen);
  85. fpc_shortstr_shortstr_intern_charmove(Source,1,s,Index,srclen);
  86. s[0]:=chr(index+srclen+indexlen-1);
  87. end;
  88. {$endif FPC_HAS_SHORTSTR_INSERT}
  89. {$ifndef FPC_HAS_SHORTSTR_INSERT_CHAR}
  90. {$define FPC_HAS_SHORTSTR_INSERT_CHAR}
  91. procedure insert(source : Char;var s : shortstring;index : SizeInt);
  92. var
  93. indexlen : SizeInt;
  94. begin
  95. if index<1 then
  96. index:=1;
  97. if index>length(s) then
  98. begin
  99. index:=length(s)+1;
  100. if index>high(s) then
  101. exit;
  102. end;
  103. indexlen:=Length(s)-Index+1;
  104. if (sizeint(length(s))+1=sizeof(s)) and (indexlen>0) then
  105. dec(indexlen);
  106. fpc_shortstr_shortstr_intern_charmove(s,Index,s,Index+1,indexlen);
  107. s[Index]:=Source;
  108. s[0]:=chr(index+indexlen);
  109. end;
  110. {$endif FPC_HAS_SHORTSTR_INSERT_CHAR}
  111. {$ifndef FPC_HAS_SHORTSTR_POS_SHORTSTR}
  112. {$define FPC_HAS_SHORTSTR_POS_SHORTSTR}
  113. function pos(const substr : shortstring;const s : shortstring):SizeInt;
  114. var
  115. i,MaxLen : SizeInt;
  116. pc : pchar;
  117. begin
  118. Pos:=0;
  119. if Length(SubStr)>0 then
  120. begin
  121. MaxLen:=sizeint(Length(s))-Length(SubStr);
  122. i:=0;
  123. pc:=@s[1];
  124. while (i<=MaxLen) do
  125. begin
  126. inc(i);
  127. if (SubStr[1]=pc^) and
  128. (CompareChar(Substr[1],pc^,Length(SubStr))=0) then
  129. begin
  130. Pos:=i;
  131. exit;
  132. end;
  133. inc(pc);
  134. end;
  135. end;
  136. end;
  137. {$endif FPC_HAS_SHORTSTR_POS_SHORTSTR}
  138. {$ifndef FPC_HAS_SHORTSTR_POS_CHAR}
  139. {$define FPC_HAS_SHORTSTR_POS_CHAR}
  140. {Faster when looking for a single char...}
  141. function pos(c:char;const s:shortstring):SizeInt;
  142. var
  143. i : SizeInt;
  144. pc : pchar;
  145. begin
  146. pc:=@s[1];
  147. for i:=1 to length(s) do
  148. begin
  149. if pc^=c then
  150. begin
  151. pos:=i;
  152. exit;
  153. end;
  154. inc(pc);
  155. end;
  156. pos:=0;
  157. end;
  158. {$endif FPC_HAS_SHORTSTR_POS_CHAR}
  159. function fpc_char_copy(c:char;index : SizeInt;count : SizeInt): shortstring;compilerproc;
  160. begin
  161. if (index=1) and (Count>0) then
  162. fpc_char_Copy:=c
  163. else
  164. fpc_char_Copy:='';
  165. end;
  166. function pos(const substr : shortstring;c:char): SizeInt;
  167. begin
  168. if (length(substr)=1) and (substr[1]=c) then
  169. Pos:=1
  170. else
  171. Pos:=0;
  172. end;
  173. {$if not defined(FPC_UPCASE_CHAR) or not defined(FPC_LOWERCASE_CHAR)}
  174. {$ifdef IBM_CHAR_SET}
  175. const
  176. UpCaseTbl : shortstring[7]=#154#142#153#144#128#143#165;
  177. LoCaseTbl : shortstring[7]=#129#132#148#130#135#134#164;
  178. {$endif}
  179. {$endif}
  180. {$ifndef FPC_UPCASE_CHAR}
  181. {$define FPC_UPCASE_CHAR}
  182. function upcase(c : char) : char;
  183. {$IFDEF IBM_CHAR_SET}
  184. var
  185. i : ObjpasInt;
  186. {$ENDIF}
  187. begin
  188. if (c in ['a'..'z']) then
  189. upcase:=char(byte(c)-32)
  190. else
  191. {$IFDEF IBM_CHAR_SET}
  192. begin
  193. i:=Pos(c,LoCaseTbl);
  194. if i>0 then
  195. upcase:=UpCaseTbl[i]
  196. else
  197. upcase:=c;
  198. end;
  199. {$ELSE}
  200. upcase:=c;
  201. {$ENDIF}
  202. end;
  203. {$endif FPC_UPCASE_CHAR}
  204. {$ifndef FPC_UPCASE_SHORTSTR}
  205. {$define FPC_UPCASE_SHORTSTR}
  206. function upcase(const s : shortstring) : shortstring;
  207. var
  208. i : ObjpasInt;
  209. begin
  210. upcase[0]:=s[0];
  211. for i := 1 to length (s) do
  212. upcase[i] := upcase (s[i]);
  213. end;
  214. {$endif FPC_UPCASE_SHORTSTR}
  215. {$ifndef FPC_LOWERCASE_CHAR}
  216. {$define FPC_LOWERCASE_CHAR}
  217. function lowercase(c : char) : char;overload;
  218. {$IFDEF IBM_CHAR_SET}
  219. var
  220. i : ObjpasInt;
  221. {$ENDIF}
  222. begin
  223. if (c in ['A'..'Z']) then
  224. lowercase:=char(byte(c)+32)
  225. else
  226. {$IFDEF IBM_CHAR_SET}
  227. begin
  228. i:=Pos(c,UpCaseTbl);
  229. if i>0 then
  230. lowercase:=LoCaseTbl[i]
  231. else
  232. lowercase:=c;
  233. end;
  234. {$ELSE}
  235. lowercase:=c;
  236. {$ENDIF}
  237. end;
  238. {$endif FPC_LOWERCASE_CHAR}
  239. {$ifndef FPC_LOWERCASE_SHORTSTR}
  240. {$define FPC_LOWERCASE_SHORTSTR}
  241. function lowercase(const s : shortstring) : shortstring; overload;
  242. var
  243. i : ObjpasInt;
  244. begin
  245. lowercase [0]:=s[0];
  246. for i:=1 to length(s) do
  247. lowercase[i]:=lowercase (s[i]);
  248. end;
  249. {$endif FPC_LOWERCASE_SHORTSTR}
  250. const
  251. HexTbl : array[0..15] of char='0123456789ABCDEF';
  252. function hexstr(val : longint;cnt : byte) : shortstring;
  253. var
  254. i : ObjpasInt;
  255. begin
  256. hexstr[0]:=char(cnt);
  257. for i:=cnt downto 1 do
  258. begin
  259. hexstr[i]:=hextbl[val and $f];
  260. val:=val shr 4;
  261. end;
  262. end;
  263. function octstr(val : longint;cnt : byte) : shortstring;
  264. var
  265. i : ObjpasInt;
  266. begin
  267. octstr[0]:=char(cnt);
  268. for i:=cnt downto 1 do
  269. begin
  270. octstr[i]:=hextbl[val and 7];
  271. val:=val shr 3;
  272. end;
  273. end;
  274. function binstr(val : longint;cnt : byte) : shortstring;
  275. var
  276. i : ObjpasInt;
  277. begin
  278. binstr[0]:=char(cnt);
  279. for i:=cnt downto 1 do
  280. begin
  281. binstr[i]:=char(48+val and 1);
  282. val:=val shr 1;
  283. end;
  284. end;
  285. function hexstr(val : int64;cnt : byte) : shortstring;
  286. var
  287. i : ObjpasInt;
  288. begin
  289. hexstr[0]:=char(cnt);
  290. for i:=cnt downto 1 do
  291. begin
  292. hexstr[i]:=hextbl[val and $f];
  293. val:=val shr 4;
  294. end;
  295. end;
  296. function octstr(val : int64;cnt : byte) : shortstring;
  297. var
  298. i : ObjpasInt;
  299. begin
  300. octstr[0]:=char(cnt);
  301. for i:=cnt downto 1 do
  302. begin
  303. octstr[i]:=hextbl[val and 7];
  304. val:=val shr 3;
  305. end;
  306. end;
  307. function binstr(val : int64;cnt : byte) : shortstring;
  308. var
  309. i : ObjpasInt;
  310. begin
  311. binstr[0]:=char(cnt);
  312. for i:=cnt downto 1 do
  313. begin
  314. binstr[i]:=char(48+val and 1);
  315. val:=val shr 1;
  316. end;
  317. end;
  318. {$ifndef FPC_HAS_QWORD_HEX_SHORTSTR}
  319. {$define FPC_HAS_QWORD_HEX_SHORTSTR}
  320. Function hexStr(Val:qword;cnt:byte):shortstring;
  321. begin
  322. hexStr:=hexStr(int64(Val),cnt);
  323. end;
  324. {$endif FPC_HAS_QWORD_HEX_SHORTSTR}
  325. {$ifndef FPC_HAS_QWORD_OCT_SHORTSTR}
  326. {$define FPC_HAS_QWORD_OCT_SHORTSTR}
  327. Function OctStr(Val:qword;cnt:byte):shortstring;
  328. begin
  329. OctStr:=OctStr(int64(Val),cnt);
  330. end;
  331. {$endif FPC_HAS_QWORD_OCT_SHORTSTR}
  332. {$ifndef FPC_HAS_QWORD_BIN_SHORTSTR}
  333. {$define FPC_HAS_QWORD_BIN_SHORTSTR}
  334. Function binStr(Val:qword;cnt:byte):shortstring;
  335. begin
  336. binStr:=binStr(int64(Val),cnt);
  337. end;
  338. {$endif FPC_HAS_QWORD_BIN_SHORTSTR}
  339. {$ifndef FPC_HAS_HEXSTR_POINTER_SHORTSTR}
  340. {$define FPC_HAS_HEXSTR_POINTER_SHORTSTR}
  341. function hexstr(val : pointer) : shortstring;
  342. var
  343. i : ObjpasInt;
  344. v : ptruint;
  345. begin
  346. v:=ptruint(val);
  347. hexstr[0]:=chr(sizeof(pointer)*2);
  348. for i:=sizeof(pointer)*2 downto 1 do
  349. begin
  350. hexstr[i]:=hextbl[v and $f];
  351. v:=v shr 4;
  352. end;
  353. end;
  354. {$endif FPC_HAS_HEXSTR_POINTER_SHORTSTR}
  355. {$ifndef FPC_HAS_SPACE_SHORTSTR}
  356. {$define FPC_HAS_SPACE_SHORTSTR}
  357. function space (b : byte): shortstring;
  358. begin
  359. space[0] := chr(b);
  360. FillChar (Space[1],b,' ');
  361. end;
  362. {$endif FPC_HAS_SPACE_SHORTSTR}
  363. {*****************************************************************************
  364. Str() Helpers
  365. *****************************************************************************}
  366. procedure fpc_shortstr_SInt(v : valSInt;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_SINT']; compilerproc;
  367. begin
  368. int_str(v,s);
  369. if length(s)<len then
  370. s:=space(len-length(s))+s;
  371. end;
  372. procedure fpc_shortstr_UInt(v : valUInt;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_UINT']; compilerproc;
  373. begin
  374. int_str_unsigned(v,s);
  375. if length(s)<len then
  376. s:=space(len-length(s))+s;
  377. end;
  378. {$ifndef CPU64}
  379. procedure fpc_shortstr_qword(v : qword;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_QWORD']; compilerproc;
  380. begin
  381. int_str_unsigned(v,s);
  382. if length(s)<len then
  383. s:=space(len-length(s))+s;
  384. end;
  385. procedure fpc_shortstr_int64(v : int64;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_INT64']; compilerproc;
  386. begin
  387. int_str(v,s);
  388. if length(s)<len then
  389. s:=space(len-length(s))+s;
  390. end;
  391. {$endif CPU64}
  392. {$if defined(CPU16) or defined(CPU8)}
  393. procedure fpc_shortstr_longword(v : longword;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_LONGWORD']; compilerproc;
  394. begin
  395. int_str_unsigned(v,s);
  396. if length(s)<len then
  397. s:=space(len-length(s))+s;
  398. end;
  399. procedure fpc_shortstr_longint(v : longint;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_LONGINT']; compilerproc;
  400. begin
  401. int_str(v,s);
  402. if length(s)<len then
  403. s:=space(len-length(s))+s;
  404. end;
  405. procedure fpc_shortstr_word(v : word;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_WORD']; compilerproc;
  406. begin
  407. int_str_unsigned(v,s);
  408. if length(s)<len then
  409. s:=space(len-length(s))+s;
  410. end;
  411. procedure fpc_shortstr_smallint(v : smallint;len : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_SMALLINT']; compilerproc;
  412. begin
  413. int_str(v,s);
  414. if length(s)<len then
  415. s:=space(len-length(s))+s;
  416. end;
  417. {$endif CPU16 or CPU8}
  418. { fpc_shortstr_sInt must appear before this file is included, because }
  419. { it's used inside real2str.inc and otherwise the searching via the }
  420. { compilerproc name will fail (JM) }
  421. {$ifndef FPUNONE}
  422. {$ifdef FLOAT_ASCII_FALLBACK}
  423. {$I real2str.inc}
  424. {$else not FLOAT_ASCII_FALLBACK}
  425. {$I flt_conv.inc}
  426. {$endif FLOAT_ASCII_FALLBACK}
  427. {$endif}
  428. {$ifndef FPUNONE}
  429. procedure fpc_shortstr_float(d : ValReal;len,fr,rt : SizeInt;out s : shortstring);[public,alias:'FPC_SHORTSTR_FLOAT']; compilerproc;
  430. begin
  431. str_real(len,fr,d,treal_type(rt),s);
  432. end;
  433. {$endif}
  434. {$ifndef FPC_STR_ENUM_INTERN}
  435. function fpc_shortstr_enum_intern(ordinal,len:sizeint;typinfo,ord2strindex:pointer;out s:shortstring): longint;
  436. { The following contains the TTypeInfo/TTypeData records from typinfo.pp
  437. specialized for the tkEnumeration case (and stripped of unused things). }
  438. type
  439. PPstring=^Pstring;
  440. Penum_typeinfo=^Tenum_typeinfo;
  441. Tenum_typeinfo={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  442. kind:byte; { always tkEnumeration }
  443. num_chars:byte;
  444. chars:array[0..0] of char; { variable length with size of num_chars }
  445. end;
  446. Penum_typedata=^Tenum_typedata;
  447. Tenum_typedata={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  448. ordtype:byte;
  449. { this seemingly extraneous inner record is here for alignment purposes, so
  450. that its data gets aligned properly (if FPC_REQUIRES_PROPER_ALIGNMENT is
  451. set }
  452. inner: {$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  453. minvalue,maxvalue:longint;
  454. basetype:pointer; { required for alignment }
  455. end;
  456. { more data here, but not needed }
  457. end;
  458. { Pascal data types for the ordinal enum value to string table. It consists of a header
  459. that indicates what type of data the table stores, either a direct lookup table (when
  460. o = lookup) or a set of ordered (ordinal value, string) tuples (when o = search). }
  461. { A single entry in the set of ordered tuples }
  462. Psearch_data=^Tsearch_data;
  463. Tsearch_data={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  464. value:longint;
  465. name:Pstring;
  466. end;
  467. Penum_ord_to_string=^Tenum_ord_to_string;
  468. Tenum_ord_to_string={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  469. o:(lookup,search);
  470. case integer of
  471. 0: (lookup_data:array[0..0] of Pstring);
  472. 1: (num_entries:longint;
  473. search_data:array[0..0] of Tsearch_data);
  474. end;
  475. var
  476. enum_o2s : Penum_ord_to_string;
  477. header:Penum_typeinfo;
  478. body:Penum_typedata;
  479. res:Pshortstring;
  480. sorted_data:Psearch_data;
  481. spaces,i,m,h,l:longint;
  482. begin
  483. { set default return value }
  484. fpc_shortstr_enum_intern:=107;
  485. enum_o2s:=Penum_ord_to_string(ord2strindex);
  486. { depending on the type of table in ord2strindex retrieve the data }
  487. if (enum_o2s^.o=lookup) then
  488. begin
  489. { direct lookup table }
  490. header:=Penum_typeinfo(typinfo);
  491. { calculate address of enum rtti body: add the actual size of the
  492. enum_rtti_header, and then align. Use an alignment of 1 (which
  493. does nothing) in case FPC_REQUIRES_PROPER_ALIGNMENT is not set
  494. to avoid the need for an if in this situation }
  495. body:=Penum_typedata(align(ptruint(header) + 2 * sizeof(byte) { kind, num_chars } + header^.num_chars,
  496. {$ifndef FPC_REQUIRES_PROPER_ALIGNMENT} 1 {$else} sizeof(pointer) {$endif}));
  497. with (body^.inner) do
  498. begin
  499. { Bounds check for the ordinal value for this enum }
  500. if (ordinal<minvalue) or (ordinal>maxvalue) then
  501. exit;
  502. { make the ordinal index for lookup zero-based }
  503. dec(ordinal,minvalue);
  504. end;
  505. { temporarily disable range checking because of the access to the array[0..0]
  506. member of Tenum_ord_to_string_lookup }
  507. {$push}{$R-}
  508. res:=enum_o2s^.lookup_data[ordinal];
  509. {$pop}
  510. if (not assigned(res)) then
  511. exit;
  512. s:=res^;
  513. end
  514. else
  515. begin
  516. { The compiler did generate a sorted array of (ordvalue,Pstring) tuples }
  517. sorted_data:=@enum_o2s^.search_data;
  518. { Use a binary search to get the string }
  519. l:=0;
  520. { temporarily disable range checking because of the access to the array[0..0]
  521. member of Tenum_ord_to_string_search }
  522. {$push}{$R-}
  523. h:=enum_o2s^.num_entries-1;
  524. repeat
  525. m:=(l+h) div 2;
  526. if ordinal>sorted_data[m].value then
  527. l:=m+1
  528. else if ordinal<sorted_data[m].value then
  529. h:=m-1
  530. else
  531. break;
  532. if l>h then
  533. exit; { Ordinal value not found? Exit }
  534. until false;
  535. {$pop}
  536. s:=sorted_data[m].name^;
  537. end;
  538. { Pad the string with spaces if necessary }
  539. if (len>length(s)) then
  540. begin
  541. spaces:=len-length(s);
  542. for i:=1 to spaces do
  543. s[length(s)+i]:=' ';
  544. inc(byte(s[0]),spaces);
  545. end;
  546. fpc_shortstr_enum_intern:=0;
  547. end;
  548. procedure fpc_shortstr_enum(ordinal,len:sizeint;typinfo,ord2strindex:pointer;out s:shortstring);[public,alias:'FPC_SHORTSTR_ENUM'];compilerproc;
  549. var
  550. res: longint;
  551. begin
  552. res:=fpc_shortstr_enum_intern(ordinal,len,typinfo,ord2strindex,s);
  553. if (res<>0) then
  554. runerror(107);
  555. end;
  556. { also define alias for internal use in the system unit }
  557. procedure fpc_shortstr_enum(ordinal,len:sizeint;typinfo,ord2strindex:pointer;out s:shortstring);external name 'FPC_SHORTSTR_ENUM';
  558. {$endif FPC_SHORTSTR_ENUM_INTERN}
  559. procedure fpc_shortstr_bool(b : boolean;len:sizeint;out s:shortstring);[public,alias:'FPC_SHORTSTR_BOOL'];compilerproc;
  560. begin
  561. if b then
  562. s:='TRUE'
  563. else
  564. s:='FALSE';
  565. if length(s)<len then
  566. s:=space(len-length(s))+s;
  567. end;
  568. { also define alias for internal use in the system unit }
  569. procedure fpc_shortstr_bool(b : boolean;len:sizeint;out s:shortstring);external {$ifndef cpujvm}name 'FPC_SHORTSTR_BOOL'{$endif};
  570. procedure fpc_shortstr_currency({$ifdef cpujvm}constref{$endif} c : currency; len,f : SizeInt; out s : shortstring);[public,alias:'FPC_SHORTSTR_CURRENCY']; compilerproc;
  571. const
  572. MinLen = 8; { Minimal string length in scientific format }
  573. var
  574. buf : array[1..19] of char;
  575. i,j,k,reslen,tlen,sign,r,point : longint;
  576. ic : qword;
  577. begin
  578. fillchar(buf,length(buf),'0');
  579. { default value for length is -32767 }
  580. if len=-32767 then
  581. len:=25;
  582. if PInt64(@c)^ >= 0 then
  583. begin
  584. ic:=QWord(PInt64(@c)^);
  585. sign:=0;
  586. end
  587. else
  588. begin
  589. sign:=1;
  590. ic:=QWord(-PInt64(@c)^);
  591. end;
  592. { converting to integer string }
  593. tlen:=0;
  594. repeat
  595. Inc(tlen);
  596. buf[tlen]:=Chr(ic mod 10 + $30);
  597. ic:=ic div 10;
  598. until ic = 0;
  599. { calculating:
  600. reslen - length of result string,
  601. r - rounding or appending zeroes,
  602. point - place of decimal point }
  603. reslen:=tlen;
  604. if f <> 0 then
  605. Inc(reslen); { adding decimal point length }
  606. if f < 0 then
  607. begin
  608. { scientific format }
  609. Inc(reslen,5); { adding length of sign and exponent }
  610. if len < MinLen then
  611. len:=MinLen;
  612. r:=reslen-len;
  613. if reslen < len then
  614. reslen:=len;
  615. if r > 0 then
  616. begin
  617. reslen:=len;
  618. point:=tlen - r;
  619. end
  620. else
  621. point:=tlen;
  622. end
  623. else
  624. begin
  625. { fixed format }
  626. Inc(reslen, sign);
  627. { prepending fractional part with zeroes }
  628. while tlen < 5 do
  629. begin
  630. Inc(reslen);
  631. Inc(tlen);
  632. buf[tlen]:='0';
  633. end;
  634. { Currency have 4 digits in fractional part }
  635. r:=4 - f;
  636. point:=f;
  637. if point <> 0 then
  638. begin
  639. if point > 4 then
  640. point:=4;
  641. Inc(point);
  642. end;
  643. Dec(reslen,r);
  644. end;
  645. { rounding string if r > 0 }
  646. if r > 0 then
  647. begin
  648. k := 0;
  649. i := r+2;
  650. if i > tlen then
  651. i := tlen+1;
  652. if buf[i-2] >= '5' then
  653. begin
  654. if buf[i-1] < '9' then
  655. buf[i-1] := chr(ord(buf[i-1])+1)
  656. else
  657. begin
  658. buf[i-1] := '0';
  659. k := 1;
  660. end;
  661. end;
  662. If (k=1) and (buf[i-1]='0') then
  663. begin
  664. { 1.9996 rounded to two decimal digits after the decimal separator must result in
  665. 2.00, i.e. the rounding is propagated
  666. }
  667. while buf[i]='9' do
  668. begin
  669. buf[i]:='0';
  670. inc(i);
  671. end;
  672. buf[i]:=chr(Ord(buf[i])+1);
  673. { did we add another digit? This happens when rounding
  674. e.g. 99.9996 to two decimal digits after the decimal separator which should result in
  675. 100.00
  676. }
  677. if i>tlen then
  678. begin
  679. inc(reslen);
  680. inc(tlen);
  681. end;
  682. end;
  683. end;
  684. { preparing result string }
  685. if reslen<len then
  686. reslen:=len;
  687. if reslen>High(s) then
  688. begin
  689. if r < 0 then
  690. Inc(r, reslen - High(s));
  691. reslen:=High(s);
  692. end;
  693. SetLength(s,reslen);
  694. j:=reslen;
  695. if f<0 then
  696. begin
  697. { writing power of 10 part }
  698. if PInt64(@c)^ = 0 then
  699. k:=0
  700. else
  701. k:=tlen-5;
  702. if k >= 0 then
  703. s[j-2]:='+'
  704. else
  705. begin
  706. s[j-2]:='-';
  707. k:=-k;
  708. end;
  709. s[j]:=Chr(k mod 10 + $30);
  710. Dec(j);
  711. s[j]:=Chr(k div 10 + $30);
  712. Dec(j,2);
  713. s[j]:='E';
  714. Dec(j);
  715. end;
  716. { writing extra zeroes if r < 0 }
  717. while r < 0 do
  718. begin
  719. s[j]:='0';
  720. Dec(j);
  721. Inc(r);
  722. end;
  723. { writing digits and decimal point }
  724. for i:=r + 1 to tlen do
  725. begin
  726. Dec(point);
  727. if point = 0 then
  728. begin
  729. s[j]:='.';
  730. Dec(j);
  731. end;
  732. s[j]:=buf[i];
  733. Dec(j);
  734. end;
  735. { writing sign }
  736. if sign = 1 then
  737. begin
  738. s[j]:='-';
  739. Dec(j);
  740. end;
  741. { writing spaces }
  742. while j > 0 do
  743. begin
  744. s[j]:=' ';
  745. Dec(j);
  746. end;
  747. end;
  748. {
  749. Array Of Char Str() helpers
  750. }
  751. procedure fpc_chararray_sint(v : valsint;len : SizeInt;out a:array of char);compilerproc;
  752. var
  753. ss : shortstring;
  754. maxlen : SizeInt;
  755. begin
  756. int_str(v,ss);
  757. if length(ss)<len then
  758. ss:=space(len-length(ss))+ss;
  759. if length(ss)<high(a)+1 then
  760. maxlen:=length(ss)
  761. else
  762. maxlen:=high(a)+1;
  763. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  764. end;
  765. procedure fpc_chararray_uint(v : valuint;len : SizeInt;out a : array of char);compilerproc;
  766. var
  767. ss : shortstring;
  768. maxlen : SizeInt;
  769. begin
  770. int_str_unsigned(v,ss);
  771. if length(ss)<len then
  772. ss:=space(len-length(ss))+ss;
  773. if length(ss)<high(a)+1 then
  774. maxlen:=length(ss)
  775. else
  776. maxlen:=high(a)+1;
  777. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  778. end;
  779. {$ifndef CPU64}
  780. procedure fpc_chararray_qword(v : qword;len : SizeInt;out a : array of char);compilerproc;
  781. var
  782. ss : shortstring;
  783. maxlen : SizeInt;
  784. begin
  785. int_str_unsigned(v,ss);
  786. if length(ss)<len then
  787. ss:=space(len-length(ss))+ss;
  788. if length(ss)<high(a)+1 then
  789. maxlen:=length(ss)
  790. else
  791. maxlen:=high(a)+1;
  792. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  793. end;
  794. procedure fpc_chararray_int64(v : int64;len : SizeInt;out a : array of char);compilerproc;
  795. var
  796. ss : shortstring;
  797. maxlen : SizeInt;
  798. begin
  799. int_str(v,ss);
  800. if length(ss)<len then
  801. ss:=space(len-length(ss))+ss;
  802. if length(ss)<high(a)+1 then
  803. maxlen:=length(ss)
  804. else
  805. maxlen:=high(a)+1;
  806. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  807. end;
  808. {$endif CPU64}
  809. {$if defined(CPU16) or defined(CPU8)}
  810. procedure fpc_chararray_longword(v : longword;len : SizeInt;out a : array of char);compilerproc;
  811. var
  812. ss : shortstring;
  813. maxlen : SizeInt;
  814. begin
  815. int_str_unsigned(v,ss);
  816. if length(ss)<len then
  817. ss:=space(len-length(ss))+ss;
  818. if length(ss)<high(a)+1 then
  819. maxlen:=length(ss)
  820. else
  821. maxlen:=high(a)+1;
  822. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  823. end;
  824. procedure fpc_chararray_longint(v : longint;len : SizeInt;out a : array of char);compilerproc;
  825. var
  826. ss : shortstring;
  827. maxlen : SizeInt;
  828. begin
  829. int_str(v,ss);
  830. if length(ss)<len then
  831. ss:=space(len-length(ss))+ss;
  832. if length(ss)<high(a)+1 then
  833. maxlen:=length(ss)
  834. else
  835. maxlen:=high(a)+1;
  836. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  837. end;
  838. procedure fpc_chararray_word(v : word;len : SizeInt;out a : array of char);compilerproc;
  839. var
  840. ss : shortstring;
  841. maxlen : SizeInt;
  842. begin
  843. int_str_unsigned(v,ss);
  844. if length(ss)<len then
  845. ss:=space(len-length(ss))+ss;
  846. if length(ss)<high(a)+1 then
  847. maxlen:=length(ss)
  848. else
  849. maxlen:=high(a)+1;
  850. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  851. end;
  852. procedure fpc_chararray_smallint(v : smallint;len : SizeInt;out a : array of char);compilerproc;
  853. var
  854. ss : shortstring;
  855. maxlen : SizeInt;
  856. begin
  857. int_str(v,ss);
  858. if length(ss)<len then
  859. ss:=space(len-length(ss))+ss;
  860. if length(ss)<high(a)+1 then
  861. maxlen:=length(ss)
  862. else
  863. maxlen:=high(a)+1;
  864. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  865. end;
  866. {$endif CPU16 or CPU8}
  867. {$ifndef FPUNONE}
  868. procedure fpc_chararray_Float(d : ValReal;len,fr,rt : SizeInt;out a : array of char);compilerproc;
  869. var
  870. ss : shortstring;
  871. maxlen : SizeInt;
  872. begin
  873. str_real(len,fr,d,treal_type(rt),ss);
  874. if length(ss)<high(a)+1 then
  875. maxlen:=length(ss)
  876. else
  877. maxlen:=high(a)+1;
  878. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  879. end;
  880. {$endif}
  881. {$ifndef FPC_STR_ENUM_INTERN}
  882. procedure fpc_chararray_enum(ordinal,len:sizeint;typinfo,ord2strindex:pointer;out a : array of char);compilerproc;
  883. var
  884. ss : shortstring;
  885. maxlen : SizeInt;
  886. begin
  887. fpc_shortstr_enum(ordinal,len,typinfo,ord2strindex,ss);
  888. if length(ss)<high(a)+1 then
  889. maxlen:=length(ss)
  890. else
  891. maxlen:=high(a)+1;
  892. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  893. end;
  894. {$endif not FPC_STR_ENUM_INTERN}
  895. procedure fpc_chararray_bool(b : boolean;len:sizeint;out a : array of char);compilerproc;
  896. var
  897. ss : shortstring;
  898. maxlen : SizeInt;
  899. begin
  900. fpc_shortstr_bool(b,len,ss);
  901. if length(ss)<high(a)+1 then
  902. maxlen:=length(ss)
  903. else
  904. maxlen:=high(a)+1;
  905. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  906. end;
  907. {$ifndef FPC_HAS_CHARARRAY_CURRENCY}
  908. {$define FPC_HAS_CHARARRAY_CURRENCY}
  909. procedure fpc_chararray_Currency(c : Currency;len,fr : SizeInt;out a : array of char);compilerproc;
  910. var
  911. ss : shortstring;
  912. maxlen : SizeInt;
  913. begin
  914. str(c:len:fr,ss);
  915. if length(ss)<high(a)+1 then
  916. maxlen:=length(ss)
  917. else
  918. maxlen:=high(a)+1;
  919. fpc_shortstr_chararray_intern_charmove(ss,a,maxlen);
  920. end;
  921. {$endif FPC_HAS_STR_CURRENCY}
  922. {*****************************************************************************
  923. Val() Functions
  924. *****************************************************************************}
  925. Function InitVal(const s:shortstring;out negativ:boolean;out base:byte):ValSInt;
  926. var
  927. Code : SizeInt;
  928. begin
  929. code:=1;
  930. negativ:=false;
  931. base:=10;
  932. if length(s)=0 then
  933. begin
  934. InitVal:=code;
  935. Exit;
  936. end;
  937. {Skip Spaces and Tab}
  938. while (code<=length(s)) and (s[code] in [' ',#9]) do
  939. inc(code);
  940. {Sign}
  941. case s[code] of
  942. '-' : begin
  943. negativ:=true;
  944. inc(code);
  945. end;
  946. '+' : inc(code);
  947. end;
  948. {Base}
  949. if code<=length(s) then
  950. begin
  951. case s[code] of
  952. '$',
  953. 'X',
  954. 'x' : begin
  955. base:=16;
  956. inc(code);
  957. end;
  958. '%' : begin
  959. base:=2;
  960. inc(code);
  961. end;
  962. '&' : begin
  963. Base:=8;
  964. inc(code);
  965. end;
  966. '0' : begin
  967. if (code < length(s)) and (s[code+1] in ['x', 'X']) then
  968. begin
  969. inc(code, 2);
  970. base := 16;
  971. end;
  972. end;
  973. end;
  974. end;
  975. { strip leading zeros }
  976. while ((code < length(s)) and (s[code] = '0')) do begin
  977. inc(code);
  978. end;
  979. InitVal:=code;
  980. end;
  981. Function fpc_Val_SInt_ShortStr(DestSize: SizeInt; Const S: ShortString; out Code: ValSInt): ValSInt; [public, alias:'FPC_VAL_SINT_SHORTSTR']; compilerproc;
  982. var
  983. temp, prev, maxPrevValue, maxNewValue: ValUInt;
  984. base,u : byte;
  985. negative : boolean;
  986. begin
  987. fpc_Val_SInt_ShortStr := 0;
  988. Temp:=0;
  989. Code:=InitVal(s,negative,base);
  990. if Code>length(s) then
  991. exit;
  992. if (s[Code]=#0) then
  993. begin
  994. if (Code>1) and (s[Code-1]='0') then
  995. Code:=0;
  996. exit;
  997. end;
  998. maxPrevValue := ValUInt(MaxUIntValue) div ValUInt(Base);
  999. if (base = 10) then
  1000. maxNewValue := MaxSIntValue + ord(negative)
  1001. else
  1002. maxNewValue := MaxUIntValue;
  1003. while Code<=Length(s) do
  1004. begin
  1005. case s[Code] of
  1006. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1007. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1008. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1009. #0 : break;
  1010. else
  1011. u:=16;
  1012. end;
  1013. Prev := Temp;
  1014. Temp := Temp*ValUInt(base);
  1015. If (u >= base) or
  1016. (ValUInt(maxNewValue-u) < Temp) or
  1017. (prev > maxPrevValue) Then
  1018. Begin
  1019. fpc_Val_SInt_ShortStr := 0;
  1020. Exit
  1021. End;
  1022. Temp:=Temp+u;
  1023. inc(code);
  1024. end;
  1025. code := 0;
  1026. fpc_Val_SInt_ShortStr := ValSInt(Temp);
  1027. If Negative Then
  1028. fpc_Val_SInt_ShortStr := -fpc_Val_SInt_ShortStr;
  1029. If Not(Negative) and (base <> 10) Then
  1030. {sign extend the result to allow proper range checking}
  1031. Case DestSize of
  1032. 1: fpc_Val_SInt_ShortStr := shortint(fpc_Val_SInt_ShortStr);
  1033. 2: fpc_Val_SInt_ShortStr := smallint(fpc_Val_SInt_ShortStr);
  1034. {$ifdef cpu64}
  1035. 4: fpc_Val_SInt_ShortStr := longint(fpc_Val_SInt_ShortStr);
  1036. {$endif cpu64}
  1037. End;
  1038. end;
  1039. {$ifndef FPC_HAS_INT_VAL_SINT_SHORTSTR}
  1040. {$define FPC_HAS_INT_VAL_SINT_SHORTSTR}
  1041. { we need this for fpc_Val_SInt_Ansistr and fpc_Val_SInt_WideStr because }
  1042. { we have to pass the DestSize parameter on (JM) }
  1043. Function int_Val_SInt_ShortStr(DestSize: SizeInt; Const S: ShortString; out Code: ValSInt): ValSInt; [external name 'FPC_VAL_SINT_SHORTSTR'];
  1044. {$endif FPC_HAS_INT_VAL_SINT_SHORTSTR}
  1045. Function fpc_Val_UInt_Shortstr(Const S: ShortString; out Code: ValSInt): ValUInt; [public, alias:'FPC_VAL_UINT_SHORTSTR']; compilerproc;
  1046. var
  1047. base,u : byte;
  1048. negative : boolean;
  1049. begin
  1050. fpc_Val_UInt_Shortstr:=0;
  1051. Code:=InitVal(s,negative,base);
  1052. If Negative or (Code>length(s)) Then
  1053. Exit;
  1054. if (s[Code]=#0) then
  1055. begin
  1056. if (Code>1) and (s[Code-1]='0') then
  1057. Code:=0;
  1058. exit;
  1059. end;
  1060. while Code<=Length(s) do
  1061. begin
  1062. case s[Code] of
  1063. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1064. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1065. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1066. #0 : break;
  1067. else
  1068. u:=16;
  1069. end;
  1070. If (u>=base) or
  1071. (ValUInt(MaxUIntValue-u) div ValUInt(Base)<fpc_val_uint_shortstr) then
  1072. begin
  1073. fpc_Val_UInt_Shortstr:=0;
  1074. exit;
  1075. end;
  1076. fpc_Val_UInt_Shortstr:=fpc_Val_UInt_Shortstr*ValUInt(base) + u;
  1077. inc(code);
  1078. end;
  1079. code := 0;
  1080. end;
  1081. {$ifndef CPU64}
  1082. Function fpc_val_int64_shortstr(Const S: ShortString; out Code: ValSInt): Int64; [public, alias:'FPC_VAL_INT64_SHORTSTR']; compilerproc;
  1083. var u : sizeuint;
  1084. temp, prev, maxprevvalue, maxnewvalue : qword;
  1085. base : byte;
  1086. negative : boolean;
  1087. const maxint64=qword($7fffffffffffffff);
  1088. maxqword=qword($ffffffffffffffff);
  1089. begin
  1090. fpc_val_int64_shortstr := 0;
  1091. Temp:=0;
  1092. Code:=InitVal(s,negative,base);
  1093. if Code>length(s) then
  1094. exit;
  1095. if (s[Code]=#0) then
  1096. begin
  1097. if (Code>1) and (s[Code-1]='0') then
  1098. Code:=0;
  1099. exit;
  1100. end;
  1101. maxprevvalue := maxqword div base;
  1102. if (base = 10) then
  1103. maxnewvalue := maxint64 + ord(negative)
  1104. else
  1105. maxnewvalue := maxqword;
  1106. while Code<=Length(s) do
  1107. begin
  1108. case s[Code] of
  1109. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1110. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1111. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1112. #0 : break;
  1113. else
  1114. u:=16;
  1115. end;
  1116. Prev:=Temp;
  1117. Temp:=Temp*qword(base);
  1118. If (u >= base) or
  1119. (qword(maxnewvalue-u) < temp) or
  1120. (prev > maxprevvalue) Then
  1121. Begin
  1122. fpc_val_int64_shortstr := 0;
  1123. Exit
  1124. End;
  1125. Temp:=Temp+u;
  1126. inc(code);
  1127. end;
  1128. code:=0;
  1129. fpc_val_int64_shortstr:=int64(Temp);
  1130. If Negative Then
  1131. fpc_val_int64_shortstr:=-fpc_val_int64_shortstr;
  1132. end;
  1133. Function fpc_val_qword_shortstr(Const S: ShortString; out Code: ValSInt): QWord; [public, alias:'FPC_VAL_QWORD_SHORTSTR']; compilerproc;
  1134. var u : sizeuint;
  1135. base : byte;
  1136. negative : boolean;
  1137. const maxqword=qword($ffffffffffffffff);
  1138. begin
  1139. fpc_val_qword_shortstr:=0;
  1140. Code:=InitVal(s,negative,base);
  1141. If Negative or (Code>length(s)) Then
  1142. Exit;
  1143. if (s[Code]=#0) then
  1144. begin
  1145. if (Code>1) and (s[Code-1]='0') then
  1146. Code:=0;
  1147. exit;
  1148. end;
  1149. while Code<=Length(s) do
  1150. begin
  1151. case s[Code] of
  1152. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1153. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1154. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1155. #0 : break;
  1156. else
  1157. u:=16;
  1158. end;
  1159. If (u>=base) or
  1160. ((QWord(maxqword-u) div QWord(base))<fpc_val_qword_shortstr) then
  1161. Begin
  1162. fpc_val_qword_shortstr := 0;
  1163. Exit
  1164. End;
  1165. fpc_val_qword_shortstr:=fpc_val_qword_shortstr*QWord(base) + u;
  1166. inc(code);
  1167. end;
  1168. code := 0;
  1169. end;
  1170. {$endif CPU64}
  1171. {$if defined(CPU16) or defined(CPU8)}
  1172. Function fpc_val_longint_shortstr(Const S: ShortString; out Code: ValSInt): LongInt; [public, alias:'FPC_VAL_LONGINT_SHORTSTR']; compilerproc;
  1173. var u, temp, prev, maxprevvalue, maxnewvalue : longword;
  1174. base : byte;
  1175. negative : boolean;
  1176. const maxlongint=longword($7fffffff);
  1177. maxlongword=longword($ffffffff);
  1178. begin
  1179. fpc_val_longint_shortstr := 0;
  1180. Temp:=0;
  1181. Code:=InitVal(s,negative,base);
  1182. if Code>length(s) then
  1183. exit;
  1184. if (s[Code]=#0) then
  1185. begin
  1186. if (Code>1) and (s[Code-1]='0') then
  1187. Code:=0;
  1188. exit;
  1189. end;
  1190. maxprevvalue := maxlongword div base;
  1191. if (base = 10) then
  1192. maxnewvalue := maxlongint + ord(negative)
  1193. else
  1194. maxnewvalue := maxlongword;
  1195. while Code<=Length(s) do
  1196. begin
  1197. case s[Code] of
  1198. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1199. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1200. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1201. #0 : break;
  1202. else
  1203. u:=16;
  1204. end;
  1205. Prev:=Temp;
  1206. Temp:=Temp*longword(base);
  1207. If (u >= base) or
  1208. (longword(maxnewvalue-u) < temp) or
  1209. (prev > maxprevvalue) Then
  1210. Begin
  1211. fpc_val_longint_shortstr := 0;
  1212. Exit
  1213. End;
  1214. Temp:=Temp+u;
  1215. inc(code);
  1216. end;
  1217. code:=0;
  1218. fpc_val_longint_shortstr:=longint(Temp);
  1219. If Negative Then
  1220. fpc_val_longint_shortstr:=-fpc_val_longint_shortstr;
  1221. end;
  1222. Function fpc_val_longword_shortstr(Const S: ShortString; out Code: ValSInt): LongWord; [public, alias:'FPC_VAL_LONGWORD_SHORTSTR']; compilerproc;
  1223. var u, prev: LongWord;
  1224. base : byte;
  1225. negative : boolean;
  1226. const maxlongword=longword($ffffffff);
  1227. begin
  1228. fpc_val_longword_shortstr:=0;
  1229. Code:=InitVal(s,negative,base);
  1230. If Negative or (Code>length(s)) Then
  1231. Exit;
  1232. if (s[Code]=#0) then
  1233. begin
  1234. if (Code>1) and (s[Code-1]='0') then
  1235. Code:=0;
  1236. exit;
  1237. end;
  1238. while Code<=Length(s) do
  1239. begin
  1240. case s[Code] of
  1241. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1242. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1243. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1244. #0 : break;
  1245. else
  1246. u:=16;
  1247. end;
  1248. prev := fpc_val_longword_shortstr;
  1249. If (u>=base) or
  1250. ((LongWord(maxlongword-u) div LongWord(base))<prev) then
  1251. Begin
  1252. fpc_val_longword_shortstr := 0;
  1253. Exit
  1254. End;
  1255. fpc_val_longword_shortstr:=fpc_val_longword_shortstr*LongWord(base) + u;
  1256. inc(code);
  1257. end;
  1258. code := 0;
  1259. end;
  1260. Function fpc_val_smallint_shortstr(Const S: ShortString; out Code: ValSInt): SmallInt; [public, alias:'FPC_VAL_SMALLINT_SHORTSTR']; compilerproc;
  1261. var u, temp, prev, maxprevvalue, maxnewvalue : word;
  1262. base : byte;
  1263. negative : boolean;
  1264. const maxlongint=longword($7fffffff);
  1265. maxlongword=longword($ffffffff);
  1266. begin
  1267. fpc_val_smallint_shortstr := 0;
  1268. Temp:=0;
  1269. Code:=InitVal(s,negative,base);
  1270. if Code>length(s) then
  1271. exit;
  1272. if (s[Code]=#0) then
  1273. begin
  1274. if (Code>1) and (s[Code-1]='0') then
  1275. Code:=0;
  1276. exit;
  1277. end;
  1278. maxprevvalue := maxlongword div base;
  1279. if (base = 10) then
  1280. maxnewvalue := maxlongint + ord(negative)
  1281. else
  1282. maxnewvalue := maxlongword;
  1283. while Code<=Length(s) do
  1284. begin
  1285. case s[Code] of
  1286. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1287. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1288. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1289. #0 : break;
  1290. else
  1291. u:=16;
  1292. end;
  1293. Prev:=Temp;
  1294. Temp:=Temp*longword(base);
  1295. If (u >= base) or
  1296. (longword(maxnewvalue-u) < temp) or
  1297. (prev > maxprevvalue) Then
  1298. Begin
  1299. fpc_val_smallint_shortstr := 0;
  1300. Exit
  1301. End;
  1302. Temp:=Temp+u;
  1303. inc(code);
  1304. end;
  1305. code:=0;
  1306. fpc_val_smallint_shortstr:=longint(Temp);
  1307. If Negative Then
  1308. fpc_val_smallint_shortstr:=-fpc_val_smallint_shortstr;
  1309. end;
  1310. Function fpc_val_word_shortstr(Const S: ShortString; out Code: ValSInt): Word; [public, alias:'FPC_VAL_WORD_SHORTSTR']; compilerproc;
  1311. var u, prev: word;
  1312. base : byte;
  1313. negative : boolean;
  1314. const maxlongword=longword($ffffffff);
  1315. begin
  1316. fpc_val_word_shortstr:=0;
  1317. Code:=InitVal(s,negative,base);
  1318. If Negative or (Code>length(s)) Then
  1319. Exit;
  1320. if (s[Code]=#0) then
  1321. begin
  1322. if (Code>1) and (s[Code-1]='0') then
  1323. Code:=0;
  1324. exit;
  1325. end;
  1326. while Code<=Length(s) do
  1327. begin
  1328. case s[Code] of
  1329. '0'..'9' : u:=Ord(S[Code])-Ord('0');
  1330. 'A'..'F' : u:=Ord(S[Code])-(Ord('A')-10);
  1331. 'a'..'f' : u:=Ord(S[Code])-(Ord('a')-10);
  1332. #0 : break;
  1333. else
  1334. u:=16;
  1335. end;
  1336. prev := fpc_val_word_shortstr;
  1337. If (u>=base) or
  1338. ((LongWord(maxlongword-u) div LongWord(base))<prev) then
  1339. Begin
  1340. fpc_val_word_shortstr := 0;
  1341. Exit
  1342. End;
  1343. fpc_val_word_shortstr:=fpc_val_word_shortstr*LongWord(base) + u;
  1344. inc(code);
  1345. end;
  1346. code := 0;
  1347. end;
  1348. {$endif CPU16 or CPU8}
  1349. {$ifdef FLOAT_ASCII_FALLBACK}
  1350. {$ifndef FPUNONE}
  1351. const
  1352. {$ifdef FPC_HAS_TYPE_EXTENDED}
  1353. valmaxexpnorm=4932;
  1354. mantissabits=64;
  1355. {$else}
  1356. {$ifdef FPC_HAS_TYPE_DOUBLE}
  1357. valmaxexpnorm=308;
  1358. mantissabits=53;
  1359. {$else}
  1360. {$ifdef FPC_HAS_TYPE_SINGLE}
  1361. valmaxexpnorm=38;
  1362. mantissabits=24;
  1363. {$else}
  1364. {$error Unknown floating point precision }
  1365. {$endif}
  1366. {$endif}
  1367. {$endif}
  1368. {$endif}
  1369. {$ifndef FPUNONE}
  1370. (******************
  1371. Derived from: ".\Free Pascal\source\rtl\inc\genmath.inc"
  1372. Origin: "fast 10^n routine"
  1373. function FPower10(val: Extended; Power: Longint): Extended;
  1374. Changes:
  1375. > adapted to "ValReal", so float can be single/double/extended
  1376. > slightly changed arrays [redundant 58+2 float constants gone away]
  1377. > added some checks etc..
  1378. Notes:
  1379. > denormalization and overflow should go smooth if corresponding
  1380. FPU exceptions are masked [no external care needed by now]
  1381. > adaption to real48 and real128 is not hard if one needed
  1382. ******************)
  1383. //
  1384. function mul_by_power10(x:ValReal;power:integer):ValReal;
  1385. //
  1386. // result:=X*(10^power)
  1387. //
  1388. // Routine achieves result with no more than 3 floating point mul/div's.
  1389. // Up to ABS(power)=31, only 1 floating point mul/div is needed.
  1390. //
  1391. // Limitations:
  1392. // for ValReal=extended : power=-5119..+5119
  1393. // for ValReal=double : power=-319..+319
  1394. // for ValReal=single : power=-63..+63
  1395. //
  1396. // If "power" is beyond this limits, routine gives up and returns 0/+INF/-INF.
  1397. // This is not generally correct, but should be ok when routine is used only
  1398. // as "VAL"-helper, since "x" exponent is reasonably close to 0 in this case.
  1399. //
  1400. //==================================
  1401. {$IF DECLARED(C_HIGH_EXPBITS_5TO8)}
  1402. {$ERROR C_HIGH_EXPBITS_5TO8 declared somewhere in scope}
  1403. {$ENDIF}
  1404. {$IF DECLARED(C_HIGH_EXPBITS_9ANDUP)}
  1405. {$ERROR C_HIGH_EXPBITS_9ANDUP declared somewhere in scope}
  1406. {$ENDIF}
  1407. {$IF SIZEOF(ValReal)=10}
  1408. //==================================
  1409. // assuming "type ValReal=extended;"
  1410. //
  1411. const
  1412. C_MAX_POWER = 5119;
  1413. C_HIGH_EXPBITS_5TO8 = 15;
  1414. C_HIGH_EXPBITS_9ANDUP = 9;
  1415. {$ELSEIF SIZEOF(ValReal)=8}
  1416. //==================================
  1417. // assuming "type ValReal=double;"
  1418. //
  1419. const
  1420. C_MAX_POWER = 319;
  1421. C_HIGH_EXPBITS_5TO8 = 9;
  1422. {$ELSEIF SIZEOF(ValReal)=4}
  1423. //==================================
  1424. // assuming "type ValReal=single;"
  1425. //
  1426. const
  1427. C_MAX_POWER = 63;
  1428. {$ELSE}
  1429. //==================================
  1430. // assuming "ValReal=?"
  1431. //
  1432. {$ERROR Unsupported ValReal type}
  1433. {$ENDIF}
  1434. //==================================
  1435. const
  1436. C_INFTYP = ValReal( 1.0/0.0);
  1437. C_INFTYM = ValReal(-1.0/0.0);
  1438. mul_expbits_0_to_4:packed array[0..31]of ValReal=(
  1439. 1E0, 1E1, 1E2, 1E3,
  1440. 1E4, 1E5, 1E6, 1E7,
  1441. 1E8, 1E9, 1E10, 1E11,
  1442. 1E12, 1E13, 1E14, 1E15,
  1443. 1E16, 1E17, 1E18, 1E19,
  1444. 1E20, 1E21, 1E22, 1E23,
  1445. 1E24, 1E25, 1E26, 1E27,
  1446. 1E28, 1E29, 1E30, 1E31);
  1447. {$IF DECLARED(C_HIGH_EXPBITS_5TO8)}
  1448. mul_expbits_5_to_8:packed array[1..C_HIGH_EXPBITS_5TO8] of ValReal=(
  1449. 1E32, 1E64, 1E96, 1E128,
  1450. 1E160, 1E192, 1E224, 1E256, 1E288
  1451. {$IF DECLARED(C_HIGH_EXPBITS_9ANDUP)},
  1452. 1E320, 1E352, 1E384, 1E416, 1E448, 1E480
  1453. {$ENDIF});
  1454. {$ELSE}
  1455. mul_expbits_5_to_8:ValReal=1E32;
  1456. {$ENDIF}
  1457. {$IF DECLARED(C_HIGH_EXPBITS_9ANDUP)}
  1458. mul_expbits_9_and_up:packed array[1..C_HIGH_EXPBITS_9ANDUP] of ValReal=(
  1459. 1E512, 1E1024, 1E1536, 1E2048,
  1460. 1E2560, 1E3072, 1E3584, 1E4096,
  1461. 1E4608);
  1462. {$ENDIF}
  1463. begin
  1464. if power=0 then mul_by_power10:=x else
  1465. if power<-C_MAX_POWER then mul_by_power10:=0 else
  1466. if power>C_MAX_POWER then
  1467. if x<0 then mul_by_power10:=C_INFTYM else
  1468. if x>0 then mul_by_power10:=C_INFTYP else mul_by_power10:=0
  1469. else
  1470. if power<0 then
  1471. begin
  1472. power:=-power;
  1473. mul_by_power10:=x/mul_expbits_0_to_4[power and $1F];
  1474. power:=(power shr 5);
  1475. if power=0 then exit;
  1476. {$IF DECLARED(C_HIGH_EXPBITS_5TO8)}
  1477. if power and $F<>0 then
  1478. mul_by_power10:=
  1479. mul_by_power10/mul_expbits_5_to_8[power and $F];
  1480. {$ELSE} // "single", power<>0, so always div
  1481. mul_by_power10:=mul_by_power10/mul_expbits_5_to_8;
  1482. {$ENDIF}
  1483. {$IF DECLARED(C_HIGH_EXPBITS_9ANDUP)}
  1484. power:=(power shr 4);
  1485. if power<>0 then
  1486. mul_by_power10:=
  1487. mul_by_power10/mul_expbits_9_and_up[power];
  1488. {$ENDIF}
  1489. end
  1490. else
  1491. begin
  1492. mul_by_power10:=x*mul_expbits_0_to_4[power and $1F];
  1493. power:=(power shr 5);
  1494. if power=0 then exit;
  1495. {$IF DECLARED(C_HIGH_EXPBITS_5TO8)}
  1496. if power and $F<>0 then
  1497. mul_by_power10:=
  1498. mul_by_power10*mul_expbits_5_to_8[power and $F];
  1499. {$ELSE} // "single", power<>0, so always mul
  1500. mul_by_power10:=mul_by_power10*mul_expbits_5_to_8;
  1501. {$ENDIF}
  1502. {$IF DECLARED(C_HIGH_EXPBITS_9ANDUP)}
  1503. power:=(power shr 4);
  1504. if power<>0 then
  1505. mul_by_power10:=
  1506. mul_by_power10*mul_expbits_9_and_up[power];
  1507. {$ENDIF}
  1508. end;
  1509. end;
  1510. Function fpc_Val_Real_ShortStr(const s : shortstring; out Code : ValSInt): ValReal; [public, alias:'FPC_VAL_REAL_SHORTSTR']; compilerproc;
  1511. var
  1512. hd,
  1513. sign : valreal;
  1514. esign,
  1515. exponent,
  1516. expstart,
  1517. decpoint : SizeInt;
  1518. nint,
  1519. nlz,
  1520. explimit,
  1521. explastdigit: SizeInt;
  1522. begin
  1523. fpc_Val_Real_ShortStr:=0.0;
  1524. code:=1;
  1525. exponent:=0;
  1526. decpoint:=0;
  1527. esign:=1;
  1528. hd:=0.0;
  1529. nlz:=0;
  1530. nint:=0;
  1531. sign:=1;
  1532. while (code<=length(s)) and (s[code] in [' ',#9]) do
  1533. inc(code);
  1534. if code<=length(s) then
  1535. case s[code] of
  1536. '+' : inc(code);
  1537. '-' : begin
  1538. sign:=-1;
  1539. inc(code);
  1540. end;
  1541. end;
  1542. { leading zeroes do not influence result, skip all but one of them }
  1543. expstart:=code;
  1544. while (code<Length(s)) and (s[code]='0') do
  1545. inc(code);
  1546. if (code>expstart) then
  1547. dec(code);
  1548. expstart:=code;
  1549. while (Code<=Length(s)) do
  1550. begin
  1551. case s[code] of
  1552. '0':
  1553. begin
  1554. if (hd=0) then
  1555. inc(nlz,ord(decpoint<>0))
  1556. else
  1557. inc(nint,ord(decpoint=0));
  1558. hd:=hd*10;
  1559. end;
  1560. '1'..'9':
  1561. begin
  1562. if (decpoint=0) then
  1563. inc(nint);
  1564. hd:=hd*10+(ord(s[code])-ord('0'));
  1565. end;
  1566. '.':
  1567. if decpoint=0 then
  1568. decpoint:=code
  1569. else
  1570. exit;
  1571. else
  1572. break;
  1573. end;
  1574. inc(code);
  1575. end;
  1576. { must have seen at least one digit }
  1577. if (code-expstart)<1+ord(decpoint<>0) then
  1578. exit;
  1579. if decpoint<>0 then
  1580. decpoint:=code-decpoint-1;
  1581. { Exponent ? }
  1582. if (length(s)>=code) and (s[code] in ['e','E']) then
  1583. begin
  1584. inc(code);
  1585. if Length(s) >= code then
  1586. case s[code] of
  1587. '+': inc(code);
  1588. '-': begin
  1589. esign:=-1;
  1590. inc(code);
  1591. end;
  1592. end;
  1593. expstart:=code;
  1594. { Limit the exponent, accounting for digits in integer part of mantissa
  1595. and leading zeros in fractional part, e.g 100.0e306 = 1.0e308, etc. }
  1596. if (esign<0) then
  1597. explimit:=valmaxexpnorm+mantissabits-1+nint
  1598. else if (nint>0) then
  1599. explimit:=valmaxexpnorm+1-nint
  1600. else
  1601. explimit:=valmaxexpnorm+1+nlz;
  1602. explastdigit:=(explimit mod 10)+ord('0');
  1603. explimit:=explimit div 10;
  1604. while (length(s)>=code) and (s[code] in ['0'..'9']) do
  1605. begin
  1606. { Check commented out: since this code is used by compiler, it would error out
  1607. e.g. if compiling '1e3000' for non-x86 target. OTOH silently treating it
  1608. as infinity isn't a good option either. }
  1609. (*
  1610. if (exponent>explimit) or
  1611. ((exponent=explimit) and (ord(s[code])>explastdigit)) then
  1612. begin
  1613. { ignore exponent overflow for zero mantissa }
  1614. if hd<>0.0 then
  1615. exit;
  1616. end
  1617. else *)
  1618. exponent:=exponent*10+(ord(s[code])-ord('0'));
  1619. inc(code);
  1620. end;
  1621. if code=expstart then
  1622. exit;
  1623. end;
  1624. { Not all characters are read ? }
  1625. if length(s)>=code then
  1626. exit;
  1627. { adjust exponent based on decimal point }
  1628. dec(exponent,decpoint*esign);
  1629. if (exponent<0) then
  1630. begin
  1631. esign:=-1;
  1632. exponent:=-exponent;
  1633. end;
  1634. { evaluate sign }
  1635. { (before exponent, because the exponent may turn it into a denormal) }
  1636. fpc_Val_Real_ShortStr:=hd*sign;
  1637. { Calculate Exponent }
  1638. hd:=1.0;
  1639. { the magnitude range maximum (normal) is lower in absolute value than the }
  1640. { the magnitude range minimum (denormal). E.g. an extended value can go }
  1641. { up to 1E4932, but "down" to 1E-4951. So make sure that we don't try to }
  1642. { calculate 1E4951 as factor, since that would overflow and result in 0. }
  1643. if (exponent>valmaxexpnorm-2) then
  1644. begin
  1645. hd:=mul_by_power10(hd,valmaxexpnorm-2);
  1646. if esign>0 then
  1647. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*hd
  1648. else
  1649. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr/hd;
  1650. dec(exponent,valmaxexpnorm-2);
  1651. hd:=1.0;
  1652. end;
  1653. hd:=mul_by_power10(hd,exponent);
  1654. if esign>0 then
  1655. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr*hd
  1656. else
  1657. fpc_Val_Real_ShortStr:=fpc_Val_Real_ShortStr/hd;
  1658. { success ! }
  1659. code:=0;
  1660. end;
  1661. {$endif}
  1662. {$else not FLOAT_ASCII_FALLBACK}
  1663. {$ifndef FPUNONE}
  1664. Function fpc_Val_Real_ShortStr(const s : shortstring; out Code : ValSInt): ValReal; [public, alias:'FPC_VAL_REAL_SHORTSTR']; compilerproc;
  1665. begin
  1666. fpc_Val_Real_ShortStr := val_real( s, code );
  1667. end;
  1668. {$endif FPUNONE}
  1669. {$endif FLOAT_ASCII_FALLBACK}
  1670. {$ifndef FPC_STR_ENUM_INTERN}
  1671. function fpc_val_enum_shortstr(str2ordindex:pointer;const s:shortstring;out code:valsint):longint; [public, alias:'FPC_VAL_ENUM_SHORTSTR']; compilerproc;
  1672. function string_compare(const s1,s2:shortstring):sizeint;
  1673. {We cannot use the > and < operators to compare a string here, because we if the string is
  1674. not found in the enum, we need to return the position of error in "code". Code equals the
  1675. highest matching character of all string compares, which is only known inside the string
  1676. comparison.}
  1677. var i,l:byte;
  1678. c1,c2:char;
  1679. begin
  1680. l:=length(s1);
  1681. if length(s1)>length(s2) then
  1682. l:=length(s2);
  1683. i:=1;
  1684. while i<=l do
  1685. begin
  1686. c1:=s1[i];
  1687. c2:=s2[i];
  1688. if c1<>c2 then
  1689. break;
  1690. inc(i);
  1691. end;
  1692. if i>code then
  1693. code:=i;
  1694. if i<=l then
  1695. string_compare:=byte(c1)-byte(c2)
  1696. else
  1697. string_compare:=length(s1)-length(s2);
  1698. end;
  1699. type Psorted_array=^Tsorted_array;
  1700. Tsorted_array={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  1701. o:longint;
  1702. s:Pstring;
  1703. end;
  1704. Pstring_to_ord=^Tstring_to_ord;
  1705. Tstring_to_ord={$ifndef FPC_REQUIRES_PROPER_ALIGNMENT}packed{$endif}record
  1706. count:longint;
  1707. data:array[0..0] of Tsorted_array;
  1708. end;
  1709. var l,h,m:cardinal;
  1710. c:sizeint;
  1711. sorted_array:^Tsorted_array;
  1712. spaces:byte;
  1713. t:shortstring;
  1714. begin
  1715. {Val for numbers accepts spaces at the start, so lets do the same
  1716. for enums. Skip spaces at the start of the string.}
  1717. spaces:=1;
  1718. code:=1;
  1719. while (spaces<=length(s)) and (s[spaces]=' ') do
  1720. inc(spaces);
  1721. t:=upcase(copy(s,spaces,255));
  1722. sorted_array:=pointer(@Pstring_to_ord(str2ordindex)^.data);
  1723. {Use a binary search to get the string.}
  1724. l:=1;
  1725. h:=Pstring_to_ord(str2ordindex)^.count;
  1726. repeat
  1727. m:=(l+h) div 2;
  1728. c:=string_compare(t,upcase(sorted_array[m-1].s^));
  1729. if c>0 then
  1730. l:=m+1
  1731. else if c<0 then
  1732. h:=m-1
  1733. else
  1734. break;
  1735. if l>h then
  1736. begin
  1737. {Not found...}
  1738. inc(code,spaces-1); {Add skipped spaces again.}
  1739. {The result of val in case of error is undefined, don't assign a function result.}
  1740. exit;
  1741. end;
  1742. until false;
  1743. code:=0;
  1744. fpc_val_enum_shortstr:=sorted_array[m-1].o;
  1745. end;
  1746. {Redeclare fpc_val_enum_shortstr for internal use in the system unit.}
  1747. function fpc_val_enum_shortstr(str2ordindex:pointer;const s:shortstring;out code:valsint):longint;external name 'FPC_VAL_ENUM_SHORTSTR';
  1748. {$endif FPC_STR_ENUM_INTERN}
  1749. function fpc_Val_Currency_ShortStr(const s : shortstring; out Code : ValSInt): currency; [public, alias:'FPC_VAL_CURRENCY_SHORTSTR']; compilerproc;
  1750. const
  1751. MaxInt64 : Int64 = $7FFFFFFFFFFFFFFF;
  1752. Int64Edge : Int64 = ($7FFFFFFFFFFFFFFF - 10) div 10;
  1753. Int64Edge2 : Int64 = $7FFFFFFFFFFFFFFF div 10;
  1754. var
  1755. { to enable taking the address on the JVM target }
  1756. res : array[0..0] of Int64;
  1757. i,j,power,sign,len : longint;
  1758. FracOverflow : boolean;
  1759. begin
  1760. fpc_Val_Currency_ShortStr:=0;
  1761. res[0]:=0;
  1762. len:=Length(s);
  1763. Code:=1;
  1764. sign:=1;
  1765. power:=0;
  1766. while True do
  1767. if Code > len then
  1768. exit
  1769. else
  1770. if s[Code] in [' ', #9] then
  1771. Inc(Code)
  1772. else
  1773. break;
  1774. { Read sign }
  1775. case s[Code] of
  1776. '+' : Inc(Code);
  1777. '-' : begin
  1778. sign:=-1;
  1779. inc(code);
  1780. end;
  1781. end;
  1782. { Read digits }
  1783. FracOverflow:=False;
  1784. i:=0;
  1785. while Code <= len do
  1786. begin
  1787. case s[Code] of
  1788. '0'..'9':
  1789. begin
  1790. j:=Ord(s[code])-Ord('0');
  1791. { check overflow }
  1792. if (res[0] <= Int64Edge) or (res[0] <= (MaxInt64 - j) div 10) then
  1793. begin
  1794. res[0]:=res[0]*10 + j;
  1795. Inc(i);
  1796. end
  1797. else
  1798. if power = 0 then
  1799. { exit if integer part overflow }
  1800. exit
  1801. else
  1802. begin
  1803. if not FracOverflow and (j >= 5) and (res[0] < MaxInt64) then
  1804. { round if first digit of fractional part overflow }
  1805. Inc(res[0]);
  1806. FracOverflow:=True;
  1807. end;
  1808. end;
  1809. '.':
  1810. begin
  1811. if power = 0 then
  1812. begin
  1813. power:=1;
  1814. i:=0;
  1815. end
  1816. else
  1817. exit;
  1818. end;
  1819. else
  1820. break;
  1821. end;
  1822. Inc(Code);
  1823. end;
  1824. if (i = 0) and (power = 0) then
  1825. exit;
  1826. if power <> 0 then
  1827. power:=i;
  1828. power:=4 - power;
  1829. { Exponent? }
  1830. if Code <= len then
  1831. if s[Code] in ['E', 'e'] then
  1832. begin
  1833. Inc(Code);
  1834. if Code > len then
  1835. exit;
  1836. i:=1;
  1837. case s[Code] of
  1838. '+':
  1839. Inc(Code);
  1840. '-':
  1841. begin
  1842. i:=-1;
  1843. Inc(Code);
  1844. end;
  1845. end;
  1846. { read exponent }
  1847. j:=0;
  1848. while Code <= len do
  1849. if s[Code] in ['0'..'9'] then
  1850. begin
  1851. if j > 4951 then
  1852. exit;
  1853. j:=j*10 + (Ord(s[code])-Ord('0'));
  1854. Inc(Code);
  1855. end
  1856. else
  1857. exit;
  1858. power:=power + j*i;
  1859. end
  1860. else
  1861. exit;
  1862. if power > 0 then
  1863. begin
  1864. for i:=1 to power do
  1865. if res[0] <= Int64Edge2 then
  1866. res[0]:=res[0]*10
  1867. else
  1868. exit;
  1869. end
  1870. else
  1871. for i:=1 to -power do
  1872. begin
  1873. if res[0] <= MaxInt64 - 5 then
  1874. Inc(res[0], 5);
  1875. res[0]:=res[0] div 10;
  1876. end;
  1877. res[0]:=res[0]*sign;
  1878. fpc_Val_Currency_ShortStr:=PCurrency(@res[0])^;
  1879. Code:=0;
  1880. end;
  1881. {$ifndef FPC_HAS_SETSTRING_SHORTSTR}
  1882. {$define FPC_HAS_SETSTRING_SHORTSTR}
  1883. Procedure {$ifdef FPC_HAS_CPSTRING}fpc_setstring_shortstr{$else}SetString{$endif}(Out S : Shortstring; Buf : PChar; Len : SizeInt); {$ifdef FPC_HAS_CPSTRING} compilerproc; {$endif FPC_HAS_CPSTRING}
  1884. begin
  1885. If Len > High(S) then
  1886. Len := High(S);
  1887. SetLength(S,Len);
  1888. If Buf<>Nil then
  1889. begin
  1890. Move (Buf[0],S[1],Len);
  1891. end;
  1892. end;
  1893. {$endif FPC_HAS_SETSTRING_SHORTSTR}
  1894. {$ifndef FPC_HAS_COMPARETEXT_SHORTSTR}
  1895. {$define FPC_HAS_COMPARETEXT_SHORTSTR}
  1896. function ShortCompareText(const S1, S2: shortstring): SizeInt;
  1897. var
  1898. c1, c2: Byte;
  1899. i: SizeInt;
  1900. L1, L2, Count: SizeInt;
  1901. P1, P2: PChar;
  1902. begin
  1903. L1 := Length(S1);
  1904. L2 := Length(S2);
  1905. if L1 > L2 then
  1906. Count := L2
  1907. else
  1908. Count := L1;
  1909. i := 0;
  1910. P1 := @S1[1];
  1911. P2 := @S2[1];
  1912. while i < count do
  1913. begin
  1914. c1 := byte(p1^);
  1915. c2 := byte(p2^);
  1916. if c1 <> c2 then
  1917. begin
  1918. if c1 in [97..122] then
  1919. Dec(c1, 32);
  1920. if c2 in [97..122] then
  1921. Dec(c2, 32);
  1922. if c1 <> c2 then
  1923. Break;
  1924. end;
  1925. Inc(P1); Inc(P2); Inc(I);
  1926. end;
  1927. if i < count then
  1928. ShortCompareText := c1 - c2
  1929. else
  1930. ShortCompareText := L1 - L2;
  1931. end;
  1932. {$endif FPC_HAS_COMPARETEXT_SHORTSTR}