61     private size_t[] genCyclePath(size_t srcidx, size_t targetidx, int[][] edges)  in genCyclePath()  argument
93                         foreach (n; edges[i])  in genCyclePath()
133                         foreach (e; edges[m])  in genCyclePath()
241 …      int[][] edges = (cast(int[]*)malloc((int[]).sizeof * _modules.length))[0 .. _modules.length];  in sortCtors()
270                 edges[i] = (cast(int*)realloc(edge, int.sizeof * nEdges))[0 .. nEdges];  in sortCtors()
277             foreach (e; edges)  in sortCtors()
280             .free(edges.ptr);  in sortCtors()
295             auto cyclePath = genCyclePath(sourceIdx, cycleIdx, edges);  in sortCtors()
339                 if (sp.curDep >= edges[sp.curMod].length)  in sortCtors()
348                     auto midx = edges[sp.curMod][sp.curDep];  in sortCtors()
361                                     if (sortCtorsOld(edges))  in sortCtors()
552     bool sortCtorsOld(int[][] edges)  in sortCtorsOld()  argument
554         immutable len = edges.length;  in sortCtorsOld()
651                             if (curmod.flags & MIstandalone || !edges[m].length)  in sortCtorsOld()
666                         if (edges[m].length)  in sortCtorsOld()
675                             mods = edges[m];  in sortCtorsOld()