OpenCoverage

idcache.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/coreutils/src/gnulib/lib/idcache.c
Source codeSwitch to Preprocessed file
LineSourceCount
1/* idcache.c -- map user and group IDs, cached for speed-
2-
3 Copyright (C) 1985, 1988-1990, 1997-1998, 2003, 2005-2007, 2009-2018 Free-
4 Software Foundation, Inc.-
5-
6 This program is free software: you can redistribute it and/or modify-
7 it under the terms of the GNU General Public License as published by-
8 the Free Software Foundation; either version 3 of the License, or-
9 (at your option) any later version.-
10-
11 This program is distributed in the hope that it will be useful,-
12 but WITHOUT ANY WARRANTY; without even the implied warranty of-
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the-
14 GNU General Public License for more details.-
15-
16 You should have received a copy of the GNU General Public License-
17 along with this program. If not, see <https://www.gnu.org/licenses/>. */-
18-
19#include <config.h>-
20-
21#include "idcache.h"-
22#include <stddef.h>-
23#include <stdio.h>-
24#include <string.h>-
25#include <pwd.h>-
26#include <grp.h>-
27-
28#include <unistd.h>-
29-
30#include "flexmember.h"-
31#include "xalloc.h"-
32-
33#ifdef __DJGPP__-
34static char digits[] = "0123456789";-
35#endif-
36-
37struct userid-
38{-
39 union-
40 {-
41 uid_t u;-
42 gid_t g;-
43 } id;-
44 struct userid *next;-
45 char name[FLEXIBLE_ARRAY_MEMBER];-
46};-
47-
48/* FIXME: provide a function to free any malloc'd storage and reset lists,-
49 so that an application can use code like this just before exiting:-
50 #if defined GCC_LINT || defined lint-
51 idcache_clear ();-
52 #endif-
53*/-
54-
55static struct userid *user_alist;-
56-
57/* Each entry on list is a user name for which the first lookup failed. */-
58static struct userid *nouser_alist;-
59-
60/* Use the same struct as for userids. */-
61static struct userid *group_alist;-
62-
63/* Each entry on list is a group name for which the first lookup failed. */-
64static struct userid *nogroup_alist;-
65-
66/* Translate UID to a login name, with cache, or NULL if unresolved. */-
67-
68char *-
69getuser (uid_t uid)-
70{-
71 struct userid *tail;-
72 struct userid *match = NULL;-
73-
74 for (tail = user_alist; tail; tail = tail->next)
tailDescription
TRUEevaluated 39 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEevaluated 13 times by 2 tests
Evaluated by:
  • ls
  • vdir
13-39
75 {-
76 if (tail->id.u == uid)
tail->id.u == uidDescription
TRUEevaluated 39 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEnever evaluated
0-39
77 {-
78 match = tail;-
79 break;
executed 39 times by 2 tests: break;
Executed by:
  • ls
  • vdir
39
80 }-
81 }
never executed: end of block
0
82-
83 if (match == NULL)
match == ((void *)0)Description
TRUEevaluated 13 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEevaluated 39 times by 2 tests
Evaluated by:
  • ls
  • vdir
13-39
84 {-
85 struct passwd *pwent = getpwuid (uid);-
86 char const *name = pwent ? pwent->pw_name : "";
pwentDescription
TRUEevaluated 13 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEnever evaluated
0-13
87 match = xmalloc (FLEXSIZEOF (struct userid, name, strlen (name) + 1));-
88 match->id.u = uid;-
89 strcpy (match->name, name);-
90-
91 /* Add to the head of the list, so most recently used is first. */-
92 match->next = user_alist;-
93 user_alist = match;-
94 }
executed 13 times by 2 tests: end of block
Executed by:
  • ls
  • vdir
13
95-
96 return match->name[0] ? match->name : NULL;
executed 52 times by 2 tests: return match->name[0] ? match->name : ((void *)0) ;
Executed by:
  • ls
  • vdir
52
97}-
98-
99/* Translate USER to a UID, with cache.-
100 Return NULL if there is no such user.-
101 (We also cache which user names have no passwd entry,-
102 so we don't keep looking them up.) */-
103-
104uid_t *-
105getuidbyname (const char *user)-
106{-
107 struct userid *tail;-
108 struct passwd *pwent;-
109-
110 for (tail = user_alist; tail; tail = tail->next)
tailDescription
TRUEnever evaluated
FALSEnever evaluated
0
111 /* Avoid a function call for the most common case. */-
112 if (*tail->name == *user && !strcmp (tail->name, user))
never executed: __result = (((const unsigned char *) (const char *) ( tail->name ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
never executed: __result = (((const unsigned char *) (const char *) ( user ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
*tail->name == *userDescription
TRUEnever evaluated
FALSEnever evaluated
! __extension_... user )))); })Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
0
113 return &tail->id.u;
never executed: return &tail->id.u;
0
114-
115 for (tail = nouser_alist; tail; tail = tail->next)
tailDescription
TRUEnever evaluated
FALSEnever evaluated
0
116 /* Avoid a function call for the most common case. */-
117 if (*tail->name == *user && !strcmp (tail->name, user))
never executed: __result = (((const unsigned char *) (const char *) ( tail->name ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
never executed: __result = (((const unsigned char *) (const char *) ( user ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
*tail->name == *userDescription
TRUEnever evaluated
FALSEnever evaluated
! __extension_... user )))); })Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
0
118 return NULL;
never executed: return ((void *)0) ;
0
119-
120 pwent = getpwnam (user);-
121#ifdef __DJGPP__-
122 /* We need to pretend to be the user USER, to make-
123 pwd functions know about an arbitrary user name. */-
124 if (!pwent && strspn (user, digits) < strlen (user))-
125 {-
126 setenv ("USER", user, 1);-
127 pwent = getpwnam (user); /* now it will succeed */-
128 }-
129#endif-
130-
131 tail = xmalloc (FLEXSIZEOF (struct userid, name, strlen (user) + 1));-
132 strcpy (tail->name, user);-
133-
134 /* Add to the head of the list, so most recently used is first. */-
135 if (pwent)
pwentDescription
TRUEnever evaluated
FALSEnever evaluated
0
136 {-
137 tail->id.u = pwent->pw_uid;-
138 tail->next = user_alist;-
139 user_alist = tail;-
140 return &tail->id.u;
never executed: return &tail->id.u;
0
141 }-
142-
143 tail->next = nouser_alist;-
144 nouser_alist = tail;-
145 return NULL;
never executed: return ((void *)0) ;
0
146}-
147-
148/* Translate GID to a group name, with cache, or NULL if unresolved. */-
149-
150char *-
151getgroup (gid_t gid)-
152{-
153 struct userid *tail;-
154 struct userid *match = NULL;-
155-
156 for (tail = group_alist; tail; tail = tail->next)
tailDescription
TRUEevaluated 31 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEevaluated 5 times by 2 tests
Evaluated by:
  • ls
  • vdir
5-31
157 {-
158 if (tail->id.g == gid)
tail->id.g == gidDescription
TRUEevaluated 31 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEnever evaluated
0-31
159 {-
160 match = tail;-
161 break;
executed 31 times by 2 tests: break;
Executed by:
  • ls
  • vdir
31
162 }-
163 }
never executed: end of block
0
164-
165 if (match == NULL)
match == ((void *)0)Description
TRUEevaluated 5 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEevaluated 31 times by 2 tests
Evaluated by:
  • ls
  • vdir
5-31
166 {-
167 struct group *grent = getgrgid (gid);-
168 char const *name = grent ? grent->gr_name : "";
grentDescription
TRUEevaluated 5 times by 2 tests
Evaluated by:
  • ls
  • vdir
FALSEnever evaluated
0-5
169 match = xmalloc (FLEXSIZEOF (struct userid, name, strlen (name) + 1));-
170 match->id.g = gid;-
171 strcpy (match->name, name);-
172-
173 /* Add to the head of the list, so most recently used is first. */-
174 match->next = group_alist;-
175 group_alist = match;-
176 }
executed 5 times by 2 tests: end of block
Executed by:
  • ls
  • vdir
5
177-
178 return match->name[0] ? match->name : NULL;
executed 36 times by 2 tests: return match->name[0] ? match->name : ((void *)0) ;
Executed by:
  • ls
  • vdir
36
179}-
180-
181/* Translate GROUP to a GID, with cache.-
182 Return NULL if there is no such group.-
183 (We also cache which group names have no group entry,-
184 so we don't keep looking them up.) */-
185-
186gid_t *-
187getgidbyname (const char *group)-
188{-
189 struct userid *tail;-
190 struct group *grent;-
191-
192 for (tail = group_alist; tail; tail = tail->next)
tailDescription
TRUEnever evaluated
FALSEnever evaluated
0
193 /* Avoid a function call for the most common case. */-
194 if (*tail->name == *group && !strcmp (tail->name, group))
never executed: __result = (((const unsigned char *) (const char *) ( tail->name ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
never executed: __result = (((const unsigned char *) (const char *) ( group ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
*tail->name == *groupDescription
TRUEnever evaluated
FALSEnever evaluated
! __extension_...group )))); })Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
0
195 return &tail->id.g;
never executed: return &tail->id.g;
0
196-
197 for (tail = nogroup_alist; tail; tail = tail->next)
tailDescription
TRUEnever evaluated
FALSEnever evaluated
0
198 /* Avoid a function call for the most common case. */-
199 if (*tail->name == *group && !strcmp (tail->name, group))
never executed: __result = (((const unsigned char *) (const char *) ( tail->name ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
never executed: __result = (((const unsigned char *) (const char *) ( group ))[3] - __s2[3]);
never executed: end of block
never executed: end of block
*tail->name == *groupDescription
TRUEnever evaluated
FALSEnever evaluated
! __extension_...group )))); })Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s1_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 0Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 1Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
__s2_len > 2Description
TRUEnever evaluated
FALSEnever evaluated
__result == 0Description
TRUEnever evaluated
FALSEnever evaluated
0
200 return NULL;
never executed: return ((void *)0) ;
0
201-
202 grent = getgrnam (group);-
203#ifdef __DJGPP__-
204 /* We need to pretend to belong to group GROUP, to make-
205 grp functions know about an arbitrary group name. */-
206 if (!grent && strspn (group, digits) < strlen (group))-
207 {-
208 setenv ("GROUP", group, 1);-
209 grent = getgrnam (group); /* now it will succeed */-
210 }-
211#endif-
212-
213 tail = xmalloc (FLEXSIZEOF (struct userid, name, strlen (group) + 1));-
214 strcpy (tail->name, group);-
215-
216 /* Add to the head of the list, so most recently used is first. */-
217 if (grent)
grentDescription
TRUEnever evaluated
FALSEnever evaluated
0
218 {-
219 tail->id.g = grent->gr_gid;-
220 tail->next = group_alist;-
221 group_alist = tail;-
222 return &tail->id.g;
never executed: return &tail->id.g;
0
223 }-
224-
225 tail->next = nogroup_alist;-
226 nogroup_alist = tail;-
227 return NULL;
never executed: return ((void *)0) ;
0
228}-
Source codeSwitch to Preprocessed file

Generated by Squish Coco 4.1.2