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, e-SSA based Type & Range Inference                      |
   +----------------------------------------------------------------------+
   | 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>                              |
   +----------------------------------------------------------------------+
*/

#ifndef ZEND_INFERENCE_H
#define ZEND_INFERENCE_H

#include "zend_optimizer.h"
#include "zend_ssa.h"
#include "zend_bitset.h"

/* Bitmask for type inference (zend_ssa_var_info.type) */
#include "zend_type_info.h"

#define MAY_BE_IN_REG               (1<<25) /* value allocated in CPU register */

//TODO: remome MAY_BE_RC1, MAY_BE_RCN???
#define MAY_BE_RC1                  (1<<27) /* may be non-reference with refcount == 1 */
#define MAY_BE_RCN                  (1<<28) /* may be non-reference with refcount > 1  */

#define MAY_HAVE_DTOR \
	(MAY_BE_OBJECT|MAY_BE_RESOURCE \
	|MAY_BE_ARRAY_OF_ARRAY|MAY_BE_ARRAY_OF_OBJECT|MAY_BE_ARRAY_OF_RESOURCE)

#define DEFINE_SSA_OP_HAS_RANGE(opN) \
	static zend_always_inline zend_bool _ssa_##opN##_has_range(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		if (opline->opN##_type == IS_CONST) { \
			zval *zv = CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants); \
			return (Z_TYPE_P(zv) == IS_LONG || Z_TYPE_P(zv) == IS_TRUE || Z_TYPE_P(zv) == IS_FALSE || Z_TYPE_P(zv) == IS_NULL); \
		} else { \
			return (opline->opN##_type != IS_UNUSED && \
		        ssa->ops && \
		        ssa->var_info && \
		        ssa->ops[opline - op_array->opcodes].opN##_use >= 0 && \
			    ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].has_range); \
		} \
		return 0; \
	}

#define DEFINE_SSA_OP_MIN_RANGE(opN) \
	static zend_always_inline zend_long _ssa_##opN##_min_range(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		if (opline->opN##_type == IS_CONST) { \
			zval *zv = CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants); \
			if (Z_TYPE_P(zv) == IS_LONG) { \
				return Z_LVAL_P(zv); \
			} else if (Z_TYPE_P(zv) == IS_TRUE) { \
				return 1; \
			} else if (Z_TYPE_P(zv) == IS_FALSE) { \
				return 0; \
			} else if (Z_TYPE_P(zv) == IS_NULL) { \
				return 0; \
			} \
		} else if (opline->opN##_type != IS_UNUSED && \
		    ssa->ops && \
		    ssa->var_info && \
		    ssa->ops[opline - op_array->opcodes].opN##_use >= 0 && \
		    ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].has_range) { \
			return ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].range.min; \
		} \
		return ZEND_LONG_MIN; \
	}

#define DEFINE_SSA_OP_MAX_RANGE(opN) \
	static zend_always_inline zend_long _ssa_##opN##_max_range(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		if (opline->opN##_type == IS_CONST) { \
			zval *zv = CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants); \
			if (Z_TYPE_P(zv) == IS_LONG) { \
				return Z_LVAL_P(zv); \
			} else if (Z_TYPE_P(zv) == IS_TRUE) { \
				return 1; \
			} else if (Z_TYPE_P(zv) == IS_FALSE) { \
				return 0; \
			} else if (Z_TYPE_P(zv) == IS_NULL) { \
				return 0; \
			} \
		} else if (opline->opN##_type != IS_UNUSED && \
		    ssa->ops && \
		    ssa->var_info && \
		    ssa->ops[opline - op_array->opcodes].opN##_use >= 0 && \
		    ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].has_range) { \
			return ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].range.max; \
		} \
		return ZEND_LONG_MAX; \
	}

#define DEFINE_SSA_OP_RANGE_UNDERFLOW(opN) \
	static zend_always_inline char _ssa_##opN##_range_underflow(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		if (opline->opN##_type == IS_CONST) { \
			zval *zv = CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants); \
			if (Z_TYPE_P(zv) == IS_LONG || Z_TYPE_P(zv) == IS_TRUE || Z_TYPE_P(zv) == IS_FALSE || Z_TYPE_P(zv) == IS_NULL) { \
				return 0; \
			} \
		} else if (opline->opN##_type != IS_UNUSED && \
		    ssa->ops && \
		    ssa->var_info && \
		    ssa->ops[opline - op_array->opcodes].opN##_use >= 0 && \
		    ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].has_range) { \
			return ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].range.underflow; \
		} \
		return 1; \
	}

