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
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/*
* List manipulation routines
*/
#include <sys/types.h>
#include <sys/file.h>
#include <string.h> /* For strlen(), strcpy(), etc. */
#include "idled.h"
#include "y.tab.h"
int find();
extern char *ctime();
extern time_t time();
extern void insque();
/**************************************************************************
* adds a record to the list "list". *
* list -- which list to add the rule *
* type -- what kind of rule (LOGIN, GROUP, etc) *
* name -- who it applies to (ajw, console, etc) *
* num -- who it applies to (5 (group staff) ) *
* flag -- idle time for a "rule" rule, or exemption type *
* for "exempt" rule: IDLE, MULTIPLE, etc. *
**************************************************************************/
void addlist(list, type, name, num, flag)
struct qelem *list;
int type;
char *name;
int num;
int flag;
{
register struct item *new_data;
register struct qelem *new_node;
register struct qelem *ptr;
/* make all the new structures */
new_node = (struct qelem *) malloc (sizeof (struct qelem));
new_data = (struct item *) malloc (sizeof (struct item));
new_data->name_t = type;
new_data->name = name;
new_data->num = num;
new_data->flag = flag;
new_node->q_item = new_data;
/* find where to insert it in the list, and insert it */
for (ptr = list->q_forw; ptr != list; ptr = ptr->q_forw)
if (ptr->q_item->name_t <= new_data->name_t)
break;
insque (new_node, ptr->q_back);
}
/**************************************************************************
* frees up the space in the list pointed to by ptr *
**************************************************************************/
void freelist(ptr)
struct qelem *ptr;
{
register struct qelem *dead;
register struct qelem *elemp;
register struct qelem *start = ptr;
for (elemp = start->q_forw; elemp != start;)
{
dead = elemp;
elemp = elemp->q_forw;
free ((char *) dead->q_item); /* kill the data */
free ((char *) dead); /* now get the node */
}
start->q_forw = start; /* reset pointers for a null list */
start->q_back = start;
}
/**************************************************************************
* looks through the rules list and uses the most *
* specific rule for users[i], then looks through *
* all the exemptions setting them as they apply. *
**************************************************************************/
void setlimits(i)
int i;
{
register int rule;
register struct qelem *ptr;
time_t tempus;
(void) time (&tempus);
users[i].exempt = 0; /* clear exemption flag */
users[i].idle = -1; /* clear his idle length */
users[i].refuse = false; /* clear refuse flag */
users[i].session = 0; /* clear his session length */
users[i].warned = 0; /* clear his warning flag */
/* next time is set to now, so the new rules take affect immediately */
users[i].next = tempus;
for (rule = 0, ptr = rules->q_back; ptr != rules && !rule; ptr = ptr->q_back)
if (rule = find (ptr, i))
users[i].idle = (ptr->q_item)->flag * 60;
for (rule = 0, ptr = refuse->q_back; ptr != refuse && !rule; ptr = ptr->q_back)
if (rule = find (ptr, i))
users[i].refuse = true;
for (rule = 0, ptr = session->q_back; ptr != session && !rule; ptr = ptr->q_back)
if (rule = find (ptr, i))
users[i].session = (ptr->q_item)->flag * 60;
for (ptr = exmpt->q_forw; ptr != exmpt; ptr = ptr->q_forw)
if (find (ptr, i))
switch ((ptr->q_item)->flag)
{
case ALL:
users[i].exempt = IS_IDLE | IS_MULT | IS_LIMIT | IS_REFU;
break;
case IDLE:
users[i].exempt |= IS_IDLE;
break;
case MULTIPLE:
users[i].exempt |= IS_MULT;
break;
case REFUSE:
users[i].exempt |= IS_REFU;
break;
case SESSION:
users[i].exempt |= IS_LIMIT;
break;
}
}
/**************************************************************************
* given a rule and a users structure, see if it applies *
**************************************************************************/
int find(ptr,i)
struct qelem *ptr;
int i;
{
register int j;
switch ((ptr->q_item)->name_t)
{
case DEFAULT:
return (1);
case HOST:
if (!strncmp ((ptr->q_item)->name, users[i].host, HOSTLEN))
return (1);
break;
case GROUP:
for (j = 0; j < NGROUPS && users[i].groups[j] >= 0; j++)
if ((ptr->q_item)->num == users[i].groups[j])
return (1);
break;
case LOGIN:
if (!strcmp ((ptr->q_item)->name, users[i].uid))
return (1);
break;
case TTY:
if (!strcmp ((ptr->q_item)->name, users[i].line + 5))
return (1);
break;
}
return (0);
}
|
