Annotation of src/usr.bin/gprof/lookup.c, Revision 1.6
1.6 ! millert 1: /* $OpenBSD: lookup.c,v 1.5 2002/03/25 16:30:55 danh Exp $ */
1.1 deraadt 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.
1.6 ! millert 16: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 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: #ifndef lint
34: #if 0
35: static char sccsid[] = "@(#)lookup.c 8.1 (Berkeley) 6/6/93";
36: #else
1.6 ! millert 37: static char rcsid[] = "$OpenBSD: lookup.c,v 1.5 2002/03/25 16:30:55 danh Exp $";
1.1 deraadt 38: #endif
39: #endif /* not lint */
40:
41: #include "gprof.h"
42:
43: /*
44: * look up an address in a sorted-by-address namelist
45: * this deals with misses by mapping them to the next lower
46: * entry point.
47: */
48: nltype *
49: nllookup( address )
50: unsigned long address;
51: {
1.4 mpech 52: long low;
53: long middle;
54: long high;
1.1 deraadt 55: # ifdef DEBUG
1.4 mpech 56: int probes;
1.1 deraadt 57:
58: probes = 0;
1.5 danh 59: # endif /* DEBUG */
1.1 deraadt 60: for ( low = 0 , high = nname - 1 ; low != high ; ) {
61: # ifdef DEBUG
62: probes += 1;
1.5 danh 63: # endif /* DEBUG */
1.1 deraadt 64: middle = ( high + low ) >> 1;
65: if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
66: # ifdef DEBUG
67: if ( debug & LOOKUPDEBUG ) {
68: printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 );
69: }
1.5 danh 70: # endif /* DEBUG */
1.1 deraadt 71: return &nl[ middle ];
72: }
73: if ( nl[ middle ].value > address ) {
74: high = middle;
75: } else {
76: low = middle + 1;
77: }
78: }
79: # ifdef DEBUG
1.3 mickey 80: if ( debug & LOOKUPDEBUG )
81: warnx("[nllookup] (%d) binary search fails", nname - 1);
1.5 danh 82: # endif /* DEBUG */
1.1 deraadt 83: return 0;
84: }
85:
86: arctype *
87: arclookup( parentp , childp )
88: nltype *parentp;
89: nltype *childp;
90: {
91: arctype *arcp;
92:
93: if ( parentp == 0 || childp == 0 ) {
1.3 mickey 94: warnx("[arclookup] parentp == 0 || childp == 0");
1.1 deraadt 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: }
1.5 danh 102: # endif /* DEBUG */
1.1 deraadt 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: }
1.5 danh 110: # endif /* DEBUG */
1.1 deraadt 111: if ( arcp -> arc_childp == childp ) {
112: return arcp;
113: }
114: }
115: return 0;
116: }