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.

131 lines
3.6KB

  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 "avstring.h"
  21. #include "dict.h"
  22. #include "internal.h"
  23. #include "mem.h"
  24. struct AVDictionary {
  25. int count;
  26. AVDictionaryEntry *elems;
  27. };
  28. int av_dict_count(const AVDictionary *m)
  29. {
  30. return m ? m->count : 0;
  31. }
  32. AVDictionaryEntry *
  33. av_dict_get(AVDictionary *m, const char *key, const AVDictionaryEntry *prev, int flags)
  34. {
  35. unsigned int i, j;
  36. if(!m)
  37. return NULL;
  38. if(prev) i= prev - m->elems + 1;
  39. else i= 0;
  40. for(; i<m->count; i++){
  41. const char *s= m->elems[i].key;
  42. if(flags & AV_DICT_MATCH_CASE) for(j=0; s[j] == key[j] && key[j]; j++);
  43. else for(j=0; toupper(s[j]) == toupper(key[j]) && key[j]; j++);
  44. if(key[j])
  45. continue;
  46. if(s[j] && !(flags & AV_DICT_IGNORE_SUFFIX))
  47. continue;
  48. return &m->elems[i];
  49. }
  50. return NULL;
  51. }
  52. int av_dict_set(AVDictionary **pm, const char *key, const char *value, int flags)
  53. {
  54. AVDictionary *m = *pm;
  55. AVDictionaryEntry *tag = av_dict_get(m, key, NULL, flags);
  56. char *oldval = NULL;
  57. if(!m)
  58. m = *pm = av_mallocz(sizeof(*m));
  59. if(tag) {
  60. if (flags & AV_DICT_DONT_OVERWRITE)
  61. return 0;
  62. if (flags & AV_DICT_APPEND)
  63. oldval = tag->value;
  64. else
  65. av_free(tag->value);
  66. av_free(tag->key);
  67. *tag = m->elems[--m->count];
  68. } else {
  69. AVDictionaryEntry *tmp = av_realloc(m->elems, (m->count+1) * sizeof(*m->elems));
  70. if(tmp) {
  71. m->elems = tmp;
  72. } else
  73. return AVERROR(ENOMEM);
  74. }
  75. if (value) {
  76. if (flags & AV_DICT_DONT_STRDUP_KEY) {
  77. m->elems[m->count].key = key;
  78. } else
  79. m->elems[m->count].key = av_strdup(key );
  80. if (flags & AV_DICT_DONT_STRDUP_VAL) {
  81. m->elems[m->count].value = value;
  82. } else if (oldval && flags & AV_DICT_APPEND) {
  83. int len = strlen(oldval) + strlen(value) + 1;
  84. if (!(oldval = av_realloc(oldval, len)))
  85. return AVERROR(ENOMEM);
  86. av_strlcat(oldval, value, len);
  87. m->elems[m->count].value = oldval;
  88. } else
  89. m->elems[m->count].value = av_strdup(value);
  90. m->count++;
  91. }
  92. if (!m->count) {
  93. av_free(m->elems);
  94. av_freep(pm);
  95. }
  96. return 0;
  97. }
  98. void av_dict_free(AVDictionary **pm)
  99. {
  100. AVDictionary *m = *pm;
  101. if (m) {
  102. while(m->count--) {
  103. av_free(m->elems[m->count].key);
  104. av_free(m->elems[m->count].value);
  105. }
  106. av_free(m->elems);
  107. }
  108. av_freep(pm);
  109. }
  110. void av_dict_copy(AVDictionary **dst, AVDictionary *src, int flags)
  111. {
  112. AVDictionaryEntry *t = NULL;
  113. while ((t = av_dict_get(src, "", t, AV_DICT_IGNORE_SUFFIX)))
  114. av_dict_set(dst, t->key, t->value, flags);
  115. }