1 /* $OpenBSD: lookup.c,v 1.8 2009/10/27 23:59:38 deraadt Exp $ */
2 /* $NetBSD: lookup.c,v 1.5 1995/04/19 07:16:06 cgd Exp $ */
3
4 /*
5 * Copyright (c) 1983, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
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 */
40 nltype *
nllookup(unsigned long address)41 nllookup(unsigned long address)
42 {
43 long low;
44 long middle;
45 long high;
46 # ifdef DEBUG
47 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 return &nl[ middle ];
63 }
64 if ( nl[ middle ].value > address ) {
65 high = middle;
66 } else {
67 low = middle + 1;
68 }
69 }
70 # ifdef DEBUG
71 if ( debug & LOOKUPDEBUG )
72 warnx("[nllookup] (%d) binary search fails", nname - 1);
73 # endif /* DEBUG */
74 return 0;
75 }
76
77 arctype *
arclookup(nltype * parentp,nltype * childp)78 arclookup(nltype *parentp, nltype *childp)
79 {
80 arctype *arcp;
81
82 if ( parentp == 0 || childp == 0 ) {
83 warnx("[arclookup] parentp == 0 || childp == 0");
84 return 0;
85 }
86 # ifdef DEBUG
87 if ( debug & LOOKUPDEBUG ) {
88 printf( "[arclookup] parent %s child %s\n" ,
89 parentp -> name , childp -> name );
90 }
91 # endif /* DEBUG */
92 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
93 # ifdef DEBUG
94 if ( debug & LOOKUPDEBUG ) {
95 printf( "[arclookup]\t arc_parent %s arc_child %s\n" ,
96 arcp -> arc_parentp -> name ,
97 arcp -> arc_childp -> name );
98 }
99 # endif /* DEBUG */
100 if ( arcp -> arc_childp == childp ) {
101 return arcp;
102 }
103 }
104 return 0;
105 }
106