Lines Matching refs:list

65 #include <linux/list.h>
180 list_for_each_entry(n, &ctx->names_list, list) {
190 * We keep a linked list of fixed-sized (31 pointer) arrays of audit_chunk *;
194 * "empty" becomes (p, p, 31) afterwards. We don't shrink the list (and seriously,
323 list_for_each_entry(n, &ctx->names_list, list) {
347 list_for_each_entry(n, &ctx->names_list, list) {
531 list_for_each_entry(n, &ctx->names_list, list) {
546 list_for_each_entry(n, &ctx->names_list, list) {
559 list_for_each_entry(n, &ctx->names_list, list) {
571 list_for_each_entry(n, &ctx->names_list, list) {
583 list_for_each_entry(n, &ctx->names_list, list) {
642 list_for_each_entry(n, &ctx->names_list, list) {
711 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TASK], list) {
747 struct list_head *list)
756 if (!list_empty(list)) {
757 list_for_each_entry_rcu(e, list, list) {
779 struct list_head *list = &audit_inode_hash[h];
783 if (list_empty(list))
786 list_for_each_entry_rcu(e, list, list) {
811 list_for_each_entry(n, &ctx->names_list, list) {
877 list_for_each_entry(n, &context->names_list, list) {
890 list_for_each_entry_safe(n, next, &context->names_list, list) {
891 list_del(&n->list);
1456 list_for_each_entry(n, &context->names_list, list) {
1709 list_add_tail(&aname->list, &context->names_list);
1722 * Search the audit_names list for the current audit context. If there is an
1732 list_for_each_entry(n, &context->names_list, list) {
1742 * audit_getname - add a name to the list
1745 * Add a name to the list of audit names for this context.
1800 list_for_each_entry(n, &context->names_list, list)
1863 list_for_each_entry_reverse(n, &context->names_list, list) {
1930 list_for_each_entry(n, &context->names_list, list) {
1942 list_for_each_entry(n, &context->names_list, list) {