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.

201 lines
5.1KB

  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 *av_dict_get(const AVDictionary *m, const char *key,
  34. const AVDictionaryEntry *prev, int flags)
  35. {
  36. unsigned int i, j;
  37. if (!m)
  38. return NULL;
  39. if (prev)
  40. i = prev - m->elems + 1;
  41. else
  42. i = 0;
  43. for (; i < m->count; i++) {
  44. const char *s = m->elems[i].key;
  45. if (flags & AV_DICT_MATCH_CASE)
  46. for (j = 0; s[j] == key[j] && key[j]; j++)
  47. ;
  48. else
  49. for (j = 0; av_toupper(s[j]) == av_toupper(key[j]) && key[j]; j++)
  50. ;
  51. if (key[j])
  52. continue;
  53. if (s[j] && !(flags & AV_DICT_IGNORE_SUFFIX))
  54. continue;
  55. return &m->elems[i];
  56. }
  57. return NULL;
  58. }
  59. int av_dict_set(AVDictionary **pm, const char *key, const char *value,
  60. int flags)
  61. {
  62. AVDictionary *m = *pm;
  63. AVDictionaryEntry *tag = av_dict_get(m, key, NULL, flags);
  64. char *oldval = NULL;
  65. int allocated = !!m;
  66. if (!m)
  67. m = *pm = av_mallocz(sizeof(*m));
  68. if (!m)
  69. return AVERROR(ENOMEM);
  70. if (tag) {
  71. if (flags & AV_DICT_DONT_OVERWRITE) {
  72. if (flags & AV_DICT_DONT_STRDUP_KEY) av_free(key);
  73. if (flags & AV_DICT_DONT_STRDUP_VAL) av_free(value);
  74. return 0;
  75. }
  76. if (flags & AV_DICT_APPEND)
  77. oldval = tag->value;
  78. else
  79. av_free(tag->value);
  80. av_free(tag->key);
  81. *tag = m->elems[--m->count];
  82. } else {
  83. int ret = av_reallocp_array(&m->elems,
  84. m->count + 1, sizeof(*m->elems));
  85. if (ret < 0) {
  86. if (allocated)
  87. av_freep(pm);
  88. return ret;
  89. }
  90. }
  91. if (value) {
  92. if (flags & AV_DICT_DONT_STRDUP_KEY)
  93. m->elems[m->count].key = key;
  94. else
  95. m->elems[m->count].key = av_strdup(key);
  96. if (flags & AV_DICT_DONT_STRDUP_VAL) {
  97. m->elems[m->count].value = value;
  98. } else if (oldval && flags & AV_DICT_APPEND) {
  99. int len = strlen(oldval) + strlen(value) + 1;
  100. if (!(oldval = av_realloc(oldval, len)))
  101. return AVERROR(ENOMEM);
  102. av_strlcat(oldval, value, len);
  103. m->elems[m->count].value = oldval;
  104. } else
  105. m->elems[m->count].value = av_strdup(value);
  106. m->count++;
  107. }
  108. if (!m->count) {
  109. av_free(m->elems);
  110. av_freep(pm);
  111. }
  112. return 0;
  113. }
  114. static int parse_key_value_pair(AVDictionary **pm, const char **buf,
  115. const char *key_val_sep, const char *pairs_sep,
  116. int flags)
  117. {
  118. char *key = av_get_token(buf, key_val_sep);
  119. char *val = NULL;
  120. int ret;
  121. if (key && *key && strspn(*buf, key_val_sep)) {
  122. (*buf)++;
  123. val = av_get_token(buf, pairs_sep);
  124. }
  125. if (key && *key && val && *val)
  126. ret = av_dict_set(pm, key, val, flags);
  127. else
  128. ret = AVERROR(EINVAL);
  129. av_freep(&key);
  130. av_freep(&val);
  131. return ret;
  132. }
  133. int av_dict_parse_string(AVDictionary **pm, const char *str,
  134. const char *key_val_sep, const char *pairs_sep,
  135. int flags)
  136. {
  137. int ret;
  138. if (!str)
  139. return 0;
  140. /* ignore STRDUP flags */
  141. flags &= ~(AV_DICT_DONT_STRDUP_KEY | AV_DICT_DONT_STRDUP_VAL);
  142. while (*str) {
  143. if ((ret = parse_key_value_pair(pm, &str, key_val_sep, pairs_sep, flags)) < 0)
  144. return ret;
  145. if (*str)
  146. str++;
  147. }
  148. return 0;
  149. }
  150. void av_dict_free(AVDictionary **pm)
  151. {
  152. AVDictionary *m = *pm;
  153. if (m) {
  154. while (m->count--) {
  155. av_free(m->elems[m->count].key);
  156. av_free(m->elems[m->count].value);
  157. }
  158. av_free(m->elems);
  159. }
  160. av_freep(pm);
  161. }
  162. int av_dict_copy(AVDictionary **dst, const AVDictionary *src, int flags)
  163. {
  164. AVDictionaryEntry *t = NULL;
  165. while ((t = av_dict_get(src, "", t, AV_DICT_IGNORE_SUFFIX))) {
  166. int ret = av_dict_set(dst, t->key, t->value, flags);
  167. if (ret < 0)
  168. return ret;
  169. }
  170. return 0;
  171. }