Method Prim

cfa/seq.go:32–43

Prim returns a representation of the high-level control flow primitive, as a mapping from control flow primitive node names to control flow graph node names. Example mapping: "entry": "A" "exit": "B"

()

//    "entry": "A"
//    "exit":  "B"
func (prim Seq) Prim() *primitive.Primitive {
	entry, exit := label(prim.Entry), label(prim.Exit)
	return &primitive.Primitive{
		Prim: "seq",
		Nodes: map[string]string{
			"entry": entry,
			"exit":  exit,
		},
		Entry: entry,
		Exit:  exit,
	}
}

// String returns a string representation of prim in DOT format.
//