Lines Matching refs:edges
2263 * used to define edges that identify numerical node indexes that depend on other
2296 topo->limit = 1; // No edges added yet
2297 topo->edges = NULL; // No edges added yet
2333 // First see if we have enough room in the edges array to add the edge?
2335 if (topo->edges == NULL)
2337 // We don't have any edges yet, so create an array to hold them
2339 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1);
2340 if (topo->edges == NULL)
2351 // WE have some edges but not enough
2353 topo->edges = ANTLR3_REALLOC(topo->edges, sizeof(pANTLR3_BITSET) * (maxEdge + 1));
2354 if (topo->edges == NULL)
2359 // Initialize the new bitmaps to ;indicate we have no edges defined yet
2363 *((topo->edges) + i) = NULL;
2382 edgeDeps = *((topo->edges) + edge);
2386 // No edges are defined yet for this node
2389 *((topo->edges) + edge) = edgeDeps;
2408 * Given a starting node, descend its dependent nodes (ones that it has edges
2409 * to) until we find one without edges. Having found a node without edges, we have
2416 pANTLR3_BITSET edges;
2470 // Now, if this node has edges, then we want to ensure we visit
2474 edges = *((topo->edges) + node);
2475 if (edges != NULL)
2477 // We have some edges, so visit each of the edge nodes
2484 numBits = edges->numBits(edges);
2485 range = edges->size(edges); // Number of set bits
2488 // number of edges that this node refers to (so we don't
2493 if (edges->isMember(edges, i))
2527 // Guard against being called with no edges defined
2529 if (topo->edges == NULL)
2543 // has no edges, we pop back up the stack adding the nodes we traversed in reverse
2557 // get a node without edges or arrive at a node we have already visited.
2614 return; // There were no edges
2714 if (topo->edges != NULL)
2721 edgeList = *((topo->edges) + i);
2728 ANTLR3_FREE(topo->edges);
2730 topo->edges = NULL;