blob: 40e40d44acb39a40af187c04c4496743270e1e42 [file] [log] [blame]
David Symonds76551212011-08-22 15:59:24 +10001// Go support for Protocol Buffers - Google's data interchange format
2//
3// Copyright 2011 Google Inc. All rights reserved.
4// http://code.google.com/p/goprotobuf/
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
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.
46The arguments must both be protocol buffer structs,
47or both be pointers to protocol buffer structs.
48
49Equality is defined in this way:
50 - Two messages are equal iff they are the same type,
51 corresponding fields are equal, unknown field sets
52 are equal, and extensions sets are equal.
53 - Two set scalar fields are equal iff their values are equal.
David Symondsb79d99b2011-08-29 16:38:49 +100054 If the fields are of a floating-point type, remember that
55 NaN != x for all x, including NaN.
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
61 encoded state is equal. (TODO)
62 - 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*/
68func Equal(a, b interface{}) bool {
69 v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
70 if v1.Type() != v2.Type() {
71 return false
72 }
73 if v1.Kind() == reflect.Ptr {
74 v1, v2 = v1.Elem(), v2.Elem()
75 }
76 if v1.Kind() != reflect.Struct {
77 return false
78 }
79 return equalStruct(v1, v2)
80}
81
82// v1 and v2 are known to have the same type.
83func 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 }
David Symondse9e7aaf2012-03-23 13:12:33 +110098 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 }
David Symonds76551212011-08-22 15:59:24 +1000107 f1, f2 = f1.Elem(), f2.Elem()
108 }
109 if !equalAny(f1, f2) {
110 return false
111 }
112 }
113
David Symondsa4b61c02011-09-07 14:06:00 +1000114 if em1 := v1.FieldByName("XXX_extensions"); em1.IsValid() {
115 em2 := v2.FieldByName("XXX_extensions")
116 if !equalExtensions(v1.Type(), em1.Interface().(map[int32]Extension), em2.Interface().(map[int32]Extension)) {
117 return false
118 }
119 }
120
121 // TODO: Deal with XXX_unrecognized.
David Symonds76551212011-08-22 15:59:24 +1000122
123 return true
124}
125
126// v1 and v2 are known to have the same type.
127func equalAny(v1, v2 reflect.Value) bool {
128 switch v1.Kind() {
129 case reflect.Bool:
130 return v1.Bool() == v2.Bool()
131 case reflect.Float32, reflect.Float64:
132 return v1.Float() == v2.Float()
133 case reflect.Int32, reflect.Int64:
134 return v1.Int() == v2.Int()
135 case reflect.Ptr:
136 return equalAny(v1.Elem(), v2.Elem())
137 case reflect.Slice:
David Symonds35abe742012-02-13 09:55:16 +1100138 if v1.Type().Elem().Kind() == reflect.Uint8 {
139 // short circuit: []byte
140 if v1.IsNil() != v2.IsNil() {
141 return false
142 }
143 return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
David Symonds76551212011-08-22 15:59:24 +1000144 }
David Symonds35abe742012-02-13 09:55:16 +1100145
David Symonds76551212011-08-22 15:59:24 +1000146 if v1.Len() != v2.Len() {
147 return false
148 }
David Symonds76551212011-08-22 15:59:24 +1000149 for i := 0; i < v1.Len(); i++ {
150 if !equalAny(v1.Index(i), v2.Index(i)) {
151 return false
152 }
153 }
154 return true
155 case reflect.String:
156 return v1.Interface().(string) == v2.Interface().(string)
157 case reflect.Struct:
158 return equalStruct(v1, v2)
159 case reflect.Uint32, reflect.Uint64:
160 return v1.Uint() == v2.Uint()
161 }
162
163 // unknown type, so not a protocol buffer
164 log.Printf("proto: don't know how to compare %v", v1)
165 return false
166}
David Symondsa4b61c02011-09-07 14:06:00 +1000167
168// base is the struct type that the extensions are based on.
169// em1 and em2 are extension maps.
170func equalExtensions(base reflect.Type, em1, em2 map[int32]Extension) bool {
171 if len(em1) != len(em2) {
172 return false
173 }
174
175 for extNum, e1 := range em1 {
176 e2, ok := em2[extNum]
177 if !ok {
178 return false
179 }
180
181 m1, m2 := e1.value, e2.value
182
183 if m1 != nil && m2 != nil {
184 // Both are unencoded.
185 if !Equal(m1, m2) {
186 return false
187 }
188 continue
189 }
190
191 // At least one is encoded. To do a semantically correct comparison
192 // we need to unmarshal them first.
193 var desc *ExtensionDesc
194 if m := extensionMaps[base]; m != nil {
195 desc = m[extNum]
196 }
197 if desc == nil {
198 log.Printf("proto: don't know how to compare extension %d of %v", extNum, base)
199 continue
200 }
Rob Pikea17fdd92011-11-02 12:43:05 -0700201 var err error
David Symondsa4b61c02011-09-07 14:06:00 +1000202 if m1 == nil {
203 m1, err = decodeExtension(e1.enc, desc)
204 }
205 if m2 == nil && err == nil {
206 m2, err = decodeExtension(e2.enc, desc)
207 }
208 if err != nil {
209 // The encoded form is invalid.
210 log.Printf("proto: badly encoded extension %d of %v: %v", extNum, base, err)
211 return false
212 }
213 if !Equal(m1, m2) {
214 return false
215 }
216 }
217
218 return true
219}