message_reflect.go 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435
  1. // Copyright 2019 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. "google.golang.org/protobuf/internal/detrand"
  9. "google.golang.org/protobuf/internal/pragma"
  10. pref "google.golang.org/protobuf/reflect/protoreflect"
  11. )
  12. type reflectMessageInfo struct {
  13. fields map[pref.FieldNumber]*fieldInfo
  14. oneofs map[pref.Name]*oneofInfo
  15. // fieldTypes contains the zero value of an enum or message field.
  16. // For lists, it contains the element type.
  17. // For maps, it contains the entry value type.
  18. fieldTypes map[pref.FieldNumber]interface{}
  19. // denseFields is a subset of fields where:
  20. // 0 < fieldDesc.Number() < len(denseFields)
  21. // It provides faster access to the fieldInfo, but may be incomplete.
  22. denseFields []*fieldInfo
  23. // rangeInfos is a list of all fields (not belonging to a oneof) and oneofs.
  24. rangeInfos []interface{} // either *fieldInfo or *oneofInfo
  25. getUnknown func(pointer) pref.RawFields
  26. setUnknown func(pointer, pref.RawFields)
  27. extensionMap func(pointer) *extensionMap
  28. nilMessage atomicNilMessage
  29. }
  30. // makeReflectFuncs generates the set of functions to support reflection.
  31. func (mi *MessageInfo) makeReflectFuncs(t reflect.Type, si structInfo) {
  32. mi.makeKnownFieldsFunc(si)
  33. mi.makeUnknownFieldsFunc(t, si)
  34. mi.makeExtensionFieldsFunc(t, si)
  35. mi.makeFieldTypes(si)
  36. }
  37. // makeKnownFieldsFunc generates functions for operations that can be performed
  38. // on each protobuf message field. It takes in a reflect.Type representing the
  39. // Go struct and matches message fields with struct fields.
  40. //
  41. // This code assumes that the struct is well-formed and panics if there are
  42. // any discrepancies.
  43. func (mi *MessageInfo) makeKnownFieldsFunc(si structInfo) {
  44. mi.fields = map[pref.FieldNumber]*fieldInfo{}
  45. md := mi.Desc
  46. fds := md.Fields()
  47. for i := 0; i < fds.Len(); i++ {
  48. fd := fds.Get(i)
  49. fs := si.fieldsByNumber[fd.Number()]
  50. var fi fieldInfo
  51. switch {
  52. case fd.ContainingOneof() != nil && !fd.ContainingOneof().IsSynthetic():
  53. fi = fieldInfoForOneof(fd, si.oneofsByName[fd.ContainingOneof().Name()], mi.Exporter, si.oneofWrappersByNumber[fd.Number()])
  54. case fd.IsMap():
  55. fi = fieldInfoForMap(fd, fs, mi.Exporter)
  56. case fd.IsList():
  57. fi = fieldInfoForList(fd, fs, mi.Exporter)
  58. case fd.IsWeak():
  59. fi = fieldInfoForWeakMessage(fd, si.weakOffset)
  60. case fd.Message() != nil:
  61. fi = fieldInfoForMessage(fd, fs, mi.Exporter)
  62. default:
  63. fi = fieldInfoForScalar(fd, fs, mi.Exporter)
  64. }
  65. mi.fields[fd.Number()] = &fi
  66. }
  67. mi.oneofs = map[pref.Name]*oneofInfo{}
  68. for i := 0; i < md.Oneofs().Len(); i++ {
  69. od := md.Oneofs().Get(i)
  70. mi.oneofs[od.Name()] = makeOneofInfo(od, si, mi.Exporter)
  71. }
  72. mi.denseFields = make([]*fieldInfo, fds.Len()*2)
  73. for i := 0; i < fds.Len(); i++ {
  74. if fd := fds.Get(i); int(fd.Number()) < len(mi.denseFields) {
  75. mi.denseFields[fd.Number()] = mi.fields[fd.Number()]
  76. }
  77. }
  78. for i := 0; i < fds.Len(); {
  79. fd := fds.Get(i)
  80. if od := fd.ContainingOneof(); od != nil && !od.IsSynthetic() {
  81. mi.rangeInfos = append(mi.rangeInfos, mi.oneofs[od.Name()])
  82. i += od.Fields().Len()
  83. } else {
  84. mi.rangeInfos = append(mi.rangeInfos, mi.fields[fd.Number()])
  85. i++
  86. }
  87. }
  88. // Introduce instability to iteration order, but keep it deterministic.
  89. if len(mi.rangeInfos) > 1 && detrand.Bool() {
  90. i := detrand.Intn(len(mi.rangeInfos) - 1)
  91. mi.rangeInfos[i], mi.rangeInfos[i+1] = mi.rangeInfos[i+1], mi.rangeInfos[i]
  92. }
  93. }
  94. func (mi *MessageInfo) makeUnknownFieldsFunc(t reflect.Type, si structInfo) {
  95. switch {
  96. case si.unknownOffset.IsValid() && si.unknownType == unknownFieldsAType:
  97. // Handle as []byte.
  98. mi.getUnknown = func(p pointer) pref.RawFields {
  99. if p.IsNil() {
  100. return nil
  101. }
  102. return *p.Apply(mi.unknownOffset).Bytes()
  103. }
  104. mi.setUnknown = func(p pointer, b pref.RawFields) {
  105. if p.IsNil() {
  106. panic("invalid SetUnknown on nil Message")
  107. }
  108. *p.Apply(mi.unknownOffset).Bytes() = b
  109. }
  110. case si.unknownOffset.IsValid() && si.unknownType == unknownFieldsBType:
  111. // Handle as *[]byte.
  112. mi.getUnknown = func(p pointer) pref.RawFields {
  113. if p.IsNil() {
  114. return nil
  115. }
  116. bp := p.Apply(mi.unknownOffset).BytesPtr()
  117. if *bp == nil {
  118. return nil
  119. }
  120. return **bp
  121. }
  122. mi.setUnknown = func(p pointer, b pref.RawFields) {
  123. if p.IsNil() {
  124. panic("invalid SetUnknown on nil Message")
  125. }
  126. bp := p.Apply(mi.unknownOffset).BytesPtr()
  127. if *bp == nil {
  128. *bp = new([]byte)
  129. }
  130. **bp = b
  131. }
  132. default:
  133. mi.getUnknown = func(pointer) pref.RawFields {
  134. return nil
  135. }
  136. mi.setUnknown = func(p pointer, _ pref.RawFields) {
  137. if p.IsNil() {
  138. panic("invalid SetUnknown on nil Message")
  139. }
  140. }
  141. }
  142. }
  143. func (mi *MessageInfo) makeExtensionFieldsFunc(t reflect.Type, si structInfo) {
  144. if si.extensionOffset.IsValid() {
  145. mi.extensionMap = func(p pointer) *extensionMap {
  146. if p.IsNil() {
  147. return (*extensionMap)(nil)
  148. }
  149. v := p.Apply(si.extensionOffset).AsValueOf(extensionFieldsType)
  150. return (*extensionMap)(v.Interface().(*map[int32]ExtensionField))
  151. }
  152. } else {
  153. mi.extensionMap = func(pointer) *extensionMap {
  154. return (*extensionMap)(nil)
  155. }
  156. }
  157. }
  158. func (mi *MessageInfo) makeFieldTypes(si structInfo) {
  159. md := mi.Desc
  160. fds := md.Fields()
  161. for i := 0; i < fds.Len(); i++ {
  162. var ft reflect.Type
  163. fd := fds.Get(i)
  164. fs := si.fieldsByNumber[fd.Number()]
  165. switch {
  166. case fd.ContainingOneof() != nil && !fd.ContainingOneof().IsSynthetic():
  167. if fd.Enum() != nil || fd.Message() != nil {
  168. ft = si.oneofWrappersByNumber[fd.Number()].Field(0).Type
  169. }
  170. case fd.IsMap():
  171. if fd.MapValue().Enum() != nil || fd.MapValue().Message() != nil {
  172. ft = fs.Type.Elem()
  173. }
  174. case fd.IsList():
  175. if fd.Enum() != nil || fd.Message() != nil {
  176. ft = fs.Type.Elem()
  177. }
  178. case fd.Enum() != nil:
  179. ft = fs.Type
  180. if fd.HasPresence() {
  181. ft = ft.Elem()
  182. }
  183. case fd.Message() != nil:
  184. ft = fs.Type
  185. if fd.IsWeak() {
  186. ft = nil
  187. }
  188. }
  189. if ft != nil {
  190. if mi.fieldTypes == nil {
  191. mi.fieldTypes = make(map[pref.FieldNumber]interface{})
  192. }
  193. mi.fieldTypes[fd.Number()] = reflect.Zero(ft).Interface()
  194. }
  195. }
  196. }
  197. type extensionMap map[int32]ExtensionField
  198. func (m *extensionMap) Range(f func(pref.FieldDescriptor, pref.Value) bool) {
  199. if m != nil {
  200. for _, x := range *m {
  201. xd := x.Type().TypeDescriptor()
  202. v := x.Value()
  203. if xd.IsList() && v.List().Len() == 0 {
  204. continue
  205. }
  206. if !f(xd, v) {
  207. return
  208. }
  209. }
  210. }
  211. }
  212. func (m *extensionMap) Has(xt pref.ExtensionType) (ok bool) {
  213. if m == nil {
  214. return false
  215. }
  216. xd := xt.TypeDescriptor()
  217. x, ok := (*m)[int32(xd.Number())]
  218. if !ok {
  219. return false
  220. }
  221. switch {
  222. case xd.IsList():
  223. return x.Value().List().Len() > 0
  224. case xd.IsMap():
  225. return x.Value().Map().Len() > 0
  226. case xd.Message() != nil:
  227. return x.Value().Message().IsValid()
  228. }
  229. return true
  230. }
  231. func (m *extensionMap) Clear(xt pref.ExtensionType) {
  232. delete(*m, int32(xt.TypeDescriptor().Number()))
  233. }
  234. func (m *extensionMap) Get(xt pref.ExtensionType) pref.Value {
  235. xd := xt.TypeDescriptor()
  236. if m != nil {
  237. if x, ok := (*m)[int32(xd.Number())]; ok {
  238. return x.Value()
  239. }
  240. }
  241. return xt.Zero()
  242. }
  243. func (m *extensionMap) Set(xt pref.ExtensionType, v pref.Value) {
  244. xd := xt.TypeDescriptor()
  245. isValid := true
  246. switch {
  247. case !xt.IsValidValue(v):
  248. isValid = false
  249. case xd.IsList():
  250. isValid = v.List().IsValid()
  251. case xd.IsMap():
  252. isValid = v.Map().IsValid()
  253. case xd.Message() != nil:
  254. isValid = v.Message().IsValid()
  255. }
  256. if !isValid {
  257. panic(fmt.Sprintf("%v: assigning invalid value", xt.TypeDescriptor().FullName()))
  258. }
  259. if *m == nil {
  260. *m = make(map[int32]ExtensionField)
  261. }
  262. var x ExtensionField
  263. x.Set(xt, v)
  264. (*m)[int32(xd.Number())] = x
  265. }
  266. func (m *extensionMap) Mutable(xt pref.ExtensionType) pref.Value {
  267. xd := xt.TypeDescriptor()
  268. if xd.Kind() != pref.MessageKind && xd.Kind() != pref.GroupKind && !xd.IsList() && !xd.IsMap() {
  269. panic("invalid Mutable on field with non-composite type")
  270. }
  271. if x, ok := (*m)[int32(xd.Number())]; ok {
  272. return x.Value()
  273. }
  274. v := xt.New()
  275. m.Set(xt, v)
  276. return v
  277. }
  278. // MessageState is a data structure that is nested as the first field in a
  279. // concrete message. It provides a way to implement the ProtoReflect method
  280. // in an allocation-free way without needing to have a shadow Go type generated
  281. // for every message type. This technique only works using unsafe.
  282. //
  283. //
  284. // Example generated code:
  285. //
  286. // type M struct {
  287. // state protoimpl.MessageState
  288. //
  289. // Field1 int32
  290. // Field2 string
  291. // Field3 *BarMessage
  292. // ...
  293. // }
  294. //
  295. // func (m *M) ProtoReflect() protoreflect.Message {
  296. // mi := &file_fizz_buzz_proto_msgInfos[5]
  297. // if protoimpl.UnsafeEnabled && m != nil {
  298. // ms := protoimpl.X.MessageStateOf(Pointer(m))
  299. // if ms.LoadMessageInfo() == nil {
  300. // ms.StoreMessageInfo(mi)
  301. // }
  302. // return ms
  303. // }
  304. // return mi.MessageOf(m)
  305. // }
  306. //
  307. // The MessageState type holds a *MessageInfo, which must be atomically set to
  308. // the message info associated with a given message instance.
  309. // By unsafely converting a *M into a *MessageState, the MessageState object
  310. // has access to all the information needed to implement protobuf reflection.
  311. // It has access to the message info as its first field, and a pointer to the
  312. // MessageState is identical to a pointer to the concrete message value.
  313. //
  314. //
  315. // Requirements:
  316. // • The type M must implement protoreflect.ProtoMessage.
  317. // • The address of m must not be nil.
  318. // • The address of m and the address of m.state must be equal,
  319. // even though they are different Go types.
  320. type MessageState struct {
  321. pragma.NoUnkeyedLiterals
  322. pragma.DoNotCompare
  323. pragma.DoNotCopy
  324. atomicMessageInfo *MessageInfo
  325. }
  326. type messageState MessageState
  327. var (
  328. _ pref.Message = (*messageState)(nil)
  329. _ unwrapper = (*messageState)(nil)
  330. )
  331. // messageDataType is a tuple of a pointer to the message data and
  332. // a pointer to the message type. It is a generalized way of providing a
  333. // reflective view over a message instance. The disadvantage of this approach
  334. // is the need to allocate this tuple of 16B.
  335. type messageDataType struct {
  336. p pointer
  337. mi *MessageInfo
  338. }
  339. type (
  340. messageReflectWrapper messageDataType
  341. messageIfaceWrapper messageDataType
  342. )
  343. var (
  344. _ pref.Message = (*messageReflectWrapper)(nil)
  345. _ unwrapper = (*messageReflectWrapper)(nil)
  346. _ pref.ProtoMessage = (*messageIfaceWrapper)(nil)
  347. _ unwrapper = (*messageIfaceWrapper)(nil)
  348. )
  349. // MessageOf returns a reflective view over a message. The input must be a
  350. // pointer to a named Go struct. If the provided type has a ProtoReflect method,
  351. // it must be implemented by calling this method.
  352. func (mi *MessageInfo) MessageOf(m interface{}) pref.Message {
  353. if reflect.TypeOf(m) != mi.GoReflectType {
  354. panic(fmt.Sprintf("type mismatch: got %T, want %v", m, mi.GoReflectType))
  355. }
  356. p := pointerOfIface(m)
  357. if p.IsNil() {
  358. return mi.nilMessage.Init(mi)
  359. }
  360. return &messageReflectWrapper{p, mi}
  361. }
  362. func (m *messageReflectWrapper) pointer() pointer { return m.p }
  363. func (m *messageReflectWrapper) messageInfo() *MessageInfo { return m.mi }
  364. func (m *messageIfaceWrapper) ProtoReflect() pref.Message {
  365. return (*messageReflectWrapper)(m)
  366. }
  367. func (m *messageIfaceWrapper) protoUnwrap() interface{} {
  368. return m.p.AsIfaceOf(m.mi.GoReflectType.Elem())
  369. }
  370. // checkField verifies that the provided field descriptor is valid.
  371. // Exactly one of the returned values is populated.
  372. func (mi *MessageInfo) checkField(fd pref.FieldDescriptor) (*fieldInfo, pref.ExtensionType) {
  373. var fi *fieldInfo
  374. if n := fd.Number(); 0 < n && int(n) < len(mi.denseFields) {
  375. fi = mi.denseFields[n]
  376. } else {
  377. fi = mi.fields[n]
  378. }
  379. if fi != nil {
  380. if fi.fieldDesc != fd {
  381. if got, want := fd.FullName(), fi.fieldDesc.FullName(); got != want {
  382. panic(fmt.Sprintf("mismatching field: got %v, want %v", got, want))
  383. }
  384. panic(fmt.Sprintf("mismatching field: %v", fd.FullName()))
  385. }
  386. return fi, nil
  387. }
  388. if fd.IsExtension() {
  389. if got, want := fd.ContainingMessage().FullName(), mi.Desc.FullName(); got != want {
  390. // TODO: Should this be exact containing message descriptor match?
  391. panic(fmt.Sprintf("extension %v has mismatching containing message: got %v, want %v", fd.FullName(), got, want))
  392. }
  393. if !mi.Desc.ExtensionRanges().Has(fd.Number()) {
  394. panic(fmt.Sprintf("extension %v extends %v outside the extension range", fd.FullName(), mi.Desc.FullName()))
  395. }
  396. xtd, ok := fd.(pref.ExtensionTypeDescriptor)
  397. if !ok {
  398. panic(fmt.Sprintf("extension %v does not implement protoreflect.ExtensionTypeDescriptor", fd.FullName()))
  399. }
  400. return nil, xtd.Type()
  401. }
  402. panic(fmt.Sprintf("field %v is invalid", fd.FullName()))
  403. }