codec_message_opaque.go 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. // Copyright 2024 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. "sort"
  9. "google.golang.org/protobuf/encoding/protowire"
  10. "google.golang.org/protobuf/internal/encoding/messageset"
  11. "google.golang.org/protobuf/internal/order"
  12. "google.golang.org/protobuf/reflect/protoreflect"
  13. piface "google.golang.org/protobuf/runtime/protoiface"
  14. )
  15. func (mi *MessageInfo) makeOpaqueCoderMethods(t reflect.Type, si opaqueStructInfo) {
  16. mi.sizecacheOffset = si.sizecacheOffset
  17. mi.unknownOffset = si.unknownOffset
  18. mi.unknownPtrKind = si.unknownType.Kind() == reflect.Ptr
  19. mi.extensionOffset = si.extensionOffset
  20. mi.lazyOffset = si.lazyOffset
  21. mi.presenceOffset = si.presenceOffset
  22. mi.coderFields = make(map[protowire.Number]*coderFieldInfo)
  23. fields := mi.Desc.Fields()
  24. for i := 0; i < fields.Len(); i++ {
  25. fd := fields.Get(i)
  26. fs := si.fieldsByNumber[fd.Number()]
  27. if fd.ContainingOneof() != nil && !fd.ContainingOneof().IsSynthetic() {
  28. fs = si.oneofsByName[fd.ContainingOneof().Name()]
  29. }
  30. ft := fs.Type
  31. var wiretag uint64
  32. if !fd.IsPacked() {
  33. wiretag = protowire.EncodeTag(fd.Number(), wireTypes[fd.Kind()])
  34. } else {
  35. wiretag = protowire.EncodeTag(fd.Number(), protowire.BytesType)
  36. }
  37. var fieldOffset offset
  38. var funcs pointerCoderFuncs
  39. var childMessage *MessageInfo
  40. switch {
  41. case fd.ContainingOneof() != nil && !fd.ContainingOneof().IsSynthetic():
  42. fieldOffset = offsetOf(fs)
  43. case fd.Message() != nil && !fd.IsMap():
  44. fieldOffset = offsetOf(fs)
  45. if fd.IsList() {
  46. childMessage, funcs = makeOpaqueRepeatedMessageFieldCoder(fd, ft)
  47. } else {
  48. childMessage, funcs = makeOpaqueMessageFieldCoder(fd, ft)
  49. }
  50. default:
  51. fieldOffset = offsetOf(fs)
  52. childMessage, funcs = fieldCoder(fd, ft)
  53. }
  54. cf := &coderFieldInfo{
  55. num: fd.Number(),
  56. offset: fieldOffset,
  57. wiretag: wiretag,
  58. ft: ft,
  59. tagsize: protowire.SizeVarint(wiretag),
  60. funcs: funcs,
  61. mi: childMessage,
  62. validation: newFieldValidationInfo(mi, si.structInfo, fd, ft),
  63. isPointer: (fd.Cardinality() == protoreflect.Repeated ||
  64. fd.Kind() == protoreflect.MessageKind ||
  65. fd.Kind() == protoreflect.GroupKind),
  66. isRequired: fd.Cardinality() == protoreflect.Required,
  67. presenceIndex: noPresence,
  68. }
  69. // TODO: Use presence for all fields.
  70. //
  71. // In some cases, such as maps, presence means only "might be set" rather
  72. // than "is definitely set", but every field should have a presence bit to
  73. // permit us to skip over definitely-unset fields at marshal time.
  74. var hasPresence bool
  75. hasPresence, cf.isLazy = usePresenceForField(si, fd)
  76. if hasPresence {
  77. cf.presenceIndex, mi.presenceSize = presenceIndex(mi.Desc, fd)
  78. }
  79. mi.orderedCoderFields = append(mi.orderedCoderFields, cf)
  80. mi.coderFields[cf.num] = cf
  81. }
  82. for i, oneofs := 0, mi.Desc.Oneofs(); i < oneofs.Len(); i++ {
  83. if od := oneofs.Get(i); !od.IsSynthetic() {
  84. mi.initOneofFieldCoders(od, si.structInfo)
  85. }
  86. }
  87. if messageset.IsMessageSet(mi.Desc) {
  88. if !mi.extensionOffset.IsValid() {
  89. panic(fmt.Sprintf("%v: MessageSet with no extensions field", mi.Desc.FullName()))
  90. }
  91. if !mi.unknownOffset.IsValid() {
  92. panic(fmt.Sprintf("%v: MessageSet with no unknown field", mi.Desc.FullName()))
  93. }
  94. mi.isMessageSet = true
  95. }
  96. sort.Slice(mi.orderedCoderFields, func(i, j int) bool {
  97. return mi.orderedCoderFields[i].num < mi.orderedCoderFields[j].num
  98. })
  99. var maxDense protoreflect.FieldNumber
  100. for _, cf := range mi.orderedCoderFields {
  101. if cf.num >= 16 && cf.num >= 2*maxDense {
  102. break
  103. }
  104. maxDense = cf.num
  105. }
  106. mi.denseCoderFields = make([]*coderFieldInfo, maxDense+1)
  107. for _, cf := range mi.orderedCoderFields {
  108. if int(cf.num) > len(mi.denseCoderFields) {
  109. break
  110. }
  111. mi.denseCoderFields[cf.num] = cf
  112. }
  113. // To preserve compatibility with historic wire output, marshal oneofs last.
  114. if mi.Desc.Oneofs().Len() > 0 {
  115. sort.Slice(mi.orderedCoderFields, func(i, j int) bool {
  116. fi := fields.ByNumber(mi.orderedCoderFields[i].num)
  117. fj := fields.ByNumber(mi.orderedCoderFields[j].num)
  118. return order.LegacyFieldOrder(fi, fj)
  119. })
  120. }
  121. mi.needsInitCheck = needsInitCheck(mi.Desc)
  122. if mi.methods.Marshal == nil && mi.methods.Size == nil {
  123. mi.methods.Flags |= piface.SupportMarshalDeterministic
  124. mi.methods.Marshal = mi.marshal
  125. mi.methods.Size = mi.size
  126. }
  127. if mi.methods.Unmarshal == nil {
  128. mi.methods.Flags |= piface.SupportUnmarshalDiscardUnknown
  129. mi.methods.Unmarshal = mi.unmarshal
  130. }
  131. if mi.methods.CheckInitialized == nil {
  132. mi.methods.CheckInitialized = mi.checkInitialized
  133. }
  134. if mi.methods.Merge == nil {
  135. mi.methods.Merge = mi.merge
  136. }
  137. if mi.methods.Equal == nil {
  138. mi.methods.Equal = equal
  139. }
  140. }