HomeSort by: relevance | last modified time | path
    Searched defs:dag_h (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/dev/raidframe/
rf_states.c 173 RF_DagHeader_t *dag_h; local in function:rf_ContinueDagAccess
187 dag_h = dagList->dags;
189 dag_h = dag_h->next;
193 if (dag_h->status == rf_rollBackward) {
471 RF_DagHeader_t *dag_h; local in function:rf_State_CreateDAG
524 dag_h = dagList->dags;
525 while (dag_h) {
526 dag_h->bp = (struct buf *) desc->bp;
528 dag_h->tracerec = tracerec
552 RF_DagHeader_t *dag_h; local in function:rf_State_ExecuteDAG
594 RF_DagHeader_t *dag_h; local in function:rf_State_ProcessDAG
    [all...]
rf_aselect.c 113 RF_DagHeader_t *dag_h = NULL, *tempdag_h, *lastdag_h; local in function:rf_SelectAlgorithm
345 dag_h = NULL;
380 if (dag_h == NULL) {
381 dag_h = tempdag_h;
400 if (dag_h == NULL) {
401 dag_h = tempdag_h;
422 dag_h = tempdag_h;
427 dagList->dags = dag_h;
437 /* here we build up dag_h->asmList for this dag...
447 dag_h = dagList->dags
    [all...]
rf_parityscan.c 425 RF_DagHeader_t *dag_h; local in function:rf_MakeSimpleDAG
431 dag_h = rf_AllocDAGHeader(raidPtr);
432 dag_h->raidPtr = (void *) raidPtr;
433 dag_h->allocList = NULL;/* we won't use this alloc list */
434 dag_h->status = rf_enable;
435 dag_h->numSuccedents = 1;
436 dag_h->creator = "SimpleDAG";
440 dag_h->numCommitNodes = 1;
441 dag_h->numCommits = 0;
448 tmpNode->list_next = dag_h->nodes
    [all...]

Completed in 53 milliseconds