Lines Matching defs:inst
82 struct nfqnl_instance *inst;
85 hlist_for_each_entry_rcu(inst, pos, head, hlist) {
86 if (inst->queue_num == queue_num)
87 return inst;
95 struct nfqnl_instance *inst;
105 inst = kzalloc(sizeof(*inst), GFP_ATOMIC);
106 if (!inst) {
111 inst->queue_num = queue_num;
112 inst->peer_pid = pid;
113 inst->queue_maxlen = NFQNL_QMAX_DEFAULT;
114 inst->copy_range = 0xfffff;
115 inst->copy_mode = NFQNL_COPY_NONE;
116 spin_lock_init(&inst->lock);
117 INIT_LIST_HEAD(&inst->queue_list);
125 hlist_add_head_rcu(&inst->hlist, &instance_table[h]);
129 return inst;
132 kfree(inst);
144 struct nfqnl_instance *inst = container_of(head, struct nfqnl_instance,
147 nfqnl_flush(inst, NULL, 0);
148 kfree(inst);
153 __instance_destroy(struct nfqnl_instance *inst)
155 hlist_del_rcu(&inst->hlist);
156 call_rcu(&inst->rcu, instance_destroy_rcu);
160 instance_destroy(struct nfqnl_instance *inst)
163 __instance_destroy(inst);
544 struct nfqnl_instance *inst;
547 hlist_for_each_entry_rcu(inst, tmp, head, hlist)
548 nfqnl_flush(inst, dev_cmp, ifindex);
588 struct nfqnl_instance *inst;
591 hlist_for_each_entry_safe(inst, tmp, t2, head, hlist) {
593 (n->pid == inst->peer_pid))
594 __instance_destroy(inst);
867 const struct nfqnl_instance *inst = v;
870 inst->queue_num,
871 inst->peer_pid, inst->queue_total,
872 inst->copy_mode, inst->copy_range,
873 inst->queue_dropped, inst->queue_user_dropped,
874 atomic_read(&inst->id_sequence), 1);