Lines Matching refs:nodes
208 node nodes[count];
210 nodes[i].init(region->RectAt(i), count);
248 nodes[i].push(&nodes[k]);
249 nodes[k].in_degree++;
251 nodes[k].push(&nodes[i]);
252 nodes[i].in_degree++;
256 // put all nodes onto a stack that have an "indegree" count of zero
259 if (nodes[i].in_degree == 0) {
260 inDegreeZeroNodes.push(&nodes[i]);