Gecko [ www.ctm-euromeuble.fr ]

Name	Size	Permission	Date
.libs	[ DIR ]	drwxr-xr-x	2024-03-12 14:21
block_pass.c	62.85 KB	-rw-rw-r--	2022-10-31 11:36
block_pass.lo	343 B	-rw-r--r--	2024-03-12 14:20
block_pass.o	190.32 KB	-rw-r--r--	2024-03-12 14:20
compact_literals.c	26.82 KB	-rw-rw-r--	2022-10-31 11:36
compact_literals.lo	361 B	-rw-r--r--	2024-03-12 14:20
compact_literals.o	119.45 KB	-rw-r--r--	2024-03-12 14:20
compact_vars.c	4.32 KB	-rw-rw-r--	2022-10-31 11:36
compact_vars.lo	349 B	-rw-r--r--	2024-03-12 14:21
compact_vars.o	64.34 KB	-rw-r--r--	2024-03-12 14:21
dce.c	20.51 KB	-rw-rw-r--	2022-10-31 11:36
dce.lo	322 B	-rw-r--r--	2024-03-12 14:21
dce.o	146.59 KB	-rw-r--r--	2024-03-12 14:21
dfa_pass.c	41.96 KB	-rw-rw-r--	2022-10-31 11:36
dfa_pass.lo	337 B	-rw-r--r--	2024-03-12 14:20
dfa_pass.o	160.44 KB	-rw-r--r--	2024-03-12 14:20
escape_analysis.c	14.67 KB	-rw-rw-r--	2022-10-31 11:36
escape_analysis.lo	358 B	-rw-r--r--	2024-03-12 14:21
escape_analysis.o	127.1 KB	-rw-r--r--	2024-03-12 14:21
nop_removal.c	3.75 KB	-rw-rw-r--	2022-10-31 11:36
nop_removal.lo	346 B	-rw-r--r--	2024-03-12 14:20
nop_removal.o	71.97 KB	-rw-r--r--	2024-03-12 14:20
optimize_func_calls.c	10.06 KB	-rw-rw-r--	2022-10-31 11:36
optimize_func_calls.lo	370 B	-rw-r--r--	2024-03-12 14:20
optimize_func_calls.o	92.51 KB	-rw-r--r--	2024-03-12 14:20
optimize_temp_vars_5.c	6.25 KB	-rw-rw-r--	2022-10-31 11:36
optimize_temp_vars_5.lo	373 B	-rw-r--r--	2024-03-12 14:20
optimize_temp_vars_5.o	84.93 KB	-rw-r--r--	2024-03-12 14:20
pass1_5.c	20.27 KB	-rw-rw-r--	2022-10-31 11:36
pass1_5.lo	334 B	-rw-r--r--	2024-03-12 14:20
pass1_5.o	111.31 KB	-rw-r--r--	2024-03-12 14:20
pass2.c	8.03 KB	-rw-rw-r--	2022-10-31 11:36
pass2.lo	328 B	-rw-r--r--	2024-03-12 14:20
pass2.o	78.8 KB	-rw-r--r--	2024-03-12 14:20
pass3.c	13.99 KB	-rw-rw-r--	2022-10-31 11:36
pass3.lo	328 B	-rw-r--r--	2024-03-12 14:20
pass3.o	77.67 KB	-rw-r--r--	2024-03-12 14:20
sccp.c	71.32 KB	-rw-rw-r--	2022-10-31 11:36
sccp.lo	325 B	-rw-r--r--	2024-03-12 14:21
sccp.o	537.66 KB	-rw-r--r--	2024-03-12 14:21
scdf.c	9.43 KB	-rw-rw-r--	2022-10-31 11:36
scdf.h	3.46 KB	-rw-rw-r--	2022-10-31 11:36
scdf.lo	325 B	-rw-r--r--	2024-03-12 14:21
scdf.o	87.01 KB	-rw-r--r--	2024-03-12 14:21
ssa_integrity.c	12.62 KB	-rw-rw-r--	2022-10-31 11:36
zend_call_graph.c	9.27 KB	-rw-rw-r--	2022-10-31 11:36
zend_call_graph.h	3.17 KB	-rw-rw-r--	2022-10-31 11:36
zend_call_graph.lo	358 B	-rw-r--r--	2024-03-12 14:21
zend_call_graph.o	107.78 KB	-rw-r--r--	2024-03-12 14:21
zend_cfg.c	25.16 KB	-rw-rw-r--	2022-10-31 11:36
zend_cfg.h	5.57 KB	-rw-rw-r--	2022-10-31 11:36
zend_cfg.lo	337 B	-rw-r--r--	2024-03-12 14:20
zend_cfg.o	131.81 KB	-rw-r--r--	2024-03-12 14:20
zend_dfg.c	8.25 KB	-rw-rw-r--	2022-10-31 11:36
zend_dfg.h	1.85 KB	-rw-rw-r--	2022-10-31 11:36
zend_dfg.lo	337 B	-rw-r--r--	2024-03-12 14:20
zend_dfg.o	90.51 KB	-rw-r--r--	2024-03-12 14:20
zend_dump.c	35.72 KB	-rw-rw-r--	2022-10-31 11:36
zend_dump.h	2.27 KB	-rw-rw-r--	2022-10-31 11:36
zend_dump.lo	340 B	-rw-r--r--	2024-03-12 14:21
zend_dump.o	182.13 KB	-rw-r--r--	2024-03-12 14:21
zend_func_info.c	113.3 KB	-rw-rw-r--	2022-10-31 11:36
zend_func_info.h	2.59 KB	-rw-rw-r--	2022-10-31 11:36
zend_func_info.lo	355 B	-rw-r--r--	2024-03-12 14:21
zend_func_info.o	202.44 KB	-rw-r--r--	2024-03-12 14:21
zend_inference.c	142.98 KB	-rw-rw-r--	2022-10-31 11:36
zend_inference.h	11.71 KB	-rw-rw-r--	2022-10-31 11:36
zend_inference.lo	355 B	-rw-r--r--	2024-03-12 14:20
zend_inference.o	994.6 KB	-rw-r--r--	2024-03-12 14:20
zend_optimizer.c	49.12 KB	-rw-rw-r--	2022-10-31 11:36
zend_optimizer.h	4.58 KB	-rw-rw-r--	2022-10-31 11:36
zend_optimizer.lo	355 B	-rw-r--r--	2024-03-12 14:20
zend_optimizer.o	227.7 KB	-rw-r--r--	2024-03-12 14:20
zend_optimizer_internal.h	6.36 KB	-rw-rw-r--	2022-10-31 11:36
zend_ssa.c	51.56 KB	-rw-rw-r--	2022-10-31 11:36
zend_ssa.h	11.23 KB	-rw-rw-r--	2022-10-31 11:36
zend_ssa.lo	337 B	-rw-r--r--	2024-03-12 14:20
zend_ssa.o	196.41 KB	-rw-r--r--	2024-03-12 14:20
zend_worklist.h	3.82 KB	-rw-rw-r--	2022-10-31 11:36

