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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* Copyright (C) 2008 Stig Venaas <venaas@uninett.no>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*/
#ifdef SYS_SOLARIS9
#include <sys/inttypes.h>
#else
#include <stdint.h>
#endif
#include "list.h"
#include "tlv11.h"
#include <stdlib.h>
#include <string.h>
#include <arpa/inet.h>
struct tlv *maketlv(uint8_t t, uint8_t l, void *v) {
struct tlv *tlv;
tlv = malloc(sizeof(struct tlv));
if (!tlv)
return NULL;
tlv->t = t;
tlv->l = l;
if (l && v) {
tlv->v = malloc(l);
if (!tlv->v) {
free(tlv);
return NULL;
}
memcpy(tlv->v, v, l);
} else
tlv->v = NULL;
return tlv;
}
struct tlv *copytlv(struct tlv *in) {
return in ? maketlv(in->t, in->l, in->v) : NULL;
}
void freetlv(struct tlv *tlv) {
if (tlv) {
free(tlv->v);
free(tlv);
}
}
int eqtlv(struct tlv *t1, struct tlv *t2) {
if (!t1 || !t2)
return t1 == t2;
if (t1->t != t2->t || t1->l != t2->l)
return 0;
return memcmp(t1->v, t2->v, t1->l) == 0;
}
struct list *copytlvlist(struct list *tlvs) {
struct list *out;
struct list_node *node;
if (!tlvs)
return NULL;
out = list_create();
if (!out)
return NULL;
for (node = list_first(tlvs); node; node = list_next(node)) {
if (!list_push(out, copytlv((struct tlv *)node->data))) {
freetlvlist(out);
return NULL;
}
}
return out;
}
void freetlvlist(struct list *tlvs) {
struct tlv *tlv;
while ((tlv = (struct tlv *)list_shift(tlvs)))
freetlv(tlv);
list_destroy(tlvs);
}
void rmtlv(struct list *tlvs, uint8_t t) {
struct list_node *n, *p;
struct tlv *tlv;
p = NULL;
n = list_first(tlvs);
while (n) {
tlv = (struct tlv *)n->data;
if (tlv->t == t) {
list_removedata(tlvs, tlv);
freetlv(tlv);
n = p ? list_next(p) : list_first(tlvs);
} else {
p = n;
n = list_next(n);
}
}
}
uint8_t *tlv2str(struct tlv *tlv) {
uint8_t *s = malloc(tlv->l + 1);
if (s) {
memcpy(s, tlv->v, tlv->l);
s[tlv->l] = '\0';
}
return s;
}
uint8_t *tlv2buf(uint8_t *p, const struct tlv *tlv) {
*p++ = tlv->t;
*p++ = tlv->l;
if (tlv->l) {
if (tlv->v)
memcpy(p, tlv->v, tlv->l);
else
memset(p, 0, tlv->l);
}
return p;
}
/* Local Variables: */
/* c-file-style: "stroustrup" */
/* End: */
|
