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
|
/* Hurd unionfs
Copyright (C) 2001, 2002, 2005 Free Software Foundation, Inc.
Written by Gianluca Guida <glguida@gmail.com>.
This program 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 of the
License, or * (at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA. */
/* Pattern list management. */
#define _GNU_SOURCE
#include <hurd/netfs.h>
#include <stdlib.h>
#include <fnmatch.h>
#include <errno.h>
#include "pattern.h"
/* Add a wildcard expression *PATTERN to **PATTERNLIST. */
error_t
patternlist_add (struct patternlist *list, char *pattern)
{
error_t err = 0;
struct pattern *listentry;
char *dup;
if (pattern == NULL) /* BUG. */
err = EINVAL;
if (err)
return err;
dup = strdup (pattern);
if (dup == NULL)
err = ENOMEM;
if (err)
return err;
listentry = malloc (sizeof (struct pattern));
if (listentry == NULL)
err = ENOMEM;
if (err)
return err;
listentry->pattern = dup;
mutex_lock (& (list->lock));
if (list->head == NULL) /* List is empty. */
{
list->head = listentry;
listentry->next = NULL;
}
else
{
listentry->next = list->head;
list->head = listentry;
}
mutex_unlock (& (list->lock));
return err;
}
/* Check for match all pattern of the list *LIST, returning logical OR
of results. */
int
patternlist_match (struct patternlist *list, char *string)
{
struct pattern *ptr;
error_t err = ~0; /* Return false by default */
ptr = list->head;
mutex_lock (&list->lock);
while (ptr != NULL)
{
err = fnmatch (ptr->pattern, string, FNM_FILE_NAME);
if (!err) /* String matched. */
break;
ptr = ptr->next;
}
mutex_unlock (&list->lock);
return err;
}
/* Free all resource used by *PATTERNLIST. */
void
patternlist_destroy (struct patternlist *list)
{
struct pattern *next, *ptr = list->head;
mutex_lock (& (list->lock));
while (ptr != NULL)
{
next = ptr->next;
free (ptr);
ptr = next;
}
mutex_unlock (& (list->lock));
}
/* Return nonzero if *PATTERNLIST is empty. */
int
patternlist_isempty (struct patternlist *list)
{
int ret;
mutex_lock (& (list->lock));
ret = (list->head == NULL);
mutex_unlock (& (list->lock));
return ret;
}
|
