aasmcpu.pas 98 KB

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