X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=avahi-common%2Fstrlst.c;h=c6ceb0f7351670c6c2dc087353fa854dac9009c9;hb=f25465433f0f835a5caccacffe026c2b658c924b;hp=5bde68afe2da0907e7710bfccddb599ca668c0d9;hpb=79ae5a976987130b9b6eb4920e2656d8ef4fe37c;p=catta diff --git a/avahi-common/strlst.c b/avahi-common/strlst.c index 5bde68a..c6ceb0f 100644 --- a/avahi-common/strlst.c +++ b/avahi-common/strlst.c @@ -27,9 +27,11 @@ #include #include #include +#include #include "strlst.h" #include "malloc.h" +#include "defs.h" AvahiStringList*avahi_string_list_add_anonymous(AvahiStringList *l, size_t size) { AvahiStringList *n; @@ -66,29 +68,43 @@ AvahiStringList *avahi_string_list_add(AvahiStringList *l, const char *text) { return avahi_string_list_add_arbitrary(l, (const uint8_t*) text, strlen(text)); } -AvahiStringList *avahi_string_list_parse(const void* data, size_t size) { - AvahiStringList *r = NULL; +int avahi_string_list_parse(const void* data, size_t size, AvahiStringList **ret) { const uint8_t *c; + AvahiStringList *r = NULL; assert(data); + assert(ret); c = data; - for (;;) { + while (size > 0) { size_t k; - if (size < 1) - break; - k = *(c++); + size--; - if (k > 0) /* Ignore empty strings */ - r = avahi_string_list_add_arbitrary(r, c, k); - c += k; + if (k > size) + goto fail; /* Overflow */ + + if (k > 0) { /* Ignore empty strings */ + AvahiStringList *n; + + if (!(n = avahi_string_list_add_arbitrary(r, c, k))) + goto fail; /* OOM */ - size -= 1 + k; + r = n; + } + + c += k; + size -= k; } - return r; + *ret = r; + + return 0; + +fail: + avahi_string_list_free(r); + return -1; } void avahi_string_list_free(AvahiStringList *l) { @@ -155,65 +171,64 @@ size_t avahi_string_list_serialize(AvahiStringList *l, void *data, size_t size) size_t used = 0; if (data) { - - if (l) { - uint8_t *c; - AvahiStringList *n; + AvahiStringList *n; + uint8_t *c; + + l = avahi_string_list_reverse(l); + c = data; - l = avahi_string_list_reverse(l); - c = data; + for (n = l; size > 1 && n; n = n->next) { + size_t k; + + if ((k = n->size) == 0) + /* Skip empty strings */ + continue; - for (n = l; n; n = n->next) { - size_t k; - if (size < 1) - break; - - k = n->size; - if (k > 255) - k = 255; - - if (k > size-1) - k = size-1; - - *(c++) = k; - memcpy(c, n->text, k); - c += k; - - used += 1+ k; - } - - l = avahi_string_list_reverse(l); + if (k > 255) + /* Truncate strings at 255 characters */ + k = 255; - } else { + if (k > size-1) + /* Make sure this string fits in */ + k = size-1; + *(c++) = (uint8_t) k; + memcpy(c, n->text, k); + c += k; + + used += 1 + k; + size -= 1 + k; + } + + l = avahi_string_list_reverse(l); + + if (used == 0 && size > 0) { + /* Empty lists are treated specially. To comply with * section 6.1 of the DNS-SD spec, we return a single * empty string (i.e. a NUL byte)*/ - if (size > 0) { - *(uint8_t*) data = 0; - used = 1; - } - + *(uint8_t*) data = 0; + used = 1; } } else { AvahiStringList *n; - if (!l) - used = 1; - else { - - for (n = l; n; n = n->next) { - size_t k; - - k = n->size; - if (k > 255) - k = 255; - - used += 1+k; - } + for (n = l; n; n = n->next) { + size_t k; + + if ((k = n->size) == 0) + continue; + + if (k > 255) + k = 255; + + used += 1+k; } + + if (used == 0) + used = 1; } return used; @@ -281,7 +296,10 @@ AvahiStringList *avahi_string_list_copy(const AvahiStringList *l) { AvahiStringList *r = NULL; for (; l; l = l->next) - r = avahi_string_list_add_arbitrary(r, l->text, l->size); + if (!(r = avahi_string_list_add_arbitrary(r, l->text, l->size))) { + avahi_string_list_free(r); + return NULL; + } return avahi_string_list_reverse(r); } @@ -402,17 +420,16 @@ AvahiStringList *avahi_string_list_add_pair_arbitrary(AvahiStringList *l, const return l; } - int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, size_t *size) { char *e; assert(l); - assert(key); if (!(e = memchr(l->text, '=', l->size))) { - - if (!(*key = avahi_strdup((char*) l->text))) - return -1; + + if (key) + if (!(*key = avahi_strdup((char*) l->text))) + return -1; if (value) *value = NULL; @@ -423,8 +440,9 @@ int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, siz } else { size_t n; - if (!(*key = avahi_strndup((char*) l->text, e - (char *) l->text))) - return -1; + if (key) + if (!(*key = avahi_strndup((char*) l->text, e - (char *) l->text))) + return -1; e++; /* Advance after '=' */ @@ -433,7 +451,8 @@ int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, siz if (value) { if (!(*value = avahi_memdup(e, n+1))) { - avahi_free(*key); + if (key) + avahi_free(*key); return -1; } @@ -461,3 +480,26 @@ size_t avahi_string_list_get_size(AvahiStringList *l) { assert(l); return l->size; } + +uint32_t avahi_string_list_get_service_cookie(AvahiStringList *l) { + AvahiStringList *f; + char *value = NULL, *end = NULL; + uint32_t ret; + + if (!(f = avahi_string_list_find(l, AVAHI_SERVICE_COOKIE))) + return AVAHI_SERVICE_COOKIE_INVALID; + + if (avahi_string_list_get_pair(f, NULL, &value, NULL) < 0 || !value) + return AVAHI_SERVICE_COOKIE_INVALID; + + ret = (uint32_t) strtoll(value, &end, 0); + + if (*value && end && *end != 0) { + avahi_free(value); + return AVAHI_SERVICE_COOKIE_INVALID; + } + + avahi_free(value); + + return ret; +}