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
[] = "@(#)tahoe.c 1.5 (Berkeley) 6/1/90";
27 * a namelist entry to be the child of indirect callf
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 */
51 iscall (unsigned char *ip
) {
52 if (*ip
== 0xeb || *ip
== 0x9a)
57 findcall( parentp
, p_lowpc
, p_highpc
)
59 unsigned long p_lowpc
;
60 unsigned long p_highpc
;
62 unsigned char *instructp
;
67 if ( textspace
== 0 ) {
70 if ( p_lowpc
< s_lowpc
) {
73 if ( p_highpc
> s_highpc
) {
77 if ( debug
& CALLDEBUG
) {
78 printf( "[findcall] %s: 0x%x to 0x%x\n" ,
79 parentp
-> name
, p_lowpc
, p_highpc
);
82 for ( instructp
= textspace
+ p_lowpc
;
83 instructp
< textspace
+ p_highpc
;
84 instructp
+= length
) {
86 if ( iscall (instructp
) ) {
88 if ( debug
& CALLDEBUG
) {
89 printf( "[findcall]\t0x%x:callf" , instructp
- textspace
);
94 * regular pc relative addressing
95 * check that this is the address of
98 destpc
= ( (unsigned long)instructp
+ 5 - (unsigned long) textspace
);
99 if ( destpc
>= s_lowpc
&& destpc
<= s_highpc
) {
100 childp
= nllookup( destpc
);
102 if ( debug
& CALLDEBUG
) {
103 printf( "[findcall]\tdestpc 0x%x" , destpc
);
104 printf( " childp->name %s" , childp
-> name
);
105 printf( " childp->value 0x%x\n" ,
109 if ( childp
-> value
== destpc
) {
113 addarc( parentp
, childp
, (long) 0 );
114 length
+= 4; /* constant lengths */
121 * it looked like a callf,
122 * but it wasn't to anywhere.
126 * something funny going on.
129 if ( debug
& CALLDEBUG
) {
130 printf( "[findcall]\tbut it's a botch\n" );
This page took 0.032772 seconds and 5 git commands to generate.