blob: 3a12a7f7af87cb6bad40e01b027b051a13bfa1bc [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.
33// TODO: MessageSet and RawMessage.
34
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,
57 and their corresponding elements are equal.
58 - Two unset fields are equal.
59 - Two unknown field sets are equal if their current
60 encoded state is equal. (TODO)
61 - Two extension sets are equal iff they have corresponding
62 elements that are pairwise equal. (TODO)
63 - Every other combination of things are not equal.
64
65The return value is undefined if a and b are not protocol buffers.
66*/
67func Equal(a, b interface{}) bool {
68 v1, v2 := reflect.ValueOf(a), reflect.ValueOf(b)
69 if v1.Type() != v2.Type() {
70 return false
71 }
72 if v1.Kind() == reflect.Ptr {
73 v1, v2 = v1.Elem(), v2.Elem()
74 }
75 if v1.Kind() != reflect.Struct {
76 return false
77 }
78 return equalStruct(v1, v2)
79}
80
81// v1 and v2 are known to have the same type.
82func equalStruct(v1, v2 reflect.Value) bool {
83 for i := 0; i < v1.NumField(); i++ {
84 f := v1.Type().Field(i)
85 if strings.HasPrefix(f.Name, "XXX_") {
86 continue
87 }
88 f1, f2 := v1.Field(i), v2.Field(i)
89 if f.Type.Kind() == reflect.Ptr {
90 if n1, n2 := f1.IsNil(), f2.IsNil(); n1 && n2 {
91 // both unset
92 continue
93 } else if n1 != n2 {
94 // set/unset mismatch
95 return false
96 }
97 f1, f2 = f1.Elem(), f2.Elem()
98 }
99 if !equalAny(f1, f2) {
100 return false
101 }
102 }
103
104 // TODO: Deal with XXX_unrecognized and XXX_extensions.
105
106 return true
107}
108
109// v1 and v2 are known to have the same type.
110func equalAny(v1, v2 reflect.Value) bool {
111 switch v1.Kind() {
112 case reflect.Bool:
113 return v1.Bool() == v2.Bool()
114 case reflect.Float32, reflect.Float64:
115 return v1.Float() == v2.Float()
116 case reflect.Int32, reflect.Int64:
117 return v1.Int() == v2.Int()
118 case reflect.Ptr:
119 return equalAny(v1.Elem(), v2.Elem())
120 case reflect.Slice:
121 if n1, n2 := v1.IsNil(), v2.IsNil(); n1 && n2 {
122 return true
123 } else if n1 != n2 {
124 return false
125 }
126 if v1.Len() != v2.Len() {
127 return false
128 }
129 // short circuit: []byte
130 if v1.Type().Elem().Kind() == reflect.Uint8 {
131 return bytes.Equal(v1.Interface().([]byte), v2.Interface().([]byte))
132 }
133 for i := 0; i < v1.Len(); i++ {
134 if !equalAny(v1.Index(i), v2.Index(i)) {
135 return false
136 }
137 }
138 return true
139 case reflect.String:
140 return v1.Interface().(string) == v2.Interface().(string)
141 case reflect.Struct:
142 return equalStruct(v1, v2)
143 case reflect.Uint32, reflect.Uint64:
144 return v1.Uint() == v2.Uint()
145 }
146
147 // unknown type, so not a protocol buffer
148 log.Printf("proto: don't know how to compare %v", v1)
149 return false
150}