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 #if 0 33 #endif 34 35 #include <sys/cdefs.h> 36 #include "gprof.h" 37 38 /* 39 * look up an address in a sorted-by-address namelist 40 * this deals with misses by mapping them to the next lower 41 * entry point. 42 */ 43 nltype * 44 nllookup(unsigned long address) 45 { 46 register long low; 47 register long middle; 48 register long high; 49 # ifdef DEBUG 50 register int probes; 51 52 probes = 0; 53 # endif /* DEBUG */ 54 for ( low = 0 , high = nname - 1 ; low != high ; ) { 55 # ifdef DEBUG 56 probes += 1; 57 # endif /* DEBUG */ 58 middle = ( high + low ) >> 1; 59 if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) { 60 # ifdef DEBUG 61 if ( debug & LOOKUPDEBUG ) { 62 printf( "[nllookup] %d (%d) probes\n" , probes , nname-1 ); 63 } 64 # endif /* DEBUG */ 65 #if defined(__arm__) 66 if (nl[middle].name[0] == '$' && 67 nl[middle-1].value == nl[middle].value) 68 middle--; 69 #endif 70 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 80 if ( debug & LOOKUPDEBUG ) { 81 fprintf( stderr , "[nllookup] (%d) binary search fails\n" , 82 nname-1 ); 83 } 84 # endif /* DEBUG */ 85 return 0; 86 } 87 88 arctype * 89 arclookup(nltype *parentp, nltype *childp) 90 { 91 arctype *arcp; 92 93 if ( parentp == 0 || childp == 0 ) { 94 fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" ); 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 } 102 # endif /* DEBUG */ 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 } 110 # endif /* DEBUG */ 111 if ( arcp -> arc_childp == childp ) { 112 return arcp; 113 } 114 } 115 return 0; 116 } 117