1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/*
* Copyright (C) 2013 Felix Fietkau <nbd@openwrt.org>
* Copyright (C) 2013 John Crispin <blogic@openwrt.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 2.1
* 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.
*/
#ifndef __PROCD_UTILS_H
#define __PROCD_UTILS_H
#include <libubox/avl.h>
#include <libubox/blob.h>
#include <libubox/blobmsg.h>
struct blobmsg_list_node {
struct avl_node avl;
struct blob_attr *data;
};
typedef bool (*blobmsg_list_cmp)(struct blobmsg_list_node *l1, struct blobmsg_list_node *l2);
typedef void (*blobmsg_update_cb)(struct blobmsg_list_node *n);
struct blobmsg_list {
struct avl_tree avl;
int node_offset;
int node_len;
blobmsg_list_cmp cmp;
};
#define blobmsg_list_simple_init(list) \
__blobmsg_list_init(list, 0, sizeof(struct blobmsg_list_node), NULL)
#define blobmsg_list_init(list, type, field, cmp) \
__blobmsg_list_init(list, offsetof(type, field), sizeof(type), cmp)
#define blobmsg_list_for_each(list, element) \
avl_for_each_element(&(list)->avl, element, avl)
void __blobmsg_list_init(struct blobmsg_list *list, int offset, int len, blobmsg_list_cmp cmp);
int blobmsg_list_fill(struct blobmsg_list *list, void *data, int len, bool array);
void blobmsg_list_free(struct blobmsg_list *list);
bool blobmsg_list_equal(struct blobmsg_list *l1, struct blobmsg_list *l2);
void blobmsg_list_move(struct blobmsg_list *list, struct blobmsg_list *src);
#endif
|
