187 lines
5.7 KiB
Go
187 lines
5.7 KiB
Go
|
package analysis
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
|
||
|
"github.com/go-openapi/spec"
|
||
|
)
|
||
|
|
||
|
// Mixin modifies the primary swagger spec by adding the paths and
|
||
|
// definitions from the mixin specs. Top level parameters and
|
||
|
// responses from the mixins are also carried over. Operation id
|
||
|
// collisions are avoided by appending "Mixin<N>" but only if
|
||
|
// needed. No other parts of primary are modified. Consider calling
|
||
|
// FixEmptyResponseDescriptions() on the modified primary if you read
|
||
|
// them from storage and they are valid to start with.
|
||
|
//
|
||
|
// Entries in "paths", "definitions", "parameters" and "responses" are
|
||
|
// added to the primary in the order of the given mixins. If the entry
|
||
|
// already exists in primary it is skipped with a warning message.
|
||
|
//
|
||
|
// The count of skipped entries (from collisions) is returned so any
|
||
|
// deviation from the number expected can flag warning in your build
|
||
|
// scripts. Carefully review the collisions before accepting them;
|
||
|
// consider renaming things if possible.
|
||
|
//
|
||
|
// No normalization of any keys takes place (paths, type defs,
|
||
|
// etc). Ensure they are canonical if your downstream tools do
|
||
|
// key normalization of any form.
|
||
|
func Mixin(primary *spec.Swagger, mixins ...*spec.Swagger) []string {
|
||
|
var skipped []string
|
||
|
opIds := getOpIds(primary)
|
||
|
if primary.Paths == nil {
|
||
|
primary.Paths = &spec.Paths{Paths: make(map[string]spec.PathItem)}
|
||
|
}
|
||
|
for i, m := range mixins {
|
||
|
for k, v := range m.Definitions {
|
||
|
// assume name collisions represent IDENTICAL type. careful.
|
||
|
if _, exists := primary.Definitions[k]; exists {
|
||
|
warn := fmt.Sprintf("definitions entry '%v' already exists in primary or higher priority mixin, skipping\n", k)
|
||
|
skipped = append(skipped, warn)
|
||
|
continue
|
||
|
}
|
||
|
primary.Definitions[k] = v
|
||
|
}
|
||
|
if m.Paths != nil {
|
||
|
for k, v := range m.Paths.Paths {
|
||
|
if _, exists := primary.Paths.Paths[k]; exists {
|
||
|
warn := fmt.Sprintf("paths entry '%v' already exists in primary or higher priority mixin, skipping\n", k)
|
||
|
skipped = append(skipped, warn)
|
||
|
continue
|
||
|
}
|
||
|
|
||
|
// Swagger requires that operationIds be
|
||
|
// unique within a spec. If we find a
|
||
|
// collision we append "Mixin0" to the
|
||
|
// operatoinId we are adding, where 0 is mixin
|
||
|
// index. We assume that operationIds with
|
||
|
// all the proivded specs are already unique.
|
||
|
piops := pathItemOps(v)
|
||
|
for _, piop := range piops {
|
||
|
if opIds[piop.ID] {
|
||
|
piop.ID = fmt.Sprintf("%v%v%v", piop.ID, "Mixin", i)
|
||
|
}
|
||
|
opIds[piop.ID] = true
|
||
|
}
|
||
|
primary.Paths.Paths[k] = v
|
||
|
}
|
||
|
}
|
||
|
for k, v := range m.Parameters {
|
||
|
// could try to rename on conflict but would
|
||
|
// have to fix $refs in the mixin. Complain
|
||
|
// for now
|
||
|
if _, exists := primary.Parameters[k]; exists {
|
||
|
warn := fmt.Sprintf("top level parameters entry '%v' already exists in primary or higher priority mixin, skipping\n", k)
|
||
|
skipped = append(skipped, warn)
|
||
|
continue
|
||
|
}
|
||
|
primary.Parameters[k] = v
|
||
|
}
|
||
|
for k, v := range m.Responses {
|
||
|
// could try to rename on conflict but would
|
||
|
// have to fix $refs in the mixin. Complain
|
||
|
// for now
|
||
|
if _, exists := primary.Responses[k]; exists {
|
||
|
warn := fmt.Sprintf("top level responses entry '%v' already exists in primary or higher priority mixin, skipping\n", k)
|
||
|
skipped = append(skipped, warn)
|
||
|
continue
|
||
|
}
|
||
|
primary.Responses[k] = v
|
||
|
}
|
||
|
}
|
||
|
return skipped
|
||
|
}
|
||
|
|
||
|
// FixEmptyResponseDescriptions replaces empty ("") response
|
||
|
// descriptions in the input with "(empty)" to ensure that the
|
||
|
// resulting Swagger is stays valid. The problem appears to arise
|
||
|
// from reading in valid specs that have a explicit response
|
||
|
// description of "" (valid, response.description is required), but
|
||
|
// due to zero values being omitted upon re-serializing (omitempty) we
|
||
|
// lose them unless we stick some chars in there.
|
||
|
func FixEmptyResponseDescriptions(s *spec.Swagger) {
|
||
|
if s.Paths != nil {
|
||
|
for _, v := range s.Paths.Paths {
|
||
|
if v.Get != nil {
|
||
|
FixEmptyDescs(v.Get.Responses)
|
||
|
}
|
||
|
if v.Put != nil {
|
||
|
FixEmptyDescs(v.Put.Responses)
|
||
|
}
|
||
|
if v.Post != nil {
|
||
|
FixEmptyDescs(v.Post.Responses)
|
||
|
}
|
||
|
if v.Delete != nil {
|
||
|
FixEmptyDescs(v.Delete.Responses)
|
||
|
}
|
||
|
if v.Options != nil {
|
||
|
FixEmptyDescs(v.Options.Responses)
|
||
|
}
|
||
|
if v.Head != nil {
|
||
|
FixEmptyDescs(v.Head.Responses)
|
||
|
}
|
||
|
if v.Patch != nil {
|
||
|
FixEmptyDescs(v.Patch.Responses)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
for k, v := range s.Responses {
|
||
|
FixEmptyDesc(&v)
|
||
|
s.Responses[k] = v
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// FixEmptyDescs adds "(empty)" as the description for any Response in
|
||
|
// the given Responses object that doesn't already have one.
|
||
|
func FixEmptyDescs(rs *spec.Responses) {
|
||
|
FixEmptyDesc(rs.Default)
|
||
|
for k, v := range rs.StatusCodeResponses {
|
||
|
FixEmptyDesc(&v)
|
||
|
rs.StatusCodeResponses[k] = v
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// FixEmptyDesc adds "(empty)" as the description to the given
|
||
|
// Response object if it doesn't already have one and isn't a
|
||
|
// ref. No-op on nil input.
|
||
|
func FixEmptyDesc(rs *spec.Response) {
|
||
|
if rs == nil || rs.Description != "" || rs.Ref.Ref.GetURL() != nil {
|
||
|
return
|
||
|
}
|
||
|
rs.Description = "(empty)"
|
||
|
}
|
||
|
|
||
|
// getOpIds extracts all the paths.<path>.operationIds from the given
|
||
|
// spec and returns them as the keys in a map with 'true' values.
|
||
|
func getOpIds(s *spec.Swagger) map[string]bool {
|
||
|
rv := make(map[string]bool)
|
||
|
if s.Paths == nil {
|
||
|
return rv
|
||
|
}
|
||
|
for _, v := range s.Paths.Paths {
|
||
|
piops := pathItemOps(v)
|
||
|
for _, op := range piops {
|
||
|
rv[op.ID] = true
|
||
|
}
|
||
|
}
|
||
|
return rv
|
||
|
}
|
||
|
|
||
|
func pathItemOps(p spec.PathItem) []*spec.Operation {
|
||
|
var rv []*spec.Operation
|
||
|
rv = appendOp(rv, p.Get)
|
||
|
rv = appendOp(rv, p.Put)
|
||
|
rv = appendOp(rv, p.Post)
|
||
|
rv = appendOp(rv, p.Delete)
|
||
|
rv = appendOp(rv, p.Head)
|
||
|
rv = appendOp(rv, p.Patch)
|
||
|
return rv
|
||
|
}
|
||
|
|
||
|
func appendOp(ops []*spec.Operation, op *spec.Operation) []*spec.Operation {
|
||
|
if op == nil {
|
||
|
return ops
|
||
|
}
|
||
|
return append(ops, op)
|
||
|
}
|