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
142a5e7b
Commit
142a5e7b
authored
May 20, 2007
by
Wayne Davison
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Moved GID_NONE define from rsync.h to uidlist.c.
parent
fdfc6740
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
11 deletions
+8
-11
rsync.h
rsync.h
+0
-2
uidlist.c
uidlist.c
+8
-9
No files found.
rsync.h
View file @
142a5e7b
...
...
@@ -565,8 +565,6 @@ struct idev_node {
#define ACLS_NEED_MASK 1
#endif
#define GID_NONE ((gid_t)-1)
union
file_extras
{
int32
num
;
uint32
unum
;
...
...
uidlist.c
View file @
142a5e7b
...
...
@@ -26,12 +26,6 @@
#include "rsync.h"
#include "io.h"
#ifdef HAVE_GETGROUPS
# ifndef GETGROUPS_T
# define GETGROUPS_T gid_t
# endif
#endif
extern
int
verbose
;
extern
int
am_root
;
extern
int
preserve_uid
;
...
...
@@ -39,6 +33,14 @@ extern int preserve_gid;
extern
int
preserve_acls
;
extern
int
numeric_ids
;
#ifdef HAVE_GETGROUPS
# ifndef GETGROUPS_T
# define GETGROUPS_T gid_t
# endif
#endif
#define GID_NONE ((gid_t)-1)
struct
idlist
{
struct
idlist
*
next
;
char
*
name
;
...
...
@@ -217,9 +219,6 @@ gid_t match_gid(gid_t gid, uint16 *flags_ptr)
static
gid_t
last_in
=
GID_NONE
,
last_out
=
GID_NONE
;
struct
idlist
*
list
;
if
(
gid
==
GID_NONE
)
return
GID_NONE
;
if
(
gid
==
last_in
)
return
last_out
;
...
...
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