aasmcpu.pas 99 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160
  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. function is_case_dispatch(hp: taicpu): boolean;
  763. begin
  764. result:=
  765. ((taicpu(hp).opcode in [A_ADD,A_LDR]) and
  766. not(GenerateThumbCode or GenerateThumb2Code) and
  767. (taicpu(hp).oper[0]^.typ=top_reg) and
  768. (taicpu(hp).oper[0]^.reg=NR_PC)) or
  769. ((taicpu(hp).opcode=A_MOV) and (GenerateThumbCode) and
  770. (taicpu(hp).oper[0]^.typ=top_reg) and
  771. (taicpu(hp).oper[0]^.reg=NR_PC)) or
  772. (taicpu(hp).opcode=A_TBH) or
  773. (taicpu(hp).opcode=A_TBB);
  774. end;
  775. var
  776. curinspos,
  777. penalty,
  778. lastinspos,
  779. { increased for every data element > 4 bytes inserted }
  780. currentsize,
  781. extradataoffset,
  782. curop : longint;
  783. curtai,
  784. inserttai : tai;
  785. ai_label : tai_label;
  786. curdatatai,hp,hp2 : tai;
  787. curdata : TAsmList;
  788. l : tasmlabel;
  789. doinsert,
  790. removeref : boolean;
  791. multiplier : byte;
  792. begin
  793. curdata:=TAsmList.create;
  794. lastinspos:=-1;
  795. curinspos:=0;
  796. extradataoffset:=0;
  797. if GenerateThumbCode then
  798. begin
  799. multiplier:=2;
  800. limit:=504;
  801. end
  802. else
  803. begin
  804. limit:=1016;
  805. multiplier:=1;
  806. end;
  807. curtai:=tai(list.first);
  808. doinsert:=false;
  809. while assigned(curtai) do
  810. begin
  811. { instruction? }
  812. case curtai.typ of
  813. ait_instruction:
  814. begin
  815. { walk through all operand of the instruction }
  816. for curop:=0 to taicpu(curtai).ops-1 do
  817. begin
  818. { reference? }
  819. if (taicpu(curtai).oper[curop]^.typ=top_ref) then
  820. begin
  821. { pc relative symbol? }
  822. curdatatai:=tai(taicpu(curtai).oper[curop]^.ref^.symboldata);
  823. if assigned(curdatatai) then
  824. begin
  825. { create a new copy of a data entry on arm thumb if the entry has been inserted already
  826. before because arm thumb does not allow pc relative negative offsets }
  827. if (GenerateThumbCode) and
  828. tai_label(curdatatai).inserted then
  829. begin
  830. current_asmdata.getjumplabel(l);
  831. hp:=tai_label.create(l);
  832. listtoinsert.Concat(hp);
  833. hp2:=tai(curdatatai.Next.GetCopy);
  834. hp2.Next:=nil;
  835. hp2.Previous:=nil;
  836. listtoinsert.Concat(hp2);
  837. taicpu(curtai).oper[curop]^.ref^.symboldata:=hp;
  838. taicpu(curtai).oper[curop]^.ref^.symbol:=l;
  839. curdatatai:=hp;
  840. end;
  841. { move only if we're at the first reference of a label }
  842. if not(tai_label(curdatatai).moved) then
  843. begin
  844. tai_label(curdatatai).moved:=true;
  845. { check if symbol already used. }
  846. { if yes, reuse the symbol }
  847. hp:=tai(curdatatai.next);
  848. removeref:=false;
  849. if assigned(hp) then
  850. begin
  851. case hp.typ of
  852. ait_const:
  853. begin
  854. if (tai_const(hp).consttype=aitconst_64bit) then
  855. inc(extradataoffset,multiplier);
  856. end;
  857. ait_comp_64bit,
  858. ait_real_64bit:
  859. begin
  860. inc(extradataoffset,multiplier);
  861. end;
  862. ait_real_80bit:
  863. begin
  864. inc(extradataoffset,2*multiplier);
  865. end;
  866. end;
  867. { check if the same constant has been already inserted into the currently handled list,
  868. if yes, reuse it }
  869. if (hp.typ=ait_const) then
  870. begin
  871. hp2:=tai(curdata.first);
  872. while assigned(hp2) do
  873. begin
  874. if (hp2.typ=ait_const) and (tai_const(hp2).sym=tai_const(hp).sym)
  875. and (tai_const(hp2).value=tai_const(hp).value) and (tai(hp2.previous).typ=ait_label)
  876. then
  877. begin
  878. with taicpu(curtai).oper[curop]^.ref^ do
  879. begin
  880. symboldata:=hp2.previous;
  881. symbol:=tai_label(hp2.previous).labsym;
  882. end;
  883. removeref:=true;
  884. break;
  885. end;
  886. hp2:=tai(hp2.next);
  887. end;
  888. end;
  889. end;
  890. { move or remove symbol reference }
  891. repeat
  892. hp:=tai(curdatatai.next);
  893. listtoinsert.remove(curdatatai);
  894. if removeref then
  895. curdatatai.free
  896. else
  897. curdata.concat(curdatatai);
  898. curdatatai:=hp;
  899. until (curdatatai=nil) or (curdatatai.typ=ait_label);
  900. if lastinspos=-1 then
  901. lastinspos:=curinspos;
  902. end;
  903. end;
  904. end;
  905. end;
  906. inc(curinspos,multiplier);
  907. end;
  908. ait_align:
  909. begin
  910. { code is always 4 byte aligned, so we don't have to take care of .align 2 which would
  911. requires also incrementing curinspos by 1 }
  912. inc(curinspos,(tai_align(curtai).aligntype div 4)*multiplier);
  913. end;
  914. ait_const:
  915. begin
  916. inc(curinspos,multiplier);
  917. if (tai_const(curtai).consttype=aitconst_64bit) then
  918. inc(curinspos,multiplier);
  919. end;
  920. ait_real_32bit:
  921. begin
  922. inc(curinspos,multiplier);
  923. end;
  924. ait_comp_64bit,
  925. ait_real_64bit:
  926. begin
  927. inc(curinspos,2*multiplier);
  928. end;
  929. ait_real_80bit:
  930. begin
  931. inc(curinspos,3*multiplier);
  932. end;
  933. end;
  934. { special case for case jump tables }
  935. penalty:=0;
  936. if SimpleGetNextInstruction(curtai,hp) and
  937. (tai(hp).typ=ait_instruction) then
  938. begin
  939. case taicpu(hp).opcode of
  940. A_MOV,
  941. A_LDR,
  942. A_ADD,
  943. A_TBH,
  944. A_TBB:
  945. { approximation if we hit a case jump table }
  946. if is_case_dispatch(taicpu(hp)) then
  947. begin
  948. penalty:=multiplier;
  949. hp:=tai(hp.next);
  950. { skip register allocations and comments inserted by the optimizer as well as a label
  951. as jump tables for thumb might have }
  952. while assigned(hp) and (hp.typ in [ait_comment,ait_regalloc,ait_label]) do
  953. hp:=tai(hp.next);
  954. while assigned(hp) and (hp.typ=ait_const) do
  955. begin
  956. inc(penalty,multiplier);
  957. hp:=tai(hp.next);
  958. end;
  959. end;
  960. A_IT:
  961. begin
  962. if GenerateThumb2Code then
  963. penalty:=multiplier;
  964. { check if the next instruction fits as well
  965. or if we splitted after the it so split before }
  966. CheckLimit(hp,1);
  967. end;
  968. A_ITE,
  969. A_ITT:
  970. begin
  971. if GenerateThumb2Code then
  972. penalty:=2*multiplier;
  973. { check if the next two instructions fit as well
  974. or if we splitted them so split before }
  975. CheckLimit(hp,2);
  976. end;
  977. A_ITEE,
  978. A_ITTE,
  979. A_ITET,
  980. A_ITTT:
  981. begin
  982. if GenerateThumb2Code then
  983. penalty:=3*multiplier;
  984. { check if the next three instructions fit as well
  985. or if we splitted them so split before }
  986. CheckLimit(hp,3);
  987. end;
  988. A_ITEEE,
  989. A_ITTEE,
  990. A_ITETE,
  991. A_ITTTE,
  992. A_ITEET,
  993. A_ITTET,
  994. A_ITETT,
  995. A_ITTTT:
  996. begin
  997. if GenerateThumb2Code then
  998. penalty:=4*multiplier;
  999. { check if the next three instructions fit as well
  1000. or if we splitted them so split before }
  1001. CheckLimit(hp,4);
  1002. end;
  1003. end;
  1004. end;
  1005. CheckLimit(curtai,1);
  1006. { don't miss an insert }
  1007. doinsert:=doinsert or
  1008. (not(curdata.empty) and
  1009. (curinspos-lastinspos+penalty+extradataoffset>limit));
  1010. { split only at real instructions else the test below fails }
  1011. if doinsert and (curtai.typ=ait_instruction) and
  1012. (
  1013. { don't split loads of pc to lr and the following move }
  1014. not(
  1015. (taicpu(curtai).opcode=A_MOV) and
  1016. (taicpu(curtai).oper[0]^.typ=top_reg) and
  1017. (taicpu(curtai).oper[0]^.reg=NR_R14) and
  1018. (taicpu(curtai).oper[1]^.typ=top_reg) and
  1019. (taicpu(curtai).oper[1]^.reg=NR_PC)
  1020. )
  1021. ) and
  1022. (
  1023. { do not insert data after a B instruction due to their limited range }
  1024. not((GenerateThumbCode) and
  1025. (taicpu(curtai).opcode=A_B)
  1026. )
  1027. ) then
  1028. begin
  1029. lastinspos:=-1;
  1030. extradataoffset:=0;
  1031. if GenerateThumbCode then
  1032. limit:=502
  1033. else
  1034. limit:=1016;
  1035. { if this is an add/tbh/tbb-based jumptable, go back to the
  1036. previous instruction, because inserting data between the
  1037. dispatch instruction and the table would mess up the
  1038. addresses }
  1039. inserttai:=curtai;
  1040. if is_case_dispatch(taicpu(inserttai)) and
  1041. ((taicpu(inserttai).opcode=A_ADD) or
  1042. (taicpu(inserttai).opcode=A_TBH) or
  1043. (taicpu(inserttai).opcode=A_TBB)) then
  1044. begin
  1045. repeat
  1046. inserttai:=tai(inserttai.previous);
  1047. until inserttai.typ=ait_instruction;
  1048. { if it's an add-based jump table, then also skip the
  1049. pc-relative load }
  1050. if taicpu(curtai).opcode=A_ADD then
  1051. repeat
  1052. inserttai:=tai(inserttai.previous);
  1053. until inserttai.typ=ait_instruction;
  1054. end
  1055. else
  1056. { on arm thumb, insert the data always after all labels etc. following an instruction so it
  1057. is prevent that a bxx yyy; bl xxx; yyyy: sequence gets separated ( we never insert on arm thumb after
  1058. bxx) and the distance of bxx gets too long }
  1059. if GenerateThumbCode then
  1060. while assigned(tai(inserttai.Next)) and (tai(inserttai.Next).typ in SkipInstr+[ait_label]) do
  1061. inserttai:=tai(inserttai.next);
  1062. doinsert:=false;
  1063. current_asmdata.getjumplabel(l);
  1064. { align jump in thumb .text section to 4 bytes }
  1065. if not(curdata.empty) and (GenerateThumbCode) then
  1066. curdata.Insert(tai_align.Create(4));
  1067. curdata.insert(taicpu.op_sym(A_B,l));
  1068. curdata.concat(tai_label.create(l));
  1069. { mark all labels as inserted, arm thumb
  1070. needs this, so data referencing an already inserted label can be
  1071. duplicated because arm thumb does not allow negative pc relative offset }
  1072. hp2:=tai(curdata.first);
  1073. while assigned(hp2) do
  1074. begin
  1075. if hp2.typ=ait_label then
  1076. tai_label(hp2).inserted:=true;
  1077. hp2:=tai(hp2.next);
  1078. end;
  1079. { continue with the last inserted label because we use later
  1080. on SimpleGetNextInstruction, so if we used curtai.next (which
  1081. is then equal curdata.last.previous) we could over see one
  1082. instruction }
  1083. hp:=tai(curdata.Last);
  1084. list.insertlistafter(inserttai,curdata);
  1085. curtai:=hp;
  1086. end
  1087. else
  1088. curtai:=tai(curtai.next);
  1089. end;
  1090. { align jump in thumb .text section to 4 bytes }
  1091. if not(curdata.empty) and (GenerateThumbCode or GenerateThumb2Code) then
  1092. curdata.Insert(tai_align.Create(4));
  1093. list.concatlist(curdata);
  1094. curdata.free;
  1095. end;
  1096. procedure ensurethumb2encodings(list: TAsmList);
  1097. var
  1098. curtai: tai;
  1099. op2reg: TRegister;
  1100. begin
  1101. { Do Thumb-2 16bit -> 32bit transformations }
  1102. curtai:=tai(list.first);
  1103. while assigned(curtai) do
  1104. begin
  1105. case curtai.typ of
  1106. ait_instruction:
  1107. begin
  1108. case taicpu(curtai).opcode of
  1109. A_ADD:
  1110. begin
  1111. { Set wide flag for ADD Rd,Rn,Rm where registers are over R7(high register set) }
  1112. if taicpu(curtai).ops = 3 then
  1113. begin
  1114. if taicpu(curtai).oper[2]^.typ in [top_reg,top_shifterop] then
  1115. begin
  1116. if taicpu(curtai).oper[2]^.typ = top_reg then
  1117. op2reg := taicpu(curtai).oper[2]^.reg
  1118. else if taicpu(curtai).oper[2]^.shifterop^.rs <> NR_NO then
  1119. op2reg := taicpu(curtai).oper[2]^.shifterop^.rs
  1120. else
  1121. op2reg := NR_NO;
  1122. if op2reg <> NR_NO then
  1123. begin
  1124. if (taicpu(curtai).oper[0]^.reg >= NR_R8) or
  1125. (taicpu(curtai).oper[1]^.reg >= NR_R8) or
  1126. (op2reg >= NR_R8) then
  1127. begin
  1128. taicpu(curtai).wideformat:=true;
  1129. { Handle special cases where register rules are violated by optimizer/user }
  1130. { if d == 13 || (d == 15 && S == ‘0’) || n == 15 || m IN [13,15] then UNPREDICTABLE; }
  1131. { Transform ADD.W Rx, Ry, R13 into ADD.W Rx, R13, Ry }
  1132. if (op2reg = NR_R13) and (taicpu(curtai).oper[2]^.typ = top_reg) then
  1133. begin
  1134. taicpu(curtai).oper[2]^.reg := taicpu(curtai).oper[1]^.reg;
  1135. taicpu(curtai).oper[1]^.reg := op2reg;
  1136. end;
  1137. end;
  1138. end;
  1139. end;
  1140. end;
  1141. end;
  1142. end;
  1143. end;
  1144. end;
  1145. curtai:=tai(curtai.Next);
  1146. end;
  1147. end;
  1148. function getMergedInstruction(FirstOp,LastOp:TAsmOp;InvertLast:boolean) : TAsmOp;
  1149. const
  1150. opTable: array[A_IT..A_ITTTT] of string =
  1151. ('T','TE','TT','TEE','TTE','TET','TTT',
  1152. 'TEEE','TTEE','TETE','TTTE',
  1153. 'TEET','TTET','TETT','TTTT');
  1154. invertedOpTable: array[A_IT..A_ITTTT] of string =
  1155. ('E','ET','EE','ETT','EET','ETE','EEE',
  1156. 'ETTT','EETT','ETET','EEET',
  1157. 'ETTE','EETE','ETEE','EEEE');
  1158. var
  1159. resStr : string;
  1160. i : TAsmOp;
  1161. begin
  1162. if InvertLast then
  1163. resStr := opTable[FirstOp]+invertedOpTable[LastOp]
  1164. else
  1165. resStr := opTable[FirstOp]+opTable[LastOp];
  1166. if length(resStr) > 4 then
  1167. internalerror(2012100805);
  1168. for i := low(opTable) to high(opTable) do
  1169. if opTable[i] = resStr then
  1170. exit(i);
  1171. internalerror(2012100806);
  1172. end;
  1173. procedure foldITInstructions(list: TAsmList);
  1174. var
  1175. curtai,hp1 : tai;
  1176. levels,i : LongInt;
  1177. begin
  1178. curtai:=tai(list.First);
  1179. while assigned(curtai) do
  1180. begin
  1181. case curtai.typ of
  1182. ait_instruction:
  1183. if IsIT(taicpu(curtai).opcode) then
  1184. begin
  1185. levels := GetITLevels(taicpu(curtai).opcode);
  1186. if levels < 4 then
  1187. begin
  1188. i:=levels;
  1189. hp1:=tai(curtai.Next);
  1190. while assigned(hp1) and
  1191. (i > 0) do
  1192. begin
  1193. if hp1.typ=ait_instruction then
  1194. begin
  1195. dec(i);
  1196. if (i = 0) and
  1197. mustbelast(hp1) then
  1198. begin
  1199. hp1:=nil;
  1200. break;
  1201. end;
  1202. end;
  1203. hp1:=tai(hp1.Next);
  1204. end;
  1205. if assigned(hp1) then
  1206. begin
  1207. // We are pointing at the first instruction after the IT block
  1208. while assigned(hp1) and
  1209. (hp1.typ<>ait_instruction) do
  1210. hp1:=tai(hp1.Next);
  1211. if assigned(hp1) and
  1212. (hp1.typ=ait_instruction) and
  1213. IsIT(taicpu(hp1).opcode) then
  1214. begin
  1215. if (levels+GetITLevels(taicpu(hp1).opcode) <= 4) and
  1216. ((taicpu(curtai).oper[0]^.cc=taicpu(hp1).oper[0]^.cc) or
  1217. (taicpu(curtai).oper[0]^.cc=inverse_cond(taicpu(hp1).oper[0]^.cc))) then
  1218. begin
  1219. taicpu(curtai).opcode:=getMergedInstruction(taicpu(curtai).opcode,
  1220. taicpu(hp1).opcode,
  1221. taicpu(curtai).oper[0]^.cc=inverse_cond(taicpu(hp1).oper[0]^.cc));
  1222. list.Remove(hp1);
  1223. hp1.Free;
  1224. end;
  1225. end;
  1226. end;
  1227. end;
  1228. end;
  1229. end;
  1230. curtai:=tai(curtai.Next);
  1231. end;
  1232. end;
  1233. procedure finalizearmcode(list, listtoinsert: TAsmList);
  1234. begin
  1235. { Do Thumb-2 16bit -> 32bit transformations }
  1236. if GenerateThumb2Code then
  1237. begin
  1238. ensurethumb2encodings(list);
  1239. foldITInstructions(list);
  1240. end;
  1241. insertpcrelativedata(list, listtoinsert);
  1242. end;
  1243. procedure InsertPData;
  1244. var
  1245. prolog: TAsmList;
  1246. begin
  1247. prolog:=TAsmList.create;
  1248. new_section(prolog,sec_code,'FPC_EH_PROLOG',sizeof(pint),secorder_begin);
  1249. prolog.concat(Tai_const.Createname('_ARM_ExceptionHandler', 0));
  1250. prolog.concat(Tai_const.Create_32bit(0));
  1251. prolog.concat(Tai_symbol.Createname_global('FPC_EH_CODE_START',AT_DATA,0));
  1252. { dummy function }
  1253. prolog.concat(taicpu.op_reg_reg(A_MOV,NR_R15,NR_R14));
  1254. current_asmdata.asmlists[al_start].insertList(prolog);
  1255. prolog.Free;
  1256. new_section(current_asmdata.asmlists[al_end],sec_pdata,'',sizeof(pint));
  1257. current_asmdata.asmlists[al_end].concat(Tai_const.Createname('FPC_EH_CODE_START', 0));
  1258. current_asmdata.asmlists[al_end].concat(Tai_const.Create_32bit(longint($ffffff01)));
  1259. end;
  1260. (*
  1261. Floating point instruction format information, taken from the linux kernel
  1262. ARM Floating Point Instruction Classes
  1263. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  1264. |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
  1265. |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)
  1266. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  1267. |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
  1268. |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
  1269. |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
  1270. | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
  1271. CPDT data transfer instructions
  1272. LDF, STF, LFM (copro 2), SFM (copro 2)
  1273. CPDO dyadic arithmetic instructions
  1274. ADF, MUF, SUF, RSF, DVF, RDF,
  1275. POW, RPW, RMF, FML, FDV, FRD, POL
  1276. CPDO monadic arithmetic instructions
  1277. MVF, MNF, ABS, RND, SQT, LOG, LGN, EXP,
  1278. SIN, COS, TAN, ASN, ACS, ATN, URD, NRM
  1279. CPRT joint arithmetic/data transfer instructions
  1280. FIX (arithmetic followed by load/store)
  1281. FLT (load/store followed by arithmetic)
  1282. CMF, CNF CMFE, CNFE (comparisons)
  1283. WFS, RFS (write/read floating point status register)
  1284. WFC, RFC (write/read floating point control register)
  1285. cond condition codes
  1286. P pre/post index bit: 0 = postindex, 1 = preindex
  1287. U up/down bit: 0 = stack grows down, 1 = stack grows up
  1288. W write back bit: 1 = update base register (Rn)
  1289. L load/store bit: 0 = store, 1 = load
  1290. Rn base register
  1291. Rd destination/source register
  1292. Fd floating point destination register
  1293. Fn floating point source register
  1294. Fm floating point source register or floating point constant
  1295. uv transfer length (TABLE 1)
  1296. wx register count (TABLE 2)
  1297. abcd arithmetic opcode (TABLES 3 & 4)
  1298. ef destination size (rounding precision) (TABLE 5)
  1299. gh rounding mode (TABLE 6)
  1300. j dyadic/monadic bit: 0 = dyadic, 1 = monadic
  1301. i constant bit: 1 = constant (TABLE 6)
  1302. */
  1303. /*
  1304. TABLE 1
  1305. +-------------------------+---+---+---------+---------+
  1306. | Precision | u | v | FPSR.EP | length |
  1307. +-------------------------+---+---+---------+---------+
  1308. | Single | 0 | 0 | x | 1 words |
  1309. | Double | 1 | 1 | x | 2 words |
  1310. | Extended | 1 | 1 | x | 3 words |
  1311. | Packed decimal | 1 | 1 | 0 | 3 words |
  1312. | Expanded packed decimal | 1 | 1 | 1 | 4 words |
  1313. +-------------------------+---+---+---------+---------+
  1314. Note: x = don't care
  1315. */
  1316. /*
  1317. TABLE 2
  1318. +---+---+---------------------------------+
  1319. | w | x | Number of registers to transfer |
  1320. +---+---+---------------------------------+
  1321. | 0 | 1 | 1 |
  1322. | 1 | 0 | 2 |
  1323. | 1 | 1 | 3 |
  1324. | 0 | 0 | 4 |
  1325. +---+---+---------------------------------+
  1326. */
  1327. /*
  1328. TABLE 3: Dyadic Floating Point Opcodes
  1329. +---+---+---+---+----------+-----------------------+-----------------------+
  1330. | a | b | c | d | Mnemonic | Description | Operation |
  1331. +---+---+---+---+----------+-----------------------+-----------------------+
  1332. | 0 | 0 | 0 | 0 | ADF | Add | Fd := Fn + Fm |
  1333. | 0 | 0 | 0 | 1 | MUF | Multiply | Fd := Fn * Fm |
  1334. | 0 | 0 | 1 | 0 | SUF | Subtract | Fd := Fn - Fm |
  1335. | 0 | 0 | 1 | 1 | RSF | Reverse subtract | Fd := Fm - Fn |
  1336. | 0 | 1 | 0 | 0 | DVF | Divide | Fd := Fn / Fm |
  1337. | 0 | 1 | 0 | 1 | RDF | Reverse divide | Fd := Fm / Fn |
  1338. | 0 | 1 | 1 | 0 | POW | Power | Fd := Fn ^ Fm |
  1339. | 0 | 1 | 1 | 1 | RPW | Reverse power | Fd := Fm ^ Fn |
  1340. | 1 | 0 | 0 | 0 | RMF | Remainder | Fd := IEEE rem(Fn/Fm) |
  1341. | 1 | 0 | 0 | 1 | FML | Fast Multiply | Fd := Fn * Fm |
  1342. | 1 | 0 | 1 | 0 | FDV | Fast Divide | Fd := Fn / Fm |
  1343. | 1 | 0 | 1 | 1 | FRD | Fast reverse divide | Fd := Fm / Fn |
  1344. | 1 | 1 | 0 | 0 | POL | Polar angle (ArcTan2) | Fd := arctan2(Fn,Fm) |
  1345. | 1 | 1 | 0 | 1 | | undefined instruction | trap |
  1346. | 1 | 1 | 1 | 0 | | undefined instruction | trap |
  1347. | 1 | 1 | 1 | 1 | | undefined instruction | trap |
  1348. +---+---+---+---+----------+-----------------------+-----------------------+
  1349. Note: POW, RPW, POL are deprecated, and are available for backwards
  1350. compatibility only.
  1351. */
  1352. /*
  1353. TABLE 4: Monadic Floating Point Opcodes
  1354. +---+---+---+---+----------+-----------------------+-----------------------+
  1355. | a | b | c | d | Mnemonic | Description | Operation |
  1356. +---+---+---+---+----------+-----------------------+-----------------------+
  1357. | 0 | 0 | 0 | 0 | MVF | Move | Fd := Fm |
  1358. | 0 | 0 | 0 | 1 | MNF | Move negated | Fd := - Fm |
  1359. | 0 | 0 | 1 | 0 | ABS | Absolute value | Fd := abs(Fm) |
  1360. | 0 | 0 | 1 | 1 | RND | Round to integer | Fd := int(Fm) |
  1361. | 0 | 1 | 0 | 0 | SQT | Square root | Fd := sqrt(Fm) |
  1362. | 0 | 1 | 0 | 1 | LOG | Log base 10 | Fd := log10(Fm) |
  1363. | 0 | 1 | 1 | 0 | LGN | Log base e | Fd := ln(Fm) |
  1364. | 0 | 1 | 1 | 1 | EXP | Exponent | Fd := e ^ Fm |
  1365. | 1 | 0 | 0 | 0 | SIN | Sine | Fd := sin(Fm) |
  1366. | 1 | 0 | 0 | 1 | COS | Cosine | Fd := cos(Fm) |
  1367. | 1 | 0 | 1 | 0 | TAN | Tangent | Fd := tan(Fm) |
  1368. | 1 | 0 | 1 | 1 | ASN | Arc Sine | Fd := arcsin(Fm) |
  1369. | 1 | 1 | 0 | 0 | ACS | Arc Cosine | Fd := arccos(Fm) |
  1370. | 1 | 1 | 0 | 1 | ATN | Arc Tangent | Fd := arctan(Fm) |
  1371. | 1 | 1 | 1 | 0 | URD | Unnormalized round | Fd := int(Fm) |
  1372. | 1 | 1 | 1 | 1 | NRM | Normalize | Fd := norm(Fm) |
  1373. +---+---+---+---+----------+-----------------------+-----------------------+
  1374. Note: LOG, LGN, EXP, SIN, COS, TAN, ASN, ACS, ATN are deprecated, and are
  1375. available for backwards compatibility only.
  1376. */
  1377. /*
  1378. TABLE 5
  1379. +-------------------------+---+---+
  1380. | Rounding Precision | e | f |
  1381. +-------------------------+---+---+
  1382. | IEEE Single precision | 0 | 0 |
  1383. | IEEE Double precision | 0 | 1 |
  1384. | IEEE Extended precision | 1 | 0 |
  1385. | undefined (trap) | 1 | 1 |
  1386. +-------------------------+---+---+
  1387. */
  1388. /*
  1389. TABLE 5
  1390. +---------------------------------+---+---+
  1391. | Rounding Mode | g | h |
  1392. +---------------------------------+---+---+
  1393. | Round to nearest (default) | 0 | 0 |
  1394. | Round toward plus infinity | 0 | 1 |
  1395. | Round toward negative infinity | 1 | 0 |
  1396. | Round toward zero | 1 | 1 |
  1397. +---------------------------------+---+---+
  1398. *)
  1399. function taicpu.GetString:string;
  1400. var
  1401. i : longint;
  1402. s : string;
  1403. addsize : boolean;
  1404. begin
  1405. s:='['+gas_op2str[opcode];
  1406. for i:=0 to ops-1 do
  1407. begin
  1408. with oper[i]^ do
  1409. begin
  1410. if i=0 then
  1411. s:=s+' '
  1412. else
  1413. s:=s+',';
  1414. { type }
  1415. addsize:=false;
  1416. if (ot and OT_VREG)=OT_VREG then
  1417. s:=s+'vreg'
  1418. else
  1419. if (ot and OT_FPUREG)=OT_FPUREG then
  1420. s:=s+'fpureg'
  1421. else
  1422. if (ot and OT_REGISTER)=OT_REGISTER then
  1423. begin
  1424. s:=s+'reg';
  1425. addsize:=true;
  1426. end
  1427. else
  1428. if (ot and OT_REGLIST)=OT_REGLIST then
  1429. begin
  1430. s:=s+'reglist';
  1431. addsize:=false;
  1432. end
  1433. else
  1434. if (ot and OT_IMMEDIATE)=OT_IMMEDIATE then
  1435. begin
  1436. s:=s+'imm';
  1437. addsize:=true;
  1438. end
  1439. else
  1440. if (ot and OT_MEMORY)=OT_MEMORY then
  1441. begin
  1442. s:=s+'mem';
  1443. addsize:=true;
  1444. if (ot and OT_AM2)<>0 then
  1445. s:=s+' am2 ';
  1446. end
  1447. else
  1448. s:=s+'???';
  1449. { size }
  1450. if addsize then
  1451. begin
  1452. if (ot and OT_BITS8)<>0 then
  1453. s:=s+'8'
  1454. else
  1455. if (ot and OT_BITS16)<>0 then
  1456. s:=s+'24'
  1457. else
  1458. if (ot and OT_BITS32)<>0 then
  1459. s:=s+'32'
  1460. else
  1461. if (ot and OT_BITSSHIFTER)<>0 then
  1462. s:=s+'shifter'
  1463. else
  1464. s:=s+'??';
  1465. { signed }
  1466. if (ot and OT_SIGNED)<>0 then
  1467. s:=s+'s';
  1468. end;
  1469. end;
  1470. end;
  1471. GetString:=s+']';
  1472. end;
  1473. procedure taicpu.ResetPass1;
  1474. begin
  1475. { we need to reset everything here, because the choosen insentry
  1476. can be invalid for a new situation where the previously optimized
  1477. insentry is not correct }
  1478. InsEntry:=nil;
  1479. InsSize:=0;
  1480. LastInsOffset:=-1;
  1481. end;
  1482. procedure taicpu.ResetPass2;
  1483. begin
  1484. { we are here in a second pass, check if the instruction can be optimized }
  1485. if assigned(InsEntry) and
  1486. ((InsEntry^.flags and IF_PASS2)<>0) then
  1487. begin
  1488. InsEntry:=nil;
  1489. InsSize:=0;
  1490. end;
  1491. LastInsOffset:=-1;
  1492. end;
  1493. function taicpu.CheckIfValid:boolean;
  1494. begin
  1495. Result:=False; { unimplemented }
  1496. end;
  1497. function taicpu.Pass1(objdata:TObjData):longint;
  1498. var
  1499. ldr2op : array[PF_B..PF_T] of tasmop = (
  1500. A_LDRB,A_LDRSB,A_LDRBT,A_LDRH,A_LDRSH,A_LDRT);
  1501. str2op : array[PF_B..PF_T] of tasmop = (
  1502. A_STRB,A_None,A_STRBT,A_STRH,A_None,A_STRT);
  1503. begin
  1504. Pass1:=0;
  1505. { Save the old offset and set the new offset }
  1506. InsOffset:=ObjData.CurrObjSec.Size;
  1507. { Error? }
  1508. if (Insentry=nil) and (InsSize=-1) then
  1509. exit;
  1510. { set the file postion }
  1511. current_filepos:=fileinfo;
  1512. { tranlate LDR+postfix to complete opcode }
  1513. if (opcode=A_LDR) and (oppostfix<>PF_None) then
  1514. begin
  1515. if (oppostfix in [low(ldr2op)..high(ldr2op)]) then
  1516. opcode:=ldr2op[oppostfix]
  1517. else
  1518. internalerror(2005091001);
  1519. if opcode=A_None then
  1520. internalerror(2005091004);
  1521. { postfix has been added to opcode }
  1522. oppostfix:=PF_None;
  1523. end
  1524. else if (opcode=A_STR) and (oppostfix<>PF_None) then
  1525. begin
  1526. if (oppostfix in [low(str2op)..high(str2op)]) then
  1527. opcode:=str2op[oppostfix]
  1528. else
  1529. internalerror(2005091002);
  1530. if opcode=A_None then
  1531. internalerror(2005091003);
  1532. { postfix has been added to opcode }
  1533. oppostfix:=PF_None;
  1534. end;
  1535. { Get InsEntry }
  1536. if FindInsEntry(objdata) then
  1537. begin
  1538. InsSize:=4;
  1539. LastInsOffset:=InsOffset;
  1540. Pass1:=InsSize;
  1541. exit;
  1542. end;
  1543. LastInsOffset:=-1;
  1544. end;
  1545. procedure taicpu.Pass2(objdata:TObjData);
  1546. begin
  1547. { error in pass1 ? }
  1548. if insentry=nil then
  1549. exit;
  1550. current_filepos:=fileinfo;
  1551. { Generate the instruction }
  1552. GenCode(objdata);
  1553. end;
  1554. procedure taicpu.ppuloadoper(ppufile:tcompilerppufile;var o:toper);
  1555. begin
  1556. end;
  1557. procedure taicpu.ppuwriteoper(ppufile:tcompilerppufile;const o:toper);
  1558. begin
  1559. end;
  1560. procedure taicpu.ppubuildderefimploper(var o:toper);
  1561. begin
  1562. end;
  1563. procedure taicpu.ppuderefoper(var o:toper);
  1564. begin
  1565. end;
  1566. function taicpu.InsEnd:longint;
  1567. begin
  1568. Result:=0; { unimplemented }
  1569. end;
  1570. procedure taicpu.create_ot(objdata:TObjData);
  1571. var
  1572. i,l,relsize : longint;
  1573. dummy : byte;
  1574. currsym : TObjSymbol;
  1575. begin
  1576. if ops=0 then
  1577. exit;
  1578. { update oper[].ot field }
  1579. for i:=0 to ops-1 do
  1580. with oper[i]^ do
  1581. begin
  1582. case typ of
  1583. top_regset:
  1584. begin
  1585. ot:=OT_REGLIST;
  1586. end;
  1587. top_reg :
  1588. begin
  1589. case getregtype(reg) of
  1590. R_INTREGISTER:
  1591. ot:=OT_REG32 or OT_SHIFTEROP;
  1592. R_FPUREGISTER:
  1593. ot:=OT_FPUREG;
  1594. else
  1595. internalerror(2005090901);
  1596. end;
  1597. end;
  1598. top_ref :
  1599. begin
  1600. if ref^.refaddr=addr_no then
  1601. begin
  1602. { create ot field }
  1603. { we should get the size here dependend on the
  1604. instruction }
  1605. if (ot and OT_SIZE_MASK)=0 then
  1606. ot:=OT_MEMORY or OT_BITS32
  1607. else
  1608. ot:=OT_MEMORY or (ot and OT_SIZE_MASK);
  1609. if (ref^.base=NR_NO) and (ref^.index=NR_NO) then
  1610. ot:=ot or OT_MEM_OFFS;
  1611. { if we need to fix a reference, we do it here }
  1612. { pc relative addressing }
  1613. if (ref^.base=NR_NO) and
  1614. (ref^.index=NR_NO) and
  1615. (ref^.shiftmode=SM_None)
  1616. { at least we should check if the destination symbol
  1617. is in a text section }
  1618. { and
  1619. (ref^.symbol^.owner="text") } then
  1620. ref^.base:=NR_PC;
  1621. { determine possible address modes }
  1622. if (ref^.base<>NR_NO) and
  1623. (
  1624. (
  1625. (ref^.index=NR_NO) and
  1626. (ref^.shiftmode=SM_None) and
  1627. (ref^.offset>=-4097) and
  1628. (ref^.offset<=4097)
  1629. ) or
  1630. (
  1631. (ref^.shiftmode=SM_None) and
  1632. (ref^.offset=0)
  1633. ) or
  1634. (
  1635. (ref^.index<>NR_NO) and
  1636. (ref^.shiftmode<>SM_None) and
  1637. (ref^.shiftimm<=31) and
  1638. (ref^.offset=0)
  1639. )
  1640. ) then
  1641. ot:=ot or OT_AM2;
  1642. if (ref^.index<>NR_NO) and
  1643. (oppostfix in [PF_IA,PF_IB,PF_DA,PF_DB,PF_FD,PF_FA,PF_ED,PF_EA]) and
  1644. (
  1645. (ref^.base=NR_NO) and
  1646. (ref^.shiftmode=SM_None) and
  1647. (ref^.offset=0)
  1648. ) then
  1649. ot:=ot or OT_AM4;
  1650. end
  1651. else
  1652. begin
  1653. l:=ref^.offset;
  1654. currsym:=ObjData.symbolref(ref^.symbol);
  1655. if assigned(currsym) then
  1656. inc(l,currsym.address);
  1657. relsize:=(InsOffset+2)-l;
  1658. if (relsize<-33554428) or (relsize>33554428) then
  1659. ot:=OT_IMM32
  1660. else
  1661. ot:=OT_IMM24;
  1662. end;
  1663. end;
  1664. top_local :
  1665. begin
  1666. { we should get the size here dependend on the
  1667. instruction }
  1668. if (ot and OT_SIZE_MASK)=0 then
  1669. ot:=OT_MEMORY or OT_BITS32
  1670. else
  1671. ot:=OT_MEMORY or (ot and OT_SIZE_MASK);
  1672. end;
  1673. top_const :
  1674. begin
  1675. ot:=OT_IMMEDIATE;
  1676. if is_shifter_const(val,dummy) then
  1677. ot:=OT_IMMSHIFTER
  1678. else
  1679. ot:=OT_IMM32
  1680. end;
  1681. top_none :
  1682. begin
  1683. { generated when there was an error in the
  1684. assembler reader. It never happends when generating
  1685. assembler }
  1686. end;
  1687. top_shifterop:
  1688. begin
  1689. ot:=OT_SHIFTEROP;
  1690. end;
  1691. else
  1692. internalerror(2004022623);
  1693. end;
  1694. end;
  1695. end;
  1696. function taicpu.Matches(p:PInsEntry):longint;
  1697. { * IF_SM stands for Size Match: any operand whose size is not
  1698. * explicitly specified by the template is `really' intended to be
  1699. * the same size as the first size-specified operand.
  1700. * Non-specification is tolerated in the input instruction, but
  1701. * _wrong_ specification is not.
  1702. *
  1703. * IF_SM2 invokes Size Match on only the first _two_ operands, for
  1704. * three-operand instructions such as SHLD: it implies that the
  1705. * first two operands must match in size, but that the third is
  1706. * required to be _unspecified_.
  1707. *
  1708. * IF_SB invokes Size Byte: operands with unspecified size in the
  1709. * template are really bytes, and so no non-byte specification in
  1710. * the input instruction will be tolerated. IF_SW similarly invokes
  1711. * Size Word, and IF_SD invokes Size Doubleword.
  1712. *
  1713. * (The default state if neither IF_SM nor IF_SM2 is specified is
  1714. * that any operand with unspecified size in the template is
  1715. * required to have unspecified size in the instruction too...)
  1716. }
  1717. var
  1718. i{,j,asize,oprs} : longint;
  1719. {siz : array[0..3] of longint;}
  1720. begin
  1721. Matches:=100;
  1722. writeln(getstring,'---');
  1723. { Check the opcode and operands }
  1724. if (p^.opcode<>opcode) or (p^.ops<>ops) then
  1725. begin
  1726. Matches:=0;
  1727. exit;
  1728. end;
  1729. { Check that no spurious colons or TOs are present }
  1730. for i:=0 to p^.ops-1 do
  1731. if (oper[i]^.ot and (not p^.optypes[i]) and (OT_COLON or OT_TO))<>0 then
  1732. begin
  1733. Matches:=0;
  1734. exit;
  1735. end;
  1736. { Check that the operand flags all match up }
  1737. for i:=0 to p^.ops-1 do
  1738. begin
  1739. if ((p^.optypes[i] and (not oper[i]^.ot)) or
  1740. ((p^.optypes[i] and OT_SIZE_MASK) and
  1741. ((p^.optypes[i] xor oper[i]^.ot) and OT_SIZE_MASK)))<>0 then
  1742. begin
  1743. if ((p^.optypes[i] and (not oper[i]^.ot) and OT_NON_SIZE) or
  1744. (oper[i]^.ot and OT_SIZE_MASK))<>0 then
  1745. begin
  1746. Matches:=0;
  1747. exit;
  1748. end
  1749. else
  1750. Matches:=1;
  1751. end;
  1752. end;
  1753. { check postfixes:
  1754. the existance of a certain postfix requires a
  1755. particular code }
  1756. { update condition flags
  1757. or floating point single }
  1758. if (oppostfix=PF_S) and
  1759. not(p^.code[0] in [#$04]) then
  1760. begin
  1761. Matches:=0;
  1762. exit;
  1763. end;
  1764. { floating point size }
  1765. if (oppostfix in [PF_D,PF_E,PF_P,PF_EP]) and
  1766. not(p^.code[0] in []) then
  1767. begin
  1768. Matches:=0;
  1769. exit;
  1770. end;
  1771. { multiple load/store address modes }
  1772. if (oppostfix in [PF_IA,PF_IB,PF_DA,PF_DB,PF_FD,PF_FA,PF_ED,PF_EA]) and
  1773. not(p^.code[0] in [
  1774. // ldr,str,ldrb,strb
  1775. #$17,
  1776. // stm,ldm
  1777. #$26
  1778. ]) then
  1779. begin
  1780. Matches:=0;
  1781. exit;
  1782. end;
  1783. { we shouldn't see any opsize prefixes here }
  1784. if (oppostfix in [PF_B,PF_SB,PF_BT,PF_H,PF_SH,PF_T]) then
  1785. begin
  1786. Matches:=0;
  1787. exit;
  1788. end;
  1789. if (roundingmode<>RM_None) and not(p^.code[0] in []) then
  1790. begin
  1791. Matches:=0;
  1792. exit;
  1793. end;
  1794. { Check operand sizes }
  1795. { as default an untyped size can get all the sizes, this is different
  1796. from nasm, but else we need to do a lot checking which opcodes want
  1797. size or not with the automatic size generation }
  1798. (*
  1799. asize:=longint($ffffffff);
  1800. if (p^.flags and IF_SB)<>0 then
  1801. asize:=OT_BITS8
  1802. else if (p^.flags and IF_SW)<>0 then
  1803. asize:=OT_BITS16
  1804. else if (p^.flags and IF_SD)<>0 then
  1805. asize:=OT_BITS32;
  1806. if (p^.flags and IF_ARMASK)<>0 then
  1807. begin
  1808. siz[0]:=0;
  1809. siz[1]:=0;
  1810. siz[2]:=0;
  1811. if (p^.flags and IF_AR0)<>0 then
  1812. siz[0]:=asize
  1813. else if (p^.flags and IF_AR1)<>0 then
  1814. siz[1]:=asize
  1815. else if (p^.flags and IF_AR2)<>0 then
  1816. siz[2]:=asize;
  1817. end
  1818. else
  1819. begin
  1820. { we can leave because the size for all operands is forced to be
  1821. the same
  1822. but not if IF_SB IF_SW or IF_SD is set PM }
  1823. if asize=-1 then
  1824. exit;
  1825. siz[0]:=asize;
  1826. siz[1]:=asize;
  1827. siz[2]:=asize;
  1828. end;
  1829. if (p^.flags and (IF_SM or IF_SM2))<>0 then
  1830. begin
  1831. if (p^.flags and IF_SM2)<>0 then
  1832. oprs:=2
  1833. else
  1834. oprs:=p^.ops;
  1835. for i:=0 to oprs-1 do
  1836. if ((p^.optypes[i] and OT_SIZE_MASK) <> 0) then
  1837. begin
  1838. for j:=0 to oprs-1 do
  1839. siz[j]:=p^.optypes[i] and OT_SIZE_MASK;
  1840. break;
  1841. end;
  1842. end
  1843. else
  1844. oprs:=2;
  1845. { Check operand sizes }
  1846. for i:=0 to p^.ops-1 do
  1847. begin
  1848. if ((p^.optypes[i] and OT_SIZE_MASK)=0) and
  1849. ((oper[i]^.ot and OT_SIZE_MASK and (not siz[i]))<>0) and
  1850. { Immediates can always include smaller size }
  1851. ((oper[i]^.ot and OT_IMMEDIATE)=0) and
  1852. (((p^.optypes[i] and OT_SIZE_MASK) or siz[i])<(oper[i]^.ot and OT_SIZE_MASK)) then
  1853. Matches:=2;
  1854. end;
  1855. *)
  1856. end;
  1857. function taicpu.calcsize(p:PInsEntry):shortint;
  1858. begin
  1859. result:=4;
  1860. end;
  1861. function taicpu.NeedAddrPrefix(opidx:byte):boolean;
  1862. begin
  1863. Result:=False; { unimplemented }
  1864. end;
  1865. procedure taicpu.Swapoperands;
  1866. begin
  1867. end;
  1868. function taicpu.FindInsentry(objdata:TObjData):boolean;
  1869. var
  1870. i : longint;
  1871. begin
  1872. result:=false;
  1873. { Things which may only be done once, not when a second pass is done to
  1874. optimize }
  1875. if (Insentry=nil) or ((InsEntry^.flags and IF_PASS2)<>0) then
  1876. begin
  1877. { create the .ot fields }
  1878. create_ot(objdata);
  1879. { set the file postion }
  1880. current_filepos:=fileinfo;
  1881. end
  1882. else
  1883. begin
  1884. { we've already an insentry so it's valid }
  1885. result:=true;
  1886. exit;
  1887. end;
  1888. { Lookup opcode in the table }
  1889. InsSize:=-1;
  1890. i:=instabcache^[opcode];
  1891. if i=-1 then
  1892. begin
  1893. Message1(asmw_e_opcode_not_in_table,gas_op2str[opcode]);
  1894. exit;
  1895. end;
  1896. insentry:=@instab[i];
  1897. while (insentry^.opcode=opcode) do
  1898. begin
  1899. if matches(insentry)=100 then
  1900. begin
  1901. result:=true;
  1902. exit;
  1903. end;
  1904. inc(i);
  1905. insentry:=@instab[i];
  1906. end;
  1907. Message1(asmw_e_invalid_opcode_and_operands,GetString);
  1908. { No instruction found, set insentry to nil and inssize to -1 }
  1909. insentry:=nil;
  1910. inssize:=-1;
  1911. end;
  1912. procedure taicpu.gencode(objdata:TObjData);
  1913. var
  1914. bytes : dword;
  1915. i_field : byte;
  1916. procedure setshifterop(op : byte);
  1917. begin
  1918. case oper[op]^.typ of
  1919. top_const:
  1920. begin
  1921. i_field:=1;
  1922. bytes:=bytes or dword(oper[op]^.val and $fff);
  1923. end;
  1924. top_reg:
  1925. begin
  1926. i_field:=0;
  1927. bytes:=bytes or (getsupreg(oper[op]^.reg) shl 16);
  1928. { does a real shifter op follow? }
  1929. if (op+1<=op) and (oper[op+1]^.typ=top_shifterop) then
  1930. begin
  1931. end;
  1932. end;
  1933. else
  1934. internalerror(2005091103);
  1935. end;
  1936. end;
  1937. begin
  1938. bytes:=$0;
  1939. i_field:=0;
  1940. { evaluate and set condition code }
  1941. { condition code allowed? }
  1942. { setup rest of the instruction }
  1943. case insentry^.code[0] of
  1944. #$08:
  1945. begin
  1946. { set instruction code }
  1947. bytes:=bytes or (ord(insentry^.code[1]) shl 26);
  1948. bytes:=bytes or (ord(insentry^.code[2]) shl 21);
  1949. { set destination }
  1950. bytes:=bytes or (getsupreg(oper[0]^.reg) shl 12);
  1951. { create shifter op }
  1952. setshifterop(1);
  1953. { set i field }
  1954. bytes:=bytes or (i_field shl 25);
  1955. { set s if necessary }
  1956. if oppostfix=PF_S then
  1957. bytes:=bytes or (1 shl 20);
  1958. end;
  1959. #$ff:
  1960. internalerror(2005091101);
  1961. else
  1962. internalerror(2005091102);
  1963. end;
  1964. { we're finished, write code }
  1965. objdata.writebytes(bytes,sizeof(bytes));
  1966. end;
  1967. {$ifdef dummy}
  1968. (*
  1969. static void gencode (long segment, long offset, int bits,
  1970. insn *ins, char *codes, long insn_end)
  1971. {
  1972. int has_S_code; /* S - setflag */
  1973. int has_B_code; /* B - setflag */
  1974. int has_T_code; /* T - setflag */
  1975. int has_W_code; /* ! => W flag */
  1976. int has_F_code; /* ^ => S flag */
  1977. int keep;
  1978. unsigned char c;
  1979. unsigned char bytes[4];
  1980. long data, size;
  1981. static int cc_code[] = /* bit pattern of cc */
  1982. { /* order as enum in */
  1983. 0x0E, 0x03, 0x02, 0x00, /* nasm.h */
  1984. 0x0A, 0x0C, 0x08, 0x0D,
  1985. 0x09, 0x0B, 0x04, 0x01,
  1986. 0x05, 0x07, 0x06,
  1987. };
  1988. #ifdef DEBUG
  1989. static char *CC[] =
  1990. { /* condition code names */
  1991. "AL", "CC", "CS", "EQ",
  1992. "GE", "GT", "HI", "LE",
  1993. "LS", "LT", "MI", "NE",
  1994. "PL", "VC", "VS", "",
  1995. "S"
  1996. };
  1997. has_S_code = (ins->condition & C_SSETFLAG);
  1998. has_B_code = (ins->condition & C_BSETFLAG);
  1999. has_T_code = (ins->condition & C_TSETFLAG);
  2000. has_W_code = (ins->condition & C_EXSETFLAG);
  2001. has_F_code = (ins->condition & C_FSETFLAG);
  2002. ins->condition = (ins->condition & 0x0F);
  2003. if (rt_debug)
  2004. {
  2005. printf ("gencode: instruction: %s%s", insn_names[ins->opcode],
  2006. CC[ins->condition & 0x0F]);
  2007. if (has_S_code)
  2008. printf ("S");
  2009. if (has_B_code)
  2010. printf ("B");
  2011. if (has_T_code)
  2012. printf ("T");
  2013. if (has_W_code)
  2014. printf ("!");
  2015. if (has_F_code)
  2016. printf ("^");
  2017. printf ("\n");
  2018. c = *codes;
  2019. printf (" (%d) decode - '0x%02X'\n", ins->operands, c);
  2020. bytes[0] = 0xB;
  2021. bytes[1] = 0xE;
  2022. bytes[2] = 0xE;
  2023. bytes[3] = 0xF;
  2024. }
  2025. // First condition code in upper nibble
  2026. if (ins->condition < C_NONE)
  2027. {
  2028. c = cc_code[ins->condition] << 4;
  2029. }
  2030. else
  2031. {
  2032. c = cc_code[C_AL] << 4; // is often ALWAYS but not always
  2033. }
  2034. switch (keep = *codes)
  2035. {
  2036. case 1:
  2037. // B, BL
  2038. ++codes;
  2039. c |= *codes++;
  2040. bytes[0] = c;
  2041. if (ins->oprs[0].segment != segment)
  2042. {
  2043. // fais une relocation
  2044. c = 1;
  2045. data = 0; // Let the linker locate ??
  2046. }
  2047. else
  2048. {
  2049. c = 0;
  2050. data = ins->oprs[0].offset - (offset + 8);
  2051. if (data % 4)
  2052. {
  2053. errfunc (ERR_NONFATAL, "offset not aligned on 4 bytes");
  2054. }
  2055. }
  2056. if (data >= 0x1000)
  2057. {
  2058. errfunc (ERR_NONFATAL, "too long offset");
  2059. }
  2060. data = data >> 2;
  2061. bytes[1] = (data >> 16) & 0xFF;
  2062. bytes[2] = (data >> 8) & 0xFF;
  2063. bytes[3] = (data ) & 0xFF;
  2064. if (c == 1)
  2065. {
  2066. // out (offset, segment, &bytes[0], OUT_RAWDATA+1, NO_SEG, NO_SEG);
  2067. out (offset, segment, &bytes[0], OUT_REL3ADR+4, ins->oprs[0].segment, NO_SEG);
  2068. }
  2069. else
  2070. {
  2071. out (offset, segment, &bytes[0], OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2072. }
  2073. return;
  2074. case 2:
  2075. // SWI
  2076. ++codes;
  2077. c |= *codes++;
  2078. bytes[0] = c;
  2079. data = ins->oprs[0].offset;
  2080. bytes[1] = (data >> 16) & 0xFF;
  2081. bytes[2] = (data >> 8) & 0xFF;
  2082. bytes[3] = (data) & 0xFF;
  2083. out (offset, segment, &bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2084. return;
  2085. case 3:
  2086. // BX
  2087. ++codes;
  2088. c |= *codes++;
  2089. bytes[0] = c;
  2090. bytes[1] = *codes++;
  2091. bytes[2] = *codes++;
  2092. bytes[3] = *codes++;
  2093. c = regval (&ins->oprs[0],1);
  2094. if (c == 15) // PC
  2095. {
  2096. errfunc (ERR_WARNING, "'BX' with R15 has undefined behaviour");
  2097. }
  2098. else if (c > 15)
  2099. {
  2100. errfunc (ERR_NONFATAL, "Illegal register specified for 'BX'");
  2101. }
  2102. bytes[3] |= (c & 0x0F);
  2103. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2104. return;
  2105. case 4: // AND Rd,Rn,Rm
  2106. case 5: // AND Rd,Rn,Rm,<shift>Rs
  2107. case 6: // AND Rd,Rn,Rm,<shift>imm
  2108. case 7: // AND Rd,Rn,<shift>imm
  2109. ++codes;
  2110. #ifdef DEBUG
  2111. if (rt_debug)
  2112. {
  2113. printf (" decode - '0x%02X'\n", keep);
  2114. printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
  2115. }
  2116. #endif
  2117. bytes[0] = c | *codes;
  2118. ++codes;
  2119. bytes[1] = *codes;
  2120. if (has_S_code)
  2121. bytes[1] |= 0x10;
  2122. c = regval (&ins->oprs[1],1);
  2123. // Rn in low nibble
  2124. bytes[1] |= c;
  2125. // Rd in high nibble
  2126. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2127. if (keep != 7)
  2128. {
  2129. // Rm in low nibble
  2130. bytes[3] = regval (&ins->oprs[2],1);
  2131. }
  2132. // Shifts if any
  2133. if (keep == 5 || keep == 6)
  2134. {
  2135. // Shift in bytes 2 and 3
  2136. if (keep == 5)
  2137. {
  2138. // Rs
  2139. c = regval (&ins->oprs[3],1);
  2140. bytes[2] |= c;
  2141. c = 0x10; // Set bit 4 in byte[3]
  2142. }
  2143. if (keep == 6)
  2144. {
  2145. c = (ins->oprs[3].offset) & 0x1F;
  2146. // #imm
  2147. bytes[2] |= c >> 1;
  2148. if (c & 0x01)
  2149. {
  2150. bytes[3] |= 0x80;
  2151. }
  2152. c = 0; // Clr bit 4 in byte[3]
  2153. }
  2154. // <shift>
  2155. c |= shiftval (&ins->oprs[3]) << 5;
  2156. bytes[3] |= c;
  2157. }
  2158. // reg,reg,imm
  2159. if (keep == 7)
  2160. {
  2161. int shimm;
  2162. shimm = imm_shift (ins->oprs[2].offset);
  2163. if (shimm == -1)
  2164. {
  2165. errfunc (ERR_NONFATAL, "cannot create that constant");
  2166. }
  2167. bytes[3] = shimm & 0xFF;
  2168. bytes[2] |= (shimm & 0xF00) >> 8;
  2169. }
  2170. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2171. return;
  2172. case 8: // MOV Rd,Rm
  2173. case 9: // MOV Rd,Rm,<shift>Rs
  2174. case 0xA: // MOV Rd,Rm,<shift>imm
  2175. case 0xB: // MOV Rd,<shift>imm
  2176. ++codes;
  2177. #ifdef DEBUG
  2178. if (rt_debug)
  2179. {
  2180. printf (" decode - '0x%02X'\n", keep);
  2181. printf (" code - '0x%02X'\n", (unsigned char) ( *codes));
  2182. }
  2183. #endif
  2184. bytes[0] = c | *codes;
  2185. ++codes;
  2186. bytes[1] = *codes;
  2187. if (has_S_code)
  2188. bytes[1] |= 0x10;
  2189. // Rd in high nibble
  2190. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2191. if (keep != 0x0B)
  2192. {
  2193. // Rm in low nibble
  2194. bytes[3] = regval (&ins->oprs[1],1);
  2195. }
  2196. // Shifts if any
  2197. if (keep == 0x09 || keep == 0x0A)
  2198. {
  2199. // Shift in bytes 2 and 3
  2200. if (keep == 0x09)
  2201. {
  2202. // Rs
  2203. c = regval (&ins->oprs[2],1);
  2204. bytes[2] |= c;
  2205. c = 0x10; // Set bit 4 in byte[3]
  2206. }
  2207. if (keep == 0x0A)
  2208. {
  2209. c = (ins->oprs[2].offset) & 0x1F;
  2210. // #imm
  2211. bytes[2] |= c >> 1;
  2212. if (c & 0x01)
  2213. {
  2214. bytes[3] |= 0x80;
  2215. }
  2216. c = 0; // Clr bit 4 in byte[3]
  2217. }
  2218. // <shift>
  2219. c |= shiftval (&ins->oprs[2]) << 5;
  2220. bytes[3] |= c;
  2221. }
  2222. // reg,imm
  2223. if (keep == 0x0B)
  2224. {
  2225. int shimm;
  2226. shimm = imm_shift (ins->oprs[1].offset);
  2227. if (shimm == -1)
  2228. {
  2229. errfunc (ERR_NONFATAL, "cannot create that constant");
  2230. }
  2231. bytes[3] = shimm & 0xFF;
  2232. bytes[2] |= (shimm & 0xF00) >> 8;
  2233. }
  2234. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2235. return;
  2236. case 0xC: // CMP Rn,Rm
  2237. case 0xD: // CMP Rn,Rm,<shift>Rs
  2238. case 0xE: // CMP Rn,Rm,<shift>imm
  2239. case 0xF: // CMP Rn,<shift>imm
  2240. ++codes;
  2241. bytes[0] = c | *codes++;
  2242. bytes[1] = *codes;
  2243. // Implicit S code
  2244. bytes[1] |= 0x10;
  2245. c = regval (&ins->oprs[0],1);
  2246. // Rn in low nibble
  2247. bytes[1] |= c;
  2248. // No destination
  2249. bytes[2] = 0;
  2250. if (keep != 0x0B)
  2251. {
  2252. // Rm in low nibble
  2253. bytes[3] = regval (&ins->oprs[1],1);
  2254. }
  2255. // Shifts if any
  2256. if (keep == 0x0D || keep == 0x0E)
  2257. {
  2258. // Shift in bytes 2 and 3
  2259. if (keep == 0x0D)
  2260. {
  2261. // Rs
  2262. c = regval (&ins->oprs[2],1);
  2263. bytes[2] |= c;
  2264. c = 0x10; // Set bit 4 in byte[3]
  2265. }
  2266. if (keep == 0x0E)
  2267. {
  2268. c = (ins->oprs[2].offset) & 0x1F;
  2269. // #imm
  2270. bytes[2] |= c >> 1;
  2271. if (c & 0x01)
  2272. {
  2273. bytes[3] |= 0x80;
  2274. }
  2275. c = 0; // Clr bit 4 in byte[3]
  2276. }
  2277. // <shift>
  2278. c |= shiftval (&ins->oprs[2]) << 5;
  2279. bytes[3] |= c;
  2280. }
  2281. // reg,imm
  2282. if (keep == 0x0F)
  2283. {
  2284. int shimm;
  2285. shimm = imm_shift (ins->oprs[1].offset);
  2286. if (shimm == -1)
  2287. {
  2288. errfunc (ERR_NONFATAL, "cannot create that constant");
  2289. }
  2290. bytes[3] = shimm & 0xFF;
  2291. bytes[2] |= (shimm & 0xF00) >> 8;
  2292. }
  2293. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2294. return;
  2295. case 0x10: // MRS Rd,<psr>
  2296. ++codes;
  2297. bytes[0] = c | *codes++;
  2298. bytes[1] = *codes++;
  2299. // Rd
  2300. c = regval (&ins->oprs[0],1);
  2301. bytes[2] = c << 4;
  2302. bytes[3] = 0;
  2303. c = ins->oprs[1].basereg;
  2304. if (c == R_CPSR || c == R_SPSR)
  2305. {
  2306. if (c == R_SPSR)
  2307. {
  2308. bytes[1] |= 0x40;
  2309. }
  2310. }
  2311. else
  2312. {
  2313. errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
  2314. }
  2315. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2316. return;
  2317. case 0x11: // MSR <psr>,Rm
  2318. case 0x12: // MSR <psrf>,Rm
  2319. case 0x13: // MSR <psrf>,#expression
  2320. ++codes;
  2321. bytes[0] = c | *codes++;
  2322. bytes[1] = *codes++;
  2323. bytes[2] = *codes;
  2324. if (keep == 0x11 || keep == 0x12)
  2325. {
  2326. // Rm
  2327. c = regval (&ins->oprs[1],1);
  2328. bytes[3] = c;
  2329. }
  2330. else
  2331. {
  2332. int shimm;
  2333. shimm = imm_shift (ins->oprs[1].offset);
  2334. if (shimm == -1)
  2335. {
  2336. errfunc (ERR_NONFATAL, "cannot create that constant");
  2337. }
  2338. bytes[3] = shimm & 0xFF;
  2339. bytes[2] |= (shimm & 0xF00) >> 8;
  2340. }
  2341. c = ins->oprs[0].basereg;
  2342. if ( keep == 0x11)
  2343. {
  2344. if ( c == R_CPSR || c == R_SPSR)
  2345. {
  2346. if ( c== R_SPSR)
  2347. {
  2348. bytes[1] |= 0x40;
  2349. }
  2350. }
  2351. else
  2352. {
  2353. errfunc (ERR_NONFATAL, "CPSR or SPSR expected");
  2354. }
  2355. }
  2356. else
  2357. {
  2358. if ( c == R_CPSR_FLG || c == R_SPSR_FLG)
  2359. {
  2360. if ( c== R_SPSR_FLG)
  2361. {
  2362. bytes[1] |= 0x40;
  2363. }
  2364. }
  2365. else
  2366. {
  2367. errfunc (ERR_NONFATAL, "CPSR_flg or SPSR_flg expected");
  2368. }
  2369. }
  2370. break;
  2371. case 0x14: // MUL Rd,Rm,Rs
  2372. case 0x15: // MULA Rd,Rm,Rs,Rn
  2373. ++codes;
  2374. bytes[0] = c | *codes++;
  2375. bytes[1] = *codes++;
  2376. bytes[3] = *codes;
  2377. // Rd
  2378. bytes[1] |= regval (&ins->oprs[0],1);
  2379. if (has_S_code)
  2380. bytes[1] |= 0x10;
  2381. // Rm
  2382. bytes[3] |= regval (&ins->oprs[1],1);
  2383. // Rs
  2384. bytes[2] = regval (&ins->oprs[2],1);
  2385. if (keep == 0x15)
  2386. {
  2387. bytes[2] |= regval (&ins->oprs[3],1) << 4;
  2388. }
  2389. break;
  2390. case 0x16: // SMLAL RdHi,RdLo,Rm,Rs
  2391. ++codes;
  2392. bytes[0] = c | *codes++;
  2393. bytes[1] = *codes++;
  2394. bytes[3] = *codes;
  2395. // RdHi
  2396. bytes[1] |= regval (&ins->oprs[1],1);
  2397. if (has_S_code)
  2398. bytes[1] |= 0x10;
  2399. // RdLo
  2400. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2401. // Rm
  2402. bytes[3] |= regval (&ins->oprs[2],1);
  2403. // Rs
  2404. bytes[2] |= regval (&ins->oprs[3],1);
  2405. break;
  2406. case 0x17: // LDR Rd, expression
  2407. ++codes;
  2408. bytes[0] = c | *codes++;
  2409. bytes[1] = *codes++;
  2410. // Rd
  2411. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2412. if (has_B_code)
  2413. bytes[1] |= 0x40;
  2414. if (has_T_code)
  2415. {
  2416. errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
  2417. }
  2418. if (has_W_code)
  2419. {
  2420. errfunc (ERR_NONFATAL, "'!' not allowed");
  2421. }
  2422. // Rn - implicit R15
  2423. bytes[1] |= 0xF;
  2424. if (ins->oprs[1].segment != segment)
  2425. {
  2426. errfunc (ERR_NONFATAL, "label not in same segment");
  2427. }
  2428. data = ins->oprs[1].offset - (offset + 8);
  2429. if (data < 0)
  2430. {
  2431. data = -data;
  2432. }
  2433. else
  2434. {
  2435. bytes[1] |= 0x80;
  2436. }
  2437. if (data >= 0x1000)
  2438. {
  2439. errfunc (ERR_NONFATAL, "too long offset");
  2440. }
  2441. bytes[2] |= ((data & 0xF00) >> 8);
  2442. bytes[3] = data & 0xFF;
  2443. break;
  2444. case 0x18: // LDR Rd, [Rn]
  2445. ++codes;
  2446. bytes[0] = c | *codes++;
  2447. bytes[1] = *codes++;
  2448. // Rd
  2449. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2450. if (has_B_code)
  2451. bytes[1] |= 0x40;
  2452. if (has_T_code)
  2453. {
  2454. bytes[1] |= 0x20; // write-back
  2455. }
  2456. else
  2457. {
  2458. bytes[0] |= 0x01; // implicit pre-index mode
  2459. }
  2460. if (has_W_code)
  2461. {
  2462. bytes[1] |= 0x20; // write-back
  2463. }
  2464. // Rn
  2465. c = regval (&ins->oprs[1],1);
  2466. bytes[1] |= c;
  2467. if (c == 0x15) // R15
  2468. data = -8;
  2469. else
  2470. data = 0;
  2471. if (data < 0)
  2472. {
  2473. data = -data;
  2474. }
  2475. else
  2476. {
  2477. bytes[1] |= 0x80;
  2478. }
  2479. bytes[2] |= ((data & 0xF00) >> 8);
  2480. bytes[3] = data & 0xFF;
  2481. break;
  2482. case 0x19: // LDR Rd, [Rn,#expression]
  2483. case 0x20: // LDR Rd, [Rn,Rm]
  2484. case 0x21: // LDR Rd, [Rn,Rm,shift]
  2485. ++codes;
  2486. bytes[0] = c | *codes++;
  2487. bytes[1] = *codes++;
  2488. // Rd
  2489. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2490. if (has_B_code)
  2491. bytes[1] |= 0x40;
  2492. // Rn
  2493. c = regval (&ins->oprs[1],1);
  2494. bytes[1] |= c;
  2495. if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
  2496. {
  2497. bytes[0] |= 0x01; // pre-index mode
  2498. if (has_W_code)
  2499. {
  2500. bytes[1] |= 0x20;
  2501. }
  2502. if (has_T_code)
  2503. {
  2504. errfunc (ERR_NONFATAL, "'T' not allowed in pre-index mode");
  2505. }
  2506. }
  2507. else
  2508. {
  2509. if (has_T_code) // Forced write-back in post-index mode
  2510. {
  2511. bytes[1] |= 0x20;
  2512. }
  2513. if (has_W_code)
  2514. {
  2515. errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
  2516. }
  2517. }
  2518. if (keep == 0x19)
  2519. {
  2520. data = ins->oprs[2].offset;
  2521. if (data < 0)
  2522. {
  2523. data = -data;
  2524. }
  2525. else
  2526. {
  2527. bytes[1] |= 0x80;
  2528. }
  2529. if (data >= 0x1000)
  2530. {
  2531. errfunc (ERR_NONFATAL, "too long offset");
  2532. }
  2533. bytes[2] |= ((data & 0xF00) >> 8);
  2534. bytes[3] = data & 0xFF;
  2535. }
  2536. else
  2537. {
  2538. if (ins->oprs[2].minus == 0)
  2539. {
  2540. bytes[1] |= 0x80;
  2541. }
  2542. c = regval (&ins->oprs[2],1);
  2543. bytes[3] = c;
  2544. if (keep == 0x21)
  2545. {
  2546. c = ins->oprs[3].offset;
  2547. if (c > 0x1F)
  2548. {
  2549. errfunc (ERR_NONFATAL, "too large shiftvalue");
  2550. c = c & 0x1F;
  2551. }
  2552. bytes[2] |= c >> 1;
  2553. if (c & 0x01)
  2554. {
  2555. bytes[3] |= 0x80;
  2556. }
  2557. bytes[3] |= shiftval (&ins->oprs[3]) << 5;
  2558. }
  2559. }
  2560. break;
  2561. case 0x22: // LDRH Rd, expression
  2562. ++codes;
  2563. bytes[0] = c | 0x01; // Implicit pre-index
  2564. bytes[1] = *codes++;
  2565. // Rd
  2566. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2567. // Rn - implicit R15
  2568. bytes[1] |= 0xF;
  2569. if (ins->oprs[1].segment != segment)
  2570. {
  2571. errfunc (ERR_NONFATAL, "label not in same segment");
  2572. }
  2573. data = ins->oprs[1].offset - (offset + 8);
  2574. if (data < 0)
  2575. {
  2576. data = -data;
  2577. }
  2578. else
  2579. {
  2580. bytes[1] |= 0x80;
  2581. }
  2582. if (data >= 0x100)
  2583. {
  2584. errfunc (ERR_NONFATAL, "too long offset");
  2585. }
  2586. bytes[3] = *codes++;
  2587. bytes[2] |= ((data & 0xF0) >> 4);
  2588. bytes[3] |= data & 0xF;
  2589. break;
  2590. case 0x23: // LDRH Rd, Rn
  2591. ++codes;
  2592. bytes[0] = c | 0x01; // Implicit pre-index
  2593. bytes[1] = *codes++;
  2594. // Rd
  2595. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2596. // Rn
  2597. c = regval (&ins->oprs[1],1);
  2598. bytes[1] |= c;
  2599. if (c == 0x15) // R15
  2600. data = -8;
  2601. else
  2602. data = 0;
  2603. if (data < 0)
  2604. {
  2605. data = -data;
  2606. }
  2607. else
  2608. {
  2609. bytes[1] |= 0x80;
  2610. }
  2611. if (data >= 0x100)
  2612. {
  2613. errfunc (ERR_NONFATAL, "too long offset");
  2614. }
  2615. bytes[3] = *codes++;
  2616. bytes[2] |= ((data & 0xF0) >> 4);
  2617. bytes[3] |= data & 0xF;
  2618. break;
  2619. case 0x24: // LDRH Rd, Rn, expression
  2620. case 0x25: // LDRH Rd, Rn, Rm
  2621. ++codes;
  2622. bytes[0] = c;
  2623. bytes[1] = *codes++;
  2624. // Rd
  2625. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2626. // Rn
  2627. c = regval (&ins->oprs[1],1);
  2628. bytes[1] |= c;
  2629. if (ins->oprs[ins->operands-1].bracket) // FIXME: Bracket on last operand -> pre-index <--
  2630. {
  2631. bytes[0] |= 0x01; // pre-index mode
  2632. if (has_W_code)
  2633. {
  2634. bytes[1] |= 0x20;
  2635. }
  2636. }
  2637. else
  2638. {
  2639. if (has_W_code)
  2640. {
  2641. errfunc (ERR_NONFATAL, "'!' not allowed in post-index mode");
  2642. }
  2643. }
  2644. bytes[3] = *codes++;
  2645. if (keep == 0x24)
  2646. {
  2647. data = ins->oprs[2].offset;
  2648. if (data < 0)
  2649. {
  2650. data = -data;
  2651. }
  2652. else
  2653. {
  2654. bytes[1] |= 0x80;
  2655. }
  2656. if (data >= 0x100)
  2657. {
  2658. errfunc (ERR_NONFATAL, "too long offset");
  2659. }
  2660. bytes[2] |= ((data & 0xF0) >> 4);
  2661. bytes[3] |= data & 0xF;
  2662. }
  2663. else
  2664. {
  2665. if (ins->oprs[2].minus == 0)
  2666. {
  2667. bytes[1] |= 0x80;
  2668. }
  2669. c = regval (&ins->oprs[2],1);
  2670. bytes[3] |= c;
  2671. }
  2672. break;
  2673. case 0x26: // LDM/STM Rn, {reg-list}
  2674. ++codes;
  2675. bytes[0] = c;
  2676. bytes[0] |= ( *codes >> 4) & 0xF;
  2677. bytes[1] = ( *codes << 4) & 0xF0;
  2678. ++codes;
  2679. if (has_W_code)
  2680. {
  2681. bytes[1] |= 0x20;
  2682. }
  2683. if (has_F_code)
  2684. {
  2685. bytes[1] |= 0x40;
  2686. }
  2687. // Rn
  2688. bytes[1] |= regval (&ins->oprs[0],1);
  2689. data = ins->oprs[1].basereg;
  2690. bytes[2] = ((data >> 8) & 0xFF);
  2691. bytes[3] = (data & 0xFF);
  2692. break;
  2693. case 0x27: // SWP Rd, Rm, [Rn]
  2694. ++codes;
  2695. bytes[0] = c;
  2696. bytes[0] |= *codes++;
  2697. bytes[1] = regval (&ins->oprs[2],1);
  2698. if (has_B_code)
  2699. {
  2700. bytes[1] |= 0x40;
  2701. }
  2702. bytes[2] = regval (&ins->oprs[0],1) << 4;
  2703. bytes[3] = *codes++;
  2704. bytes[3] |= regval (&ins->oprs[1],1);
  2705. break;
  2706. default:
  2707. errfunc (ERR_FATAL, "unknown decoding of instruction");
  2708. bytes[0] = c;
  2709. // And a fix nibble
  2710. ++codes;
  2711. bytes[0] |= *codes++;
  2712. if ( *codes == 0x01) // An I bit
  2713. {
  2714. }
  2715. if ( *codes == 0x02) // An I bit
  2716. {
  2717. }
  2718. ++codes;
  2719. }
  2720. out (offset, segment, bytes, OUT_RAWDATA+4, NO_SEG, NO_SEG);
  2721. }
  2722. *)
  2723. {$endif dummy}
  2724. constructor tai_thumb_func.create;
  2725. begin
  2726. inherited create;
  2727. typ:=ait_thumb_func;
  2728. end;
  2729. begin
  2730. cai_align:=tai_align;
  2731. end.