You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

180 lines
4.7KB

  1. /*
  2. * copyright (c) 2009 Michael Niedermayer
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * Libav is distributed in the hope that it will be useful,
  12. * but 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.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with Libav; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #include <string.h>
  21. #include "avstring.h"
  22. #include "dict.h"
  23. #include "internal.h"
  24. #include "mem.h"
  25. struct AVDictionary {
  26. int count;
  27. AVDictionaryEntry *elems;
  28. };
  29. int av_dict_count(const AVDictionary *m)
  30. {
  31. return m ? m->count : 0;
  32. }
  33. AVDictionaryEntry *
  34. av_dict_get(AVDictionary *m, const char *key, const AVDictionaryEntry *prev, int flags)
  35. {
  36. unsigned int i, j;
  37. if(!m)
  38. return NULL;
  39. if(prev) i= prev - m->elems + 1;
  40. else i= 0;
  41. for(; i<m->count; i++){
  42. const char *s= m->elems[i].key;
  43. if(flags & AV_DICT_MATCH_CASE) for(j=0; s[j] == key[j] && key[j]; j++);
  44. else for(j=0; av_toupper(s[j]) == av_toupper(key[j]) && key[j]; j++);
  45. if(key[j])
  46. continue;
  47. if(s[j] && !(flags & AV_DICT_IGNORE_SUFFIX))
  48. continue;
  49. return &m->elems[i];
  50. }
  51. return NULL;
  52. }
  53. int av_dict_set(AVDictionary **pm, const char *key, const char *value, int flags)
  54. {
  55. AVDictionary *m = *pm;
  56. AVDictionaryEntry *tag = av_dict_get(m, key, NULL, flags);
  57. char *oldval = NULL;
  58. if(!m)
  59. m = *pm = av_mallocz(sizeof(*m));
  60. if(tag) {
  61. if (flags & AV_DICT_DONT_OVERWRITE)
  62. return 0;
  63. if (flags & AV_DICT_APPEND)
  64. oldval = tag->value;
  65. else
  66. av_free(tag->value);
  67. av_free(tag->key);
  68. *tag = m->elems[--m->count];
  69. } else {
  70. AVDictionaryEntry *tmp = av_realloc(m->elems, (m->count+1) * sizeof(*m->elems));
  71. if(tmp) {
  72. m->elems = tmp;
  73. } else
  74. return AVERROR(ENOMEM);
  75. }
  76. if (value) {
  77. if (flags & AV_DICT_DONT_STRDUP_KEY) {
  78. m->elems[m->count].key = key;
  79. } else
  80. m->elems[m->count].key = av_strdup(key );
  81. if (flags & AV_DICT_DONT_STRDUP_VAL) {
  82. m->elems[m->count].value = value;
  83. } else if (oldval && flags & AV_DICT_APPEND) {
  84. int len = strlen(oldval) + strlen(value) + 1;
  85. if (!(oldval = av_realloc(oldval, len)))
  86. return AVERROR(ENOMEM);
  87. av_strlcat(oldval, value, len);
  88. m->elems[m->count].value = oldval;
  89. } else
  90. m->elems[m->count].value = av_strdup(value);
  91. m->count++;
  92. }
  93. if (!m->count) {
  94. av_free(m->elems);
  95. av_freep(pm);
  96. }
  97. return 0;
  98. }
  99. static int parse_key_value_pair(AVDictionary **pm, const char **buf,
  100. const char *key_val_sep, const char *pairs_sep,
  101. int flags)
  102. {
  103. char *key = av_get_token(buf, key_val_sep);
  104. char *val = NULL;
  105. int ret;
  106. if (key && *key && strspn(*buf, key_val_sep)) {
  107. (*buf)++;
  108. val = av_get_token(buf, pairs_sep);
  109. }
  110. if (key && *key && val && *val)
  111. ret = av_dict_set(pm, key, val, flags);
  112. else
  113. ret = AVERROR(EINVAL);
  114. av_freep(&key);
  115. av_freep(&val);
  116. return ret;
  117. }
  118. int av_dict_parse_string(AVDictionary **pm, const char *str,
  119. const char *key_val_sep, const char *pairs_sep,
  120. int flags)
  121. {
  122. int ret;
  123. if (!str)
  124. return 0;
  125. /* ignore STRDUP flags */
  126. flags &= ~(AV_DICT_DONT_STRDUP_KEY | AV_DICT_DONT_STRDUP_VAL);
  127. while (*str) {
  128. if ((ret = parse_key_value_pair(pm, &str, key_val_sep, pairs_sep, flags)) < 0)
  129. return ret;
  130. if (*str)
  131. str++;
  132. }
  133. return 0;
  134. }
  135. void av_dict_free(AVDictionary **pm)
  136. {
  137. AVDictionary *m = *pm;
  138. if (m) {
  139. while(m->count--) {
  140. av_free(m->elems[m->count].key);
  141. av_free(m->elems[m->count].value);
  142. }
  143. av_free(m->elems);
  144. }
  145. av_freep(pm);
  146. }
  147. void av_dict_copy(AVDictionary **dst, AVDictionary *src, int flags)
  148. {
  149. AVDictionaryEntry *t = NULL;
  150. while ((t = av_dict_get(src, "", t, AV_DICT_IGNORE_SUFFIX)))
  151. av_dict_set(dst, t->key, t->value, flags);
  152. }