mirror of
https://github.com/torvalds/linux.git
synced 2024-12-25 04:11:49 +00:00
b67bfe0d42
I'm not sure why, but the hlist for each entry iterators were conceived list_for_each_entry(pos, head, member) The hlist ones were greedy and wanted an extra parameter: hlist_for_each_entry(tpos, pos, head, member) Why did they need an extra pos parameter? I'm not quite sure. Not only they don't really need it, it also prevents the iterator from looking exactly like the list iterator, which is unfortunate. Besides the semantic patch, there was some manual work required: - Fix up the actual hlist iterators in linux/list.h - Fix up the declaration of other iterators based on the hlist ones. - A very small amount of places were using the 'node' parameter, this was modified to use 'obj->member' instead. - Coccinelle didn't handle the hlist_for_each_entry_safe iterator properly, so those had to be fixed up manually. The semantic patch which is mostly the work of Peter Senna Tschudin is here: @@ iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host; type T; expression a,c,d,e; identifier b; statement S; @@ -T b; <+... when != b ( hlist_for_each_entry(a, - b, c, d) S | hlist_for_each_entry_continue(a, - b, c) S | hlist_for_each_entry_from(a, - b, c) S | hlist_for_each_entry_rcu(a, - b, c, d) S | hlist_for_each_entry_rcu_bh(a, - b, c, d) S | hlist_for_each_entry_continue_rcu_bh(a, - b, c) S | for_each_busy_worker(a, c, - b, d) S | ax25_uid_for_each(a, - b, c) S | ax25_for_each(a, - b, c) S | inet_bind_bucket_for_each(a, - b, c) S | sctp_for_each_hentry(a, - b, c) S | sk_for_each(a, - b, c) S | sk_for_each_rcu(a, - b, c) S | sk_for_each_from -(a, b) +(a) S + sk_for_each_from(a) S | sk_for_each_safe(a, - b, c, d) S | sk_for_each_bound(a, - b, c) S | hlist_for_each_entry_safe(a, - b, c, d, e) S | hlist_for_each_entry_continue_rcu(a, - b, c) S | nr_neigh_for_each(a, - b, c) S | nr_neigh_for_each_safe(a, - b, c, d) S | nr_node_for_each(a, - b, c) S | nr_node_for_each_safe(a, - b, c, d) S | - for_each_gfn_sp(a, c, d, b) S + for_each_gfn_sp(a, c, d) S | - for_each_gfn_indirect_valid_sp(a, c, d, b) S + for_each_gfn_indirect_valid_sp(a, c, d) S | for_each_host(a, - b, c) S | for_each_host_safe(a, - b, c, d) S | for_each_mesh_entry(a, - b, c, d) S ) ...+> [akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c] [akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c] [akpm@linux-foundation.org: checkpatch fixes] [akpm@linux-foundation.org: fix warnings] [akpm@linux-foudnation.org: redo intrusive kvm changes] Tested-by: Peter Senna Tschudin <peter.senna@gmail.com> Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Signed-off-by: Sasha Levin <sasha.levin@oracle.com> Cc: Wu Fengguang <fengguang.wu@intel.com> Cc: Marcelo Tosatti <mtosatti@redhat.com> Cc: Gleb Natapov <gleb@redhat.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
218 lines
4.9 KiB
C
218 lines
4.9 KiB
C
/*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
|
|
*/
|
|
#include <linux/errno.h>
|
|
#include <linux/types.h>
|
|
#include <linux/socket.h>
|
|
#include <linux/in.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/module.h>
|
|
#include <linux/spinlock.h>
|
|
#include <linux/timer.h>
|
|
#include <linux/string.h>
|
|
#include <linux/sockios.h>
|
|
#include <linux/net.h>
|
|
#include <linux/slab.h>
|
|
#include <net/ax25.h>
|
|
#include <linux/inet.h>
|
|
#include <linux/netdevice.h>
|
|
#include <linux/skbuff.h>
|
|
#include <net/sock.h>
|
|
#include <asm/uaccess.h>
|
|
#include <linux/fcntl.h>
|
|
#include <linux/mm.h>
|
|
#include <linux/interrupt.h>
|
|
|
|
static struct ax25_protocol *protocol_list;
|
|
static DEFINE_RWLOCK(protocol_list_lock);
|
|
|
|
static HLIST_HEAD(ax25_linkfail_list);
|
|
static DEFINE_SPINLOCK(linkfail_lock);
|
|
|
|
static struct listen_struct {
|
|
struct listen_struct *next;
|
|
ax25_address callsign;
|
|
struct net_device *dev;
|
|
} *listen_list = NULL;
|
|
static DEFINE_SPINLOCK(listen_lock);
|
|
|
|
/*
|
|
* Do not register the internal protocols AX25_P_TEXT, AX25_P_SEGMENT,
|
|
* AX25_P_IP or AX25_P_ARP ...
|
|
*/
|
|
void ax25_register_pid(struct ax25_protocol *ap)
|
|
{
|
|
write_lock_bh(&protocol_list_lock);
|
|
ap->next = protocol_list;
|
|
protocol_list = ap;
|
|
write_unlock_bh(&protocol_list_lock);
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ax25_register_pid);
|
|
|
|
void ax25_protocol_release(unsigned int pid)
|
|
{
|
|
struct ax25_protocol *protocol;
|
|
|
|
write_lock_bh(&protocol_list_lock);
|
|
protocol = protocol_list;
|
|
if (protocol == NULL)
|
|
goto out;
|
|
|
|
if (protocol->pid == pid) {
|
|
protocol_list = protocol->next;
|
|
goto out;
|
|
}
|
|
|
|
while (protocol != NULL && protocol->next != NULL) {
|
|
if (protocol->next->pid == pid) {
|
|
protocol->next = protocol->next->next;
|
|
goto out;
|
|
}
|
|
|
|
protocol = protocol->next;
|
|
}
|
|
out:
|
|
write_unlock_bh(&protocol_list_lock);
|
|
}
|
|
|
|
EXPORT_SYMBOL(ax25_protocol_release);
|
|
|
|
void ax25_linkfail_register(struct ax25_linkfail *lf)
|
|
{
|
|
spin_lock_bh(&linkfail_lock);
|
|
hlist_add_head(&lf->lf_node, &ax25_linkfail_list);
|
|
spin_unlock_bh(&linkfail_lock);
|
|
}
|
|
|
|
EXPORT_SYMBOL(ax25_linkfail_register);
|
|
|
|
void ax25_linkfail_release(struct ax25_linkfail *lf)
|
|
{
|
|
spin_lock_bh(&linkfail_lock);
|
|
hlist_del_init(&lf->lf_node);
|
|
spin_unlock_bh(&linkfail_lock);
|
|
}
|
|
|
|
EXPORT_SYMBOL(ax25_linkfail_release);
|
|
|
|
int ax25_listen_register(ax25_address *callsign, struct net_device *dev)
|
|
{
|
|
struct listen_struct *listen;
|
|
|
|
if (ax25_listen_mine(callsign, dev))
|
|
return 0;
|
|
|
|
if ((listen = kmalloc(sizeof(*listen), GFP_ATOMIC)) == NULL)
|
|
return -ENOMEM;
|
|
|
|
listen->callsign = *callsign;
|
|
listen->dev = dev;
|
|
|
|
spin_lock_bh(&listen_lock);
|
|
listen->next = listen_list;
|
|
listen_list = listen;
|
|
spin_unlock_bh(&listen_lock);
|
|
|
|
return 0;
|
|
}
|
|
|
|
EXPORT_SYMBOL(ax25_listen_register);
|
|
|
|
void ax25_listen_release(ax25_address *callsign, struct net_device *dev)
|
|
{
|
|
struct listen_struct *s, *listen;
|
|
|
|
spin_lock_bh(&listen_lock);
|
|
listen = listen_list;
|
|
if (listen == NULL) {
|
|
spin_unlock_bh(&listen_lock);
|
|
return;
|
|
}
|
|
|
|
if (ax25cmp(&listen->callsign, callsign) == 0 && listen->dev == dev) {
|
|
listen_list = listen->next;
|
|
spin_unlock_bh(&listen_lock);
|
|
kfree(listen);
|
|
return;
|
|
}
|
|
|
|
while (listen != NULL && listen->next != NULL) {
|
|
if (ax25cmp(&listen->next->callsign, callsign) == 0 && listen->next->dev == dev) {
|
|
s = listen->next;
|
|
listen->next = listen->next->next;
|
|
spin_unlock_bh(&listen_lock);
|
|
kfree(s);
|
|
return;
|
|
}
|
|
|
|
listen = listen->next;
|
|
}
|
|
spin_unlock_bh(&listen_lock);
|
|
}
|
|
|
|
EXPORT_SYMBOL(ax25_listen_release);
|
|
|
|
int (*ax25_protocol_function(unsigned int pid))(struct sk_buff *, ax25_cb *)
|
|
{
|
|
int (*res)(struct sk_buff *, ax25_cb *) = NULL;
|
|
struct ax25_protocol *protocol;
|
|
|
|
read_lock(&protocol_list_lock);
|
|
for (protocol = protocol_list; protocol != NULL; protocol = protocol->next)
|
|
if (protocol->pid == pid) {
|
|
res = protocol->func;
|
|
break;
|
|
}
|
|
read_unlock(&protocol_list_lock);
|
|
|
|
return res;
|
|
}
|
|
|
|
int ax25_listen_mine(ax25_address *callsign, struct net_device *dev)
|
|
{
|
|
struct listen_struct *listen;
|
|
|
|
spin_lock_bh(&listen_lock);
|
|
for (listen = listen_list; listen != NULL; listen = listen->next)
|
|
if (ax25cmp(&listen->callsign, callsign) == 0 &&
|
|
(listen->dev == dev || listen->dev == NULL)) {
|
|
spin_unlock_bh(&listen_lock);
|
|
return 1;
|
|
}
|
|
spin_unlock_bh(&listen_lock);
|
|
|
|
return 0;
|
|
}
|
|
|
|
void ax25_link_failed(ax25_cb *ax25, int reason)
|
|
{
|
|
struct ax25_linkfail *lf;
|
|
|
|
spin_lock_bh(&linkfail_lock);
|
|
hlist_for_each_entry(lf, &ax25_linkfail_list, lf_node)
|
|
lf->func(ax25, reason);
|
|
spin_unlock_bh(&linkfail_lock);
|
|
}
|
|
|
|
int ax25_protocol_is_registered(unsigned int pid)
|
|
{
|
|
struct ax25_protocol *protocol;
|
|
int res = 0;
|
|
|
|
read_lock_bh(&protocol_list_lock);
|
|
for (protocol = protocol_list; protocol != NULL; protocol = protocol->next)
|
|
if (protocol->pid == pid) {
|
|
res = 1;
|
|
break;
|
|
}
|
|
read_unlock_bh(&protocol_list_lock);
|
|
|
|
return res;
|
|
}
|