1 /*
2 * Copyright (c) 2017 Mellanox Technologies LTD. All rights reserved.
3 *
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:
9 *
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
12 * conditions are met:
13 *
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer.
17 *
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.
22 *
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
30 * SOFTWARE.
31 *
32 */
33
34 #if __cplusplus >= 201103L
35 #include <unordered_map>
36 #define UM_NAMESPACE std
37 #else
38 #include <tr1/unordered_map>
39 #define UM_NAMESPACE std::tr1
40 #endif
41
42 class HashTable {
43 public:
44 UM_NAMESPACE::unordered_map<void *, void *> map;
HashTable()45 HashTable() { };
~HashTable()46 ~HashTable() { };
47 };
48
49 extern "C" {
50
51 #if HAVE_CONFIG_H
52 #include <config.h>
53 #endif
54
55 #include "internal.h"
56
57 GHashTable *
GHashTableNew(void)58 GHashTableNew(void)
59 {
60 return ((GHashTable *)(new HashTable()));
61 }
62
63 void
GHashTableDestroy(GHashTable * ght)64 GHashTableDestroy(GHashTable *ght)
65 {
66 delete (HashTable *)ght;
67 }
68
69 void
GHashTableInsert(GHashTable * ght,void * key,void * value)70 GHashTableInsert(GHashTable *ght, void *key, void *value)
71 {
72 HashTable *ht = (HashTable *)ght;
73 ht->map[key] = value;
74 }
75
76 void *
GHashTableLookup(GHashTable * ght,void * key)77 GHashTableLookup(GHashTable *ght, void *key)
78 {
79 HashTable *ht = (HashTable *)ght;
80
81 if (ht->map.find(key) == ht->map.end())
82 return (NULL);
83 return (ht->map[key]);
84 }
85
86 }
87