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
|
/* $Id$ */
#include "bbs.h"
#include <err.h>
struct {
int uid;
int nFriends, nRejects;
int friend[MAX_FRIEND];
int reject[MAX_REJECT];
} utmp[USHM_SIZE];
inline int countarray(int *s, int max)
{
int i;
for( i = 0 ; i < max && s[i] ; ++i )
;
return i;
}
int
reverse_friend_stat(int stat)
{
int stat1 = 0;
if (stat & IFH)
stat1 |= HFM;
if (stat & IRH)
stat1 |= HRM;
if (stat & HFM)
stat1 |= IFH;
if (stat & HRM)
stat1 |= IRH;
if (stat & IBH)
stat1 |= IBH;
return stat1;
}
int set_friend_bit(int me, int ui)
{
int hit = 0;
/* 判斷對方是否為我的朋友 ? */
if( intbsearch(utmp[ui].uid, utmp[me].friend, utmp[me].nFriends) )
hit = IFH;
/* 判斷我是否為對方的朋友 ? */
if( intbsearch(utmp[me].uid, utmp[ui].friend, utmp[ui].nFriends) )
hit |= HFM;
/* 判斷對方是否為我的仇人 ? */
if( intbsearch(utmp[ui].uid, utmp[me].reject, utmp[me].nRejects) )
hit |= IRH;
/* 判斷我是否為對方的仇人 ? */
if( intbsearch(utmp[me].uid, utmp[ui].reject, utmp[ui].nRejects) )
hit |= HRM;
return hit;
}
void initdata(int index)
{
utmp[index].nFriends = countarray(utmp[index].friend, MAX_FRIEND);
utmp[index].nRejects = countarray(utmp[index].reject, MAX_REJECT);
if( utmp[index].nFriends > 0 )
qsort(utmp[index].friend, utmp[index].nFriends,
sizeof(int), qsort_intcompar);
if( utmp[index].nRejects > 0 )
qsort(utmp[index].reject, utmp[index].nRejects,
sizeof(int), qsort_intcompar);
}
int main(int argc, char **argv)
{
struct sockaddr_in clientaddr;
int ch, port = 5120, sfd, cfd, len, index, i, uid;
while( (ch = getopt(argc, argv, "p:h")) != -1 )
switch( ch ){
case 'p':
port = atoi(optarg);
break;
case 'h':
default:
fprintf(stderr, "usage: utmpserver [-p port]\n");
return 1;
}
if( (sfd = tobind(port)) < 0 )
return 1;
while( 1 ){
len = sizeof(clientaddr);
if( (cfd = accept(sfd, (struct sockaddr *)&clientaddr, &len)) < 0 ){
if( errno != EINTR )
sleep(1);
continue;
}
toread(cfd, &index, sizeof(index));
if( index == -1 ){
int nSynced = 0;
for( i = 0 ; i < USHM_SIZE ; ++i, ++nSynced )
if( toread(cfd, &utmp[i].uid, sizeof(utmp[i].uid)) > 0 &&
toread(cfd, utmp[i].friend, sizeof(utmp[i].friend)) > 0 &&
toread(cfd, utmp[i].reject, sizeof(utmp[i].reject)) > 0 ){
if( utmp[i].uid )
initdata(i);
}
else
for( ; i < USHM_SIZE ; ++i )
utmp[i].uid = 0;
close(cfd);
fprintf(stderr, "%d users synced\n", nSynced);
continue;
}
if( toread(cfd, &uid, sizeof(uid)) > 0 &&
toread(cfd, utmp[index].friend, sizeof(utmp[index].friend)) > 0 &&
toread(cfd, utmp[index].reject, sizeof(utmp[index].reject)) > 0 ){
#define MAX_FS (2 * MAX_FRIEND)
int iu, nFrs, stat, rstat;
ocfs_t fs[MAX_FS];
utmp[index].uid = uid;
initdata(index);
for( nFrs = iu = 0 ; iu < USHM_SIZE && nFrs < MAX_FS ; ++iu )
if( iu != index && utmp[iu].uid ){
if( (stat = set_friend_bit(index, iu)) ){
rstat = reverse_friend_stat(stat);
fs[nFrs].index = iu;
fs[nFrs].uid = utmp[iu].uid;
fs[nFrs].friendstat = (stat << 24) + iu;
fs[nFrs].rfriendstat = (rstat << 24) + index;
++nFrs;
}
}
towrite(cfd, &fs, sizeof(ocfs_t) * nFrs);
}
close(cfd);
}
return 0;
}
|
