blob: d8673a3e97aef00f2becedba88ed12e6fcb6ee57 [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 Symondse9e7aaf2012-03-23 13:12:33 +110033// TODO: MessageSet.
David Symonds76551212011-08-22 15:59:24 +100034
35package proto
36
37import (
38 "bytes"
39 "log"
40 "reflect"
41 "strings"
42)
43
44/*
45Equal returns true iff protocol buffers a and b are equal.
David Symonds9f60f432012-06-14 09:45:25 +100046The arguments must both be pointers to protocol buffer structs.
David Symonds76551212011-08-22 15:59:24 +100047
48Equality is defined in this way:
49 - Two messages are equal iff they are the same type,
50 corresponding fields are equal, unknown field sets
51 are equal, and extensions sets are equal.
52 - Two set scalar fields are equal iff their values are equal.
David Symondsb79d99b2011-08-29 16:38:49 +100053 If the fields are of a floating-point type, remember that
54 NaN != x for all x, including NaN.
David Symonds76551212011-08-22 15:59:24 +100055 - Two repeated fields are equal iff their lengths are the same,
David Symonds35abe742012-02-13 09:55:16 +110056 and their corresponding elements are equal (a "bytes" field,
57 although represented by []byte, is not a repeated field)
David Symonds76551212011-08-22 15:59:24 +100058 - Two unset fields are equal.
59 - Two unknown field sets are equal if their current
David Symonds50386d22014-10-28 11:00:50 +110060 encoded state is equal.
David Symonds76551212011-08-22 15:59:24 +100061 - Two extension sets are equal iff they have corresponding
David Symondsa4b61c02011-09-07 14:06:00 +100062 elements that are pairwise equal.
David Symonds76551212011-08-22 15:59:24 +100063 - Every other combination of things are not equal.
64
65The return value is undefined if a and b are not protocol buffers.
66*/
David Symonds9f60f432012-06-14 09:45:25 +100067func Equal(a, b Message) bool {
David Symonds007ed9d2012-07-24 10:59:36 +100068 if a == nil || b == nil {
69 return a == b
70 }
David Symonds76551212011-08-22 15:59:24 +100071 v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
72 if v1.Type() != v2.Type() {
73 return false
74 }
75 if v1.Kind() == reflect.Ptr {
David Symonds007ed9d2012-07-24 10:59:36 +100076 if v1.IsNil() {
77 return v2.IsNil()
78 }
79 if v2.IsNil() {
80 return false
81 }
David Symonds76551212011-08-22 15:59:24 +100082 v1, v2 = v1.Elem(), v2.Elem()
83 }
84 if v1.Kind() != reflect.Struct {
85 return false
86 }
87 return equalStruct(v1, v2)
88}
89
90// v1 and v2 are known to have the same type.
91func equalStruct(v1, v2 reflect.Value) bool {
92 for i := 0; i < v1.NumField(); i++ {
93 f := v1.Type().Field(i)
94 if strings.HasPrefix(f.Name, "XXX_") {
95 continue
96 }
97 f1, f2 := v1.Field(i), v2.Field(i)
98 if f.Type.Kind() == reflect.Ptr {
99 if n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {
100 // both unset
101 continue
102 } else if n1 != n2 {
103 // set/unset mismatch
104 return false
105 }
David Symondse9e7aaf2012-03-23 13:12:33 +1100106 b1, ok := f1.Interface().(raw)
107 if ok {
108 b2 := f2.Interface().(raw)
109 // RawMessage
110 if !bytes.Equal(b1.Bytes(), b2.Bytes()) {
111 return false
112 }
113 continue
114 }
David Symonds76551212011-08-22 15:59:24 +1000115 f1, f2 = f1.Elem(), f2.Elem()
116 }
117 if !equalAny(f1, f2) {
118 return false
119 }
120 }
121
David Symondsa4b61c02011-09-07 14:06:00 +1000122 if em1 := v1.FieldByName("XXX_extensions"); em1.IsValid() {
123 em2 := v2.FieldByName("XXX_extensions")
124 if !equalExtensions(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {
125 return false
126 }
127 }
128
David Symonds6eaeef12012-11-07 11:42:56 +1100129 uf := v1.FieldByName("XXX_unrecognized")
130 if !uf.IsValid() {
131 return true
132 }
133
134 u1 := uf.Bytes()
David Symonds10c93ba2012-08-04 16:38:08 +1000135 u2 := v2.FieldByName("XXX_unrecognized").Bytes()
136 if !bytes.Equal(u1, u2) {
137 return false
138 }
David Symonds76551212011-08-22 15:59:24 +1000139
140 return true
141}
142
143// v1 and v2 are known to have the same type.
144func equalAny(v1, v2 reflect.Value) bool {
David Symonds007ed9d2012-07-24 10:59:36 +1000145 if v1.Type() == protoMessageType {
146 m1, _ := v1.Interface().(Message)
147 m2, _ := v2.Interface().(Message)
148 return Equal(m1, m2)
149 }
David Symonds76551212011-08-22 15:59:24 +1000150 switch v1.Kind() {
151 case reflect.Bool:
152 return v1.Bool() == v2.Bool()
153 case reflect.Float32, reflect.Float64:
154 return v1.Float() == v2.Float()
155 case reflect.Int32, reflect.Int64:
156 return v1.Int() == v2.Int()
David Symonds3ea3e052014-12-22 16:15:28 +1100157 case reflect.Map:
158 if v1.Len() != v2.Len() {
159 return false
160 }
161 for _, key := range v1.MapKeys() {
162 val2 := v2.MapIndex(key)
163 if !val2.IsValid() {
164 // This key was not found in the second map.
165 return false
166 }
167 if !equalAny(v1.MapIndex(key), val2) {
168 return false
169 }
170 }
171 return true
David Symonds76551212011-08-22 15:59:24 +1000172 case reflect.Ptr:
173 return equalAny(v1.Elem(), v2.Elem())
174 case reflect.Slice:
David Symonds35abe742012-02-13 09:55:16 +1100175 if v1.Type().Elem().Kind() == reflect.Uint8 {
176 // short circuit: []byte
177 if v1.IsNil() != v2.IsNil() {
178 return false
179 }
180 return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
David Symonds76551212011-08-22 15:59:24 +1000181 }
David Symonds35abe742012-02-13 09:55:16 +1100182
David Symonds76551212011-08-22 15:59:24 +1000183 if v1.Len() != v2.Len() {
184 return false
185 }
David Symonds76551212011-08-22 15:59:24 +1000186 for i := 0; i < v1.Len(); i++ {
187 if !equalAny(v1.Index(i), v2.Index(i)) {
188 return false
189 }
190 }
191 return true
192 case reflect.String:
193 return v1.Interface().(string) == v2.Interface().(string)
194 case reflect.Struct:
195 return equalStruct(v1, v2)
196 case reflect.Uint32, reflect.Uint64:
197 return v1.Uint() == v2.Uint()
198 }
199
200 // unknown type, so not a protocol buffer
201 log.Printf("proto: don't know how to compare %v", v1)
202 return false
203}
David Symondsa4b61c02011-09-07 14:06:00 +1000204
205// base is the struct type that the extensions are based on.
206// em1 and em2 are extension maps.
207func equalExtensions(base reflect.Type, em1, em2 map[int32]Extension) bool {
208 if len(em1) != len(em2) {
209 return false
210 }
211
212 for extNum, e1 := range em1 {
213 e2, ok := em2[extNum]
214 if !ok {
215 return false
216 }
217
218 m1, m2 := e1.value, e2.value
219
220 if m1 != nil && m2 != nil {
221 // Both are unencoded.
David Symonds9f60f432012-06-14 09:45:25 +1000222 if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2)) {
David Symondsa4b61c02011-09-07 14:06:00 +1000223 return false
224 }
225 continue
226 }
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 }
Rob Pikea17fdd92011-11-02 12:43:05 -0700238 var err error
David Symondsa4b61c02011-09-07 14:06:00 +1000239 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 }
David Symonds9f60f432012-06-14 09:45:25 +1000250 if !equalAny(reflect.ValueOf(m1), reflect.ValueOf(m2)) {
David Symondsa4b61c02011-09-07 14:06:00 +1000251 return false
252 }
253 }
254
255 return true
256}