xf.li | bdd93d5 | 2023-05-12 07:10:14 -0700 | [diff] [blame] | 1 | /* Compatibility symbols for the obsolete <regexp.h> interface. |
| 2 | Copyright (C) 1996-2016 Free Software Foundation, Inc. |
| 3 | This file is part of the GNU C Library. |
| 4 | Contributed by Ulrich Drepper <drepper@cygnus.com>, 1996. |
| 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, see |
| 18 | <http://www.gnu.org/licenses/>. */ |
| 19 | |
| 20 | /* regexp.h now contains only an #error directive, so it cannot be |
| 21 | used in this file. |
| 22 | |
| 23 | The function that would produce an 'expbuf' to use as the second |
| 24 | argument to 'step' and 'advance' was defined only in regexp.h, |
| 25 | as its definition depended on macros defined by the user. */ |
| 26 | |
| 27 | #include <regex.h> |
| 28 | #include <shlib-compat.h> |
| 29 | |
| 30 | #if SHLIB_COMPAT (libc, GLIBC_2_0, GLIBC_2_23) |
| 31 | |
| 32 | /* Define the variables used for the interface. */ |
| 33 | char *loc1; |
| 34 | char *loc2; |
| 35 | compat_symbol (libc, loc1, loc1, GLIBC_2_0); |
| 36 | compat_symbol (libc, loc2, loc2, GLIBC_2_0); |
| 37 | |
| 38 | /* Although we do not support the use we define this variable as well. */ |
| 39 | char *locs; |
| 40 | compat_symbol (libc, locs, locs, GLIBC_2_0); |
| 41 | |
| 42 | |
| 43 | /* Find the next match in STRING. The compiled regular expression is |
| 44 | found in the buffer starting at EXPBUF. `loc1' will return the |
| 45 | first character matched and `loc2' points to the next unmatched |
| 46 | character. */ |
| 47 | int |
| 48 | weak_function attribute_compat_text_section |
| 49 | step (const char *string, const char *expbuf) |
| 50 | { |
| 51 | regmatch_t match; /* We only need info about the full match. */ |
| 52 | |
| 53 | expbuf += __alignof (regex_t *); |
| 54 | expbuf -= (expbuf - ((const char *) 0)) % __alignof__ (regex_t *); |
| 55 | |
| 56 | if (__regexec ((const regex_t *) expbuf, string, 1, &match, REG_NOTEOL) |
| 57 | == REG_NOMATCH) |
| 58 | return 0; |
| 59 | |
| 60 | loc1 = (char *) string + match.rm_so; |
| 61 | loc2 = (char *) string + match.rm_eo; |
| 62 | return 1; |
| 63 | } |
| 64 | compat_symbol (libc, step, step, GLIBC_2_0); |
| 65 | |
| 66 | |
| 67 | /* Match the beginning of STRING with the compiled regular expression |
| 68 | in EXPBUF. If the match is successful `loc2' will contain the |
| 69 | position of the first unmatched character. */ |
| 70 | int |
| 71 | weak_function attribute_compat_text_section |
| 72 | advance (const char *string, const char *expbuf) |
| 73 | { |
| 74 | regmatch_t match; /* We only need info about the full match. */ |
| 75 | |
| 76 | expbuf += __alignof__ (regex_t *); |
| 77 | expbuf -= (expbuf - ((const char *) 0)) % __alignof__ (regex_t *); |
| 78 | |
| 79 | if (__regexec ((const regex_t *) expbuf, string, 1, &match, REG_NOTEOL) |
| 80 | == REG_NOMATCH |
| 81 | /* We have to check whether the check is at the beginning of the |
| 82 | buffer. */ |
| 83 | || match.rm_so != 0) |
| 84 | return 0; |
| 85 | |
| 86 | loc2 = (char *) string + match.rm_eo; |
| 87 | return 1; |
| 88 | } |
| 89 | compat_symbol (libc, advance, advance, GLIBC_2_0); |
| 90 | |
| 91 | |
| 92 | #endif /* SHLIB_COMPAT (2.0, 2.23) */ |