1 //==========================================================================
5 // Variable memory pool test 2
7 //==========================================================================
8 //####ECOSGPLCOPYRIGHTBEGIN####
9 // -------------------------------------------
10 // This file is part of eCos, the Embedded Configurable Operating System.
11 // Copyright (C) 1998, 1999, 2000, 2001, 2002 Red Hat, Inc.
13 // eCos is free software; you can redistribute it and/or modify it under
14 // the terms of the GNU General Public License as published by the Free
15 // Software Foundation; either version 2 or (at your option) any later version.
17 // eCos is distributed in the hope that it will be useful, but WITHOUT ANY
18 // WARRANTY; without even the implied warranty of MERCHANTABILITY or
19 // FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
22 // You should have received a copy of the GNU General Public License along
23 // with eCos; if not, write to the Free Software Foundation, Inc.,
24 // 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
26 // As a special exception, if other files instantiate templates or use macros
27 // or inline functions from this file, or you compile this file and link it
28 // with other works to produce a work based on this file, this file does not
29 // by itself cause the resulting work to be covered by the GNU General Public
30 // License. However the source code for this file must still be made available
31 // in accordance with section (3) of the GNU General Public License.
33 // This exception does not invalidate any other reasons why a work based on
34 // this file might be covered by the GNU General Public License.
36 // Alternative licenses for eCos may be arranged by contacting Red Hat, Inc.
37 // at http://sources.redhat.com/ecos/ecos-license/
38 // -------------------------------------------
39 //####ECOSGPLCOPYRIGHTEND####
40 //==========================================================================
41 //#####DESCRIPTIONBEGIN####
43 // Author(s): dsm, jlarmour
46 // Description: test allocation and freeing in variable memory pools
47 //####DESCRIPTIONEND####
49 #include <pkgconf/memalloc.h>
50 #include <pkgconf/system.h>
53 #include <pkgconf/kernel.h>
55 #include <cyg/kernel/sched.hxx> // Cyg_Scheduler::start()
56 #include <cyg/kernel/thread.hxx> // Cyg_Thread
57 #include <cyg/kernel/thread.inl>
58 #include <cyg/kernel/sema.hxx>
60 #include <cyg/kernel/sched.inl>
63 #include "testaux.hxx"
67 #include <cyg/memalloc/memvar.hxx>
69 #include <cyg/infra/testcase.h>
71 static const cyg_int32 memsize = 10240;
73 static cyg_uint8 mem[memsize];
75 static Cyg_Mempool_Variable mempool(mem, memsize);
77 #define NUM_PTRS 16 // Should be even
79 static cyg_uint8 *ptr[NUM_PTRS];
80 static cyg_int32 size[NUM_PTRS];
82 // We make a number of passes over a table of pointers which point to
83 // blocks of allocated memory. The block is freed and a new block
84 // allocated. The size and the order of the processing of blocks
86 static void entry( CYG_ADDRWORD data )
90 // The number of passes that can be successfully performed
91 // depends on the fragmentation performance of the memory
93 for(cyg_ucount32 passes = 0; passes < 10; passes++) {
96 // The order which the table is processed varies according to
98 cyg_ucount8 stepsize = (passes*2 + 1) % NUM_PTRS; // odd
101 for(cyg_ucount8 c=0, i=0; c < NUM_PTRS; c++) {
102 i = (i+stepsize) % NUM_PTRS;
104 for(cyg_ucount32 j=size[i];j--;) {
105 CYG_TEST_CHECK(ptr[i][j]==i, "Memory corrupted");
107 CYG_TEST_CHECK(mempool.free(ptr[i], size[i]),
110 s = (s*2 + 17) % 100; // size always odds therefore non-0
111 ptr[i] = mempool.try_alloc(s);
114 CYG_TEST_CHECK(NULL != ptr[i], "Memory pool not big enough");
115 CYG_TEST_CHECK(mem<=ptr[i] && ptr[i]+s < mem+memsize,
116 "Allocated region not within pool");
118 // Scribble over memory to check whether region overlaps
119 // with other regions. The contents of the memory are
120 // checked on freeing. This also tests that the memory
121 // does not overlap with allocator memory structures.
122 for(cyg_ucount32 j=size[i];j--;) {
128 CYG_TEST_PASS_FINISH("Variable memory pool 2 OK");
132 void memvar2_main( void )
135 CYG_TEST_INFO("Starting Variable memory pool 2 test");
137 for(cyg_ucount32 i = 0; i<NUM_PTRS; i++) {
142 new_thread(entry, 0);
143 Cyg_Scheduler::start();
148 CYG_TEST_FAIL_FINISH("Not reached");
154 #ifdef CYGSEM_HAL_STOP_CONSTRUCTORS_ON_FLAG
155 cyg_hal_invoke_constructors();