routed.tproj/timer.c

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