BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file make_name_indices.h |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | */ |
||
29 | |||
30 | #ifndef BADVPN_MAKE_NAME_INDICES_H |
||
31 | #define BADVPN_MAKE_NAME_INDICES_H |
||
32 | |||
33 | #include <stdlib.h> |
||
34 | #include <stddef.h> |
||
35 | |||
36 | #include <misc/strdup.h> |
||
37 | #include <misc/balloc.h> |
||
38 | #include <misc/debug.h> |
||
39 | #include <ncd/NCDStringIndex.h> |
||
40 | |||
41 | static int ncd_make_name_indices (NCDStringIndex *string_index, const char *name, NCD_string_id_t **out_varnames, size_t *out_num_names) WARN_UNUSED; |
||
42 | |||
43 | static size_t split_string_inplace2__indices (char *str, char del) |
||
44 | { |
||
45 | ASSERT(str) |
||
46 | |||
47 | size_t num_extra_parts = 0; |
||
48 | |||
49 | while (*str) { |
||
50 | if (*str == del) { |
||
51 | *str = '\0'; |
||
52 | num_extra_parts++; |
||
53 | } |
||
54 | str++; |
||
55 | } |
||
56 | |||
57 | return num_extra_parts; |
||
58 | } |
||
59 | |||
60 | static int ncd_make_name_indices (NCDStringIndex *string_index, const char *name, NCD_string_id_t **out_varnames, size_t *out_num_names) |
||
61 | { |
||
62 | ASSERT(string_index) |
||
63 | ASSERT(name) |
||
64 | ASSERT(out_varnames) |
||
65 | ASSERT(out_num_names) |
||
66 | |||
67 | char *data = b_strdup(name); |
||
68 | if (!data) { |
||
69 | goto fail0; |
||
70 | } |
||
71 | |||
72 | size_t num_names = split_string_inplace2__indices(data, '.') + 1; |
||
73 | |||
74 | NCD_string_id_t *varnames = BAllocArray(num_names, sizeof(varnames[0])); |
||
75 | if (!varnames) { |
||
76 | goto fail1; |
||
77 | } |
||
78 | |||
79 | char *cur = data; |
||
80 | for (size_t i = 0; i < num_names; i++) { |
||
81 | NCD_string_id_t id = NCDStringIndex_Get(string_index, cur); |
||
82 | if (id < 0) { |
||
83 | goto fail2; |
||
84 | } |
||
85 | |||
86 | varnames[i] = id; |
||
87 | cur += strlen(cur) + 1; |
||
88 | } |
||
89 | |||
90 | free(data); |
||
91 | |||
92 | *out_varnames = varnames; |
||
93 | *out_num_names = num_names; |
||
94 | return 1; |
||
95 | |||
96 | fail2: |
||
97 | BFree(varnames); |
||
98 | fail1: |
||
99 | free(data); |
||
100 | fail0: |
||
101 | return 0; |
||
102 | } |
||
103 | |||
104 | #endif |