/src/elfutils/lib/eu-search.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Definitions for thread-safe tsearch/tfind |
2 | | Copyright (C) 2023 Rice University |
3 | | This file is part of elfutils. |
4 | | |
5 | | This file is free software; you can redistribute it and/or modify |
6 | | it under the terms of either |
7 | | |
8 | | * the GNU Lesser General Public License as published by the Free |
9 | | Software Foundation; either version 3 of the License, or (at |
10 | | your option) any later version |
11 | | |
12 | | or |
13 | | |
14 | | * the GNU General Public License as published by the Free |
15 | | Software Foundation; either version 2 of the License, or (at |
16 | | your option) any later version |
17 | | |
18 | | or both in parallel, as here. |
19 | | |
20 | | elfutils is distributed in the hope that it will be useful, but |
21 | | WITHOUT ANY WARRANTY; without even the implied warranty of |
22 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
23 | | General Public License for more details. |
24 | | |
25 | | You should have received copies of the GNU General Public License and |
26 | | the GNU Lesser General Public License along with this program. If |
27 | | not, see <http://www.gnu.org/licenses/>. */ |
28 | | |
29 | | #ifdef HAVE_CONFIG_H |
30 | | #include <config.h> |
31 | | #endif |
32 | | |
33 | | #include "eu-search.h" |
34 | | |
35 | | void *eu_tsearch (const void *key, search_tree *tree, |
36 | | int (*compare)(const void *, const void *)) |
37 | 43.6k | { |
38 | 43.6k | rwlock_wrlock (tree->lock); |
39 | 43.6k | void *ret = tsearch (key, &tree->root, compare); |
40 | 43.6k | rwlock_unlock (tree->lock); |
41 | | |
42 | 43.6k | return ret; |
43 | 43.6k | } |
44 | | |
45 | | void *eu_tfind (const void *key, search_tree *tree, |
46 | | int (*compare)(const void *, const void *)) |
47 | 0 | { |
48 | 0 | rwlock_rdlock (tree->lock); |
49 | 0 | void *ret = tfind (key, &tree->root, compare); |
50 | 0 | rwlock_unlock (tree->lock); |
51 | |
|
52 | 0 | return ret; |
53 | 0 | } |
54 | | |
55 | | void *eu_tdelete (const void *key, search_tree *tree, |
56 | | int (*compare)(const void *, const void *)) |
57 | 0 | { |
58 | 0 | rwlock_wrlock (tree->lock); |
59 | 0 | void *ret = tdelete (key, &tree->root, compare); |
60 | 0 | rwlock_unlock (tree->lock); |
61 | |
|
62 | 0 | return ret; |
63 | 0 | } |
64 | | |
65 | | void eu_tdestroy (search_tree *tree, void (*free_node)(void *)) |
66 | 103k | { |
67 | 103k | rwlock_wrlock (tree->lock); |
68 | | |
69 | 103k | tdestroy (tree->root, free_node); |
70 | 103k | tree->root = NULL; |
71 | | |
72 | 103k | rwlock_unlock (tree->lock); |
73 | 103k | } |
74 | | |
75 | | void eu_search_tree_init (search_tree *tree) |
76 | 131k | { |
77 | 131k | tree->root = NULL; |
78 | 131k | rwlock_init (tree->lock); |
79 | 131k | } |
80 | | |
81 | | void eu_search_tree_fini (search_tree *tree, void (*free_node)(void *)) |
82 | 103k | { |
83 | 103k | eu_tdestroy (tree, free_node); |
84 | 103k | rwlock_fini (tree->lock); |
85 | 103k | } |