PreLowerPeeps.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422
  1. //-------------------------------------------------------------------------------------------------------
  2. // Copyright (C) Microsoft. All rights reserved.
  3. // Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
  4. //-------------------------------------------------------------------------------------------------------
  5. #include "Backend.h"
  6. IR::Instr *Lowerer::PreLowerPeepInstr(IR::Instr *instr, IR::Instr **pInstrPrev)
  7. {
  8. if (PHASE_OFF(Js::PreLowererPeepsPhase, this->m_func))
  9. {
  10. return instr;
  11. }
  12. switch (instr->m_opcode)
  13. {
  14. #if defined(_M_IX86) || defined(_M_X64)
  15. // this sort of addressing mode magic only applies to x86 platforms
  16. case Js::OpCode::Add_I4:
  17. instr = this->PeepShiftAdd(instr);
  18. *pInstrPrev = instr->m_prev;
  19. break;
  20. #endif
  21. case Js::OpCode::Shl_I4:
  22. instr = this->PeepShl(instr);
  23. *pInstrPrev = instr->m_prev;
  24. break;
  25. case Js::OpCode::BrTrue_I4:
  26. case Js::OpCode::BrFalse_I4:
  27. instr = this->PeepBrBool(instr);
  28. *pInstrPrev = instr->m_prev;
  29. break;
  30. }
  31. return instr;
  32. }
  33. IR::Instr *
  34. Lowerer::TryShiftAdd(IR::Instr *instrAdd, IR::Opnd * opndFold, IR::Opnd * opndAdd)
  35. {
  36. Assert(instrAdd->m_opcode == Js::OpCode::Add_I4);
  37. if (!opndFold->GetIsDead())
  38. {
  39. return instrAdd;
  40. }
  41. if (!(opndAdd->IsRegOpnd() || (opndAdd->IsInt32() && opndAdd->IsIntConstOpnd())))
  42. {
  43. return instrAdd;
  44. }
  45. if (!opndFold->IsRegOpnd() || !opndFold->AsRegOpnd()->m_sym->IsSingleDef())
  46. {
  47. return instrAdd;
  48. }
  49. IR::Instr * instrDef = opndFold->AsRegOpnd()->m_sym->GetInstrDef();
  50. if ((instrDef->m_opcode != Js::OpCode::Shl_I4 && instrDef->m_opcode != Js::OpCode::Mul_I4) || !instrDef->GetSrc1()->IsRegOpnd() || !instrDef->GetSrc2()->IsIntConstOpnd())
  51. {
  52. return instrAdd;
  53. }
  54. if (instrDef->HasBailOutInfo())
  55. {
  56. return instrAdd;
  57. }
  58. byte scale = 0;
  59. IntConstType constVal = instrDef->GetSrc2()->AsIntConstOpnd()->GetValue();
  60. if (instrDef->m_opcode == Js::OpCode::Shl_I4)
  61. {
  62. if (constVal < 0 || constVal > 3)
  63. {
  64. return instrAdd;
  65. }
  66. scale = (byte)constVal;
  67. }
  68. else
  69. {
  70. Assert(instrDef->m_opcode == Js::OpCode::Mul_I4);
  71. switch (constVal)
  72. {
  73. case 1:
  74. scale = 0;
  75. break;
  76. case 2:
  77. scale = 1;
  78. break;
  79. case 4:
  80. scale = 2;
  81. break;
  82. case 8:
  83. scale = 3;
  84. break;
  85. default:
  86. return instrAdd;
  87. }
  88. }
  89. StackSym * defSrc1Sym = instrDef->GetSrc1()->AsRegOpnd()->m_sym;
  90. StackSym * foldSym = opndFold->AsRegOpnd()->m_sym;
  91. FOREACH_INSTR_IN_RANGE(instrIter, instrDef->m_next, instrAdd->m_prev)
  92. {
  93. // if any branch between def-use, don't do peeps on it because branch target might depend on the def
  94. if (instrIter->IsBranchInstr())
  95. {
  96. return instrAdd;
  97. }
  98. if (instrIter->HasBailOutInfo())
  99. {
  100. return instrAdd;
  101. }
  102. if (instrIter->FindRegDef(defSrc1Sym))
  103. {
  104. return instrAdd;
  105. }
  106. if (instrIter->FindRegUse(foldSym))
  107. {
  108. return instrAdd;
  109. }
  110. } NEXT_INSTR_IN_RANGE;
  111. #if DBG_DUMP
  112. if (PHASE_TRACE(Js::PreLowererPeepsPhase, instrAdd->m_func))
  113. {
  114. Output::Print(_u("PeepShiftAdd : %s (%d) : folding:\n"), instrAdd->m_func->GetJITFunctionBody()->GetDisplayName(), instrAdd->m_func->GetFunctionNumber());
  115. instrDef->Dump();
  116. instrAdd->Dump();
  117. }
  118. #endif
  119. IR::IndirOpnd * leaOpnd = nullptr;
  120. if (opndAdd->IsRegOpnd())
  121. {
  122. leaOpnd = IR::IndirOpnd::New(opndAdd->AsRegOpnd(), instrDef->UnlinkSrc1()->AsRegOpnd(), scale, opndFold->GetType(), instrAdd->m_func);
  123. }
  124. else
  125. {
  126. Assert(opndAdd->IsInt32() && opndAdd->IsIntConstOpnd());
  127. leaOpnd = IR::IndirOpnd::New(instrDef->UnlinkSrc1()->AsRegOpnd(), opndAdd->AsIntConstOpnd()->AsInt32(), scale, opndFold->GetType(), instrAdd->m_func);
  128. }
  129. IR::Instr * leaInstr = InsertLea(instrAdd->UnlinkDst()->AsRegOpnd(), leaOpnd, instrAdd);
  130. #if DBG_DUMP
  131. if (PHASE_TRACE(Js::PreLowererPeepsPhase, instrAdd->m_func))
  132. {
  133. Output::Print(_u("into:\n"), instrAdd->m_func->GetJITFunctionBody()->GetDisplayName(), instrAdd->m_func->GetFunctionNumber());
  134. leaInstr->Dump();
  135. }
  136. #endif
  137. instrAdd->Remove();
  138. instrDef->Remove();
  139. return leaInstr;
  140. }
  141. IR::Instr *
  142. Lowerer::PeepShiftAdd(IR::Instr *instrAdd)
  143. {
  144. Assert(instrAdd->m_opcode == Js::OpCode::Add_I4);
  145. // Peep:
  146. // t1 = SHL X, 0|1|2|3 / t1 = MUL X, 1|2|4|8
  147. // t2 = ADD t1, Y
  148. //
  149. // Into:
  150. // t2 = LEA [X * scale + Y]
  151. if (instrAdd->HasBailOutInfo())
  152. {
  153. return instrAdd;
  154. }
  155. if (!instrAdd->GetDst()->IsRegOpnd())
  156. {
  157. return instrAdd;
  158. }
  159. IR::Opnd * src2 = instrAdd->GetSrc2();
  160. IR::Opnd * src1 = instrAdd->GetSrc1();
  161. // we can't remove t1 in case both srcs are uses of t1
  162. if (src1->IsEqual(src2))
  163. {
  164. return instrAdd;
  165. }
  166. IR::Instr * resultInstr = TryShiftAdd(instrAdd, src1, src2);
  167. if (resultInstr->m_opcode == Js::OpCode::Add_I4)
  168. {
  169. resultInstr = TryShiftAdd(instrAdd, src2, src1);
  170. }
  171. return resultInstr;
  172. }
  173. IR::Instr *Lowerer::PeepShl(IR::Instr *instrShl)
  174. {
  175. IR::Opnd *src1;
  176. IR::Opnd *src2;
  177. IR::Instr *instrDef;
  178. src1 = instrShl->GetSrc1();
  179. src2 = instrShl->GetSrc2();
  180. // Peep:
  181. // t1 = SHR X, cst
  182. // t2 = SHL t1, cst
  183. //
  184. // Into:
  185. // t2 = AND X, mask
  186. if (!src1->IsRegOpnd() || !src2->IsIntConstOpnd())
  187. {
  188. return instrShl;
  189. }
  190. if (!src1->AsRegOpnd()->m_sym->IsSingleDef())
  191. {
  192. return instrShl;
  193. }
  194. if (instrShl->HasBailOutInfo())
  195. {
  196. return instrShl;
  197. }
  198. instrDef = src1->AsRegOpnd()->m_sym->GetInstrDef();
  199. if (instrDef->m_opcode != Js::OpCode::Shr_I4 || !instrDef->GetSrc2()->IsIntConstOpnd()
  200. || instrDef->GetSrc2()->AsIntConstOpnd()->GetValue() != src2->AsIntConstOpnd()->GetValue()
  201. || !instrDef->GetSrc1()->IsRegOpnd())
  202. {
  203. return instrShl;
  204. }
  205. if (!src1->GetIsDead())
  206. {
  207. return instrShl;
  208. }
  209. if (instrDef->HasBailOutInfo())
  210. {
  211. return instrShl;
  212. }
  213. FOREACH_INSTR_IN_RANGE(instrIter, instrDef->m_next, instrShl->m_prev)
  214. {
  215. if (instrIter->HasBailOutInfo())
  216. {
  217. return instrShl;
  218. }
  219. if (instrIter->FindRegDef(instrDef->GetSrc1()->AsRegOpnd()->m_sym))
  220. {
  221. return instrShl;
  222. }
  223. if (instrIter->FindRegUse(src1->AsRegOpnd()->m_sym))
  224. {
  225. return instrShl;
  226. }
  227. // if any branch between def-use, don't do peeps on it because branch target might depend on the def
  228. if (instrIter->IsBranchInstr())
  229. {
  230. return instrShl;
  231. }
  232. } NEXT_INSTR_IN_RANGE;
  233. instrShl->FreeSrc1();
  234. instrShl->SetSrc1(instrDef->UnlinkSrc1());
  235. instrDef->Remove();
  236. IntConstType oldValue = src2->AsIntConstOpnd()->GetValue();
  237. // Left shift operator (<<) on arm32 is implemented by LSL which doesn't discard bits beyond lowerest 5-bit.
  238. // Need to discard such bits to conform to << in JavaScript. This is not a problem for x86 and x64 because
  239. // behavior of SHL is consistent with JavaScript but keep the below line for clarity.
  240. oldValue %= sizeof(int32) * 8;
  241. oldValue = ~((1 << oldValue) - 1);
  242. src2->AsIntConstOpnd()->SetValue(oldValue);
  243. instrShl->m_opcode = Js::OpCode::And_I4;
  244. return instrShl;
  245. }
  246. IR::Instr *Lowerer::PeepBrBool(IR::Instr *instrBr)
  247. {
  248. IR::Opnd *src1;
  249. IR::Instr *instrBinOp, *instrCm1, *instrCm2;
  250. // Peep:
  251. // t1 = CmCC_I4 a, b
  252. // t2 = CmCC_i4 c, d
  253. // t3 = AND/OR t1, t2
  254. // BrTrue/False t3, $L_true
  255. //
  256. // Into:
  257. // BrCC a, b, $L_true/false
  258. // BrCC c, d, $L_true
  259. //$L_false:
  260. src1 = instrBr->GetSrc1();
  261. if (!src1->IsRegOpnd())
  262. {
  263. return instrBr;
  264. }
  265. Assert(!instrBr->HasBailOutInfo());
  266. instrBinOp = instrBr->GetPrevRealInstrOrLabel();
  267. if (instrBinOp->m_opcode != Js::OpCode::And_I4 && instrBinOp->m_opcode != Js::OpCode::Or_I4)
  268. {
  269. return instrBr;
  270. }
  271. if (!instrBinOp->GetDst()->IsEqual(src1))
  272. {
  273. return instrBr;
  274. }
  275. IR::RegOpnd *src1Reg = src1->AsRegOpnd();
  276. if (!src1Reg->m_sym->IsSingleDef() || !src1Reg->GetIsDead())
  277. {
  278. return instrBr;
  279. }
  280. Assert(!instrBinOp->HasBailOutInfo());
  281. instrCm2 = instrBinOp->GetPrevRealInstrOrLabel();
  282. if (!instrCm2->IsCmCC_I4())
  283. {
  284. return instrBr;
  285. }
  286. IR::RegOpnd *cm2DstReg = instrCm2->GetDst()->AsRegOpnd();
  287. if (!cm2DstReg->m_sym->IsSingleDef())
  288. {
  289. return instrBr;
  290. }
  291. if (cm2DstReg->IsEqual(instrBinOp->GetSrc1()))
  292. {
  293. if (!instrBinOp->GetSrc1()->AsRegOpnd()->GetIsDead())
  294. {
  295. return instrBr;
  296. }
  297. }
  298. else if (cm2DstReg->IsEqual(instrBinOp->GetSrc2()))
  299. {
  300. if (!instrBinOp->GetSrc2()->AsRegOpnd()->GetIsDead())
  301. {
  302. return instrBr;
  303. }
  304. }
  305. else
  306. {
  307. return instrBr;
  308. }
  309. Assert(!instrCm2->HasBailOutInfo());
  310. instrCm1 = instrCm2->GetPrevRealInstrOrLabel();
  311. if (!instrCm1->IsCmCC_I4())
  312. {
  313. return instrBr;
  314. }
  315. Assert(!instrCm1->GetDst()->IsEqual(instrCm2->GetDst()));
  316. IR::RegOpnd *cm1DstReg = instrCm1->GetDst()->AsRegOpnd();
  317. if (!cm1DstReg->m_sym->IsSingleDef())
  318. {
  319. return instrBr;
  320. }
  321. if (cm1DstReg->IsEqual(instrCm2->GetSrc1()) || cm1DstReg->IsEqual(instrCm2->GetSrc2()))
  322. {
  323. return instrBr;
  324. }
  325. if (cm1DstReg->IsEqual(instrBinOp->GetSrc1()))
  326. {
  327. if (!instrBinOp->GetSrc1()->AsRegOpnd()->GetIsDead())
  328. {
  329. return instrBr;
  330. }
  331. }
  332. else if (cm1DstReg->IsEqual(instrBinOp->GetSrc2()))
  333. {
  334. if (!instrBinOp->GetSrc2()->AsRegOpnd()->GetIsDead())
  335. {
  336. return instrBr;
  337. }
  338. }
  339. else
  340. {
  341. return instrBr;
  342. }
  343. Assert(!instrCm1->HasBailOutInfo());
  344. IR::LabelInstr *falseLabel = instrBr->AsBranchInstr()->GetTarget();
  345. IR::LabelInstr *trueLabel = IR::LabelInstr::New(Js::OpCode::Label, this->m_func);
  346. instrBr->InsertAfter(trueLabel);
  347. IR::BranchInstr *instrBr1;
  348. IR::BranchInstr *instrBr2;
  349. if (instrBinOp->m_opcode == Js::OpCode::And_I4)
  350. {
  351. instrBr1 = instrCm1->ChangeCmCCToBranchInstr(instrBr->m_opcode == Js::OpCode::BrFalse_I4 ? falseLabel : trueLabel);
  352. instrBr1->Invert();
  353. instrBr2 = instrCm2->ChangeCmCCToBranchInstr(falseLabel);
  354. if (instrBr->m_opcode == Js::OpCode::BrFalse_I4)
  355. {
  356. instrBr2->Invert();
  357. }
  358. }
  359. else
  360. {
  361. Assert(instrBinOp->m_opcode == Js::OpCode::Or_I4);
  362. instrBr1 = instrCm1->ChangeCmCCToBranchInstr(instrBr->m_opcode == Js::OpCode::BrTrue_I4 ? falseLabel : trueLabel);
  363. instrBr2 = instrCm2->ChangeCmCCToBranchInstr(falseLabel);
  364. if (instrBr->m_opcode == Js::OpCode::BrFalse_I4)
  365. {
  366. instrBr2->Invert();
  367. }
  368. }
  369. instrBinOp->Remove();
  370. instrBr->Remove();
  371. return instrBr2;
  372. }