85
85
<a name="l00057"></a>00057 <span class="preprocessor"></span><span class="preprocessor">#define XNHEAP_PCONT 1</span>
86
86
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define XNHEAP_PLIST 2</span>
87
87
<a name="l00059"></a>00059 <span class="preprocessor"></span>
88
<a name="l00060"></a>00060 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnextent {
89
<a name="l00061"></a>00061
90
<a name="l00062"></a>00062 xnholder_t link;
88
<a name="l00060"></a>00060 <span class="preprocessor">#define XNHEAP_GFP_NONCACHED (1 << __GFP_BITS_SHIFT)</span>
89
<a name="l00061"></a>00061 <span class="preprocessor"></span>
90
<a name="l00062"></a>00062 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnextent {
91
91
<a name="l00063"></a>00063
92
<a name="l00064"></a>00064 <span class="preprocessor">#define link2extent(ln) container_of(ln, xnextent_t, link)</span>
93
<a name="l00065"></a>00065 <span class="preprocessor"></span>
94
<a name="l00066"></a>00066 caddr_t membase, <span class="comment">/* Base address of the page array */</span>
95
<a name="l00067"></a>00067 memlim, <span class="comment">/* Memory limit of page array */</span>
96
<a name="l00068"></a>00068 freelist; <span class="comment">/* Head of the free page list */</span>
97
<a name="l00069"></a>00069
98
<a name="l00070"></a>00070 <span class="keyword">struct </span>xnpagemap { <span class="comment">/* Beginning of page map */</span>
99
<a name="l00071"></a>00071 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> type : 8; <span class="comment">/* PFREE, PCONT, PLIST or log2 */</span>
100
<a name="l00072"></a>00072 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bcount : 24; <span class="comment">/* Number of active blocks. */</span>
101
<a name="l00073"></a>00073 } pagemap[1];
102
<a name="l00074"></a>00074
103
<a name="l00075"></a>00075 } xnextent_t;
92
<a name="l00064"></a>00064 xnholder_t link;
93
<a name="l00065"></a>00065
94
<a name="l00066"></a>00066 <span class="preprocessor">#define link2extent(ln) container_of(ln, xnextent_t, link)</span>
95
<a name="l00067"></a>00067 <span class="preprocessor"></span>
96
<a name="l00068"></a>00068 caddr_t membase, <span class="comment">/* Base address of the page array */</span>
97
<a name="l00069"></a>00069 memlim, <span class="comment">/* Memory limit of page array */</span>
98
<a name="l00070"></a>00070 freelist; <span class="comment">/* Head of the free page list */</span>
99
<a name="l00071"></a>00071
100
<a name="l00072"></a>00072 <span class="keyword">struct </span>xnpagemap { <span class="comment">/* Beginning of page map */</span>
101
<a name="l00073"></a>00073 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> type : 8; <span class="comment">/* PFREE, PCONT, PLIST or log2 */</span>
102
<a name="l00074"></a>00074 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> bcount : 24; <span class="comment">/* Number of active blocks. */</span>
103
<a name="l00075"></a>00075 } pagemap[1];
104
104
<a name="l00076"></a>00076
105
<a name="l00077"></a>00077 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnheap {
105
<a name="l00077"></a>00077 } xnextent_t;
106
106
<a name="l00078"></a>00078
107
<a name="l00079"></a>00079 xnholder_t link;
107
<a name="l00079"></a>00079 <span class="keyword">typedef</span> <span class="keyword">struct </span>xnheap {
108
108
<a name="l00080"></a>00080
109
<a name="l00081"></a>00081 <span class="preprocessor">#define link2heap(ln) container_of(ln, xnheap_t, link)</span>
110
<a name="l00082"></a>00082 <span class="preprocessor"></span>
111
<a name="l00083"></a>00083 u_long extentsize,
112
<a name="l00084"></a>00084 pagesize,
113
<a name="l00085"></a>00085 pageshift,
114
<a name="l00086"></a>00086 hdrsize,
115
<a name="l00087"></a>00087 npages, <span class="comment">/* Number of pages per extent */</span>
116
<a name="l00088"></a>00088 ubytes,
117
<a name="l00089"></a>00089 maxcont;
118
<a name="l00090"></a>00090
119
<a name="l00091"></a>00091 xnqueue_t extents;
109
<a name="l00081"></a>00081 xnholder_t link;
110
<a name="l00082"></a>00082
111
<a name="l00083"></a>00083 <span class="preprocessor">#define link2heap(ln) container_of(ln, xnheap_t, link)</span>
112
<a name="l00084"></a>00084 <span class="preprocessor"></span>
113
<a name="l00085"></a>00085 u_long extentsize,
114
<a name="l00086"></a>00086 pagesize,
115
<a name="l00087"></a>00087 pageshift,
116
<a name="l00088"></a>00088 hdrsize,
117
<a name="l00089"></a>00089 npages, <span class="comment">/* Number of pages per extent */</span>
118
<a name="l00090"></a>00090 ubytes,
119
<a name="l00091"></a>00091 maxcont;
120
120
<a name="l00092"></a>00092
121
<a name="l00093"></a>00093 DECLARE_XNLOCK(lock);
121
<a name="l00093"></a>00093 xnqueue_t extents;
122
122
<a name="l00094"></a>00094
123
<a name="l00095"></a>00095 <span class="keyword">struct </span>xnbucket {
124
<a name="l00096"></a>00096 caddr_t freelist;
125
<a name="l00097"></a>00097 <span class="keywordtype">int</span> fcount;
126
<a name="l00098"></a>00098 } buckets[XNHEAP_NBUCKETS];
127
<a name="l00099"></a>00099
128
<a name="l00100"></a>00100 xnholder_t *idleq;
123
<a name="l00095"></a>00095 DECLARE_XNLOCK(lock);
124
<a name="l00096"></a>00096
125
<a name="l00097"></a>00097 <span class="keyword">struct </span>xnbucket {
126
<a name="l00098"></a>00098 caddr_t freelist;
127
<a name="l00099"></a>00099 <span class="keywordtype">int</span> fcount;
128
<a name="l00100"></a>00100 } buckets[XNHEAP_NBUCKETS];
129
129
<a name="l00101"></a>00101
130
<a name="l00102"></a>00102 xnarch_heapcb_t archdep;
130
<a name="l00102"></a>00102 xnholder_t *idleq;
131
131
<a name="l00103"></a>00103
132
<a name="l00104"></a>00104 XNARCH_DECL_DISPLAY_CONTEXT();
132
<a name="l00104"></a>00104 xnarch_heapcb_t archdep;
133
133
<a name="l00105"></a>00105
134
<a name="l00106"></a>00106 } xnheap_t;
134
<a name="l00106"></a>00106 XNARCH_DECL_DISPLAY_CONTEXT();
135
135
<a name="l00107"></a>00107
136
<a name="l00108"></a>00108 <span class="keyword">extern</span> xnheap_t kheap;
136
<a name="l00108"></a>00108 } xnheap_t;
137
137
<a name="l00109"></a>00109
138
<a name="l00110"></a>00110 <span class="preprocessor">#if CONFIG_XENO_OPT_SYS_STACKPOOLSZ > 0</span>
139
<a name="l00111"></a>00111 <span class="preprocessor"></span><span class="keyword">extern</span> xnheap_t kstacks;
140
<a name="l00112"></a>00112 <span class="preprocessor">#endif</span>
141
<a name="l00113"></a>00113 <span class="preprocessor"></span>
142
<a name="l00114"></a>00114 <span class="preprocessor">#define xnheap_extentsize(heap) ((heap)->extentsize)</span>
143
<a name="l00115"></a>00115 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_page_size(heap) ((heap)->pagesize)</span>
144
<a name="l00116"></a>00116 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_page_count(heap) ((heap)->npages)</span>
145
<a name="l00117"></a>00117 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_usable_mem(heap) ((heap)->maxcont * countq(&(heap)->extents))</span>
146
<a name="l00118"></a>00118 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_used_mem(heap) ((heap)->ubytes)</span>
147
<a name="l00119"></a>00119 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_max_contiguous(heap) ((heap)->maxcont)</span>
148
<a name="l00120"></a>00120 <span class="preprocessor"></span>
149
<a name="l00121"></a>00121 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_align(<span class="keywordtype">size_t</span> size, <span class="keywordtype">size_t</span> al)
150
<a name="l00122"></a>00122 {
151
<a name="l00123"></a>00123 <span class="comment">/* The alignment value must be a power of 2 */</span>
152
<a name="l00124"></a>00124 <span class="keywordflow">return</span> ((size+al-1)&(~(al-1)));
153
<a name="l00125"></a>00125 }
154
<a name="l00126"></a>00126
155
<a name="l00127"></a>00127 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_overhead(<span class="keywordtype">size_t</span> hsize, <span class="keywordtype">size_t</span> psize)
156
<a name="l00128"></a>00128 {
157
<a name="l00129"></a>00129 <span class="keywordtype">size_t</span> m = psize / <span class="keyword">sizeof</span>(<span class="keyword">struct </span>xnpagemap);
158
<a name="l00130"></a>00130 <span class="keywordtype">size_t</span> q = (size_t)xnarch_llimd(hsize - <span class="keyword">sizeof</span>(xnextent_t), m, m + 1);
159
<a name="l00131"></a>00131 <span class="keywordflow">return</span> xnheap_align(hsize - q, XNHEAP_MINALIGNSZ);
160
<a name="l00132"></a>00132 }
161
<a name="l00133"></a>00133
162
<a name="l00134"></a>00134 <span class="preprocessor">#define xnmalloc(size) xnheap_alloc(&kheap,size)</span>
163
<a name="l00135"></a>00135 <span class="preprocessor"></span><span class="preprocessor">#define xnfree(ptr) xnheap_free(&kheap,ptr)</span>
164
<a name="l00136"></a>00136 <span class="preprocessor"></span><span class="preprocessor">#define xnfreesync() xnheap_finalize_free(&kheap)</span>
165
<a name="l00137"></a>00137 <span class="preprocessor"></span><span class="preprocessor">#define xnfreesafe(thread,ptr,ln) \</span>
166
<a name="l00138"></a>00138 <span class="preprocessor"> do { \</span>
167
<a name="l00139"></a>00139 <span class="preprocessor"> if (xnpod_current_p(thread)) \</span>
168
<a name="l00140"></a>00140 <span class="preprocessor"> xnheap_schedule_free(&kheap,ptr,ln); \</span>
169
<a name="l00141"></a>00141 <span class="preprocessor"> else \</span>
170
<a name="l00142"></a>00142 <span class="preprocessor"> xnheap_free(&kheap,ptr); \</span>
171
<a name="l00143"></a>00143 <span class="preprocessor">} while(0)</span>
172
<a name="l00144"></a>00144 <span class="preprocessor"></span>
173
<a name="l00145"></a>00145 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_rounded_size(<span class="keywordtype">size_t</span> hsize, <span class="keywordtype">size_t</span> psize)
174
<a name="l00146"></a>00146 {
175
<a name="l00147"></a>00147 <span class="comment">/*</span>
176
<a name="l00148"></a>00148 <span class="comment"> * Account for the minimum heap size (i.e. 2 * page size) plus</span>
177
<a name="l00149"></a>00149 <span class="comment"> * overhead so that the actual heap space is large enough to</span>
178
<a name="l00150"></a>00150 <span class="comment"> * match the requested size. Using a small page size for large</span>
179
<a name="l00151"></a>00151 <span class="comment"> * single-block heaps might reserve a lot of useless page map</span>
180
<a name="l00152"></a>00152 <span class="comment"> * memory, but this should never get pathological anyway,</span>
181
<a name="l00153"></a>00153 <span class="comment"> * since we only consume 4 bytes per page.</span>
182
<a name="l00154"></a>00154 <span class="comment"> */</span>
183
<a name="l00155"></a>00155 <span class="keywordflow">if</span> (hsize < 2 * psize)
184
<a name="l00156"></a>00156 hsize = 2 * psize;
185
<a name="l00157"></a>00157 hsize += xnheap_overhead(hsize, psize);
186
<a name="l00158"></a>00158 <span class="keywordflow">return</span> xnheap_align(hsize, psize);
187
<a name="l00159"></a>00159 }
188
<a name="l00160"></a>00160
189
<a name="l00161"></a>00161 <span class="preprocessor">#ifdef __cplusplus</span>
190
<a name="l00162"></a>00162 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
191
<a name="l00163"></a>00163 <span class="preprocessor">#endif</span>
192
<a name="l00164"></a>00164 <span class="preprocessor"></span>
193
<a name="l00165"></a>00165 <span class="comment">/* Private interface. */</span>
194
<a name="l00166"></a>00166
195
<a name="l00167"></a>00167 <span class="preprocessor">#ifdef __KERNEL__</span>
196
<a name="l00168"></a>00168 <span class="preprocessor"></span>
197
<a name="l00169"></a>00169 <span class="preprocessor">#define XNHEAP_DEV_MINOR 254</span>
198
<a name="l00170"></a>00170 <span class="preprocessor"></span>
199
<a name="l00171"></a>00171 <span class="keywordtype">int</span> xnheap_mount(<span class="keywordtype">void</span>);
200
<a name="l00172"></a>00172
201
<a name="l00173"></a>00173 <span class="keywordtype">void</span> xnheap_umount(<span class="keywordtype">void</span>);
138
<a name="l00110"></a>00110 <span class="keyword">extern</span> xnheap_t kheap;
139
<a name="l00111"></a>00111
140
<a name="l00112"></a>00112 <span class="preprocessor">#if CONFIG_XENO_OPT_SYS_STACKPOOLSZ > 0</span>
141
<a name="l00113"></a>00113 <span class="preprocessor"></span><span class="keyword">extern</span> xnheap_t kstacks;
142
<a name="l00114"></a>00114 <span class="preprocessor">#endif</span>
143
<a name="l00115"></a>00115 <span class="preprocessor"></span>
144
<a name="l00116"></a>00116 <span class="preprocessor">#define xnheap_extentsize(heap) ((heap)->extentsize)</span>
145
<a name="l00117"></a>00117 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_page_size(heap) ((heap)->pagesize)</span>
146
<a name="l00118"></a>00118 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_page_count(heap) ((heap)->npages)</span>
147
<a name="l00119"></a>00119 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_usable_mem(heap) ((heap)->maxcont * countq(&(heap)->extents))</span>
148
<a name="l00120"></a>00120 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_used_mem(heap) ((heap)->ubytes)</span>
149
<a name="l00121"></a>00121 <span class="preprocessor"></span><span class="preprocessor">#define xnheap_max_contiguous(heap) ((heap)->maxcont)</span>
150
<a name="l00122"></a>00122 <span class="preprocessor"></span>
151
<a name="l00123"></a>00123 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_align(<span class="keywordtype">size_t</span> size, <span class="keywordtype">size_t</span> al)
152
<a name="l00124"></a>00124 {
153
<a name="l00125"></a>00125 <span class="comment">/* The alignment value must be a power of 2 */</span>
154
<a name="l00126"></a>00126 <span class="keywordflow">return</span> ((size+al-1)&(~(al-1)));
155
<a name="l00127"></a>00127 }
156
<a name="l00128"></a>00128
157
<a name="l00129"></a>00129 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_external_overhead(<span class="keywordtype">size_t</span> hsize, <span class="keywordtype">size_t</span> psize)
158
<a name="l00130"></a>00130 {
159
<a name="l00131"></a>00131 <span class="keywordtype">size_t</span> pages = (hsize + psize - 1) / psize;
160
<a name="l00132"></a>00132 <span class="keywordflow">return</span> xnheap_align(<span class="keyword">sizeof</span>(xnextent_t)
161
<a name="l00133"></a>00133 + pages * <span class="keyword">sizeof</span>(<span class="keyword">struct</span> xnpagemap), psize);
162
<a name="l00134"></a>00134 }
163
<a name="l00135"></a>00135
164
<a name="l00136"></a>00136 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_internal_overhead(<span class="keywordtype">size_t</span> hsize, <span class="keywordtype">size_t</span> psize)
165
<a name="l00137"></a>00137 {
166
<a name="l00138"></a>00138 <span class="comment">/* o = (h - o) * m / p + e</span>
167
<a name="l00139"></a>00139 <span class="comment"> o * p = (h - o) * m + e * p</span>
168
<a name="l00140"></a>00140 <span class="comment"> o * (p + m) = h * m + e * p</span>
169
<a name="l00141"></a>00141 <span class="comment"> o = (h * m + e *p) / (p + m)</span>
170
<a name="l00142"></a>00142 <span class="comment"> */</span>
171
<a name="l00143"></a>00143 <span class="keywordflow">return</span> xnheap_align((<span class="keyword">sizeof</span>(xnextent_t) * psize
172
<a name="l00144"></a>00144 + <span class="keyword">sizeof</span>(<span class="keyword">struct</span> xnpagemap) * hsize)
173
<a name="l00145"></a>00145 / (psize + <span class="keyword">sizeof</span>(<span class="keyword">struct</span> xnpagemap)), psize);
174
<a name="l00146"></a>00146 }
175
<a name="l00147"></a>00147
176
<a name="l00148"></a>00148 <span class="preprocessor">#define xnmalloc(size) xnheap_alloc(&kheap,size)</span>
177
<a name="l00149"></a>00149 <span class="preprocessor"></span><span class="preprocessor">#define xnfree(ptr) xnheap_free(&kheap,ptr)</span>
178
<a name="l00150"></a>00150 <span class="preprocessor"></span><span class="preprocessor">#define xnfreesync() xnheap_finalize_free(&kheap)</span>
179
<a name="l00151"></a>00151 <span class="preprocessor"></span><span class="preprocessor">#define xnfreesafe(thread,ptr,ln) \</span>
180
<a name="l00152"></a>00152 <span class="preprocessor"> do { \</span>
181
<a name="l00153"></a>00153 <span class="preprocessor"> if (xnpod_current_p(thread)) \</span>
182
<a name="l00154"></a>00154 <span class="preprocessor"> xnheap_schedule_free(&kheap,ptr,ln); \</span>
183
<a name="l00155"></a>00155 <span class="preprocessor"> else \</span>
184
<a name="l00156"></a>00156 <span class="preprocessor"> xnheap_free(&kheap,ptr); \</span>
185
<a name="l00157"></a>00157 <span class="preprocessor">} while(0)</span>
186
<a name="l00158"></a>00158 <span class="preprocessor"></span>
187
<a name="l00159"></a>00159 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> xnheap_rounded_size(<span class="keywordtype">size_t</span> hsize, <span class="keywordtype">size_t</span> psize)
188
<a name="l00160"></a>00160 {
189
<a name="l00161"></a>00161 <span class="comment">/*</span>
190
<a name="l00162"></a>00162 <span class="comment"> * Account for the minimum heap size (i.e. 2 * page size) plus</span>
191
<a name="l00163"></a>00163 <span class="comment"> * overhead so that the actual heap space is large enough to</span>
192
<a name="l00164"></a>00164 <span class="comment"> * match the requested size. Using a small page size for large</span>
193
<a name="l00165"></a>00165 <span class="comment"> * single-block heaps might reserve a lot of useless page map</span>
194
<a name="l00166"></a>00166 <span class="comment"> * memory, but this should never get pathological anyway,</span>
195
<a name="l00167"></a>00167 <span class="comment"> * since we only consume 4 bytes per page.</span>
196
<a name="l00168"></a>00168 <span class="comment"> */</span>
197
<a name="l00169"></a>00169 <span class="keywordflow">if</span> (hsize < 2 * psize)
198
<a name="l00170"></a>00170 hsize = 2 * psize;
199
<a name="l00171"></a>00171 hsize += xnheap_external_overhead(hsize, psize);
200
<a name="l00172"></a>00172 <span class="keywordflow">return</span> xnheap_align(hsize, psize);
201
<a name="l00173"></a>00173 }
202
202
<a name="l00174"></a>00174
203
<a name="l00175"></a>00175 <span class="keywordtype">int</span> xnheap_init_mapped(xnheap_t *heap,
204
<a name="l00176"></a>00176 u_long heapsize,
205
<a name="l00177"></a>00177 <span class="keywordtype">int</span> memflags);
206
<a name="l00178"></a>00178
207
<a name="l00179"></a>00179 <span class="keywordtype">int</span> xnheap_destroy_mapped(xnheap_t *heap);
203
<a name="l00175"></a>00175 <span class="preprocessor">#ifdef __cplusplus</span>
204
<a name="l00176"></a>00176 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
205
<a name="l00177"></a>00177 <span class="preprocessor">#endif</span>
206
<a name="l00178"></a>00178 <span class="preprocessor"></span>
207
<a name="l00179"></a>00179 <span class="comment">/* Private interface. */</span>
208
208
<a name="l00180"></a>00180
209
<a name="l00181"></a>00181 <span class="preprocessor">#define xnheap_mapped_offset(heap,ptr) \</span>
210
<a name="l00182"></a>00182 <span class="preprocessor">(((caddr_t)(ptr)) - ((caddr_t)(heap)->archdep.heapbase))</span>
211
<a name="l00183"></a>00183 <span class="preprocessor"></span>
212
<a name="l00184"></a>00184 <span class="preprocessor">#define xnheap_mapped_address(heap,off) \</span>
213
<a name="l00185"></a>00185 <span class="preprocessor">(((caddr_t)(heap)->archdep.heapbase) + (off))</span>
214
<a name="l00186"></a>00186 <span class="preprocessor"></span>
215
<a name="l00187"></a>00187 <span class="preprocessor">#define xnheap_mapped_p(heap) \</span>
216
<a name="l00188"></a>00188 <span class="preprocessor">((heap)->archdep.heapbase != NULL)</span>
217
<a name="l00189"></a>00189 <span class="preprocessor"></span>
218
<a name="l00190"></a>00190 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ */</span>
219
<a name="l00191"></a>00191
220
<a name="l00192"></a>00192 <span class="comment">/* Public interface. */</span>
221
<a name="l00193"></a>00193
222
<a name="l00194"></a>00194 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#gd65beaf18754ad1f85c479eaf9219042" title="Initialize a memory heap.">xnheap_init</a>(xnheap_t *heap,
223
<a name="l00195"></a>00195 <span class="keywordtype">void</span> *heapaddr,
224
<a name="l00196"></a>00196 u_long heapsize,
225
<a name="l00197"></a>00197 u_long pagesize);
226
<a name="l00198"></a>00198
227
<a name="l00199"></a>00199 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g7ab506f024eda1d9030e1bf9494c0781" title="Destroys a memory heap.">xnheap_destroy</a>(xnheap_t *heap,
228
<a name="l00200"></a>00200 <span class="keywordtype">void</span> (*flushfn)(xnheap_t *heap,
229
<a name="l00201"></a>00201 <span class="keywordtype">void</span> *extaddr,
230
<a name="l00202"></a>00202 u_long extsize,
231
<a name="l00203"></a>00203 <span class="keywordtype">void</span> *cookie),
232
<a name="l00204"></a>00204 <span class="keywordtype">void</span> *cookie);
233
<a name="l00205"></a>00205
234
<a name="l00206"></a>00206 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g4842cb75faa41b2cc3ce8e44cf0beade" title="Extend a memory heap.">xnheap_extend</a>(xnheap_t *heap,
235
<a name="l00207"></a>00207 <span class="keywordtype">void</span> *extaddr,
236
<a name="l00208"></a>00208 u_long extsize);
209
<a name="l00181"></a>00181 <span class="preprocessor">#ifdef __KERNEL__</span>
210
<a name="l00182"></a>00182 <span class="preprocessor"></span>
211
<a name="l00183"></a>00183 <span class="preprocessor">#define XNHEAP_DEV_MINOR 254</span>
212
<a name="l00184"></a>00184 <span class="preprocessor"></span>
213
<a name="l00185"></a>00185 <span class="keywordtype">int</span> xnheap_mount(<span class="keywordtype">void</span>);
214
<a name="l00186"></a>00186
215
<a name="l00187"></a>00187 <span class="keywordtype">void</span> xnheap_umount(<span class="keywordtype">void</span>);
216
<a name="l00188"></a>00188
217
<a name="l00189"></a>00189 <span class="keywordtype">int</span> xnheap_init_mapped(xnheap_t *heap,
218
<a name="l00190"></a>00190 u_long heapsize,
219
<a name="l00191"></a>00191 <span class="keywordtype">int</span> memflags);
220
<a name="l00192"></a>00192
221
<a name="l00193"></a>00193 <span class="keywordtype">int</span> xnheap_destroy_mapped(xnheap_t *heap,
222
<a name="l00194"></a>00194 <span class="keywordtype">void</span> (*release)(<span class="keyword">struct</span> xnheap *heap),
223
<a name="l00195"></a>00195 <span class="keywordtype">void</span> __user *mapaddr);
224
<a name="l00196"></a>00196
225
<a name="l00197"></a>00197 <span class="preprocessor">#define xnheap_mapped_offset(heap,ptr) \</span>
226
<a name="l00198"></a>00198 <span class="preprocessor">(((caddr_t)(ptr)) - ((caddr_t)(heap)->archdep.heapbase))</span>
227
<a name="l00199"></a>00199 <span class="preprocessor"></span>
228
<a name="l00200"></a>00200 <span class="preprocessor">#define xnheap_mapped_address(heap,off) \</span>
229
<a name="l00201"></a>00201 <span class="preprocessor">(((caddr_t)(heap)->archdep.heapbase) + (off))</span>
230
<a name="l00202"></a>00202 <span class="preprocessor"></span>
231
<a name="l00203"></a>00203 <span class="preprocessor">#define xnheap_mapped_p(heap) \</span>
232
<a name="l00204"></a>00204 <span class="preprocessor">((heap)->archdep.heapbase != NULL)</span>
233
<a name="l00205"></a>00205 <span class="preprocessor"></span>
234
<a name="l00206"></a>00206 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ */</span>
235
<a name="l00207"></a>00207
236
<a name="l00208"></a>00208 <span class="comment">/* Public interface. */</span>
237
237
<a name="l00209"></a>00209
238
<a name="l00210"></a>00210 <span class="keywordtype">void</span> *<a class="code" href="group__heap.html#gaa8ae99881c9e6a4f8b56aa79f983bdb" title="Allocate a memory block from a memory heap.">xnheap_alloc</a>(xnheap_t *heap,
239
<a name="l00211"></a>00211 u_long size);
240
<a name="l00212"></a>00212
241
<a name="l00213"></a>00213 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#gcb0151aaff9d56134c7c217bfa67c816" title="Test and release a memory block to a memory heap.">xnheap_test_and_free</a>(xnheap_t *heap,
242
<a name="l00214"></a>00214 <span class="keywordtype">void</span> *block,
243
<a name="l00215"></a>00215 <span class="keywordtype">int</span> (*ckfn)(<span class="keywordtype">void</span> *block));
244
<a name="l00216"></a>00216
245
<a name="l00217"></a>00217 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g5dc4305113cd272cfed62e20e2a12ae6" title="Release a memory block to a memory heap.">xnheap_free</a>(xnheap_t *heap,
246
<a name="l00218"></a>00218 <span class="keywordtype">void</span> *block);
247
<a name="l00219"></a>00219
248
<a name="l00220"></a>00220 <span class="keywordtype">void</span> <a class="code" href="group__heap.html#g548f69835e12bf259b6d417b11338a11" title="Schedule a memory block for release.">xnheap_schedule_free</a>(xnheap_t *heap,
249
<a name="l00221"></a>00221 <span class="keywordtype">void</span> *block,
250
<a name="l00222"></a>00222 xnholder_t *link);
251
<a name="l00223"></a>00223
252
<a name="l00224"></a>00224 <span class="keywordtype">void</span> xnheap_finalize_free_inner(xnheap_t *heap);
238
<a name="l00210"></a>00210 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#gd65beaf18754ad1f85c479eaf9219042" title="Initialize a memory heap.">xnheap_init</a>(xnheap_t *heap,
239
<a name="l00211"></a>00211 <span class="keywordtype">void</span> *heapaddr,
240
<a name="l00212"></a>00212 u_long heapsize,
241
<a name="l00213"></a>00213 u_long pagesize);
242
<a name="l00214"></a>00214
243
<a name="l00215"></a>00215 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g7ab506f024eda1d9030e1bf9494c0781" title="Destroys a memory heap.">xnheap_destroy</a>(xnheap_t *heap,
244
<a name="l00216"></a>00216 <span class="keywordtype">void</span> (*flushfn)(xnheap_t *heap,
245
<a name="l00217"></a>00217 <span class="keywordtype">void</span> *extaddr,
246
<a name="l00218"></a>00218 u_long extsize,
247
<a name="l00219"></a>00219 <span class="keywordtype">void</span> *cookie),
248
<a name="l00220"></a>00220 <span class="keywordtype">void</span> *cookie);
249
<a name="l00221"></a>00221
250
<a name="l00222"></a>00222 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g4842cb75faa41b2cc3ce8e44cf0beade" title="Extend a memory heap.">xnheap_extend</a>(xnheap_t *heap,
251
<a name="l00223"></a>00223 <span class="keywordtype">void</span> *extaddr,
252
<a name="l00224"></a>00224 u_long extsize);
253
253
<a name="l00225"></a>00225
254
<a name="l00226"></a>00226 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> xnheap_finalize_free(xnheap_t *heap)
255
<a name="l00227"></a>00227 {
256
<a name="l00228"></a>00228 <span class="keywordflow">if</span> (heap->idleq)
257
<a name="l00229"></a>00229 xnheap_finalize_free_inner(heap);
258
<a name="l00230"></a>00230 }
259
<a name="l00231"></a>00231
260
<a name="l00232"></a>00232 <span class="keywordtype">int</span> xnheap_check_block(xnheap_t *heap,
261
<a name="l00233"></a>00233 <span class="keywordtype">void</span> *block);
262
<a name="l00234"></a>00234
263
<a name="l00235"></a>00235 <span class="preprocessor">#ifdef __cplusplus</span>
264
<a name="l00236"></a>00236 <span class="preprocessor"></span>}
265
<a name="l00237"></a>00237 <span class="preprocessor">#endif</span>
266
<a name="l00238"></a>00238 <span class="preprocessor"></span>
267
<a name="l00239"></a>00239 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ || __XENO_SIM__ */</span>
268
<a name="l00240"></a>00240
269
<a name="l00241"></a>00241 <span class="preprocessor">#define XNHEAP_DEV_NAME "/dev/rtheap"</span>
270
<a name="l00242"></a>00242 <span class="preprocessor"></span>
271
<a name="l00243"></a>00243 <span class="preprocessor">#endif </span><span class="comment">/* !_XENO_NUCLEUS_HEAP_H */</span>
254
<a name="l00226"></a>00226 <span class="keywordtype">void</span> *<a class="code" href="group__heap.html#gaa8ae99881c9e6a4f8b56aa79f983bdb" title="Allocate a memory block from a memory heap.">xnheap_alloc</a>(xnheap_t *heap,
255
<a name="l00227"></a>00227 u_long size);
256
<a name="l00228"></a>00228
257
<a name="l00229"></a>00229 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#gcb0151aaff9d56134c7c217bfa67c816" title="Test and release a memory block to a memory heap.">xnheap_test_and_free</a>(xnheap_t *heap,
258
<a name="l00230"></a>00230 <span class="keywordtype">void</span> *block,
259
<a name="l00231"></a>00231 <span class="keywordtype">int</span> (*ckfn)(<span class="keywordtype">void</span> *block));
260
<a name="l00232"></a>00232
261
<a name="l00233"></a>00233 <span class="keywordtype">int</span> <a class="code" href="group__heap.html#g5dc4305113cd272cfed62e20e2a12ae6" title="Release a memory block to a memory heap.">xnheap_free</a>(xnheap_t *heap,
262
<a name="l00234"></a>00234 <span class="keywordtype">void</span> *block);
263
<a name="l00235"></a>00235
264
<a name="l00236"></a>00236 <span class="keywordtype">void</span> <a class="code" href="group__heap.html#g548f69835e12bf259b6d417b11338a11" title="Schedule a memory block for release.">xnheap_schedule_free</a>(xnheap_t *heap,
265
<a name="l00237"></a>00237 <span class="keywordtype">void</span> *block,
266
<a name="l00238"></a>00238 xnholder_t *link);
267
<a name="l00239"></a>00239
268
<a name="l00240"></a>00240 <span class="keywordtype">void</span> xnheap_finalize_free_inner(xnheap_t *heap);
269
<a name="l00241"></a>00241
270
<a name="l00242"></a>00242 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> xnheap_finalize_free(xnheap_t *heap)
271
<a name="l00243"></a>00243 {
272
<a name="l00244"></a>00244 <span class="keywordflow">if</span> (heap->idleq)
273
<a name="l00245"></a>00245 xnheap_finalize_free_inner(heap);
274
<a name="l00246"></a>00246 }
275
<a name="l00247"></a>00247
276
<a name="l00248"></a>00248 <span class="keywordtype">int</span> xnheap_check_block(xnheap_t *heap,
277
<a name="l00249"></a>00249 <span class="keywordtype">void</span> *block);
278
<a name="l00250"></a>00250
279
<a name="l00251"></a>00251 <span class="preprocessor">#ifdef __cplusplus</span>
280
<a name="l00252"></a>00252 <span class="preprocessor"></span>}
281
<a name="l00253"></a>00253 <span class="preprocessor">#endif</span>
282
<a name="l00254"></a>00254 <span class="preprocessor"></span>
283
<a name="l00255"></a>00255 <span class="preprocessor">#endif </span><span class="comment">/* __KERNEL__ || __XENO_SIM__ */</span>
284
<a name="l00256"></a>00256
285
<a name="l00257"></a>00257 <span class="preprocessor">#define XNHEAP_DEV_NAME "/dev/rtheap"</span>
286
<a name="l00258"></a>00258 <span class="preprocessor"></span>
287
<a name="l00259"></a>00259 <span class="preprocessor">#endif </span><span class="comment">/* !_XENO_NUCLEUS_HEAP_H */</span>
272
288
</pre></div></div>
273
<hr size="1"><address style="text-align: right;"><small>Generated on Sun Jun 8 18:08:49 2008 for Xenomai API by
289
<hr size="1"><address style="text-align: right;"><small>Generated on Thu May 28 16:22:09 2009 for Xenomai API by
274
290
<a href="http://www.doxygen.org/index.html">
275
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.5 </small></address>
291
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
added
removed
doc/generated/html/api/nucleus_2heap_8h-source.html
