-
Notifications
You must be signed in to change notification settings - Fork 8
/
axheard.c
221 lines (201 loc) · 4.58 KB
/
axheard.c
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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
/* AX25 link callsign monitoring. Also contains beginnings of
* an automatic link quality monitoring scheme (incomplete)
*
* Copyright 1991 Phil Karn, KA9Q
*/
#include "global.h"
#include "mbuf.h"
#include "iface.h"
#include "ax25.h"
#include "ip.h"
#include "timer.h"
static struct lq *al_create(struct iface *ifp,uint8 *addr);
static struct ld *ad_lookup(struct iface *ifp,uint8 *addr,int sort);
static struct ld *ad_create(struct iface *ifp,uint8 *addr);
struct lq *Lq;
struct ld *Ld;
#ifdef notdef
/* Send link quality reports to interface */
void
genrpt(ifp)
struct iface *ifp;
{
struct mbuf *bp;
register uint8 *cp;
int i;
struct lq *lp;
int maxentries,nentries;
maxentries = (Paclen - LQHDR) / LQENTRY;
if((bp = alloc_mbuf(Paclen)) == NULL)
return;
cp = bp->data;
nentries = 0;
/* Build and emit header */
cp = putlqhdr(cp,LINKVERS,Ip_addr);
/* First entry is for ourselves. Since we're examining the Axsent
* variable before we've sent this frame, add one to it so it'll
* match the receiver's count after he gets this frame.
*/
cp = putlqentry(cp,ifp->hwaddr,Axsent+1);
nentries++;
/* Now add entries from table */
for(lp = lq;lp != NULL;lp = lp->next){
cp = putlqentry(cp,&lp->addr,lp->currxcnt);
if(++nentries >= MAXENTRIES){
/* Flush */
bp->cnt = nentries*LQENTRY + LQHDR;
ax_output(ifp,Ax25multi[0],ifp->hwaddr,PID_LQ,bp);
if((bp = alloc_mbuf(Paclen)) == NULL)
return;
cp = bp->data;
}
}
if(nentries > 0){
bp->cnt = nentries*LQENTRY + LQHDR;
ax_output(ifp,Ax25multi[0],ifp->hwaddr,LQPID,bp);
} else {
free_p(&bp);
}
}
/* Pull the header off a link quality packet */
void
getlqhdr(hp,bpp)
struct lqhdr *hp;
struct mbuf **bpp;
{
hp->version = pull16(bpp);
hp->ip_addr = pull32(bpp);
}
/* Put a header on a link quality packet.
* Return pointer to buffer immediately following header
*/
uint8 *
putlqhdr(cp,version,ip_addr)
register uint8 *cp;
uint16 version;
int32 ip_addr;
{
cp = put16(cp,version);
return put32(cp,ip_addr);
}
/* Pull an entry off a link quality packet */
void
getlqentry(ep,bpp)
struct lqentry *ep;
struct mbuf **bpp;
{
pullup(bpp,ep->addr,AXALEN);
ep->count = pull32(bpp);
}
/* Put an entry on a link quality packet
* Return pointer to buffer immediately following header
*/
uint8 *
putlqentry(cp,addr,count)
uint8 *cp;
uint8 *addr;
int32 count;
{
memcpy(cp,addr,AXALEN);
cp += AXALEN;
return put32(cp,count);
}
#endif
/* Log the source address of an incoming packet */
void
logsrc(ifp,addr)
struct iface *ifp;
uint8 *addr;
{
register struct lq *lp;
if((lp = al_lookup(ifp,addr,1)) == NULL
&& (lp = al_create(ifp,addr)) == NULL)
return;
lp->currxcnt++;
lp->time = secclock();
}
/* Log the destination address of an incoming packet */
void
logdest(ifp,addr)
struct iface *ifp;
uint8 *addr;
{
register struct ld *lp;
if((lp = ad_lookup(ifp,addr,1)) == NULL
&& (lp = ad_create(ifp,addr)) == NULL)
return;
lp->currxcnt++;
lp->time = secclock();
}
/* Look up an entry in the source data base */
struct lq *
al_lookup(ifp,addr,sort)
struct iface *ifp;
uint8 *addr;
int sort;
{
register struct lq *lp;
struct lq *lplast = NULL;
for(lp = Lq;lp != NULL;lplast = lp,lp = lp->next){
if(addreq(lp->addr,addr) && lp->iface == ifp){
if(sort && lplast != NULL){
/* Move entry to top of list */
lplast->next = lp->next;
lp->next = Lq;
Lq = lp;
}
return lp;
}
}
return NULL;
}
/* Create a new entry in the source database */
static struct lq *
al_create(ifp,addr)
struct iface *ifp;
uint8 *addr;
{
register struct lq *lp;
lp = (struct lq *)callocw(1,sizeof(struct lq));
memcpy(lp->addr,addr,AXALEN);
lp->next = Lq;
Lq = lp;
lp->iface = ifp;
return lp;
}
/* Look up an entry in the destination database */
static struct ld *
ad_lookup(ifp,addr,sort)
struct iface *ifp;
uint8 *addr;
int sort;
{
register struct ld *lp;
struct ld *lplast = NULL;
for(lp = Ld;lp != NULL;lplast = lp,lp = lp->next){
if(lp->iface == ifp && addreq(lp->addr,addr)){
if(sort && lplast != NULL){
/* Move entry to top of list */
lplast->next = lp->next;
lp->next = Ld;
Ld = lp;
}
return lp;
}
}
return NULL;
}
/* Create a new entry in the destination database */
static struct ld *
ad_create(ifp,addr)
struct iface *ifp;
uint8 *addr;
{
register struct ld *lp;
lp = (struct ld *)callocw(1,sizeof(struct ld));
memcpy(lp->addr,addr,AXALEN);
lp->next = Ld;
Ld = lp;
lp->iface = ifp;
return lp;
}