aasmcpu.pas 98 KB

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