Branch data Line data Source code
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 : 1383116 : void *eu_tsearch (const void *key, search_tree *tree, 36 : : int (*compare)(const void *, const void *)) 37 : : { 38 : 1383116 : rwlock_wrlock (tree->lock); 39 : 1383116 : void *ret = tsearch (key, &tree->root, compare); 40 : 1383118 : rwlock_unlock (tree->lock); 41 : : 42 : 1383118 : return ret; 43 : : } 44 : : 45 : 3229282 : void *eu_tfind (const void *key, search_tree *tree, 46 : : int (*compare)(const void *, const void *)) 47 : : { 48 : 3229282 : rwlock_rdlock (tree->lock); 49 : 3229282 : void *ret = tfind (key, &tree->root, compare); 50 : 3229282 : rwlock_unlock (tree->lock); 51 : : 52 : 3229282 : return ret; 53 : : } 54 : : 55 : 0 : void *eu_tdelete (const void *key, search_tree *tree, 56 : : int (*compare)(const void *, const void *)) 57 : : { 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 : : } 64 : : 65 : 268038 : void eu_tdestroy (search_tree *tree, void (*free_node)(void *)) 66 : : { 67 : 268038 : rwlock_wrlock (tree->lock); 68 : : 69 : 268038 : tdestroy (tree->root, free_node); 70 : 268038 : tree->root = NULL; 71 : : 72 : 268038 : rwlock_unlock (tree->lock); 73 : 268038 : } 74 : : 75 : 206098 : void eu_search_tree_init (search_tree *tree) 76 : : { 77 : 206098 : tree->root = NULL; 78 : 206098 : rwlock_init (tree->lock); 79 : 206098 : } 80 : : 81 : 268038 : void eu_search_tree_fini (search_tree *tree, void (*free_node)(void *)) 82 : : { 83 : 268038 : eu_tdestroy (tree, free_node); 84 : 268038 : rwlock_fini (tree->lock); 85 : 268038 : }