hashkit.cc 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  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. #include <libhashkit/common.h>
  38. static inline void _hashkit_init(hashkit_st *self)
  39. {
  40. self->base_hash.function= hashkit_one_at_a_time;
  41. self->base_hash.context= NULL;
  42. self->distribution_hash.function= hashkit_one_at_a_time;
  43. self->distribution_hash.context= NULL;
  44. self->flags.is_base_same_distributed= true;
  45. self->_key= NULL;
  46. }
  47. static inline hashkit_st *_hashkit_create(hashkit_st *self)
  48. {
  49. if (self)
  50. {
  51. self->options.is_allocated= false;
  52. }
  53. else
  54. {
  55. self= (hashkit_st*)calloc(1, sizeof(hashkit_st));
  56. if (self == NULL)
  57. {
  58. return NULL;
  59. }
  60. self->options.is_allocated= true;
  61. }
  62. return self;
  63. }
  64. hashkit_st *hashkit_create(hashkit_st *self)
  65. {
  66. self= _hashkit_create(self);
  67. if (self == NULL)
  68. {
  69. return NULL;
  70. }
  71. _hashkit_init(self);
  72. return self;
  73. }
  74. void hashkit_free(hashkit_st *self)
  75. {
  76. if (self and self->_key)
  77. {
  78. free(self->_key);
  79. self->_key= NULL;
  80. }
  81. if (hashkit_is_allocated(self))
  82. {
  83. free(self);
  84. }
  85. }
  86. hashkit_st *hashkit_clone(hashkit_st *destination, const hashkit_st *source)
  87. {
  88. if (source == NULL)
  89. {
  90. return hashkit_create(destination);
  91. }
  92. /* new_clone will be a pointer to destination */
  93. destination= _hashkit_create(destination);
  94. // Should only happen on allocation failure.
  95. if (destination == NULL)
  96. {
  97. return NULL;
  98. }
  99. destination->base_hash= source->base_hash;
  100. destination->distribution_hash= source->distribution_hash;
  101. destination->flags= source->flags;
  102. destination->_key= aes_clone_key(static_cast<aes_key_t*>(source->_key));
  103. return destination;
  104. }
  105. bool hashkit_compare(const hashkit_st *first, const hashkit_st *second)
  106. {
  107. if (not first or not second)
  108. return false;
  109. if (first->base_hash.function == second->base_hash.function and
  110. first->base_hash.context == second->base_hash.context and
  111. first->distribution_hash.function == second->distribution_hash.function and
  112. first->distribution_hash.context == second->distribution_hash.context and
  113. first->flags.is_base_same_distributed == second->flags.is_base_same_distributed)
  114. {
  115. return true;
  116. }
  117. return false;
  118. }