lookup.c revision 235975 
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 235975 2012-05-25 06:48:42Z gber $");
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#if defined(__arm__)
70	if (nl[middle].name[0] == '$' &&
71	    nl[middle-1].value == nl[middle].value)
72		middle--;
73#endif
74
75	    return &nl[ middle ];
76	}
77	if ( nl[ middle ].value > address ) {
78	    high = middle;
79	} else {
80	    low = middle + 1;
81	}
82    }
83#   ifdef DEBUG
84	if ( debug & LOOKUPDEBUG ) {
85	    fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
86		nname-1 );
87	}
88#   endif /* DEBUG */
89    return 0;
90}
91
92arctype *
93arclookup( parentp , childp )
94    nltype	*parentp;
95    nltype	*childp;
96{
97    arctype	*arcp;
98
99    if ( parentp == 0 || childp == 0 ) {
100	fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
101	return 0;
102    }
103#   ifdef DEBUG
104	if ( debug & LOOKUPDEBUG ) {
105	    printf( "[arclookup] parent %s child %s\n" ,
106		    parentp -> name , childp -> name );
107	}
108#   endif /* DEBUG */
109    for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
110#	ifdef DEBUG
111	    if ( debug & LOOKUPDEBUG ) {
112		printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
113			arcp -> arc_parentp -> name ,
114			arcp -> arc_childp -> name );
115	    }
116#	endif /* DEBUG */
117	if ( arcp -> arc_childp == childp ) {
118	    return arcp;
119	}
120    }
121    return 0;
122}
123