Go to the documentation of this file.
33 while (
str[nb_sharps] ==
'#')
38 return rgba[0] | rgba[1] << 8 | rgba[2] << 16;
44 while (buf->len > 0 && buf->str[buf->len - 1] ==
' ')
45 buf->str[--buf->len] = 0;
55 if (strncmp(in,
"{\\an", 4) != 0) {
69 static void handle_open_brace(AVBPrint *dst,
const char **inp,
int *an,
int *closing_brace_missing)
71 const char *in = *inp;
75 if (!*closing_brace_missing) {
76 if ( (*an != 1 && in[1] ==
'\\')
77 || (in[1] && strchr(
"CcFfoPSsYy", in[1]) && in[2] ==
':')) {
78 char *bracep = strchr(in+2,
'}');
83 *closing_brace_missing = 1;
106 const char c = *in++;
132 int len, tag_close, sptr = 0, line_start = 1, an = 0, end = 0;
133 int closing_brace_missing = 0;
161 memset(&stack[0], 0,
sizeof(stack[0]));
163 for (; !end && *in; in++) {
191 for (
i = 0; in[1] ==
'<';
i++) {
197 tag_close = in[1] ==
'/';
206 const int skip =
len + tag_close;
207 const char *tagname =
buffer;
208 while (*tagname ==
' ') {
212 if ((param = strchr(tagname,
' ')))
216 #define LIKELY_A_TAG_CHAR(x) (((x) >= '0' && (x) <= '9') || \
217 ((x) >= 'a' && (x) <= 'z') || \
218 ((x) >= 'A' && (x) <= 'Z') || \
219 (x) == '_' || (x) == '/')
220 for (
i = 0; tagname[
i];
i++) {
228 if (tag_close && sptr > 0) {
229 struct font_tag *cur_tag = &stack[sptr--];
230 struct font_tag *last_tag = &stack[sptr];
235 else if (last_tag->
size != cur_tag->
size)
239 if (cur_tag->
color & 0xff000000) {
240 if (!(last_tag->
color & 0xff000000))
246 if (cur_tag->
face[0]) {
247 if (!last_tag->
face[0])
249 else if (strcmp(last_tag->
face, cur_tag->
face))
253 struct font_tag *new_tag = &stack[sptr + 1];
255 *new_tag = stack[sptr++];
259 param += 5 + (param[5] ==
'"');
260 if (sscanf(param,
"%u", &new_tag->
size) == 1)
264 param += 6 + (param[6] ==
'"');
271 param += 5 + (param[5] ==
'"');
273 param[-1] ==
'"' ?
"\"" :
" ");
279 if ((param = strchr(param,
' ')))
284 }
else if (tagname[0] && !tagname[1] && strchr(
"bisu",
av_tolower(tagname[0]))) {
288 (!tagname[2] || (tagname[2] ==
'/' && !tagname[3]))) {
291 }
else if (likely_a_tag) {
306 if (*in !=
' ' && *in !=
'\r' && *in !=
'\n')
313 while (dst->len >= 2 && !strncmp(&dst->str[dst->len - 2],
"\\N", 2))
315 dst->str[dst->len] = 0;
#define AV_LOG_WARNING
Something somehow does not look correct.
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
int av_parse_color(uint8_t *rgba_color, const char *color_string, int slen, void *log_ctx)
Put the RGBA values that correspond to color_string in rgba_color.
int av_strcasecmp(const char *a, const char *b)
Locale-independent case-insensitive compare.
static void rstrip_spaces_buf(AVBPrint *buf)
#define FF_ARRAY_ELEMS(a)
#define av_assert0(cond)
assert() equivalent, that is always enabled.
static void handle_open_brace(AVBPrint *dst, const char **inp, int *an, int *closing_brace_missing)
static int scantag(const char *in, char *buffer, int *lenp)
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
static int av_bprint_is_complete(const AVBPrint *buf)
Test if the print buffer is complete (not truncated).
int av_strncasecmp(const char *a, const char *b, size_t n)
Locale-independent case-insensitive compare.
static const uint32_t color[16+AV_CLASS_CATEGORY_NB]
static int html_color_parse(void *log_ctx, const char *str)
static av_const int av_isdigit(int c)
Locale-independent conversion of ASCII isdigit.
#define i(width, name, range_min, range_max)
int ff_htmlmarkup_to_ass(void *log_ctx, AVBPrint *dst, const char *in)
void av_bprintf(AVBPrint *buf, const char *fmt,...)
the frame and frame reference mechanism is intended to as much as expensive copies of that data while still allowing the filters to produce correct results The data is stored in buffers represented by AVFrame structures Several references can point to the same frame buffer
static int scanbraces(const char *in)
size_t av_strlcpy(char *dst, const char *src, size_t size)
Copy the string src to dst, but no more than size - 1 bytes, and null-terminate dst.
#define LIKELY_A_TAG_CHAR(x)
static av_const int av_tolower(int c)
Locale-independent conversion of ASCII characters to lowercase.
void av_bprint_chars(AVBPrint *buf, char c, unsigned n)
Append char c n times to a print buffer.