proplist: Change proplist_name_valid() to be public function pa_proplist_key_valid().
[pulseaudio-raopUDP/pulseaudio-raop-alac.git] / src / pulse / proplist.c
blob2c197bccc0cf749887574c2c0632f5c0729c3241
1 /***
2 This file is part of PulseAudio.
4 Copyright 2007 Lennart Poettering
6 PulseAudio is free software; you can redistribute it and/or modify
7 it 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 PulseAudio is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with PulseAudio; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
19 USA.
20 ***/
22 #ifdef HAVE_CONFIG_H
23 #include <config.h>
24 #endif
26 #include <string.h>
27 #include <ctype.h>
29 #include <pulse/xmalloc.h>
30 #include <pulse/utf8.h>
32 #include <pulsecore/hashmap.h>
33 #include <pulsecore/strbuf.h>
34 #include <pulsecore/core-util.h>
36 #include "proplist.h"
38 struct property {
39 char *key;
40 void *value;
41 size_t nbytes;
44 #define MAKE_HASHMAP(p) ((pa_hashmap*) (p))
45 #define MAKE_PROPLIST(p) ((pa_proplist*) (p))
47 int pa_proplist_key_valid(const char *key) {
49 if (!pa_ascii_valid(key))
50 return 0;
52 if (strlen(key) <= 0)
53 return 0;
55 return 1;
58 static void property_free(struct property *prop) {
59 pa_assert(prop);
61 pa_xfree(prop->key);
62 pa_xfree(prop->value);
63 pa_xfree(prop);
66 pa_proplist* pa_proplist_new(void) {
67 return MAKE_PROPLIST(pa_hashmap_new(pa_idxset_string_hash_func, pa_idxset_string_compare_func));
70 void pa_proplist_free(pa_proplist* p) {
71 pa_assert(p);
73 pa_proplist_clear(p);
74 pa_hashmap_free(MAKE_HASHMAP(p), NULL, NULL);
77 /** Will accept only valid UTF-8 */
78 int pa_proplist_sets(pa_proplist *p, const char *key, const char *value) {
79 struct property *prop;
80 pa_bool_t add = FALSE;
82 pa_assert(p);
83 pa_assert(key);
84 pa_assert(value);
86 if (!pa_proplist_key_valid(key) || !pa_utf8_valid(value))
87 return -1;
89 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), key))) {
90 prop = pa_xnew(struct property, 1);
91 prop->key = pa_xstrdup(key);
92 add = TRUE;
93 } else
94 pa_xfree(prop->value);
96 prop->value = pa_xstrdup(value);
97 prop->nbytes = strlen(value)+1;
99 if (add)
100 pa_hashmap_put(MAKE_HASHMAP(p), prop->key, prop);
102 return 0;
105 /** Will accept only valid UTF-8 */
106 static int proplist_setn(pa_proplist *p, const char *key, size_t key_length, const char *value, size_t value_length) {
107 struct property *prop;
108 pa_bool_t add = FALSE;
109 char *k, *v;
111 pa_assert(p);
112 pa_assert(key);
113 pa_assert(value);
115 k = pa_xstrndup(key, key_length);
116 v = pa_xstrndup(value, value_length);
118 if (!pa_proplist_key_valid(k) || !pa_utf8_valid(v)) {
119 pa_xfree(k);
120 pa_xfree(v);
121 return -1;
124 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), k))) {
125 prop = pa_xnew(struct property, 1);
126 prop->key = k;
127 add = TRUE;
128 } else {
129 pa_xfree(prop->value);
130 pa_xfree(k);
133 prop->value = v;
134 prop->nbytes = strlen(v)+1;
136 if (add)
137 pa_hashmap_put(MAKE_HASHMAP(p), prop->key, prop);
139 return 0;
142 /** Will accept only valid UTF-8 */
143 int pa_proplist_setp(pa_proplist *p, const char *pair) {
144 const char *t;
146 pa_assert(p);
147 pa_assert(pair);
149 if (!(t = strchr(pair, '=')))
150 return -1;
152 return proplist_setn(p,
153 pair, t - pair,
154 t + 1, strchr(pair, 0) - t - 1);
157 static int proplist_sethex(pa_proplist *p, const char *key, size_t key_length, const char *value, size_t value_length) {
158 struct property *prop;
159 pa_bool_t add = FALSE;
160 char *k, *v;
161 uint8_t *d;
162 size_t dn;
164 pa_assert(p);
165 pa_assert(key);
166 pa_assert(value);
168 k = pa_xstrndup(key, key_length);
170 if (!pa_proplist_key_valid(k)) {
171 pa_xfree(k);
172 return -1;
175 v = pa_xstrndup(value, value_length);
176 d = pa_xmalloc(value_length*2+1);
178 if ((dn = pa_parsehex(v, d, value_length*2)) == (size_t) -1) {
179 pa_xfree(k);
180 pa_xfree(v);
181 pa_xfree(d);
182 return -1;
185 pa_xfree(v);
187 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), k))) {
188 prop = pa_xnew(struct property, 1);
189 prop->key = k;
190 add = TRUE;
191 } else {
192 pa_xfree(prop->value);
193 pa_xfree(k);
196 d[dn] = 0;
197 prop->value = d;
198 prop->nbytes = dn;
200 if (add)
201 pa_hashmap_put(MAKE_HASHMAP(p), prop->key, prop);
203 return 0;
206 /** Will accept only valid UTF-8 */
207 int pa_proplist_setf(pa_proplist *p, const char *key, const char *format, ...) {
208 struct property *prop;
209 pa_bool_t add = FALSE;
210 va_list ap;
211 char *v;
213 pa_assert(p);
214 pa_assert(key);
215 pa_assert(format);
217 if (!pa_proplist_key_valid(key) || !pa_utf8_valid(format))
218 return -1;
220 va_start(ap, format);
221 v = pa_vsprintf_malloc(format, ap);
222 va_end(ap);
224 if (!pa_utf8_valid(v))
225 goto fail;
227 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), key))) {
228 prop = pa_xnew(struct property, 1);
229 prop->key = pa_xstrdup(key);
230 add = TRUE;
231 } else
232 pa_xfree(prop->value);
234 prop->value = v;
235 prop->nbytes = strlen(v)+1;
237 if (add)
238 pa_hashmap_put(MAKE_HASHMAP(p), prop->key, prop);
240 return 0;
242 fail:
243 pa_xfree(v);
244 return -1;
247 int pa_proplist_set(pa_proplist *p, const char *key, const void *data, size_t nbytes) {
248 struct property *prop;
249 pa_bool_t add = FALSE;
251 pa_assert(p);
252 pa_assert(key);
253 pa_assert(data || nbytes == 0);
255 if (!pa_proplist_key_valid(key))
256 return -1;
258 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), key))) {
259 prop = pa_xnew(struct property, 1);
260 prop->key = pa_xstrdup(key);
261 add = TRUE;
262 } else
263 pa_xfree(prop->value);
265 prop->value = pa_xmalloc(nbytes+1);
266 if (nbytes > 0)
267 memcpy(prop->value, data, nbytes);
268 ((char*) prop->value)[nbytes] = 0;
269 prop->nbytes = nbytes;
271 if (add)
272 pa_hashmap_put(MAKE_HASHMAP(p), prop->key, prop);
274 return 0;
277 const char *pa_proplist_gets(pa_proplist *p, const char *key) {
278 struct property *prop;
280 pa_assert(p);
281 pa_assert(key);
283 if (!pa_proplist_key_valid(key))
284 return NULL;
286 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), key)))
287 return NULL;
289 if (prop->nbytes <= 0)
290 return NULL;
292 if (((char*) prop->value)[prop->nbytes-1] != 0)
293 return NULL;
295 if (strlen((char*) prop->value) != prop->nbytes-1)
296 return NULL;
298 if (!pa_utf8_valid((char*) prop->value))
299 return NULL;
301 return (char*) prop->value;
304 int pa_proplist_get(pa_proplist *p, const char *key, const void **data, size_t *nbytes) {
305 struct property *prop;
307 pa_assert(p);
308 pa_assert(key);
309 pa_assert(data);
310 pa_assert(nbytes);
312 if (!pa_proplist_key_valid(key))
313 return -1;
315 if (!(prop = pa_hashmap_get(MAKE_HASHMAP(p), key)))
316 return -1;
318 *data = prop->value;
319 *nbytes = prop->nbytes;
321 return 0;
324 void pa_proplist_update(pa_proplist *p, pa_update_mode_t mode, const pa_proplist *other) {
325 struct property *prop;
326 void *state = NULL;
328 pa_assert(p);
329 pa_assert(mode == PA_UPDATE_SET || mode == PA_UPDATE_MERGE || mode == PA_UPDATE_REPLACE);
330 pa_assert(other);
332 if (mode == PA_UPDATE_SET)
333 pa_proplist_clear(p);
335 /* MAKE_HASHMAP turns the const pointer into a non-const pointer, but
336 * that's ok, because we don't modify the hashmap contents. */
337 while ((prop = pa_hashmap_iterate(MAKE_HASHMAP(other), &state, NULL))) {
339 if (mode == PA_UPDATE_MERGE && pa_proplist_contains(p, prop->key))
340 continue;
342 pa_assert_se(pa_proplist_set(p, prop->key, prop->value, prop->nbytes) == 0);
346 int pa_proplist_unset(pa_proplist *p, const char *key) {
347 struct property *prop;
349 pa_assert(p);
350 pa_assert(key);
352 if (!pa_proplist_key_valid(key))
353 return -1;
355 if (!(prop = pa_hashmap_remove(MAKE_HASHMAP(p), key)))
356 return -2;
358 property_free(prop);
359 return 0;
362 int pa_proplist_unset_many(pa_proplist *p, const char * const keys[]) {
363 const char * const * k;
364 int n = 0;
366 pa_assert(p);
367 pa_assert(keys);
369 for (k = keys; *k; k++)
370 if (!pa_proplist_key_valid(*k))
371 return -1;
373 for (k = keys; *k; k++)
374 if (pa_proplist_unset(p, *k) >= 0)
375 n++;
377 return n;
380 const char *pa_proplist_iterate(pa_proplist *p, void **state) {
381 struct property *prop;
383 if (!(prop = pa_hashmap_iterate(MAKE_HASHMAP(p), state, NULL)))
384 return NULL;
386 return prop->key;
389 char *pa_proplist_to_string_sep(pa_proplist *p, const char *sep) {
390 const char *key;
391 void *state = NULL;
392 pa_strbuf *buf;
394 pa_assert(p);
395 pa_assert(sep);
397 buf = pa_strbuf_new();
399 while ((key = pa_proplist_iterate(p, &state))) {
400 const char *v;
402 if (!pa_strbuf_isempty(buf))
403 pa_strbuf_puts(buf, sep);
405 if ((v = pa_proplist_gets(p, key))) {
406 const char *t;
408 pa_strbuf_printf(buf, "%s = \"", key);
410 for (t = v;;) {
411 size_t h;
413 h = strcspn(t, "\"");
415 if (h > 0)
416 pa_strbuf_putsn(buf, t, h);
418 t += h;
420 if (*t == 0)
421 break;
423 pa_assert(*t == '"');
424 pa_strbuf_puts(buf, "\\\"");
426 t++;
429 pa_strbuf_puts(buf, "\"");
430 } else {
431 const void *value;
432 size_t nbytes;
433 char *c;
435 pa_assert_se(pa_proplist_get(p, key, &value, &nbytes) == 0);
436 c = pa_xmalloc(nbytes*2+1);
437 pa_hexstr((const uint8_t*) value, nbytes, c, nbytes*2+1);
439 pa_strbuf_printf(buf, "%s = hex:%s", key, c);
440 pa_xfree(c);
444 return pa_strbuf_tostring_free(buf);
447 char *pa_proplist_to_string(pa_proplist *p) {
448 char *s, *t;
450 s = pa_proplist_to_string_sep(p, "\n");
451 t = pa_sprintf_malloc("%s\n", s);
452 pa_xfree(s);
454 return t;
457 pa_proplist *pa_proplist_from_string(const char *s) {
458 enum {
459 WHITESPACE,
460 KEY,
461 AFTER_KEY,
462 VALUE_START,
463 VALUE_SIMPLE,
464 VALUE_DOUBLE_QUOTES,
465 VALUE_DOUBLE_QUOTES_ESCAPE,
466 VALUE_TICKS,
467 VALUE_TICKS_ESCAPED,
468 VALUE_HEX
469 } state;
471 pa_proplist *pl;
472 const char *p, *key = NULL, *value = NULL;
473 size_t key_len = 0, value_len = 0;
475 pa_assert(s);
477 pl = pa_proplist_new();
479 state = WHITESPACE;
481 for (p = s;; p++) {
482 switch (state) {
484 case WHITESPACE:
485 if (*p == 0)
486 goto success;
487 else if (*p == '=')
488 goto fail;
489 else if (!isspace(*p)) {
490 key = p;
491 state = KEY;
492 key_len = 1;
494 break;
496 case KEY:
497 if (*p == 0)
498 goto fail;
499 else if (*p == '=')
500 state = VALUE_START;
501 else if (isspace(*p))
502 state = AFTER_KEY;
503 else
504 key_len++;
505 break;
507 case AFTER_KEY:
508 if (*p == 0)
509 goto fail;
510 else if (*p == '=')
511 state = VALUE_START;
512 else if (!isspace(*p))
513 goto fail;
514 break;
516 case VALUE_START:
517 if (*p == 0)
518 goto fail;
519 else if (strncmp(p, "hex:", 4) == 0) {
520 state = VALUE_HEX;
521 value = p+4;
522 value_len = 0;
523 p += 3;
524 } else if (*p == '\'') {
525 state = VALUE_TICKS;
526 value = p+1;
527 value_len = 0;
528 } else if (*p == '"') {
529 state = VALUE_DOUBLE_QUOTES;
530 value = p+1;
531 value_len = 0;
532 } else if (!isspace(*p)) {
533 state = VALUE_SIMPLE;
534 value = p;
535 value_len = 1;
537 break;
539 case VALUE_SIMPLE:
540 if (*p == 0 || isspace(*p)) {
541 if (proplist_setn(pl, key, key_len, value, value_len) < 0)
542 goto fail;
544 if (*p == 0)
545 goto success;
547 state = WHITESPACE;
548 } else
549 value_len++;
550 break;
552 case VALUE_DOUBLE_QUOTES:
553 if (*p == 0)
554 goto fail;
555 else if (*p == '"') {
556 char *v;
558 v = pa_unescape(pa_xstrndup(value, value_len));
560 if (proplist_setn(pl, key, key_len, v, strlen(v)) < 0) {
561 pa_xfree(v);
562 goto fail;
565 pa_xfree(v);
566 state = WHITESPACE;
567 } else if (*p == '\\') {
568 state = VALUE_DOUBLE_QUOTES_ESCAPE;
569 value_len++;
570 } else
571 value_len++;
572 break;
574 case VALUE_DOUBLE_QUOTES_ESCAPE:
575 if (*p == 0)
576 goto fail;
577 else {
578 state = VALUE_DOUBLE_QUOTES;
579 value_len++;
581 break;
583 case VALUE_TICKS:
584 if (*p == 0)
585 goto fail;
586 else if (*p == '\'') {
587 char *v;
589 v = pa_unescape(pa_xstrndup(value, value_len));
591 if (proplist_setn(pl, key, key_len, v, strlen(v)) < 0) {
592 pa_xfree(v);
593 goto fail;
596 pa_xfree(v);
597 state = WHITESPACE;
598 } else if (*p == '\\') {
599 state = VALUE_TICKS_ESCAPED;
600 value_len++;
601 } else
602 value_len++;
603 break;
605 case VALUE_TICKS_ESCAPED:
606 if (*p == 0)
607 goto fail;
608 else {
609 state = VALUE_TICKS;
610 value_len++;
612 break;
614 case VALUE_HEX:
615 if ((*p >= '0' && *p <= '9') ||
616 (*p >= 'A' && *p <= 'F') ||
617 (*p >= 'a' && *p <= 'f')) {
618 value_len++;
619 } else if (*p == 0 || isspace(*p)) {
621 if (proplist_sethex(pl, key, key_len, value, value_len) < 0)
622 goto fail;
624 if (*p == 0)
625 goto success;
627 state = WHITESPACE;
628 } else
629 goto fail;
630 break;
634 success:
635 return MAKE_PROPLIST(pl);
637 fail:
638 pa_proplist_free(pl);
639 return NULL;
642 int pa_proplist_contains(pa_proplist *p, const char *key) {
643 pa_assert(p);
644 pa_assert(key);
646 if (!pa_proplist_key_valid(key))
647 return -1;
649 if (!(pa_hashmap_get(MAKE_HASHMAP(p), key)))
650 return 0;
652 return 1;
655 void pa_proplist_clear(pa_proplist *p) {
656 struct property *prop;
657 pa_assert(p);
659 while ((prop = pa_hashmap_steal_first(MAKE_HASHMAP(p))))
660 property_free(prop);
663 pa_proplist* pa_proplist_copy(const pa_proplist *p) {
664 pa_proplist *copy;
666 pa_assert_se(copy = pa_proplist_new());
668 if (p)
669 pa_proplist_update(copy, PA_UPDATE_REPLACE, p);
671 return copy;
674 unsigned pa_proplist_size(pa_proplist *p) {
675 pa_assert(p);
677 return pa_hashmap_size(MAKE_HASHMAP(p));
680 int pa_proplist_isempty(pa_proplist *p) {
681 pa_assert(p);
683 return pa_hashmap_isempty(MAKE_HASHMAP(p));
686 int pa_proplist_equal(pa_proplist *a, pa_proplist *b) {
687 const void *key = NULL;
688 struct property *a_prop = NULL;
689 struct property *b_prop = NULL;
690 void *state = NULL;
692 pa_assert(a);
693 pa_assert(b);
695 if (a == b)
696 return 1;
698 if (pa_proplist_size(a) != pa_proplist_size(b))
699 return 0;
701 while ((a_prop = pa_hashmap_iterate(MAKE_HASHMAP(a), &state, &key))) {
702 if (!(b_prop = pa_hashmap_get(MAKE_HASHMAP(b), key)))
703 return 0;
705 if (a_prop->nbytes != b_prop->nbytes)
706 return 0;
708 if (memcmp(a_prop->value, b_prop->value, a_prop->nbytes) != 0)
709 return 0;
712 return 1;