F5OEO-tstools/test_nal_unit_list.c

175 wiersze
4.4 KiB
C
Czysty Zwykły widok Historia

/*
* A simple test for the NAL unit lists from nalunit.c
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is the MPEG TS, PS and ES tools.
*
* The Initial Developer of the Original Code is Amino Communications Ltd.
* Portions created by the Initial Developer are Copyright (C) 2008
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Amino Communications Ltd, Swavesey, Cambridge UK
*
* ***** END LICENSE BLOCK *****
*/
#include <stdio.h>
#include <stdlib.h>
#include "compat.h"
#include "nalunit_fns.h"
int main(int argc, char **argv)
{
int err, ii;
int max = NAL_UNIT_LIST_START_SIZE + NAL_UNIT_LIST_INCREMENT + 3;
nal_unit_list_p list = NULL;
nal_unit_p unit = NULL;
printf("NAL unit lists are now handled as NAL unit lists, so...\n");
printf("Testing NAL unit list\n");
printf("Test 1 - differing NAL units\n");
err = build_nal_unit_list(&list);
if (err)
{
printf("Test failed - constructing list\n");
return 1;
}
for (ii=0; ii<max; ii++)
{
err = build_nal_unit(&unit);
if (err)
{
printf("Test failed - constructing NAL unit\n");
return 1;
}
err = append_to_nal_unit_list(list,unit);
if (err)
{
printf("Test failed - appending NAL unit %d\n",ii);
return 1;
}
if (list->length > list->size)
{
printf("Test failed - list length = %d, size = %d\n",
list->length,list->size);
return 1;
}
else if (list->length != ii+1)
{
printf("Test failed - list length is %d, expected %d\n",
list->length,ii+1);
return 1;
}
else if (list->array[ii] != unit)
{
printf("Test failed - list->array[%d] is %p, expected %p\n",
ii,list->array[ii],unit);
return 1;
}
}
printf("Test 1 - resetting list\n");
reset_nal_unit_list(list,TRUE);
if (list->length != 0)
{
printf("Test failed - list length is %d, not 0\n",list->length);
return 1;
}
if (list->array[0] != NULL)
{
printf("Test failed - list->array[0] is %p, not NULL\n",list->array[0]);
return 1;
}
// And try populating the list again, but a bit further this time
for (ii=0; ii<max+NAL_UNIT_LIST_INCREMENT; ii++)
{
err = build_nal_unit(&unit);
if (err)
{
printf("Test failed - constructing NAL unit\n");
return 1;
}
err = append_to_nal_unit_list(list,unit);
if (err)
{
printf("Test failed - appending NAL unit %d\n",ii);
return 1;
}
if (list->length > list->size)
{
printf("Test failed - list length = %d, size = %d\n",
list->length,list->size);
return 1;
}
else if (list->length != ii+1)
{
printf("Test failed - list length is %d, expected %d\n",
list->length,ii+1);
return 1;
}
else if (list->array[ii] != unit)
{
printf("Test failed - list->array[%d] is %p, expected %p\n",
ii,list->array[ii],unit);
return 1;
}
}
printf("Test 1 - clearing list\n");
free_nal_unit_list(&list,TRUE);
printf("Test 1 succeeded\n");
printf("Test 2 - the same NAL unit inserted multiple times\n");
err = build_nal_unit_list(&list);
if (err)
{
printf("Test failed - constructing list\n");
return 1;
}
err = build_nal_unit(&unit);
if (err)
{
printf("Test failed - constructing NAL unit\n");
return 1;
}
// We aren't testing allocation limits this time round
for (ii=0; ii<5; ii++)
{
err = append_to_nal_unit_list(list,unit);
if (err)
{
printf("Test failed - appending NAL unit %d\n",ii);
return 1;
}
}
printf("Test 2 - clearing list\n");
free_nal_unit_list(&list,FALSE); // better only do a shallow free
free_nal_unit(&unit);
printf("Test 2 succeeded\n");
return 0;
}
// Local Variables:
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 2
// End:
// vim: set tabstop=8 shiftwidth=2 expandtab: