update examples to reflect recent API changes (wide area)

[catta] / avahi-common / strlst.c

diff --git a/avahi-common/strlst.c b/avahi-common/strlst.c
index d1e17be35f07899a6e846aff463959cc6eea1a56..04941b4e9d116fe2d88afcfeb0047c8530cbe433 100644 (file)
--- a/avahi-common/strlst.c
+++ b/avahi-common/strlst.c
@@ -27,9 +27,11 @@
 #include <stdarg.h>
 #include <assert.h>
 #include <stdio.h>
+#include <stdlib.h>
 
 #include "strlst.h"
 #include "malloc.h"
+#include "defs.h"
 
 AvahiStringList*avahi_string_list_add_anonymous(AvahiStringList *l, size_t size) {
     AvahiStringList *n;
@@ -80,7 +82,9 @@ AvahiStringList *avahi_string_list_parse(const void* data, size_t size) {
             break;
 
         k = *(c++);
-        r = avahi_string_list_add_arbitrary(r, c, k);
+
+        if (k > 0) /* Ignore empty strings */
+            r = avahi_string_list_add_arbitrary(r, c, k);
         c += k;
 
         size -= 1 + k;
@@ -153,45 +157,64 @@ size_t avahi_string_list_serialize(AvahiStringList *l, void *data, size_t size)
     size_t used = 0;
 
     if (data) {
-        uint8_t *c;
-        AvahiStringList *n;
     
-        assert(data);
-        
-        l = avahi_string_list_reverse(l);
-        c = data;
+        if (l) {
+            uint8_t *c;
+            AvahiStringList *n;
         
-        for (n = l; n; n = n->next) {
-            size_t k;
-            if (size < 1)
-                break;
+            l = avahi_string_list_reverse(l);
+            c = data;
             
-            k = n->size;
-            if (k > 255)
-                k = 255;
-            
-            if (k > size-1)
-                k = size-1;
+            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);
             
-            *(c++) = k;
-            memcpy(c, n->text, k);
-            c += k;
+        } else {
+
+            /* 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;
+            }
             
-            used += 1+ k;
         }
-        
-        l = avahi_string_list_reverse(l);
+            
     } else {
         AvahiStringList *n;
 
-        for (n = l; n; n = n->next) {
-            size_t k;
-        
-            k = n->size;
-            if (k > 255)
-                k = 255;
-            
-            used += 1+k;
+        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;
+            }
         }
     }
 
@@ -381,17 +404,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;
@@ -402,8 +424,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 '=' */
         
@@ -412,7 +435,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;
             }
 
@@ -425,3 +449,41 @@ int avahi_string_list_get_pair(AvahiStringList *l, char **key, char **value, siz
 
     return 0;
 }
+
+AvahiStringList *avahi_string_list_get_next(AvahiStringList *l) {
+    assert(l);
+    return l->next;
+}
+
+uint8_t *avahi_string_list_get_text(AvahiStringList *l) {
+    assert(l);
+    return l->text;
+}
+
+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;
+}