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