| 1 | /*
|
|---|
| 2 | * Copyright (c) 1983, 1993
|
|---|
| 3 | * The Regents of the University of California. All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 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. Neither the name of the University nor the names of its contributors
|
|---|
| 14 | * may be used to endorse or promote products derived from this software
|
|---|
| 15 | * without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 27 | * SUCH DAMAGE.
|
|---|
| 28 | */
|
|---|
| 29 | #include "libiberty.h"
|
|---|
| 30 | #include "gprof.h"
|
|---|
| 31 | #include "search_list.h"
|
|---|
| 32 | #include "source.h"
|
|---|
| 33 | #include "symtab.h"
|
|---|
| 34 | #include "cg_arcs.h"
|
|---|
| 35 | #include "cg_dfn.h"
|
|---|
| 36 | #include "utils.h"
|
|---|
| 37 |
|
|---|
| 38 | #define DFN_INCR_DEPTH (128)
|
|---|
| 39 |
|
|---|
| 40 | typedef struct
|
|---|
| 41 | {
|
|---|
| 42 | Sym *sym;
|
|---|
| 43 | int cycle_top;
|
|---|
| 44 | }
|
|---|
| 45 | DFN_Stack;
|
|---|
| 46 |
|
|---|
| 47 | static bfd_boolean is_numbered PARAMS ((Sym *));
|
|---|
| 48 | static bfd_boolean is_busy PARAMS ((Sym *));
|
|---|
| 49 | static void find_cycle PARAMS ((Sym *));
|
|---|
| 50 | static void pre_visit PARAMS ((Sym *));
|
|---|
| 51 | static void post_visit PARAMS ((Sym *));
|
|---|
| 52 |
|
|---|
| 53 | DFN_Stack *dfn_stack = NULL;
|
|---|
| 54 | int dfn_maxdepth = 0;
|
|---|
| 55 | int dfn_depth = 0;
|
|---|
| 56 | int dfn_counter = DFN_NAN;
|
|---|
| 57 |
|
|---|
| 58 |
|
|---|
| 59 | /*
|
|---|
| 60 | * Is CHILD already numbered?
|
|---|
| 61 | */
|
|---|
| 62 | static bfd_boolean
|
|---|
| 63 | is_numbered (child)
|
|---|
| 64 | Sym *child;
|
|---|
| 65 | {
|
|---|
| 66 | return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
|
|---|
| 67 | }
|
|---|
| 68 |
|
|---|
| 69 |
|
|---|
| 70 | /*
|
|---|
| 71 | * Is CHILD already busy?
|
|---|
| 72 | */
|
|---|
| 73 | static bfd_boolean
|
|---|
| 74 | is_busy (child)
|
|---|
| 75 | Sym *child;
|
|---|
| 76 | {
|
|---|
| 77 | if (child->cg.top_order == DFN_NAN)
|
|---|
| 78 | {
|
|---|
| 79 | return FALSE;
|
|---|
| 80 | }
|
|---|
| 81 | return TRUE;
|
|---|
| 82 | }
|
|---|
| 83 |
|
|---|
| 84 |
|
|---|
| 85 | /*
|
|---|
| 86 | * CHILD is part of a cycle. Find the top caller into this cycle
|
|---|
| 87 | * that is not part of the cycle and make all functions in cycle
|
|---|
| 88 | * members of that cycle (top caller == caller with smallest
|
|---|
| 89 | * depth-first number).
|
|---|
|
|---|
