3v4l.org

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

Generated using Vulcan Logic Dumper, using php 8.0.0


preferences:
142.92 ms | 1393 KiB | 13 Q