search.h 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /*
  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. * Based on code from uClibc-0.9.30.3
  23. * Extensions for use within U-Boot
  24. * Copyright (C) 2010 Wolfgang Denk <wd@denx.de>
  25. */
  26. #ifndef _SEARCH_H
  27. #define _SEARCH_H 1
  28. #include <stddef.h>
  29. #define __set_errno(val) do { errno = val; } while (0)
  30. /* Action which shall be performed in the call the hsearch. */
  31. typedef enum {
  32. FIND,
  33. ENTER
  34. } ACTION;
  35. typedef struct entry {
  36. const char *key;
  37. char *data;
  38. } ENTRY;
  39. /* Opaque type for internal use. */
  40. struct _ENTRY;
  41. /*
  42. * Family of hash table handling functions. The functions also
  43. * have reentrant counterparts ending with _r. The non-reentrant
  44. * functions all work on a signle internal hashing table.
  45. */
  46. /* Data type for reentrant functions. */
  47. struct hsearch_data {
  48. struct _ENTRY *table;
  49. unsigned int size;
  50. unsigned int filled;
  51. };
  52. /* Create a new hashing table which will at most contain NEL elements. */
  53. extern int hcreate_r(size_t __nel, struct hsearch_data *__htab);
  54. /* Destroy current internal hashing table. */
  55. extern void hdestroy_r(struct hsearch_data *__htab);
  56. /*
  57. * Search for entry matching ITEM.key in internal hash table. If
  58. * ACTION is `FIND' return found entry or signal error by returning
  59. * NULL. If ACTION is `ENTER' replace existing data (if any) with
  60. * ITEM.data.
  61. * */
  62. extern int hsearch_r(ENTRY __item, ACTION __action, ENTRY ** __retval,
  63. struct hsearch_data *__htab);
  64. /*
  65. * Search for an entry matching `MATCH'. Otherwise, Same semantics
  66. * as hsearch_r().
  67. */
  68. extern int hmatch_r(const char *__match, int __last_idx, ENTRY ** __retval,
  69. struct hsearch_data *__htab);
  70. /*
  71. * Search for an entry whose key or data contains `MATCH'. Otherwise,
  72. * Same semantics as hsearch_r().
  73. */
  74. extern int hstrstr_r(const char *__match, int __last_idx, ENTRY ** __retval,
  75. struct hsearch_data *__htab);
  76. /* Search and delete entry matching ITEM.key in internal hash table. */
  77. extern int hdelete_r(const char *__key, struct hsearch_data *__htab);
  78. extern ssize_t hexport_r(struct hsearch_data *__htab,
  79. const char __sep, char **__resp, size_t __size);
  80. extern int himport_r(struct hsearch_data *__htab,
  81. const char *__env, size_t __size, const char __sep,
  82. int __flag);
  83. /* Flags for himport_r() */
  84. #define H_NOCLEAR 1 /* do not clear hash table before importing */
  85. #endif /* search.h */