Searched refs:filter_list (Results 1 - 4 of 4) sorted by relevance

/freebsd-10.2-release/contrib/openbsm/bin/auditfilterd/
H A Dauditfilterd.h73 extern struct auditfilter_module_list filter_list;
H A Dauditfilterd_conf.c357 TAILQ_FOREACH_SAFE(am1, &filter_list, am_list, am_tmp) {
370 * am1 appears in filter_list, but not the new list, detach
374 TAILQ_REMOVE(&filter_list, am1, am_list);
385 TAILQ_FOREACH(am1, &filter_list, am_list) {
417 TAILQ_REMOVE(&filter_list, am1, am_list);
438 TAILQ_FOREACH(am2, &filter_list, am_list) {
448 * Attach the entry. If it succeeds, add to filter_list,
458 TAILQ_INSERT_HEAD(&filter_list, am1, am_list);
490 auditfilter_module_list_detach(&filter_list);
491 auditfilter_module_list_free(&filter_list);
[all...]
H A Dauditfilterd.c71 struct auditfilter_module_list filter_list; variable in typeref:struct:auditfilter_module_list
99 TAILQ_INIT(&filter_list);
127 TAILQ_FOREACH(am, &filter_list, am_list) {
155 TAILQ_FOREACH(am, &filter_list, am_list) {
/freebsd-10.2-release/contrib/gcc/
H A Dexcept.c163 tree filter_list;
1342 r->u.catch.filter_list = NULL_TREE;
1355 r->u.catch.filter_list
1356 = tree_cons (NULL_TREE, flt_node, r->u.catch.filter_list);
1366 r->u.catch.filter_list
1367 = tree_cons (NULL_TREE, flt_node, r->u.catch.filter_list);
1462 tree flt_node = c->u.catch.filter_list;
3162 = TREE_INT_CST_LOW (TREE_VALUE (c->u.catch.filter_list));
3187 flt_node = c->u.catch.filter_list;
162 tree filter_list; member in struct:eh_region_u::eh_region_u_catch

Completed in 114 milliseconds