zend_call_graph.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274
  1. /*
  2. +----------------------------------------------------------------------+
  3. | Zend Engine, Call Graph |
  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 "zend_compile.h"
  19. #include "zend_extensions.h"
  20. #include "Optimizer/zend_optimizer.h"
  21. #include "zend_optimizer_internal.h"
  22. #include "zend_inference.h"
  23. #include "zend_call_graph.h"
  24. #include "zend_func_info.h"
  25. #include "zend_inference.h"
  26. #include "zend_call_graph.h"
  27. static void zend_op_array_calc(zend_op_array *op_array, void *context)
  28. {
  29. zend_call_graph *call_graph = context;
  30. call_graph->op_arrays_count++;
  31. }
  32. static void zend_op_array_collect(zend_op_array *op_array, void *context)
  33. {
  34. zend_call_graph *call_graph = context;
  35. zend_func_info *func_info = call_graph->func_infos + call_graph->op_arrays_count;
  36. ZEND_SET_FUNC_INFO(op_array, func_info);
  37. call_graph->op_arrays[call_graph->op_arrays_count] = op_array;
  38. func_info->num = call_graph->op_arrays_count;
  39. call_graph->op_arrays_count++;
  40. }
  41. ZEND_API int zend_analyze_calls(zend_arena **arena, zend_script *script, uint32_t build_flags, zend_op_array *op_array, zend_func_info *func_info)
  42. {
  43. zend_op *opline = op_array->opcodes;
  44. zend_op *end = opline + op_array->last;
  45. zend_function *func;
  46. zend_call_info *call_info;
  47. int call = 0;
  48. zend_call_info **call_stack;
  49. ALLOCA_FLAG(use_heap);
  50. bool is_prototype;
  51. call_stack = do_alloca((op_array->last / 2) * sizeof(zend_call_info*), use_heap);
  52. call_info = NULL;
  53. while (opline != end) {
  54. switch (opline->opcode) {
  55. case ZEND_INIT_FCALL:
  56. case ZEND_INIT_METHOD_CALL:
  57. case ZEND_INIT_STATIC_METHOD_CALL:
  58. call_stack[call] = call_info;
  59. func = zend_optimizer_get_called_func(
  60. script, op_array, opline, &is_prototype);
  61. if (func) {
  62. call_info = zend_arena_calloc(arena, 1, sizeof(zend_call_info) + (sizeof(zend_send_arg_info) * ((int)opline->extended_value - 1)));
  63. call_info->caller_op_array = op_array;
  64. call_info->caller_init_opline = opline;
  65. call_info->caller_call_opline = NULL;
  66. call_info->callee_func = func;
  67. call_info->num_args = opline->extended_value;
  68. call_info->next_callee = func_info->callee_info;
  69. call_info->is_prototype = is_prototype;
  70. func_info->callee_info = call_info;
  71. if (build_flags & ZEND_CALL_TREE) {
  72. call_info->next_caller = NULL;
  73. } else if (func->type == ZEND_INTERNAL_FUNCTION) {
  74. call_info->next_caller = NULL;
  75. } else {
  76. zend_func_info *callee_func_info = ZEND_FUNC_INFO(&func->op_array);
  77. if (callee_func_info) {
  78. call_info->next_caller = callee_func_info->caller_info;
  79. callee_func_info->caller_info = call_info;
  80. } else {
  81. call_info->next_caller = NULL;
  82. }
  83. }
  84. } else {
  85. call_info = NULL;
  86. }
  87. call++;
  88. break;
  89. case ZEND_INIT_FCALL_BY_NAME:
  90. case ZEND_INIT_NS_FCALL_BY_NAME:
  91. case ZEND_INIT_DYNAMIC_CALL:
  92. case ZEND_NEW:
  93. case ZEND_INIT_USER_CALL:
  94. call_stack[call] = call_info;
  95. call_info = NULL;
  96. call++;
  97. break;
  98. case ZEND_DO_FCALL:
  99. case ZEND_DO_ICALL:
  100. case ZEND_DO_UCALL:
  101. case ZEND_DO_FCALL_BY_NAME:
  102. case ZEND_CALLABLE_CONVERT:
  103. func_info->flags |= ZEND_FUNC_HAS_CALLS;
  104. if (call_info) {
  105. call_info->caller_call_opline = opline;
  106. }
  107. call--;
  108. call_info = call_stack[call];
  109. break;
  110. case ZEND_SEND_VAL:
  111. case ZEND_SEND_VAR:
  112. case ZEND_SEND_VAL_EX:
  113. case ZEND_SEND_VAR_EX:
  114. case ZEND_SEND_FUNC_ARG:
  115. case ZEND_SEND_REF:
  116. case ZEND_SEND_VAR_NO_REF:
  117. case ZEND_SEND_VAR_NO_REF_EX:
  118. case ZEND_SEND_USER:
  119. if (call_info) {
  120. if (opline->op2_type == IS_CONST) {
  121. call_info->named_args = 1;
  122. break;
  123. }
  124. uint32_t num = opline->op2.num;
  125. if (num > 0) {
  126. num--;
  127. }
  128. call_info->arg_info[num].opline = opline;
  129. }
  130. break;
  131. case ZEND_SEND_ARRAY:
  132. case ZEND_SEND_UNPACK:
  133. if (call_info) {
  134. call_info->send_unpack = 1;
  135. }
  136. break;
  137. case ZEND_EXIT:
  138. /* In this case the DO_CALL opcode may have been dropped
  139. * and caller_call_opline will be NULL. */
  140. break;
  141. }
  142. opline++;
  143. }
  144. free_alloca(call_stack, use_heap);
  145. return SUCCESS;
  146. }
  147. static int zend_is_indirectly_recursive(zend_op_array *root, zend_op_array *op_array, zend_bitset visited)
  148. {
  149. zend_func_info *func_info;
  150. zend_call_info *call_info;
  151. int ret = 0;
  152. if (op_array == root) {
  153. return 1;
  154. }
  155. func_info = ZEND_FUNC_INFO(op_array);
  156. if (zend_bitset_in(visited, func_info->num)) {
  157. return 0;
  158. }
  159. zend_bitset_incl(visited, func_info->num);
  160. call_info = func_info->caller_info;
  161. while (call_info) {
  162. if (zend_is_indirectly_recursive(root, call_info->caller_op_array, visited)) {
  163. call_info->recursive = 1;
  164. ret = 1;
  165. }
  166. call_info = call_info->next_caller;
  167. }
  168. return ret;
  169. }
  170. static void zend_analyze_recursion(zend_call_graph *call_graph)
  171. {
  172. zend_op_array *op_array;
  173. zend_func_info *func_info;
  174. zend_call_info *call_info;
  175. int i;
  176. int set_len = zend_bitset_len(call_graph->op_arrays_count);
  177. zend_bitset visited;
  178. ALLOCA_FLAG(use_heap);
  179. visited = ZEND_BITSET_ALLOCA(set_len, use_heap);
  180. for (i = 0; i < call_graph->op_arrays_count; i++) {
  181. op_array = call_graph->op_arrays[i];
  182. func_info = call_graph->func_infos + i;
  183. call_info = func_info->caller_info;
  184. for (; call_info; call_info = call_info->next_caller) {
  185. if (call_info->is_prototype) {
  186. /* Might be calling an overridden child method and not actually recursive. */
  187. continue;
  188. }
  189. if (call_info->caller_op_array == op_array) {
  190. call_info->recursive = 1;
  191. func_info->flags |= ZEND_FUNC_RECURSIVE | ZEND_FUNC_RECURSIVE_DIRECTLY;
  192. } else {
  193. memset(visited, 0, sizeof(zend_ulong) * set_len);
  194. if (zend_is_indirectly_recursive(op_array, call_info->caller_op_array, visited)) {
  195. call_info->recursive = 1;
  196. func_info->flags |= ZEND_FUNC_RECURSIVE | ZEND_FUNC_RECURSIVE_INDIRECTLY;
  197. }
  198. }
  199. }
  200. }
  201. free_alloca(visited, use_heap);
  202. }
  203. static void zend_sort_op_arrays(zend_call_graph *call_graph)
  204. {
  205. (void) call_graph;
  206. // TODO: perform topological sort of cyclic call graph
  207. }
  208. ZEND_API int zend_build_call_graph(zend_arena **arena, zend_script *script, zend_call_graph *call_graph) /* {{{ */
  209. {
  210. call_graph->op_arrays_count = 0;
  211. zend_foreach_op_array(script, zend_op_array_calc, call_graph);
  212. call_graph->op_arrays = (zend_op_array**)zend_arena_calloc(arena, call_graph->op_arrays_count, sizeof(zend_op_array*));
  213. call_graph->func_infos = (zend_func_info*)zend_arena_calloc(arena, call_graph->op_arrays_count, sizeof(zend_func_info));
  214. call_graph->op_arrays_count = 0;
  215. zend_foreach_op_array(script, zend_op_array_collect, call_graph);
  216. return SUCCESS;
  217. }
  218. /* }}} */
  219. ZEND_API void zend_analyze_call_graph(zend_arena **arena, zend_script *script, zend_call_graph *call_graph) /* {{{ */
  220. {
  221. int i;
  222. for (i = 0; i < call_graph->op_arrays_count; i++) {
  223. zend_analyze_calls(arena, script, 0, call_graph->op_arrays[i], call_graph->func_infos + i);
  224. }
  225. zend_analyze_recursion(call_graph);
  226. zend_sort_op_arrays(call_graph);
  227. }
  228. /* }}} */
  229. ZEND_API zend_call_info **zend_build_call_map(zend_arena **arena, zend_func_info *info, const zend_op_array *op_array) /* {{{ */
  230. {
  231. zend_call_info **map, *call;
  232. if (!info->callee_info) {
  233. /* Don't build call map if function contains no calls */
  234. return NULL;
  235. }
  236. map = zend_arena_calloc(arena, sizeof(zend_call_info *), op_array->last);
  237. for (call = info->callee_info; call; call = call->next_callee) {
  238. int i;
  239. map[call->caller_init_opline - op_array->opcodes] = call;
  240. if (call->caller_call_opline) {
  241. map[call->caller_call_opline - op_array->opcodes] = call;
  242. }
  243. for (i = 0; i < call->num_args; i++) {
  244. if (call->arg_info[i].opline) {
  245. map[call->arg_info[i].opline - op_array->opcodes] = call;
  246. }
  247. }
  248. }
  249. return map;
  250. }
  251. /* }}} */