blob: 0db6bc8b60e03a72d5152df48816cbf599df847b [file] [log] [blame]
lh9ed821d2023-04-07 01:36:19 -07001/*
2 * Declarations for System V style searching functions.
3 * Copyright (C) 1995-1999, 2000 Free Software Foundation, Inc.
4 * This file is part of the GNU C Library.
5 *
6 * The GNU C Library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * The GNU C Library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with the GNU C Library; if not, write to the Free
18 * Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
19 * 02111-1307 USA.
20 */
21
22/*
23 * Based on code from uClibc-0.9.30.3
24 * Extensions for use within U-Boot
25 * Copyright (C) 2010 Wolfgang Denk <wd@denx.de>
26 */
27
28#ifndef _SEARCH_H
29#define _SEARCH_H 1
30
31#include <stddef.h>
32
33#define __set_errno(val) do { errno = val; } while (0)
34
35enum env_op {
36 env_op_create,
37 env_op_delete,
38 env_op_overwrite,
39};
40
41/* Action which shall be performed in the call the hsearch. */
42typedef enum {
43 FIND,
44 ENTER
45} ACTION;
46
47typedef struct entry {
48 const char *key;
49 char *data;
50} ENTRY;
51
52/* Opaque type for internal use. */
53struct _ENTRY;
54
55/*
56 * Family of hash table handling functions. The functions also
57 * have reentrant counterparts ending with _r. The non-reentrant
58 * functions all work on a signle internal hashing table.
59 */
60
61/* Data type for reentrant functions. */
62struct hsearch_data {
63 struct _ENTRY *table;
64 unsigned int size;
65 unsigned int filled;
66};
67
68/* Create a new hashing table which will at most contain NEL elements. */
69extern int hcreate_r(size_t __nel, struct hsearch_data *__htab);
70
71/* Destroy current internal hashing table. */
72extern void hdestroy_r(struct hsearch_data *__htab);
73
74/*
75 * Search for entry matching ITEM.key in internal hash table. If
76 * ACTION is `FIND' return found entry or signal error by returning
77 * NULL. If ACTION is `ENTER' replace existing data (if any) with
78 * ITEM.data.
79 * */
80extern int hsearch_r(ENTRY __item, ACTION __action, ENTRY ** __retval,
81 struct hsearch_data *__htab);
82
83/*
84 * Search for an entry matching `MATCH'. Otherwise, Same semantics
85 * as hsearch_r().
86 */
87extern int hmatch_r(const char *__match, int __last_idx, ENTRY ** __retval,
88 struct hsearch_data *__htab);
89/*
90 * Search for an entry whose key or data contains `MATCH'. Otherwise,
91 * Same semantics as hsearch_r().
92 */
93extern int hstrstr_r(const char *__match, int __last_idx, ENTRY ** __retval,
94 struct hsearch_data *__htab);
95
96/* Search and delete entry matching ITEM.key in internal hash table. */
97extern int hdelete_r(const char *__key, struct hsearch_data *__htab);
98
99extern ssize_t hexport_r(struct hsearch_data *__htab,
100 const char __sep, char **__resp, size_t __size);
101
102extern int himport_r(struct hsearch_data *__htab,
103 const char *__env, size_t __size, const char __sep,
104 int __flag);
105
106/* Flags for himport_r() */
107#define H_NOCLEAR 1 /* do not clear hash table before importing */
108
109#endif /* search.h */