1*d27927f7SRuslan Bukin /*-
2*d27927f7SRuslan Bukin * Copyright (c) 2003-2008 Joseph Koshy
3*d27927f7SRuslan Bukin * Copyright (c) 2017 Ruslan Bukin <br@bsdpad.com>
4*d27927f7SRuslan Bukin * All rights reserved.
5*d27927f7SRuslan Bukin *
6*d27927f7SRuslan Bukin * This software was developed by BAE Systems, the University of Cambridge
7*d27927f7SRuslan Bukin * Computer Laboratory, and Memorial University under DARPA/AFRL contract
8*d27927f7SRuslan Bukin * FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent Computing
9*d27927f7SRuslan Bukin * (TC) research program.
10*d27927f7SRuslan Bukin *
11*d27927f7SRuslan Bukin * Redistribution and use in source and binary forms, with or without
12*d27927f7SRuslan Bukin * modification, are permitted provided that the following conditions
13*d27927f7SRuslan Bukin * are met:
14*d27927f7SRuslan Bukin * 1. Redistributions of source code must retain the above copyright
15*d27927f7SRuslan Bukin * notice, this list of conditions and the following disclaimer.
16*d27927f7SRuslan Bukin * 2. Redistributions in binary form must reproduce the above copyright
17*d27927f7SRuslan Bukin * notice, this list of conditions and the following disclaimer in the
18*d27927f7SRuslan Bukin * documentation and/or other materials provided with the distribution.
19*d27927f7SRuslan Bukin *
20*d27927f7SRuslan Bukin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
21*d27927f7SRuslan Bukin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22*d27927f7SRuslan Bukin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23*d27927f7SRuslan Bukin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24*d27927f7SRuslan Bukin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25*d27927f7SRuslan Bukin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26*d27927f7SRuslan Bukin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27*d27927f7SRuslan Bukin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28*d27927f7SRuslan Bukin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29*d27927f7SRuslan Bukin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30*d27927f7SRuslan Bukin * SUCH DAMAGE.
31*d27927f7SRuslan Bukin */
32*d27927f7SRuslan Bukin
33*d27927f7SRuslan Bukin #include <sys/types.h>
34*d27927f7SRuslan Bukin #include <sys/cpuset.h>
35*d27927f7SRuslan Bukin #include <sys/event.h>
36*d27927f7SRuslan Bukin #include <sys/param.h>
37*d27927f7SRuslan Bukin #include <sys/socket.h>
38*d27927f7SRuslan Bukin #include <sys/stat.h>
39*d27927f7SRuslan Bukin #include <sys/module.h>
40*d27927f7SRuslan Bukin #include <sys/pmc.h>
41*d27927f7SRuslan Bukin
42*d27927f7SRuslan Bukin #include <assert.h>
43*d27927f7SRuslan Bukin #include <err.h>
44*d27927f7SRuslan Bukin #include <pmc.h>
45*d27927f7SRuslan Bukin #include <pmclog.h>
46*d27927f7SRuslan Bukin #include <stdbool.h>
47*d27927f7SRuslan Bukin #include <stdio.h>
48*d27927f7SRuslan Bukin #include <stdlib.h>
49*d27927f7SRuslan Bukin #include <string.h>
50*d27927f7SRuslan Bukin
51*d27927f7SRuslan Bukin #include "libpmcstat.h"
52*d27927f7SRuslan Bukin
53*d27927f7SRuslan Bukin struct pmcstat_symbol *
pmcstat_symbol_search_by_name(struct pmcstat_process * pp,const char * pi_name,const char * name,uintptr_t * addr_start,uintptr_t * addr_end)54*d27927f7SRuslan Bukin pmcstat_symbol_search_by_name(struct pmcstat_process *pp,
55*d27927f7SRuslan Bukin const char *pi_name, const char *name, uintptr_t *addr_start,
56*d27927f7SRuslan Bukin uintptr_t *addr_end)
57*d27927f7SRuslan Bukin {
58*d27927f7SRuslan Bukin struct pmcstat_symbol *sym;
59*d27927f7SRuslan Bukin struct pmcstat_image *image;
60*d27927f7SRuslan Bukin struct pmcstat_pcmap *pcm;
61*d27927f7SRuslan Bukin const char *name1;
62*d27927f7SRuslan Bukin const char *name2;
63*d27927f7SRuslan Bukin bool found;
64*d27927f7SRuslan Bukin size_t i;
65*d27927f7SRuslan Bukin
66*d27927f7SRuslan Bukin found = 0;
67*d27927f7SRuslan Bukin
68*d27927f7SRuslan Bukin if (pp == NULL)
69*d27927f7SRuslan Bukin return (NULL);
70*d27927f7SRuslan Bukin
71*d27927f7SRuslan Bukin TAILQ_FOREACH(pcm, &pp->pp_map, ppm_next) {
72*d27927f7SRuslan Bukin image = pcm->ppm_image;
73*d27927f7SRuslan Bukin if (image->pi_name == NULL)
74*d27927f7SRuslan Bukin continue;
75*d27927f7SRuslan Bukin name1 = pmcstat_string_unintern(image->pi_name);
76*d27927f7SRuslan Bukin if (strcmp(name1, pi_name) == 0) {
77*d27927f7SRuslan Bukin found = 1;
78*d27927f7SRuslan Bukin break;
79*d27927f7SRuslan Bukin }
80*d27927f7SRuslan Bukin }
81*d27927f7SRuslan Bukin
82*d27927f7SRuslan Bukin if (!found || image->pi_symbols == NULL)
83*d27927f7SRuslan Bukin return (NULL);
84*d27927f7SRuslan Bukin
85*d27927f7SRuslan Bukin found = 0;
86*d27927f7SRuslan Bukin
87*d27927f7SRuslan Bukin for (i = 0; i < image->pi_symcount; i++) {
88*d27927f7SRuslan Bukin sym = &image->pi_symbols[i];
89*d27927f7SRuslan Bukin name2 = pmcstat_string_unintern(sym->ps_name);
90*d27927f7SRuslan Bukin if (strcmp(name2, name) == 0) {
91*d27927f7SRuslan Bukin found = 1;
92*d27927f7SRuslan Bukin break;
93*d27927f7SRuslan Bukin }
94*d27927f7SRuslan Bukin }
95*d27927f7SRuslan Bukin
96*d27927f7SRuslan Bukin if (!found)
97*d27927f7SRuslan Bukin return (NULL);
98*d27927f7SRuslan Bukin
99*d27927f7SRuslan Bukin *addr_start = (image->pi_vaddr - image->pi_start +
100*d27927f7SRuslan Bukin pcm->ppm_lowpc + sym->ps_start);
101*d27927f7SRuslan Bukin *addr_end = (image->pi_vaddr - image->pi_start +
102*d27927f7SRuslan Bukin pcm->ppm_lowpc + sym->ps_end);
103*d27927f7SRuslan Bukin
104*d27927f7SRuslan Bukin return (sym);
105*d27927f7SRuslan Bukin }
106*d27927f7SRuslan Bukin
107*d27927f7SRuslan Bukin /*
108*d27927f7SRuslan Bukin * Helper function.
109*d27927f7SRuslan Bukin */
110*d27927f7SRuslan Bukin
111*d27927f7SRuslan Bukin int
pmcstat_symbol_compare(const void * a,const void * b)112*d27927f7SRuslan Bukin pmcstat_symbol_compare(const void *a, const void *b)
113*d27927f7SRuslan Bukin {
114*d27927f7SRuslan Bukin const struct pmcstat_symbol *sym1, *sym2;
115*d27927f7SRuslan Bukin
116*d27927f7SRuslan Bukin sym1 = (const struct pmcstat_symbol *) a;
117*d27927f7SRuslan Bukin sym2 = (const struct pmcstat_symbol *) b;
118*d27927f7SRuslan Bukin
119*d27927f7SRuslan Bukin if (sym1->ps_end <= sym2->ps_start)
120*d27927f7SRuslan Bukin return (-1);
121*d27927f7SRuslan Bukin if (sym1->ps_start >= sym2->ps_end)
122*d27927f7SRuslan Bukin return (1);
123*d27927f7SRuslan Bukin return (0);
124*d27927f7SRuslan Bukin }
125*d27927f7SRuslan Bukin
126*d27927f7SRuslan Bukin /*
127*d27927f7SRuslan Bukin * Map an address to a symbol in an image.
128*d27927f7SRuslan Bukin */
129*d27927f7SRuslan Bukin
130*d27927f7SRuslan Bukin struct pmcstat_symbol *
pmcstat_symbol_search(struct pmcstat_image * image,uintfptr_t addr)131*d27927f7SRuslan Bukin pmcstat_symbol_search(struct pmcstat_image *image, uintfptr_t addr)
132*d27927f7SRuslan Bukin {
133*d27927f7SRuslan Bukin struct pmcstat_symbol sym;
134*d27927f7SRuslan Bukin
135*d27927f7SRuslan Bukin if (image->pi_symbols == NULL)
136*d27927f7SRuslan Bukin return (NULL);
137*d27927f7SRuslan Bukin
138*d27927f7SRuslan Bukin sym.ps_name = NULL;
139*d27927f7SRuslan Bukin sym.ps_start = addr;
140*d27927f7SRuslan Bukin sym.ps_end = addr + 1;
141*d27927f7SRuslan Bukin
142*d27927f7SRuslan Bukin return (bsearch((void *) &sym, image->pi_symbols,
143*d27927f7SRuslan Bukin image->pi_symcount, sizeof(struct pmcstat_symbol),
144*d27927f7SRuslan Bukin pmcstat_symbol_compare));
145*d27927f7SRuslan Bukin }
146