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
137
138
139
140
|
/*
* Copyright (C) 2023 Patrick McDermott
*
* This file is part of opkg-opk.
*
* opkg-opk 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.
*
* opkg-opk 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 opkg-opk. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "defs.h"
#include "dirent.h"
static int
_opkg_opk_dirent_name_prefix(struct opkg_opk_dirent *dirent, char **name_buf,
size_t *name_buf_len, char **pref_buf, size_t *pref_buf_len,
size_t *name_len, size_t *pref_len)
{
size_t len;
char **buf;
int sep;
len = strlen(dirent->name);
if (*name_len > 0 && *name_len + len + 1 <= *name_buf_len) {
/* Space available in name buffer. Not last node, so append
* separator. */
buf = name_buf;
*name_len += len + 1;
sep = 1;
} else if (*name_len == 0 && *name_len + len <= *name_buf_len) {
/* Space available in name buffer. Last node (first in
* recursion), so don't append separator. */
buf = name_buf;
*name_len += len;
sep = 0;
} else if (*pref_len > 0 && *pref_len + len + 1 <= *pref_buf_len) {
/* Space available in prefix buffer. Not last node, so append
* separator. */
buf = pref_buf;
*pref_len += len + 1;
sep = 1;
} else if (*pref_len == 0 && *pref_len + len <= *pref_buf_len) {
/* Space available in prefix buffer. Last node (first in
* recursion), so don't append separator. */
buf = pref_buf;
*pref_len += len;
sep = 0;
} else {
/* Both buffers full. */
return OPKG_OPK_ERROR;
}
if (*buf == NULL) {
/* Caller provided a NULL buffer pointer. */
return OPKG_OPK_ERROR;
}
/* Recurse. */
if (dirent->parent != NULL &&
_opkg_opk_dirent_name_prefix(dirent->parent,
name_buf, name_buf_len, pref_buf, pref_buf_len,
name_len, pref_len) == OPKG_OPK_ERROR) {
return OPKG_OPK_ERROR;
}
/* Copy node name and possibly separator suffix. */
memcpy(*buf, dirent->name, len);
*buf += len;
if (sep == 1) {
**buf = '/';
*buf += 1;
}
return OPKG_OPK_OK;
}
int
opkg_opk_dirent_name_prefix(struct opkg_opk_dirent *dirent, char *name_buf,
size_t name_buf_len, char *pref_buf, size_t pref_buf_len)
{
size_t name_len = 0;
size_t pref_len = 0;
char *name = name_buf;
char *pref = pref_buf;
/* NUL bytes */
--name_buf_len;
--pref_buf_len;
if (_opkg_opk_dirent_name_prefix(dirent, &name_buf, &name_buf_len,
&pref_buf, &pref_buf_len, &name_len, &pref_len)
== OPKG_OPK_ERROR) {
return OPKG_OPK_ERROR;
}
name[name_len] = '\0';
pref[pref_len] = '\0';
return OPKG_OPK_OK;
}
int
main()
{
struct opkg_opk_dirent foo = {
.name = "foo",
.parent = NULL,
};
struct opkg_opk_dirent bar = {
.name = "bar",
.parent = &foo,
};
struct opkg_opk_dirent baz = {
.name = "baz",
.parent = &bar,
};
char name[8];
char pref[4];
if (opkg_opk_dirent_name_prefix(&baz, name, sizeof(name),
pref, sizeof(pref)) != OPKG_OPK_OK) {
puts("Error building name parts");
return EXIT_FAILURE;
}
puts(name);
puts(pref);
return EXIT_SUCCESS;
}
|
