xref: /illumos-gate/usr/src/cmd/sgs/gprof/common/lookup.c (revision 7c478bd95313f5f23a4c958a745db2134aa03244)
1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate  * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate  *
4*7c478bd9Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate  * with the License.
8*7c478bd9Sstevel@tonic-gate  *
9*7c478bd9Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate  * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate  *
14*7c478bd9Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate  *
20*7c478bd9Sstevel@tonic-gate  * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate  */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate  * Copyright (c) 1990-1998,2001 by Sun Microsystems, Inc.
24*7c478bd9Sstevel@tonic-gate  * All rights reserved.
25*7c478bd9Sstevel@tonic-gate  */
26*7c478bd9Sstevel@tonic-gate 
27*7c478bd9Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
28*7c478bd9Sstevel@tonic-gate 
29*7c478bd9Sstevel@tonic-gate #include "gprof.h"
30*7c478bd9Sstevel@tonic-gate 
31*7c478bd9Sstevel@tonic-gate /*
32*7c478bd9Sstevel@tonic-gate  * look up an address in a sorted-by-address namelist
33*7c478bd9Sstevel@tonic-gate  * this deals with misses by mapping them to the next lower
34*7c478bd9Sstevel@tonic-gate  * entry point.
35*7c478bd9Sstevel@tonic-gate  */
36*7c478bd9Sstevel@tonic-gate static   int	searchmsg = 0; /* Emit the diagnostic only once */
37*7c478bd9Sstevel@tonic-gate 
38*7c478bd9Sstevel@tonic-gate nltype *
39*7c478bd9Sstevel@tonic-gate nllookup(mod_info_t *module, pctype address, pctype *nxtsym)
40*7c478bd9Sstevel@tonic-gate {
41*7c478bd9Sstevel@tonic-gate 	size_t	low = 0, middle, high = module->nname - 1;
42*7c478bd9Sstevel@tonic-gate 	pctype	keyval;
43*7c478bd9Sstevel@tonic-gate 	nltype	*mnl = module->nl;
44*7c478bd9Sstevel@tonic-gate 
45*7c478bd9Sstevel@tonic-gate 	/*
46*7c478bd9Sstevel@tonic-gate 	 * If this is the program executable in which we are looking up
47*7c478bd9Sstevel@tonic-gate 	 * a symbol, then the actual load address will be the same as the
48*7c478bd9Sstevel@tonic-gate 	 * address specified in the ELF file. For shared objects, the
49*7c478bd9Sstevel@tonic-gate 	 * load address may differ from what is specified in the file. In
50*7c478bd9Sstevel@tonic-gate 	 * this case, we may need to look for a different value altogether.
51*7c478bd9Sstevel@tonic-gate 	 */
52*7c478bd9Sstevel@tonic-gate 	keyval = module->txt_origin + (address - module->load_base);
53*7c478bd9Sstevel@tonic-gate 
54*7c478bd9Sstevel@tonic-gate 	if (keyval < mnl[low].value) {
55*7c478bd9Sstevel@tonic-gate 		if (nxtsym) {
56*7c478bd9Sstevel@tonic-gate 			*nxtsym = module->load_base +
57*7c478bd9Sstevel@tonic-gate 					(mnl[low].value - module->txt_origin);
58*7c478bd9Sstevel@tonic-gate 		}
59*7c478bd9Sstevel@tonic-gate 		return (NULL);
60*7c478bd9Sstevel@tonic-gate 	}
61*7c478bd9Sstevel@tonic-gate 
62*7c478bd9Sstevel@tonic-gate 	if (keyval >= mnl[high].value) {
63*7c478bd9Sstevel@tonic-gate 		if (nxtsym)
64*7c478bd9Sstevel@tonic-gate 			*nxtsym = module->load_end;
65*7c478bd9Sstevel@tonic-gate 		return (&mnl[high]);
66*7c478bd9Sstevel@tonic-gate 	}
67*7c478bd9Sstevel@tonic-gate 
68*7c478bd9Sstevel@tonic-gate 	while (low != high) {
69*7c478bd9Sstevel@tonic-gate 		middle = (high + low) >> 1;
70*7c478bd9Sstevel@tonic-gate 
71*7c478bd9Sstevel@tonic-gate 		if (mnl[middle].value <= keyval &&
72*7c478bd9Sstevel@tonic-gate 					    mnl[middle + 1].value > keyval) {
73*7c478bd9Sstevel@tonic-gate 			if (nxtsym) {
74*7c478bd9Sstevel@tonic-gate 				*nxtsym = module->load_base +
75*7c478bd9Sstevel@tonic-gate 						    (mnl[middle + 1].value -
76*7c478bd9Sstevel@tonic-gate 						    module->txt_origin);
77*7c478bd9Sstevel@tonic-gate 			}
78*7c478bd9Sstevel@tonic-gate 			return (&mnl[middle]);
79*7c478bd9Sstevel@tonic-gate 		}
80*7c478bd9Sstevel@tonic-gate 
81*7c478bd9Sstevel@tonic-gate 		if (mnl[middle].value > keyval) {
82*7c478bd9Sstevel@tonic-gate 			high = middle;
83*7c478bd9Sstevel@tonic-gate 		} else {
84*7c478bd9Sstevel@tonic-gate 			low = middle + 1;
85*7c478bd9Sstevel@tonic-gate 		}
86*7c478bd9Sstevel@tonic-gate 	}
87*7c478bd9Sstevel@tonic-gate 
88*7c478bd9Sstevel@tonic-gate 	if (searchmsg++ == 0)
89*7c478bd9Sstevel@tonic-gate 		fprintf(stderr, "[nllookup] binary search fails???\n");
90*7c478bd9Sstevel@tonic-gate 
91*7c478bd9Sstevel@tonic-gate 	/* must never reach here! */
92*7c478bd9Sstevel@tonic-gate 	return (0);
93*7c478bd9Sstevel@tonic-gate }
94*7c478bd9Sstevel@tonic-gate 
95*7c478bd9Sstevel@tonic-gate arctype *
96*7c478bd9Sstevel@tonic-gate arclookup(nltype *parentp, nltype *childp)
97*7c478bd9Sstevel@tonic-gate {
98*7c478bd9Sstevel@tonic-gate 	arctype	*arcp;
99*7c478bd9Sstevel@tonic-gate 
100*7c478bd9Sstevel@tonic-gate 	if (parentp == 0 || childp == 0) {
101*7c478bd9Sstevel@tonic-gate 		fprintf(stderr, "[arclookup] parentp == 0 || childp == 0\n");
102*7c478bd9Sstevel@tonic-gate 		return (0);
103*7c478bd9Sstevel@tonic-gate 	}
104*7c478bd9Sstevel@tonic-gate #ifdef DEBUG
105*7c478bd9Sstevel@tonic-gate 	if (debug & LOOKUPDEBUG) {
106*7c478bd9Sstevel@tonic-gate 		printf("[arclookup] parent %s child %s\n",
107*7c478bd9Sstevel@tonic-gate 		    parentp->name, childp->name);
108*7c478bd9Sstevel@tonic-gate 	}
109*7c478bd9Sstevel@tonic-gate #endif /* DEBUG */
110*7c478bd9Sstevel@tonic-gate 
111*7c478bd9Sstevel@tonic-gate 	for (arcp = parentp->children; arcp; arcp = arcp->arc_childlist) {
112*7c478bd9Sstevel@tonic-gate #ifdef DEBUG
113*7c478bd9Sstevel@tonic-gate 		if (debug & LOOKUPDEBUG) {
114*7c478bd9Sstevel@tonic-gate 			printf("[arclookup]\t arc_parent %s arc_child %s\n",
115*7c478bd9Sstevel@tonic-gate 			    arcp->arc_parentp->name,
116*7c478bd9Sstevel@tonic-gate 			    arcp->arc_childp->name);
117*7c478bd9Sstevel@tonic-gate 		}
118*7c478bd9Sstevel@tonic-gate #endif /* DEBUG */
119*7c478bd9Sstevel@tonic-gate 		if (arcp->arc_childp == childp) {
120*7c478bd9Sstevel@tonic-gate 			return (arcp);
121*7c478bd9Sstevel@tonic-gate 		}
122*7c478bd9Sstevel@tonic-gate 	}
123*7c478bd9Sstevel@tonic-gate 	return (0);
124*7c478bd9Sstevel@tonic-gate }
125