Home | History | Annotate | Line # | Download | only in raidframe
rf_dagutils.h revision 1.9 
      1 /*	$NetBSD: rf_dagutils.h,v 1.9 2004/02/29 01:24:34 oster Exp $	*/
      2 /*
      3  * Copyright (c) 1995 Carnegie-Mellon University.
      4  * All rights reserved.
      5  *
      6  * Author: Mark Holland, William V. Courtright II
      7  *
      8  * Permission to use, copy, modify and distribute this software and
      9  * its documentation is hereby granted, provided that both the copyright
     10  * notice and this permission notice appear in all copies of the
     11  * software, derivative works or modified versions, and any portions
     12  * thereof, and that both notices appear in supporting documentation.
     13  *
     14  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
     15  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
     16  * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
     17  *
     18  * Carnegie Mellon requests users of this software to return to
     19  *
     20  *  Software Distribution Coordinator  or  Software.Distribution (at) CS.CMU.EDU
     21  *  School of Computer Science
     22  *  Carnegie Mellon University
     23  *  Pittsburgh PA 15213-3890
     24  *
     25  * any improvements or extensions that they make and grant Carnegie the
     26  * rights to redistribute these changes.
     27  */
     28 
     29 /*************************************************************************
     30  *
     31  * rf_dagutils.h -- header file for utility routines for manipulating DAGs
     32  *
     33  *************************************************************************/
     34 
     35 
     36 #include <dev/raidframe/raidframevar.h>
     37 
     38 #include "rf_dagfuncs.h"
     39 #include "rf_general.h"
     40 
     41 #ifndef _RF__RF_DAGUTILS_H_
     42 #define _RF__RF_DAGUTILS_H_
     43 
     44 struct RF_RedFuncs_s {
     45 	int     (*regular) (RF_DagNode_t *);
     46 	char   *RegularName;
     47 	int     (*simple) (RF_DagNode_t *);
     48 	char   *SimpleName;
     49 };
     50 
     51 typedef struct RF_FuncList_s {
     52 	RF_VoidFuncPtr fp;
     53    	struct RF_FuncList_s *next;
     54 } RF_FuncList_t;
     55 
     56 extern const RF_RedFuncs_t rf_xorFuncs;
     57 extern const RF_RedFuncs_t rf_xorRecoveryFuncs;
     58 
     59 void
     60 rf_InitNode(RF_DagNode_t * node, RF_NodeStatus_t initstatus,
     61 	    int commit,
     62 	    int (*doFunc) (RF_DagNode_t * node),
     63 	    int (*undoFunc) (RF_DagNode_t * node),
     64 	    int (*wakeFunc) (RF_DagNode_t * node, int status),
     65 	    int nSucc, int nAnte, int nParam, int nResult,
     66 	    RF_DagHeader_t * hdr, char *name, RF_AllocListElem_t * alist);
     67 
     68 void    rf_FreeDAG(RF_DagHeader_t * dag_h);
     69 
     70 int     rf_ConfigureDAGs(RF_ShutdownList_t ** listp);
     71 
     72 RF_DagHeader_t *rf_AllocDAGHeader(void);
     73 
     74 void    rf_FreeDAGHeader(RF_DagHeader_t * dh);
     75 
     76 RF_DagList_t *rf_AllocDAGList(void);
     77 void rf_FreeDAGList(RF_DagList_t *);
     78 
     79 RF_FuncList_t *rf_AllocFuncList(void);
     80 void rf_FreeFuncList(RF_FuncList_t *);
     81 
     82 void   *rf_AllocBuffer(RF_Raid_t * raidPtr, RF_DagHeader_t * dag_h,
     83 		       RF_PhysDiskAddr_t * pda,
     84 		       RF_AllocListElem_t * allocList);
     85 
     86 char   *rf_NodeStatusString(RF_DagNode_t * node);
     87 
     88 void    rf_PrintNodeInfoString(RF_DagNode_t * node);
     89 
     90 int     rf_AssignNodeNums(RF_DagHeader_t * dag_h);
     91 
     92 int     rf_RecurAssignNodeNums(RF_DagNode_t * node, int num, int unvisited);
     93 
     94 void    rf_ResetDAGHeaderPointers(RF_DagHeader_t * dag_h,
     95 				  RF_DagHeader_t * newptr);
     96 
     97 void    rf_RecurResetDAGHeaderPointers(RF_DagNode_t * node,
     98 				       RF_DagHeader_t * newptr);
     99 
    100 void    rf_PrintDAGList(RF_DagHeader_t * dag_h);
    101 
    102 int     rf_ValidateDAG(RF_DagHeader_t * dag_h);
    103 
    104 void    rf_redirect_asm(RF_Raid_t * raidPtr, RF_AccessStripeMap_t * asmap);
    105 
    106 void    rf_MapUnaccessedPortionOfStripe(RF_Raid_t * raidPtr,
    107 					RF_RaidLayout_t * layoutPtr,
    108 					RF_AccessStripeMap_t * asmap,
    109 					RF_DagHeader_t * dag_h,
    110 					RF_AccessStripeMapHeader_t ** new_asm_h,
    111 					int *nRodNodes, char **sosBuffer,
    112 					char **eosBuffer,
    113 					RF_AllocListElem_t * allocList);
    114 
    115 int     rf_PDAOverlap(RF_RaidLayout_t * layoutPtr, RF_PhysDiskAddr_t * src,
    116 		      RF_PhysDiskAddr_t * dest);
    117 
    118 void    rf_GenerateFailedAccessASMs(RF_Raid_t * raidPtr,
    119 				    RF_AccessStripeMap_t * asmap,
    120 				    RF_PhysDiskAddr_t * failedPDA,
    121 				    RF_DagHeader_t * dag_h,
    122 				    RF_AccessStripeMapHeader_t ** new_asm_h,
    123 				    int *nXorBufs, char **rpBufPtr,
    124 				    char *overlappingPDAs,
    125 				    RF_AllocListElem_t * allocList);
    126 
    127 /* flags used by RangeRestrictPDA */
    128 #define RF_RESTRICT_NOBUFFER 0
    129 #define RF_RESTRICT_DOBUFFER 1
    130 
    131 void    rf_RangeRestrictPDA(RF_Raid_t * raidPtr, RF_PhysDiskAddr_t * src,
    132 			    RF_PhysDiskAddr_t * dest, int dobuffer,
    133 			    int doraidaddr);
    134 
    135 int     rf_compute_workload_shift(RF_Raid_t * raidPtr,
    136 				  RF_PhysDiskAddr_t * pda);
    137 void    rf_SelectMirrorDiskIdle(RF_DagNode_t * node);
    138 void    rf_SelectMirrorDiskPartition(RF_DagNode_t * node);
    139 
    140 #endif				/* !_RF__RF_DAGUTILS_H_ */
    141