year++

Fixed pointer allignment

Update copyright headers to 2017

typo

Fixed reference-counter inference

Various RC inference fixes

Updated reference-counting inferece rules.
The previous rules refected PHP-5 behavior and were completely wrong for PHP-7. (e.g. scalars don't have reference counters at all).
This change sho

Updated reference-counting inferece rules.
The previous rules refected PHP-5 behavior and were completely wrong for PHP-7. (e.g. scalars don't have reference counters at all).
This change shouldn't affect anything, because results of this inference are not used yet.

show more ...

Prevent optimization of huge functions.

op_arrays may be optimized independetly and "script" might be NULL

clanup

Add support for "instanceof" pi nodes

Use union for pi constraints

This will make it easier to extend pi constraints without impacting
structure sizes.

Split ZEND_SEND_VAR_NO_REF into ZEND_SEND_VAR_NO_REF and ZEND_SEND_VAR_NO_REF_EX (similar to ZEND_SEND_VAL) and remove ZEND_ARG_* flags.

Typo & cleanup

Replace BB end with BB len

And support empty blocks everywhere.

Fix phi placement for pi targets

If the pi target has multiple predecessors, we need to place a
phi there. However it's not possible to express this in terms of
dominance frontiers,

Fix phi placement for pi targets

If the pi target has multiple predecessors, we need to place a
phi there. However it's not possible to express this in terms of
dominance frontiers, so we need to explicitly add it to the phi
set.

This does not yet solve the problem of non-minimal SSA for the
case where the target has multiple predecessors, but dominates
all predecessors (apart from the one creating the pi) -- but
that's an existing issue.

show more ...

Explicitly construct phi set during def propagation

Previously the phi set was first computed during def propagation
and then computed again (per-block) during actual phi placement.

Explicitly construct phi set during def propagation

Previously the phi set was first computed during def propagation
and then computed again (per-block) during actual phi placement.
This commit changes this to store the phi set computed during
def propagation.

This makes SSA construction slightly faster (5%), but the main
purpose here is to pave the way for the next commit.

This also fixes a potential issue with the handling of irreducible
loops -- they generated additional phis, but these were not
accounted for in def propagation. (Though I'm not sure if we can
even have any irreducible loops right now.)

show more ...

Take pi defs into account when propagating defs

Previously pi placement happened after initial phi placement.
Afterwards a second phi placement pass was performed, however it
incorre

Take pi defs into account when propagating defs

Previously pi placement happened after initial phi placement.
Afterwards a second phi placement pass was performed, however it
incorrectly only placed phis on the dominance frontier, rather
than the iterated dominance frontier.

This is fixed by moving pi placement before the propagation of
defs on the iterated DFs, and adding a def for each added pi.

While this ensures that we generate correct conservative SSA, there
is still one remaining case in which we may generate non-minimal
SSA form. Consider:

|1|
|pi
v
|2|<--\
| |
\----/

The pi is semanically located along the edge 1->2, however we place
it (and its def point) in 2, thus leading to the generation of an
additional (trivial) phi in 2.

Conflicts:
ext/opcache/Optimizer/zend_ssa.c

show more ...

Make pi placement independent of phi placement

This interdependence is problematic because we can't propagate pi
def points in the initial dominance frontier propagation. The used
ru

Make pi placement independent of phi placement

This interdependence is problematic because we can't propagate pi
def points in the initial dominance frontier propagation. The used
rule for multiple-predecessor blocks may also miss cases where
placing the pi would have been useful.

The new heuristic for pi placement checks that a) the variable is
live-in and b) for the "from" block that generated the pi, the
other successor does not dominate all other predecessors of the
"to" block.

The purpose of case b) may be illustrated with an example:

if (is_int($i)) {
// place pi here
}
// but don't place pi here

The reason we do not want to place the second pi is that we generally
place pis in positive+negative pairs, and in this case the pair
would merge in a phi and cancel out, so we get no useful information
out of it.

show more ...

Drop some unnecessary checks

Introduce ZEND_BITSET_FOREACH macros

Adjust DFG allocation size

Now we need one set less...

Merge def and gen sets

For live-variable analysis it does not matter if def includes
variables that are previously use in the same block, the data flow
equations still have the same

Merge def and gen sets

For live-variable analysis it does not matter if def includes
variables that are previously use in the same block, the data flow
equations still have the same result. As such there is no need to
compute separate gen & def sets.

I'm keeping the name "def", because use of "gen" in this context is
pretty confusing (gen is usually the use set, not the def set).

show more ...

Fix SSA for SEND_UNPACK

Fixed handling of return statement without a value.