#define DEFINE_SSA_OP_RANGE_OVERFLOW(opN) \
	static zend_always_inline char _ssa_##opN##_range_overflow(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		if (opline->opN##_type == IS_CONST) { \
			zval *zv = CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants); \
			if (Z_TYPE_P(zv) == IS_LONG || Z_TYPE_P(zv) == IS_TRUE || Z_TYPE_P(zv) == IS_FALSE || Z_TYPE_P(zv) == IS_NULL) { \
				return 0; \
			} \
		} else if (opline->opN##_type != IS_UNUSED && \
		    ssa->ops && \
		    ssa->var_info && \
		    ssa->ops[opline - op_array->opcodes].opN##_use >= 0 && \
		    ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].has_range) { \
			return ssa->var_info[ssa->ops[opline - op_array->opcodes].opN##_use].range.overflow; \
		} \
		return 1; \
	}

DEFINE_SSA_OP_HAS_RANGE(op1)
DEFINE_SSA_OP_MIN_RANGE(op1)
DEFINE_SSA_OP_MAX_RANGE(op1)
DEFINE_SSA_OP_RANGE_UNDERFLOW(op1)
DEFINE_SSA_OP_RANGE_OVERFLOW(op1)
DEFINE_SSA_OP_HAS_RANGE(op2)
DEFINE_SSA_OP_MIN_RANGE(op2)
DEFINE_SSA_OP_MAX_RANGE(op2)
DEFINE_SSA_OP_RANGE_UNDERFLOW(op2)
DEFINE_SSA_OP_RANGE_OVERFLOW(op2)

#define OP1_HAS_RANGE()         (_ssa_op1_has_range (op_array, ssa, opline))
#define OP1_MIN_RANGE()         (_ssa_op1_min_range (op_array, ssa, opline))
#define OP1_MAX_RANGE()         (_ssa_op1_max_range (op_array, ssa, opline))
#define OP1_RANGE_UNDERFLOW()   (_ssa_op1_range_underflow (op_array, ssa, opline))
#define OP1_RANGE_OVERFLOW()    (_ssa_op1_range_overflow (op_array, ssa, opline))
#define OP2_HAS_RANGE()         (_ssa_op2_has_range (op_array, ssa, opline))
#define OP2_MIN_RANGE()         (_ssa_op2_min_range (op_array, ssa, opline))
#define OP2_MAX_RANGE()         (_ssa_op2_max_range (op_array, ssa, opline))
#define OP2_RANGE_UNDERFLOW()   (_ssa_op2_range_underflow (op_array, ssa, opline))
#define OP2_RANGE_OVERFLOW()    (_ssa_op2_range_overflow (op_array, ssa, opline))

static zend_always_inline uint32_t _const_op_type(const zval *zv) {
	if (Z_TYPE_P(zv) == IS_CONSTANT_AST) {
		return MAY_BE_RC1 | MAY_BE_RCN | MAY_BE_ANY | MAY_BE_ARRAY_KEY_ANY | MAY_BE_ARRAY_OF_ANY;
	} else if (Z_TYPE_P(zv) == IS_ARRAY) {
		HashTable *ht = Z_ARRVAL_P(zv);
		uint32_t tmp = MAY_BE_ARRAY;
		zend_string *str;
		zval *val;

if (Z_REFCOUNTED_P(zv)) {
			tmp |= MAY_BE_RC1 | MAY_BE_RCN;
		} else {
			tmp |= MAY_BE_RCN;
		}

ZEND_HASH_FOREACH_STR_KEY_VAL(ht, str, val) {
			if (str) {
				tmp |= MAY_BE_ARRAY_KEY_STRING;
			} else {
				tmp |= MAY_BE_ARRAY_KEY_LONG;
			}
			tmp |= 1 << (Z_TYPE_P(val) + MAY_BE_ARRAY_SHIFT);
		} ZEND_HASH_FOREACH_END();
		return tmp;
	} else {
		uint32_t tmp = (1 << Z_TYPE_P(zv));

if (Z_REFCOUNTED_P(zv)) {
			tmp |= MAY_BE_RC1 | MAY_BE_RCN;
		} else if (Z_TYPE_P(zv) == IS_STRING) {
			tmp |= MAY_BE_RCN;
		}
		return tmp;
	}
}

static zend_always_inline uint32_t get_ssa_var_info(const zend_ssa *ssa, int ssa_var_num)
{
	if (ssa->var_info && ssa_var_num >= 0) {
		return ssa->var_info[ssa_var_num].type;
	} else {
		return MAY_BE_UNDEF | MAY_BE_RC1 | MAY_BE_RCN | MAY_BE_REF | MAY_BE_ANY | MAY_BE_ARRAY_KEY_ANY | MAY_BE_ARRAY_OF_ANY | MAY_BE_ARRAY_OF_REF | MAY_BE_ERROR;
	}
}

