This repository has been archived by the owner on Jan 5, 2019. It is now read-only.
forked from emicklei/proto
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathoption.go
194 lines (180 loc) · 5.11 KB
/
option.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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
// Copyright (c) 2017 Ernest Micklei
//
// MIT License
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
package proto
import "fmt"
import "bytes"
// Option is a protoc compiler option
type Option struct {
Comment *Comment
Name string
Constant Literal
IsEmbedded bool
AggregatedConstants []*NamedLiteral
InlineComment *Comment
}
// columns returns printable source tokens
func (o *Option) columns() (cols []aligned) {
if !o.IsEmbedded {
cols = append(cols, leftAligned("option "))
} else {
cols = append(cols, leftAligned(" ["))
}
cols = append(cols, o.keyValuePair(o.IsEmbedded)...)
if o.IsEmbedded {
cols = append(cols, leftAligned("]"))
}
if !o.IsEmbedded {
cols = append(cols, alignedSemicolon)
if o.InlineComment != nil {
cols = append(cols, notAligned(" //"), notAligned(o.InlineComment.Message()))
}
}
return
}
// keyValuePair returns key = value or "value"
func (o *Option) keyValuePair(embedded bool) (cols []aligned) {
equals := alignedEquals
name := o.Name
if embedded {
return append(cols, leftAligned(name), equals, leftAligned(o.Constant.String())) // numbers right, strings left? TODO
}
return append(cols, rightAligned(name), equals, rightAligned(o.Constant.String()))
}
// parse reads an Option body
// ( ident | "(" fullIdent ")" ) { "." ident } "=" constant ";"
func (o *Option) parse(p *Parser) error {
tok, lit := p.scanIgnoreWhitespace()
if tLEFTPAREN == tok {
tok, lit = p.scanIgnoreWhitespace()
if tok != tIDENT {
if !isKeyword(tok) {
return p.unexpected(lit, "option full identifier", o)
}
}
tok, _ = p.scanIgnoreWhitespace()
if tok != tRIGHTPAREN {
return p.unexpected(lit, "full identifier closing )", o)
}
o.Name = fmt.Sprintf("(%s)", lit)
} else {
// non full ident
if tIDENT != tok {
if !isKeyword(tok) {
return p.unexpected(lit, "option identifier", o)
}
}
o.Name = lit
}
tok, lit = p.scanIgnoreWhitespace()
if tDOT == tok {
// extend identifier
tok, lit = p.scanIgnoreWhitespace()
if tok != tIDENT {
return p.unexpected(lit, "option postfix identifier", o)
}
o.Name = fmt.Sprintf("%s.%s", o.Name, lit)
tok, lit = p.scanIgnoreWhitespace()
}
if tEQUALS != tok {
return p.unexpected(lit, "option constant =", o)
}
p.s.skipWhitespace()
if p.s.peek('{') {
p.s.read()
return o.parseAggregate(p)
}
// non aggregate
l := new(Literal)
if err := l.parse(p); err != nil {
return err
}
o.Constant = *l
return nil
}
// inlineComment is part of commentInliner.
func (o *Option) inlineComment(c *Comment) {
o.InlineComment = c
}
// Accept dispatches the call to the visitor.
func (o *Option) Accept(v Visitor) {
v.VisitOption(o)
}
// Doc is part of Documented
func (o *Option) Doc() *Comment {
return o.Comment
}
// Literal represents intLit,floatLit,strLit or boolLit
type Literal struct {
Source string
IsString bool
}
// String returns the source (if quoted then use double quote).
func (l Literal) String() string {
var buf bytes.Buffer
if l.IsString {
buf.WriteRune('"')
}
buf.WriteString(l.Source)
if l.IsString {
buf.WriteRune('"')
}
return buf.String()
}
// parse expects to read a literal constant after =.
func (l *Literal) parse(p *Parser) error {
l.Source, l.IsString = p.s.scanLiteral()
return nil
}
// NamedLiteral associates a name with a Literal
type NamedLiteral struct {
*Literal
Name string
}
// parseAggregate reads options written using aggregate syntax
func (o *Option) parseAggregate(p *Parser) error {
o.AggregatedConstants = []*NamedLiteral{}
for {
tok, lit := p.scanIgnoreWhitespace()
if tRIGHTCURLY == tok {
break
}
if tIDENT != tok {
return p.unexpected(lit, "option aggregate key", o)
}
key := lit
tok, lit = p.scanIgnoreWhitespace()
if tCOLON != tok {
return p.unexpected(lit, "option aggregate key colon :", o)
}
l := new(Literal)
if err := l.parse(p); err != nil {
return err
}
o.AggregatedConstants = append(o.AggregatedConstants, &NamedLiteral{Name: key, Literal: l})
}
tok, lit := p.scanIgnoreWhitespace()
if tSEMICOLON != tok {
return p.unexpected(lit, "option aggregate end ;", o)
}
return nil
}