1 /* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
5 * Copyright (C) 2011-2012 Data Differential, http://datadifferential.com/
6 * Copyright (C) 2006-2009 Brian Aker All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
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
20 * * The names of its contributors may not be used to endorse or
21 * promote products derived from this software without specific prior
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.
39 #include <libhashkit/common.h>
41 static inline void _hashkit_init(hashkit_st
*self
)
43 self
->base_hash
.function
= hashkit_one_at_a_time
;
44 self
->base_hash
.context
= NULL
;
46 self
->distribution_hash
.function
= hashkit_one_at_a_time
;
47 self
->distribution_hash
.context
= NULL
;
49 self
->flags
.is_base_same_distributed
= true;
53 static inline hashkit_st
*_hashkit_create(hashkit_st
*self
)
57 self
->options
.is_allocated
= false;
61 self
= (hashkit_st
*)calloc(1, sizeof(hashkit_st
));
67 self
->options
.is_allocated
= true;
73 hashkit_st
*hashkit_create(hashkit_st
*self
)
75 self
= _hashkit_create(self
);
87 void hashkit_free(hashkit_st
*self
)
89 if (self
and self
->_key
)
95 if (hashkit_is_allocated(self
))
101 hashkit_st
*hashkit_clone(hashkit_st
*destination
, const hashkit_st
*source
)
105 return hashkit_create(destination
);
108 /* new_clone will be a pointer to destination */
109 destination
= _hashkit_create(destination
);
111 // Should only happen on allocation failure.
112 if (destination
== NULL
)
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
));
125 bool hashkit_compare(const hashkit_st
*first
, const hashkit_st
*second
)
127 if (not first
or not second
)
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
)