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$");
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(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#if defined(__arm__)
69	if (nl[middle].name[0] == '$' &&
70	    nl[middle-1].value == nl[middle].value)
71		middle--;
72#endif
73
74	    return &nl[ middle ];
75	}
76	if ( nl[ middle ].value > address ) {
77	    high = middle;
78	} else {
79	    low = middle + 1;
80	}
81    }
82#   ifdef DEBUG
83	if ( debug & LOOKUPDEBUG ) {
84	    fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
85		nname-1 );
86	}
87#   endif /* DEBUG */
88    return 0;
89}
90
91arctype *
92arclookup(nltype *parentp, 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