pf_src_node
struct pf_src_node *cur, *next;
int, int, struct pfi_kif *, struct pf_src_node **,
struct pf_src_node *, struct pf_state_key *,
struct pf_addr *, struct pf_src_node **);
struct pf_src_node **);
struct pf_addr *naddr, struct pf_addr *init_addr, struct pf_src_node **sn)
struct pf_src_node k;
u_int16_t low, u_int16_t high, struct pf_src_node **sn)
struct pfi_kif *kif, struct pf_src_node **sn,
static __inline int pf_src_compare(struct pf_src_node *, struct pf_src_node *);
RB_GENERATE(pf_src_tree, pf_src_node, entry, pf_src_compare);
pf_src_compare(struct pf_src_node *a, struct pf_src_node *b)
struct pf_src_node *nsn = NULL;
struct pf_pdesc *pd, struct pf_src_node *nsn, struct pf_state_key *skw,
struct pf_src_node *sn = NULL;
pf_insert_src_node(struct pf_src_node **sn, struct pf_rule *rule,
struct pf_src_node k;
(*sn) = kmalloc(sizeof(struct pf_src_node),
struct pf_src_node *sn = NULL;
struct pf_src_node *sn = NULL;
struct pf_src_node *n, *p, *pstore;
psn->psn_len = sizeof(struct pf_src_node) * nr;
psn->psn_len = sizeof(struct pf_src_node) * nr;
struct pf_src_node *n;
struct pf_src_node *sn;
struct pf_src_node *n;
struct pf_src_node *psu_src_nodes;
RB_HEAD(pf_src_tree, pf_src_node);
RB_PROTOTYPE(pf_src_tree, pf_src_node, entry, pf_src_compare);
extern int pf_insert_src_node(struct pf_src_node **,
RB_ENTRY(pf_src_node) entry;
struct pf_src_node *src_node;
struct pf_src_node *nat_src_node;
struct pf_src_node *p;
print_src_node(struct pf_src_node *sn, int opts)
void print_src_node(struct pf_src_node *, int);