lookup.c revision 97631 
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
35#if 0
36static char sccsid[] = "@(#)lookup.c	8.1 (Berkeley) 6/6/93";
37#endif
38static const char rcsid[] =
39  "$FreeBSD: head/usr.bin/gprof/lookup.c 97631 2002-05-30 21:18:01Z wollman $";
40#endif /* not lint */
41
42#include "gprof.h"
43
44    /*
45     *	look up an address in a sorted-by-address namelist
46     *	    this deals with misses by mapping them to the next lower
47     *	    entry point.
48     */
49nltype *
50nllookup( address )
51    unsigned long	address;
52{
53    register long	low;
54    register long	middle;
55    register long	high;
56#   ifdef DEBUG
57	register int	probes;
58
59	probes = 0;
60#   endif /* DEBUG */
61    for ( low = 0 , high = nname - 1 ; low != high ; ) {
62#	ifdef DEBUG
63	    probes += 1;
64#	endif /* DEBUG */
65	middle = ( high + low ) >> 1;
66	if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
67#	    ifdef DEBUG
68		if ( debug & LOOKUPDEBUG ) {
69		    printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
70		}
71#	    endif /* DEBUG */
72	    return &nl[ middle ];
73	}
74	if ( nl[ middle ].value > address ) {
75	    high = middle;
76	} else {
77	    low = middle + 1;
78	}
79    }
80#   ifdef DEBUG
81	if ( debug & LOOKUPDEBUG ) {
82	    fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
83		nname-1 );
84	}
85#   endif /* DEBUG */
86    return 0;
87}
88
89arctype *
90arclookup( parentp , childp )
91    nltype	*parentp;
92    nltype	*childp;
93{
94    arctype	*arcp;
95
96    if ( parentp == 0 || childp == 0 ) {
97	fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
98	return 0;
99    }
100#   ifdef DEBUG
101	if ( debug & LOOKUPDEBUG ) {
102	    printf( "[arclookup] parent %s child %s\n" ,
103		    parentp -> name , childp -> name );
104	}
105#   endif /* DEBUG */
106    for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
107#	ifdef DEBUG
108	    if ( debug & LOOKUPDEBUG ) {
109		printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
110			arcp -> arc_parentp -> name ,
111			arcp -> arc_childp -> name );
112	    }
113#	endif /* DEBUG */
114	if ( arcp -> arc_childp == childp ) {
115	    return arcp;
116	}
117    }
118    return 0;
119}
120