summaryrefslogtreecommitdiff
path: root/usr/src/cmd/cmd-inet/usr.lib/in.ripngd/timer.c
blob: 5339b569077a12a62b847d2facc5d89f05349cf4 (plain)
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
/*
 * CDDL HEADER START
 *
 * The contents of this file are subject to the terms of the
 * Common Development and Distribution License, Version 1.0 only
 * (the "License").  You may not use this file except in compliance
 * with the License.
 *
 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
 * or http://www.opensolaris.org/os/licensing.
 * See the License for the specific language governing permissions
 * and limitations under the License.
 *
 * When distributing Covered Code, include this CDDL HEADER in each
 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
 * If applicable, add the following below this CDDL HEADER, with the
 * fields enclosed by brackets "[]" replaced with your own identifying
 * information: Portions Copyright [yyyy] [name of copyright owner]
 *
 * CDDL HEADER END
 */
/*
 * Copyright 2003 Sun Microsystems, Inc.  All rights reserved.
 * Use is subject to license terms.
 */

/*	Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T	*/
/*	  All Rights Reserved  	*/

/*
 * Portions of this source code were derived from Berkeley 4.3 BSD
 * under license from the Regents of the University of California.
 */

#pragma ident	"%Z%%M%	%I%	%E% SMI"

/*
 * Routing Table Management Daemon
 */
#include "defs.h"

int supplyinterval;			/* current supply interval */

/*
 * Timer routine.  Performs routing information supply
 * duties and manages timers on routing table entries.
 * Management of the RTS_CHANGED bit assumes that we multicast
 * each time called.
 */
void
timer(void)
{
	struct rthash *rh;
	struct rt_entry *rt;
	boolean_t timetomulticast = _B_FALSE;
	int i;
	static int iftime;		/* interface timer */
	static int mtime;		/* periodic mcast supply timer */
	static int alarmtime = 0;	/* time elapsed since last call */
	int mintime;			/* tracks when next timer will expire */

	/*
	 * On the initial call to timer(), the various times that are kept track
	 * of need to be initialized.  After initializing everything, "remember"
	 * (via a static) how long until the next timer expires.
	 */
	if (alarmtime == 0) {
		supplyinterval = GET_RANDOM(MIN_SUPPLY_TIME, MAX_SUPPLY_TIME);
		iftime = 0;
		mtime = supplyinterval;
		alarmtime = supplyinterval;
		(void) alarm(alarmtime);
		return;
	}

	/*
	 * Initialize mintime to a suitable "large" value and then compare it to
	 * other times in the future to determine which event will occur next.
	 */
	mintime = INT_MAX;
	(void) sighold(SIGHUP);
	(void) sighold(SIGUSR1);
	(void) sighold(SIGUSR2);

	iftime += alarmtime;
	if (iftime >= CHECK_INTERVAL) {
		initifs();
		iftime = 0;
	}
	mintime = min(mintime, CHECK_INTERVAL - iftime);

	mtime += alarmtime;
	if (mtime >= supplyinterval) {
		if (supplier)
			timetomulticast = _B_TRUE;
		mtime = 0;
		supplyinterval = GET_RANDOM(MIN_SUPPLY_TIME, MAX_SUPPLY_TIME);
	}
	mintime = min(mintime, supplyinterval - mtime);

	for (i = IPV6_ABITS; i >= 0; i--) {
		if (net_hashes[i] == NULL)
			continue;

		for (rh = net_hashes[i];
		    rh < &net_hashes[i][ROUTEHASHSIZ]; rh++) {
			for (rt = rh->rt_forw; rt != (struct rt_entry *)rh;
			    rt = rt->rt_forw) {
				/*
				 * We don't advance time on a routing entry for
				 * an interface because we catch
				 * interfaces going up and down in initifs.
				 */
				rt->rt_state &= ~RTS_CHANGED;
				if ((rt->rt_state & RTS_INTERFACE) != 0)
					continue;
				rt->rt_timer += alarmtime;
				if (rt->rt_timer >= GARBAGE_TIME) {
					rt = rt->rt_back;
					rtdelete(rt->rt_forw);
					continue;
				}
				if (rt->rt_timer >= EXPIRE_TIME) {
					rtdown(rt);
					mintime = min(mintime,
					    GARBAGE_TIME - rt->rt_timer);
				} else {
					mintime = min(mintime,
					    EXPIRE_TIME - rt->rt_timer);
				}
			}
		}
	}

	if (timetomulticast) {
		supplyall(&allrouters, 0, (struct interface *)NULL, _B_TRUE);
		(void) gettimeofday(&now, (struct timezone *)NULL);
		lastmcast = now;
		lastfullupdate = now;
		needupdate = _B_FALSE;	/* cancel any pending dynamic update */
		nextmcast.tv_sec = 0;
	}
	(void) sigrelse(SIGUSR2);
	(void) sigrelse(SIGUSR1);
	(void) sigrelse(SIGHUP);

	/*
	 * "Remember" (via a static) how long until the next timer expires.
	 */
	alarmtime = mintime;
	(void) alarm(alarmtime);
}

/*
 * On SIGTERM, let everyone know we're going away.
 */
void
term(void)
{
	struct rthash *rh;
	struct rt_entry *rt;
	int i;

	if (!supplier)
		exit(EXIT_SUCCESS);
	for (i = IPV6_ABITS; i >= 0; i--) {
		if (net_hashes[i] == NULL)
			continue;

		for (rh = net_hashes[i]; rh < &net_hashes[i][ROUTEHASHSIZ];
		    rh++) {
			for (rt = rh->rt_forw; rt != (struct rt_entry *)rh;
			    rt = rt->rt_forw) {
				rt->rt_metric = HOPCNT_INFINITY;
			}
		}
	}
	supplyall(&allrouters, 0, (struct interface *)NULL, _B_TRUE);
	(void) unlink(PATH_PID);
	exit(EXIT_SUCCESS);
}