net/appletalk/aarp.c

61 	/* These first two are only used for unresolved entries */
73 /* Hashed list of resolved, unresolved and proxy entries */
75 static struct aarp_entry *unresolved[AARP_HASH_SIZE];
329 		__aarp_kick(&unresolved[ct]);
330 		__aarp_expire_timer(&unresolved[ct]);
355 			__aarp_expire_device(&unresolved[ct], dev);
384 		__aarp_expire_all(&unresolved[ct]);
609 	/* Do we have an unresolved entry: This is the less common path */
610 	a = __aarp_find_entry(unresolved[hash], dev, sa);
611 	if (a) { /* Queue onto the unresolved queue */
628 	a->next		 = unresolved[hash];
631 	unresolved[hash] = a;
639 	 * unresolved entry to get added)
667  *	An entry in the aarp unresolved queue has become resolved. Send
770 		a = __aarp_find_entry(unresolved[hash], dev, &sa);
776 		__aarp_resolved(&unresolved[hash], a, hash);
892 		__aarp_expire_device(&unresolved[ct], dev);
927 		table = unresolved;
930 	if (table == unresolved) {
1006 		if (iter->table == unresolved)
1014 			   : (iter->table == unresolved) ? "unresolved"