ui/common/utils.c

changeset 927
b8c0f718b141
child 930
4ce8df2311f0
equal deleted inserted replaced
926:32b16cbca280 927:b8c0f718b141
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2017 Olaf Wintermann. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 #include "utils.h"
30
31 #include <cx/string.h>
32
33 UiPathElm* ui_default_pathelm_func(const char* full_path, size_t len, size_t* ret_nelm, void* data) {
34 cxstring *pathelms;
35 size_t nelm = cx_strsplit_a(cxDefaultAllocator, cx_strn(full_path, len), CX_STR("/"), 4096, &pathelms);
36
37 if (nelm == 0) {
38 *ret_nelm = 0;
39 return NULL;
40 }
41
42 UiPathElm* elms = (UiPathElm*)calloc(nelm, sizeof(UiPathElm));
43 size_t n = nelm;
44 int j = 0;
45 for (int i = 0; i < nelm; i++) {
46 cxstring c = pathelms[i];
47 if (c.length == 0) {
48 if (i == 0) {
49 c.length = 1;
50 }
51 else {
52 n--;
53 continue;
54 }
55 }
56
57 cxmutstr m = cx_strdup(c);
58 elms[j].name = m.ptr;
59 elms[j].name_len = m.length;
60
61 size_t elm_path_len = c.ptr + c.length - full_path;
62 cxmutstr elm_path = cx_strdup(cx_strn(full_path, elm_path_len));
63 elms[j].path = elm_path.ptr;
64 elms[j].path_len = elm_path.length;
65
66 j++;
67 }
68 *ret_nelm = n;
69
70 return elms;
71 }

mercurial