1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
//==========================================================================
//
// sepmeta2.cxx
//
// Variable memory pool with separate metadata test 2
//
//==========================================================================
// ####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): dsm, jlarmour
// Contributors:
// Date: 2001-06-28
// Description: test allocation and freeing in variable memory pools
//####DESCRIPTIONEND####
#include <pkgconf/memalloc.h>
#include <pkgconf/system.h>
#ifdef CYGPKG_KERNEL
#include <pkgconf/kernel.h>
#include <cyg/kernel/sched.hxx> // Cyg_Scheduler::start()
#include <cyg/kernel/thread.hxx> // Cyg_Thread
#include <cyg/kernel/thread.inl>
#include <cyg/kernel/sema.hxx>
#include <cyg/kernel/sched.inl>
#define NTHREADS 1
#include "testaux.hxx"
#endif
#include <cyg/memalloc/sepmeta.hxx>
#include <cyg/infra/testcase.h>
static const cyg_int32 memsize = 10240;
static const cyg_int32 metadatasize = 2048;
static cyg_uint8 mem[memsize];
static cyg_uint8 metadata[metadatasize];
static Cyg_Mempool_Sepmeta mempool(mem, memsize, 8,
metadata, metadatasize);
#define NUM_PTRS 16 // Should be even
static cyg_uint8 *ptr[NUM_PTRS];
static cyg_int32 size[NUM_PTRS];
// We make a number of passes over a table of pointers which point to
// blocks of allocated memory. The block is freed and a new block
// allocated. The size and the order of the processing of blocks
// is varied.
static void entry( CYG_ADDRWORD data )
{
cyg_uint32 s = 1;
// The number of passes that can be successfully performed
// depends on the fragmentation performance of the memory
// allocator.
for(cyg_ucount32 passes = 0; passes < 10; passes++) {
// The order which the table is processed varies according to
// stepsize.
cyg_ucount8 stepsize = (passes*2 + 1) % NUM_PTRS; // odd
for(cyg_ucount8 c=0, i=0; c < NUM_PTRS; c++) {
i = (i+stepsize) % NUM_PTRS;
if(ptr[i]) {
for(cyg_ucount32 j=size[i];j--;) {
CYG_TEST_CHECK(ptr[i][j]==i, "Memory corrupted");
}
CYG_TEST_CHECK(mempool.free(ptr[i], size[i]),
"bad free");
}
s = (s*2 + 17) % 100; // size always odds therefore non-0
ptr[i] = mempool.try_alloc(s);
size[i] = s;
CYG_TEST_CHECK(NULL != ptr[i], "Memory pool not big enough");
CYG_TEST_CHECK(mem<=ptr[i] && ptr[i]+s < mem+memsize,
"Allocated region not within pool");
// Scribble over memory to check whether region overlaps
// with other regions. The contents of the memory are
// checked on freeing. This also tests that the memory
// does not overlap with allocator memory structures.
for(cyg_ucount32 j=size[i];j--;) {
ptr[i][j]=i;
}
}
}
CYG_TEST_PASS_FINISH("Sepmeta memory pool 2 OK");
}
void sepmeta2_main( void )
{
CYG_TEST_INIT();
CYG_TEST_INFO("Starting Seperate metadata memory pool 2 test");
for(cyg_ucount32 i = 0; i<NUM_PTRS; i++) {
ptr[i] = NULL;
}
#ifdef CYGPKG_KERNEL
new_thread(entry, 0);
Cyg_Scheduler::start();
#else
entry(0);
#endif
CYG_TEST_FAIL_FINISH("Not reached");
}
externC void
cyg_start( void )
{
#ifdef CYGSEM_HAL_STOP_CONSTRUCTORS_ON_FLAG
cyg_hal_invoke_constructors();
#endif
sepmeta2_main();
}
// EOF sepmeta2.cxx
|
