aasmcpu.pas 95 KB

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