2018-10-18 11:06:29 -07:00
|
|
|
// Copyright 2018 The Go Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
2019-05-22 13:42:54 -04:00
|
|
|
package impl
|
2018-10-18 11:06:29 -07:00
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"reflect"
|
2019-07-01 13:45:52 -07:00
|
|
|
"strings"
|
2018-10-18 11:06:29 -07:00
|
|
|
"sync"
|
2019-07-01 13:45:52 -07:00
|
|
|
"unicode"
|
2018-10-18 11:06:29 -07:00
|
|
|
|
2019-07-01 13:45:52 -07:00
|
|
|
"google.golang.org/protobuf/internal/descopts"
|
|
|
|
ptag "google.golang.org/protobuf/internal/encoding/tag"
|
|
|
|
"google.golang.org/protobuf/internal/filedesc"
|
2019-07-07 01:49:59 -07:00
|
|
|
"google.golang.org/protobuf/internal/strs"
|
2019-06-06 13:01:53 -07:00
|
|
|
"google.golang.org/protobuf/reflect/protoreflect"
|
2019-05-13 23:55:40 -07:00
|
|
|
pref "google.golang.org/protobuf/reflect/protoreflect"
|
2019-05-22 00:42:45 -04:00
|
|
|
"google.golang.org/protobuf/reflect/prototype"
|
2018-10-18 11:06:29 -07:00
|
|
|
)
|
|
|
|
|
2019-05-22 13:42:54 -04:00
|
|
|
// legacyWrapMessage wraps v as a protoreflect.ProtoMessage,
|
internal/impl: support legacy extension fields
Implement support for extension fields for messages that use the v1
data structures for extensions. The legacyExtensionFields type wraps a
v1 map to implement the v2 protoreflect.KnownFields interface.
Working on this change revealed a bug in the dynamic construction of
message types for protobuf messages that had cyclic dependencies (e.g.,
message Foo has a sub-field of message Bar, and Bar has a sub-field of Foo).
In such a situation, a deadlock occurs because initialization code depends on
the very initialization code that is currently running. To break these cycles,
we make some systematic changes listed in the following paragraphs.
Generally speaking, we separate the logic for construction and wrapping,
where constuction does not recursively rely on dependencies,
while wrapping may recursively inspect dependencies.
Promote the MessageType.MessageOf method as a standalone MessageOf function
that dynamically finds the proper *MessageType to use. We make it such that
MessageType only supports two forms of messages types:
* Those that fully implement the v2 API.
* Those that do not implement the v2 API at all.
This removes support for the hybrid form that was exploited by message_test.go
In impl/message_test.go, switch each message to look more like how future
generated messages will look like. This is done in reaction to the fact that
MessageType.MessageOf no longer exists.
In value/{map,vector}.go, fix Unwrap to return a pointer since the underlying
reflect.Value is addressable reference value, not a pointer value.
In value/convert.go, split the logic apart so that obtaining a v2 type and
wrapping a type as v2 are distinct operations. Wrapping requires further
initialization than simply creating the initial message type, and calling it
during initial construction would lead to a deadlock.
In protoreflect/go_type.go, we switch back to a lazy initialization of GoType
to avoid a deadlock since the user-provided fn may rely on the fact that
prototype.GoMessage returned.
Change-Id: I5dea00e36fe1a9899bd2ac0aed2c8e51d5d87420
Reviewed-on: https://go-review.googlesource.com/c/148826
Reviewed-by: Herbie Ong <herbie@google.com>
2018-11-06 13:05:20 -08:00
|
|
|
// where v must be a *struct kind and not implement the v2 API already.
|
2019-05-22 13:42:54 -04:00
|
|
|
func legacyWrapMessage(v reflect.Value) pref.ProtoMessage {
|
|
|
|
mt := legacyLoadMessageInfo(v.Type())
|
2018-11-26 22:32:06 -08:00
|
|
|
return mt.MessageOf(v.Interface()).Interface()
|
internal/impl: support legacy extension fields
Implement support for extension fields for messages that use the v1
data structures for extensions. The legacyExtensionFields type wraps a
v1 map to implement the v2 protoreflect.KnownFields interface.
Working on this change revealed a bug in the dynamic construction of
message types for protobuf messages that had cyclic dependencies (e.g.,
message Foo has a sub-field of message Bar, and Bar has a sub-field of Foo).
In such a situation, a deadlock occurs because initialization code depends on
the very initialization code that is currently running. To break these cycles,
we make some systematic changes listed in the following paragraphs.
Generally speaking, we separate the logic for construction and wrapping,
where constuction does not recursively rely on dependencies,
while wrapping may recursively inspect dependencies.
Promote the MessageType.MessageOf method as a standalone MessageOf function
that dynamically finds the proper *MessageType to use. We make it such that
MessageType only supports two forms of messages types:
* Those that fully implement the v2 API.
* Those that do not implement the v2 API at all.
This removes support for the hybrid form that was exploited by message_test.go
In impl/message_test.go, switch each message to look more like how future
generated messages will look like. This is done in reaction to the fact that
MessageType.MessageOf no longer exists.
In value/{map,vector}.go, fix Unwrap to return a pointer since the underlying
reflect.Value is addressable reference value, not a pointer value.
In value/convert.go, split the logic apart so that obtaining a v2 type and
wrapping a type as v2 are distinct operations. Wrapping requires further
initialization than simply creating the initial message type, and calling it
during initial construction would lead to a deadlock.
In protoreflect/go_type.go, we switch back to a lazy initialization of GoType
to avoid a deadlock since the user-provided fn may rely on the fact that
prototype.GoMessage returned.
Change-Id: I5dea00e36fe1a9899bd2ac0aed2c8e51d5d87420
Reviewed-on: https://go-review.googlesource.com/c/148826
Reviewed-by: Herbie Ong <herbie@google.com>
2018-11-06 13:05:20 -08:00
|
|
|
}
|
|
|
|
|
2019-05-22 13:42:54 -04:00
|
|
|
var legacyMessageTypeCache sync.Map // map[reflect.Type]*MessageInfo
|
2018-10-19 16:27:46 -07:00
|
|
|
|
2019-05-22 13:42:54 -04:00
|
|
|
// legacyLoadMessageInfo dynamically loads a *MessageInfo for t,
|
internal/impl: support legacy extension fields
Implement support for extension fields for messages that use the v1
data structures for extensions. The legacyExtensionFields type wraps a
v1 map to implement the v2 protoreflect.KnownFields interface.
Working on this change revealed a bug in the dynamic construction of
message types for protobuf messages that had cyclic dependencies (e.g.,
message Foo has a sub-field of message Bar, and Bar has a sub-field of Foo).
In such a situation, a deadlock occurs because initialization code depends on
the very initialization code that is currently running. To break these cycles,
we make some systematic changes listed in the following paragraphs.
Generally speaking, we separate the logic for construction and wrapping,
where constuction does not recursively rely on dependencies,
while wrapping may recursively inspect dependencies.
Promote the MessageType.MessageOf method as a standalone MessageOf function
that dynamically finds the proper *MessageType to use. We make it such that
MessageType only supports two forms of messages types:
* Those that fully implement the v2 API.
* Those that do not implement the v2 API at all.
This removes support for the hybrid form that was exploited by message_test.go
In impl/message_test.go, switch each message to look more like how future
generated messages will look like. This is done in reaction to the fact that
MessageType.MessageOf no longer exists.
In value/{map,vector}.go, fix Unwrap to return a pointer since the underlying
reflect.Value is addressable reference value, not a pointer value.
In value/convert.go, split the logic apart so that obtaining a v2 type and
wrapping a type as v2 are distinct operations. Wrapping requires further
initialization than simply creating the initial message type, and calling it
during initial construction would lead to a deadlock.
In protoreflect/go_type.go, we switch back to a lazy initialization of GoType
to avoid a deadlock since the user-provided fn may rely on the fact that
prototype.GoMessage returned.
Change-Id: I5dea00e36fe1a9899bd2ac0aed2c8e51d5d87420
Reviewed-on: https://go-review.googlesource.com/c/148826
Reviewed-by: Herbie Ong <herbie@google.com>
2018-11-06 13:05:20 -08:00
|
|
|
// where t must be a *struct kind and not implement the v2 API already.
|
2019-05-22 13:42:54 -04:00
|
|
|
func legacyLoadMessageInfo(t reflect.Type) *MessageInfo {
|
2019-05-22 05:12:36 -04:00
|
|
|
// Fast-path: check if a MessageInfo is cached for this concrete type.
|
2019-05-22 13:42:54 -04:00
|
|
|
if mt, ok := legacyMessageTypeCache.Load(t); ok {
|
|
|
|
return mt.(*MessageInfo)
|
2018-10-19 16:27:46 -07:00
|
|
|
}
|
|
|
|
|
2019-05-22 05:12:36 -04:00
|
|
|
// Slow-path: derive message descriptor and initialize MessageInfo.
|
2019-05-22 13:42:54 -04:00
|
|
|
md := LegacyLoadMessageDesc(t)
|
|
|
|
mt := new(MessageInfo)
|
internal/fileinit: generate reflect data structures from raw descriptors
This CL takes a significantly different approach to generating support
for protobuf reflection. The previous approach involved generating a
large number of Go literals to represent the reflection information.
While that approach was correct, it resulted in too much binary bloat.
The approach taken here initializes the reflection information from
the raw descriptor proto, which is a relatively dense representation
of the protobuf reflection information. In order to keep initialization
cost low, several measures were taken:
* At program init, the bare minimum is parsed in order to initialize
naming information for enums, messages, extensions, and services declared
in the file. This is done because those top-level declarations are often
relevant for registration.
* Only upon first are most of the other data structures for protobuf
reflection actually initialized.
* Instead of using proto.Unmarshal, a hand-written unmarshaler is used.
This allows us to avoid a dependendency on the descriptor proto and also
because the API for the descriptor proto is fundamentally non-performant
since it requires an allocation for every primitive field.
At a high-level, the new implementation lives in internal/fileinit.
Several changes were made to other parts of the repository:
* cmd/protoc-gen-go:
* Stop compressing the raw descriptors. While compression does reduce
the size of the descriptors by approximately 2x, it is a pre-mature
optimization since the descriptors themselves are around 1% of the total
binary bloat that is due to generated protobufs.
* Seeding protobuf reflection from the raw descriptor significantly
simplifies the generator implementation since it is no longer responsible
for constructing a tree of Go literals to represent the same information.
* We remove the generation of the shadow types and instead call
protoimpl.MessageType.MessageOf. Unfortunately, this incurs an allocation
for every call to ProtoReflect since we need to allocate a tuple that wraps
a pointer to the message value, and a pointer to message type.
* internal/impl:
* We add a MessageType.GoType field and make it required that it is
set prior to first use. This is done so that we can avoid calling
MessageType.init except for when it is actually needed. The allows code
to call (*FooMessage)(nil).ProtoReflect().Type() without fearing that the
init code will run, possibly triggering a recursive deadlock (where the
init code depends on getting the Type of some dependency which may be
declared within the same file).
* internal/cmd/generate-types:
* The code to generate reflect/prototype/protofile_list_gen.go was copied
and altered to generated internal/fileinit.desc_list_gen.go.
At a high-level this CL adds significant technical complexity.
However, this is offset by several possible future changes:
* The prototype package can be drastically simplified. We can probably
reimplement internal/legacy to use internal/fileinit instead, allowing us
to drop another dependency on the prototype package. As a result, we can
probably delete most of the constructor types in that package.
* With the prototype package significantly pruned, and the fact that generated
code no longer depend on depends on that package, we can consider merging
what's left of prototype into protodesc.
Change-Id: I6090f023f2e1b6afaf62bd3ae883566242e30715
Reviewed-on: https://go-review.googlesource.com/c/158539
Reviewed-by: Herbie Ong <herbie@google.com>
Reviewed-by: Joe Tsai <thebrokentoaster@gmail.com>
2019-01-18 09:32:24 -08:00
|
|
|
mt.GoType = t
|
2019-05-22 00:42:45 -04:00
|
|
|
mt.PBType = &prototype.Message{
|
|
|
|
MessageDescriptor: md,
|
|
|
|
NewMessage: func() pref.Message {
|
|
|
|
return mt.MessageOf(reflect.New(t.Elem()).Interface())
|
|
|
|
},
|
|
|
|
}
|
2019-05-22 13:42:54 -04:00
|
|
|
if mt, ok := legacyMessageTypeCache.LoadOrStore(t, mt); ok {
|
|
|
|
return mt.(*MessageInfo)
|
2019-03-19 14:14:29 -07:00
|
|
|
}
|
internal/impl: support legacy extension fields
Implement support for extension fields for messages that use the v1
data structures for extensions. The legacyExtensionFields type wraps a
v1 map to implement the v2 protoreflect.KnownFields interface.
Working on this change revealed a bug in the dynamic construction of
message types for protobuf messages that had cyclic dependencies (e.g.,
message Foo has a sub-field of message Bar, and Bar has a sub-field of Foo).
In such a situation, a deadlock occurs because initialization code depends on
the very initialization code that is currently running. To break these cycles,
we make some systematic changes listed in the following paragraphs.
Generally speaking, we separate the logic for construction and wrapping,
where constuction does not recursively rely on dependencies,
while wrapping may recursively inspect dependencies.
Promote the MessageType.MessageOf method as a standalone MessageOf function
that dynamically finds the proper *MessageType to use. We make it such that
MessageType only supports two forms of messages types:
* Those that fully implement the v2 API.
* Those that do not implement the v2 API at all.
This removes support for the hybrid form that was exploited by message_test.go
In impl/message_test.go, switch each message to look more like how future
generated messages will look like. This is done in reaction to the fact that
MessageType.MessageOf no longer exists.
In value/{map,vector}.go, fix Unwrap to return a pointer since the underlying
reflect.Value is addressable reference value, not a pointer value.
In value/convert.go, split the logic apart so that obtaining a v2 type and
wrapping a type as v2 are distinct operations. Wrapping requires further
initialization than simply creating the initial message type, and calling it
during initial construction would lead to a deadlock.
In protoreflect/go_type.go, we switch back to a lazy initialization of GoType
to avoid a deadlock since the user-provided fn may rely on the fact that
prototype.GoMessage returned.
Change-Id: I5dea00e36fe1a9899bd2ac0aed2c8e51d5d87420
Reviewed-on: https://go-review.googlesource.com/c/148826
Reviewed-by: Herbie Ong <herbie@google.com>
2018-11-06 13:05:20 -08:00
|
|
|
return mt
|
2018-10-19 16:27:46 -07:00
|
|
|
}
|
|
|
|
|
2019-06-06 13:01:53 -07:00
|
|
|
var legacyMessageDescCache sync.Map // map[reflect.Type]protoreflect.MessageDescriptor
|
2018-10-18 11:06:29 -07:00
|
|
|
|
2019-05-22 13:42:54 -04:00
|
|
|
// LegacyLoadMessageDesc returns an MessageDescriptor derived from the Go type,
|
2018-10-19 16:27:46 -07:00
|
|
|
// which must be a *struct kind and not implement the v2 API already.
|
2019-03-25 14:41:32 -07:00
|
|
|
//
|
|
|
|
// This is exported for testing purposes.
|
2019-05-22 13:42:54 -04:00
|
|
|
func LegacyLoadMessageDesc(t reflect.Type) pref.MessageDescriptor {
|
2018-10-18 11:06:29 -07:00
|
|
|
// Fast-path: check if a MessageDescriptor is cached for this concrete type.
|
2019-05-22 13:42:54 -04:00
|
|
|
if mi, ok := legacyMessageDescCache.Load(t); ok {
|
2018-10-18 11:06:29 -07:00
|
|
|
return mi.(pref.MessageDescriptor)
|
|
|
|
}
|
|
|
|
|
2019-06-06 13:01:53 -07:00
|
|
|
// Slow-path: initialize MessageDescriptor from the raw descriptor.
|
2018-10-18 11:06:29 -07:00
|
|
|
mv := reflect.New(t.Elem()).Interface()
|
|
|
|
if _, ok := mv.(pref.ProtoMessage); ok {
|
|
|
|
panic(fmt.Sprintf("%v already implements proto.Message", t))
|
|
|
|
}
|
2019-06-06 13:01:53 -07:00
|
|
|
mdV1, ok := mv.(messageV1)
|
|
|
|
if !ok {
|
2019-07-02 10:51:24 -07:00
|
|
|
return aberrantLoadMessageDesc(t)
|
2018-10-18 11:06:29 -07:00
|
|
|
}
|
2019-06-06 13:01:53 -07:00
|
|
|
b, idxs := mdV1.Descriptor()
|
2018-10-18 11:06:29 -07:00
|
|
|
|
2019-06-06 13:01:53 -07:00
|
|
|
md := legacyLoadFileDesc(b).Messages().Get(idxs[0])
|
|
|
|
for _, i := range idxs[1:] {
|
|
|
|
md = md.Messages().Get(i)
|
2018-10-18 11:06:29 -07:00
|
|
|
}
|
2019-06-06 13:01:53 -07:00
|
|
|
if md, ok := legacyMessageDescCache.LoadOrStore(t, md); ok {
|
|
|
|
return md.(protoreflect.MessageDescriptor)
|
2018-10-18 11:06:29 -07:00
|
|
|
}
|
2019-06-06 13:01:53 -07:00
|
|
|
return md
|
2018-10-18 11:06:29 -07:00
|
|
|
}
|
2019-07-01 13:45:52 -07:00
|
|
|
|
2019-07-02 10:51:24 -07:00
|
|
|
var (
|
|
|
|
aberrantMessageDescLock sync.Mutex
|
|
|
|
aberrantMessageDescCache map[reflect.Type]protoreflect.MessageDescriptor
|
|
|
|
)
|
2019-07-01 13:45:52 -07:00
|
|
|
|
2019-07-06 17:38:44 -07:00
|
|
|
// aberrantLoadMessageDesc returns an EnumDescriptor derived from the Go type,
|
2019-07-01 13:45:52 -07:00
|
|
|
// which must not implement protoreflect.ProtoMessage or messageV1.
|
|
|
|
//
|
|
|
|
// This is a best-effort derivation of the message descriptor using the protobuf
|
|
|
|
// tags on the struct fields.
|
2019-07-02 10:51:24 -07:00
|
|
|
func aberrantLoadMessageDesc(t reflect.Type) pref.MessageDescriptor {
|
|
|
|
aberrantMessageDescLock.Lock()
|
|
|
|
defer aberrantMessageDescLock.Unlock()
|
|
|
|
if aberrantMessageDescCache == nil {
|
|
|
|
aberrantMessageDescCache = make(map[reflect.Type]protoreflect.MessageDescriptor)
|
2019-07-01 13:45:52 -07:00
|
|
|
}
|
2019-07-02 10:51:24 -07:00
|
|
|
return aberrantLoadMessageDescReentrant(t)
|
|
|
|
}
|
|
|
|
func aberrantLoadMessageDescReentrant(t reflect.Type) pref.MessageDescriptor {
|
|
|
|
// Fast-path: check if an MessageDescriptor is cached for this concrete type.
|
|
|
|
if md, ok := aberrantMessageDescCache[t]; ok {
|
|
|
|
return md
|
2019-07-01 13:45:52 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
// Slow-path: construct a descriptor from the Go struct type (best-effort).
|
2019-07-02 10:51:24 -07:00
|
|
|
// Cache the MessageDescriptor early on so that we can resolve internal
|
|
|
|
// cyclic references.
|
|
|
|
md := &filedesc.Message{L2: new(filedesc.MessageL2)}
|
2019-07-01 13:45:52 -07:00
|
|
|
md.L0.FullName = aberrantDeriveFullName(t.Elem())
|
|
|
|
md.L0.ParentFile = filedesc.SurrogateProto2
|
2019-07-02 10:51:24 -07:00
|
|
|
aberrantMessageDescCache[t] = md
|
2019-07-01 13:45:52 -07:00
|
|
|
|
|
|
|
// Try to determine if the message is using proto3 by checking scalars.
|
|
|
|
for i := 0; i < t.Elem().NumField(); i++ {
|
|
|
|
f := t.Elem().Field(i)
|
|
|
|
if tag := f.Tag.Get("protobuf"); tag != "" {
|
|
|
|
switch f.Type.Kind() {
|
|
|
|
case reflect.Bool, reflect.Int32, reflect.Int64, reflect.Uint32, reflect.Uint64, reflect.Float32, reflect.Float64, reflect.String:
|
|
|
|
md.L0.ParentFile = filedesc.SurrogateProto3
|
|
|
|
}
|
|
|
|
for _, s := range strings.Split(tag, ",") {
|
|
|
|
if s == "proto3" {
|
|
|
|
md.L0.ParentFile = filedesc.SurrogateProto3
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Obtain a list of oneof wrapper types.
|
|
|
|
var oneofWrappers []reflect.Type
|
|
|
|
if fn, ok := t.MethodByName("XXX_OneofFuncs"); ok {
|
|
|
|
vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[3]
|
|
|
|
for _, v := range vs.Interface().([]interface{}) {
|
|
|
|
oneofWrappers = append(oneofWrappers, reflect.TypeOf(v))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if fn, ok := t.MethodByName("XXX_OneofWrappers"); ok {
|
|
|
|
vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[0]
|
|
|
|
for _, v := range vs.Interface().([]interface{}) {
|
|
|
|
oneofWrappers = append(oneofWrappers, reflect.TypeOf(v))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Obtain a list of the extension ranges.
|
|
|
|
if fn, ok := t.MethodByName("ExtensionRangeArray"); ok {
|
|
|
|
vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[0]
|
|
|
|
for i := 0; i < vs.Len(); i++ {
|
|
|
|
v := vs.Index(i)
|
|
|
|
md.L2.ExtensionRanges.List = append(md.L2.ExtensionRanges.List, [2]pref.FieldNumber{
|
|
|
|
pref.FieldNumber(v.FieldByName("Start").Int()),
|
|
|
|
pref.FieldNumber(v.FieldByName("End").Int() + 1),
|
|
|
|
})
|
|
|
|
md.L2.ExtensionRangeOptions = append(md.L2.ExtensionRangeOptions, nil)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Derive the message fields by inspecting the struct fields.
|
|
|
|
for i := 0; i < t.Elem().NumField(); i++ {
|
|
|
|
f := t.Elem().Field(i)
|
|
|
|
if tag := f.Tag.Get("protobuf"); tag != "" {
|
|
|
|
tagKey := f.Tag.Get("protobuf_key")
|
|
|
|
tagVal := f.Tag.Get("protobuf_val")
|
|
|
|
aberrantAppendField(md, f.Type, tag, tagKey, tagVal)
|
|
|
|
}
|
|
|
|
if tag := f.Tag.Get("protobuf_oneof"); tag != "" {
|
|
|
|
n := len(md.L2.Oneofs.List)
|
|
|
|
md.L2.Oneofs.List = append(md.L2.Oneofs.List, filedesc.Oneof{})
|
|
|
|
od := &md.L2.Oneofs.List[n]
|
|
|
|
od.L0.FullName = md.FullName().Append(pref.Name(tag))
|
|
|
|
od.L0.ParentFile = md.L0.ParentFile
|
|
|
|
od.L0.Parent = md
|
|
|
|
od.L0.Index = n
|
|
|
|
|
|
|
|
for _, t := range oneofWrappers {
|
|
|
|
if t.Implements(f.Type) {
|
|
|
|
f := t.Elem().Field(0)
|
|
|
|
if tag := f.Tag.Get("protobuf"); tag != "" {
|
|
|
|
aberrantAppendField(md, f.Type, tag, "", "")
|
|
|
|
fd := &md.L2.Fields.List[len(md.L2.Fields.List)-1]
|
|
|
|
fd.L1.ContainingOneof = od
|
|
|
|
od.L1.Fields.List = append(od.L1.Fields.List, fd)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: Use custom Marshal/Unmarshal methods for the fast-path?
|
|
|
|
|
|
|
|
return md
|
|
|
|
}
|
|
|
|
|
|
|
|
func aberrantAppendField(md *filedesc.Message, goType reflect.Type, tag, tagKey, tagVal string) {
|
|
|
|
t := goType
|
|
|
|
isOptional := t.Kind() == reflect.Ptr && t.Elem().Kind() != reflect.Struct
|
|
|
|
isRepeated := t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8
|
|
|
|
if isOptional || isRepeated {
|
|
|
|
t = t.Elem()
|
|
|
|
}
|
|
|
|
fd := ptag.Unmarshal(tag, t, placeholderEnumValues{}).(*filedesc.Field)
|
|
|
|
|
|
|
|
// Append field descriptor to the message.
|
|
|
|
n := len(md.L2.Fields.List)
|
|
|
|
md.L2.Fields.List = append(md.L2.Fields.List, *fd)
|
|
|
|
fd = &md.L2.Fields.List[n]
|
|
|
|
fd.L0.FullName = md.FullName().Append(fd.Name())
|
|
|
|
fd.L0.ParentFile = md.L0.ParentFile
|
|
|
|
fd.L0.Parent = md
|
|
|
|
fd.L0.Index = n
|
|
|
|
|
|
|
|
if fd.L1.IsWeak || fd.L1.HasPacked {
|
|
|
|
fd.L1.Options = func() pref.ProtoMessage {
|
|
|
|
opts := descopts.Field.ProtoReflect().New()
|
|
|
|
if fd.L1.IsWeak {
|
|
|
|
opts.Set(opts.Descriptor().Fields().ByName("weak"), protoreflect.ValueOf(true))
|
|
|
|
}
|
|
|
|
if fd.L1.HasPacked {
|
|
|
|
opts.Set(opts.Descriptor().Fields().ByName("packed"), protoreflect.ValueOf(fd.L1.IsPacked))
|
|
|
|
}
|
|
|
|
return opts.Interface()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Populate Enum and Message.
|
|
|
|
if fd.Enum() == nil && fd.Kind() == pref.EnumKind {
|
|
|
|
switch v := reflect.Zero(t).Interface().(type) {
|
|
|
|
case pref.Enum:
|
|
|
|
fd.L1.Enum = v.Descriptor()
|
|
|
|
default:
|
|
|
|
fd.L1.Enum = LegacyLoadEnumDesc(t)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if fd.Message() == nil && (fd.Kind() == pref.MessageKind || fd.Kind() == pref.GroupKind) {
|
|
|
|
switch v := reflect.Zero(t).Interface().(type) {
|
|
|
|
case pref.ProtoMessage:
|
|
|
|
fd.L1.Message = v.ProtoReflect().Descriptor()
|
2019-07-02 10:51:24 -07:00
|
|
|
case messageV1:
|
|
|
|
fd.L1.Message = LegacyLoadMessageDesc(t)
|
2019-07-01 13:45:52 -07:00
|
|
|
default:
|
|
|
|
if t.Kind() == reflect.Map {
|
|
|
|
n := len(md.L1.Messages.List)
|
|
|
|
md.L1.Messages.List = append(md.L1.Messages.List, filedesc.Message{L2: new(filedesc.MessageL2)})
|
|
|
|
md2 := &md.L1.Messages.List[n]
|
2019-07-07 01:49:59 -07:00
|
|
|
md2.L0.FullName = md.FullName().Append(pref.Name(strs.MapEntryName(string(fd.Name()))))
|
2019-07-01 13:45:52 -07:00
|
|
|
md2.L0.ParentFile = md.L0.ParentFile
|
|
|
|
md2.L0.Parent = md
|
|
|
|
md2.L0.Index = n
|
|
|
|
|
|
|
|
md2.L2.IsMapEntry = true
|
|
|
|
md2.L2.Options = func() pref.ProtoMessage {
|
|
|
|
opts := descopts.Message.ProtoReflect().New()
|
|
|
|
opts.Set(opts.Descriptor().Fields().ByName("map_entry"), protoreflect.ValueOf(true))
|
|
|
|
return opts.Interface()
|
|
|
|
}
|
|
|
|
|
|
|
|
aberrantAppendField(md2, t.Key(), tagKey, "", "")
|
|
|
|
aberrantAppendField(md2, t.Elem(), tagVal, "", "")
|
|
|
|
|
|
|
|
fd.L1.Message = md2
|
|
|
|
break
|
|
|
|
}
|
2019-07-02 10:51:24 -07:00
|
|
|
fd.L1.Message = aberrantLoadMessageDescReentrant(t)
|
2019-07-01 13:45:52 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type placeholderEnumValues struct {
|
|
|
|
protoreflect.EnumValueDescriptors
|
|
|
|
}
|
|
|
|
|
|
|
|
func (placeholderEnumValues) ByNumber(n pref.EnumNumber) pref.EnumValueDescriptor {
|
|
|
|
return filedesc.PlaceholderEnumValue(pref.FullName(fmt.Sprintf("UNKNOWN_%d", n)))
|
|
|
|
}
|
|
|
|
|
|
|
|
// aberrantMapEntryName derives the name for a map entry message.
|
|
|
|
// See protoc v3.8.0: src/google/protobuf/descriptor.cc:254-276,6057
|
|
|
|
func aberrantMapEntryName(s pref.Name) pref.Name {
|
|
|
|
var b []byte
|
|
|
|
upperNext := true
|
|
|
|
for _, c := range s {
|
|
|
|
switch {
|
|
|
|
case c == '_':
|
|
|
|
upperNext = true
|
|
|
|
case upperNext:
|
|
|
|
b = append(b, byte(unicode.ToUpper(c)))
|
|
|
|
upperNext = false
|
|
|
|
default:
|
|
|
|
b = append(b, byte(c))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
b = append(b, "Entry"...)
|
|
|
|
return pref.Name(b)
|
|
|
|
}
|