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;
84 if (k > 0) /* Ignore empty strings */
85 r = avahi_string_list_add_arbitrary(r, c, k);
94 void avahi_string_list_free(AvahiStringList *l) {
104 AvahiStringList* avahi_string_list_reverse(AvahiStringList *l) {
105 AvahiStringList *r = NULL, *n;
117 char* avahi_string_list_to_string(AvahiStringList *l) {
122 for (n = l; n; n = n->next) {
129 if (!(t = e = avahi_new(char, s+1)))
132 l = avahi_string_list_reverse(l);
134 for (n = l; n; n = n->next) {
139 strncpy(e, (char*) n->text, n->size);
147 l = avahi_string_list_reverse(l);
154 size_t avahi_string_list_serialize(AvahiStringList *l, void *data, size_t size) {
163 l = avahi_string_list_reverse(l);
166 for (n = l; n; n = n->next) {
179 memcpy(c, n->text, k);
185 l = avahi_string_list_reverse(l);
189 /* Empty lists are treated specially. To comply with
190 * section 6.1 of the DNS-SD spec, we return a single
191 * empty string (i.e. a NUL byte)*/
194 *(uint8_t*) data = 0;
203 for (n = l; n; n = n->next) {
217 int avahi_string_list_equal(const AvahiStringList *a, const AvahiStringList *b) {
226 if (a->size != b->size)
229 if (a->size != 0 && memcmp(a->text, b->text, a->size) != 0)
237 AvahiStringList *avahi_string_list_add_many(AvahiStringList *r, ...) {
241 r = avahi_string_list_add_many_va(r, va);
247 AvahiStringList *avahi_string_list_add_many_va(AvahiStringList *r, va_list va) {
250 while ((txt = va_arg(va, const char*)))
251 r = avahi_string_list_add(r, txt);
256 AvahiStringList *avahi_string_list_new(const char *txt, ...) {
258 AvahiStringList *r = NULL;
261 r = avahi_string_list_add(r, txt);
264 r = avahi_string_list_add_many_va(r, va);
271 AvahiStringList *avahi_string_list_new_va(va_list va) {
272 return avahi_string_list_add_many_va(NULL, va);
275 AvahiStringList *avahi_string_list_copy(const AvahiStringList *l) {
276 AvahiStringList *r = NULL;
278 for (; l; l = l->next)
279 r = avahi_string_list_add_arbitrary(r, l->text, l->size);
281 return avahi_string_list_reverse(r);
284 AvahiStringList *avahi_string_list_new_from_array(const char *array[], int length) {
285 AvahiStringList *r = NULL;
290 for (i = 0; length >= 0 ? i < length : !!array[i]; i++)
291 r = avahi_string_list_add(r, array[i]);
296 unsigned avahi_string_list_length(const AvahiStringList *l) {
299 for (; l; l = l->next)
305 AvahiStringList *avahi_string_list_add_vprintf(AvahiStringList *l, const char *format, va_list va) {
311 if (!(r = avahi_malloc(sizeof(AvahiStringList) + len)))
318 n = vsnprintf((char*) r->text, len+1, format, va);
320 if (n >= 0 && n < (int) len)
328 if (!(nr = avahi_realloc(r, sizeof(AvahiStringList) + len))) {
338 r->size = strlen((char*) r->text);
343 AvahiStringList *avahi_string_list_add_printf(AvahiStringList *l, const char *format, ...) {
348 va_start(va, format);
349 l = avahi_string_list_add_vprintf(l, format, va);
355 AvahiStringList *avahi_string_list_find(AvahiStringList *l, const char *key) {
361 for (; l; l = l->next) {
362 if (strcasecmp((char*) l->text, key) == 0)
365 if (strncasecmp((char*) l->text, key, n) == 0 && l->text[n] == '=')
372 AvahiStringList *avahi_string_list_add_pair(AvahiStringList *l, const char *key, const char *value) {
376 return avahi_string_list_add_printf(l, "%s=%s", key, value);
378 return avahi_string_list_add(l, key);
381 AvahiStringList *avahi_string_list_add_pair_arbitrary(AvahiStringList *l, const char *key, const uint8_t *value, size_t size) {
386 return avahi_string_list_add(l, key);
390 if (!(l = avahi_string_list_add_anonymous(l, n + 1 + size)))
393 memcpy(l->text, key, n);
395 memcpy(l->text + n + 1, value, size);
401 int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, size_t *size) {
407 if (!(e = memchr(l->text, '=', l->size))) {
409 if (!(*key = avahi_strdup((char*) l->text)))
421 if (!(*key = avahi_strndup((char*) l->text, e - (char *) l->text)))
424 e++; /* Advance after '=' */
426 n = l->size - (e - (char*) l->text);
430 if (!(*value = avahi_memdup(e, n+1))) {