]>
Commit | Line | Data |
---|---|---|
1 | #include "git-compat-util.h" | |
2 | #include "strvec.h" | |
3 | #include "strbuf.h" | |
4 | ||
5 | const char *empty_strvec[] = { NULL }; | |
6 | ||
7 | void strvec_init(struct strvec *array) | |
8 | { | |
9 | struct strvec blank = STRVEC_INIT; | |
10 | memcpy(array, &blank, sizeof(*array)); | |
11 | } | |
12 | ||
13 | static void strvec_push_nodup(struct strvec *array, const char *value) | |
14 | { | |
15 | if (array->v == empty_strvec) | |
16 | array->v = NULL; | |
17 | ||
18 | ALLOC_GROW(array->v, array->nr + 2, array->alloc); | |
19 | array->v[array->nr++] = value; | |
20 | array->v[array->nr] = NULL; | |
21 | } | |
22 | ||
23 | const char *strvec_push(struct strvec *array, const char *value) | |
24 | { | |
25 | strvec_push_nodup(array, xstrdup(value)); | |
26 | return array->v[array->nr - 1]; | |
27 | } | |
28 | ||
29 | const char *strvec_pushf(struct strvec *array, const char *fmt, ...) | |
30 | { | |
31 | va_list ap; | |
32 | struct strbuf v = STRBUF_INIT; | |
33 | ||
34 | va_start(ap, fmt); | |
35 | strbuf_vaddf(&v, fmt, ap); | |
36 | va_end(ap); | |
37 | ||
38 | strvec_push_nodup(array, strbuf_detach(&v, NULL)); | |
39 | return array->v[array->nr - 1]; | |
40 | } | |
41 | ||
42 | void strvec_pushl(struct strvec *array, ...) | |
43 | { | |
44 | va_list ap; | |
45 | const char *arg; | |
46 | ||
47 | va_start(ap, array); | |
48 | while ((arg = va_arg(ap, const char *))) | |
49 | strvec_push(array, arg); | |
50 | va_end(ap); | |
51 | } | |
52 | ||
53 | void strvec_pushv(struct strvec *array, const char **items) | |
54 | { | |
55 | for (; *items; items++) | |
56 | strvec_push(array, *items); | |
57 | } | |
58 | ||
59 | const char *strvec_replace(struct strvec *array, size_t idx, const char *replacement) | |
60 | { | |
61 | char *to_free; | |
62 | if (idx >= array->nr) | |
63 | BUG("index outside of array boundary"); | |
64 | to_free = (char *) array->v[idx]; | |
65 | array->v[idx] = xstrdup(replacement); | |
66 | free(to_free); | |
67 | return array->v[idx]; | |
68 | } | |
69 | ||
70 | void strvec_remove(struct strvec *array, size_t idx) | |
71 | { | |
72 | if (idx >= array->nr) | |
73 | BUG("index outside of array boundary"); | |
74 | free((char *)array->v[idx]); | |
75 | memmove(array->v + idx, array->v + idx + 1, (array->nr - idx) * sizeof(char *)); | |
76 | array->nr--; | |
77 | } | |
78 | ||
79 | void strvec_pop(struct strvec *array) | |
80 | { | |
81 | if (!array->nr) | |
82 | return; | |
83 | free((char *)array->v[array->nr - 1]); | |
84 | array->v[array->nr - 1] = NULL; | |
85 | array->nr--; | |
86 | } | |
87 | ||
88 | void strvec_split(struct strvec *array, const char *to_split) | |
89 | { | |
90 | while (isspace(*to_split)) | |
91 | to_split++; | |
92 | for (;;) { | |
93 | const char *p = to_split; | |
94 | ||
95 | if (!*p) | |
96 | break; | |
97 | ||
98 | while (*p && !isspace(*p)) | |
99 | p++; | |
100 | strvec_push_nodup(array, xstrndup(to_split, p - to_split)); | |
101 | ||
102 | while (isspace(*p)) | |
103 | p++; | |
104 | to_split = p; | |
105 | } | |
106 | } | |
107 | ||
108 | void strvec_clear(struct strvec *array) | |
109 | { | |
110 | if (array->v != empty_strvec) { | |
111 | int i; | |
112 | for (i = 0; i < array->nr; i++) | |
113 | free((char *)array->v[i]); | |
114 | free(array->v); | |
115 | } | |
116 | strvec_init(array); | |
117 | } | |
118 | ||
119 | const char **strvec_detach(struct strvec *array) | |
120 | { | |
121 | if (array->v == empty_strvec) | |
122 | return xcalloc(1, sizeof(const char *)); | |
123 | else { | |
124 | const char **ret = array->v; | |
125 | strvec_init(array); | |
126 | return ret; | |
127 | } | |
128 | } |