mirror of
https://github.com/ultravideo/uvg266.git
synced 2024-11-27 19:24:06 +00:00
224 lines
6.9 KiB
C
224 lines
6.9 KiB
C
/*****************************************************************************
|
|
* This file is part of uvg266 VVC encoder.
|
|
*
|
|
* Copyright (c) 2021, Tampere University, ITU/ISO/IEC, project contributors
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
* are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* * Redistributions in binary form must reproduce the above copyright notice, this
|
|
* list of conditions and the following disclaimer in the documentation and/or
|
|
* other materials provided with the distribution.
|
|
*
|
|
* * Neither the name of the Tampere University or ITU/ISO/IEC nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
* INCLUDING NEGLIGENCE OR OTHERWISE ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
****************************************************************************/
|
|
|
|
#include "imagelist.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "image.h"
|
|
#include "threads.h"
|
|
|
|
|
|
/**
|
|
* \brief Allocate memory for image_list
|
|
* \param size initial array size
|
|
* \return image_list pointer, NULL on failure
|
|
*/
|
|
image_list_t * uvg_image_list_alloc(int size)
|
|
{
|
|
image_list_t *list = (image_list_t *)malloc(sizeof(image_list_t));
|
|
list->size = size;
|
|
list->images = malloc(sizeof(uvg_picture*) * size);
|
|
list->cu_arrays = malloc(sizeof(cu_array_t*) * size);
|
|
list->pocs = malloc(sizeof(int32_t) * size);
|
|
list->ref_LXs = malloc(sizeof(*list->ref_LXs) * size);
|
|
list->used_size = 0;
|
|
|
|
return list;
|
|
}
|
|
|
|
/**
|
|
* \brief Resize image_list array
|
|
* \param list image_list pointer
|
|
* \param size new array size
|
|
* \return 1 on success, 0 on failure
|
|
*/
|
|
int uvg_image_list_resize(image_list_t *list, unsigned size)
|
|
{
|
|
list->images = (uvg_picture**)realloc(list->images, sizeof(uvg_picture*) * size);
|
|
list->cu_arrays = (cu_array_t**)realloc(list->cu_arrays, sizeof(cu_array_t*) * size);
|
|
list->pocs = realloc(list->pocs, sizeof(int32_t) * size);
|
|
list->ref_LXs = realloc(list->ref_LXs, sizeof(*list->ref_LXs) * size);
|
|
list->size = size;
|
|
return size == 0 || (list->images && list->cu_arrays && list->pocs);
|
|
}
|
|
|
|
/**
|
|
* \brief Free memory allocated to the picture_list
|
|
* \param list image_list pointer
|
|
* \return 1 on success, 0 on failure
|
|
*/
|
|
int uvg_image_list_destroy(image_list_t *list)
|
|
{
|
|
unsigned int i;
|
|
if (list->used_size > 0) {
|
|
for (i = 0; i < list->used_size; ++i) {
|
|
uvg_image_free(list->images[i]);
|
|
list->images[i] = NULL;
|
|
uvg_cu_array_free(&list->cu_arrays[i]);
|
|
list->cu_arrays[i] = NULL;
|
|
list->pocs[i] = 0;
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[i][0][j] = 0;
|
|
list->ref_LXs[i][1][j] = 0;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (list->size > 0) {
|
|
free(list->images);
|
|
free(list->cu_arrays);
|
|
free(list->pocs);
|
|
free(list->ref_LXs);
|
|
}
|
|
list->images = NULL;
|
|
list->cu_arrays = NULL;
|
|
list->pocs = NULL;
|
|
list->ref_LXs = NULL;
|
|
free(list);
|
|
return 1;
|
|
}
|
|
|
|
/**
|
|
* \brief Add picture to the front of the picturelist
|
|
* \param pic picture pointer to add
|
|
* \param picture_list list to use
|
|
* \return 1 on success
|
|
*/
|
|
int uvg_image_list_add(image_list_t *list, uvg_picture *im, cu_array_t *cua, int32_t poc, uint8_t ref_LX[2][16])
|
|
{
|
|
int i = 0;
|
|
if (UVG_ATOMIC_INC(&(im->refcount)) == 1) {
|
|
fprintf(stderr, "Tried to add an unreferenced picture. This is a bug!\n");
|
|
assert(0); //Stop for debugging
|
|
return 0;
|
|
}
|
|
|
|
if (UVG_ATOMIC_INC(&(cua->refcount)) == 1) {
|
|
fprintf(stderr, "Tried to add an unreferenced cu_array. This is a bug!\n");
|
|
assert(0); //Stop for debugging
|
|
return 0;
|
|
}
|
|
|
|
if (list->size == list->used_size) {
|
|
unsigned new_size = MAX(list->size + 1, list->size * 2);
|
|
if (!uvg_image_list_resize(list, new_size)) return 0;
|
|
}
|
|
|
|
for (i = list->used_size; i > 0; i--) {
|
|
list->images[i] = list->images[i - 1];
|
|
list->cu_arrays[i] = list->cu_arrays[i - 1];
|
|
list->pocs[i] = list->pocs[i - 1];
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[i][0][j] = list->ref_LXs[i - 1][0][j];
|
|
list->ref_LXs[i][1][j] = list->ref_LXs[i - 1][1][j];
|
|
}
|
|
}
|
|
|
|
list->images[0] = im;
|
|
list->cu_arrays[0] = cua;
|
|
list->pocs[0] = poc;
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[0][0][j] = ref_LX[0][j];
|
|
list->ref_LXs[0][1][j] = ref_LX[1][j];
|
|
}
|
|
|
|
list->used_size++;
|
|
return 1;
|
|
}
|
|
|
|
/**
|
|
* \brief Remove picture from picturelist
|
|
* \param list list to use
|
|
* \param n index to remove
|
|
* \return 1 on success
|
|
*/
|
|
int uvg_image_list_rem(image_list_t * const list, const unsigned n)
|
|
{
|
|
// Must be within list boundaries
|
|
if (n >= list->used_size)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
uvg_image_free(list->images[n]);
|
|
|
|
uvg_cu_array_free(&list->cu_arrays[n]);
|
|
|
|
// The last item is easy to remove
|
|
if (n == list->used_size - 1) {
|
|
list->images[n] = NULL;
|
|
list->cu_arrays[n] = NULL;
|
|
list->pocs[n] = 0;
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[n][0][j] = 0;
|
|
list->ref_LXs[n][1][j] = 0;
|
|
}
|
|
list->used_size--;
|
|
} else {
|
|
int i = n;
|
|
// Shift all following pics one backward in the list
|
|
for (i = n; i < list->used_size - 1; ++i) {
|
|
list->images[i] = list->images[i + 1];
|
|
list->cu_arrays[i] = list->cu_arrays[i + 1];
|
|
list->pocs[i] = list->pocs[i + 1];
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[i][0][j] = list->ref_LXs[i + 1][0][j];
|
|
list->ref_LXs[i][1][j] = list->ref_LXs[i + 1][1][j];
|
|
}
|
|
}
|
|
list->images[list->used_size - 1] = NULL;
|
|
list->cu_arrays[list->used_size - 1] = NULL;
|
|
list->pocs[list->used_size - 1] = 0;
|
|
for (int j = 0; j < 16; j++) {
|
|
list->ref_LXs[list->used_size - 1][0][j] = 0;
|
|
list->ref_LXs[list->used_size - 1][1][j] = 0;
|
|
}
|
|
list->used_size--;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
int uvg_image_list_copy_contents(image_list_t *target, image_list_t *source) {
|
|
int i;
|
|
while (target->used_size > 0) {
|
|
uvg_image_list_rem(target, 0);
|
|
}
|
|
|
|
for (i = source->used_size - 1; i >= 0; --i) {
|
|
uvg_image_list_add(target, source->images[i], source->cu_arrays[i], source->pocs[i], source->ref_LXs[i]);
|
|
}
|
|
return 1;
|
|
}
|