dfa_pass.c 59 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747
  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->op1_type == IS_CV
  322. && opline->op1.var == cv_var
  323. && zend_may_throw(opline, &ssa->ops[ssa->vars[src_var].definition], op_array, ssa)) {
  324. return 0;
  325. }
  326. return 1;
  327. }
  328. static bool variable_defined_or_used_in_range(zend_ssa *ssa, int var, int start, int end)
  329. {
  330. while (start < end) {
  331. const zend_ssa_op *ssa_op = &ssa->ops[start];
  332. if ((ssa_op->op1_def >= 0 && ssa->vars[ssa_op->op1_def].var == var) ||
  333. (ssa_op->op2_def >= 0 && ssa->vars[ssa_op->op2_def].var == var) ||
  334. (ssa_op->result_def >= 0 && ssa->vars[ssa_op->result_def].var == var) ||
  335. (ssa_op->op1_use >= 0 && ssa->vars[ssa_op->op1_use].var == var) ||
  336. (ssa_op->op2_use >= 0 && ssa->vars[ssa_op->op2_use].var == var) ||
  337. (ssa_op->result_use >= 0 && ssa->vars[ssa_op->result_use].var == var)
  338. ) {
  339. return 1;
  340. }
  341. start++;
  342. }
  343. return 0;
  344. }
  345. int zend_dfa_optimize_calls(zend_op_array *op_array, zend_ssa *ssa)
  346. {
  347. zend_func_info *func_info = ZEND_FUNC_INFO(op_array);
  348. int removed_ops = 0;
  349. if (func_info->callee_info) {
  350. zend_call_info *call_info = func_info->callee_info;
  351. do {
  352. if (call_info->caller_call_opline
  353. && call_info->caller_call_opline->opcode == ZEND_DO_ICALL
  354. && call_info->callee_func
  355. && zend_string_equals_literal(call_info->callee_func->common.function_name, "in_array")
  356. && (call_info->caller_init_opline->extended_value == 2
  357. || (call_info->caller_init_opline->extended_value == 3
  358. && (call_info->caller_call_opline - 1)->opcode == ZEND_SEND_VAL
  359. && (call_info->caller_call_opline - 1)->op1_type == IS_CONST))) {
  360. zend_op *send_array;
  361. zend_op *send_needly;
  362. bool strict = 0;
  363. ZEND_ASSERT(!call_info->is_prototype);
  364. if (call_info->caller_init_opline->extended_value == 2) {
  365. send_array = call_info->caller_call_opline - 1;
  366. send_needly = call_info->caller_call_opline - 2;
  367. } else {
  368. if (zend_is_true(CT_CONSTANT_EX(op_array, (call_info->caller_call_opline - 1)->op1.constant))) {
  369. strict = 1;
  370. }
  371. send_array = call_info->caller_call_opline - 2;
  372. send_needly = call_info->caller_call_opline - 3;
  373. }
  374. if (send_array->opcode == ZEND_SEND_VAL
  375. && send_array->op1_type == IS_CONST
  376. && Z_TYPE_P(CT_CONSTANT_EX(op_array, send_array->op1.constant)) == IS_ARRAY
  377. && (send_needly->opcode == ZEND_SEND_VAL
  378. || send_needly->opcode == ZEND_SEND_VAR)
  379. ) {
  380. int ok = 1;
  381. HashTable *src = Z_ARRVAL_P(CT_CONSTANT_EX(op_array, send_array->op1.constant));
  382. HashTable *dst;
  383. zval *val, tmp;
  384. zend_ulong idx;
  385. ZVAL_TRUE(&tmp);
  386. dst = zend_new_array(zend_hash_num_elements(src));
  387. if (strict) {
  388. ZEND_HASH_FOREACH_VAL(src, val) {
  389. if (Z_TYPE_P(val) == IS_STRING) {
  390. zend_hash_add(dst, Z_STR_P(val), &tmp);
  391. } else if (Z_TYPE_P(val) == IS_LONG) {
  392. zend_hash_index_add(dst, Z_LVAL_P(val), &tmp);
  393. } else {
  394. zend_array_destroy(dst);
  395. ok = 0;
  396. break;
  397. }
  398. } ZEND_HASH_FOREACH_END();
  399. } else {
  400. ZEND_HASH_FOREACH_VAL(src, val) {
  401. if (Z_TYPE_P(val) != IS_STRING || ZEND_HANDLE_NUMERIC(Z_STR_P(val), idx)) {
  402. zend_array_destroy(dst);
  403. ok = 0;
  404. break;
  405. }
  406. zend_hash_add(dst, Z_STR_P(val), &tmp);
  407. } ZEND_HASH_FOREACH_END();
  408. }
  409. if (ok) {
  410. uint32_t op_num = send_needly - op_array->opcodes;
  411. zend_ssa_op *ssa_op = ssa->ops + op_num;
  412. if (ssa_op->op1_use >= 0) {
  413. /* Reconstruct SSA */
  414. int var_num = ssa_op->op1_use;
  415. zend_ssa_var *var = ssa->vars + var_num;
  416. ZEND_ASSERT(ssa_op->op1_def < 0);
  417. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  418. ssa_op->op1_use = -1;
  419. ssa_op->op1_use_chain = -1;
  420. op_num = call_info->caller_call_opline - op_array->opcodes;
  421. ssa_op = ssa->ops + op_num;
  422. ssa_op->op1_use = var_num;
  423. ssa_op->op1_use_chain = var->use_chain;
  424. var->use_chain = op_num;
  425. }
  426. ZVAL_ARR(&tmp, dst);
  427. /* Update opcode */
  428. call_info->caller_call_opline->opcode = ZEND_IN_ARRAY;
  429. call_info->caller_call_opline->extended_value = strict;
  430. call_info->caller_call_opline->op1_type = send_needly->op1_type;
  431. call_info->caller_call_opline->op1.num = send_needly->op1.num;
  432. call_info->caller_call_opline->op2_type = IS_CONST;
  433. call_info->caller_call_opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  434. if (call_info->caller_init_opline->extended_value == 3) {
  435. MAKE_NOP(call_info->caller_call_opline - 1);
  436. }
  437. MAKE_NOP(call_info->caller_init_opline);
  438. MAKE_NOP(send_needly);
  439. MAKE_NOP(send_array);
  440. removed_ops++;
  441. op_num = call_info->caller_call_opline - op_array->opcodes;
  442. ssa_op = ssa->ops + op_num;
  443. if (ssa_op->result_def >= 0) {
  444. int var = ssa_op->result_def;
  445. int use = ssa->vars[var].use_chain;
  446. /* If the result is used only in a JMPZ/JMPNZ, replace result type with
  447. * IS_TMP_VAR, which will enable use of smart branches. Don't do this
  448. * in other cases, as not all opcodes support both VAR and TMP. */
  449. if (ssa->vars[var].phi_use_chain == NULL
  450. && ssa->ops[use].op1_use == var
  451. && ssa->ops[use].op1_use_chain == -1
  452. && (op_array->opcodes[use].opcode == ZEND_JMPZ
  453. || op_array->opcodes[use].opcode == ZEND_JMPNZ)) {
  454. call_info->caller_call_opline->result_type = IS_TMP_VAR;
  455. op_array->opcodes[use].op1_type = IS_TMP_VAR;
  456. }
  457. }
  458. }
  459. }
  460. }
  461. call_info = call_info->next_callee;
  462. } while (call_info);
  463. }
  464. return removed_ops;
  465. }
  466. static zend_always_inline void take_successor_0(zend_ssa *ssa, int block_num, zend_basic_block *block)
  467. {
  468. if (block->successors_count == 2) {
  469. if (block->successors[1] != block->successors[0]) {
  470. zend_ssa_remove_predecessor(ssa, block_num, block->successors[1]);
  471. }
  472. block->successors_count = 1;
  473. }
  474. }
  475. static zend_always_inline void take_successor_1(zend_ssa *ssa, int block_num, zend_basic_block *block)
  476. {
  477. if (block->successors_count == 2) {
  478. if (block->successors[1] != block->successors[0]) {
  479. zend_ssa_remove_predecessor(ssa, block_num, block->successors[0]);
  480. block->successors[0] = block->successors[1];
  481. }
  482. block->successors_count = 1;
  483. }
  484. }
  485. static zend_always_inline void take_successor_ex(zend_ssa *ssa, int block_num, zend_basic_block *block, int target_block)
  486. {
  487. int i;
  488. for (i = 0; i < block->successors_count; i++) {
  489. if (block->successors[i] != target_block) {
  490. zend_ssa_remove_predecessor(ssa, block_num, block->successors[i]);
  491. }
  492. }
  493. block->successors[0] = target_block;
  494. block->successors_count = 1;
  495. }
  496. static void compress_block(zend_op_array *op_array, zend_basic_block *block)
  497. {
  498. while (block->len > 0) {
  499. zend_op *opline = &op_array->opcodes[block->start + block->len - 1];
  500. if (opline->opcode == ZEND_NOP) {
  501. block->len--;
  502. } else {
  503. break;
  504. }
  505. }
  506. }
  507. static void replace_predecessor(zend_ssa *ssa, int block_id, int old_pred, int new_pred) {
  508. zend_basic_block *block = &ssa->cfg.blocks[block_id];
  509. int *predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  510. zend_ssa_phi *phi;
  511. int i;
  512. int old_pred_idx = -1;
  513. int new_pred_idx = -1;
  514. for (i = 0; i < block->predecessors_count; i++) {
  515. if (predecessors[i] == old_pred) {
  516. old_pred_idx = i;
  517. }
  518. if (predecessors[i] == new_pred) {
  519. new_pred_idx = i;
  520. }
  521. }
  522. ZEND_ASSERT(old_pred_idx != -1);
  523. if (new_pred_idx == -1) {
  524. /* If the new predecessor doesn't exist yet, simply rewire the old one */
  525. predecessors[old_pred_idx] = new_pred;
  526. } else {
  527. /* Otherwise, rewiring the old predecessor would make the new predecessor appear
  528. * twice, which violates our CFG invariants. Remove the old predecessor instead. */
  529. memmove(
  530. predecessors + old_pred_idx,
  531. predecessors + old_pred_idx + 1,
  532. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  533. );
  534. /* Also remove the corresponding phi node entries */
  535. for (phi = ssa->blocks[block_id].phis; phi; phi = phi->next) {
  536. if (phi->pi >= 0) {
  537. if (phi->pi == old_pred || phi->pi == new_pred) {
  538. zend_ssa_rename_var_uses(
  539. ssa, phi->ssa_var, phi->sources[0], /* update_types */ 0);
  540. zend_ssa_remove_phi(ssa, phi);
  541. }
  542. } else {
  543. memmove(
  544. phi->sources + old_pred_idx,
  545. phi->sources + old_pred_idx + 1,
  546. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  547. );
  548. }
  549. }
  550. block->predecessors_count--;
  551. }
  552. }
  553. static void zend_ssa_replace_control_link(zend_op_array *op_array, zend_ssa *ssa, int from, int to, int new_to)
  554. {
  555. zend_basic_block *src = &ssa->cfg.blocks[from];
  556. zend_basic_block *old = &ssa->cfg.blocks[to];
  557. zend_basic_block *dst = &ssa->cfg.blocks[new_to];
  558. int i;
  559. zend_op *opline;
  560. for (i = 0; i < src->successors_count; i++) {
  561. if (src->successors[i] == to) {
  562. src->successors[i] = new_to;
  563. }
  564. }
  565. if (src->len > 0) {
  566. opline = op_array->opcodes + src->start + src->len - 1;
  567. switch (opline->opcode) {
  568. case ZEND_JMP:
  569. case ZEND_FAST_CALL:
  570. ZEND_ASSERT(ZEND_OP1_JMP_ADDR(opline) == op_array->opcodes + old->start);
  571. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, op_array->opcodes + dst->start);
  572. break;
  573. case ZEND_JMPZNZ:
  574. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  575. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  576. }
  577. ZEND_FALLTHROUGH;
  578. case ZEND_JMPZ:
  579. case ZEND_JMPNZ:
  580. case ZEND_JMPZ_EX:
  581. case ZEND_JMPNZ_EX:
  582. case ZEND_FE_RESET_R:
  583. case ZEND_FE_RESET_RW:
  584. case ZEND_JMP_SET:
  585. case ZEND_COALESCE:
  586. case ZEND_ASSERT_CHECK:
  587. case ZEND_JMP_NULL:
  588. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  589. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  590. }
  591. break;
  592. case ZEND_CATCH:
  593. if (!(opline->extended_value & ZEND_LAST_CATCH)) {
  594. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  595. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  596. }
  597. }
  598. break;
  599. case ZEND_FE_FETCH_R:
  600. case ZEND_FE_FETCH_RW:
  601. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  602. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  603. }
  604. break;
  605. case ZEND_SWITCH_LONG:
  606. case ZEND_SWITCH_STRING:
  607. case ZEND_MATCH:
  608. {
  609. HashTable *jumptable = Z_ARRVAL(ZEND_OP2_LITERAL(opline));
  610. zval *zv;
  611. ZEND_HASH_FOREACH_VAL(jumptable, zv) {
  612. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, Z_LVAL_P(zv)) == old->start) {
  613. Z_LVAL_P(zv) = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  614. }
  615. } ZEND_HASH_FOREACH_END();
  616. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  617. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  618. }
  619. break;
  620. }
  621. }
  622. }
  623. replace_predecessor(ssa, new_to, to, from);
  624. }
  625. static void zend_ssa_unlink_block(zend_op_array *op_array, zend_ssa *ssa, zend_basic_block *block, int block_num)
  626. {
  627. if (block->predecessors_count == 1 && ssa->blocks[block_num].phis == NULL) {
  628. int *predecessors, i;
  629. zend_basic_block *fe_fetch_block = NULL;
  630. ZEND_ASSERT(block->successors_count == 1);
  631. predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  632. if (block->predecessors_count == 1 && (block->flags & ZEND_BB_FOLLOW)) {
  633. zend_basic_block *pred_block = &ssa->cfg.blocks[predecessors[0]];
  634. if (pred_block->len > 0 && (pred_block->flags & ZEND_BB_REACHABLE)) {
  635. if ((op_array->opcodes[pred_block->start + pred_block->len - 1].opcode == ZEND_FE_FETCH_R
  636. || op_array->opcodes[pred_block->start + pred_block->len - 1].opcode == ZEND_FE_FETCH_RW)
  637. && op_array->opcodes[pred_block->start + pred_block->len - 1].op2_type == IS_CV) {
  638. fe_fetch_block = pred_block;
  639. }
  640. }
  641. }
  642. for (i = 0; i < block->predecessors_count; i++) {
  643. zend_ssa_replace_control_link(op_array, ssa, predecessors[i], block_num, block->successors[0]);
  644. }
  645. zend_ssa_remove_block(op_array, ssa, block_num);
  646. if (fe_fetch_block && fe_fetch_block->successors[0] == fe_fetch_block->successors[1]) {
  647. /* The body of "foreach" loop was removed */
  648. int ssa_var = ssa->ops[fe_fetch_block->start + fe_fetch_block->len - 1].op2_def;
  649. if (ssa_var >= 0) {
  650. zend_ssa_remove_uses_of_var(ssa, ssa_var);
  651. }
  652. }
  653. }
  654. }
  655. static int zend_dfa_optimize_jmps(zend_op_array *op_array, zend_ssa *ssa)
  656. {
  657. int removed_ops = 0;
  658. int block_num = 0;
  659. for (block_num = 1; block_num < ssa->cfg.blocks_count; block_num++) {
  660. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  661. if (!(block->flags & ZEND_BB_REACHABLE)) {
  662. continue;
  663. }
  664. compress_block(op_array, block);
  665. if (block->len == 0) {
  666. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  667. }
  668. }
  669. block_num = 0;
  670. while (block_num < ssa->cfg.blocks_count
  671. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE)) {
  672. block_num++;
  673. }
  674. while (block_num < ssa->cfg.blocks_count) {
  675. int next_block_num = block_num + 1;
  676. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  677. uint32_t op_num;
  678. zend_op *opline;
  679. zend_ssa_op *ssa_op;
  680. bool can_follow = 1;
  681. while (next_block_num < ssa->cfg.blocks_count
  682. && !(ssa->cfg.blocks[next_block_num].flags & ZEND_BB_REACHABLE)) {
  683. if (ssa->cfg.blocks[next_block_num].flags & ZEND_BB_UNREACHABLE_FREE) {
  684. can_follow = 0;
  685. }
  686. next_block_num++;
  687. }
  688. if (block->len) {
  689. op_num = block->start + block->len - 1;
  690. opline = op_array->opcodes + op_num;
  691. ssa_op = ssa->ops + op_num;
  692. switch (opline->opcode) {
  693. case ZEND_JMP:
  694. optimize_jmp:
  695. if (block->successors[0] == next_block_num && can_follow) {
  696. MAKE_NOP(opline);
  697. removed_ops++;
  698. goto optimize_nop;
  699. }
  700. break;
  701. case ZEND_JMPZ:
  702. optimize_jmpz:
  703. if (opline->op1_type == IS_CONST) {
  704. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  705. MAKE_NOP(opline);
  706. removed_ops++;
  707. take_successor_1(ssa, block_num, block);
  708. goto optimize_nop;
  709. } else {
  710. opline->opcode = ZEND_JMP;
  711. COPY_NODE(opline->op1, opline->op2);
  712. take_successor_0(ssa, block_num, block);
  713. goto optimize_jmp;
  714. }
  715. } else {
  716. if (block->successors[0] == next_block_num && can_follow) {
  717. take_successor_0(ssa, block_num, block);
  718. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  719. opline->opcode = ZEND_CHECK_VAR;
  720. opline->op2.num = 0;
  721. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  722. zend_ssa_remove_instr(ssa, opline, ssa_op);
  723. removed_ops++;
  724. goto optimize_nop;
  725. } else {
  726. opline->opcode = ZEND_FREE;
  727. opline->op2.num = 0;
  728. }
  729. }
  730. }
  731. break;
  732. case ZEND_JMPNZ:
  733. optimize_jmpnz:
  734. if (opline->op1_type == IS_CONST) {
  735. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  736. opline->opcode = ZEND_JMP;
  737. COPY_NODE(opline->op1, opline->op2);
  738. take_successor_0(ssa, block_num, block);
  739. goto optimize_jmp;
  740. } else {
  741. MAKE_NOP(opline);
  742. removed_ops++;
  743. take_successor_1(ssa, block_num, block);
  744. goto optimize_nop;
  745. }
  746. } else if (block->successors_count == 2) {
  747. if (block->successors[0] == next_block_num && can_follow) {
  748. take_successor_0(ssa, block_num, block);
  749. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  750. opline->opcode = ZEND_CHECK_VAR;
  751. opline->op2.num = 0;
  752. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  753. zend_ssa_remove_instr(ssa, opline, ssa_op);
  754. removed_ops++;
  755. goto optimize_nop;
  756. } else {
  757. opline->opcode = ZEND_FREE;
  758. opline->op2.num = 0;
  759. }
  760. }
  761. }
  762. break;
  763. case ZEND_JMPZNZ:
  764. if (opline->op1_type == IS_CONST) {
  765. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  766. zend_op *target_opline = ZEND_OFFSET_TO_OPLINE(opline, opline->extended_value);
  767. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  768. take_successor_1(ssa, block_num, block);
  769. } else {
  770. zend_op *target_opline = ZEND_OP2_JMP_ADDR(opline);
  771. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  772. take_successor_0(ssa, block_num, block);
  773. }
  774. opline->op1_type = IS_UNUSED;
  775. opline->extended_value = 0;
  776. opline->opcode = ZEND_JMP;
  777. goto optimize_jmp;
  778. } else if (block->successors_count == 2) {
  779. if (block->successors[0] == block->successors[1]) {
  780. take_successor_0(ssa, block_num, block);
  781. if (block->successors[0] == next_block_num && can_follow) {
  782. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  783. opline->opcode = ZEND_CHECK_VAR;
  784. opline->op2.num = 0;
  785. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  786. zend_ssa_remove_instr(ssa, opline, ssa_op);
  787. removed_ops++;
  788. goto optimize_nop;
  789. } else {
  790. opline->opcode = ZEND_FREE;
  791. opline->op2.num = 0;
  792. }
  793. } 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))) {
  794. ZEND_ASSERT(ssa_op->op1_use >= 0);
  795. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  796. ssa_op->op1_use = -1;
  797. ssa_op->op1_use_chain = -1;
  798. opline->opcode = ZEND_JMP;
  799. opline->op1_type = IS_UNUSED;
  800. opline->op1.num = opline->op2.num;
  801. goto optimize_jmp;
  802. }
  803. }
  804. }
  805. break;
  806. case ZEND_JMPZ_EX:
  807. if (ssa->vars[ssa_op->result_def].use_chain < 0
  808. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  809. opline->opcode = ZEND_JMPZ;
  810. opline->result_type = IS_UNUSED;
  811. zend_ssa_remove_result_def(ssa, ssa_op);
  812. goto optimize_jmpz;
  813. } else if (opline->op1_type == IS_CONST) {
  814. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  815. opline->opcode = ZEND_QM_ASSIGN;
  816. take_successor_1(ssa, block_num, block);
  817. }
  818. }
  819. break;
  820. case ZEND_JMPNZ_EX:
  821. if (ssa->vars[ssa_op->result_def].use_chain < 0
  822. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  823. opline->opcode = ZEND_JMPNZ;
  824. opline->result_type = IS_UNUSED;
  825. zend_ssa_remove_result_def(ssa, ssa_op);
  826. goto optimize_jmpnz;
  827. } else if (opline->op1_type == IS_CONST) {
  828. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  829. opline->opcode = ZEND_QM_ASSIGN;
  830. take_successor_1(ssa, block_num, block);
  831. }
  832. }
  833. break;
  834. case ZEND_JMP_SET:
  835. if (ssa->vars[ssa_op->result_def].use_chain < 0
  836. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  837. opline->opcode = ZEND_JMPNZ;
  838. opline->result_type = IS_UNUSED;
  839. zend_ssa_remove_result_def(ssa, ssa_op);
  840. goto optimize_jmpnz;
  841. } else if (opline->op1_type == IS_CONST) {
  842. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  843. MAKE_NOP(opline);
  844. removed_ops++;
  845. take_successor_1(ssa, block_num, block);
  846. zend_ssa_remove_result_def(ssa, ssa_op);
  847. goto optimize_nop;
  848. }
  849. }
  850. break;
  851. case ZEND_COALESCE:
  852. {
  853. zend_ssa_var *var = &ssa->vars[ssa_op->result_def];
  854. if (opline->op1_type == IS_CONST
  855. && var->use_chain < 0 && var->phi_use_chain == NULL) {
  856. if (Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_NULL) {
  857. zend_ssa_remove_result_def(ssa, ssa_op);
  858. MAKE_NOP(opline);
  859. removed_ops++;
  860. take_successor_1(ssa, block_num, block);
  861. goto optimize_nop;
  862. } else {
  863. opline->opcode = ZEND_JMP;
  864. opline->result_type = IS_UNUSED;
  865. zend_ssa_remove_result_def(ssa, ssa_op);
  866. COPY_NODE(opline->op1, opline->op2);
  867. take_successor_0(ssa, block_num, block);
  868. goto optimize_jmp;
  869. }
  870. }
  871. break;
  872. }
  873. case ZEND_JMP_NULL:
  874. {
  875. zend_ssa_var *var = &ssa->vars[ssa_op->result_def];
  876. if (opline->op1_type == IS_CONST
  877. && var->use_chain < 0 && var->phi_use_chain == NULL) {
  878. if (Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_NULL) {
  879. opline->opcode = ZEND_JMP;
  880. opline->result_type = IS_UNUSED;
  881. zend_ssa_remove_result_def(ssa, ssa_op);
  882. COPY_NODE(opline->op1, opline->op2);
  883. take_successor_0(ssa, block_num, block);
  884. goto optimize_jmp;
  885. } else {
  886. zend_ssa_remove_result_def(ssa, ssa_op);
  887. MAKE_NOP(opline);
  888. removed_ops++;
  889. take_successor_1(ssa, block_num, block);
  890. goto optimize_nop;
  891. }
  892. }
  893. break;
  894. }
  895. case ZEND_SWITCH_LONG:
  896. case ZEND_SWITCH_STRING:
  897. case ZEND_MATCH:
  898. if (opline->op1_type == IS_CONST) {
  899. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  900. zend_uchar type = Z_TYPE_P(zv);
  901. bool correct_type =
  902. (opline->opcode == ZEND_SWITCH_LONG && type == IS_LONG)
  903. || (opline->opcode == ZEND_SWITCH_STRING && type == IS_STRING)
  904. || (opline->opcode == ZEND_MATCH && (type == IS_LONG || type == IS_STRING));
  905. if (!correct_type) {
  906. removed_ops++;
  907. MAKE_NOP(opline);
  908. opline->extended_value = 0;
  909. take_successor_ex(ssa, block_num, block, block->successors[block->successors_count - 1]);
  910. goto optimize_nop;
  911. } else {
  912. HashTable *jmptable = Z_ARRVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant));
  913. zval *jmp_zv = type == IS_LONG
  914. ? zend_hash_index_find(jmptable, Z_LVAL_P(zv))
  915. : zend_hash_find(jmptable, Z_STR_P(zv));
  916. uint32_t target;
  917. if (jmp_zv) {
  918. target = ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, Z_LVAL_P(jmp_zv));
  919. } else {
  920. target = ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value);
  921. }
  922. opline->opcode = ZEND_JMP;
  923. opline->extended_value = 0;
  924. SET_UNUSED(opline->op1);
  925. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, op_array->opcodes + target);
  926. SET_UNUSED(opline->op2);
  927. take_successor_ex(ssa, block_num, block, ssa->cfg.map[target]);
  928. goto optimize_jmp;
  929. }
  930. }
  931. break;
  932. case ZEND_NOP:
  933. optimize_nop:
  934. compress_block(op_array, block);
  935. if (block->len == 0) {
  936. if (block_num > 0) {
  937. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  938. /* backtrack to previous basic block */
  939. do {
  940. block_num--;
  941. } while (block_num >= 0
  942. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE));
  943. if (block_num >= 0) {
  944. continue;
  945. }
  946. }
  947. }
  948. break;
  949. default:
  950. break;
  951. }
  952. }
  953. block_num = next_block_num;
  954. }
  955. return removed_ops;
  956. }
  957. static int zend_dfa_try_to_replace_result(zend_op_array *op_array, zend_ssa *ssa, int def, int cv_var)
  958. {
  959. int result_var = ssa->ops[def].result_def;
  960. int cv = EX_NUM_TO_VAR(ssa->vars[cv_var].var);
  961. if (result_var >= 0
  962. && !(ssa->var_info[cv_var].type & MAY_BE_REF)
  963. && ssa->vars[cv_var].alias == NO_ALIAS
  964. && ssa->vars[result_var].phi_use_chain == NULL
  965. && ssa->vars[result_var].sym_use_chain == NULL) {
  966. int use = ssa->vars[result_var].use_chain;
  967. if (use >= 0
  968. && zend_ssa_next_use(ssa->ops, result_var, use) < 0
  969. && op_array->opcodes[use].opcode != ZEND_FREE
  970. && op_array->opcodes[use].opcode != ZEND_SEND_VAL
  971. && op_array->opcodes[use].opcode != ZEND_SEND_VAL_EX
  972. && op_array->opcodes[use].opcode != ZEND_VERIFY_RETURN_TYPE
  973. && op_array->opcodes[use].opcode != ZEND_YIELD) {
  974. if (use > def) {
  975. int i = use;
  976. const zend_op *opline = &op_array->opcodes[use];
  977. while (i > def) {
  978. if ((opline->op1_type == IS_CV && opline->op1.var == cv)
  979. || (opline->op2_type == IS_CV && opline->op2.var == cv)
  980. || (opline->result_type == IS_CV && opline->result.var == cv)) {
  981. return 0;
  982. }
  983. opline--;
  984. i--;
  985. }
  986. /* Update opcodes and reconstruct SSA */
  987. ssa->vars[result_var].definition = -1;
  988. ssa->vars[result_var].use_chain = -1;
  989. ssa->ops[def].result_def = -1;
  990. op_array->opcodes[def].result_type = IS_UNUSED;
  991. op_array->opcodes[def].result.var = 0;
  992. if (ssa->ops[use].op1_use == result_var) {
  993. ssa->ops[use].op1_use = cv_var;
  994. ssa->ops[use].op1_use_chain = ssa->vars[cv_var].use_chain;
  995. ssa->vars[cv_var].use_chain = use;
  996. op_array->opcodes[use].op1_type = IS_CV;
  997. op_array->opcodes[use].op1.var = cv;
  998. } else if (ssa->ops[use].op2_use == result_var) {
  999. ssa->ops[use].op2_use = cv_var;
  1000. ssa->ops[use].op2_use_chain = ssa->vars[cv_var].use_chain;
  1001. ssa->vars[cv_var].use_chain = use;
  1002. op_array->opcodes[use].op2_type = IS_CV;
  1003. op_array->opcodes[use].op2.var = cv;
  1004. } else if (ssa->ops[use].result_use == result_var) {
  1005. ssa->ops[use].result_use = cv_var;
  1006. ssa->ops[use].res_use_chain = ssa->vars[cv_var].use_chain;
  1007. ssa->vars[cv_var].use_chain = use;
  1008. op_array->opcodes[use].result_type = IS_CV;
  1009. op_array->opcodes[use].result.var = cv;
  1010. }
  1011. return 1;
  1012. }
  1013. }
  1014. }
  1015. return 0;
  1016. }
  1017. void zend_dfa_optimize_op_array(zend_op_array *op_array, zend_optimizer_ctx *ctx, zend_ssa *ssa, zend_call_info **call_map)
  1018. {
  1019. if (ctx->debug_level & ZEND_DUMP_BEFORE_DFA_PASS) {
  1020. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "before dfa pass", ssa);
  1021. }
  1022. if (ssa->var_info) {
  1023. int op_1;
  1024. int v;
  1025. int remove_nops = 0;
  1026. zend_op *opline;
  1027. zend_ssa_op *ssa_op;
  1028. zval tmp;
  1029. #if ZEND_DEBUG_DFA
  1030. ssa_verify_integrity(op_array, ssa, "before dfa");
  1031. #endif
  1032. if (ZEND_OPTIMIZER_PASS_8 & ctx->optimization_level) {
  1033. if (sccp_optimize_op_array(ctx, op_array, ssa, call_map)) {
  1034. remove_nops = 1;
  1035. }
  1036. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  1037. remove_nops = 1;
  1038. }
  1039. #if ZEND_DEBUG_DFA
  1040. ssa_verify_integrity(op_array, ssa, "after sccp");
  1041. #endif
  1042. if (ZEND_FUNC_INFO(op_array)) {
  1043. if (zend_dfa_optimize_calls(op_array, ssa)) {
  1044. remove_nops = 1;
  1045. }
  1046. }
  1047. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_8) {
  1048. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after sccp pass", ssa);
  1049. }
  1050. #if ZEND_DEBUG_DFA
  1051. ssa_verify_integrity(op_array, ssa, "after calls");
  1052. #endif
  1053. }
  1054. if (ZEND_OPTIMIZER_PASS_14 & ctx->optimization_level) {
  1055. if (dce_optimize_op_array(op_array, ssa, 0)) {
  1056. remove_nops = 1;
  1057. }
  1058. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  1059. remove_nops = 1;
  1060. }
  1061. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_14) {
  1062. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dce pass", ssa);
  1063. }
  1064. #if ZEND_DEBUG_DFA
  1065. ssa_verify_integrity(op_array, ssa, "after dce");
  1066. #endif
  1067. }
  1068. for (v = op_array->last_var; v < ssa->vars_count; v++) {
  1069. op_1 = ssa->vars[v].definition;
  1070. if (op_1 < 0) {
  1071. continue;
  1072. }
  1073. opline = op_array->opcodes + op_1;
  1074. ssa_op = &ssa->ops[op_1];
  1075. /* Convert LONG constants to DOUBLE */
  1076. if (ssa->var_info[v].use_as_double) {
  1077. if (opline->opcode == ZEND_ASSIGN
  1078. && opline->op2_type == IS_CONST
  1079. && ssa->ops[op_1].op1_def == v
  1080. && !RETURN_VALUE_USED(opline)
  1081. ) {
  1082. // op_1: ASSIGN ? -> #v [use_as_double], long(?) => ASSIGN ? -> #v, double(?)
  1083. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1084. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  1085. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1086. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  1087. } else if (opline->opcode == ZEND_QM_ASSIGN
  1088. && opline->op1_type == IS_CONST
  1089. ) {
  1090. // op_1: QM_ASSIGN #v [use_as_double], long(?) => QM_ASSIGN #v, double(?)
  1091. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1092. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  1093. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1094. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  1095. }
  1096. } else {
  1097. if (opline->opcode == ZEND_ADD
  1098. || opline->opcode == ZEND_SUB
  1099. || opline->opcode == ZEND_MUL
  1100. || opline->opcode == ZEND_IS_EQUAL
  1101. || opline->opcode == ZEND_IS_NOT_EQUAL
  1102. || opline->opcode == ZEND_IS_SMALLER
  1103. || opline->opcode == ZEND_IS_SMALLER_OR_EQUAL
  1104. ) {
  1105. if (opline->op1_type == IS_CONST && opline->op2_type != IS_CONST) {
  1106. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1107. if ((OP2_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  1108. && Z_TYPE_INFO_P(zv) == IS_LONG) {
  1109. // op_1: #v.? = ADD long(?), #?.? [double] => #v.? = ADD double(?), #?.? [double]
  1110. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1111. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  1112. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1113. }
  1114. if (opline->opcode == ZEND_ADD) {
  1115. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1116. if (((OP2_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_LONG
  1117. && Z_TYPE_INFO_P(zv) == IS_LONG
  1118. && Z_LVAL_P(zv) == 0)
  1119. || ((OP2_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_DOUBLE
  1120. && Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1121. && Z_DVAL_P(zv) == 0.0)) {
  1122. // op_1: #v.? = ADD 0, #?.? [double,long] => #v.? = QM_ASSIGN #?.?
  1123. opline->opcode = ZEND_QM_ASSIGN;
  1124. opline->op1_type = opline->op2_type;
  1125. opline->op1.var = opline->op2.var;
  1126. opline->op2_type = IS_UNUSED;
  1127. opline->op2.num = 0;
  1128. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1129. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1130. ssa->ops[op_1].op2_use = -1;
  1131. ssa->ops[op_1].op2_use_chain = -1;
  1132. }
  1133. } else if (opline->opcode == ZEND_MUL
  1134. && (OP2_INFO() & ((MAY_BE_ANY|MAY_BE_UNDEF)-(MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1135. zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  1136. if ((Z_TYPE_INFO_P(zv) == IS_LONG
  1137. && Z_LVAL_P(zv) == 2)
  1138. || (Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1139. && Z_DVAL_P(zv) == 2.0
  1140. && !(OP2_INFO() & MAY_BE_LONG))) {
  1141. // op_1: #v.? = MUL 2, #x.? [double,long] => #v.? = ADD #x.?, #x.?
  1142. opline->opcode = ZEND_ADD;
  1143. opline->op1_type = opline->op2_type;
  1144. opline->op1.var = opline->op2.var;
  1145. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1146. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1147. }
  1148. }
  1149. } else if (opline->op1_type != IS_CONST && opline->op2_type == IS_CONST) {
  1150. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1151. if ((OP1_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  1152. && Z_TYPE_INFO_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG) {
  1153. // op_1: #v.? = ADD #?.? [double], long(?) => #v.? = ADD #?.? [double], double(?)
  1154. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  1155. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  1156. zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1157. }
  1158. if (opline->opcode == ZEND_ADD || opline->opcode == ZEND_SUB) {
  1159. if (((OP1_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_LONG
  1160. && Z_TYPE_INFO_P(zv) == IS_LONG
  1161. && Z_LVAL_P(zv) == 0)
  1162. || ((OP1_INFO() & (MAY_BE_ANY|MAY_BE_UNDEF)) == MAY_BE_DOUBLE
  1163. && Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1164. && Z_DVAL_P(zv) == 0.0)) {
  1165. // op_1: #v.? = ADD #?.? [double,long], 0 => #v.? = QM_ASSIGN #?.?
  1166. opline->opcode = ZEND_QM_ASSIGN;
  1167. opline->op2_type = IS_UNUSED;
  1168. opline->op2.num = 0;
  1169. }
  1170. } else if (opline->opcode == ZEND_MUL
  1171. && (OP1_INFO() & ((MAY_BE_ANY|MAY_BE_UNDEF)-(MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1172. zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  1173. if ((Z_TYPE_INFO_P(zv) == IS_LONG
  1174. && Z_LVAL_P(zv) == 2)
  1175. || (Z_TYPE_INFO_P(zv) == IS_DOUBLE
  1176. && Z_DVAL_P(zv) == 2.0
  1177. && !(OP1_INFO() & MAY_BE_LONG))) {
  1178. // op_1: #v.? = MUL #x.? [double,long], 2 => #v.? = ADD #x.?, #x.?
  1179. opline->opcode = ZEND_ADD;
  1180. opline->op2_type = opline->op1_type;
  1181. opline->op2.var = opline->op1.var;
  1182. ssa->ops[op_1].op2_use = ssa->ops[op_1].op1_use;
  1183. ssa->ops[op_1].op2_use_chain = ssa->ops[op_1].op1_use_chain;
  1184. }
  1185. }
  1186. }
  1187. } else if (opline->opcode == ZEND_CONCAT) {
  1188. if (!(OP1_INFO() & MAY_BE_OBJECT)
  1189. && !(OP2_INFO() & MAY_BE_OBJECT)) {
  1190. opline->opcode = ZEND_FAST_CONCAT;
  1191. }
  1192. } else if (opline->opcode == ZEND_VERIFY_RETURN_TYPE
  1193. && opline->op1_type != IS_CONST
  1194. && ssa->ops[op_1].op1_def == v
  1195. && ssa->ops[op_1].op1_use >= 0
  1196. && ssa->ops[op_1].op1_use_chain == -1
  1197. && can_elide_return_type_check(ctx->script, op_array, ssa, &ssa->ops[op_1])) {
  1198. // op_1: VERIFY_RETURN_TYPE #orig_var.? [T] -> #v.? [T] => NOP
  1199. int orig_var = ssa->ops[op_1].op1_use;
  1200. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1201. int ret = ssa->vars[v].use_chain;
  1202. if (ret >= 0) {
  1203. ssa->ops[ret].op1_use = orig_var;
  1204. ssa->ops[ret].op1_use_chain = ssa->vars[orig_var].use_chain;
  1205. ssa->vars[orig_var].use_chain = ret;
  1206. }
  1207. ssa->vars[v].definition = -1;
  1208. ssa->vars[v].use_chain = -1;
  1209. ssa->ops[op_1].op1_def = -1;
  1210. ssa->ops[op_1].op1_use = -1;
  1211. MAKE_NOP(opline);
  1212. remove_nops = 1;
  1213. }
  1214. }
  1215. }
  1216. if (opline->opcode == ZEND_QM_ASSIGN
  1217. && ssa->ops[op_1].result_def == v
  1218. && opline->op1_type & (IS_TMP_VAR|IS_VAR)
  1219. && !(ssa->var_info[v].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  1220. ) {
  1221. int src_var = ssa->ops[op_1].op1_use;
  1222. if (src_var >= 0
  1223. && !(ssa->var_info[src_var].type & MAY_BE_REF)
  1224. && (ssa->var_info[src_var].type & (MAY_BE_UNDEF|MAY_BE_ANY))
  1225. && ssa->vars[src_var].definition >= 0
  1226. && ssa->ops[ssa->vars[src_var].definition].result_def == src_var
  1227. && ssa->ops[ssa->vars[src_var].definition].result_use < 0
  1228. && ssa->vars[src_var].use_chain == op_1
  1229. && ssa->ops[op_1].op1_use_chain < 0
  1230. && !ssa->vars[src_var].phi_use_chain
  1231. && !ssa->vars[src_var].sym_use_chain
  1232. && opline_supports_assign_contraction(
  1233. op_array, ssa, &op_array->opcodes[ssa->vars[src_var].definition],
  1234. src_var, opline->result.var)
  1235. && !variable_defined_or_used_in_range(ssa, EX_VAR_TO_NUM(opline->result.var),
  1236. ssa->vars[src_var].definition+1, op_1)
  1237. ) {
  1238. int orig_var = ssa->ops[op_1].result_use;
  1239. int op_2 = ssa->vars[src_var].definition;
  1240. // op_2: #src_var.T = OP ... => #v.CV = OP ...
  1241. // op_1: QM_ASSIGN #src_var.T #orig_var.CV [undef,scalar] -> #v.CV, NOP
  1242. if (orig_var < 0 || zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1243. /* Reconstruct SSA */
  1244. ssa->vars[v].definition = op_2;
  1245. ssa->ops[op_2].result_def = v;
  1246. ssa->vars[src_var].definition = -1;
  1247. ssa->vars[src_var].use_chain = -1;
  1248. ssa->ops[op_1].op1_use = -1;
  1249. ssa->ops[op_1].op1_def = -1;
  1250. ssa->ops[op_1].op1_use_chain = -1;
  1251. ssa->ops[op_1].result_use = -1;
  1252. ssa->ops[op_1].result_def = -1;
  1253. ssa->ops[op_1].res_use_chain = -1;
  1254. /* Update opcodes */
  1255. op_array->opcodes[op_2].result_type = opline->result_type;
  1256. op_array->opcodes[op_2].result.var = opline->result.var;
  1257. MAKE_NOP(opline);
  1258. remove_nops = 1;
  1259. if (op_array->opcodes[op_2].opcode == ZEND_SUB
  1260. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1261. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1262. && op_array->opcodes[op_2].op2_type == IS_CONST
  1263. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1264. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1265. && ssa->ops[op_2].op1_use >= 0
  1266. && !(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))) {
  1267. op_array->opcodes[op_2].opcode = ZEND_PRE_DEC;
  1268. SET_UNUSED(op_array->opcodes[op_2].op2);
  1269. SET_UNUSED(op_array->opcodes[op_2].result);
  1270. ssa->ops[op_2].result_def = -1;
  1271. ssa->ops[op_2].op1_def = v;
  1272. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1273. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1274. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1275. && op_array->opcodes[op_2].op2_type == IS_CONST
  1276. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1277. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1278. && ssa->ops[op_2].op1_use >= 0
  1279. && !(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))) {
  1280. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1281. SET_UNUSED(op_array->opcodes[op_2].op2);
  1282. SET_UNUSED(op_array->opcodes[op_2].result);
  1283. ssa->ops[op_2].result_def = -1;
  1284. ssa->ops[op_2].op1_def = v;
  1285. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1286. && op_array->opcodes[op_2].op2_type == op_array->opcodes[op_2].result_type
  1287. && op_array->opcodes[op_2].op2.var == op_array->opcodes[op_2].result.var
  1288. && op_array->opcodes[op_2].op1_type == IS_CONST
  1289. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == IS_LONG
  1290. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == 1
  1291. && ssa->ops[op_2].op2_use >= 0
  1292. && !(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))) {
  1293. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1294. op_array->opcodes[op_2].op1_type = op_array->opcodes[op_2].op2_type;
  1295. op_array->opcodes[op_2].op1.var = op_array->opcodes[op_2].op2.var;
  1296. SET_UNUSED(op_array->opcodes[op_2].op2);
  1297. SET_UNUSED(op_array->opcodes[op_2].result);
  1298. ssa->ops[op_2].result_def = -1;
  1299. ssa->ops[op_2].op1_def = v;
  1300. ssa->ops[op_2].op1_use = ssa->ops[op_2].op2_use;
  1301. ssa->ops[op_2].op1_use_chain = ssa->ops[op_2].op2_use_chain;
  1302. ssa->ops[op_2].op2_use = -1;
  1303. ssa->ops[op_2].op2_use_chain = -1;
  1304. }
  1305. }
  1306. }
  1307. }
  1308. if (ssa->vars[v].var >= op_array->last_var) {
  1309. /* skip TMP and VAR */
  1310. continue;
  1311. }
  1312. if (ssa->ops[op_1].op1_def == v
  1313. && RETURN_VALUE_USED(opline)) {
  1314. if (opline->opcode == ZEND_ASSIGN
  1315. || opline->opcode == ZEND_ASSIGN_OP
  1316. || opline->opcode == ZEND_PRE_INC
  1317. || opline->opcode == ZEND_PRE_DEC) {
  1318. zend_dfa_try_to_replace_result(op_array, ssa, op_1, v);
  1319. } else if (opline->opcode == ZEND_POST_INC) {
  1320. int result_var = ssa->ops[op_1].result_def;
  1321. if (result_var >= 0
  1322. && (ssa->var_info[result_var].type & ((MAY_BE_ANY|MAY_BE_REF|MAY_BE_UNDEF) - (MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1323. int use = ssa->vars[result_var].use_chain;
  1324. if (use >= 0 && op_array->opcodes[use].opcode == ZEND_IS_SMALLER
  1325. && ssa->ops[use].op1_use == result_var
  1326. && zend_dfa_try_to_replace_result(op_array, ssa, op_1, v)) {
  1327. opline->opcode = ZEND_PRE_INC;
  1328. op_array->opcodes[use].opcode = ZEND_IS_SMALLER_OR_EQUAL;
  1329. }
  1330. }
  1331. } else if (opline->opcode == ZEND_POST_DEC) {
  1332. int result_var = ssa->ops[op_1].result_def;
  1333. if (result_var >= 0
  1334. && (ssa->var_info[result_var].type & ((MAY_BE_ANY|MAY_BE_REF|MAY_BE_UNDEF) - (MAY_BE_LONG|MAY_BE_DOUBLE))) == 0) {
  1335. int use = ssa->vars[result_var].use_chain;
  1336. if (use >= 0 && op_array->opcodes[use].opcode == ZEND_IS_SMALLER
  1337. && ssa->ops[use].op2_use == result_var
  1338. && zend_dfa_try_to_replace_result(op_array, ssa, op_1, v)) {
  1339. opline->opcode = ZEND_PRE_DEC;
  1340. op_array->opcodes[use].opcode = ZEND_IS_SMALLER_OR_EQUAL;
  1341. }
  1342. }
  1343. }
  1344. }
  1345. if (opline->opcode == ZEND_ASSIGN
  1346. && ssa->ops[op_1].op1_def == v
  1347. && !RETURN_VALUE_USED(opline)
  1348. ) {
  1349. int orig_var = ssa->ops[op_1].op1_use;
  1350. if (orig_var >= 0
  1351. && !(ssa->var_info[orig_var].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  1352. ) {
  1353. int src_var = ssa->ops[op_1].op2_use;
  1354. if ((opline->op2_type & (IS_TMP_VAR|IS_VAR))
  1355. && src_var >= 0
  1356. && !(ssa->var_info[src_var].type & MAY_BE_REF)
  1357. && (ssa->var_info[src_var].type & (MAY_BE_UNDEF|MAY_BE_ANY))
  1358. && ssa->vars[src_var].definition >= 0
  1359. && ssa->ops[ssa->vars[src_var].definition].result_def == src_var
  1360. && ssa->ops[ssa->vars[src_var].definition].result_use < 0
  1361. && ssa->vars[src_var].use_chain == op_1
  1362. && ssa->ops[op_1].op2_use_chain < 0
  1363. && !ssa->vars[src_var].phi_use_chain
  1364. && !ssa->vars[src_var].sym_use_chain
  1365. && opline_supports_assign_contraction(
  1366. op_array, ssa, &op_array->opcodes[ssa->vars[src_var].definition],
  1367. src_var, opline->op1.var)
  1368. && !variable_defined_or_used_in_range(ssa, EX_VAR_TO_NUM(opline->op1.var),
  1369. ssa->vars[src_var].definition+1, op_1)
  1370. ) {
  1371. int op_2 = ssa->vars[src_var].definition;
  1372. // op_2: #src_var.T = OP ... => #v.CV = OP ...
  1373. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, #src_var.T NOP
  1374. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1375. /* Reconstruct SSA */
  1376. ssa->vars[v].definition = op_2;
  1377. ssa->ops[op_2].result_def = v;
  1378. ssa->vars[src_var].definition = -1;
  1379. ssa->vars[src_var].use_chain = -1;
  1380. ssa->ops[op_1].op1_use = -1;
  1381. ssa->ops[op_1].op2_use = -1;
  1382. ssa->ops[op_1].op1_def = -1;
  1383. ssa->ops[op_1].op1_use_chain = -1;
  1384. /* Update opcodes */
  1385. op_array->opcodes[op_2].result_type = opline->op1_type;
  1386. op_array->opcodes[op_2].result.var = opline->op1.var;
  1387. MAKE_NOP(opline);
  1388. remove_nops = 1;
  1389. if (op_array->opcodes[op_2].opcode == ZEND_SUB
  1390. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1391. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1392. && op_array->opcodes[op_2].op2_type == IS_CONST
  1393. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1394. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1395. && ssa->ops[op_2].op1_use >= 0
  1396. && !(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))) {
  1397. op_array->opcodes[op_2].opcode = ZEND_PRE_DEC;
  1398. SET_UNUSED(op_array->opcodes[op_2].op2);
  1399. SET_UNUSED(op_array->opcodes[op_2].result);
  1400. ssa->ops[op_2].result_def = -1;
  1401. ssa->ops[op_2].op1_def = v;
  1402. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1403. && op_array->opcodes[op_2].op1_type == op_array->opcodes[op_2].result_type
  1404. && op_array->opcodes[op_2].op1.var == op_array->opcodes[op_2].result.var
  1405. && op_array->opcodes[op_2].op2_type == IS_CONST
  1406. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == IS_LONG
  1407. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op2.constant)) == 1
  1408. && ssa->ops[op_2].op1_use >= 0
  1409. && !(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))) {
  1410. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1411. SET_UNUSED(op_array->opcodes[op_2].op2);
  1412. SET_UNUSED(op_array->opcodes[op_2].result);
  1413. ssa->ops[op_2].result_def = -1;
  1414. ssa->ops[op_2].op1_def = v;
  1415. } else if (op_array->opcodes[op_2].opcode == ZEND_ADD
  1416. && op_array->opcodes[op_2].op2_type == op_array->opcodes[op_2].result_type
  1417. && op_array->opcodes[op_2].op2.var == op_array->opcodes[op_2].result.var
  1418. && op_array->opcodes[op_2].op1_type == IS_CONST
  1419. && Z_TYPE_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == IS_LONG
  1420. && Z_LVAL_P(CT_CONSTANT_EX(op_array, op_array->opcodes[op_2].op1.constant)) == 1
  1421. && ssa->ops[op_2].op2_use >= 0
  1422. && !(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))) {
  1423. op_array->opcodes[op_2].opcode = ZEND_PRE_INC;
  1424. op_array->opcodes[op_2].op1_type = op_array->opcodes[op_2].op2_type;
  1425. op_array->opcodes[op_2].op1.var = op_array->opcodes[op_2].op2.var;
  1426. SET_UNUSED(op_array->opcodes[op_2].op2);
  1427. SET_UNUSED(op_array->opcodes[op_2].result);
  1428. ssa->ops[op_2].result_def = -1;
  1429. ssa->ops[op_2].op1_def = v;
  1430. ssa->ops[op_2].op1_use = ssa->ops[op_2].op2_use;
  1431. ssa->ops[op_2].op1_use_chain = ssa->ops[op_2].op2_use_chain;
  1432. ssa->ops[op_2].op2_use = -1;
  1433. ssa->ops[op_2].op2_use_chain = -1;
  1434. }
  1435. }
  1436. } else if (opline->op2_type == IS_CONST
  1437. || ((opline->op2_type & (IS_TMP_VAR|IS_VAR|IS_CV))
  1438. && ssa->ops[op_1].op2_use >= 0
  1439. && ssa->ops[op_1].op2_def < 0)
  1440. ) {
  1441. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, CONST|TMPVAR => QM_ASSIGN v.CV, CONST|TMPVAR
  1442. if (ssa->ops[op_1].op1_use != ssa->ops[op_1].op2_use) {
  1443. zend_ssa_unlink_use_chain(ssa, op_1, orig_var);
  1444. } else {
  1445. ssa->ops[op_1].op2_use_chain = ssa->ops[op_1].op1_use_chain;
  1446. }
  1447. /* Reconstruct SSA */
  1448. ssa->ops[op_1].result_def = v;
  1449. ssa->ops[op_1].op1_def = -1;
  1450. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1451. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1452. ssa->ops[op_1].op2_use = -1;
  1453. ssa->ops[op_1].op2_use_chain = -1;
  1454. /* Update opcode */
  1455. opline->result_type = opline->op1_type;
  1456. opline->result.var = opline->op1.var;
  1457. opline->op1_type = opline->op2_type;
  1458. opline->op1.var = opline->op2.var;
  1459. opline->op2_type = IS_UNUSED;
  1460. opline->op2.var = 0;
  1461. opline->opcode = ZEND_QM_ASSIGN;
  1462. }
  1463. }
  1464. } else if (opline->opcode == ZEND_ASSIGN_OP
  1465. && opline->extended_value == ZEND_ADD
  1466. && ssa->ops[op_1].op1_def == v
  1467. && opline->op2_type == IS_CONST
  1468. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1469. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1470. && ssa->ops[op_1].op1_use >= 0
  1471. && !(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))) {
  1472. // op_1: ASSIGN_ADD #?.CV [undef,null,int,foat] ->#v.CV, int(1) => PRE_INC #?.CV ->#v.CV
  1473. opline->opcode = ZEND_PRE_INC;
  1474. opline->extended_value = 0;
  1475. SET_UNUSED(opline->op2);
  1476. } else if (opline->opcode == ZEND_ASSIGN_OP
  1477. && opline->extended_value == ZEND_SUB
  1478. && ssa->ops[op_1].op1_def == v
  1479. && opline->op2_type == IS_CONST
  1480. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1481. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1482. && ssa->ops[op_1].op1_use >= 0
  1483. && !(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))) {
  1484. // op_1: ASSIGN_SUB #?.CV [undef,null,int,foat] -> #v.CV, int(1) => PRE_DEC #?.CV ->#v.CV
  1485. opline->opcode = ZEND_PRE_DEC;
  1486. opline->extended_value = 0;
  1487. SET_UNUSED(opline->op2);
  1488. } else if (ssa->ops[op_1].op1_def == v
  1489. && !RETURN_VALUE_USED(opline)
  1490. && ssa->ops[op_1].op1_use >= 0
  1491. && !(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))
  1492. && opline->opcode == ZEND_ASSIGN_OP
  1493. && opline->extended_value != ZEND_CONCAT) {
  1494. // op_1: ASSIGN_OP #orig_var.CV [undef,null,bool,int,double] -> #v.CV, ? => #v.CV = ADD #orig_var.CV, ?
  1495. /* Reconstruct SSA */
  1496. ssa->ops[op_1].result_def = ssa->ops[op_1].op1_def;
  1497. ssa->ops[op_1].op1_def = -1;
  1498. /* Update opcode */
  1499. opline->opcode = opline->extended_value;
  1500. opline->extended_value = 0;
  1501. opline->result_type = opline->op1_type;
  1502. opline->result.var = opline->op1.var;
  1503. }
  1504. }
  1505. #if ZEND_DEBUG_DFA
  1506. ssa_verify_integrity(op_array, ssa, "after dfa");
  1507. #endif
  1508. if (remove_nops) {
  1509. zend_ssa_remove_nops(op_array, ssa, ctx);
  1510. #if ZEND_DEBUG_DFA
  1511. ssa_verify_integrity(op_array, ssa, "after nop");
  1512. #endif
  1513. }
  1514. }
  1515. if (ctx->debug_level & ZEND_DUMP_AFTER_DFA_PASS) {
  1516. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dfa pass", ssa);
  1517. }
  1518. }
  1519. void zend_optimize_dfa(zend_op_array *op_array, zend_optimizer_ctx *ctx)
  1520. {
  1521. void *checkpoint = zend_arena_checkpoint(ctx->arena);
  1522. zend_ssa ssa;
  1523. if (zend_dfa_analyze_op_array(op_array, ctx, &ssa) != SUCCESS) {
  1524. zend_arena_release(&ctx->arena, checkpoint);
  1525. return;
  1526. }
  1527. zend_dfa_optimize_op_array(op_array, ctx, &ssa, NULL);
  1528. /* Destroy SSA */
  1529. zend_arena_release(&ctx->arena, checkpoint);
  1530. }