dict.c 3.7 KB

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