/* The implementation of the hash table (_Py_hashtable_t) is based on the cfuhash project: http://sourceforge.net/projects/libcfu/ Copyright of cfuhash: ---------------------------------- Creation date: 2005-06-24 21:22:40 Authors: Don Change log: Copyright (c) 2005 Don Owens All rights reserved. This code is released under the BSD license: Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of the author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ---------------------------------- */ #include "Python.h" #include "pycore_hashtable.h" // export _Py_hashtable_new() #include "pycore_pyhash.h" // _Py_HashPointerRaw() #define HASHTABLE_MIN_SIZE … #define HASHTABLE_HIGH … #define HASHTABLE_LOW … #define HASHTABLE_REHASH_FACTOR … #define BUCKETS_HEAD(SLIST) … #define TABLE_HEAD(HT, BUCKET) … #define ENTRY_NEXT(ENTRY) … /* Forward declaration */ static int hashtable_rehash(_Py_hashtable_t *ht); static void _Py_slist_init(_Py_slist_t *list) { … } static void _Py_slist_prepend(_Py_slist_t *list, _Py_slist_item_t *item) { … } static void _Py_slist_remove(_Py_slist_t *list, _Py_slist_item_t *previous, _Py_slist_item_t *item) { … } Py_uhash_t _Py_hashtable_hash_ptr(const void *key) { … } int _Py_hashtable_compare_direct(const void *key1, const void *key2) { … } /* makes sure the real size of the buckets array is a power of 2 */ static size_t round_size(size_t s) { … } size_t _Py_hashtable_size(const _Py_hashtable_t *ht) { … } size_t _Py_hashtable_len(const _Py_hashtable_t *ht) { … } _Py_hashtable_entry_t * _Py_hashtable_get_entry_generic(_Py_hashtable_t *ht, const void *key) { … } // Specialized for: // hash_func == _Py_hashtable_hash_ptr // compare_func == _Py_hashtable_compare_direct static _Py_hashtable_entry_t * _Py_hashtable_get_entry_ptr(_Py_hashtable_t *ht, const void *key) { … } void* _Py_hashtable_steal(_Py_hashtable_t *ht, const void *key) { … } int _Py_hashtable_set(_Py_hashtable_t *ht, const void *key, void *value) { … } void* _Py_hashtable_get(_Py_hashtable_t *ht, const void *key) { … } int _Py_hashtable_foreach(_Py_hashtable_t *ht, _Py_hashtable_foreach_func func, void *user_data) { … } static int hashtable_rehash(_Py_hashtable_t *ht) { … } _Py_hashtable_t * _Py_hashtable_new_full(_Py_hashtable_hash_func hash_func, _Py_hashtable_compare_func compare_func, _Py_hashtable_destroy_func key_destroy_func, _Py_hashtable_destroy_func value_destroy_func, _Py_hashtable_allocator_t *allocator) { … } _Py_hashtable_t * _Py_hashtable_new(_Py_hashtable_hash_func hash_func, _Py_hashtable_compare_func compare_func) { … } static void _Py_hashtable_destroy_entry(_Py_hashtable_t *ht, _Py_hashtable_entry_t *entry) { … } void _Py_hashtable_clear(_Py_hashtable_t *ht) { … } void _Py_hashtable_destroy(_Py_hashtable_t *ht) { … }