2 * Copyright (c) 2017 Mellanox Technologies LTD. All rights reserved.
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 #if __cplusplus >= 201103L
35 #include <unordered_map>
36 #define UM_NAMESPACE std
38 #include <tr1/unordered_map>
39 #define UM_NAMESPACE std::tr1
44 UM_NAMESPACE::unordered_map<void *, void *> map;
60 return ((GHashTable *)(new HashTable()));
64 GHashTableDestroy(GHashTable *ght)
66 delete (HashTable *)ght;
70 GHashTableInsert(GHashTable *ght, void *key, void *value)
72 HashTable *ht = (HashTable *)ght;
77 GHashTableLookup(GHashTable *ght, void *key)
79 HashTable *ht = (HashTable *)ght;
81 if (ht->map.find(key) == ht->map.end())
83 return (ht->map[key]);