forked from chrusty/protoc-gen-jsonschema
/
proto_package.go
169 lines (151 loc) · 5.1 KB
/
proto_package.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
package converter
import (
"strings"
descriptor "google.golang.org/protobuf/types/descriptorpb"
)
// ProtoPackage describes a package of Protobuf, which is an container of message types.
type ProtoPackage struct {
file *descriptor.FileDescriptorProto
name string
parent *ProtoPackage
children map[string]*ProtoPackage
types map[string]*descriptor.DescriptorProto
enums map[string]*descriptor.EnumDescriptorProto
}
func newProtoPackage(parent *ProtoPackage, name string) *ProtoPackage {
pkgName := name
if parent != nil {
pkgName = parent.name + "." + name
}
return &ProtoPackage{
name: pkgName,
parent: parent,
children: make(map[string]*ProtoPackage),
types: make(map[string]*descriptor.DescriptorProto),
enums: make(map[string]*descriptor.EnumDescriptorProto),
}
}
func (c *Converter) lookupType(pkg *ProtoPackage, name string) (*descriptor.DescriptorProto, string, bool) {
if strings.HasPrefix(name, ".") {
return c.relativelyLookupType(globalPkg, name[1:])
}
for ; pkg != nil; pkg = pkg.parent {
if desc, pkgName, ok := c.relativelyLookupType(pkg, name); ok {
return desc, pkgName, ok
}
}
return nil, "", false
}
func (c *Converter) lookupEnum(pkg *ProtoPackage, name string) (*descriptor.EnumDescriptorProto, string, bool) {
if strings.HasPrefix(name, ".") {
return c.relativelyLookupEnum(globalPkg, name[1:])
}
for ; pkg != nil; pkg = pkg.parent {
if desc, pkgName, ok := c.relativelyLookupEnum(pkg, name); ok {
return desc, pkgName, ok
}
}
return nil, "", false
}
func (c *Converter) relativelyLookupType(pkg *ProtoPackage, name string) (*descriptor.DescriptorProto, string, bool) {
components := strings.SplitN(name, ".", 2)
switch len(components) {
case 0:
c.logger.Debug("empty message name")
return nil, "", false
case 1:
found, ok := pkg.types[components[0]]
return found, pkg.name, ok
case 2:
c.logger.Tracef("Looking for %s in %s at %s (%v)", components[1], components[0], pkg.name, pkg)
if child, ok := pkg.children[components[0]]; ok {
found, pkgName, ok := c.relativelyLookupType(child, components[1])
return found, pkgName, ok
}
if msg, ok := pkg.types[components[0]]; ok {
found, ok := c.relativelyLookupNestedType(msg, components[1])
return found, pkg.name, ok
}
c.logger.WithField("component", components[0]).WithField("package_name", pkg.name).Debug("No such package nor message in package")
return nil, "", false
default:
c.logger.Error("Failed to lookup type")
return nil, "", false
}
}
func (c *Converter) relativelyLookupNestedType(desc *descriptor.DescriptorProto, name string) (*descriptor.DescriptorProto, bool) {
components := strings.Split(name, ".")
componentLoop:
for _, component := range components {
for _, nested := range desc.GetNestedType() {
if nested.GetName() == component {
desc = nested
continue componentLoop
}
}
c.logger.WithField("component", component).WithField("description", desc.GetName()).Info("no such nested message")
return nil, false
}
return desc, true
}
func (c *Converter) relativelyLookupEnum(pkg *ProtoPackage, name string) (*descriptor.EnumDescriptorProto, string, bool) {
components := strings.SplitN(name, ".", 2)
switch len(components) {
case 0:
c.logger.Debug("empty enum name")
return nil, "", false
case 1:
found, ok := pkg.enums[components[0]]
return found, pkg.name, ok
case 2:
c.logger.Tracef("Looking for %s in %s at %s (%v)", components[1], components[0], pkg.name, pkg)
if child, ok := pkg.children[components[0]]; ok {
found, pkgName, ok := c.relativelyLookupEnum(child, components[1])
return found, pkgName, ok
}
if msg, ok := pkg.types[components[0]]; ok {
found, ok := c.relativelyLookupNestedEnum(msg, components[1])
return found, pkg.name, ok
}
c.logger.WithField("component", components[0]).WithField("package_name", pkg.name).Debug("No such package nor message in package")
return nil, "", false
default:
c.logger.Error("Failed to lookup type")
return nil, "", false
}
}
func (c *Converter) relativelyLookupNestedEnum(desc *descriptor.DescriptorProto, name string) (*descriptor.EnumDescriptorProto, bool) {
components := strings.Split(name, ".")
parent := desc
if len(components) > 1 {
// The enum is nested inside a potentially nested message definition.
msgComponents := strings.Join(components[0:len(components)-1], ".")
var found bool
parent, found = c.relativelyLookupNestedType(parent, msgComponents)
if !found {
return nil, false
}
}
// The enum is nested inside of a nested message. We need to dive down the
// tree to find the message the enum is nested in. Then we need to obtain the
// enum.
enumName := components[len(components)-1]
for _, enum := range parent.GetEnumType() {
if enum.GetName() == enumName {
return enum, true
}
}
return nil, false
}
func (c *Converter) relativelyLookupPackage(pkg *ProtoPackage, file *descriptor.FileDescriptorProto) (*ProtoPackage, bool) {
components := strings.Split(file.GetPackage(), ".")
for _, c := range components {
var ok bool
pkg, ok = pkg.children[c]
if !ok {
return nil, false
}
}
pkg.file = file
return pkg, true
}