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

  /src/sys/dev/raidframe/
rf_dagffwr.c 416 tmpNode->antecedents[0] = blockNode;
422 xorNode->antecedents[i] = tmpNode;
431 xorNode->antecedents[0] = blockNode;
439 commitNode->antecedents[0] = xorNode;
448 tmpNode->antecedents[0] = commitNode;
454 wnpNode->antecedents[0] = commitNode;
460 wnqNode->antecedents[0] = commitNode;
471 termNode->antecedents[i] = tmpNode;
477 termNode->antecedents[nWndNodes] = wnpNode;
483 termNode->antecedents[nWndNodes + 1] = wnqNode
    [all...]
rf_dagffrd.c 113 * and modifying a few params. The "succedents" and "antecedents" fields are
116 * that when this DAG is freed, the succedents and antecedents fields be freed
259 tmpdiskNode->antecedents[0] = blockNode;
265 commitNode->antecedents[i] = tmpdiskNode;
274 termNode->antecedents[0] = commitNode;
282 commitNode->antecedents[0] = blockNode;
293 tmpdiskNode->antecedents[0] = commitNode;
299 termNode->antecedents[i] = tmpdiskNode;
417 tmpreadNode->antecedents[0] = blockNode;
428 commitNode->antecedents[i] = tmpreadNode
    [all...]
rf_parityloggingdags.c 215 rodNodes[i].antecedents[0] = blockNode;
223 syncNode->antecedents[0] = blockNode;
229 syncNode->antecedents[1 + i] = &rodNodes[i];
237 xorNode->antecedents[0] = syncNode;
244 wndNodes[i].antecedents[0] = syncNode;
252 lpoNode->antecedents[0] = xorNode;
260 unblockNode->antecedents[i] = &wndNodes[i];
267 unblockNode->antecedents[nWndNodes] = lpoNode;
275 termNode->antecedents[0] = unblockNode;
522 readDataNodes[i].antecedents[0] = blockNode
    [all...]
rf_dagdegwr.c 481 tmprrdNode->antecedents[0] = blockNode;
492 xorNode->antecedents[i] = tmprrdNode;
501 commitNode->antecedents[0] = xorNode;
510 tmpwndNode->antecedents[0] = commitNode;
518 wnpNode->antecedents[0] = commitNode;
524 wnqNode->antecedents[0] = commitNode;
534 unblockNode->antecedents[i] = tmpwndNode;
542 unblockNode->antecedents[nWndNodes] = wnpNode;
550 unblockNode->antecedents[nWndNodes + 1] = wnqNode;
559 termNode->antecedents[0] = unblockNode
    [all...]
rf_dagdegrd.c 210 rdNode->antecedents[0] = blockNode;
217 commitNode->antecedents[0] = rdNode;
225 termNode->antecedents[0] = commitNode;
499 rpNode->antecedents[0] = blockNode;
505 tmprrdNode->antecedents[0] = blockNode;
513 tmprudNode->antecedents[0] = blockNode;
522 xorNode->antecedents[0] = rpNode;
528 xorNode->antecedents[1 + i] = tmprrdNode;
536 xorNode->antecedents[1 + nRrdNodes + i] = tmprudNode;
545 commitNode->antecedents[0] = xorNode
    [all...]
rf_dag.h 50 #define RF_MAX_ANTECEDENTS 20 /* max num of antecedents a node may posses */
99 int numAntecedents; /* number of antecedents */
100 int numAntDone; /* number of antecedents which have finished */
110 RF_DagNode_t **antecedents; /* antecedents, array size member in struct:RF_DagNode_s
rf_engine.c 343 node->antecedents[j]->numSuccFired++;
388 node->antecedents[j]->numSuccFired++;
432 * antecedents */
443 a = *(node->antecedents + i);
468 if ((s->antType[j] == rf_trueData) && (s->antecedents[j]->status == rf_bad))
521 skiplist->antecedents[i]->numSuccFired++;
533 finishlist->antecedents[i]->numSuccFired++;
555 a = *(node->antecedents + i);
675 /* enqueue node's succedents (antecedents if rollBackward) for
rf_parityscan.c 471 blockNode->succedents[i] = unblockNode->antecedents[i] = tmpNode;
475 tmpNode->antecedents[0] = blockNode;
481 termNode->antecedents[0] = unblockNode;
rf_dagutils.c 152 node->antecedents = (nAnte) ? (RF_DagNode_t **) (ptrs + nSucc) : NULL;
584 printf("%d(%s)%s", node->antecedents[i]->nodeNum, anttype, (i == node->numAntecedents - 1) ? "\0" : " ");
742 if (!node->antecedents[i]) {
746 acount[node->antecedents[i]->nodeNum]++;
870 printf("INVALID DAG: node %s has %d antecedents but appears as a succedent %d times\n",
rf_pqdegdags.c 106 (node)->antecedents[0] = blockNode; \

Completed in 22 milliseconds