lookup.c revision 1590
1/*
2 * Copyright (c) 1983, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35static char sccsid[] = "@(#)lookup.c	8.1 (Berkeley) 6/6/93";
36#endif /* not lint */
37
38#include "gprof.h"
39
40    /*
41     *	look up an address in a sorted-by-address namelist
42     *	    this deals with misses by mapping them to the next lower
43     *	    entry point.
44     */
45nltype *
46nllookup( address )
47    unsigned long	address;
48{
49    register long	low;
50    register long	middle;
51    register long	high;
52#   ifdef DEBUG
53	register int	probes;
54
55	probes = 0;
56#   endif DEBUG
57    for ( low = 0 , high = nname - 1 ; low != high ; ) {
58#	ifdef DEBUG
59	    probes += 1;
60#	endif DEBUG
61	middle = ( high + low ) >> 1;
62	if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
63#	    ifdef DEBUG
64		if ( debug & LOOKUPDEBUG ) {
65		    printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
66		}
67#	    endif DEBUG
68	    return &nl[ middle ];
69	}
70	if ( nl[ middle ].value > address ) {
71	    high = middle;
72	} else {
73	    low = middle + 1;
74	}
75    }
76#   ifdef DEBUG
77	if ( debug & LOOKUPDEBUG ) {
78	    fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
79		nname-1 );
80	}
81#   endif DEBUG
82    return 0;
83}
84
85arctype *
86arclookup( parentp , childp )
87    nltype	*parentp;
88    nltype	*childp;
89{
90    arctype	*arcp;
91
92    if ( parentp == 0 || childp == 0 ) {
93	fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
94	return 0;
95    }
96#   ifdef DEBUG
97	if ( debug & LOOKUPDEBUG ) {
98	    printf( "[arclookup] parent %s child %s\n" ,
99		    parentp -> name , childp -> name );
100	}
101#   endif DEBUG
102    for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
103#	ifdef DEBUG
104	    if ( debug & LOOKUPDEBUG ) {
105		printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
106			arcp -> arc_parentp -> name ,
107			arcp -> arc_childp -> name );
108	    }
109#	endif DEBUG
110	if ( arcp -> arc_childp == childp ) {
111	    return arcp;
112	}
113    }
114    return 0;
115}
116