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
|
/* SPDX-License-Identifier: GPL-3.0-or-later */
/*
* mknode.c
*
* Copyright (C) 2019 David Oberhollenzer <goliath@infraroot.at>
*/
#include "config.h"
#include "internal.h"
#include <string.h>
#include <stdlib.h>
#include <errno.h>
void fstree_insert_sorted(tree_node_t *root, tree_node_t *n)
{
tree_node_t *it = root->data.dir.children, *prev = NULL;
while (it != NULL && strcmp(it->name, n->name) < 0) {
prev = it;
it = it->next;
}
n->parent = root;
n->next = it;
if (prev == NULL) {
root->data.dir.children = n;
} else {
prev->next = n;
}
}
tree_node_t *fstree_mknode(tree_node_t *parent, const char *name,
size_t name_len, const char *extra,
const struct stat *sb)
{
tree_node_t *n;
size_t size;
char *ptr;
if (S_ISLNK(sb->st_mode) && extra == NULL) {
errno = EINVAL;
return NULL;
}
size = sizeof(tree_node_t) + name_len + 1;
if (extra != NULL)
size += strlen(extra) + 1;
n = calloc(1, size);
if (n == NULL)
return NULL;
n->xattr_idx = 0xFFFFFFFF;
n->uid = sb->st_uid;
n->gid = sb->st_gid;
n->mode = sb->st_mode;
n->mod_time = sb->st_mtime;
n->link_count = 1;
n->name = (char *)n->payload;
memcpy(n->name, name, name_len);
if (extra != NULL) {
ptr = n->name + name_len + 1;
strcpy(ptr, extra);
} else {
ptr = NULL;
}
switch (sb->st_mode & S_IFMT) {
case S_IFREG:
n->data.file.input_file = ptr;
break;
case S_IFLNK:
n->mode = S_IFLNK | 0777;
n->data.target = ptr;
break;
case S_IFBLK:
case S_IFCHR:
n->data.devno = sb->st_rdev;
break;
case S_IFDIR:
n->link_count = 2;
break;
default:
break;
}
if (parent != NULL) {
if (parent->link_count == 0x0FFFF) {
free(n);
errno = EMLINK;
return NULL;
}
fstree_insert_sorted(parent, n);
parent->link_count++;
}
return n;
}
|
