source: rtems/cpukit/score/src/heapallocate.c @ 80f2885b

4.104.114.84.95
Last change on this file since 80f2885b was 80f2885b, checked in by Joel Sherrill <joel.sherrill@…>, on 05/20/05 at 19:15:41

2005-05-14 Sergei Organov <osv@…>

PR 746/rtems
Optimize realloc(). The problem is that realloc() can neither grow
nor shrink efficiently the current memory region without support
from underlying heap/region modules. The patch introduces one new
routine for each of heap and region modules, _Heap_Resize_block(),
and rtems_region_resize_segment(), respectively, and uses the
latter to optimize realloc().

The implementation of _Heap_Resize_block() lead to changing of the
heap allocation strategy: now the heap manager, when splits larger
free block into used and new free parts, makes the first part of
the block used, not the last one as it was before. Due to this new
strategy, _Heap_Resize_block() never needs to change the user
pointer.

Caveat: unlike previous heap implementation, first few bytes of
the contents of the memory allocated from the heap are now almost
never all zero. This can trigger bugs in client code that have not
been visible before this patch.

  • libcsupport/src/malloc.c (realloc): try to resize segment in place using new rtems_region_resize_segment() routine before falling back to the malloc()/free() method.
  • score/src/heap.c: (_Heap_Initialize): change initial heap layout to reflect new allocation strategy of using of the lower part of a previously free block when splitting it for the purpose of allocation. (_Heap_Block_allocate): when split, make the lower part used, and leave the upper part free. Return type changed from Heap_Block* to uint32_t.
  • score/include/rtems/score/heap.h: (Heap_Statistics): added 'resizes' field. (Heap_Resize_status): new enum. (_Heap_Resize_block): new routine. (_Heap_Block_allocate): return type changed from Heap_Block* to uint32_t.
  • score/src/heapwalk.c: reflect new heap layout in checks.
  • score/src/heapsizeofuserarea.c: more assertions added.
  • score/src/heapresizeblock.c: new file. (_Heap_Resize_block): new routine.
  • score/src/heapfree.c: reverse the checks _Heap_Is_block_in() and _Heap_Is_prev_used() on entry to be in this order.
  • score/src/heapallocate.c, score/src/heapallocatealigned.c: ignore return value of _Heap_Block_allocate().
  • score/Makefile.am (HEAP_C_FILES): added src/heapresizeblock.c.
  • rtems/include/rtems/rtems/region.h: (rtems_region_resize_segment): new interface routine. (_Region_Process_queue): new internal routine called from rtems_region_resize_segment() and rtems_region_return_segment().
  • rtems/src/regionreturnsegment.c: move queue management code into the new internal routine _Region_Process_queue() and call it.
  • rtems/src/regionresizesegment.c: new file. (rtems_region_resize_segment): new interface routine.
  • rtems/src/regionprocessqueue.c: new file. (_Region_Process_queue): new internal routine containing queue management code factored out from 'regionreturnsegment.c'.
  • rtems/Makefile.am (REGION_C_FILES): Added src/regionresizesegment.c, and src/regionprocessqueue.c.
  • ada/rtems.adb, ada/rtems.ads: Added Region_Resize_Segment.
  • Property mode set to 100644
File size: 2.0 KB
Line 
1/*
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.rtems.com/license/LICENSE.
10 *
11 *  $Id$
12 */
13
14#if HAVE_CONFIG_H
15#include "config.h"
16#endif
17
18#include <rtems/system.h>
19#include <rtems/score/sysstate.h>
20#include <rtems/score/heap.h>
21
22/*PAGE
23 *
24 *  _Heap_Allocate
25 *
26 *  This kernel routine allocates the requested size of memory
27 *  from the specified heap.
28 *
29 *  Input parameters:
30 *    the_heap  - pointer to heap header.
31 *    size      - size in bytes of the memory block to allocate.
32 *
33 *  Output parameters:
34 *    returns - starting address of memory block allocated
35 */
36
37void *_Heap_Allocate(
38  Heap_Control        *the_heap,
39  uint32_t             size
40)
41{
42  uint32_t  the_size;
43  uint32_t  search_count;
44  Heap_Block *the_block;
45  void       *ptr = NULL;
46  Heap_Statistics *const stats = &the_heap->stats;
47  Heap_Block *const tail = _Heap_Tail(the_heap);
48
49  the_size =
50    _Heap_Calc_block_size(size, the_heap->page_size, the_heap->min_block_size);
51  if(the_size == 0)
52    return NULL;
53
54  /* Find large enough free block. */
55  for(the_block = _Heap_First(the_heap), search_count = 0;
56      the_block != tail;
57      the_block = the_block->next, ++search_count)
58  {
59    /* As we always coalesce free blocks, prev block must have been used. */
60    _HAssert(_Heap_Is_prev_used(the_block));
61
62    /* Don't bother to mask out the HEAP_PREV_USED bit as it won't change the
63       result of the comparison. */
64    if(the_block->size >= the_size) {
65      (void)_Heap_Block_allocate(the_heap, the_block, the_size );
66
67      ptr = _Heap_User_area(the_block);
68
69      stats->allocs += 1;
70      stats->searches += search_count + 1;
71
72      _HAssert(_Heap_Is_aligned_ptr(ptr, the_heap->page_size));
73      break;
74    }
75  }
76
77  if(stats->max_search < search_count)
78    stats->max_search = search_count;
79
80  return ptr;
81}
Note: See TracBrowser for help on using the repository browser.