apply.c   [plain text]

    This software may only be used by you under license from AT&T Corp.
    ("AT&T").  A copy of AT&T's Source Code Agreement is available at
    AT&T's Internet website having the URL:
    If you received this software without first entering into a license
    with AT&T, you have an infringing copy of this software and cannot use
    it without violating AT&T's intellectual property rights.
#pragma prototyped

#include	<aghdr.h>

#ifdef DMALLOC
#include "dmalloc.h"

/* The following functions take a graph and a template (node/edge/graph)
 * and return the object representing the template within the local graph.
static Agobj_t *subnode_search(Agraph_t *sub, Agobj_t *n)
	if (agraphof(n) == sub) return n;
	return (Agobj_t*)agsubnode(sub,(Agnode_t*)n,FALSE);

static Agobj_t *subedge_search(Agraph_t *sub, Agobj_t *e)
	if (agraphof(e) == sub) return e;
	return (Agobj_t*)agsubedge(sub,(Agedge_t*)e,FALSE);

static Agobj_t *subgraph_search(Agraph_t *sub, Agobj_t *g)
	return (Agobj_t*)sub;

/* recursively apply objfn within the hierarchy of a graph.
 * if obj is a node or edge, it and its images in every subg are visited.
 * if obj is a graph, then it and its subgs are visited.
static void rec_apply(Agraph_t *g, Agobj_t *obj, agobjfn_t fn, void *arg,
	agobjsearchfn_t objsearch, int preorder)
	Agraph_t	*sub;
	Agobj_t		*subobj;

	if (preorder) fn(obj,arg);
	for (sub = agfstsubg(g); sub; sub = agnxtsubg(sub)) {
		if ((subobj = objsearch(sub,obj)))
	if (NOT(preorder)) fn(obj,arg);

/* external entry point (this seems to be one of those ineffective
 * comments censured in books on programming style) */
int agapply(Agraph_t *g, Agobj_t* obj, agobjfn_t fn, void *arg, int preorder)
	Agobj_t	*subobj;

	agobjsearchfn_t objsearch;
	switch(AGTYPE(obj)) {
		case AGRAPH: objsearch = subgraph_search; break;
		case AGNODE: objsearch = subnode_search; break;
		case AGOUTEDGE: case AGINEDGE: objsearch = subedge_search; break;
		default: abort();
	if ((subobj = objsearch(g,obj))) {
		return SUCCESS;
	else return FAILURE;