sin/samba-mirror
1
0
Fork 0
mirror of https://github.com/samba-team/samba.git synced 2024-12-23 17:34:34 +03:00
Code

lib: Whitespace fixes

Browse Source 
Signed-off-by: Volker Lendecke <vl@samba.org>
Reviewed-by: Jeremy Allison <jra@samba.org>
This commit is contained in:
Volker Lendecke 2022-11-09 10:15:31 +01:00 committed by Jeremy Allison
parent cb6d9e7b81
commit b7d4b8eaac
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
lib/util/ms_fnmatch.c
View File

@ -1,4 +1,4 @@
/*
/*
Unix SMB/CIFS implementation.
filename matching routine
Copyright (C) Andrew Tridgell 1992-2004
@ -7,21 +7,21 @@
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 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, see <http://www.gnu.org/licenses/>.
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
This module was originally based on fnmatch.c copyright by the Free
Software Foundation. It bears little (if any) resemblence to that
code now
*/
*/
/**
* @file
@ -59,7 +59,7 @@ struct max_n {
an optimisation only. The ldot pointer is NULL if the string does
not contain a '.', otherwise it points at the last dot in 'n'.
*/
static int ms_fnmatch_core(const char *p, const char *n,
static int ms_fnmatch_core(const char *p, const char *n,
struct max_n *max_n, const char *ldot,
bool is_case_sensitive)
{
@ -168,11 +168,11 @@ static int ms_fnmatch_core(const char *p, const char *n,
break;
}
}
if (! *n) {
return 0;
}
return -1;
}
@ -205,12 +205,12 @@ int ms_fnmatch_protocol(const char *pattern, const char *string, int protocol,
for (i=0;p[i];i++) {
if (p[i] == '?') {
p[i] = '>';
} else if (p[i] == '.' &&
(p[i+1] == '?' ||
} else if (p[i] == '.' &&
(p[i+1] == '?' ||
p[i+1] == '*' ||
p[i+1] == 0)) {
p[i] = '"';
} else if (p[i] == '*' &&
} else if (p[i] == '*' &&
p[i+1] == '.') {
p[i] = '<';
}