a6b91ccc77
1. Support unparam linter and fix found issues
2. Replace forked mvdan.cc/lint and mvdan.cc/interfacer with the
upstream ones
3. Minimize forked megacheck: move the most of it's code to this repo
4. Use golang.org/x/tools/go/ssa import path instead of custom fork
paths
5. In golang.org/x/tools/go/{ssa,callgraph} use changed code from
honnef.co/go/tools
6. Add megacheck.check-unexported option: it found some issues in
the repo, fixed them all
51 lines
962 B
Go
51 lines
962 B
Go
package functions
|
|
|
|
import "golang.org/x/tools/go/ssa"
|
|
|
|
type Loop map[*ssa.BasicBlock]bool
|
|
|
|
func findLoops(fn *ssa.Function) []Loop {
|
|
if fn.Blocks == nil {
|
|
return nil
|
|
}
|
|
tree := fn.DomPreorder()
|
|
var sets []Loop
|
|
for _, h := range tree {
|
|
for _, n := range h.Preds {
|
|
if !h.Dominates(n) {
|
|
continue
|
|
}
|
|
// n is a back-edge to h
|
|
// h is the loop header
|
|
if n == h {
|
|
sets = append(sets, Loop{n: true})
|
|
continue
|
|
}
|
|
set := Loop{h: true, n: true}
|
|
for _, b := range allPredsBut(n, h, nil) {
|
|
set[b] = true
|
|
}
|
|
sets = append(sets, set)
|
|
}
|
|
}
|
|
return sets
|
|
}
|
|
|
|
func allPredsBut(b, but *ssa.BasicBlock, list []*ssa.BasicBlock) []*ssa.BasicBlock {
|
|
outer:
|
|
for _, pred := range b.Preds {
|
|
if pred == but {
|
|
continue
|
|
}
|
|
for _, p := range list {
|
|
// TODO improve big-o complexity of this function
|
|
if pred == p {
|
|
continue outer
|
|
}
|
|
}
|
|
list = append(list, pred)
|
|
list = allPredsBut(pred, but, list)
|
|
}
|
|
return list
|
|
}
|