n386add.pas 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591
  1. {
  2. Copyright (c) 2000-2002 by Florian Klaempfl
  3. Code generation for add nodes on the i386
  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 n386add;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. node,nadd,cpubase,nx86add;
  22. type
  23. ti386addnode = class(tx86addnode)
  24. function use_generic_mul32to64: boolean; override;
  25. function use_generic_mul64bit: boolean; override;
  26. procedure second_addordinal; override;
  27. procedure second_add64bit;override;
  28. procedure second_cmp64bit;override;
  29. procedure second_mul(unsigned: boolean);
  30. procedure second_mul64bit;
  31. protected
  32. procedure set_mul_result_location;
  33. end;
  34. implementation
  35. uses
  36. globtype,systems,
  37. cutils,verbose,globals,
  38. symconst,symdef,paramgr,defutil,
  39. aasmbase,aasmtai,aasmdata,aasmcpu,
  40. cgbase,procinfo,
  41. ncon,nset,cgutils,tgobj,
  42. cga,ncgutil,cgobj,cg64f32,cgx86,
  43. hlcgobj;
  44. {*****************************************************************************
  45. use_generic_mul32to64
  46. *****************************************************************************}
  47. function ti386addnode.use_generic_mul32to64: boolean;
  48. begin
  49. result := False;
  50. end;
  51. function ti386addnode.use_generic_mul64bit: boolean;
  52. begin
  53. result:=(cs_check_overflow in current_settings.localswitches) or
  54. (cs_opt_size in current_settings.optimizerswitches);
  55. end;
  56. { handles all unsigned multiplications, and 32->64 bit signed ones.
  57. 32bit-only signed mul is handled by generic codegen }
  58. procedure ti386addnode.second_addordinal;
  59. var
  60. unsigned: boolean;
  61. begin
  62. unsigned:=not(is_signed(left.resultdef)) or
  63. not(is_signed(right.resultdef));
  64. { use IMUL instead of MUL in case overflow checking is off and we're
  65. doing a 32->32-bit multiplication }
  66. if not (cs_check_overflow in current_settings.localswitches) and
  67. not is_64bit(resultdef) then
  68. unsigned:=false;
  69. if (nodetype=muln) and (unsigned or is_64bit(resultdef)) then
  70. second_mul(unsigned)
  71. else
  72. inherited second_addordinal;
  73. end;
  74. {*****************************************************************************
  75. Add64bit
  76. *****************************************************************************}
  77. procedure ti386addnode.second_add64bit;
  78. var
  79. op : TOpCG;
  80. op1,op2 : TAsmOp;
  81. opsize : TOpSize;
  82. hregister,
  83. hregister2 : tregister;
  84. hl4 : tasmlabel;
  85. mboverflow,
  86. unsigned:boolean;
  87. r:Tregister;
  88. begin
  89. pass_left_right;
  90. op1:=A_NONE;
  91. op2:=A_NONE;
  92. mboverflow:=false;
  93. opsize:=S_L;
  94. unsigned:=((left.resultdef.typ=orddef) and
  95. (torddef(left.resultdef).ordtype=u64bit)) or
  96. ((right.resultdef.typ=orddef) and
  97. (torddef(right.resultdef).ordtype=u64bit));
  98. case nodetype of
  99. addn :
  100. begin
  101. op:=OP_ADD;
  102. mboverflow:=true;
  103. end;
  104. subn :
  105. begin
  106. op:=OP_SUB;
  107. op1:=A_SUB;
  108. op2:=A_SBB;
  109. mboverflow:=true;
  110. end;
  111. xorn:
  112. op:=OP_XOR;
  113. orn:
  114. op:=OP_OR;
  115. andn:
  116. op:=OP_AND;
  117. muln:
  118. begin
  119. second_mul64bit;
  120. exit;
  121. end
  122. else
  123. begin
  124. { everything should be handled in pass_1 (JM) }
  125. internalerror(200109051);
  126. end;
  127. end;
  128. { left and right no register? }
  129. { then one must be demanded }
  130. if (left.location.loc<>LOC_REGISTER) then
  131. begin
  132. if (right.location.loc<>LOC_REGISTER) then
  133. begin
  134. hregister:=cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  135. hregister2:=cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  136. cg64.a_load64_loc_reg(current_asmdata.CurrAsmList,left.location,joinreg64(hregister,hregister2));
  137. location_reset(left.location,LOC_REGISTER,left.location.size);
  138. left.location.register64.reglo:=hregister;
  139. left.location.register64.reghi:=hregister2;
  140. end
  141. else
  142. begin
  143. location_swap(left.location,right.location);
  144. toggleflag(nf_swapped);
  145. end;
  146. end;
  147. { at this point, left.location.loc should be LOC_REGISTER }
  148. if right.location.loc=LOC_REGISTER then
  149. begin
  150. { when swapped another result register }
  151. if (nodetype=subn) and (nf_swapped in flags) then
  152. begin
  153. cg64.a_op64_reg_reg(current_asmdata.CurrAsmList,op,location.size,
  154. left.location.register64,
  155. right.location.register64);
  156. location_swap(left.location,right.location);
  157. toggleflag(nf_swapped);
  158. end
  159. else
  160. begin
  161. cg64.a_op64_reg_reg(current_asmdata.CurrAsmList,op,location.size,
  162. right.location.register64,
  163. left.location.register64);
  164. end;
  165. end
  166. else
  167. begin
  168. { right.location<>LOC_REGISTER }
  169. if (nodetype=subn) and (nf_swapped in flags) then
  170. begin
  171. r:=cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  172. cg64.a_load64low_loc_reg(current_asmdata.CurrAsmList,right.location,r);
  173. emit_reg_reg(op1,opsize,left.location.register64.reglo,r);
  174. emit_reg_reg(A_MOV,opsize,r,left.location.register64.reglo);
  175. cg64.a_load64high_loc_reg(current_asmdata.CurrAsmList,right.location,r);
  176. { the carry flag is still ok }
  177. emit_reg_reg(op2,opsize,left.location.register64.reghi,r);
  178. emit_reg_reg(A_MOV,opsize,r,left.location.register64.reghi);
  179. end
  180. else
  181. begin
  182. cg64.a_op64_loc_reg(current_asmdata.CurrAsmList,op,location.size,right.location,
  183. left.location.register64);
  184. end;
  185. location_freetemp(current_asmdata.CurrAsmList,right.location);
  186. end;
  187. { only in case of overflow operations }
  188. { produce overflow code }
  189. { we must put it here directly, because sign of operation }
  190. { is in unsigned VAR!! }
  191. if mboverflow then
  192. begin
  193. if cs_check_overflow in current_settings.localswitches then
  194. begin
  195. current_asmdata.getjumplabel(hl4);
  196. if unsigned then
  197. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_AE,hl4)
  198. else
  199. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_NO,hl4);
  200. cg.a_call_name(current_asmdata.CurrAsmList,'FPC_OVERFLOW',false);
  201. cg.a_label(current_asmdata.CurrAsmList,hl4);
  202. end;
  203. end;
  204. location_copy(location,left.location);
  205. end;
  206. procedure ti386addnode.second_cmp64bit;
  207. var
  208. hlab : tasmlabel;
  209. href : treference;
  210. unsigned : boolean;
  211. procedure firstjmp64bitcmp;
  212. var
  213. oldnodetype : tnodetype;
  214. begin
  215. {$ifdef OLDREGVARS}
  216. load_all_regvars(current_asmdata.CurrAsmList);
  217. {$endif OLDREGVARS}
  218. { the jump the sequence is a little bit hairy }
  219. case nodetype of
  220. ltn,gtn:
  221. begin
  222. if (hlab<>current_procinfo.CurrTrueLabel) then
  223. cg.a_jmp_flags(current_asmdata.CurrAsmList,getresflags(unsigned),current_procinfo.CurrTrueLabel);
  224. { cheat a little bit for the negative test }
  225. toggleflag(nf_swapped);
  226. if (hlab<>current_procinfo.CurrFalseLabel) then
  227. cg.a_jmp_flags(current_asmdata.CurrAsmList,getresflags(unsigned),current_procinfo.CurrFalseLabel);
  228. toggleflag(nf_swapped);
  229. end;
  230. lten,gten:
  231. begin
  232. oldnodetype:=nodetype;
  233. if nodetype=lten then
  234. nodetype:=ltn
  235. else
  236. nodetype:=gtn;
  237. if (hlab<>current_procinfo.CurrTrueLabel) then
  238. cg.a_jmp_flags(current_asmdata.CurrAsmList,getresflags(unsigned),current_procinfo.CurrTrueLabel);
  239. { cheat for the negative test }
  240. if nodetype=ltn then
  241. nodetype:=gtn
  242. else
  243. nodetype:=ltn;
  244. if (hlab<>current_procinfo.CurrFalseLabel) then
  245. cg.a_jmp_flags(current_asmdata.CurrAsmList,getresflags(unsigned),current_procinfo.CurrFalseLabel);
  246. nodetype:=oldnodetype;
  247. end;
  248. equaln:
  249. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_NE,current_procinfo.CurrFalseLabel);
  250. unequaln:
  251. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_NE,current_procinfo.CurrTrueLabel);
  252. end;
  253. end;
  254. procedure secondjmp64bitcmp;
  255. begin
  256. { the jump the sequence is a little bit hairy }
  257. case nodetype of
  258. ltn,gtn,lten,gten:
  259. begin
  260. { the comparisaion of the low dword have to be }
  261. { always unsigned! }
  262. cg.a_jmp_flags(current_asmdata.CurrAsmList,getresflags(true),current_procinfo.CurrTrueLabel);
  263. cg.a_jmp_always(current_asmdata.CurrAsmList,current_procinfo.CurrFalseLabel);
  264. end;
  265. equaln:
  266. begin
  267. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_NE,current_procinfo.CurrFalseLabel);
  268. cg.a_jmp_always(current_asmdata.CurrAsmList,current_procinfo.CurrTrueLabel);
  269. end;
  270. unequaln:
  271. begin
  272. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_NE,current_procinfo.CurrTrueLabel);
  273. cg.a_jmp_always(current_asmdata.CurrAsmList,current_procinfo.CurrFalseLabel);
  274. end;
  275. end;
  276. end;
  277. begin
  278. pass_left_right;
  279. unsigned:=((left.resultdef.typ=orddef) and
  280. (torddef(left.resultdef).ordtype=u64bit)) or
  281. ((right.resultdef.typ=orddef) and
  282. (torddef(right.resultdef).ordtype=u64bit));
  283. { we have LOC_JUMP as result }
  284. location_reset(location,LOC_JUMP,OS_NO);
  285. { Relational compares against constants having low dword=0 can omit the
  286. second compare based on the fact that any unsigned value is >=0 }
  287. hlab:=nil;
  288. if (right.location.loc=LOC_CONSTANT) and
  289. (lo(right.location.value64)=0) then
  290. begin
  291. case getresflags(true) of
  292. F_AE: hlab:=current_procinfo.CurrTrueLabel;
  293. F_B: hlab:=current_procinfo.CurrFalseLabel;
  294. end;
  295. end;
  296. if (right.location.loc=LOC_CONSTANT) and
  297. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE]) then
  298. begin
  299. tcgx86(cg).make_simple_ref(current_asmdata.CurrAsmList,left.location.reference);
  300. href:=left.location.reference;
  301. inc(href.offset,4);
  302. emit_const_ref(A_CMP,S_L,aint(hi(right.location.value64)),href);
  303. firstjmp64bitcmp;
  304. if assigned(hlab) then
  305. cg.a_jmp_always(current_asmdata.CurrAsmList,hlab)
  306. else
  307. begin
  308. emit_const_ref(A_CMP,S_L,aint(lo(right.location.value64)),left.location.reference);
  309. secondjmp64bitcmp;
  310. end;
  311. location_freetemp(current_asmdata.CurrAsmList,left.location);
  312. exit;
  313. end;
  314. { left and right no register? }
  315. { then one must be demanded }
  316. if not (left.location.loc in [LOC_REGISTER,LOC_CREGISTER]) then
  317. begin
  318. if not (right.location.loc in [LOC_REGISTER,LOC_CREGISTER]) then
  319. hlcg.location_force_reg(current_asmdata.CurrAsmList,left.location,left.resultdef,left.resultdef,true)
  320. else
  321. begin
  322. location_swap(left.location,right.location);
  323. toggleflag(nf_swapped);
  324. end;
  325. end;
  326. { at this point, left.location.loc should be LOC_[C]REGISTER }
  327. case right.location.loc of
  328. LOC_REGISTER,
  329. LOC_CREGISTER :
  330. begin
  331. emit_reg_reg(A_CMP,S_L,right.location.register64.reghi,left.location.register64.reghi);
  332. firstjmp64bitcmp;
  333. emit_reg_reg(A_CMP,S_L,right.location.register64.reglo,left.location.register64.reglo);
  334. secondjmp64bitcmp;
  335. end;
  336. LOC_CREFERENCE,
  337. LOC_REFERENCE :
  338. begin
  339. tcgx86(cg).make_simple_ref(current_asmdata.CurrAsmList,right.location.reference);
  340. href:=right.location.reference;
  341. inc(href.offset,4);
  342. emit_ref_reg(A_CMP,S_L,href,left.location.register64.reghi);
  343. firstjmp64bitcmp;
  344. emit_ref_reg(A_CMP,S_L,right.location.reference,left.location.register64.reglo);
  345. secondjmp64bitcmp;
  346. location_freetemp(current_asmdata.CurrAsmList,right.location);
  347. end;
  348. LOC_CONSTANT :
  349. begin
  350. current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,S_L,aint(hi(right.location.value64)),left.location.register64.reghi));
  351. firstjmp64bitcmp;
  352. if assigned(hlab) then
  353. cg.a_jmp_always(current_asmdata.CurrAsmList,hlab)
  354. else
  355. begin
  356. current_asmdata.CurrAsmList.concat(taicpu.op_const_reg(A_CMP,S_L,aint(lo(right.location.value64)),left.location.register64.reglo));
  357. secondjmp64bitcmp;
  358. end;
  359. end;
  360. else
  361. internalerror(200203282);
  362. end;
  363. end;
  364. {*****************************************************************************
  365. x86 MUL
  366. *****************************************************************************}
  367. procedure ti386addnode.set_mul_result_location;
  368. begin
  369. location_reset(location,LOC_REGISTER,def_cgsize(resultdef));
  370. {Free EAX,EDX}
  371. cg.ungetcpuregister(current_asmdata.CurrAsmList,NR_EDX);
  372. if is_64bit(resultdef) then
  373. begin
  374. {Allocate a couple of registers and store EDX:EAX into it}
  375. location.register64.reghi := cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  376. cg.a_load_reg_reg(current_asmdata.CurrAsmList, OS_INT, OS_INT, NR_EDX, location.register64.reghi);
  377. cg.ungetcpuregister(current_asmdata.CurrAsmList,NR_EAX);
  378. location.register64.reglo := cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  379. cg.a_load_reg_reg(current_asmdata.CurrAsmList, OS_INT, OS_INT, NR_EAX, location.register64.reglo);
  380. end
  381. else
  382. begin
  383. {Allocate a new register and store the result in EAX in it.}
  384. location.register:=cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  385. cg.ungetcpuregister(current_asmdata.CurrAsmList,NR_EAX);
  386. cg.a_load_reg_reg(current_asmdata.CurrAsmList,OS_INT,OS_INT,NR_EAX,location.register);
  387. end;
  388. location_freetemp(current_asmdata.CurrAsmList,left.location);
  389. location_freetemp(current_asmdata.CurrAsmList,right.location);
  390. end;
  391. procedure ti386addnode.second_mul(unsigned: boolean);
  392. var reg:Tregister;
  393. ref:Treference;
  394. use_ref:boolean;
  395. hl4 : tasmlabel;
  396. const
  397. asmops: array[boolean] of tasmop = (A_IMUL, A_MUL);
  398. begin
  399. pass_left_right;
  400. reg:=NR_NO;
  401. reference_reset(ref,sizeof(pint));
  402. { Mul supports registers and references, so if not register/reference,
  403. load the location into a register.
  404. The variant of IMUL which is capable of doing 32->64 bits has the same restrictions. }
  405. use_ref:=false;
  406. if left.location.loc in [LOC_REGISTER,LOC_CREGISTER] then
  407. reg:=left.location.register
  408. else if left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE] then
  409. begin
  410. tcgx86(cg).make_simple_ref(current_asmdata.CurrAsmList,left.location.reference);
  411. ref:=left.location.reference;
  412. use_ref:=true;
  413. end
  414. else
  415. begin
  416. {LOC_CONSTANT for example.}
  417. reg:=cg.getintregister(current_asmdata.CurrAsmList,OS_INT);
  418. hlcg.a_load_loc_reg(current_asmdata.CurrAsmList,left.resultdef,osuinttype,left.location,reg);
  419. end;
  420. {Allocate EAX.}
  421. cg.getcpuregister(current_asmdata.CurrAsmList,NR_EAX);
  422. {Load the right value.}
  423. hlcg.a_load_loc_reg(current_asmdata.CurrAsmList,right.resultdef,osuinttype,right.location,NR_EAX);
  424. {Also allocate EDX, since it is also modified by a mul (JM).}
  425. cg.getcpuregister(current_asmdata.CurrAsmList,NR_EDX);
  426. if use_ref then
  427. emit_ref(asmops[unsigned],S_L,ref)
  428. else
  429. emit_reg(asmops[unsigned],S_L,reg);
  430. if (cs_check_overflow in current_settings.localswitches) and
  431. { 32->64 bit cannot overflow }
  432. (not is_64bit(resultdef)) then
  433. begin
  434. current_asmdata.getjumplabel(hl4);
  435. cg.a_jmp_flags(current_asmdata.CurrAsmList,F_AE,hl4);
  436. cg.a_call_name(current_asmdata.CurrAsmList,'FPC_OVERFLOW',false);
  437. cg.a_label(current_asmdata.CurrAsmList,hl4);
  438. end;
  439. set_mul_result_location;
  440. end;
  441. procedure ti386addnode.second_mul64bit;
  442. var
  443. list: TAsmList;
  444. hreg1,hreg2: tregister;
  445. begin
  446. { 64x64 multiplication yields 128-bit result, but we're only
  447. interested in its lower 64 bits. This lower part is independent
  448. of operand signs, and so is the generated code. }
  449. { pass_left_right already called from second_add64bit }
  450. list:=current_asmdata.CurrAsmList;
  451. if left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE] then
  452. tcgx86(cg).make_simple_ref(list,left.location.reference);
  453. if right.location.loc in [LOC_REFERENCE,LOC_CREFERENCE] then
  454. tcgx86(cg).make_simple_ref(list,right.location.reference);
  455. { calculate 32-bit terms lo(right)*hi(left) and hi(left)*lo(right) }
  456. if (right.location.loc=LOC_CONSTANT) then
  457. begin
  458. { Omit zero terms, if any }
  459. hreg1:=NR_NO;
  460. hreg2:=NR_NO;
  461. if lo(right.location.value64)<>0 then
  462. hreg1:=cg.getintregister(list,OS_INT);
  463. if hi(right.location.value64)<>0 then
  464. hreg2:=cg.getintregister(list,OS_INT);
  465. { Take advantage of 3-operand form of IMUL }
  466. case left.location.loc of
  467. LOC_REGISTER,LOC_CREGISTER:
  468. begin
  469. if hreg1<>NR_NO then
  470. emit_const_reg_reg(A_IMUL,S_L,longint(lo(right.location.value64)),left.location.register64.reghi,hreg1);
  471. if hreg2<>NR_NO then
  472. emit_const_reg_reg(A_IMUL,S_L,longint(hi(right.location.value64)),left.location.register64.reglo,hreg2);
  473. end;
  474. LOC_REFERENCE,LOC_CREFERENCE:
  475. begin
  476. if hreg2<>NR_NO then
  477. list.concat(taicpu.op_const_ref_reg(A_IMUL,S_L,longint(hi(right.location.value64)),left.location.reference,hreg2));
  478. inc(left.location.reference.offset,4);
  479. if hreg1<>NR_NO then
  480. list.concat(taicpu.op_const_ref_reg(A_IMUL,S_L,longint(lo(right.location.value64)),left.location.reference,hreg1));
  481. dec(left.location.reference.offset,4);
  482. end;
  483. else
  484. InternalError(2014011602);
  485. end;
  486. end
  487. else
  488. begin
  489. hreg1:=cg.getintregister(list,OS_INT);
  490. hreg2:=cg.getintregister(list,OS_INT);
  491. cg64.a_load64low_loc_reg(list,left.location,hreg1);
  492. cg64.a_load64high_loc_reg(list,left.location,hreg2);
  493. case right.location.loc of
  494. LOC_REGISTER,LOC_CREGISTER:
  495. begin
  496. emit_reg_reg(A_IMUL,S_L,right.location.register64.reghi,hreg1);
  497. emit_reg_reg(A_IMUL,S_L,right.location.register64.reglo,hreg2);
  498. end;
  499. LOC_REFERENCE,LOC_CREFERENCE:
  500. begin
  501. emit_ref_reg(A_IMUL,S_L,right.location.reference,hreg2);
  502. inc(right.location.reference.offset,4);
  503. emit_ref_reg(A_IMUL,S_L,right.location.reference,hreg1);
  504. dec(right.location.reference.offset,4);
  505. end;
  506. else
  507. InternalError(2014011603);
  508. end;
  509. end;
  510. { add hi*lo and lo*hi terms together }
  511. if (hreg1<>NR_NO) and (hreg2<>NR_NO) then
  512. emit_reg_reg(A_ADD,S_L,hreg2,hreg1);
  513. { load lo(right) into EAX }
  514. cg.getcpuregister(list,NR_EAX);
  515. cg64.a_load64low_loc_reg(list,right.location,NR_EAX);
  516. { multiply EAX by lo(left), producing 64-bit value in EDX:EAX }
  517. cg.getcpuregister(list,NR_EDX);
  518. if (left.location.loc in [LOC_REGISTER,LOC_CREGISTER]) then
  519. emit_reg(A_MUL,S_L,left.location.register64.reglo)
  520. else if (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE]) then
  521. emit_ref(A_MUL,S_L,left.location.reference)
  522. else
  523. InternalError(2014011604);
  524. { add previously calculated terms to the high half }
  525. if (hreg1<>NR_NO) then
  526. emit_reg_reg(A_ADD,S_L,hreg1,NR_EDX)
  527. else if (hreg2<>NR_NO) then
  528. emit_reg_reg(A_ADD,S_L,hreg2,NR_EDX)
  529. else
  530. InternalError(2014011604);
  531. { Result is now in EDX:EAX. Copy it to virtual registers. }
  532. set_mul_result_location;
  533. end;
  534. begin
  535. caddnode:=ti386addnode;
  536. end.