mirror of
https://github.com/ddidderr/wuffs.git
synced 2026-11-19 08:38:14 +01:00
Have std/gif update an image_buffer's dirty_rect
This commit is contained in:
1 parent
34cfc3f863
commit
5e856540bd
18 files changed
+869
-101
No files matched your search
@@ -253,6 +253,15 @@ static inline bool wuffs_base__range_ii_u32__is_empty(
|
||||
return r.min_inclusive > r.max_inclusive;
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ii_u32__equals(
|
||||
wuffs_base__range_ii_u32 r,
|
||||
wuffs_base__range_ii_u32 s) {
|
||||
return (r.min_inclusive == s.min_inclusive &&
|
||||
r.max_inclusive == s.max_inclusive) ||
|
||||
(wuffs_base__range_ii_u32__is_empty(r) &&
|
||||
wuffs_base__range_ii_u32__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ii_u32__contains(
|
||||
wuffs_base__range_ii_u32 r,
|
||||
uint32_t x) {
|
||||
@@ -293,6 +302,15 @@ static inline bool wuffs_base__range_ie_u32__is_empty(
|
||||
return r.min_inclusive >= r.max_exclusive;
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ie_u32__equals(
|
||||
wuffs_base__range_ie_u32 r,
|
||||
wuffs_base__range_ie_u32 s) {
|
||||
return (r.min_inclusive == s.min_inclusive &&
|
||||
r.max_exclusive == s.max_exclusive) ||
|
||||
(wuffs_base__range_ie_u32__is_empty(r) &&
|
||||
wuffs_base__range_ie_u32__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ie_u32__contains(
|
||||
wuffs_base__range_ie_u32 r,
|
||||
uint32_t x) {
|
||||
@@ -338,6 +356,15 @@ static inline bool wuffs_base__range_ii_u64__is_empty(
|
||||
return r.min_inclusive > r.max_inclusive;
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ii_u64__equals(
|
||||
wuffs_base__range_ii_u64 r,
|
||||
wuffs_base__range_ii_u64 s) {
|
||||
return (r.min_inclusive == s.min_inclusive &&
|
||||
r.max_inclusive == s.max_inclusive) ||
|
||||
(wuffs_base__range_ii_u64__is_empty(r) &&
|
||||
wuffs_base__range_ii_u64__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ii_u64__contains(
|
||||
wuffs_base__range_ii_u64 r,
|
||||
uint64_t x) {
|
||||
@@ -378,6 +405,15 @@ static inline bool wuffs_base__range_ie_u64__is_empty(
|
||||
return r.min_inclusive >= r.max_exclusive;
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ie_u64__equals(
|
||||
wuffs_base__range_ie_u64 r,
|
||||
wuffs_base__range_ie_u64 s) {
|
||||
return (r.min_inclusive == s.min_inclusive &&
|
||||
r.max_exclusive == s.max_exclusive) ||
|
||||
(wuffs_base__range_ie_u64__is_empty(r) &&
|
||||
wuffs_base__range_ie_u64__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__range_ie_u64__contains(
|
||||
wuffs_base__range_ie_u64 r,
|
||||
uint64_t x) {
|
||||
@@ -435,6 +471,16 @@ static inline bool wuffs_base__rect_ii_u32__is_empty(
|
||||
(r.min_inclusive_y > r.max_inclusive_y);
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__rect_ii_u32__equals(wuffs_base__rect_ii_u32 r,
|
||||
wuffs_base__rect_ii_u32 s) {
|
||||
return (r.min_inclusive_x == s.min_inclusive_x &&
|
||||
r.min_inclusive_y == s.min_inclusive_y &&
|
||||
r.max_inclusive_x == s.max_inclusive_x &&
|
||||
r.max_inclusive_y == s.max_inclusive_y) ||
|
||||
(wuffs_base__rect_ii_u32__is_empty(r) &&
|
||||
wuffs_base__rect_ii_u32__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__rect_ii_u32__contains(wuffs_base__rect_ii_u32 r,
|
||||
uint32_t x,
|
||||
uint32_t y) {
|
||||
@@ -501,6 +547,16 @@ static inline bool wuffs_base__rect_ie_u32__is_empty(
|
||||
(r.min_inclusive_y >= r.max_exclusive_y);
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__rect_ie_u32__equals(wuffs_base__rect_ie_u32 r,
|
||||
wuffs_base__rect_ie_u32 s) {
|
||||
return (r.min_inclusive_x == s.min_inclusive_x &&
|
||||
r.min_inclusive_y == s.min_inclusive_y &&
|
||||
r.max_exclusive_x == s.max_exclusive_x &&
|
||||
r.max_exclusive_y == s.max_exclusive_y) ||
|
||||
(wuffs_base__rect_ie_u32__is_empty(r) &&
|
||||
wuffs_base__rect_ie_u32__is_empty(s));
|
||||
}
|
||||
|
||||
static inline bool wuffs_base__rect_ie_u32__contains(wuffs_base__rect_ie_u32 r,
|
||||
uint32_t x,
|
||||
uint32_t y) {
|
||||
@@ -1027,17 +1083,16 @@ static inline void wuffs_base__image_buffer__update(
|
||||
bool dirty_palette,
|
||||
wuffs_base__rect_ie_u32 dirty_rect,
|
||||
wuffs_base__flicks duration,
|
||||
uint8_t* palette_ptr,
|
||||
size_t palette_len) {
|
||||
wuffs_base__slice_u8 palette) {
|
||||
if (!b) {
|
||||
return;
|
||||
}
|
||||
b->private_impl.dirty_palette = dirty_palette;
|
||||
b->private_impl.dirty_rect = dirty_rect;
|
||||
b->private_impl.duration = duration;
|
||||
if (palette_ptr) {
|
||||
memmove(b->private_impl.palette, palette_ptr,
|
||||
palette_len <= 1024 ? palette_len : 1024);
|
||||
if (palette.ptr) {
|
||||
memmove(b->private_impl.palette, palette.ptr,
|
||||
palette.len <= 1024 ? palette.len : 1024);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -34,24 +34,26 @@ const baseHeader = "" +
|
||||
"" +
|
||||
"// ---------------- Ranges and Rects\n\n// Ranges are either inclusive (\"range_ii\") or exclusive (\"range_ie\") on the\n// high end. Both the \"ii\" and \"ie\" flavors are useful in practice.\n//\n// The \"ei\" and \"ee\" flavors also exist in theory, but aren't widely used. In\n// Wuffs, the low end is always inclusive.\n//\n// The \"ii\" (closed interval) flavor is useful when refining e.g. \"the set of\n// all uint32_t values\" to a contiguous subset: \"uint32_t values in the closed\n// interval [M, N]\", for uint32_t values M and N. An unrefined type (in other\n// words, the set of all uint32_t values) is not representable in the \"ie\"\n// flavor because if N equals ((1<<32) - 1) then (N + 1) will overflow.\n//\n// On the other hand, the \"ie\" (half-open interval) flavor is recommended by\n// Dijkstra's \"Why numbering should start at zero\" at\n// http://www.cs.utexas.edu/users/EWD/ewd08xx/EWD831.PDF and a further\n// discussion of motivating rationale is at\n// https://www.quora.com/Why-are-Python-ranges-half-open-exclusive-instead-of-close" +
|
||||
"d-inclusive\n//\n// For example, with \"ie\", the number of elements in \"uint32_t values in the\n// half-open interval [M, N)\" is equal to max(0, N-M). Furthermore, that number\n// of elements (in one dimension, a length, in two dimensions, a width or\n// height) is itself representable as a uint32_t without overflow, again for\n// uint32_t values M and N. In the contrasting \"ii\" flavor, the length of the\n// closed interval [0, (1<<32) - 1] is 1<<32, which cannot be represented as a\n// uint32_t. In Wuffs, because of this potential overflow, the \"ie\" flavor has\n// length / width / height methods, but the \"ii\" flavor does not.\n//\n// It is valid for min > max (for range_ii) or for min >= max (for range_ie),\n// in which case the range is empty. There are multiple representations of an\n// empty range.\n\ntypedef struct {\n uint32_t min_inclusive;\n uint32_t max_inclusive;\n} wuffs_base__range_ii_u32;\n\nstatic inline bool wuffs_base__range_ii_u32__is_empty(\n wuffs_base__range_ii_u32 r) {\n return r.min_inclusive > r.max_inc" +
|
||||
"lusive;\n}\n\nstatic inline bool wuffs_base__range_ii_u32__contains(\n wuffs_base__range_ii_u32 r,\n uint32_t x) {\n return (r.min_inclusive <= x) && (x <= r.max_inclusive);\n}\n\nstatic inline wuffs_base__range_ii_u32 wuffs_base__range_ii_u32__intersection(\n wuffs_base__range_ii_u32 r,\n wuffs_base__range_ii_u32 s) {\n r.min_inclusive = wuffs_base__u32__max(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u32__min(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\nstatic inline wuffs_base__range_ii_u32 wuffs_base__range_ii_u32__union(\n wuffs_base__range_ii_u32 r,\n wuffs_base__range_ii_u32 s) {\n if (wuffs_base__range_ii_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ii_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base__u32__min(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u32__max(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\n" +
|
||||
"lusive;\n}\n\nstatic inline bool wuffs_base__range_ii_u32__equals(\n wuffs_base__range_ii_u32 r,\n wuffs_base__range_ii_u32 s) {\n return (r.min_inclusive == s.min_inclusive &&\n r.max_inclusive == s.max_inclusive) ||\n (wuffs_base__range_ii_u32__is_empty(r) &&\n wuffs_base__range_ii_u32__is_empty(s));\n}\n\nstatic inline bool wuffs_base__range_ii_u32__contains(\n wuffs_base__range_ii_u32 r,\n uint32_t x) {\n return (r.min_inclusive <= x) && (x <= r.max_inclusive);\n}\n\nstatic inline wuffs_base__range_ii_u32 wuffs_base__range_ii_u32__intersection(\n wuffs_base__range_ii_u32 r,\n wuffs_base__range_ii_u32 s) {\n r.min_inclusive = wuffs_base__u32__max(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u32__min(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\nstatic inline wuffs_base__range_ii_u32 wuffs_base__range_ii_u32__union(\n wuffs_base__range_ii_u32 r,\n wuffs_base__range_ii_u32 s) {\n if (wuffs_base__range_ii_u32__is_empty(r)) {\n return s;\n }\n if (wuffs" +
|
||||
"_base__range_ii_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base__u32__min(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u32__max(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\ntypedef struct {\n uint32_t min_inclusive;\n uint32_t max_exclusive;\n} wuffs_base__range_ie_u32;\n\nstatic inline bool wuffs_base__range_ie_u32__is_empty(\n wuffs_base__range_ie_u32 r) {\n return r.min_inclusive >= r.max_exclusive;\n}\n\nstatic inline bool wuffs_base__range_ie_u32__contains(\n wuffs_base__range_ie_u32 r,\n uint32_t x) {\n return (r.min_inclusive <= x) && (x < r.max_exclusive);\n}\n\nstatic inline wuffs_base__range_ie_u32 wuffs_base__range_ie_u32__intersection(\n wuffs_base__range_ie_u32 r,\n wuffs_base__range_ie_u32 s) {\n r.min_inclusive = wuffs_base__u32__max(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u32__min(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline wuffs_base__range_ie_u32 wuffs_base__range_ie_u32__union(\n wuffs_base__range_ie_u32 r,\n wuffs_base__range_ie_u32 s) {\n if (wuffs_base__range_ie_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ie_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base" +
|
||||
"__u32__min(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u32__max(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline uint32_t wuffs_base__range_ie_u32__length(\n wuffs_base__range_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive, r.min_inclusive);\n}\n\n" +
|
||||
"// --------\n\ntypedef struct {\n uint32_t min_inclusive;\n uint32_t max_exclusive;\n} wuffs_base__range_ie_u32;\n\nstatic inline bool wuffs_base__range_ie_u32__is_empty(\n wuffs_base__range_ie_u32 r) {\n return r.min_inclusive >= r.max_exclusive;\n}\n\nstatic inline bool wuffs_base__range_ie_u32__equals(\n wuffs_base__range_ie_u32 r,\n wuffs_base__range_ie_u32 s) {\n return (r.min_inclusive == s.min_inclusive &&\n r.max_exclusive == s.max_exclusive) ||\n (wuffs_base__range_ie_u32__is_empty(r) &&\n wuffs_base__range_ie_u32__is_empty(s));\n}\n\nstatic inline bool wuffs_base__range_ie_u32__contains(\n wuffs_base__range_ie_u32 r,\n uint32_t x) {\n return (r.min_inclusive <= x) && (x < r.max_exclusive);\n}\n\nstatic inline wuffs_base__range_ie_u32 wuffs_base__range_ie_u32__intersection(\n wuffs_base__range_ie_u32 r,\n wuffs_base__range_ie_u32 s) {\n r.min_inclusive = wuffs_base__u32__max(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u32__min(r.max_exclusive, s.max_exclu" +
|
||||
"sive);\n return r;\n}\n\nstatic inline wuffs_base__range_ie_u32 wuffs_base__range_ie_u32__union(\n wuffs_base__range_ie_u32 r,\n wuffs_base__range_ie_u32 s) {\n if (wuffs_base__range_ie_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ie_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base__u32__min(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u32__max(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline uint32_t wuffs_base__range_ie_u32__length(\n wuffs_base__range_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive, r.min_inclusive);\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\ntypedef struct {\n uint64_t min_inclusive;\n uint64_t max_inclusive;\n} wuffs_base__range_ii_u64;\n\nstatic inline bool wuffs_base__range_ii_u64__is_empty(\n wuffs_base__range_ii_u64 r) {\n return r.min_inclusive > r.max_inclusive;\n}\n\nstatic inline bool wuffs_base__range_ii_u64__contains(\n wuffs_base__range_ii_u64 r,\n uint64_t x) {\n return (r.min_inclusive <= x) && (x <= r.max_inclusive);\n}\n\nstatic inline wuffs_base__range_ii_u64 wuffs_base__range_ii_u64__intersection(\n wuffs_base__range_ii_u64 r,\n wuffs_base__range_ii_u64 s) {\n r.min_inclusive = wuffs_base__u64__max(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u64__min(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\nstatic inline wuffs_base__range_ii_u64 wuffs_base__range_ii_u64__union(\n wuffs_base__range_ii_u64 r,\n wuffs_base__range_ii_u64 s) {\n if (wuffs_base__range_ii_u64__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ii_u64__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base" +
|
||||
"__u64__min(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u64__max(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\n" +
|
||||
"// --------\n\ntypedef struct {\n uint64_t min_inclusive;\n uint64_t max_inclusive;\n} wuffs_base__range_ii_u64;\n\nstatic inline bool wuffs_base__range_ii_u64__is_empty(\n wuffs_base__range_ii_u64 r) {\n return r.min_inclusive > r.max_inclusive;\n}\n\nstatic inline bool wuffs_base__range_ii_u64__equals(\n wuffs_base__range_ii_u64 r,\n wuffs_base__range_ii_u64 s) {\n return (r.min_inclusive == s.min_inclusive &&\n r.max_inclusive == s.max_inclusive) ||\n (wuffs_base__range_ii_u64__is_empty(r) &&\n wuffs_base__range_ii_u64__is_empty(s));\n}\n\nstatic inline bool wuffs_base__range_ii_u64__contains(\n wuffs_base__range_ii_u64 r,\n uint64_t x) {\n return (r.min_inclusive <= x) && (x <= r.max_inclusive);\n}\n\nstatic inline wuffs_base__range_ii_u64 wuffs_base__range_ii_u64__intersection(\n wuffs_base__range_ii_u64 r,\n wuffs_base__range_ii_u64 s) {\n r.min_inclusive = wuffs_base__u64__max(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u64__min(r.max_inclusive, s.max_inclu" +
|
||||
"sive);\n return r;\n}\n\nstatic inline wuffs_base__range_ii_u64 wuffs_base__range_ii_u64__union(\n wuffs_base__range_ii_u64 r,\n wuffs_base__range_ii_u64 s) {\n if (wuffs_base__range_ii_u64__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ii_u64__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base__u64__min(r.min_inclusive, s.min_inclusive);\n r.max_inclusive = wuffs_base__u64__max(r.max_inclusive, s.max_inclusive);\n return r;\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\ntypedef struct {\n uint64_t min_inclusive;\n uint64_t max_exclusive;\n} wuffs_base__range_ie_u64;\n\nstatic inline bool wuffs_base__range_ie_u64__is_empty(\n wuffs_base__range_ie_u64 r) {\n return r.min_inclusive >= r.max_exclusive;\n}\n\nstatic inline bool wuffs_base__range_ie_u64__contains(\n wuffs_base__range_ie_u64 r,\n uint64_t x) {\n return (r.min_inclusive <= x) && (x < r.max_exclusive);\n}\n\nstatic inline wuffs_base__range_ie_u64 wuffs_base__range_ie_u64__intersection(\n wuffs_base__range_ie_u64 r,\n wuffs_base__range_ie_u64 s) {\n r.min_inclusive = wuffs_base__u64__max(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u64__min(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline wuffs_base__range_ie_u64 wuffs_base__range_ie_u64__union(\n wuffs_base__range_ie_u64 r,\n wuffs_base__range_ie_u64 s) {\n if (wuffs_base__range_ie_u64__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ie_u64__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base" +
|
||||
"__u64__min(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u64__max(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline uint64_t wuffs_base__range_ie_u64__length(\n wuffs_base__range_ie_u64 r) {\n return wuffs_base__u64__sat_sub(r.max_exclusive, r.min_inclusive);\n}\n\n" +
|
||||
"// --------\n\ntypedef struct {\n uint64_t min_inclusive;\n uint64_t max_exclusive;\n} wuffs_base__range_ie_u64;\n\nstatic inline bool wuffs_base__range_ie_u64__is_empty(\n wuffs_base__range_ie_u64 r) {\n return r.min_inclusive >= r.max_exclusive;\n}\n\nstatic inline bool wuffs_base__range_ie_u64__equals(\n wuffs_base__range_ie_u64 r,\n wuffs_base__range_ie_u64 s) {\n return (r.min_inclusive == s.min_inclusive &&\n r.max_exclusive == s.max_exclusive) ||\n (wuffs_base__range_ie_u64__is_empty(r) &&\n wuffs_base__range_ie_u64__is_empty(s));\n}\n\nstatic inline bool wuffs_base__range_ie_u64__contains(\n wuffs_base__range_ie_u64 r,\n uint64_t x) {\n return (r.min_inclusive <= x) && (x < r.max_exclusive);\n}\n\nstatic inline wuffs_base__range_ie_u64 wuffs_base__range_ie_u64__intersection(\n wuffs_base__range_ie_u64 r,\n wuffs_base__range_ie_u64 s) {\n r.min_inclusive = wuffs_base__u64__max(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u64__min(r.max_exclusive, s.max_exclu" +
|
||||
"sive);\n return r;\n}\n\nstatic inline wuffs_base__range_ie_u64 wuffs_base__range_ie_u64__union(\n wuffs_base__range_ie_u64 r,\n wuffs_base__range_ie_u64 s) {\n if (wuffs_base__range_ie_u64__is_empty(r)) {\n return s;\n }\n if (wuffs_base__range_ie_u64__is_empty(s)) {\n return r;\n }\n r.min_inclusive = wuffs_base__u64__min(r.min_inclusive, s.min_inclusive);\n r.max_exclusive = wuffs_base__u64__max(r.max_exclusive, s.max_exclusive);\n return r;\n}\n\nstatic inline uint64_t wuffs_base__range_ie_u64__length(\n wuffs_base__range_ie_u64 r) {\n return wuffs_base__u64__sat_sub(r.max_exclusive, r.min_inclusive);\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\n// wuffs_base__rect_ii_u32 is a rectangle (a 2-dimensional range) on the\n// integer grid. The \"ii\" means that the bounds are inclusive on the low end\n// and inclusive on the high end. It contains all points (x, y) such that\n// ((min_inclusive_x <= x) && (x <= max_inclusive_x)) and likewise for y.\n//\n// It is valid for min > max, in which case the rectangle is empty. There are\n// multiple representations of an empty rectangle.\n//\n// The X and Y axes increase right and down.\ntypedef struct {\n uint32_t min_inclusive_x;\n uint32_t min_inclusive_y;\n uint32_t max_inclusive_x;\n uint32_t max_inclusive_y;\n} wuffs_base__rect_ii_u32;\n\nstatic inline bool wuffs_base__rect_ii_u32__is_empty(\n wuffs_base__rect_ii_u32 r) {\n return (r.min_inclusive_x > r.max_inclusive_x) ||\n (r.min_inclusive_y > r.max_inclusive_y);\n}\n\nstatic inline bool wuffs_base__rect_ii_u32__contains(wuffs_base__rect_ii_u32 r,\n uint32_t x,\n " +
|
||||
" uint32_t y) {\n return (r.min_inclusive_x <= x) && (x <= r.max_inclusive_x) &&\n (r.min_inclusive_y <= y) && (y <= r.max_inclusive_y);\n}\n\nstatic inline wuffs_base__rect_ii_u32 wuffs_base__rect_ii_u32__intersection(\n wuffs_base__rect_ii_u32 r,\n wuffs_base__rect_ii_u32 s) {\n r.min_inclusive_x =\n wuffs_base__u32__max(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__max(r.min_inclusive_y, s.min_inclusive_y);\n r.max_inclusive_x =\n wuffs_base__u32__min(r.max_inclusive_x, s.max_inclusive_x);\n r.max_inclusive_y =\n wuffs_base__u32__min(r.max_inclusive_y, s.max_inclusive_y);\n return r;\n}\n\nstatic inline wuffs_base__rect_ii_u32 wuffs_base__rect_ii_u32__union(\n wuffs_base__rect_ii_u32 r,\n wuffs_base__rect_ii_u32 s) {\n if (wuffs_base__rect_ii_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__rect_ii_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive_x =\n wuffs_base__u32__min(r.min_inclusive_x, s.min_inclusive_x);\n r.min" +
|
||||
"_inclusive_y =\n wuffs_base__u32__min(r.min_inclusive_y, s.min_inclusive_y);\n r.max_inclusive_x =\n wuffs_base__u32__max(r.max_inclusive_x, s.max_inclusive_x);\n r.max_inclusive_y =\n wuffs_base__u32__max(r.max_inclusive_y, s.max_inclusive_y);\n return r;\n}\n\n" +
|
||||
"// --------\n\n// wuffs_base__rect_ii_u32 is a rectangle (a 2-dimensional range) on the\n// integer grid. The \"ii\" means that the bounds are inclusive on the low end\n// and inclusive on the high end. It contains all points (x, y) such that\n// ((min_inclusive_x <= x) && (x <= max_inclusive_x)) and likewise for y.\n//\n// It is valid for min > max, in which case the rectangle is empty. There are\n// multiple representations of an empty rectangle.\n//\n// The X and Y axes increase right and down.\ntypedef struct {\n uint32_t min_inclusive_x;\n uint32_t min_inclusive_y;\n uint32_t max_inclusive_x;\n uint32_t max_inclusive_y;\n} wuffs_base__rect_ii_u32;\n\nstatic inline bool wuffs_base__rect_ii_u32__is_empty(\n wuffs_base__rect_ii_u32 r) {\n return (r.min_inclusive_x > r.max_inclusive_x) ||\n (r.min_inclusive_y > r.max_inclusive_y);\n}\n\nstatic inline bool wuffs_base__rect_ii_u32__equals(wuffs_base__rect_ii_u32 r,\n wuffs_base__rect_ii_u32 s) {\n return (r.min_inclusive_" +
|
||||
"x == s.min_inclusive_x &&\n r.min_inclusive_y == s.min_inclusive_y &&\n r.max_inclusive_x == s.max_inclusive_x &&\n r.max_inclusive_y == s.max_inclusive_y) ||\n (wuffs_base__rect_ii_u32__is_empty(r) &&\n wuffs_base__rect_ii_u32__is_empty(s));\n}\n\nstatic inline bool wuffs_base__rect_ii_u32__contains(wuffs_base__rect_ii_u32 r,\n uint32_t x,\n uint32_t y) {\n return (r.min_inclusive_x <= x) && (x <= r.max_inclusive_x) &&\n (r.min_inclusive_y <= y) && (y <= r.max_inclusive_y);\n}\n\nstatic inline wuffs_base__rect_ii_u32 wuffs_base__rect_ii_u32__intersection(\n wuffs_base__rect_ii_u32 r,\n wuffs_base__rect_ii_u32 s) {\n r.min_inclusive_x =\n wuffs_base__u32__max(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__max(r.min_inclusive_y, s.min_inclusive_y);\n r.max_inclusive_x =\n wuffs_base__u32__min(r.max_inclusive_x, s.max_inclu" +
|
||||
"sive_x);\n r.max_inclusive_y =\n wuffs_base__u32__min(r.max_inclusive_y, s.max_inclusive_y);\n return r;\n}\n\nstatic inline wuffs_base__rect_ii_u32 wuffs_base__rect_ii_u32__union(\n wuffs_base__rect_ii_u32 r,\n wuffs_base__rect_ii_u32 s) {\n if (wuffs_base__rect_ii_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__rect_ii_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive_x =\n wuffs_base__u32__min(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__min(r.min_inclusive_y, s.min_inclusive_y);\n r.max_inclusive_x =\n wuffs_base__u32__max(r.max_inclusive_x, s.max_inclusive_x);\n r.max_inclusive_y =\n wuffs_base__u32__max(r.max_inclusive_y, s.max_inclusive_y);\n return r;\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\n// wuffs_base__rect_ie_u32 is a rectangle (a 2-dimensional range) on the\n// integer grid. The \"ie\" means that the bounds are inclusive on the low end\n// and exclusive on the high end. It contains all points (x, y) such that\n// ((min_inclusive_x <= x) && (x < max_exclusive_x)) and likewise for y.\n//\n// It is valid for min >= max, in which case the rectangle is empty. There are\n// multiple representations of an empty rectangle, including a value with all\n// fields zero.\n//\n// The X and Y axes increase right and down.\ntypedef struct {\n uint32_t min_inclusive_x;\n uint32_t min_inclusive_y;\n uint32_t max_exclusive_x;\n uint32_t max_exclusive_y;\n} wuffs_base__rect_ie_u32;\n\nstatic inline bool wuffs_base__rect_ie_u32__is_empty(\n wuffs_base__rect_ie_u32 r) {\n return (r.min_inclusive_x >= r.max_exclusive_x) ||\n (r.min_inclusive_y >= r.max_exclusive_y);\n}\n\nstatic inline bool wuffs_base__rect_ie_u32__contains(wuffs_base__rect_ie_u32 r,\n uint32" +
|
||||
"_t x,\n uint32_t y) {\n return (r.min_inclusive_x <= x) && (x < r.max_exclusive_x) &&\n (r.min_inclusive_y <= y) && (y < r.max_exclusive_y);\n}\n\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__rect_ie_u32__intersection(\n wuffs_base__rect_ie_u32 r,\n wuffs_base__rect_ie_u32 s) {\n r.min_inclusive_x =\n wuffs_base__u32__max(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__max(r.min_inclusive_y, s.min_inclusive_y);\n r.max_exclusive_x =\n wuffs_base__u32__min(r.max_exclusive_x, s.max_exclusive_x);\n r.max_exclusive_y =\n wuffs_base__u32__min(r.max_exclusive_y, s.max_exclusive_y);\n return r;\n}\n\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__rect_ie_u32__union(\n wuffs_base__rect_ie_u32 r,\n wuffs_base__rect_ie_u32 s) {\n if (wuffs_base__rect_ie_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__rect_ie_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive_x =\n wuffs_base__u32__min(r.m" +
|
||||
"in_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__min(r.min_inclusive_y, s.min_inclusive_y);\n r.max_exclusive_x =\n wuffs_base__u32__max(r.max_exclusive_x, s.max_exclusive_x);\n r.max_exclusive_y =\n wuffs_base__u32__max(r.max_exclusive_y, s.max_exclusive_y);\n return r;\n}\n\nstatic inline uint32_t wuffs_base__rect_ie_u32__width(\n wuffs_base__rect_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive_x, r.min_inclusive_x);\n}\n\nstatic inline uint32_t wuffs_base__rect_ie_u32__height(\n wuffs_base__rect_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive_y, r.min_inclusive_y);\n}\n\n" +
|
||||
"// --------\n\n// wuffs_base__rect_ie_u32 is a rectangle (a 2-dimensional range) on the\n// integer grid. The \"ie\" means that the bounds are inclusive on the low end\n// and exclusive on the high end. It contains all points (x, y) such that\n// ((min_inclusive_x <= x) && (x < max_exclusive_x)) and likewise for y.\n//\n// It is valid for min >= max, in which case the rectangle is empty. There are\n// multiple representations of an empty rectangle, including a value with all\n// fields zero.\n//\n// The X and Y axes increase right and down.\ntypedef struct {\n uint32_t min_inclusive_x;\n uint32_t min_inclusive_y;\n uint32_t max_exclusive_x;\n uint32_t max_exclusive_y;\n} wuffs_base__rect_ie_u32;\n\nstatic inline bool wuffs_base__rect_ie_u32__is_empty(\n wuffs_base__rect_ie_u32 r) {\n return (r.min_inclusive_x >= r.max_exclusive_x) ||\n (r.min_inclusive_y >= r.max_exclusive_y);\n}\n\nstatic inline bool wuffs_base__rect_ie_u32__equals(wuffs_base__rect_ie_u32 r,\n wuffs_base" +
|
||||
"__rect_ie_u32 s) {\n return (r.min_inclusive_x == s.min_inclusive_x &&\n r.min_inclusive_y == s.min_inclusive_y &&\n r.max_exclusive_x == s.max_exclusive_x &&\n r.max_exclusive_y == s.max_exclusive_y) ||\n (wuffs_base__rect_ie_u32__is_empty(r) &&\n wuffs_base__rect_ie_u32__is_empty(s));\n}\n\nstatic inline bool wuffs_base__rect_ie_u32__contains(wuffs_base__rect_ie_u32 r,\n uint32_t x,\n uint32_t y) {\n return (r.min_inclusive_x <= x) && (x < r.max_exclusive_x) &&\n (r.min_inclusive_y <= y) && (y < r.max_exclusive_y);\n}\n\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__rect_ie_u32__intersection(\n wuffs_base__rect_ie_u32 r,\n wuffs_base__rect_ie_u32 s) {\n r.min_inclusive_x =\n wuffs_base__u32__max(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__max(r.min_inclusive_y, s.min_inclusive_y);\n r.max_exclusive_x =\n wuffs_ba" +
|
||||
"se__u32__min(r.max_exclusive_x, s.max_exclusive_x);\n r.max_exclusive_y =\n wuffs_base__u32__min(r.max_exclusive_y, s.max_exclusive_y);\n return r;\n}\n\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__rect_ie_u32__union(\n wuffs_base__rect_ie_u32 r,\n wuffs_base__rect_ie_u32 s) {\n if (wuffs_base__rect_ie_u32__is_empty(r)) {\n return s;\n }\n if (wuffs_base__rect_ie_u32__is_empty(s)) {\n return r;\n }\n r.min_inclusive_x =\n wuffs_base__u32__min(r.min_inclusive_x, s.min_inclusive_x);\n r.min_inclusive_y =\n wuffs_base__u32__min(r.min_inclusive_y, s.min_inclusive_y);\n r.max_exclusive_x =\n wuffs_base__u32__max(r.max_exclusive_x, s.max_exclusive_x);\n r.max_exclusive_y =\n wuffs_base__u32__max(r.max_exclusive_y, s.max_exclusive_y);\n return r;\n}\n\nstatic inline uint32_t wuffs_base__rect_ie_u32__width(\n wuffs_base__rect_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive_x, r.min_inclusive_x);\n}\n\nstatic inline uint32_t wuffs_base__rect_ie_u32__height(\n wuffs_base__rect" +
|
||||
"_ie_u32 r) {\n return wuffs_base__u32__sat_sub(r.max_exclusive_y, r.min_inclusive_y);\n}\n\n" +
|
||||
"" +
|
||||
"// ---------------- I/O\n\n// wuffs_base__io_buffer is a 1-dimensional buffer (a pointer and length), plus\n// additional indexes into that buffer, plus an opened / closed flag.\n//\n// A value with all fields NULL or zero is a valid, empty buffer.\ntypedef struct {\n uint8_t* ptr; // Pointer.\n size_t len; // Length.\n size_t wi; // Write index. Invariant: wi <= len.\n size_t ri; // Read index. Invariant: ri <= wi.\n bool closed; // No further writes are expected.\n} wuffs_base__io_buffer;\n\ntypedef struct {\n // Do not access the private_impl's fields directly. There is no API/ABI\n // compatibility or safety guarantee if you do so.\n struct {\n wuffs_base__io_buffer* buf;\n // The bounds values are typically NULL, when created by the Wuffs public\n // API. NULL means that the callee substitutes the implicit bounds derived\n // from buf.\n uint8_t* bounds[2];\n } private_impl;\n} wuffs_base__io_reader;\n\ntypedef struct {\n // Do not access the private_impl's fields directly. There is no API/A" +
|
||||
"BI\n // compatibility or safety guarantee if you do so.\n struct {\n wuffs_base__io_buffer* buf;\n // The bounds values are typically NULL, when created by the Wuffs public\n // API. NULL means that the callee substitutes the implicit bounds derived\n // from buf.\n uint8_t* bounds[2];\n } private_impl;\n} wuffs_base__io_writer;\n\nstatic inline wuffs_base__slice_u8 wuffs_base__io_buffer__readable(\n wuffs_base__io_buffer* buf) {\n if (buf) {\n return ((wuffs_base__slice_u8){\n .ptr = buf->ptr + buf->ri,\n .len = buf->wi - buf->ri,\n });\n }\n return ((wuffs_base__slice_u8){});\n}\n\nstatic inline wuffs_base__io_reader wuffs_base__io_buffer__reader(\n wuffs_base__io_buffer* buf) {\n wuffs_base__io_reader ret = ((wuffs_base__io_reader){});\n ret.private_impl.buf = buf;\n return ret;\n}\n\nstatic inline wuffs_base__slice_u8 wuffs_base__io_buffer__writable(\n wuffs_base__io_buffer* buf) {\n if (buf) {\n return ((wuffs_base__slice_u8){\n .ptr = buf->ptr + buf->wi,\n .len = buf" +
|
||||
@@ -77,10 +79,10 @@ const baseHeader = "" +
|
||||
" wuffs_base__image_config* c) {\n return c ? c->private_impl.num_loops : 0;\n}\n\n// TODO: this is the right API for planar (not packed) pixbufs? Should it allow\n// decoding into a color model different from the format's intrinsic one? For\n// example, decoding a JPEG image straight to RGBA instead of to YCbCr?\nstatic inline size_t wuffs_base__image_config__pixbuf_size(\n wuffs_base__image_config* c) {\n if (c) {\n uint64_t wh =\n ((uint64_t)c->private_impl.width) * ((uint64_t)c->private_impl.height);\n // TODO: handle things other than 1 byte per pixel.\n return (size_t)wh;\n }\n return 0;\n}\n\n" +
|
||||
"" +
|
||||
"// --------\n\ntypedef struct {\n // Do not access the private_impl's fields directly. There is no API/ABI\n // compatibility or safety guarantee if you do so.\n struct {\n wuffs_base__image_config config;\n uint32_t loop_count; // 0-based count of the current loop.\n wuffs_base__pixel_buffer pixbuf;\n // TODO: color spaces.\n bool dirty_palette;\n wuffs_base__rect_ie_u32 dirty_rect;\n wuffs_base__flicks duration;\n uint8_t palette[1024];\n } private_impl;\n} wuffs_base__image_buffer;\n\nstatic inline void wuffs_base__image_buffer__set_from_pixbuf(\n wuffs_base__image_buffer* b,\n wuffs_base__image_config config,\n wuffs_base__pixel_buffer pixbuf) {\n if (!b) {\n return;\n }\n *b = ((wuffs_base__image_buffer){});\n b->private_impl.config = config;\n b->private_impl.pixbuf = pixbuf;\n}\n\n// TODO: Should this function return bool? An error type?\nstatic inline void wuffs_base__image_buffer__set_from_slice(\n wuffs_base__image_buffer* b,\n wuffs_base__image_config config,\n wuffs_base__sli" +
|
||||
"ce_u8 pixbuf_memory) {\n if (!b) {\n return;\n }\n *b = ((wuffs_base__image_buffer){});\n // TODO: don't assume 1 byte per pixel. Don't assume packed.\n uint64_t wh = ((uint64_t)config.private_impl.width) *\n ((uint64_t)config.private_impl.height);\n if (wh > pixbuf_memory.len) {\n return;\n }\n b->private_impl.config = config;\n wuffs_base__table_u8* tab = &b->private_impl.pixbuf.planes[0];\n tab->ptr = pixbuf_memory.ptr;\n tab->width = config.private_impl.width;\n tab->height = config.private_impl.height;\n tab->stride = config.private_impl.width;\n}\n\nstatic inline void wuffs_base__image_buffer__update(\n wuffs_base__image_buffer* b,\n bool dirty_palette,\n wuffs_base__rect_ie_u32 dirty_rect,\n wuffs_base__flicks duration,\n uint8_t* palette_ptr,\n size_t palette_len) {\n if (!b) {\n return;\n }\n b->private_impl.dirty_palette = dirty_palette;\n b->private_impl.dirty_rect = dirty_rect;\n b->private_impl.duration = duration;\n if (palette_ptr) {\n memmove(b->private_impl.pale" +
|
||||
"tte, palette_ptr,\n palette_len <= 1024 ? palette_len : 1024);\n }\n}\n\n// wuffs_base__image_buffer__loop returns whether the image decoder should loop\n// back to the beginning of the animation, assuming that we've reached the end\n// of the encoded stream. If so, it increments b's count of the animation loops\n// played so far.\nstatic inline bool wuffs_base__image_buffer__loop(wuffs_base__image_buffer* b) {\n if (!b) {\n return false;\n }\n uint32_t n = b->private_impl.config.private_impl.num_loops;\n if (n == 0) {\n return true;\n }\n if (b->private_impl.loop_count < n - 1) {\n b->private_impl.loop_count++;\n return true;\n }\n return false;\n}\n\n// wuffs_base__image_buffer__dirty_palette returns whether this frame's palette\n// differs from the previous frame. It is conservative and may return false\n// positives (but never false negatives).\nstatic inline bool wuffs_base__image_buffer__dirty_palette(\n wuffs_base__image_buffer* b) {\n return b && b->private_impl.dirty_palette;\n}\n\n// wuffs_base_" +
|
||||
"_image_buffer__dirty_rect returns an upper bound for what part of\n// this frame's pixels differs from the previous frame.\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__image_buffer__dirty_rect(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.dirty_rect : ((wuffs_base__rect_ie_u32){0});\n}\n\n// wuffs_base__image_buffer__duration returns the amount of time to display\n// this frame. Zero means to display forever - a still (non-animated) image.\nstatic inline wuffs_base__flicks wuffs_base__image_buffer__duration(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.duration : 0;\n}\n\n// wuffs_base__image_buffer__palette returns the palette that the pixel data\n// can index. The backing array is inside b and has length 1024.\nstatic inline uint8_t* wuffs_base__image_buffer__palette(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.palette : NULL;\n}\n\nstatic inline wuffs_base__table_u8 wuffs_base__image_buffer__plane(\n wuffs_base__image_buffer* b,\n uint32_t p) {\n return " +
|
||||
"(b && (p < WUFFS_BASE__PIXEL_FORMAT__NUM_PLANES_MAX))\n ? b->private_impl.pixbuf.planes[p]\n : ((wuffs_base__table_u8){});\n}\n\n#endif // WUFFS_BASE_HEADER_H\n" +
|
||||
"ce_u8 pixbuf_memory) {\n if (!b) {\n return;\n }\n *b = ((wuffs_base__image_buffer){});\n // TODO: don't assume 1 byte per pixel. Don't assume packed.\n uint64_t wh = ((uint64_t)config.private_impl.width) *\n ((uint64_t)config.private_impl.height);\n if (wh > pixbuf_memory.len) {\n return;\n }\n b->private_impl.config = config;\n wuffs_base__table_u8* tab = &b->private_impl.pixbuf.planes[0];\n tab->ptr = pixbuf_memory.ptr;\n tab->width = config.private_impl.width;\n tab->height = config.private_impl.height;\n tab->stride = config.private_impl.width;\n}\n\nstatic inline void wuffs_base__image_buffer__update(\n wuffs_base__image_buffer* b,\n bool dirty_palette,\n wuffs_base__rect_ie_u32 dirty_rect,\n wuffs_base__flicks duration,\n wuffs_base__slice_u8 palette) {\n if (!b) {\n return;\n }\n b->private_impl.dirty_palette = dirty_palette;\n b->private_impl.dirty_rect = dirty_rect;\n b->private_impl.duration = duration;\n if (palette.ptr) {\n memmove(b->private_impl.palette, palette.ptr" +
|
||||
",\n palette.len <= 1024 ? palette.len : 1024);\n }\n}\n\n// wuffs_base__image_buffer__loop returns whether the image decoder should loop\n// back to the beginning of the animation, assuming that we've reached the end\n// of the encoded stream. If so, it increments b's count of the animation loops\n// played so far.\nstatic inline bool wuffs_base__image_buffer__loop(wuffs_base__image_buffer* b) {\n if (!b) {\n return false;\n }\n uint32_t n = b->private_impl.config.private_impl.num_loops;\n if (n == 0) {\n return true;\n }\n if (b->private_impl.loop_count < n - 1) {\n b->private_impl.loop_count++;\n return true;\n }\n return false;\n}\n\n// wuffs_base__image_buffer__dirty_palette returns whether this frame's palette\n// differs from the previous frame. It is conservative and may return false\n// positives (but never false negatives).\nstatic inline bool wuffs_base__image_buffer__dirty_palette(\n wuffs_base__image_buffer* b) {\n return b && b->private_impl.dirty_palette;\n}\n\n// wuffs_base__image_buffer__d" +
|
||||
"irty_rect returns an upper bound for what part of\n// this frame's pixels differs from the previous frame.\nstatic inline wuffs_base__rect_ie_u32 wuffs_base__image_buffer__dirty_rect(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.dirty_rect : ((wuffs_base__rect_ie_u32){0});\n}\n\n// wuffs_base__image_buffer__duration returns the amount of time to display\n// this frame. Zero means to display forever - a still (non-animated) image.\nstatic inline wuffs_base__flicks wuffs_base__image_buffer__duration(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.duration : 0;\n}\n\n// wuffs_base__image_buffer__palette returns the palette that the pixel data\n// can index. The backing array is inside b and has length 1024.\nstatic inline uint8_t* wuffs_base__image_buffer__palette(\n wuffs_base__image_buffer* b) {\n return b ? b->private_impl.palette : NULL;\n}\n\nstatic inline wuffs_base__table_u8 wuffs_base__image_buffer__plane(\n wuffs_base__image_buffer* b,\n uint32_t p) {\n return (b && (p < WUFFS" +
|
||||
"_BASE__PIXEL_FORMAT__NUM_PLANES_MAX))\n ? b->private_impl.pixbuf.planes[p]\n : ((wuffs_base__table_u8){});\n}\n\n#endif // WUFFS_BASE_HEADER_H\n" +
|
||||
""
|
||||
|
||||
const baseImpl = "" +
|
||||
|
||||
Reference in new issue
Block a user