Home | History | Annotate | Line # | Download | only in raidframe
      1  1.22   msaitoh /*	$NetBSD: rf_dag.h,v 1.22 2021/12/05 04:28:53 msaitoh 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: William V. Courtright II, Mark Holland
      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  * dag.h -- header file for DAG-related data structures                     *
     32   1.1     oster  *                                                                          *
     33   1.1     oster  ****************************************************************************/
     34   1.1     oster 
     35   1.1     oster #ifndef _RF__RF_DAG_H_
     36   1.1     oster #define _RF__RF_DAG_H_
     37   1.1     oster 
     38   1.4     oster #include <dev/raidframe/raidframevar.h>
     39   1.4     oster 
     40   1.1     oster #include "rf_threadstuff.h"
     41   1.1     oster #include "rf_alloclist.h"
     42   1.1     oster #include "rf_stripelocks.h"
     43   1.1     oster #include "rf_layout.h"
     44   1.1     oster #include "rf_dagflags.h"
     45   1.1     oster #include "rf_acctrace.h"
     46  1.16     oster #include "rf_desc.h"
     47   1.1     oster 
     48   1.3     oster #define RF_THREAD_CONTEXT   0	/* we were invoked from thread context */
     49   1.3     oster #define RF_INTR_CONTEXT     1	/* we were invoked from interrupt context */
     50   1.3     oster #define RF_MAX_ANTECEDENTS 20	/* max num of antecedents a node may posses */
     51   1.1     oster 
     52   1.1     oster #include <sys/buf.h>
     53   1.1     oster 
     54   1.3     oster struct RF_PropHeader_s {	/* structure for propagation of results */
     55   1.3     oster 	int     paramNum;	/* to parameter # paramNum */
     56   1.3     oster 	RF_PropHeader_t *next;	/* linked list for multiple results/params */
     57   1.1     oster };
     58   1.1     oster 
     59   1.1     oster typedef enum RF_NodeStatus_e {
     60   1.3     oster 	rf_wait,		/* node is waiting to be executed */
     61   1.3     oster 	rf_fired,		/* node is currently executing its do function */
     62   1.3     oster 	rf_good,		/* node successfully completed execution of
     63   1.3     oster 				 * its do function */
     64   1.3     oster 	rf_bad,			/* node failed to successfully execute its do
     65   1.3     oster 				 * function */
     66   1.3     oster 	rf_skipped,		/* not used anymore, used to imply a node was
     67   1.3     oster 				 * not executed */
     68   1.3     oster 	rf_recover,		/* node is currently executing its undo
     69   1.3     oster 				 * function */
     70   1.3     oster 	rf_panic,		/* node failed to successfully execute its
     71   1.3     oster 				 * undo function */
     72   1.3     oster 	rf_undone		/* node successfully executed its undo
     73   1.3     oster 				 * function */
     74   1.3     oster }       RF_NodeStatus_t;
     75   1.1     oster /*
     76   1.1     oster  * These were used to control skipping a node.
     77   1.1     oster  * Now, these are only used as comments.
     78   1.1     oster  */
     79   1.1     oster typedef enum RF_AntecedentType_e {
     80   1.3     oster 	rf_trueData,
     81   1.3     oster 	rf_antiData,
     82   1.3     oster 	rf_outputData,
     83   1.3     oster 	rf_control
     84   1.3     oster }       RF_AntecedentType_t;
     85   1.1     oster #define RF_DAG_PTRCACHESIZE   40
     86   1.1     oster #define RF_DAG_PARAMCACHESIZE 12
     87   1.1     oster 
     88   1.1     oster typedef RF_uint8 RF_DagNodeFlags_t;
     89   1.1     oster 
     90   1.1     oster struct RF_DagNode_s {
     91   1.3     oster 	RF_NodeStatus_t status;	/* current status of this node */
     92  1.20  christos 	void    (*doFunc) (RF_DagNode_t *);	/* normal function */
     93  1.20  christos 	void    (*undoFunc) (RF_DagNode_t *);	/* func to remove effect of
     94   1.3     oster 						 * doFunc */
     95  1.20  christos 	void    (*wakeFunc) (void *, int);	/* func called when the
     96  1.20  christos 						 * node completes an I/O */
     97   1.3     oster 	int     numParams;	/* number of parameters required by *funcPtr */
     98   1.3     oster 	int     numResults;	/* number of results produced by *funcPtr */
     99   1.3     oster 	int     numAntecedents;	/* number of antecedents */
    100   1.3     oster 	int     numAntDone;	/* number of antecedents which have finished */
    101   1.3     oster 	int     numSuccedents;	/* number of succedents */
    102   1.3     oster 	int     numSuccFired;	/* incremented when a succedent is fired
    103   1.3     oster 				 * during forward execution */
    104   1.3     oster 	int     numSuccDone;	/* incremented when a succedent finishes
    105   1.3     oster 				 * during rollBackward */
    106   1.3     oster 	int     commitNode;	/* boolean flag - if true, this is a commit
    107   1.3     oster 				 * node */
    108   1.3     oster 	RF_DagNode_t **succedents;	/* succedents, array size
    109   1.3     oster 					 * numSuccedents */
    110   1.3     oster 	RF_DagNode_t **antecedents;	/* antecedents, array size
    111   1.3     oster 					 * numAntecedents */
    112   1.3     oster 	RF_AntecedentType_t antType[RF_MAX_ANTECEDENTS];	/* type of each
    113   1.3     oster 								 * antecedent */
    114   1.3     oster 	void  **results;	/* array of results produced by *funcPtr */
    115   1.3     oster 	RF_DagParam_t *params;	/* array of parameters required by *funcPtr */
    116   1.3     oster 	RF_PropHeader_t **propList;	/* propagation list, size
    117   1.3     oster 					 * numSuccedents */
    118   1.3     oster 	RF_DagHeader_t *dagHdr;	/* ptr to head of dag containing this node */
    119   1.3     oster 	void   *dagFuncData;	/* dag execution func uses this for whatever
    120   1.3     oster 				 * it wants */
    121  1.12     oster 	RF_DagNode_t *next;     /* next in terms of propagating results */
    122  1.12     oster 	RF_DagNode_t *list_next; /* next in the list of DAG nodes for this DAG */
    123   1.3     oster 	int     nodeNum;	/* used by PrintDAG for debug only */
    124   1.3     oster 	int     visited;	/* used to avoid re-visiting nodes on DAG
    125   1.3     oster 				 * walks */
    126   1.3     oster 	/* ANY CODE THAT USES THIS FIELD MUST MAINTAIN THE PROPERTY THAT AFTER
    127   1.3     oster 	 * IT FINISHES, ALL VISITED FLAGS IN THE DAG ARE IDENTICAL */
    128  1.18  christos 	const char   *name;	/* debug only */
    129   1.3     oster 	RF_DagNodeFlags_t flags;/* see below */
    130  1.14     oster 	RF_DagNode_t *big_dag_ptrs;  /* used in cases where the cache below isn't big enough */
    131  1.14     oster 	RF_DagParam_t *big_dag_params; /* used when the cache below isn't big enough */
    132   1.3     oster 	RF_DagNode_t *dag_ptrs[RF_DAG_PTRCACHESIZE];	/* cache for performance */
    133   1.3     oster 	RF_DagParam_t dag_params[RF_DAG_PARAMCACHESIZE];	/* cache for performance */
    134   1.1     oster };
    135   1.1     oster /*
    136   1.1     oster  * Bit values for flags field of RF_DagNode_t
    137   1.1     oster  */
    138   1.1     oster #define RF_DAGNODE_FLAG_NONE  0x00
    139   1.3     oster #define RF_DAGNODE_FLAG_YIELD 0x01	/* in the kernel, yield the processor
    140   1.3     oster 					 * before firing this node */
    141   1.1     oster 
    142   1.1     oster /* enable - DAG ready for normal execution, no errors encountered
    143   1.1     oster  * rollForward - DAG encountered an error after commit point, rolling forward
    144   1.1     oster  * rollBackward - DAG encountered an error prior to commit point, rolling backward
    145   1.1     oster  */
    146   1.1     oster typedef enum RF_DagStatus_e {
    147   1.3     oster 	rf_enable,
    148   1.3     oster 	rf_rollForward,
    149   1.3     oster 	rf_rollBackward
    150   1.3     oster }       RF_DagStatus_t;
    151   1.1     oster #define RF_MAX_HDR_SUCC 1
    152   1.1     oster 
    153   1.1     oster struct RF_DagHeader_s {
    154   1.3     oster 	RF_DagStatus_t status;	/* status of this DAG */
    155   1.3     oster 	int     numSuccedents;	/* DAG may be a tree, i.e. may have > 1 root */
    156   1.3     oster 	int     numCommitNodes;	/* number of commit nodes in graph */
    157   1.3     oster 	int     numCommits;	/* number of commit nodes which have been
    158   1.3     oster 				 * fired  */
    159   1.3     oster 	RF_DagNode_t *succedents[RF_MAX_HDR_SUCC];	/* array of succedents,
    160   1.3     oster 							 * size numSuccedents */
    161   1.3     oster 	RF_DagHeader_t *next;	/* ptr to allow a list of dags */
    162   1.3     oster 	RF_AllocListElem_t *allocList;	/* ptr to list of ptrs to be freed
    163   1.3     oster 					 * prior to freeing DAG */
    164   1.3     oster 	RF_AccessStripeMapHeader_t *asmList;	/* list of access stripe maps
    165   1.3     oster 						 * to be freed */
    166   1.3     oster 	int     nodeNum;	/* used by PrintDAG for debug only */
    167   1.3     oster 	int     numNodesCompleted;
    168   1.9     oster #if RF_ACC_TRACE > 0
    169   1.3     oster 	RF_AccTraceEntry_t *tracerec;	/* perf mon only */
    170   1.9     oster #endif
    171   1.3     oster 	void    (*cbFunc) (void *);	/* function to call when the dag
    172   1.3     oster 					 * completes */
    173   1.3     oster 	void   *cbArg;		/* argument for cbFunc */
    174  1.18  christos 	const char   *creator;	/* name of function used to create this dag */
    175  1.12     oster 	RF_DagNode_t *nodes;    /* linked list of nodes used in this DAG */
    176  1.17     perry 	RF_PhysDiskAddr_t *pda_cleanup_list; /* for PDAs that can't get
    177  1.13     oster 						cleaned up any other way... */
    178   1.3     oster 	RF_Raid_t *raidPtr;	/* the descriptor for the RAID device this DAG
    179   1.3     oster 				 * is for */
    180  1.16     oster 	RF_RaidAccessDesc_t *desc;	/* ptr to descriptor for this access */
    181  1.21  jdolecek 	const struct buf *bp;	/* the bp for this I/O passed down from the
    182   1.3     oster 				 * file system. ignored outside kernel */
    183   1.1     oster };
    184   1.1     oster 
    185   1.1     oster struct RF_DagList_s {
    186   1.3     oster 	/* common info for a list of dags which will be fired sequentially */
    187   1.3     oster 	int     numDags;	/* number of dags in the list */
    188   1.3     oster 	int     numDagsFired;	/* number of dags in list which have initiated
    189   1.3     oster 				 * execution */
    190   1.3     oster 	int     numDagsDone;	/* number of dags in list which have completed
    191   1.3     oster 				 * execution */
    192   1.3     oster 	RF_DagHeader_t *dags;	/* list of dags */
    193   1.3     oster 	RF_RaidAccessDesc_t *desc;	/* ptr to descriptor for this access */
    194   1.3     oster 	RF_AccTraceEntry_t tracerec;	/* perf mon info for dags (not user
    195   1.3     oster 					 * info) */
    196   1.8     oster 	struct RF_DagList_s *next;     /* next DagList, if any */
    197   1.1     oster };
    198   1.1     oster 
    199  1.22   msaitoh /* convenience macro for declaring a create dag function */
    200   1.1     oster 
    201   1.1     oster #define RF_CREATE_DAG_FUNC_DECL(_name_) \
    202   1.1     oster void _name_ ( \
    203   1.1     oster 	RF_Raid_t             *raidPtr, \
    204   1.1     oster 	RF_AccessStripeMap_t  *asmap, \
    205   1.1     oster 	RF_DagHeader_t        *dag_h, \
    206   1.1     oster 	void                  *bp, \
    207   1.1     oster 	RF_RaidAccessFlags_t   flags, \
    208   1.1     oster 	RF_AllocListElem_t    *allocList)
    209   1.1     oster 
    210   1.3     oster #endif				/* !_RF__RF_DAG_H_ */
    211