Home | History | Annotate | Download | only in pfctl

Lines Matching defs:superblocks

78 TAILQ_HEAD(superblocks, superblock);
148      * their difference isn't enough to put the rules in different superblocks.
214 	    struct superblocks *);
217 int	load_feedback_profile(struct pfctl *, struct superblocks *);
261 	struct superblocks superblocks;
300 	TAILQ_INIT(&superblocks);
301 	if (construct_superblocks(pf, &opt_queue, &superblocks))
305 		if (load_feedback_profile(pf, &superblocks))
309 	TAILQ_FOREACH(block, &superblocks, sb_entry) {
315 	while ((block = TAILQ_FIRST(&superblocks))) {
316 		TAILQ_REMOVE(&superblocks, block, sb_entry);
351 	while ((block = TAILQ_FIRST(&superblocks))) {
352 		TAILQ_REMOVE(&superblocks, block, sb_entry);
393 	 * XXX we can also re-order some mutually exclusive superblocks to
394 	 *     try merging superblocks before any of these optimization passes.
399 	/* shortcut.  there will be alot of 1-rule superblocks */
428 	 * have divided superblocks into smaller blocks for further refinement
430 	 * superblock might have been split into multiple superblocks.
874 load_feedback_profile(struct pfctl *pf, struct superblocks *superblocks)
877 	struct superblocks prof_superblocks;
927 	 * Now we try to associate the active ruleset's superblocks with
928 	 * the superblocks we're compiling.
930 	block = TAILQ_FIRST(superblocks);
938 			/* The two superblocks lined up */
941 			DEBUG("superblocks don't line up between #%d and #%d",
952 	/* Free any superblocks we couldn't link */
1326  * Partition the flat ruleset into a list of distinct superblocks
1330     struct superblocks *superblocks)
1347 			TAILQ_INSERT_TAIL(superblocks, block, sb_entry);