mirror of
https://github.com/php/php-src.git
synced 2024-12-17 05:50:14 +08:00
3810 lines
122 KiB
C
3810 lines
122 KiB
C
/*
|
|
+----------------------------------------------------------------------+
|
|
| PHP Version 7 |
|
|
+----------------------------------------------------------------------+
|
|
| Copyright (c) 1997-2017 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: Marcus Boerger <helly@php.net> |
|
|
+----------------------------------------------------------------------+
|
|
*/
|
|
|
|
/* $Id$ */
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
|
|
#include "php.h"
|
|
#include "php_ini.h"
|
|
#include "ext/standard/info.h"
|
|
#include "zend_exceptions.h"
|
|
#include "zend_interfaces.h"
|
|
|
|
#include "php_spl.h"
|
|
#include "spl_functions.h"
|
|
#include "spl_engine.h"
|
|
#include "spl_iterators.h"
|
|
#include "spl_directory.h"
|
|
#include "spl_array.h"
|
|
#include "spl_exceptions.h"
|
|
#include "zend_smart_str.h"
|
|
|
|
#ifdef accept
|
|
#undef accept
|
|
#endif
|
|
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveIteratorIterator;
|
|
PHPAPI zend_class_entry *spl_ce_FilterIterator;
|
|
PHPAPI zend_class_entry *spl_ce_CallbackFilterIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveFilterIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveCallbackFilterIterator;
|
|
PHPAPI zend_class_entry *spl_ce_ParentIterator;
|
|
PHPAPI zend_class_entry *spl_ce_SeekableIterator;
|
|
PHPAPI zend_class_entry *spl_ce_LimitIterator;
|
|
PHPAPI zend_class_entry *spl_ce_CachingIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveCachingIterator;
|
|
PHPAPI zend_class_entry *spl_ce_OuterIterator;
|
|
PHPAPI zend_class_entry *spl_ce_IteratorIterator;
|
|
PHPAPI zend_class_entry *spl_ce_NoRewindIterator;
|
|
PHPAPI zend_class_entry *spl_ce_InfiniteIterator;
|
|
PHPAPI zend_class_entry *spl_ce_EmptyIterator;
|
|
PHPAPI zend_class_entry *spl_ce_AppendIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RegexIterator;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveRegexIterator;
|
|
PHPAPI zend_class_entry *spl_ce_Countable;
|
|
PHPAPI zend_class_entry *spl_ce_RecursiveTreeIterator;
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_recursive_it_void, 0)
|
|
ZEND_END_ARG_INFO()
|
|
|
|
const zend_function_entry spl_funcs_RecursiveIterator[] = {
|
|
SPL_ABSTRACT_ME(RecursiveIterator, hasChildren, arginfo_recursive_it_void)
|
|
SPL_ABSTRACT_ME(RecursiveIterator, getChildren, arginfo_recursive_it_void)
|
|
PHP_FE_END
|
|
};
|
|
|
|
typedef enum {
|
|
RIT_LEAVES_ONLY = 0,
|
|
RIT_SELF_FIRST = 1,
|
|
RIT_CHILD_FIRST = 2
|
|
} RecursiveIteratorMode;
|
|
|
|
#define RIT_CATCH_GET_CHILD CIT_CATCH_GET_CHILD
|
|
|
|
typedef enum {
|
|
RTIT_BYPASS_CURRENT = 4,
|
|
RTIT_BYPASS_KEY = 8
|
|
} RecursiveTreeIteratorFlags;
|
|
|
|
typedef enum {
|
|
RS_NEXT = 0,
|
|
RS_TEST = 1,
|
|
RS_SELF = 2,
|
|
RS_CHILD = 3,
|
|
RS_START = 4
|
|
} RecursiveIteratorState;
|
|
|
|
typedef struct _spl_sub_iterator {
|
|
zend_object_iterator *iterator;
|
|
zval zobject;
|
|
zend_class_entry *ce;
|
|
RecursiveIteratorState state;
|
|
} spl_sub_iterator;
|
|
|
|
typedef struct _spl_recursive_it_object {
|
|
spl_sub_iterator *iterators;
|
|
int level;
|
|
RecursiveIteratorMode mode;
|
|
int flags;
|
|
int max_depth;
|
|
zend_bool in_iteration;
|
|
zend_function *beginIteration;
|
|
zend_function *endIteration;
|
|
zend_function *callHasChildren;
|
|
zend_function *callGetChildren;
|
|
zend_function *beginChildren;
|
|
zend_function *endChildren;
|
|
zend_function *nextElement;
|
|
zend_class_entry *ce;
|
|
smart_str prefix[6];
|
|
smart_str postfix[1];
|
|
zend_object std;
|
|
} spl_recursive_it_object;
|
|
|
|
typedef struct _spl_recursive_it_iterator {
|
|
zend_object_iterator intern;
|
|
} spl_recursive_it_iterator;
|
|
|
|
static zend_object_handlers spl_handlers_rec_it_it;
|
|
static zend_object_handlers spl_handlers_dual_it;
|
|
|
|
static inline spl_recursive_it_object *spl_recursive_it_from_obj(zend_object *obj) /* {{{ */ {
|
|
return (spl_recursive_it_object*)((char*)(obj) - XtOffsetOf(spl_recursive_it_object, std));
|
|
}
|
|
/* }}} */
|
|
|
|
#define Z_SPLRECURSIVE_IT_P(zv) spl_recursive_it_from_obj(Z_OBJ_P((zv)))
|
|
|
|
#define SPL_FETCH_AND_CHECK_DUAL_IT(var, objzval) \
|
|
do { \
|
|
spl_dual_it_object *it = Z_SPLDUAL_IT_P(objzval); \
|
|
if (it->dit_type == DIT_Unknown) { \
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0, \
|
|
"The object is in an invalid state as the parent constructor was not called"); \
|
|
return; \
|
|
} \
|
|
(var) = it; \
|
|
} while (0)
|
|
|
|
#define SPL_FETCH_SUB_ELEMENT(var, object, element) \
|
|
do { \
|
|
if(!(object)->iterators) { \
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0, \
|
|
"The object is in an invalid state as the parent constructor was not called"); \
|
|
return; \
|
|
} \
|
|
(var) = (object)->iterators[(object)->level].element; \
|
|
} while (0)
|
|
|
|
#define SPL_FETCH_SUB_ELEMENT_ADDR(var, object, element) \
|
|
do { \
|
|
if(!(object)->iterators) { \
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0, \
|
|
"The object is in an invalid state as the parent constructor was not called"); \
|
|
return; \
|
|
} \
|
|
(var) = &(object)->iterators[(object)->level].element; \
|
|
} while (0)
|
|
|
|
#define SPL_FETCH_SUB_ITERATOR(var, object) SPL_FETCH_SUB_ELEMENT(var, object, iterator)
|
|
|
|
|
|
static void spl_recursive_it_dtor(zend_object_iterator *_iter)
|
|
{
|
|
spl_recursive_it_iterator *iter = (spl_recursive_it_iterator*)_iter;
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(&iter->intern.data);
|
|
zend_object_iterator *sub_iter;
|
|
|
|
while (object->level > 0) {
|
|
if (!Z_ISUNDEF(object->iterators[object->level].zobject)) {
|
|
sub_iter = object->iterators[object->level].iterator;
|
|
zend_iterator_dtor(sub_iter);
|
|
zval_ptr_dtor(&object->iterators[object->level].zobject);
|
|
}
|
|
object->level--;
|
|
}
|
|
object->iterators = erealloc(object->iterators, sizeof(spl_sub_iterator));
|
|
object->level = 0;
|
|
|
|
zval_ptr_dtor(&iter->intern.data);
|
|
}
|
|
|
|
static int spl_recursive_it_valid_ex(spl_recursive_it_object *object, zval *zthis)
|
|
{
|
|
zend_object_iterator *sub_iter;
|
|
int level = object->level;
|
|
|
|
if(!object->iterators) {
|
|
return FAILURE;
|
|
}
|
|
while (level >=0) {
|
|
sub_iter = object->iterators[level].iterator;
|
|
if (sub_iter->funcs->valid(sub_iter) == SUCCESS) {
|
|
return SUCCESS;
|
|
}
|
|
level--;
|
|
}
|
|
if (object->endIteration && object->in_iteration) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->endIteration, "endIteration", NULL);
|
|
}
|
|
object->in_iteration = 0;
|
|
return FAILURE;
|
|
}
|
|
|
|
static int spl_recursive_it_valid(zend_object_iterator *iter)
|
|
{
|
|
return spl_recursive_it_valid_ex(Z_SPLRECURSIVE_IT_P(&iter->data), &iter->data);
|
|
}
|
|
|
|
static zval *spl_recursive_it_get_current_data(zend_object_iterator *iter)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(&iter->data);
|
|
zend_object_iterator *sub_iter = object->iterators[object->level].iterator;
|
|
|
|
return sub_iter->funcs->get_current_data(sub_iter);
|
|
}
|
|
|
|
static void spl_recursive_it_get_current_key(zend_object_iterator *iter, zval *key)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(&iter->data);
|
|
zend_object_iterator *sub_iter = object->iterators[object->level].iterator;
|
|
|
|
if (sub_iter->funcs->get_current_key) {
|
|
sub_iter->funcs->get_current_key(sub_iter, key);
|
|
} else {
|
|
ZVAL_LONG(key, iter->index);
|
|
}
|
|
}
|
|
|
|
static void spl_recursive_it_move_forward_ex(spl_recursive_it_object *object, zval *zthis)
|
|
{
|
|
zend_object_iterator *iterator;
|
|
zval *zobject;
|
|
zend_class_entry *ce;
|
|
zval retval, child;
|
|
zend_object_iterator *sub_iter;
|
|
int has_children;
|
|
|
|
SPL_FETCH_SUB_ITERATOR(iterator, object);
|
|
|
|
while (!EG(exception)) {
|
|
next_step:
|
|
iterator = object->iterators[object->level].iterator;
|
|
switch (object->iterators[object->level].state) {
|
|
case RS_NEXT:
|
|
iterator->funcs->move_forward(iterator);
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
}
|
|
}
|
|
/* fall through */
|
|
case RS_START:
|
|
if (iterator->funcs->valid(iterator) == FAILURE) {
|
|
break;
|
|
}
|
|
object->iterators[object->level].state = RS_TEST;
|
|
/* break; */
|
|
case RS_TEST:
|
|
ce = object->iterators[object->level].ce;
|
|
zobject = &object->iterators[object->level].zobject;
|
|
if (object->callHasChildren) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->callHasChildren, "callHasChildren", &retval);
|
|
} else {
|
|
zend_call_method_with_0_params(zobject, ce, NULL, "haschildren", &retval);
|
|
}
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
}
|
|
}
|
|
if (Z_TYPE(retval) != IS_UNDEF) {
|
|
has_children = zend_is_true(&retval);
|
|
zval_ptr_dtor(&retval);
|
|
if (has_children) {
|
|
if (object->max_depth == -1 || object->max_depth > object->level) {
|
|
switch (object->mode) {
|
|
case RIT_LEAVES_ONLY:
|
|
case RIT_CHILD_FIRST:
|
|
object->iterators[object->level].state = RS_CHILD;
|
|
goto next_step;
|
|
case RIT_SELF_FIRST:
|
|
object->iterators[object->level].state = RS_SELF;
|
|
goto next_step;
|
|
}
|
|
} else {
|
|
/* do not recurse into */
|
|
if (object->mode == RIT_LEAVES_ONLY) {
|
|
/* this is not a leave, so skip it */
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
goto next_step;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (object->nextElement) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->nextElement, "nextelement", NULL);
|
|
}
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
}
|
|
}
|
|
return /* self */;
|
|
case RS_SELF:
|
|
if (object->nextElement && (object->mode == RIT_SELF_FIRST || object->mode == RIT_CHILD_FIRST)) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->nextElement, "nextelement", NULL);
|
|
}
|
|
if (object->mode == RIT_SELF_FIRST) {
|
|
object->iterators[object->level].state = RS_CHILD;
|
|
} else {
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
}
|
|
return /* self */;
|
|
case RS_CHILD:
|
|
ce = object->iterators[object->level].ce;
|
|
zobject = &object->iterators[object->level].zobject;
|
|
if (object->callGetChildren) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->callGetChildren, "callGetChildren", &child);
|
|
} else {
|
|
zend_call_method_with_0_params(zobject, ce, NULL, "getchildren", &child);
|
|
}
|
|
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
zval_ptr_dtor(&child);
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
goto next_step;
|
|
}
|
|
}
|
|
|
|
if (Z_TYPE(child) == IS_UNDEF || Z_TYPE(child) != IS_OBJECT ||
|
|
!((ce = Z_OBJCE(child)) && instanceof_function(ce, spl_ce_RecursiveIterator))) {
|
|
zval_ptr_dtor(&child);
|
|
zend_throw_exception(spl_ce_UnexpectedValueException, "Objects returned by RecursiveIterator::getChildren() must implement RecursiveIterator", 0);
|
|
return;
|
|
}
|
|
|
|
if (object->mode == RIT_CHILD_FIRST) {
|
|
object->iterators[object->level].state = RS_SELF;
|
|
} else {
|
|
object->iterators[object->level].state = RS_NEXT;
|
|
}
|
|
object->iterators = erealloc(object->iterators, sizeof(spl_sub_iterator) * (++object->level+1));
|
|
sub_iter = ce->get_iterator(ce, &child, 0);
|
|
ZVAL_COPY_VALUE(&object->iterators[object->level].zobject, &child);
|
|
object->iterators[object->level].iterator = sub_iter;
|
|
object->iterators[object->level].ce = ce;
|
|
object->iterators[object->level].state = RS_START;
|
|
if (sub_iter->funcs->rewind) {
|
|
sub_iter->funcs->rewind(sub_iter);
|
|
}
|
|
if (object->beginChildren) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->beginChildren, "beginchildren", NULL);
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
}
|
|
}
|
|
}
|
|
goto next_step;
|
|
}
|
|
/* no more elements */
|
|
if (object->level > 0) {
|
|
if (object->endChildren) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->endChildren, "endchildren", NULL);
|
|
if (EG(exception)) {
|
|
if (!(object->flags & RIT_CATCH_GET_CHILD)) {
|
|
return;
|
|
} else {
|
|
zend_clear_exception();
|
|
}
|
|
}
|
|
}
|
|
if (object->level > 0) {
|
|
zval garbage;
|
|
ZVAL_COPY_VALUE(&garbage, &object->iterators[object->level].zobject);
|
|
ZVAL_UNDEF(&object->iterators[object->level].zobject);
|
|
zval_ptr_dtor(&garbage);
|
|
zend_iterator_dtor(iterator);
|
|
object->level--;
|
|
}
|
|
} else {
|
|
return; /* done completeley */
|
|
}
|
|
}
|
|
}
|
|
|
|
static void spl_recursive_it_rewind_ex(spl_recursive_it_object *object, zval *zthis)
|
|
{
|
|
zend_object_iterator *sub_iter;
|
|
|
|
SPL_FETCH_SUB_ITERATOR(sub_iter, object);
|
|
|
|
while (object->level) {
|
|
sub_iter = object->iterators[object->level].iterator;
|
|
zend_iterator_dtor(sub_iter);
|
|
zval_ptr_dtor(&object->iterators[object->level--].zobject);
|
|
if (!EG(exception) && (!object->endChildren || object->endChildren->common.scope != spl_ce_RecursiveIteratorIterator)) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->endChildren, "endchildren", NULL);
|
|
}
|
|
}
|
|
object->iterators = erealloc(object->iterators, sizeof(spl_sub_iterator));
|
|
object->iterators[0].state = RS_START;
|
|
sub_iter = object->iterators[0].iterator;
|
|
if (sub_iter->funcs->rewind) {
|
|
sub_iter->funcs->rewind(sub_iter);
|
|
}
|
|
if (!EG(exception) && object->beginIteration && !object->in_iteration) {
|
|
zend_call_method_with_0_params(zthis, object->ce, &object->beginIteration, "beginIteration", NULL);
|
|
}
|
|
object->in_iteration = 1;
|
|
spl_recursive_it_move_forward_ex(object, zthis);
|
|
}
|
|
|
|
static void spl_recursive_it_move_forward(zend_object_iterator *iter)
|
|
{
|
|
spl_recursive_it_move_forward_ex(Z_SPLRECURSIVE_IT_P(&iter->data), &iter->data);
|
|
}
|
|
|
|
static void spl_recursive_it_rewind(zend_object_iterator *iter)
|
|
{
|
|
spl_recursive_it_rewind_ex(Z_SPLRECURSIVE_IT_P(&iter->data), &iter->data);
|
|
}
|
|
|
|
static zend_object_iterator *spl_recursive_it_get_iterator(zend_class_entry *ce, zval *zobject, int by_ref)
|
|
{
|
|
spl_recursive_it_iterator *iterator;
|
|
spl_recursive_it_object *object;
|
|
|
|
if (by_ref) {
|
|
zend_error(E_ERROR, "An iterator cannot be used with foreach by reference");
|
|
}
|
|
iterator = emalloc(sizeof(spl_recursive_it_iterator));
|
|
object = Z_SPLRECURSIVE_IT_P(zobject);
|
|
if (object->iterators == NULL) {
|
|
zend_error(E_ERROR, "The object to be iterated is in an invalid state: "
|
|
"the parent constructor has not been called");
|
|
}
|
|
|
|
zend_iterator_init((zend_object_iterator*)iterator);
|
|
|
|
ZVAL_COPY(&iterator->intern.data, zobject);
|
|
iterator->intern.funcs = ce->iterator_funcs.funcs;
|
|
return (zend_object_iterator*)iterator;
|
|
}
|
|
|
|
zend_object_iterator_funcs spl_recursive_it_iterator_funcs = {
|
|
spl_recursive_it_dtor,
|
|
spl_recursive_it_valid,
|
|
spl_recursive_it_get_current_data,
|
|
spl_recursive_it_get_current_key,
|
|
spl_recursive_it_move_forward,
|
|
spl_recursive_it_rewind
|
|
};
|
|
|
|
static void spl_recursive_it_it_construct(INTERNAL_FUNCTION_PARAMETERS, zend_class_entry *ce_base, zend_class_entry *ce_inner, recursive_it_it_type rit_type)
|
|
{
|
|
zval *object = getThis();
|
|
spl_recursive_it_object *intern;
|
|
zval *iterator;
|
|
zend_class_entry *ce_iterator;
|
|
zend_long mode, flags;
|
|
zend_error_handling error_handling;
|
|
zval caching_it, aggregate_retval;
|
|
|
|
zend_replace_error_handling(EH_THROW, spl_ce_InvalidArgumentException, &error_handling);
|
|
|
|
switch (rit_type) {
|
|
case RIT_RecursiveTreeIterator: {
|
|
zval caching_it_flags, *user_caching_it_flags = NULL;
|
|
mode = RIT_SELF_FIRST;
|
|
flags = RTIT_BYPASS_KEY;
|
|
|
|
if (zend_parse_parameters_ex(ZEND_PARSE_PARAMS_QUIET, ZEND_NUM_ARGS(), "o|lzl", &iterator, &flags, &user_caching_it_flags, &mode) == SUCCESS) {
|
|
if (instanceof_function(Z_OBJCE_P(iterator), zend_ce_aggregate)) {
|
|
zend_call_method_with_0_params(iterator, Z_OBJCE_P(iterator), &Z_OBJCE_P(iterator)->iterator_funcs.zf_new_iterator, "getiterator", &aggregate_retval);
|
|
iterator = &aggregate_retval;
|
|
} else {
|
|
Z_ADDREF_P(iterator);
|
|
}
|
|
|
|
if (user_caching_it_flags) {
|
|
ZVAL_COPY(&caching_it_flags, user_caching_it_flags);
|
|
} else {
|
|
ZVAL_LONG(&caching_it_flags, CIT_CATCH_GET_CHILD);
|
|
}
|
|
spl_instantiate_arg_ex2(spl_ce_RecursiveCachingIterator, &caching_it, iterator, &caching_it_flags);
|
|
zval_ptr_dtor(&caching_it_flags);
|
|
|
|
zval_ptr_dtor(iterator);
|
|
iterator = &caching_it;
|
|
} else {
|
|
iterator = NULL;
|
|
}
|
|
break;
|
|
}
|
|
case RIT_RecursiveIteratorIterator:
|
|
default: {
|
|
mode = RIT_LEAVES_ONLY;
|
|
flags = 0;
|
|
|
|
if (zend_parse_parameters_ex(ZEND_PARSE_PARAMS_QUIET, ZEND_NUM_ARGS(), "o|ll", &iterator, &mode, &flags) == SUCCESS) {
|
|
if (instanceof_function(Z_OBJCE_P(iterator), zend_ce_aggregate)) {
|
|
zend_call_method_with_0_params(iterator, Z_OBJCE_P(iterator), &Z_OBJCE_P(iterator)->iterator_funcs.zf_new_iterator, "getiterator", &aggregate_retval);
|
|
iterator = &aggregate_retval;
|
|
} else {
|
|
Z_ADDREF_P(iterator);
|
|
}
|
|
} else {
|
|
iterator = NULL;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
if (!iterator || !instanceof_function(Z_OBJCE_P(iterator), spl_ce_RecursiveIterator)) {
|
|
if (iterator) {
|
|
zval_ptr_dtor(iterator);
|
|
}
|
|
zend_throw_exception(spl_ce_InvalidArgumentException, "An instance of RecursiveIterator or IteratorAggregate creating it is required", 0);
|
|
zend_restore_error_handling(&error_handling);
|
|
return;
|
|
}
|
|
|
|
intern = Z_SPLRECURSIVE_IT_P(object);
|
|
intern->iterators = emalloc(sizeof(spl_sub_iterator));
|
|
intern->level = 0;
|
|
intern->mode = mode;
|
|
intern->flags = (int)flags;
|
|
intern->max_depth = -1;
|
|
intern->in_iteration = 0;
|
|
intern->ce = Z_OBJCE_P(object);
|
|
|
|
intern->beginIteration = zend_hash_str_find_ptr(&intern->ce->function_table, "beginiteration", sizeof("beginiteration") - 1);
|
|
if (intern->beginIteration->common.scope == ce_base) {
|
|
intern->beginIteration = NULL;
|
|
}
|
|
intern->endIteration = zend_hash_str_find_ptr(&intern->ce->function_table, "enditeration", sizeof("enditeration") - 1);
|
|
if (intern->endIteration->common.scope == ce_base) {
|
|
intern->endIteration = NULL;
|
|
}
|
|
intern->callHasChildren = zend_hash_str_find_ptr(&intern->ce->function_table, "callhaschildren", sizeof("callHasChildren") - 1);
|
|
if (intern->callHasChildren->common.scope == ce_base) {
|
|
intern->callHasChildren = NULL;
|
|
}
|
|
intern->callGetChildren = zend_hash_str_find_ptr(&intern->ce->function_table, "callgetchildren", sizeof("callGetChildren") - 1);
|
|
if (intern->callGetChildren->common.scope == ce_base) {
|
|
intern->callGetChildren = NULL;
|
|
}
|
|
intern->beginChildren = zend_hash_str_find_ptr(&intern->ce->function_table, "beginchildren", sizeof("beginchildren") - 1);
|
|
if (intern->beginChildren->common.scope == ce_base) {
|
|
intern->beginChildren = NULL;
|
|
}
|
|
intern->endChildren = zend_hash_str_find_ptr(&intern->ce->function_table, "endchildren", sizeof("endchildren") - 1);
|
|
if (intern->endChildren->common.scope == ce_base) {
|
|
intern->endChildren = NULL;
|
|
}
|
|
intern->nextElement = zend_hash_str_find_ptr(&intern->ce->function_table, "nextelement", sizeof("nextElement") - 1);
|
|
if (intern->nextElement->common.scope == ce_base) {
|
|
intern->nextElement = NULL;
|
|
}
|
|
|
|
ce_iterator = Z_OBJCE_P(iterator); /* respect inheritance, don't use spl_ce_RecursiveIterator */
|
|
intern->iterators[0].iterator = ce_iterator->get_iterator(ce_iterator, iterator, 0);
|
|
ZVAL_COPY_VALUE(&intern->iterators[0].zobject, iterator);
|
|
intern->iterators[0].ce = ce_iterator;
|
|
intern->iterators[0].state = RS_START;
|
|
|
|
zend_restore_error_handling(&error_handling);
|
|
|
|
if (EG(exception)) {
|
|
zend_object_iterator *sub_iter;
|
|
|
|
while (intern->level >= 0) {
|
|
sub_iter = intern->iterators[intern->level].iterator;
|
|
zend_iterator_dtor(sub_iter);
|
|
zval_ptr_dtor(&intern->iterators[intern->level--].zobject);
|
|
}
|
|
efree(intern->iterators);
|
|
intern->iterators = NULL;
|
|
}
|
|
}
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::__construct(RecursiveIterator|IteratorAggregate it [, int mode = RIT_LEAVES_ONLY [, int flags = 0]]) throws InvalidArgumentException
|
|
Creates a RecursiveIteratorIterator from a RecursiveIterator. */
|
|
SPL_METHOD(RecursiveIteratorIterator, __construct)
|
|
{
|
|
spl_recursive_it_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveIteratorIterator, zend_ce_iterator, RIT_RecursiveIteratorIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::rewind()
|
|
Rewind the iterator to the first element of the top level inner iterator. */
|
|
SPL_METHOD(RecursiveIteratorIterator, rewind)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
spl_recursive_it_rewind_ex(object, getThis());
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RecursiveIteratorIterator::valid()
|
|
Check whether the current position is valid */
|
|
SPL_METHOD(RecursiveIteratorIterator, valid)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
RETURN_BOOL(spl_recursive_it_valid_ex(object, getThis()) == SUCCESS);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed RecursiveIteratorIterator::key()
|
|
Access the current key */
|
|
SPL_METHOD(RecursiveIteratorIterator, key)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_object_iterator *iterator;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_SUB_ITERATOR(iterator, object);
|
|
|
|
if (iterator->funcs->get_current_key) {
|
|
iterator->funcs->get_current_key(iterator, return_value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed RecursiveIteratorIterator::current()
|
|
Access the current element value */
|
|
SPL_METHOD(RecursiveIteratorIterator, current)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_object_iterator *iterator;
|
|
zval *data;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_SUB_ITERATOR(iterator, object);
|
|
|
|
data = iterator->funcs->get_current_data(iterator);
|
|
if (data) {
|
|
ZVAL_DEREF(data);
|
|
ZVAL_COPY(return_value, data);
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::next()
|
|
Move forward to the next element */
|
|
SPL_METHOD(RecursiveIteratorIterator, next)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
spl_recursive_it_move_forward_ex(object, getThis());
|
|
} /* }}} */
|
|
|
|
/* {{{ proto int RecursiveIteratorIterator::getDepth()
|
|
Get the current depth of the recursive iteration */
|
|
SPL_METHOD(RecursiveIteratorIterator, getDepth)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
RETURN_LONG(object->level);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveIterator RecursiveIteratorIterator::getSubIterator([int level])
|
|
The current active sub iterator or the iterator at specified level */
|
|
SPL_METHOD(RecursiveIteratorIterator, getSubIterator)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_long level = object->level;
|
|
zval *value;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "|l", &level) == FAILURE) {
|
|
return;
|
|
}
|
|
if (level < 0 || level > object->level) {
|
|
RETURN_NULL();
|
|
}
|
|
|
|
if(!object->iterators) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0,
|
|
"The object is in an invalid state as the parent constructor was not called");
|
|
return;
|
|
}
|
|
|
|
value = &object->iterators[level].zobject;
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveIterator RecursiveIteratorIterator::getInnerIterator()
|
|
The current active sub iterator */
|
|
SPL_METHOD(RecursiveIteratorIterator, getInnerIterator)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zval *zobject;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_SUB_ELEMENT_ADDR(zobject, object, zobject);
|
|
|
|
ZVAL_DEREF(zobject);
|
|
ZVAL_COPY(return_value, zobject);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveIterator RecursiveIteratorIterator::beginIteration()
|
|
Called when iteration begins (after first rewind() call) */
|
|
SPL_METHOD(RecursiveIteratorIterator, beginIteration)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveIterator RecursiveIteratorIterator::endIteration()
|
|
Called when iteration ends (when valid() first returns false */
|
|
SPL_METHOD(RecursiveIteratorIterator, endIteration)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RecursiveIteratorIterator::callHasChildren()
|
|
Called for each element to test whether it has children */
|
|
SPL_METHOD(RecursiveIteratorIterator, callHasChildren)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_class_entry *ce;
|
|
zval *zobject;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (!object->iterators) {
|
|
RETURN_NULL();
|
|
}
|
|
|
|
SPL_FETCH_SUB_ELEMENT(ce, object, ce);
|
|
|
|
zobject = &object->iterators[object->level].zobject;
|
|
if (Z_TYPE_P(zobject) == IS_UNDEF) {
|
|
RETURN_FALSE;
|
|
} else {
|
|
zend_call_method_with_0_params(zobject, ce, NULL, "haschildren", return_value);
|
|
if (Z_TYPE_P(return_value) == IS_UNDEF) {
|
|
RETURN_FALSE;
|
|
}
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveIterator RecursiveIteratorIterator::callGetChildren()
|
|
Return children of current element */
|
|
SPL_METHOD(RecursiveIteratorIterator, callGetChildren)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_class_entry *ce;
|
|
zval *zobject;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_SUB_ELEMENT(ce, object, ce);
|
|
|
|
zobject = &object->iterators[object->level].zobject;
|
|
if (Z_TYPE_P(zobject) == IS_UNDEF) {
|
|
return;
|
|
} else {
|
|
zend_call_method_with_0_params(zobject, ce, NULL, "getchildren", return_value);
|
|
if (Z_TYPE_P(return_value) == IS_UNDEF) {
|
|
RETURN_NULL();
|
|
}
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::beginChildren()
|
|
Called when recursing one level down */
|
|
SPL_METHOD(RecursiveIteratorIterator, beginChildren)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::endChildren()
|
|
Called when end recursing one level */
|
|
SPL_METHOD(RecursiveIteratorIterator, endChildren)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::nextElement()
|
|
Called when the next element is available */
|
|
SPL_METHOD(RecursiveIteratorIterator, nextElement)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveIteratorIterator::setMaxDepth([$max_depth = -1])
|
|
Set the maximum allowed depth (or any depth if pmax_depth = -1] */
|
|
SPL_METHOD(RecursiveIteratorIterator, setMaxDepth)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_long max_depth = -1;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "|l", &max_depth) == FAILURE) {
|
|
return;
|
|
}
|
|
if (max_depth < -1) {
|
|
zend_throw_exception(spl_ce_OutOfRangeException, "Parameter max_depth must be >= -1", 0);
|
|
return;
|
|
} else if (max_depth > INT_MAX) {
|
|
max_depth = INT_MAX;
|
|
}
|
|
|
|
object->max_depth = (int)max_depth;
|
|
} /* }}} */
|
|
|
|
/* {{{ proto int|false RecursiveIteratorIterator::getMaxDepth()
|
|
Return the maximum accepted depth or false if any depth is allowed */
|
|
SPL_METHOD(RecursiveIteratorIterator, getMaxDepth)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (object->max_depth == -1) {
|
|
RETURN_FALSE;
|
|
} else {
|
|
RETURN_LONG(object->max_depth);
|
|
}
|
|
} /* }}} */
|
|
|
|
static union _zend_function *spl_recursive_it_get_method(zend_object **zobject, zend_string *method, const zval *key)
|
|
{
|
|
union _zend_function *function_handler;
|
|
spl_recursive_it_object *object = spl_recursive_it_from_obj(*zobject);
|
|
zend_long level = object->level;
|
|
zval *zobj;
|
|
|
|
if (!object->iterators) {
|
|
php_error_docref(NULL, E_ERROR, "The %s instance wasn't initialized properly", ZSTR_VAL((*zobject)->ce->name));
|
|
}
|
|
zobj = &object->iterators[level].zobject;
|
|
|
|
function_handler = std_object_handlers.get_method(zobject, method, key);
|
|
if (!function_handler) {
|
|
if ((function_handler = zend_hash_find_ptr(&Z_OBJCE_P(zobj)->function_table, method)) == NULL) {
|
|
if (Z_OBJ_HT_P(zobj)->get_method) {
|
|
*zobject = Z_OBJ_P(zobj);
|
|
function_handler = (*zobject)->handlers->get_method(zobject, method, key);
|
|
}
|
|
} else {
|
|
*zobject = Z_OBJ_P(zobj);
|
|
}
|
|
}
|
|
return function_handler;
|
|
}
|
|
|
|
/* {{{ spl_RecursiveIteratorIterator_dtor */
|
|
static void spl_RecursiveIteratorIterator_dtor(zend_object *_object)
|
|
{
|
|
spl_recursive_it_object *object = spl_recursive_it_from_obj(_object);
|
|
zend_object_iterator *sub_iter;
|
|
|
|
/* call standard dtor */
|
|
zend_objects_destroy_object(_object);
|
|
|
|
if (object->iterators) {
|
|
while (object->level >= 0) {
|
|
sub_iter = object->iterators[object->level].iterator;
|
|
zend_iterator_dtor(sub_iter);
|
|
zval_ptr_dtor(&object->iterators[object->level--].zobject);
|
|
}
|
|
efree(object->iterators);
|
|
object->iterators = NULL;
|
|
}
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_RecursiveIteratorIterator_free_storage */
|
|
static void spl_RecursiveIteratorIterator_free_storage(zend_object *_object)
|
|
{
|
|
spl_recursive_it_object *object = spl_recursive_it_from_obj(_object);
|
|
|
|
if (object->iterators) {
|
|
efree(object->iterators);
|
|
object->iterators = NULL;
|
|
}
|
|
|
|
zend_object_std_dtor(&object->std);
|
|
smart_str_free(&object->prefix[0]);
|
|
smart_str_free(&object->prefix[1]);
|
|
smart_str_free(&object->prefix[2]);
|
|
smart_str_free(&object->prefix[3]);
|
|
smart_str_free(&object->prefix[4]);
|
|
smart_str_free(&object->prefix[5]);
|
|
|
|
smart_str_free(&object->postfix[0]);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_RecursiveIteratorIterator_new_ex */
|
|
static zend_object *spl_RecursiveIteratorIterator_new_ex(zend_class_entry *class_type, int init_prefix)
|
|
{
|
|
spl_recursive_it_object *intern;
|
|
|
|
intern = ecalloc(1, sizeof(spl_recursive_it_object) + zend_object_properties_size(class_type));
|
|
|
|
if (init_prefix) {
|
|
smart_str_appendl(&intern->prefix[0], "", 0);
|
|
smart_str_appendl(&intern->prefix[1], "| ", 2);
|
|
smart_str_appendl(&intern->prefix[2], " ", 2);
|
|
smart_str_appendl(&intern->prefix[3], "|-", 2);
|
|
smart_str_appendl(&intern->prefix[4], "\\-", 2);
|
|
smart_str_appendl(&intern->prefix[5], "", 0);
|
|
|
|
smart_str_appendl(&intern->postfix[0], "", 0);
|
|
}
|
|
|
|
zend_object_std_init(&intern->std, class_type);
|
|
object_properties_init(&intern->std, class_type);
|
|
|
|
intern->std.handlers = &spl_handlers_rec_it_it;
|
|
return &intern->std;
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_RecursiveIteratorIterator_new */
|
|
static zend_object *spl_RecursiveIteratorIterator_new(zend_class_entry *class_type)
|
|
{
|
|
return spl_RecursiveIteratorIterator_new_ex(class_type, 0);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_RecursiveTreeIterator_new */
|
|
static zend_object *spl_RecursiveTreeIterator_new(zend_class_entry *class_type)
|
|
{
|
|
return spl_RecursiveIteratorIterator_new_ex(class_type, 1);
|
|
}
|
|
/* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_recursive_it___construct, 0, 0, 1)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Traversable, 0)
|
|
ZEND_ARG_INFO(0, mode)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_recursive_it_getSubIterator, 0, 0, 0)
|
|
ZEND_ARG_INFO(0, level)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_recursive_it_setMaxDepth, 0, 0, 0)
|
|
ZEND_ARG_INFO(0, max_depth)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveIteratorIterator[] = {
|
|
SPL_ME(RecursiveIteratorIterator, __construct, arginfo_recursive_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, getDepth, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, getSubIterator, arginfo_recursive_it_getSubIterator, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, beginIteration, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, endIteration, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, callHasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, callGetChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, beginChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, endChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, nextElement, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, setMaxDepth, arginfo_recursive_it_setMaxDepth, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, getMaxDepth, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
static void spl_recursive_tree_iterator_get_prefix(spl_recursive_it_object *object, zval *return_value)
|
|
{
|
|
smart_str str = {0};
|
|
zval has_next;
|
|
int level;
|
|
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[0].s), ZSTR_LEN(object->prefix[0].s));
|
|
|
|
for (level = 0; level < object->level; ++level) {
|
|
zend_call_method_with_0_params(&object->iterators[level].zobject, object->iterators[level].ce, NULL, "hasnext", &has_next);
|
|
if (Z_TYPE(has_next) != IS_UNDEF) {
|
|
if (Z_TYPE(has_next) == IS_TRUE) {
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[1].s), ZSTR_LEN(object->prefix[1].s));
|
|
} else {
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[2].s), ZSTR_LEN(object->prefix[2].s));
|
|
}
|
|
zval_ptr_dtor(&has_next);
|
|
}
|
|
}
|
|
zend_call_method_with_0_params(&object->iterators[level].zobject, object->iterators[level].ce, NULL, "hasnext", &has_next);
|
|
if (Z_TYPE(has_next) != IS_UNDEF) {
|
|
if (Z_TYPE(has_next) == IS_TRUE) {
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[3].s), ZSTR_LEN(object->prefix[3].s));
|
|
} else {
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[4].s), ZSTR_LEN(object->prefix[4].s));
|
|
}
|
|
zval_ptr_dtor(&has_next);
|
|
}
|
|
|
|
smart_str_appendl(&str, ZSTR_VAL(object->prefix[5].s), ZSTR_LEN(object->prefix[5].s));
|
|
smart_str_0(&str);
|
|
|
|
RETURN_NEW_STR(str.s);
|
|
}
|
|
|
|
static void spl_recursive_tree_iterator_get_entry(spl_recursive_it_object *object, zval *return_value)
|
|
{
|
|
zend_object_iterator *iterator = object->iterators[object->level].iterator;
|
|
zval *data;
|
|
zend_error_handling error_handling;
|
|
|
|
data = iterator->funcs->get_current_data(iterator);
|
|
|
|
/* Replace exception handling so the catchable fatal error that is thrown when a class
|
|
* without __toString is converted to string is converted into an exception. */
|
|
zend_replace_error_handling(EH_THROW, spl_ce_UnexpectedValueException, &error_handling);
|
|
if (data) {
|
|
ZVAL_DEREF(data);
|
|
if (Z_TYPE_P(data) == IS_ARRAY) {
|
|
ZVAL_STRINGL(return_value, "Array", sizeof("Array")-1);
|
|
} else {
|
|
ZVAL_COPY(return_value, data);
|
|
convert_to_string(return_value);
|
|
}
|
|
}
|
|
zend_restore_error_handling(&error_handling);
|
|
}
|
|
|
|
static void spl_recursive_tree_iterator_get_postfix(spl_recursive_it_object *object, zval *return_value)
|
|
{
|
|
RETVAL_STR(object->postfix[0].s);
|
|
Z_ADDREF_P(return_value);
|
|
}
|
|
|
|
/* {{{ proto void RecursiveTreeIterator::__construct(RecursiveIterator|IteratorAggregate it [, int flags = RTIT_BYPASS_KEY [, int cit_flags = CIT_CATCH_GET_CHILD [, mode = RIT_SELF_FIRST ]]]) throws InvalidArgumentException
|
|
RecursiveIteratorIterator to generate ASCII graphic trees for the entries in a RecursiveIterator */
|
|
SPL_METHOD(RecursiveTreeIterator, __construct)
|
|
{
|
|
spl_recursive_it_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveTreeIterator, zend_ce_iterator, RIT_RecursiveTreeIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveTreeIterator::setPrefixPart(int part, string prefix) throws OutOfRangeException
|
|
Sets prefix parts as used in getPrefix() */
|
|
SPL_METHOD(RecursiveTreeIterator, setPrefixPart)
|
|
{
|
|
zend_long part;
|
|
char* prefix;
|
|
size_t prefix_len;
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "ls", &part, &prefix, &prefix_len) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (0 > part || part > 5) {
|
|
zend_throw_exception_ex(spl_ce_OutOfRangeException, 0, "Use RecursiveTreeIterator::PREFIX_* constant");
|
|
return;
|
|
}
|
|
|
|
smart_str_free(&object->prefix[part]);
|
|
smart_str_appendl(&object->prefix[part], prefix, prefix_len);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto string RecursiveTreeIterator::getPrefix()
|
|
Returns the string to place in front of current element */
|
|
SPL_METHOD(RecursiveTreeIterator, getPrefix)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if(!object->iterators) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0,
|
|
"The object is in an invalid state as the parent constructor was not called");
|
|
return;
|
|
}
|
|
|
|
spl_recursive_tree_iterator_get_prefix(object, return_value);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveTreeIterator::setPostfix(string prefix)
|
|
Sets postfix as used in getPostfix() */
|
|
SPL_METHOD(RecursiveTreeIterator, setPostfix)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
char* postfix;
|
|
size_t postfix_len;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "s", &postfix, &postfix_len) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
smart_str_free(&object->postfix[0]);
|
|
smart_str_appendl(&object->postfix[0], postfix, postfix_len);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto string RecursiveTreeIterator::getEntry()
|
|
Returns the string presentation built for current element */
|
|
SPL_METHOD(RecursiveTreeIterator, getEntry)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if(!object->iterators) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0,
|
|
"The object is in an invalid state as the parent constructor was not called");
|
|
return;
|
|
}
|
|
|
|
spl_recursive_tree_iterator_get_entry(object, return_value);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto string RecursiveTreeIterator::getPostfix()
|
|
Returns the string to place after the current element */
|
|
SPL_METHOD(RecursiveTreeIterator, getPostfix)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if(!object->iterators) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0,
|
|
"The object is in an invalid state as the parent constructor was not called");
|
|
return;
|
|
}
|
|
|
|
spl_recursive_tree_iterator_get_postfix(object, return_value);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed RecursiveTreeIterator::current()
|
|
Returns the current element prefixed and postfixed */
|
|
SPL_METHOD(RecursiveTreeIterator, current)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zval prefix, entry, postfix;
|
|
char *ptr;
|
|
zend_string *str;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if(!object->iterators) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0,
|
|
"The object is in an invalid state as the parent constructor was not called");
|
|
return;
|
|
}
|
|
|
|
if (object->flags & RTIT_BYPASS_CURRENT) {
|
|
zend_object_iterator *iterator = object->iterators[object->level].iterator;
|
|
zval *data;
|
|
|
|
SPL_FETCH_SUB_ITERATOR(iterator, object);
|
|
data = iterator->funcs->get_current_data(iterator);
|
|
if (data) {
|
|
ZVAL_DEREF(data);
|
|
ZVAL_COPY(return_value, data);
|
|
return;
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
}
|
|
|
|
ZVAL_NULL(&prefix);
|
|
ZVAL_NULL(&entry);
|
|
spl_recursive_tree_iterator_get_prefix(object, &prefix);
|
|
spl_recursive_tree_iterator_get_entry(object, &entry);
|
|
if (Z_TYPE(entry) != IS_STRING) {
|
|
zval_ptr_dtor(&prefix);
|
|
zval_ptr_dtor(&entry);
|
|
RETURN_NULL();
|
|
}
|
|
spl_recursive_tree_iterator_get_postfix(object, &postfix);
|
|
|
|
str = zend_string_alloc(Z_STRLEN(prefix) + Z_STRLEN(entry) + Z_STRLEN(postfix), 0);
|
|
ptr = ZSTR_VAL(str);
|
|
|
|
memcpy(ptr, Z_STRVAL(prefix), Z_STRLEN(prefix));
|
|
ptr += Z_STRLEN(prefix);
|
|
memcpy(ptr, Z_STRVAL(entry), Z_STRLEN(entry));
|
|
ptr += Z_STRLEN(entry);
|
|
memcpy(ptr, Z_STRVAL(postfix), Z_STRLEN(postfix));
|
|
ptr += Z_STRLEN(postfix);
|
|
*ptr = 0;
|
|
|
|
zval_ptr_dtor(&prefix);
|
|
zval_ptr_dtor(&entry);
|
|
zval_ptr_dtor(&postfix);
|
|
|
|
RETURN_NEW_STR(str);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed RecursiveTreeIterator::key()
|
|
Returns the current key prefixed and postfixed */
|
|
SPL_METHOD(RecursiveTreeIterator, key)
|
|
{
|
|
spl_recursive_it_object *object = Z_SPLRECURSIVE_IT_P(getThis());
|
|
zend_object_iterator *iterator;
|
|
zval prefix, key, postfix, key_copy;
|
|
char *ptr;
|
|
zend_string *str;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_SUB_ITERATOR(iterator, object);
|
|
|
|
if (iterator->funcs->get_current_key) {
|
|
iterator->funcs->get_current_key(iterator, &key);
|
|
} else {
|
|
ZVAL_NULL(&key);
|
|
}
|
|
|
|
if (object->flags & RTIT_BYPASS_KEY) {
|
|
RETVAL_ZVAL(&key, 1, 1);
|
|
return;
|
|
}
|
|
|
|
if (Z_TYPE(key) != IS_STRING) {
|
|
if (zend_make_printable_zval(&key, &key_copy)) {
|
|
key = key_copy;
|
|
}
|
|
}
|
|
|
|
spl_recursive_tree_iterator_get_prefix(object, &prefix);
|
|
spl_recursive_tree_iterator_get_postfix(object, &postfix);
|
|
|
|
str = zend_string_alloc(Z_STRLEN(prefix) + Z_STRLEN(key) + Z_STRLEN(postfix), 0);
|
|
ptr = ZSTR_VAL(str);
|
|
|
|
memcpy(ptr, Z_STRVAL(prefix), Z_STRLEN(prefix));
|
|
ptr += Z_STRLEN(prefix);
|
|
memcpy(ptr, Z_STRVAL(key), Z_STRLEN(key));
|
|
ptr += Z_STRLEN(key);
|
|
memcpy(ptr, Z_STRVAL(postfix), Z_STRLEN(postfix));
|
|
ptr += Z_STRLEN(postfix);
|
|
*ptr = 0;
|
|
|
|
zval_ptr_dtor(&prefix);
|
|
zval_ptr_dtor(&key);
|
|
zval_ptr_dtor(&postfix);
|
|
|
|
RETURN_NEW_STR(str);
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_recursive_tree_it___construct, 0, 0, 1)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Traversable, 0)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_ARG_INFO(0, caching_it_flags)
|
|
ZEND_ARG_INFO(0, mode)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_recursive_tree_it_setPrefixPart, 0, 0, 2)
|
|
ZEND_ARG_INFO(0, part)
|
|
ZEND_ARG_INFO(0, value)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveTreeIterator[] = {
|
|
SPL_ME(RecursiveTreeIterator, __construct, arginfo_recursive_tree_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, beginIteration, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, endIteration, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, callHasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, callGetChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, beginChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, endChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveIteratorIterator, nextElement, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, getPrefix, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, setPrefixPart, arginfo_recursive_tree_it_setPrefixPart, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, getEntry, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, setPostfix, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveTreeIterator, getPostfix, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
#if MBO_0
|
|
static int spl_dual_it_gets_implemented(zend_class_entry *interface, zend_class_entry *class_type)
|
|
{
|
|
class_type->iterator_funcs.zf_valid = NULL;
|
|
class_type->iterator_funcs.zf_current = NULL;
|
|
class_type->iterator_funcs.zf_key = NULL;
|
|
class_type->iterator_funcs.zf_next = NULL;
|
|
class_type->iterator_funcs.zf_rewind = NULL;
|
|
if (!class_type->iterator_funcs.funcs) {
|
|
class_type->iterator_funcs.funcs = &zend_interface_iterator_funcs_iterator;
|
|
}
|
|
|
|
return SUCCESS;
|
|
}
|
|
#endif
|
|
|
|
static union _zend_function *spl_dual_it_get_method(zend_object **object, zend_string *method, const zval *key)
|
|
{
|
|
union _zend_function *function_handler;
|
|
spl_dual_it_object *intern;
|
|
|
|
intern = spl_dual_it_from_obj(*object);
|
|
|
|
function_handler = std_object_handlers.get_method(object, method, key);
|
|
if (!function_handler && intern->inner.ce) {
|
|
if ((function_handler = zend_hash_find_ptr(&intern->inner.ce->function_table, method)) == NULL) {
|
|
if (Z_OBJ_HT(intern->inner.zobject)->get_method) {
|
|
*object = Z_OBJ(intern->inner.zobject);
|
|
function_handler = (*object)->handlers->get_method(object, method, key);
|
|
}
|
|
} else {
|
|
*object = Z_OBJ(intern->inner.zobject);
|
|
}
|
|
}
|
|
return function_handler;
|
|
}
|
|
|
|
#if MBO_0
|
|
int spl_dual_it_call_method(char *method, INTERNAL_FUNCTION_PARAMETERS)
|
|
{
|
|
zval ***func_params, func;
|
|
zval retval;
|
|
int arg_count;
|
|
int current = 0;
|
|
int success;
|
|
void **p;
|
|
spl_dual_it_object *intern;
|
|
|
|
intern = Z_SPLDUAL_IT_P(getThis());
|
|
|
|
ZVAL_STRING(&func, method, 0);
|
|
if (!zend_is_callable(&func, 0, &method)) {
|
|
php_error_docref(NULL, E_ERROR, "Method %s::%s() does not exist", intern->inner.ce->name, method);
|
|
return FAILURE;
|
|
}
|
|
|
|
p = EG(argument_stack).top_element-2;
|
|
arg_count = (zend_ulong) *p;
|
|
|
|
func_params = safe_emalloc(sizeof(zval **), arg_count, 0);
|
|
|
|
current = 0;
|
|
while (arg_count-- > 0) {
|
|
func_params[current] = (zval **) p - (arg_count-current);
|
|
current++;
|
|
}
|
|
arg_count = current; /* restore */
|
|
|
|
if (call_user_function_ex(EG(function_table), NULL, &func, &retval, arg_count, func_params, 0, NULL) == SUCCESS && Z_TYPE(retval) != IS_UNDEF) {
|
|
RETURN_ZVAL(&retval, 0, 0);
|
|
|
|
success = SUCCESS;
|
|
} else {
|
|
php_error_docref(NULL, E_ERROR, "Unable to call %s::%s()", intern->inner.ce->name, method);
|
|
success = FAILURE;
|
|
}
|
|
|
|
efree(func_params);
|
|
return success;
|
|
}
|
|
#endif
|
|
|
|
#define SPL_CHECK_CTOR(intern, classname) \
|
|
if (intern->dit_type == DIT_Unknown) { \
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "Classes derived from %s must call %s::__construct()", \
|
|
ZSTR_VAL((spl_ce_##classname)->name), ZSTR_VAL((spl_ce_##classname)->name)); \
|
|
return; \
|
|
}
|
|
|
|
#define APPENDIT_CHECK_CTOR(intern) SPL_CHECK_CTOR(intern, AppendIterator)
|
|
|
|
static inline int spl_dual_it_fetch(spl_dual_it_object *intern, int check_more);
|
|
|
|
static inline int spl_cit_check_flags(zend_long flags)
|
|
{
|
|
zend_long cnt = 0;
|
|
|
|
cnt += (flags & CIT_CALL_TOSTRING) ? 1 : 0;
|
|
cnt += (flags & CIT_TOSTRING_USE_KEY) ? 1 : 0;
|
|
cnt += (flags & CIT_TOSTRING_USE_CURRENT) ? 1 : 0;
|
|
cnt += (flags & CIT_TOSTRING_USE_INNER) ? 1 : 0;
|
|
|
|
return cnt <= 1 ? SUCCESS : FAILURE;
|
|
}
|
|
|
|
static spl_dual_it_object* spl_dual_it_construct(INTERNAL_FUNCTION_PARAMETERS, zend_class_entry *ce_base, zend_class_entry *ce_inner, dual_it_type dit_type)
|
|
{
|
|
zval *zobject, retval;
|
|
spl_dual_it_object *intern;
|
|
zend_class_entry *ce = NULL;
|
|
int inc_refcount = 1;
|
|
zend_error_handling error_handling;
|
|
|
|
intern = Z_SPLDUAL_IT_P(getThis());
|
|
|
|
if (intern->dit_type != DIT_Unknown) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s::getIterator() must be called exactly once per instance", ZSTR_VAL(ce_base->name));
|
|
return NULL;
|
|
}
|
|
|
|
intern->dit_type = dit_type;
|
|
switch (dit_type) {
|
|
case DIT_LimitIterator: {
|
|
intern->u.limit.offset = 0; /* start at beginning */
|
|
intern->u.limit.count = -1; /* get all */
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "O|ll", &zobject, ce_inner, &intern->u.limit.offset, &intern->u.limit.count) == FAILURE) {
|
|
return NULL;
|
|
}
|
|
if (intern->u.limit.offset < 0) {
|
|
zend_throw_exception(spl_ce_OutOfRangeException, "Parameter offset must be >= 0", 0);
|
|
return NULL;
|
|
}
|
|
if (intern->u.limit.count < 0 && intern->u.limit.count != -1) {
|
|
zend_throw_exception(spl_ce_OutOfRangeException, "Parameter count must either be -1 or a value greater than or equal 0", 0);
|
|
return NULL;
|
|
}
|
|
break;
|
|
}
|
|
case DIT_CachingIterator:
|
|
case DIT_RecursiveCachingIterator: {
|
|
zend_long flags = CIT_CALL_TOSTRING;
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "O|l", &zobject, ce_inner, &flags) == FAILURE) {
|
|
return NULL;
|
|
}
|
|
if (spl_cit_check_flags(flags) != SUCCESS) {
|
|
zend_throw_exception(spl_ce_InvalidArgumentException, "Flags must contain only one of CALL_TOSTRING, TOSTRING_USE_KEY, TOSTRING_USE_CURRENT, TOSTRING_USE_INNER", 0);
|
|
return NULL;
|
|
}
|
|
intern->u.caching.flags |= flags & CIT_PUBLIC;
|
|
array_init(&intern->u.caching.zcache);
|
|
break;
|
|
}
|
|
case DIT_IteratorIterator: {
|
|
zend_class_entry *ce_cast;
|
|
zend_string *class_name;
|
|
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "O|S", &zobject, ce_inner, &class_name) == FAILURE) {
|
|
return NULL;
|
|
}
|
|
ce = Z_OBJCE_P(zobject);
|
|
if (!instanceof_function(ce, zend_ce_iterator)) {
|
|
if (ZEND_NUM_ARGS() > 1) {
|
|
if (!(ce_cast = zend_lookup_class(class_name))
|
|
|| !instanceof_function(ce, ce_cast)
|
|
|| !ce_cast->get_iterator
|
|
) {
|
|
zend_throw_exception(spl_ce_LogicException, "Class to downcast to not found or not base class or does not implement Traversable", 0);
|
|
return NULL;
|
|
}
|
|
ce = ce_cast;
|
|
}
|
|
if (instanceof_function(ce, zend_ce_aggregate)) {
|
|
zend_call_method_with_0_params(zobject, ce, &ce->iterator_funcs.zf_new_iterator, "getiterator", &retval);
|
|
if (EG(exception)) {
|
|
zval_ptr_dtor(&retval);
|
|
return NULL;
|
|
}
|
|
if (Z_TYPE(retval) != IS_OBJECT || !instanceof_function(Z_OBJCE(retval), zend_ce_traversable)) {
|
|
zend_throw_exception_ex(spl_ce_LogicException, 0, "%s::getIterator() must return an object that implements Traversable", ZSTR_VAL(ce->name));
|
|
return NULL;
|
|
}
|
|
zobject = &retval;
|
|
ce = Z_OBJCE_P(zobject);
|
|
inc_refcount = 0;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
case DIT_AppendIterator:
|
|
zend_replace_error_handling(EH_THROW, spl_ce_InvalidArgumentException, &error_handling);
|
|
spl_instantiate(spl_ce_ArrayIterator, &intern->u.append.zarrayit);
|
|
zend_call_method_with_0_params(&intern->u.append.zarrayit, spl_ce_ArrayIterator, &spl_ce_ArrayIterator->constructor, "__construct", NULL);
|
|
intern->u.append.iterator = spl_ce_ArrayIterator->get_iterator(spl_ce_ArrayIterator, &intern->u.append.zarrayit, 0);
|
|
zend_restore_error_handling(&error_handling);
|
|
return intern;
|
|
#if HAVE_PCRE || HAVE_BUNDLED_PCRE
|
|
case DIT_RegexIterator:
|
|
case DIT_RecursiveRegexIterator: {
|
|
zend_string *regex;
|
|
zend_long mode = REGIT_MODE_MATCH;
|
|
|
|
intern->u.regex.use_flags = ZEND_NUM_ARGS() >= 5;
|
|
intern->u.regex.flags = 0;
|
|
intern->u.regex.preg_flags = 0;
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "OS|lll", &zobject, ce_inner, ®ex, &mode, &intern->u.regex.flags, &intern->u.regex.preg_flags) == FAILURE) {
|
|
return NULL;
|
|
}
|
|
if (mode < 0 || mode >= REGIT_MODE_MAX) {
|
|
zend_throw_exception_ex(spl_ce_InvalidArgumentException, 0, "Illegal mode %pd", mode);
|
|
return NULL;
|
|
}
|
|
intern->u.regex.mode = mode;
|
|
intern->u.regex.regex = zend_string_copy(regex);
|
|
|
|
zend_replace_error_handling(EH_THROW, spl_ce_InvalidArgumentException, &error_handling);
|
|
intern->u.regex.pce = pcre_get_compiled_regex_cache(regex);
|
|
zend_restore_error_handling(&error_handling);
|
|
|
|
if (intern->u.regex.pce == NULL) {
|
|
/* pcre_get_compiled_regex_cache has already sent error */
|
|
return NULL;
|
|
}
|
|
intern->u.regex.pce->refcount++;
|
|
break;
|
|
}
|
|
#endif
|
|
case DIT_CallbackFilterIterator:
|
|
case DIT_RecursiveCallbackFilterIterator: {
|
|
_spl_cbfilter_it_intern *cfi = emalloc(sizeof(*cfi));
|
|
cfi->fci.object = NULL;
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "Of", &zobject, ce_inner, &cfi->fci, &cfi->fcc) == FAILURE) {
|
|
efree(cfi);
|
|
return NULL;
|
|
}
|
|
if (Z_REFCOUNTED_P(&cfi->fci.function_name)) {
|
|
Z_ADDREF(cfi->fci.function_name);
|
|
}
|
|
cfi->object = cfi->fcc.object;
|
|
if (cfi->object) GC_REFCOUNT(cfi->object)++;
|
|
intern->u.cbfilter = cfi;
|
|
break;
|
|
}
|
|
default:
|
|
if (zend_parse_parameters_throw(ZEND_NUM_ARGS(), "O", &zobject, ce_inner) == FAILURE) {
|
|
return NULL;
|
|
}
|
|
break;
|
|
}
|
|
|
|
if (inc_refcount) {
|
|
ZVAL_COPY(&intern->inner.zobject, zobject);
|
|
} else {
|
|
ZVAL_COPY_VALUE(&intern->inner.zobject, zobject);
|
|
}
|
|
|
|
intern->inner.ce = dit_type == DIT_IteratorIterator ? ce : Z_OBJCE_P(zobject);
|
|
intern->inner.object = Z_OBJ_P(zobject);
|
|
intern->inner.iterator = intern->inner.ce->get_iterator(intern->inner.ce, zobject, 0);
|
|
|
|
return intern;
|
|
}
|
|
|
|
/* {{{ proto void FilterIterator::__construct(Iterator it)
|
|
Create an Iterator from another iterator */
|
|
SPL_METHOD(FilterIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_FilterIterator, zend_ce_iterator, DIT_FilterIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void CallbackFilterIterator::__construct(Iterator it, callback func)
|
|
Create an Iterator from another iterator */
|
|
SPL_METHOD(CallbackFilterIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_CallbackFilterIterator, zend_ce_iterator, DIT_CallbackFilterIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto Iterator FilterIterator::getInnerIterator()
|
|
proto Iterator CachingIterator::getInnerIterator()
|
|
proto Iterator LimitIterator::getInnerIterator()
|
|
proto Iterator ParentIterator::getInnerIterator()
|
|
Get the inner iterator */
|
|
SPL_METHOD(dual_it, getInnerIterator)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!Z_ISUNDEF(intern->inner.zobject)) {
|
|
zval *value = &intern->inner.zobject;
|
|
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
static inline void spl_dual_it_require(spl_dual_it_object *intern)
|
|
{
|
|
if (!intern->inner.iterator) {
|
|
php_error_docref(NULL, E_ERROR, "The inner constructor wasn't initialized with an iterator instance");
|
|
}
|
|
}
|
|
|
|
static inline void spl_dual_it_free(spl_dual_it_object *intern)
|
|
{
|
|
if (intern->inner.iterator && intern->inner.iterator->funcs->invalidate_current) {
|
|
intern->inner.iterator->funcs->invalidate_current(intern->inner.iterator);
|
|
}
|
|
if (Z_TYPE(intern->current.data) != IS_UNDEF) {
|
|
zval_ptr_dtor(&intern->current.data);
|
|
ZVAL_UNDEF(&intern->current.data);
|
|
}
|
|
if (Z_TYPE(intern->current.key) != IS_UNDEF) {
|
|
zval_ptr_dtor(&intern->current.key);
|
|
ZVAL_UNDEF(&intern->current.key);
|
|
}
|
|
if (intern->dit_type == DIT_CachingIterator || intern->dit_type == DIT_RecursiveCachingIterator) {
|
|
if (Z_TYPE(intern->u.caching.zstr) != IS_UNDEF) {
|
|
zval_ptr_dtor(&intern->u.caching.zstr);
|
|
ZVAL_UNDEF(&intern->u.caching.zstr);
|
|
}
|
|
if (Z_TYPE(intern->u.caching.zchildren) != IS_UNDEF) {
|
|
zval_ptr_dtor(&intern->u.caching.zchildren);
|
|
ZVAL_UNDEF(&intern->u.caching.zchildren);
|
|
}
|
|
}
|
|
}
|
|
|
|
static inline void spl_dual_it_rewind(spl_dual_it_object *intern)
|
|
{
|
|
spl_dual_it_free(intern);
|
|
intern->current.pos = 0;
|
|
if (intern->inner.iterator && intern->inner.iterator->funcs->rewind) {
|
|
intern->inner.iterator->funcs->rewind(intern->inner.iterator);
|
|
}
|
|
}
|
|
|
|
static inline int spl_dual_it_valid(spl_dual_it_object *intern)
|
|
{
|
|
if (!intern->inner.iterator) {
|
|
return FAILURE;
|
|
}
|
|
/* FAILURE / SUCCESS */
|
|
return intern->inner.iterator->funcs->valid(intern->inner.iterator);
|
|
}
|
|
|
|
static inline int spl_dual_it_fetch(spl_dual_it_object *intern, int check_more)
|
|
{
|
|
zval *data;
|
|
|
|
spl_dual_it_free(intern);
|
|
if (!check_more || spl_dual_it_valid(intern) == SUCCESS) {
|
|
data = intern->inner.iterator->funcs->get_current_data(intern->inner.iterator);
|
|
if (data) {
|
|
ZVAL_COPY(&intern->current.data, data);
|
|
}
|
|
|
|
if (intern->inner.iterator->funcs->get_current_key) {
|
|
intern->inner.iterator->funcs->get_current_key(intern->inner.iterator, &intern->current.key);
|
|
if (EG(exception)) {
|
|
zval_ptr_dtor(&intern->current.key);
|
|
ZVAL_UNDEF(&intern->current.key);
|
|
}
|
|
} else {
|
|
ZVAL_LONG(&intern->current.key, intern->current.pos);
|
|
}
|
|
return EG(exception) ? FAILURE : SUCCESS;
|
|
}
|
|
return FAILURE;
|
|
}
|
|
|
|
static inline void spl_dual_it_next(spl_dual_it_object *intern, int do_free)
|
|
{
|
|
if (do_free) {
|
|
spl_dual_it_free(intern);
|
|
} else {
|
|
spl_dual_it_require(intern);
|
|
}
|
|
intern->inner.iterator->funcs->move_forward(intern->inner.iterator);
|
|
intern->current.pos++;
|
|
}
|
|
|
|
/* {{{ proto void ParentIterator::rewind()
|
|
proto void IteratorIterator::rewind()
|
|
Rewind the iterator
|
|
*/
|
|
SPL_METHOD(dual_it, rewind)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_dual_it_rewind(intern);
|
|
spl_dual_it_fetch(intern, 1);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool FilterIterator::valid()
|
|
proto bool ParentIterator::valid()
|
|
proto bool IteratorIterator::valid()
|
|
proto bool NoRewindIterator::valid()
|
|
Check whether the current element is valid */
|
|
SPL_METHOD(dual_it, valid)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_BOOL(Z_TYPE(intern->current.data) != IS_UNDEF);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed FilterIterator::key()
|
|
proto mixed CachingIterator::key()
|
|
proto mixed LimitIterator::key()
|
|
proto mixed ParentIterator::key()
|
|
proto mixed IteratorIterator::key()
|
|
proto mixed NoRewindIterator::key()
|
|
proto mixed AppendIterator::key()
|
|
Get the current key */
|
|
SPL_METHOD(dual_it, key)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (Z_TYPE(intern->current.key) != IS_UNDEF) {
|
|
zval *value = &intern->current.key;
|
|
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed FilterIterator::current()
|
|
proto mixed CachingIterator::current()
|
|
proto mixed LimitIterator::current()
|
|
proto mixed ParentIterator::current()
|
|
proto mixed IteratorIterator::current()
|
|
proto mixed NoRewindIterator::current()
|
|
proto mixed AppendIterator::current()
|
|
Get the current element value */
|
|
SPL_METHOD(dual_it, current)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (Z_TYPE(intern->current.data) != IS_UNDEF) {
|
|
zval *value = &intern->current.data;
|
|
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void ParentIterator::next()
|
|
proto void IteratorIterator::next()
|
|
proto void NoRewindIterator::next()
|
|
Move the iterator forward */
|
|
SPL_METHOD(dual_it, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_dual_it_next(intern, 1);
|
|
spl_dual_it_fetch(intern, 1);
|
|
} /* }}} */
|
|
|
|
static inline void spl_filter_it_fetch(zval *zthis, spl_dual_it_object *intern)
|
|
{
|
|
zval retval;
|
|
|
|
while (spl_dual_it_fetch(intern, 1) == SUCCESS) {
|
|
zend_call_method_with_0_params(zthis, intern->std.ce, NULL, "accept", &retval);
|
|
if (Z_TYPE(retval) != IS_UNDEF) {
|
|
if (zend_is_true(&retval)) {
|
|
zval_ptr_dtor(&retval);
|
|
return;
|
|
}
|
|
zval_ptr_dtor(&retval);
|
|
}
|
|
if (EG(exception)) {
|
|
return;
|
|
}
|
|
intern->inner.iterator->funcs->move_forward(intern->inner.iterator);
|
|
}
|
|
spl_dual_it_free(intern);
|
|
}
|
|
|
|
static inline void spl_filter_it_rewind(zval *zthis, spl_dual_it_object *intern)
|
|
{
|
|
spl_dual_it_rewind(intern);
|
|
spl_filter_it_fetch(zthis, intern);
|
|
}
|
|
|
|
static inline void spl_filter_it_next(zval *zthis, spl_dual_it_object *intern)
|
|
{
|
|
spl_dual_it_next(intern, 1);
|
|
spl_filter_it_fetch(zthis, intern);
|
|
}
|
|
|
|
/* {{{ proto void FilterIterator::rewind()
|
|
Rewind the iterator */
|
|
SPL_METHOD(FilterIterator, rewind)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
spl_filter_it_rewind(getThis(), intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void FilterIterator::next()
|
|
Move the iterator forward */
|
|
SPL_METHOD(FilterIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
spl_filter_it_next(getThis(), intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveCallbackFilterIterator::__construct(RecursiveIterator it, callback func)
|
|
Create a RecursiveCallbackFilterIterator from a RecursiveIterator */
|
|
SPL_METHOD(RecursiveCallbackFilterIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveCallbackFilterIterator, spl_ce_RecursiveIterator, DIT_RecursiveCallbackFilterIterator);
|
|
} /* }}} */
|
|
|
|
|
|
/* {{{ proto void RecursiveFilterIterator::__construct(RecursiveIterator it)
|
|
Create a RecursiveFilterIterator from a RecursiveIterator */
|
|
SPL_METHOD(RecursiveFilterIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveFilterIterator, spl_ce_RecursiveIterator, DIT_RecursiveFilterIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RecursiveFilterIterator::hasChildren()
|
|
Check whether the inner iterator's current element has children */
|
|
SPL_METHOD(RecursiveFilterIterator, hasChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval retval;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "haschildren", &retval);
|
|
if (Z_TYPE(retval) != IS_UNDEF) {
|
|
RETURN_ZVAL(&retval, 0, 1);
|
|
} else {
|
|
RETURN_FALSE;
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveFilterIterator RecursiveFilterIterator::getChildren()
|
|
Return the inner iterator's children contained in a RecursiveFilterIterator */
|
|
SPL_METHOD(RecursiveFilterIterator, getChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval retval;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "getchildren", &retval);
|
|
if (!EG(exception) && Z_TYPE(retval) != IS_UNDEF) {
|
|
spl_instantiate_arg_ex1(Z_OBJCE_P(getThis()), return_value, &retval);
|
|
}
|
|
zval_ptr_dtor(&retval);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveCallbackFilterIterator RecursiveCallbackFilterIterator::getChildren()
|
|
Return the inner iterator's children contained in a RecursiveCallbackFilterIterator */
|
|
SPL_METHOD(RecursiveCallbackFilterIterator, getChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval retval;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "getchildren", &retval);
|
|
if (!EG(exception) && Z_TYPE(retval) != IS_UNDEF) {
|
|
spl_instantiate_arg_ex2(Z_OBJCE_P(getThis()), return_value, &retval, &intern->u.cbfilter->fci.function_name);
|
|
}
|
|
zval_ptr_dtor(&retval);
|
|
} /* }}} */
|
|
/* {{{ proto void ParentIterator::__construct(RecursiveIterator it)
|
|
Create a ParentIterator from a RecursiveIterator */
|
|
SPL_METHOD(ParentIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_ParentIterator, spl_ce_RecursiveIterator, DIT_ParentIterator);
|
|
} /* }}} */
|
|
|
|
#if HAVE_PCRE || HAVE_BUNDLED_PCRE
|
|
/* {{{ proto void RegexIterator::__construct(Iterator it, string regex [, int mode [, int flags [, int preg_flags]]])
|
|
Create an RegexIterator from another iterator and a regular expression */
|
|
SPL_METHOD(RegexIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RegexIterator, zend_ce_iterator, DIT_RegexIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool CallbackFilterIterator::accept()
|
|
Calls the callback with the current value, the current key and the inner iterator as arguments */
|
|
SPL_METHOD(CallbackFilterIterator, accept)
|
|
{
|
|
spl_dual_it_object *intern = Z_SPLDUAL_IT_P(getThis());
|
|
zend_fcall_info *fci = &intern->u.cbfilter->fci;
|
|
zend_fcall_info_cache *fcc = &intern->u.cbfilter->fcc;
|
|
zval params[3];
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (Z_TYPE(intern->current.data) == IS_UNDEF || Z_TYPE(intern->current.key) == IS_UNDEF) {
|
|
RETURN_FALSE;
|
|
}
|
|
|
|
ZVAL_COPY_VALUE(¶ms[0], &intern->current.data);
|
|
ZVAL_COPY_VALUE(¶ms[1], &intern->current.key);
|
|
ZVAL_COPY_VALUE(¶ms[2], &intern->inner.zobject);
|
|
|
|
fci->retval = return_value;
|
|
fci->param_count = 3;
|
|
fci->params = params;
|
|
fci->no_separation = 0;
|
|
|
|
if (zend_call_function(fci, fcc) != SUCCESS || Z_ISUNDEF_P(return_value)) {
|
|
RETURN_FALSE;
|
|
}
|
|
|
|
if (EG(exception)) {
|
|
RETURN_NULL();
|
|
}
|
|
|
|
/* zend_call_function may change args to IS_REF */
|
|
ZVAL_COPY_VALUE(&intern->current.data, ¶ms[0]);
|
|
ZVAL_COPY_VALUE(&intern->current.key, ¶ms[1]);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::accept()
|
|
Match (string)current() against regular expression */
|
|
SPL_METHOD(RegexIterator, accept)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_string *result, *subject;
|
|
int count = 0;
|
|
zval zcount, *replacement, tmp_replacement, rv;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (Z_TYPE(intern->current.data) == IS_UNDEF) {
|
|
RETURN_FALSE;
|
|
}
|
|
|
|
if (intern->u.regex.flags & REGIT_USE_KEY) {
|
|
subject = zval_get_string(&intern->current.key);
|
|
} else {
|
|
if (Z_TYPE(intern->current.data) == IS_ARRAY) {
|
|
RETURN_FALSE;
|
|
}
|
|
subject = zval_get_string(&intern->current.data);
|
|
}
|
|
|
|
switch (intern->u.regex.mode)
|
|
{
|
|
case REGIT_MODE_MAX: /* won't happen but makes compiler happy */
|
|
case REGIT_MODE_MATCH:
|
|
#ifdef PCRE_EXTRA_MARK
|
|
if (intern->u.regex.pce->extra) {
|
|
intern->u.regex.pce->extra->flags &= ~PCRE_EXTRA_MARK;
|
|
}
|
|
#endif
|
|
count = pcre_exec(intern->u.regex.pce->re, intern->u.regex.pce->extra, ZSTR_VAL(subject), ZSTR_LEN(subject), 0, 0, NULL, 0);
|
|
RETVAL_BOOL(count >= 0);
|
|
break;
|
|
|
|
case REGIT_MODE_ALL_MATCHES:
|
|
case REGIT_MODE_GET_MATCH:
|
|
zval_ptr_dtor(&intern->current.data);
|
|
ZVAL_UNDEF(&intern->current.data);
|
|
php_pcre_match_impl(intern->u.regex.pce, ZSTR_VAL(subject), ZSTR_LEN(subject), &zcount,
|
|
&intern->current.data, intern->u.regex.mode == REGIT_MODE_ALL_MATCHES, intern->u.regex.use_flags, intern->u.regex.preg_flags, 0);
|
|
RETVAL_BOOL(Z_LVAL(zcount) > 0);
|
|
break;
|
|
|
|
case REGIT_MODE_SPLIT:
|
|
zval_ptr_dtor(&intern->current.data);
|
|
ZVAL_UNDEF(&intern->current.data);
|
|
php_pcre_split_impl(intern->u.regex.pce, ZSTR_VAL(subject), ZSTR_LEN(subject), &intern->current.data, -1, intern->u.regex.preg_flags);
|
|
count = zend_hash_num_elements(Z_ARRVAL(intern->current.data));
|
|
RETVAL_BOOL(count > 1);
|
|
break;
|
|
|
|
case REGIT_MODE_REPLACE:
|
|
replacement = zend_read_property(intern->std.ce, getThis(), "replacement", sizeof("replacement")-1, 1, &rv);
|
|
if (Z_TYPE_P(replacement) != IS_STRING) {
|
|
ZVAL_COPY(&tmp_replacement, replacement);
|
|
convert_to_string(&tmp_replacement);
|
|
replacement = &tmp_replacement;
|
|
}
|
|
result = php_pcre_replace_impl(intern->u.regex.pce, subject, ZSTR_VAL(subject), ZSTR_LEN(subject), replacement, 0, -1, &count);
|
|
|
|
if (intern->u.regex.flags & REGIT_USE_KEY) {
|
|
zval_ptr_dtor(&intern->current.key);
|
|
ZVAL_STR(&intern->current.key, result);
|
|
} else {
|
|
zval_ptr_dtor(&intern->current.data);
|
|
ZVAL_STR(&intern->current.data, result);
|
|
}
|
|
|
|
if (replacement == &tmp_replacement) {
|
|
zval_ptr_dtor(replacement);
|
|
}
|
|
RETVAL_BOOL(count > 0);
|
|
}
|
|
|
|
if (intern->u.regex.flags & REGIT_INVERTED) {
|
|
RETVAL_BOOL(Z_TYPE_P(return_value) != IS_TRUE);
|
|
}
|
|
zend_string_release(subject);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto string RegexIterator::getRegex()
|
|
Returns current regular expression */
|
|
SPL_METHOD(RegexIterator, getRegex)
|
|
{
|
|
spl_dual_it_object *intern = Z_SPLDUAL_IT_P(getThis());
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
RETURN_STR_COPY(intern->u.regex.regex);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::getMode()
|
|
Returns current operation mode */
|
|
SPL_METHOD(RegexIterator, getMode)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_LONG(intern->u.regex.mode);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::setMode(int new_mode)
|
|
Set new operation mode */
|
|
SPL_METHOD(RegexIterator, setMode)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_long mode;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "l", &mode) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (mode < 0 || mode >= REGIT_MODE_MAX) {
|
|
zend_throw_exception_ex(spl_ce_InvalidArgumentException, 0, "Illegal mode %pd", mode);
|
|
return;/* NULL */
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
intern->u.regex.mode = mode;
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::getFlags()
|
|
Returns current operation flags */
|
|
SPL_METHOD(RegexIterator, getFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_LONG(intern->u.regex.flags);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::setFlags(int new_flags)
|
|
Set operation flags */
|
|
SPL_METHOD(RegexIterator, setFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_long flags;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "l", &flags) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
intern->u.regex.flags = flags;
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::getFlags()
|
|
Returns current PREG flags (if in use or NULL) */
|
|
SPL_METHOD(RegexIterator, getPregFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (intern->u.regex.use_flags) {
|
|
RETURN_LONG(intern->u.regex.preg_flags);
|
|
} else {
|
|
return;
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RegexIterator::setPregFlags(int new_flags)
|
|
Set PREG flags */
|
|
SPL_METHOD(RegexIterator, setPregFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_long preg_flags;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "l", &preg_flags) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
intern->u.regex.preg_flags = preg_flags;
|
|
intern->u.regex.use_flags = 1;
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void RecursiveRegexIterator::__construct(RecursiveIterator it, string regex [, int mode [, int flags [, int preg_flags]]])
|
|
Create an RecursiveRegexIterator from another recursive iterator and a regular expression */
|
|
SPL_METHOD(RecursiveRegexIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveRegexIterator, spl_ce_RecursiveIterator, DIT_RecursiveRegexIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveRegexIterator RecursiveRegexIterator::getChildren()
|
|
Return the inner iterator's children contained in a RecursiveRegexIterator */
|
|
SPL_METHOD(RecursiveRegexIterator, getChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval retval;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "getchildren", &retval);
|
|
if (!EG(exception)) {
|
|
zval args[5];
|
|
|
|
ZVAL_COPY(&args[0], &retval);
|
|
ZVAL_STR_COPY(&args[1], intern->u.regex.regex);
|
|
ZVAL_LONG(&args[2], intern->u.regex.mode);
|
|
ZVAL_LONG(&args[3], intern->u.regex.flags);
|
|
ZVAL_LONG(&args[4], intern->u.regex.preg_flags);
|
|
|
|
spl_instantiate_arg_n(Z_OBJCE_P(getThis()), return_value, 5, args);
|
|
|
|
zval_ptr_dtor(&args[0]);
|
|
zval_ptr_dtor(&args[1]);
|
|
}
|
|
zval_ptr_dtor(&retval);
|
|
} /* }}} */
|
|
|
|
SPL_METHOD(RecursiveRegexIterator, accept)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (Z_TYPE(intern->current.data) == IS_UNDEF) {
|
|
RETURN_FALSE;
|
|
} else if (Z_TYPE(intern->current.data) == IS_ARRAY) {
|
|
RETURN_BOOL(zend_hash_num_elements(Z_ARRVAL(intern->current.data)) > 0);
|
|
}
|
|
|
|
zend_call_method_with_0_params(getThis(), spl_ce_RegexIterator, NULL, "accept", return_value);
|
|
}
|
|
|
|
#endif
|
|
|
|
/* {{{ spl_dual_it_dtor */
|
|
static void spl_dual_it_dtor(zend_object *_object)
|
|
{
|
|
spl_dual_it_object *object = spl_dual_it_from_obj(_object);
|
|
|
|
/* call standard dtor */
|
|
zend_objects_destroy_object(_object);
|
|
|
|
spl_dual_it_free(object);
|
|
|
|
if (object->inner.iterator) {
|
|
zend_iterator_dtor(object->inner.iterator);
|
|
}
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_dual_it_free_storage */
|
|
static void spl_dual_it_free_storage(zend_object *_object)
|
|
{
|
|
spl_dual_it_object *object = spl_dual_it_from_obj(_object);
|
|
|
|
|
|
if (!Z_ISUNDEF(object->inner.zobject)) {
|
|
zval_ptr_dtor(&object->inner.zobject);
|
|
}
|
|
|
|
if (object->dit_type == DIT_AppendIterator) {
|
|
zend_iterator_dtor(object->u.append.iterator);
|
|
if (Z_TYPE(object->u.append.zarrayit) != IS_UNDEF) {
|
|
zval_ptr_dtor(&object->u.append.zarrayit);
|
|
}
|
|
}
|
|
|
|
if (object->dit_type == DIT_CachingIterator || object->dit_type == DIT_RecursiveCachingIterator) {
|
|
zval_ptr_dtor(&object->u.caching.zcache);
|
|
}
|
|
|
|
#if HAVE_PCRE || HAVE_BUNDLED_PCRE
|
|
if (object->dit_type == DIT_RegexIterator || object->dit_type == DIT_RecursiveRegexIterator) {
|
|
if (object->u.regex.pce) {
|
|
object->u.regex.pce->refcount--;
|
|
}
|
|
if (object->u.regex.regex) {
|
|
zend_string_release(object->u.regex.regex);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
if (object->dit_type == DIT_CallbackFilterIterator || object->dit_type == DIT_RecursiveCallbackFilterIterator) {
|
|
if (object->u.cbfilter) {
|
|
_spl_cbfilter_it_intern *cbfilter = object->u.cbfilter;
|
|
object->u.cbfilter = NULL;
|
|
zval_ptr_dtor(&cbfilter->fci.function_name);
|
|
if (cbfilter->fci.object) {
|
|
OBJ_RELEASE(cbfilter->fci.object);
|
|
}
|
|
efree(cbfilter);
|
|
}
|
|
}
|
|
|
|
zend_object_std_dtor(&object->std);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ spl_dual_it_new */
|
|
static zend_object *spl_dual_it_new(zend_class_entry *class_type)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
intern = ecalloc(1, sizeof(spl_dual_it_object) + zend_object_properties_size(class_type));
|
|
intern->dit_type = DIT_Unknown;
|
|
|
|
zend_object_std_init(&intern->std, class_type);
|
|
object_properties_init(&intern->std, class_type);
|
|
|
|
intern->std.handlers = &spl_handlers_dual_it;
|
|
return &intern->std;
|
|
}
|
|
/* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_filter_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_FilterIterator[] = {
|
|
SPL_ME(FilterIterator, __construct, arginfo_filter_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(FilterIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(FilterIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ABSTRACT_ME(FilterIterator, accept, arginfo_recursive_it_void)
|
|
PHP_FE_END
|
|
};
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_callback_filter_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_ARG_INFO(0, callback)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_CallbackFilterIterator[] = {
|
|
SPL_ME(CallbackFilterIterator, __construct, arginfo_callback_filter_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CallbackFilterIterator, accept, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_recursive_callback_filter_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, RecursiveIterator, 0)
|
|
ZEND_ARG_INFO(0, callback)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveCallbackFilterIterator[] = {
|
|
SPL_ME(RecursiveCallbackFilterIterator, __construct, arginfo_recursive_callback_filter_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveFilterIterator, hasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveCallbackFilterIterator, getChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_parent_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, RecursiveIterator, 0)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveFilterIterator[] = {
|
|
SPL_ME(RecursiveFilterIterator, __construct, arginfo_parent_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveFilterIterator, hasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveFilterIterator, getChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
static const zend_function_entry spl_funcs_ParentIterator[] = {
|
|
SPL_ME(ParentIterator, __construct, arginfo_parent_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_MA(ParentIterator, accept, RecursiveFilterIterator, hasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
#if HAVE_PCRE || HAVE_BUNDLED_PCRE
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_regex_it___construct, 0, 0, 2)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_ARG_INFO(0, regex)
|
|
ZEND_ARG_INFO(0, mode)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_ARG_INFO(0, preg_flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_regex_it_set_mode, 0, 0, 1)
|
|
ZEND_ARG_INFO(0, mode)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_regex_it_set_flags, 0, 0, 1)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_regex_it_set_preg_flags, 0, 0, 1)
|
|
ZEND_ARG_INFO(0, preg_flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RegexIterator[] = {
|
|
SPL_ME(RegexIterator, __construct, arginfo_regex_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, accept, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, getMode, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, setMode, arginfo_regex_it_set_mode, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, getFlags, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, setFlags, arginfo_regex_it_set_flags, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, getPregFlags, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, setPregFlags, arginfo_regex_it_set_preg_flags, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RegexIterator, getRegex, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_rec_regex_it___construct, 0, 0, 2)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, RecursiveIterator, 0)
|
|
ZEND_ARG_INFO(0, regex)
|
|
ZEND_ARG_INFO(0, mode)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_ARG_INFO(0, preg_flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveRegexIterator[] = {
|
|
SPL_ME(RecursiveRegexIterator, __construct, arginfo_rec_regex_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveRegexIterator, accept, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveFilterIterator, hasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveRegexIterator, getChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
#endif
|
|
|
|
static inline int spl_limit_it_valid(spl_dual_it_object *intern)
|
|
{
|
|
/* FAILURE / SUCCESS */
|
|
if (intern->u.limit.count != -1 && intern->current.pos >= intern->u.limit.offset + intern->u.limit.count) {
|
|
return FAILURE;
|
|
} else {
|
|
return spl_dual_it_valid(intern);
|
|
}
|
|
}
|
|
|
|
static inline void spl_limit_it_seek(spl_dual_it_object *intern, zend_long pos)
|
|
{
|
|
zval zpos;
|
|
|
|
spl_dual_it_free(intern);
|
|
if (pos < intern->u.limit.offset) {
|
|
zend_throw_exception_ex(spl_ce_OutOfBoundsException, 0, "Cannot seek to %pd which is below the offset %pd", pos, intern->u.limit.offset);
|
|
return;
|
|
}
|
|
if (pos >= intern->u.limit.offset + intern->u.limit.count && intern->u.limit.count != -1) {
|
|
zend_throw_exception_ex(spl_ce_OutOfBoundsException, 0, "Cannot seek to %pd which is behind offset %pd plus count %pd", pos, intern->u.limit.offset, intern->u.limit.count);
|
|
return;
|
|
}
|
|
if (pos != intern->current.pos && instanceof_function(intern->inner.ce, spl_ce_SeekableIterator)) {
|
|
ZVAL_LONG(&zpos, pos);
|
|
spl_dual_it_free(intern);
|
|
zend_call_method_with_1_params(&intern->inner.zobject, intern->inner.ce, NULL, "seek", NULL, &zpos);
|
|
zval_ptr_dtor(&zpos);
|
|
if (!EG(exception)) {
|
|
intern->current.pos = pos;
|
|
if (spl_limit_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_fetch(intern, 0);
|
|
}
|
|
}
|
|
} else {
|
|
/* emulate the forward seek, by next() calls */
|
|
/* a back ward seek is done by a previous rewind() */
|
|
if (pos < intern->current.pos) {
|
|
spl_dual_it_rewind(intern);
|
|
}
|
|
while (pos > intern->current.pos && spl_dual_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_next(intern, 1);
|
|
}
|
|
if (spl_dual_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_fetch(intern, 1);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* {{{ proto LimitIterator::__construct(Iterator it [, int offset, int count])
|
|
Construct a LimitIterator from an Iterator with a given starting offset and optionally a maximum count */
|
|
SPL_METHOD(LimitIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_LimitIterator, zend_ce_iterator, DIT_LimitIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void LimitIterator::rewind()
|
|
Rewind the iterator to the specified starting offset */
|
|
SPL_METHOD(LimitIterator, rewind)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
spl_dual_it_rewind(intern);
|
|
spl_limit_it_seek(intern, intern->u.limit.offset);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool LimitIterator::valid()
|
|
Check whether the current element is valid */
|
|
SPL_METHOD(LimitIterator, valid)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
/* RETURN_BOOL(spl_limit_it_valid(intern) == SUCCESS);*/
|
|
RETURN_BOOL((intern->u.limit.count == -1 || intern->current.pos < intern->u.limit.offset + intern->u.limit.count) && Z_TYPE(intern->current.data) != IS_UNDEF);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void LimitIterator::next()
|
|
Move the iterator forward */
|
|
SPL_METHOD(LimitIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_dual_it_next(intern, 1);
|
|
if (intern->u.limit.count == -1 || intern->current.pos < intern->u.limit.offset + intern->u.limit.count) {
|
|
spl_dual_it_fetch(intern, 1);
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void LimitIterator::seek(int position)
|
|
Seek to the given position */
|
|
SPL_METHOD(LimitIterator, seek)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_long pos;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "l", &pos) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
spl_limit_it_seek(intern, pos);
|
|
RETURN_LONG(intern->current.pos);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto int LimitIterator::getPosition()
|
|
Return the current position */
|
|
SPL_METHOD(LimitIterator, getPosition)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
RETURN_LONG(intern->current.pos);
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_seekable_it_seek, 0)
|
|
ZEND_ARG_INFO(0, position)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_SeekableIterator[] = {
|
|
SPL_ABSTRACT_ME(SeekableIterator, seek, arginfo_seekable_it_seek)
|
|
PHP_FE_END
|
|
};
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_limit_it___construct, 0, 0, 1)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_ARG_INFO(0, offset)
|
|
ZEND_ARG_INFO(0, count)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_limit_it_seek, 0)
|
|
ZEND_ARG_INFO(0, position)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_LimitIterator[] = {
|
|
SPL_ME(LimitIterator, __construct, arginfo_limit_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(LimitIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(LimitIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(LimitIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(LimitIterator, seek, arginfo_limit_it_seek, ZEND_ACC_PUBLIC)
|
|
SPL_ME(LimitIterator, getPosition, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
static inline int spl_caching_it_valid(spl_dual_it_object *intern)
|
|
{
|
|
return intern->u.caching.flags & CIT_VALID ? SUCCESS : FAILURE;
|
|
}
|
|
|
|
static inline int spl_caching_it_has_next(spl_dual_it_object *intern)
|
|
{
|
|
return spl_dual_it_valid(intern);
|
|
}
|
|
|
|
static inline void spl_caching_it_next(spl_dual_it_object *intern)
|
|
{
|
|
if (spl_dual_it_fetch(intern, 1) == SUCCESS) {
|
|
intern->u.caching.flags |= CIT_VALID;
|
|
/* Full cache ? */
|
|
if (intern->u.caching.flags & CIT_FULL_CACHE) {
|
|
zval *key = &intern->current.key;
|
|
zval *data = &intern->current.data;
|
|
|
|
ZVAL_DEREF(data);
|
|
Z_TRY_ADDREF_P(data);
|
|
array_set_zval_key(Z_ARRVAL(intern->u.caching.zcache), key, data);
|
|
zval_ptr_dtor(data);
|
|
}
|
|
/* Recursion ? */
|
|
if (intern->dit_type == DIT_RecursiveCachingIterator) {
|
|
zval retval, zchildren, zflags;
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "haschildren", &retval);
|
|
if (EG(exception)) {
|
|
zval_ptr_dtor(&retval);
|
|
if (intern->u.caching.flags & CIT_CATCH_GET_CHILD) {
|
|
zend_clear_exception();
|
|
} else {
|
|
return;
|
|
}
|
|
} else {
|
|
if (zend_is_true(&retval)) {
|
|
zend_call_method_with_0_params(&intern->inner.zobject, intern->inner.ce, NULL, "getchildren", &zchildren);
|
|
if (EG(exception)) {
|
|
zval_ptr_dtor(&zchildren);
|
|
if (intern->u.caching.flags & CIT_CATCH_GET_CHILD) {
|
|
zend_clear_exception();
|
|
} else {
|
|
zval_ptr_dtor(&retval);
|
|
return;
|
|
}
|
|
} else {
|
|
ZVAL_LONG(&zflags, intern->u.caching.flags & CIT_PUBLIC);
|
|
spl_instantiate_arg_ex2(spl_ce_RecursiveCachingIterator, &intern->u.caching.zchildren, &zchildren, &zflags);
|
|
zval_ptr_dtor(&zchildren);
|
|
}
|
|
}
|
|
zval_ptr_dtor(&retval);
|
|
if (EG(exception)) {
|
|
if (intern->u.caching.flags & CIT_CATCH_GET_CHILD) {
|
|
zend_clear_exception();
|
|
} else {
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (intern->u.caching.flags & (CIT_TOSTRING_USE_INNER|CIT_CALL_TOSTRING)) {
|
|
int use_copy;
|
|
zval expr_copy;
|
|
if (intern->u.caching.flags & CIT_TOSTRING_USE_INNER) {
|
|
ZVAL_COPY_VALUE(&intern->u.caching.zstr, &intern->inner.zobject);
|
|
} else {
|
|
ZVAL_COPY_VALUE(&intern->u.caching.zstr, &intern->current.data);
|
|
}
|
|
use_copy = zend_make_printable_zval(&intern->u.caching.zstr, &expr_copy);
|
|
if (use_copy) {
|
|
ZVAL_COPY_VALUE(&intern->u.caching.zstr, &expr_copy);
|
|
} else if (Z_REFCOUNTED(intern->u.caching.zstr)) {
|
|
Z_ADDREF(intern->u.caching.zstr);
|
|
}
|
|
}
|
|
spl_dual_it_next(intern, 0);
|
|
} else {
|
|
intern->u.caching.flags &= ~CIT_VALID;
|
|
}
|
|
}
|
|
|
|
static inline void spl_caching_it_rewind(spl_dual_it_object *intern)
|
|
{
|
|
spl_dual_it_rewind(intern);
|
|
zend_hash_clean(Z_ARRVAL(intern->u.caching.zcache));
|
|
spl_caching_it_next(intern);
|
|
}
|
|
|
|
/* {{{ proto void CachingIterator::__construct(Iterator it [, flags = CIT_CALL_TOSTRING])
|
|
Construct a CachingIterator from an Iterator */
|
|
SPL_METHOD(CachingIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_CachingIterator, zend_ce_iterator, DIT_CachingIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::rewind()
|
|
Rewind the iterator */
|
|
SPL_METHOD(CachingIterator, rewind)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_caching_it_rewind(intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool CachingIterator::valid()
|
|
Check whether the current element is valid */
|
|
SPL_METHOD(CachingIterator, valid)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_BOOL(spl_caching_it_valid(intern) == SUCCESS);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::next()
|
|
Move the iterator forward */
|
|
SPL_METHOD(CachingIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_caching_it_next(intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool CachingIterator::hasNext()
|
|
Check whether the inner iterator has a valid next element */
|
|
SPL_METHOD(CachingIterator, hasNext)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_BOOL(spl_caching_it_has_next(intern) == SUCCESS);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto string CachingIterator::__toString()
|
|
Return the string representation of the current element */
|
|
SPL_METHOD(CachingIterator, __toString)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & (CIT_CALL_TOSTRING|CIT_TOSTRING_USE_KEY|CIT_TOSTRING_USE_CURRENT|CIT_TOSTRING_USE_INNER))) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s does not fetch string value (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
if (intern->u.caching.flags & CIT_TOSTRING_USE_KEY) {
|
|
ZVAL_COPY(return_value, &intern->current.key);
|
|
convert_to_string(return_value);
|
|
return;
|
|
} else if (intern->u.caching.flags & CIT_TOSTRING_USE_CURRENT) {
|
|
ZVAL_COPY(return_value, &intern->current.data);
|
|
convert_to_string(return_value);
|
|
return;
|
|
}
|
|
if (Z_TYPE(intern->u.caching.zstr) == IS_STRING) {
|
|
RETURN_STR_COPY(Z_STR_P(&intern->u.caching.zstr));
|
|
} else {
|
|
RETURN_EMPTY_STRING();
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::offsetSet(mixed index, mixed newval)
|
|
Set given index in cache */
|
|
SPL_METHOD(CachingIterator, offsetSet)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_string *key;
|
|
zval *value;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "Sz", &key, &value) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (Z_REFCOUNTED_P(value)) {
|
|
Z_ADDREF_P(value);
|
|
}
|
|
zend_symtable_update(Z_ARRVAL(intern->u.caching.zcache), key, value);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto string CachingIterator::offsetGet(mixed index)
|
|
Return the internal cache if used */
|
|
SPL_METHOD(CachingIterator, offsetGet)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_string *key;
|
|
zval *value;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "S", &key) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if ((value = zend_symtable_find(Z_ARRVAL(intern->u.caching.zcache), key)) == NULL) {
|
|
zend_error(E_NOTICE, "Undefined index: %s", ZSTR_VAL(key));
|
|
return;
|
|
}
|
|
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::offsetUnset(mixed index)
|
|
Unset given index in cache */
|
|
SPL_METHOD(CachingIterator, offsetUnset)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_string *key;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "S", &key) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
zend_symtable_del(Z_ARRVAL(intern->u.caching.zcache), key);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto bool CachingIterator::offsetExists(mixed index)
|
|
Return whether the requested index exists */
|
|
SPL_METHOD(CachingIterator, offsetExists)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_string *key;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%s does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "S", &key) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
RETURN_BOOL(zend_symtable_exists(Z_ARRVAL(intern->u.caching.zcache), key));
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto bool CachingIterator::getCache()
|
|
Return the cache */
|
|
SPL_METHOD(CachingIterator, getCache)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%v does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
ZVAL_COPY(return_value, &intern->u.caching.zcache);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto int CachingIterator::getFlags()
|
|
Return the internal flags */
|
|
SPL_METHOD(CachingIterator, getFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_LONG(intern->u.caching.flags);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::setFlags(int flags)
|
|
Set the internal flags */
|
|
SPL_METHOD(CachingIterator, setFlags)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zend_long flags;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "l", &flags) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
if (spl_cit_check_flags(flags) != SUCCESS) {
|
|
zend_throw_exception(spl_ce_InvalidArgumentException , "Flags must contain only one of CALL_TOSTRING, TOSTRING_USE_KEY, TOSTRING_USE_CURRENT, TOSTRING_USE_INNER", 0);
|
|
return;
|
|
}
|
|
if ((intern->u.caching.flags & CIT_CALL_TOSTRING) != 0 && (flags & CIT_CALL_TOSTRING) == 0) {
|
|
zend_throw_exception(spl_ce_InvalidArgumentException, "Unsetting flag CALL_TO_STRING is not possible", 0);
|
|
return;
|
|
}
|
|
if ((intern->u.caching.flags & CIT_TOSTRING_USE_INNER) != 0 && (flags & CIT_TOSTRING_USE_INNER) == 0) {
|
|
zend_throw_exception(spl_ce_InvalidArgumentException, "Unsetting flag TOSTRING_USE_INNER is not possible", 0);
|
|
return;
|
|
}
|
|
if ((flags & CIT_FULL_CACHE) != 0 && (intern->u.caching.flags & CIT_FULL_CACHE) == 0) {
|
|
/* clear on (re)enable */
|
|
zend_hash_clean(Z_ARRVAL(intern->u.caching.zcache));
|
|
}
|
|
intern->u.caching.flags = (intern->u.caching.flags & ~CIT_PUBLIC) | (flags & CIT_PUBLIC);
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto void CachingIterator::count()
|
|
Number of cached elements */
|
|
SPL_METHOD(CachingIterator, count)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (!(intern->u.caching.flags & CIT_FULL_CACHE)) {
|
|
zend_throw_exception_ex(spl_ce_BadMethodCallException, 0, "%v does not use a full cache (see CachingIterator::__construct)", ZSTR_VAL(Z_OBJCE_P(getThis())->name));
|
|
return;
|
|
}
|
|
|
|
RETURN_LONG(zend_hash_num_elements(Z_ARRVAL(intern->u.caching.zcache)));
|
|
}
|
|
/* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_caching_it___construct, 0, 0, 1)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_caching_it_setFlags, 0)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_caching_it_offsetGet, 0)
|
|
ZEND_ARG_INFO(0, index)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_caching_it_offsetSet, 0)
|
|
ZEND_ARG_INFO(0, index)
|
|
ZEND_ARG_INFO(0, newval)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_CachingIterator[] = {
|
|
SPL_ME(CachingIterator, __construct, arginfo_caching_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, hasNext, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, __toString, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, getFlags, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, setFlags, arginfo_caching_it_setFlags, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, offsetGet, arginfo_caching_it_offsetGet, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, offsetSet, arginfo_caching_it_offsetSet, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, offsetUnset, arginfo_caching_it_offsetGet, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, offsetExists, arginfo_caching_it_offsetGet, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, getCache, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(CachingIterator, count, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ proto void RecursiveCachingIterator::__construct(RecursiveIterator it [, flags = CIT_CALL_TOSTRING])
|
|
Create an iterator from a RecursiveIterator */
|
|
SPL_METHOD(RecursiveCachingIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_RecursiveCachingIterator, spl_ce_RecursiveIterator, DIT_RecursiveCachingIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool RecursiveCachingIterator::hasChildren()
|
|
Check whether the current element of the inner iterator has children */
|
|
SPL_METHOD(RecursiveCachingIterator, hasChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_BOOL(Z_TYPE(intern->u.caching.zchildren) != IS_UNDEF);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto RecursiveCachingIterator RecursiveCachingIterator::getChildren()
|
|
Return the inner iterator's children as a RecursiveCachingIterator */
|
|
SPL_METHOD(RecursiveCachingIterator, getChildren)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (Z_TYPE(intern->u.caching.zchildren) != IS_UNDEF) {
|
|
zval *value = &intern->u.caching.zchildren;
|
|
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO_EX(arginfo_caching_rec_it___construct, 0, ZEND_RETURN_VALUE, 1)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_ARG_INFO(0, flags)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_RecursiveCachingIterator[] = {
|
|
SPL_ME(RecursiveCachingIterator, __construct, arginfo_caching_rec_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveCachingIterator, hasChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(RecursiveCachingIterator, getChildren, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ proto void IteratorIterator::__construct(Traversable it)
|
|
Create an iterator from anything that is traversable */
|
|
SPL_METHOD(IteratorIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_IteratorIterator, zend_ce_traversable, DIT_IteratorIterator);
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_iterator_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Traversable, 0)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_IteratorIterator[] = {
|
|
SPL_ME(IteratorIterator, __construct, arginfo_iterator_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ proto void NoRewindIterator::__construct(Iterator it)
|
|
Create an iterator from another iterator */
|
|
SPL_METHOD(NoRewindIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_NoRewindIterator, zend_ce_iterator, DIT_NoRewindIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void NoRewindIterator::rewind()
|
|
Prevent a call to inner iterators rewind() */
|
|
SPL_METHOD(NoRewindIterator, rewind)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
/* nothing to do */
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool NoRewindIterator::valid()
|
|
Return inner iterators valid() */
|
|
SPL_METHOD(NoRewindIterator, valid)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
RETURN_BOOL(intern->inner.iterator->funcs->valid(intern->inner.iterator) == SUCCESS);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed NoRewindIterator::key()
|
|
Return inner iterators key() */
|
|
SPL_METHOD(NoRewindIterator, key)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (intern->inner.iterator->funcs->get_current_key) {
|
|
intern->inner.iterator->funcs->get_current_key(intern->inner.iterator, return_value);
|
|
} else {
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto mixed NoRewindIterator::current()
|
|
Return inner iterators current() */
|
|
SPL_METHOD(NoRewindIterator, current)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval *data;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
data = intern->inner.iterator->funcs->get_current_data(intern->inner.iterator);
|
|
if (data) {
|
|
ZVAL_DEREF(data);
|
|
ZVAL_COPY(return_value, data);
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void NoRewindIterator::next()
|
|
Return inner iterators next() */
|
|
SPL_METHOD(NoRewindIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
intern->inner.iterator->funcs->move_forward(intern->inner.iterator);
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_norewind_it___construct, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_NoRewindIterator[] = {
|
|
SPL_ME(NoRewindIterator, __construct, arginfo_norewind_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(NoRewindIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(NoRewindIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(NoRewindIterator, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(NoRewindIterator, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(NoRewindIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ proto void InfiniteIterator::__construct(Iterator it)
|
|
Create an iterator from another iterator */
|
|
SPL_METHOD(InfiniteIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_InfiniteIterator, zend_ce_iterator, DIT_InfiniteIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void InfiniteIterator::next()
|
|
Prevent a call to inner iterators rewind() (internally the current data will be fetched if valid()) */
|
|
SPL_METHOD(InfiniteIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_dual_it_next(intern, 1);
|
|
if (spl_dual_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_fetch(intern, 0);
|
|
} else {
|
|
spl_dual_it_rewind(intern);
|
|
if (spl_dual_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_fetch(intern, 0);
|
|
}
|
|
}
|
|
} /* }}} */
|
|
|
|
static const zend_function_entry spl_funcs_InfiniteIterator[] = {
|
|
SPL_ME(InfiniteIterator, __construct, arginfo_norewind_it___construct, ZEND_ACC_PUBLIC)
|
|
SPL_ME(InfiniteIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ proto void EmptyIterator::rewind()
|
|
Does nothing */
|
|
SPL_METHOD(EmptyIterator, rewind)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto false EmptyIterator::valid()
|
|
Return false */
|
|
SPL_METHOD(EmptyIterator, valid)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
RETURN_FALSE;
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void EmptyIterator::key()
|
|
Throws exception BadMethodCallException */
|
|
SPL_METHOD(EmptyIterator, key)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
zend_throw_exception(spl_ce_BadMethodCallException, "Accessing the key of an EmptyIterator", 0);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void EmptyIterator::current()
|
|
Throws exception BadMethodCallException */
|
|
SPL_METHOD(EmptyIterator, current)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
zend_throw_exception(spl_ce_BadMethodCallException, "Accessing the value of an EmptyIterator", 0);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void EmptyIterator::next()
|
|
Does nothing */
|
|
SPL_METHOD(EmptyIterator, next)
|
|
{
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
} /* }}} */
|
|
|
|
static const zend_function_entry spl_funcs_EmptyIterator[] = {
|
|
SPL_ME(EmptyIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(EmptyIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(EmptyIterator, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(EmptyIterator, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(EmptyIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
int spl_append_it_next_iterator(spl_dual_it_object *intern) /* {{{*/
|
|
{
|
|
spl_dual_it_free(intern);
|
|
|
|
if (!Z_ISUNDEF(intern->inner.zobject)) {
|
|
zval_ptr_dtor(&intern->inner.zobject);
|
|
ZVAL_UNDEF(&intern->inner.zobject);
|
|
intern->inner.ce = NULL;
|
|
if (intern->inner.iterator) {
|
|
zend_iterator_dtor(intern->inner.iterator);
|
|
intern->inner.iterator = NULL;
|
|
}
|
|
}
|
|
if (intern->u.append.iterator->funcs->valid(intern->u.append.iterator) == SUCCESS) {
|
|
zval *it;
|
|
|
|
it = intern->u.append.iterator->funcs->get_current_data(intern->u.append.iterator);
|
|
ZVAL_COPY(&intern->inner.zobject, it);
|
|
intern->inner.ce = Z_OBJCE_P(it);
|
|
intern->inner.iterator = intern->inner.ce->get_iterator(intern->inner.ce, it, 0);
|
|
spl_dual_it_rewind(intern);
|
|
return SUCCESS;
|
|
} else {
|
|
return FAILURE;
|
|
}
|
|
} /* }}} */
|
|
|
|
void spl_append_it_fetch(spl_dual_it_object *intern) /* {{{*/
|
|
{
|
|
while (spl_dual_it_valid(intern) != SUCCESS) {
|
|
intern->u.append.iterator->funcs->move_forward(intern->u.append.iterator);
|
|
if (spl_append_it_next_iterator(intern) != SUCCESS) {
|
|
return;
|
|
}
|
|
}
|
|
spl_dual_it_fetch(intern, 0);
|
|
} /* }}} */
|
|
|
|
void spl_append_it_next(spl_dual_it_object *intern) /* {{{ */
|
|
{
|
|
if (spl_dual_it_valid(intern) == SUCCESS) {
|
|
spl_dual_it_next(intern, 1);
|
|
}
|
|
spl_append_it_fetch(intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void AppendIterator::__construct()
|
|
Create an AppendIterator */
|
|
SPL_METHOD(AppendIterator, __construct)
|
|
{
|
|
spl_dual_it_construct(INTERNAL_FUNCTION_PARAM_PASSTHRU, spl_ce_AppendIterator, zend_ce_iterator, DIT_AppendIterator);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void AppendIterator::append(Iterator it)
|
|
Append an iterator */
|
|
SPL_METHOD(AppendIterator, append)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval *it;
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
if (zend_parse_parameters_ex(ZEND_PARSE_PARAMS_QUIET, ZEND_NUM_ARGS(), "O", &it, zend_ce_iterator) == FAILURE) {
|
|
return;
|
|
}
|
|
spl_array_iterator_append(&intern->u.append.zarrayit, it);
|
|
|
|
if (!intern->inner.iterator || spl_dual_it_valid(intern) != SUCCESS) {
|
|
if (intern->u.append.iterator->funcs->valid(intern->u.append.iterator) != SUCCESS) {
|
|
intern->u.append.iterator->funcs->rewind(intern->u.append.iterator);
|
|
}
|
|
do {
|
|
spl_append_it_next_iterator(intern);
|
|
} while (Z_OBJ(intern->inner.zobject) != Z_OBJ_P(it));
|
|
spl_append_it_fetch(intern);
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void AppendIterator::rewind()
|
|
Rewind to the first iterator and rewind the first iterator, too */
|
|
SPL_METHOD(AppendIterator, rewind)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
intern->u.append.iterator->funcs->rewind(intern->u.append.iterator);
|
|
if (spl_append_it_next_iterator(intern) == SUCCESS) {
|
|
spl_append_it_fetch(intern);
|
|
}
|
|
} /* }}} */
|
|
|
|
/* {{{ proto bool AppendIterator::valid()
|
|
Check if the current state is valid */
|
|
SPL_METHOD(AppendIterator, valid)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
RETURN_BOOL(Z_TYPE(intern->current.data) != IS_UNDEF);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto void AppendIterator::next()
|
|
Forward to next element */
|
|
SPL_METHOD(AppendIterator, next)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
spl_append_it_next(intern);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto int AppendIterator::getIteratorIndex()
|
|
Get index of iterator */
|
|
SPL_METHOD(AppendIterator, getIteratorIndex)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
APPENDIT_CHECK_CTOR(intern);
|
|
spl_array_iterator_key(&intern->u.append.zarrayit, return_value);
|
|
} /* }}} */
|
|
|
|
/* {{{ proto ArrayIterator AppendIterator::getArrayIterator()
|
|
Get access to inner ArrayIterator */
|
|
SPL_METHOD(AppendIterator, getArrayIterator)
|
|
{
|
|
spl_dual_it_object *intern;
|
|
zval *value;
|
|
|
|
if (zend_parse_parameters_none() == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
SPL_FETCH_AND_CHECK_DUAL_IT(intern, getThis());
|
|
|
|
value = &intern->u.append.zarrayit;
|
|
ZVAL_DEREF(value);
|
|
ZVAL_COPY(return_value, value);
|
|
} /* }}} */
|
|
|
|
ZEND_BEGIN_ARG_INFO(arginfo_append_it_append, 0)
|
|
ZEND_ARG_OBJ_INFO(0, iterator, Iterator, 0)
|
|
ZEND_END_ARG_INFO();
|
|
|
|
static const zend_function_entry spl_funcs_AppendIterator[] = {
|
|
SPL_ME(AppendIterator, __construct, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, append, arginfo_append_it_append, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, rewind, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, valid, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, key, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, current, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, next, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(dual_it, getInnerIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, getIteratorIndex, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
SPL_ME(AppendIterator, getArrayIterator, arginfo_recursive_it_void, ZEND_ACC_PUBLIC)
|
|
PHP_FE_END
|
|
};
|
|
|
|
PHPAPI int spl_iterator_apply(zval *obj, spl_iterator_apply_func_t apply_func, void *puser)
|
|
{
|
|
zend_object_iterator *iter;
|
|
zend_class_entry *ce = Z_OBJCE_P(obj);
|
|
|
|
iter = ce->get_iterator(ce, obj, 0);
|
|
|
|
if (EG(exception)) {
|
|
goto done;
|
|
}
|
|
|
|
iter->index = 0;
|
|
if (iter->funcs->rewind) {
|
|
iter->funcs->rewind(iter);
|
|
if (EG(exception)) {
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
while (iter->funcs->valid(iter) == SUCCESS) {
|
|
if (EG(exception)) {
|
|
goto done;
|
|
}
|
|
if (apply_func(iter, puser) == ZEND_HASH_APPLY_STOP || EG(exception)) {
|
|
goto done;
|
|
}
|
|
iter->index++;
|
|
iter->funcs->move_forward(iter);
|
|
if (EG(exception)) {
|
|
goto done;
|
|
}
|
|
}
|
|
|
|
done:
|
|
if (iter) {
|
|
zend_iterator_dtor(iter);
|
|
}
|
|
return EG(exception) ? FAILURE : SUCCESS;
|
|
}
|
|
/* }}} */
|
|
|
|
static int spl_iterator_to_array_apply(zend_object_iterator *iter, void *puser) /* {{{ */
|
|
{
|
|
zval *data, *return_value = (zval*)puser;
|
|
|
|
data = iter->funcs->get_current_data(iter);
|
|
if (EG(exception)) {
|
|
return ZEND_HASH_APPLY_STOP;
|
|
}
|
|
if (data == NULL) {
|
|
return ZEND_HASH_APPLY_STOP;
|
|
}
|
|
if (iter->funcs->get_current_key) {
|
|
zval key;
|
|
iter->funcs->get_current_key(iter, &key);
|
|
if (EG(exception)) {
|
|
return ZEND_HASH_APPLY_STOP;
|
|
}
|
|
array_set_zval_key(Z_ARRVAL_P(return_value), &key, data);
|
|
zval_ptr_dtor(&key);
|
|
} else {
|
|
Z_TRY_ADDREF_P(data);
|
|
add_next_index_zval(return_value, data);
|
|
}
|
|
return ZEND_HASH_APPLY_KEEP;
|
|
}
|
|
/* }}} */
|
|
|
|
static int spl_iterator_to_values_apply(zend_object_iterator *iter, void *puser) /* {{{ */
|
|
{
|
|
zval *data, *return_value = (zval*)puser;
|
|
|
|
data = iter->funcs->get_current_data(iter);
|
|
if (EG(exception)) {
|
|
return ZEND_HASH_APPLY_STOP;
|
|
}
|
|
if (data == NULL) {
|
|
return ZEND_HASH_APPLY_STOP;
|
|
}
|
|
if (Z_REFCOUNTED_P(data)) {
|
|
Z_ADDREF_P(data);
|
|
}
|
|
add_next_index_zval(return_value, data);
|
|
return ZEND_HASH_APPLY_KEEP;
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto array iterator_to_array(Traversable it [, bool use_keys = true])
|
|
Copy the iterator into an array */
|
|
PHP_FUNCTION(iterator_to_array)
|
|
{
|
|
zval *obj;
|
|
zend_bool use_keys = 1;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "O|b", &obj, zend_ce_traversable, &use_keys) == FAILURE) {
|
|
RETURN_FALSE;
|
|
}
|
|
|
|
array_init(return_value);
|
|
|
|
if (spl_iterator_apply(obj, use_keys ? spl_iterator_to_array_apply : spl_iterator_to_values_apply, (void*)return_value) != SUCCESS) {
|
|
zval_ptr_dtor(return_value);
|
|
RETURN_NULL();
|
|
}
|
|
} /* }}} */
|
|
|
|
static int spl_iterator_count_apply(zend_object_iterator *iter, void *puser) /* {{{ */
|
|
{
|
|
(*(zend_long*)puser)++;
|
|
return ZEND_HASH_APPLY_KEEP;
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto int iterator_count(Traversable it)
|
|
Count the elements in an iterator */
|
|
PHP_FUNCTION(iterator_count)
|
|
{
|
|
zval *obj;
|
|
zend_long count = 0;
|
|
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "O", &obj, zend_ce_traversable) == FAILURE) {
|
|
RETURN_FALSE;
|
|
}
|
|
|
|
if (spl_iterator_apply(obj, spl_iterator_count_apply, (void*)&count) == SUCCESS) {
|
|
RETURN_LONG(count);
|
|
}
|
|
}
|
|
/* }}} */
|
|
|
|
typedef struct {
|
|
zval *obj;
|
|
zval *args;
|
|
zend_long count;
|
|
zend_fcall_info fci;
|
|
zend_fcall_info_cache fcc;
|
|
} spl_iterator_apply_info;
|
|
|
|
static int spl_iterator_func_apply(zend_object_iterator *iter, void *puser) /* {{{ */
|
|
{
|
|
zval retval;
|
|
spl_iterator_apply_info *apply_info = (spl_iterator_apply_info*)puser;
|
|
int result;
|
|
|
|
apply_info->count++;
|
|
zend_fcall_info_call(&apply_info->fci, &apply_info->fcc, &retval, NULL);
|
|
if (Z_TYPE(retval) != IS_UNDEF) {
|
|
result = zend_is_true(&retval) ? ZEND_HASH_APPLY_KEEP : ZEND_HASH_APPLY_STOP;
|
|
zval_ptr_dtor(&retval);
|
|
} else {
|
|
result = ZEND_HASH_APPLY_STOP;
|
|
}
|
|
return result;
|
|
}
|
|
/* }}} */
|
|
|
|
/* {{{ proto int iterator_apply(Traversable it, mixed function [, mixed params])
|
|
Calls a function for every element in an iterator */
|
|
PHP_FUNCTION(iterator_apply)
|
|
{
|
|
spl_iterator_apply_info apply_info;
|
|
|
|
apply_info.args = NULL;
|
|
if (zend_parse_parameters(ZEND_NUM_ARGS(), "Of|a!", &apply_info.obj, zend_ce_traversable, &apply_info.fci, &apply_info.fcc, &apply_info.args) == FAILURE) {
|
|
return;
|
|
}
|
|
|
|
apply_info.count = 0;
|
|
zend_fcall_info_args(&apply_info.fci, apply_info.args);
|
|
if (spl_iterator_apply(apply_info.obj, spl_iterator_func_apply, (void*)&apply_info) == SUCCESS) {
|
|
RETVAL_LONG(apply_info.count);
|
|
} else {
|
|
RETVAL_FALSE;
|
|
}
|
|
zend_fcall_info_args(&apply_info.fci, NULL);
|
|
}
|
|
/* }}} */
|
|
|
|
static const zend_function_entry spl_funcs_OuterIterator[] = {
|
|
SPL_ABSTRACT_ME(OuterIterator, getInnerIterator, arginfo_recursive_it_void)
|
|
PHP_FE_END
|
|
};
|
|
|
|
static const zend_function_entry spl_funcs_Countable[] = {
|
|
SPL_ABSTRACT_ME(Countable, count, arginfo_recursive_it_void)
|
|
PHP_FE_END
|
|
};
|
|
|
|
/* {{{ PHP_MINIT_FUNCTION(spl_iterators)
|
|
*/
|
|
PHP_MINIT_FUNCTION(spl_iterators)
|
|
{
|
|
REGISTER_SPL_INTERFACE(RecursiveIterator);
|
|
REGISTER_SPL_ITERATOR(RecursiveIterator);
|
|
|
|
REGISTER_SPL_STD_CLASS_EX(RecursiveIteratorIterator, spl_RecursiveIteratorIterator_new, spl_funcs_RecursiveIteratorIterator);
|
|
REGISTER_SPL_ITERATOR(RecursiveIteratorIterator);
|
|
|
|
memcpy(&spl_handlers_rec_it_it, zend_get_std_object_handlers(), sizeof(zend_object_handlers));
|
|
spl_handlers_rec_it_it.offset = XtOffsetOf(spl_recursive_it_object, std);
|
|
spl_handlers_rec_it_it.get_method = spl_recursive_it_get_method;
|
|
spl_handlers_rec_it_it.clone_obj = NULL;
|
|
spl_handlers_rec_it_it.dtor_obj = spl_RecursiveIteratorIterator_dtor;
|
|
spl_handlers_rec_it_it.free_obj = spl_RecursiveIteratorIterator_free_storage;
|
|
|
|
memcpy(&spl_handlers_dual_it, zend_get_std_object_handlers(), sizeof(zend_object_handlers));
|
|
spl_handlers_dual_it.offset = XtOffsetOf(spl_dual_it_object, std);
|
|
spl_handlers_dual_it.get_method = spl_dual_it_get_method;
|
|
/*spl_handlers_dual_it.call_method = spl_dual_it_call_method;*/
|
|
spl_handlers_dual_it.clone_obj = NULL;
|
|
spl_handlers_dual_it.dtor_obj = spl_dual_it_dtor;
|
|
spl_handlers_dual_it.free_obj = spl_dual_it_free_storage;
|
|
|
|
spl_ce_RecursiveIteratorIterator->get_iterator = spl_recursive_it_get_iterator;
|
|
spl_ce_RecursiveIteratorIterator->iterator_funcs.funcs = &spl_recursive_it_iterator_funcs;
|
|
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveIteratorIterator, "LEAVES_ONLY", RIT_LEAVES_ONLY);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveIteratorIterator, "SELF_FIRST", RIT_SELF_FIRST);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveIteratorIterator, "CHILD_FIRST", RIT_CHILD_FIRST);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveIteratorIterator, "CATCH_GET_CHILD", RIT_CATCH_GET_CHILD);
|
|
|
|
REGISTER_SPL_INTERFACE(OuterIterator);
|
|
REGISTER_SPL_ITERATOR(OuterIterator);
|
|
|
|
REGISTER_SPL_STD_CLASS_EX(IteratorIterator, spl_dual_it_new, spl_funcs_IteratorIterator);
|
|
REGISTER_SPL_ITERATOR(IteratorIterator);
|
|
REGISTER_SPL_IMPLEMENTS(IteratorIterator, OuterIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(FilterIterator, IteratorIterator, spl_dual_it_new, spl_funcs_FilterIterator);
|
|
spl_ce_FilterIterator->ce_flags |= ZEND_ACC_EXPLICIT_ABSTRACT_CLASS;
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(RecursiveFilterIterator, FilterIterator, spl_dual_it_new, spl_funcs_RecursiveFilterIterator);
|
|
REGISTER_SPL_IMPLEMENTS(RecursiveFilterIterator, RecursiveIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(CallbackFilterIterator, FilterIterator, spl_dual_it_new, spl_funcs_CallbackFilterIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(RecursiveCallbackFilterIterator, CallbackFilterIterator, spl_dual_it_new, spl_funcs_RecursiveCallbackFilterIterator);
|
|
REGISTER_SPL_IMPLEMENTS(RecursiveCallbackFilterIterator, RecursiveIterator);
|
|
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(ParentIterator, RecursiveFilterIterator, spl_dual_it_new, spl_funcs_ParentIterator);
|
|
|
|
REGISTER_SPL_INTERFACE(Countable);
|
|
REGISTER_SPL_INTERFACE(SeekableIterator);
|
|
REGISTER_SPL_ITERATOR(SeekableIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(LimitIterator, IteratorIterator, spl_dual_it_new, spl_funcs_LimitIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(CachingIterator, IteratorIterator, spl_dual_it_new, spl_funcs_CachingIterator);
|
|
REGISTER_SPL_IMPLEMENTS(CachingIterator, ArrayAccess);
|
|
REGISTER_SPL_IMPLEMENTS(CachingIterator, Countable);
|
|
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "CALL_TOSTRING", CIT_CALL_TOSTRING);
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "CATCH_GET_CHILD", CIT_CATCH_GET_CHILD);
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "TOSTRING_USE_KEY", CIT_TOSTRING_USE_KEY);
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "TOSTRING_USE_CURRENT", CIT_TOSTRING_USE_CURRENT);
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "TOSTRING_USE_INNER", CIT_TOSTRING_USE_INNER);
|
|
REGISTER_SPL_CLASS_CONST_LONG(CachingIterator, "FULL_CACHE", CIT_FULL_CACHE);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(RecursiveCachingIterator, CachingIterator, spl_dual_it_new, spl_funcs_RecursiveCachingIterator);
|
|
REGISTER_SPL_IMPLEMENTS(RecursiveCachingIterator, RecursiveIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(NoRewindIterator, IteratorIterator, spl_dual_it_new, spl_funcs_NoRewindIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(AppendIterator, IteratorIterator, spl_dual_it_new, spl_funcs_AppendIterator);
|
|
|
|
REGISTER_SPL_IMPLEMENTS(RecursiveIteratorIterator, OuterIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(InfiniteIterator, IteratorIterator, spl_dual_it_new, spl_funcs_InfiniteIterator);
|
|
#if HAVE_PCRE || HAVE_BUNDLED_PCRE
|
|
REGISTER_SPL_SUB_CLASS_EX(RegexIterator, FilterIterator, spl_dual_it_new, spl_funcs_RegexIterator);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "USE_KEY", REGIT_USE_KEY);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "INVERT_MATCH",REGIT_INVERTED);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "MATCH", REGIT_MODE_MATCH);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "GET_MATCH", REGIT_MODE_GET_MATCH);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "ALL_MATCHES", REGIT_MODE_ALL_MATCHES);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "SPLIT", REGIT_MODE_SPLIT);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RegexIterator, "REPLACE", REGIT_MODE_REPLACE);
|
|
REGISTER_SPL_PROPERTY(RegexIterator, "replacement", 0);
|
|
REGISTER_SPL_SUB_CLASS_EX(RecursiveRegexIterator, RegexIterator, spl_dual_it_new, spl_funcs_RecursiveRegexIterator);
|
|
REGISTER_SPL_IMPLEMENTS(RecursiveRegexIterator, RecursiveIterator);
|
|
#else
|
|
spl_ce_RegexIterator = NULL;
|
|
spl_ce_RecursiveRegexIterator = NULL;
|
|
#endif
|
|
|
|
REGISTER_SPL_STD_CLASS_EX(EmptyIterator, NULL, spl_funcs_EmptyIterator);
|
|
REGISTER_SPL_ITERATOR(EmptyIterator);
|
|
|
|
REGISTER_SPL_SUB_CLASS_EX(RecursiveTreeIterator, RecursiveIteratorIterator, spl_RecursiveTreeIterator_new, spl_funcs_RecursiveTreeIterator);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "BYPASS_CURRENT", RTIT_BYPASS_CURRENT);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "BYPASS_KEY", RTIT_BYPASS_KEY);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_LEFT", 0);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_MID_HAS_NEXT", 1);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_MID_LAST", 2);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_END_HAS_NEXT", 3);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_END_LAST", 4);
|
|
REGISTER_SPL_CLASS_CONST_LONG(RecursiveTreeIterator, "PREFIX_RIGHT", 5);
|
|
|
|
return SUCCESS;
|
|
}
|
|
/* }}} */
|
|
|
|
/*
|
|
* Local variables:
|
|
* tab-width: 4
|
|
* c-basic-offset: 4
|
|
* End:
|
|
* vim600: fdm=marker
|
|
* vim: noet sw=4 ts=4
|
|
*/
|