Lines Matching refs:sorted
1260 // Valid request, return the sorted pointer
2264 * numerical node indexes, which can then be sorted topologically such that
2265 * any node is sorted after all its dependent nodes.
2298 topo->sorted = NULL; // Nothing sorted at the start
2471 // them all before we drop through and add this node into the sorted
2506 // So we just add the node into the sorted list at the
2509 topo->sorted[topo->limit++] = node;
2534 // entries to accomodate the sorted list and another to accomodate
2537 topo->sorted = ANTLR3_MALLOC(topo->limit * sizeof(ANTLR3_UINT32));
2552 topo->limit = 0; // Next entry in the sorted table
2586 return topo->sorted;
2650 // Now we traverse the sorted array and moved the entries of
2662 if (vIndex[topo->sorted[i]] == i)
2668 // vector entry indicated by topo->sorted[i]. The vector entry
2669 // at topo->sorted[i] may have already been swapped out though, so we
2672 ind = vIndex[topo->sorted[i]];
2676 // to be sorted here and the element we swapped out is now the
2680 vIndex[topo->sorted[i]] = i;
2684 // Having traversed all the entries, we have sorted the vector in place.
2697 if (topo->sorted != NULL)
2699 ANTLR3_FREE(topo->sorted);
2700 topo->sorted = NULL;