Rename

/*
   +----------------------------------------------------------------------+
   | Zend Engine, Call Graph                                              |
   +----------------------------------------------------------------------+
   | Copyright (c) The PHP Group                                          |
   +----------------------------------------------------------------------+
   | This source file is subject to version 3.01 of the PHP license,      |
   | that is bundled with this package in the file LICENSE, and is        |
   | available through the world-wide-web at the following url:           |
   | http://www.php.net/license/3_01.txt                                  |
   | If you did not receive a copy of the PHP license and are unable to   |
   | obtain it through the world-wide-web, please send a note to          |
   | license@php.net so we can mail you a copy immediately.               |
   +----------------------------------------------------------------------+
   | Authors: Dmitry Stogov <dmitry@php.net>                              |
   +----------------------------------------------------------------------+
*/

#include "php.h"
#include "zend_compile.h"
#include "zend_extensions.h"
#include "Optimizer/zend_optimizer.h"
#include "zend_optimizer_internal.h"
#include "zend_inference.h"
#include "zend_call_graph.h"
#include "zend_func_info.h"
#include "zend_inference.h"
#include "zend_call_graph.h"

typedef int (*zend_op_array_func_t)(zend_call_graph *call_graph, zend_op_array *op_array);

static int zend_op_array_calc(zend_call_graph *call_graph, zend_op_array *op_array)
{
	(void) op_array;

call_graph->op_arrays_count++;
	return SUCCESS;
}

static int zend_op_array_collect(zend_call_graph *call_graph, zend_op_array *op_array)
{
    zend_func_info *func_info = call_graph->func_infos + call_graph->op_arrays_count;

ZEND_SET_FUNC_INFO(op_array, func_info);
	call_graph->op_arrays[call_graph->op_arrays_count] = op_array;
	func_info->num = call_graph->op_arrays_count;
	func_info->num_args = -1;
	func_info->return_value_used = -1;
	call_graph->op_arrays_count++;
	return SUCCESS;
}

