2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)vax.c 8.1 (Berkeley) 6/6/93
35 * $DragonFly: src/usr.bin/gprof/Attic/vax.c,v 1.3 2003/10/04 20:36:45 hmp Exp $
41 * a namelist entry to be the child of indirect calls
43 nltype indirectchild
= {
44 "(*)" , /* the name */
45 (unsigned long) 0 , /* the pc entry point */
46 (unsigned long) 0 , /* entry point aligned to histogram */
47 (double) 0.0 , /* ticks in this routine */
48 (double) 0.0 , /* cumulative ticks in children */
49 (long) 0 , /* how many times called */
50 (long) 0 , /* how many calls to self */
51 (double) 1.0 , /* propagation fraction */
52 (double) 0.0 , /* self propagation time */
53 (double) 0.0 , /* child propagation time */
54 (bool) 0 , /* print flag */
55 (int) 0 , /* index in the graph list */
56 (int) 0 , /* graph call chain top-sort order */
57 (int) 0 , /* internal number of cycle on */
58 (struct nl
*) &indirectchild
, /* pointer to head of cycle */
59 (struct nl
*) 0 , /* pointer to next member of cycle */
60 (arctype
*) 0 , /* list of caller arcs */
61 (arctype
*) 0 /* list of callee arcs */
65 operandmode(struct modebyte
*modep
)
67 long usesreg
= modep
-> regfield
;
69 switch ( modep
-> modefield
) {
84 return ( usesreg
!= PC
? autoinc
: immediate
);
86 return ( usesreg
!= PC
? autoincdef
: absolute
);
88 return ( usesreg
!= PC
? bytedisp
: byterel
);
90 return ( usesreg
!= PC
? bytedispdef
: bytereldef
);
92 return ( usesreg
!= PC
? worddisp
: wordrel
);
94 return ( usesreg
!= PC
? worddispdef
: wordreldef
);
96 return ( usesreg
!= PC
? longdisp
: longrel
);
98 return ( usesreg
!= PC
? longdispdef
: longreldef
);
104 operandname(operandname mode
)
115 return "register deferred";
117 return "autodecrement";
119 return "autoincrement";
121 return "autoincrement deferred";
123 return "byte displacement";
125 return "byte displacement deferred";
127 return "byte relative";
129 return "byte relative deferred";
131 return "word displacement";
133 return "word displacement deferred";
135 return "word relative";
137 return "word relative deferred";
143 return "long displacement";
145 return "long displacement deferred";
147 return "long relative";
149 return "long relative deferred";
155 operandlength(struct modebyte
*modep
)
158 switch ( operandmode( modep
) ) {
184 return 1+operandlength( (struct modebyte
*) ((char *) modep
) + 1 );
190 reladdr(struct modebyte
*modep
)
192 operandenum mode
= operandmode( modep
);
198 cp
+= 1; /* skip over the mode */
201 fprintf( stderr
, "[reladdr] not relative address\n" );
202 return (unsigned long) modep
;
204 return (unsigned long) ( cp
+ sizeof *cp
+ *cp
);
207 return (unsigned long) ( cp
+ sizeof *sp
+ *sp
);
210 return (unsigned long) ( cp
+ sizeof *lp
+ *lp
);
214 findcall(nltype
*parentp
, unsigned long p_lowpc
, unsigned long p_highpc
)
216 unsigned char *instructp
;
220 operandenum firstmode
;
221 unsigned long destpc
;
223 if ( textspace
== 0 ) {
226 if ( p_lowpc
< s_lowpc
) {
229 if ( p_highpc
> s_highpc
) {
233 if ( debug
& CALLDEBUG
) {
234 printf( "[findcall] %s: 0x%x to 0x%x\n" ,
235 parentp
-> name
, p_lowpc
, p_highpc
);
238 for ( instructp
= textspace
+ p_lowpc
;
239 instructp
< textspace
+ p_highpc
;
240 instructp
+= length
) {
242 if ( *instructp
== CALLS
) {
244 * maybe a calls, better check it out.
245 * skip the count of the number of arguments.
248 if ( debug
& CALLDEBUG
) {
249 printf( "[findcall]\t0x%x:calls" , instructp
- textspace
);
252 firstmode
= operandmode( (struct modebyte
*) (instructp
+length
) );
253 switch ( firstmode
) {
260 length
+= operandlength( (struct modebyte
*) (instructp
+length
) );
261 mode
= operandmode( (struct modebyte
*) ( instructp
+ length
) );
263 if ( debug
& CALLDEBUG
) {
264 printf( "\tfirst operand is %s", operandname( firstmode
) );
265 printf( "\tsecond operand is %s\n" , operandname( mode
) );
277 * indirect call: call through pointer
278 * either *d(r) as a parameter or local
279 * (r) as a return value
280 * *f as a global pointer
281 * [are there others that we miss?,
282 * e.g. arrays of pointers to functions???]
284 addarc( parentp
, &indirectchild
, (long) 0 );
285 length
+= operandlength(
286 (struct modebyte
*) ( instructp
+ length
) );
292 * regular pc relative addressing
293 * check that this is the address of
296 destpc
= reladdr( (struct modebyte
*) (instructp
+length
) )
297 - (unsigned long) textspace
;
298 if ( destpc
>= s_lowpc
&& destpc
<= s_highpc
) {
299 childp
= nllookup( destpc
);
301 if ( debug
& CALLDEBUG
) {
302 printf( "[findcall]\tdestpc 0x%x" , destpc
);
303 printf( " childp->name %s" , childp
-> name
);
304 printf( " childp->value 0x%x\n" ,
308 if ( childp
-> value
== destpc
) {
312 addarc( parentp
, childp
, (long) 0 );
313 length
+= operandlength( (struct modebyte
*)
314 ( instructp
+ length
) );
321 * it looked like a calls,
322 * but it wasn't to anywhere.
328 * something funny going on.
331 if ( debug
& CALLDEBUG
) {
332 printf( "[findcall]\tbut it's a botch\n" );