FreeBSD/contrib/openbsm/libauditd/auditd_lib.c
/*
 * Insert the directory entry in the list by the way they are ordered in
 * audit_control(5).  Move the entries that are over the soft and hard limits
 * toward the tail.
 */
Insert the directory entry in the list by the way they are ordered in
audit_control(5).  Move the entries that are over the soft and hard limits
toward the tail.
Insert the directory entry in the list by the way they are ordered in audit_control ( 5 ) . Move the entries that are over the soft and hard limits toward the tail .
static void
insert_orderly(struct dir_ent *denew)
{
	struct dir_ent *dep;
	TAILQ_FOREACH(dep, &dir_q, dirs) {
		if (dep->softlim == 1 && denew->softlim == 0) {
			TAILQ_INSERT_BEFORE(dep, denew, dirs);
			return;
		}
		if (dep->hardlim == 1 && denew->hardlim == 0) {
			TAILQ_INSERT_BEFORE(dep, denew, dirs);
			return;
		}
	}
	TAILQ_INSERT_TAIL(&dir_q, denew, dirs);
}
static void insert_orderly ( struct dir_ent * denew ) { struct dir_ent * dep ; TAILQ_FOREACH ( dep , & dir_q , dirs ) { if ( dep -> softlim == 1 && denew -> softlim == 0 ) { TAILQ_INSERT_BEFORE ( dep , denew , dirs ) ; return ; } if ( dep -> hardlim == 1 && denew -> hardlim == 0 ) { TAILQ_INSERT_BEFORE ( dep , denew , dirs ) ; return ; } } TAILQ_INSERT_TAIL ( & dir_q , denew , dirs ) ; }
Insert the directory entry in the list by the way they are ordered in
 audit_control(5).
Insert the directory entry in the list by the way they are ordered in audit_control ( 5 ) .