static int zend_foreach_op_array(zend_call_graph *call_graph, zend_script *script, zend_op_array_func_t func)
{
	zend_class_entry *ce;
	zend_string *key;
	zend_op_array *op_array;

if (func(call_graph, &script->main_op_array) != SUCCESS) {
		return FAILURE;
	}

ZEND_HASH_FOREACH_PTR(&script->function_table, op_array) {
		if (func(call_graph, op_array) != SUCCESS) {
			return FAILURE;
		}
	} ZEND_HASH_FOREACH_END();

ZEND_HASH_FOREACH_STR_KEY_PTR(&script->class_table, key, ce) {
		if (ce->refcount > 1 && !zend_string_equals_ci(key, ce->name)) {
			continue;
		}
		ZEND_HASH_FOREACH_PTR(&ce->function_table, op_array) {
			if (op_array->scope == ce
			 && op_array->type == ZEND_USER_FUNCTION
			 && !(op_array->fn_flags & ZEND_ACC_TRAIT_CLONE)) {
				if (func(call_graph, op_array) != SUCCESS) {
					return FAILURE;
				}
			}
		} ZEND_HASH_FOREACH_END();
	} ZEND_HASH_FOREACH_END();

return SUCCESS;
}

int zend_analyze_calls(zend_arena **arena, zend_script *script, uint32_t build_flags, zend_op_array *op_array, zend_func_info *func_info)
{
	zend_op *opline = op_array->opcodes;
	zend_op *end = opline + op_array->last;
	zend_function *func;
	zend_call_info *call_info;
	int call = 0;
	zend_call_info **call_stack;
	ALLOCA_FLAG(use_heap);

call_stack = do_alloca((op_array->last / 2) * sizeof(zend_call_info*), use_heap);
	call_info = NULL;
	while (opline != end) {
		switch (opline->opcode) {
			case ZEND_INIT_FCALL:
			case ZEND_INIT_METHOD_CALL:
			case ZEND_INIT_STATIC_METHOD_CALL:
				call_stack[call] = call_info;
				func = zend_optimizer_get_called_func(
					script, op_array, opline, (build_flags & ZEND_RT_CONSTANTS) != 0);
				if (func) {
					call_info = zend_arena_calloc(arena, 1, sizeof(zend_call_info) + (sizeof(zend_send_arg_info) * ((int)opline->extended_value - 1)));
					call_info->caller_op_array = op_array;
					call_info->caller_init_opline = opline;
					call_info->caller_call_opline = NULL;
					call_info->callee_func = func;
					call_info->num_args = opline->extended_value;
					call_info->next_callee = func_info->callee_info;
					func_info->callee_info = call_info;

if (build_flags & ZEND_CALL_TREE) {
						call_info->next_caller = NULL;
					} else if (func->type == ZEND_INTERNAL_FUNCTION) {
						call_info->next_caller = NULL;
					} else {
						zend_func_info *callee_func_info = ZEND_FUNC_INFO(&func->op_array);
						if (callee_func_info) {
							call_info->next_caller = callee_func_info->caller_info;
							callee_func_info->caller_info = call_info;
						} else {
							call_info->next_caller = NULL;
						}
					}
				} else {
					call_info = NULL;
				}
				call++;
				break;
			case ZEND_INIT_FCALL_BY_NAME:
			case ZEND_INIT_NS_FCALL_BY_NAME:
			case ZEND_INIT_DYNAMIC_CALL:
			case ZEND_NEW:
			case ZEND_INIT_USER_CALL:
				call_stack[call] = call_info;
				call_info = NULL;
				call++;
				break;
			case ZEND_DO_FCALL:
			case ZEND_DO_ICALL:
			case ZEND_DO_UCALL:
			case ZEND_DO_FCALL_BY_NAME:
				func_info->flags |= ZEND_FUNC_HAS_CALLS;
				if (call_info) {
					call_info->caller_call_opline = opline;
				}
				call--;
				call_info = call_stack[call];
				break;
			case ZEND_SEND_VAL:
			case ZEND_SEND_VAR:
			case ZEND_SEND_VAL_EX:
			case ZEND_SEND_VAR_EX:
			case ZEND_SEND_FUNC_ARG:
			case ZEND_SEND_REF:
			case ZEND_SEND_VAR_NO_REF:
			case ZEND_SEND_VAR_NO_REF_EX:
			case ZEND_SEND_USER:
				if (call_info) {
					uint32_t num = opline->op2.num;

if (num > 0) {
						num--;
					}
					call_info->arg_info[num].opline = opline;
				}
				break;
			case ZEND_SEND_ARRAY:
			case ZEND_SEND_UNPACK:
				/* TODO: set info about var_arg call ??? */
				if (call_info) {
					call_info->num_args = -1;
				}
				break;
			case ZEND_EXIT:
				/* In this case the DO_CALL opcode may have been dropped
				 * and caller_call_opline will be NULL. */
				break;
		}
		opline++;
	}
	free_alloca(call_stack, use_heap);
	return SUCCESS;
}

