equal.go 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266
  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.
  49. - Two repeated fields are equal iff their lengths are the same,
  50. and their corresponding elements are equal (a "bytes" field,
  51. although represented by []byte, is not a repeated field)
  52. - Two unset fields are equal.
  53. - Two unknown field sets are equal if their current
  54. encoded state is equal.
  55. - Two extension sets are equal iff they have corresponding
  56. elements that are pairwise equal.
  57. - Every other combination of things are not equal.
  58. The return value is undefined if a and b are not protocol buffers.
  59. */
  60. func Equal(a, b Message) bool {
  61. if a == nil || b == nil {
  62. return a == b
  63. }
  64. v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
  65. if v1.Type() != v2.Type() {
  66. return false
  67. }
  68. if v1.Kind() == reflect.Ptr {
  69. if v1.IsNil() {
  70. return v2.IsNil()
  71. }
  72. if v2.IsNil() {
  73. return false
  74. }
  75. v1, v2 = v1.Elem(), v2.Elem()
  76. }
  77. if v1.Kind() != reflect.Struct {
  78. return false
  79. }
  80. return equalStruct(v1, v2)
  81. }
  82. // v1 and v2 are known to have the same type.
  83. func equalStruct(v1, v2 reflect.Value) bool {
  84. for i := 0; i < v1.NumField(); i++ {
  85. f := v1.Type().Field(i)
  86. if strings.HasPrefix(f.Name, "XXX_") {
  87. continue
  88. }
  89. f1, f2 := v1.Field(i), v2.Field(i)
  90. if f.Type.Kind() == reflect.Ptr {
  91. if n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {
  92. // both unset
  93. continue
  94. } else if n1 != n2 {
  95. // set/unset mismatch
  96. return false
  97. }
  98. b1, ok := f1.Interface().(raw)
  99. if ok {
  100. b2 := f2.Interface().(raw)
  101. // RawMessage
  102. if !bytes.Equal(b1.Bytes(), b2.Bytes()) {
  103. return false
  104. }
  105. continue
  106. }
  107. f1, f2 = f1.Elem(), f2.Elem()
  108. }
  109. if !equalAny(f1, f2) {
  110. return false
  111. }
  112. }
  113. if em1 := v1.FieldByName("XXX_extensions"); em1.IsValid() {
  114. em2 := v2.FieldByName("XXX_extensions")
  115. if !equalExtensions(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {
  116. return false
  117. }
  118. }
  119. uf := v1.FieldByName("XXX_unrecognized")
  120. if !uf.IsValid() {
  121. return true
  122. }
  123. u1 := uf.Bytes()
  124. u2 := v2.FieldByName("XXX_unrecognized").Bytes()
  125. if !bytes.Equal(u1, u2) {
  126. return false
  127. }
  128. return true
  129. }
  130. // v1 and v2 are known to have the same type.
  131. func equalAny(v1, v2 reflect.Value) bool {
  132. if v1.Type() == protoMessageType {
  133. m1, _ := v1.Interface().(Message)
  134. m2, _ := v2.Interface().(Message)
  135. return Equal(m1, m2)
  136. }
  137. switch v1.Kind() {
  138. case reflect.Bool:
  139. return v1.Bool() == v2.Bool()
  140. case reflect.Float32, reflect.Float64:
  141. return v1.Float() == v2.Float()
  142. case reflect.Int32, reflect.Int64:
  143. return v1.Int() == v2.Int()
  144. case reflect.Interface:
  145. // Probably a oneof field; compare the inner values.
  146. n1, n2 := v1.IsNil(), v2.IsNil()
  147. if n1 || n2 {
  148. return n1 == n2
  149. }
  150. e1, e2 := v1.Elem(), v2.Elem()
  151. if e1.Type() != e2.Type() {
  152. return false
  153. }
  154. return equalAny(e1, e2)
  155. case reflect.Map:
  156. if v1.Len() != v2.Len() {
  157. return false
  158. }
  159. for _, key := range v1.MapKeys() {
  160. val2 := v2.MapIndex(key)
  161. if !val2.IsValid() {
  162. // This key was not found in the second map.
  163. return false
  164. }
  165. if !equalAny(v1.MapIndex(key), val2) {
  166. return false
  167. }
  168. }
  169. return true
  170. case reflect.Ptr:
  171. return equalAny(v1.Elem(), v2.Elem())
  172. case reflect.Slice:
  173. if v1.Type().Elem().Kind() == reflect.Uint8 {
  174. // short circuit: []byte
  175. if v1.IsNil() != v2.IsNil() {
  176. return false
  177. }
  178. return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
  179. }
  180. if v1.Len() != v2.Len() {
  181. return false
  182. }
  183. for i := 0; i < v1.Len(); i++ {
  184. if !equalAny(v1.Index(i), v2.Index(i)) {
  185. return false
  186. }
  187. }
  188. return true
  189. case reflect.String:
  190. return v1.Interface().(string) == v2.Interface().(string)
  191. case reflect.Struct:
  192. return equalStruct(v1, v2)
  193. case reflect.Uint32, reflect.Uint64:
  194. return v1.Uint() == v2.Uint()
  195. }
  196. // unknown type, so not a protocol buffer
  197. log.Printf("proto: don't know how to compare %v", v1)
  198. return false
  199. }
  200. // base is the struct type that the extensions are based on.
  201. // em1 and em2 are extension maps.
  202. func equalExtensions(base reflect.Type, em1, em2 map[int32]Extension) bool {
  203. if len(em1) != len(em2) {
  204. return false
  205. }
  206. for extNum, e1 := range em1 {
  207. e2, ok := em2[extNum]
  208. if !ok {
  209. return false
  210. }
  211. m1, m2 := e1.value, e2.value
  212. if m1 != nil && m2 != nil {
  213. // Both are unencoded.
  214. if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2)) {
  215. return false
  216. }
  217. continue
  218. }
  219. // At least one is encoded. To do a semantically correct comparison
  220. // we need to unmarshal them first.
  221. var desc *ExtensionDesc
  222. if m := extensionMaps[base]; m != nil {
  223. desc = m[extNum]
  224. }
  225. if desc == nil {
  226. log.Printf("proto: don't know how to compare extension %d of %v", extNum, base)
  227. continue
  228. }
  229. var err error
  230. if m1 == nil {
  231. m1, err = decodeExtension(e1.enc, desc)
  232. }
  233. if m2 == nil && err == nil {
  234. m2, err = decodeExtension(e2.enc, desc)
  235. }
  236. if err != nil {
  237. // The encoded form is invalid.
  238. log.Printf("proto: badly encoded extension %d of %v: %v", extNum, base, err)
  239. return false
  240. }
  241. if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2)) {
  242. return false
  243. }
  244. }
  245. return true
  246. }