mips.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /*
  2. * Copyright (c) 1983, 1993, 1998
  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 "gprof.h"
  30. #include "search_list.h"
  31. #include "source.h"
  32. #include "symtab.h"
  33. #include "cg_arcs.h"
  34. #include "corefile.h"
  35. #include "hist.h"
  36. static Sym indirect_child;
  37. void mips_find_call (Sym *, bfd_vma, bfd_vma);
  38. void
  39. mips_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc)
  40. {
  41. bfd_vma pc, dest_pc;
  42. unsigned int op;
  43. int offset;
  44. Sym *child;
  45. static bool inited = false;
  46. if (!inited)
  47. {
  48. inited = true;
  49. sym_init (&indirect_child);
  50. indirect_child.name = _("<indirect child>");
  51. indirect_child.cg.prop.fract = 1.0;
  52. indirect_child.cg.cyc.head = &indirect_child;
  53. }
  54. DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"),
  55. parent->name, (unsigned long) p_lowpc,
  56. (unsigned long) p_highpc));
  57. for (pc = p_lowpc; pc < p_highpc; pc += 4)
  58. {
  59. op = bfd_get_32 (core_bfd, ((unsigned char *)core_text_space
  60. + pc - core_text_sect->vma));
  61. if ((op & 0xfc000000) == 0x0c000000)
  62. {
  63. /* This is a "jal" instruction. Check that the destination
  64. is the address of a function. */
  65. DBG (CALLDEBUG,
  66. printf (_("[find_call] 0x%lx: jal"), (unsigned long) pc));
  67. offset = (op & 0x03ffffff) << 2;
  68. dest_pc = (pc & ~(bfd_vma) 0xfffffff) | offset;
  69. if (hist_check_address (dest_pc))
  70. {
  71. child = sym_lookup (&symtab, dest_pc);
  72. if (child)
  73. {
  74. DBG (CALLDEBUG,
  75. printf (" 0x%lx\t; name=%s, addr=0x%lx",
  76. (unsigned long) dest_pc, child->name,
  77. (unsigned long) child->addr));
  78. if (child->addr == dest_pc)
  79. {
  80. DBG (CALLDEBUG, printf ("\n"));
  81. /* a hit: */
  82. arc_add (parent, child, (unsigned long) 0);
  83. continue;
  84. }
  85. }
  86. }
  87. /* Something funny going on. */
  88. DBG (CALLDEBUG, printf ("\tbut it's a botch\n"));
  89. }
  90. else if ((op & 0xfc00f83f) == 0x0000f809)
  91. {
  92. /* This is a "jalr" instruction (indirect call). */
  93. DBG (CALLDEBUG,
  94. printf (_("[find_call] 0x%lx: jalr\n"), (unsigned long) pc));
  95. arc_add (parent, &indirect_child, (unsigned long) 0);
  96. }
  97. }
  98. }