2005-04-17 06:20:36 +08:00
|
|
|
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
#include <linux/isdn/capilli.h>
|
|
|
|
|
|
2012-02-20 11:52:38 +08:00
|
|
|
#define DBG(format, arg...) do { \
|
|
|
|
|
printk(KERN_DEBUG "%s: " format "\n" , __func__ , ## arg); \
|
|
|
|
|
} while (0)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
struct capilib_msgidqueue {
|
|
|
|
|
struct capilib_msgidqueue *next;
|
|
|
|
|
u16 msgid;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct capilib_ncci {
|
|
|
|
|
struct list_head list;
|
|
|
|
|
u16 applid;
|
|
|
|
|
u32 ncci;
|
|
|
|
|
u32 winsize;
|
|
|
|
|
int nmsg;
|
|
|
|
|
struct capilib_msgidqueue *msgidqueue;
|
|
|
|
|
struct capilib_msgidqueue *msgidlast;
|
|
|
|
|
struct capilib_msgidqueue *msgidfree;
|
|
|
|
|
struct capilib_msgidqueue msgidpool[CAPI_MAXDATAWINDOW];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// ---------------------------------------------------------------------------
|
|
|
|
|
// NCCI Handling
|
|
|
|
|
|
2012-02-20 11:52:38 +08:00
|
|
|
static inline void mq_init(struct capilib_ncci *np)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
|
u_int i;
|
|
|
|
|
np->msgidqueue = NULL;
|
|
|
|
|
np->msgidlast = NULL;
|
|
|
|
|
np->nmsg = 0;
|
|
|
|
|
memset(np->msgidpool, 0, sizeof(np->msgidpool));
|
|
|
|
|
np->msgidfree = &np->msgidpool[0];
|
|
|
|
|
for (i = 1; i < np->winsize; i++) {
|
|
|
|
|
np->msgidpool[i].next = np->msgidfree;
|
|
|
|
|
np->msgidfree = &np->msgidpool[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-20 11:52:38 +08:00
|
|
|
static inline int mq_enqueue(struct capilib_ncci *np, u16 msgid)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
|
struct capilib_msgidqueue *mq;
|
2008-04-28 17:14:37 +08:00
|
|
|
if ((mq = np->msgidfree) == NULL)
|
2005-04-17 06:20:36 +08:00
|
|
|
return 0;
|
|
|
|
|
np->msgidfree = mq->next;
|
|
|
|
|
mq->msgid = msgid;
|
|
|
|
|
mq->next = NULL;
|
|
|
|
|
if (np->msgidlast)
|
|
|
|
|
np->msgidlast->next = mq;
|
|
|
|
|
np->msgidlast = mq;
|
|
|
|
|
if (!np->msgidqueue)
|
|
|
|
|
np->msgidqueue = mq;
|
|
|
|
|
np->nmsg++;
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-20 11:52:38 +08:00
|
|
|
static inline int mq_dequeue(struct capilib_ncci *np, u16 msgid)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
|
struct capilib_msgidqueue **pp;
|
|
|
|
|
for (pp = &np->msgidqueue; *pp; pp = &(*pp)->next) {
|
|
|
|
|
if ((*pp)->msgid == msgid) {
|
|
|
|
|
struct capilib_msgidqueue *mq = *pp;
|
|
|
|
|
*pp = mq->next;
|
|
|
|
|
if (mq == np->msgidlast)
|
|
|
|
|
np->msgidlast = NULL;
|
|
|
|
|
mq->next = np->msgidfree;
|
|
|
|
|
np->msgidfree = mq;
|
|
|
|
|
np->nmsg--;
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void capilib_new_ncci(struct list_head *head, u16 applid, u32 ncci, u32 winsize)
|
|
|
|
|
{
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
np = kmalloc(sizeof(*np), GFP_ATOMIC);
|
|
|
|
|
if (!np) {
|
|
|
|
|
printk(KERN_WARNING "capilib_new_ncci: no memory.\n");
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (winsize > CAPI_MAXDATAWINDOW) {
|
|
|
|
|
printk(KERN_ERR "capi_new_ncci: winsize %d too big\n",
|
|
|
|
|
winsize);
|
|
|
|
|
winsize = CAPI_MAXDATAWINDOW;
|
|
|
|
|
}
|
|
|
|
|
np->applid = applid;
|
|
|
|
|
np->ncci = ncci;
|
|
|
|
|
np->winsize = winsize;
|
|
|
|
|
mq_init(np);
|
|
|
|
|
list_add_tail(&np->list, head);
|
|
|
|
|
DBG("kcapi: appl %d ncci 0x%x up", applid, ncci);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_new_ncci);
|
|
|
|
|
|
|
|
|
|
void capilib_free_ncci(struct list_head *head, u16 applid, u32 ncci)
|
|
|
|
|
{
|
|
|
|
|
struct list_head *l;
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
list_for_each(l, head) {
|
|
|
|
|
np = list_entry(l, struct capilib_ncci, list);
|
|
|
|
|
if (np->applid != applid)
|
|
|
|
|
continue;
|
|
|
|
|
if (np->ncci != ncci)
|
|
|
|
|
continue;
|
|
|
|
|
printk(KERN_INFO "kcapi: appl %d ncci 0x%x down\n", applid, ncci);
|
|
|
|
|
list_del(&np->list);
|
|
|
|
|
kfree(np);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
printk(KERN_ERR "capilib_free_ncci: ncci 0x%x not found\n", ncci);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_free_ncci);
|
|
|
|
|
|
|
|
|
|
void capilib_release_appl(struct list_head *head, u16 applid)
|
|
|
|
|
{
|
|
|
|
|
struct list_head *l, *n;
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
list_for_each_safe(l, n, head) {
|
|
|
|
|
np = list_entry(l, struct capilib_ncci, list);
|
|
|
|
|
if (np->applid != applid)
|
|
|
|
|
continue;
|
|
|
|
|
printk(KERN_INFO "kcapi: appl %d ncci 0x%x forced down\n", applid, np->ncci);
|
|
|
|
|
list_del(&np->list);
|
|
|
|
|
kfree(np);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_release_appl);
|
|
|
|
|
|
|
|
|
|
void capilib_release(struct list_head *head)
|
|
|
|
|
{
|
|
|
|
|
struct list_head *l, *n;
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
list_for_each_safe(l, n, head) {
|
|
|
|
|
np = list_entry(l, struct capilib_ncci, list);
|
|
|
|
|
printk(KERN_INFO "kcapi: appl %d ncci 0x%x forced down\n", np->applid, np->ncci);
|
|
|
|
|
list_del(&np->list);
|
|
|
|
|
kfree(np);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_release);
|
|
|
|
|
|
|
|
|
|
u16 capilib_data_b3_req(struct list_head *head, u16 applid, u32 ncci, u16 msgid)
|
|
|
|
|
{
|
|
|
|
|
struct list_head *l;
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
list_for_each(l, head) {
|
|
|
|
|
np = list_entry(l, struct capilib_ncci, list);
|
|
|
|
|
if (np->applid != applid)
|
|
|
|
|
continue;
|
|
|
|
|
if (np->ncci != ncci)
|
|
|
|
|
continue;
|
2012-02-20 11:52:38 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (mq_enqueue(np, msgid) == 0)
|
|
|
|
|
return CAPI_SENDQUEUEFULL;
|
|
|
|
|
|
|
|
|
|
return CAPI_NOERROR;
|
|
|
|
|
}
|
|
|
|
|
printk(KERN_ERR "capilib_data_b3_req: ncci 0x%x not found\n", ncci);
|
|
|
|
|
return CAPI_NOERROR;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_data_b3_req);
|
|
|
|
|
|
|
|
|
|
void capilib_data_b3_conf(struct list_head *head, u16 applid, u32 ncci, u16 msgid)
|
|
|
|
|
{
|
|
|
|
|
struct list_head *l;
|
|
|
|
|
struct capilib_ncci *np;
|
|
|
|
|
|
|
|
|
|
list_for_each(l, head) {
|
|
|
|
|
np = list_entry(l, struct capilib_ncci, list);
|
|
|
|
|
if (np->applid != applid)
|
|
|
|
|
continue;
|
|
|
|
|
if (np->ncci != ncci)
|
|
|
|
|
continue;
|
2012-02-20 11:52:38 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (mq_dequeue(np, msgid) == 0) {
|
|
|
|
|
printk(KERN_ERR "kcapi: msgid %hu ncci 0x%x not on queue\n",
|
|
|
|
|
msgid, ncci);
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
printk(KERN_ERR "capilib_data_b3_conf: ncci 0x%x not found\n", ncci);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(capilib_data_b3_conf);
|