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"
14 #include "vp9/common/vp9_common.h"
15 #include "vp9/encoder/vp9_extend.h"
16 #include "vp9/encoder/vp9_lookahead.h"
18 struct lookahead_ctx {
19 unsigned int max_sz; /* Absolute size of the queue */
20 unsigned int sz; /* Number of buffers currently in the queue */
21 unsigned int read_idx; /* Read index */
22 unsigned int write_idx; /* Write index */
23 struct lookahead_entry *buf; /* Buffer list */
27 /* Return the buffer at the given absolute index and increment the index */
28 static struct lookahead_entry * pop(struct lookahead_ctx *ctx,
30 unsigned int index = *idx;
31 struct lookahead_entry *buf = ctx->buf + index;
33 assert(index < ctx->max_sz);
34 if (++index >= ctx->max_sz)
41 void vp9_lookahead_destroy(struct lookahead_ctx *ctx) {
46 for (i = 0; i < ctx->max_sz; i++)
47 vp9_free_frame_buffer(&ctx->buf[i].img);
55 struct lookahead_ctx * vp9_lookahead_init(unsigned int width,
57 unsigned int subsampling_x,
58 unsigned int subsampling_y,
60 struct lookahead_ctx *ctx = NULL;
62 // Clamp the lookahead queue depth
63 depth = clamp(depth, 1, MAX_LAG_BUFFERS);
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,
81 vp9_lookahead_destroy(ctx);
85 #define USE_PARTIAL_COPY 0
87 int vp9_lookahead_push(struct lookahead_ctx *ctx, YV12_BUFFER_CONFIG *src,
88 int64_t ts_start, int64_t ts_end, unsigned int flags,
89 unsigned char *active_map) {
90 struct lookahead_entry *buf;
92 int row, col, active_end;
93 int mb_rows = (src->y_height + 15) >> 4;
94 int mb_cols = (src->y_width + 15) >> 4;
97 if (ctx->sz + 1 > ctx->max_sz)
100 buf = pop(ctx, &ctx->write_idx);
103 // TODO(jkoleszar): This is disabled for now, as
104 // vp9_copy_and_extend_frame_with_rect is not subsampling/alpha aware.
106 // Only do this partial copy if the following conditions are all met:
107 // 1. Lookahead queue has has size of 1.
108 // 2. Active map is provided.
109 // 3. This is not a key frame, golden nor altref frame.
110 if (ctx->max_sz == 1 && active_map && !flags) {
111 for (row = 0; row < mb_rows; ++row) {
115 // Find the first active macroblock in this row.
116 for (; col < mb_cols; ++col) {
121 // No more active macroblock in this row.
125 // Find the end of active region in this row.
128 for (; active_end < mb_cols; ++active_end) {
129 if (!active_map[active_end])
133 // Only copy this active region.
134 vp9_copy_and_extend_frame_with_rect(src, &buf->img,
137 (active_end - col) << 4);
139 // Start again from the end of this active region.
143 active_map += mb_cols;
146 vp9_copy_and_extend_frame(src, &buf->img);
149 // Partial copy not implemented yet
150 vp9_copy_and_extend_frame(src, &buf->img);
153 buf->ts_start = ts_start;
154 buf->ts_end = ts_end;
160 struct lookahead_entry * vp9_lookahead_pop(struct lookahead_ctx *ctx,
162 struct lookahead_entry *buf = NULL;
164 if (ctx->sz && (drain || ctx->sz == ctx->max_sz)) {
165 buf = pop(ctx, &ctx->read_idx);
172 struct lookahead_entry * vp9_lookahead_peek(struct lookahead_ctx *ctx,
174 struct lookahead_entry *buf = NULL;
176 assert(index < (int)ctx->max_sz);
177 if (index < (int)ctx->sz) {
178 index += ctx->read_idx;
179 if (index >= (int)ctx->max_sz)
180 index -= ctx->max_sz;
181 buf = ctx->buf + index;
186 unsigned int vp9_lookahead_depth(struct lookahead_ctx *ctx) {