dfa_pass.c 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272
  1. /*
  2. +----------------------------------------------------------------------+
  3. | Zend OPcache |
  4. +----------------------------------------------------------------------+
  5. | Copyright (c) 1998-2018 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. | http://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 "php.h"
  19. #include "Optimizer/zend_optimizer.h"
  20. #include "Optimizer/zend_optimizer_internal.h"
  21. #include "zend_API.h"
  22. #include "zend_constants.h"
  23. #include "zend_execute.h"
  24. #include "zend_vm.h"
  25. #include "zend_bitset.h"
  26. #include "zend_cfg.h"
  27. #include "zend_ssa.h"
  28. #include "zend_func_info.h"
  29. #include "zend_call_graph.h"
  30. #include "zend_inference.h"
  31. #include "zend_dump.h"
  32. #ifndef ZEND_DEBUG_DFA
  33. # define ZEND_DEBUG_DFA ZEND_DEBUG
  34. #endif
  35. #if ZEND_DEBUG_DFA
  36. # include "ssa_integrity.c"
  37. #endif
  38. int zend_dfa_analyze_op_array(zend_op_array *op_array, zend_optimizer_ctx *ctx, zend_ssa *ssa)
  39. {
  40. uint32_t build_flags;
  41. if (op_array->last_try_catch) {
  42. /* TODO: we can't analyze functions with try/catch/finally ??? */
  43. return FAILURE;
  44. }
  45. /* Build SSA */
  46. memset(ssa, 0, sizeof(zend_ssa));
  47. if (zend_build_cfg(&ctx->arena, op_array, ZEND_CFG_NO_ENTRY_PREDECESSORS, &ssa->cfg) != SUCCESS) {
  48. return FAILURE;
  49. }
  50. if ((ssa->cfg.flags & ZEND_FUNC_INDIRECT_VAR_ACCESS)) {
  51. /* TODO: we can't analyze functions with indirect variable access ??? */
  52. return FAILURE;
  53. }
  54. if (zend_cfg_build_predecessors(&ctx->arena, &ssa->cfg) != SUCCESS) {
  55. return FAILURE;
  56. }
  57. if (ctx->debug_level & ZEND_DUMP_DFA_CFG) {
  58. zend_dump_op_array(op_array, ZEND_DUMP_CFG, "dfa cfg", &ssa->cfg);
  59. }
  60. /* Compute Dominators Tree */
  61. if (zend_cfg_compute_dominators_tree(op_array, &ssa->cfg) != SUCCESS) {
  62. return FAILURE;
  63. }
  64. /* Identify reducible and irreducible loops */
  65. if (zend_cfg_identify_loops(op_array, &ssa->cfg) != SUCCESS) {
  66. return FAILURE;
  67. }
  68. if (ctx->debug_level & ZEND_DUMP_DFA_DOMINATORS) {
  69. zend_dump_dominators(op_array, &ssa->cfg);
  70. }
  71. build_flags = 0;
  72. if (ctx->debug_level & ZEND_DUMP_DFA_LIVENESS) {
  73. build_flags |= ZEND_SSA_DEBUG_LIVENESS;
  74. }
  75. if (ctx->debug_level & ZEND_DUMP_DFA_PHI) {
  76. build_flags |= ZEND_SSA_DEBUG_PHI_PLACEMENT;
  77. }
  78. if (zend_build_ssa(&ctx->arena, ctx->script, op_array, build_flags, ssa) != SUCCESS) {
  79. return FAILURE;
  80. }
  81. if (ctx->debug_level & ZEND_DUMP_DFA_SSA) {
  82. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "dfa ssa", ssa);
  83. }
  84. if (zend_ssa_compute_use_def_chains(&ctx->arena, op_array, ssa) != SUCCESS){
  85. return FAILURE;
  86. }
  87. if (zend_ssa_find_false_dependencies(op_array, ssa) != SUCCESS) {
  88. return FAILURE;
  89. }
  90. if (zend_ssa_find_sccs(op_array, ssa) != SUCCESS){
  91. return FAILURE;
  92. }
  93. if (zend_ssa_inference(&ctx->arena, op_array, ctx->script, ssa, ctx->optimization_level) != SUCCESS) {
  94. return FAILURE;
  95. }
  96. if (zend_ssa_escape_analysis(ctx->script, op_array, ssa) != SUCCESS) {
  97. return FAILURE;
  98. }
  99. if (ctx->debug_level & ZEND_DUMP_DFA_SSA_VARS) {
  100. zend_dump_ssa_variables(op_array, ssa, 0);
  101. }
  102. return SUCCESS;
  103. }
  104. static zend_bool is_smart_branch_inhibiting_nop(
  105. zend_op_array *op_array, uint32_t target, uint32_t current,
  106. zend_basic_block *b, zend_basic_block *blocks_end)
  107. {
  108. uint32_t next;
  109. /* Target points one past the last non-nop instruction. Make sure there is one. */
  110. if (target == 0) {
  111. return 0;
  112. }
  113. /* Find the next instruction, skipping unreachable or empty blocks. */
  114. next = current + 1;
  115. if (next >= b->start + b->len) {
  116. do {
  117. b++;
  118. if (b == blocks_end) {
  119. return 0;
  120. }
  121. } while (!(b->flags & ZEND_BB_REACHABLE) || b->len == 0);
  122. next = b->start;
  123. }
  124. return (op_array->opcodes[next].opcode == ZEND_JMPZ ||
  125. op_array->opcodes[next].opcode == ZEND_JMPNZ) &&
  126. zend_is_smart_branch(op_array->opcodes + target - 1);
  127. }
  128. static void zend_ssa_remove_nops(zend_op_array *op_array, zend_ssa *ssa, zend_optimizer_ctx *ctx)
  129. {
  130. zend_basic_block *blocks = ssa->cfg.blocks;
  131. zend_basic_block *blocks_end = blocks + ssa->cfg.blocks_count;
  132. zend_basic_block *b;
  133. zend_func_info *func_info;
  134. int j;
  135. uint32_t i = 0;
  136. uint32_t target = 0;
  137. uint32_t *shiftlist;
  138. ALLOCA_FLAG(use_heap);
  139. shiftlist = (uint32_t *)do_alloca(sizeof(uint32_t) * op_array->last, use_heap);
  140. memset(shiftlist, 0, sizeof(uint32_t) * op_array->last);
  141. /* remove empty callee_info */
  142. func_info = ZEND_FUNC_INFO(op_array);
  143. if (func_info) {
  144. zend_call_info **call_info = &func_info->callee_info;
  145. while ((*call_info)) {
  146. if ((*call_info)->caller_init_opline->opcode == ZEND_NOP) {
  147. *call_info = (*call_info)->next_callee;
  148. } else {
  149. call_info = &(*call_info)->next_callee;
  150. }
  151. }
  152. }
  153. for (b = blocks; b < blocks_end; b++) {
  154. if (b->flags & (ZEND_BB_REACHABLE|ZEND_BB_UNREACHABLE_FREE)) {
  155. if (b->len) {
  156. uint32_t new_start, old_end;
  157. while (i < b->start) {
  158. shiftlist[i] = i - target;
  159. i++;
  160. }
  161. if (b->flags & ZEND_BB_UNREACHABLE_FREE) {
  162. /* Only keep the FREE for the loop var */
  163. ZEND_ASSERT(op_array->opcodes[b->start].opcode == ZEND_FREE
  164. || op_array->opcodes[b->start].opcode == ZEND_FE_FREE);
  165. b->len = 1;
  166. }
  167. new_start = target;
  168. old_end = b->start + b->len;
  169. while (i < old_end) {
  170. shiftlist[i] = i - target;
  171. if (EXPECTED(op_array->opcodes[i].opcode != ZEND_NOP) ||
  172. is_smart_branch_inhibiting_nop(op_array, target, i, b, blocks_end)) {
  173. if (i != target) {
  174. op_array->opcodes[target] = op_array->opcodes[i];
  175. ssa->ops[target] = ssa->ops[i];
  176. ssa->cfg.map[target] = b - blocks;
  177. }
  178. target++;
  179. }
  180. i++;
  181. }
  182. b->start = new_start;
  183. if (target != old_end) {
  184. zend_op *opline;
  185. zend_op *new_opline;
  186. b->len = target - b->start;
  187. opline = op_array->opcodes + old_end - 1;
  188. if (opline->opcode == ZEND_NOP) {
  189. continue;
  190. }
  191. new_opline = op_array->opcodes + target - 1;
  192. zend_optimizer_migrate_jump(op_array, new_opline, opline);
  193. }
  194. } else {
  195. b->start = target;
  196. }
  197. } else {
  198. b->start = target;
  199. b->len = 0;
  200. }
  201. }
  202. if (target != op_array->last) {
  203. /* reset rest opcodes */
  204. for (i = target; i < op_array->last; i++) {
  205. MAKE_NOP(op_array->opcodes + i);
  206. }
  207. /* update SSA variables */
  208. for (j = 0; j < ssa->vars_count; j++) {
  209. if (ssa->vars[j].definition >= 0) {
  210. ssa->vars[j].definition -= shiftlist[ssa->vars[j].definition];
  211. }
  212. if (ssa->vars[j].use_chain >= 0) {
  213. ssa->vars[j].use_chain -= shiftlist[ssa->vars[j].use_chain];
  214. }
  215. }
  216. for (i = 0; i < op_array->last; i++) {
  217. if (ssa->ops[i].op1_use_chain >= 0) {
  218. ssa->ops[i].op1_use_chain -= shiftlist[ssa->ops[i].op1_use_chain];
  219. }
  220. if (ssa->ops[i].op2_use_chain >= 0) {
  221. ssa->ops[i].op2_use_chain -= shiftlist[ssa->ops[i].op2_use_chain];
  222. }
  223. if (ssa->ops[i].res_use_chain >= 0) {
  224. ssa->ops[i].res_use_chain -= shiftlist[ssa->ops[i].res_use_chain];
  225. }
  226. }
  227. /* update branch targets */
  228. for (b = blocks; b < blocks_end; b++) {
  229. if ((b->flags & ZEND_BB_REACHABLE) && b->len != 0) {
  230. zend_op *opline = op_array->opcodes + b->start + b->len - 1;
  231. zend_optimizer_shift_jump(op_array, opline, shiftlist);
  232. }
  233. }
  234. /* update brk/cont array */
  235. for (j = 0; j < op_array->last_live_range; j++) {
  236. op_array->live_range[j].start -= shiftlist[op_array->live_range[j].start];
  237. op_array->live_range[j].end -= shiftlist[op_array->live_range[j].end];
  238. }
  239. /* update try/catch array */
  240. for (j = 0; j < op_array->last_try_catch; j++) {
  241. op_array->try_catch_array[j].try_op -= shiftlist[op_array->try_catch_array[j].try_op];
  242. op_array->try_catch_array[j].catch_op -= shiftlist[op_array->try_catch_array[j].catch_op];
  243. if (op_array->try_catch_array[j].finally_op) {
  244. op_array->try_catch_array[j].finally_op -= shiftlist[op_array->try_catch_array[j].finally_op];
  245. op_array->try_catch_array[j].finally_end -= shiftlist[op_array->try_catch_array[j].finally_end];
  246. }
  247. }
  248. /* update early binding list */
  249. if (op_array->fn_flags & ZEND_ACC_EARLY_BINDING) {
  250. uint32_t *opline_num = &ctx->script->first_early_binding_opline;
  251. ZEND_ASSERT(op_array == &ctx->script->main_op_array);
  252. do {
  253. *opline_num -= shiftlist[*opline_num];
  254. opline_num = &op_array->opcodes[*opline_num].result.opline_num;
  255. } while (*opline_num != (uint32_t)-1);
  256. }
  257. /* update call graph */
  258. if (func_info) {
  259. zend_call_info *call_info = func_info->callee_info;
  260. while (call_info) {
  261. call_info->caller_init_opline -=
  262. shiftlist[call_info->caller_init_opline - op_array->opcodes];
  263. if (call_info->caller_call_opline) {
  264. call_info->caller_call_opline -=
  265. shiftlist[call_info->caller_call_opline - op_array->opcodes];
  266. }
  267. call_info = call_info->next_callee;
  268. }
  269. }
  270. op_array->last = target;
  271. }
  272. free_alloca(shiftlist, use_heap);
  273. }
  274. static inline zend_bool can_elide_return_type_check(
  275. zend_op_array *op_array, zend_ssa *ssa, zend_ssa_op *ssa_op) {
  276. zend_arg_info *info = &op_array->arg_info[-1];
  277. zend_ssa_var_info *use_info = &ssa->var_info[ssa_op->op1_use];
  278. zend_ssa_var_info *def_info = &ssa->var_info[ssa_op->op1_def];
  279. if (use_info->type & MAY_BE_REF) {
  280. return 0;
  281. }
  282. /* A type is possible that is not in the allowed types */
  283. if ((use_info->type & (MAY_BE_ANY|MAY_BE_UNDEF)) & ~(def_info->type & MAY_BE_ANY)) {
  284. return 0;
  285. }
  286. /* These types are not represented exactly */
  287. if (ZEND_TYPE_CODE(info->type) == IS_CALLABLE || ZEND_TYPE_CODE(info->type) == IS_ITERABLE) {
  288. return 0;
  289. }
  290. if (ZEND_TYPE_IS_CLASS(info->type)) {
  291. if (!use_info->ce || !def_info->ce || !instanceof_function(use_info->ce, def_info->ce)) {
  292. return 0;
  293. }
  294. }
  295. return 1;
  296. }
  297. static zend_bool opline_supports_assign_contraction(
  298. zend_ssa *ssa, zend_op *opline, int src_var, uint32_t cv_var) {
  299. if (opline->opcode == ZEND_NEW) {
  300. /* see Zend/tests/generators/aborted_yield_during_new.phpt */
  301. return 0;
  302. }
  303. if (opline->opcode == ZEND_DO_ICALL || opline->opcode == ZEND_DO_UCALL
  304. || opline->opcode == ZEND_DO_FCALL || opline->opcode == ZEND_DO_FCALL_BY_NAME) {
  305. /* Function calls may dtor the return value after it has already been written -- allow
  306. * direct assignment only for types where a double-dtor does not matter. */
  307. uint32_t type = ssa->var_info[src_var].type;
  308. uint32_t simple = MAY_BE_NULL|MAY_BE_FALSE|MAY_BE_TRUE|MAY_BE_LONG|MAY_BE_DOUBLE;
  309. return !((type & MAY_BE_ANY) & ~simple);
  310. }
  311. if (opline->opcode == ZEND_POST_INC || opline->opcode == ZEND_POST_DEC) {
  312. /* POST_INC/DEC write the result variable before performing the inc/dec. For $i = $i++
  313. * eliding the temporary variable would thus yield an incorrect result. */
  314. return opline->op1_type != IS_CV || opline->op1.var != cv_var;
  315. }
  316. if (opline->opcode == ZEND_INIT_ARRAY) {
  317. /* INIT_ARRAY initializes the result array before reading key/value. */
  318. return (opline->op1_type != IS_CV || opline->op1.var != cv_var)
  319. && (opline->op2_type != IS_CV || opline->op2.var != cv_var);
  320. }
  321. if (opline->opcode == ZEND_CAST
  322. && (opline->extended_value == IS_ARRAY || opline->extended_value == IS_OBJECT)) {
  323. /* CAST to array/object may initialize the result to an empty array/object before
  324. * reading the expression. */
  325. return opline->op1_type != IS_CV || opline->op1.var != cv_var;
  326. }
  327. return 1;
  328. }
  329. int zend_dfa_optimize_calls(zend_op_array *op_array, zend_ssa *ssa)
  330. {
  331. zend_func_info *func_info = ZEND_FUNC_INFO(op_array);
  332. int removed_ops = 0;
  333. if (func_info->callee_info) {
  334. zend_call_info *call_info = func_info->callee_info;
  335. do {
  336. if (call_info->caller_call_opline
  337. && call_info->caller_call_opline->opcode == ZEND_DO_ICALL
  338. && call_info->callee_func
  339. && ZSTR_LEN(call_info->callee_func->common.function_name) == sizeof("in_array")-1
  340. && memcmp(ZSTR_VAL(call_info->callee_func->common.function_name), "in_array", sizeof("in_array")-1) == 0
  341. && (call_info->caller_init_opline->extended_value == 2
  342. || (call_info->caller_init_opline->extended_value == 3
  343. && (call_info->caller_call_opline - 1)->opcode == ZEND_SEND_VAL
  344. && (call_info->caller_call_opline - 1)->op1_type == IS_CONST))) {
  345. zend_op *send_array;
  346. zend_op *send_needly;
  347. zend_bool strict = 0;
  348. if (call_info->caller_init_opline->extended_value == 2) {
  349. send_array = call_info->caller_call_opline - 1;
  350. send_needly = call_info->caller_call_opline - 2;
  351. } else {
  352. if (zend_is_true(CT_CONSTANT_EX(op_array, (call_info->caller_call_opline - 1)->op1.constant))) {
  353. strict = 1;
  354. }
  355. send_array = call_info->caller_call_opline - 2;
  356. send_needly = call_info->caller_call_opline - 3;
  357. }
  358. if (send_array->opcode == ZEND_SEND_VAL
  359. && send_array->op1_type == IS_CONST
  360. && Z_TYPE_P(CT_CONSTANT_EX(op_array, send_array->op1.constant)) == IS_ARRAY
  361. && (send_needly->opcode == ZEND_SEND_VAL
  362. || send_needly->opcode == ZEND_SEND_VAR)
  363. ) {
  364. int ok = 1;
  365. HashTable *src = Z_ARRVAL_P(CT_CONSTANT_EX(op_array, send_array->op1.constant));
  366. HashTable *dst;
  367. zval *val, tmp;
  368. zend_ulong idx;
  369. ZVAL_TRUE(&tmp);
  370. dst = zend_new_array(zend_hash_num_elements(src));
  371. if (strict) {
  372. ZEND_HASH_FOREACH_VAL(src, val) {
  373. if (Z_TYPE_P(val) == IS_STRING) {
  374. zend_hash_add(dst, Z_STR_P(val), &tmp);
  375. } else if (Z_TYPE_P(val) == IS_LONG) {
  376. zend_hash_index_add(dst, Z_LVAL_P(val), &tmp);
  377. } else {
  378. zend_array_destroy(dst);
  379. ok = 0;
  380. break;
  381. }
  382. } ZEND_HASH_FOREACH_END();
  383. } else {
  384. ZEND_HASH_FOREACH_VAL(src, val) {
  385. if (Z_TYPE_P(val) != IS_STRING || ZEND_HANDLE_NUMERIC(Z_STR_P(val), idx)) {
  386. zend_array_destroy(dst);
  387. ok = 0;
  388. break;
  389. }
  390. zend_hash_add(dst, Z_STR_P(val), &tmp);
  391. } ZEND_HASH_FOREACH_END();
  392. }
  393. if (ok) {
  394. uint32_t op_num = send_needly - op_array->opcodes;
  395. zend_ssa_op *ssa_op = ssa->ops + op_num;
  396. if (ssa_op->op1_use >= 0) {
  397. /* Reconstruct SSA */
  398. int var_num = ssa_op->op1_use;
  399. zend_ssa_var *var = ssa->vars + var_num;
  400. ZEND_ASSERT(ssa_op->op1_def < 0);
  401. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  402. ssa_op->op1_use = -1;
  403. ssa_op->op1_use_chain = -1;
  404. op_num = call_info->caller_call_opline - op_array->opcodes;
  405. ssa_op = ssa->ops + op_num;
  406. ssa_op->op1_use = var_num;
  407. ssa_op->op1_use_chain = var->use_chain;
  408. var->use_chain = op_num;
  409. }
  410. ZVAL_ARR(&tmp, dst);
  411. /* Update opcode */
  412. call_info->caller_call_opline->opcode = ZEND_IN_ARRAY;
  413. call_info->caller_call_opline->extended_value = strict;
  414. call_info->caller_call_opline->op1_type = send_needly->op1_type;
  415. call_info->caller_call_opline->op1.num = send_needly->op1.num;
  416. call_info->caller_call_opline->op2_type = IS_CONST;
  417. call_info->caller_call_opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  418. if (call_info->caller_init_opline->extended_value == 3) {
  419. MAKE_NOP(call_info->caller_call_opline - 1);
  420. }
  421. MAKE_NOP(call_info->caller_init_opline);
  422. MAKE_NOP(send_needly);
  423. MAKE_NOP(send_array);
  424. removed_ops++;
  425. }
  426. }
  427. }
  428. call_info = call_info->next_callee;
  429. } while (call_info);
  430. }
  431. return removed_ops;
  432. }
  433. static zend_always_inline void take_successor_0(zend_ssa *ssa, int block_num, zend_basic_block *block)
  434. {
  435. if (block->successors_count == 2) {
  436. if (block->successors[1] != block->successors[0]) {
  437. zend_ssa_remove_predecessor(ssa, block_num, block->successors[1]);
  438. }
  439. block->successors_count = 1;
  440. }
  441. }
  442. static zend_always_inline void take_successor_1(zend_ssa *ssa, int block_num, zend_basic_block *block)
  443. {
  444. if (block->successors_count == 2) {
  445. if (block->successors[1] != block->successors[0]) {
  446. zend_ssa_remove_predecessor(ssa, block_num, block->successors[0]);
  447. block->successors[0] = block->successors[1];
  448. }
  449. block->successors_count = 1;
  450. }
  451. }
  452. static void compress_block(zend_op_array *op_array, zend_basic_block *block)
  453. {
  454. while (block->len > 0) {
  455. zend_op *opline = &op_array->opcodes[block->start + block->len - 1];
  456. if (opline->opcode == ZEND_NOP
  457. && (block->len == 1 || !zend_is_smart_branch(opline - 1))) {
  458. block->len--;
  459. } else {
  460. break;
  461. }
  462. }
  463. }
  464. static void replace_predecessor(zend_ssa *ssa, int block_id, int old_pred, int new_pred) {
  465. zend_basic_block *block = &ssa->cfg.blocks[block_id];
  466. int *predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  467. zend_ssa_phi *phi;
  468. int i;
  469. int old_pred_idx = -1;
  470. int new_pred_idx = -1;
  471. for (i = 0; i < block->predecessors_count; i++) {
  472. if (predecessors[i] == old_pred) {
  473. old_pred_idx = i;
  474. }
  475. if (predecessors[i] == new_pred) {
  476. new_pred_idx = i;
  477. }
  478. }
  479. ZEND_ASSERT(old_pred_idx != -1);
  480. if (new_pred_idx == -1) {
  481. /* If the new predecessor doesn't exist yet, simply rewire the old one */
  482. predecessors[old_pred_idx] = new_pred;
  483. } else {
  484. /* Otherwise, rewiring the old predecessor would make the new predecessor appear
  485. * twice, which violates our CFG invariants. Remove the old predecessor instead. */
  486. memmove(
  487. predecessors + old_pred_idx,
  488. predecessors + old_pred_idx + 1,
  489. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  490. );
  491. /* Also remove the corresponding phi node entries */
  492. for (phi = ssa->blocks[block_id].phis; phi; phi = phi->next) {
  493. memmove(
  494. phi->sources + old_pred_idx,
  495. phi->sources + old_pred_idx + 1,
  496. sizeof(int) * (block->predecessors_count - old_pred_idx - 1)
  497. );
  498. }
  499. block->predecessors_count--;
  500. }
  501. }
  502. static void zend_ssa_replace_control_link(zend_op_array *op_array, zend_ssa *ssa, int from, int to, int new_to)
  503. {
  504. zend_basic_block *src = &ssa->cfg.blocks[from];
  505. zend_basic_block *old = &ssa->cfg.blocks[to];
  506. zend_basic_block *dst = &ssa->cfg.blocks[new_to];
  507. int i;
  508. zend_op *opline;
  509. for (i = 0; i < src->successors_count; i++) {
  510. if (src->successors[i] == to) {
  511. src->successors[i] = new_to;
  512. }
  513. }
  514. if (src->len > 0) {
  515. opline = op_array->opcodes + src->start + src->len - 1;
  516. switch (opline->opcode) {
  517. case ZEND_JMP:
  518. case ZEND_FAST_CALL:
  519. ZEND_ASSERT(ZEND_OP1_JMP_ADDR(opline) == op_array->opcodes + old->start);
  520. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, op_array->opcodes + dst->start);
  521. break;
  522. case ZEND_JMPZNZ:
  523. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  524. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  525. }
  526. /* break missing intentionally */
  527. case ZEND_JMPZ:
  528. case ZEND_JMPNZ:
  529. case ZEND_JMPZ_EX:
  530. case ZEND_JMPNZ_EX:
  531. case ZEND_FE_RESET_R:
  532. case ZEND_FE_RESET_RW:
  533. case ZEND_JMP_SET:
  534. case ZEND_COALESCE:
  535. case ZEND_ASSERT_CHECK:
  536. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  537. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  538. }
  539. break;
  540. case ZEND_CATCH:
  541. if (!(opline->extended_value & ZEND_LAST_CATCH)) {
  542. if (ZEND_OP2_JMP_ADDR(opline) == op_array->opcodes + old->start) {
  543. ZEND_SET_OP_JMP_ADDR(opline, opline->op2, op_array->opcodes + dst->start);
  544. }
  545. }
  546. break;
  547. case ZEND_DECLARE_ANON_CLASS:
  548. case ZEND_DECLARE_ANON_INHERITED_CLASS:
  549. case ZEND_FE_FETCH_R:
  550. case ZEND_FE_FETCH_RW:
  551. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  552. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  553. }
  554. break;
  555. case ZEND_SWITCH_LONG:
  556. case ZEND_SWITCH_STRING:
  557. {
  558. HashTable *jumptable = Z_ARRVAL(ZEND_OP2_LITERAL(opline));
  559. zval *zv;
  560. ZEND_HASH_FOREACH_VAL(jumptable, zv) {
  561. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, Z_LVAL_P(zv)) == old->start) {
  562. Z_LVAL_P(zv) = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  563. }
  564. } ZEND_HASH_FOREACH_END();
  565. if (ZEND_OFFSET_TO_OPLINE_NUM(op_array, opline, opline->extended_value) == old->start) {
  566. opline->extended_value = ZEND_OPLINE_NUM_TO_OFFSET(op_array, opline, dst->start);
  567. }
  568. break;
  569. }
  570. }
  571. }
  572. replace_predecessor(ssa, new_to, to, from);
  573. }
  574. static void zend_ssa_unlink_block(zend_op_array *op_array, zend_ssa *ssa, zend_basic_block *block, int block_num)
  575. {
  576. if (block->predecessors_count == 1 && ssa->blocks[block_num].phis == NULL) {
  577. int *predecessors, i;
  578. ZEND_ASSERT(block->successors_count == 1);
  579. predecessors = &ssa->cfg.predecessors[block->predecessor_offset];
  580. for (i = 0; i < block->predecessors_count; i++) {
  581. zend_ssa_replace_control_link(op_array, ssa, predecessors[i], block_num, block->successors[0]);
  582. }
  583. zend_ssa_remove_block(op_array, ssa, block_num);
  584. }
  585. }
  586. static int zend_dfa_optimize_jmps(zend_op_array *op_array, zend_ssa *ssa)
  587. {
  588. int removed_ops = 0;
  589. int block_num = 0;
  590. for (block_num = 1; block_num < ssa->cfg.blocks_count; block_num++) {
  591. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  592. if (!(block->flags & ZEND_BB_REACHABLE)) {
  593. continue;
  594. }
  595. compress_block(op_array, block);
  596. if (block->len == 0) {
  597. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  598. }
  599. }
  600. block_num = 0;
  601. while (block_num < ssa->cfg.blocks_count
  602. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE)) {
  603. block_num++;
  604. }
  605. while (block_num < ssa->cfg.blocks_count) {
  606. int next_block_num = block_num + 1;
  607. zend_basic_block *block = &ssa->cfg.blocks[block_num];
  608. uint32_t op_num;
  609. zend_op *opline;
  610. zend_ssa_op *ssa_op;
  611. while (next_block_num < ssa->cfg.blocks_count
  612. && !(ssa->cfg.blocks[next_block_num].flags & ZEND_BB_REACHABLE)) {
  613. next_block_num++;
  614. }
  615. if (block->len) {
  616. op_num = block->start + block->len - 1;
  617. opline = op_array->opcodes + op_num;
  618. ssa_op = ssa->ops + op_num;
  619. switch (opline->opcode) {
  620. case ZEND_JMP:
  621. optimize_jmp:
  622. if (block->successors[0] == next_block_num) {
  623. MAKE_NOP(opline);
  624. removed_ops++;
  625. goto optimize_nop;
  626. }
  627. break;
  628. case ZEND_JMPZ:
  629. optimize_jmpz:
  630. if (opline->op1_type == IS_CONST) {
  631. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  632. MAKE_NOP(opline);
  633. removed_ops++;
  634. take_successor_1(ssa, block_num, block);
  635. goto optimize_nop;
  636. } else {
  637. opline->opcode = ZEND_JMP;
  638. COPY_NODE(opline->op1, opline->op2);
  639. take_successor_0(ssa, block_num, block);
  640. goto optimize_jmp;
  641. }
  642. } else {
  643. if (block->successors[0] == next_block_num) {
  644. take_successor_0(ssa, block_num, block);
  645. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  646. opline->opcode = ZEND_CHECK_VAR;
  647. opline->op2.num = 0;
  648. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  649. zend_ssa_remove_instr(ssa, opline, ssa_op);
  650. removed_ops++;
  651. goto optimize_nop;
  652. } else {
  653. opline->opcode = ZEND_FREE;
  654. opline->op2.num = 0;
  655. }
  656. }
  657. }
  658. break;
  659. case ZEND_JMPNZ:
  660. optimize_jmpnz:
  661. if (opline->op1_type == IS_CONST) {
  662. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  663. opline->opcode = ZEND_JMP;
  664. COPY_NODE(opline->op1, opline->op2);
  665. take_successor_0(ssa, block_num, block);
  666. goto optimize_jmp;
  667. } else {
  668. MAKE_NOP(opline);
  669. removed_ops++;
  670. take_successor_1(ssa, block_num, block);
  671. goto optimize_nop;
  672. }
  673. } else if (block->successors_count == 2) {
  674. if (block->successors[0] == next_block_num) {
  675. take_successor_0(ssa, block_num, block);
  676. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  677. opline->opcode = ZEND_CHECK_VAR;
  678. opline->op2.num = 0;
  679. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  680. zend_ssa_remove_instr(ssa, opline, ssa_op);
  681. removed_ops++;
  682. goto optimize_nop;
  683. } else {
  684. opline->opcode = ZEND_FREE;
  685. opline->op2.num = 0;
  686. }
  687. }
  688. }
  689. break;
  690. case ZEND_JMPZNZ:
  691. if (opline->op1_type == IS_CONST) {
  692. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  693. zend_op *target_opline = ZEND_OFFSET_TO_OPLINE(opline, opline->extended_value);
  694. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  695. take_successor_1(ssa, block_num, block);
  696. } else {
  697. zend_op *target_opline = ZEND_OP2_JMP_ADDR(opline);
  698. ZEND_SET_OP_JMP_ADDR(opline, opline->op1, target_opline);
  699. take_successor_0(ssa, block_num, block);
  700. }
  701. opline->op1_type = IS_UNUSED;
  702. opline->extended_value = 0;
  703. opline->opcode = ZEND_JMP;
  704. goto optimize_jmp;
  705. } else if (block->successors_count == 2) {
  706. if (block->successors[0] == block->successors[1]) {
  707. take_successor_0(ssa, block_num, block);
  708. if (block->successors[0] == next_block_num) {
  709. if (opline->op1_type == IS_CV && (OP1_INFO() & MAY_BE_UNDEF)) {
  710. opline->opcode = ZEND_CHECK_VAR;
  711. opline->op2.num = 0;
  712. } else if (opline->op1_type == IS_CV || !(OP1_INFO() & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))) {
  713. zend_ssa_remove_instr(ssa, opline, ssa_op);
  714. removed_ops++;
  715. goto optimize_nop;
  716. } else {
  717. opline->opcode = ZEND_FREE;
  718. opline->op2.num = 0;
  719. }
  720. } 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))) {
  721. ZEND_ASSERT(ssa_op->op1_use >= 0);
  722. zend_ssa_unlink_use_chain(ssa, op_num, ssa_op->op1_use);
  723. ssa_op->op1_use = -1;
  724. ssa_op->op1_use_chain = -1;
  725. opline->opcode = ZEND_JMP;
  726. opline->op1_type = IS_UNUSED;
  727. opline->op1.num = opline->op2.num;
  728. goto optimize_jmp;
  729. }
  730. }
  731. }
  732. break;
  733. case ZEND_JMPZ_EX:
  734. if (ssa->vars[ssa_op->result_def].use_chain < 0
  735. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  736. opline->opcode = ZEND_JMPZ;
  737. opline->result_type = IS_UNUSED;
  738. zend_ssa_remove_result_def(ssa, ssa_op);
  739. goto optimize_jmpz;
  740. } else if (opline->op1_type == IS_CONST) {
  741. if (zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  742. opline->opcode = ZEND_QM_ASSIGN;
  743. take_successor_1(ssa, block_num, block);
  744. }
  745. }
  746. break;
  747. case ZEND_JMPNZ_EX:
  748. if (ssa->vars[ssa_op->result_def].use_chain < 0
  749. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  750. opline->opcode = ZEND_JMPNZ;
  751. opline->result_type = IS_UNUSED;
  752. zend_ssa_remove_result_def(ssa, ssa_op);
  753. goto optimize_jmpnz;
  754. } else if (opline->op1_type == IS_CONST) {
  755. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  756. opline->opcode = ZEND_QM_ASSIGN;
  757. take_successor_1(ssa, block_num, block);
  758. }
  759. }
  760. break;
  761. case ZEND_JMP_SET:
  762. if (ssa->vars[ssa_op->result_def].use_chain < 0
  763. && ssa->vars[ssa_op->result_def].phi_use_chain == NULL) {
  764. opline->opcode = ZEND_JMPNZ;
  765. opline->result_type = IS_UNUSED;
  766. zend_ssa_remove_result_def(ssa, ssa_op);
  767. goto optimize_jmpnz;
  768. } else if (opline->op1_type == IS_CONST) {
  769. if (!zend_is_true(CT_CONSTANT_EX(op_array, opline->op1.constant))) {
  770. MAKE_NOP(opline);
  771. removed_ops++;
  772. take_successor_1(ssa, block_num, block);
  773. zend_ssa_remove_result_def(ssa, ssa_op);
  774. goto optimize_nop;
  775. }
  776. }
  777. break;
  778. case ZEND_COALESCE:
  779. {
  780. zend_ssa_var *var = &ssa->vars[ssa_op->result_def];
  781. if (opline->op1_type == IS_CONST
  782. && var->use_chain < 0 && var->phi_use_chain == NULL) {
  783. if (Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_NULL) {
  784. zend_ssa_remove_result_def(ssa, ssa_op);
  785. MAKE_NOP(opline);
  786. removed_ops++;
  787. take_successor_1(ssa, block_num, block);
  788. goto optimize_nop;
  789. } else {
  790. if (opline->result_type & (IS_TMP_VAR|IS_VAR)) {
  791. zend_optimizer_remove_live_range_ex(op_array, opline->result.var, var->definition);
  792. }
  793. opline->opcode = ZEND_JMP;
  794. opline->result_type = IS_UNUSED;
  795. zend_ssa_remove_result_def(ssa, ssa_op);
  796. COPY_NODE(opline->op1, opline->op2);
  797. take_successor_0(ssa, block_num, block);
  798. goto optimize_jmp;
  799. }
  800. }
  801. break;
  802. }
  803. case ZEND_NOP:
  804. optimize_nop:
  805. compress_block(op_array, block);
  806. if (block->len == 0) {
  807. if (block_num > 0) {
  808. zend_ssa_unlink_block(op_array, ssa, block, block_num);
  809. /* backtrack to previous basic block */
  810. do {
  811. block_num--;
  812. } while (block_num >= 0
  813. && !(ssa->cfg.blocks[block_num].flags & ZEND_BB_REACHABLE));
  814. if (block_num >= 0) {
  815. continue;
  816. }
  817. }
  818. }
  819. break;
  820. default:
  821. break;
  822. }
  823. }
  824. block_num = next_block_num;
  825. }
  826. return removed_ops;
  827. }
  828. void zend_dfa_optimize_op_array(zend_op_array *op_array, zend_optimizer_ctx *ctx, zend_ssa *ssa, zend_call_info **call_map)
  829. {
  830. if (ctx->debug_level & ZEND_DUMP_BEFORE_DFA_PASS) {
  831. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "before dfa pass", ssa);
  832. }
  833. if (ssa->var_info) {
  834. int op_1;
  835. int v;
  836. int remove_nops = 0;
  837. zend_op *opline;
  838. zval tmp;
  839. #if ZEND_DEBUG_DFA
  840. ssa_verify_integrity(op_array, ssa, "before dfa");
  841. #endif
  842. if (ZEND_OPTIMIZER_PASS_8 & ctx->optimization_level) {
  843. if (sccp_optimize_op_array(ctx, op_array, ssa, call_map)) {
  844. remove_nops = 1;
  845. }
  846. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  847. remove_nops = 1;
  848. }
  849. #if ZEND_DEBUG_DFA
  850. ssa_verify_integrity(op_array, ssa, "after sccp");
  851. #endif
  852. if (ZEND_FUNC_INFO(op_array)) {
  853. if (zend_dfa_optimize_calls(op_array, ssa)) {
  854. remove_nops = 1;
  855. }
  856. }
  857. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_8) {
  858. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after sccp pass", ssa);
  859. }
  860. #if ZEND_DEBUG_DFA
  861. ssa_verify_integrity(op_array, ssa, "after calls");
  862. #endif
  863. }
  864. if (ZEND_OPTIMIZER_PASS_14 & ctx->optimization_level) {
  865. if (dce_optimize_op_array(op_array, ssa, 0)) {
  866. remove_nops = 1;
  867. }
  868. if (zend_dfa_optimize_jmps(op_array, ssa)) {
  869. remove_nops = 1;
  870. }
  871. if (ctx->debug_level & ZEND_DUMP_AFTER_PASS_14) {
  872. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dce pass", ssa);
  873. }
  874. #if ZEND_DEBUG_DFA
  875. ssa_verify_integrity(op_array, ssa, "after dce");
  876. #endif
  877. }
  878. for (v = op_array->last_var; v < ssa->vars_count; v++) {
  879. op_1 = ssa->vars[v].definition;
  880. if (op_1 < 0) {
  881. continue;
  882. }
  883. opline = op_array->opcodes + op_1;
  884. /* Convert LONG constants to DOUBLE */
  885. if (ssa->var_info[v].use_as_double) {
  886. if (opline->opcode == ZEND_ASSIGN
  887. && opline->op2_type == IS_CONST
  888. && ssa->ops[op_1].op1_def == v
  889. && !RETURN_VALUE_USED(opline)
  890. ) {
  891. // op_1: ASSIGN ? -> #v [use_as_double], long(?) => ASSIGN ? -> #v, double(?)
  892. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  893. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  894. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  895. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  896. } else if (opline->opcode == ZEND_QM_ASSIGN
  897. && opline->op1_type == IS_CONST
  898. ) {
  899. // op_1: QM_ASSIGN #v [use_as_double], long(?) => QM_ASSIGN #v, double(?)
  900. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  901. ZEND_ASSERT(Z_TYPE_INFO_P(zv) == IS_LONG);
  902. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  903. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  904. }
  905. } else {
  906. if (opline->opcode == ZEND_ADD
  907. || opline->opcode == ZEND_SUB
  908. || opline->opcode == ZEND_MUL
  909. || opline->opcode == ZEND_IS_EQUAL
  910. || opline->opcode == ZEND_IS_NOT_EQUAL
  911. || opline->opcode == ZEND_IS_SMALLER
  912. || opline->opcode == ZEND_IS_SMALLER_OR_EQUAL
  913. ) {
  914. if (opline->op1_type == IS_CONST
  915. && opline->op2_type != IS_CONST
  916. && (OP2_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  917. && Z_TYPE_INFO_P(CT_CONSTANT_EX(op_array, opline->op1.constant)) == IS_LONG
  918. ) {
  919. // op_1: #v.? = ADD long(?), #?.? [double] => #v.? = ADD double(?), #?.? [double]
  920. zval *zv = CT_CONSTANT_EX(op_array, opline->op1.constant);
  921. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  922. opline->op1.constant = zend_optimizer_add_literal(op_array, &tmp);
  923. } else if (opline->op1_type != IS_CONST
  924. && opline->op2_type == IS_CONST
  925. && (OP1_INFO() & MAY_BE_ANY) == MAY_BE_DOUBLE
  926. && Z_TYPE_INFO_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  927. ) {
  928. // op_1: #v.? = ADD #?.? [double], long(?) => #v.? = ADD #?.? [double], double(?)
  929. zval *zv = CT_CONSTANT_EX(op_array, opline->op2.constant);
  930. ZVAL_DOUBLE(&tmp, zval_get_double(zv));
  931. opline->op2.constant = zend_optimizer_add_literal(op_array, &tmp);
  932. }
  933. } else if (opline->opcode == ZEND_CONCAT) {
  934. if (!(OP1_INFO() & MAY_BE_OBJECT)
  935. && !(OP2_INFO() & MAY_BE_OBJECT)) {
  936. opline->opcode = ZEND_FAST_CONCAT;
  937. }
  938. }
  939. }
  940. if (ssa->vars[v].var >= op_array->last_var) {
  941. /* skip TMP and VAR */
  942. continue;
  943. }
  944. if (opline->opcode == ZEND_ASSIGN
  945. && ssa->ops[op_1].op1_def == v
  946. && !RETURN_VALUE_USED(opline)
  947. ) {
  948. int orig_var = ssa->ops[op_1].op1_use;
  949. if (orig_var >= 0
  950. && !(ssa->var_info[orig_var].type & (MAY_BE_STRING|MAY_BE_ARRAY|MAY_BE_OBJECT|MAY_BE_RESOURCE|MAY_BE_REF))
  951. ) {
  952. int src_var = ssa->ops[op_1].op2_use;
  953. if ((opline->op2_type & (IS_TMP_VAR|IS_VAR))
  954. && src_var >= 0
  955. && !(ssa->var_info[src_var].type & MAY_BE_REF)
  956. && ssa->vars[src_var].definition >= 0
  957. && ssa->ops[ssa->vars[src_var].definition].result_def == src_var
  958. && ssa->ops[ssa->vars[src_var].definition].result_use < 0
  959. && ssa->vars[src_var].use_chain == op_1
  960. && ssa->ops[op_1].op2_use_chain < 0
  961. && !ssa->vars[src_var].phi_use_chain
  962. && !ssa->vars[src_var].sym_use_chain
  963. && opline_supports_assign_contraction(
  964. ssa, &op_array->opcodes[ssa->vars[src_var].definition],
  965. src_var, opline->op1.var)
  966. ) {
  967. int op_2 = ssa->vars[src_var].definition;
  968. // op_2: #src_var.T = OP ... => #v.CV = OP ...
  969. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, #src_var.T NOP
  970. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  971. /* Reconstruct SSA */
  972. ssa->vars[v].definition = op_2;
  973. ssa->ops[op_2].result_def = v;
  974. ssa->vars[src_var].definition = -1;
  975. ssa->vars[src_var].use_chain = -1;
  976. ssa->ops[op_1].op1_use = -1;
  977. ssa->ops[op_1].op2_use = -1;
  978. ssa->ops[op_1].op1_def = -1;
  979. ssa->ops[op_1].op1_use_chain = -1;
  980. /* Update opcodes */
  981. op_array->opcodes[op_2].result_type = opline->op1_type;
  982. op_array->opcodes[op_2].result.var = opline->op1.var;
  983. MAKE_NOP(opline);
  984. remove_nops = 1;
  985. }
  986. } else if (opline->op2_type == IS_CONST
  987. || ((opline->op2_type & (IS_TMP_VAR|IS_VAR|IS_CV))
  988. && ssa->ops[op_1].op2_use >= 0
  989. && ssa->ops[op_1].op2_def < 0)
  990. ) {
  991. // op_1: ASSIGN #orig_var.CV [undef,scalar] -> #v.CV, CONST|TMPVAR => QM_ASSIGN v.CV, CONST|TMPVAR
  992. if (ssa->ops[op_1].op1_use != ssa->ops[op_1].op2_use) {
  993. zend_ssa_unlink_use_chain(ssa, op_1, orig_var);
  994. } else {
  995. ssa->ops[op_1].op2_use_chain = ssa->ops[op_1].op1_use_chain;
  996. }
  997. /* Reconstruct SSA */
  998. ssa->ops[op_1].result_def = v;
  999. ssa->ops[op_1].op1_def = -1;
  1000. ssa->ops[op_1].op1_use = ssa->ops[op_1].op2_use;
  1001. ssa->ops[op_1].op1_use_chain = ssa->ops[op_1].op2_use_chain;
  1002. ssa->ops[op_1].op2_use = -1;
  1003. ssa->ops[op_1].op2_use_chain = -1;
  1004. /* Update opcode */
  1005. opline->result_type = opline->op1_type;
  1006. opline->result.var = opline->op1.var;
  1007. opline->op1_type = opline->op2_type;
  1008. opline->op1.var = opline->op2.var;
  1009. opline->op2_type = IS_UNUSED;
  1010. opline->op2.var = 0;
  1011. opline->opcode = ZEND_QM_ASSIGN;
  1012. }
  1013. }
  1014. } else if (opline->opcode == ZEND_ASSIGN_ADD
  1015. && opline->extended_value == 0
  1016. && ssa->ops[op_1].op1_def == v
  1017. && opline->op2_type == IS_CONST
  1018. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1019. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1020. && ssa->ops[op_1].op1_use >= 0
  1021. && !(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))) {
  1022. // op_1: ASSIGN_ADD #?.CV [undef,null,int,foat] ->#v.CV, int(1) => PRE_INC #?.CV ->#v.CV
  1023. opline->opcode = ZEND_PRE_INC;
  1024. SET_UNUSED(opline->op2);
  1025. } else if (opline->opcode == ZEND_ASSIGN_SUB
  1026. && opline->extended_value == 0
  1027. && ssa->ops[op_1].op1_def == v
  1028. && opline->op2_type == IS_CONST
  1029. && Z_TYPE_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == IS_LONG
  1030. && Z_LVAL_P(CT_CONSTANT_EX(op_array, opline->op2.constant)) == 1
  1031. && ssa->ops[op_1].op1_use >= 0
  1032. && !(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))) {
  1033. // op_1: ASSIGN_SUB #?.CV [undef,null,int,foat] -> #v.CV, int(1) => PRE_DEC #?.CV ->#v.CV
  1034. opline->opcode = ZEND_PRE_DEC;
  1035. SET_UNUSED(opline->op2);
  1036. } else if (opline->opcode == ZEND_VERIFY_RETURN_TYPE
  1037. && ssa->ops[op_1].op1_def == v
  1038. && ssa->ops[op_1].op1_use >= 0
  1039. && ssa->ops[op_1].op1_use_chain == -1
  1040. && ssa->vars[v].use_chain >= 0
  1041. && can_elide_return_type_check(op_array, ssa, &ssa->ops[op_1])) {
  1042. // op_1: VERIFY_RETURN_TYPE #orig_var.CV [T] -> #v.CV [T] => NOP
  1043. int orig_var = ssa->ops[op_1].op1_use;
  1044. if (zend_ssa_unlink_use_chain(ssa, op_1, orig_var)) {
  1045. int ret = ssa->vars[v].use_chain;
  1046. ssa->ops[ret].op1_use = orig_var;
  1047. ssa->ops[ret].op1_use_chain = ssa->vars[orig_var].use_chain;
  1048. ssa->vars[orig_var].use_chain = ret;
  1049. ssa->vars[v].definition = -1;
  1050. ssa->vars[v].use_chain = -1;
  1051. ssa->ops[op_1].op1_def = -1;
  1052. ssa->ops[op_1].op1_use = -1;
  1053. MAKE_NOP(opline);
  1054. remove_nops = 1;
  1055. }
  1056. } else if (ssa->ops[op_1].op1_def == v
  1057. && !RETURN_VALUE_USED(opline)
  1058. && ssa->ops[op_1].op1_use >= 0
  1059. && !(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))
  1060. && (opline->opcode == ZEND_ASSIGN_ADD
  1061. || opline->opcode == ZEND_ASSIGN_SUB
  1062. || opline->opcode == ZEND_ASSIGN_MUL
  1063. || opline->opcode == ZEND_ASSIGN_DIV
  1064. || opline->opcode == ZEND_ASSIGN_MOD
  1065. || opline->opcode == ZEND_ASSIGN_SL
  1066. || opline->opcode == ZEND_ASSIGN_SR
  1067. || opline->opcode == ZEND_ASSIGN_BW_OR
  1068. || opline->opcode == ZEND_ASSIGN_BW_AND
  1069. || opline->opcode == ZEND_ASSIGN_BW_XOR)
  1070. && opline->extended_value == 0) {
  1071. // op_1: ASSIGN_ADD #orig_var.CV [undef,null,bool,int,double] -> #v.CV, ? => #v.CV = ADD #orig_var.CV, ?
  1072. /* Reconstruct SSA */
  1073. ssa->ops[op_1].result_def = ssa->ops[op_1].op1_def;
  1074. ssa->ops[op_1].op1_def = -1;
  1075. /* Update opcode */
  1076. opline->opcode -= (ZEND_ASSIGN_ADD - ZEND_ADD);
  1077. opline->result_type = opline->op1_type;
  1078. opline->result.var = opline->op1.var;
  1079. }
  1080. }
  1081. #if ZEND_DEBUG_DFA
  1082. ssa_verify_integrity(op_array, ssa, "after dfa");
  1083. #endif
  1084. if (remove_nops) {
  1085. zend_ssa_remove_nops(op_array, ssa, ctx);
  1086. #if ZEND_DEBUG_DFA
  1087. ssa_verify_integrity(op_array, ssa, "after nop");
  1088. #endif
  1089. }
  1090. }
  1091. if (ctx->debug_level & ZEND_DUMP_AFTER_DFA_PASS) {
  1092. zend_dump_op_array(op_array, ZEND_DUMP_SSA, "after dfa pass", ssa);
  1093. }
  1094. }
  1095. void zend_optimize_dfa(zend_op_array *op_array, zend_optimizer_ctx *ctx)
  1096. {
  1097. void *checkpoint = zend_arena_checkpoint(ctx->arena);
  1098. zend_ssa ssa;
  1099. if (zend_dfa_analyze_op_array(op_array, ctx, &ssa) != SUCCESS) {
  1100. zend_arena_release(&ctx->arena, checkpoint);
  1101. return;
  1102. }
  1103. zend_dfa_optimize_op_array(op_array, ctx, &ssa, NULL);
  1104. /* Destroy SSA */
  1105. zend_arena_release(&ctx->arena, checkpoint);
  1106. }
  1107. /*
  1108. * Local variables:
  1109. * tab-width: 4
  1110. * c-basic-offset: 4
  1111. * indent-tabs-mode: t
  1112. * End:
  1113. */