/ext-ds/src/ds/ |
H A D | ds_vector.c | 30 vector->size = 0; in ds_vector_ex() 50 clone->size = vector->size; in ds_vector_clone() 69 vector->size = size; in ds_vector_from_buffer() 125 vector->size--; in ds_vector_remove() 156 vector->size = 0; in ds_vector_clear_buffer() 161 if (vector->size > 0) { in ds_vector_clear() 181 zend_long size = vector->size; in ds_vector_to_array() local 183 if (size == 0) { in ds_vector_to_array() 271 vector->size += argc; in ds_vector_insert_va() 306 vector->size += argc; in ds_vector_push_va() [all …]
|
H A D | ds_priority_queue.c | 80 queue->size = 0; in ds_priority_queue() 101 if (queue->size == queue->capacity) { in ds_priority_queue_push() 134 queue->size++; in ds_priority_queue_push() 152 const uint32_t size = queue->size; in ds_priority_queue_pop() local 156 if (size == 0) { in ds_priority_queue_pop() 168 bottom = nodes[size - 1]; in ds_priority_queue_pop() 174 queue->size--; in ds_priority_queue_pop() 220 clone->size = queue->size; in ds_priority_queue_clone() 228 if (queue->size == 0) { in ds_priority_queue_peek() 264 end = buf + queue->size; in ds_priority_queue_to_array() [all …]
|
H A D | ds_deque.c | 51 deque->size = 0; in ds_deque() 64 deque->size = 0; in ds_deque_preallocated() 76 deque->tail = size; in ds_deque_from_buffer() 77 deque->size = size; in ds_deque_from_buffer() 195 deque->size = 0; in ds_deque_clear() 291 deque->size--; in ds_deque_shift() 310 deque->size--; in ds_deque_pop() 362 deque->size--; in ds_deque_remove() 369 deque->size += argc; in ds_deque_unshift_va() 385 deque->size++; in ds_deque_push() [all …]
|
H A D | ds_stack.h | 7 #define DS_STACK_SIZE(s) ((s)->vector->size) 17 zval *_pos = _end + _v->size - 1; \ 19 for (; _pos >= _end; --_pos, --_v->size) { \
|
H A D | ds_priority_queue.h | 14 uint32_t size; member 24 ds_priority_queue_node_t *_last = &_queue->nodes[queue->size - 1]; \ 54 #define DS_PRIORITY_QUEUE_SIZE(queue) ((queue)->size)
|
H A D | ds_htable.c | 51 if (table->size == 0) { in ds_htable_rehash() 131 table->size = 0; in ds_htable_with_capacity() 167 dst->size = src->size; in ds_htable_clone() 374 if (table->size == 0 || position >= table->size) { in ds_htable_lookup_by_position() 479 if (table->size == 0) { in ds_htable_clear_buffer() 488 table->size = 0; in ds_htable_clear_buffer() 614 if (table->next > table->size + (table->size >> 5)) { in ds_htable_increase_capacity() 649 table->size++; in ds_htable_put_distinct_bucket() 676 table->size++; in ds_htable_init_next_bucket() 841 table->size--; in ds_htable_remove() [all …]
|
H A D | ds_stack.c | 59 zend_long size = DS_STACK_SIZE(stack); in ds_stack_to_array() local 61 if (size == 0) { in ds_stack_to_array() 66 array_init_size(return_value, size); in ds_stack_to_array()
|
H A D | ds_vector.h | 9 zend_long size; // Number of values in the buffer member 14 #define DS_VECTOR_SIZE(v) ((v)->size) 23 zval *y = x + v->size; \ 33 zval *x = y + v->size - 1; \ 47 ds_vector_t *ds_vector_from_buffer(zval *buffer, zend_long capacity, zend_long size);
|
H A D | ds_queue.c | 65 zend_long size = QUEUE_SIZE(queue); in ds_queue_to_array() local 67 if (size == 0) { in ds_queue_to_array() 72 array_init_size(return_value, size); in ds_queue_to_array()
|
H A D | ds_deque.h | 8 #define DS_DEQUE_SIZE(d) ((d)->size) 9 #define DS_DEQUE_IS_EMPTY(d) ((d)->size == 0) 15 const zend_long _size = _deque->size; \ 31 zend_long size; member
|
H A D | ds_queue.h | 7 #define QUEUE_SIZE(q) ((q)->deque->size) 8 #define QUEUE_IS_EMPTY(q) ((q)->deque->size == 0)
|
H A D | ds_htable.h | 40 #define DS_HTABLE_IS_PACKED(t) ((t)->size == (t)->next) 106 uint32_t _n = (h)->size; \ 156 uint32_t size; // Number of active buckets in the table member
|
/ext-ds/src/ |
H A D | common.c | 91 void ds_sort_zval_buffer(zval *buffer, zend_long size) in ds_sort_zval_buffer() argument 117 zend_long size in ds_normalize_slice_args() argument 123 if (size == 0 || idx >= size) { in ds_normalize_slice_args() 131 idx = MAX(0, size + idx); in ds_normalize_slice_args() 136 len = MAX(0, (size + len) - idx); in ds_normalize_slice_args() 140 if ((idx + len) > size) { in ds_normalize_slice_args() 141 len = MAX(0, size - idx); in ds_normalize_slice_args() 167 zend_long size, in ds_join_zval_buffer() argument 173 if (size <= 0) { in ds_join_zval_buffer() 177 if (size == 1) { in ds_join_zval_buffer() [all …]
|
H A D | common.h | 272 zend_long size, 285 zend_long size 305 void ds_sort_zval_buffer(zval *buffer, zend_long size); 310 void ds_user_sort_zval_buffer(zval *buffer, zend_long size);
|
/ext-ds/src/php/iterators/ |
H A D | php_htable_iterator.c | 10 if (table->size != 0) { in find_starting_bucket() 32 uint32_t size = iterator->table->size; in php_ds_htable_iterator_valid() local 35 return position < size ? SUCCESS : FAILURE; in php_ds_htable_iterator_valid() 107 if (++iterator->position < iterator->table->size) { in php_ds_htable_iterator_move_forward()
|
H A D | php_deque_iterator.c | 18 if (iterator->position < iterator->deque->size) { in php_ds_deque_iterator_valid()
|
H A D | php_vector_iterator.c | 18 return iterator->position < iterator->vector->size ? SUCCESS : FAILURE; in php_ds_vector_iterator_valid()
|
/ext-ds/src/php/objects/ |
H A D | php_priority_queue.c | 43 if (queue->size == 0) { in php_ds_priority_queue_serialize() 49 ds_priority_queue_node_t *end = nodes + queue->size; in php_ds_priority_queue_serialize()
|
H A D | php_deque.c | 37 if (deque->size == 0) { in php_ds_deque_serialize()
|
H A D | php_set.c | 37 if (set->table->size == 0) { in php_ds_set_serialize()
|
/ext-ds/src/php/handlers/ |
H A D | php_vector_handlers.c | 113 *count = php_ds_vector_fetch_object(obj)->vector->size; return SUCCESS; 116 *count = Z_DS_VECTOR_P(obj)->size; return SUCCESS; 160 *gc_count = (int) vector->size;
|
H A D | php_deque_handlers.c | 114 *count = php_ds_deque_fetch_object(obj)->deque->size; 117 *count = Z_DS_DEQUE_P(obj)->size; 162 *gc_count = (int) (deque->head == 0 ? deque->size : deque->capacity);
|
H A D | php_priority_queue_handlers.c | 70 *gc_size = pq->size * 2;
|
H A D | php_stack_handlers.c | 80 *gc_count = (int) stack->vector->size;
|
/ext-ds/src/php/classes/ |
H A D | php_deque_ce.c | 97 RETURN_DS_DEQUE(ds_deque_slice(deque, index, deque->size)); in METHOD() 171 RETURN_LONG(deque->size); in METHOD()
|