2 * Copyright (c) 2011 The WebM project authors. All Rights Reserved.
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
13 #include "./vpx_config.h"
15 #include "vp9/common/vp9_common.h"
17 #include "vp9/encoder/vp9_encoder.h"
18 #include "vp9/encoder/vp9_extend.h"
19 #include "vp9/encoder/vp9_lookahead.h"
21 /* Return the buffer at the given absolute index and increment the index */
22 static struct lookahead_entry *pop(struct lookahead_ctx *ctx,
24 unsigned int index = *idx;
25 struct lookahead_entry *buf = ctx->buf + index;
27 assert(index < ctx->max_sz);
28 if (++index >= ctx->max_sz)
35 void vp9_lookahead_destroy(struct lookahead_ctx *ctx) {
40 for (i = 0; i < ctx->max_sz; i++)
41 vp9_free_frame_buffer(&ctx->buf[i].img);
49 struct lookahead_ctx *vp9_lookahead_init(unsigned int width,
51 unsigned int subsampling_x,
52 unsigned int subsampling_y,
53 #if CONFIG_VP9_HIGHBITDEPTH
57 struct lookahead_ctx *ctx = NULL;
59 // Clamp the lookahead queue depth
60 depth = clamp(depth, 1, MAX_LAG_BUFFERS);
62 // Allocate memory to keep previous source frames available.
63 depth += MAX_PRE_FRAMES;
65 // Allocate the lookahead structures
66 ctx = calloc(1, sizeof(*ctx));
70 ctx->buf = calloc(depth, sizeof(*ctx->buf));
73 for (i = 0; i < depth; i++)
74 if (vp9_alloc_frame_buffer(&ctx->buf[i].img,
75 width, height, subsampling_x, subsampling_y,
76 #if CONFIG_VP9_HIGHBITDEPTH
79 VP9_ENC_BORDER_IN_PIXELS))
84 vp9_lookahead_destroy(ctx);
88 #define USE_PARTIAL_COPY 0
90 int vp9_lookahead_push(struct lookahead_ctx *ctx, YV12_BUFFER_CONFIG *src,
91 int64_t ts_start, int64_t ts_end, unsigned int flags) {
92 struct lookahead_entry *buf;
94 int row, col, active_end;
95 int mb_rows = (src->y_height + 15) >> 4;
96 int mb_cols = (src->y_width + 15) >> 4;
99 if (ctx->sz + 1 + MAX_PRE_FRAMES > ctx->max_sz)
102 buf = pop(ctx, &ctx->write_idx);
105 // TODO(jkoleszar): This is disabled for now, as
106 // vp9_copy_and_extend_frame_with_rect is not subsampling/alpha aware.
108 // Only do this partial copy if the following conditions are all met:
109 // 1. Lookahead queue has has size of 1.
110 // 2. Active map is provided.
111 // 3. This is not a key frame, golden nor altref frame.
112 if (ctx->max_sz == 1 && active_map && !flags) {
113 for (row = 0; row < mb_rows; ++row) {
117 // Find the first active macroblock in this row.
118 for (; col < mb_cols; ++col) {
123 // No more active macroblock in this row.
127 // Find the end of active region in this row.
130 for (; active_end < mb_cols; ++active_end) {
131 if (!active_map[active_end])
135 // Only copy this active region.
136 vp9_copy_and_extend_frame_with_rect(src, &buf->img,
139 (active_end - col) << 4);
141 // Start again from the end of this active region.
145 active_map += mb_cols;
148 vp9_copy_and_extend_frame(src, &buf->img);
151 // Partial copy not implemented yet
152 vp9_copy_and_extend_frame(src, &buf->img);
155 buf->ts_start = ts_start;
156 buf->ts_end = ts_end;
162 struct lookahead_entry *vp9_lookahead_pop(struct lookahead_ctx *ctx,
164 struct lookahead_entry *buf = NULL;
166 if (ctx->sz && (drain || ctx->sz == ctx->max_sz - MAX_PRE_FRAMES)) {
167 buf = pop(ctx, &ctx->read_idx);
174 struct lookahead_entry *vp9_lookahead_peek(struct lookahead_ctx *ctx,
176 struct lookahead_entry *buf = NULL;
180 if (index < (int)ctx->sz) {
181 index += ctx->read_idx;
182 if (index >= (int)ctx->max_sz)
183 index -= ctx->max_sz;
184 buf = ctx->buf + index;
186 } else if (index < 0) {
188 if (-index <= MAX_PRE_FRAMES) {
189 index += ctx->read_idx;
191 index += ctx->max_sz;
192 buf = ctx->buf + index;
199 unsigned int vp9_lookahead_depth(struct lookahead_ctx *ctx) {