cgcpu.pas 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. This unit implements the code generator for the Risc-V32
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit cgcpu;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. globtype,symtype,symdef,
  22. cgbase,cgobj,cgrv,
  23. aasmbase,aasmcpu,aasmtai,aasmdata,
  24. cpubase,cpuinfo,cgutils,cg64f32,rgcpu,
  25. parabase;
  26. type
  27. tcgrv32 = class(tcgrv)
  28. procedure init_register_allocators;override;
  29. procedure done_register_allocators;override;
  30. { move instructions }
  31. procedure a_load_reg_reg(list : TAsmList; fromsize, tosize : tcgsize;reg1,reg2 : tregister);override;
  32. { 32x32 to 64 bit multiplication }
  33. procedure a_mul_reg_reg_pair(list: TAsmList;size: tcgsize; src1,src2,dstlo,dsthi: tregister); override;
  34. procedure g_concatcopy_move(list: tasmlist; const Source, dest: treference; len: tcgint);
  35. procedure g_concatcopy(list : TAsmList;const source,dest : treference;len : tcgint);override;
  36. procedure g_overflowcheck(list: TAsmList; const Loc: tlocation; def: tdef); override;
  37. end;
  38. tcg64frv = class(tcg64f32)
  39. procedure a_op64_reg_reg(list : TAsmList;op:TOpCG;size : tcgsize;regsrc,regdst : tregister64);override;
  40. procedure a_op64_const_reg(list : TAsmList;op:TOpCG;size : tcgsize;value : int64;reg : tregister64);override;
  41. procedure a_op64_const_reg_reg(list: TAsmList;op:TOpCG;size : tcgsize;value : int64;regsrc,regdst : tregister64);override;
  42. procedure a_op64_reg_reg_reg(list: TAsmList;op:TOpCG;size : tcgsize;regsrc1,regsrc2,regdst : tregister64);override;
  43. end;
  44. procedure create_codegen;
  45. implementation
  46. uses
  47. symtable,
  48. globals,verbose,systems,cutils,
  49. symconst,symsym,fmodule,
  50. rgobj,tgobj,cpupi,procinfo,paramgr;
  51. {$undef AVOID_OVERFLOW}
  52. {$ifopt Q+}
  53. {$define AVOID_OVERFLOW}
  54. const
  55. max_12_bit = 1 shl 12;
  56. {$endif}
  57. { Range check must be disabled explicitly as conversions between signed and unsigned
  58. 32-bit values are done without explicit typecasts }
  59. {$R-}
  60. procedure tcgrv32.init_register_allocators;
  61. begin
  62. inherited init_register_allocators;
  63. if CPURV_HAS_16REGISTERS in cpu_capabilities[current_settings.cputype] then
  64. rg[R_INTREGISTER]:=trgintcpu.create(R_INTREGISTER,R_SUBWHOLE,
  65. [RS_X10,RS_X11,RS_X12,RS_X13,RS_X14,RS_X15,
  66. RS_X5,RS_X6,RS_X7,
  67. RS_X3,RS_X4,
  68. RS_X9],first_int_imreg,[])
  69. else
  70. rg[R_INTREGISTER]:=trgintcpu.create(R_INTREGISTER,R_SUBWHOLE,
  71. [RS_X10,RS_X11,RS_X12,RS_X13,RS_X14,RS_X15,RS_X16,RS_X17,
  72. RS_X31,RS_X30,RS_X29,RS_X28,
  73. RS_X5,RS_X6,RS_X7,
  74. RS_X3,RS_X4,
  75. RS_X9,RS_X27,RS_X26,RS_X25,RS_X24,RS_X23,RS_X22,
  76. RS_X21,RS_X20,RS_X19,RS_X18],first_int_imreg,[]);
  77. rg[R_FPUREGISTER]:=trgcpu.create(R_FPUREGISTER,R_SUBNONE,
  78. [RS_F10,RS_F11,RS_F12,RS_F13,RS_F14,RS_F15,RS_F16,RS_F17,
  79. RS_F0,RS_F1,RS_F2,RS_F3,RS_F4,RS_F5,RS_F6,RS_F7,
  80. RS_F28,RS_F29,RS_F30,RS_F31,
  81. RS_F8,RS_F9,
  82. RS_F27,
  83. RS_F26,RS_F25,RS_F24,RS_F23,RS_F22,RS_F21,RS_F20,RS_F19,RS_F18],first_fpu_imreg,[]);
  84. end;
  85. procedure tcgrv32.done_register_allocators;
  86. begin
  87. rg[R_INTREGISTER].free;
  88. rg[R_FPUREGISTER].free;
  89. inherited done_register_allocators;
  90. end;
  91. procedure tcgrv32.a_load_reg_reg(list : TAsmList;fromsize, tosize : tcgsize;reg1,reg2 : tregister);
  92. var
  93. ai: taicpu;
  94. begin
  95. list.concat(tai_comment.Create(strpnew('Move '+tcgsize2str(fromsize)+'->'+tcgsize2str(tosize))));
  96. if (tosize=OS_S32) and (fromsize=OS_32) then
  97. begin
  98. ai:=taicpu.op_reg_reg_const(A_ADDI,reg2,reg1,0);
  99. list.concat(ai);
  100. rg[R_INTREGISTER].add_move_instruction(ai);
  101. end
  102. else if (tcgsize2unsigned[tosize]=OS_32) and (fromsize=OS_8) then
  103. list.Concat(taicpu.op_reg_reg_const(A_ANDI,reg2,reg1,$FF))
  104. else if (tcgsize2size[fromsize] > tcgsize2size[tosize]) or
  105. ((tcgsize2size[fromsize] = tcgsize2size[tosize]) and (fromsize <> tosize)) or
  106. { do we need to mask out the sign when loading from smaller signed to larger unsigned type? }
  107. ((tcgsize2unsigned[fromsize]<>fromsize) and ((tcgsize2unsigned[tosize]=tosize)) and
  108. (tcgsize2size[fromsize] < tcgsize2size[tosize]) and (tcgsize2size[tosize] <> sizeof(pint)) ) then
  109. begin
  110. if tcgsize2size[fromsize]<tcgsize2size[tosize] then
  111. begin
  112. list.Concat(taicpu.op_reg_reg_const(A_SLLI,reg2,reg1,8*(4-tcgsize2size[fromsize])));
  113. if tcgsize2unsigned[fromsize]<>fromsize then
  114. list.Concat(taicpu.op_reg_reg_const(A_SRAI,reg2,reg2,8*(tcgsize2size[tosize]-tcgsize2size[fromsize])))
  115. else
  116. list.Concat(taicpu.op_reg_reg_const(A_SRLI,reg2,reg2,8*(tcgsize2size[tosize]-tcgsize2size[fromsize])));
  117. end
  118. else
  119. list.Concat(taicpu.op_reg_reg_const(A_SLLI,reg2,reg1,8*(4-tcgsize2size[tosize])));
  120. if tcgsize2unsigned[tosize]=tosize then
  121. list.Concat(taicpu.op_reg_reg_const(A_SRLI,reg2,reg2,8*(4-tcgsize2size[tosize])))
  122. else
  123. list.Concat(taicpu.op_reg_reg_const(A_SRAI,reg2,reg2,8*(4-tcgsize2size[tosize])));
  124. end
  125. else
  126. begin
  127. ai:=taicpu.op_reg_reg_const(A_ADDI,reg2,reg1,0);
  128. list.concat(ai);
  129. rg[R_INTREGISTER].add_move_instruction(ai);
  130. end;
  131. end;
  132. procedure tcgrv32.a_mul_reg_reg_pair(list: TAsmList;size: tcgsize; src1,src2,dstlo,dsthi: tregister);
  133. var
  134. op: tasmop;
  135. begin
  136. case size of
  137. OS_INT: op:=A_MULHU;
  138. OS_SINT: op:=A_MULH;
  139. else
  140. InternalError(2014061501);
  141. end;
  142. if (dsthi<>NR_NO) then
  143. list.concat(taicpu.op_reg_reg_reg(op,dsthi,src1,src2));
  144. { low word is always unsigned }
  145. if (dstlo<>NR_NO) then
  146. list.concat(taicpu.op_reg_reg_reg(A_MUL,dstlo,src1,src2));
  147. end;
  148. procedure tcgrv32.g_concatcopy_move(list: tasmlist; const Source, dest: treference; len: tcgint);
  149. var
  150. paraloc1, paraloc2, paraloc3: TCGPara;
  151. pd: tprocdef;
  152. begin
  153. pd:=search_system_proc('MOVE');
  154. paraloc1.init;
  155. paraloc2.init;
  156. paraloc3.init;
  157. paramanager.getcgtempparaloc(list, pd, 1, paraloc1);
  158. paramanager.getcgtempparaloc(list, pd, 2, paraloc2);
  159. paramanager.getcgtempparaloc(list, pd, 3, paraloc3);
  160. a_load_const_cgpara(list, OS_SINT, len, paraloc3);
  161. a_loadaddr_ref_cgpara(list, dest, paraloc2);
  162. a_loadaddr_ref_cgpara(list, Source, paraloc1);
  163. paramanager.freecgpara(list, paraloc3);
  164. paramanager.freecgpara(list, paraloc2);
  165. paramanager.freecgpara(list, paraloc1);
  166. alloccpuregisters(list, R_INTREGISTER, paramanager.get_volatile_registers_int(pocall_default));
  167. alloccpuregisters(list, R_FPUREGISTER, paramanager.get_volatile_registers_fpu(pocall_default));
  168. a_call_name(list, 'FPC_MOVE', false);
  169. dealloccpuregisters(list, R_FPUREGISTER, paramanager.get_volatile_registers_fpu(pocall_default));
  170. dealloccpuregisters(list, R_INTREGISTER, paramanager.get_volatile_registers_int(pocall_default));
  171. paraloc3.done;
  172. paraloc2.done;
  173. paraloc1.done;
  174. end;
  175. procedure tcgrv32.g_concatcopy(list : TAsmList;const source,dest : treference;len : tcgint);
  176. var
  177. tmpreg1, hreg, countreg: TRegister;
  178. src, dst, src2, dst2: TReference;
  179. lab: tasmlabel;
  180. Count, count2: aint;
  181. function reference_is_reusable(const ref: treference): boolean;
  182. begin
  183. result:=(ref.base<>NR_NO) and (ref.index=NR_NO) and
  184. (ref.symbol=nil) and
  185. is_imm12(ref.offset);
  186. end;
  187. begin
  188. src2:=source;
  189. fixref(list,src2);
  190. dst2:=dest;
  191. fixref(list,dst2);
  192. if len > high(longint) then
  193. internalerror(2002072704);
  194. { A call (to FPC_MOVE) requires the outgoing parameter area to be properly
  195. allocated on stack. This can only be done before tmipsprocinfo.set_first_temp_offset,
  196. i.e. before secondpass. Other internal procedures request correct stack frame
  197. by setting pi_do_call during firstpass, but for this particular one it is impossible.
  198. Therefore, if the current procedure is a leaf one, we have to leave it that way. }
  199. { anybody wants to determine a good value here :)? }
  200. if (len > 100) and
  201. assigned(current_procinfo) and
  202. (pi_do_call in current_procinfo.flags) then
  203. g_concatcopy_move(list, src2, dst2, len)
  204. else
  205. begin
  206. Count := len div 4;
  207. if (count<=4) and reference_is_reusable(src2) then
  208. src:=src2
  209. else
  210. begin
  211. reference_reset(src,sizeof(aint),[]);
  212. { load the address of src2 into src.base }
  213. src.base := GetAddressRegister(list);
  214. a_loadaddr_ref_reg(list, src2, src.base);
  215. end;
  216. if (count<=4) and reference_is_reusable(dst2) then
  217. dst:=dst2
  218. else
  219. begin
  220. reference_reset(dst,sizeof(aint),[]);
  221. { load the address of dst2 into dst.base }
  222. dst.base := GetAddressRegister(list);
  223. a_loadaddr_ref_reg(list, dst2, dst.base);
  224. end;
  225. { generate a loop }
  226. if Count > 4 then
  227. begin
  228. countreg := GetIntRegister(list, OS_INT);
  229. tmpreg1 := GetIntRegister(list, OS_INT);
  230. a_load_const_reg(list, OS_INT, Count, countreg);
  231. current_asmdata.getjumplabel(lab);
  232. a_label(list, lab);
  233. list.concat(taicpu.op_reg_ref(A_LW, tmpreg1, src));
  234. list.concat(taicpu.op_reg_ref(A_SW, tmpreg1, dst));
  235. list.concat(taicpu.op_reg_reg_const(A_ADDI, src.base, src.base, 4));
  236. list.concat(taicpu.op_reg_reg_const(A_ADDI, dst.base, dst.base, 4));
  237. list.concat(taicpu.op_reg_reg_const(A_ADDI, countreg, countreg, -1));
  238. a_cmp_reg_reg_label(list,OS_INT,OC_GT,NR_X0,countreg,lab);
  239. len := len mod 4;
  240. end;
  241. { unrolled loop }
  242. Count := len div 4;
  243. if Count > 0 then
  244. begin
  245. tmpreg1 := GetIntRegister(list, OS_INT);
  246. for count2 := 1 to Count do
  247. begin
  248. list.concat(taicpu.op_reg_ref(A_LW, tmpreg1, src));
  249. list.concat(taicpu.op_reg_ref(A_SW, tmpreg1, dst));
  250. Inc(src.offset, 4);
  251. Inc(dst.offset, 4);
  252. end;
  253. len := len mod 4;
  254. end;
  255. if (len and 4) <> 0 then
  256. begin
  257. hreg := GetIntRegister(list, OS_INT);
  258. a_load_ref_reg(list, OS_32, OS_32, src, hreg);
  259. a_load_reg_ref(list, OS_32, OS_32, hreg, dst);
  260. Inc(src.offset, 4);
  261. Inc(dst.offset, 4);
  262. end;
  263. { copy the leftovers }
  264. if (len and 2) <> 0 then
  265. begin
  266. hreg := GetIntRegister(list, OS_INT);
  267. a_load_ref_reg(list, OS_16, OS_16, src, hreg);
  268. a_load_reg_ref(list, OS_16, OS_16, hreg, dst);
  269. Inc(src.offset, 2);
  270. Inc(dst.offset, 2);
  271. end;
  272. if (len and 1) <> 0 then
  273. begin
  274. hreg := GetIntRegister(list, OS_INT);
  275. a_load_ref_reg(list, OS_8, OS_8, src, hreg);
  276. a_load_reg_ref(list, OS_8, OS_8, hreg, dst);
  277. end;
  278. end;
  279. end;
  280. procedure tcgrv32.g_overflowcheck(list: TAsmList; const Loc: tlocation; def: tdef);
  281. begin
  282. end;
  283. procedure tcg64frv.a_op64_reg_reg(list : TAsmList;op:TOpCG;size : tcgsize;regsrc,regdst : tregister64);
  284. var
  285. tmpreg1: TRegister;
  286. begin
  287. case op of
  288. OP_NOT:
  289. begin
  290. cg.a_op_reg_reg(list,OP_NOT,OS_32,regsrc.reglo,regdst.reglo);
  291. cg.a_op_reg_reg(list,OP_NOT,OS_32,regsrc.reghi,regdst.reghi);
  292. end;
  293. OP_NEG:
  294. begin
  295. tmpreg1 := cg.GetIntRegister(list, OS_INT);
  296. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reglo, NR_X0, regsrc.reglo));
  297. list.concat(taicpu.op_reg_reg_reg(A_SLTU, tmpreg1, NR_X0, regdst.reglo));
  298. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reghi, NR_X0, regsrc.reghi));
  299. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reghi, regdst.reghi, tmpreg1));
  300. end;
  301. else
  302. a_op64_reg_reg_reg(list,op,size,regsrc,regdst,regdst);
  303. end;
  304. end;
  305. procedure tcg64frv.a_op64_const_reg(list : TAsmList;op:TOpCG;size : tcgsize;value : int64;reg : tregister64);
  306. begin
  307. a_op64_const_reg_reg(list,op,size,value,reg,reg);
  308. end;
  309. procedure tcg64frv.a_op64_reg_reg_reg(list: TAsmList;op:TOpCG;size : tcgsize;regsrc1,regsrc2,regdst : tregister64);
  310. var
  311. signed: Boolean;
  312. tmplo, carry, tmphi, hreg: TRegister;
  313. begin
  314. case op of
  315. OP_AND,OP_OR,OP_XOR:
  316. begin
  317. cg.a_op_reg_reg_reg(list,op,OS_32,regsrc1.reglo,regsrc2.reglo,regdst.reglo);
  318. cg.a_op_reg_reg_reg(list,op,OS_32,regsrc1.reghi,regsrc2.reghi,regdst.reghi);
  319. end;
  320. OP_ADD:
  321. begin
  322. signed:=(size in [OS_S64]);
  323. tmplo := cg.GetIntRegister(list,OS_S32);
  324. carry := cg.GetIntRegister(list,OS_S32);
  325. // destreg.reglo could be regsrc1.reglo or regsrc2.reglo
  326. list.concat(taicpu.op_reg_reg_reg(A_ADD, tmplo, regsrc2.reglo, regsrc1.reglo));
  327. list.concat(taicpu.op_reg_reg_reg(A_SLTU, carry, tmplo, regsrc2.reglo));
  328. cg.a_load_reg_reg(list,OS_INT,OS_INT,tmplo,regdst.reglo);
  329. if signed then
  330. begin
  331. list.concat(taicpu.op_reg_reg_reg(A_ADD, regdst.reghi, regsrc2.reghi, regsrc1.reghi));
  332. list.concat(taicpu.op_reg_reg_reg(A_ADD, regdst.reghi, regdst.reghi, carry));
  333. end
  334. else
  335. begin
  336. tmphi:=cg.GetIntRegister(list,OS_INT);
  337. hreg:=cg.GetIntRegister(list,OS_INT);
  338. cg.a_load_const_reg(list,OS_INT,$80000000,hreg);
  339. // first add carry to one of the addends
  340. list.concat(taicpu.op_reg_reg_reg(A_ADD, tmphi, regsrc2.reghi, carry));
  341. list.concat(taicpu.op_reg_reg_reg(A_SLTU, carry, tmphi, regsrc2.reghi));
  342. list.concat(taicpu.op_reg_reg_reg(A_SUB, carry, hreg, carry));
  343. // then add another addend
  344. list.concat(taicpu.op_reg_reg_reg(A_ADD, regdst.reghi, tmphi, regsrc1.reghi));
  345. end;
  346. end;
  347. OP_SUB:
  348. begin
  349. signed:=(size in [OS_S64]);
  350. tmplo := cg.GetIntRegister(list,OS_S32);
  351. carry := cg.GetIntRegister(list,OS_S32);
  352. // destreg.reglo could be regsrc1.reglo or regsrc2.reglo
  353. list.concat(taicpu.op_reg_reg_reg(A_SUB, tmplo, regsrc2.reglo, regsrc1.reglo));
  354. list.concat(taicpu.op_reg_reg_reg(A_SLTU, carry, regsrc2.reglo,tmplo));
  355. cg.a_load_reg_reg(list,OS_INT,OS_INT,tmplo,regdst.reglo);
  356. if signed then
  357. begin
  358. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reghi, regsrc2.reghi, regsrc1.reghi));
  359. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reghi, regdst.reghi, carry));
  360. end
  361. else
  362. begin
  363. tmphi:=cg.GetIntRegister(list,OS_INT);
  364. hreg:=cg.GetIntRegister(list,OS_INT);
  365. cg.a_load_const_reg(list,OS_INT,$80000000,hreg);
  366. // first subtract the carry...
  367. list.concat(taicpu.op_reg_reg_reg(A_SUB, tmphi, regsrc2.reghi, carry));
  368. list.concat(taicpu.op_reg_reg_reg(A_SLTU, carry, regsrc2.reghi, tmphi));
  369. list.concat(taicpu.op_reg_reg_reg(A_SUB, carry, hreg, carry));
  370. // ...then the subtrahend
  371. list.concat(taicpu.op_reg_reg_reg(A_SUB, regdst.reghi, tmphi, regsrc1.reghi));
  372. end;
  373. end;
  374. else
  375. internalerror(2002072801);
  376. end;
  377. end;
  378. procedure tcg64frv.a_op64_const_reg_reg(list: TAsmList;op:TOpCG;size : tcgsize;value : int64;regsrc,regdst : tregister64);
  379. var
  380. tmplo,carry: TRegister;
  381. hisize: tcgsize;
  382. begin
  383. carry:=NR_NO;
  384. if (size in [OS_S64]) then
  385. hisize:=OS_S32
  386. else
  387. hisize:=OS_32;
  388. case op of
  389. OP_AND,OP_OR,OP_XOR:
  390. begin
  391. cg.a_op_const_reg_reg(list,op,OS_32,aint(lo(value)),regsrc.reglo,regdst.reglo);
  392. cg.a_op_const_reg_reg(list,op,OS_32,aint(hi(value)),regsrc.reghi,regdst.reghi);
  393. end;
  394. OP_ADD:
  395. begin
  396. if lo(value)<>0 then
  397. begin
  398. tmplo:=cg.GetIntRegister(list,OS_32);
  399. carry:=cg.GetIntRegister(list,OS_32);
  400. if is_imm12(aint(lo(value))) then
  401. list.concat(taicpu.op_reg_reg_const(A_ADDI,tmplo,regsrc.reglo,aint(lo(value))))
  402. else
  403. begin
  404. cg.a_load_const_reg(list,OS_INT,aint(lo(value)),tmplo);
  405. list.concat(taicpu.op_reg_reg_reg(A_ADD,tmplo,tmplo,regsrc.reglo))
  406. end;
  407. list.concat(taicpu.op_reg_reg_reg(A_SLTU,carry,tmplo,regsrc.reglo));
  408. cg.a_load_reg_reg(list,OS_32,OS_32,tmplo,regdst.reglo);
  409. end
  410. else
  411. cg.a_load_reg_reg(list,OS_32,OS_32,regsrc.reglo,regdst.reglo);
  412. { With overflow checking and unsigned args, this generates slighly suboptimal code
  413. ($80000000 constant loaded twice). Other cases are fine. Getting it perfect does not
  414. look worth the effort. }
  415. cg.a_op_const_reg_reg(list,OP_ADD,hisize,aint(hi(value)),regsrc.reghi,regdst.reghi);
  416. if carry<>NR_NO then
  417. cg.a_op_reg_reg_reg(list,OP_ADD,hisize,carry,regdst.reghi,regdst.reghi);
  418. end;
  419. OP_SUB:
  420. begin
  421. carry:=NR_NO;
  422. if lo(value)<>0 then
  423. begin
  424. tmplo:=cg.GetIntRegister(list,OS_32);
  425. carry:=cg.GetIntRegister(list,OS_32);
  426. if {$ifdef AVOID_OVERFLOW} (abs(value) <= max_12_bit) and {$endif} is_imm12(-aint(lo(value))) then
  427. list.concat(taicpu.op_reg_reg_const(A_ADDI,tmplo,regsrc.reglo,-aint(lo(value))))
  428. else
  429. begin
  430. cg.a_load_const_reg(list,OS_INT,aint(lo(value)),tmplo);
  431. list.concat(taicpu.op_reg_reg_reg(A_SUB,tmplo,regsrc.reglo,tmplo))
  432. end;
  433. list.concat(taicpu.op_reg_reg_reg(A_SLTU,carry,regsrc.reglo,tmplo));
  434. cg.a_load_reg_reg(list,OS_32,OS_32,tmplo,regdst.reglo);
  435. end
  436. else
  437. cg.a_load_reg_reg(list,OS_32,OS_32,regsrc.reglo,regdst.reglo);
  438. cg.a_op_const_reg_reg(list,OP_SUB,hisize,aint(hi(value)),regsrc.reghi,regdst.reghi);
  439. if carry<>NR_NO then
  440. cg.a_op_reg_reg_reg(list,OP_SUB,hisize,carry,regdst.reghi,regdst.reghi);
  441. end;
  442. else
  443. InternalError(2013050301);
  444. end;
  445. end;
  446. procedure create_codegen;
  447. begin
  448. cg := tcgrv32.create;
  449. cg64 :=tcg64frv.create;
  450. end;
  451. end.