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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/* $Copyright: $
* Copyright (c) 1996 - 2026 by Steve Baker (steve.baker.llc@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
*/
#include "tree.h"
/* Faster uid/gid -> name lookup with hash(tm)(r)(c) tables! */
#define HASH(x) ((x)&255)
#define inohash(x) ((x)&255)
struct xtable {
unsigned int xid;
char *name;
struct xtable *nxt;
} *gtable[256], *utable[256];
struct inotable {
ino_t inode;
dev_t device;
struct inotable *nxt;
} *itable[256];
#ifdef __linux__
struct strtable {
char *string;
struct strtable *nxt;
} *strtable[256];
char *strhash(char *str)
{
// DJB2
unsigned int hash = 5381;
char *t = str;
while ( *t ) {
hash = ((hash << 5) + hash) + (unsigned int)*(t++);
}
hash &= 255;
struct strtable *s, *p, *n;
int c;
for(p = s = strtable[hash]; s; s=s->nxt) {
c = strcmp(s->string, str);
if (c == 0) return s->string;
if (c > 0) break;
p = s;
}
n = xmalloc(sizeof(struct strtable));
n->string = scopy(str);
n->nxt = s;
if (p == strtable[hash]) strtable[hash] = n;
else p->nxt = n;
return n->string;
}
#endif
void init_hashes(void)
{
memset(utable, 0, sizeof(utable));
memset(gtable, 0, sizeof(gtable));
memset(itable, 0, sizeof(itable));
#ifdef __linux__
memset(strtable, 0, sizeof(strtable));
#endif
}
char *uidtoname(uid_t uid)
{
struct xtable *o, *p, *t;
struct passwd *ent;
char ubuf[32];
int uent = HASH(uid);
for(o = p = utable[uent]; p ; p=p->nxt) {
if (uid == p->xid) return p->name;
else if (uid < p->xid) break;
o = p;
}
/* Not found, do a real lookup and add to table */
t = xmalloc(sizeof(struct xtable));
if ((ent = getpwuid(uid)) != NULL) t->name = scopy(ent->pw_name);
else {
snprintf(ubuf,30,"%d",uid);
ubuf[31] = 0;
t->name = scopy(ubuf);
}
t->xid = uid;
t->nxt = p;
if (p == utable[uent]) utable[uent] = t;
else o->nxt = t;
return t->name;
}
char *gidtoname(gid_t gid)
{
struct xtable *o, *p, *t;
struct group *ent;
char gbuf[32];
int gent = HASH(gid);
for(o = p = gtable[gent]; p ; p=p->nxt) {
if (gid == p->xid) return p->name;
else if (gid < p->xid) break;
o = p;
}
/* Not found, do a real lookup and add to table */
t = xmalloc(sizeof(struct xtable));
if ((ent = getgrgid(gid)) != NULL) t->name = scopy(ent->gr_name);
else {
snprintf(gbuf,30,"%d",gid);
gbuf[31] = 0;
t->name = scopy(gbuf);
}
t->xid = gid;
t->nxt = p;
if (p == gtable[gent]) gtable[gent] = t;
else o->nxt = t;
return t->name;
}
/* Record inode numbers of followed sym-links to avoid re-following them */
void saveino(ino_t inode, dev_t device)
{
struct inotable *it, *ip, *pp;
int hp = inohash(inode);
for(pp = ip = itable[hp];ip;ip = ip->nxt) {
if (ip->inode > inode) break;
if (ip->inode == inode && ip->device >= device) break;
pp = ip;
}
if (ip && ip->inode == inode && ip->device == device) return;
it = xmalloc(sizeof(struct inotable));
it->inode = inode;
it->device = device;
it->nxt = ip;
if (ip == itable[hp]) itable[hp] = it;
else pp->nxt = it;
}
bool findino(ino_t inode, dev_t device)
{
struct inotable *it;
for(it=itable[inohash(inode)]; it; it=it->nxt) {
if (it->inode > inode) break;
if (it->inode == inode && it->device >= device) break;
}
if (it && it->inode == inode && it->device == device) return true;
return false;
}
|