static int zend_is_indirectly_recursive(zend_op_array *root, zend_op_array *op_array, zend_bitset visited)
{
	zend_func_info *func_info;
	zend_call_info *call_info;
	int ret = 0;

if (op_array == root) {
		return 1;
	}

func_info = ZEND_FUNC_INFO(op_array);
	if (zend_bitset_in(visited, func_info->num)) {
		return 0;
	}
	zend_bitset_incl(visited, func_info->num);
	call_info = func_info->caller_info;
	while (call_info) {
		if (zend_is_indirectly_recursive(root, call_info->caller_op_array, visited)) {
			call_info->recursive = 1;
			ret = 1;
		}
		call_info = call_info->next_caller;
	}
	return ret;
}

static void zend_analyze_recursion(zend_call_graph *call_graph)
{
	zend_op_array *op_array;
	zend_func_info *func_info;
	zend_call_info *call_info;
	int i;
	int set_len = zend_bitset_len(call_graph->op_arrays_count);
	zend_bitset visited;
	ALLOCA_FLAG(use_heap);

visited = ZEND_BITSET_ALLOCA(set_len, use_heap);
	for (i = 0; i < call_graph->op_arrays_count; i++) {
		op_array = call_graph->op_arrays[i];
		func_info = call_graph->func_infos + i;
		call_info = func_info->caller_info;
		while (call_info) {
			if (call_info->caller_op_array == op_array) {
				call_info->recursive = 1;
				func_info->flags |= ZEND_FUNC_RECURSIVE | ZEND_FUNC_RECURSIVE_DIRECTLY;
			} else {
				memset(visited, 0, sizeof(zend_ulong) * set_len);
				if (zend_is_indirectly_recursive(op_array, call_info->caller_op_array, visited)) {
					call_info->recursive = 1;
					func_info->flags |= ZEND_FUNC_RECURSIVE | ZEND_FUNC_RECURSIVE_INDIRECTLY;
				}
			}
			call_info = call_info->next_caller;
		}
	}

free_alloca(visited, use_heap);
}

static void zend_sort_op_arrays(zend_call_graph *call_graph)
{
	(void) call_graph;

// TODO: perform topological sort of cyclic call graph
}

int zend_build_call_graph(zend_arena **arena, zend_script *script, uint32_t build_flags, zend_call_graph *call_graph) /* {{{ */
{
	int i;

call_graph->op_arrays_count = 0;
	if (zend_foreach_op_array(call_graph, script, zend_op_array_calc) != SUCCESS) {
		return FAILURE;
	}
	call_graph->op_arrays = (zend_op_array**)zend_arena_calloc(arena, call_graph->op_arrays_count, sizeof(zend_op_array*));
	call_graph->func_infos = (zend_func_info*)zend_arena_calloc(arena, call_graph->op_arrays_count, sizeof(zend_func_info));
	call_graph->op_arrays_count = 0;
	if (zend_foreach_op_array(call_graph, script, zend_op_array_collect) != SUCCESS) {
		return FAILURE;
	}
	for (i = 0; i < call_graph->op_arrays_count; i++) {
		zend_analyze_calls(arena, script, build_flags, call_graph->op_arrays[i], call_graph->func_infos + i);
	}
	zend_analyze_recursion(call_graph);
	zend_sort_op_arrays(call_graph);

return SUCCESS;
}
/* }}} */

zend_call_info **zend_build_call_map(zend_arena **arena, zend_func_info *info, zend_op_array *op_array) /* {{{ */
{
	zend_call_info **map, *call;
	if (!info->callee_info) {
		/* Don't build call map if function contains no calls */
		return NULL;
	}

map = zend_arena_calloc(arena, sizeof(zend_call_info *), op_array->last);
	for (call = info->callee_info; call; call = call->next_callee) {
		int i;
		map[call->caller_init_opline - op_array->opcodes] = call;
		if (call->caller_call_opline) {
			map[call->caller_call_opline - op_array->opcodes] = call;
		}
		for (i = 0; i < call->num_args; i++) {
			if (call->arg_info[i].opline) {
				map[call->arg_info[i].opline - op_array->opcodes] = call;
			}
		}
	}
	return map;
}
/* }}} */