Lines Matching refs:RF_DagNode_t
61 static void rf_RecurPrintDAG(RF_DagNode_t *, int, int);
63 static int rf_ValidateBranch(RF_DagNode_t *, int *, int *,
64 RF_DagNode_t **, int);
65 static void rf_ValidateBranchVisitedBits(RF_DagNode_t *, int, int);
78 would be 534 bytes. Too much to have on-hand in a RF_DagNode_t, but should be ok to
81 #define RF_DAGPCACHE_SIZE ((2*RF_MAXCOL+1*2+1*2*2+3) *(RF_MAX(sizeof(RF_DagParam_t), sizeof(RF_DagNode_t *))))
93 rf_InitNode(RF_DagNode_t *node, RF_NodeStatus_t initstatus, int commit,
94 void (*doFunc) (RF_DagNode_t *node),
95 void (*undoFunc) (RF_DagNode_t *node),
145 } else if (nptrs <= (RF_DAGPCACHE_SIZE / sizeof(RF_DagNode_t *))) {
151 node->succedents = (nSucc) ? (RF_DagNode_t **) ptrs : NULL;
152 node->antecedents = (nAnte) ? (RF_DagNode_t **) (ptrs + nSucc) : NULL;
184 RF_DagNode_t *tmpnode;
252 rf_pool_init(raidPtr, raidPtr->poolNames.dagnode, &raidPtr->pools.dagnode, sizeof(RF_DagNode_t),
279 RF_DagNode_t *
286 rf_FreeDAGNode(RF_Raid_t *raidPtr, RF_DagNode_t *node)
481 rf_NodeStatusString(RF_DagNode_t *node)
498 rf_PrintNodeInfoString(RF_DagNode_t *node)
501 int (*df) (RF_DagNode_t *) = node->doFunc;
551 rf_RecurPrintDAG(RF_DagNode_t *node, int depth, int unvisited)
638 RF_DagNode_t *node;
654 rf_RecurAssignNodeNums(RF_DagNode_t *node, int num, int unvisited)
679 rf_RecurResetDAGHeaderPointers(RF_DagNode_t *node, RF_DagHeader_t *newptr)
702 rf_ValidateBranch(RF_DagNode_t *node, int *scount, int *acount,
703 RF_DagNode_t **nodes, int unvisited)
760 rf_ValidateBranchVisitedBits(RF_DagNode_t *node, int unvisited, int rl)
812 RF_DagNode_t **nodes; /* array of ptrs to nodes in dag */
892 RF_Free(nodes, nodecount * sizeof(RF_DagNode_t *));
1314 rf_SelectMirrorDiskIdle(RF_DagNode_t * node)
1388 rf_SelectMirrorDiskPartition(RF_DagNode_t * node)