legacy_message.go 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301
  1. // Copyright 2018 The Go Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style
  3. // license that can be found in the LICENSE file.
  4. package impl
  5. import (
  6. "fmt"
  7. "reflect"
  8. "strings"
  9. "sync"
  10. "unicode"
  11. "google.golang.org/protobuf/internal/descopts"
  12. ptag "google.golang.org/protobuf/internal/encoding/tag"
  13. "google.golang.org/protobuf/internal/filedesc"
  14. "google.golang.org/protobuf/internal/strs"
  15. "google.golang.org/protobuf/reflect/protoreflect"
  16. pref "google.golang.org/protobuf/reflect/protoreflect"
  17. "google.golang.org/protobuf/reflect/prototype"
  18. )
  19. // legacyWrapMessage wraps v as a protoreflect.ProtoMessage,
  20. // where v must be a *struct kind and not implement the v2 API already.
  21. func legacyWrapMessage(v reflect.Value) pref.ProtoMessage {
  22. mt := legacyLoadMessageInfo(v.Type())
  23. return mt.MessageOf(v.Interface()).Interface()
  24. }
  25. var legacyMessageTypeCache sync.Map // map[reflect.Type]*MessageInfo
  26. // legacyLoadMessageInfo dynamically loads a *MessageInfo for t,
  27. // where t must be a *struct kind and not implement the v2 API already.
  28. func legacyLoadMessageInfo(t reflect.Type) *MessageInfo {
  29. // Fast-path: check if a MessageInfo is cached for this concrete type.
  30. if mt, ok := legacyMessageTypeCache.Load(t); ok {
  31. return mt.(*MessageInfo)
  32. }
  33. // Slow-path: derive message descriptor and initialize MessageInfo.
  34. md := LegacyLoadMessageDesc(t)
  35. mt := new(MessageInfo)
  36. mt.GoType = t
  37. mt.PBType = &prototype.Message{
  38. MessageDescriptor: md,
  39. NewMessage: func() pref.Message {
  40. return mt.MessageOf(reflect.New(t.Elem()).Interface())
  41. },
  42. }
  43. if mt, ok := legacyMessageTypeCache.LoadOrStore(t, mt); ok {
  44. return mt.(*MessageInfo)
  45. }
  46. return mt
  47. }
  48. var legacyMessageDescCache sync.Map // map[reflect.Type]protoreflect.MessageDescriptor
  49. // LegacyLoadMessageDesc returns an MessageDescriptor derived from the Go type,
  50. // which must be a *struct kind and not implement the v2 API already.
  51. //
  52. // This is exported for testing purposes.
  53. func LegacyLoadMessageDesc(t reflect.Type) pref.MessageDescriptor {
  54. // Fast-path: check if a MessageDescriptor is cached for this concrete type.
  55. if mi, ok := legacyMessageDescCache.Load(t); ok {
  56. return mi.(pref.MessageDescriptor)
  57. }
  58. // Slow-path: initialize MessageDescriptor from the raw descriptor.
  59. mv := reflect.New(t.Elem()).Interface()
  60. if _, ok := mv.(pref.ProtoMessage); ok {
  61. panic(fmt.Sprintf("%v already implements proto.Message", t))
  62. }
  63. mdV1, ok := mv.(messageV1)
  64. if !ok {
  65. return aberrantLoadMessageDesc(t)
  66. }
  67. b, idxs := mdV1.Descriptor()
  68. md := legacyLoadFileDesc(b).Messages().Get(idxs[0])
  69. for _, i := range idxs[1:] {
  70. md = md.Messages().Get(i)
  71. }
  72. if md, ok := legacyMessageDescCache.LoadOrStore(t, md); ok {
  73. return md.(protoreflect.MessageDescriptor)
  74. }
  75. return md
  76. }
  77. var (
  78. aberrantMessageDescLock sync.Mutex
  79. aberrantMessageDescCache map[reflect.Type]protoreflect.MessageDescriptor
  80. )
  81. // aberrantLoadMessageDesc returns an EnumDescriptor derived from the Go type,
  82. // which must not implement protoreflect.ProtoMessage or messageV1.
  83. //
  84. // This is a best-effort derivation of the message descriptor using the protobuf
  85. // tags on the struct fields.
  86. func aberrantLoadMessageDesc(t reflect.Type) pref.MessageDescriptor {
  87. aberrantMessageDescLock.Lock()
  88. defer aberrantMessageDescLock.Unlock()
  89. if aberrantMessageDescCache == nil {
  90. aberrantMessageDescCache = make(map[reflect.Type]protoreflect.MessageDescriptor)
  91. }
  92. return aberrantLoadMessageDescReentrant(t)
  93. }
  94. func aberrantLoadMessageDescReentrant(t reflect.Type) pref.MessageDescriptor {
  95. // Fast-path: check if an MessageDescriptor is cached for this concrete type.
  96. if md, ok := aberrantMessageDescCache[t]; ok {
  97. return md
  98. }
  99. // Slow-path: construct a descriptor from the Go struct type (best-effort).
  100. // Cache the MessageDescriptor early on so that we can resolve internal
  101. // cyclic references.
  102. md := &filedesc.Message{L2: new(filedesc.MessageL2)}
  103. md.L0.FullName = aberrantDeriveFullName(t.Elem())
  104. md.L0.ParentFile = filedesc.SurrogateProto2
  105. aberrantMessageDescCache[t] = md
  106. // Try to determine if the message is using proto3 by checking scalars.
  107. for i := 0; i < t.Elem().NumField(); i++ {
  108. f := t.Elem().Field(i)
  109. if tag := f.Tag.Get("protobuf"); tag != "" {
  110. switch f.Type.Kind() {
  111. case reflect.Bool, reflect.Int32, reflect.Int64, reflect.Uint32, reflect.Uint64, reflect.Float32, reflect.Float64, reflect.String:
  112. md.L0.ParentFile = filedesc.SurrogateProto3
  113. }
  114. for _, s := range strings.Split(tag, ",") {
  115. if s == "proto3" {
  116. md.L0.ParentFile = filedesc.SurrogateProto3
  117. }
  118. }
  119. }
  120. }
  121. // Obtain a list of oneof wrapper types.
  122. var oneofWrappers []reflect.Type
  123. if fn, ok := t.MethodByName("XXX_OneofFuncs"); ok {
  124. vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[3]
  125. for _, v := range vs.Interface().([]interface{}) {
  126. oneofWrappers = append(oneofWrappers, reflect.TypeOf(v))
  127. }
  128. }
  129. if fn, ok := t.MethodByName("XXX_OneofWrappers"); ok {
  130. vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[0]
  131. for _, v := range vs.Interface().([]interface{}) {
  132. oneofWrappers = append(oneofWrappers, reflect.TypeOf(v))
  133. }
  134. }
  135. // Obtain a list of the extension ranges.
  136. if fn, ok := t.MethodByName("ExtensionRangeArray"); ok {
  137. vs := fn.Func.Call([]reflect.Value{reflect.Zero(fn.Type.In(0))})[0]
  138. for i := 0; i < vs.Len(); i++ {
  139. v := vs.Index(i)
  140. md.L2.ExtensionRanges.List = append(md.L2.ExtensionRanges.List, [2]pref.FieldNumber{
  141. pref.FieldNumber(v.FieldByName("Start").Int()),
  142. pref.FieldNumber(v.FieldByName("End").Int() + 1),
  143. })
  144. md.L2.ExtensionRangeOptions = append(md.L2.ExtensionRangeOptions, nil)
  145. }
  146. }
  147. // Derive the message fields by inspecting the struct fields.
  148. for i := 0; i < t.Elem().NumField(); i++ {
  149. f := t.Elem().Field(i)
  150. if tag := f.Tag.Get("protobuf"); tag != "" {
  151. tagKey := f.Tag.Get("protobuf_key")
  152. tagVal := f.Tag.Get("protobuf_val")
  153. aberrantAppendField(md, f.Type, tag, tagKey, tagVal)
  154. }
  155. if tag := f.Tag.Get("protobuf_oneof"); tag != "" {
  156. n := len(md.L2.Oneofs.List)
  157. md.L2.Oneofs.List = append(md.L2.Oneofs.List, filedesc.Oneof{})
  158. od := &md.L2.Oneofs.List[n]
  159. od.L0.FullName = md.FullName().Append(pref.Name(tag))
  160. od.L0.ParentFile = md.L0.ParentFile
  161. od.L0.Parent = md
  162. od.L0.Index = n
  163. for _, t := range oneofWrappers {
  164. if t.Implements(f.Type) {
  165. f := t.Elem().Field(0)
  166. if tag := f.Tag.Get("protobuf"); tag != "" {
  167. aberrantAppendField(md, f.Type, tag, "", "")
  168. fd := &md.L2.Fields.List[len(md.L2.Fields.List)-1]
  169. fd.L1.ContainingOneof = od
  170. od.L1.Fields.List = append(od.L1.Fields.List, fd)
  171. }
  172. }
  173. }
  174. }
  175. }
  176. // TODO: Use custom Marshal/Unmarshal methods for the fast-path?
  177. return md
  178. }
  179. func aberrantAppendField(md *filedesc.Message, goType reflect.Type, tag, tagKey, tagVal string) {
  180. t := goType
  181. isOptional := t.Kind() == reflect.Ptr && t.Elem().Kind() != reflect.Struct
  182. isRepeated := t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8
  183. if isOptional || isRepeated {
  184. t = t.Elem()
  185. }
  186. fd := ptag.Unmarshal(tag, t, placeholderEnumValues{}).(*filedesc.Field)
  187. // Append field descriptor to the message.
  188. n := len(md.L2.Fields.List)
  189. md.L2.Fields.List = append(md.L2.Fields.List, *fd)
  190. fd = &md.L2.Fields.List[n]
  191. fd.L0.FullName = md.FullName().Append(fd.Name())
  192. fd.L0.ParentFile = md.L0.ParentFile
  193. fd.L0.Parent = md
  194. fd.L0.Index = n
  195. if fd.L1.IsWeak || fd.L1.HasPacked {
  196. fd.L1.Options = func() pref.ProtoMessage {
  197. opts := descopts.Field.ProtoReflect().New()
  198. if fd.L1.IsWeak {
  199. opts.Set(opts.Descriptor().Fields().ByName("weak"), protoreflect.ValueOf(true))
  200. }
  201. if fd.L1.HasPacked {
  202. opts.Set(opts.Descriptor().Fields().ByName("packed"), protoreflect.ValueOf(fd.L1.IsPacked))
  203. }
  204. return opts.Interface()
  205. }
  206. }
  207. // Populate Enum and Message.
  208. if fd.Enum() == nil && fd.Kind() == pref.EnumKind {
  209. switch v := reflect.Zero(t).Interface().(type) {
  210. case pref.Enum:
  211. fd.L1.Enum = v.Descriptor()
  212. default:
  213. fd.L1.Enum = LegacyLoadEnumDesc(t)
  214. }
  215. }
  216. if fd.Message() == nil && (fd.Kind() == pref.MessageKind || fd.Kind() == pref.GroupKind) {
  217. switch v := reflect.Zero(t).Interface().(type) {
  218. case pref.ProtoMessage:
  219. fd.L1.Message = v.ProtoReflect().Descriptor()
  220. case messageV1:
  221. fd.L1.Message = LegacyLoadMessageDesc(t)
  222. default:
  223. if t.Kind() == reflect.Map {
  224. n := len(md.L1.Messages.List)
  225. md.L1.Messages.List = append(md.L1.Messages.List, filedesc.Message{L2: new(filedesc.MessageL2)})
  226. md2 := &md.L1.Messages.List[n]
  227. md2.L0.FullName = md.FullName().Append(pref.Name(strs.MapEntryName(string(fd.Name()))))
  228. md2.L0.ParentFile = md.L0.ParentFile
  229. md2.L0.Parent = md
  230. md2.L0.Index = n
  231. md2.L2.IsMapEntry = true
  232. md2.L2.Options = func() pref.ProtoMessage {
  233. opts := descopts.Message.ProtoReflect().New()
  234. opts.Set(opts.Descriptor().Fields().ByName("map_entry"), protoreflect.ValueOf(true))
  235. return opts.Interface()
  236. }
  237. aberrantAppendField(md2, t.Key(), tagKey, "", "")
  238. aberrantAppendField(md2, t.Elem(), tagVal, "", "")
  239. fd.L1.Message = md2
  240. break
  241. }
  242. fd.L1.Message = aberrantLoadMessageDescReentrant(t)
  243. }
  244. }
  245. }
  246. type placeholderEnumValues struct {
  247. protoreflect.EnumValueDescriptors
  248. }
  249. func (placeholderEnumValues) ByNumber(n pref.EnumNumber) pref.EnumValueDescriptor {
  250. return filedesc.PlaceholderEnumValue(pref.FullName(fmt.Sprintf("UNKNOWN_%d", n)))
  251. }
  252. // aberrantMapEntryName derives the name for a map entry message.
  253. // See protoc v3.8.0: src/google/protobuf/descriptor.cc:254-276,6057
  254. func aberrantMapEntryName(s pref.Name) pref.Name {
  255. var b []byte
  256. upperNext := true
  257. for _, c := range s {
  258. switch {
  259. case c == '_':
  260. upperNext = true
  261. case upperNext:
  262. b = append(b, byte(unicode.ToUpper(c)))
  263. upperNext = false
  264. default:
  265. b = append(b, byte(c))
  266. }
  267. }
  268. b = append(b, "Entry"...)
  269. return pref.Name(b)
  270. }