2002-07-25 16:04:20 +00:00
|
|
|
/*
|
|
|
|
* Various simple utilities for ffmpeg system
|
|
|
|
* Copyright (c) 2000, 2001, 2002 Fabrice Bellard
|
|
|
|
*
|
2006-10-07 15:30:46 +00:00
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
2002-07-25 16:04:20 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 15:30:46 +00:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2002-07-25 16:04:20 +00:00
|
|
|
*
|
2006-10-07 15:30:46 +00:00
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
2002-07-25 16:04:20 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2006-10-07 15:30:46 +00:00
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
2006-01-12 22:43:26 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2002-07-25 16:04:20 +00:00
|
|
|
*/
|
|
|
|
#include "avformat.h"
|
|
|
|
|
2003-06-13 14:22:23 +00:00
|
|
|
/* add one element to a dynamic array */
|
|
|
|
void __dynarray_add(unsigned long **tab_ptr, int *nb_ptr, unsigned long elem)
|
|
|
|
{
|
|
|
|
int nb, nb_alloc;
|
|
|
|
unsigned long *tab;
|
|
|
|
|
|
|
|
nb = *nb_ptr;
|
|
|
|
tab = *tab_ptr;
|
|
|
|
if ((nb & (nb - 1)) == 0) {
|
|
|
|
if (nb == 0)
|
|
|
|
nb_alloc = 1;
|
|
|
|
else
|
|
|
|
nb_alloc = nb * 2;
|
|
|
|
tab = av_realloc(tab, nb_alloc * sizeof(unsigned long));
|
|
|
|
*tab_ptr = tab;
|
|
|
|
}
|
|
|
|
tab[nb++] = elem;
|
|
|
|
*nb_ptr = nb;
|
|
|
|
}
|
|
|
|
|
2003-09-08 21:20:55 +00:00
|
|
|
time_t mktimegm(struct tm *tm)
|
|
|
|
{
|
|
|
|
time_t t;
|
|
|
|
|
|
|
|
int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
|
|
|
|
|
|
|
|
if (m < 3) {
|
|
|
|
m += 12;
|
|
|
|
y--;
|
|
|
|
}
|
|
|
|
|
2005-12-17 18:14:38 +00:00
|
|
|
t = 86400 *
|
2003-09-08 21:20:55 +00:00
|
|
|
(d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + y / 400 - 719469);
|
|
|
|
|
|
|
|
t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
|
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
2004-08-18 08:15:07 +00:00
|
|
|
#define ISLEAP(y) (((y) % 4 == 0) && (((y) % 100) != 0 || ((y) % 400) == 0))
|
|
|
|
#define LEAPS_COUNT(y) ((y)/4 - (y)/100 + (y)/400)
|
|
|
|
|
2007-07-02 12:19:26 +00:00
|
|
|
/* This is our own gmtime_r. It differs from its POSIX counterpart in a
|
2004-08-18 08:15:07 +00:00
|
|
|
couple of places, though. */
|
|
|
|
struct tm *brktimegm(time_t secs, struct tm *tm)
|
2005-12-17 18:14:38 +00:00
|
|
|
{
|
2004-08-18 08:15:07 +00:00
|
|
|
int days, y, ny, m;
|
|
|
|
int md[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
|
|
|
|
|
|
|
|
days = secs / 86400;
|
|
|
|
secs %= 86400;
|
|
|
|
tm->tm_hour = secs / 3600;
|
|
|
|
tm->tm_min = (secs % 3600) / 60;
|
|
|
|
tm->tm_sec = secs % 60;
|
|
|
|
|
|
|
|
/* oh well, may be someone some day will invent a formula for this stuff */
|
|
|
|
y = 1970; /* start "guessing" */
|
|
|
|
while (days >= (ISLEAP(y)?366:365)) {
|
2005-12-22 01:10:11 +00:00
|
|
|
ny = (y + days/366);
|
|
|
|
days -= (ny - y) * 365 + LEAPS_COUNT(ny - 1) - LEAPS_COUNT(y - 1);
|
|
|
|
y = ny;
|
2004-08-18 08:15:07 +00:00
|
|
|
}
|
|
|
|
md[1] = ISLEAP(y)?29:28;
|
|
|
|
for (m=0; days >= md[m]; m++)
|
2005-12-22 01:10:11 +00:00
|
|
|
days -= md[m];
|
2004-08-18 08:15:07 +00:00
|
|
|
|
|
|
|
tm->tm_year = y; /* unlike gmtime_r we store complete year here */
|
|
|
|
tm->tm_mon = m+1; /* unlike gmtime_r tm_mon is from 1 to 12 */
|
|
|
|
tm->tm_mday = days+1;
|
|
|
|
|
|
|
|
return tm;
|
|
|
|
}
|
|
|
|
|
2003-09-08 21:20:55 +00:00
|
|
|
/* get a positive number between n_min and n_max, for a maximum length
|
|
|
|
of len_max. Return -1 if error. */
|
|
|
|
static int date_get_num(const char **pp,
|
|
|
|
int n_min, int n_max, int len_max)
|
|
|
|
{
|
|
|
|
int i, val, c;
|
|
|
|
const char *p;
|
|
|
|
|
|
|
|
p = *pp;
|
|
|
|
val = 0;
|
|
|
|
for(i = 0; i < len_max; i++) {
|
|
|
|
c = *p;
|
|
|
|
if (!isdigit(c))
|
|
|
|
break;
|
|
|
|
val = (val * 10) + c - '0';
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
/* no number read ? */
|
|
|
|
if (p == *pp)
|
|
|
|
return -1;
|
|
|
|
if (val < n_min || val > n_max)
|
|
|
|
return -1;
|
|
|
|
*pp = p;
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* small strptime for ffmpeg */
|
2005-12-17 18:14:38 +00:00
|
|
|
const char *small_strptime(const char *p, const char *fmt,
|
2003-09-08 21:20:55 +00:00
|
|
|
struct tm *dt)
|
|
|
|
{
|
|
|
|
int c, val;
|
|
|
|
|
|
|
|
for(;;) {
|
|
|
|
c = *fmt++;
|
|
|
|
if (c == '\0') {
|
|
|
|
return p;
|
|
|
|
} else if (c == '%') {
|
|
|
|
c = *fmt++;
|
|
|
|
switch(c) {
|
|
|
|
case 'H':
|
|
|
|
val = date_get_num(&p, 0, 23, 2);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_hour = val;
|
|
|
|
break;
|
|
|
|
case 'M':
|
|
|
|
val = date_get_num(&p, 0, 59, 2);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_min = val;
|
|
|
|
break;
|
|
|
|
case 'S':
|
|
|
|
val = date_get_num(&p, 0, 59, 2);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_sec = val;
|
|
|
|
break;
|
|
|
|
case 'Y':
|
|
|
|
val = date_get_num(&p, 0, 9999, 4);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_year = val - 1900;
|
|
|
|
break;
|
|
|
|
case 'm':
|
|
|
|
val = date_get_num(&p, 1, 12, 2);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_mon = val - 1;
|
|
|
|
break;
|
|
|
|
case 'd':
|
|
|
|
val = date_get_num(&p, 1, 31, 2);
|
|
|
|
if (val == -1)
|
|
|
|
return NULL;
|
|
|
|
dt->tm_mday = val;
|
|
|
|
break;
|
|
|
|
case '%':
|
|
|
|
goto match;
|
|
|
|
default:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
match:
|
|
|
|
if (c != *p)
|
|
|
|
return NULL;
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|