equal.go 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. // Go support for Protocol Buffers - Google's data interchange format
  2. //
  3. // Copyright 2011 The Go Authors. All rights reserved.
  4. // https://github.com/golang/protobuf
  5. //
  6. // Redistribution and use in source and binary forms, with or without
  7. // modification, are permitted provided that the following conditions are
  8. // met:
  9. //
  10. // * Redistributions of source code must retain the above copyright
  11. // notice, this list of conditions and the following disclaimer.
  12. // * Redistributions in binary form must reproduce the above
  13. // copyright notice, this list of conditions and the following disclaimer
  14. // in the documentation and/or other materials provided with the
  15. // distribution.
  16. // * Neither the name of Google Inc. nor the names of its
  17. // contributors may be used to endorse or promote products derived from
  18. // this software without specific prior written permission.
  19. //
  20. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  21. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  22. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  23. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  24. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  25. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  26. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  27. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  28. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  29. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  30. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31. // Protocol buffer comparison.
  32. package proto
  33. import (
  34. "bytes"
  35. "log"
  36. "reflect"
  37. "strings"
  38. )
  39. /*
  40. Equal returns true iff protocol buffers a and b are equal.
  41. The arguments must both be pointers to protocol buffer structs.
  42. Equality is defined in this way:
  43. - Two messages are equal iff they are the same type,
  44. corresponding fields are equal, unknown field sets
  45. are equal, and extensions sets are equal.
  46. - Two set scalar fields are equal iff their values are equal.
  47. If the fields are of a floating-point type, remember that
  48. NaN != x for all x, including NaN. If the message is defined
  49. in a proto3 .proto file, fields are not "set"; specifically,
  50. zero length proto3 "bytes" fields are equal (nil == {}).
  51. - Two repeated fields are equal iff their lengths are the same,
  52. and their corresponding elements are equal (a "bytes" field,
  53. although represented by []byte, is not a repeated field)
  54. - Two unset fields are equal.
  55. - Two unknown field sets are equal if their current
  56. encoded state is equal.
  57. - Two extension sets are equal iff they have corresponding
  58. elements that are pairwise equal.
  59. - Every other combination of things are not equal.
  60. The return value is undefined if a and b are not protocol buffers.
  61. */
  62. func Equal(a, b Message) bool {
  63. if a == nil || b == nil {
  64. return a == b
  65. }
  66. v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
  67. if v1.Type() != v2.Type() {
  68. return false
  69. }
  70. if v1.Kind() == reflect.Ptr {
  71. if v1.IsNil() {
  72. return v2.IsNil()
  73. }
  74. if v2.IsNil() {
  75. return false
  76. }
  77. v1, v2 = v1.Elem(), v2.Elem()
  78. }
  79. if v1.Kind() != reflect.Struct {
  80. return false
  81. }
  82. return equalStruct(v1, v2)
  83. }
  84. // v1 and v2 are known to have the same type.
  85. func equalStruct(v1, v2 reflect.Value) bool {
  86. sprop := GetProperties(v1.Type())
  87. for i := 0; i < v1.NumField(); i++ {
  88. f := v1.Type().Field(i)
  89. if strings.HasPrefix(f.Name, "XXX_") {
  90. continue
  91. }
  92. f1, f2 := v1.Field(i), v2.Field(i)
  93. if f.Type.Kind() == reflect.Ptr {
  94. if n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {
  95. // both unset
  96. continue
  97. } else if n1 != n2 {
  98. // set/unset mismatch
  99. return false
  100. }
  101. b1, ok := f1.Interface().(raw)
  102. if ok {
  103. b2 := f2.Interface().(raw)
  104. // RawMessage
  105. if !bytes.Equal(b1.Bytes(), b2.Bytes()) {
  106. return false
  107. }
  108. continue
  109. }
  110. f1, f2 = f1.Elem(), f2.Elem()
  111. }
  112. if !equalAny(f1, f2, sprop.Prop[i]) {
  113. return false
  114. }
  115. }
  116. if em1 := v1.FieldByName("XXX_extensions"); em1.IsValid() {
  117. em2 := v2.FieldByName("XXX_extensions")
  118. if !equalExtensions(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {
  119. return false
  120. }
  121. }
  122. uf := v1.FieldByName("XXX_unrecognized")
  123. if !uf.IsValid() {
  124. return true
  125. }
  126. u1 := uf.Bytes()
  127. u2 := v2.FieldByName("XXX_unrecognized").Bytes()
  128. if !bytes.Equal(u1, u2) {
  129. return false
  130. }
  131. return true
  132. }
  133. // v1 and v2 are known to have the same type.
  134. // prop may be nil.
  135. func equalAny(v1, v2 reflect.Value, prop *Properties) bool {
  136. if v1.Type() == protoMessageType {
  137. m1, _ := v1.Interface().(Message)
  138. m2, _ := v2.Interface().(Message)
  139. return Equal(m1, m2)
  140. }
  141. switch v1.Kind() {
  142. case reflect.Bool:
  143. return v1.Bool() == v2.Bool()
  144. case reflect.Float32, reflect.Float64:
  145. return v1.Float() == v2.Float()
  146. case reflect.Int32, reflect.Int64:
  147. return v1.Int() == v2.Int()
  148. case reflect.Interface:
  149. // Probably a oneof field; compare the inner values.
  150. n1, n2 := v1.IsNil(), v2.IsNil()
  151. if n1 || n2 {
  152. return n1 == n2
  153. }
  154. e1, e2 := v1.Elem(), v2.Elem()
  155. if e1.Type() != e2.Type() {
  156. return false
  157. }
  158. return equalAny(e1, e2, nil)
  159. case reflect.Map:
  160. if v1.Len() != v2.Len() {
  161. return false
  162. }
  163. for _, key := range v1.MapKeys() {
  164. val2 := v2.MapIndex(key)
  165. if !val2.IsValid() {
  166. // This key was not found in the second map.
  167. return false
  168. }
  169. if !equalAny(v1.MapIndex(key), val2, nil) {
  170. return false
  171. }
  172. }
  173. return true
  174. case reflect.Ptr:
  175. return equalAny(v1.Elem(), v2.Elem(), prop)
  176. case reflect.Slice:
  177. if v1.Type().Elem().Kind() == reflect.Uint8 {
  178. // short circuit: []byte
  179. // Edge case: if this is in a proto3 message, a zero length
  180. // bytes field is considered the zero value.
  181. if prop != nil && prop.proto3 && v1.Len() == 0 && v2.Len() == 0 {
  182. return true
  183. }
  184. if v1.IsNil() != v2.IsNil() {
  185. return false
  186. }
  187. return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
  188. }
  189. if v1.Len() != v2.Len() {
  190. return false
  191. }
  192. for i := 0; i < v1.Len(); i++ {
  193. if !equalAny(v1.Index(i), v2.Index(i), prop) {
  194. return false
  195. }
  196. }
  197. return true
  198. case reflect.String:
  199. return v1.Interface().(string) == v2.Interface().(string)
  200. case reflect.Struct:
  201. return equalStruct(v1, v2)
  202. case reflect.Uint32, reflect.Uint64:
  203. return v1.Uint() == v2.Uint()
  204. }
  205. // unknown type, so not a protocol buffer
  206. log.Printf("proto: don't know how to compare %v", v1)
  207. return false
  208. }
  209. // base is the struct type that the extensions are based on.
  210. // em1 and em2 are extension maps.
  211. func equalExtensions(base reflect.Type, em1, em2 map[int32]Extension) bool {
  212. if len(em1) != len(em2) {
  213. return false
  214. }
  215. for extNum, e1 := range em1 {
  216. e2, ok := em2[extNum]
  217. if !ok {
  218. return false
  219. }
  220. m1, m2 := e1.value, e2.value
  221. if m1 != nil && m2 != nil {
  222. // Both are unencoded.
  223. if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {
  224. return false
  225. }
  226. continue
  227. }
  228. // At least one is encoded. To do a semantically correct comparison
  229. // we need to unmarshal them first.
  230. var desc *ExtensionDesc
  231. if m := extensionMaps[base]; m != nil {
  232. desc = m[extNum]
  233. }
  234. if desc == nil {
  235. log.Printf("proto: don't know how to compare extension %d of %v", extNum, base)
  236. continue
  237. }
  238. var err error
  239. if m1 == nil {
  240. m1, err = decodeExtension(e1.enc, desc)
  241. }
  242. if m2 == nil && err == nil {
  243. m2, err = decodeExtension(e2.enc, desc)
  244. }
  245. if err != nil {
  246. // The encoded form is invalid.
  247. log.Printf("proto: badly encoded extension %d of %v: %v", extNum, base, err)
  248. return false
  249. }
  250. if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {
  251. return false
  252. }
  253. }
  254. return true
  255. }