Lines Matching defs:nodes
62 * through the graph, blindly executing nodes until it reaches the end.
134 * commit nodes: Xor, Wnd
147 * The block & unblock nodes are leftovers from a previous version. They
210 /* create all the nodes at once */
223 * DAG generator, so here's what I'm gonna do- if there's no read nodes,
236 blockNode->list_next = dag_h->nodes;
237 dag_h->nodes = blockNode;
240 commitNode->list_next = dag_h->nodes;
241 dag_h->nodes = commitNode;
244 unblockNode->list_next = dag_h->nodes;
245 dag_h->nodes = unblockNode;
248 termNode->list_next = dag_h->nodes;
249 dag_h->nodes = termNode;
252 xorNode->list_next = dag_h->nodes;
253 dag_h->nodes = xorNode;
256 wnpNode->list_next = dag_h->nodes;
257 dag_h->nodes = wnpNode;
261 tmpNode->list_next = dag_h->nodes;
262 dag_h->nodes = tmpNode;
264 wndNodes = dag_h->nodes;
268 tmpNode->list_next = dag_h->nodes;
269 dag_h->nodes = tmpNode;
271 rrdNodes = dag_h->nodes;
276 wnqNode->list_next = dag_h->nodes;
277 dag_h->nodes = wnqNode;
283 /* this dag can not commit until all rrd and xor Nodes have completed */
301 * Fill in the Rrd nodes. If any of the rrd buffers are the same size as
303 * of the XOR. The pdas in the rrd nodes have been range-restricted, so if
401 /* fill in the Wnd nodes */
427 /* all the Rrd nodes need to be xored together */
435 /* any Wnd nodes that overlap the failed access need to be
468 * Code to link nodes begins here
475 /* link block node to rd nodes */
486 /* link read nodes to xor node */
504 /* link commit node to wnd nodes */
515 /* link the commit node to wnp, wnq nodes */
528 /* link write new data nodes to unblock node */
721 RF_DagNode_t *nodes, *wudNodes, *rrdNodes, *recoveryNode, *blockNode,
754 nodes = RF_MallocAndAdd(nNodes * sizeof(*nodes), allocList);
755 blockNode = nodes;
773 /* init the block and unblock nodes */
774 /* The block node has all the read nodes as successors */
793 /* build the read nodes */
Indexes created Wed Oct 01 07:09:59 GMT 2025