Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
L
liblongpath-rsync
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
liblongpath
liblongpath-rsync
Commits
ade7292a
Commit
ade7292a
authored
Feb 04, 2004
by
Wayne Davison
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Moved a function.
parent
dbd8811b
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
27 additions
and
27 deletions
+27
-27
uidlist.c
uidlist.c
+27
-27
No files found.
uidlist.c
View file @
ade7292a
/*
/*
Copyright (C) Andrew Tridgell 1996
Copyright (C) Paul Mackerras 1996
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., 675 Mass Ave, Cambridge, MA 02139, USA.
...
...
@@ -95,29 +95,6 @@ static int map_gid(int id, char *name)
return
id
;
}
/* this function is a definate candidate for a faster algorithm */
static
uid_t
match_uid
(
uid_t
uid
)
{
static
uid_t
last_in
,
last_out
;
struct
idlist
*
list
=
uidlist
;
if
(
uid
==
last_in
)
return
last_out
;
last_in
=
uid
;
while
(
list
)
{
if
(
list
->
id
==
(
int
)
uid
)
{
last_out
=
(
uid_t
)
list
->
id2
;
return
last_out
;
}
list
=
list
->
next
;
}
last_out
=
uid
;
return
last_out
;
}
static
int
is_in_group
(
gid_t
gid
)
{
#ifdef HAVE_GETGROUPS
...
...
@@ -174,6 +151,29 @@ static int is_in_group(gid_t gid)
#endif
}
/* this function is a definate candidate for a faster algorithm */
static
uid_t
match_uid
(
uid_t
uid
)
{
static
uid_t
last_in
,
last_out
;
struct
idlist
*
list
=
uidlist
;
if
(
uid
==
last_in
)
return
last_out
;
last_in
=
uid
;
while
(
list
)
{
if
(
list
->
id
==
(
int
)
uid
)
{
last_out
=
(
uid_t
)
list
->
id2
;
return
last_out
;
}
list
=
list
->
next
;
}
last_out
=
uid
;
return
last_out
;
}
static
gid_t
match_gid
(
gid_t
gid
)
{
static
gid_t
last_in
=
GID_NONE
,
last_out
=
GID_NONE
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment