Lines Matching full:edges
2264 * used to define edges that identify numerical node indexes that depend on other
2297 topo->limit = 1; // No edges added yet
2298 topo->edges = NULL; // No edges added yet
2334 // First see if we have enough room in the edges array to add the edge?
2336 if (topo->edges == NULL)
2338 // We don't have any edges yet, so create an array to hold them
2340 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1);
2341 if (topo->edges == NULL)
2352 // WE have some edges but not enough
2354 topo->edges = ANTLR3_REALLOC(topo->edges, sizeof(pANTLR3_BITSET) * (maxEdge + 1));
2355 if (topo->edges == NULL)
2360 // Initialize the new bitmaps to ;indicate we have no edges defined yet
2364 *((topo->edges) + i) = NULL;
2383 edgeDeps = *((topo->edges) + edge);
2387 // No edges are defined yet for this node
2390 *((topo->edges) + edge) = edgeDeps;
2409 * Given a starting node, descend its dependent nodes (ones that it has edges
2410 * to) until we find one without edges. Having found a node without edges, we have
2417 pANTLR3_BITSET edges;
2471 // Now, if this node has edges, then we want to ensure we visit
2475 edges = *((topo->edges) + node);
2476 if (edges != NULL)
2478 // We have some edges, so visit each of the edge nodes
2485 numBits = edges->numBits(edges);
2486 range = edges->size(edges); // Number of set bits
2489 // number of edges that this node refers to (so we don't
2494 if (edges->isMember(edges, i))
2528 // Guard against being called with no edges defined
2530 if (topo->edges == NULL)
2544 // has no edges, we pop back up the stack adding the nodes we traversed in reverse
2558 // get a node without edges or arrive at a node we have already visited.
2615 return; // There were no edges
2715 if (topo->edges != NULL)
2722 edgeList = *((topo->edges) + i);
2729 ANTLR3_FREE(topo->edges);
2731 topo->edges = NULL;
