aboutsummaryrefslogtreecommitdiffstats
path: root/os/kernel/include/chheap.h
blob: 1c5ec5419633e763aed8049d4e1086ae47c5478b (plain)
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
/*
    ChibiOS/RT - Copyright (C) 2006,2007,2008,2009,2010 Giovanni Di Sirio.

    This file is part of ChibiOS/RT.

    ChibiOS/RT 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 3 of the License, or
    (at your option) any later version.

    ChibiOS/RT 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 this program.  If not, see <http://www.gnu.org/licenses/>.
*/

/**
 * @file    chheap.h
 * @brief   Heaps macros and structures.
 *
 * @addtogroup heaps
 * @{
 */

#ifndef _CHHEAP_H_
#define _CHHEAP_H_

#if CH_USE_HEAP || defined(__DOXYGEN__)

/*
 * Module dependencies check.
 */
#if !CH_USE_MEMCORE && !CH_USE_MALLOC_HEAP
#error "CH_USE_HEAP requires CH_USE_MEMCORE or CH_USE_MALLOC_HEAP"
#endif

#if !CH_USE_MUTEXES && !CH_USE_SEMAPHORES
#error "CH_USE_HEAP requires CH_USE_MUTEXES and/or CH_USE_SEMAPHORES"
#endif

typedef struct memory_heap MemoryHeap;

/**
 * @brief   Memory heap block header.
 */
union heap_header {
  stkalign_t align;
  struct {
    union {
      union heap_header *next;      /**< @brief Next block in free list.    */
      MemoryHeap        *heap;      /**< @brief Block owner heap.           */
    } u;                            /**< @brief Overlapped fields.          */
    size_t              size;       /**< @brief Size of the memory block.   */
  } h;
};

/**
 * @brief   Structure describing a memory heap.
 */
struct memory_heap {
  memgetfunc_t          h_provider; /**< @brief Memory blocks provider for
                                                this heap.                  */
  union heap_header     h_free;     /**< @brief Free blocks list header.    */
#if CH_USE_MUTEXES
  Mutex                 h_mtx;      /**< @brief Heap access mutex.          */
#else
  Semaphore             h_sem;      /**< @brief Heap access semaphore.      */
#endif
};

#ifdef __cplusplus
extern "C" {
#endif
  void heap_init(void);
  void chHeapInit(MemoryHeap *heapp, void *buf, size_t size);
  void *chHeapAlloc(MemoryHeap *heapp, size_t size);
  void chHeapFree(void *p);
  size_t chHeapStatus(MemoryHeap *heapp, size_t *sizep);
#ifdef __cplusplus
}
#endif

#endif /* CH_USE_HEAP */

#endif /* _CHHEAP_H_ */

/** @} */
class="n">map[map.size()]; } V* begin () { return &map[0]; } V* end () { return &map[map.size()]; } void reserve(K key, V pad) { map.growTo(index(key)+1, pad); } void reserve(K key) { map.growTo(index(key)+1); } void insert (K key, V val, V pad){ reserve(key, pad); operator[](key) = val; } void insert (K key, V val) { reserve(key); operator[](key) = val; } void clear (bool dispose = false) { map.clear(dispose); } void moveTo (IntMap& to) { map.moveTo(to.map); to.index = index; } void copyTo (IntMap& to) const { map.copyTo(to.map); to.index = index; } }; template<class K, class MkIndex = MkIndexDefault<K> > class IntSet { IntMap<K, char, MkIndex> in_set; vec<K> xs; public: // Size operations: int size (void) const { return xs.size(); } void clear (bool free = false){ if (free) in_set.clear(true); else for (int i = 0; i < xs.size(); i++) in_set[xs[i]] = 0; xs.clear(free); } // Allow inspecting the internal vector: const vec<K>& toVec () const { return xs; } // Vector interface: K operator [] (int index) const { return xs[index]; } void insert (K k) { in_set.reserve(k, 0); if (!in_set[k]) { in_set[k] = 1; xs.push(k); } } bool has (K k) { in_set.reserve(k, 0); return in_set[k]; } }; #if 0 template<class K, class V, V nil, class MkIndex = MkIndexDefault<K> > class IntMapNil { vec<V> map; V nil; public: IntMap(){} void reserve(K); V& find (K); const V& operator[](K k) const; }; #endif //================================================================================================= } // namespace Minisat #endif