1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/*
Copyright (C) 1996, 1997 John W. Eaton
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
Octave is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with Octave; see the file COPYING. If not, write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <fnmatch.h>
#include <glob.h>
#include <iostream>
#include <string>
#include "file-stat.h"
#include "glob-match.h"
#include "str-vec.h"
bool
glob_match::match (const std::string& s)
{
int npat = pat.length ();
const char *str = s.c_str ();
int fnmatch_flags = 0;
if (flags & pathname)
fnmatch_flags |= FNM_PATHNAME;
if (flags & noescape)
fnmatch_flags |= FNM_NOESCAPE;
if (flags & period)
fnmatch_flags |= FNM_PERIOD;
for (int i = 0; i < npat; i++)
if (fnmatch (pat(i).c_str (), str, fnmatch_flags) != FNM_NOMATCH)
return true;
return false;
}
Array<bool>
glob_match::match (const string_vector& s)
{
int n = s.length ();
Array<bool> retval (n);
for (int i = 0; i < n; i++)
retval(i) = match (s[i]);
return retval;
}
static bool
single_match_exists (const std::string& file)
{
file_stat s (file);
return s.exists ();
}
string_vector
glob_match::glob (void)
{
string_vector retval;
int npat = pat.length ();
int k = 0;
for (int i = 0; i < npat; i++)
{
std::string xpat = pat(i);
if (! xpat.empty ())
{
glob_t glob_info;
int err = ::glob (xpat.c_str (), GLOB_NOSORT, 0, &glob_info);
if (! err)
{
int n = glob_info.gl_pathc;
const char * const *matches = glob_info.gl_pathv;
// XXX FIXME XXX -- we shouldn't have to check to see if
// a single match exists, but it seems that glob() won't
// check for us unless the pattern contains globbing
// characters. Hmm.
if (n > 1
|| (n == 1
&& single_match_exists (std::string (matches[0]))))
{
retval.resize (k+n);
for (int j = 0; j < n; j++)
retval[k++] = matches[j];
}
globfree (&glob_info);
}
}
}
return retval.qsort ();
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
