mirror of
https://chromium.googlesource.com/libyuv/libyuv
synced 2026-10-28 18:07:12 +08:00
0c781f87b8
Reduces include/libyuv/basic_types.h to only define LIBYUV_API. Directly includes <stdint.h> and <stddef.h> where needed in public headers. Replaces LIBYUV_BOOL, LIBYUV_FALSE, and LIBYUV_TRUE with C++ bool, true, and false in C++ code (MJpegDecoder, unit tests) and int (0, 1) for C API functions. Updates documentation and unit tests. Test: ninja -C out/Release libyuv_unittest && ./out/Release/libyuv_unittest --gtest_filter=* Change-Id: I2d58e872f0f976263bcda546dcc3b1b5f7e53d58 TAG=agy CONV=2730bc56-93ff-48ed-b615-dcde1b834394 Reviewed-on: https://chromium-review.googlesource.com/c/libyuv/libyuv/+/8280662 Commit-Queue: Wan-Teh Chang <wtc@google.com> Reviewed-by: Wan-Teh Chang <wtc@google.com>
339 lines
11 KiB
C++
339 lines
11 KiB
C++
/*
|
|
* Copyright 2011 The LibYuv Project Authors. All rights reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#ifndef INCLUDE_LIBYUV_SCALE_H_
|
|
#define INCLUDE_LIBYUV_SCALE_H_
|
|
|
|
#include <stdint.h>
|
|
|
|
#include "libyuv/basic_types.h"
|
|
|
|
#ifdef __cplusplus
|
|
namespace libyuv {
|
|
extern "C" {
|
|
#endif
|
|
|
|
// Supported filtering.
|
|
typedef enum FilterMode {
|
|
kFilterNone = 0, // Point sample; Fastest.
|
|
kFilterLinear = 1, // Filter horizontally only.
|
|
kFilterBilinear = 2, // Faster than box, but lower quality scaling down.
|
|
kFilterBox = 3 // Highest quality.
|
|
} FilterModeEnum;
|
|
|
|
// Scale a YUV plane.
|
|
// Returns 0 if successful.
|
|
LIBYUV_API
|
|
int ScalePlane(const uint8_t* src,
|
|
int src_stride,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst,
|
|
int dst_stride,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int ScalePlane_16(const uint16_t* src,
|
|
int src_stride,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst,
|
|
int dst_stride,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
// Sample is expected to be in the low 12 bits.
|
|
LIBYUV_API
|
|
int ScalePlane_12(const uint16_t* src,
|
|
int src_stride,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst,
|
|
int dst_stride,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
// Scales a YUV 4:2:0 image from the src width and height to the
|
|
// dst width and height.
|
|
// If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
|
// used. This produces basic (blocky) quality at the fastest speed.
|
|
// If filtering is kFilterBilinear, interpolation is used to produce a better
|
|
// quality image, at the expense of speed.
|
|
// If filtering is kFilterBox, averaging is used to produce ever better
|
|
// quality image, at further expense of speed.
|
|
// Returns 0 if successful.
|
|
|
|
LIBYUV_API
|
|
int I420Scale(const uint8_t* src_y,
|
|
int src_stride_y,
|
|
const uint8_t* src_u,
|
|
int src_stride_u,
|
|
const uint8_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
int dst_stride_y,
|
|
uint8_t* dst_u,
|
|
int dst_stride_u,
|
|
uint8_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I420Scale_16(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I420Scale_12(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
// Scales a YUV 4:4:4 image from the src width and height to the
|
|
// dst width and height.
|
|
// If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
|
// used. This produces basic (blocky) quality at the fastest speed.
|
|
// If filtering is kFilterBilinear, interpolation is used to produce a better
|
|
// quality image, at the expense of speed.
|
|
// If filtering is kFilterBox, averaging is used to produce ever better
|
|
// quality image, at further expense of speed.
|
|
// Returns 0 if successful.
|
|
|
|
LIBYUV_API
|
|
int I444Scale(const uint8_t* src_y,
|
|
int src_stride_y,
|
|
const uint8_t* src_u,
|
|
int src_stride_u,
|
|
const uint8_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
int dst_stride_y,
|
|
uint8_t* dst_u,
|
|
int dst_stride_u,
|
|
uint8_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I444Scale_16(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I444Scale_12(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
// Scales a YUV 4:2:2 image from the src width and height to the
|
|
// dst width and height.
|
|
// If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
|
// used. This produces basic (blocky) quality at the fastest speed.
|
|
// If filtering is kFilterBilinear, interpolation is used to produce a better
|
|
// quality image, at the expense of speed.
|
|
// If filtering is kFilterBox, averaging is used to produce ever better
|
|
// quality image, at further expense of speed.
|
|
// Returns 0 if successful.
|
|
LIBYUV_API
|
|
int I422Scale(const uint8_t* src_y,
|
|
int src_stride_y,
|
|
const uint8_t* src_u,
|
|
int src_stride_u,
|
|
const uint8_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
int dst_stride_y,
|
|
uint8_t* dst_u,
|
|
int dst_stride_u,
|
|
uint8_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I422Scale_16(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int I422Scale_12(const uint16_t* src_y,
|
|
int src_stride_y,
|
|
const uint16_t* src_u,
|
|
int src_stride_u,
|
|
const uint16_t* src_v,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint16_t* dst_y,
|
|
int dst_stride_y,
|
|
uint16_t* dst_u,
|
|
int dst_stride_u,
|
|
uint16_t* dst_v,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
// Scales an NV12 image from the src width and height to the
|
|
// dst width and height.
|
|
// If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
|
// used. This produces basic (blocky) quality at the fastest speed.
|
|
// If filtering is kFilterBilinear, interpolation is used to produce a better
|
|
// quality image, at the expense of speed.
|
|
// kFilterBox is not supported for the UV channel and will be treated as
|
|
// bilinear.
|
|
// Returns 0 if successful.
|
|
|
|
LIBYUV_API
|
|
int NV12Scale(const uint8_t* src_y,
|
|
int src_stride_y,
|
|
const uint8_t* src_uv,
|
|
int src_stride_uv,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
int dst_stride_y,
|
|
uint8_t* dst_uv,
|
|
int dst_stride_uv,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
LIBYUV_API
|
|
int NV24Scale(const uint8_t* src_y,
|
|
int src_stride_y,
|
|
const uint8_t* src_uv,
|
|
int src_stride_uv,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
int dst_stride_y,
|
|
uint8_t* dst_uv,
|
|
int dst_stride_uv,
|
|
int dst_width,
|
|
int dst_height,
|
|
enum FilterMode filtering);
|
|
|
|
#ifdef __cplusplus
|
|
// Legacy API. Deprecated.
|
|
LIBYUV_API
|
|
int Scale(const uint8_t* src_y,
|
|
const uint8_t* src_u,
|
|
const uint8_t* src_v,
|
|
int src_stride_y,
|
|
int src_stride_u,
|
|
int src_stride_v,
|
|
int src_width,
|
|
int src_height,
|
|
uint8_t* dst_y,
|
|
uint8_t* dst_u,
|
|
uint8_t* dst_v,
|
|
int dst_stride_y,
|
|
int dst_stride_u,
|
|
int dst_stride_v,
|
|
int dst_width,
|
|
int dst_height,
|
|
int interpolate);
|
|
|
|
// For testing, allow disabling of specialized scalers.
|
|
LIBYUV_API
|
|
void SetUseReferenceImpl(int use);
|
|
#endif // __cplusplus
|
|
|
|
#ifdef __cplusplus
|
|
} // extern "C"
|
|
} // namespace libyuv
|
|
#endif
|
|
|
|
#endif // INCLUDE_LIBYUV_SCALE_H_
|