HomeSort by: relevance | last modified time | path
    Searched refs:dagList (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/dev/raidframe/
rf_states.c 166 rf_ContinueDagAccess(RF_DagList_t *dagList)
169 RF_AccTraceEntry_t *tracerec = &(dagList->desc->tracerec);
176 desc = dagList->desc;
187 dag_h = dagList->dags;
188 for (i = 0; i < dagList->numDagsDone; i++) {
208 dagList->numDagsDone++;
472 RF_DagList_t *dagList;
485 dagList = desc->dagList;
487 rf_PrintDAGList(dagList->dags)
    [all...]
rf_states.h 35 void rf_ContinueDagAccess(RF_DagList_t * dagList);
rf_aselect.c 76 * return the lists in the desc->dagList (which is a list of lists).
81 * as a linked list (dagList) which is executed sequentially (to preserve
114 RF_DagList_t *dagList, *dagListend;
347 dagList = rf_AllocDAGList(raidPtr);
349 /* always tack the new dagList onto the end of the list... */
351 desc->dagList = dagList;
353 dagListend->next = dagList;
355 dagListend = dagList;
357 dagList->desc = desc
    [all...]
rf_desc.h 80 RF_DagList_t *dagList; /* list of dag lists, one list per stripe */
rf_driver.c 612 desc->dagList = NULL;
632 RF_DagList_t *dagList, *temp;
637 /* Cleanup the dagList(s) */
638 dagList = desc->dagList;
639 while(dagList != NULL) {
640 temp = dagList;
641 dagList = dagList->next;
rf_dagutils.c 242 pool_destroy(&raidPtr->pools.daglist);
256 rf_pool_init(raidPtr, raidPtr->poolNames.daglist, &raidPtr->pools.daglist, sizeof(RF_DagList_t),
257 "daglist", RF_MIN_FREE_DAGLIST, RF_MAX_FREE_DAGLIST);
300 return pool_get(&raidPtr->pools.daglist, PR_WAITOK | PR_ZERO);
304 rf_FreeDAGList(RF_Raid_t *raidPtr, RF_DagList_t *dagList)
306 pool_put(&raidPtr->pools.daglist, dagList);

Completed in 14 milliseconds