Lines Matching defs:nodes
385 // for C will point to the nodes of A and B as its "successors". Therefor,
472 node nodes[count];
474 nodes[i].init(region->RectAt(i), count);
512 nodes[i].push(&nodes[k]);
513 nodes[k].in_degree++;
515 nodes[k].push(&nodes[i]);
516 nodes[i].in_degree++;
520 // put all nodes onto a stack that have an "indegree" count of zero
523 if (nodes[i].in_degree == 0) {
524 inDegreeZeroNodes.push(&nodes[i]);