3v4l.org

run code in 300+ PHP versions simultaneously
<?php echo __DIR__; $t = array(1,2,3,4,5,6); foreach($t as $k => $a){ if ($a == 3) { unset($t[$k]); } echo $a; }
Finding entry points
Branch analysis from position: 0
2 jumps found. (Code = 77) Position 1 = 3, Position 2 = 10
Branch analysis from position: 3
2 jumps found. (Code = 78) Position 1 = 4, Position 2 = 10
Branch analysis from position: 4
2 jumps found. (Code = 43) Position 1 = 7, Position 2 = 8
Branch analysis from position: 7
1 jumps found. (Code = 42) Position 1 = 3
Branch analysis from position: 3
Branch analysis from position: 8
Branch analysis from position: 10
1 jumps found. (Code = 62) Position 1 = -2
Branch analysis from position: 10
filename:       /in/Pig0A
function name:  (null)
number of ops:  12
compiled vars:  !0 = $t, !1 = $a, !2 = $k
line      #* E I O op                           fetch          ext  return  operands
-------------------------------------------------------------------------------------
    2     0  E >   ECHO                                                     '%2Fin'
    5     1        ASSIGN                                                   !0, <array>
    6     2      > FE_RESET_R                                       $4      !0, ->10
          3    > > FE_FETCH_R                                       ~5      $4, !1, ->10
          4    >   ASSIGN                                                   !2, ~5
    7     5        IS_EQUAL                                                 !1, 3
          6      > JMPZ                                                     ~7, ->8
    8     7    >   UNSET_DIM                                                !0, !2
   10     8    >   ECHO                                                     !1
    6     9      > JMP                                                      ->3
         10    >   FE_FREE                                                  $4
   11    11      > RETURN                                                   1

Generated using Vulcan Logic Dumper, using php 8.0.0


preferences:
146.67 ms | 1393 KiB | 13 Q