NetBSD/sys/dev/raidframe/rf_dagutils.h
oster 85611189b6 These changes complete the effective removal of malloc() from all
write paths within RAIDframe.  They also resolve the "panics with
RAID 5 sets with more than 3 components" issue which was present
(briefly) in the commits which were previously supposed to address
the malloc() issue.

With this new code the 5-component RAID 5 set panics are now gone.

It is also now also possible to swap to RAID 5.

The changes made are:

1) Introduce rf_AllocStripeBuffer() and rf_FreeStripeBuffer() to
allocate/free one stripe's worth of space.  rf_AllocStripeBuffer() is
used in rf_MapUnaccessedPortionOfStripe() where it is not sufficient to
allocate memory using just rf_AllocBuffer().  rf_FreeStripeBuffer() is
called from rf_FreeRaidAccDesc(), well after the DAG is finished.

2) Add a set of emergency "stripe buffers" to struct RF_Raid_s.
Arrange for their initialization in rf_Configure().  In low-memory
situations these buffers will be returned by rf_AllocStripeBuffer()
and re-populated by rf_FreeStripeBuffer().

3) Move	RF_VoidPointerListElem_t *iobufs from the dagHeader into
into struct RF_RaidAccessDesc_s.  This is more consistent with the
original code, and will not result in items being freed "too early".

4) Add a RF_RaidAccessDesc_t *desc to RF_DagHeader_s so that we have a
way to find desc->iobufs.

5) Arrange for desc in the DagHeader to be initialized in InitHdrNode().

6) Don't cleanup iobufs in rf_FreeDAG() -- the freeing is now delayed
until rf_FreeRaidAccDesc() (which is how the original code handled the
allocList, and for which there seem to be some subtle, undocumented
assumptions).

7) Rename rf_AllocBuffer2() to be rf_AllocBuffer() and remove the
former rf_AllocBuffer().  Fix all callers of rf_AllocBuffer().
(This was how it was *supposed* to be after the last time these
changes were made, before they were backed out).

8) Remove RF_IOBufHeader and all references to it.

9) Remove desc->cleanupList and all references to it.

Fixes PR#20191
2004-04-09 23:10:16 +00:00

121 lines
4.1 KiB
C

/* $NetBSD: rf_dagutils.h,v 1.17 2004/04/09 23:10:16 oster Exp $ */
/*
* Copyright (c) 1995 Carnegie-Mellon University.
* All rights reserved.
*
* Author: Mark Holland, William V. Courtright II
*
* Permission to use, copy, modify and distribute this software and
* its documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*/
/*************************************************************************
*
* rf_dagutils.h -- header file for utility routines for manipulating DAGs
*
*************************************************************************/
#include <dev/raidframe/raidframevar.h>
#include "rf_dagfuncs.h"
#include "rf_general.h"
#ifndef _RF__RF_DAGUTILS_H_
#define _RF__RF_DAGUTILS_H_
struct RF_RedFuncs_s {
int (*regular) (RF_DagNode_t *);
char *RegularName;
int (*simple) (RF_DagNode_t *);
char *SimpleName;
};
typedef struct RF_FuncList_s {
RF_VoidFuncPtr fp;
struct RF_FuncList_s *next;
} RF_FuncList_t;
extern const RF_RedFuncs_t rf_xorFuncs;
extern const RF_RedFuncs_t rf_xorRecoveryFuncs;
void rf_InitNode(RF_DagNode_t *, RF_NodeStatus_t, int,
int (*doFunc) (RF_DagNode_t *),
int (*undoFunc) (RF_DagNode_t *),
int (*wakeFunc) (RF_DagNode_t *, int),
int, int, int, int, RF_DagHeader_t *,
char *, RF_AllocListElem_t *);
void rf_FreeDAG(RF_DagHeader_t *);
int rf_ConfigureDAGs(RF_ShutdownList_t **);
RF_DagHeader_t *rf_AllocDAGHeader(void);
void rf_FreeDAGHeader(RF_DagHeader_t * dh);
RF_DagNode_t *rf_AllocDAGNode(void);
void rf_FreeDAGNode(RF_DagNode_t *);
RF_DagList_t *rf_AllocDAGList(void);
void rf_FreeDAGList(RF_DagList_t *);
void *rf_AllocDAGPCache(void);
void rf_FreeDAGPCache(void *);
RF_FuncList_t *rf_AllocFuncList(void);
void rf_FreeFuncList(RF_FuncList_t *);
void *rf_AllocBuffer(RF_Raid_t *, RF_DagHeader_t *, int);
void *rf_AllocIOBuffer(RF_Raid_t *, int);
void rf_FreeIOBuffer(RF_Raid_t *, RF_VoidPointerListElem_t *);
void *rf_AllocStripeBuffer(RF_Raid_t *, RF_DagHeader_t *, int);
void rf_FreeStripeBuffer(RF_Raid_t *, RF_VoidPointerListElem_t *);
char *rf_NodeStatusString(RF_DagNode_t *);
void rf_PrintNodeInfoString(RF_DagNode_t *);
int rf_AssignNodeNums(RF_DagHeader_t *);
int rf_RecurAssignNodeNums(RF_DagNode_t *, int, int);
void rf_ResetDAGHeaderPointers(RF_DagHeader_t *, RF_DagHeader_t *);
void rf_RecurResetDAGHeaderPointers(RF_DagNode_t *, RF_DagHeader_t *);
void rf_PrintDAGList(RF_DagHeader_t *);
int rf_ValidateDAG(RF_DagHeader_t *);
void rf_redirect_asm(RF_Raid_t *, RF_AccessStripeMap_t *);
void rf_MapUnaccessedPortionOfStripe(RF_Raid_t *, RF_RaidLayout_t *,
RF_AccessStripeMap_t *, RF_DagHeader_t *,
RF_AccessStripeMapHeader_t **, int *,
char **, char **, RF_AllocListElem_t *);
int rf_PDAOverlap(RF_RaidLayout_t *, RF_PhysDiskAddr_t *, RF_PhysDiskAddr_t *);
void rf_GenerateFailedAccessASMs(RF_Raid_t *, RF_AccessStripeMap_t *,
RF_PhysDiskAddr_t *, RF_DagHeader_t *,
RF_AccessStripeMapHeader_t **,
int *, char **, char *, RF_AllocListElem_t *);
/* flags used by RangeRestrictPDA */
#define RF_RESTRICT_NOBUFFER 0
#define RF_RESTRICT_DOBUFFER 1
void rf_RangeRestrictPDA(RF_Raid_t *, RF_PhysDiskAddr_t *,
RF_PhysDiskAddr_t *, int, int);
int rf_compute_workload_shift(RF_Raid_t *, RF_PhysDiskAddr_t *);
void rf_SelectMirrorDiskIdle(RF_DagNode_t *);
void rf_SelectMirrorDiskPartition(RF_DagNode_t *);
#endif /* !_RF__RF_DAGUTILS_H_ */