From fcc6d71be2c3ce7d9305c04fc2e87af554571bac Mon Sep 17 00:00:00 2001
From: Dmitry Vyukov <dvyukov@google.com>
Date: Mon, 22 Feb 2021 20:37:25 +0100
Subject: go.mod: update golangci-lint to v1.37

---
 vendor/github.com/fzipp/gocyclo/complexity.go | 48 +++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 vendor/github.com/fzipp/gocyclo/complexity.go

(limited to 'vendor/github.com/fzipp/gocyclo/complexity.go')

diff --git a/vendor/github.com/fzipp/gocyclo/complexity.go b/vendor/github.com/fzipp/gocyclo/complexity.go
new file mode 100644
index 000000000..65f5077e8
--- /dev/null
+++ b/vendor/github.com/fzipp/gocyclo/complexity.go
@@ -0,0 +1,48 @@
+// Copyright 2020 Frederik Zipp. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+// Package gocyclo calculates the cyclomatic complexities of functions and
+// methods in Go source code.
+package gocyclo
+
+import (
+	"go/ast"
+	"go/token"
+)
+
+// Complexity calculates the cyclomatic complexity of a function.
+// The 'fn' node is either a *ast.FuncDecl or a *ast.FuncLit.
+func Complexity(fn ast.Node) int {
+	v := complexityVisitor{
+		complexity: 1,
+	}
+	ast.Walk(&v, fn)
+	return v.complexity
+}
+
+type complexityVisitor struct {
+	// complexity is the cyclomatic complexity
+	complexity int
+}
+
+// Visit implements the ast.Visitor interface.
+func (v *complexityVisitor) Visit(n ast.Node) ast.Visitor {
+	switch n := n.(type) {
+	case *ast.IfStmt, *ast.ForStmt, *ast.RangeStmt:
+		v.complexity++
+	case *ast.CaseClause:
+		if n.List != nil { // ignore default case
+			v.complexity++
+		}
+	case *ast.CommClause:
+		if n.Comm != nil { // ignore default case
+			v.complexity++
+		}
+	case *ast.BinaryExpr:
+		if n.Op == token.LAND || n.Op == token.LOR {
+			v.complexity++
+		}
+	}
+	return v
+}
-- 
cgit mrf-deployment