Function Graph Overview
    Preparing search index...

    Function simplifyCFG

    • Simplify the CFG by removing "trivial" nodes.

      Trivial nodes are nodes that do not contribute to the branching structure of the CFG.

      Two linked nodes are considered "trivial" if and only if:

      • The source only has one outgoing edge
      • The destination only has one incoming edge
      cluster_0 Trivial pair cluster_1 Non-trivial pairs s1 d1 s1:s->d1:n d3 s3 d4 s3:s->d4:n s2 s2:s->d3:n d2 s2:s->d2:n s4 s4:s->d4:n
      cluster_0 Trivial pair cluster_1 Non-trivial pairs s1 d1 s1:s->d1:n d3 s3 d4 s3:s->d4:n s2 s2:s->d3:n d2 s2:s->d2:n s4 s4:s->d4:n

      Parameters

      Returns CFG

    Settings

    Member Visibility