Merge lp:~tangent-org/libmemcached/1.0-build/ Build: jenkins-Libmemcached-192
[awesomized/libmemcached] / libhashkit / hashkit.cc
1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
2 *
3 * HashKit library
4 *
5 * Copyright (C) 2011-2012 Data Differential, http://datadifferential.com/
6 * Copyright (C) 2006-2009 Brian Aker All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
10 * met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * * Redistributions in binary form must reproduce the above
16 * copyright notice, this list of conditions and the following disclaimer
17 * in the documentation and/or other materials provided with the
18 * distribution.
19 *
20 * * The names of its contributors may not be used to endorse or
21 * promote products derived from this software without specific prior
22 * written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
28 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
30 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
34 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 *
36 */
37
38
39 #include <libhashkit/common.h>
40
41 static inline void _hashkit_init(hashkit_st *self)
42 {
43 self->base_hash.function= hashkit_one_at_a_time;
44 self->base_hash.context= NULL;
45
46 self->distribution_hash.function= hashkit_one_at_a_time;
47 self->distribution_hash.context= NULL;
48
49 self->flags.is_base_same_distributed= true;
50 self->_key= NULL;
51 }
52
53 static inline hashkit_st *_hashkit_create(hashkit_st *self)
54 {
55 if (self)
56 {
57 self->options.is_allocated= false;
58 }
59 else
60 {
61 self= (hashkit_st*)calloc(1, sizeof(hashkit_st));
62 if (self == NULL)
63 {
64 return NULL;
65 }
66
67 self->options.is_allocated= true;
68 }
69
70 return self;
71 }
72
73 hashkit_st *hashkit_create(hashkit_st *self)
74 {
75 self= _hashkit_create(self);
76 if (self == NULL)
77 {
78 return NULL;
79 }
80
81 _hashkit_init(self);
82
83 return self;
84 }
85
86
87 void hashkit_free(hashkit_st *self)
88 {
89 if (self and self->_key)
90 {
91 free(self->_key);
92 self->_key= NULL;
93 }
94
95 if (hashkit_is_allocated(self))
96 {
97 free(self);
98 }
99 }
100
101 hashkit_st *hashkit_clone(hashkit_st *destination, const hashkit_st *source)
102 {
103 if (source == NULL)
104 {
105 return hashkit_create(destination);
106 }
107
108 /* new_clone will be a pointer to destination */
109 destination= _hashkit_create(destination);
110
111 // Should only happen on allocation failure.
112 if (destination == NULL)
113 {
114 return NULL;
115 }
116
117 destination->base_hash= source->base_hash;
118 destination->distribution_hash= source->distribution_hash;
119 destination->flags= source->flags;
120 destination->_key= aes_clone_key(static_cast<aes_key_t*>(source->_key));
121
122 return destination;
123 }
124
125 bool hashkit_compare(const hashkit_st *first, const hashkit_st *second)
126 {
127 if (not first or not second)
128 return false;
129
130 if (first->base_hash.function == second->base_hash.function and
131 first->base_hash.context == second->base_hash.context and
132 first->distribution_hash.function == second->distribution_hash.function and
133 first->distribution_hash.context == second->distribution_hash.context and
134 first->flags.is_base_same_distributed == second->flags.is_base_same_distributed)
135 {
136 return true;
137 }
138
139 return false;
140 }