diff options
| author | Karl Heuer | 1994-10-19 04:51:07 +0000 |
|---|---|---|
| committer | Karl Heuer | 1994-10-19 04:51:07 +0000 |
| commit | e50c66d349eb02a4a0367f4cd9227c0f227ea41b (patch) | |
| tree | abb962950b415d0fba4e507a6394f2b539e3f32f /src/dired.c | |
| parent | 41b9e2b5685f612a42b4922664e1fdb75badceac (diff) | |
| download | emacs-e50c66d349eb02a4a0367f4cd9227c0f227ea41b.tar.gz emacs-e50c66d349eb02a4a0367f4cd9227c0f227ea41b.zip | |
(Fdirectory_files): Use the new calling convention for compile_pattern.
Diffstat (limited to 'src/dired.c')
| -rw-r--r-- | src/dired.c | 15 |
1 files changed, 8 insertions, 7 deletions
diff --git a/src/dired.c b/src/dired.c index 1bad7a42678..b8ba01b5edd 100644 --- a/src/dired.c +++ b/src/dired.c | |||
| @@ -80,8 +80,8 @@ extern struct direct *readdir (); | |||
| 80 | 80 | ||
| 81 | #include "regex.h" | 81 | #include "regex.h" |
| 82 | 82 | ||
| 83 | /* A search buffer, with a fastmap allocated and ready to go. */ | 83 | /* Returns a search buffer, with a fastmap allocated and ready to go. */ |
| 84 | extern struct re_pattern_buffer searchbuf; | 84 | extern struct re_pattern_buffer *compile_pattern (); |
| 85 | 85 | ||
| 86 | #define min(a, b) ((a) < (b) ? (a) : (b)) | 86 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
| 87 | 87 | ||
| @@ -116,6 +116,7 @@ If NOSORT is non-nil, the list is not sorted--its order is unpredictable.\n\ | |||
| 116 | int length; | 116 | int length; |
| 117 | Lisp_Object list, name, dirfilename; | 117 | Lisp_Object list, name, dirfilename; |
| 118 | Lisp_Object handler; | 118 | Lisp_Object handler; |
| 119 | struct re_pattern_buffer *bufp; | ||
| 119 | 120 | ||
| 120 | /* If the file name has special constructs in it, | 121 | /* If the file name has special constructs in it, |
| 121 | call the corresponding file handler. */ | 122 | call the corresponding file handler. */ |
| @@ -154,14 +155,14 @@ If NOSORT is non-nil, the list is not sorted--its order is unpredictable.\n\ | |||
| 154 | catching and signalling our own errors, we just call | 155 | catching and signalling our own errors, we just call |
| 155 | compile_pattern to do the work for us. */ | 156 | compile_pattern to do the work for us. */ |
| 156 | #ifdef VMS | 157 | #ifdef VMS |
| 157 | compile_pattern (match, &searchbuf, 0, | 158 | bufp = compile_pattern (match, 0, |
| 158 | buffer_defaults.downcase_table->contents); | 159 | buffer_defaults.downcase_table->contents); |
| 159 | #else | 160 | #else |
| 160 | compile_pattern (match, &searchbuf, 0, 0); | 161 | bufp = compile_pattern (match, 0, 0); |
| 161 | #endif | 162 | #endif |
| 162 | } | 163 | } |
| 163 | 164 | ||
| 164 | /* Now searchbuf is the compiled form of MATCH; don't call anything | 165 | /* Now *bufp is the compiled form of MATCH; don't call anything |
| 165 | which might compile a new regexp until we're done with the loop! */ | 166 | which might compile a new regexp until we're done with the loop! */ |
| 166 | 167 | ||
| 167 | /* Do this opendir after anything which might signal an error; if | 168 | /* Do this opendir after anything which might signal an error; if |
| @@ -186,7 +187,7 @@ If NOSORT is non-nil, the list is not sorted--its order is unpredictable.\n\ | |||
| 186 | if (DIRENTRY_NONEMPTY (dp)) | 187 | if (DIRENTRY_NONEMPTY (dp)) |
| 187 | { | 188 | { |
| 188 | if (NILP (match) | 189 | if (NILP (match) |
| 189 | || (0 <= re_search (&searchbuf, dp->d_name, len, 0, len, 0))) | 190 | || (0 <= re_search (bufp, dp->d_name, len, 0, len, 0))) |
| 190 | { | 191 | { |
| 191 | if (!NILP (full)) | 192 | if (!NILP (full)) |
| 192 | { | 193 | { |