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
127
128
129
130
131
132
133
134
135
136
|
/* SPDX-License-Identifier: LGPL-3.0-or-later */
/*
* xattr_writer.c
*
* Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
*/
#include "xattr_writer.h"
static sqfs_object_t *xattr_writer_copy(const sqfs_object_t *obj)
{
const sqfs_xattr_writer_t *xwr = (const sqfs_xattr_writer_t *)obj;
sqfs_xattr_writer_t *copy;
kv_block_desc_t *it;
copy = calloc(1, sizeof(*copy));
if (copy == NULL)
return NULL;
memcpy(copy, xwr, sizeof(*xwr));
if (str_table_copy(©->keys, &xwr->keys))
goto fail_keys;
if (str_table_copy(©->values, &xwr->values))
goto fail_values;
copy->max_pairs = xwr->num_pairs;
copy->num_pairs = xwr->num_pairs;
copy->kv_pairs = malloc(sizeof(copy->kv_pairs[0]) * xwr->num_pairs);
if (copy->kv_pairs == NULL)
goto fail_pairs;
memcpy(copy->kv_pairs, xwr->kv_pairs,
sizeof(copy->kv_pairs[0]) * xwr->num_pairs);
if (rbtree_copy(&xwr->kv_block_tree, ©->kv_block_tree) != 0)
goto fail_tree;
for (it = xwr->kv_block_first; it != NULL; it = it->next) {
rbtree_node_t *n = rbtree_lookup(©->kv_block_tree, it);
if (copy->kv_block_last == NULL) {
copy->kv_block_first = rbtree_node_key(n);
copy->kv_block_last = copy->kv_block_first;
} else {
copy->kv_block_last->next = rbtree_node_key(n);
copy->kv_block_last = copy->kv_block_last->next;
}
copy->kv_block_last->next = NULL;
}
return (sqfs_object_t *)copy;
fail_tree:
free(copy->kv_pairs);
fail_pairs:
str_table_cleanup(©->values);
fail_values:
str_table_cleanup(©->keys);
fail_keys:
free(copy);
return NULL;
}
static void xattr_writer_destroy(sqfs_object_t *obj)
{
sqfs_xattr_writer_t *xwr = (sqfs_xattr_writer_t *)obj;
rbtree_cleanup(&xwr->kv_block_tree);
free(xwr->kv_pairs);
str_table_cleanup(&xwr->values);
str_table_cleanup(&xwr->keys);
free(xwr);
}
static int block_compare(const void *context,
const void *lhs, const void *rhs)
{
const sqfs_xattr_writer_t *xwr = context;
const kv_block_desc_t *l = lhs, *r = rhs;
if (l->count != r->count)
return l->count < r->count ? -1 : 1;
if (l->start == r->start)
return 0;
return memcmp(xwr->kv_pairs + l->start,
xwr->kv_pairs + r->start,
l->count * sizeof(xwr->kv_pairs[0]));
}
sqfs_xattr_writer_t *sqfs_xattr_writer_create(sqfs_u32 flags)
{
sqfs_xattr_writer_t *xwr;
if (flags != 0)
return NULL;
xwr = calloc(1, sizeof(*xwr));
if (xwr == NULL)
return NULL;
if (str_table_init(&xwr->keys, XATTR_KEY_BUCKETS))
goto fail_keys;
if (str_table_init(&xwr->values, XATTR_VALUE_BUCKETS))
goto fail_values;
xwr->max_pairs = XATTR_INITIAL_PAIR_CAP;
xwr->kv_pairs = alloc_array(sizeof(xwr->kv_pairs[0]), xwr->max_pairs);
if (xwr->kv_pairs == NULL)
goto fail_pairs;
if (rbtree_init(&xwr->kv_block_tree, sizeof(kv_block_desc_t),
sizeof(sqfs_u32), block_compare)) {
goto fail_tree;
}
xwr->kv_block_tree.key_context = xwr;
((sqfs_object_t *)xwr)->copy = xattr_writer_copy;
((sqfs_object_t *)xwr)->destroy = xattr_writer_destroy;
return xwr;
fail_tree:
free(xwr->kv_pairs);
fail_pairs:
str_table_cleanup(&xwr->values);
fail_values:
str_table_cleanup(&xwr->keys);
fail_keys:
free(xwr);
return NULL;
}
|
