72 #define DN_FIB_SCAN(f, fp) \  argument
73 for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next)
75 #define DN_FIB_SCAN_KEY(f, fp, key) \  argument
76 for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next)
126 	struct dn_fib_node *f, **fp, *next;  in dn_rebuild_zone()  local
132 			for(fp = dn_chain_p(f->fn_key, dz);  in dn_rebuild_zone()
133 				*fp && dn_key_leq((*fp)->fn_key, f->fn_key);  in dn_rebuild_zone()
134 				fp = &(*fp)->fn_next)  in dn_rebuild_zone()
136 			f->fn_next = *fp;  in dn_rebuild_zone()
137 			*fp = f;  in dn_rebuild_zone()
530 	struct dn_fib_node *new_f, *f, **fp, **del_fp;  in dn_fib_table_insert()  local
561 	fp = dn_chain_p(key, dz);  in dn_fib_table_insert()
563 	DN_FIB_SCAN(f, fp) {  in dn_fib_table_insert()
572 		del_fp = fp;  in dn_fib_table_insert()
573 		fp = &f->fn_next;  in dn_fib_table_insert()
574 		f = *fp;  in dn_fib_table_insert()
578 	DN_FIB_SCAN_KEY(f, fp, key) {  in dn_fib_table_insert()
592 			del_fp = fp;  in dn_fib_table_insert()
593 			fp = &f->fn_next;  in dn_fib_table_insert()
594 			f = *fp;  in dn_fib_table_insert()
598 		ins_fp = fp;  in dn_fib_table_insert()
601 		DN_FIB_SCAN_KEY(f, fp, key) {  in dn_fib_table_insert()
611 			fp = ins_fp;  in dn_fib_table_insert()
612 			f = *fp;  in dn_fib_table_insert()
634 	*fp = new_f;  in dn_fib_table_insert()
667 	struct dn_fib_node **fp, **del_fp, *f;  in dn_fib_table_delete()  local
688 	fp = dn_chain_p(key, dz);  in dn_fib_table_delete()
690 	DN_FIB_SCAN(f, fp) {  in dn_fib_table_delete()
699 	DN_FIB_SCAN_KEY(f, fp, key) {  in dn_fib_table_delete()
713 			del_fp = fp;  in dn_fib_table_delete()
745 static inline int dn_flush_list(struct dn_fib_node **fp, int z, struct dn_hash *table)  in dn_flush_list()  argument
750 	while((f = *fp) != NULL) {  in dn_flush_list()
755 			*fp = f->fn_next;  in dn_flush_list()
762 		fp = &f->fn_next;  in dn_flush_list()