1 /* 2 * Copyright (c) 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 * 7 * @(#)tuba_table.c 8.2 (Berkeley) 11/15/93 8 */ 9 #include <sys/param.h> 10 #include <sys/systm.h> 11 #include <sys/proc.h> 12 #include <sys/mbuf.h> 13 #include <sys/socket.h> 14 #include <sys/socketvar.h> 15 #include <sys/domain.h> 16 #include <sys/protosw.h> 17 #include <sys/ioctl.h> 18 #include <sys/time.h> 19 #include <sys/kernel.h> 20 21 #include <net/if.h> 22 #include <net/radix.h> 23 24 #include <netiso/iso.h> 25 #include <netiso/tuba_table.h> 26 27 int tuba_table_size; 28 struct tuba_cache **tuba_table; 29 struct radix_node_head *tuba_tree; 30 extern int arpt_keep, arpt_prune; /* use same values as arp cache */ 31 32 void 33 tuba_timer() 34 { 35 int s = splnet(); 36 int i; 37 register struct tuba_cache *tc; 38 long timelimit = time.tv_sec - arpt_keep; 39 40 timeout(tuba_timer, (caddr_t)0, arpt_prune * hz); 41 for (i = tuba_table_size; i > 0; i--) 42 if ((tc = tuba_table[i]) && (tc->tc_refcnt == 0) && 43 (tc->tc_time < timelimit)) { 44 tuba_table[i] = 0; 45 rn_delete(&tc->tc_siso.siso_addr, NULL, tuba_tree); 46 free((caddr_t)tc, M_RTABLE); 47 } 48 splx(s); 49 } 50 51 tuba_table_init() 52 { 53 rn_inithead((void **)&tuba_tree, 40); 54 timeout(tuba_timer, (caddr_t)0, arpt_prune * hz); 55 } 56 57 int 58 tuba_lookup(siso, wait) 59 register struct sockaddr_iso *siso; 60 { 61 struct radix_node *rn, *rn_match(); 62 register struct tuba_cache *tc; 63 struct tuba_cache **new; 64 int dupentry = 0, sum_a = 0, sum_b = 0, old_size, i; 65 66 if ((rn = rn_match((caddr_t)&siso->siso_addr, tuba_tree->rnh_treetop)) 67 && ((rn->rn_flags & RNF_ROOT) == 0)) { 68 tc = (struct tuba_cache *)rn; 69 tc->tc_time = time.tv_sec; 70 return (tc->tc_index); 71 } 72 if ((tc = (struct tuba_cache *)malloc(sizeof(*tc), M_RTABLE, wait)) 73 == NULL) 74 return (0); 75 bzero((caddr_t)tc, sizeof (*tc)); 76 bcopy(siso->siso_data, tc->tc_siso.siso_data, 77 tc->tc_siso.siso_nlen = siso->siso_nlen); 78 rn_insert(&tc->tc_siso.siso_addr, tuba_tree, &dupentry, tc->tc_nodes); 79 if (dupentry) 80 panic("tuba_lookup 1"); 81 tc->tc_siso.siso_family = AF_ISO; 82 tc->tc_siso.siso_len = sizeof(tc->tc_siso); 83 tc->tc_time = time.tv_sec; 84 for (i = sum_a = tc->tc_siso.siso_nlen; --i >= 0; ) 85 (i & 1 ? sum_a : sum_b) += (u_char)tc->tc_siso.siso_data[i]; 86 REDUCE(tc->tc_sum, (sum_a << 8) + sum_b); 87 HTONS(tc->tc_sum); 88 SWAB(tc->tc_ssum, tc->tc_sum); 89 for (i = tuba_table_size; i > 0; i--) 90 if (tuba_table[i] == 0) 91 goto fixup; 92 old_size = tuba_table_size; 93 if (tuba_table_size == 0) 94 tuba_table_size = 15; 95 if (tuba_table_size > 0x7fff) 96 return (0); 97 tuba_table_size = 1 + 2 * tuba_table_size; 98 i = (tuba_table_size + 1) * sizeof(tc); 99 new = (struct tuba_cache **)malloc((unsigned)i, M_RTABLE, wait); 100 if (new == 0) { 101 tuba_table_size = old_size; 102 rn_delete(&tc->tc_siso.siso_addr, NULL, tuba_tree); 103 free((caddr_t)tc, M_RTABLE); 104 return (0); 105 } 106 bzero((caddr_t)new, (unsigned)i); 107 if (tuba_table) { 108 bcopy((caddr_t)tuba_table, (caddr_t)new, i >> 1); 109 free((caddr_t)tuba_table, M_RTABLE); 110 } 111 tuba_table = new; 112 i = tuba_table_size; 113 fixup: 114 tuba_table[i] = tc; 115 tc->tc_index = i; 116 return (tc->tc_index); 117 } 118