mirror of
https://github.com/mpv-player/mpv
synced 2024-12-16 20:05:07 +00:00
d4bdd0473d
Tis drops the silly lib prefixes, and attempts to organize the tree in
a more logical way. Make the top-level directory less cluttered as
well.
Renames the following directories:
libaf -> audio/filter
libao2 -> audio/out
libvo -> video/out
libmpdemux -> demux
Split libmpcodecs:
vf* -> video/filter
vd*, dec_video.* -> video/decode
mp_image*, img_format*, ... -> video/
ad*, dec_audio.* -> audio/decode
libaf/format.* is moved to audio/ - this is similar to how mp_image.*
is located in video/.
Move most top-level .c/.h files to core. (talloc.c/.h is left on top-
level, because it's external.) Park some of the more annoying files
in compat/. Some of these are relicts from the time mplayer used
ffmpeg internals.
sub/ is not split, because it's too much of a mess (subtitle code is
mixed with OSD display and rendering).
Maybe the organization of core is not ideal: it mixes playback core
(like mplayer.c) and utility helpers (like bstr.c/h). Should the need
arise, the playback core will be moved somewhere else, while core
contains all helper and common code.
69 lines
2.3 KiB
C
69 lines
2.3 KiB
C
#ifndef MPLAYER_PACK_RECTANGLES_H
|
|
#define MPLAYER_PACK_RECTANGLES_H
|
|
|
|
struct pos {
|
|
int x;
|
|
int y;
|
|
};
|
|
|
|
struct bitmap_packer {
|
|
int w;
|
|
int h;
|
|
int w_max;
|
|
int h_max;
|
|
int padding;
|
|
int count;
|
|
struct pos *in;
|
|
struct pos *result;
|
|
int used_width;
|
|
int used_height;
|
|
|
|
// internal
|
|
int *scratch;
|
|
int asize;
|
|
};
|
|
|
|
struct ass_image;
|
|
struct sub_bitmaps;
|
|
|
|
// Clear all internal state. Leave the following fields: w_max, h_max
|
|
void packer_reset(struct bitmap_packer *packer);
|
|
|
|
// Get the bounding box used for bitmap data (including padding).
|
|
// The bounding box doesn't exceed (0,0)-(packer->w,packer->h).
|
|
void packer_get_bb(struct bitmap_packer *packer, struct pos out_bb[2]);
|
|
|
|
/* Reallocate packer->in for at least to desired number of items.
|
|
* Also sets packer->count to the same value.
|
|
*/
|
|
void packer_set_size(struct bitmap_packer *packer, int size);
|
|
|
|
/* To use this, set packer->count to number of rectangles, w_max and h_max
|
|
* to maximum output rectangle size, and w and h to start size (may be 0).
|
|
* Write input sizes in packer->in.
|
|
* Resulting packing will be written in packer->result.
|
|
* w and h will be increased if necessary for successful packing.
|
|
* There is a strong guarantee that w and h will be powers of 2 (or set to 0).
|
|
* Return value is -1 if packing failed because w and h were set to max
|
|
* values but that wasn't enough, 1 if w or h was increased, and 0 otherwise.
|
|
*/
|
|
int packer_pack(struct bitmap_packer *packer);
|
|
|
|
/* Like above, but packer->count will be automatically set and
|
|
* packer->in will be reallocated if needed and filled from the
|
|
* given image list.
|
|
*/
|
|
int packer_pack_from_subbitmaps(struct bitmap_packer *packer,
|
|
struct sub_bitmaps *b);
|
|
|
|
// Copy the (already packed) sub-bitmaps from b to the image in data.
|
|
// data must point to an image that is at least (packer->w, packer->h) big.
|
|
// The image has the given stride (bytes between (x, y) to (x, y + 1)), and the
|
|
// pixel format used by both the sub-bitmaps and the image uses pixel_stride
|
|
// bytes per pixel (bytes between (x, y) to (x + 1, y)).
|
|
// If packer->padding is set, the padding borders are cleared with 0.
|
|
void packer_copy_subbitmaps(struct bitmap_packer *packer, struct sub_bitmaps *b,
|
|
void *data, int pixel_stride, int stride);
|
|
|
|
#endif
|