URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [trunk/] [rtems/] [c/] [src/] [exec/] [score/] [src/] [heapwalk.c] - Blame information for rev 1765

Details | Compare with Previous | View Log


/*
 *  Heap Handler
 *
 *  COPYRIGHT (c) 1989-1999.
 *  On-Line Applications Research Corporation (OAR).
 *
 *  The license and distribution terms for this file may be
 *  found in the file LICENSE in this distribution or at
 *  http://www.OARcorp.com/rtems/license.html.
 *
 *  $Id: heapwalk.c,v 1.2 2001-09-27 11:59:34 chris Exp $
 */
 
 
#include <rtems/system.h>
#include <rtems/score/sysstate.h>
#include <rtems/score/heap.h>
 
/*PAGE
 *
 *  _Heap_Walk
 *
 *  This kernel routine walks the heap and verifies its correctness.
 *
 *  Input parameters:
 *    the_heap  - pointer to heap header
 *    source    - a numeric indicator of the invoker of this routine
 *    do_dump   - when TRUE print the information
 *
 *  Output parameters: NONE
 */
 
#ifndef RTEMS_DEBUG
 
void _Heap_Walk(
  Heap_Control  *the_heap,
  int            source,
  boolean        do_dump
)
{
}
 
#else
 
#include <stdio.h>
#include <unistd.h>
 
void _Heap_Walk(
  Heap_Control  *the_heap,
  int            source,
  boolean        do_dump
)
{
  Heap_Block *the_block  = 0;  /* avoid warnings */
  Heap_Block *next_block = 0;  /* avoid warnings */
  int         notdone = 1;
  int         error = 0;
  int         passes = 0;
 
  /*
   * We don't want to allow walking the heap until we have
   * transferred control to the user task so we watch the
   * system state.
   */
 
  if ( !_System_state_Is_up( _System_state_Get() ) )
    return;
 
  the_block = the_heap->start;
 
  if (do_dump == TRUE) {
    printf("\nPASS: %d  start @ 0x%p   final 0x%p,   first 0x%p  last 0x%p\n",
            source, the_heap->start, the_heap->final,
                  the_heap->first, the_heap->last
          );
  }
 
  /*
   * Handle the 1st block
   */
 
  if (the_block->back_flag != HEAP_DUMMY_FLAG) {
    printf("PASS: %d  Back flag of 1st block isn't HEAP_DUMMY_FLAG\n", source);
    error = 1;
  }
 
  while (notdone) {
    passes++;
    if (error && (passes > 10))
        abort();
 
    if (do_dump == TRUE) {
      printf("PASS: %d  Block @ 0x%p   Back %d,   Front %d",
              source, the_block,
              the_block->back_flag, the_block->front_flag);
      if ( _Heap_Is_block_free(the_block) ) {
        printf( "      Prev 0x%p,   Next 0x%p\n",
                          the_block->previous, the_block->next);
      } else {
        printf("\n");
      }
    }
 
    /*
     * Handle the last block
     */
 
    if ( the_block->front_flag != HEAP_DUMMY_FLAG ) {
      next_block = _Heap_Next_block(the_block);
      if ( the_block->front_flag != next_block->back_flag ) {
        error = 1;
        printf("PASS: %d  Front and back flags don't match\n", source);
        printf("         Current Block (%p):  Back - %d,  Front - %d",
               the_block, the_block->back_flag, the_block->front_flag);
        if (do_dump == TRUE) {
          if (_Heap_Is_block_free(the_block)) {
            printf("      Prev 0x%p,   Next 0x%p\n",
                   the_block->previous, the_block->next);
          } else {
            printf("\n");
          }
        } else {
          printf("\n");
        }
        printf("         Next Block (%p):     Back - %d,  Front - %d",
               next_block, next_block->back_flag, next_block->front_flag);
        if (do_dump == TRUE) {
          if (_Heap_Is_block_free(next_block)) {
            printf("      Prev 0x%p,   Next 0x%p\n",
                   the_block->previous, the_block->next);
          } else {
            printf("\n");
          }
        } else {
          printf("\n");
        }
      }
    }
 
    if (the_block->front_flag == HEAP_DUMMY_FLAG)
      notdone = 0;
    else
      the_block = next_block;
  }
 
  if (error)
      abort();
}
#endif

