blob: cafb99f5d75f3f79d0390086cd2207c085d8fe32 [file] [log] [blame]
David Symonds76551212011-08-22 15:59:24 +10001// Go support for Protocol Buffers - Google's data interchange format
2//
David Symondsee6e9c52012-11-29 08:51:07 +11003// Copyright 2011 The Go Authors. All rights reserved.
David Symonds558f13f2014-11-24 10:28:53 +11004// https://github.com/golang/protobuf
David Symonds76551212011-08-22 15:59:24 +10005//
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
32// Protocol buffer comparison.
David Symonds76551212011-08-22 15:59:24 +100033
34package proto
35
36import (
37 "bytes"
38 "log"
39 "reflect"
40 "strings"
41)
42
43/*
44Equal returns true iff protocol buffers a and b are equal.
David Symonds9f60f432012-06-14 09:45:25 +100045The arguments must both be pointers to protocol buffer structs.
David Symonds76551212011-08-22 15:59:24 +100046
47Equality is defined in this way:
48 - Two messages are equal iff they are the same type,
49 corresponding fields are equal, unknown field sets
50 are equal, and extensions sets are equal.
51 - Two set scalar fields are equal iff their values are equal.
David Symondsb79d99b2011-08-29 16:38:49 +100052 If the fields are of a floating-point type, remember that
David Symonds4df416c2016-01-06 06:53:00 +110053 NaN != x for all x, including NaN. If the message is defined
54 in a proto3 .proto file, fields are not "set"; specifically,
55 zero length proto3 "bytes" fields are equal (nil == {}).
David Symonds76551212011-08-22 15:59:24 +100056 - Two repeated fields are equal iff their lengths are the same,
David Symonds35abe742012-02-13 09:55:16 +110057 and their corresponding elements are equal (a "bytes" field,
58 although represented by []byte, is not a repeated field)
David Symonds76551212011-08-22 15:59:24 +100059 - Two unset fields are equal.
60 - Two unknown field sets are equal if their current
David Symonds50386d22014-10-28 11:00:50 +110061 encoded state is equal.
David Symonds76551212011-08-22 15:59:24 +100062 - Two extension sets are equal iff they have corresponding
David Symondsa4b61c02011-09-07 14:06:00 +100063 elements that are pairwise equal.
David Symonds76551212011-08-22 15:59:24 +100064 - Every other combination of things are not equal.
65
66The return value is undefined if a and b are not protocol buffers.
67*/
David Symonds9f60f432012-06-14 09:45:25 +100068func Equal(a, b Message) bool {
David Symonds007ed9d2012-07-24 10:59:36 +100069 if a == nil || b == nil {
70 return a == b
71 }
David Symonds76551212011-08-22 15:59:24 +100072 v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
73 if v1.Type() != v2.Type() {
74 return false
75 }
76 if v1.Kind() == reflect.Ptr {
David Symonds007ed9d2012-07-24 10:59:36 +100077 if v1.IsNil() {
78 return v2.IsNil()
79 }
80 if v2.IsNil() {
81 return false
82 }
David Symonds76551212011-08-22 15:59:24 +100083 v1, v2 = v1.Elem(), v2.Elem()
84 }
85 if v1.Kind() != reflect.Struct {
86 return false
87 }
88 return equalStruct(v1, v2)
89}
90
91// v1 and v2 are known to have the same type.
92func equalStruct(v1, v2 reflect.Value) bool {
David Symonds4df416c2016-01-06 06:53:00 +110093 sprop := GetProperties(v1.Type())
David Symonds76551212011-08-22 15:59:24 +100094 for i := 0; i < v1.NumField(); i++ {
95 f := v1.Type().Field(i)
96 if strings.HasPrefix(f.Name, "XXX_") {
97 continue
98 }
99 f1, f2 := v1.Field(i), v2.Field(i)
100 if f.Type.Kind() == reflect.Ptr {
101 if n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {
102 // both unset
103 continue
104 } else if n1 != n2 {
105 // set/unset mismatch
106 return false
107 }
David Symondse9e7aaf2012-03-23 13:12:33 +1100108 b1, ok := f1.Interface().(raw)
109 if ok {
110 b2 := f2.Interface().(raw)
111 // RawMessage
112 if !bytes.Equal(b1.Bytes(), b2.Bytes()) {
113 return false
114 }
115 continue
116 }
David Symonds76551212011-08-22 15:59:24 +1000117 f1, f2 = f1.Elem(), f2.Elem()
118 }
David Symonds4df416c2016-01-06 06:53:00 +1100119 if !equalAny(f1, f2, sprop.Prop[i]) {
David Symonds76551212011-08-22 15:59:24 +1000120 return false
121 }
122 }
123
matloob@google.come51d0022016-05-23 09:09:04 -0400124 if em1 := v1.FieldByName("XXX_InternalExtensions"); em1.IsValid() {
125 em2 := v2.FieldByName("XXX_InternalExtensions")
126 if !equalExtensions(v1.Type(), em1.Interface().(XXX_InternalExtensions), em2.Interface().(XXX_InternalExtensions)) {
David Symondsa4b61c02011-09-07 14:06:00 +1000127 return false
128 }
129 }
130
matloob@google.com9e6977f2016-05-24 15:56:25 -0400131 if em1 := v1.FieldByName("XXX_extensions"); em1.IsValid() {
132 em2 := v2.FieldByName("XXX_extensions")
133 if !equalExtMap(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {
134 return false
135 }
136 }
137
David Symonds6eaeef12012-11-07 11:42:56 +1100138 uf := v1.FieldByName("XXX_unrecognized")
139 if !uf.IsValid() {
140 return true
141 }
142
143 u1 := uf.Bytes()
David Symonds10c93ba2012-08-04 16:38:08 +1000144 u2 := v2.FieldByName("XXX_unrecognized").Bytes()
145 if !bytes.Equal(u1, u2) {
146 return false
147 }
David Symonds76551212011-08-22 15:59:24 +1000148
149 return true
150}
151
152// v1 and v2 are known to have the same type.
David Symonds4df416c2016-01-06 06:53:00 +1100153// prop may be nil.
154func equalAny(v1, v2 reflect.Value, prop *Properties) bool {
David Symonds007ed9d2012-07-24 10:59:36 +1000155 if v1.Type() == protoMessageType {
156 m1, _ := v1.Interface().(Message)
157 m2, _ := v2.Interface().(Message)
158 return Equal(m1, m2)
159 }
David Symonds76551212011-08-22 15:59:24 +1000160 switch v1.Kind() {
161 case reflect.Bool:
162 return v1.Bool() == v2.Bool()
163 case reflect.Float32, reflect.Float64:
164 return v1.Float() == v2.Float()
165 case reflect.Int32, reflect.Int64:
166 return v1.Int() == v2.Int()
David Symonds59b73b32015-08-24 13:22:02 +1000167 case reflect.Interface:
168 // Probably a oneof field; compare the inner values.
169 n1, n2 := v1.IsNil(), v2.IsNil()
170 if n1 || n2 {
171 return n1 == n2
172 }
173 e1, e2 := v1.Elem(), v2.Elem()
174 if e1.Type() != e2.Type() {
175 return false
176 }
David Symonds4df416c2016-01-06 06:53:00 +1100177 return equalAny(e1, e2, nil)
David Symonds3ea3e052014-12-22 16:15:28 +1100178 case reflect.Map:
179 if v1.Len() != v2.Len() {
180 return false
181 }
182 for _, key := range v1.MapKeys() {
183 val2 := v2.MapIndex(key)
184 if !val2.IsValid() {
185 // This key was not found in the second map.
186 return false
187 }
David Symonds4df416c2016-01-06 06:53:00 +1100188 if !equalAny(v1.MapIndex(key), val2, nil) {
David Symonds3ea3e052014-12-22 16:15:28 +1100189 return false
190 }
191 }
192 return true
David Symonds76551212011-08-22 15:59:24 +1000193 case reflect.Ptr:
David Symonds4df416c2016-01-06 06:53:00 +1100194 return equalAny(v1.Elem(), v2.Elem(), prop)
David Symonds76551212011-08-22 15:59:24 +1000195 case reflect.Slice:
David Symonds35abe742012-02-13 09:55:16 +1100196 if v1.Type().Elem().Kind() == reflect.Uint8 {
197 // short circuit: []byte
David Symonds4df416c2016-01-06 06:53:00 +1100198
199 // Edge case: if this is in a proto3 message, a zero length
200 // bytes field is considered the zero value.
201 if prop != nil && prop.proto3 && v1.Len() == 0 && v2.Len() == 0 {
202 return true
203 }
David Symonds35abe742012-02-13 09:55:16 +1100204 if v1.IsNil() != v2.IsNil() {
205 return false
206 }
207 return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
David Symonds76551212011-08-22 15:59:24 +1000208 }
David Symonds35abe742012-02-13 09:55:16 +1100209
David Symonds76551212011-08-22 15:59:24 +1000210 if v1.Len() != v2.Len() {
211 return false
212 }
David Symonds76551212011-08-22 15:59:24 +1000213 for i := 0; i < v1.Len(); i++ {
David Symonds4df416c2016-01-06 06:53:00 +1100214 if !equalAny(v1.Index(i), v2.Index(i), prop) {
David Symonds76551212011-08-22 15:59:24 +1000215 return false
216 }
217 }
218 return true
219 case reflect.String:
220 return v1.Interface().(string) == v2.Interface().(string)
221 case reflect.Struct:
222 return equalStruct(v1, v2)
223 case reflect.Uint32, reflect.Uint64:
224 return v1.Uint() == v2.Uint()
225 }
226
227 // unknown type, so not a protocol buffer
228 log.Printf("proto: don't know how to compare %v", v1)
229 return false
230}
David Symondsa4b61c02011-09-07 14:06:00 +1000231
232// base is the struct type that the extensions are based on.
matloob@google.come51d0022016-05-23 09:09:04 -0400233// x1 and x2 are InternalExtensions.
234func equalExtensions(base reflect.Type, x1, x2 XXX_InternalExtensions) bool {
235 em1, _ := x1.extensionsRead()
236 em2, _ := x2.extensionsRead()
matloob@google.com9e6977f2016-05-24 15:56:25 -0400237 return equalExtMap(base, em1, em2)
238}
239
240func equalExtMap(base reflect.Type, em1, em2 map[int32]Extension) bool {
David Symondsa4b61c02011-09-07 14:06:00 +1000241 if len(em1) != len(em2) {
242 return false
243 }
244
245 for extNum, e1 := range em1 {
246 e2, ok := em2[extNum]
247 if !ok {
248 return false
249 }
250
251 m1, m2 := e1.value, e2.value
252
253 if m1 != nil && m2 != nil {
254 // Both are unencoded.
David Symonds4df416c2016-01-06 06:53:00 +1100255 if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {
David Symondsa4b61c02011-09-07 14:06:00 +1000256 return false
257 }
258 continue
259 }
260
261 // At least one is encoded. To do a semantically correct comparison
262 // we need to unmarshal them first.
263 var desc *ExtensionDesc
264 if m := extensionMaps[base]; m != nil {
265 desc = m[extNum]
266 }
267 if desc == nil {
268 log.Printf("proto: don't know how to compare extension %d of %v", extNum, base)
269 continue
270 }
Rob Pikea17fdd92011-11-02 12:43:05 -0700271 var err error
David Symondsa4b61c02011-09-07 14:06:00 +1000272 if m1 == nil {
273 m1, err = decodeExtension(e1.enc, desc)
274 }
275 if m2 == nil && err == nil {
276 m2, err = decodeExtension(e2.enc, desc)
277 }
278 if err != nil {
279 // The encoded form is invalid.
280 log.Printf("proto: badly encoded extension %d of %v: %v", extNum, base, err)
281 return false
282 }
David Symonds4df416c2016-01-06 06:53:00 +1100283 if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2), nil) {
David Symondsa4b61c02011-09-07 14:06:00 +1000284 return false
285 }
286 }
287
288 return true
289}