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
|
/* MIT License
*
* Copyright (c) 2018 John Schember
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* SPDX-License-Identifier: MIT
*/
#if defined(__MVS__)
# include <strings.h>
#endif
#include "ares_setup.h"
#include "ares.h"
#include "ares_private.h"
void ares__strsplit_free(char **elms, size_t num_elm)
{
size_t i;
if (elms == NULL) {
return;
}
for (i = 0; i < num_elm; i++) {
ares_free(elms[i]);
}
ares_free(elms);
}
char **ares__strsplit_duplicate(char **elms, size_t num_elm)
{
size_t i;
char **out;
if (elms == NULL || num_elm == 0) {
return NULL;
}
out = ares_malloc_zero(sizeof(*elms) * num_elm);
if (out == NULL) {
return NULL;
}
for (i = 0; i < num_elm; i++) {
out[i] = ares_strdup(elms[i]);
if (out[i] == NULL) {
ares__strsplit_free(out, num_elm);
return NULL;
}
}
return out;
}
char **ares__strsplit(const char *in, const char *delms, size_t *num_elm)
{
ares_status_t status;
ares__buf_t *buf = NULL;
ares__llist_t *llist = NULL;
ares__llist_node_t *node;
char **out = NULL;
size_t cnt = 0;
size_t idx = 0;
if (in == NULL || delms == NULL || num_elm == NULL) {
return NULL;
}
*num_elm = 0;
buf = ares__buf_create_const((const unsigned char *)in, ares_strlen(in));
if (buf == NULL) {
return NULL;
}
status = ares__buf_split(
buf, (const unsigned char *)delms, ares_strlen(delms),
ARES_BUF_SPLIT_NO_DUPLICATES | ARES_BUF_SPLIT_CASE_INSENSITIVE, 0, &llist);
if (status != ARES_SUCCESS) {
goto done;
}
cnt = ares__llist_len(llist);
if (cnt == 0) {
status = ARES_EFORMERR;
goto done;
}
out = ares_malloc_zero(cnt * sizeof(*out));
if (out == NULL) {
status = ARES_ENOMEM;
goto done;
}
for (node = ares__llist_node_first(llist); node != NULL;
node = ares__llist_node_next(node)) {
ares__buf_t *val = ares__llist_node_val(node);
char *temp = NULL;
status = ares__buf_fetch_str_dup(val, ares__buf_len(val), &temp);
if (status != ARES_SUCCESS) {
goto done;
}
out[idx++] = temp;
}
*num_elm = cnt;
status = ARES_SUCCESS;
done:
ares__llist_destroy(llist);
ares__buf_destroy(buf);
if (status != ARES_SUCCESS) {
ares__strsplit_free(out, cnt);
out = NULL;
}
return out;
}
|
