Go to the documentation of this file.
37 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36
51 # define ROT(x, s) (((x) >> (s)) | ((x) << (32-(s))))
53 # define ROT(x, s) (((x) << (s)) | ((x) >> (32-(s))))
82 s0[0].u8[ 0] = box[
s0[1].u8[ 0]];
83 s0[0].u8[ 4] = box[
s0[1].u8[ 4]];
84 s0[0].u8[ 8] = box[
s0[1].u8[ 8]];
85 s0[0].u8[12] = box[
s0[1].u8[12]];
86 s1[0].u8[ 3] = box[
s1[1].u8[ 7]];
87 s1[0].u8[ 7] = box[
s1[1].u8[11]];
88 s1[0].u8[11] = box[
s1[1].u8[15]];
89 s1[0].u8[15] = box[
s1[1].u8[ 3]];
90 s0[0].u8[ 2] = box[
s0[1].u8[10]];
91 s0[0].u8[10] = box[
s0[1].u8[ 2]];
92 s0[0].u8[ 6] = box[
s0[1].u8[14]];
93 s0[0].u8[14] = box[
s0[1].u8[ 6]];
94 s3[0].u8[ 1] = box[
s3[1].u8[13]];
95 s3[0].u8[13] = box[
s3[1].u8[ 9]];
96 s3[0].u8[ 9] = box[
s3[1].u8[ 5]];
97 s3[0].u8[ 5] = box[
s3[1].u8[ 1]];
100 static inline int mix_core(uint32_t multbl[][256],
int a,
int b,
int c,
int d)
103 return multbl[0][
a] ^
ROT(multbl[0][
b], 8) ^
ROT(multbl[0][
c], 16) ^
ROT(multbl[0][d], 24);
105 return multbl[0][
a] ^ multbl[1][
b] ^ multbl[2][
c] ^ multbl[3][d];
119 uint32_t multbl[][256])
123 for (
r =
a->rounds - 1;
r > 0;
r--) {
124 mix(
a->state, multbl, 3 -
s, 1 +
s);
125 addkey(&
a->state[1], &
a->state[0], &
a->round_key[
r]);
139 addkey_d(dst, &
a->state[0], &
a->round_key[0]);
157 addkey_d(dst, &
a->state[0], &
a->round_key[0]);
164 int count,
uint8_t *iv,
int decrypt)
166 a->crypt(
a, dst,
src, count, iv,
a->rounds);
175 for (
i = 0;
i < 256;
i++) {
180 k = alog8[
x + log8[
c[0]]];
181 l = alog8[
x + log8[
c[1]]];
182 m = alog8[
x + log8[
c[2]]];
183 n = alog8[
x + log8[
c[3]]];
186 tbl[1][
i] =
ROT(tbl[0][
i], 8);
187 tbl[2][
i] =
ROT(tbl[0][
i], 16);
188 tbl[3][
i] =
ROT(tbl[0][
i], 24);
197 int i, j, t, rconpointer = 0;
199 int KC = key_bits >> 5;
208 for (
i = 0;
i < 255;
i++) {
209 alog8[
i] = alog8[
i + 255] = j;
215 for (
i = 0;
i < 256;
i++) {
216 j =
i ? alog8[255 - log8[
i]] : 0;
217 j ^= (j << 1) ^ (j << 2) ^ (j << 3) ^ (j << 4);
218 j = (j ^ (j >> 8) ^ 99) & 255;
228 if (key_bits != 128 && key_bits != 192 && key_bits != 256)
233 memcpy(tk,
key, KC * 4);
234 memcpy(
a->round_key[0].u8,
key, KC * 4);
236 for (t = KC * 4; t < (
rounds + 1) * 16; t += KC * 4) {
237 for (
i = 0;
i < 4;
i++)
238 tk[0][
i] ^=
sbox[tk[KC - 1][(
i + 1) & 3]];
239 tk[0][0] ^=
rcon[rconpointer++];
241 for (j = 1; j < KC; j++) {
242 if (KC != 8 || j != KC >> 1)
243 for (
i = 0;
i < 4;
i++)
244 tk[j][
i] ^= tk[j - 1][
i];
246 for (
i = 0;
i < 4;
i++)
247 tk[j][
i] ^=
sbox[tk[j - 1][
i]];
250 memcpy(
a->round_key[0].u8 + t, tk, KC * 4);
256 tmp[2] =
a->round_key[
i];
259 a->round_key[
i] =
tmp[0];
int av_aes_init(AVAES *a, const uint8_t *key, int key_bits, int decrypt)
Initialize an AVAES context.
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
static void aes_crypt(AVAES *a, int s, const uint8_t *sbox, uint32_t multbl[][256])
#define FFSWAP(type, a, b)
#define MKTAG(a, b, c, d)
static void init_multbl2(uint32_t tbl[][256], const int c[4], const uint8_t *log8, const uint8_t *alog8, const uint8_t *sbox)
static uint8_t inv_sbox[256]
FFmpeg Automated Testing Environment ************************************Introduction Using FATE from your FFmpeg source directory Submitting the results to the FFmpeg result aggregation server Uploading new samples to the fate suite FATE makefile targets and variables Makefile targets Makefile variables Examples Introduction **************FATE is an extended regression suite on the client side and a means for results aggregation and presentation on the server side The first part of this document explains how you can use FATE from your FFmpeg source directory to test your ffmpeg binary The second part describes how you can run FATE to submit the results to FFmpeg’s FATE server In any way you can have a look at the publicly viewable FATE results by visiting this as it can be seen if some test on some platform broke with their recent contribution This usually happens on the platforms the developers could not test on The second part of this document describes how you can run FATE to submit your results to FFmpeg’s FATE server If you want to submit your results be sure to check that your combination of OS and compiler is not already listed on the above mentioned website In the third part you can find a comprehensive listing of FATE makefile targets and variables Using FATE from your FFmpeg source directory **********************************************If you want to run FATE on your machine you need to have the samples in place You can get the samples via the build target fate rsync Use this command from the top level source this will cause FATE to fail NOTE To use a custom wrapper to run the pass ‘ target exec’ to ‘configure’ or set the TARGET_EXEC Make variable Submitting the results to the FFmpeg result aggregation server ****************************************************************To submit your results to the server you should run fate through the shell script ‘tests fate sh’ from the FFmpeg sources This script needs to be invoked with a configuration file as its first argument tests fate sh path to fate_config A configuration file template with comments describing the individual configuration variables can be found at ‘doc fate_config sh template’ Create a configuration that suits your based on the configuration template The ‘slot’ configuration variable can be any string that is not yet but it is suggested that you name it adhering to the following pattern ‘ARCH OS COMPILER COMPILER VERSION’ The configuration file itself will be sourced in a shell therefore all shell features may be used This enables you to setup the environment as you need it for your build For your first test runs the ‘fate_recv’ variable should be empty or commented out This will run everything as normal except that it will omit the submission of the results to the server The following files should be present in $workdir as specified in the configuration it may help to try out the ‘ssh’ command with one or more ‘ v’ options You should get detailed output concerning your SSH configuration and the authentication process The only thing left is to automate the execution of the fate sh script and the synchronisation of the samples directory Uploading new samples to the fate suite *****************************************If you need a sample uploaded send a mail to samples request This is for developers who have an account on the fate suite server If you upload new please make sure they are as small as space on each network bandwidth and so on benefit from smaller test cases Also keep in mind older checkouts use existing sample that means in practice generally do not remove or overwrite files as it likely would break older checkouts or releases Also all needed samples for a commit should be ideally before the push If you need an account for frequently uploading samples or you wish to help others by doing that send a mail to ffmpeg devel rsync vauL Duo x
static void addkey(av_aes_block *dst, const av_aes_block *src, const av_aes_block *round_key)
static void addkey_s(av_aes_block *dst, const uint8_t *src, const av_aes_block *round_key)
void * av_mallocz(size_t size)
Allocate a memory block with alignment suitable for all memory accesses (including vectors if availab...
static void mix(av_aes_block state[2], uint32_t multbl[][256], int s1, int s3)
void av_aes_crypt(AVAES *a, uint8_t *dst, const uint8_t *src, int count, uint8_t *iv, int decrypt)
Encrypt or decrypt a buffer using a previously initialized context.
struct AVAES * av_aes_alloc(void)
Allocate an AVAES context.
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
av_aes_block round_key[15]
static void aes_encrypt(AVAES *a, uint8_t *dst, const uint8_t *src, int count, uint8_t *iv, int rounds)
#define MKBETAG(a, b, c, d)
The reader does not expect b to be semantically here and if the code is changed by maybe adding a a division or other the signedness will almost certainly be mistaken To avoid this confusion a new type was SUINT is the C unsigned type but it holds a signed int to use the same example SUINT a
static void aes_decrypt(AVAES *a, uint8_t *dst, const uint8_t *src, int count, uint8_t *iv, int rounds)
static uint32_t dec_multbl[4][256]
#define i(width, name, range_min, range_max)
#define FF_ARRAY_ELEMS(a)
static uint32_t enc_multbl[4][256]
static const uint8_t rcon[10]
static void addkey_d(uint8_t *dst, const av_aes_block *src, const av_aes_block *round_key)
static void subshift(av_aes_block s0[2], int s, const uint8_t *box)
static int mix_core(uint32_t multbl[][256], int a, int b, int c, int d)