set initialized flag after actual initialization happened

fix typos

Signed-off-by: olshevskiy87 <olshevskiy87@bk.ru>

Eliminate useless checks

Optimized HashTable copy and cleanup function for cases without holes.

Optimized zend_hash_rehash(), added some exoectations to generate better code

Added HashTable flag HASH_FLAG_STATIC_KEYS that is maintaned to be set if all hash table keys are numbers or interned strings.
Take this flag into account when copy or destroy HashTable to avoud

Added HashTable flag HASH_FLAG_STATIC_KEYS that is maintaned to be set if all hash table keys are numbers or interned strings.
Take this flag into account when copy or destroy HashTable to avoud useless checks for each key.

show more ...

Keep realpath and PCRE caches in consistency with opcache SHM.

Slight zend_hash_find() optimization.

Fix zend_hash_find documentation.

Fixed bug #69376 (Wrong ref counting).

Revert "Better to taverse reversely"

This reverts commit 51451ab84ad24430c0e3e3cf67eac297be9cf917.

Better to taverse reversely

zend_hash_do_resize: amortizing the cost of compaction

New implementation of hashtables introduced a compaction step which is
triggered when a hashtable is full but it contains at least

zend_hash_do_resize: amortizing the cost of compaction

New implementation of hashtables introduced a compaction step which is
triggered when a hashtable is full but it contains at least one deleted
bucket. Therefore there is a possibility that a cleverly crafted code can
trigger this compaction step (which takes time proportional to the size of
hashtabe) by executing constatnt number of operations. When the hashtable
is full, deletion and subsequent addition or single element triggers a
table compaction and these two steps can be repeated ad infinitum. This
might be avenue for a DOS attack.

This patch allows compaction to be performed only if the hashtable contains
at least 1/32 deleted elements, otherwise the hashtable is doubled in size.
Linear amount of work caused by compaction is amortized over multiple
malicious additions and deletions.

show more ...

Fixed mess in names

Fixed zend_hash_del()

Use fastcall calling convention for most critical ZE subsystems.

Changed HashTable layout:

Removed HashTable->arHash (reduced memory consumption). Now hash slots may be accessed using HT_HASH() macro.
Hash slotas are allocated together with Buckets (b

Changed HashTable layout:

Removed HashTable->arHash (reduced memory consumption). Now hash slots may be accessed using HT_HASH() macro.
Hash slotas are allocated together with Buckets (before them) and lay in reverse order from HashTable->arData base address (see comments in Zend/zend_types.h)
Indexes in hash table and conflict resolution chains (Z_NEXT) may be stored as indeces or offsets in bytes, depending on system (32 or 64-bit).
HashTable data filelds are reordered to keep the most useful for zend_hash_find() data in the same CPU cache line.

show more ...

Unused var

Minimize copying of HashTable realocation

Improved code for class property inheritance

pefree() -> efree()

Avoid unnecassary check

Make zend_array_destroy() to free the corresponding zend_array

Merged zend_array and HashTable into the single data structure.
Now each HashTable is also zend_array, so it's refcounted and may be a subject for Copy on Write
zend_array_dup() was changed t

Merged zend_array and HashTable into the single data structure.
Now each HashTable is also zend_array, so it's refcounted and may be a subject for Copy on Write
zend_array_dup() was changed to allocate and return HashTable, instead of taking preallocated HashTable as argument.

show more ...

Unused vars