--- /dev/null
+% Remember to use the lgrind style
+
+\Head{}
+\File{agmemread.c}{2013}{3}{6}{15:39}{893}
+\L{\LB{\K{typedef}_\K{struct}_\{}}
+\L{\LB{}\Tab{4}{\V{const}_\K{char}_*\V{data};}}
+\L{\LB{}\Tab{4}{\K{int}_\V{len};}}
+\L{\LB{}\Tab{4}{\K{int}_\V{cur};}}
+\L{\LB{\}_\V{rdr\_t};}}
+\L{\LB{}}
+\index{memiofread}\Proc{memiofread}\L{\LB{\K{static}_\K{int}_\V{memiofread}(\K{void}_*\V{chan},_\K{char}_*\V{buf},_\K{int}_\V{bufsize})}}
+\L{\LB{\{}}
+\L{\LB{}\Tab{4}{\V{const}_\K{char}_*\V{ptr};}}
+\L{\LB{}\Tab{4}{\K{char}_*\V{optr};}}
+\L{\LB{}\Tab{4}{\K{char}_\V{c};}}
+\L{\LB{}\Tab{4}{\K{int}_\V{l};}}
+\L{\LB{}\Tab{4}{\V{rdr\_t}_*\V{s};}}
+\L{\LB{}}
+\L{\LB{}\Tab{4}{\K{if}_(\V{bufsize}_==_\N{0})_\K{return}_\N{0};}}
+\L{\LB{}\Tab{4}{\V{s}_=_(\V{rdr\_t}_*)_\V{chan};}}
+\L{\LB{}\Tab{4}{\K{if}_(\V{s}\-\!\>\V{cur}_\>=_\V{s}\-\!\>\V{len})}}
+\L{\LB{}\Tab{8}{\K{return}_\N{0};}}
+\L{\LB{}\Tab{4}{\V{l}_=_\N{0};}}
+\L{\LB{}\Tab{4}{\V{ptr}_=_\V{s}\-\!\>\V{data}_+_\V{s}\-\!\>\V{cur};}}
+\L{\LB{}\Tab{4}{\V{optr}_=_\V{buf};}}
+\L{\LB{}\Tab{4}{\K{do}_\{}}
+\L{\LB{}\Tab{8}{*\V{optr}++_=_\V{c}_=_*\V{ptr}++;}}
+\L{\LB{}\Tab{8}{\V{l}++;}}
+\L{\LB{}\Tab{4}{\}_\K{while}_(\V{c}_\&\&_(\V{c}_!=_\S{}{'}\2n{'}\SE{})_\&\&_(\V{l}_\<_\V{bufsize}));}}
+\L{\LB{}\Tab{4}{\V{s}\-\!\>\V{cur}_+=_\V{l};}}
+\L{\LB{}\Tab{4}{\K{return}_\V{l};}}
+\L{\LB{\}}}
+\L{\LB{}}
+\L{\LB{\K{static}_\V{Agiodisc\_t}_\V{memIoDisc}_=_\{\V{memiofread},_\N{0},_\N{0}\};}}
+\L{\LB{}}
+\index{agmemread}\Proc{agmemread}\L{\LB{\V{Agraph\_t}_*\V{agmemread}(\V{const}_\K{char}_*\V{cp})}}
+\L{\LB{\{}}
+\L{\LB{}\Tab{4}{\V{rdr\_t}_\V{rdr};}}
+\L{\LB{}\Tab{4}{\V{Agdisc\_t}_\V{disc};}}
+\L{\LB{}\Tab{4}{\V{Agiodisc\_t}_\V{memIoDisc};}}
+\L{\LB{}}
+\L{\LB{}\Tab{4}{\V{memIoDisc}.\V{putstr}_=_\V{AgIoDisc}.\V{putstr};}}
+\L{\LB{}\Tab{4}{\V{memIoDisc}.\V{flush}_=_\V{AgIoDisc}.\V{flush};}}
+\L{\LB{}\Tab{4}{\V{rdr}.\V{data}_=_\V{cp};}}
+\L{\LB{}\Tab{4}{\V{rdr}.\V{len}_=_\V{strlen}(\V{cp});}}
+\L{\LB{}\Tab{4}{\V{rdr}.\V{cur}_=_\N{0};}}
+\L{\LB{}}
+\L{\LB{}\Tab{4}{\V{disc}.\V{mem}_=_\V{NULL};}}
+\L{\LB{}\Tab{4}{\V{disc}.\V{id}_=_\V{NULL};}}
+\L{\LB{}\Tab{4}{\V{disc}.\V{io}_=_\&\V{memIoDisc};}}
+\L{\LB{}\Tab{4}{\K{return}_\V{agread}_(\&\V{rdr},_\&\V{disc});}}
+\L{\LB{\}}}
--- /dev/null
+
+/*************************************************************************
+ * Copyright (c) 2011 AT&T Intellectual Property
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors: See CVS logs. Details at http://www.graphviz.org/
+ *************************************************************************/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <stdio.h>
+#include <stdlib.h>
+#ifdef HAVE_UNISTD_H
+#include <unistd.h>
+#endif
+#include "cgraph.h"
+#include "ingraphs.h"
+
+#ifdef HAVE_GETOPT_H
+#include <getopt.h>
+#else
+#include "compat_getopt.h"
+#endif
+
+#define INF ((unsigned int)(-1))
+
+typedef struct Agraphinfo_t {
+ Agrec_t h;
+ Agnode_t *rep;
+} Agraphinfo_t;
+
+typedef struct Agnodeinfo_t {
+ Agrec_t h;
+ unsigned int val;
+ Agraph_t *scc;
+} Agnodeinfo_t;
+
+#define getrep(g) (((Agraphinfo_t*)(g->base.data))->rep)
+#define setrep(g,rep) (getrep(g) = rep)
+#define getscc(n) (((Agnodeinfo_t*)((n)->base.data))->scc)
+#define setscc(n,sub) (getscc(n) = sub)
+#define getval(n) (((Agnodeinfo_t*)((n)->base.data))->val)
+#define setval(n,newval) (getval(n) = newval)
+
+/********* stack ***********/
+typedef struct {
+ Agnode_t **data;
+ Agnode_t **ptr;
+} Stack;
+
+static void initStack(Stack * sp, int sz)
+{
+ sp->data = (Agnode_t **) malloc(sz * sizeof(Agnode_t *));
+ sp->ptr = sp->data;
+}
+
+static void freeStack(Stack * sp)
+{
+ free(sp->data);
+}
+
+static void push(Stack * sp, Agnode_t * n)
+{
+ *(sp->ptr++) = n;
+}
+
+static Agnode_t *top(Stack * sp)
+{
+ return *(sp->ptr - 1);
+}
+
+static Agnode_t *pop(Stack * sp)
+{
+ sp->ptr--;
+ return *(sp->ptr);
+}
+
+/********* end stack ***********/
+
+typedef struct {
+ int Comp;
+ int ID;
+ int N_nodes_in_nontriv_SCC;
+} sccstate;
+
+static int wantDegenerateComp;
+static int Silent;
+static int StatsOnly;
+static int Verbose;
+static char *CmdName;
+static char **Files;
+static FILE *outfp; /* output; stdout by default */
+
+static void nodeInduce(Agraph_t * g, Agraph_t * map)
+{
+ Agnode_t *n;
+ Agedge_t *e;
+ Agraph_t *rootg = agroot(g);
+
+
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ for (e = agfstout(rootg, n); e; e = agnxtout(rootg, e)) {
+ if (agsubnode(g, aghead(e), FALSE))
+ agsubedge(g, e, TRUE);
+ else {
+ Agraph_t *tscc = getscc(agtail(e));
+ Agraph_t *hscc = getscc(aghead(e));
+ if (tscc && hscc)
+ agedge(map, getrep(tscc),
+ getrep(hscc), NIL(char *), TRUE);
+ }
+ }
+ }
+}
+
+static int visit(Agnode_t * n, Agraph_t * map, Stack * sp, sccstate * st)
+{
+ unsigned int m, min;
+ Agnode_t *t;
+ Agraph_t *subg;
+ Agedge_t *e;
+
+ min = ++(st->ID);
+ setval(n, min);
+ push(sp, n);
+
+ for (e = agfstout(n->root, n); e; e = agnxtout(n->root, e)) {
+ t = aghead(e);
+ if (getval(t) == 0)
+ m = visit(t, map, sp, st);
+ else
+ m = getval(t);
+ if (m < min)
+ min = m;
+ }
+
+ if (getval(n) == min) {
+ if (!wantDegenerateComp && (top(sp) == n)) {
+ setval(n, INF);
+ pop(sp);
+ } else {
+ char name[32];
+ Agraph_t *G = agraphof(n);;
+ sprintf(name, "cluster_%d", (st->Comp)++);
+ subg = agsubg(G, name, TRUE);
+ agbindrec(subg, "scc_graph", sizeof(Agraphinfo_t), TRUE);
+ setrep(subg, agnode(map, name, TRUE));
+ do {
+ t = pop(sp);
+ agsubnode(subg, t, TRUE);
+ setval(t, INF);
+ setscc(t, subg);
+ st->N_nodes_in_nontriv_SCC++;
+ } while (t != n);
+ nodeInduce(subg, map);
+ if (!StatsOnly)
+ agwrite(subg, outfp);
+ }
+ }
+ return min;
+}
+
+static int label(Agnode_t * n, int nodecnt, int *edgecnt)
+{
+ Agedge_t *e;
+
+ setval(n, 1);
+ nodecnt++;
+ for (e = agfstedge(n->root, n); e; e = agnxtedge(n->root, e, n)) {
+ (*edgecnt) += 1;
+ if (e->node == n)
+ e = agopp(e);
+ if (!getval(e->node))
+ nodecnt = label(e->node, nodecnt, edgecnt);
+ }
+ return nodecnt;
+}
+
+static int
+countComponents(Agraph_t * g, int *max_degree, float *nontree_frac)
+{
+ int nc = 0;
+ int sum_edges = 0;
+ int sum_nontree = 0;
+ int deg;
+ int n_edges;
+ int n_nodes;
+ Agnode_t *n;
+
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ if (!getval(n)) {
+ nc++;
+ n_edges = 0;
+ n_nodes = label(n, 0, &n_edges);
+ sum_edges += n_edges;
+ sum_nontree += (n_edges - n_nodes + 1);
+ }
+ }
+ if (max_degree) {
+ int maxd = 0;
+ for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
+ deg = agdegree(g, n, TRUE, TRUE);
+ if (maxd < deg)
+ maxd = deg;
+ setval(n, 0);
+ }
+ *max_degree = maxd;
+ }
+ if (nontree_frac) {
+ if (sum_edges > 0)
+ *nontree_frac = (float) sum_nontree / (float) sum_edges;
+ else
+ *nontree_frac = 0.0;
+ }
+ return nc;
+}
+
+static void process(Agraph_t * G)
+{
+ Agnode_t *n;
+ Agraph_t *map;
+ int nc = 0;
+ float nontree_frac = 0;
+ int Maxdegree = 0;
+ Stack stack;
+ sccstate state;
+
+ aginit(G, AGRAPH, "scc_graph", sizeof(Agraphinfo_t), TRUE);
+ aginit(G, AGNODE, "scc_node", sizeof(Agnodeinfo_t), TRUE);
+ state.Comp = state.ID = 0;
+ state.N_nodes_in_nontriv_SCC = 0;
+
+ if (Verbose)
+ nc = countComponents(G, &Maxdegree, &nontree_frac);
+
+ initStack(&stack, agnnodes(G) + 1);
+ map = agopen("scc_map", Agdirected, (Agdisc_t *) 0);
+ for (n = agfstnode(G); n; n = agnxtnode(G, n))
+ if (getval(n) == 0)
+ visit(n, map, &stack, &state);
+ freeStack(&stack);
+ if (!StatsOnly)
+ agwrite(map, outfp);
+ agclose(map);
+
+ if (Verbose)
+ fprintf(stderr, "%d %d %d %d %.4f %d %.4f\n",
+ agnnodes(G), agnedges(G), nc, state.Comp,
+ state.N_nodes_in_nontriv_SCC / (double) agnnodes(G),
+ Maxdegree, nontree_frac);
+ else if (!Silent)
+ fprintf(stderr, "%d nodes, %d edges, %d strong components\n",
+ agnnodes(G), agnedges(G), state.Comp);
+
+}
+
+static FILE *openFile(char *name, char *mode)
+{
+ FILE *fp;
+ char *modestr;
+
+ fp = fopen(name, mode);
+ if (!fp) {
+ if (*mode == 'r')
+ modestr = "reading";
+ else
+ modestr = "writing";
+ fprintf(stderr, "gvpack: could not open file %s for %s\n",
+ name, modestr);
+ exit(1);
+ }
+ return (fp);
+}
+
+static char *useString = "Usage: %s [-sdv?] <files>\n\
+ -s - only produce statistics\n\
+ -S - silent\n\
+ -d - allow degenerate components\n\
+ -o<outfile> - write to <outfile> (stdout)\n\
+ -v - verbose\n\
+ -? - print usage\n\
+If no files are specified, stdin is used\n";
+
+static void usage(int v)
+{
+ printf(useString, CmdName);
+ exit(v);
+}
+
+static void scanArgs(int argc, char **argv)
+{
+ int c;
+
+ CmdName = argv[0];
+ opterr = 0;
+ while ((c = getopt(argc, argv, ":o:sdvS")) != EOF) {
+ switch (c) {
+ case 's':
+ StatsOnly = 1;
+ break;
+ case 'd':
+ wantDegenerateComp = 1;
+ break;
+ case 'o':
+ outfp = openFile(optarg, "w");
+ break;
+ case 'v':
+ Verbose = 1;
+ break;
+ case 'S':
+ Verbose = 0;
+ Silent = 1;
+ break;
+ case '?':
+ if (optopt == '?')
+ usage(0);
+ else
+ fprintf(stderr, "%s: option -%c unrecognized - ignored\n",
+ CmdName, optopt);
+ break;
+ }
+ }
+ argv += optind;
+ argc -= optind;
+
+ if (argc)
+ Files = argv;
+ if (!outfp)
+ outfp = stdout; /* stdout the default */
+}
+
+static Agraph_t *gread(FILE * fp)
+{
+ return agread(fp, (Agdisc_t *) 0);
+}
+
+int main(int argc, char **argv)
+{
+ Agraph_t *g;
+ ingraph_state ig;
+
+ scanArgs(argc, argv);
+ newIngraph(&ig, Files, gread);
+
+ while ((g = nextGraph(&ig)) != 0) {
+ if (agisdirected(g))
+ process(g);
+ else
+ fprintf(stderr, "Graph %s in %s is undirected - ignored\n",
+ agnameof(g), fileName(&ig));
+ agclose(g);
+ }
+
+ return 0;
+}
projects / graphviz / commitdiff