1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate * CDDL HEADER START
3*0Sstevel@tonic-gate *
4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*0Sstevel@tonic-gate * with the License.
8*0Sstevel@tonic-gate *
9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate * and limitations under the License.
13*0Sstevel@tonic-gate *
14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate *
20*0Sstevel@tonic-gate * CDDL HEADER END
21*0Sstevel@tonic-gate */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate * Copyright (c) 1998 by Sun Microsystems, Inc.
24*0Sstevel@tonic-gate * All rights reserved.
25*0Sstevel@tonic-gate */
26*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI"
27*0Sstevel@tonic-gate
28*0Sstevel@tonic-gate /*
29*0Sstevel@tonic-gate * Search routines for processing new-style mon.out files.
30*0Sstevel@tonic-gate */
31*0Sstevel@tonic-gate
32*0Sstevel@tonic-gate #include "profv.h"
33*0Sstevel@tonic-gate
34*0Sstevel@tonic-gate /*
35*0Sstevel@tonic-gate * Look up an address in a sorted-by-address namelist; this deals with
36*0Sstevel@tonic-gate * misses by mapping them to the next lower entry point.
37*0Sstevel@tonic-gate */
38*0Sstevel@tonic-gate nltype *
nllookup(mod_info_t * module,Address address,Address * nxtsym_val)39*0Sstevel@tonic-gate nllookup(mod_info_t *module, Address address, Address *nxtsym_val)
40*0Sstevel@tonic-gate {
41*0Sstevel@tonic-gate size_t low = 0, middle, high = module->nfuncs - 1;
42*0Sstevel@tonic-gate nltype *nl = module->nl;
43*0Sstevel@tonic-gate Address keyval;
44*0Sstevel@tonic-gate
45*0Sstevel@tonic-gate /*
46*0Sstevel@tonic-gate * If this is the program executable in which we are looking up
47*0Sstevel@tonic-gate * a symbol, then the actual load address will be the same as the
48*0Sstevel@tonic-gate * address specified in the ELF file. For shared objects, the
49*0Sstevel@tonic-gate * load address may differ from what is specified in the file. In
50*0Sstevel@tonic-gate * this case, we may need to look for a different value altogether.
51*0Sstevel@tonic-gate */
52*0Sstevel@tonic-gate keyval = module->txt_origin + (address - module->load_base);
53*0Sstevel@tonic-gate
54*0Sstevel@tonic-gate if (keyval < nl[low].value) {
55*0Sstevel@tonic-gate if (nxtsym_val) {
56*0Sstevel@tonic-gate *nxtsym_val = module->load_base +
57*0Sstevel@tonic-gate (nl[low].value - module->txt_origin);
58*0Sstevel@tonic-gate }
59*0Sstevel@tonic-gate return (NULL);
60*0Sstevel@tonic-gate }
61*0Sstevel@tonic-gate
62*0Sstevel@tonic-gate if (keyval >= nl[high].value) {
63*0Sstevel@tonic-gate if (nxtsym_val)
64*0Sstevel@tonic-gate *nxtsym_val = module->load_end;
65*0Sstevel@tonic-gate return (&nl[high]);
66*0Sstevel@tonic-gate }
67*0Sstevel@tonic-gate
68*0Sstevel@tonic-gate while (low != high) {
69*0Sstevel@tonic-gate middle = (high + low) >> 1;
70*0Sstevel@tonic-gate
71*0Sstevel@tonic-gate if ((nl[middle].value <= keyval) &&
72*0Sstevel@tonic-gate (nl[middle + 1].value > keyval)) {
73*0Sstevel@tonic-gate if (nxtsym_val) {
74*0Sstevel@tonic-gate *nxtsym_val = module->load_base +
75*0Sstevel@tonic-gate (nl[middle + 1].value - module->txt_origin);
76*0Sstevel@tonic-gate }
77*0Sstevel@tonic-gate
78*0Sstevel@tonic-gate return (&nl[middle]);
79*0Sstevel@tonic-gate }
80*0Sstevel@tonic-gate
81*0Sstevel@tonic-gate if (nl[middle].value > keyval)
82*0Sstevel@tonic-gate high = middle;
83*0Sstevel@tonic-gate else
84*0Sstevel@tonic-gate low = middle + 1;
85*0Sstevel@tonic-gate }
86*0Sstevel@tonic-gate
87*0Sstevel@tonic-gate /* must never reach here! */
88*0Sstevel@tonic-gate return (NULL);
89*0Sstevel@tonic-gate }
90*0Sstevel@tonic-gate
91*0Sstevel@tonic-gate /*
92*0Sstevel@tonic-gate * Look up a module's base address in a sorted list of pc-hits. Unlike
93*0Sstevel@tonic-gate * nllookup(), this deals with misses by mapping them to the next *higher*
94*0Sstevel@tonic-gate * pc-hit. This is so that we get into the module's first pc-hit rightaway,
95*0Sstevel@tonic-gate * even if the module's entry-point (load_base) itself is not a hit.
96*0Sstevel@tonic-gate */
97*0Sstevel@tonic-gate Address *
locate(Address * pclist,size_t nelem,Address keypc)98*0Sstevel@tonic-gate locate(Address *pclist, size_t nelem, Address keypc)
99*0Sstevel@tonic-gate {
100*0Sstevel@tonic-gate size_t low = 0, middle, high = nelem - 1;
101*0Sstevel@tonic-gate
102*0Sstevel@tonic-gate if (keypc <= pclist[low])
103*0Sstevel@tonic-gate return (pclist);
104*0Sstevel@tonic-gate
105*0Sstevel@tonic-gate if (keypc > pclist[high])
106*0Sstevel@tonic-gate return (NULL);
107*0Sstevel@tonic-gate
108*0Sstevel@tonic-gate while (low != high) {
109*0Sstevel@tonic-gate middle = (high + low) >> 1;
110*0Sstevel@tonic-gate
111*0Sstevel@tonic-gate if ((pclist[middle] < keypc) && (pclist[middle + 1] >= keypc))
112*0Sstevel@tonic-gate return (&pclist[middle + 1]);
113*0Sstevel@tonic-gate
114*0Sstevel@tonic-gate if (pclist[middle] >= keypc)
115*0Sstevel@tonic-gate high = middle;
116*0Sstevel@tonic-gate else
117*0Sstevel@tonic-gate low = middle + 1;
118*0Sstevel@tonic-gate }
119*0Sstevel@tonic-gate
120*0Sstevel@tonic-gate /* must never reach here! */
121*0Sstevel@tonic-gate return (NULL);
122*0Sstevel@tonic-gate }
123