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