3v4l.org

run code in 300+ PHP versions simultaneously
<?php $recursive_array = array(); $recursive_array[] = &$recursive_array; $recursive_array2 = array(); $recursive_array2[] = &$recursive_array2; if ($recursive_array == $recursive_array2) { //Fatal error: Nesting level too deep - recursive dependency? echo 'true'; } echo 'false';
Finding entry points
Branch analysis from position: 0
2 jumps found. (Code = 43) Position 1 = 8, Position 2 = 9
Branch analysis from position: 8
1 jumps found. (Code = 62) Position 1 = -2
Branch analysis from position: 9
filename:       /in/PdITq
function name:  (null)
number of ops:  11
compiled vars:  !0 = $recursive_array, !1 = $recursive_array2
line      #* E I O op                           fetch          ext  return  operands
-------------------------------------------------------------------------------------
    3     0  E >   ASSIGN                                                   !0, <array>
    4     1        FETCH_DIM_W                                      $3      !0
          2        ASSIGN_REF                                               $3, !0
    5     3        ASSIGN                                                   !1, <array>
    6     4        FETCH_DIM_W                                      $6      !1
          5        ASSIGN_REF                                               $6, !1
    7     6        IS_EQUAL                                                 !0, !1
          7      > JMPZ                                                     ~8, ->9
    8     8    >   ECHO                                                     'true'
   10     9    >   ECHO                                                     'false'
         10      > RETURN                                                   1

Generated using Vulcan Logic Dumper, using php 8.0.0


preferences:
181.93 ms | 1392 KiB | 13 Q