2 * Copyright (c) 1983 Regents of the University of California.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that: (1) source distributions retain this entire copyright
7 * notice and comment, and (2) distributions including binaries display
8 * the following acknowledgement: ``This product includes software
9 * developed by the University of California, Berkeley and its contributors''
10 * in the documentation or other materials provided with the distribution
11 * and in all advertising materials mentioning features or use of this
12 * software. Neither the name of the University nor the names of its
13 * contributors may be used to endorse or promote products derived
14 * from this software without specific prior written permission.
15 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21 static char sccsid[] = "@(#)vax.c 5.6 (Berkeley) 6/1/90";
27 * a namelist entry to be the child of indirect calls
29 nltype indirectchild = {
30 "(*)" , /* the name */
31 (unsigned long) 0 , /* the pc entry point */
32 (unsigned long) 0 , /* entry point aligned to histogram */
33 (double) 0.0 , /* ticks in this routine */
34 (double) 0.0 , /* cumulative ticks in children */
35 (long) 0 , /* how many times called */
36 (long) 0 , /* how many calls to self */
37 (double) 1.0 , /* propagation fraction */
38 (double) 0.0 , /* self propagation time */
39 (double) 0.0 , /* child propagation time */
40 (bool) 0 , /* print flag */
41 (int) 0 , /* index in the graph list */
42 (int) 0 , /* graph call chain top-sort order */
43 (int) 0 , /* internal number of cycle on */
44 (struct nl *) &indirectchild , /* pointer to head of cycle */
45 (struct nl *) 0 , /* pointer to next member of cycle */
46 (arctype *) 0 , /* list of caller arcs */
47 (arctype *) 0 /* list of callee arcs */
52 struct modebyte *modep;
54 long usesreg = modep -> regfield;
56 switch ( modep -> modefield ) {
71 return ( usesreg != PC ? autoinc : immediate );
73 return ( usesreg != PC ? autoincdef : absolute );
75 return ( usesreg != PC ? bytedisp : byterel );
77 return ( usesreg != PC ? bytedispdef : bytereldef );
79 return ( usesreg != PC ? worddisp : wordrel );
81 return ( usesreg != PC ? worddispdef : wordreldef );
83 return ( usesreg != PC ? longdisp : longrel );
85 return ( usesreg != PC ? longdispdef : longreldef );
103 return "register deferred";
105 return "autodecrement";
107 return "autoincrement";
109 return "autoincrement deferred";
111 return "byte displacement";
113 return "byte displacement deferred";
115 return "byte relative";
117 return "byte relative deferred";
119 return "word displacement";
121 return "word displacement deferred";
123 return "word relative";
125 return "word relative deferred";
131 return "long displacement";
133 return "long displacement deferred";
135 return "long relative";
137 return "long relative deferred";
143 operandlength( modep )
144 struct modebyte *modep;
147 switch ( operandmode( modep ) ) {
173 return 1+operandlength( (struct modebyte *) ((char *) modep) + 1 );
180 struct modebyte *modep;
182 operandenum mode = operandmode( modep );
188 cp += 1; /* skip over the mode */
191 fprintf( stderr , "[reladdr] not relative address\n" );
192 return (unsigned long) modep;
194 return (unsigned long) ( cp + sizeof *cp + *cp );
197 return (unsigned long) ( cp + sizeof *sp + *sp );
200 return (unsigned long) ( cp + sizeof *lp + *lp );
204 findcall( parentp , p_lowpc , p_highpc )
206 unsigned long p_lowpc;
207 unsigned long p_highpc;
209 unsigned char *instructp;
213 operandenum firstmode;
214 unsigned long destpc;
216 if ( textspace == 0 ) {
219 if ( p_lowpc < s_lowpc ) {
222 if ( p_highpc > s_highpc ) {
226 if ( debug & CALLDEBUG ) {
227 printf( "[findcall] %s: 0x%x to 0x%x\n" ,
228 parentp -> name , p_lowpc , p_highpc );
231 for ( instructp = textspace + p_lowpc ;
232 instructp < textspace + p_highpc ;
233 instructp += length ) {
235 if ( *instructp == CALLS ) {
237 * maybe a calls, better check it out.
238 * skip the count of the number of arguments.
241 if ( debug & CALLDEBUG ) {
242 printf( "[findcall]\t0x%x:calls" , instructp - textspace );
245 firstmode = operandmode( (struct modebyte *) (instructp+length) );
246 switch ( firstmode ) {
253 length += operandlength( (struct modebyte *) (instructp+length) );
254 mode = operandmode( (struct modebyte *) ( instructp + length ) );
256 if ( debug & CALLDEBUG ) {
257 printf( "\tfirst operand is %s", operandname( firstmode ) );
258 printf( "\tsecond operand is %s\n" , operandname( mode ) );
270 * indirect call: call through pointer
271 * either *d(r) as a parameter or local
272 * (r) as a return value
273 * *f as a global pointer
274 * [are there others that we miss?,
275 * e.g. arrays of pointers to functions???]
277 addarc( parentp , &indirectchild , (long) 0 );
278 length += operandlength(
279 (struct modebyte *) ( instructp + length ) );
285 * regular pc relative addressing
286 * check that this is the address of
289 destpc = reladdr( (struct modebyte *) (instructp+length) )
290 - (unsigned long) textspace;
291 if ( destpc >= s_lowpc && destpc <= s_highpc ) {
292 childp = nllookup( destpc );
294 if ( debug & CALLDEBUG ) {
295 printf( "[findcall]\tdestpc 0x%x" , destpc );
296 printf( " childp->name %s" , childp -> name );
297 printf( " childp->value 0x%x\n" ,
301 if ( childp -> value == destpc ) {
305 addarc( parentp , childp , (long) 0 );
306 length += operandlength( (struct modebyte *)
307 ( instructp + length ) );
314 * it looked like a calls,
315 * but it wasn't to anywhere.
321 * something funny going on.
324 if ( debug & CALLDEBUG ) {
325 printf( "[findcall]\tbut it's a botch\n" );