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