| 1 | /*- |
| 2 | * Copyright (c) 2015 Nuxi, https://nuxi.nl/ |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 7 | * 1. Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * 2. Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * |
| 13 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 14 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 16 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 17 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 18 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 19 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 20 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 21 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 22 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 23 | * SUCH DAMAGE. |
| 24 | */ |
| 25 | |
| 26 | #include <sys/cdefs.h> |
| 27 | |
| 28 | #include "search.h" |
| 29 | #include <stdbool.h> |
| 30 | #include <stddef.h> |
| 31 | |
| 32 | /* |
| 33 | * Thread unsafe interface: use a single process-wide hash table and |
| 34 | * forward calls to *_r() functions. |
| 35 | */ |
| 36 | |
| 37 | static struct hsearch_data global_hashtable; |
| 38 | static bool global_hashtable_initialized = false; |
| 39 | |
| 40 | int |
| 41 | hcreate(size_t nel) |
| 42 | { |
| 43 | |
| 44 | return (1); |
| 45 | } |
| 46 | |
| 47 | void |
| 48 | hdestroy(void) |
| 49 | { |
| 50 | |
| 51 | /* Destroy global hash table if present. */ |
| 52 | if (global_hashtable_initialized) { |
| 53 | hdestroy_r(&global_hashtable); |
| 54 | global_hashtable_initialized = false; |
| 55 | } |
| 56 | } |
| 57 | |
| 58 | ENTRY * |
| 59 | hsearch(ENTRY item, ACTION action) |
| 60 | { |
| 61 | ENTRY *retval; |
| 62 | |
| 63 | /* Create global hash table if needed. */ |
| 64 | if (!global_hashtable_initialized) { |
| 65 | if (hcreate_r(0, &global_hashtable) == 0) |
| 66 | return (NULL); |
| 67 | global_hashtable_initialized = true; |
| 68 | } |
| 69 | if (hsearch_r(item, action, &retval, &global_hashtable) == 0) |
| 70 | return (NULL); |
| 71 | return (retval); |
| 72 | } |