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 * @(#)tahoe.c 8.1 (Berkeley) 6/6/93
39 * a namelist entry to be the child of indirect callf
41 nltype indirectchild = {
42 "(*)" , /* the name */
43 (unsigned long) 0 , /* the pc entry point */
44 (unsigned long) 0 , /* entry point aligned to histogram */
45 (double) 0.0 , /* ticks in this routine */
46 (double) 0.0 , /* cumulative ticks in children */
47 (long) 0 , /* how many times called */
48 (long) 0 , /* how many calls to self */
49 (double) 1.0 , /* propagation fraction */
50 (double) 0.0 , /* self propagation time */
51 (double) 0.0 , /* child propagation time */
52 (bool) 0 , /* print flag */
53 (int) 0 , /* index in the graph list */
54 (int) 0 , /* graph call chain top-sort order */
55 (int) 0 , /* internal number of cycle on */
56 (struct nl *) &indirectchild , /* pointer to head of cycle */
57 (struct nl *) 0 , /* pointer to next member of cycle */
58 (arctype *) 0 , /* list of caller arcs */
59 (arctype *) 0 /* list of callee arcs */
66 long usesreg = ((long)*modep) & 0xf;
68 switch ( ((long)*modep) >> 4 ) {
83 return ( usesreg != 0xe ? autoinc : immediate );
85 return ( usesreg != PC ? autoincdef : absolute );
87 return ( usesreg != PC ? bytedisp : byterel );
89 return ( usesreg != PC ? bytedispdef : bytereldef );
91 return ( usesreg != PC ? worddisp : wordrel );
93 return ( usesreg != PC ? worddispdef : wordreldef );
95 return ( usesreg != PC ? longdisp : longrel );
97 return ( usesreg != PC ? longdispdef : longreldef );
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( modep )
156 unsigned char *modep;
159 switch ( operandmode( modep ) ) {
185 return 1+operandlength( modep + 1 );
194 operandenum mode = operandmode( modep );
202 cp += 1; /* skip over the mode */
205 fprintf( stderr , "[reladdr] not relative address\n" );
206 return (unsigned long) modep;
208 return (unsigned long) ( cp + sizeof *cp + *cp );
210 for (i = 0; i < sizeof *sp; i++)
211 value = (value << 8) + (cp[i] & 0xff);
212 return (unsigned long) ( cp + sizeof *sp + value );
214 for (i = 0; i < sizeof *lp; i++)
215 value = (value << 8) + (cp[i] & 0xff);
216 return (unsigned long) ( cp + sizeof *lp + value );
220 findcall( parentp , p_lowpc , p_highpc )
222 unsigned long p_lowpc;
223 unsigned long p_highpc;
225 unsigned char *instructp;
229 operandenum firstmode;
230 unsigned long destpc;
232 if ( textspace == 0 ) {
235 if ( p_lowpc < s_lowpc ) {
238 if ( p_highpc > s_highpc ) {
242 if ( debug & CALLDEBUG ) {
243 printf( "[findcall] %s: 0x%x to 0x%x\n" ,
244 parentp -> name , p_lowpc , p_highpc );
247 for ( instructp = textspace + p_lowpc ;
248 instructp < textspace + p_highpc ;
249 instructp += length ) {
251 if ( *instructp == CALLF ) {
253 * maybe a callf, better check it out.
254 * skip the count of the number of arguments.
257 if ( debug & CALLDEBUG ) {
258 printf( "[findcall]\t0x%x:callf" , instructp - textspace );
261 firstmode = operandmode( instructp+length );
262 switch ( firstmode ) {
269 length += operandlength( instructp+length );
270 mode = operandmode( instructp + length );
272 if ( debug & CALLDEBUG ) {
273 printf( "\tfirst operand is %s", operandname( firstmode ) );
274 printf( "\tsecond operand is %s\n" , operandname( mode ) );
286 * indirect call: call through pointer
287 * either *d(r) as a parameter or local
288 * (r) as a return value
289 * *f as a global pointer
290 * [are there others that we miss?,
291 * e.g. arrays of pointers to functions???]
293 addarc( parentp , &indirectchild , (long) 0 );
294 length += operandlength( instructp + length );
300 * regular pc relative addressing
301 * check that this is the address of
304 destpc = reladdr( instructp+length )
305 - (unsigned long) textspace;
306 if ( destpc >= s_lowpc && destpc <= s_highpc ) {
307 childp = nllookup( destpc );
309 if ( debug & CALLDEBUG ) {
310 printf( "[findcall]\tdestpc 0x%x" , destpc );
311 printf( " childp->name %s" , childp -> name );
312 printf( " childp->value 0x%x\n" ,
316 if ( childp -> value == destpc ) {
320 addarc( parentp , childp , (long) 0 );
321 length += operandlength( instructp + length );
328 * it looked like a callf,
329 * but it wasn't to anywhere.
335 * something funny going on.
338 if ( debug & CALLDEBUG ) {
339 printf( "[findcall]\tbut it's a botch\n" );