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 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)lookup.c 8.1 (Berkeley) 6/6/93"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD$"; 40 #endif /* not lint */ 41 #include <sys/cdefs.h> 42 __FBSDID("$FreeBSD$"); 43 44 #include "gprof.h" 45 46 /* 47 * look up an address in a sorted-by-address namelist 48 * this deals with misses by mapping them to the next lower 49 * entry point. 50 */ 51 nltype * 52 nllookup( address ) 53 unsigned long address; 54 { 55 register long low; 56 register long middle; 57 register long high; 58 # ifdef DEBUG 59 register int probes; 60 61 probes = 0; 62 # endif /* DEBUG */ 63 for ( low = 0 , high = nname - 1 ; low != high ; ) { 64 # ifdef DEBUG 65 probes += 1; 66 # endif /* DEBUG */ 67 middle = ( high + low ) >> 1; 68 if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) { 69 # ifdef DEBUG 70 if ( debug & LOOKUPDEBUG ) { 71 printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 ); 72 } 73 # endif /* DEBUG */ 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 91 arctype * 92 arclookup( parentp , childp ) 93 nltype *parentp; 94 nltype *childp; 95 { 96 arctype *arcp; 97 98 if ( parentp == 0 || childp == 0 ) { 99 fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" ); 100 return 0; 101 } 102 # ifdef DEBUG 103 if ( debug & LOOKUPDEBUG ) { 104 printf( "[arclookup] parent %s child %s\n" , 105 parentp -> name , childp -> name ); 106 } 107 # endif /* DEBUG */ 108 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) { 109 # ifdef DEBUG 110 if ( debug & LOOKUPDEBUG ) { 111 printf( "[arclookup]\t arc_parent %s arc_child %s\n" , 112 arcp -> arc_parentp -> name , 113 arcp -> arc_childp -> name ); 114 } 115 # endif /* DEBUG */ 116 if ( arcp -> arc_childp == childp ) { 117 return arcp; 118 } 119 } 120 return 0; 121 } 122