4 This file is part of avahi.
6 avahi is free software; you can redistribute it and/or modify it
7 under the terms of the GNU Lesser General Public License as
8 published by the Free Software Foundation; either version 2.1 of the
9 License, or (at your option) any later version.
11 avahi is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
14 Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with avahi; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
34 AvahiStringList*avahi_string_list_add_anonymous(AvahiStringList *l, size_t size) {
37 if (!(n = avahi_malloc(sizeof(AvahiStringList) + size)))
43 /* NUL terminate strings, just to make sure */
49 AvahiStringList *avahi_string_list_add_arbitrary(AvahiStringList *l, const uint8_t*text, size_t size) {
54 if (!(n = avahi_string_list_add_anonymous(l, size)))
58 memcpy(n->text, text, size);
63 AvahiStringList *avahi_string_list_add(AvahiStringList *l, const char *text) {
66 return avahi_string_list_add_arbitrary(l, (const uint8_t*) text, strlen(text));
69 AvahiStringList *avahi_string_list_parse(const void* data, size_t size) {
70 AvahiStringList *r = NULL;
83 r = avahi_string_list_add_arbitrary(r, c, k);
92 void avahi_string_list_free(AvahiStringList *l) {
102 AvahiStringList* avahi_string_list_reverse(AvahiStringList *l) {
103 AvahiStringList *r = NULL, *n;
115 char* avahi_string_list_to_string(AvahiStringList *l) {
120 for (n = l; n; n = n->next) {
127 if (!(t = e = avahi_new(char, s+1)))
130 l = avahi_string_list_reverse(l);
132 for (n = l; n; n = n->next) {
137 strncpy(e, (char*) n->text, n->size);
145 l = avahi_string_list_reverse(l);
152 size_t avahi_string_list_serialize(AvahiStringList *l, void *data, size_t size) {
161 l = avahi_string_list_reverse(l);
164 for (n = l; n; n = n->next) {
177 memcpy(c, n->text, k);
183 l = avahi_string_list_reverse(l);
187 for (n = l; n; n = n->next) {
201 int avahi_string_list_equal(const AvahiStringList *a, const AvahiStringList *b) {
210 if (a->size != b->size)
213 if (a->size != 0 && memcmp(a->text, b->text, a->size) != 0)
221 AvahiStringList *avahi_string_list_add_many(AvahiStringList *r, ...) {
225 r = avahi_string_list_add_many_va(r, va);
231 AvahiStringList *avahi_string_list_add_many_va(AvahiStringList *r, va_list va) {
234 while ((txt = va_arg(va, const char*)))
235 r = avahi_string_list_add(r, txt);
240 AvahiStringList *avahi_string_list_new(const char *txt, ...) {
242 AvahiStringList *r = NULL;
245 r = avahi_string_list_add(r, txt);
248 r = avahi_string_list_add_many_va(r, va);
255 AvahiStringList *avahi_string_list_new_va(va_list va) {
256 return avahi_string_list_add_many_va(NULL, va);
259 AvahiStringList *avahi_string_list_copy(const AvahiStringList *l) {
260 AvahiStringList *r = NULL;
262 for (; l; l = l->next)
263 r = avahi_string_list_add_arbitrary(r, l->text, l->size);
265 return avahi_string_list_reverse(r);
268 AvahiStringList *avahi_string_list_new_from_array(const char *array[], int length) {
269 AvahiStringList *r = NULL;
274 for (i = 0; length >= 0 ? i < length : !!array[i]; i++)
275 r = avahi_string_list_add(r, array[i]);
280 unsigned avahi_string_list_length(const AvahiStringList *l) {
283 for (; l; l = l->next)
289 AvahiStringList *avahi_string_list_add_vprintf(AvahiStringList *l, const char *format, va_list va) {
295 if (!(r = avahi_malloc(sizeof(AvahiStringList) + len)))
302 n = vsnprintf((char*) r->text, len+1, format, va);
304 if (n >= 0 && n < (int) len)
312 if (!(nr = avahi_realloc(r, sizeof(AvahiStringList) + len))) {
322 r->size = strlen((char*) r->text);
327 AvahiStringList *avahi_string_list_add_printf(AvahiStringList *l, const char *format, ...) {
332 va_start(va, format);
333 l = avahi_string_list_add_vprintf(l, format, va);
339 AvahiStringList *avahi_string_list_find(AvahiStringList *l, const char *key) {
345 for (; l; l = l->next) {
346 if (strcasecmp((char*) l->text, key) == 0)
349 if (strncasecmp((char*) l->text, key, n) == 0 && l->text[n] == '=')
356 AvahiStringList *avahi_string_list_add_pair(AvahiStringList *l, const char *key, const char *value) {
360 return avahi_string_list_add_printf(l, "%s=%s", key, value);
362 return avahi_string_list_add(l, key);
365 AvahiStringList *avahi_string_list_add_pair_arbitrary(AvahiStringList *l, const char *key, const uint8_t *value, size_t size) {
370 return avahi_string_list_add(l, key);
374 if (!(l = avahi_string_list_add_anonymous(l, n + 1 + size)))
377 memcpy(l->text, key, n);
379 memcpy(l->text + n + 1, value, size);
385 int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, size_t *size) {
391 if (!(e = memchr(l->text, '=', l->size))) {
393 if (!(*key = avahi_strdup((char*) l->text)))
405 if (!(*key = avahi_strndup((char*) l->text, e - (char *) l->text)))
408 e++; /* Advance after '=' */
410 n = l->size - (e - (char*) l->text);
414 if (!(*value = avahi_memdup(e, n+1))) {