aasmcpu.pas 97 KB

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