1*5113495bSYour Name /* 2*5113495bSYour Name * Copyright (c) 2018-2019 The Linux Foundation. All rights reserved. 3*5113495bSYour Name * 4*5113495bSYour Name * Permission to use, copy, modify, and/or distribute this software for 5*5113495bSYour Name * any purpose with or without fee is hereby granted, provided that the 6*5113495bSYour Name * above copyright notice and this permission notice appear in all 7*5113495bSYour Name * copies. 8*5113495bSYour Name * 9*5113495bSYour Name * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL 10*5113495bSYour Name * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED 11*5113495bSYour Name * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE 12*5113495bSYour Name * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 13*5113495bSYour Name * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 14*5113495bSYour Name * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER 15*5113495bSYour Name * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 16*5113495bSYour Name * PERFORMANCE OF THIS SOFTWARE. 17*5113495bSYour Name */ 18*5113495bSYour Name 19*5113495bSYour Name #ifndef __I_QDF_HASHTABLE_H 20*5113495bSYour Name #define __I_QDF_HASHTABLE_H 21*5113495bSYour Name 22*5113495bSYour Name #include "linux/hashtable.h" 23*5113495bSYour Name 24*5113495bSYour Name #define __qdf_ht hlist_head 25*5113495bSYour Name #define __qdf_ht_entry hlist_node 26*5113495bSYour Name #define __qdf_ht_declare(name, bits) DECLARE_HASHTABLE(name, bits) 27*5113495bSYour Name #define __qdf_ht_init(table) hash_init(table) 28*5113495bSYour Name #define __qdf_ht_deinit(table) do { } while (false) 29*5113495bSYour Name #define __qdf_ht_empty(table) hash_empty(table) 30*5113495bSYour Name #define __qdf_ht_add(table, entry, key) hash_add(table, entry, key) 31*5113495bSYour Name #define __qdf_ht_remove(entry) hash_del(entry) 32*5113495bSYour Name 33*5113495bSYour Name #define __qdf_ht_for_each(table, i, cursor, entry_field) \ 34*5113495bSYour Name hash_for_each(table, i, cursor, entry_field) 35*5113495bSYour Name 36*5113495bSYour Name #define __qdf_ht_for_each_in_bucket(table, cursor, entry_field, key) \ 37*5113495bSYour Name hash_for_each_possible(table, cursor, entry_field, key) 38*5113495bSYour Name 39*5113495bSYour Name #define __qdf_ht_for_each_match(table, cursor, entry_field, key, key_field) \ 40*5113495bSYour Name hash_for_each_possible(table, (cursor), entry_field, (key)) \ 41*5113495bSYour Name if ((cursor)->key_field == (key)) 42*5113495bSYour Name 43*5113495bSYour Name #define __qdf_ht_get(table, cursor, entry_field, key, key_field) \ 44*5113495bSYour Name do { \ 45*5113495bSYour Name cursor = NULL; \ 46*5113495bSYour Name __qdf_ht_for_each_match(table, cursor, entry_field, key, key_field) \ 47*5113495bSYour Name break; \ 48*5113495bSYour Name } while (false) 49*5113495bSYour Name 50*5113495bSYour Name #define __qdf_ht_for_each_safe(table, i, tmp, cursor, entry_field) \ 51*5113495bSYour Name hash_for_each_safe(table, i, tmp, cursor, entry_field) 52*5113495bSYour Name 53*5113495bSYour Name #endif /* __I_QDF_HASHTABLE_H */ 54