php内核数组count分析

下面是count的内核实现源码，理解比较签，希望互相学习

/* {{{ proto int count(mixed var [, int mode])

   Count the number of elements in a variable (usually an array) */
PHP_FUNCTION(count)  //定义函数名

{

zval *array;
long mode = COUNT_NORMAL;   //统计模式 1：递归，0：非递归


if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "z|l", &array, &mode) == FAILURE) { //传入的参数判断
return;
}


switch (Z_TYPE_P(array)) { 变量array进行类型判断
case IS_NULL:  //空：直接返回0长度
RETURN_LONG(0);
break;
case IS_ARRAY:  //分析数组
RETURN_LONG (php_count_recursive (array, mode TSRMLS_CC));
break;
case IS_OBJECT: { //分析对象
#ifdef HAVE_SPL
zval *retval;
#endif
/* first, we check if the handler is defined */
if (Z_OBJ_HT_P(array)->count_elements) {
RETVAL_LONG(1);
if (SUCCESS == Z_OBJ_HT(*array)->count_elements(array, &Z_LVAL_P(return_value) TSRMLS_CC)) { //统计元素个数
return;
}
}
#ifdef HAVE_SPL
/* if not and the object implements Countable we call its count() method */
if (Z_OBJ_HT_P(array)->get_class_entry && instanceof_function(Z_OBJCE_P(array), spl_ce_Countable TSRMLS_CC)) {
zend_call_method_with_0_params(&array, NULL, NULL, "count", &retval);
if (retval) {
convert_to_long_ex(&retval);
RETVAL_LONG(Z_LVAL_P(retval));
zval_ptr_dtor(&retval);
}
return;
}
#endif
}
default:
RETURN_LONG(1);
break;
}

}

//递归类计个数

PHPAPI int php_count_recursive(zval *array, long mode TSRMLS_DC) /* {{{ */
{
long cnt = 0;
zval **element;


if (Z_TYPE_P(array) == IS_ARRAY) {
if (Z_ARRVAL_P(array)->nApplyCount > 1) {  //标量：正在递归的数组不充许重复递归
php_error_docref(NULL TSRMLS_CC, E_WARNING, "recursion detected");
return 0;
}


cnt = zend_hash_num_elements(Z_ARRVAL_P(array)); //统计元素个数
if (mode == COUNT_RECURSIVE) { //设置递归统计
HashPosition pos;


for (zend_hash_internal_pointer_reset_ex(Z_ARRVAL_P(array), &pos);
zend_hash_get_current_data_ex(Z_ARRVAL_P(array), (void **) &element, &pos) == SUCCESS;
zend_hash_move_forward_ex(Z_ARRVAL_P(array), &pos)
) {
Z_ARRVAL_P(array)->nApplyCount++;
cnt += php_count_recursive(*element, COUNT_RECURSIVE TSRMLS_CC); //递归计数
Z_ARRVAL_P(array)->nApplyCount--;
}
}
}


return cnt;
}