2011-09-19 15:12:01 +02:00
|
|
|
/*
|
2014-04-03 17:30:57 +02:00
|
|
|
* The copyright in this software is being made available under the 2-clauses
|
|
|
|
* BSD License, included below. This software may be subject to other third
|
|
|
|
* party and contributor rights, including patent rights, and no such rights
|
|
|
|
* are granted under this license.
|
|
|
|
*
|
2011-09-19 15:12:01 +02:00
|
|
|
* Copyright (c) 2008, Jerome Fimes, Communications & Systemes <jerome.fimes@c-s.fr>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. 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.
|
|
|
|
*
|
|
|
|
* 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 OWNER 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 (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "opj_includes.h"
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Default size of the validation list, if not sufficient, data will be reallocated with a double size.
|
|
|
|
*/
|
|
|
|
#define OPJ_VALIDATION_SIZE 10
|
|
|
|
|
|
|
|
opj_procedure_list_t * opj_procedure_list_create()
|
|
|
|
{
|
2012-08-22 20:45:31 +02:00
|
|
|
/* memory allocation */
|
2014-09-16 17:48:04 +02:00
|
|
|
opj_procedure_list_t * l_validation = (opj_procedure_list_t *) opj_calloc(1,sizeof(opj_procedure_list_t));
|
2012-09-27 16:47:34 +02:00
|
|
|
if (! l_validation)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
return 00;
|
|
|
|
}
|
|
|
|
/* initialization */
|
|
|
|
l_validation->m_nb_max_procedures = OPJ_VALIDATION_SIZE;
|
2014-09-16 17:48:04 +02:00
|
|
|
l_validation->m_procedures = (opj_procedure*)opj_calloc(OPJ_VALIDATION_SIZE, sizeof(opj_procedure));
|
2012-09-27 16:47:34 +02:00
|
|
|
if (! l_validation->m_procedures)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
opj_free(l_validation);
|
|
|
|
return 00;
|
|
|
|
}
|
|
|
|
return l_validation;
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void opj_procedure_list_destroy(opj_procedure_list_t * p_list)
|
|
|
|
{
|
2012-09-27 16:47:34 +02:00
|
|
|
if (! p_list)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* initialization */
|
2012-09-27 16:47:34 +02:00
|
|
|
if (p_list->m_procedures)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
opj_free(p_list->m_procedures);
|
|
|
|
}
|
|
|
|
opj_free(p_list);
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|
|
|
|
|
2015-07-30 23:26:31 +02:00
|
|
|
OPJ_BOOL opj_procedure_list_add_procedure (opj_procedure_list_t * p_validation_list, opj_procedure p_procedure, opj_event_mgr_t* p_manager )
|
2011-09-19 15:12:01 +02:00
|
|
|
{
|
2015-07-30 23:26:31 +02:00
|
|
|
|
|
|
|
assert(p_manager != NULL);
|
|
|
|
|
2012-09-27 16:47:34 +02:00
|
|
|
if (p_validation_list->m_nb_max_procedures == p_validation_list->m_nb_procedures)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
opj_procedure * new_procedures;
|
2012-08-13 09:49:49 +02:00
|
|
|
|
2012-08-22 20:45:31 +02:00
|
|
|
p_validation_list->m_nb_max_procedures += OPJ_VALIDATION_SIZE;
|
2012-08-13 09:49:49 +02:00
|
|
|
new_procedures = (opj_procedure*)opj_realloc(
|
2012-09-27 16:47:34 +02:00
|
|
|
p_validation_list->m_procedures,
|
|
|
|
p_validation_list->m_nb_max_procedures * sizeof(opj_procedure));
|
|
|
|
if (! new_procedures)
|
2012-08-22 20:45:31 +02:00
|
|
|
{
|
|
|
|
opj_free(p_validation_list->m_procedures);
|
|
|
|
p_validation_list->m_nb_max_procedures = 0;
|
|
|
|
p_validation_list->m_nb_procedures = 0;
|
2015-07-30 23:26:31 +02:00
|
|
|
opj_event_msg(p_manager, EVT_ERROR, "Not enough memory to add a new validation procedure\n");
|
2012-08-22 20:45:31 +02:00
|
|
|
return OPJ_FALSE;
|
|
|
|
}
|
2012-08-10 19:15:57 +02:00
|
|
|
else
|
|
|
|
{
|
2012-08-22 20:45:31 +02:00
|
|
|
p_validation_list->m_procedures = new_procedures;
|
2012-08-10 19:15:57 +02:00
|
|
|
}
|
2012-08-22 20:45:31 +02:00
|
|
|
}
|
|
|
|
p_validation_list->m_procedures[p_validation_list->m_nb_procedures] = p_procedure;
|
|
|
|
++p_validation_list->m_nb_procedures;
|
2012-09-27 16:47:34 +02:00
|
|
|
|
2012-08-22 20:45:31 +02:00
|
|
|
return OPJ_TRUE;
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|
|
|
|
|
2012-10-25 09:39:59 +02:00
|
|
|
OPJ_UINT32 opj_procedure_list_get_nb_procedures (opj_procedure_list_t * p_validation_list)
|
2011-09-19 15:12:01 +02:00
|
|
|
{
|
2012-08-22 20:45:31 +02:00
|
|
|
return p_validation_list->m_nb_procedures;
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|
|
|
|
|
2012-10-25 09:39:59 +02:00
|
|
|
opj_procedure* opj_procedure_list_get_first_procedure (opj_procedure_list_t * p_validation_list)
|
2011-09-19 15:12:01 +02:00
|
|
|
{
|
2012-08-22 20:45:31 +02:00
|
|
|
return p_validation_list->m_procedures;
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|
|
|
|
|
2012-10-25 09:39:59 +02:00
|
|
|
void opj_procedure_list_clear (opj_procedure_list_t * p_validation_list)
|
2011-09-19 15:12:01 +02:00
|
|
|
{
|
2012-08-22 20:45:31 +02:00
|
|
|
p_validation_list->m_nb_procedures = 0;
|
2011-09-19 15:12:01 +02:00
|
|
|
}
|