2008-07-27 06:54:58 +07:00
|
|
|
/*
|
|
|
|
* finite state machine implementation
|
|
|
|
*
|
|
|
|
* Author Karsten Keil <kkeil@novell.com>
|
|
|
|
*
|
|
|
|
* Thanks to Jan den Ouden
|
|
|
|
* Fritz Elfert
|
|
|
|
* Copyright 2008 by Karsten Keil <kkeil@novell.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include "fsm.h"
|
|
|
|
|
|
|
|
#define FSM_TIMER_DEBUG 0
|
|
|
|
|
2017-08-11 19:57:22 +07:00
|
|
|
int
|
2008-07-27 06:54:58 +07:00
|
|
|
mISDN_FsmNew(struct Fsm *fsm,
|
2012-02-20 10:52:38 +07:00
|
|
|
struct FsmNode *fnlist, int fncount)
|
2008-07-27 06:54:58 +07:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
treewide: kzalloc() -> kcalloc()
The kzalloc() function has a 2-factor argument form, kcalloc(). This
patch replaces cases of:
kzalloc(a * b, gfp)
with:
kcalloc(a * b, gfp)
as well as handling cases of:
kzalloc(a * b * c, gfp)
with:
kzalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kzalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kzalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kzalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc
+ kcalloc
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kzalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kzalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc(sizeof(THING) * C2, ...)
|
kzalloc(sizeof(TYPE) * C2, ...)
|
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(C1 * C2, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 04:03:40 +07:00
|
|
|
fsm->jumpmatrix =
|
|
|
|
kzalloc(array3_size(sizeof(FSMFNPTR), fsm->state_count,
|
|
|
|
fsm->event_count),
|
|
|
|
GFP_KERNEL);
|
2017-08-11 19:57:22 +07:00
|
|
|
if (fsm->jumpmatrix == NULL)
|
|
|
|
return -ENOMEM;
|
2008-07-27 06:54:58 +07:00
|
|
|
|
|
|
|
for (i = 0; i < fncount; i++)
|
|
|
|
if ((fnlist[i].state >= fsm->state_count) ||
|
|
|
|
(fnlist[i].event >= fsm->event_count)) {
|
|
|
|
printk(KERN_ERR
|
2012-02-20 10:52:38 +07:00
|
|
|
"mISDN_FsmNew Error: %d st(%ld/%ld) ev(%ld/%ld)\n",
|
|
|
|
i, (long)fnlist[i].state, (long)fsm->state_count,
|
|
|
|
(long)fnlist[i].event, (long)fsm->event_count);
|
2008-07-27 06:54:58 +07:00
|
|
|
} else
|
|
|
|
fsm->jumpmatrix[fsm->state_count * fnlist[i].event +
|
2012-02-20 10:52:38 +07:00
|
|
|
fnlist[i].state] = (FSMFNPTR) fnlist[i].routine;
|
2017-08-11 19:57:22 +07:00
|
|
|
return 0;
|
2008-07-27 06:54:58 +07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmNew);
|
|
|
|
|
|
|
|
void
|
|
|
|
mISDN_FsmFree(struct Fsm *fsm)
|
|
|
|
{
|
|
|
|
kfree((void *) fsm->jumpmatrix);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmFree);
|
|
|
|
|
|
|
|
int
|
|
|
|
mISDN_FsmEvent(struct FsmInst *fi, int event, void *arg)
|
|
|
|
{
|
|
|
|
FSMFNPTR r;
|
|
|
|
|
|
|
|
if ((fi->state >= fi->fsm->state_count) ||
|
|
|
|
(event >= fi->fsm->event_count)) {
|
|
|
|
printk(KERN_ERR
|
2012-02-20 10:52:38 +07:00
|
|
|
"mISDN_FsmEvent Error st(%ld/%ld) ev(%d/%ld)\n",
|
|
|
|
(long)fi->state, (long)fi->fsm->state_count, event,
|
|
|
|
(long)fi->fsm->event_count);
|
2008-07-27 06:54:58 +07:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
r = fi->fsm->jumpmatrix[fi->fsm->state_count * event + fi->state];
|
|
|
|
if (r) {
|
|
|
|
if (fi->debug)
|
|
|
|
fi->printdebug(fi, "State %s Event %s",
|
2012-02-20 10:52:38 +07:00
|
|
|
fi->fsm->strState[fi->state],
|
|
|
|
fi->fsm->strEvent[event]);
|
2008-07-27 06:54:58 +07:00
|
|
|
r(fi, event, arg);
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
if (fi->debug)
|
|
|
|
fi->printdebug(fi, "State %s Event %s no action",
|
2012-02-20 10:52:38 +07:00
|
|
|
fi->fsm->strState[fi->state],
|
|
|
|
fi->fsm->strEvent[event]);
|
2008-07-27 06:54:58 +07:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmEvent);
|
|
|
|
|
|
|
|
void
|
|
|
|
mISDN_FsmChangeState(struct FsmInst *fi, int newstate)
|
|
|
|
{
|
|
|
|
fi->state = newstate;
|
|
|
|
if (fi->debug)
|
|
|
|
fi->printdebug(fi, "ChangeState %s",
|
2012-02-20 10:52:38 +07:00
|
|
|
fi->fsm->strState[newstate]);
|
2008-07-27 06:54:58 +07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmChangeState);
|
|
|
|
|
|
|
|
static void
|
2017-10-17 07:29:14 +07:00
|
|
|
FsmExpireTimer(struct timer_list *t)
|
2008-07-27 06:54:58 +07:00
|
|
|
{
|
2017-10-17 07:29:14 +07:00
|
|
|
struct FsmTimer *ft = from_timer(ft, t, tl);
|
2008-07-27 06:54:58 +07:00
|
|
|
#if FSM_TIMER_DEBUG
|
|
|
|
if (ft->fi->debug)
|
|
|
|
ft->fi->printdebug(ft->fi, "FsmExpireTimer %lx", (long) ft);
|
|
|
|
#endif
|
|
|
|
mISDN_FsmEvent(ft->fi, ft->event, ft->arg);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
mISDN_FsmInitTimer(struct FsmInst *fi, struct FsmTimer *ft)
|
|
|
|
{
|
|
|
|
ft->fi = fi;
|
|
|
|
#if FSM_TIMER_DEBUG
|
|
|
|
if (ft->fi->debug)
|
|
|
|
ft->fi->printdebug(ft->fi, "mISDN_FsmInitTimer %lx", (long) ft);
|
|
|
|
#endif
|
2017-10-17 07:29:14 +07:00
|
|
|
timer_setup(&ft->tl, FsmExpireTimer, 0);
|
2008-07-27 06:54:58 +07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmInitTimer);
|
|
|
|
|
|
|
|
void
|
|
|
|
mISDN_FsmDelTimer(struct FsmTimer *ft, int where)
|
|
|
|
{
|
|
|
|
#if FSM_TIMER_DEBUG
|
|
|
|
if (ft->fi->debug)
|
|
|
|
ft->fi->printdebug(ft->fi, "mISDN_FsmDelTimer %lx %d",
|
2012-02-20 10:52:38 +07:00
|
|
|
(long) ft, where);
|
2008-07-27 06:54:58 +07:00
|
|
|
#endif
|
|
|
|
del_timer(&ft->tl);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmDelTimer);
|
|
|
|
|
|
|
|
int
|
|
|
|
mISDN_FsmAddTimer(struct FsmTimer *ft,
|
2012-02-20 10:52:38 +07:00
|
|
|
int millisec, int event, void *arg, int where)
|
2008-07-27 06:54:58 +07:00
|
|
|
{
|
|
|
|
|
|
|
|
#if FSM_TIMER_DEBUG
|
|
|
|
if (ft->fi->debug)
|
|
|
|
ft->fi->printdebug(ft->fi, "mISDN_FsmAddTimer %lx %d %d",
|
2012-02-20 10:52:38 +07:00
|
|
|
(long) ft, millisec, where);
|
2008-07-27 06:54:58 +07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (timer_pending(&ft->tl)) {
|
|
|
|
if (ft->fi->debug) {
|
|
|
|
printk(KERN_WARNING
|
2012-02-20 10:52:38 +07:00
|
|
|
"mISDN_FsmAddTimer: timer already active!\n");
|
2008-07-27 06:54:58 +07:00
|
|
|
ft->fi->printdebug(ft->fi,
|
2012-02-20 10:52:38 +07:00
|
|
|
"mISDN_FsmAddTimer already active!");
|
2008-07-27 06:54:58 +07:00
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
ft->event = event;
|
|
|
|
ft->arg = arg;
|
|
|
|
ft->tl.expires = jiffies + (millisec * HZ) / 1000;
|
|
|
|
add_timer(&ft->tl);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmAddTimer);
|
|
|
|
|
|
|
|
void
|
|
|
|
mISDN_FsmRestartTimer(struct FsmTimer *ft,
|
2012-02-20 10:52:38 +07:00
|
|
|
int millisec, int event, void *arg, int where)
|
2008-07-27 06:54:58 +07:00
|
|
|
{
|
|
|
|
|
|
|
|
#if FSM_TIMER_DEBUG
|
|
|
|
if (ft->fi->debug)
|
|
|
|
ft->fi->printdebug(ft->fi, "mISDN_FsmRestartTimer %lx %d %d",
|
2012-02-20 10:52:38 +07:00
|
|
|
(long) ft, millisec, where);
|
2008-07-27 06:54:58 +07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (timer_pending(&ft->tl))
|
|
|
|
del_timer(&ft->tl);
|
|
|
|
ft->event = event;
|
|
|
|
ft->arg = arg;
|
|
|
|
ft->tl.expires = jiffies + (millisec * HZ) / 1000;
|
|
|
|
add_timer(&ft->tl);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mISDN_FsmRestartTimer);
|