-/* $OpenBSD: pf.c,v 1.1130 2022/05/18 06:02:33 miod Exp $ */
+/* $OpenBSD: pf.c,v 1.1131 2022/05/23 09:54:18 bluhm Exp $ */
/*
* Copyright (c) 2001 Daniel Hartmeier
/*
* process a fraction of the state table every second
* Note:
- * we no longer need PF_LOCK() here, because
- * pf_purge_expired_states() uses pf_state_lock to maintain
- * consistency.
+ * we no longer need PF_LOCK() here, because
+ * pf_purge_expired_states() uses pf_state_lock to maintain
+ * consistency.
*/
if (pf_default_rule.timeout[PFTM_INTERVAL] > 0)
pf_purge_expired_states(1 + (pf_status.states
time_t now;
PF_ASSERT_UNLOCKED();
-
+
rw_enter_read(&pf_state_list.pfs_rwl);
mtx_enter(&pf_state_list.pfs_mtx);
cur = NULL;
break;
}
-
+
cur = TAILQ_NEXT(cur, entry_list);
} while (maxcheck--);
SLIST_FOREACH(st, &gcl, gc_list) {
if (st->timeout != PFTM_UNLINKED)
pf_remove_state(st);
-
+
pf_free_state(st);
}
PF_STATE_EXIT_WRITE();
default:
if (opt[0] == type &&
opt[1] >= min_typelen)
- return (opt);
+ return (opt);
}
opt += MAX(opt[1], 2); /* evade infinite loops */