2018-12-28 23:15:05 +01:00
|
|
|
// Package lintdsl provides helpers for implementing static analysis
|
|
|
|
// checks. Dot-importing this package is encouraged.
|
|
|
|
package lintdsl
|
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
|
|
|
"fmt"
|
|
|
|
"go/ast"
|
|
|
|
"go/constant"
|
|
|
|
"go/printer"
|
|
|
|
"go/token"
|
|
|
|
"go/types"
|
|
|
|
"strings"
|
|
|
|
|
|
|
|
"honnef.co/go/tools/lint"
|
|
|
|
"honnef.co/go/tools/ssa"
|
|
|
|
)
|
|
|
|
|
|
|
|
type packager interface {
|
|
|
|
Package() *ssa.Package
|
|
|
|
}
|
|
|
|
|
|
|
|
func CallName(call *ssa.CallCommon) string {
|
|
|
|
if call.IsInvoke() {
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
switch v := call.Value.(type) {
|
|
|
|
case *ssa.Function:
|
|
|
|
fn, ok := v.Object().(*types.Func)
|
|
|
|
if !ok {
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
return fn.FullName()
|
|
|
|
case *ssa.Builtin:
|
|
|
|
return v.Name()
|
|
|
|
}
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsCallTo(call *ssa.CallCommon, name string) bool { return CallName(call) == name }
|
|
|
|
func IsType(T types.Type, name string) bool { return types.TypeString(T, nil) == name }
|
|
|
|
|
|
|
|
func FilterDebug(instr []ssa.Instruction) []ssa.Instruction {
|
|
|
|
var out []ssa.Instruction
|
|
|
|
for _, ins := range instr {
|
|
|
|
if _, ok := ins.(*ssa.DebugRef); !ok {
|
|
|
|
out = append(out, ins)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return out
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsExample(fn *ssa.Function) bool {
|
|
|
|
if !strings.HasPrefix(fn.Name(), "Example") {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
f := fn.Prog.Fset.File(fn.Pos())
|
|
|
|
if f == nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return strings.HasSuffix(f.Name(), "_test.go")
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsPointerLike(T types.Type) bool {
|
|
|
|
switch T := T.Underlying().(type) {
|
|
|
|
case *types.Interface, *types.Chan, *types.Map, *types.Pointer:
|
|
|
|
return true
|
|
|
|
case *types.Basic:
|
|
|
|
return T.Kind() == types.UnsafePointer
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsGenerated(f *ast.File) bool {
|
|
|
|
comments := f.Comments
|
|
|
|
if len(comments) > 0 {
|
|
|
|
comment := comments[0].Text()
|
|
|
|
return strings.Contains(comment, "Code generated by") ||
|
|
|
|
strings.Contains(comment, "DO NOT EDIT")
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsIdent(expr ast.Expr, ident string) bool {
|
|
|
|
id, ok := expr.(*ast.Ident)
|
|
|
|
return ok && id.Name == ident
|
|
|
|
}
|
|
|
|
|
|
|
|
// isBlank returns whether id is the blank identifier "_".
|
|
|
|
// If id == nil, the answer is false.
|
|
|
|
func IsBlank(id ast.Expr) bool {
|
|
|
|
ident, _ := id.(*ast.Ident)
|
|
|
|
return ident != nil && ident.Name == "_"
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsIntLiteral(expr ast.Expr, literal string) bool {
|
|
|
|
lit, ok := expr.(*ast.BasicLit)
|
|
|
|
return ok && lit.Kind == token.INT && lit.Value == literal
|
|
|
|
}
|
|
|
|
|
|
|
|
// Deprecated: use IsIntLiteral instead
|
|
|
|
func IsZero(expr ast.Expr) bool {
|
|
|
|
return IsIntLiteral(expr, "0")
|
|
|
|
}
|
|
|
|
|
2019-02-18 20:32:41 +01:00
|
|
|
func TypeOf(j *lint.Job, expr ast.Expr) types.Type {
|
|
|
|
if expr == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return j.NodePackage(expr).TypesInfo.TypeOf(expr)
|
|
|
|
}
|
|
|
|
|
2018-12-28 23:15:05 +01:00
|
|
|
func IsOfType(j *lint.Job, expr ast.Expr, name string) bool { return IsType(TypeOf(j, expr), name) }
|
|
|
|
|
2019-02-18 20:32:41 +01:00
|
|
|
func ObjectOf(j *lint.Job, ident *ast.Ident) types.Object {
|
|
|
|
if ident == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return j.NodePackage(ident).TypesInfo.ObjectOf(ident)
|
|
|
|
}
|
2018-12-28 23:15:05 +01:00
|
|
|
|
|
|
|
func IsInTest(j *lint.Job, node lint.Positioner) bool {
|
|
|
|
// FIXME(dh): this doesn't work for global variables with
|
|
|
|
// initializers
|
|
|
|
f := j.Program.SSA.Fset.File(node.Pos())
|
|
|
|
return f != nil && strings.HasSuffix(f.Name(), "_test.go")
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsInMain(j *lint.Job, node lint.Positioner) bool {
|
|
|
|
if node, ok := node.(packager); ok {
|
|
|
|
return node.Package().Pkg.Name() == "main"
|
|
|
|
}
|
|
|
|
pkg := j.NodePackage(node)
|
|
|
|
if pkg == nil {
|
|
|
|
return false
|
|
|
|
}
|
2019-02-18 20:32:41 +01:00
|
|
|
return pkg.Types.Name() == "main"
|
2018-12-28 23:15:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func SelectorName(j *lint.Job, expr *ast.SelectorExpr) string {
|
2019-02-18 20:32:41 +01:00
|
|
|
info := j.NodePackage(expr).TypesInfo
|
|
|
|
sel := info.Selections[expr]
|
2018-12-28 23:15:05 +01:00
|
|
|
if sel == nil {
|
|
|
|
if x, ok := expr.X.(*ast.Ident); ok {
|
2019-02-18 20:32:41 +01:00
|
|
|
pkg, ok := info.ObjectOf(x).(*types.PkgName)
|
2018-12-28 23:15:05 +01:00
|
|
|
if !ok {
|
|
|
|
// This shouldn't happen
|
|
|
|
return fmt.Sprintf("%s.%s", x.Name, expr.Sel.Name)
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("%s.%s", pkg.Imported().Path(), expr.Sel.Name)
|
|
|
|
}
|
|
|
|
panic(fmt.Sprintf("unsupported selector: %v", expr))
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("(%s).%s", sel.Recv(), sel.Obj().Name())
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsNil(j *lint.Job, expr ast.Expr) bool {
|
2019-02-18 20:32:41 +01:00
|
|
|
return j.NodePackage(expr).TypesInfo.Types[expr].IsNil()
|
2018-12-28 23:15:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func BoolConst(j *lint.Job, expr ast.Expr) bool {
|
2019-02-18 20:32:41 +01:00
|
|
|
val := j.NodePackage(expr).TypesInfo.ObjectOf(expr.(*ast.Ident)).(*types.Const).Val()
|
2018-12-28 23:15:05 +01:00
|
|
|
return constant.BoolVal(val)
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsBoolConst(j *lint.Job, expr ast.Expr) bool {
|
|
|
|
// We explicitly don't support typed bools because more often than
|
|
|
|
// not, custom bool types are used as binary enums and the
|
|
|
|
// explicit comparison is desired.
|
|
|
|
|
|
|
|
ident, ok := expr.(*ast.Ident)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
2019-02-18 20:32:41 +01:00
|
|
|
obj := j.NodePackage(expr).TypesInfo.ObjectOf(ident)
|
2018-12-28 23:15:05 +01:00
|
|
|
c, ok := obj.(*types.Const)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
basic, ok := c.Type().(*types.Basic)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if basic.Kind() != types.UntypedBool && basic.Kind() != types.Bool {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
func ExprToInt(j *lint.Job, expr ast.Expr) (int64, bool) {
|
2019-02-18 20:32:41 +01:00
|
|
|
tv := j.NodePackage(expr).TypesInfo.Types[expr]
|
2018-12-28 23:15:05 +01:00
|
|
|
if tv.Value == nil {
|
|
|
|
return 0, false
|
|
|
|
}
|
|
|
|
if tv.Value.Kind() != constant.Int {
|
|
|
|
return 0, false
|
|
|
|
}
|
|
|
|
return constant.Int64Val(tv.Value)
|
|
|
|
}
|
|
|
|
|
|
|
|
func ExprToString(j *lint.Job, expr ast.Expr) (string, bool) {
|
2019-02-18 20:32:41 +01:00
|
|
|
val := j.NodePackage(expr).TypesInfo.Types[expr].Value
|
2018-12-28 23:15:05 +01:00
|
|
|
if val == nil {
|
|
|
|
return "", false
|
|
|
|
}
|
|
|
|
if val.Kind() != constant.String {
|
|
|
|
return "", false
|
|
|
|
}
|
|
|
|
return constant.StringVal(val), true
|
|
|
|
}
|
|
|
|
|
|
|
|
// Dereference returns a pointer's element type; otherwise it returns
|
|
|
|
// T.
|
|
|
|
func Dereference(T types.Type) types.Type {
|
|
|
|
if p, ok := T.Underlying().(*types.Pointer); ok {
|
|
|
|
return p.Elem()
|
|
|
|
}
|
|
|
|
return T
|
|
|
|
}
|
|
|
|
|
|
|
|
// DereferenceR returns a pointer's element type; otherwise it returns
|
|
|
|
// T. If the element type is itself a pointer, DereferenceR will be
|
|
|
|
// applied recursively.
|
|
|
|
func DereferenceR(T types.Type) types.Type {
|
|
|
|
if p, ok := T.Underlying().(*types.Pointer); ok {
|
|
|
|
return DereferenceR(p.Elem())
|
|
|
|
}
|
|
|
|
return T
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsGoVersion(j *lint.Job, minor int) bool {
|
|
|
|
return j.Program.GoVersion >= minor
|
|
|
|
}
|
|
|
|
|
2019-02-18 20:32:41 +01:00
|
|
|
func CallNameAST(j *lint.Job, call *ast.CallExpr) string {
|
|
|
|
switch fun := call.Fun.(type) {
|
|
|
|
case *ast.SelectorExpr:
|
|
|
|
fn, ok := ObjectOf(j, fun.Sel).(*types.Func)
|
|
|
|
if !ok {
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
return fn.FullName()
|
|
|
|
case *ast.Ident:
|
|
|
|
obj := ObjectOf(j, fun)
|
|
|
|
switch obj := obj.(type) {
|
|
|
|
case *types.Func:
|
|
|
|
return obj.FullName()
|
|
|
|
case *types.Builtin:
|
|
|
|
return obj.Name()
|
|
|
|
default:
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-12-28 23:15:05 +01:00
|
|
|
func IsCallToAST(j *lint.Job, node ast.Node, name string) bool {
|
|
|
|
call, ok := node.(*ast.CallExpr)
|
|
|
|
if !ok {
|
|
|
|
return false
|
|
|
|
}
|
2019-02-18 20:32:41 +01:00
|
|
|
return CallNameAST(j, call) == name
|
2018-12-28 23:15:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func IsCallToAnyAST(j *lint.Job, node ast.Node, names ...string) bool {
|
|
|
|
for _, name := range names {
|
|
|
|
if IsCallToAST(j, node, name) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
func Render(j *lint.Job, x interface{}) string {
|
|
|
|
fset := j.Program.SSA.Fset
|
|
|
|
var buf bytes.Buffer
|
|
|
|
if err := printer.Fprint(&buf, fset, x); err != nil {
|
|
|
|
panic(err)
|
|
|
|
}
|
|
|
|
return buf.String()
|
|
|
|
}
|
|
|
|
|
|
|
|
func RenderArgs(j *lint.Job, args []ast.Expr) string {
|
|
|
|
var ss []string
|
|
|
|
for _, arg := range args {
|
|
|
|
ss = append(ss, Render(j, arg))
|
|
|
|
}
|
|
|
|
return strings.Join(ss, ", ")
|
|
|
|
}
|
|
|
|
|
|
|
|
func Preamble(f *ast.File) string {
|
|
|
|
cutoff := f.Package
|
|
|
|
if f.Doc != nil {
|
|
|
|
cutoff = f.Doc.Pos()
|
|
|
|
}
|
|
|
|
var out []string
|
|
|
|
for _, cmt := range f.Comments {
|
|
|
|
if cmt.Pos() >= cutoff {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
out = append(out, cmt.Text())
|
|
|
|
}
|
|
|
|
return strings.Join(out, "\n")
|
|
|
|
}
|
|
|
|
|
|
|
|
func Inspect(node ast.Node, fn func(node ast.Node) bool) {
|
|
|
|
if node == nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
ast.Inspect(node, fn)
|
|
|
|
}
|
2019-02-18 20:32:41 +01:00
|
|
|
|
|
|
|
func GroupSpecs(j *lint.Job, specs []ast.Spec) [][]ast.Spec {
|
|
|
|
if len(specs) == 0 {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
fset := j.Program.SSA.Fset
|
|
|
|
groups := make([][]ast.Spec, 1)
|
|
|
|
groups[0] = append(groups[0], specs[0])
|
|
|
|
|
|
|
|
for _, spec := range specs[1:] {
|
|
|
|
g := groups[len(groups)-1]
|
|
|
|
if fset.PositionFor(spec.Pos(), false).Line-1 !=
|
|
|
|
fset.PositionFor(g[len(g)-1].End(), false).Line {
|
|
|
|
|
|
|
|
groups = append(groups, nil)
|
|
|
|
}
|
|
|
|
|
|
|
|
groups[len(groups)-1] = append(groups[len(groups)-1], spec)
|
|
|
|
}
|
|
|
|
|
|
|
|
return groups
|
|
|
|
}
|
|
|
|
|
|
|
|
func IsObject(obj types.Object, name string) bool {
|
|
|
|
var path string
|
|
|
|
if pkg := obj.Pkg(); pkg != nil {
|
|
|
|
path = pkg.Path() + "."
|
|
|
|
}
|
|
|
|
return path+obj.Name() == name
|
|
|
|
}
|
|
|
|
|
|
|
|
type Field struct {
|
|
|
|
Var *types.Var
|
|
|
|
Tag string
|
|
|
|
Path []int
|
|
|
|
}
|
|
|
|
|
|
|
|
// FlattenFields recursively flattens T and embedded structs,
|
|
|
|
// returning a list of fields. If multiple fields with the same name
|
|
|
|
// exist, all will be returned.
|
|
|
|
func FlattenFields(T *types.Struct) []Field {
|
|
|
|
return flattenFields(T, nil, nil)
|
|
|
|
}
|
|
|
|
|
|
|
|
func flattenFields(T *types.Struct, path []int, seen map[types.Type]bool) []Field {
|
|
|
|
if seen == nil {
|
|
|
|
seen = map[types.Type]bool{}
|
|
|
|
}
|
|
|
|
if seen[T] {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
seen[T] = true
|
|
|
|
var out []Field
|
|
|
|
for i := 0; i < T.NumFields(); i++ {
|
|
|
|
field := T.Field(i)
|
|
|
|
tag := T.Tag(i)
|
|
|
|
np := append(path[:len(path):len(path)], i)
|
|
|
|
if field.Anonymous() {
|
|
|
|
if s, ok := Dereference(field.Type()).Underlying().(*types.Struct); ok {
|
|
|
|
out = append(out, flattenFields(s, np, seen)...)
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
out = append(out, Field{field, tag, np})
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return out
|
|
|
|
}
|