if ((diff = a->addr[0].s_addr - b->addr[0].s_addr) != 0) return (diff); if ((diff = a->addr[1].s_addr - b->addr[1].s_addr) != 0) return (diff);
if (a->addr[0].s_addr > b->addr[0].s_addr) return 1; if (a->addr[0].s_addr < b->addr[0].s_addr) return -1; if (a->addr[1].s_addr > b->addr[1].s_addr) return 1; if (a->addr[1].s_addr < b->addr[1].s_addr) return -1;
pf_tree_key_compare(struct pf_tree_key *a, struct pf_tree_key *b){	register int diff;	/*	 * could use memcmp(), but with the best manual order, we can	 * minimize the number of average compares. what is faster?	 */	if ((diff = a->proto - b->proto) != 0)		return (diff);	if ((diff = a->addr[0].s_addr - b->addr[0].s_addr) != 0)		return (diff);	if ((diff = a->addr[1].s_addr - b->addr[1].s_addr) != 0)		return (diff);	if ((diff = a->port[0] - b->port[0]) != 0)		return (diff);	if ((diff = a->port[1] - b->port[1]) != 0)		return (diff);	return (0);}