search.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  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-2013 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. enum env_op {
  31. env_op_create,
  32. env_op_delete,
  33. env_op_overwrite,
  34. };
  35. /* Action which shall be performed in the call the hsearch. */
  36. typedef enum {
  37. FIND,
  38. ENTER
  39. } ACTION;
  40. typedef struct entry {
  41. const char *key;
  42. char *data;
  43. int (*callback)(const char *name, const char *value, enum env_op op,
  44. int flags);
  45. int flags;
  46. } ENTRY;
  47. /* Opaque type for internal use. */
  48. struct _ENTRY;
  49. /*
  50. * Family of hash table handling functions. The functions also
  51. * have reentrant counterparts ending with _r. The non-reentrant
  52. * functions all work on a signle internal hashing table.
  53. */
  54. /* Data type for reentrant functions. */
  55. struct hsearch_data {
  56. struct _ENTRY *table;
  57. unsigned int size;
  58. unsigned int filled;
  59. /*
  60. * Callback function which will check whether the given change for variable
  61. * "item" to "newval" may be applied or not, and possibly apply such change.
  62. * When (flag & H_FORCE) is set, it shall not print out any error message and
  63. * shall force overwriting of write-once variables.
  64. .* Must return 0 for approval, 1 for denial.
  65. */
  66. int (*change_ok)(const ENTRY *__item, const char *newval, enum env_op,
  67. int flag);
  68. };
  69. /* Create a new hashing table which will at most contain NEL elements. */
  70. extern int hcreate_r(size_t __nel, struct hsearch_data *__htab);
  71. /* Destroy current internal hashing table. */
  72. extern void hdestroy_r(struct hsearch_data *__htab);
  73. /*
  74. * Search for entry matching ITEM.key in internal hash table. If
  75. * ACTION is `FIND' return found entry or signal error by returning
  76. * NULL. If ACTION is `ENTER' replace existing data (if any) with
  77. * ITEM.data.
  78. * */
  79. extern int hsearch_r(ENTRY __item, ACTION __action, ENTRY ** __retval,
  80. struct hsearch_data *__htab, int __flag);
  81. /*
  82. * Search for an entry matching `MATCH'. Otherwise, Same semantics
  83. * as hsearch_r().
  84. */
  85. extern int hmatch_r(const char *__match, int __last_idx, ENTRY ** __retval,
  86. struct hsearch_data *__htab);
  87. /* Search and delete entry matching ITEM.key in internal hash table. */
  88. extern int hdelete_r(const char *__key, struct hsearch_data *__htab,
  89. int __flag);
  90. extern ssize_t hexport_r(struct hsearch_data *__htab,
  91. const char __sep, int __flag, char **__resp, size_t __size,
  92. int argc, char * const argv[]);
  93. /*
  94. * nvars: length of vars array
  95. * vars: array of strings (variable names) to import (nvars == 0 means all)
  96. * do_apply: whether to call callback function to check the new argument,
  97. * and possibly apply changes (false means accept everything)
  98. */
  99. extern int himport_r(struct hsearch_data *__htab,
  100. const char *__env, size_t __size, const char __sep,
  101. int __flag, int nvars, char * const vars[]);
  102. /* Walk the whole table calling the callback on each element */
  103. extern int hwalk_r(struct hsearch_data *__htab, int (*callback)(ENTRY *));
  104. /* Flags for himport_r(), hexport_r(), hdelete_r(), and hsearch_r() */
  105. #define H_NOCLEAR (1 << 0) /* do not clear hash table before importing */
  106. #define H_FORCE (1 << 1) /* overwrite read-only/write-once variables */
  107. #define H_INTERACTIVE (1 << 2) /* indicate that an import is user directed */
  108. #define H_HIDE_DOT (1 << 3) /* don't print env vars that begin with '.' */
  109. #define H_MATCH_KEY (1 << 4) /* search/grep key = variable names */
  110. #define H_MATCH_DATA (1 << 5) /* search/grep data = variable values */
  111. #define H_MATCH_BOTH (H_MATCH_KEY | H_MATCH_DATA) /* search/grep both */
  112. #define H_MATCH_IDENT (1 << 6) /* search for indentical strings */
  113. #define H_MATCH_SUBSTR (1 << 7) /* search for substring matches */
  114. #define H_MATCH_REGEX (1 << 8) /* search for regular expression matches */
  115. #define H_MATCH_METHOD (H_MATCH_IDENT | H_MATCH_SUBSTR | H_MATCH_REGEX)
  116. #endif /* search.h */