Subversion Repositories openrisc

//=================================================================

//

//        malloc1.c

//

//        Testcase for C library malloc(), calloc() and free()

//

//=================================================================

// ####ECOSGPLCOPYRIGHTBEGIN####                                            

// -------------------------------------------                              

// This file is part of eCos, the Embedded Configurable Operating System.   

// Copyright (C) 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.

//

// eCos is free software; you can redistribute it and/or modify it under    

// the terms of the GNU General Public License as published by the Free     

// Software Foundation; either version 2 or (at your option) any later      

// version.                                                                 

//

// eCos is distributed in the hope that it will be useful, but WITHOUT      

// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or    

// FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License    

// for more details.                                                        

//

// You should have received a copy of the GNU General Public License        

// along with eCos; if not, write to the Free Software Foundation, Inc.,    

// 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.            

//

// As a special exception, if other files instantiate templates or use      

// macros or inline functions from this file, or you compile this file      

// and link it with other works to produce a work based on this file,       

// this file does not by itself cause the resulting work to be covered by   

// the GNU General Public License. However the source code for this file    

// must still be made available in accordance with section (3) of the GNU   

// General Public License v2.                                               

//

// This exception does not invalidate any other reasons why a work based    

// on this file might be covered by the GNU General Public License.         

// -------------------------------------------                              

// ####ECOSGPLCOPYRIGHTEND####                                              

//=================================================================

//#####DESCRIPTIONBEGIN####

//

// Author(s):     jlarmour

// Contributors:  

// Date:          2000-04-30

// Description:   Contains testcode for C library malloc(), calloc() and

//                free() functions

//

//

//####DESCRIPTIONEND####

// INCLUDES

#include <pkgconf/system.h>

#include <pkgconf/memalloc.h> // config header

#ifdef CYGPKG_ISOINFRA

# include <pkgconf/isoinfra.h>

# include <stdlib.h>

#endif

#include <cyg/infra/testcase.h>

#include <limits.h> // INT_MAX

#if !defined(CYGPKG_ISOINFRA)

# define NA_MSG "Requires isoinfra package"

#elif !CYGINT_ISO_MAIN_STARTUP

# define NA_MSG "Requires main() to be called"

#elif !CYGINT_ISO_MALLOC

# define NA_MSG "Requires malloc"

#elif !CYGINT_ISO_MALLINFO

# define NA_MSG "Requires mallinfo"

#endif

#ifdef NA_MSG

void

cyg_start(void)

{

    CYG_TEST_INIT();

    CYG_TEST_NA( NA_MSG );

    CYG_TEST_FINISH("Done");

}

#else

// FUNCTIONS

int

main( int argc, char *argv[] )

