dfa_pass.c 59 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749
  1. /*
  2. +----------------------------------------------------------------------+
  3. | Zend OPcache |
  4. +----------------------------------------------------------------------+
  5. | Copyright (c) The PHP Group |
  6. +----------------------------------------------------------------------+
  7. | This source file is subject to version 3.01 of the PHP license, |
  8. | that is bundled with this package in the file LICENSE, and is |
  9. | available through the world-wide-web at the following url: |
  10. | https://www.php.net/license/3_01.txt |
  11. | If you did not receive a copy of the PHP license and are unable to |
  12. | obtain it through the world-wide-web, please send a note to |
  13. | license@php.net so we can mail you a copy immediately. |
  14. +----------------------------------------------------------------------+
  15. | Authors: Dmitry Stogov <dmitry@php.net> |
  16. +----------------------------------------------------------------------+
  17. */
  18. #include "Optimizer/zend_optimizer.h"
  19. #include "Optimizer/zend_optimizer_internal.h"
  20. #include "zend_API.h"
  21. #include "zend_constants.h"
  22. #include "zend_execute.h"
  23. #include "zend_vm.h"
  24. #include "zend_bitset.h"
  25. #include "zend_cfg.h"
  26. #include "zend_ssa.h"
  27. #include "zend_func_info.h"
  28. #include "zend_call_graph.h"
  29. #include "zend_inference.h"
  30. #include "zend_dump.h"
  31. #ifndef ZEND_DEBUG_DFA
  32. # define ZEND_DEBUG_DFA ZEND_DEBUG
  33. #endif
  34. #if ZEND_DEBUG_DFA
  35. # include "ssa_integrity.c"
  36. #endif
  37. int zend_dfa_analyze_op_array(zend_op_array *op_array, zend_optimizer_ctx *ctx, zend_ssa *ssa)
  38. {
  39. uint32_t build_flags;
  40. if (op_array->last_try_catch) {
  41. /* TODO: we can't analyze functions with try/catch/finally ??? */
  42. return FAILURE;
  43. }
  44. /* Build SSA */
  45. memset(ssa, 0, sizeof(zend_ssa));
  46. if (zend_build_cfg(&ctx->arena, op_array, ZEND_CFG_NO_ENTRY_PREDECESSORS, &ssa->cfg) != SUCCESS) {
  47. return FAILURE;
  48. }
  49. if ((ssa->cfg.flags & ZEND_FUNC_INDIRECT_VAR_ACCESS)) {
  50. /* TODO: we can't analyze functions with indirect variable access ??? */
  51. return FAILURE;
  52. }
  53. if (zend_cfg_build_predecessors(&ctx->arena, &ssa->cfg) != SUCCESS) {
  54. return FAILURE;
  55. }
  56. if (ctx->debug_level & ZEND_DUMP_DFA_CFG) {
  57. zend_dump_op_array(op_array, ZEND_DUMP_CFG, "dfa cfg", &ssa->cfg);
  58. }
  59. /* Compute Dominators Tree */
  60. if (zend_cfg_compute_dominators_tree(op_array, &ssa->cfg) != SUCCESS) {
  61. return FAILURE;
  62. }
  63. /* Identify reducible and irreducible loops */
  64. if (zend_cfg_identify_loops(op_array, &ssa->cfg) != SUCCESS) {
  65. return FAILURE;
  66. }
  67. if (ctx->debug_level & ZEND_DUMP_DFA_DOMINATORS) {
  68. zend_dump_dominators(op_array, &ssa->cfg);
  69. }
  70. build_flags = 0;
  71. if (ctx->debug_level & ZEND_DUMP_DFA_LIVENESS) {
  72. build_flags |= ZEND_SSA_DEBUG_LIVENESS;
  73. }
  74. if (ctx->debug_level & ZEND_DUMP_DFA_PHI) {
  75. build_flags |= ZEND_SSA_DEBUG_PHI_PLACEMENT;
  76. }
  77. if (zend_build_ssa(&ctx->arena, ctx->script, op_array, build_flags, ssa) != SUCCESS) {
  78. return FAILURE;
  79. }
  80. if (ctx->debug_level & ZEND_DUMP_DFA_SSA) {
  81. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "dfa ssa", ssa);
  82. }
  83. if (zend_ssa_compute_use_def_chains(&ctx->arena, op_array, ssa) != SUCCESS){
  84. return FAILURE;
  85. }
  86. if (zend_ssa_find_false_dependencies(op_array, ssa) != SUCCESS) {
  87. return FAILURE;
  88. }
  89. if (zend_ssa_find_sccs(op_array, ssa) != SUCCESS){
  90. return FAILURE;
  91. }
  92. if (zend_ssa_inference(&ctx->arena, op_array, ctx->script, ssa, ctx->optimization_level) != SUCCESS) {
  93. return FAILURE;
  94. }
  95. if (zend_ssa_escape_analysis(ctx->script, op_array, ssa) != SUCCESS) {
  96. return FAILURE;
  97. }
  98. if (ctx->debug_level & ZEND_DUMP_DFA_SSA_VARS) {
  99. zend_dump_ssa_variables(op_array, ssa, 0);
  100. }
  101. return SUCCESS;
  102. }
  103. static void zend_ssa_remove_nops(zend_op_array *op_array, zend_ssa *ssa, zend_optimizer_ctx *ctx)
  104. {
  105. zend_basic_block *blocks = ssa->cfg.blocks;
  106. zend_basic_block *blocks_end = blocks + ssa->cfg.blocks_count;
  107. zend_basic_block *b;
  108. zend_func_info *func_info;
  109. int j;
  110. uint32_t i = 0;
  111. uint32_t target = 0;
  112. uint32_t *shiftlist;
  113. ALLOCA_FLAG(use_heap);
  114. shiftlist = (uint32_t *)do_alloca(sizeof(uint32_t) * op_array->last, use_heap);
  115. memset(shiftlist, 0, sizeof(uint32_t) * op_array->last);
  116. /* remove empty callee_info */
  117. func_info = ZEND_FUNC_INFO(op_array);
  118. if (func_info) {
  119. zend_call_info **call_info = &func_info->callee_info;
  120. while ((*call_info)) {
  121. if ((*call_info)->caller_init_opline->opcode == ZEND_NOP) {
  122. *call_info = (*call_info)->next_callee;
  123. } else {
  124. call_info = &(*call_info)->next_callee;
  125. }
  126. }
  127. }
  128. for (b = blocks; b < blocks_end; b++) {
  129. if (b->flags & (ZEND_BB_REACHABLE|ZEND_BB_UNREACHABLE_FREE)) {
  130. if (b->len) {
  131. uint32_t new_start, old_end;
  132. while (i < b->start) {
  133. shiftlist[i] = i - target;
  134. i++;
  135. }
  136. if (b->flags & ZEND_BB_UNREACHABLE_FREE) {
  137. /* Only keep the FREE for the loop var */
  138. ZEND_ASSERT(op_array->opcodes[b->start].opcode == ZEND_FREE
  139. || op_array->opcodes[b->start].opcode == ZEND_FE_FREE);
  140. b->len = 1;
  141. }
  142. new_start = target;
  143. old_end = b->start + b->len;
  144. while (i < old_end) {
  145. shiftlist[i] = i - target;
  146. if (EXPECTED(op_array->opcodes[i].opcode != ZEND_NOP)) {
  147. if (i != target) {
  148. op_array->opcodes[target] = op_array->opcodes[i];
  149. ssa->ops[target] = ssa->ops[i];
  150. ssa->cfg.map[target] = b - blocks;
  151. }
  152. target++;
  153. }
  154. i++;
  155. }
  156. b->start = new_start;
  157. if (target != old_end) {
  158. zend_op *opline;
  159. zend_op *new_opline;
  160. b->len = target - b->start;
  161. opline = op_array->opcodes + old_end - 1;
  162. if (opline->opcode == ZEND_NOP) {
  163. continue;
  164. }
  165. new_opline = op_array->opcodes + target - 1;
  166. zend_optimizer_migrate_jump(op_array, new_opline, opline);
  167. }
  168. } else {
  169. b->start = target;
  170. }
  171. } else {
  172. b->start = target;
  173. b->len = 0;
  174. }
  175. }
  176. if (target != op_array->last) {
  177. /* reset rest opcodes */
  178. for (i = target; i < op_array->last; i++) {
  179. MAKE_NOP(op_array->opcodes + i);
  180. }
  181. /* update SSA variables */
  182. for (j = 0; j < ssa->vars_count; j++) {
  183. if (ssa->vars[j].definition >= 0) {
  184. ssa->vars[j].definition -= shiftlist[ssa->vars[j].definition];
  185. }
  186. if (ssa->vars[j].use_chain >= 0) {
  187. ssa->vars[j].use_chain -= shiftlist[ssa->vars[j].use_chain];
  188. }
  189. }
  190. for (i = 0; i < op_array->last; i++) {
  191. if (ssa->ops[i].op1_use_chain >= 0) {
  192. ssa->ops[i].op1_use_chain -= shiftlist[ssa->ops[i].op1_use_chain];
  193. }
  194. if (ssa->ops[i].op2_use_chain >= 0) {
  195. ssa->ops[i].op2_use_chain -= shiftlist[ssa->ops[i].op2_use_chain];
  196. }
  197. if (ssa->ops[i].res_use_chain >= 0) {
  198. ssa->ops[i].res_use_chain -= shiftlist[ssa->ops[i].res_use_chain];
  199. }
  200. }
  201. /* update branch targets */
  202. for (b = blocks; b < blocks_end; b++) {
  203. if ((b->flags & ZEND_BB_REACHABLE) && b->len != 0) {
  204. zend_op *opline = op_array->opcodes + b->start + b->len - 1;
  205. zend_optimizer_shift_jump(op_array, opline, shiftlist);
  206. }
  207. }
  208. /* update try/catch array */
  209. for (j = 0; j < op_array->last_try_catch; j++) {
  210. op_array->try_catch_array[j].try_op -= shiftlist[op_array->try_catch_array[j].try_op];
  211. op_array->try_catch_array[j].catch_op -= shiftlist[op_array->try_catch_array[j].catch_op];
  212. if (op_array->try_catch_array[j].finally_op) {
  213. op_array->try_catch_array[j].finally_op -= shiftlist[op_array->try_catch_array[j].finally_op];
  214. op_array->try_catch_array[j].finally_end -= shiftlist[op_array->try_catch_array[j].finally_end];
  215. }
  216. }
  217. /* update early binding list */
  218. if (op_array->fn_flags & ZEND_ACC_EARLY_BINDING) {
  219. uint32_t *opline_num = &ctx->script->first_early_binding_opline;
  220. ZEND_ASSERT(op_array == &ctx->script->main_op_array);
  221. do {
  222. *opline_num -= shiftlist[*opline_num];
  223. opline_num = &op_array->opcodes[*opline_num].result.opline_num;
  224. } while (*opline_num != (uint32_t)-1);
  225. }
  226. /* update call graph */
  227. if (func_info) {
  228. zend_call_info *call_info = func_info->callee_info;
  229. while (call_info) {
  230. call_info->caller_init_opline -=
  231. shiftlist[call_info->caller_init_opline - op_array->opcodes];
  232. if (call_info->caller_call_opline) {
  233. call_info->caller_call_opline -=
  234. shiftlist[call_info->caller_call_opline - op_array->opcodes];
  235. }
  236. call_info = call_info->next_callee;
  237. }
  238. }
  239. op_array->last = target;
  240. }
  241. free_alloca(shiftlist, use_heap);
  242. }
  243. static bool safe_instanceof(zend_class_entry *ce1, zend_class_entry *ce2) {
  244. if (ce1 == ce2) {
  245. return 1;
  246. }
  247. if (!(ce1->ce_flags & ZEND_ACC_LINKED)) {
  248. /* This case could be generalized, similarly to unlinked_instanceof */
  249. return 0;
  250. }
  251. return instanceof_function(ce1, ce2);
  252. }
  253. static inline bool can_elide_return_type_check(
  254. const zend_script *script, zend_op_array *op_array, zend_ssa *ssa, zend_ssa_op *ssa_op) {
  255. zend_arg_info *arg_info = &op_array->arg_info[-1];
  256. zend_ssa_var_info *use_info = &ssa->var_info[ssa_op->op1_use];
  257. uint32_t use_type = use_info->type & (MAY_BE_ANY|MAY_BE_UNDEF);
  258. if (use_type & MAY_BE_REF) {
  259. return 0;
  260. }
  261. if (use_type & MAY_BE_UNDEF) {
  262. use_type &= ~MAY_BE_UNDEF;
  263. use_type |= MAY_BE_NULL;
  264. }
  265. uint32_t disallowed_types = use_type & ~ZEND_TYPE_PURE_MASK(arg_info->type);
  266. if (!disallowed_types) {
  267. /* Only contains allowed types. */
  268. return true;
  269. }
  270. if (disallowed_types == MAY_BE_OBJECT && use_info->ce && ZEND_TYPE_IS_COMPLEX(arg_info->type)) {
  271. zend_type *single_type;
  272. /* For intersection: result==false is failure, default is success.
  273. * For union: result==true is success, default is failure. */
  274. bool is_intersection = ZEND_TYPE_IS_INTERSECTION(arg_info->type);
  275. ZEND_TYPE_FOREACH(arg_info->type, single_type) {
  276. if (ZEND_TYPE_HAS_NAME(*single_type)) {
  277. zend_string *lcname = zend_string_tolower(ZEND_TYPE_NAME(*single_type));
  278. zend_class_entry *ce = zend_optimizer_get_class_entry(script, lcname);
  279. zend_string_release(lcname);
  280. bool result = ce && safe_instanceof(use_info->ce, ce);
  281. if (result == !is_intersection) {
  282. return result;
  283. }
  284. }
  285. } ZEND_TYPE_FOREACH_END();
  286. return is_intersection;
  287. }
  288. return false;
  289. }
  290. static bool opline_supports_assign_contraction(
  291. zend_op_array *op_array, zend_ssa *ssa, zend_op *opline, int src_var, uint32_t cv_var) {
  292. if (opline->opcode == ZEND_NEW) {
  293. /* see Zend/tests/generators/aborted_yield_during_new.phpt */
  294. return 0;
  295. }
  296. if (opline->opcode == ZEND_DO_ICALL || opline->opcode == ZEND_DO_UCALL
  297. || opline->opcode == ZEND_DO_FCALL || opline->opcode == ZEND_DO_FCALL_BY_NAME) {
  298. /* Function calls may dtor the return value after it has already been written -- allow
  299. * direct assignment only for types where a double-dtor does not matter. */
  300. uint32_t type = ssa->var_info[src_var].type;
  301. uint32_t simple = MAY_BE_NULL|MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_LONG|MAY_BE_DOUBLE;
  302. return !((type & MAY_BE_ANY) & ~simple);
  303. }
  304. if (opline->opcode == ZEND_POST_INC || opline->opcode == ZEND_POST_DEC) {
  305. /* POST_INC/DEC write the result variable before performing the inc/dec. For $i = $i++
  306. * eliding the temporary variable would thus yield an incorrect result. */
  307. return opline->op1_type != IS_CV || opline->op1.var != cv_var;
  308. }
  309. if (opline->opcode == ZEND_INIT_ARRAY) {
  310. /* INIT_ARRAY initializes the result array before reading key/value. */
  311. return (opline->op1_type != IS_CV || opline->op1.var != cv_var)
  312. && (opline->op2_type != IS_CV || opline->op2.var != cv_var);
  313. }
  314. if (opline->opcode == ZEND_CAST
  315. && (opline->extended_value == IS_ARRAY || opline->extended_value == IS_OBJECT)) {
  316. /* CAST to array/object may initialize the result to an empty array/object before
  317. * reading the expression. */
  318. return opline->op1_type != IS_CV || opline->op1.var != cv_var;
  319. }
  320. if ((opline->opcode == ZEND_ASSIGN_OP
  321. || opline->opcode == ZEND_ASSIGN_OBJ
  322. || opline->opcode == ZEND_ASSIGN_DIM)
  323. && opline->op1_type == IS_CV
  324. && opline->op1.var == cv_var
  325. && zend_may_throw(opline, &ssa->ops[ssa->vars[src_var].definition], op_array, ssa)) {
  326. return 0;
  327. }
  328. return 1;
  329. }
  330. static bool variable_defined_or_used_in_range(zend_ssa *ssa, int var, int start, int end)
  331. {
  332. while (start < end) {
  333. const zend_ssa_op *ssa_op = &ssa->ops[start];
  334. if ((ssa_op->op1_def >= 0 && ssa->vars[ssa_op->op1_def].var == var) ||
  335. (ssa_op->op2_def >= 0 && ssa->vars[ssa_op->op2_def].var == var) ||
  336. (ssa_op->result_def >= 0 && ssa->vars[ssa_op->result_def].var == var) ||
  337. (ssa_op->op1_use >= 0 && ssa->vars[ssa_op->op1_use].var == var) ||
  338. (ssa_op->op2_use >= 0 && ssa->vars[ssa_op->op2_use].var == var) ||
  339. (ssa_op->result_use >= 0 && ssa->vars[ssa_op->result_use].var == var)
  340. ) {
  341. return 1;
  342. }
  343. start++;
  344. }
  345. return 0;
  346. }
  347. int zend_dfa_optimize_calls(zend_op_array *op_array, zend_ssa *ssa)
  348. {
  349. zend_func_info *func_info = ZEND_FUNC_INFO(op_array);
  350. int removed_ops = 0;
  351. if (func_info->callee_info) {
  352. zend_call_info *call_info = func_info->callee_info;
  353. do {
  354. if (call_info->caller_call_opline
  355. && call_info->caller_call_opline->opcode == ZEND_DO_ICALL
  356. && call_info->callee_func
  357. && zend_string_equals_literal(call_info->callee_func->common.function_name, "in_array")
  358. && (call_info->caller_init_opline->extended_value == 2
  359. || (call_info->caller_init_opline->extended_value == 3
  360. && (call_info->caller_call_opline - 1)->opcode == ZEND_SEND_VAL
  361. && (call_info->caller_call_opline - 1)->op1_type == IS_CONST))) {
  362. zend_op *send_array;
  363. zend_op *send_needly;
  364. bool strict = 0;
  365. ZEND_ASSERT(!call_info->is_prototype);
  366. if (call_info->caller_init_opline->extended_value == 2) {
  367. send_array = call_info->caller_call_opline - 1;
  368. send_needly = call_info->caller_call_opline - 2;
  369. } else {
  370. if (zend_is_true(CT_CONSTANT_EX(op_array, (call_info->caller_call_opline - 1)->op1.constant))) {
  371. strict = 1;
  372. }
  373. send_array = call_info->caller_call_opline - 2;
  374. send_needly = call_info->caller_call_opline - 3;
  375. }
  376. if (send_array->opcode == ZEND_SEND_VAL
  377. && send_array->op1_type == IS_CONST
  378. && Z_TYPE_P(CT_CONSTANT_EX(op_array, send_array->op1.constant)) == IS_ARRAY
  379. && (send_needly->opcode == ZEND_SEND_VAL
  380. || send_needly->opcode == ZEND_SEND_VAR)
  381. ) {
  382. int ok = 1;
  383. HashTable *src = Z_ARRVAL_P(CT_CONSTANT_EX(op_array, send_array->op1.constant));
  384. HashTable *dst;
  385. zval *val, tmp;
  386. zend_ulong idx;
  387. ZVAL_TRUE(&tmp);
  388. dst = zend_new_array(zend_hash_num_elements(src));
  389. if (strict) {
  390. ZEND_HASH_FOREACH_VAL(src, val) {
  391. if (Z_TYPE_P(val) == IS_STRING) {
  392. zend_hash_add(dst, Z_STR_P(val), &tmp);
  393. } else if (Z_TYPE_P(val) == IS_LONG) {
  394. zend_hash_index_add(dst, Z_LVAL_P(val), &tmp);
  395. } else {
  396. zend_array_destroy(dst);
  397. ok = 0;
  398. break;
  399. }
  400. } ZEND_HASH_FOREACH_END();
  401. } else {
  402. ZEND_HASH_FOREACH_VAL(src, val) {
  403. if (Z_TYPE_P(val) != IS_STRING || ZEND_HANDLE_NUMERIC(Z_STR_P(val), idx)) {
  404. zend_array_destroy(dst);
  405. ok = 0;
  406. break;
  407. }
  408. zend_hash_add(dst, Z_STR_P(val), &tmp);
  409. } ZEND_HASH_FOREACH_END();
  410. }
  411. if (ok) {
  412. uint32_t op_num = send_needly - op_array->opcodes;
  413. zend_ssa_op *ssa_op = ssa->ops + op_num;
  414. if (ssa_op->op1_use >= 0) {
  415. /* Reconstruct SSA */
  416. int var_num = ssa_op->op1_use;
  417. zend_ssa_var *var = ssa->vars + var_num;
  418. ZEND_ASSERT(ssa_op->op1_def < 0);
  419. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  420. ssa_op->op1_use = -1;
  421. ssa_op->op1_use_chain = -1;
  422. op_num = call_info->caller_call_opline - op_array->opcodes;
  423. ssa_op = ssa->ops + op_num;
  424. ssa_op->op1_use = var_num;
  425. ssa_op->op1_use_chain = var->use_chain;
  426. var->use_chain = op_num;
  427. }
  428. ZVAL_ARR(&tmp, dst);
  429. /* Update opcode */
  430. call_info->caller_call_opline->opcode = ZEND_IN_ARRAY;
  431. call_info->caller_call_opline->extended_value = strict;
  432. call_info->caller_call_opline->op1_type = send_needly->op1_type;
  433. call_info->caller_call_opline->op1.num = send_needly->op1.num;
  434. call_info->caller_call_opline->op2_type = IS_CONST;
  435. call_info->caller_call_opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  436. if (call_info->caller_init_opline->extended_value == 3) {
  437. MAKE_NOP(call_info->caller_call_opline - 1);
  438. }
  439. MAKE_NOP(call_info->caller_init_opline);
  440. MAKE_NOP(send_needly);
  441. MAKE_NOP(send_array);
  442. removed_ops++;
  443. op_num = call_info->caller_call_opline - op_array->opcodes;
  444. ssa_op = ssa->ops + op_num;
  445. if (ssa_op->result_def >= 0) {
  446. int var = ssa_op->result_def;
  447. int use = ssa->vars[var].use_chain;
  448. /* If the result is used only in a JMPZ/JMPNZ, replace result type with
  449. * IS_TMP_VAR, which will enable use of smart branches. Don't do this
  450. * in other cases, as not all opcodes support both VAR and TMP. */
  451. if (ssa->vars[var].phi_use_chain == NULL
  452. && ssa->ops[use].op1_use == var
  453. && ssa->ops[use].op1_use_chain == -1
  454. && (op_array->opcodes[use].opcode == ZEND_JMPZ
  455. || op_array->opcodes[use].opcode == ZEND_JMPNZ)) {
  456. call_info->caller_call_opline->result_type = IS_TMP_VAR;
  457. op_array->opcodes[use].op1_type = IS_TMP_VAR;
  458. }
  459. }
  460. }
  461. }
  462. }
  463. call_info = call_info->next_callee;
  464. } while (call_info);
  465. }
  466. return removed_ops;
  467. }
  468. static zend_always_inline void take_successor_0(zend_ssa *ssa, int block_num, zend_basic_block *block)
  469. {
  470. if (block->successors_count == 2) {
  471. if (block->successors[1] != block->successors[0]) {
  472. zend_ssa_remove_predecessor(ssa, block_num, block->successors[1]);
  473. }
  474. block->successors_count = 1;
  475. }
  476. }
  477. static zend_always_inline void take_successor_1(zend_ssa *ssa, int block_num, zend_basic_block *block)
  478. {
  479. if (block->successors_count == 2) {
  480. if (block->successors[1] != block->successors[0]) {
  481. zend_ssa_remove_predecessor(ssa, block_num, block->successors[0]);
  482. block->successors[0] = block->successors[1];
  483. }
  484. block->successors_count = 1;
  485. }
  486. }
  487. static zend_always_inline void take_successor_ex(zend_ssa *ssa, int block_num, zend_basic_block *block, int target_block)
  488. {
  489. int i;
  490. for (i = 0; i < block->successors_count; i++) {
  491. if (block->successors[i] != target_block) {
  492. zend_ssa_remove_predecessor(ssa, block_num, block->successors[i]);
  493. }
  494. }
  495. block->successors[0] = target_block;
  496. block->successors_count = 1;
  497. }
  498. static void compress_block(zend_op_array *op_array, zend_basic_block *block)
  499. {
  500. while (block->len > 0) {
  501. zend_op *opline = &op_array->opcodes[block->start + block->len - 1];
  502. if (opline->opcode == ZEND_NOP) {
  503. block->len--;
  504. } else {
  505. break;
  506. }
  507. }
  508. }
  509. static void replace_predecessor(zend_ssa *ssa, int block_id, int old_pred, int new_pred) {
  510. zend_basic_block *block = &ssa->cfg.blocks[block_id];
  511. int *predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  512. zend_ssa_phi *phi;
  513. int i;
  514. int old_pred_idx = -1;
  515. int new_pred_idx = -1;
  516. for (i = 0; i < block->predecessors_count; i++) {
  517. if (predecessors[i] == old_pred) {
  518. old_pred_idx = i;
  519. }
  520. if (predecessors[i] == new_pred) {
  521. new_pred_idx = i;
  522. }
  523. }
  524. ZEND_ASSERT(old_pred_idx != -1);
  525. if (new_pred_idx == -1) {
  526. /* If the new predecessor doesn't exist yet, simply rewire the old one */
  527. predecessors[old_pred_idx] = new_pred;
  528. } else {
  529. /* Otherwise, rewiring the old predecessor would make the new predecessor appear
  530. * twice, which violates our CFG invariants. Remove the old predecessor instead. */
  531. memmove(
  532. predecessors + old_pred_idx,
  533. predecessors + old_pred_idx + 1,
  534. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  535. );
  536. /* Also remove the corresponding phi node entries */
  537. for (phi = ssa->blocks[block_id].phis; phi; phi = phi->next) {
  538. if (phi->pi >= 0) {
  539. if (phi->pi == old_pred || phi->pi == new_pred) {
  540. zend_ssa_rename_var_uses(
  541. ssa, phi->ssa_var, phi->sources[0], /* update_types */ 0);
  542. zend_ssa_remove_phi(ssa, phi);
  543. }
  544. } else {
  545. memmove(
  546. phi->sources + old_pred_idx,
  547. phi->sources + old_pred_idx + 1,
  548. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  549. );
  550. }
  551. }
  552. block->predecessors_count--;
  553. }
  554. }
  555. static void zend_ssa_replace_control_link(zend_op_array *op_array, zend_ssa *ssa, int from, int to, int new_to)
  556. {
  557. zend_basic_block *src = &ssa->cfg.blocks[from];
  558. zend_basic_block *old = &ssa->cfg.blocks[to];
  559. zend_basic_block *dst = &ssa->cfg.blocks[new_to];
  560. int i;
  561. zend_op *opline;
  562. for (i = 0; i < src->successors_count; i++) {
  563. if (src->successors[i] == to) {
  564. src->successors[i] = new_to;
  565. }
  566. }
  567. if (src->len > 0) {
  568. opline = op_array->opcodes + src->start + src->len - 1;
  569. switch (opline->opcode) {
  570. case ZEND_JMP:
  571. case ZEND_FAST_CALL:
  572. ZEND_ASSERT(ZEND_OP1_JMP_ADDR(opline) == op_array->opcodes + old->start);
  573. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, op_array->opcodes + dst->start);
  574. break;
  575. case ZEND_JMPZNZ:
  576. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  577. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  578. }
  579. ZEND_FALLTHROUGH;
  580. case ZEND_JMPZ:
  581. case ZEND_JMPNZ:
  582. case ZEND_JMPZ_EX:
  583. case ZEND_JMPNZ_EX:
  584. case ZEND_FE_RESET_R:
  585. case ZEND_FE_RESET_RW:
  586. case ZEND_JMP_SET:
  587. case ZEND_COALESCE:
  588. case ZEND_ASSERT_CHECK:
  589. case ZEND_JMP_NULL:
  590. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  591. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  592. }
  593. break;
  594. case ZEND_CATCH:
  595. if (!(opline->extended_value & ZEND_LAST_CATCH)) {
  596. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  597. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  598. }
  599. }
  600. break;
  601. case ZEND_FE_FETCH_R:
  602. case ZEND_FE_FETCH_RW:
  603. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  604. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  605. }
  606. break;
  607. case ZEND_SWITCH_LONG:
  608. case ZEND_SWITCH_STRING:
  609. case ZEND_MATCH:
  610. {
  611. HashTable *jumptable = Z_ARRVAL(ZEND_OP2_LITERAL(opline));
  612. zval *zv;
  613. ZEND_HASH_FOREACH_VAL(jumptable, zv) {
  614. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, Z_LVAL_P(zv)) == old->start) {
  615. Z_LVAL_P(zv) = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  616. }
  617. } ZEND_HASH_FOREACH_END();
  618. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  619. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  620. }
  621. break;
  622. }
  623. }
  624. }
  625. replace_predecessor(ssa, new_to, to, from);
  626. }
  627. static void zend_ssa_unlink_block(zend_op_array *op_array, zend_ssa *ssa, zend_basic_block *block, int block_num)
  628. {
  629. if (block->predecessors_count == 1 && ssa->blocks[block_num].phis == NULL) {
  630. int *predecessors, i;
  631. zend_basic_block *fe_fetch_block = NULL;
  632. ZEND_ASSERT(block->successors_count == 1);
  633. predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  634. if (block->predecessors_count == 1 && (block->flags & ZEND_BB_FOLLOW)) {
  635. zend_basic_block *pred_block = &ssa->cfg.blocks[predecessors[0]];
  636. if (pred_block->len > 0 && (pred_block->flags & ZEND_BB_REACHABLE)) {
  637. if ((op_array->opcodes[pred_block->start + pred_block->len - 1].opcode == ZEND_FE_FETCH_R
  638. || op_array->opcodes[pred_block->start + pred_block->len - 1].opcode == ZEND_FE_FETCH_RW)
  639. && op_array->opcodes[pred_block->start + pred_block->len - 1].op2_type == IS_CV) {
  640. fe_fetch_block = pred_block;
  641. }
  642. }
  643. }
  644. for (i = 0; i < block->predecessors_count; i++) {
  645. zend_ssa_replace_control_link(op_array, ssa, predecessors[i], block_num, block->successors[0]);
  646. }
  647. zend_ssa_remove_block(op_array, ssa, block_num);
  648. if (fe_fetch_block && fe_fetch_block->successors[0] == fe_fetch_block->successors[1]) {
  649. /* The body of "foreach" loop was removed */
  650. int ssa_var = ssa->ops[fe_fetch_block->start + fe_fetch_block->len - 1].op2_def;
  651. if (ssa_var >= 0) {
  652. zend_ssa_remove_uses_of_var(ssa, ssa_var);
  653. }
  654. }
  655. }
  656. }
  657. static int zend_dfa_optimize_jmps(zend_op_array *op_array, zend_ssa *ssa)
  658. {
  659. int removed_ops = 0;
  660. int block_num = 0;
  661. for (block_num = 1; block_num < ssa->cfg.blocks_count; block_num++) {
  662. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  663. if (!(block->flags & ZEND_BB_REACHABLE)) {
  664. continue;
  665. }
  666. compress_block(op_array, block);
  667. if (block->len == 0) {
  668. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  669. }
  670. }
  671. block_num = 0;
  672. while (block_num < ssa->cfg.blocks_count
  673. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE)) {
  674. block_num++;
  675. }
  676. while (block_num < ssa->cfg.blocks_count) {
  677. int next_block_num = block_num + 1;
  678. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  679. uint32_t op_num;
  680. zend_op *opline;
  681. zend_ssa_op *ssa_op;
  682. bool can_follow = 1;
  683. while (next_block_num < ssa->cfg.blocks_count
  684. && !(ssa->cfg.blocks[next_block_num].flags & ZEND_BB_REACHABLE)) {
  685. if (ssa->cfg.blocks[next_block_num].flags & ZEND_BB_UNREACHABLE_FREE) {
  686. can_follow = 0;
  687. }
  688. next_block_num++;
  689. }
  690. if (block->len) {
  691. op_num = block->start + block->len - 1;
  692. opline = op_array->opcodes + op_num;
  693. ssa_op = ssa->ops + op_num;
  694. switch (opline->opcode) {
  695. case ZEND_JMP:
  696. optimize_jmp:
  697. if (block->successors[0] == next_block_num && can_follow) {
  698. MAKE_NOP(opline);
  699. removed_ops++;
  700. goto optimize_nop;
  701. }
  702. break;
  703. case ZEND_JMPZ:
  704. optimize_jmpz:
  705. if (opline->op1_type == IS_CONST) {
  706. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  707. MAKE_NOP(opline);
  708. removed_ops++;
  709. take_successor_1(ssa, block_num, block);
  710. goto optimize_nop;
  711. } else {
  712. opline->opcode = ZEND_JMP;
  713. COPY_NODE(opline->op1, opline->op2);
  714. take_successor_0(ssa, block_num, block);
  715. goto optimize_jmp;
  716. }
  717. } else {
  718. if (block->successors[0] == next_block_num && can_follow) {
  719. take_successor_0(ssa, block_num, block);
  720. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  721. opline->opcode = ZEND_CHECK_VAR;
  722. opline->op2.num = 0;
  723. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  724. zend_ssa_remove_instr(ssa, opline, ssa_op);
  725. removed_ops++;
  726. goto optimize_nop;
  727. } else {
  728. opline->opcode = ZEND_FREE;
  729. opline->op2.num = 0;
  730. }
  731. }
  732. }
  733. break;
  734. case ZEND_JMPNZ:
  735. optimize_jmpnz:
  736. if (opline->op1_type == IS_CONST) {
  737. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  738. opline->opcode = ZEND_JMP;
  739. COPY_NODE(opline->op1, opline->op2);
  740. take_successor_0(ssa, block_num, block);
  741. goto optimize_jmp;
  742. } else {
  743. MAKE_NOP(opline);
  744. removed_ops++;
  745. take_successor_1(ssa, block_num, block);
  746. goto optimize_nop;
  747. }
  748. } else if (block->successors_count == 2) {
  749. if (block->successors[0] == next_block_num && can_follow) {
  750. take_successor_0(ssa, block_num, block);
  751. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  752. opline->opcode = ZEND_CHECK_VAR;
  753. opline->op2.num = 0;
  754. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  755. zend_ssa_remove_instr(ssa, opline, ssa_op);
  756. removed_ops++;
  757. goto optimize_nop;
  758. } else {
  759. opline->opcode = ZEND_FREE;
  760. opline->op2.num = 0;
  761. }
  762. }
  763. }
  764. break;
  765. case ZEND_JMPZNZ:
  766. if (opline->op1_type == IS_CONST) {
  767. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  768. zend_op *target_opline = ZEND_OFFSET_TO_OPLINE(opline, opline->extended_value);
  769. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  770. take_successor_1(ssa, block_num, block);
  771. } else {
  772. zend_op *target_opline = ZEND_OP2_JMP_ADDR(opline);
  773. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  774. take_successor_0(ssa, block_num, block);
  775. }
  776. opline->op1_type = IS_UNUSED;
  777. opline->extended_value = 0;
  778. opline->opcode = ZEND_JMP;
  779. goto optimize_jmp;
  780. } else if (block->successors_count == 2) {
  781. if (block->successors[0] == block->successors[1]) {
  782. take_successor_0(ssa, block_num, block);
  783. if (block->successors[0] == next_block_num && can_follow) {
  784. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  785. opline->opcode = ZEND_CHECK_VAR;
  786. opline->op2.num = 0;
  787. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  788. zend_ssa_remove_instr(ssa, opline, ssa_op);
  789. removed_ops++;
  790. goto optimize_nop;
  791. } else {
  792. opline->opcode = ZEND_FREE;
  793. opline->op2.num = 0;
  794. }
  795. } else if ((opline->op1_type == IS_CV && !(OP1_INFO() & MAY_BE_UNDEF)) || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  796. ZEND_ASSERT(ssa_op->op1_use >= 0);
  797. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  798. ssa_op->op1_use = -1;
  799. ssa_op->op1_use_chain = -1;
  800. opline->opcode = ZEND_JMP;
  801. opline->op1_type = IS_UNUSED;
  802. opline->op1.num = opline->op2.num;
  803. goto optimize_jmp;
  804. }
  805. }
  806. }
  807. break;
  808. case ZEND_JMPZ_EX:
  809. if (ssa->vars[ssa_op->result_def].use_chain < 0
  810. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  811. opline->opcode = ZEND_JMPZ;
  812. opline->result_type = IS_UNUSED;
  813. zend_ssa_remove_result_def(ssa, ssa_op);
  814. goto optimize_jmpz;
  815. } else if (opline->op1_type == IS_CONST) {
  816. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  817. opline->opcode = ZEND_QM_ASSIGN;
  818. take_successor_1(ssa, block_num, block);
  819. }
  820. }
  821. break;
  822. case ZEND_JMPNZ_EX:
  823. if (ssa->vars[ssa_op->result_def].use_chain < 0
  824. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  825. opline->opcode = ZEND_JMPNZ;
  826. opline->result_type = IS_UNUSED;
  827. zend_ssa_remove_result_def(ssa, ssa_op);
  828. goto optimize_jmpnz;
  829. } else if (opline->op1_type == IS_CONST) {
  830. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  831. opline->opcode = ZEND_QM_ASSIGN;
  832. take_successor_1(ssa, block_num, block);
  833. }
  834. }
  835. break;
  836. case ZEND_JMP_SET:
  837. if (ssa->vars[ssa_op->result_def].use_chain < 0
  838. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  839. opline->opcode = ZEND_JMPNZ;
  840. opline->result_type = IS_UNUSED;
  841. zend_ssa_remove_result_def(ssa, ssa_op);
  842. goto optimize_jmpnz;
  843. } else if (opline->op1_type == IS_CONST) {
  844. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  845. MAKE_NOP(opline);
  846. removed_ops++;
  847. take_successor_1(ssa, block_num, block);
  848. zend_ssa_remove_result_def(ssa, ssa_op);
  849. goto optimize_nop;
  850. }
  851. }
  852. break;
  853. case ZEND_COALESCE:
  854. {
  855. zend_ssa_var *var = &ssa->vars[ssa_op->result_def];
  856. if (opline->op1_type == IS_CONST
  857. && var->use_chain < 0 && var->phi_use_chain == NULL) {
  858. if (Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_NULL) {
  859. zend_ssa_remove_result_def(ssa, ssa_op);
  860. MAKE_NOP(opline);
  861. removed_ops++;
  862. take_successor_1(ssa, block_num, block);
  863. goto optimize_nop;
  864. } else {
  865. opline->opcode = ZEND_JMP;
  866. opline->result_type = IS_UNUSED;
  867. zend_ssa_remove_result_def(ssa, ssa_op);
  868. COPY_NODE(opline->op1, opline->op2);
  869. take_successor_0(ssa, block_num, block);
  870. goto optimize_jmp;
  871. }
  872. }
  873. break;
  874. }
  875. case ZEND_JMP_NULL:
  876. {
  877. zend_ssa_var *var = &ssa->vars[ssa_op->result_def];
  878. if (opline->op1_type == IS_CONST
  879. && var->use_chain < 0 && var->phi_use_chain == NULL) {
  880. if (Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_NULL) {
  881. opline->opcode = ZEND_JMP;
  882. opline->result_type = IS_UNUSED;
  883. zend_ssa_remove_result_def(ssa, ssa_op);
  884. COPY_NODE(opline->op1, opline->op2);
  885. take_successor_0(ssa, block_num, block);
  886. goto optimize_jmp;
  887. } else {
  888. zend_ssa_remove_result_def(ssa, ssa_op);
  889. MAKE_NOP(opline);
  890. removed_ops++;
  891. take_successor_1(ssa, block_num, block);
  892. goto optimize_nop;
  893. }
  894. }
  895. break;
  896. }
  897. case ZEND_SWITCH_LONG:
  898. case ZEND_SWITCH_STRING:
  899. case ZEND_MATCH:
  900. if (opline->op1_type == IS_CONST) {
  901. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  902. zend_uchar type = Z_TYPE_P(zv);
  903. bool correct_type =
  904. (opline->opcode == ZEND_SWITCH_LONG && type == IS_LONG)
  905. || (opline->opcode == ZEND_SWITCH_STRING && type == IS_STRING)
  906. || (opline->opcode == ZEND_MATCH && (type == IS_LONG || type == IS_STRING));
  907. if (!correct_type) {
  908. removed_ops++;
  909. MAKE_NOP(opline);
  910. opline->extended_value = 0;
  911. take_successor_ex(ssa, block_num, block, block->successors[block->successors_count - 1]);
  912. goto optimize_nop;
  913. } else {
  914. HashTable *jmptable = Z_ARRVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant));
  915. zval *jmp_zv = type == IS_LONG
  916. ? zend_hash_index_find(jmptable, Z_LVAL_P(zv))
  917. : zend_hash_find(jmptable, Z_STR_P(zv));
  918. uint32_t target;
  919. if (jmp_zv) {
  920. target = ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, Z_LVAL_P(jmp_zv));
  921. } else {
  922. target = ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value);
  923. }
  924. opline->opcode = ZEND_JMP;
  925. opline->extended_value = 0;
  926. SET_UNUSED(opline->op1);
  927. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, op_array->opcodes + target);
  928. SET_UNUSED(opline->op2);
  929. take_successor_ex(ssa, block_num, block, ssa->cfg.map[target]);
  930. goto optimize_jmp;
  931. }
  932. }
  933. break;
  934. case ZEND_NOP:
  935. optimize_nop:
  936. compress_block(op_array, block);
  937. if (block->len == 0) {
  938. if (block_num > 0) {
  939. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  940. /* backtrack to previous basic block */
  941. do {
  942. block_num--;
  943. } while (block_num >= 0
  944. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE));
  945. if (block_num >= 0) {
  946. continue;
  947. }
  948. }
  949. }
  950. break;
  951. default:
  952. break;
  953. }
  954. }
  955. block_num = next_block_num;
  956. }
  957. return removed_ops;
  958. }
  959. static int zend_dfa_try_to_replace_result(zend_op_array *op_array, zend_ssa *ssa, int def, int cv_var)
  960. {
  961. int result_var = ssa->ops[def].result_def;
  962. int cv = EX_NUM_TO_VAR(ssa->vars[cv_var].var);
  963. if (result_var >= 0
  964. && !(ssa->var_info[cv_var].type & MAY_BE_REF)
  965. && ssa->vars[cv_var].alias == NO_ALIAS
  966. && ssa->vars[result_var].phi_use_chain == NULL
  967. && ssa->vars[result_var].sym_use_chain == NULL) {
  968. int use = ssa->vars[result_var].use_chain;
  969. if (use >= 0
  970. && zend_ssa_next_use(ssa->ops, result_var, use) < 0
  971. && op_array->opcodes[use].opcode != ZEND_FREE
  972. && op_array->opcodes[use].opcode != ZEND_SEND_VAL
  973. && op_array->opcodes[use].opcode != ZEND_SEND_VAL_EX
  974. && op_array->opcodes[use].opcode != ZEND_VERIFY_RETURN_TYPE
  975. && op_array->opcodes[use].opcode != ZEND_YIELD) {
  976. if (use > def) {
  977. int i = use;
  978. const zend_op *opline = &op_array->opcodes[use];
  979. while (i > def) {
  980. if ((opline->op1_type == IS_CV && opline->op1.var == cv)
  981. || (opline->op2_type == IS_CV && opline->op2.var == cv)
  982. || (opline->result_type == IS_CV && opline->result.var == cv)) {
  983. return 0;
  984. }
  985. opline--;
  986. i--;
  987. }
  988. /* Update opcodes and reconstruct SSA */
  989. ssa->vars[result_var].definition = -1;
  990. ssa->vars[result_var].use_chain = -1;
  991. ssa->ops[def].result_def = -1;
  992. op_array->opcodes[def].result_type = IS_UNUSED;
  993. op_array->opcodes[def].result.var = 0;
  994. if (ssa->ops[use].op1_use == result_var) {
  995. ssa->ops[use].op1_use = cv_var;
  996. ssa->ops[use].op1_use_chain = ssa->vars[cv_var].use_chain;
  997. ssa->vars[cv_var].use_chain = use;
  998. op_array->opcodes[use].op1_type = IS_CV;
  999. op_array->opcodes[use].op1.var = cv;
  1000. } else if (ssa->ops[use].op2_use == result_var) {
  1001. ssa->ops[use].op2_use = cv_var;
  1002. ssa->ops[use].op2_use_chain = ssa->vars[cv_var].use_chain;
  1003. ssa->vars[cv_var].use_chain = use;
  1004. op_array->opcodes[use].op2_type = IS_CV;
  1005. op_array->opcodes[use].op2.var = cv;
  1006. } else if (ssa->ops[use].result_use == result_var) {
  1007. ssa->ops[use].result_use = cv_var;
  1008. ssa->ops[use].res_use_chain = ssa->vars[cv_var].use_chain;
  1009. ssa->vars[cv_var].use_chain = use;
  1010. op_array->opcodes[use].result_type = IS_CV;
  1011. op_array->opcodes[use].result.var = cv;
  1012. }
  1013. return 1;
  1014. }
  1015. }
  1016. }
  1017. return 0;
  1018. }
  1019. void zend_dfa_optimize_op_array(zend_op_array *op_array, zend_optimizer_ctx *ctx, zend_ssa *ssa, zend_call_info **call_map)
  1020. {
  1021. if (ctx->debug_level & ZEND_DUMP_BEFORE_DFA_PASS) {
  1022. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "before dfa pass", ssa);
  1023. }
  1024. if (ssa->var_info) {
  1025. int op_1;
  1026. int v;
  1027. int remove_nops = 0;
  1028. zend_op *opline;
  1029. zend_ssa_op *ssa_op;
  1030. zval tmp;
  1031. #if ZEND_DEBUG_DFA
  1032. ssa_verify_integrity(op_array, ssa, "before dfa");
  1033. #endif
  1034. if (ZEND_OPTIMIZER_PASS_8 & ctx->optimization_level) {
  1035. if (sccp_optimize_op_array(ctx, op_array, ssa, call_map)) {
  1036. remove_nops = 1;
  1037. }
  1038. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  1039. remove_nops = 1;
  1040. }
  1041. #if ZEND_DEBUG_DFA
  1042. ssa_verify_integrity(op_array, ssa, "after sccp");
  1043. #endif
  1044. if (ZEND_FUNC_INFO(op_array)) {
  1045. if (zend_dfa_optimize_calls(op_array, ssa)) {
  1046. remove_nops = 1;
  1047. }
  1048. }
  1049. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_8) {
  1050. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after sccp pass", ssa);
  1051. }
  1052. #if ZEND_DEBUG_DFA
  1053. ssa_verify_integrity(op_array, ssa, "after calls");
  1054. #endif
  1055. }
  1056. if (ZEND_OPTIMIZER_PASS_14 & ctx->optimization_level) {
  1057. if (dce_optimize_op_array(op_array, ssa, 0)) {
  1058. remove_nops = 1;
  1059. }
  1060. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  1061. remove_nops = 1;
  1062. }
  1063. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_14) {
  1064. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dce pass", ssa);
  1065. }
  1066. #if ZEND_DEBUG_DFA
  1067. ssa_verify_integrity(op_array, ssa, "after dce");
  1068. #endif
  1069. }
  1070. for (v = op_array->last_var; v < ssa->vars_count; v++) {
  1071. op_1 = ssa->vars[v].definition;
  1072. if (op_1 < 0) {
  1073. continue;
  1074. }
  1075. opline = op_array->opcodes + op_1;
  1076. ssa_op = &ssa->ops[op_1];
  1077. /* Convert LONG constants to DOUBLE */
  1078. if (ssa->var_info[v].use_as_double) {
  1079. if (opline->opcode == ZEND_ASSIGN
  1080. && opline->op2_type == IS_CONST
  1081. && ssa->ops[op_1].op1_def == v
  1082. && !RETURN_VALUE_USED(opline)
  1083. ) {
  1084. // op_1: ASSIGN ? -> #v [use_as_double], long(?) => ASSIGN ? -> #v, double(?)
  1085. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1086. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  1087. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1088. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  1089. } else if (opline->opcode == ZEND_QM_ASSIGN
  1090. && opline->op1_type == IS_CONST
  1091. ) {
  1092. // op_1: QM_ASSIGN #v [use_as_double], long(?) => QM_ASSIGN #v, double(?)
  1093. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1094. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  1095. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1096. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  1097. }
  1098. } else {
  1099. if (opline->opcode == ZEND_ADD
  1100. || opline->opcode == ZEND_SUB
  1101. || opline->opcode == ZEND_MUL
  1102. || opline->opcode == ZEND_IS_EQUAL
  1103. || opline->opcode == ZEND_IS_NOT_EQUAL
  1104. || opline->opcode == ZEND_IS_SMALLER
  1105. || opline->opcode == ZEND_IS_SMALLER_OR_EQUAL
  1106. ) {
  1107. if (opline->op1_type == IS_CONST && opline->op2_type != IS_CONST) {
  1108. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1109. if ((OP2_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  1110. && Z_TYPE_INFO_P(zv) == IS_LONG) {
  1111. // op_1: #v.? = ADD long(?), #?.? [double] => #v.? = ADD double(?), #?.? [double]
  1112. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1113. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  1114. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1115. }
  1116. if (opline->opcode == ZEND_ADD) {
  1117. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1118. if (((OP2_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_LONG
  1119. && Z_TYPE_INFO_P(zv) == IS_LONG
  1120. && Z_LVAL_P(zv) == 0)
  1121. || ((OP2_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_DOUBLE
  1122. && Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1123. && Z_DVAL_P(zv) == 0.0)) {
  1124. // op_1: #v.? = ADD 0, #?.? [double,long] => #v.? = QM_ASSIGN #?.?
  1125. opline->opcode = ZEND_QM_ASSIGN;
  1126. opline->op1_type = opline->op2_type;
  1127. opline->op1.var = opline->op2.var;
  1128. opline->op2_type = IS_UNUSED;
  1129. opline->op2.num = 0;
  1130. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1131. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1132. ssa->ops[op_1].op2_use = -1;
  1133. ssa->ops[op_1].op2_use_chain = -1;
  1134. }
  1135. } else if (opline->opcode == ZEND_MUL
  1136. && (OP2_INFO() & ((MAY_BE_ANY|MAY_BE_UNDEF)-(MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1137. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1138. if ((Z_TYPE_INFO_P(zv) == IS_LONG
  1139. && Z_LVAL_P(zv) == 2)
  1140. || (Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1141. && Z_DVAL_P(zv) == 2.0
  1142. && !(OP2_INFO() & MAY_BE_LONG))) {
  1143. // op_1: #v.? = MUL 2, #x.? [double,long] => #v.? = ADD #x.?, #x.?
  1144. opline->opcode = ZEND_ADD;
  1145. opline->op1_type = opline->op2_type;
  1146. opline->op1.var = opline->op2.var;
  1147. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1148. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1149. }
  1150. }
  1151. } else if (opline->op1_type != IS_CONST && opline->op2_type == IS_CONST) {
  1152. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1153. if ((OP1_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  1154. && Z_TYPE_INFO_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG) {
  1155. // op_1: #v.? = ADD #?.? [double], long(?) => #v.? = ADD #?.? [double], double(?)
  1156. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1157. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  1158. zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1159. }
  1160. if (opline->opcode == ZEND_ADD || opline->opcode == ZEND_SUB) {
  1161. if (((OP1_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_LONG
  1162. && Z_TYPE_INFO_P(zv) == IS_LONG
  1163. && Z_LVAL_P(zv) == 0)
  1164. || ((OP1_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_DOUBLE
  1165. && Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1166. && Z_DVAL_P(zv) == 0.0)) {
  1167. // op_1: #v.? = ADD #?.? [double,long], 0 => #v.? = QM_ASSIGN #?.?
  1168. opline->opcode = ZEND_QM_ASSIGN;
  1169. opline->op2_type = IS_UNUSED;
  1170. opline->op2.num = 0;
  1171. }
  1172. } else if (opline->opcode == ZEND_MUL
  1173. && (OP1_INFO() & ((MAY_BE_ANY|MAY_BE_UNDEF)-(MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1174. zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1175. if ((Z_TYPE_INFO_P(zv) == IS_LONG
  1176. && Z_LVAL_P(zv) == 2)
  1177. || (Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1178. && Z_DVAL_P(zv) == 2.0
  1179. && !(OP1_INFO() & MAY_BE_LONG))) {
  1180. // op_1: #v.? = MUL #x.? [double,long], 2 => #v.? = ADD #x.?, #x.?
  1181. opline->opcode = ZEND_ADD;
  1182. opline->op2_type = opline->op1_type;
  1183. opline->op2.var = opline->op1.var;
  1184. ssa->ops[op_1].op2_use = ssa->ops[op_1].op1_use;
  1185. ssa->ops[op_1].op2_use_chain = ssa->ops[op_1].op1_use_chain;
  1186. }
  1187. }
  1188. }
  1189. } else if (opline->opcode == ZEND_CONCAT) {
  1190. if (!(OP1_INFO() & MAY_BE_OBJECT)
  1191. && !(OP2_INFO() & MAY_BE_OBJECT)) {
  1192. opline->opcode = ZEND_FAST_CONCAT;
  1193. }
  1194. } else if (opline->opcode == ZEND_VERIFY_RETURN_TYPE
  1195. && opline->op1_type != IS_CONST
  1196. && ssa->ops[op_1].op1_def == v
  1197. && ssa->ops[op_1].op1_use >= 0
  1198. && ssa->ops[op_1].op1_use_chain == -1
  1199. && can_elide_return_type_check(ctx->script, op_array, ssa, &ssa->ops[op_1])) {
  1200. // op_1: VERIFY_RETURN_TYPE #orig_var.? [T] -> #v.? [T] => NOP
  1201. int orig_var = ssa->ops[op_1].op1_use;
  1202. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1203. int ret = ssa->vars[v].use_chain;
  1204. if (ret >= 0) {
  1205. ssa->ops[ret].op1_use = orig_var;
  1206. ssa->ops[ret].op1_use_chain = ssa->vars[orig_var].use_chain;
  1207. ssa->vars[orig_var].use_chain = ret;
  1208. }
  1209. ssa->vars[v].definition = -1;
  1210. ssa->vars[v].use_chain = -1;
  1211. ssa->ops[op_1].op1_def = -1;
  1212. ssa->ops[op_1].op1_use = -1;
  1213. MAKE_NOP(opline);
  1214. remove_nops = 1;
  1215. }
  1216. }
  1217. }
  1218. if (opline->opcode == ZEND_QM_ASSIGN
  1219. && ssa->ops[op_1].result_def == v
  1220. && opline->op1_type & (IS_TMP_VAR|IS_VAR)
  1221. && !(ssa->var_info[v].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  1222. ) {
  1223. int src_var = ssa->ops[op_1].op1_use;
  1224. if (src_var >= 0
  1225. && !(ssa->var_info[src_var].type & MAY_BE_REF)
  1226. && (ssa->var_info[src_var].type & (MAY_BE_UNDEF|MAY_BE_ANY))
  1227. && ssa->vars[src_var].definition >= 0
  1228. && ssa->ops[ssa->vars[src_var].definition].result_def == src_var
  1229. && ssa->ops[ssa->vars[src_var].definition].result_use < 0
  1230. && ssa->vars[src_var].use_chain == op_1
  1231. && ssa->ops[op_1].op1_use_chain < 0
  1232. && !ssa->vars[src_var].phi_use_chain
  1233. && !ssa->vars[src_var].sym_use_chain
  1234. && opline_supports_assign_contraction(
  1235. op_array, ssa, &op_array->opcodes[ssa->vars[src_var].definition],
  1236. src_var, opline->result.var)
  1237. && !variable_defined_or_used_in_range(ssa, EX_VAR_TO_NUM(opline->result.var),
  1238. ssa->vars[src_var].definition+1, op_1)
  1239. ) {
  1240. int orig_var = ssa->ops[op_1].result_use;
  1241. int op_2 = ssa->vars[src_var].definition;
  1242. // op_2: #src_var.T = OP ... => #v.CV = OP ...
  1243. // op_1: QM_ASSIGN #src_var.T #orig_var.CV [undef,scalar] -> #v.CV, NOP
  1244. if (orig_var < 0 || zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1245. /* Reconstruct SSA */
  1246. ssa->vars[v].definition = op_2;
  1247. ssa->ops[op_2].result_def = v;
  1248. ssa->vars[src_var].definition = -1;
  1249. ssa->vars[src_var].use_chain = -1;
  1250. ssa->ops[op_1].op1_use = -1;
  1251. ssa->ops[op_1].op1_def = -1;
  1252. ssa->ops[op_1].op1_use_chain = -1;
  1253. ssa->ops[op_1].result_use = -1;
  1254. ssa->ops[op_1].result_def = -1;
  1255. ssa->ops[op_1].res_use_chain = -1;
  1256. /* Update opcodes */
  1257. op_array->opcodes[op_2].result_type = opline->result_type;
  1258. op_array->opcodes[op_2].result.var = opline->result.var;
  1259. MAKE_NOP(opline);
  1260. remove_nops = 1;
  1261. if (op_array->opcodes[op_2].opcode == ZEND_SUB
  1262. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1263. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1264. && op_array->opcodes[op_2].op2_type == IS_CONST
  1265. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1266. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1267. && ssa->ops[op_2].op1_use >= 0
  1268. && !(ssa->var_info[ssa->ops[op_2].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1269. op_array->opcodes[op_2].opcode = ZEND_PRE_DEC;
  1270. SET_UNUSED(op_array->opcodes[op_2].op2);
  1271. SET_UNUSED(op_array->opcodes[op_2].result);
  1272. ssa->ops[op_2].result_def = -1;
  1273. ssa->ops[op_2].op1_def = v;
  1274. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1275. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1276. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1277. && op_array->opcodes[op_2].op2_type == IS_CONST
  1278. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1279. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1280. && ssa->ops[op_2].op1_use >= 0
  1281. && !(ssa->var_info[ssa->ops[op_2].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1282. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1283. SET_UNUSED(op_array->opcodes[op_2].op2);
  1284. SET_UNUSED(op_array->opcodes[op_2].result);
  1285. ssa->ops[op_2].result_def = -1;
  1286. ssa->ops[op_2].op1_def = v;
  1287. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1288. && op_array->opcodes[op_2].op2_type == op_array->opcodes[op_2].result_type
  1289. && op_array->opcodes[op_2].op2.var == op_array->opcodes[op_2].result.var
  1290. && op_array->opcodes[op_2].op1_type == IS_CONST
  1291. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == IS_LONG
  1292. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == 1
  1293. && ssa->ops[op_2].op2_use >= 0
  1294. && !(ssa->var_info[ssa->ops[op_2].op2_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1295. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1296. op_array->opcodes[op_2].op1_type = op_array->opcodes[op_2].op2_type;
  1297. op_array->opcodes[op_2].op1.var = op_array->opcodes[op_2].op2.var;
  1298. SET_UNUSED(op_array->opcodes[op_2].op2);
  1299. SET_UNUSED(op_array->opcodes[op_2].result);
  1300. ssa->ops[op_2].result_def = -1;
  1301. ssa->ops[op_2].op1_def = v;
  1302. ssa->ops[op_2].op1_use = ssa->ops[op_2].op2_use;
  1303. ssa->ops[op_2].op1_use_chain = ssa->ops[op_2].op2_use_chain;
  1304. ssa->ops[op_2].op2_use = -1;
  1305. ssa->ops[op_2].op2_use_chain = -1;
  1306. }
  1307. }
  1308. }
  1309. }
  1310. if (ssa->vars[v].var >= op_array->last_var) {
  1311. /* skip TMP and VAR */
  1312. continue;
  1313. }
  1314. if (ssa->ops[op_1].op1_def == v
  1315. && RETURN_VALUE_USED(opline)) {
  1316. if (opline->opcode == ZEND_ASSIGN
  1317. || opline->opcode == ZEND_ASSIGN_OP
  1318. || opline->opcode == ZEND_PRE_INC
  1319. || opline->opcode == ZEND_PRE_DEC) {
  1320. zend_dfa_try_to_replace_result(op_array, ssa, op_1, v);
  1321. } else if (opline->opcode == ZEND_POST_INC) {
  1322. int result_var = ssa->ops[op_1].result_def;
  1323. if (result_var >= 0
  1324. && (ssa->var_info[result_var].type & ((MAY_BE_ANY|MAY_BE_REF|MAY_BE_UNDEF) - (MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1325. int use = ssa->vars[result_var].use_chain;
  1326. if (use >= 0 && op_array->opcodes[use].opcode == ZEND_IS_SMALLER
  1327. && ssa->ops[use].op1_use == result_var
  1328. && zend_dfa_try_to_replace_result(op_array, ssa, op_1, v)) {
  1329. opline->opcode = ZEND_PRE_INC;
  1330. op_array->opcodes[use].opcode = ZEND_IS_SMALLER_OR_EQUAL;
  1331. }
  1332. }
  1333. } else if (opline->opcode == ZEND_POST_DEC) {
  1334. int result_var = ssa->ops[op_1].result_def;
  1335. if (result_var >= 0
  1336. && (ssa->var_info[result_var].type & ((MAY_BE_ANY|MAY_BE_REF|MAY_BE_UNDEF) - (MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1337. int use = ssa->vars[result_var].use_chain;
  1338. if (use >= 0 && op_array->opcodes[use].opcode == ZEND_IS_SMALLER
  1339. && ssa->ops[use].op2_use == result_var
  1340. && zend_dfa_try_to_replace_result(op_array, ssa, op_1, v)) {
  1341. opline->opcode = ZEND_PRE_DEC;
  1342. op_array->opcodes[use].opcode = ZEND_IS_SMALLER_OR_EQUAL;
  1343. }
  1344. }
  1345. }
  1346. }
  1347. if (opline->opcode == ZEND_ASSIGN
  1348. && ssa->ops[op_1].op1_def == v
  1349. && !RETURN_VALUE_USED(opline)
  1350. ) {
  1351. int orig_var = ssa->ops[op_1].op1_use;
  1352. if (orig_var >= 0
  1353. && !(ssa->var_info[orig_var].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  1354. ) {
  1355. int src_var = ssa->ops[op_1].op2_use;
  1356. if ((opline->op2_type & (IS_TMP_VAR|IS_VAR))
  1357. && src_var >= 0
  1358. && !(ssa->var_info[src_var].type & MAY_BE_REF)
  1359. && (ssa->var_info[src_var].type & (MAY_BE_UNDEF|MAY_BE_ANY))
  1360. && ssa->vars[src_var].definition >= 0
  1361. && ssa->ops[ssa->vars[src_var].definition].result_def == src_var
  1362. && ssa->ops[ssa->vars[src_var].definition].result_use < 0
  1363. && ssa->vars[src_var].use_chain == op_1
  1364. && ssa->ops[op_1].op2_use_chain < 0
  1365. && !ssa->vars[src_var].phi_use_chain
  1366. && !ssa->vars[src_var].sym_use_chain
  1367. && opline_supports_assign_contraction(
  1368. op_array, ssa, &op_array->opcodes[ssa->vars[src_var].definition],
  1369. src_var, opline->op1.var)
  1370. && !variable_defined_or_used_in_range(ssa, EX_VAR_TO_NUM(opline->op1.var),
  1371. ssa->vars[src_var].definition+1, op_1)
  1372. ) {
  1373. int op_2 = ssa->vars[src_var].definition;
  1374. // op_2: #src_var.T = OP ... => #v.CV = OP ...
  1375. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, #src_var.T NOP
  1376. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1377. /* Reconstruct SSA */
  1378. ssa->vars[v].definition = op_2;
  1379. ssa->ops[op_2].result_def = v;
  1380. ssa->vars[src_var].definition = -1;
  1381. ssa->vars[src_var].use_chain = -1;
  1382. ssa->ops[op_1].op1_use = -1;
  1383. ssa->ops[op_1].op2_use = -1;
  1384. ssa->ops[op_1].op1_def = -1;
  1385. ssa->ops[op_1].op1_use_chain = -1;
  1386. /* Update opcodes */
  1387. op_array->opcodes[op_2].result_type = opline->op1_type;
  1388. op_array->opcodes[op_2].result.var = opline->op1.var;
  1389. MAKE_NOP(opline);
  1390. remove_nops = 1;
  1391. if (op_array->opcodes[op_2].opcode == ZEND_SUB
  1392. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1393. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1394. && op_array->opcodes[op_2].op2_type == IS_CONST
  1395. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1396. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1397. && ssa->ops[op_2].op1_use >= 0
  1398. && !(ssa->var_info[ssa->ops[op_2].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1399. op_array->opcodes[op_2].opcode = ZEND_PRE_DEC;
  1400. SET_UNUSED(op_array->opcodes[op_2].op2);
  1401. SET_UNUSED(op_array->opcodes[op_2].result);
  1402. ssa->ops[op_2].result_def = -1;
  1403. ssa->ops[op_2].op1_def = v;
  1404. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1405. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1406. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1407. && op_array->opcodes[op_2].op2_type == IS_CONST
  1408. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1409. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1410. && ssa->ops[op_2].op1_use >= 0
  1411. && !(ssa->var_info[ssa->ops[op_2].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1412. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1413. SET_UNUSED(op_array->opcodes[op_2].op2);
  1414. SET_UNUSED(op_array->opcodes[op_2].result);
  1415. ssa->ops[op_2].result_def = -1;
  1416. ssa->ops[op_2].op1_def = v;
  1417. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1418. && op_array->opcodes[op_2].op2_type == op_array->opcodes[op_2].result_type
  1419. && op_array->opcodes[op_2].op2.var == op_array->opcodes[op_2].result.var
  1420. && op_array->opcodes[op_2].op1_type == IS_CONST
  1421. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == IS_LONG
  1422. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == 1
  1423. && ssa->ops[op_2].op2_use >= 0
  1424. && !(ssa->var_info[ssa->ops[op_2].op2_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1425. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1426. op_array->opcodes[op_2].op1_type = op_array->opcodes[op_2].op2_type;
  1427. op_array->opcodes[op_2].op1.var = op_array->opcodes[op_2].op2.var;
  1428. SET_UNUSED(op_array->opcodes[op_2].op2);
  1429. SET_UNUSED(op_array->opcodes[op_2].result);
  1430. ssa->ops[op_2].result_def = -1;
  1431. ssa->ops[op_2].op1_def = v;
  1432. ssa->ops[op_2].op1_use = ssa->ops[op_2].op2_use;
  1433. ssa->ops[op_2].op1_use_chain = ssa->ops[op_2].op2_use_chain;
  1434. ssa->ops[op_2].op2_use = -1;
  1435. ssa->ops[op_2].op2_use_chain = -1;
  1436. }
  1437. }
  1438. } else if (opline->op2_type == IS_CONST
  1439. || ((opline->op2_type & (IS_TMP_VAR|IS_VAR|IS_CV))
  1440. && ssa->ops[op_1].op2_use >= 0
  1441. && ssa->ops[op_1].op2_def < 0)
  1442. ) {
  1443. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, CONST|TMPVAR => QM_ASSIGN v.CV, CONST|TMPVAR
  1444. if (ssa->ops[op_1].op1_use != ssa->ops[op_1].op2_use) {
  1445. zend_ssa_unlink_use_chain(ssa, op_1, orig_var);
  1446. } else {
  1447. ssa->ops[op_1].op2_use_chain = ssa->ops[op_1].op1_use_chain;
  1448. }
  1449. /* Reconstruct SSA */
  1450. ssa->ops[op_1].result_def = v;
  1451. ssa->ops[op_1].op1_def = -1;
  1452. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1453. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1454. ssa->ops[op_1].op2_use = -1;
  1455. ssa->ops[op_1].op2_use_chain = -1;
  1456. /* Update opcode */
  1457. opline->result_type = opline->op1_type;
  1458. opline->result.var = opline->op1.var;
  1459. opline->op1_type = opline->op2_type;
  1460. opline->op1.var = opline->op2.var;
  1461. opline->op2_type = IS_UNUSED;
  1462. opline->op2.var = 0;
  1463. opline->opcode = ZEND_QM_ASSIGN;
  1464. }
  1465. }
  1466. } else if (opline->opcode == ZEND_ASSIGN_OP
  1467. && opline->extended_value == ZEND_ADD
  1468. && ssa->ops[op_1].op1_def == v
  1469. && opline->op2_type == IS_CONST
  1470. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1471. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1472. && ssa->ops[op_1].op1_use >= 0
  1473. && !(ssa->var_info[ssa->ops[op_1].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1474. // op_1: ASSIGN_ADD #?.CV [undef,null,int,foat] ->#v.CV, int(1) => PRE_INC #?.CV ->#v.CV
  1475. opline->opcode = ZEND_PRE_INC;
  1476. opline->extended_value = 0;
  1477. SET_UNUSED(opline->op2);
  1478. } else if (opline->opcode == ZEND_ASSIGN_OP
  1479. && opline->extended_value == ZEND_SUB
  1480. && ssa->ops[op_1].op1_def == v
  1481. && opline->op2_type == IS_CONST
  1482. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1483. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1484. && ssa->ops[op_1].op1_use >= 0
  1485. && !(ssa->var_info[ssa->ops[op_1].op1_use].type & (MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  1486. // op_1: ASSIGN_SUB #?.CV [undef,null,int,foat] -> #v.CV, int(1) => PRE_DEC #?.CV ->#v.CV
  1487. opline->opcode = ZEND_PRE_DEC;
  1488. opline->extended_value = 0;
  1489. SET_UNUSED(opline->op2);
  1490. } else if (ssa->ops[op_1].op1_def == v
  1491. && !RETURN_VALUE_USED(opline)
  1492. && ssa->ops[op_1].op1_use >= 0
  1493. && !(ssa->var_info[ssa->ops[op_1].op1_use].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  1494. && opline->opcode == ZEND_ASSIGN_OP
  1495. && opline->extended_value != ZEND_CONCAT) {
  1496. // op_1: ASSIGN_OP #orig_var.CV [undef,null,bool,int,double] -> #v.CV, ? => #v.CV = ADD #orig_var.CV, ?
  1497. /* Reconstruct SSA */
  1498. ssa->ops[op_1].result_def = ssa->ops[op_1].op1_def;
  1499. ssa->ops[op_1].op1_def = -1;
  1500. /* Update opcode */
  1501. opline->opcode = opline->extended_value;
  1502. opline->extended_value = 0;
  1503. opline->result_type = opline->op1_type;
  1504. opline->result.var = opline->op1.var;
  1505. }
  1506. }
  1507. #if ZEND_DEBUG_DFA
  1508. ssa_verify_integrity(op_array, ssa, "after dfa");
  1509. #endif
  1510. if (remove_nops) {
  1511. zend_ssa_remove_nops(op_array, ssa, ctx);
  1512. #if ZEND_DEBUG_DFA
  1513. ssa_verify_integrity(op_array, ssa, "after nop");
  1514. #endif
  1515. }
  1516. }
  1517. if (ctx->debug_level & ZEND_DUMP_AFTER_DFA_PASS) {
  1518. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dfa pass", ssa);
  1519. }
  1520. }
  1521. void zend_optimize_dfa(zend_op_array *op_array, zend_optimizer_ctx *ctx)
  1522. {
  1523. void *checkpoint = zend_arena_checkpoint(ctx->arena);
  1524. zend_ssa ssa;
  1525. if (zend_dfa_analyze_op_array(op_array, ctx, &ssa) != SUCCESS) {
  1526. zend_arena_release(&ctx->arena, checkpoint);
  1527. return;
  1528. }
  1529. zend_dfa_optimize_op_array(op_array, ctx, &ssa, NULL);
  1530. /* Destroy SSA */
  1531. zend_arena_release(&ctx->arena, checkpoint);
  1532. }