197 #define SET_INTERSECT(a, b, n)\  argument
200 	register int _n = n;\
207 #define SET_SUBTRACT(a, b, n)\  argument
210 	register int _n = n;\
217 #define SET_UNION(a, b, n)\  argument
220 	register int _n = n;\
1959     int n = 0;  local
1963             ++n;
1964     return n;
1987     int n;  local
1993     n = n_blocks++;
1994     p->id = n;
1995     blocks[n] = p;
2022     int n;  local
2027     n = count_stmts(JT(p)) + count_stmts(JF(p));
2028     return slength(p->stmts) + n + 1 + p->longjt + p->longjf;
2040     int i, n, max_stmts;  local
2047     n = count_blocks(root);
2048     blocks = (struct block **) calloc(n, sizeof(*blocks));
2077     for (i = 0; i < n; ++i)
2083     for (i = 0; i < n; ++i)
2089     for (i = 0; i < n; ++i)
2105     for (i = 0; i < n; ++i)
2324     int n;  local
2334         n = *lenp = count_stmts(root);
2336         fp = (struct bpf_insn *) malloc(sizeof(*fp) * n);
2339         memset((char *) fp, 0, sizeof(*fp) * n);
2341         ftail = fp + n;