1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1983, 1993
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 *    may be used to endorse or promote products derived from this software
17 *    without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32#include <sys/cdefs.h>
33#include "gprof.h"
34
35    /*
36     *	look up an address in a sorted-by-address namelist
37     *	    this deals with misses by mapping them to the next lower
38     *	    entry point.
39     */
40nltype *
41nllookup(unsigned long address)
42{
43    register long	low;
44    register long	middle;
45    register long	high;
46#   ifdef DEBUG
47	register int	probes;
48
49	probes = 0;
50#   endif /* DEBUG */
51    for ( low = 0 , high = nname - 1 ; low != high ; ) {
52#	ifdef DEBUG
53	    probes += 1;
54#	endif /* DEBUG */
55	middle = ( high + low ) >> 1;
56	if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
57#	    ifdef DEBUG
58		if ( debug & LOOKUPDEBUG ) {
59		    printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
60		}
61#	    endif /* DEBUG */
62#if defined(__arm__)
63	if (nl[middle].name[0] == '$' &&
64	    nl[middle-1].value == nl[middle].value)
65		middle--;
66#endif
67
68	    return &nl[ middle ];
69	}
70	if ( nl[ middle ].value > address ) {
71	    high = middle;
72	} else {
73	    low = middle + 1;
74	}
75    }
76#   ifdef DEBUG
77	if ( debug & LOOKUPDEBUG ) {
78	    fprintf( stderr , "[nllookup] (%d) binary search fails\n" ,
79		nname-1 );
80	}
81#   endif /* DEBUG */
82    return 0;
83}
84
85arctype *
86arclookup(nltype *parentp, nltype *childp)
87{
88    arctype	*arcp;
89
90    if ( parentp == 0 || childp == 0 ) {
91	fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
92	return 0;
93    }
94#   ifdef DEBUG
95	if ( debug & LOOKUPDEBUG ) {
96	    printf( "[arclookup] parent %s child %s\n" ,
97		    parentp -> name , childp -> name );
98	}
99#   endif /* DEBUG */
100    for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
101#	ifdef DEBUG
102	    if ( debug & LOOKUPDEBUG ) {
103		printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
104			arcp -> arc_parentp -> name ,
105			arcp -> arc_childp -> name );
106	    }
107#	endif /* DEBUG */
108	if ( arcp -> arc_childp == childp ) {
109	    return arcp;
110	}
111    }
112    return 0;
113}
114