2 * copyright (c) 2009 Michael Niedermayer <michaelni@gmx.at>
4 * This file is part of FFmpeg.
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.
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.
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
23 #include "libavformat/avformat.h"
24 #include "libavcodec/put_bits.h"
25 #include "libavutil/lfg.h"
26 #include "libavutil/timer.h"
28 #define MAX_FORMATS 1000 //this must be larger than the number of formats
29 static int score_array[MAX_FORMATS];
30 static int64_t time_array[MAX_FORMATS];
31 static int failures = 0;
32 static const char *single_format;
35 #define AV_READ_TIME(x) 0
38 static void probe(AVProbeData *pd, int type, int p, int size)
41 AVInputFormat *fmt = NULL;
43 while ((fmt = av_iformat_next(fmt))) {
44 if (fmt->flags & AVFMT_NOFILE)
46 if (fmt->read_probe &&
47 (!single_format || !strcmp(single_format, fmt->name))
50 int64_t start = AV_READ_TIME();
51 score = fmt->read_probe(pd);
52 time_array[i] += AV_READ_TIME() - start;
53 if (score > score_array[i] && score > AVPROBE_SCORE_MAX / 4) {
54 score_array[i] = score;
56 "Failure of %s probing code with score=%d type=%d p=%X size=%d\n",
57 fmt->name, score, type, p, size);
65 static void print_times(void)
68 AVInputFormat *fmt = NULL;
70 while ((fmt = av_iformat_next(fmt))) {
71 if (fmt->flags & AVFMT_NOFILE)
73 if (time_array[i] > 1000000) {
74 fprintf(stderr, "%12"PRIu64" cycles, %12s\n",
75 time_array[i], fmt->name);
81 static int read_int(char *arg) {
86 ret = strtol(arg, &arg, 0);
92 int main(int argc, char **argv)
94 unsigned int p, i, type, size, retry;
95 AVProbeData pd = { 0 };
98 int retry_count= 4097;
102 for (j = i = 1; i<argc; i++) {
103 if (!strcmp(argv[i], "-f") && i+1<argc && !single_format) {
104 single_format = argv[++i];
105 } else if (read_int(argv[i])>0 && j == 1) {
106 retry_count = read_int(argv[i]);
108 } else if (read_int(argv[i])>0 && j == 2) {
109 max_size = read_int(argv[i]);
112 fprintf(stderr, "probetest [-f <input format>] [<retry_count> [<max_size>]]\n");
117 if (max_size > 1000000000U/8) {
118 fprintf(stderr, "max_size out of bounds\n");
122 if (retry_count > 1000000000U) {
123 fprintf(stderr, "retry_count out of bounds\n");
127 av_lfg_init(&state, 0xdeadbeef);
130 for (size = 1; size < max_size; size *= 2) {
132 pd.buf = av_realloc(pd.buf, size + AVPROBE_PADDING_SIZE);
136 fprintf(stderr, "out of memory\n");
140 memset(pd.buf, 0, size + AVPROBE_PADDING_SIZE);
142 fprintf(stderr, "testing size=%d\n", size);
144 for (retry = 0; retry < retry_count; retry += FFMAX(size, 32)) {
145 for (type = 0; type < 4; type++) {
146 for (p = 0; p < 4096; p++) {
148 init_put_bits(&pb, pd.buf, size);
151 for (i = 0; i < size * 8; i++)
152 put_bits(&pb, 1, (av_lfg_get(&state) & 0xFFFFFFFF) > p << 20);
155 for (i = 0; i < size * 8; i++) {
156 unsigned int p2 = hist ? p & 0x3F : (p >> 6);
157 unsigned int v = (av_lfg_get(&state) & 0xFFFFFFFF) > p2 << 26;
163 for (i = 0; i < size * 8; i++) {
164 unsigned int p2 = (p >> (hist * 3)) & 7;
165 unsigned int v = (av_lfg_get(&state) & 0xFFFFFFFF) > p2 << 29;
167 hist = (2 * hist + v) & 3;
171 for (i = 0; i < size; i++) {
174 c = (av_lfg_get(&state) & 0xFFFFFFFF) >> 24;
175 if (c >= 'a' && c <= 'z' && (p & 1))
177 else if (c >= 'A' && c <= 'Z' && (p & 2))
179 else if (c >= '0' && c <= '9' && (p & 4))
181 else if (c == ' ' && (p & 8))
183 else if (c == 0 && (p & 16))
185 else if (c == 1 && (p & 32))
192 probe(&pd, type, p, size);