173 lines
3.4 KiB
C
173 lines
3.4 KiB
C
/*
|
|
This file is part of libcapwap.
|
|
|
|
libcapwap 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 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
libcapwap 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.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
* @brief Implementation of methods for actionlists.
|
|
*/
|
|
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "action.h"
|
|
|
|
static inline int cw_action_in_cmp(const void *elem1,const void *elem2)
|
|
{
|
|
struct cw_action_in * e1 = (struct cw_action_in*)elem1;
|
|
struct cw_action_in * e2 = (struct cw_action_in*)elem2;
|
|
int r;
|
|
|
|
r = e1->msg_id - e2->msg_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->capwap_state - e2->capwap_state;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->elem_id - e2->elem_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->vendor_id - e2->vendor_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->proto - e2->proto;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
cw_action_in_t * cw_actionlist_in_add(cw_actionlist_in_t t, struct cw_action_in * a)
|
|
{
|
|
return cw_actionlist_add(t,a,sizeof(struct cw_action_in));
|
|
}
|
|
|
|
|
|
struct cw_action_in * cw_actionlist_in_get(cw_actionlist_in_t t,struct cw_action_in *a)
|
|
{
|
|
return avltree_get(t,a);
|
|
}
|
|
|
|
|
|
cw_actionlist_in_t cw_actionlist_in_create()
|
|
{
|
|
return avltree_create(cw_action_in_cmp,free);
|
|
}
|
|
|
|
|
|
int cw_actionlist_in_register_actions(cw_actionlist_in_t t,cw_action_in_t * actions)
|
|
{
|
|
while(actions->capwap_state){
|
|
cw_action_in_t * rc = cw_actionlist_in_add(t,actions);
|
|
if (rc==0)
|
|
return 0;
|
|
actions++;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
int cw_actionlist_out_register_actions(cw_actionlist_out_t t,cw_action_out_t * actions)
|
|
{
|
|
while(actions->msg_id!=0){
|
|
cw_action_out_t * rc = cw_actionlist_out_add(t,actions);
|
|
if (rc==0)
|
|
return 0;
|
|
actions++;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
* Compare function for actionlist_out_t lists
|
|
*/
|
|
static int cw_action_out_cmp(const void *elem1,const void *elem2)
|
|
{
|
|
struct cw_action_out * e1 = (struct cw_action_out*)elem1;
|
|
struct cw_action_out * e2 = (struct cw_action_out*)elem2;
|
|
int r;
|
|
|
|
r = e1->msg_id - e2->msg_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->item_id - e2->item_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
r = e1->vendor_id - e2->vendor_id;
|
|
if (r!=0)
|
|
return r;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
* Add an action to an action
|
|
* @param t actionlist
|
|
* @param a action to add
|
|
* @param s size of element to add
|
|
* @return pointer to added element or NULL if an error has opccured
|
|
*/
|
|
void * cw_actionlist_add(struct avltree *t, void *a, size_t s)
|
|
{
|
|
void * r = avltree_replace_data(t,a,sizeof(struct cw_action_in));
|
|
if (r)
|
|
return r;
|
|
|
|
void *an = malloc(sizeof(struct cw_action_in));
|
|
if (!an)
|
|
return NULL;
|
|
|
|
memcpy(an,a,s);
|
|
return avltree_add(t,an);
|
|
|
|
}
|
|
|
|
|
|
/**
|
|
* Create an action list for outgoing message lements
|
|
* @return the created action list or NULL if an erro has occured.
|
|
*/
|
|
cw_actionlist_out_t cw_actionlist_out_create()
|
|
{
|
|
return avltree_create(cw_action_out_cmp,free);
|
|
}
|
|
|
|
|
|
cw_action_out_t * cw_actionlist_out_add(cw_actionlist_out_t t, struct cw_action_out * a)
|
|
{
|
|
return cw_actionlist_add(t,a,sizeof (struct cw_action_out));
|
|
}
|
|
|
|
|
|
|
|
|
|
|