cutils.c 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  1. /*
  2. * Various simple utilities for ffmpeg system
  3. * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #include "avformat.h"
  22. #include "internal.h"
  23. /* add one element to a dynamic array */
  24. void ff_dynarray_add(intptr_t **tab_ptr, int *nb_ptr, intptr_t elem)
  25. {
  26. /* see similar ffmpeg.c:grow_array() */
  27. int nb, nb_alloc;
  28. intptr_t *tab;
  29. nb = *nb_ptr;
  30. tab = *tab_ptr;
  31. if ((nb & (nb - 1)) == 0) {
  32. if (nb == 0)
  33. nb_alloc = 1;
  34. else
  35. nb_alloc = nb * 2;
  36. tab = av_realloc(tab, nb_alloc * sizeof(intptr_t));
  37. *tab_ptr = tab;
  38. }
  39. tab[nb++] = elem;
  40. *nb_ptr = nb;
  41. }
  42. #define ISLEAP(y) (((y) % 4 == 0) && (((y) % 100) != 0 || ((y) % 400) == 0))
  43. #define LEAPS_COUNT(y) ((y)/4 - (y)/100 + (y)/400)
  44. /* This is our own gmtime_r. It differs from its POSIX counterpart in a
  45. couple of places, though. */
  46. struct tm *brktimegm(time_t secs, struct tm *tm)
  47. {
  48. int days, y, ny, m;
  49. int md[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
  50. days = secs / 86400;
  51. secs %= 86400;
  52. tm->tm_hour = secs / 3600;
  53. tm->tm_min = (secs % 3600) / 60;
  54. tm->tm_sec = secs % 60;
  55. /* oh well, may be someone some day will invent a formula for this stuff */
  56. y = 1970; /* start "guessing" */
  57. while (days > 365) {
  58. ny = (y + days/366);
  59. days -= (ny - y) * 365 + LEAPS_COUNT(ny - 1) - LEAPS_COUNT(y - 1);
  60. y = ny;
  61. }
  62. if (days==365 && !ISLEAP(y)) { days=0; y++; }
  63. md[1] = ISLEAP(y)?29:28;
  64. for (m=0; days >= md[m]; m++)
  65. days -= md[m];
  66. tm->tm_year = y; /* unlike gmtime_r we store complete year here */
  67. tm->tm_mon = m+1; /* unlike gmtime_r tm_mon is from 1 to 12 */
  68. tm->tm_mday = days+1;
  69. return tm;
  70. }