rf_aselect.c revision 1.9 1 1.9 oster /* $NetBSD: rf_aselect.c,v 1.9 2003/12/29 03:33:47 oster Exp $ */
2 1.1 oster /*
3 1.1 oster * Copyright (c) 1995 Carnegie-Mellon University.
4 1.1 oster * All rights reserved.
5 1.1 oster *
6 1.1 oster * Author: Mark Holland, William V. Courtright II
7 1.1 oster *
8 1.1 oster * Permission to use, copy, modify and distribute this software and
9 1.1 oster * its documentation is hereby granted, provided that both the copyright
10 1.1 oster * notice and this permission notice appear in all copies of the
11 1.1 oster * software, derivative works or modified versions, and any portions
12 1.1 oster * thereof, and that both notices appear in supporting documentation.
13 1.1 oster *
14 1.1 oster * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
15 1.1 oster * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
16 1.1 oster * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
17 1.1 oster *
18 1.1 oster * Carnegie Mellon requests users of this software to return to
19 1.1 oster *
20 1.1 oster * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
21 1.1 oster * School of Computer Science
22 1.1 oster * Carnegie Mellon University
23 1.1 oster * Pittsburgh PA 15213-3890
24 1.1 oster *
25 1.1 oster * any improvements or extensions that they make and grant Carnegie the
26 1.1 oster * rights to redistribute these changes.
27 1.1 oster */
28 1.1 oster
29 1.1 oster /*****************************************************************************
30 1.1 oster *
31 1.1 oster * aselect.c -- algorithm selection code
32 1.3 oster *
33 1.1 oster *****************************************************************************/
34 1.5 lukem
35 1.5 lukem #include <sys/cdefs.h>
36 1.9 oster __KERNEL_RCSID(0, "$NetBSD: rf_aselect.c,v 1.9 2003/12/29 03:33:47 oster Exp $");
37 1.2 oster
38 1.4 oster #include <dev/raidframe/raidframevar.h>
39 1.1 oster
40 1.1 oster #include "rf_archs.h"
41 1.1 oster #include "rf_raid.h"
42 1.1 oster #include "rf_dag.h"
43 1.1 oster #include "rf_dagutils.h"
44 1.1 oster #include "rf_dagfuncs.h"
45 1.1 oster #include "rf_general.h"
46 1.1 oster #include "rf_desc.h"
47 1.1 oster #include "rf_map.h"
48 1.1 oster
49 1.1 oster #if defined(__NetBSD__) && defined(_KERNEL)
50 1.1 oster /* the function below is not used... so don't define it! */
51 1.1 oster #else
52 1.1 oster static void TransferDagMemory(RF_DagHeader_t *, RF_DagHeader_t *);
53 1.1 oster #endif
54 1.1 oster
55 1.7 oster static int InitHdrNode(RF_DagHeader_t **, RF_Raid_t *);
56 1.3 oster int rf_SelectAlgorithm(RF_RaidAccessDesc_t *, RF_RaidAccessFlags_t);
57 1.1 oster
58 1.1 oster
59 1.1 oster /******************************************************************************
60 1.1 oster *
61 1.1 oster * Create and Initialiaze a dag header and termination node
62 1.1 oster *
63 1.1 oster *****************************************************************************/
64 1.3 oster static int
65 1.7 oster InitHdrNode(hdr, raidPtr)
66 1.3 oster RF_DagHeader_t **hdr;
67 1.3 oster RF_Raid_t *raidPtr;
68 1.1 oster {
69 1.3 oster /* create and initialize dag hdr */
70 1.3 oster *hdr = rf_AllocDAGHeader();
71 1.3 oster rf_MakeAllocList((*hdr)->allocList);
72 1.3 oster if ((*hdr)->allocList == NULL) {
73 1.3 oster rf_FreeDAGHeader(*hdr);
74 1.3 oster return (ENOMEM);
75 1.3 oster }
76 1.3 oster (*hdr)->status = rf_enable;
77 1.3 oster (*hdr)->numSuccedents = 0;
78 1.3 oster (*hdr)->raidPtr = raidPtr;
79 1.3 oster (*hdr)->next = NULL;
80 1.3 oster return (0);
81 1.1 oster }
82 1.1 oster
83 1.1 oster /******************************************************************************
84 1.1 oster *
85 1.1 oster * Create a DAG to do a read or write operation.
86 1.1 oster *
87 1.1 oster * create an array of dagLists, one list per parity stripe.
88 1.1 oster * return the lists in the array desc->dagArray.
89 1.1 oster *
90 1.1 oster * Normally, each list contains one dag for the entire stripe. In some
91 1.1 oster * tricky cases, we break this into multiple dags, either one per stripe
92 1.1 oster * unit or one per block (sector). When this occurs, these dags are returned
93 1.1 oster * as a linked list (dagList) which is executed sequentially (to preserve
94 1.1 oster * atomic parity updates in the stripe).
95 1.3 oster *
96 1.1 oster * dags which operate on independent parity goups (stripes) are returned in
97 1.1 oster * independent dagLists (distinct elements in desc->dagArray) and may be
98 1.1 oster * executed concurrently.
99 1.1 oster *
100 1.1 oster * Finally, if the SelectionFunc fails to create a dag for a block, we punt
101 1.1 oster * and return 1.
102 1.1 oster *
103 1.1 oster * The above process is performed in two phases:
104 1.1 oster * 1) create an array(s) of creation functions (eg stripeFuncs)
105 1.1 oster * 2) create dags and concatenate/merge to form the final dag.
106 1.1 oster *
107 1.1 oster * Because dag's are basic blocks (single entry, single exit, unconditional
108 1.1 oster * control flow, we can add the following optimizations (future work):
109 1.1 oster * first-pass optimizer to allow max concurrency (need all data dependencies)
110 1.1 oster * second-pass optimizer to eliminate common subexpressions (need true
111 1.1 oster * data dependencies)
112 1.1 oster * third-pass optimizer to eliminate dead code (need true data dependencies)
113 1.1 oster *****************************************************************************/
114 1.1 oster
115 1.1 oster #define MAXNSTRIPES 50
116 1.1 oster
117 1.3 oster int
118 1.3 oster rf_SelectAlgorithm(desc, flags)
119 1.3 oster RF_RaidAccessDesc_t *desc;
120 1.3 oster RF_RaidAccessFlags_t flags;
121 1.1 oster {
122 1.3 oster RF_AccessStripeMapHeader_t *asm_h = desc->asmap;
123 1.3 oster RF_IoType_t type = desc->type;
124 1.3 oster RF_Raid_t *raidPtr = desc->raidPtr;
125 1.3 oster void *bp = desc->bp;
126 1.3 oster
127 1.3 oster RF_AccessStripeMap_t *asmap = asm_h->stripeMap;
128 1.3 oster RF_AccessStripeMap_t *asm_p;
129 1.3 oster RF_DagHeader_t *dag_h = NULL, *tempdag_h, *lastdag_h;
130 1.3 oster int i, j, k;
131 1.3 oster RF_VoidFuncPtr *stripeFuncs, normalStripeFuncs[MAXNSTRIPES];
132 1.3 oster RF_AccessStripeMap_t *asm_up, *asm_bp;
133 1.3 oster RF_AccessStripeMapHeader_t ***asmh_u, *endASMList;
134 1.3 oster RF_AccessStripeMapHeader_t ***asmh_b;
135 1.3 oster RF_VoidFuncPtr **stripeUnitFuncs, uFunc;
136 1.3 oster RF_VoidFuncPtr **blockFuncs, bFunc;
137 1.3 oster int numStripesBailed = 0, cantCreateDAGs = RF_FALSE;
138 1.3 oster int numStripeUnitsBailed = 0;
139 1.3 oster int stripeNum, numUnitDags = 0, stripeUnitNum, numBlockDags = 0;
140 1.3 oster RF_StripeNum_t numStripeUnits;
141 1.3 oster RF_SectorNum_t numBlocks;
142 1.3 oster RF_RaidAddr_t address;
143 1.3 oster int length;
144 1.3 oster RF_PhysDiskAddr_t *physPtr;
145 1.3 oster caddr_t buffer;
146 1.3 oster
147 1.3 oster lastdag_h = NULL;
148 1.3 oster asmh_u = asmh_b = NULL;
149 1.3 oster stripeUnitFuncs = NULL;
150 1.3 oster blockFuncs = NULL;
151 1.3 oster
152 1.3 oster /* get an array of dag-function creation pointers, try to avoid
153 1.3 oster * calling malloc */
154 1.3 oster if (asm_h->numStripes <= MAXNSTRIPES)
155 1.3 oster stripeFuncs = normalStripeFuncs;
156 1.3 oster else
157 1.9 oster RF_Malloc(stripeFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr *));
158 1.3 oster
159 1.3 oster /* walk through the asm list once collecting information */
160 1.3 oster /* attempt to find a single creation function for each stripe */
161 1.3 oster desc->numStripes = 0;
162 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
163 1.3 oster desc->numStripes++;
164 1.3 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_p, &stripeFuncs[i]);
165 1.3 oster /* check to see if we found a creation func for this stripe */
166 1.3 oster if (stripeFuncs[i] == (RF_VoidFuncPtr) NULL) {
167 1.3 oster /* could not find creation function for entire stripe
168 1.3 oster * so, let's see if we can find one for each stripe
169 1.3 oster * unit in the stripe */
170 1.3 oster
171 1.3 oster if (numStripesBailed == 0) {
172 1.3 oster /* one stripe map header for each stripe we
173 1.3 oster * bail on */
174 1.3 oster RF_Malloc(asmh_u, sizeof(RF_AccessStripeMapHeader_t **) * asm_h->numStripes, (RF_AccessStripeMapHeader_t ***));
175 1.3 oster /* create an array of ptrs to arrays of
176 1.3 oster * stripeFuncs */
177 1.9 oster RF_Malloc(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr **));
178 1.3 oster }
179 1.3 oster /* create an array of creation funcs (called
180 1.3 oster * stripeFuncs) for this stripe */
181 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
182 1.9 oster RF_Malloc(stripeUnitFuncs[numStripesBailed], numStripeUnits * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr *));
183 1.3 oster RF_Malloc(asmh_u[numStripesBailed], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *), (RF_AccessStripeMapHeader_t **));
184 1.3 oster
185 1.3 oster /* lookup array of stripeUnitFuncs for this stripe */
186 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
187 1.3 oster /* remap for series of single stripe-unit
188 1.3 oster * accesses */
189 1.3 oster address = physPtr->raidAddress;
190 1.3 oster length = physPtr->numSector;
191 1.3 oster buffer = physPtr->bufPtr;
192 1.3 oster
193 1.3 oster asmh_u[numStripesBailed][j] = rf_MapAccess(raidPtr, address, length, buffer, RF_DONT_REMAP);
194 1.3 oster asm_up = asmh_u[numStripesBailed][j]->stripeMap;
195 1.3 oster
196 1.3 oster /* get the creation func for this stripe unit */
197 1.3 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_up, &(stripeUnitFuncs[numStripesBailed][j]));
198 1.3 oster
199 1.3 oster /* check to see if we found a creation func
200 1.3 oster * for this stripe unit */
201 1.3 oster if (stripeUnitFuncs[numStripesBailed][j] == (RF_VoidFuncPtr) NULL) {
202 1.3 oster /* could not find creation function
203 1.3 oster * for stripe unit so, let's see if we
204 1.3 oster * can find one for each block in the
205 1.3 oster * stripe unit */
206 1.3 oster if (numStripeUnitsBailed == 0) {
207 1.3 oster /* one stripe map header for
208 1.3 oster * each stripe unit we bail on */
209 1.3 oster RF_Malloc(asmh_b, sizeof(RF_AccessStripeMapHeader_t **) * asm_h->numStripes * raidPtr->Layout.numDataCol, (RF_AccessStripeMapHeader_t ***));
210 1.3 oster /* create an array of ptrs to
211 1.3 oster * arrays of blockFuncs */
212 1.9 oster RF_Malloc(blockFuncs, asm_h->numStripes * raidPtr->Layout.numDataCol * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr **));
213 1.3 oster }
214 1.3 oster /* create an array of creation funcs
215 1.3 oster * (called blockFuncs) for this stripe
216 1.3 oster * unit */
217 1.3 oster numBlocks = physPtr->numSector;
218 1.3 oster numBlockDags += numBlocks;
219 1.9 oster RF_Malloc(blockFuncs[numStripeUnitsBailed], numBlocks * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr *));
220 1.3 oster RF_Malloc(asmh_b[numStripeUnitsBailed], numBlocks * sizeof(RF_AccessStripeMapHeader_t *), (RF_AccessStripeMapHeader_t **));
221 1.3 oster
222 1.3 oster /* lookup array of blockFuncs for this
223 1.3 oster * stripe unit */
224 1.3 oster for (k = 0; k < numBlocks; k++) {
225 1.3 oster /* remap for series of single
226 1.3 oster * stripe-unit accesses */
227 1.3 oster address = physPtr->raidAddress + k;
228 1.3 oster length = 1;
229 1.3 oster buffer = physPtr->bufPtr + (k * (1 << raidPtr->logBytesPerSector));
230 1.3 oster
231 1.3 oster asmh_b[numStripeUnitsBailed][k] = rf_MapAccess(raidPtr, address, length, buffer, RF_DONT_REMAP);
232 1.3 oster asm_bp = asmh_b[numStripeUnitsBailed][k]->stripeMap;
233 1.3 oster
234 1.3 oster /* get the creation func for
235 1.3 oster * this stripe unit */
236 1.3 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_bp, &(blockFuncs[numStripeUnitsBailed][k]));
237 1.3 oster
238 1.3 oster /* check to see if we found a
239 1.3 oster * creation func for this
240 1.3 oster * stripe unit */
241 1.3 oster if (blockFuncs[numStripeUnitsBailed][k] == NULL)
242 1.3 oster cantCreateDAGs = RF_TRUE;
243 1.3 oster }
244 1.3 oster numStripeUnitsBailed++;
245 1.3 oster } else {
246 1.3 oster numUnitDags++;
247 1.3 oster }
248 1.3 oster }
249 1.3 oster RF_ASSERT(j == numStripeUnits);
250 1.3 oster numStripesBailed++;
251 1.3 oster }
252 1.1 oster }
253 1.3 oster
254 1.3 oster if (cantCreateDAGs) {
255 1.3 oster /* free memory and punt */
256 1.3 oster if (asm_h->numStripes > MAXNSTRIPES)
257 1.3 oster RF_Free(stripeFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
258 1.3 oster if (numStripesBailed > 0) {
259 1.3 oster stripeNum = 0;
260 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++)
261 1.3 oster if (stripeFuncs[i] == NULL) {
262 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
263 1.3 oster for (j = 0; j < numStripeUnits; j++)
264 1.3 oster rf_FreeAccessStripeMap(asmh_u[stripeNum][j]);
265 1.3 oster RF_Free(asmh_u[stripeNum], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *));
266 1.3 oster RF_Free(stripeUnitFuncs[stripeNum], numStripeUnits * sizeof(RF_VoidFuncPtr));
267 1.3 oster stripeNum++;
268 1.3 oster }
269 1.3 oster RF_ASSERT(stripeNum == numStripesBailed);
270 1.3 oster RF_Free(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
271 1.3 oster RF_Free(asmh_u, asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
272 1.3 oster }
273 1.3 oster return (1);
274 1.3 oster } else {
275 1.3 oster /* begin dag creation */
276 1.3 oster stripeNum = 0;
277 1.3 oster stripeUnitNum = 0;
278 1.3 oster
279 1.3 oster /* create an array of dagLists and fill them in */
280 1.9 oster RF_MallocAndAdd(desc->dagArray, desc->numStripes * sizeof(RF_DagList_t), (RF_DagList_t *), desc->cleanupList);
281 1.3 oster
282 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
283 1.3 oster /* grab dag header for this stripe */
284 1.3 oster dag_h = NULL;
285 1.3 oster desc->dagArray[i].desc = desc;
286 1.3 oster
287 1.3 oster if (stripeFuncs[i] == (RF_VoidFuncPtr) NULL) {
288 1.3 oster /* use bailout functions for this stripe */
289 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
290 1.3 oster uFunc = stripeUnitFuncs[stripeNum][j];
291 1.3 oster if (uFunc == (RF_VoidFuncPtr) NULL) {
292 1.3 oster /* use bailout functions for
293 1.3 oster * this stripe unit */
294 1.3 oster for (k = 0; k < physPtr->numSector; k++) {
295 1.3 oster /* create a dag for
296 1.3 oster * this block */
297 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
298 1.3 oster desc->dagArray[i].numDags++;
299 1.3 oster if (dag_h == NULL) {
300 1.3 oster dag_h = tempdag_h;
301 1.3 oster } else {
302 1.3 oster lastdag_h->next = tempdag_h;
303 1.3 oster }
304 1.3 oster lastdag_h = tempdag_h;
305 1.3 oster
306 1.3 oster bFunc = blockFuncs[stripeUnitNum][k];
307 1.3 oster RF_ASSERT(bFunc);
308 1.3 oster asm_bp = asmh_b[stripeUnitNum][k]->stripeMap;
309 1.3 oster (*bFunc) (raidPtr, asm_bp, tempdag_h, bp, flags, tempdag_h->allocList);
310 1.3 oster }
311 1.3 oster stripeUnitNum++;
312 1.3 oster } else {
313 1.3 oster /* create a dag for this unit */
314 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
315 1.3 oster desc->dagArray[i].numDags++;
316 1.3 oster if (dag_h == NULL) {
317 1.3 oster dag_h = tempdag_h;
318 1.3 oster } else {
319 1.3 oster lastdag_h->next = tempdag_h;
320 1.3 oster }
321 1.3 oster lastdag_h = tempdag_h;
322 1.3 oster
323 1.3 oster asm_up = asmh_u[stripeNum][j]->stripeMap;
324 1.3 oster (*uFunc) (raidPtr, asm_up, tempdag_h, bp, flags, tempdag_h->allocList);
325 1.3 oster }
326 1.3 oster }
327 1.3 oster RF_ASSERT(j == asm_p->numStripeUnitsAccessed);
328 1.3 oster /* merge linked bailout dag to existing dag
329 1.3 oster * collection */
330 1.3 oster stripeNum++;
331 1.3 oster } else {
332 1.3 oster /* Create a dag for this parity stripe */
333 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
334 1.3 oster desc->dagArray[i].numDags++;
335 1.3 oster if (dag_h == NULL) {
336 1.3 oster dag_h = tempdag_h;
337 1.3 oster } else {
338 1.3 oster lastdag_h->next = tempdag_h;
339 1.3 oster }
340 1.3 oster lastdag_h = tempdag_h;
341 1.3 oster
342 1.3 oster (stripeFuncs[i]) (raidPtr, asm_p, tempdag_h, bp, flags, tempdag_h->allocList);
343 1.1 oster }
344 1.3 oster desc->dagArray[i].dags = dag_h;
345 1.3 oster }
346 1.3 oster RF_ASSERT(i == desc->numStripes);
347 1.3 oster
348 1.3 oster /* free memory */
349 1.3 oster if (asm_h->numStripes > MAXNSTRIPES)
350 1.3 oster RF_Free(stripeFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
351 1.3 oster if ((numStripesBailed > 0) || (numStripeUnitsBailed > 0)) {
352 1.3 oster stripeNum = 0;
353 1.3 oster stripeUnitNum = 0;
354 1.3 oster if (dag_h->asmList) {
355 1.3 oster endASMList = dag_h->asmList;
356 1.3 oster while (endASMList->next)
357 1.3 oster endASMList = endASMList->next;
358 1.3 oster } else
359 1.3 oster endASMList = NULL;
360 1.3 oster /* walk through io, stripe by stripe */
361 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++)
362 1.3 oster if (stripeFuncs[i] == NULL) {
363 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
364 1.3 oster /* walk through stripe, stripe unit by
365 1.3 oster * stripe unit */
366 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
367 1.3 oster if (stripeUnitFuncs[stripeNum][j] == NULL) {
368 1.3 oster numBlocks = physPtr->numSector;
369 1.3 oster /* walk through stripe
370 1.3 oster * unit, block by
371 1.3 oster * block */
372 1.3 oster for (k = 0; k < numBlocks; k++)
373 1.3 oster if (dag_h->asmList == NULL) {
374 1.3 oster dag_h->asmList = asmh_b[stripeUnitNum][k];
375 1.3 oster endASMList = dag_h->asmList;
376 1.3 oster } else {
377 1.3 oster endASMList->next = asmh_b[stripeUnitNum][k];
378 1.3 oster endASMList = endASMList->next;
379 1.3 oster }
380 1.3 oster RF_Free(asmh_b[stripeUnitNum], numBlocks * sizeof(RF_AccessStripeMapHeader_t *));
381 1.3 oster RF_Free(blockFuncs[stripeUnitNum], numBlocks * sizeof(RF_VoidFuncPtr));
382 1.3 oster stripeUnitNum++;
383 1.3 oster }
384 1.3 oster if (dag_h->asmList == NULL) {
385 1.3 oster dag_h->asmList = asmh_u[stripeNum][j];
386 1.3 oster endASMList = dag_h->asmList;
387 1.3 oster } else {
388 1.3 oster endASMList->next = asmh_u[stripeNum][j];
389 1.3 oster endASMList = endASMList->next;
390 1.3 oster }
391 1.3 oster }
392 1.3 oster RF_Free(asmh_u[stripeNum], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *));
393 1.3 oster RF_Free(stripeUnitFuncs[stripeNum], numStripeUnits * sizeof(RF_VoidFuncPtr));
394 1.3 oster stripeNum++;
395 1.3 oster }
396 1.3 oster RF_ASSERT(stripeNum == numStripesBailed);
397 1.3 oster RF_Free(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
398 1.3 oster RF_Free(asmh_u, asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
399 1.3 oster if (numStripeUnitsBailed > 0) {
400 1.3 oster RF_ASSERT(stripeUnitNum == numStripeUnitsBailed);
401 1.3 oster RF_Free(blockFuncs, raidPtr->Layout.numDataCol * asm_h->numStripes * sizeof(RF_VoidFuncPtr));
402 1.3 oster RF_Free(asmh_b, raidPtr->Layout.numDataCol * asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
403 1.1 oster }
404 1.3 oster }
405 1.3 oster return (0);
406 1.1 oster }
407 1.1 oster }
408