63 lines
1005 B
C
63 lines
1005 B
C
|
|
||
|
|
#include "capwap.h"
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
struct args {
|
||
|
|
cw_action_in_t *a;
|
||
|
|
cw_action_in_t **out;
|
||
|
|
struct avltree *mand;
|
||
|
|
int n;
|
||
|
|
};
|
||
|
|
|
||
|
|
static int check_mand_cb(void *priv, void *val)
|
||
|
|
{
|
||
|
|
|
||
|
|
cw_action_in_t *a = (cw_action_in_t*)val;
|
||
|
|
struct args *args = (struct args*) priv;
|
||
|
|
|
||
|
|
if ( (args->a->msg_id != a->msg_id) || (args->a->capwap_state != a->capwap_state))
|
||
|
|
return 0;
|
||
|
|
|
||
|
|
|
||
|
|
// printf("Found wat %d %d %c\n",a->msg_id,a->elem_id, a->mand ? '*':' ');
|
||
|
|
if (a->mand) {
|
||
|
|
int i = a->item_id;
|
||
|
|
void * rc = avltree_del(args->mand,&i);
|
||
|
|
if (!rc) {
|
||
|
|
if (args->out)
|
||
|
|
args->out[args->n]=a;
|
||
|
|
args->n++;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
int cw_check_missing_mand(cw_action_in_t ** out, struct conn * conn, cw_action_in_t *a)
|
||
|
|
{
|
||
|
|
cw_action_in_t as;
|
||
|
|
|
||
|
|
as.capwap_state = a->capwap_state;
|
||
|
|
as.msg_id = a->msg_id;
|
||
|
|
as.vendor_id = 0;
|
||
|
|
as.elem_id = 0;
|
||
|
|
as.proto=0;
|
||
|
|
|
||
|
|
struct args args;
|
||
|
|
args.a = &as;
|
||
|
|
args.mand=conn->mand;
|
||
|
|
args.out=out;
|
||
|
|
args.n=0;
|
||
|
|
|
||
|
|
avltree_foreach_from_asc(conn->actions->in,&as,check_mand_cb,&args);
|
||
|
|
|
||
|
|
return args.n;
|
||
|
|
}
|
||
|
|
|
||
|
|
|