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.

111 lines
3.0KB

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