aasmcpu.pas 85 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809
  1. {
  2. Copyright (c) 2003 by Florian Klaempfl
  3. Contains the assembler object for the ARM
  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 aasmcpu;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. cclasses,globtype,globals,verbose,
  22. aasmbase,aasmtai,aasmdata,aasmsym,
  23. ogbase,
  24. symtype,
  25. cpubase,cpuinfo,cgbase,cgutils;
  26. const
  27. { "mov reg,reg" source operand number }
  28. O_MOV_SOURCE = 1;
  29. { "mov reg,reg" source operand number }
  30. O_MOV_DEST = 0;
  31. { Operand types }
  32. OT_NONE = $00000000;
  33. OT_BITS8 = $00000001; { size, and other attributes, of the operand }
  34. OT_BITS16 = $00000002;
  35. OT_BITS32 = $00000004;
  36. OT_BITS64 = $00000008; { FPU only }
  37. OT_BITS80 = $00000010;
  38. OT_FAR = $00000020; { this means 16:16 or 16:32, like in CALL/JMP }
  39. OT_NEAR = $00000040;
  40. OT_SHORT = $00000080;
  41. OT_BITSTINY = $00000100; { fpu constant }
  42. OT_BITSSHIFTER =
  43. $00000200;
  44. OT_SIZE_MASK = $000003FF; { all the size attributes }
  45. OT_NON_SIZE = longint(not OT_SIZE_MASK);
  46. OT_SIGNED = $00000100; { the operand need to be signed -128-127 }
  47. OT_TO = $00000200; { operand is followed by a colon }
  48. { reverse effect in FADD, FSUB &c }
  49. OT_COLON = $00000400;
  50. OT_SHIFTEROP = $00000800;
  51. OT_REGISTER = $00001000;
  52. OT_IMMEDIATE = $00002000;
  53. OT_REGLIST = $00008000;
  54. OT_IMM8 = $00002001;
  55. OT_IMM24 = $00002002;
  56. OT_IMM32 = $00002004;
  57. OT_IMM64 = $00002008;
  58. OT_IMM80 = $00002010;
  59. OT_IMMTINY = $00002100;
  60. OT_IMMSHIFTER= $00002200;
  61. OT_IMMEDIATE24 = OT_IMM24;
  62. OT_SHIFTIMM = OT_SHIFTEROP or OT_IMMSHIFTER;
  63. OT_SHIFTIMMEDIATE = OT_SHIFTIMM;
  64. OT_IMMEDIATESHIFTER = OT_IMMSHIFTER;
  65. OT_IMMEDIATEFPU = OT_IMMTINY;
  66. OT_REGMEM = $00200000; { for r/m, ie EA, operands }
  67. OT_REGNORM = $00201000; { 'normal' reg, qualifies as EA }
  68. OT_REG8 = $00201001;
  69. OT_REG16 = $00201002;
  70. OT_REG32 = $00201004;
  71. OT_REG64 = $00201008;
  72. OT_VREG = $00201010; { vector register }
  73. OT_REGF = $00201020; { coproc register }
  74. OT_MEMORY = $00204000; { register number in 'basereg' }
  75. OT_MEM8 = $00204001;
  76. OT_MEM16 = $00204002;
  77. OT_MEM32 = $00204004;
  78. OT_MEM64 = $00204008;
  79. OT_MEM80 = $00204010;
  80. { word/byte load/store }
  81. OT_AM2 = $00010000;
  82. { misc ld/st operations }
  83. OT_AM3 = $00020000;
  84. { multiple ld/st operations }
  85. OT_AM4 = $00040000;
  86. { co proc. ld/st operations }
  87. OT_AM5 = $00080000;
  88. OT_AMMASK = $000f0000;
  89. { IT instruction }
  90. OT_CONDITION = $00100000;
  91. OT_MEMORYAM2 = OT_MEMORY or OT_AM2;
  92. OT_MEMORYAM3 = OT_MEMORY or OT_AM3;
  93. OT_MEMORYAM4 = OT_MEMORY or OT_AM4;
  94. OT_MEMORYAM5 = OT_MEMORY or OT_AM5;
  95. OT_FPUREG = $01000000; { floating point stack registers }
  96. OT_REG_SMASK = $00070000; { special register operands: these may be treated differently }
  97. { a mask for the following }
  98. OT_MEM_OFFS = $00604000; { special type of EA }
  99. { simple [address] offset }
  100. OT_ONENESS = $00800000; { special type of immediate operand }
  101. { so UNITY == IMMEDIATE | ONENESS }
  102. OT_UNITY = $00802000; { for shift/rotate instructions }
  103. instabentries = {$i armnop.inc}
  104. maxinfolen = 5;
  105. IF_NONE = $00000000;
  106. IF_ARMMASK = $000F0000;
  107. IF_ARM7 = $00070000;
  108. IF_FPMASK = $00F00000;
  109. IF_FPA = $00100000;
  110. { if the instruction can change in a second pass }
  111. IF_PASS2 = longint($80000000);
  112. type
  113. TInsTabCache=array[TasmOp] of longint;
  114. PInsTabCache=^TInsTabCache;
  115. tinsentry = record
  116. opcode : tasmop;
  117. ops : byte;
  118. optypes : array[0..3] of longint;
  119. code : array[0..maxinfolen] of char;
  120. flags : longint;
  121. end;
  122. pinsentry=^tinsentry;
  123. const
  124. InsTab : array[0..instabentries-1] of TInsEntry={$i armtab.inc}
  125. var
  126. InsTabCache : PInsTabCache;
  127. type
  128. taicpu = class(tai_cpu_abstract_sym)
  129. oppostfix : TOpPostfix;
  130. wideformat : boolean;
  131. roundingmode : troundingmode;
  132. procedure loadshifterop(opidx:longint;const so:tshifterop);
  133. procedure loadregset(opidx:longint; regsetregtype: tregistertype; regsetsubregtype: tsubregister; const s:tcpuregisterset);
  134. procedure loadconditioncode(opidx:longint;const cond:tasmcond);
  135. procedure loadmodeflags(opidx:longint;const flags:tcpumodeflags);
  136. constructor op_none(op : tasmop);
  137. constructor op_reg(op : tasmop;_op1 : tregister);
  138. constructor op_ref(op : tasmop;const _op1 : treference);
  139. constructor op_const(op : tasmop;_op1 : longint);
  140. constructor op_reg_reg(op : tasmop;_op1,_op2 : tregister);
  141. constructor op_reg_ref(op : tasmop;_op1 : tregister;const _op2 : treference);
  142. constructor op_reg_const(op:tasmop; _op1: tregister; _op2: aint);
  143. constructor op_ref_regset(op:tasmop; _op1: treference; regtype: tregistertype; subreg: tsubregister; _op2: tcpuregisterset);
  144. constructor op_reg_reg_reg(op : tasmop;_op1,_op2,_op3 : tregister);
  145. constructor op_reg_reg_const(op : tasmop;_op1,_op2 : tregister; _op3: aint);
  146. constructor op_reg_reg_sym_ofs(op : tasmop;_op1,_op2 : tregister; _op3: tasmsymbol;_op3ofs: longint);
  147. constructor op_reg_reg_ref(op : tasmop;_op1,_op2 : tregister; const _op3: treference);
  148. constructor op_reg_reg_shifterop(op : tasmop;_op1,_op2 : tregister;_op3 : tshifterop);
  149. constructor op_reg_reg_reg_shifterop(op : tasmop;_op1,_op2,_op3 : tregister;_op4 : tshifterop);
  150. { SFM/LFM }
  151. constructor op_reg_const_ref(op : tasmop;_op1 : tregister;_op2 : aint;_op3 : treference);
  152. { ITxxx }
  153. constructor op_cond(op: tasmop; cond: tasmcond);
  154. { CPSxx }
  155. constructor op_modeflags(op: tasmop; flags: tcpumodeflags);
  156. constructor op_modeflags_const(op: tasmop; flags: tcpumodeflags; a: aint);
  157. { *M*LL }
  158. constructor op_reg_reg_reg_reg(op : tasmop;_op1,_op2,_op3,_op4 : tregister);
  159. { this is for Jmp instructions }
  160. constructor op_cond_sym(op : tasmop;cond:TAsmCond;_op1 : tasmsymbol);
  161. constructor op_sym(op : tasmop;_op1 : tasmsymbol);
  162. constructor op_sym_ofs(op : tasmop;_op1 : tasmsymbol;_op1ofs:longint);
  163. constructor op_reg_sym_ofs(op : tasmop;_op1 : tregister;_op2:tasmsymbol;_op2ofs : longint);
  164. constructor op_sym_ofs_ref(op : tasmop;_op1 : tasmsymbol;_op1ofs:longint;const _op2 : treference);
  165. function is_same_reg_move(regtype: Tregistertype):boolean; override;
  166. function spilling_get_operation_type(opnr: longint): topertype;override;
  167. { assembler }
  168. public
  169. { the next will reset all instructions that can change in pass 2 }
  170. procedure ResetPass1;override;
  171. procedure ResetPass2;override;
  172. function CheckIfValid:boolean;
  173. function GetString:string;
  174. function Pass1(objdata:TObjData):longint;override;
  175. procedure Pass2(objdata:TObjData);override;
  176. protected
  177. procedure ppuloadoper(ppufile:tcompilerppufile;var o:toper);override;
  178. procedure ppuwriteoper(ppufile:tcompilerppufile;const o:toper);override;
  179. procedure ppubuildderefimploper(var o:toper);override;
  180. procedure ppuderefoper(var o:toper);override;
  181. private
  182. { next fields are filled in pass1, so pass2 is faster }
  183. inssize : shortint;
  184. insoffset : longint;
  185. LastInsOffset : longint; { need to be public to be reset }
  186. insentry : PInsEntry;
  187. function InsEnd:longint;
  188. procedure create_ot(objdata:TObjData);
  189. function Matches(p:PInsEntry):longint;
  190. function calcsize(p:PInsEntry):shortint;
  191. procedure gencode(objdata:TObjData);
  192. function NeedAddrPrefix(opidx:byte):boolean;
  193. procedure Swapoperands;
  194. function FindInsentry(objdata:TObjData):boolean;
  195. end;
  196. tai_align = class(tai_align_abstract)
  197. { nothing to add }
  198. end;
  199. tai_thumb_func = class(tai)
  200. constructor create;
  201. end;
  202. function spilling_create_load(const ref:treference;r:tregister):Taicpu;
  203. function spilling_create_store(r:tregister; const ref:treference):Taicpu;
  204. function setoppostfix(i : taicpu;pf : toppostfix) : taicpu;
  205. function setroundingmode(i : taicpu;rm : troundingmode) : taicpu;
  206. function setcondition(i : taicpu;c : tasmcond) : taicpu;
  207. { inserts pc relative symbols at places where they are reachable
  208. and transforms special instructions to valid instruction encodings }
  209. procedure finalizearmcode(list,listtoinsert : TAsmList);
  210. { inserts .pdata section and dummy function prolog needed for arm-wince exception handling }
  211. procedure InsertPData;
  212. procedure InitAsm;
  213. procedure DoneAsm;
  214. implementation
  215. uses
  216. cutils,rgobj,itcpugas;
  217. procedure taicpu.loadshifterop(opidx:longint;const so:tshifterop);
  218. begin
  219. allocate_oper(opidx+1);
  220. with oper[opidx]^ do
  221. begin
  222. if typ<>top_shifterop then
  223. begin
  224. clearop(opidx);
  225. new(shifterop);
  226. end;
  227. shifterop^:=so;
  228. typ:=top_shifterop;
  229. if assigned(add_reg_instruction_hook) then
  230. add_reg_instruction_hook(self,shifterop^.rs);
  231. end;
  232. end;
  233. procedure taicpu.loadregset(opidx:longint; regsetregtype: tregistertype; regsetsubregtype: tsubregister; const s:tcpuregisterset);
  234. var
  235. i : byte;
  236. begin
  237. allocate_oper(opidx+1);
  238. with oper[opidx]^ do
  239. begin
  240. if typ<>top_regset then
  241. begin
  242. clearop(opidx);
  243. new(regset);
  244. end;
  245. regset^:=s;
  246. regtyp:=regsetregtype;
  247. subreg:=regsetsubregtype;
  248. typ:=top_regset;
  249. case regsetregtype of
  250. R_INTREGISTER:
  251. for i:=RS_R0 to RS_R15 do
  252. begin
  253. if assigned(add_reg_instruction_hook) and (i in regset^) then
  254. add_reg_instruction_hook(self,newreg(R_INTREGISTER,i,regsetsubregtype));
  255. end;
  256. R_MMREGISTER:
  257. { both RS_S0 and RS_D0 range from 0 to 31 }
  258. for i:=RS_D0 to RS_D31 do
  259. begin
  260. if assigned(add_reg_instruction_hook) and (i in regset^) then
  261. add_reg_instruction_hook(self,newreg(R_MMREGISTER,i,regsetsubregtype));
  262. end;
  263. end;
  264. end;
  265. end;
  266. procedure taicpu.loadconditioncode(opidx:longint;const cond:tasmcond);
  267. begin
  268. allocate_oper(opidx+1);
  269. with oper[opidx]^ do
  270. begin
  271. if typ<>top_conditioncode then
  272. clearop(opidx);
  273. cc:=cond;
  274. typ:=top_conditioncode;
  275. end;
  276. end;
  277. procedure taicpu.loadmodeflags(opidx: longint; const flags: tcpumodeflags);
  278. begin
  279. allocate_oper(opidx+1);
  280. with oper[opidx]^ do
  281. begin
  282. if typ<>top_modeflags then
  283. clearop(opidx);
  284. modeflags:=flags;
  285. typ:=top_modeflags;
  286. end;
  287. end;
  288. {*****************************************************************************
  289. taicpu Constructors
  290. *****************************************************************************}
  291. constructor taicpu.op_none(op : tasmop);
  292. begin
  293. inherited create(op);
  294. end;
  295. { for pld }
  296. constructor taicpu.op_ref(op : tasmop;const _op1 : treference);
  297. begin
  298. inherited create(op);
  299. ops:=1;
  300. loadref(0,_op1);
  301. end;
  302. constructor taicpu.op_reg(op : tasmop;_op1 : tregister);
  303. begin
  304. inherited create(op);
  305. ops:=1;
  306. loadreg(0,_op1);
  307. end;
  308. constructor taicpu.op_const(op : tasmop;_op1 : longint);
  309. begin
  310. inherited create(op);
  311. ops:=1;
  312. loadconst(0,aint(_op1));
  313. end;
  314. constructor taicpu.op_reg_reg(op : tasmop;_op1,_op2 : tregister);
  315. begin
  316. inherited create(op);
  317. ops:=2;
  318. loadreg(0,_op1);
  319. loadreg(1,_op2);
  320. end;
  321. constructor taicpu.op_reg_const(op:tasmop; _op1: tregister; _op2: aint);
  322. begin
  323. inherited create(op);
  324. ops:=2;
  325. loadreg(0,_op1);
  326. loadconst(1,aint(_op2));
  327. end;
  328. constructor taicpu.op_ref_regset(op:tasmop; _op1: treference; regtype: tregistertype; subreg: tsubregister; _op2: tcpuregisterset);
  329. begin
  330. inherited create(op);
  331. ops:=2;
  332. loadref(0,_op1);
  333. loadregset(1,regtype,subreg,_op2);
  334. end;
  335. constructor taicpu.op_reg_ref(op : tasmop;_op1 : tregister;const _op2 : treference);
  336. begin
  337. inherited create(op);
  338. ops:=2;
  339. loadreg(0,_op1);
  340. loadref(1,_op2);
  341. end;
  342. constructor taicpu.op_reg_reg_reg(op : tasmop;_op1,_op2,_op3 : tregister);
  343. begin
  344. inherited create(op);
  345. ops:=3;
  346. loadreg(0,_op1);
  347. loadreg(1,_op2);
  348. loadreg(2,_op3);
  349. end;
  350. constructor taicpu.op_reg_reg_reg_reg(op : tasmop;_op1,_op2,_op3,_op4 : tregister);
  351. begin
  352. inherited create(op);
  353. ops:=4;
  354. loadreg(0,_op1);
  355. loadreg(1,_op2);
  356. loadreg(2,_op3);
  357. loadreg(3,_op4);
  358. end;
  359. constructor taicpu.op_reg_reg_const(op : tasmop;_op1,_op2 : tregister; _op3: aint);
  360. begin
  361. inherited create(op);
  362. ops:=3;
  363. loadreg(0,_op1);
  364. loadreg(1,_op2);
  365. loadconst(2,aint(_op3));
  366. end;
  367. constructor taicpu.op_reg_const_ref(op : tasmop;_op1 : tregister;_op2 : aint;_op3 : treference);
  368. begin
  369. inherited create(op);
  370. ops:=3;
  371. loadreg(0,_op1);
  372. loadconst(1,_op2);
  373. loadref(2,_op3);
  374. end;
  375. constructor taicpu.op_cond(op: tasmop; cond: tasmcond);
  376. begin
  377. inherited create(op);
  378. ops:=0;
  379. condition := cond;
  380. end;
  381. constructor taicpu.op_modeflags(op: tasmop; flags: tcpumodeflags);
  382. begin
  383. inherited create(op);
  384. ops := 1;
  385. loadmodeflags(0,flags);
  386. end;
  387. constructor taicpu.op_modeflags_const(op: tasmop; flags: tcpumodeflags; a: aint);
  388. begin
  389. inherited create(op);
  390. ops := 2;
  391. loadmodeflags(0,flags);
  392. loadconst(1,a);
  393. end;
  394. constructor taicpu.op_reg_reg_sym_ofs(op : tasmop;_op1,_op2 : tregister; _op3: tasmsymbol;_op3ofs: longint);
  395. begin
  396. inherited create(op);
  397. ops:=3;
  398. loadreg(0,_op1);
  399. loadreg(1,_op2);
  400. loadsymbol(0,_op3,_op3ofs);
  401. end;
  402. constructor taicpu.op_reg_reg_ref(op : tasmop;_op1,_op2 : tregister; const _op3: treference);
  403. begin
  404. inherited create(op);
  405. ops:=3;
  406. loadreg(0,_op1);
  407. loadreg(1,_op2);
  408. loadref(2,_op3);
  409. end;
  410. constructor taicpu.op_reg_reg_shifterop(op : tasmop;_op1,_op2 : tregister;_op3 : tshifterop);
  411. begin
  412. inherited create(op);
  413. ops:=3;
  414. loadreg(0,_op1);
  415. loadreg(1,_op2);
  416. loadshifterop(2,_op3);
  417. end;
  418. constructor taicpu.op_reg_reg_reg_shifterop(op : tasmop;_op1,_op2,_op3 : tregister;_op4 : tshifterop);
  419. begin
  420. inherited create(op);
  421. ops:=4;
  422. loadreg(0,_op1);
  423. loadreg(1,_op2);
  424. loadreg(2,_op3);
  425. loadshifterop(3,_op4);
  426. end;
  427. constructor taicpu.op_cond_sym(op : tasmop;cond:TAsmCond;_op1 : tasmsymbol);
  428. begin
  429. inherited create(op);
  430. condition:=cond;
  431. ops:=1;
  432. loadsymbol(0,_op1,0);
  433. end;
  434. constructor taicpu.op_sym(op : tasmop;_op1 : tasmsymbol);
  435. begin
  436. inherited create(op);
  437. ops:=1;
  438. loadsymbol(0,_op1,0);
  439. end;
  440. constructor taicpu.op_sym_ofs(op : tasmop;_op1 : tasmsymbol;_op1ofs:longint);
  441. begin
  442. inherited create(op);
  443. ops:=1;
  444. loadsymbol(0,_op1,_op1ofs);
  445. end;
  446. constructor taicpu.op_reg_sym_ofs(op : tasmop;_op1 : tregister;_op2:tasmsymbol;_op2ofs : longint);
  447. begin
  448. inherited create(op);
  449. ops:=2;
  450. loadreg(0,_op1);
  451. loadsymbol(1,_op2,_op2ofs);
  452. end;
  453. constructor taicpu.op_sym_ofs_ref(op : tasmop;_op1 : tasmsymbol;_op1ofs:longint;const _op2 : treference);
  454. begin
  455. inherited create(op);
  456. ops:=2;
  457. loadsymbol(0,_op1,_op1ofs);
  458. loadref(1,_op2);
  459. end;
  460. function taicpu.is_same_reg_move(regtype: Tregistertype):boolean;
  461. begin
  462. { allow the register allocator to remove unnecessary moves }
  463. result:=(
  464. ((opcode=A_MOV) and (regtype = R_INTREGISTER)) or
  465. ((opcode=A_MVF) and (regtype = R_FPUREGISTER)) or
  466. ((opcode in [A_FCPYS, A_FCPYD]) and (regtype = R_MMREGISTER))
  467. ) and
  468. (oppostfix in [PF_None,PF_D]) and
  469. (condition=C_None) and
  470. (ops=2) and
  471. (oper[0]^.typ=top_reg) and
  472. (oper[1]^.typ=top_reg) and
  473. (oper[0]^.reg=oper[1]^.reg);
  474. end;
  475. function spilling_create_load(const ref:treference;r:tregister):Taicpu;
  476. var
  477. op: tasmop;
  478. begin
  479. case getregtype(r) of
  480. R_INTREGISTER :
  481. result:=taicpu.op_reg_ref(A_LDR,r,ref);
  482. R_FPUREGISTER :
  483. { use lfm because we don't know the current internal format
  484. and avoid exceptions
  485. }
  486. result:=taicpu.op_reg_const_ref(A_LFM,r,1,ref);
  487. R_MMREGISTER :
  488. begin
  489. case getsubreg(r) of
  490. R_SUBFD:
  491. op:=A_FLDD;
  492. R_SUBFS:
  493. op:=A_FLDS;
  494. else
  495. internalerror(2009112905);
  496. end;
  497. result:=taicpu.op_reg_ref(op,r,ref);
  498. end;
  499. else
  500. internalerror(200401041);
  501. end;
  502. end;
  503. function spilling_create_store(r:tregister; const ref:treference):Taicpu;
  504. var
  505. op: tasmop;
  506. begin
  507. case getregtype(r) of
  508. R_INTREGISTER :
  509. result:=taicpu.op_reg_ref(A_STR,r,ref);
  510. R_FPUREGISTER :
  511. { use sfm because we don't know the current internal format
  512. and avoid exceptions
  513. }
  514. result:=taicpu.op_reg_const_ref(A_SFM,r,1,ref);
  515. R_MMREGISTER :
  516. begin
  517. case getsubreg(r) of
  518. R_SUBFD:
  519. op:=A_FSTD;
  520. R_SUBFS:
  521. op:=A_FSTS;
  522. else
  523. internalerror(2009112904);
  524. end;
  525. result:=taicpu.op_reg_ref(op,r,ref);
  526. end;
  527. else
  528. internalerror(200401041);
  529. end;
  530. end;
  531. function taicpu.spilling_get_operation_type(opnr: longint): topertype;
  532. begin
  533. case opcode of
  534. A_ADC,A_ADD,A_AND,A_BIC,
  535. A_EOR,A_CLZ,
  536. A_LDR,A_LDRB,A_LDRBT,A_LDRH,A_LDRSB,
  537. A_LDRSH,A_LDRT,
  538. A_MOV,A_MVN,A_MLA,A_MUL,
  539. A_ORR,A_RSB,A_RSC,A_SBC,A_SUB,
  540. A_SWP,A_SWPB,
  541. A_LDF,A_FLT,A_FIX,
  542. A_ADF,A_DVF,A_FDV,A_FML,
  543. A_RFS,A_RFC,A_RDF,
  544. A_RMF,A_RPW,A_RSF,A_SUF,A_ABS,A_ACS,A_ASN,A_ATN,A_COS,
  545. A_EXP,A_LOG,A_LGN,A_MVF,A_MNF,A_FRD,A_MUF,A_POL,A_RND,A_SIN,A_SQT,A_TAN,
  546. A_LFM,
  547. A_FLDS,A_FLDD,
  548. A_FMRX,A_FMXR,A_FMSTAT,
  549. A_FMSR,A_FMRS,A_FMDRR,
  550. A_FCPYS,A_FCPYD,A_FCVTSD,A_FCVTDS,
  551. A_FABSS,A_FABSD,A_FSQRTS,A_FSQRTD,A_FMULS,A_FMULD,
  552. A_FADDS,A_FADDD,A_FSUBS,A_FSUBD,A_FDIVS,A_FDIVD,
  553. A_FMACS,A_FMACD,A_FMSCS,A_FMSCD,A_FNMACS,A_FNMACD,
  554. A_FNMSCS,A_FNMSCD,A_FNMULS,A_FNMULD,
  555. A_FMDHR,A_FMRDH,A_FMDLR,A_FMRDL,
  556. A_FNEGS,A_FNEGD,
  557. A_FSITOS,A_FSITOD,A_FTOSIS,A_FTOSID,
  558. A_FTOUIS,A_FTOUID,A_FUITOS,A_FUITOD:
  559. if opnr=0 then
  560. result:=operand_write
  561. else
  562. result:=operand_read;
  563. A_BKPT,A_B,A_BL,A_BLX,A_BX,
  564. A_CMN,A_CMP,A_TEQ,A_TST,
  565. A_CMF,A_CMFE,A_WFS,A_CNF,
  566. A_FCMPS,A_FCMPD,A_FCMPES,A_FCMPED,A_FCMPEZS,A_FCMPEZD,
  567. A_FCMPZS,A_FCMPZD:
  568. result:=operand_read;
  569. A_SMLAL,A_UMLAL:
  570. if opnr in [0,1] then
  571. result:=operand_readwrite
  572. else
  573. result:=operand_read;
  574. A_SMULL,A_UMULL,
  575. A_FMRRD:
  576. if opnr in [0,1] then
  577. result:=operand_write
  578. else
  579. result:=operand_read;
  580. A_STR,A_STRB,A_STRBT,
  581. A_STRH,A_STRT,A_STF,A_SFM,
  582. A_FSTS,A_FSTD:
  583. { important is what happens with the involved registers }
  584. if opnr=0 then
  585. result := operand_read
  586. else
  587. { check for pre/post indexed }
  588. result := operand_read;
  589. //Thumb2
  590. A_LSL, A_LSR, A_ROR, A_ASR, A_SDIV, A_UDIV,A_MOVT:
  591. if opnr in [0] then
  592. result:=operand_write
  593. else
  594. result:=operand_read;
  595. A_LDREX:
  596. if opnr in [0] then
  597. result:=operand_write
  598. else
  599. result:=operand_read;
  600. A_STREX:
  601. if opnr in [0,1,2] then
  602. result:=operand_write;
  603. else
  604. internalerror(200403151);
  605. end;
  606. end;
  607. procedure BuildInsTabCache;
  608. var
  609. i : longint;
  610. begin
  611. new(instabcache);
  612. FillChar(instabcache^,sizeof(tinstabcache),$ff);
  613. i:=0;
  614. while (i<InsTabEntries) do
  615. begin
  616. if InsTabCache^[InsTab[i].Opcode]=-1 then
  617. InsTabCache^[InsTab[i].Opcode]:=i;
  618. inc(i);
  619. end;
  620. end;
  621. procedure InitAsm;
  622. begin
  623. if not assigned(instabcache) then
  624. BuildInsTabCache;
  625. end;
  626. procedure DoneAsm;
  627. begin
  628. if assigned(instabcache) then
  629. begin
  630. dispose(instabcache);
  631. instabcache:=nil;
  632. end;
  633. end;
  634. function setoppostfix(i : taicpu;pf : toppostfix) : taicpu;
  635. begin
  636. i.oppostfix:=pf;
  637. result:=i;
  638. end;
  639. function setroundingmode(i : taicpu;rm : troundingmode) : taicpu;
  640. begin
  641. i.roundingmode:=rm;
  642. result:=i;
  643. end;
  644. function setcondition(i : taicpu;c : tasmcond) : taicpu;
  645. begin
  646. i.condition:=c;
  647. result:=i;
  648. end;
  649. Function SimpleGetNextInstruction(Current: tai; Var Next: tai): Boolean;
  650. Begin
  651. Current:=tai(Current.Next);
  652. While Assigned(Current) And (Current.typ In SkipInstr) Do
  653. Current:=tai(Current.Next);
  654. Next:=Current;
  655. If Assigned(Next) And Not(Next.typ In SkipInstr) Then
  656. Result:=True
  657. Else
  658. Begin
  659. Next:=Nil;
  660. Result:=False;
  661. End;
  662. End;
  663. (*
  664. function armconstequal(hp1,hp2: tai): boolean;
  665. begin
  666. result:=false;
  667. if hp1.typ<>hp2.typ then
  668. exit;
  669. case hp1.typ of
  670. tai_const:
  671. result:=
  672. (tai_const(hp2).sym=tai_const(hp).sym) and
  673. (tai_const(hp2).value=tai_const(hp).value) and
  674. (tai(hp2.previous).typ=ait_label);
  675. tai_const:
  676. result:=
  677. (tai_const(hp2).sym=tai_const(hp).sym) and
  678. (tai_const(hp2).value=tai_const(hp).value) and
  679. (tai(hp2.previous).typ=ait_label);
  680. end;
  681. end;
  682. *)
  683. procedure insertpcrelativedata(list,listtoinsert : TAsmList);
  684. var
  685. curinspos,
  686. penalty,
  687. lastinspos,
  688. { increased for every data element > 4 bytes inserted }
  689. extradataoffset,
  690. limit: longint;
  691. curop : longint;
  692. curtai : tai;
  693. curdatatai,hp,hp2 : tai;
  694. curdata : TAsmList;
  695. l : tasmlabel;
  696. doinsert,
  697. removeref : boolean;
  698. begin
  699. curdata:=TAsmList.create;
  700. lastinspos:=-1;
  701. curinspos:=0;
  702. extradataoffset:=0;
  703. limit:=1016;
  704. curtai:=tai(list.first);
  705. doinsert:=false;
  706. while assigned(curtai) do
  707. begin
  708. { instruction? }
  709. case curtai.typ of
  710. ait_instruction:
  711. begin
  712. { walk through all operand of the instruction }
  713. for curop:=0 to taicpu(curtai).ops-1 do
  714. begin
  715. { reference? }
  716. if (taicpu(curtai).oper[curop]^.typ=top_ref) then
  717. begin
  718. { pc relative symbol? }
  719. curdatatai:=tai(taicpu(curtai).oper[curop]^.ref^.symboldata);
  720. if assigned(curdatatai) and
  721. { move only if we're at the first reference of a label }
  722. (taicpu(curtai).oper[curop]^.ref^.offset=0) then
  723. begin
  724. { check if symbol already used. }
  725. { if yes, reuse the symbol }
  726. hp:=tai(curdatatai.next);
  727. removeref:=false;
  728. if assigned(hp) then
  729. begin
  730. case hp.typ of
  731. ait_const:
  732. begin
  733. if (tai_const(hp).consttype=aitconst_64bit) then
  734. inc(extradataoffset);
  735. end;
  736. ait_comp_64bit,
  737. ait_real_64bit:
  738. begin
  739. inc(extradataoffset);
  740. end;
  741. ait_real_80bit:
  742. begin
  743. inc(extradataoffset,2);
  744. end;
  745. end;
  746. if (hp.typ=ait_const) then
  747. begin
  748. hp2:=tai(curdata.first);
  749. while assigned(hp2) do
  750. begin
  751. { if armconstequal(hp2,hp) then }
  752. if (hp2.typ=ait_const) and (tai_const(hp2).sym=tai_const(hp).sym)
  753. and (tai_const(hp2).value=tai_const(hp).value) and (tai(hp2.previous).typ=ait_label)
  754. then
  755. begin
  756. with taicpu(curtai).oper[curop]^.ref^ do
  757. begin
  758. symboldata:=hp2.previous;
  759. symbol:=tai_label(hp2.previous).labsym;
  760. end;
  761. removeref:=true;
  762. break;
  763. end;
  764. hp2:=tai(hp2.next);
  765. end;
  766. end;
  767. end;
  768. { move or remove symbol reference }
  769. repeat
  770. hp:=tai(curdatatai.next);
  771. listtoinsert.remove(curdatatai);
  772. if removeref then
  773. curdatatai.free
  774. else
  775. curdata.concat(curdatatai);
  776. curdatatai:=hp;
  777. until (curdatatai=nil) or (curdatatai.typ=ait_label);
  778. if lastinspos=-1 then
  779. lastinspos:=curinspos;
  780. end;
  781. end;
  782. end;
  783. inc(curinspos);
  784. end;
  785. ait_const:
  786. begin
  787. inc(curinspos);
  788. if (tai_const(curtai).consttype=aitconst_64bit) then
  789. inc(curinspos);
  790. end;
  791. ait_real_32bit:
  792. begin
  793. inc(curinspos);
  794. end;
  795. ait_comp_64bit,
  796. ait_real_64bit:
  797. begin
  798. inc(curinspos,2);
  799. end;
  800. ait_real_80bit:
  801. begin
  802. inc(curinspos,3);
  803. end;
  804. end;
  805. { special case for case jump tables }
  806. if SimpleGetNextInstruction(curtai,hp) and
  807. (tai(hp).typ=ait_instruction) and
  808. (taicpu(hp).opcode=A_LDR) and
  809. (taicpu(hp).oper[0]^.typ=top_reg) and
  810. (taicpu(hp).oper[0]^.reg=NR_PC) then
  811. begin
  812. penalty:=1;
  813. hp:=tai(hp.next);
  814. while assigned(hp) and (hp.typ=ait_const) do
  815. begin
  816. inc(penalty);
  817. hp:=tai(hp.next);
  818. end;
  819. end
  820. else
  821. penalty:=0;
  822. { FLD/FST VFP instructions have a limit of +/- 1024, not 4096 }
  823. if SimpleGetNextInstruction(curtai,hp) and
  824. (tai(hp).typ=ait_instruction) and
  825. ((taicpu(hp).opcode=A_FLDS) or
  826. (taicpu(hp).opcode=A_FLDD)) then
  827. limit:=254;
  828. { don't miss an insert }
  829. doinsert:=doinsert or
  830. (not(curdata.empty) and
  831. (curinspos-lastinspos+penalty+extradataoffset>limit));
  832. { split only at real instructions else the test below fails }
  833. if doinsert and (curtai.typ=ait_instruction) and
  834. (
  835. { don't split loads of pc to lr and the following move }
  836. not(
  837. (taicpu(curtai).opcode=A_MOV) and
  838. (taicpu(curtai).oper[0]^.typ=top_reg) and
  839. (taicpu(curtai).oper[0]^.reg=NR_R14) and
  840. (taicpu(curtai).oper[1]^.typ=top_reg) and
  841. (taicpu(curtai).oper[1]^.reg=NR_PC)
  842. )
  843. ) then
  844. begin
  845. lastinspos:=-1;
  846. extradataoffset:=0;
  847. limit:=1016;
  848. doinsert:=false;
  849. hp:=tai(curtai.next);
  850. current_asmdata.getjumplabel(l);
  851. curdata.insert(taicpu.op_sym(A_B,l));
  852. curdata.concat(tai_label.create(l));
  853. list.insertlistafter(curtai,curdata);
  854. curtai:=hp;
  855. end
  856. else
  857. curtai:=tai(curtai.next);
  858. end;
  859. list.concatlist(curdata);
  860. curdata.free;
  861. end;
  862. procedure ensurethumb2encodings(list: TAsmList);
  863. var
  864. curtai: tai;
  865. op2reg: TRegister;
  866. begin
  867. { Do Thumb-2 16bit -> 32bit transformations }
  868. curtai:=tai(list.first);
  869. while assigned(curtai) do
  870. begin
  871. case curtai.typ of
  872. ait_instruction:
  873. begin
  874. case taicpu(curtai).opcode of
  875. A_ADD:
  876. begin
  877. { Set wide flag for ADD Rd,Rn,Rm where registers are over R7(high register set) }
  878. if taicpu(curtai).ops = 3 then
  879. begin
  880. if taicpu(curtai).oper[2]^.typ in [top_reg,top_shifterop] then
  881. begin
  882. if taicpu(curtai).oper[2]^.typ = top_reg then
  883. op2reg := taicpu(curtai).oper[2]^.reg
  884. else if taicpu(curtai).oper[2]^.shifterop^.rs <> NR_NO then
  885. op2reg := taicpu(curtai).oper[2]^.shifterop^.rs
  886. else
  887. op2reg := NR_NO;
  888. if op2reg <> NR_NO then
  889. begin
  890. if (taicpu(curtai).oper[0]^.reg >= NR_R8) or
  891. (taicpu(curtai).oper[1]^.reg >= NR_R8) or
  892. (op2reg >= NR_R8) then
  893. begin
  894. taicpu(curtai).wideformat:=true;
  895. { Handle special cases where register rules are violated by optimizer/user }
  896. { if d == 13 || (d == 15 && S == ‘0’) || n == 15 || m IN [13,15] then UNPREDICTABLE; }
  897. { Transform ADD.W Rx, Ry, R13 into ADD.W Rx, R13, Ry }
  898. if (op2reg = NR_R13) and (taicpu(curtai).oper[2]^.typ = top_reg) then
  899. begin
  900. taicpu(curtai).oper[2]^.reg := taicpu(curtai).oper[1]^.reg;
  901. taicpu(curtai).oper[1]^.reg := op2reg;
  902. end;
  903. end;
  904. end;
  905. end;
  906. end;
  907. end;
  908. end;
  909. end;
  910. end;
  911. curtai:=tai(curtai.Next);
  912. end;
  913. end;
  914. procedure finalizearmcode(list, listtoinsert: TAsmList);
  915. begin
  916. insertpcrelativedata(list, listtoinsert);
  917. { Do Thumb-2 16bit -> 32bit transformations }
  918. if current_settings.cputype in cpu_thumb2 then
  919. ensurethumb2encodings(list);
  920. end;
  921. procedure InsertPData;
  922. var
  923. prolog: TAsmList;
  924. begin
  925. prolog:=TAsmList.create;
  926. new_section(prolog,sec_code,'FPC_EH_PROLOG',sizeof(pint),secorder_begin);
  927. prolog.concat(Tai_const.Createname('_ARM_ExceptionHandler', 0));
  928. prolog.concat(Tai_const.Create_32bit(0));
  929. prolog.concat(Tai_symbol.Createname_global('FPC_EH_CODE_START',AT_DATA,0));
  930. { dummy function }
  931. prolog.concat(taicpu.op_reg_reg(A_MOV,NR_R15,NR_R14));
  932. current_asmdata.asmlists[al_start].insertList(prolog);
  933. prolog.Free;
  934. new_section(current_asmdata.asmlists[al_end],sec_pdata,'',sizeof(pint));
  935. current_asmdata.asmlists[al_end].concat(Tai_const.Createname('FPC_EH_CODE_START', 0));
  936. current_asmdata.asmlists[al_end].concat(Tai_const.Create_32bit(longint($ffffff01)));
  937. end;
  938. (*
  939. Floating point instruction format information, taken from the linux kernel
  940. ARM Floating Point Instruction Classes
  941. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  942. |c o n d|1 1 0 P|U|u|W|L| Rn |v| Fd |0|0|0|1| o f f s e t | CPDT
  943. |c o n d|1 1 0 P|U|w|W|L| Rn |x| Fd |0|0|1|0| o f f s e t | CPDT (copro 2)
  944. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  945. |c o n d|1 1 1 0|a|b|c|d|e| Fn |j| Fd |0|0|0|1|f|g|h|0|i| Fm | CPDO
  946. |c o n d|1 1 1 0|a|b|c|L|e| Fn | Rd |0|0|0|1|f|g|h|1|i| Fm | CPRT
  947. |c o n d|1 1 1 0|a|b|c|1|e| Fn |1|1|1|1|0|0|0|1|f|g|h|1|i| Fm | comparisons
  948. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  949. CPDT data transfer instructions
  950. LDF, STF, LFM (copro 2), SFM (copro 2)
  951. CPDO dyadic arithmetic instructions
  952. ADF, MUF, SUF, RSF, DVF, RDF,
  953. POW, RPW, RMF, FML, FDV, FRD, POL
  954. CPDO monadic arithmetic instructions
  955. MVF, MNF, ABS, RND, SQT, LOG, LGN, EXP,
  956. SIN, COS, TAN, ASN, ACS, ATN, URD, NRM
  957. CPRT joint arithmetic/data transfer instructions
  958. FIX (arithmetic followed by load/store)
  959. FLT (load/store followed by arithmetic)
  960. CMF, CNF CMFE, CNFE (comparisons)
  961. WFS, RFS (write/read floating point status register)
  962. WFC, RFC (write/read floating point control register)
  963. cond condition codes
  964. P pre/post index bit: 0 = postindex, 1 = preindex
  965. U up/down bit: 0 = stack grows down, 1 = stack grows up
  966. W write back bit: 1 = update base register (Rn)
  967. L load/store bit: 0 = store, 1 = load
  968. Rn base register
  969. Rd destination/source register
  970. Fd floating point destination register
  971. Fn floating point source register
  972. Fm floating point source register or floating point constant
  973. uv transfer length (TABLE 1)
  974. wx register count (TABLE 2)
  975. abcd arithmetic opcode (TABLES 3 & 4)
  976. ef destination size (rounding precision) (TABLE 5)
  977. gh rounding mode (TABLE 6)
  978. j dyadic/monadic bit: 0 = dyadic, 1 = monadic
  979. i constant bit: 1 = constant (TABLE 6)
  980. */
  981. /*
  982. TABLE 1
  983. +-------------------------+---+---+---------+---------+
  984. | Precision | u | v | FPSR.EP | length |
  985. +-------------------------+---+---+---------+---------+
  986. | Single | 0 | 0 | x | 1 words |
  987. | Double | 1 | 1 | x | 2 words |
  988. | Extended | 1 | 1 | x | 3 words |
  989. | Packed decimal | 1 | 1 | 0 | 3 words |
  990. | Expanded packed decimal | 1 | 1 | 1 | 4 words |
  991. +-------------------------+---+---+---------+---------+
  992. Note: x = don't care
  993. */
  994. /*
  995. TABLE 2
  996. +---+---+---------------------------------+
  997. | w | x | Number of registers to transfer |
  998. +---+---+---------------------------------+
  999. | 0 | 1 | 1 |
  1000. | 1 | 0 | 2 |
  1001. | 1 | 1 | 3 |
  1002. | 0 | 0 | 4 |
  1003. +---+---+---------------------------------+
  1004. */
  1005. /*
  1006. TABLE 3: Dyadic Floating Point Opcodes
  1007. +---+---+---+---+----------+-----------------------+-----------------------+
  1008. | a | b | c | d | Mnemonic | Description | Operation |
  1009. +---+---+---+---+----------+-----------------------+-----------------------+
  1010. | 0 | 0 | 0 | 0 | ADF | Add | Fd := Fn + Fm |
  1011. | 0 | 0 | 0 | 1 | MUF | Multiply | Fd := Fn * Fm |
  1012. | 0 | 0 | 1 | 0 | SUF | Subtract | Fd := Fn - Fm |
  1013. | 0 | 0 | 1 | 1 | RSF | Reverse subtract | Fd := Fm - Fn |
  1014. | 0 | 1 | 0 | 0 | DVF | Divide | Fd := Fn / Fm |
  1015. | 0 | 1 | 0 | 1 | RDF | Reverse divide | Fd := Fm / Fn |
  1016. | 0 | 1 | 1 | 0 | POW | Power | Fd := Fn ^ Fm |
  1017. | 0 | 1 | 1 | 1 | RPW | Reverse power | Fd := Fm ^ Fn |
  1018. | 1 | 0 | 0 | 0 | RMF | Remainder | Fd := IEEE rem(Fn/Fm) |
  1019. | 1 | 0 | 0 | 1 | FML | Fast Multiply | Fd := Fn * Fm |
  1020. | 1 | 0 | 1 | 0 | FDV | Fast Divide | Fd := Fn / Fm |
  1021. | 1 | 0 | 1 | 1 | FRD | Fast reverse divide | Fd := Fm / Fn |
  1022. | 1 | 1 | 0 | 0 | POL | Polar angle (ArcTan2) | Fd := arctan2(Fn,Fm) |
  1023. | 1 | 1 | 0 | 1 | | undefined instruction | trap |
  1024. | 1 | 1 | 1 | 0 | | undefined instruction | trap |
  1025. | 1 | 1 | 1 | 1 | | undefined instruction | trap |
  1026. +---+---+---+---+----------+-----------------------+-----------------------+
  1027. Note: POW, RPW, POL are deprecated, and are available for backwards
  1028. compatibility only.
  1029. */
  1030. /*
  1031. TABLE 4: Monadic Floating Point Opcodes
  1032. +---+---+---+---+----------+-----------------------+-----------------------+
  1033. | a | b | c | d | Mnemonic | Description | Operation |
  1034. +---+---+---+---+----------+-----------------------+-----------------------+
  1035. | 0 | 0 | 0 | 0 | MVF | Move | Fd := Fm |
  1036. | 0 | 0 | 0 | 1 | MNF | Move negated | Fd := - Fm |
  1037. | 0 | 0 | 1 | 0 | ABS | Absolute value | Fd := abs(Fm) |
  1038. | 0 | 0 | 1 | 1 | RND | Round to integer | Fd := int(Fm) |
  1039. | 0 | 1 | 0 | 0 | SQT | Square root | Fd := sqrt(Fm) |
  1040. | 0 | 1 | 0 | 1 | LOG | Log base 10 | Fd := log10(Fm) |
  1041. | 0 | 1 | 1 | 0 | LGN | Log base e | Fd := ln(Fm) |
  1042. | 0 | 1 | 1 | 1 | EXP | Exponent | Fd := e ^ Fm |
  1043. | 1 | 0 | 0 | 0 | SIN | Sine | Fd := sin(Fm) |
  1044. | 1 | 0 | 0 | 1 | COS | Cosine | Fd := cos(Fm) |
  1045. | 1 | 0 | 1 | 0 | TAN | Tangent | Fd := tan(Fm) |
  1046. | 1 | 0 | 1 | 1 | ASN | Arc Sine | Fd := arcsin(Fm) |
  1047. | 1 | 1 | 0 | 0 | ACS | Arc Cosine | Fd := arccos(Fm) |
  1048. | 1 | 1 | 0 | 1 | ATN | Arc Tangent | Fd := arctan(Fm) |
  1049. | 1 | 1 | 1 | 0 | URD | Unnormalized round | Fd := int(Fm) |
  1050. | 1 | 1 | 1 | 1 | NRM | Normalize | Fd := norm(Fm) |
  1051. +---+---+---+---+----------+-----------------------+-----------------------+
  1052. Note: LOG, LGN, EXP, SIN, COS, TAN, ASN, ACS, ATN are deprecated, and are
  1053. available for backwards compatibility only.
  1054. */
  1055. /*
  1056. TABLE 5
  1057. +-------------------------+---+---+
  1058. | Rounding Precision | e | f |
  1059. +-------------------------+---+---+
  1060. | IEEE Single precision | 0 | 0 |
  1061. | IEEE Double precision | 0 | 1 |
  1062. | IEEE Extended precision | 1 | 0 |
  1063. | undefined (trap) | 1 | 1 |
  1064. +-------------------------+---+---+
  1065. */
  1066. /*
  1067. TABLE 5
  1068. +---------------------------------+---+---+
  1069. | Rounding Mode | g | h |
  1070. +---------------------------------+---+---+
  1071. | Round to nearest (default) | 0 | 0 |
  1072. | Round toward plus infinity | 0 | 1 |
  1073. | Round toward negative infinity | 1 | 0 |
  1074. | Round toward zero | 1 | 1 |
  1075. +---------------------------------+---+---+
  1076. *)
  1077. function taicpu.GetString:string;
  1078. var
  1079. i : longint;
  1080. s : string;
  1081. addsize : boolean;
  1082. begin
  1083. s:='['+gas_op2str[opcode];
  1084. for i:=0 to ops-1 do
  1085. begin
  1086. with oper[i]^ do
  1087. begin
  1088. if i=0 then
  1089. s:=s+' '
  1090. else
  1091. s:=s+',';
  1092. { type }
  1093. addsize:=false;
  1094. if (ot and OT_VREG)=OT_VREG then
  1095. s:=s+'vreg'
  1096. else
  1097. if (ot and OT_FPUREG)=OT_FPUREG then
  1098. s:=s+'fpureg'
  1099. else
  1100. if (ot and OT_REGISTER)=OT_REGISTER then
  1101. begin
  1102. s:=s+'reg';
  1103. addsize:=true;
  1104. end
  1105. else
  1106. if (ot and OT_REGLIST)=OT_REGLIST then
  1107. begin
  1108. s:=s+'reglist';
  1109. addsize:=false;
  1110. end
  1111. else
  1112. if (ot and OT_IMMEDIATE)=OT_IMMEDIATE then
  1113. begin
  1114. s:=s+'imm';
  1115. addsize:=true;
  1116. end
  1117. else
  1118. if (ot and OT_MEMORY)=OT_MEMORY then
  1119. begin
  1120. s:=s+'mem';
  1121. addsize:=true;
  1122. if (ot and OT_AM2)<>0 then
  1123. s:=s+' am2 ';
  1124. end
  1125. else
  1126. s:=s+'???';
  1127. { size }
  1128. if addsize then
  1129. begin
  1130. if (ot and OT_BITS8)<>0 then
  1131. s:=s+'8'
  1132. else
  1133. if (ot and OT_BITS16)<>0 then
  1134. s:=s+'24'
  1135. else
  1136. if (ot and OT_BITS32)<>0 then
  1137. s:=s+'32'
  1138. else
  1139. if (ot and OT_BITSSHIFTER)<>0 then
  1140. s:=s+'shifter'
  1141. else
  1142. s:=s+'??';
  1143. { signed }
  1144. if (ot and OT_SIGNED)<>0 then
  1145. s:=s+'s';
  1146. end;
  1147. end;
  1148. end;
  1149. GetString:=s+']';
  1150. end;
  1151. procedure taicpu.ResetPass1;
  1152. begin
  1153. { we need to reset everything here, because the choosen insentry
  1154. can be invalid for a new situation where the previously optimized
  1155. insentry is not correct }
  1156. InsEntry:=nil;
  1157. InsSize:=0;
  1158. LastInsOffset:=-1;
  1159. end;
  1160. procedure taicpu.ResetPass2;
  1161. begin
  1162. { we are here in a second pass, check if the instruction can be optimized }
  1163. if assigned(InsEntry) and
  1164. ((InsEntry^.flags and IF_PASS2)<>0) then
  1165. begin
  1166. InsEntry:=nil;
  1167. InsSize:=0;
  1168. end;
  1169. LastInsOffset:=-1;
  1170. end;
  1171. function taicpu.CheckIfValid:boolean;
  1172. begin
  1173. Result:=False; { unimplemented }
  1174. end;
  1175. function taicpu.Pass1(objdata:TObjData):longint;
  1176. var
  1177. ldr2op : array[PF_B..PF_T] of tasmop = (
  1178. A_LDRB,A_LDRSB,A_LDRBT,A_LDRH,A_LDRSH,A_LDRT);
  1179. str2op : array[PF_B..PF_T] of tasmop = (
  1180. A_STRB,A_None,A_STRBT,A_STRH,A_None,A_STRT);
  1181. begin
  1182. Pass1:=0;
  1183. { Save the old offset and set the new offset }
  1184. InsOffset:=ObjData.CurrObjSec.Size;
  1185. { Error? }
  1186. if (Insentry=nil) and (InsSize=-1) then
  1187. exit;
  1188. { set the file postion }
  1189. current_filepos:=fileinfo;
  1190. { tranlate LDR+postfix to complete opcode }
  1191. if (opcode=A_LDR) and (oppostfix<>PF_None) then
  1192. begin
  1193. if (oppostfix in [low(ldr2op)..high(ldr2op)]) then
  1194. opcode:=ldr2op[oppostfix]
  1195. else
  1196. internalerror(2005091001);
  1197. if opcode=A_None then
  1198. internalerror(2005091004);
  1199. { postfix has been added to opcode }
  1200. oppostfix:=PF_None;
  1201. end
  1202. else if (opcode=A_STR) and (oppostfix<>PF_None) then
  1203. begin
  1204. if (oppostfix in [low(str2op)..high(str2op)]) then
  1205. opcode:=str2op[oppostfix]
  1206. else
  1207. internalerror(2005091002);
  1208. if opcode=A_None then
  1209. internalerror(2005091003);
  1210. { postfix has been added to opcode }
  1211. oppostfix:=PF_None;
  1212. end;
  1213. { Get InsEntry }
  1214. if FindInsEntry(objdata) then
  1215. begin
  1216. InsSize:=4;
  1217. LastInsOffset:=InsOffset;
  1218. Pass1:=InsSize;
  1219. exit;
  1220. end;
  1221. LastInsOffset:=-1;
  1222. end;
  1223. procedure taicpu.Pass2(objdata:TObjData);
  1224. begin
  1225. { error in pass1 ? }
  1226. if insentry=nil then
  1227. exit;
  1228. current_filepos:=fileinfo;
  1229. { Generate the instruction }
  1230. GenCode(objdata);
  1231. end;
  1232. procedure taicpu.ppuloadoper(ppufile:tcompilerppufile;var o:toper);
  1233. begin
  1234. end;
  1235. procedure taicpu.ppuwriteoper(ppufile:tcompilerppufile;const o:toper);
  1236. begin
  1237. end;
  1238. procedure taicpu.ppubuildderefimploper(var o:toper);
  1239. begin
  1240. end;
  1241. procedure taicpu.ppuderefoper(var o:toper);
  1242. begin
  1243. end;
  1244. function taicpu.InsEnd:longint;
  1245. begin
  1246. Result:=0; { unimplemented }
  1247. end;
  1248. procedure taicpu.create_ot(objdata:TObjData);
  1249. var
  1250. i,l,relsize : longint;
  1251. dummy : byte;
  1252. currsym : TObjSymbol;
  1253. begin
  1254. if ops=0 then
  1255. exit;
  1256. { update oper[].ot field }
  1257. for i:=0 to ops-1 do
  1258. with oper[i]^ do
  1259. begin
  1260. case typ of
  1261. top_regset:
  1262. begin
  1263. ot:=OT_REGLIST;
  1264. end;
  1265. top_reg :
  1266. begin
  1267. case getregtype(reg) of
  1268. R_INTREGISTER:
  1269. ot:=OT_REG32 or OT_SHIFTEROP;
  1270. R_FPUREGISTER:
  1271. ot:=OT_FPUREG;
  1272. else
  1273. internalerror(2005090901);
  1274. end;
  1275. end;
  1276. top_ref :
  1277. begin
  1278. if ref^.refaddr=addr_no then
  1279. begin
  1280. { create ot field }
  1281. { we should get the size here dependend on the
  1282. instruction }
  1283. if (ot and OT_SIZE_MASK)=0 then
  1284. ot:=OT_MEMORY or OT_BITS32
  1285. else
  1286. ot:=OT_MEMORY or (ot and OT_SIZE_MASK);
  1287. if (ref^.base=NR_NO) and (ref^.index=NR_NO) then
  1288. ot:=ot or OT_MEM_OFFS;
  1289. { if we need to fix a reference, we do it here }
  1290. { pc relative addressing }
  1291. if (ref^.base=NR_NO) and
  1292. (ref^.index=NR_NO) and
  1293. (ref^.shiftmode=SM_None)
  1294. { at least we should check if the destination symbol
  1295. is in a text section }
  1296. { and
  1297. (ref^.symbol^.owner="text") } then
  1298. ref^.base:=NR_PC;
  1299. { determine possible address modes }
  1300. if (ref^.base<>NR_NO) and
  1301. (
  1302. (
  1303. (ref^.index=NR_NO) and
  1304. (ref^.shiftmode=SM_None) and
  1305. (ref^.offset>=-4097) and
  1306. (ref^.offset<=4097)
  1307. ) or
  1308. (
  1309. (ref^.shiftmode=SM_None) and
  1310. (ref^.offset=0)
  1311. ) or
  1312. (
  1313. (ref^.index<>NR_NO) and
  1314. (ref^.shiftmode<>SM_None) and
  1315. (ref^.shiftimm<=31) and
  1316. (ref^.offset=0)
  1317. )
  1318. ) then
  1319. ot:=ot or OT_AM2;
  1320. if (ref^.index<>NR_NO) and
  1321. (oppostfix in [PF_IA,PF_IB,PF_DA,PF_DB,PF_FD,PF_FA,PF_ED,PF_EA]) and
  1322. (
  1323. (ref^.base=NR_NO) and
  1324. (ref^.shiftmode=SM_None) and
  1325. (ref^.offset=0)
  1326. ) then
  1327. ot:=ot or OT_AM4;
  1328. end
  1329. else
  1330. begin
  1331. l:=ref^.offset;
  1332. currsym:=ObjData.symbolref(ref^.symbol);
  1333. if assigned(currsym) then
  1334. inc(l,currsym.address);
  1335. relsize:=(InsOffset+2)-l;
  1336. if (relsize<-33554428) or (relsize>33554428) then
  1337. ot:=OT_IMM32
  1338. else
  1339. ot:=OT_IMM24;
  1340. end;
  1341. end;
  1342. top_local :
  1343. begin
  1344. { we should get the size here dependend on the
  1345. instruction }
  1346. if (ot and OT_SIZE_MASK)=0 then
  1347. ot:=OT_MEMORY or OT_BITS32
  1348. else
  1349. ot:=OT_MEMORY or (ot and OT_SIZE_MASK);
  1350. end;
  1351. top_const :
  1352. begin
  1353. ot:=OT_IMMEDIATE;
  1354. if is_shifter_const(val,dummy) then
  1355. ot:=OT_IMMSHIFTER
  1356. else
  1357. ot:=OT_IMM32
  1358. end;
  1359. top_none :
  1360. begin
  1361. { generated when there was an error in the
  1362. assembler reader. It never happends when generating
  1363. assembler }
  1364. end;
  1365. top_shifterop:
  1366. begin
  1367. ot:=OT_SHIFTEROP;
  1368. end;
  1369. else
  1370. internalerror(200402261);
  1371. end;
  1372. end;
  1373. end;
  1374. function taicpu.Matches(p:PInsEntry):longint;
  1375. { * IF_SM stands for Size Match: any operand whose size is not
  1376. * explicitly specified by the template is `really' intended to be
  1377. * the same size as the first size-specified operand.
  1378. * Non-specification is tolerated in the input instruction, but
  1379. * _wrong_ specification is not.
  1380. *
  1381. * IF_SM2 invokes Size Match on only the first _two_ operands, for
  1382. * three-operand instructions such as SHLD: it implies that the
  1383. * first two operands must match in size, but that the third is
  1384. * required to be _unspecified_.
  1385. *
  1386. * IF_SB invokes Size Byte: operands with unspecified size in the
  1387. * template are really bytes, and so no non-byte specification in
  1388. * the input instruction will be tolerated. IF_SW similarly invokes
  1389. * Size Word, and IF_SD invokes Size Doubleword.
  1390. *
  1391. * (The default state if neither IF_SM nor IF_SM2 is specified is
  1392. * that any operand with unspecified size in the template is
  1393. * required to have unspecified size in the instruction too...)
  1394. }
  1395. var
  1396. i{,j,asize,oprs} : longint;
  1397. {siz : array[0..3] of longint;}
  1398. begin
  1399. Matches:=100;
  1400. writeln(getstring,'---');
  1401. { Check the opcode and operands }
  1402. if (p^.opcode<>opcode) or (p^.ops<>ops) then
  1403. begin
  1404. Matches:=0;
  1405. exit;
  1406. end;
  1407. { Check that no spurious colons or TOs are present }
  1408. for i:=0 to p^.ops-1 do
  1409. if (oper[i]^.ot and (not p^.optypes[i]) and (OT_COLON or OT_TO))<>0 then
  1410. begin
  1411. Matches:=0;
  1412. exit;
  1413. end;
  1414. { Check that the operand flags all match up }
  1415. for i:=0 to p^.ops-1 do
  1416. begin
  1417. if ((p^.optypes[i] and (not oper[i]^.ot)) or
  1418. ((p^.optypes[i] and OT_SIZE_MASK) and
  1419. ((p^.optypes[i] xor oper[i]^.ot) and OT_SIZE_MASK)))<>0 then
  1420. begin
  1421. if ((p^.optypes[i] and (not oper[i]^.ot) and OT_NON_SIZE) or
  1422. (oper[i]^.ot and OT_SIZE_MASK))<>0 then
  1423. begin
  1424. Matches:=0;
  1425. exit;
  1426. end
  1427. else
  1428. Matches:=1;
  1429. end;
  1430. end;
  1431. { check postfixes:
  1432. the existance of a certain postfix requires a
  1433. particular code }
  1434. { update condition flags
  1435. or floating point single }
  1436. if (oppostfix=PF_S) and
  1437. not(p^.code[0] in [#$04]) then
  1438. begin
  1439. Matches:=0;
  1440. exit;
  1441. end;
  1442. { floating point size }
  1443. if (oppostfix in [PF_D,PF_E,PF_P,PF_EP]) and
  1444. not(p^.code[0] in []) then
  1445. begin
  1446. Matches:=0;
  1447. exit;
  1448. end;
  1449. { multiple load/store address modes }
  1450. if (oppostfix in [PF_IA,PF_IB,PF_DA,PF_DB,PF_FD,PF_FA,PF_ED,PF_EA]) and
  1451. not(p^.code[0] in [
  1452. // ldr,str,ldrb,strb
  1453. #$17,
  1454. // stm,ldm
  1455. #$26
  1456. ]) then
  1457. begin
  1458. Matches:=0;
  1459. exit;
  1460. end;
  1461. { we shouldn't see any opsize prefixes here }
  1462. if (oppostfix in [PF_B,PF_SB,PF_BT,PF_H,PF_SH,PF_T]) then
  1463. begin
  1464. Matches:=0;
  1465. exit;
  1466. end;
  1467. if (roundingmode<>RM_None) and not(p^.code[0] in []) then
  1468. begin
  1469. Matches:=0;
  1470. exit;
  1471. end;
  1472. { Check operand sizes }
  1473. { as default an untyped size can get all the sizes, this is different
  1474. from nasm, but else we need to do a lot checking which opcodes want
  1475. size or not with the automatic size generation }
  1476. (*
  1477. asize:=longint($ffffffff);
  1478. if (p^.flags and IF_SB)<>0 then
  1479. asize:=OT_BITS8
  1480. else if (p^.flags and IF_SW)<>0 then
  1481. asize:=OT_BITS16
  1482. else if (p^.flags and IF_SD)<>0 then
  1483. asize:=OT_BITS32;
  1484. if (p^.flags and IF_ARMASK)<>0 then
  1485. begin
  1486. siz[0]:=0;
  1487. siz[1]:=0;
  1488. siz[2]:=0;
  1489. if (p^.flags and IF_AR0)<>0 then
  1490. siz[0]:=asize
  1491. else if (p^.flags and IF_AR1)<>0 then
  1492. siz[1]:=asize
  1493. else if (p^.flags and IF_AR2)<>0 then
  1494. siz[2]:=asize;
  1495. end
  1496. else
  1497. begin
  1498. { we can leave because the size for all operands is forced to be
  1499. the same
  1500. but not if IF_SB IF_SW or IF_SD is set PM }
  1501. if asize=-1 then
  1502. exit;
  1503. siz[0]:=asize;
  1504. siz[1]:=asize;
  1505. siz[2]:=asize;
  1506. end;
  1507. if (p^.flags and (IF_SM or IF_SM2))<>0 then
  1508. begin
  1509. if (p^.flags and IF_SM2)<>0 then
  1510. oprs:=2
  1511. else
  1512. oprs:=p^.ops;
  1513. for i:=0 to oprs-1 do
  1514. if ((p^.optypes[i] and OT_SIZE_MASK) <> 0) then
  1515. begin
  1516. for j:=0 to oprs-1 do
  1517. siz[j]:=p^.optypes[i] and OT_SIZE_MASK;
  1518. break;
  1519. end;
  1520. end
  1521. else
  1522. oprs:=2;
  1523. { Check operand sizes }
  1524. for i:=0 to p^.ops-1 do
  1525. begin
  1526. if ((p^.optypes[i] and OT_SIZE_MASK)=0) and
  1527. ((oper[i]^.ot and OT_SIZE_MASK and (not siz[i]))<>0) and
  1528. { Immediates can always include smaller size }
  1529. ((oper[i]^.ot and OT_IMMEDIATE)=0) and
  1530. (((p^.optypes[i] and OT_SIZE_MASK) or siz[i])<(oper[i]^.ot and OT_SIZE_MASK)) then
  1531. Matches:=2;
  1532. end;
  1533. *)
  1534. end;
  1535. function taicpu.calcsize(p:PInsEntry):shortint;
  1536. begin
  1537. result:=4;
  1538. end;
  1539. function taicpu.NeedAddrPrefix(opidx:byte):boolean;
  1540. begin
  1541. Result:=False; { unimplemented }
  1542. end;
  1543. procedure taicpu.Swapoperands;
  1544. begin
  1545. end;
  1546. function taicpu.FindInsentry(objdata:TObjData):boolean;
  1547. var
  1548. i : longint;
  1549. begin
  1550. result:=false;
  1551. { Things which may only be done once, not when a second pass is done to
  1552. optimize }
  1553. if (Insentry=nil) or ((InsEntry^.flags and IF_PASS2)<>0) then
  1554. begin
  1555. { create the .ot fields }
  1556. create_ot(objdata);
  1557. { set the file postion }
  1558. current_filepos:=fileinfo;
  1559. end
  1560. else
  1561. begin
  1562. { we've already an insentry so it's valid }
  1563. result:=true;
  1564. exit;
  1565. end;
  1566. { Lookup opcode in the table }
  1567. InsSize:=-1;
  1568. i:=instabcache^[opcode];
  1569. if i=-1 then
  1570. begin
  1571. Message1(asmw_e_opcode_not_in_table,gas_op2str[opcode]);
  1572. exit;
  1573. end;
  1574. insentry:=@instab[i];
  1575. while (insentry^.opcode=opcode) do
  1576. begin
  1577. if matches(insentry)=100 then
  1578. begin
  1579. result:=true;
  1580. exit;
  1581. end;
  1582. inc(i);
  1583. insentry:=@instab[i];
  1584. end;
  1585. Message1(asmw_e_invalid_opcode_and_operands,GetString);
  1586. { No instruction found, set insentry to nil and inssize to -1 }
  1587. insentry:=nil;
  1588. inssize:=-1;
  1589. end;
  1590. procedure taicpu.gencode(objdata:TObjData);
  1591. var
  1592. bytes : dword;
  1593. i_field : byte;
  1594. procedure setshifterop(op : byte);
  1595. begin
  1596. case oper[op]^.typ of
  1597. top_const:
  1598. begin
  1599. i_field:=1;
  1600. bytes:=bytes or dword(oper[op]^.val and $fff);
  1601. end;
  1602. top_reg:
  1603. begin
  1604. i_field:=0;
  1605. bytes:=bytes or (getsupreg(oper[op]^.reg) shl 16);
  1606. { does a real shifter op follow? }
  1607. if (op+1<=op) and (oper[op+1]^.typ=top_shifterop) then
  1608. begin
  1609. end;
  1610. end;
  1611. else
  1612. internalerror(2005091103);
  1613. end;
  1614. end;
  1615. begin
  1616. bytes:=$0;
  1617. { evaluate and set condition code }
  1618. { condition code allowed? }
  1619. { setup rest of the instruction }
  1620. case insentry^.code[0] of
  1621. #$08:
  1622. begin
  1623. { set instruction code }
  1624. bytes:=bytes or (ord(insentry^.code[1]) shl 26);
  1625. bytes:=bytes or (ord(insentry^.code[2]) shl 21);
  1626. { set destination }
  1627. bytes:=bytes or (getsupreg(oper[0]^.reg) shl 12);
  1628. { create shifter op }
  1629. setshifterop(1);
  1630. { set i field }
  1631. bytes:=bytes or (i_field shl 25);
  1632. { set s if necessary }
  1633. if oppostfix=PF_S then
  1634. bytes:=bytes or (1 shl 20);
  1635. end;
  1636. #$ff:
  1637. internalerror(2005091101);
  1638. else
  1639. internalerror(2005091102);
  1640. end;
  1641. { we're finished, write code }
  1642. objdata.writebytes(bytes,sizeof(bytes));
  1643. end;
  1644. {$ifdef dummy}
  1645. (*
  1646. static void gencode (long segment, long offset, int bits,
  1647. insn *ins, char *codes, long insn_end)
  1648. {
  1649. int has_S_code; /* S - setflag */
  1650. int has_B_code; /* B - setflag */
  1651. int has_T_code; /* T - setflag */
  1652. int has_W_code; /* ! => W flag */
  1653. int has_F_code; /* ^ => S flag */
  1654. int keep;
  1655. unsigned char c;
  1656. unsigned char bytes[4];
  1657. long data, size;
  1658. static int cc_code[] = /* bit pattern of cc */
  1659. { /* order as enum in */
  1660. 0x0E, 0x03, 0x02, 0x00, /* nasm.h */
  1661. 0x0A, 0x0C, 0x08, 0x0D,
  1662. 0x09, 0x0B, 0x04, 0x01,
  1663. 0x05, 0x07, 0x06,
  1664. };
  1665. #ifdef DEBUG
  1666. static char *CC[] =
  1667. { /* condition code names */
  1668. "AL", "CC", "CS", "EQ",
  1669. "GE", "GT", "HI", "LE",
  1670. "LS", "LT", "MI", "NE",
  1671. "PL", "VC", "VS", "",
  1672. "S"
  1673. };
  1674. has_S_code = (ins->condition & C_SSETFLAG);
  1675. has_B_code = (ins->condition & C_BSETFLAG);
  1676. has_T_code = (ins->condition & C_TSETFLAG);
  1677. has_W_code = (ins->condition & C_EXSETFLAG);
  1678. has_F_code = (ins->condition & C_FSETFLAG);
  1679. ins->condition = (ins->condition & 0x0F);
  1680. if (rt_debug)
  1681. {
  1682. printf ("gencode: instruction: %s%s", insn_names[ins->opcode],
  1683. CC[ins->condition & 0x0F]);
  1684. if (has_S_code)
  1685. printf ("S");
  1686. if (has_B_code)
  1687. printf ("B");
  1688. if (has_T_code)
  1689. printf ("T");
  1690. if (has_W_code)
  1691. printf ("!");
  1692. if (has_F_code)
  1693. printf ("^");
  1694. printf ("\n");
  1695. c = *codes;
  1696. printf (" (%d) decode - '0x%02X'\n", ins->operands, c);
  1697. bytes[0] = 0xB;
  1698. bytes[1] = 0xE;
  1699. bytes[2] = 0xE;
  1700. bytes[3] = 0xF;
  1701. }
  1702. // First condition code in upper nibble
  1703. if (ins->condition < C_NONE)
  1704. {
  1705. c = cc_code[ins->condition] << 4;
  1706. }
  1707. else
  1708. {
  1709. c = cc_code[C_AL] << 4; // is often ALWAYS but not always
  1710. }
  1711. switch (keep = *codes)
  1712. {
  1713. case 1:
  1714. // B, BL
  1715. ++codes;
  1716. c |= *codes++;
  1717. bytes[0] = c;
  1718. if (ins->oprs[0].segment != segment)
  1719. {
  1720. // fais une relocation
  1721. c = 1;
  1722. data = 0; // Let the linker locate ??
  1723. }
  1724. else
  1725. {
  1726. c = 0;
  1727. data = ins->oprs[0].offset - (offset + 8);
  1728. if (data % 4)
  1729. {
  1730. errfunc (ERR_NONFATAL, "offset not aligned on 4 bytes");
  1731. }
  1732. }
  1733. if (data >= 0x1000)
  1734. {
  1735. errfunc (ERR_NONFATAL, "too long offset");
  1736. }
  1737. data = data >> 2;
  1738. bytes[1] = (data >> 16) & 0xFF;
  1739. bytes[2] = (data >> 8) & 0xFF;
  1740. bytes[3] = (data ) & 0xFF;
  1741. if (c == 1)
  1742. {
  1743. // out (offset, segment, &bytes[0], OUT_RAWDATA+1, NO_SEG, NO_SEG);
  1744. out (offset, segment, &bytes[0], OUT_REL3ADR+4, ins->oprs[0].segment, NO_SEG);
  1745. }
  1746. else
  1747. {
  1748. out (offset, segment, &bytes[0], OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1749. }
  1750. return;
  1751. case 2:
  1752. // SWI
  1753. ++codes;
  1754. c |= *codes++;
  1755. bytes[0] = c;
  1756. data = ins->oprs[0].offset;
  1757. bytes[1] = (data >> 16) & 0xFF;
  1758. bytes[2] = (data >> 8) & 0xFF;
  1759. bytes[3] = (data) & 0xFF;
  1760. out (offset, segment, &bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1761. return;
  1762. case 3:
  1763. // BX
  1764. ++codes;
  1765. c |= *codes++;
  1766. bytes[0] = c;
  1767. bytes[1] = *codes++;
  1768. bytes[2] = *codes++;
  1769. bytes[3] = *codes++;
  1770. c = regval (&ins->oprs[0],1);
  1771. if (c == 15) // PC
  1772. {
  1773. errfunc (ERR_WARNING, "'BX' with R15 has undefined behaviour");
  1774. }
  1775. else if (c > 15)
  1776. {
  1777. errfunc (ERR_NONFATAL, "Illegal register specified for 'BX'");
  1778. }
  1779. bytes[3] |= (c & 0x0F);
  1780. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1781. return;
  1782. case 4: // AND Rd,Rn,Rm
  1783. case 5: // AND Rd,Rn,Rm,<shift>Rs
  1784. case 6: // AND Rd,Rn,Rm,<shift>imm
  1785. case 7: // AND Rd,Rn,<shift>imm
  1786. ++codes;
  1787. #ifdef DEBUG
  1788. if (rt_debug)
  1789. {
  1790. printf (" decode - '0x%02X'\n", keep);
  1791. printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
  1792. }
  1793. #endif
  1794. bytes[0] = c | *codes;
  1795. ++codes;
  1796. bytes[1] = *codes;
  1797. if (has_S_code)
  1798. bytes[1] |= 0x10;
  1799. c = regval (&ins->oprs[1],1);
  1800. // Rn in low nibble
  1801. bytes[1] |= c;
  1802. // Rd in high nibble
  1803. bytes[2] = regval (&ins->oprs[0],1) << 4;
  1804. if (keep != 7)
  1805. {
  1806. // Rm in low nibble
  1807. bytes[3] = regval (&ins->oprs[2],1);
  1808. }
  1809. // Shifts if any
  1810. if (keep == 5 || keep == 6)
  1811. {
  1812. // Shift in bytes 2 and 3
  1813. if (keep == 5)
  1814. {
  1815. // Rs
  1816. c = regval (&ins->oprs[3],1);
  1817. bytes[2] |= c;
  1818. c = 0x10; // Set bit 4 in byte[3]
  1819. }
  1820. if (keep == 6)
  1821. {
  1822. c = (ins->oprs[3].offset) & 0x1F;
  1823. // #imm
  1824. bytes[2] |= c >> 1;
  1825. if (c & 0x01)
  1826. {
  1827. bytes[3] |= 0x80;
  1828. }
  1829. c = 0; // Clr bit 4 in byte[3]
  1830. }
  1831. // <shift>
  1832. c |= shiftval (&ins->oprs[3]) << 5;
  1833. bytes[3] |= c;
  1834. }
  1835. // reg,reg,imm
  1836. if (keep == 7)
  1837. {
  1838. int shimm;
  1839. shimm = imm_shift (ins->oprs[2].offset);
  1840. if (shimm == -1)
  1841. {
  1842. errfunc (ERR_NONFATAL, "cannot create that constant");
  1843. }
  1844. bytes[3] = shimm & 0xFF;
  1845. bytes[2] |= (shimm & 0xF00) >> 8;
  1846. }
  1847. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1848. return;
  1849. case 8: // MOV Rd,Rm
  1850. case 9: // MOV Rd,Rm,<shift>Rs
  1851. case 0xA: // MOV Rd,Rm,<shift>imm
  1852. case 0xB: // MOV Rd,<shift>imm
  1853. ++codes;
  1854. #ifdef DEBUG
  1855. if (rt_debug)
  1856. {
  1857. printf (" decode - '0x%02X'\n", keep);
  1858. printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
  1859. }
  1860. #endif
  1861. bytes[0] = c | *codes;
  1862. ++codes;
  1863. bytes[1] = *codes;
  1864. if (has_S_code)
  1865. bytes[1] |= 0x10;
  1866. // Rd in high nibble
  1867. bytes[2] = regval (&ins->oprs[0],1) << 4;
  1868. if (keep != 0x0B)
  1869. {
  1870. // Rm in low nibble
  1871. bytes[3] = regval (&ins->oprs[1],1);
  1872. }
  1873. // Shifts if any
  1874. if (keep == 0x09 || keep == 0x0A)
  1875. {
  1876. // Shift in bytes 2 and 3
  1877. if (keep == 0x09)
  1878. {
  1879. // Rs
  1880. c = regval (&ins->oprs[2],1);
  1881. bytes[2] |= c;
  1882. c = 0x10; // Set bit 4 in byte[3]
  1883. }
  1884. if (keep == 0x0A)
  1885. {
  1886. c = (ins->oprs[2].offset) & 0x1F;
  1887. // #imm
  1888. bytes[2] |= c >> 1;
  1889. if (c & 0x01)
  1890. {
  1891. bytes[3] |= 0x80;
  1892. }
  1893. c = 0; // Clr bit 4 in byte[3]
  1894. }
  1895. // <shift>
  1896. c |= shiftval (&ins->oprs[2]) << 5;
  1897. bytes[3] |= c;
  1898. }
  1899. // reg,imm
  1900. if (keep == 0x0B)
  1901. {
  1902. int shimm;
  1903. shimm = imm_shift (ins->oprs[1].offset);
  1904. if (shimm == -1)
  1905. {
  1906. errfunc (ERR_NONFATAL, "cannot create that constant");
  1907. }
  1908. bytes[3] = shimm & 0xFF;
  1909. bytes[2] |= (shimm & 0xF00) >> 8;
  1910. }
  1911. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1912. return;
  1913. case 0xC: // CMP Rn,Rm
  1914. case 0xD: // CMP Rn,Rm,<shift>Rs
  1915. case 0xE: // CMP Rn,Rm,<shift>imm
  1916. case 0xF: // CMP Rn,<shift>imm
  1917. ++codes;
  1918. bytes[0] = c | *codes++;
  1919. bytes[1] = *codes;
  1920. // Implicit S code
  1921. bytes[1] |= 0x10;
  1922. c = regval (&ins->oprs[0],1);
  1923. // Rn in low nibble
  1924. bytes[1] |= c;
  1925. // No destination
  1926. bytes[2] = 0;
  1927. if (keep != 0x0B)
  1928. {
  1929. // Rm in low nibble
  1930. bytes[3] = regval (&ins->oprs[1],1);
  1931. }
  1932. // Shifts if any
  1933. if (keep == 0x0D || keep == 0x0E)
  1934. {
  1935. // Shift in bytes 2 and 3
  1936. if (keep == 0x0D)
  1937. {
  1938. // Rs
  1939. c = regval (&ins->oprs[2],1);
  1940. bytes[2] |= c;
  1941. c = 0x10; // Set bit 4 in byte[3]
  1942. }
  1943. if (keep == 0x0E)
  1944. {
  1945. c = (ins->oprs[2].offset) & 0x1F;
  1946. // #imm
  1947. bytes[2] |= c >> 1;
  1948. if (c & 0x01)
  1949. {
  1950. bytes[3] |= 0x80;
  1951. }
  1952. c = 0; // Clr bit 4 in byte[3]
  1953. }
  1954. // <shift>
  1955. c |= shiftval (&ins->oprs[2]) << 5;
  1956. bytes[3] |= c;
  1957. }
  1958. // reg,imm
  1959. if (keep == 0x0F)
  1960. {
  1961. int shimm;
  1962. shimm = imm_shift (ins->oprs[1].offset);
  1963. if (shimm == -1)
  1964. {
  1965. errfunc (ERR_NONFATAL, "cannot create that constant");
  1966. }
  1967. bytes[3] = shimm & 0xFF;
  1968. bytes[2] |= (shimm & 0xF00) >> 8;
  1969. }
  1970. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1971. return;
  1972. case 0x10: // MRS Rd,<psr>
  1973. ++codes;
  1974. bytes[0] = c | *codes++;
  1975. bytes[1] = *codes++;
  1976. // Rd
  1977. c = regval (&ins->oprs[0],1);
  1978. bytes[2] = c << 4;
  1979. bytes[3] = 0;
  1980. c = ins->oprs[1].basereg;
  1981. if (c == R_CPSR || c == R_SPSR)
  1982. {
  1983. if (c == R_SPSR)
  1984. {
  1985. bytes[1] |= 0x40;
  1986. }
  1987. }
  1988. else
  1989. {
  1990. errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
  1991. }
  1992. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  1993. return;
  1994. case 0x11: // MSR <psr>,Rm
  1995. case 0x12: // MSR <psrf>,Rm
  1996. case 0x13: // MSR <psrf>,#expression
  1997. ++codes;
  1998. bytes[0] = c | *codes++;
  1999. bytes[1] = *codes++;
  2000. bytes[2] = *codes;
  2001. if (keep == 0x11 || keep == 0x12)
  2002. {
  2003. // Rm
  2004. c = regval (&ins->oprs[1],1);
  2005. bytes[3] = c;
  2006. }
  2007. else
  2008. {
  2009. int shimm;
  2010. shimm = imm_shift (ins->oprs[1].offset);
  2011. if (shimm == -1)
  2012. {
  2013. errfunc (ERR_NONFATAL, "cannot create that constant");
  2014. }
  2015. bytes[3] = shimm & 0xFF;
  2016. bytes[2] |= (shimm & 0xF00) >> 8;
  2017. }
  2018. c = ins->oprs[0].basereg;
  2019. if ( keep == 0x11)
  2020. {
  2021. if ( c == R_CPSR || c == R_SPSR)
  2022. {
  2023. if ( c== R_SPSR)
  2024. {
  2025. bytes[1] |= 0x40;
  2026. }
  2027. }
  2028. else
  2029. {
  2030. errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
  2031. }
  2032. }
  2033. else
  2034. {
  2035. if ( c == R_CPSR_FLG || c == R_SPSR_FLG)
  2036. {
  2037. if ( c== R_SPSR_FLG)
  2038. {
  2039. bytes[1] |= 0x40;
  2040. }
  2041. }
  2042. else
  2043. {
  2044. errfunc (ERR_NONFATAL, "CPSR_flg or SPSR_flg expected");
  2045. }
  2046. }
  2047. break;
  2048. case 0x14: // MUL Rd,Rm,Rs
  2049. case 0x15: // MULA Rd,Rm,Rs,Rn
  2050. ++codes;
  2051. bytes[0] = c | *codes++;
  2052. bytes[1] = *codes++;
  2053. bytes[3] = *codes;
  2054. // Rd
  2055. bytes[1] |= regval (&ins->oprs[0],1);
  2056. if (has_S_code)
  2057. bytes[1] |= 0x10;
  2058. // Rm
  2059. bytes[3] |= regval (&ins->oprs[1],1);
  2060. // Rs
  2061. bytes[2] = regval (&ins->oprs[2],1);
  2062. if (keep == 0x15)
  2063. {
  2064. bytes[2] |= regval (&ins->oprs[3],1) << 4;
  2065. }
  2066. break;
  2067. case 0x16: // SMLAL RdHi,RdLo,Rm,Rs
  2068. ++codes;
  2069. bytes[0] = c | *codes++;
  2070. bytes[1] = *codes++;
  2071. bytes[3] = *codes;
  2072. // RdHi
  2073. bytes[1] |= regval (&ins->oprs[1],1);
  2074. if (has_S_code)
  2075. bytes[1] |= 0x10;
  2076. // RdLo
  2077. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2078. // Rm
  2079. bytes[3] |= regval (&ins->oprs[2],1);
  2080. // Rs
  2081. bytes[2] |= regval (&ins->oprs[3],1);
  2082. break;
  2083. case 0x17: // LDR Rd, expression
  2084. ++codes;
  2085. bytes[0] = c | *codes++;
  2086. bytes[1] = *codes++;
  2087. // Rd
  2088. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2089. if (has_B_code)
  2090. bytes[1] |= 0x40;
  2091. if (has_T_code)
  2092. {
  2093. errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
  2094. }
  2095. if (has_W_code)
  2096. {
  2097. errfunc (ERR_NONFATAL, "'!' not allowed");
  2098. }
  2099. // Rn - implicit R15
  2100. bytes[1] |= 0xF;
  2101. if (ins->oprs[1].segment != segment)
  2102. {
  2103. errfunc (ERR_NONFATAL, "label not in same segment");
  2104. }
  2105. data = ins->oprs[1].offset - (offset + 8);
  2106. if (data < 0)
  2107. {
  2108. data = -data;
  2109. }
  2110. else
  2111. {
  2112. bytes[1] |= 0x80;
  2113. }
  2114. if (data >= 0x1000)
  2115. {
  2116. errfunc (ERR_NONFATAL, "too long offset");
  2117. }
  2118. bytes[2] |= ((data & 0xF00) >> 8);
  2119. bytes[3] = data & 0xFF;
  2120. break;
  2121. case 0x18: // LDR Rd, [Rn]
  2122. ++codes;
  2123. bytes[0] = c | *codes++;
  2124. bytes[1] = *codes++;
  2125. // Rd
  2126. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2127. if (has_B_code)
  2128. bytes[1] |= 0x40;
  2129. if (has_T_code)
  2130. {
  2131. bytes[1] |= 0x20; // write-back
  2132. }
  2133. else
  2134. {
  2135. bytes[0] |= 0x01; // implicit pre-index mode
  2136. }
  2137. if (has_W_code)
  2138. {
  2139. bytes[1] |= 0x20; // write-back
  2140. }
  2141. // Rn
  2142. c = regval (&ins->oprs[1],1);
  2143. bytes[1] |= c;
  2144. if (c == 0x15) // R15
  2145. data = -8;
  2146. else
  2147. data = 0;
  2148. if (data < 0)
  2149. {
  2150. data = -data;
  2151. }
  2152. else
  2153. {
  2154. bytes[1] |= 0x80;
  2155. }
  2156. bytes[2] |= ((data & 0xF00) >> 8);
  2157. bytes[3] = data & 0xFF;
  2158. break;
  2159. case 0x19: // LDR Rd, [Rn,#expression]
  2160. case 0x20: // LDR Rd, [Rn,Rm]
  2161. case 0x21: // LDR Rd, [Rn,Rm,shift]
  2162. ++codes;
  2163. bytes[0] = c | *codes++;
  2164. bytes[1] = *codes++;
  2165. // Rd
  2166. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2167. if (has_B_code)
  2168. bytes[1] |= 0x40;
  2169. // Rn
  2170. c = regval (&ins->oprs[1],1);
  2171. bytes[1] |= c;
  2172. if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
  2173. {
  2174. bytes[0] |= 0x01; // pre-index mode
  2175. if (has_W_code)
  2176. {
  2177. bytes[1] |= 0x20;
  2178. }
  2179. if (has_T_code)
  2180. {
  2181. errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
  2182. }
  2183. }
  2184. else
  2185. {
  2186. if (has_T_code) // Forced write-back in post-index mode
  2187. {
  2188. bytes[1] |= 0x20;
  2189. }
  2190. if (has_W_code)
  2191. {
  2192. errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
  2193. }
  2194. }
  2195. if (keep == 0x19)
  2196. {
  2197. data = ins->oprs[2].offset;
  2198. if (data < 0)
  2199. {
  2200. data = -data;
  2201. }
  2202. else
  2203. {
  2204. bytes[1] |= 0x80;
  2205. }
  2206. if (data >= 0x1000)
  2207. {
  2208. errfunc (ERR_NONFATAL, "too long offset");
  2209. }
  2210. bytes[2] |= ((data & 0xF00) >> 8);
  2211. bytes[3] = data & 0xFF;
  2212. }
  2213. else
  2214. {
  2215. if (ins->oprs[2].minus == 0)
  2216. {
  2217. bytes[1] |= 0x80;
  2218. }
  2219. c = regval (&ins->oprs[2],1);
  2220. bytes[3] = c;
  2221. if (keep == 0x21)
  2222. {
  2223. c = ins->oprs[3].offset;
  2224. if (c > 0x1F)
  2225. {
  2226. errfunc (ERR_NONFATAL, "too large shiftvalue");
  2227. c = c & 0x1F;
  2228. }
  2229. bytes[2] |= c >> 1;
  2230. if (c & 0x01)
  2231. {
  2232. bytes[3] |= 0x80;
  2233. }
  2234. bytes[3] |= shiftval (&ins->oprs[3]) << 5;
  2235. }
  2236. }
  2237. break;
  2238. case 0x22: // LDRH Rd, expression
  2239. ++codes;
  2240. bytes[0] = c | 0x01; // Implicit pre-index
  2241. bytes[1] = *codes++;
  2242. // Rd
  2243. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2244. // Rn - implicit R15
  2245. bytes[1] |= 0xF;
  2246. if (ins->oprs[1].segment != segment)
  2247. {
  2248. errfunc (ERR_NONFATAL, "label not in same segment");
  2249. }
  2250. data = ins->oprs[1].offset - (offset + 8);
  2251. if (data < 0)
  2252. {
  2253. data = -data;
  2254. }
  2255. else
  2256. {
  2257. bytes[1] |= 0x80;
  2258. }
  2259. if (data >= 0x100)
  2260. {
  2261. errfunc (ERR_NONFATAL, "too long offset");
  2262. }
  2263. bytes[3] = *codes++;
  2264. bytes[2] |= ((data & 0xF0) >> 4);
  2265. bytes[3] |= data & 0xF;
  2266. break;
  2267. case 0x23: // LDRH Rd, Rn
  2268. ++codes;
  2269. bytes[0] = c | 0x01; // Implicit pre-index
  2270. bytes[1] = *codes++;
  2271. // Rd
  2272. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2273. // Rn
  2274. c = regval (&ins->oprs[1],1);
  2275. bytes[1] |= c;
  2276. if (c == 0x15) // R15
  2277. data = -8;
  2278. else
  2279. data = 0;
  2280. if (data < 0)
  2281. {
  2282. data = -data;
  2283. }
  2284. else
  2285. {
  2286. bytes[1] |= 0x80;
  2287. }
  2288. if (data >= 0x100)
  2289. {
  2290. errfunc (ERR_NONFATAL, "too long offset");
  2291. }
  2292. bytes[3] = *codes++;
  2293. bytes[2] |= ((data & 0xF0) >> 4);
  2294. bytes[3] |= data & 0xF;
  2295. break;
  2296. case 0x24: // LDRH Rd, Rn, expression
  2297. case 0x25: // LDRH Rd, Rn, Rm
  2298. ++codes;
  2299. bytes[0] = c;
  2300. bytes[1] = *codes++;
  2301. // Rd
  2302. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2303. // Rn
  2304. c = regval (&ins->oprs[1],1);
  2305. bytes[1] |= c;
  2306. if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
  2307. {
  2308. bytes[0] |= 0x01; // pre-index mode
  2309. if (has_W_code)
  2310. {
  2311. bytes[1] |= 0x20;
  2312. }
  2313. }
  2314. else
  2315. {
  2316. if (has_W_code)
  2317. {
  2318. errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
  2319. }
  2320. }
  2321. bytes[3] = *codes++;
  2322. if (keep == 0x24)
  2323. {
  2324. data = ins->oprs[2].offset;
  2325. if (data < 0)
  2326. {
  2327. data = -data;
  2328. }
  2329. else
  2330. {
  2331. bytes[1] |= 0x80;
  2332. }
  2333. if (data >= 0x100)
  2334. {
  2335. errfunc (ERR_NONFATAL, "too long offset");
  2336. }
  2337. bytes[2] |= ((data & 0xF0) >> 4);
  2338. bytes[3] |= data & 0xF;
  2339. }
  2340. else
  2341. {
  2342. if (ins->oprs[2].minus == 0)
  2343. {
  2344. bytes[1] |= 0x80;
  2345. }
  2346. c = regval (&ins->oprs[2],1);
  2347. bytes[3] |= c;
  2348. }
  2349. break;
  2350. case 0x26: // LDM/STM Rn, {reg-list}
  2351. ++codes;
  2352. bytes[0] = c;
  2353. bytes[0] |= ( *codes >> 4) & 0xF;
  2354. bytes[1] = ( *codes << 4) & 0xF0;
  2355. ++codes;
  2356. if (has_W_code)
  2357. {
  2358. bytes[1] |= 0x20;
  2359. }
  2360. if (has_F_code)
  2361. {
  2362. bytes[1] |= 0x40;
  2363. }
  2364. // Rn
  2365. bytes[1] |= regval (&ins->oprs[0],1);
  2366. data = ins->oprs[1].basereg;
  2367. bytes[2] = ((data >> 8) & 0xFF);
  2368. bytes[3] = (data & 0xFF);
  2369. break;
  2370. case 0x27: // SWP Rd, Rm, [Rn]
  2371. ++codes;
  2372. bytes[0] = c;
  2373. bytes[0] |= *codes++;
  2374. bytes[1] = regval (&ins->oprs[2],1);
  2375. if (has_B_code)
  2376. {
  2377. bytes[1] |= 0x40;
  2378. }
  2379. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2380. bytes[3] = *codes++;
  2381. bytes[3] |= regval (&ins->oprs[1],1);
  2382. break;
  2383. default:
  2384. errfunc (ERR_FATAL, "unknown decoding of instruction");
  2385. bytes[0] = c;
  2386. // And a fix nibble
  2387. ++codes;
  2388. bytes[0] |= *codes++;
  2389. if ( *codes == 0x01) // An I bit
  2390. {
  2391. }
  2392. if ( *codes == 0x02) // An I bit
  2393. {
  2394. }
  2395. ++codes;
  2396. }
  2397. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2398. }
  2399. *)
  2400. {$endif dummy}
  2401. constructor tai_thumb_func.create;
  2402. begin
  2403. inherited create;
  2404. typ:=ait_thumb_func;
  2405. end;
  2406. begin
  2407. cai_align:=tai_align;
  2408. end.