Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /* |
2 | * Copyright (c) 1983, 1988 Regents of the University of California. | |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #ifndef lint | |
35 | static char sccsid[] = "@(#)timer.c 5.10 (Berkeley) 2/28/91"; | |
36 | #endif /* not lint */ | |
37 | ||
38 | /* | |
39 | * Routing Table Management Daemon | |
40 | */ | |
41 | #include "defs.h" | |
42 | ||
43 | int faketime; | |
44 | ||
45 | /* | |
46 | * Timer routine. Performs routing information supply | |
47 | * duties and manages timers on routing table entries. | |
48 | * Management of the RTS_CHANGED bit assumes that we broadcast | |
49 | * each time called. | |
50 | */ | |
51 | void | |
52 | timer() | |
53 | { | |
54 | register struct rthash *rh; | |
55 | register struct rt_entry *rt; | |
56 | struct rthash *base = hosthash; | |
57 | int doinghost = 1, timetobroadcast; | |
58 | extern int externalinterfaces; | |
59 | ||
60 | (void) gettimeofday(&now, (struct timezone *)NULL); | |
61 | faketime += TIMER_RATE; | |
62 | if (lookforinterfaces && (faketime % CHECK_INTERVAL) == 0) | |
63 | ifinit(); | |
64 | timetobroadcast = supplier && (faketime % SUPPLY_INTERVAL) == 0; | |
65 | again: | |
66 | for (rh = base; rh < &base[ROUTEHASHSIZ]; rh++) { | |
67 | rt = rh->rt_forw; | |
68 | for (; rt != (struct rt_entry *)rh; rt = rt->rt_forw) { | |
69 | /* | |
70 | * We don't advance time on a routing entry for | |
71 | * a passive gateway, or any interface if we're | |
72 | * not acting as supplier. | |
73 | */ | |
74 | if (!(rt->rt_state & RTS_PASSIVE) && | |
75 | (supplier || !(rt->rt_state & RTS_INTERFACE))) | |
76 | rt->rt_timer += TIMER_RATE; | |
77 | if (rt->rt_timer >= GARBAGE_TIME) { | |
78 | rt = rt->rt_back; | |
79 | rtdelete(rt->rt_forw); | |
80 | continue; | |
81 | } | |
82 | if (rt->rt_timer >= EXPIRE_TIME && | |
83 | rt->rt_metric < HOPCNT_INFINITY) | |
84 | rtchange(rt, &rt->rt_router, HOPCNT_INFINITY); | |
85 | rt->rt_state &= ~RTS_CHANGED; | |
86 | } | |
87 | } | |
88 | if (doinghost) { | |
89 | doinghost = 0; | |
90 | base = nethash; | |
91 | goto again; | |
92 | } | |
93 | if (timetobroadcast) { | |
94 | toall(supply, 0, (struct interface *)NULL); | |
95 | lastbcast = now; | |
96 | lastfullupdate = now; | |
97 | needupdate = 0; /* cancel any pending dynamic update */ | |
98 | nextbcast.tv_sec = 0; | |
99 | } | |
100 | } | |
101 | ||
102 | /* | |
103 | * On hangup, let everyone know we're going away. | |
104 | */ | |
105 | hup() | |
106 | { | |
107 | register struct rthash *rh; | |
108 | register struct rt_entry *rt; | |
109 | struct rthash *base = hosthash; | |
110 | int doinghost = 1; | |
111 | ||
112 | if (supplier) { | |
113 | again: | |
114 | for (rh = base; rh < &base[ROUTEHASHSIZ]; rh++) { | |
115 | rt = rh->rt_forw; | |
116 | for (; rt != (struct rt_entry *)rh; rt = rt->rt_forw) | |
117 | rt->rt_metric = HOPCNT_INFINITY; | |
118 | } | |
119 | if (doinghost) { | |
120 | doinghost = 0; | |
121 | base = nethash; | |
122 | goto again; | |
123 | } | |
124 | toall(supply, 0, (struct interface *)NULL); | |
125 | } | |
126 | exit(1); | |
127 | } |