rf_aselect.c revision 1.14 1 1.14 oster /* $NetBSD: rf_aselect.c,v 1.14 2004/02/29 01:37:04 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.14 oster __KERNEL_RCSID(0, "$NetBSD: rf_aselect.c,v 1.14 2004/02/29 01:37:04 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.7 oster static int InitHdrNode(RF_DagHeader_t **, RF_Raid_t *);
50 1.3 oster int rf_SelectAlgorithm(RF_RaidAccessDesc_t *, RF_RaidAccessFlags_t);
51 1.1 oster
52 1.1 oster /******************************************************************************
53 1.1 oster *
54 1.1 oster * Create and Initialiaze a dag header and termination node
55 1.1 oster *
56 1.1 oster *****************************************************************************/
57 1.3 oster static int
58 1.10 oster InitHdrNode(RF_DagHeader_t **hdr, RF_Raid_t *raidPtr)
59 1.1 oster {
60 1.3 oster /* create and initialize dag hdr */
61 1.3 oster *hdr = rf_AllocDAGHeader();
62 1.3 oster rf_MakeAllocList((*hdr)->allocList);
63 1.3 oster if ((*hdr)->allocList == NULL) {
64 1.3 oster rf_FreeDAGHeader(*hdr);
65 1.3 oster return (ENOMEM);
66 1.3 oster }
67 1.3 oster (*hdr)->status = rf_enable;
68 1.3 oster (*hdr)->numSuccedents = 0;
69 1.3 oster (*hdr)->raidPtr = raidPtr;
70 1.3 oster (*hdr)->next = NULL;
71 1.3 oster return (0);
72 1.1 oster }
73 1.1 oster
74 1.1 oster /******************************************************************************
75 1.1 oster *
76 1.1 oster * Create a DAG to do a read or write operation.
77 1.1 oster *
78 1.12 oster * create a list of dagLists, one list per parity stripe.
79 1.12 oster * return the lists in the desc->dagList (which is a list of lists).
80 1.1 oster *
81 1.1 oster * Normally, each list contains one dag for the entire stripe. In some
82 1.1 oster * tricky cases, we break this into multiple dags, either one per stripe
83 1.1 oster * unit or one per block (sector). When this occurs, these dags are returned
84 1.1 oster * as a linked list (dagList) which is executed sequentially (to preserve
85 1.1 oster * atomic parity updates in the stripe).
86 1.3 oster *
87 1.1 oster * dags which operate on independent parity goups (stripes) are returned in
88 1.1 oster * independent dagLists (distinct elements in desc->dagArray) and may be
89 1.1 oster * executed concurrently.
90 1.1 oster *
91 1.1 oster * Finally, if the SelectionFunc fails to create a dag for a block, we punt
92 1.1 oster * and return 1.
93 1.1 oster *
94 1.1 oster * The above process is performed in two phases:
95 1.1 oster * 1) create an array(s) of creation functions (eg stripeFuncs)
96 1.1 oster * 2) create dags and concatenate/merge to form the final dag.
97 1.1 oster *
98 1.1 oster * Because dag's are basic blocks (single entry, single exit, unconditional
99 1.1 oster * control flow, we can add the following optimizations (future work):
100 1.1 oster * first-pass optimizer to allow max concurrency (need all data dependencies)
101 1.1 oster * second-pass optimizer to eliminate common subexpressions (need true
102 1.1 oster * data dependencies)
103 1.1 oster * third-pass optimizer to eliminate dead code (need true data dependencies)
104 1.1 oster *****************************************************************************/
105 1.1 oster
106 1.1 oster #define MAXNSTRIPES 50
107 1.1 oster
108 1.3 oster int
109 1.10 oster rf_SelectAlgorithm(RF_RaidAccessDesc_t *desc, RF_RaidAccessFlags_t flags)
110 1.1 oster {
111 1.3 oster RF_AccessStripeMapHeader_t *asm_h = desc->asmap;
112 1.3 oster RF_IoType_t type = desc->type;
113 1.3 oster RF_Raid_t *raidPtr = desc->raidPtr;
114 1.3 oster void *bp = desc->bp;
115 1.3 oster
116 1.3 oster RF_AccessStripeMap_t *asmap = asm_h->stripeMap;
117 1.3 oster RF_AccessStripeMap_t *asm_p;
118 1.3 oster RF_DagHeader_t *dag_h = NULL, *tempdag_h, *lastdag_h;
119 1.12 oster RF_DagList_t *dagList, *dagListend;
120 1.3 oster int i, j, k;
121 1.13 oster RF_FuncList_t *stripeFuncsList, *stripeFuncs, *stripeFuncsEnd, *temp;
122 1.3 oster RF_AccessStripeMap_t *asm_up, *asm_bp;
123 1.3 oster RF_AccessStripeMapHeader_t ***asmh_u, *endASMList;
124 1.3 oster RF_AccessStripeMapHeader_t ***asmh_b;
125 1.3 oster RF_VoidFuncPtr **stripeUnitFuncs, uFunc;
126 1.3 oster RF_VoidFuncPtr **blockFuncs, bFunc;
127 1.3 oster int numStripesBailed = 0, cantCreateDAGs = RF_FALSE;
128 1.3 oster int numStripeUnitsBailed = 0;
129 1.3 oster int stripeNum, numUnitDags = 0, stripeUnitNum, numBlockDags = 0;
130 1.3 oster RF_StripeNum_t numStripeUnits;
131 1.3 oster RF_SectorNum_t numBlocks;
132 1.3 oster RF_RaidAddr_t address;
133 1.3 oster int length;
134 1.3 oster RF_PhysDiskAddr_t *physPtr;
135 1.3 oster caddr_t buffer;
136 1.3 oster
137 1.3 oster lastdag_h = NULL;
138 1.3 oster asmh_u = asmh_b = NULL;
139 1.3 oster stripeUnitFuncs = NULL;
140 1.3 oster blockFuncs = NULL;
141 1.3 oster
142 1.13 oster stripeFuncsList = NULL;
143 1.13 oster stripeFuncsEnd = NULL;
144 1.3 oster
145 1.3 oster /* walk through the asm list once collecting information */
146 1.3 oster /* attempt to find a single creation function for each stripe */
147 1.3 oster desc->numStripes = 0;
148 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
149 1.3 oster desc->numStripes++;
150 1.13 oster stripeFuncs = rf_AllocFuncList();
151 1.13 oster
152 1.13 oster if (stripeFuncsEnd == NULL) {
153 1.13 oster stripeFuncsList = stripeFuncs;
154 1.13 oster } else {
155 1.13 oster stripeFuncsEnd->next = stripeFuncs;
156 1.13 oster }
157 1.13 oster stripeFuncsEnd = stripeFuncs;
158 1.13 oster
159 1.13 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_p, &(stripeFuncs->fp));
160 1.3 oster /* check to see if we found a creation func for this stripe */
161 1.13 oster if (stripeFuncs->fp == NULL) {
162 1.3 oster /* could not find creation function for entire stripe
163 1.3 oster * so, let's see if we can find one for each stripe
164 1.3 oster * unit in the stripe */
165 1.3 oster
166 1.3 oster if (numStripesBailed == 0) {
167 1.3 oster /* one stripe map header for each stripe we
168 1.3 oster * bail on */
169 1.3 oster RF_Malloc(asmh_u, sizeof(RF_AccessStripeMapHeader_t **) * asm_h->numStripes, (RF_AccessStripeMapHeader_t ***));
170 1.3 oster /* create an array of ptrs to arrays of
171 1.3 oster * stripeFuncs */
172 1.9 oster RF_Malloc(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr **));
173 1.3 oster }
174 1.3 oster /* create an array of creation funcs (called
175 1.3 oster * stripeFuncs) for this stripe */
176 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
177 1.9 oster RF_Malloc(stripeUnitFuncs[numStripesBailed], numStripeUnits * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr *));
178 1.3 oster RF_Malloc(asmh_u[numStripesBailed], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *), (RF_AccessStripeMapHeader_t **));
179 1.3 oster
180 1.3 oster /* lookup array of stripeUnitFuncs for this stripe */
181 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
182 1.3 oster /* remap for series of single stripe-unit
183 1.3 oster * accesses */
184 1.3 oster address = physPtr->raidAddress;
185 1.3 oster length = physPtr->numSector;
186 1.3 oster buffer = physPtr->bufPtr;
187 1.3 oster
188 1.3 oster asmh_u[numStripesBailed][j] = rf_MapAccess(raidPtr, address, length, buffer, RF_DONT_REMAP);
189 1.3 oster asm_up = asmh_u[numStripesBailed][j]->stripeMap;
190 1.3 oster
191 1.3 oster /* get the creation func for this stripe unit */
192 1.3 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_up, &(stripeUnitFuncs[numStripesBailed][j]));
193 1.3 oster
194 1.3 oster /* check to see if we found a creation func
195 1.3 oster * for this stripe unit */
196 1.3 oster if (stripeUnitFuncs[numStripesBailed][j] == (RF_VoidFuncPtr) NULL) {
197 1.3 oster /* could not find creation function
198 1.3 oster * for stripe unit so, let's see if we
199 1.3 oster * can find one for each block in the
200 1.3 oster * stripe unit */
201 1.3 oster if (numStripeUnitsBailed == 0) {
202 1.3 oster /* one stripe map header for
203 1.3 oster * each stripe unit we bail on */
204 1.3 oster RF_Malloc(asmh_b, sizeof(RF_AccessStripeMapHeader_t **) * asm_h->numStripes * raidPtr->Layout.numDataCol, (RF_AccessStripeMapHeader_t ***));
205 1.3 oster /* create an array of ptrs to
206 1.3 oster * arrays of blockFuncs */
207 1.9 oster RF_Malloc(blockFuncs, asm_h->numStripes * raidPtr->Layout.numDataCol * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr **));
208 1.3 oster }
209 1.3 oster /* create an array of creation funcs
210 1.3 oster * (called blockFuncs) for this stripe
211 1.3 oster * unit */
212 1.3 oster numBlocks = physPtr->numSector;
213 1.3 oster numBlockDags += numBlocks;
214 1.9 oster RF_Malloc(blockFuncs[numStripeUnitsBailed], numBlocks * sizeof(RF_VoidFuncPtr), (RF_VoidFuncPtr *));
215 1.3 oster RF_Malloc(asmh_b[numStripeUnitsBailed], numBlocks * sizeof(RF_AccessStripeMapHeader_t *), (RF_AccessStripeMapHeader_t **));
216 1.3 oster
217 1.3 oster /* lookup array of blockFuncs for this
218 1.3 oster * stripe unit */
219 1.3 oster for (k = 0; k < numBlocks; k++) {
220 1.3 oster /* remap for series of single
221 1.3 oster * stripe-unit accesses */
222 1.3 oster address = physPtr->raidAddress + k;
223 1.3 oster length = 1;
224 1.3 oster buffer = physPtr->bufPtr + (k * (1 << raidPtr->logBytesPerSector));
225 1.3 oster
226 1.3 oster asmh_b[numStripeUnitsBailed][k] = rf_MapAccess(raidPtr, address, length, buffer, RF_DONT_REMAP);
227 1.3 oster asm_bp = asmh_b[numStripeUnitsBailed][k]->stripeMap;
228 1.3 oster
229 1.3 oster /* get the creation func for
230 1.3 oster * this stripe unit */
231 1.3 oster (raidPtr->Layout.map->SelectionFunc) (raidPtr, type, asm_bp, &(blockFuncs[numStripeUnitsBailed][k]));
232 1.3 oster
233 1.3 oster /* check to see if we found a
234 1.3 oster * creation func for this
235 1.3 oster * stripe unit */
236 1.3 oster if (blockFuncs[numStripeUnitsBailed][k] == NULL)
237 1.3 oster cantCreateDAGs = RF_TRUE;
238 1.3 oster }
239 1.3 oster numStripeUnitsBailed++;
240 1.3 oster } else {
241 1.3 oster numUnitDags++;
242 1.3 oster }
243 1.3 oster }
244 1.3 oster RF_ASSERT(j == numStripeUnits);
245 1.3 oster numStripesBailed++;
246 1.3 oster }
247 1.1 oster }
248 1.3 oster
249 1.3 oster if (cantCreateDAGs) {
250 1.3 oster /* free memory and punt */
251 1.3 oster if (numStripesBailed > 0) {
252 1.3 oster stripeNum = 0;
253 1.13 oster stripeFuncs = stripeFuncsList;
254 1.13 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
255 1.13 oster if (stripeFuncs->fp == NULL) {
256 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
257 1.3 oster for (j = 0; j < numStripeUnits; j++)
258 1.3 oster rf_FreeAccessStripeMap(asmh_u[stripeNum][j]);
259 1.3 oster RF_Free(asmh_u[stripeNum], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *));
260 1.3 oster RF_Free(stripeUnitFuncs[stripeNum], numStripeUnits * sizeof(RF_VoidFuncPtr));
261 1.3 oster stripeNum++;
262 1.3 oster }
263 1.13 oster stripeFuncs = stripeFuncs->next;
264 1.13 oster }
265 1.3 oster RF_ASSERT(stripeNum == numStripesBailed);
266 1.3 oster RF_Free(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
267 1.3 oster RF_Free(asmh_u, asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
268 1.3 oster }
269 1.13 oster while (stripeFuncsList != NULL) {
270 1.13 oster temp = stripeFuncsList;
271 1.13 oster stripeFuncsList = stripeFuncsList->next;
272 1.13 oster rf_FreeFuncList(temp);
273 1.13 oster }
274 1.11 oster desc->numStripes = 0;
275 1.3 oster return (1);
276 1.3 oster } else {
277 1.3 oster /* begin dag creation */
278 1.3 oster stripeNum = 0;
279 1.3 oster stripeUnitNum = 0;
280 1.3 oster
281 1.12 oster /* create a list of dagLists and fill them in */
282 1.12 oster
283 1.12 oster dagListend = NULL;
284 1.3 oster
285 1.13 oster stripeFuncs = stripeFuncsList;
286 1.3 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
287 1.3 oster /* grab dag header for this stripe */
288 1.3 oster dag_h = NULL;
289 1.12 oster
290 1.12 oster dagList = rf_AllocDAGList();
291 1.12 oster
292 1.12 oster /* always tack the new dagList onto the end of the list... */
293 1.12 oster if (dagListend == NULL) {
294 1.12 oster desc->dagList = dagList;
295 1.12 oster } else {
296 1.12 oster dagListend->next = dagList;
297 1.12 oster }
298 1.12 oster dagListend = dagList;
299 1.12 oster
300 1.12 oster dagList->desc = desc;
301 1.3 oster
302 1.13 oster if (stripeFuncs->fp == NULL) {
303 1.3 oster /* use bailout functions for this stripe */
304 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
305 1.3 oster uFunc = stripeUnitFuncs[stripeNum][j];
306 1.3 oster if (uFunc == (RF_VoidFuncPtr) NULL) {
307 1.3 oster /* use bailout functions for
308 1.3 oster * this stripe unit */
309 1.3 oster for (k = 0; k < physPtr->numSector; k++) {
310 1.3 oster /* create a dag for
311 1.3 oster * this block */
312 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
313 1.12 oster dagList->numDags++;
314 1.3 oster if (dag_h == NULL) {
315 1.3 oster dag_h = tempdag_h;
316 1.3 oster } else {
317 1.3 oster lastdag_h->next = tempdag_h;
318 1.3 oster }
319 1.3 oster lastdag_h = tempdag_h;
320 1.3 oster
321 1.3 oster bFunc = blockFuncs[stripeUnitNum][k];
322 1.3 oster RF_ASSERT(bFunc);
323 1.3 oster asm_bp = asmh_b[stripeUnitNum][k]->stripeMap;
324 1.3 oster (*bFunc) (raidPtr, asm_bp, tempdag_h, bp, flags, tempdag_h->allocList);
325 1.3 oster }
326 1.3 oster stripeUnitNum++;
327 1.3 oster } else {
328 1.3 oster /* create a dag for this unit */
329 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
330 1.12 oster dagList->numDags++;
331 1.3 oster if (dag_h == NULL) {
332 1.3 oster dag_h = tempdag_h;
333 1.3 oster } else {
334 1.3 oster lastdag_h->next = tempdag_h;
335 1.3 oster }
336 1.3 oster lastdag_h = tempdag_h;
337 1.3 oster
338 1.3 oster asm_up = asmh_u[stripeNum][j]->stripeMap;
339 1.3 oster (*uFunc) (raidPtr, asm_up, tempdag_h, bp, flags, tempdag_h->allocList);
340 1.3 oster }
341 1.3 oster }
342 1.3 oster RF_ASSERT(j == asm_p->numStripeUnitsAccessed);
343 1.3 oster /* merge linked bailout dag to existing dag
344 1.3 oster * collection */
345 1.3 oster stripeNum++;
346 1.3 oster } else {
347 1.3 oster /* Create a dag for this parity stripe */
348 1.7 oster InitHdrNode(&tempdag_h, raidPtr);
349 1.12 oster dagList->numDags++;
350 1.3 oster if (dag_h == NULL) {
351 1.3 oster dag_h = tempdag_h;
352 1.3 oster } else {
353 1.3 oster lastdag_h->next = tempdag_h;
354 1.3 oster }
355 1.3 oster lastdag_h = tempdag_h;
356 1.3 oster
357 1.13 oster (stripeFuncs->fp) (raidPtr, asm_p, tempdag_h, bp, flags, tempdag_h->allocList);
358 1.1 oster }
359 1.12 oster dagList->dags = dag_h;
360 1.13 oster stripeFuncs = stripeFuncs->next;
361 1.3 oster }
362 1.3 oster RF_ASSERT(i == desc->numStripes);
363 1.3 oster
364 1.3 oster /* free memory */
365 1.3 oster if ((numStripesBailed > 0) || (numStripeUnitsBailed > 0)) {
366 1.3 oster stripeNum = 0;
367 1.3 oster stripeUnitNum = 0;
368 1.3 oster if (dag_h->asmList) {
369 1.3 oster endASMList = dag_h->asmList;
370 1.3 oster while (endASMList->next)
371 1.3 oster endASMList = endASMList->next;
372 1.3 oster } else
373 1.3 oster endASMList = NULL;
374 1.3 oster /* walk through io, stripe by stripe */
375 1.13 oster stripeFuncs = stripeFuncsList;
376 1.13 oster for (i = 0, asm_p = asmap; asm_p; asm_p = asm_p->next, i++) {
377 1.13 oster if (stripeFuncs->fp == NULL) {
378 1.3 oster numStripeUnits = asm_p->numStripeUnitsAccessed;
379 1.3 oster /* walk through stripe, stripe unit by
380 1.3 oster * stripe unit */
381 1.3 oster for (j = 0, physPtr = asm_p->physInfo; physPtr; physPtr = physPtr->next, j++) {
382 1.3 oster if (stripeUnitFuncs[stripeNum][j] == NULL) {
383 1.3 oster numBlocks = physPtr->numSector;
384 1.3 oster /* walk through stripe
385 1.3 oster * unit, block by
386 1.3 oster * block */
387 1.3 oster for (k = 0; k < numBlocks; k++)
388 1.3 oster if (dag_h->asmList == NULL) {
389 1.3 oster dag_h->asmList = asmh_b[stripeUnitNum][k];
390 1.3 oster endASMList = dag_h->asmList;
391 1.3 oster } else {
392 1.3 oster endASMList->next = asmh_b[stripeUnitNum][k];
393 1.3 oster endASMList = endASMList->next;
394 1.3 oster }
395 1.3 oster RF_Free(asmh_b[stripeUnitNum], numBlocks * sizeof(RF_AccessStripeMapHeader_t *));
396 1.3 oster RF_Free(blockFuncs[stripeUnitNum], numBlocks * sizeof(RF_VoidFuncPtr));
397 1.3 oster stripeUnitNum++;
398 1.3 oster }
399 1.3 oster if (dag_h->asmList == NULL) {
400 1.3 oster dag_h->asmList = asmh_u[stripeNum][j];
401 1.3 oster endASMList = dag_h->asmList;
402 1.3 oster } else {
403 1.3 oster endASMList->next = asmh_u[stripeNum][j];
404 1.3 oster endASMList = endASMList->next;
405 1.3 oster }
406 1.3 oster }
407 1.3 oster RF_Free(asmh_u[stripeNum], numStripeUnits * sizeof(RF_AccessStripeMapHeader_t *));
408 1.3 oster RF_Free(stripeUnitFuncs[stripeNum], numStripeUnits * sizeof(RF_VoidFuncPtr));
409 1.3 oster stripeNum++;
410 1.3 oster }
411 1.13 oster stripeFuncs = stripeFuncs->next;
412 1.13 oster }
413 1.3 oster RF_ASSERT(stripeNum == numStripesBailed);
414 1.3 oster RF_Free(stripeUnitFuncs, asm_h->numStripes * sizeof(RF_VoidFuncPtr));
415 1.3 oster RF_Free(asmh_u, asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
416 1.3 oster if (numStripeUnitsBailed > 0) {
417 1.3 oster RF_ASSERT(stripeUnitNum == numStripeUnitsBailed);
418 1.3 oster RF_Free(blockFuncs, raidPtr->Layout.numDataCol * asm_h->numStripes * sizeof(RF_VoidFuncPtr));
419 1.3 oster RF_Free(asmh_b, raidPtr->Layout.numDataCol * asm_h->numStripes * sizeof(RF_AccessStripeMapHeader_t **));
420 1.1 oster }
421 1.3 oster }
422 1.13 oster while (stripeFuncsList != NULL) {
423 1.13 oster temp = stripeFuncsList;
424 1.13 oster stripeFuncsList = stripeFuncsList->next;
425 1.13 oster rf_FreeFuncList(temp);
426 1.13 oster }
427 1.3 oster return (0);
428 1.1 oster }
429 1.1 oster }
430