Line No.	Rev	Author	Line
1	158	chris	`/*`
2			`* Heap Handler`
3			`*`
4			`* COPYRIGHT (c) 1989-1999.`
5			`* On-Line Applications Research Corporation (OAR).`
6			`*`
7			`* The license and distribution terms for this file may be`
8			`* found in the file LICENSE in this distribution or at`
9			`* http://www.OARcorp.com/rtems/license.html.`
10			`*`
11	208	chris	`* $Id: heapwalk.c,v 1.2 2001-09-27 11:59:34 chris Exp $`
12	158	chris	`*/`
13
14
15			`#include <rtems/system.h>`
16			`#include <rtems/score/sysstate.h>`
17			`#include <rtems/score/heap.h>`
18
19			`/*PAGE`
20			`*`
21			`* _Heap_Walk`
22			`*`
23			`* This kernel routine walks the heap and verifies its correctness.`
24			`*`
25			`* Input parameters:`
26			`* the_heap - pointer to heap header`
27			`* source - a numeric indicator of the invoker of this routine`
28			`* do_dump - when TRUE print the information`
29			`*`
30			`* Output parameters: NONE`
31			`*/`
32
33			`#ifndef RTEMS_DEBUG`
34
35			`void _Heap_Walk(`
36			`Heap_Control *the_heap,`
37			`int source,`
38			`boolean do_dump`
39			`)`
40			`{`
41			`}`
42
43			`#else`
44
45			`#include <stdio.h>`
46			`#include <unistd.h>`
47
48			`void _Heap_Walk(`
49			`Heap_Control *the_heap,`
50			`int source,`
51			`boolean do_dump`
52			`)`
53			`{`
54			`Heap_Block the_block = 0; / avoid warnings */`
55			`Heap_Block next_block = 0; / avoid warnings */`
56			`int notdone = 1;`
57			`int error = 0;`
58			`int passes = 0;`
59
60			`/*`
61			`* We don't want to allow walking the heap until we have`
62			`* transferred control to the user task so we watch the`
63			`* system state.`
64			`*/`
65
66			`if ( !_System_state_Is_up( _System_state_Get() ) )`
67			`return;`
68
69			`the_block = the_heap->start;`
70
71			`if (do_dump == TRUE) {`
72			`printf("\nPASS: %d start @ 0x%p final 0x%p, first 0x%p last 0x%p\n",`
73			`source, the_heap->start, the_heap->final,`
74			`the_heap->first, the_heap->last`
75			`);`
76			`}`
77
78			`/*`
79			`* Handle the 1st block`
80			`*/`
81
82			`if (the_block->back_flag != HEAP_DUMMY_FLAG) {`
83			`printf("PASS: %d Back flag of 1st block isn't HEAP_DUMMY_FLAG\n", source);`
84			`error = 1;`
85			`}`
86
87			`while (notdone) {`
88			`passes++;`
89			`if (error && (passes > 10))`
90			`abort();`
91
92			`if (do_dump == TRUE) {`
93			`printf("PASS: %d Block @ 0x%p Back %d, Front %d",`
94			`source, the_block,`
95			`the_block->back_flag, the_block->front_flag);`
96			`if ( _Heap_Is_block_free(the_block) ) {`
97			`printf( " Prev 0x%p, Next 0x%p\n",`
98			`the_block->previous, the_block->next);`
99			`} else {`
100			`printf("\n");`
101			`}`
102			`}`
103
104			`/*`
105			`* Handle the last block`
106			`*/`
107
108			`if ( the_block->front_flag != HEAP_DUMMY_FLAG ) {`
109			`next_block = _Heap_Next_block(the_block);`
110			`if ( the_block->front_flag != next_block->back_flag ) {`
111			`error = 1;`
112			`printf("PASS: %d Front and back flags don't match\n", source);`
113			`printf(" Current Block (%p): Back - %d, Front - %d",`
114			`the_block, the_block->back_flag, the_block->front_flag);`
115			`if (do_dump == TRUE) {`
116			`if (_Heap_Is_block_free(the_block)) {`
117			`printf(" Prev 0x%p, Next 0x%p\n",`
118			`the_block->previous, the_block->next);`
119			`} else {`
120			`printf("\n");`
121			`}`
122			`} else {`
123			`printf("\n");`
124			`}`
125			`printf(" Next Block (%p): Back - %d, Front - %d",`
126			`next_block, next_block->back_flag, next_block->front_flag);`
127			`if (do_dump == TRUE) {`
128			`if (_Heap_Is_block_free(next_block)) {`
129			`printf(" Prev 0x%p, Next 0x%p\n",`
130			`the_block->previous, the_block->next);`
131			`} else {`
132			`printf("\n");`
133			`}`
134			`} else {`
135			`printf("\n");`
136			`}`
137			`}`
138			`}`
139
140			`if (the_block->front_flag == HEAP_DUMMY_FLAG)`
141			`notdone = 0;`
142			`else`
143			`the_block = next_block;`
144			`}`
145
146			`if (error)`
147			`abort();`
148			`}`
149			`#endif`

Browse

Tools

Subversion Repositories or1k

[/] [or1k/] [trunk/] [rtems/] [c/] [src/] [exec/] [score/] [src/] [heapwalk.c] - Blame information for rev 1765