// locate parses the provided graphs and tries to locate isomorphisms of the
// subgraph in the graph.
func locate(graphPath, subPath string) error {
// Parse graph.
graph, err := dot.ParseFile(graphPath)
if err != nil {
return errutil.Err(err)
}
// Search for subgraph in GOPATH if not found.
if ok, _ := osutil.Exists(subPath); !ok {
dir, err := goutil.SrcDir("decomp.org/decomp/graphs/testdata/primitives")
if err != nil {
return errutil.Err(err)
}
subPath = filepath.Join(dir, subPath)
}
sub, err := graphs.ParseSubGraph(subPath)
if err != nil {
return errutil.Err(err)
}
// Locate isomorphisms.
found := false
if len(flagStart) > 0 {
// Locate an isomorphism of sub in graph which starts at the node
// specified by the "-start" flag.
m, ok := iso.Isomorphism(graph, flagStart, sub)
if ok {
found = true
printMapping(graph, sub, m)
}
} else {
// Locate all isomorphisms of sub in graph.
var names []string
for name := range graph.Nodes.Lookup {
names = append(names, name)
}
sort.Strings(names)
for _, name := range names {
m, ok := iso.Isomorphism(graph, name, sub)
if !ok {
continue
}
found = true
printMapping(graph, sub, m)
}
}
if !found {
fmt.Println("not found.")
}
return nil
}
// locateAndMerge parses the provided graphs and tries to merge isomorphisms of
// the subgraph in the graph into single nodes.
func locateAndMerge(graphPath, subPath string) error {
// Parse graph.
graph, err := dot.ParseFile(graphPath)
if err != nil {
return errutil.Err(err)
}
// Search for subgraph in GOPATH if not found.
if ok, _ := osutil.Exists(subPath); !ok {
dir, err := goutil.SrcDir("decomp.org/decomp/graphs/testdata/primitives")
if err != nil {
return errutil.Err(err)
}
subPath = filepath.Join(dir, subPath)
}
sub, err := graphs.ParseSubGraph(subPath)
if err != nil {
return errutil.Err(err)
}
// Merge isomorphisms.
found := false
if len(flagStart) > 0 {
// Merge an isomorphism of sub in graph which starts at the node
// specified by the "-start" flag.
m, ok := iso.Isomorphism(graph, flagStart, sub)
if ok {
found = true
printMapping(graph, sub, m)
_, err := merge.Merge(graph, m, sub)
if err != nil {
return errutil.Err(err)
}
}
} else {
// Merge all isomorphisms of sub in graph.
for {
m, ok := iso.Search(graph, sub)
if !ok {
break
}
found = true
printMapping(graph, sub, m)
_, err := merge.Merge(graph, m, sub)
if err != nil {
return errutil.Err(err)
}
}
}
// Store DOT and PNG representation of graph.
if found {
err = dump(graph)
if err != nil {
return errutil.Err(err)
}
} else {
fmt.Println("not found.")
}
return nil
}