{

    int *i;

    char *str, *str2, *str3;

    int j;

    int poolmax;

    CYG_TEST_INIT();

    CYG_TEST_INFO("Starting tests from testcase " __FILE__ " for C library "

                  "malloc(), calloc() and free() functions");

    poolmax = mallinfo().maxfree;

    if ( poolmax <= 0 ) {

        CYG_TEST_FAIL_FINISH( "Can't determine allocation size to use" );

    }

    // Test 1

    i = (int *) malloc( sizeof(int) );

    // check if it should fit into pool

    if (sizeof(int) > poolmax)

    {

        // didn't fit into pool, so should be NULL

        CYG_TEST_PASS_FAIL( i == NULL,

                            "1 int malloc with no space left works" );

    }

    else

    {

        // since it should fit into pool, we can fiddle with i

        *i=-12345;

        CYG_TEST_PASS_FAIL( i && (*i==-12345),

                            "1 int malloc with space left works" );

        free(i);

    } // else

    // Test 2

    str=(char *) malloc( 4096 );

    if ( 4096 > poolmax)

    {

        // didn't fit into pool, so should be NULL

        CYG_TEST_PASS_FAIL( str == NULL,"4K string with no space left works" );

    }

    else

    {

        // since it should fit into pool, we can fiddle with it.

        for (j=0; j<1024; j++)

        {

            str[j*4] = 'f';

            str[(j*4)+1] = 'r';

            str[(j*4)+2] = 'e';

            str[(j*4)+3] = 'd';

        } // for

        for (j=0; j<1024; j++)

        {

            if ( ((str[j*4] != 'f') ||

                  (str[(j*4)+1] != 'r') ||

                  (str[(j*4)+2] != 'e') ||

                  (str[(j*4)+3] != 'd')) )

                break;

        } // for

        // did j reach the top?

        CYG_TEST_PASS_FAIL( j==1024, "4K string with space left works" );

        free(str);

    } // else       

    // Test 3

    str=(char *) calloc( 2, 1024 );

    if ( 2048 > poolmax)

    {

        // didn't fit into pool, so should be NULL

        CYG_TEST_PASS_FAIL( str == NULL,

                            "calloc 2K string with no space left works" );

    }

    else

    {

        // check its zeroed

        for ( j=0; j<2048; j++ )

        {

            if (str[j] != 0)

                break;

        } // for

        CYG_TEST_PASS_FAIL( j==2048, "calloc 2K string is cleared" );

        // since it should fit into pool, we can fiddle with it.

        for (j=0; j<512; j++)

        {

            str[j*4] = 'j';

            str[(j*4)+1] = 'i';

            str[(j*4)+2] = 'f';

            str[(j*4)+3] = 'l';

        } // for

        for (j=0; j<512; j++)

        {

            if ( ((str[j*4] != 'j') ||

                  (str[(j*4)+1] != 'i') ||

                  (str[(j*4)+2] != 'f') ||

                  (str[(j*4)+3] != 'l')) )

                break;

        } // for

        // did j reach the top?

        CYG_TEST_PASS_FAIL( j==512,

                            "calloc 2K string - with space left works" );

        free(str);

    } // else       

    // Test 4

#if defined(CYGIMP_MEMALLOC_MALLOC_VARIABLE_SIMPLE) && \

      defined(CYGSEM_MEMALLOC_ALLOCATOR_VARIABLE_COALESCE)

    poolmax = mallinfo().maxfree; // recalculate for non-coalescing allocator

#endif

    str=(char *)malloc( poolmax+1 );

    CYG_TEST_PASS_FAIL( str==NULL, "malloc too much data returns NULL" );

    // Test 5

    str=(char *)calloc( 1, poolmax+1 );

    CYG_TEST_PASS_FAIL( str==NULL, "calloc too much data returns NULL" );

    // Test 6

    str=(char *)malloc(0); if (str != NULL) free(str);

    str=(char *)calloc(0, 1); if (str != NULL) free(str);

    str=(char *)calloc(1, 0); if (str != NULL) free(str);

    str=(char *)calloc(0, 0); if (str != NULL) free(str);

    // simply shouldn't barf by this point

    CYG_TEST_PASS_FAIL( 1, "malloc and calloc of 0 bytes doesn't crash" );

    // Test 7

    str = (char *)malloc(10);

    i = (int *)malloc(sizeof(int));

    str2 = (char *)malloc(10);

    str3=(char *)i;

    CYG_TEST_PASS_FAIL( ((str3 <= str-sizeof(int))  || (str3 >= &str[10])) &&

                        ((str3 <= str2-sizeof(int)) || (str3 >= &str2[10])) &&

                        ((str+10 <= str2) || (str2+10 <= str)),

                        "Objects don't overlap" );

    // Test 8

    free(i);

    i=(int *)malloc(sizeof(int)*2);

    str3=(char *)i;

    CYG_TEST_PASS_FAIL( ((str3 <= str-sizeof(int))  || (str3 >= &str[10])) &&

                        ((str3 <= str2-sizeof(int)) || (str3 >= &str2[10])) &&

                        ((&str[10] <= str2) || (&str2[10] <= str)),

                        "Objects don't overlap when middle is freed" );

    free(i);

    free(str);

    free(str2);

    // Test 9

#if defined(CYGIMP_MEMALLOC_MALLOC_VARIABLE_SIMPLE) && \

      defined(CYGSEM_MEMALLOC_ALLOCATOR_VARIABLE_COALESCE)

    poolmax = mallinfo().maxfree; // recalculate for non-coalescing allocator

#endif

    str = (char *)malloc( poolmax );

    CYG_TEST_PASS_FAIL( str != NULL, "malloc of maximum free block size works");

    free(str);

    CYG_TEST_FINISH("Finished tests from testcase " __FILE__ " for C library "

                    "malloc(), calloc() and free() functions");

    return 0;

} // main()

#endif // ifndef NA_MSG

// EOF malloc1.c