#define DEFINE_SSA_OP_INFO(opN) \
	static zend_always_inline uint32_t _ssa_##opN##_info(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{																		\
		if (opline->opN##_type == IS_CONST) {							\
			return _const_op_type(CRT_CONSTANT_EX(op_array, opline, opline->opN, ssa->rt_constants)); \
		} else { \
			return get_ssa_var_info(ssa, ssa->ops ? ssa->ops[opline - op_array->opcodes].opN##_use : -1); \
		} \
	}

#define DEFINE_SSA_OP_DEF_INFO(opN) \
	static zend_always_inline uint32_t _ssa_##opN##_def_info(const zend_op_array *op_array, const zend_ssa *ssa, const zend_op *opline) \
	{ \
		return get_ssa_var_info(ssa, ssa->ops ? ssa->ops[opline - op_array->opcodes].opN##_def : -1); \
	}

DEFINE_SSA_OP_INFO(op1)
DEFINE_SSA_OP_INFO(op2)
DEFINE_SSA_OP_INFO(result)
DEFINE_SSA_OP_DEF_INFO(op1)
DEFINE_SSA_OP_DEF_INFO(op2)
DEFINE_SSA_OP_DEF_INFO(result)

#define OP1_INFO()              (_ssa_op1_info(op_array, ssa, opline))
#define OP2_INFO()              (_ssa_op2_info(op_array, ssa, opline))
#define OP1_DATA_INFO()         (_ssa_op1_info(op_array, ssa, (opline+1)))
#define OP2_DATA_INFO()         (_ssa_op2_info(op_array, ssa, (opline+1)))
#define RES_USE_INFO()          (_ssa_result_info(op_array, ssa, opline))
#define OP1_DEF_INFO()          (_ssa_op1_def_info(op_array, ssa, opline))
#define OP2_DEF_INFO()          (_ssa_op2_def_info(op_array, ssa, opline))
#define OP1_DATA_DEF_INFO()     (_ssa_op1_def_info(op_array, ssa, (opline+1)))
#define OP2_DATA_DEF_INFO()     (_ssa_op2_def_info(op_array, ssa, (opline+1)))
#define RES_INFO()              (_ssa_result_def_info(op_array, ssa, opline))

static zend_always_inline zend_bool zend_add_will_overflow(zend_long a, zend_long b) {
	return (b > 0 && a > ZEND_LONG_MAX - b)
		|| (b < 0 && a < ZEND_LONG_MIN - b);
}
static zend_always_inline zend_bool zend_sub_will_overflow(zend_long a, zend_long b) {
	return (b > 0 && a < ZEND_LONG_MIN + b)
		|| (b < 0 && a > ZEND_LONG_MAX + b);
}

BEGIN_EXTERN_C()

int zend_ssa_find_false_dependencies(const zend_op_array *op_array, zend_ssa *ssa);
int zend_ssa_find_sccs(const zend_op_array *op_array, zend_ssa *ssa);
int zend_ssa_inference(zend_arena **raena, const zend_op_array *op_array, const zend_script *script, zend_ssa *ssa, zend_long optimization_level);

uint32_t zend_array_element_type(uint32_t t1, int write, int insert);

int  zend_inference_calc_range(const zend_op_array *op_array, zend_ssa *ssa, int var, int widening, int narrowing, zend_ssa_range *tmp);
void zend_inference_init_range(const zend_op_array *op_array, zend_ssa *ssa, int var, zend_bool underflow, zend_long min, zend_long max, zend_bool overflow);
int  zend_inference_narrowing_meet(zend_ssa_var_info *var_info, zend_ssa_range *r);
int  zend_inference_widening_meet(zend_ssa_var_info *var_info, zend_ssa_range *r);
void zend_inference_check_recursive_dependencies(zend_op_array *op_array);

int  zend_infer_types_ex(const zend_op_array *op_array, const zend_script *script, zend_ssa *ssa, zend_bitset worklist, zend_long optimization_level);

void zend_init_func_return_info(const zend_op_array   *op_array,
                                const zend_script     *script,
                                zend_ssa_var_info     *ret);
void zend_func_return_info(const zend_op_array   *op_array,
                           const zend_script     *script,
                           int                    recursive,
                           int                    widening,
                           zend_ssa_var_info     *ret);

int zend_may_throw(const zend_op *opline, zend_op_array *op_array, zend_ssa *ssa);

END_EXTERN_C()

#endif /* ZEND_INFERENCE_H */